From 44c788dde1bbef51ead485db7ff9e7fb3061b9e8 Mon Sep 17 00:00:00 2001 From: Cormac Shannon Date: Fri, 11 Apr 2025 21:58:02 +0100 Subject: [PATCH] Add Lua 5.1 source files and documentation, including core libraries, interpreter, and test scripts. --- ref/lua-5.1.tar.gz | Bin 0 -> 206877 bytes ref/lua-5.1/COPYRIGHT | 34 + ref/lua-5.1/HISTORY | 183 + ref/lua-5.1/INSTALL | 96 + ref/lua-5.1/MANIFEST | 108 + ref/lua-5.1/Makefile | 126 + ref/lua-5.1/README | 37 + ref/lua-5.1/doc/contents.html | 405 ++ ref/lua-5.1/doc/logo.gif | Bin 0 -> 4232 bytes ref/lua-5.1/doc/lua.1 | 163 + ref/lua-5.1/doc/lua.css | 15 + ref/lua-5.1/doc/lua.html | 172 + ref/lua-5.1/doc/luac.1 | 136 + ref/lua-5.1/doc/luac.html | 145 + ref/lua-5.1/doc/manual.html | 6247 ++++++++++++++++++++++++++++ ref/lua-5.1/doc/readme.html | 32 + ref/lua-5.1/etc/Makefile | 44 + ref/lua-5.1/etc/README | 36 + ref/lua-5.1/etc/all.c | 38 + ref/lua-5.1/etc/lua.hpp | 9 + ref/lua-5.1/etc/lua.ico | Bin 0 -> 1078 bytes ref/lua-5.1/etc/lua.pc | 27 + ref/lua-5.1/etc/luavs.bat | 7 + ref/lua-5.1/etc/min.c | 39 + ref/lua-5.1/etc/noparser.c | 50 + ref/lua-5.1/etc/strict.lua | 34 + ref/lua-5.1/src/Makefile | 178 + ref/lua-5.1/src/lapi.c | 1077 +++++ ref/lua-5.1/src/lapi.h | 16 + ref/lua-5.1/src/lauxlib.c | 647 +++ ref/lua-5.1/src/lauxlib.h | 172 + ref/lua-5.1/src/lbaselib.c | 643 +++ ref/lua-5.1/src/lcode.c | 825 ++++ ref/lua-5.1/src/lcode.h | 77 + ref/lua-5.1/src/ldblib.c | 397 ++ ref/lua-5.1/src/ldebug.c | 620 +++ ref/lua-5.1/src/ldebug.h | 33 + ref/lua-5.1/src/ldo.c | 515 +++ ref/lua-5.1/src/ldo.h | 57 + ref/lua-5.1/src/ldump.c | 164 + ref/lua-5.1/src/lfunc.c | 174 + ref/lua-5.1/src/lfunc.h | 34 + ref/lua-5.1/src/lgc.c | 707 ++++ ref/lua-5.1/src/lgc.h | 110 + ref/lua-5.1/src/linit.c | 38 + ref/lua-5.1/src/liolib.c | 532 +++ ref/lua-5.1/src/llex.c | 460 ++ ref/lua-5.1/src/llex.h | 81 + ref/lua-5.1/src/llimits.h | 128 + ref/lua-5.1/src/lmathlib.c | 263 ++ ref/lua-5.1/src/lmem.c | 86 + ref/lua-5.1/src/lmem.h | 49 + ref/lua-5.1/src/loadlib.c | 667 +++ ref/lua-5.1/src/lobject.c | 214 + ref/lua-5.1/src/lobject.h | 381 ++ ref/lua-5.1/src/lopcodes.c | 102 + ref/lua-5.1/src/lopcodes.h | 268 ++ ref/lua-5.1/src/loslib.c | 238 ++ ref/lua-5.1/src/lparser.c | 1336 ++++++ ref/lua-5.1/src/lparser.h | 83 + ref/lua-5.1/src/lstate.c | 214 + ref/lua-5.1/src/lstate.h | 168 + ref/lua-5.1/src/lstring.c | 111 + ref/lua-5.1/src/lstring.h | 31 + ref/lua-5.1/src/lstrlib.c | 863 ++++ ref/lua-5.1/src/ltable.c | 588 +++ ref/lua-5.1/src/ltable.h | 40 + ref/lua-5.1/src/ltablib.c | 278 ++ ref/lua-5.1/src/ltm.c | 75 + ref/lua-5.1/src/ltm.h | 54 + ref/lua-5.1/src/lua.c | 377 ++ ref/lua-5.1/src/lua.h | 384 ++ ref/lua-5.1/src/luac.c | 196 + ref/lua-5.1/src/luaconf.h | 736 ++++ ref/lua-5.1/src/lualib.h | 53 + ref/lua-5.1/src/lundump.c | 223 + ref/lua-5.1/src/lundump.h | 36 + ref/lua-5.1/src/lvm.c | 762 ++++ ref/lua-5.1/src/lvm.h | 36 + ref/lua-5.1/src/lzio.c | 82 + ref/lua-5.1/src/lzio.h | 67 + ref/lua-5.1/src/print.c | 224 + ref/lua-5.1/test/README | 26 + ref/lua-5.1/test/bisect.lua | 27 + ref/lua-5.1/test/cf.lua | 16 + ref/lua-5.1/test/echo.lua | 5 + ref/lua-5.1/test/env.lua | 7 + ref/lua-5.1/test/factorial.lua | 32 + ref/lua-5.1/test/fib.lua | 40 + ref/lua-5.1/test/fibfor.lua | 13 + ref/lua-5.1/test/globals.lua | 13 + ref/lua-5.1/test/hello.lua | 3 + ref/lua-5.1/test/life.lua | 111 + ref/lua-5.1/test/luac.lua | 7 + ref/lua-5.1/test/printf.lua | 7 + ref/lua-5.1/test/readonly.lua | 12 + ref/lua-5.1/test/sieve.lua | 29 + ref/lua-5.1/test/sort.lua | 66 + ref/lua-5.1/test/table.lua | 12 + ref/lua-5.1/test/trace-calls.lua | 32 + ref/lua-5.1/test/trace-globals.lua | 38 + ref/lua-5.1/test/xd.lua | 14 + 102 files changed, 25663 insertions(+) create mode 100644 ref/lua-5.1.tar.gz create mode 100644 ref/lua-5.1/COPYRIGHT create mode 100644 ref/lua-5.1/HISTORY create mode 100644 ref/lua-5.1/INSTALL create mode 100644 ref/lua-5.1/MANIFEST create mode 100644 ref/lua-5.1/Makefile create mode 100644 ref/lua-5.1/README create mode 100644 ref/lua-5.1/doc/contents.html create mode 100644 ref/lua-5.1/doc/logo.gif create mode 100644 ref/lua-5.1/doc/lua.1 create mode 100644 ref/lua-5.1/doc/lua.css create mode 100644 ref/lua-5.1/doc/lua.html create mode 100644 ref/lua-5.1/doc/luac.1 create mode 100644 ref/lua-5.1/doc/luac.html create mode 100644 ref/lua-5.1/doc/manual.html create mode 100644 ref/lua-5.1/doc/readme.html create mode 100644 ref/lua-5.1/etc/Makefile create mode 100644 ref/lua-5.1/etc/README create mode 100644 ref/lua-5.1/etc/all.c create mode 100644 ref/lua-5.1/etc/lua.hpp create mode 100644 ref/lua-5.1/etc/lua.ico create mode 100644 ref/lua-5.1/etc/lua.pc create mode 100644 ref/lua-5.1/etc/luavs.bat create mode 100644 ref/lua-5.1/etc/min.c create mode 100644 ref/lua-5.1/etc/noparser.c create mode 100644 ref/lua-5.1/etc/strict.lua create mode 100644 ref/lua-5.1/src/Makefile create mode 100644 ref/lua-5.1/src/lapi.c create mode 100644 ref/lua-5.1/src/lapi.h create mode 100644 ref/lua-5.1/src/lauxlib.c create mode 100644 ref/lua-5.1/src/lauxlib.h create mode 100644 ref/lua-5.1/src/lbaselib.c create mode 100644 ref/lua-5.1/src/lcode.c create mode 100644 ref/lua-5.1/src/lcode.h create mode 100644 ref/lua-5.1/src/ldblib.c create mode 100644 ref/lua-5.1/src/ldebug.c create mode 100644 ref/lua-5.1/src/ldebug.h create mode 100644 ref/lua-5.1/src/ldo.c create mode 100644 ref/lua-5.1/src/ldo.h create mode 100644 ref/lua-5.1/src/ldump.c create mode 100644 ref/lua-5.1/src/lfunc.c create mode 100644 ref/lua-5.1/src/lfunc.h create mode 100644 ref/lua-5.1/src/lgc.c create mode 100644 ref/lua-5.1/src/lgc.h create mode 100644 ref/lua-5.1/src/linit.c create mode 100644 ref/lua-5.1/src/liolib.c create mode 100644 ref/lua-5.1/src/llex.c create mode 100644 ref/lua-5.1/src/llex.h create mode 100644 ref/lua-5.1/src/llimits.h create mode 100644 ref/lua-5.1/src/lmathlib.c create mode 100644 ref/lua-5.1/src/lmem.c create mode 100644 ref/lua-5.1/src/lmem.h create mode 100644 ref/lua-5.1/src/loadlib.c create mode 100644 ref/lua-5.1/src/lobject.c create mode 100644 ref/lua-5.1/src/lobject.h create mode 100644 ref/lua-5.1/src/lopcodes.c create mode 100644 ref/lua-5.1/src/lopcodes.h create mode 100644 ref/lua-5.1/src/loslib.c create mode 100644 ref/lua-5.1/src/lparser.c create mode 100644 ref/lua-5.1/src/lparser.h create mode 100644 ref/lua-5.1/src/lstate.c create mode 100644 ref/lua-5.1/src/lstate.h create mode 100644 ref/lua-5.1/src/lstring.c create mode 100644 ref/lua-5.1/src/lstring.h create mode 100644 ref/lua-5.1/src/lstrlib.c create mode 100644 ref/lua-5.1/src/ltable.c create mode 100644 ref/lua-5.1/src/ltable.h create mode 100644 ref/lua-5.1/src/ltablib.c create mode 100644 ref/lua-5.1/src/ltm.c create mode 100644 ref/lua-5.1/src/ltm.h create mode 100644 ref/lua-5.1/src/lua.c create mode 100644 ref/lua-5.1/src/lua.h create mode 100644 ref/lua-5.1/src/luac.c create mode 100644 ref/lua-5.1/src/luaconf.h create mode 100644 ref/lua-5.1/src/lualib.h create mode 100644 ref/lua-5.1/src/lundump.c create mode 100644 ref/lua-5.1/src/lundump.h create mode 100644 ref/lua-5.1/src/lvm.c create mode 100644 ref/lua-5.1/src/lvm.h create mode 100644 ref/lua-5.1/src/lzio.c create mode 100644 ref/lua-5.1/src/lzio.h create mode 100644 ref/lua-5.1/src/print.c create mode 100644 ref/lua-5.1/test/README create mode 100644 ref/lua-5.1/test/bisect.lua create mode 100644 ref/lua-5.1/test/cf.lua create mode 100644 ref/lua-5.1/test/echo.lua create mode 100644 ref/lua-5.1/test/env.lua create mode 100644 ref/lua-5.1/test/factorial.lua create mode 100644 ref/lua-5.1/test/fib.lua create mode 100644 ref/lua-5.1/test/fibfor.lua create mode 100644 ref/lua-5.1/test/globals.lua create mode 100644 ref/lua-5.1/test/hello.lua create mode 100644 ref/lua-5.1/test/life.lua create mode 100644 ref/lua-5.1/test/luac.lua create mode 100644 ref/lua-5.1/test/printf.lua create mode 100644 ref/lua-5.1/test/readonly.lua create mode 100644 ref/lua-5.1/test/sieve.lua create mode 100644 ref/lua-5.1/test/sort.lua create mode 100644 ref/lua-5.1/test/table.lua create mode 100644 ref/lua-5.1/test/trace-calls.lua create mode 100644 ref/lua-5.1/test/trace-globals.lua create mode 100644 ref/lua-5.1/test/xd.lua diff --git a/ref/lua-5.1.tar.gz b/ref/lua-5.1.tar.gz new file mode 100644 index 0000000000000000000000000000000000000000..3f8d5a84a38423829765512118bbf26c500b0c06 GIT binary patch literal 206877 zcmV)HK)t^oiwFQJ)cHdI1MFH0bQD#ZZXz(DWD)criojeNG(kI^?j)UP5+Zq$){w+b ze4waQs;fIC)m2SZbwV>D;SoTYfe6bujDUc!J2nq3j9G}~p>o|p%$5Y@b^7-J?lLvqJ z=`Hek@YA{+UQd2eVZJZVyI^{^7gZdkWU@cs-uNf`aeTf03skANB7m z@_F;}^9o^np3ht8Af8jeORwu6T>tJVPBPXXEGDS@2(P%>h}Z4)5>QlOuE(3}DJ0&) zVo!c?egOdyk?I*yGL~~U*OIzx%ZZmb$5!!%Se$nJSSROhswMU1ld3r&Pp0IMI{1(j zL)4<02>YECOFA)HMFM(Nf;qgbDq_!N-JIVbvdRZ_0%M3cLlk0$sMBFlO$9wibQdQ| zKt_Xk#1Ll~Fi-Ku=I3QArkqq(xGAEl%IMx$MTCZzNcN*F>Vm zjA+atEpgyCfD8-7#UaDEx;aI2kF$0o@Cs=WNlXViJWwDlydkvOcSHBU%eu-Q@`53? ziE`Y{x$7FaW*{7fd&Mr)Y+V$AsI0b+|hdkqRFXgH%XBhJemO$eS+W zZ7d=xh7RIV3?63cQCj z9#dflTy_g+M}e>Ko;TrUm zGc0F|b+pSY4W9$YCnM;B6WnTwF?!hXE0cq}2Oydq{#>1J67osKO`+0Ey_r z!mqY)3QLPcnTO#LXlkHW9tD|p6|@6bNI(O$FH+3$K{}hK z7FLo)I5Tuaq+n2{(ST3o7j9!3;{{$KQ93_`ESD|L5JVJ>qDw&_7L!2)C~7PCqk_=w z(d0_ZC?A2!41Gk9Rm^?jjHoOLk|D>(*_B0|LbtpkK(fYXk))}j&6vv2lg>_ko0m-| zm;qr;*Qtk@n}zt!W9Ze)7(g}XCe1xYTMX)A6ta!M5&{igIt#;5O^T!%hCSZU8#Cdh z1g%>e0}YcJ&6s7h!ZbF8Nt;T{?nsml1T`L{YFi2m2Cx+=0%2N{<7OO6W2`5_Qy!t_ zhxP+0RtbxAg6WkmP8SU`K5HPQC@h7>U=c!NwKjlj#i5!4GAd+@WWWllEba0ktZW3( zl9d+hWg{l~-Z_n>ZmLAsm%xJ&!5WZU+C($n3gCsIm`u&Z%<4?Y)+Q|W5*eCjwM7X@ z2%OT4@Th7f1X51c08q3w_tFLPd}kSPQY&|s!8bQ8T^nfC3T1C|Biibe91aUAdpVUZ zpwb!;lMY%rj~aAw7_3riKPX-?tsYlUcAE_NfdgQay0_EHw@GJbl>*!mrYuEdS&T}N zmUQ^eOtT5`vBJz{%G$*pZ-wSgN=4#C+*+@sz)U2yBDE#X#GYi>6DDXUht@m zq>0&Ctj5V2mncT)d|Hkr>mqRGcvQm4aaM){qf}F})S}V4-o|Yk2L)w27CIOtfN2cq zJSJGCbZ1j_H7T!aYH%jY|7=J&wP8VtqqXv%j*5 ztER~y0x^gWLm*35uevCQXprO;9ty)aTdw@t=Gulp6Blq3zo^A@UX~)d&F^(+2LMEFvbS0Kcj7*R1^lGoD2VhJ z8n5UwkHx=*?vQp(GK^$vY{NPtnExS)hGP(6q5j3n!9;d|qRz?_6O}=tT6!GB0$(Du zg9x_qkP*YI^h|(8w9;seDbr|?P|Ss(#W(4}D;KsqV0M^~Ea*wV#7FxaUJ#&`2BI?U zgv@$OXE9t2g>qPV%*t?~RTQQH8OBzlCgvm=NVGc=bPBLZ#)Fv&RRvO`z+;&M+n|z7 z@Czk$JJ!_+n2X6O4lDzgx`{Br2d-ihjHxZ1tp{mUZAYm>m2aEO>NTBjqjb%Z2m1?C z<_Z3KZVATQSj2rPqJZgAlVCMH0_(waP@AFqU8p!51i5fh9SCG*Zc#6`55`Cj`x*NU;~PuuaN1?fBhXMcgW88A53%2r@_l zbToLtTj*J^1dp4=e4(1C_G|O7A_(EUKyZ1*K3()UXGpJqM12A`f&rjz9%w zV9}?$Snx=wqZdWC`7}@sLux3P#vi2%u&IoC{c!?4Ty~;yK*h6emv-$5)Wg3EIKymy4iv?)u5DxjEwP`bIq{ap} zm!00$Q6LHXX5?8M!RQToPIwg4ml_32=rP{hQ(u6&;bb#=f1Qd`{P>>3yiLaTnOKQyY8=I*_S(ne&!%YTNIy)>XB3c!MvbcRk zH+L=eoam!6{c)*hPNzu$pF@3Pq>p#S9HzNg6kVAuOdT9-wgvJ~Jh?W7>vZO8Ob%d^ z;4o&UkBS=81CRMyQ)6NFLsS^H9H;A3b)|{76_)W+4MurgrPFUT7h z!Q>AsVF(91tw(&-tno|_vdSP_vXz%jNvkkELY-96Rk;nbI#}PyJ0VJ=rxVtz$$p=L z{Rwp0gs!MzCS)r1P>IdIOX<0|}Dp(LTW4mutE zMMs9rAttgU1>r)LEvbSK)0jnRF-0-aVPqp}*+=r{I1}qmY!}_uj>Oa5#$-8#cbbc0 zdW-@zLDkLGAY86sgb=`vXdSG?A}xqDp^Rx8fssm91sl$3d4Gz;js@q``0J`Ef=9f* z6lGcCbs3%t0xFP>!eVJId&ZU4 z`RlJHf$F;PPThz@bZHeu!%3PaH&%~#V%e4}=(>~C2C8euJCP5(g=x8rG*?>DP&JuU zOss6EYY2>Yj;W!S6W`S4l_9zWL-We$A*0@BjBt#FF|l!_6=g8AG`FIRyNN6Hmzj-G zX|BJF9yo$W4Ev`~=slifG2h=zDcS(2UPOO1Cy*G=0y3TU43ce6f5kbZ(#A5|v7jFE zKKZjqsaiVrc_h0Qd!0#2C3YO=l0Y;-4Mp=KJeiba{y0x3Wu?gH1dk`N)!Ygb)(IX^ zN?G{(J)&e+A=>E4A5yaU$%!9Sg2~poBj$+5KC0AXO3&j;Srb5N7Gh2nW*&*?@%Yr7 zSwc~!IkN;jXXRv3c8}}W5*=?&IQqFIT<}=umVlZwr;X%DPD@}Xe{zY^>Pg3BBi-R8 zn{}Kyz;wC}FroRBFzfj-onb<@$7dxHvSK%$AJs`F;M+Vjln82n1813%T;;L2f95pP z$(&}oBy5ye2b%CZyLZ#V*o4i^qPUS3#yQk}f1u+{77rppF0h^e=cnnf_aP_S+jPgA z%-4h^&+qG~lf|IK3W%efcIs90rlwt_B3s)`WO;h-30|4Up73>cmTf?~^G_)Y9nT3U zYxy=-RemRGM!PW+1G6_yv2uP`saFrVW89?zNhe>$#- z{+i2+_zp*h<4e5N9F8`JW2VC~>nA_CW59sfs;W+(KE182ZRX6GvuDrl)2E|v-#M9? z^Ugkd{-8l~&pD@a(4YlFhIF2P{=y+c77ZPG*M%3}HGKHbM~+-Pa^x>Yk6v=|#Y>&e zu8S|ed)&BXF4uCO?;fvrh0nLr>-|-6@vn=ES6zAK>WYf{s;bshRIIJ8UU$`1_t(~L zsH?kw(xi=zjsM!*{4dvB^PB6h|Lx?-58Qa;gHxvb_Lf^VPo26&5VnTHTP5k?+irVU zRUen-N2X7IyshmC!`K#&Kk>7lZJ#~+sXOl2K6mci&d$z7ixw?evZSl4YsHEc_uhN& z>eZ_|I-Xj$Zr#R>8#is*w0ZO9haZ0U@y8$Ewr$(??c3+g+qrPz(|6vvYw_Y|mn`{1 zS6BD4WxH3b*t>G&b1PRqf8TvCu3Puw`t>hu-1zdQO|NX)^y=o#uW#A%?_0OR-~LA* zedCEI4m|nffnB?Hb$55~-Mjbs=bzuP<4-TY{PJtBy|#b<{sRXN?A-ZQclSHp-G}z< zIkb20yDz-(-oAbBzw*k5uf2A7|Nf8Oc;n9p4jg&=?YG~3_uaSN`tQSs4<9*l|NHjaZ+~b*`g^!s z_z!)-k@<}yYru%wht}?#mwDc$Q+7YJZr8%WW3F0NyLJ7ui!aE(?akd=@9$npD(@QM z|J{Z?%d?vvn6l@08=t$!BkWz}KX2WJdzVLFf8>HYuUS{TAanTeXR-rV`AaSuKC*V= zoTk1_nKk8&8+PAaK5EFy(OPByL6_Y&d_dK&A6Yx5xM>-gTzuz{5#^l&w?@8hsvlZ& z)=2NlK-m4v_&k!CIpJ3ib#NsaD}1~AmY+LLcNZ_4`^>l%i@MqdW_qUfnfKy-!(=78 z@xd`*_*(GQ{)4Kj#$?PGwQuEPAG|QI@Trc1{Bu{0scWu@FK@hip<`S1Wm|6kquwzz z@4yAu4DL5=Z}xzn|NfJbP5u6--*daZSr{I?W8w?x941P#rpXphJCnU-=yHAs@k(2nUwvX3o}}~gvphI z#_k!jXvDd@M=vT39J*o1=ln%;%I>&)LcgVh{as`4=o&qL;Mi#6oU{Jv_V*_A8_`AP z4Ho{_duVy)S6+U_sFn)@L;ubH&+m+$x_j_cJ|lDAJ8S0*`orY@c^%VtPb;k-Flu!M zw{Pd_{)3BNa!%c_&%r;|*?-OAw>k?u)(zb7ai_E9(pUQ|&ZzjyCdW7XW>r1gr=YCr zmp?6O9Ne*XP1}11SM8luc$?$g58mqj#q#~0Kh5fTz2+7vdSg|0pS!CMEgaZ4`bF!~ zKjvM=&tIxtQu$ME-OdMQ8SaUWZKJAN4piQCsO!HR18;xB^?Utb;bF%WWLab8`;TRl zxaY~L*N2@Oy>83>A7*@XI5gPkb8&envunhzjA1+6SJ#eQKlkYiu5>-L@CD_Ub6c)( zuGn?^pxlXT&L6pT!NKy{m3M#qwDbKp56)UMfRtZ2X33*Zx4-$9;;5r!M&Hhik9=e2 zul-`lgZhfF;;WdwS{mlA9biwD;}q6T5ta@1@aKZ+@&}&7AAD%sTY!j+@GF z9{c8|-^>%E3%;4yNurZ0m#&)d*&Fj;d4HO+Afx!A$f1?wx(DvM;ia9SjyzH^Z1T*i zh3DlD`z&*SYnXecKJSXgia}LVKAAUggd8e}J6#p}Ple$Bvv=NcO>k400$-zrh|wKw}g;DG$A1&0xBA&NYzHEw%V$Id(`4;Yg-kpwc5A(f}_>0 zA6jecXkWGJ&uTyRz31GUrInoY)AfE@{>XjK^?c9X_j!&*HN6x8g4?O4ms@Ur+x&bl zq3iSq(@g&JuCxmmzeN|uUETia-IebD+A=!wWHZN<@L@EUmh2{O=soA-=*0Ql^wAy* z%TKRkG$K3D>x4yR(qbJEtek-9$(44r(b@|?ZJwG{!PB~ zJ13sQk`Ji6<#ZFtnCS|v>E^X2-^vr7i5@F3&R{XuCuhJd@!Sn}^4fjtTd-?!p;0yO zQYaof>bwTj1<_`zY93$Mm`;~$-kMU-wD7K*klj~D3(WE7x)r#@-xnH1l#V19-V0^k zlV5f7R#RvXI^#ZXjabTTRh`7q_XAwj`QLIq*0&xo^;q?Vj$Ivk$o>K(nfRwqvN z*vO5n%HJHi_ikxJyNLR8jB#{-IX7qW#+2KUBgQb46Q_^r(L3kEpgX0Pw)Pj*OAc&5 zyXel{?Ap&UpUbWpe(9@XK09_j-lL+rf8S%YT@h<9&5Jp(`*IRB_d@!QjOMyN5qCD# z`cvXZl(0wmw{CH*5HoT=6vWS@a2B<@(CY7J-k>+q6x)17R8e*H7h5Wu_ZSu3E;IeB z&-rRYsnQ-D0ZH^>SPuK~30^?^zmHxttoC5ONY52k4>wBPM+Z>KCSUMld>i7M(2^0q zqw}K~x*OS7mVD>0_*Y`fhvy4wC|-v?P8>0pM`LA{Cikn{Xo?It5Yw?LSiLzgvh_@4 zM&bO=?s;sltr?|g8uF^RPwm=-3p+{<2k#7?`Y3t*yK8&6b?)l$AK*3qz0DCZ)JMT zG2VQw=u~vSu{o>N(}Y-OfI6q6$k#1ySLNd)-M$)rbefv-fi8dW%tM#Y3@$46cR$qR zA?Th@3w)%yw{PJ3JFJWSKAAD{_Nv5N)B)PI?#ZJ19(w|eRXeH=ym;u;$r-D3tUdjY zSLRlDKg^lv(p}Vb_;vO{0=nVL5IsK=PnHs-rb>{wMm~y-DEqGzhnyF=V3>5H z@dsau_#7P*VxMub0i8Qd~qUYpEejTov84=fNyq=d-Cze(xc(dl3#8;(W3w@}M z(kVw6thZf?sV2rZw_Qf@0(!G)cdES@-r4&_s^CkN-m9nWF(~%>QzV1f3tJc^rkHFY zjoMa9Z7oS&!JOO5m~Vn7a?uUdyEZn1Ef`jlUnC{RM5T>PZ&NZ zwdTySFCQ%PsOsORlk%L8_bzULH{ZKkBV}MK<(1s9{r;4Jjg-k-DKi$c(4$|S7yQt0{(Sg`d*PC6oUz75Kk-@Fp{tG= z623nlIJ71+FmM>FWsxwl!ux*c*>j0aT&(y+g6EpFfh%ZZ+u6xYbcv_1{L0L3Yv{8N z(2_&Bc;s^a@H(Zl>qS zRS}}y%+6uU2wk#w z3cKdkx`C^%SQS#&#utQi+mHYEsr=Xi6mHFF;-Es>BzMZ)jYN~XKgTtHT%ac zE*%VJ4oxH6yoKhPAW54$bVa%en^#-Q&6LpGeCUS0+g#e1TWh$Jg!JvlwsrTVr*tyX zhH`2o^h*iby+y8RIW(4*HvJ)c1$&1Zj$GgF9mbqLf?Z{#jbqa%8Mib@Tr-9Ai7m7N z*XO0TGuC{#!!Lp^X{9BZau(OWG=aVA=%>3*Kit*c_q8+EITQ*u@=xCR{cZoAvj6@a z6o4J+|3*YTdH*9nBI=*}|Nf9aJN;jD1Mn^tfaCvE4Pcqi6E^10(*Kn`Ljl-lnysFk zS?jk8onM))((hlx`rNE?`xmo52g#Dy#{WkfpW9a0Z)SjQm#g2+{=7@`b8~$^%lzCn z-@mO1I;rdyCp9?#Tw8Q=lm9IZ(a8aWv~edp zOIL>Jpd_AB#}O(n5J8k9%$_+&RV8FG0^{s*6FanJ*j5*Y!h{hR+w$) z{7YM@+ZHupB>P0yex|j$IjV=RbD(jK5(VU7!C%2n1mQ;`}E}5FQ2oJuD(3^q>3x{*b?C>i^=60$;e= zYqa_VTZZ)iQH@}8&aAq+<6+J$%E6>oYF9DJG}6J3<0Asw8sHgh3-of`TzD#BR)&RHhJ#nUrJUio`jpPHUy(s6o5PEp z2p)tbE-`RQp72Q29GTP%jrM76UmG8OVZ7Kdyp~f6i{Vaz(EaWT2@!VMdu&u1AWQjGKr( zUL)7ZESVhc0ObRa4&}99Cqo6`5 z!dQVLM4`cAgJXugFu%CK618JqK=7aefFoCV9vH+OV^IVKsyhRod*aE~!xoE_-)I7l zeyZ6yMq>yx#ugO=yMCn;O%3K6&Eh6XY_%ddGo7C@d6C1EDyUB-Q2OlLuZgDwW)3;&C*OgpyN9DC|vSD8bfH zU>5NHRiMd3NDk4lz!MKF8*I}vY;y0Yn!<>r5EF||11u@gP`o$t$sQrn0vmB+ODG|4 zJV^n^1PZAPWoqSv^5Db50Kws7qHIpr`R0R6^I?vmZ=XrZc@DZ1AB-P-IC@C*azmab zIEA=Y!x0t%FgR@Z#N&HZ$I}HLj2L`4UZl(Om3W^ma|8$gAb6_HgKd7iBQ^@KQ8s<` zsnx}^*=WEs4P6%-oXUua%+h7Rnp~+hs1T+UIFS+4*m!)w z>TsNbQ&%LpB7?T^&cp=@h?u(I9O4Wr04Qjb%;85Cyjs(U zlbA%Q49o{g$2pG%VSx5Y%(fu&lgjk?iphyEVn7%%c5U3Qg?8P*@InxfU*{)T@5bsn zPT~d-X)!N0rO^C!i%hKb8zsIJms4(^9D(tWZ-<5H3);M-q~7HoAh#6H<6;*8|cJbvUL@FJOS z4O3xm0=!te)_{k~x7ml@SeA$?Lx+63G;DLH1qDXb1J zaN_CMzl@k{^NG2a7i;fE;mM94LVU3XA=tlhCJcN^F{tgrAl^6?264n|7YOmnnNYx0 z5eB_&AjBJI!YI*6wYDJuw=;a1Qm)Fg4FJAy90ELB4}rhDSQ`f_nJ+I^$P4G1S<>kQ zU7*p-v7v#}2^t)4+t9%21PxErZE)yzf>)bY%{F0J-Z>GDj$HBB1f#QA1R;iE(84Qm zYyu(QpoXEhuS>mib*Z{ugRP|0`-k|5Q2Zoi4{>9ljFGmC7t- zVR?ZNf(G8c9!oqO`-fkkc(L%|*f$7s1iYk*7i*OfIfcrgFCaN6BXaOsF_Kf6cS;Bx zxTb`}fQU%x@3cy6viVF95Fk%iyWNfOGAIm@VtJYL$5HqMPRN=*n^=Vl3s zA?w>LAu&)l2r^JYV#xMkmXH{rVgV5#pb>BxO)yYIqO_KXw8$|L?Uodfh+?&t==D|^ zjl*|*1cVDn1ld;25(1-@Ds`ZC;M1{xpf13R1;1#1iF}(SG={kCjGzeFF^BKO3PPm0 zcuvd`DkIZaAY4SH^vXgrg^Q>ZzF7)4V?cI-v%wH4nOvzNDIlU!8ZanWM0CmuAu@UL ze3HQ>L`Gh!B^g{oWE3h5m_n^GDyP=unK4{MrF7ObLK%@$qjH*jaQbSM(K#!H z$f%{IB!f$+jHRQfk^2c=+6ps-i-?p~Q$j+xgvjWm<|@{qjA*3K!aR-If&qt9B))9P zv!lTa#1QbY#@suBh)!7{RHg_V9auy}3Ll-!=>sARWZi%Cd{RucF!6s}?|A`(Sh zUJfZjM5N$;$R&@j-7JYDWyhQr-xo^ry@&O2)!H}3G-r! zCyIY^CyadBWPj4*+!+tCTL=LL4LE9bAd}#ZUkeEw$Yh>Dt+kNAflMltg?SbdIM7L` z`fFvO6PeCega7%%LK9AOT5rg;vbY18RDm70RYvDDC30)!Ko>G=pH=5_s*_tQ7MGpi zfReV{hJ|iq-nM|9DPMzDYg10p<(P#X4Bxx~B_Lj`tqYY^77|~ZY+a}gQSW^pR1WrTf?c)?Fp)lst46}s5z+)e@Gao~t79K^f@TE#CZHl%On5$E29}d}R?G6Up#P zg;{d!A1HX_gPOH*IHo3$&A}==X42*O!i{7I*)anZA_)YFj*0C5viI-ZZ5&s=Fg*WG ze~KPvJO*qKA}PsE#7OhVvg~LbS@x3X;Tf&pqmr zmRtYXqXsiH|L-1kR%T8;L_sWv=53Z)qA&K>CfPy$wZA;ek^0XbHOP#l|J+~Wf(hZG z2Msvc6r%5^=UhcT_NqzZq506S7TLq?r(X3ak%(5LkG*PMDog2Q#x@0~^>(=ls^T}j z>o1BX>>0l3Rh!J`=0mSqY^b%Ldet*xd;CqW`i3jWr(X5KKKu8FZax0rz3Qm(IQ+c7 zu82qe-#zLyle(Ul1>czZu}{tEd2rjBFZ$GuE8nK>9KvD%O=RZwUK$9#?9Qhh6P3BXddWP)yL$6wwWIwc@`qYaTwEtSpOE;-YAtL$Iqh2lJ+^?#E zQp@tX@q&tc>Q&DyrF`mF&n%{X>{T;dPV+^d+V3|~ZJ$aRO4XCU;FH(?dw(4xg7lO? zR>I6yeK^@_+gt{`#eC7P_H;^q-@dwh)3biaVuG*wwQz0^uKA*0?aE60=8Jx{6Fjc< zbrdQX0-OW`p^C9nrl}-_N>_=l&jv9;+3}cQ?Gic zxb^?;Tc@&>s$R7k)6-tHuP;~GN_~1lmqno)`P8Q#DQWz_`_x&@i>X$^4}EHp%dr3V z{yI(gc4_**T^jp#>80M5g8uE&^nSZE;oGI@|8{BY+ohM=CKojCfPU_pTrzqG^jG0? z>9FoC>d6(@^pxkDNS^QO3W{afDct{if1OPo+`0O(PtEAQG+*?o9o%;Mu}{t5e$tP9 zYT8?-pTd+%u5fr-kw5mS84k7oNbS8OpZe4b1pxoKM_p9$%D?)RC)2b2w7=ea&wAhY z6# zj*W7YRev4+*l zli^qWTksOs^V_LyU2!y1>py$c0BzF5-Ua@Pp0(Mj+%=fAuPFUhvQRKjEK;^5^sZ0w@(V ztW7@lsJUJG`Qg8N)VT)8O|FCgZi%mV&R*hwIm-LHow;wnT37j35NH>?WUFOzU~Q z4$%QG*N=0oZq0b5{FVF20WCVyGGdt+0FprWJv`L_C7{=0IyuKv0$BMj2~55;^|E*uFm z=;+GL1+xU~p3@Ex!s0_g2&G$HSsD%eAD~bl{v>}8O*MnL!A0=!;P?QS7dEktJctYH z2JoDK)Qe?azTW`UF+w%B6K1%@1rWP(2AI~(b_Hn;GD3(($mnS~+wwoPE`o@Funm=` z>k1zn*||cZU=ojF-qd*wmvfU})b&gnNAT);@|SYDIjq-JxdfPM)A}eAZClvu2q9dc z*TdNw5SHzagj)?s0RRJXMzfiefIdDWeEk(Tv7T?|qZ}3_lZ%PE! zfBfRrv-}B8_Q|K84#&8gUz7y>Z8lTJJ3?@n%L1{lm-U8$^o#reK*SGZ8V|B+L#ZpS z>-D<^M^-waZHBQ8FgQ%vaap@Nc{+z}fgA{PK=p=U`r?d)4Q*0Az$mA@AW{$-!QU7@ z8XJ}61f1<^c~!pyKxYA6a=XRxHLz7x=~x9P0|4Z1%Emxo>##1MG{hej!5OotVACRL zxg`vmhg=Rc9mjQ~VHh9bn#0fm@7wiiD$?3AGI+7Q;O&Ma2JU4*$r1|pmt#og*#NRLCE%lTSFnV=qg*F2uo>W5 zR1?gp;?{IJ-_9tDNCC7NFFQ{Dw=iuG+J1Wn|24|4FRSS#%-tvBVM<1ndzegKC|>)B z(D(_4h_W?UKz74<&etU*Y&hRs7weMtr@{;oSJjM;3?g?EGqJGku$fJc4>rsr1F-1x zY6`&cG<7|B1o=ihXhMY%WS*olWPevhH3tgG3dyYCW>ifp=-5e{O$Ae;MKN~;FAmSA zddD#RfHL1g_=W9tJvnI*(``VnGq-jX<}#Q9GX%g++$^{AlIMbwCrm4Zz;x7gSuJP$ zC9q?r{!!MHghB6QsmmqO!Kzpxp1I5{*O|$Lv`6=1mP9{#L%^n5vZFLX)Dd6CuBk~~ zzZ>CM{;pM)Pd43hawiG(^3^0?pZKe)jd?3q6+z51_Mq%0QRBRP54;jH10diO-2#*; zz^%VK8V#@281m527D4KrhWDk_E))F5F`y+Ozh61IV>ZeF>m3p0qtq`%yVtx^w|Lx-jS0{Vzzk0*P-Hb>r=z85L0O}0Pnf) zJkXqQ=das(Q#N$|g%?R`47n+2+s^B)8w72Ztq+`vip^q zbL;bhGM~ABWdoFbgyX_GLgKILyeijJVwg#GF1}ipH#w<6Fgro%#D}#b;8}Iym>-e6 zo0R)*>UP}yfGIKDMMqf`kb?q)ai#gjo!0I;sAd-MZKepS&F2Ac#s=eK|WIy$&mTow`;@Cei0P{GH(AS@hz`Ql6d67#EVu4^wljfg4J z+K;oxI2b*7BPL%=S>;c_(i{@rbV@~qfmtvYIa>Juv%(7g+8Qm6mD){O=I|`*-~B5BT5L_}@2DjOsqX z|Bmp#WBTuy{yVmm1PAUpFnG8KXtu;6`OMEs_vEiA<6e%jg19c61<&!EdOK0>?}hvz zD~vAZlS4={mb;7IiAe6^|LYdSG+4^*9Q7!V++9T*`=>&;bn?i(uMgc|=JTk`q*bPv zzQg=CQNi=LAcTkJ=OyIW3kojdg3Iz6keZ@m>$upoSUZxsDEUZ7#W!*BOZTq+TaBqE z9Y>5xU&W=boXm$;Tf6L^k}EJTn#-u*L0k}ajKuRrv3{2i>_!fw${)v-ixqg3)GN2U z1AG6wig#cuzi|f~(r>w&G5<3+B5gS0;zdP5`;P)1m8a(2UHC~@CV}kBEdo~_W@H*@ z=vmC)%A=hFKC{Q>#=~-ai9_}xlmQ^q&dQ1T?n=T=;4QOs?}T+l35e#~GV{`4M7gQC z&1N$@FL=I{ECk9=#EZ2NcY$wLa9@J64Lv#*u5XepF!|L+5^jOkz>khcQ_1r=Tr8|V z0;Pgv&?^bkU*+5Ky;~U63Shs~-!OZ{OphfXSSmTrAVU25aN^p;l^OAy78_$#MgF&P zT{rS-WiH~E*l~1Ov?E?MUMc3k?(qX)z`|IVyoN+yBfrxDos2S635A1zRCw_4hv%|o zaJfpalbdum4JOCLWdoH1G#qZcBP@MxdIICTcC%_-;<{33i=?K+*AflHZR#sX)ivcj z6WRo&)uO~^oXo7DTym05tU+{R%H(C#N|O0Zgvo{5M|v6utR445=pJQAB?izGyT2%I zKC?>%q>H~z+#uhTn}(kze~>0%fuIoBVo_0I3X^zxRnn`5v}`Qc@uLUpWX)fv_2#xS0yIEyO!j7$z?_z_M)6s1*TyP*}Jeo%pR<_A19tBP2;R}8?w0pwT~md z5D6}wn84##Po6!?2BOyxR$YXgn$knEj_^01yVtJoUcWy+qGvHTalE66d%qddG|ubo zT6iSr+}w0U^j5l|xrEa9;24DBkBfQzr{(d<-Gh(i`xE&7K)(Oe!GZj67c2bfH=nzo zj*tFybniE|+CBL7^=ns8WNQ2aO}`N_dvG5MJ$(2&D3h$?PFpNk+xGmx|_aUx~G_A3w11~m;(Kh{pG?D>ZKzCDXv2pfyK{_^SpY` zA`f3Fw24RWm1#UBBEnO|FTwVV;PDn++m82 zSLL*&xjV6%yL8GkQQN7W1I6bX*8&h2h^#k|qI9mBYH!LSbt;I&gW7a-hMZ%c?Rt%RHn5sg;X>D7tX zkn{xCi^uQSE(l`~TL*-OQ_;8${YHGvkQR~V*?~+;_;3yV%Et?6H3>ezGN_hm$bcdZgAm1|BWM_;K^`OEhcZ~3wv|p-%s8!h-v7(aDeTc!c$6e*{(}? zO3^aAj*3YmPq{*}hGQif;}>R$I>*_-KvC<6&upCUEq(=3_?mV;czsA}Xz^gCv!hVO0G3>;z-ZM2S^&ucW49%4AkP%`+sSIslz zOJ&iZX>ziy=CjxY$#jjTT$I^WIj0@7;RZxLZhDl7I*{IJ@nAp`g`A9UH#e47CBK-| zpz0Rpe0(W4*bpcF%2TGDxI591U)ybuf10^7!t97%!00vbKwr!0XR=lYV^R94oDVu4 z#6$Ngb(8Q4P&I{|jE_;%>CL&Qa|2#60J2y}5+C=V^)`0n^?pJY+LQi|fR zF=?FX{!ECub&3OXvZDtGCcJiQ>lOyB*H6erWm9JXTMPUKm?L5b{szMn>)!u>Nea8P zF0LKZT-56u6p8dvTpr33s;2xv%*)ZBDiXcsh{PjBmJQ9(EeXs)=q4E%rnxXFpXy*mT3E?ID6>LST@Bm8BwhqR5Q|{E=|EkzP>1~B;a^EYX3wX_c3Us;@}=UA z1C>|!R;wFU#<5HxPE*=mdwKN6^7Dh-o=rV<;w6}Eh}{4ci3*hX4}RurA5$~ARf0ar zO98jj%Y=59cutcH`Sq8hez402gD3#MA=nIGU2Z%0&`a&+z(D6kG$F|u8gScMA5OCEN88(VR3y=qlhm~A67R-HZxE+lNdU1 z;@x~0vvQT~$#s%Ceb9b{xIHHs64ie+B>*iz(!Uy@TkNLP>Ej`XGV0I7^B`UF0@OKj zbB$n$AtR`}d*CUc-k55!CZWH{iaC;tmk_+WR6`D?PR^ns;9+cn8%$Jg=u8OP{;r}| zD){CaCmVK8)80cPF2$624-;d&m2rAY4Z8)21qRAzNQ)QfV#-o>@ba8;0_^t7(|e8F zO{B|qU#dXGa*G?tc2i?&LppMpiqFyg=DIAG8IKWGnmDo2!UnaLfTm5hg2Jan*7eK_ z$cxIdk<51k$tlT!5xU#3lNA40lL2S~5{b8~dPgNQ#`PA(rziAHIS0SjOULD}&|Q#+ zD|as`M05}!#J^uTDhB5&R4{6B9#%MN)+M?#($q^jwrEEnM>ll`5_<=j26OP{;_C~K zPS7yhD@NJ2q5FfVMNoa&7fHwqpKD&xDfAaJzXVz^H5*|Ddsl*pu=FgqDC@4(X++u7 zMVaw??+N3kOTLG6#iQ)Yq~p5u+@36RaL8EECN0QwJa%Xpu@{Q@BJFnbSZw%s&5^u{ ziq;}_lE~3jF>E#);Fq!iA2+n$bI*oE35D7l&;ONSgzXJQpZl-woBY9phdDTFiOvuH z&BJSq=Ml`!+eqAs^m{Ia+u)excA?(rJoW7okipO&u$oq&`8^5tkv2&^S)gK-HK_p4xd8*xW)-FchFferWAADV*JE=YMvM zzJ?~nOdwyrF<%N0o^5p}s#_fE@$}VD6bRt->L*A;OIB7MdjbuuA zcsY?ldz!oN$d?$|G$APC$V@{>x_W_O$3$)-(_a?soaOis@LcwrJk7#A^i4J>wBUsa zVk7wxo3{u1T@rV5%RGKzWKTEFzkq2wA%JFD^=Yr?A8X%@yXiA>bvIk zS%%MUR!JN0+H!eSt!ri}UTxw7Q?jU3T4Lt{u#_UMKP}uHql*CN2zV4|;e8YU?Ye2* zJsWGUU2n}#4zo0yp?^5GN3u6iM?539ykKoAf*oP?3_9UdOSkG3>x*r56<)L^J^NX; zgC4`~7?hh*O~ns6##eZ4W!2Isvc&d`{}l9|OvoqvDp#yEbj zej6;zxV-^~-4=TYY@88$fR;x2!TW=ua6I-1(|!!sNvsZh#fh5D>HjC@Gq1#3Wn?6G zJ5Sw;sIiDqq4l{pt5RVc;*#0|`aLV4-*W;wg2ywjvF1kA>!7C;I^TQ0W^g_tmybrP zJ8nV~CguS8K{t`_iU!0vH|8h2giujJz_P+T-Q`sziZQEtz|~bp92IEb!M40v z)LV1ZGWKWCJ?2L^R1hO?%2d-7;}J`NxWQ*ZgA`ERBbCxNOO!6lxuEC z;HS<(jT>>Y((35BV0y~Xh0t0l)#);7k!DV(Byb{b4{t&u5j>1Zke5JDZ;B6?Bo_e-!n!=r#mjyL%F4w+r;% z2)G7tgp-g#fUm|EU~*#y@t6&86$Mu}5o2_-_R+C$8x+30x^oqJDD<#WAvmn~y?rN0 zk4$pG16|@2D136ZouWRAlpH!J?F88X^x+u6tVa7eHSIo^OAMBij-PTbR6rlL=i7Nk zYC7cJI3s*{8%0gTmQyVu0W~$K1{bA1u(D!?Ty^q@4jv8=3xD;F6h4f z!H}g+4+hNP%fy0rD-BwTA0v)r#h|p;7mQ+lD{zsK_Qjm0Uc%TA zzCL~Ut)o&`77R7bX}(`yWSlmPp3id1;r4PcLB`2MMLhgF4u5P z!J3kV?vmUE!-rCpKg{py2X{ZbuHLw>s!xwc`N@&cIoNd7FnU*2G>-gEjz+j8H3W>D zpFod=wBn1KDm}!KGgp30?hJ(>*(%Kc8DD>8%AWg*Lv+xu$Z0Y`%!-5 zX61f=FH>^+inn%Sy}ukegiliwiFp&?9mLu)v+xOp*$3&%LKW~%ommcCZQiLlQx!p^ zG8?%fKZn|^`Daj@wN|i83lS_{TNe?YtIVnC>CUm$S<<@hs2Wy-}T`BPm=V7?n+**cX!`yHPeHS7Wuy z%5g=fyJCT0(Jb*i$g(UYm1^@S3+xb6gIZ4dmgCoX%?7skBJ&=v#^?f!F>CE1 z#S_t6Rz0P>Z*9x{R-J9hKrM&~ST1k^k9>!B`RPV&ffp`@+!!yJ+}PZY6i`L95#)0q zZwIK)i}8%agn$eV4+9FA*Y%2Iq-wd;2g0l_=_HmOnIovim<;4+hUbw&A~tsUDb6nV ziV>e!bsi}jGPSB2-2e=bM&&m+dFz)U!$9rQXaw_xU=6?W zPD$|O_RoB7enCHqk{$4QnnVAb3QJCu7D}cm2aDR8LEK7KnFx=Me7deUd8NI_z zqw+{ts>&ibeg(pX1w)C}S&F}H_`D;QBF7AjEMdZ#W_?$OnQ;EI<_ za0W|+Z~Me4kx`+eOG=fHr!)bi#g4yy(?g?m#wP)PS66*n4u(v@I39Ew(D*vMbv7oj zhTr`3WVFr_BMv)rWR8JJtnVWa3tJGL$jzo)H6p{i_wqU{GDa|ooB}>dQX?iw1E57h zITz*u3YUj@>0XrOiTnRuaABlnacd&$k(9fE6e5t9nThSByX@^1+}3YV_vrqHxw!5m z!^@yN9*)eXli-tkRcdS1IbOd5Xb&lwnxub1t3!HhBVP1ih=bS4M6UxZ_lU#=Xorzy zsHGwBDk{R?`+|?O%q$3A)$7_#3Ch{ua1HGjZ+*G^QyR1X*$me#`wI!|)k9*CU=Yxi z{NLmpmXXHGKhlxg*BDZ5R4I7KDV|*-yYb3LYrePwY48$u%5RmcLJ(dAdyrO0zw}RY zoT(nc;5 zzFyKih>%;+z12I9TTd8_Z3pu$^R{o@kp|-?eUHdlc=L0y(3^z8Uafs&SzfCcx~WN8 zV|5|Ct>xF)U$0{#xS}6)a{+CmQWM^kOL;DmI(ygCRqKh*XF}->U;hxukGEj{Zyo0! zkH;hYH-@+IxPI!3;2hZhNZ25E67y&Tck5uXJknf->Uin-K$;vTSS{AE-@8kMetL)q zbV&ay3+`avAHtpKxbZZTic{suAP;GzF}+)t!C@d#z`HMTpgbi6(coXyLRR1sz%=b~ zaYX*mVU*k*$^JXQ|Rv!$4R0Iq=~4z>z)nYX?Q2SM&I0!SN}^g7~k zW8hSEN^dRV=iwrL4(O>!GG7{VH7#B2l`a@pqPbBp4F%icSM=FsVEx95?EYkrve#}W z?-x$AX>XXFcTHk*j z2I7hns7mBPZ+xZ*vZcd(&;DHKvxOZiuGBmoLtyl5ss~f>697#L{1RyI)RzGx!s3R> zu-XAvf*p9pjSoGbm?Y$qaf3U^JrTMPk$Pb0jHvy-b^HUBgRz@?&p(_p;a%8QhC%I! zZ$hF~c!meQ?*1#I0?z+W9;$%(3jufVl?aHzeqk01 zVC#eq>8WS-7T;wLw~butPU9Qn_RRV;;nKOQnH_<<^*5-0~1|LPJZ|fQF{8n4HP8IHD;wgoxrquSxL(gSey0cqfPBgrgfWWt`Cynwe*kUREXY#%T~ey3Yqw z>cR;JwiVaLm=L=Cys4nyTt1UN$Tpu~kpOY9wR}eRK0qf&#Qt$r;XFfJ5hx2PajvWO zw6?4xB)ND{t)-!5-mx?%@t&GR-My!GqtR zbTcyZmNvj0j1?MtNAq|0?;lz_K#^hU5=%~r``dDJx=mXhllwaox}%sMY%{x#n|0p~ zJTyAkMa~cv2Hu-hNu{`JfKTCwy`kLkhn4=@aA>qp+=Tjnvx*cUd@Av?6HSnAjbN+D zJ%HXzs&d}ZojsvY+HOJES4I|Nc^I_EqMjJBlS<3ci3N)Ixf4e9+{dV%$6mJjcBKkv zeBRrLC-1J562=~&yuwipH0n=f)PrJ1{vJcw76r*1G~3ArFwpQ1fh0lL5ibCe=dgiTNjr{V?0}gMTN)%2p2vIrD!_+kFT?*D z93GADE5(Ayy4@)B7s7)mHZw)>uj_i#_DBU=tXuMJW5KD5CcMLo{3Ca_JbdW>aR?bB zF30Edx?T^8JCorj6K{f+EPER{LF*E58D|{fl*`7`TCX8#P=h205bYJ|=dTOMc0}@a zwZ!LK3`45If9s%}ga-wpTVDFtM08NjaDa)ohF1}U%h1m8fnQTfk09xXvC1pj4!#C0 zALK+%UWGu6#KS|vq@MyjI_Oy#^!DLH0lgJeZnyJpq#*(&Mocrodk9=a_M*4~P5H7B zM|2reh*=rvze3OE)}i8&%*L732v|*kln}X^lhJ{y^jkt$$_Ik`B~VNeP?J7cDJP7! zIEjFj7=h#Ly5_u>P3)vc!1H(yk)(8^N+GmWsHX(gcgNM8svE@rK?OQvbCJQ0%47qM zm2VFpS&jOoah^0^6Hi|otJD$ERaI}BIq(B_o1?~^hXd3hh6nQd#<9EAq~k^T7KJ!` zz9z-E$`t<)>K&ASJwTsv0@#YVT@uC6cxwg_MaX7$F-imnAmk~|9I(P%mNo4P&^ryi zY7`SpSl_|X!NZ4wt7*a-$dgMcmmbyP(|#17UdXquDgB<|FLV#$byW|06ll z+|>VlXzgX1g9H5Q=pMp%Sm#mpD~Tz64a0yt0f8A%O-W~&1b)Q?4(>BK&NtzCD=1nt z1e{K`q$o|&lCdcTElQZ7npA`QVnI&`A)y#p2r>u+H{TrOZ0|d8bd`Mo@fphq>Qq`6 z!rkyfxQk{H(hwzXgSPU>Tm`9IWRynC5svyq1JvFo>1y61WY5v8Tb%YNglo};?R08x z$dQ?075r9^MJpoZ?0*tAin@@2(BguC1S$M zDoz$?{TkxVc!H-{?dhtcb$%F2^K7@On&j}U!EL=&&@~f`>=%gv!zOaTEZ1M zC=S9l+!wY8jQRK|EaJXbl@jLhgF?P9C_%Y8X`l3zm@`lP((ii`rW#q%sWdZ#rSF=nPNeB9kF2|AzieD zR#`YJ-+1q<+g~=UcW-UO{cs!ZOZHvT<$tTXeCrb(Df;OdX6!s-6o@2_Us)hoAF&(Y zJ#ykR2AG)KKo+cl#Q}~YnK0C!&=#pZbUOoQw#=kl!;I|Mnvq-V05&$7(8xvdx+I`9 zcR6K}xP-9esD`BLBY1cmt%z$&8_o#|m6-KPxlfO6Nqc)NG>e_;X*RDrN{^xuiK7JA zA0*xLy1YOPLb@vF?_st0m4|A7 z)}iq`566P;5C@kv7)s5in-$~XG43fl`h;T_eFl@ky8h97q`_ z;Mgz+WOnR=4_kP5yxoce_%A6K9%_!z z@i@vzDj$QSqDE z8>REApldr+d`aQ|ippk2ak3Vq2LrNB(Rz%E5nG|rX%1i{f(ikdv<>hrj{bQ_Mc`J2 zP||R{s*#^>*G}WVT3ZbYTrQ#6MypWR+JVrjUB9rB&~hzgy3e*Vs6iDc<0ZKLm~~`Xjl? zAVT@yX*lJIKL5Z?xG&yt1?_1s=x91D2V7vfgLdFobf(d9NOysMv-r_iJSuB7A&f&D zE;CTfjK|3ZT?fZ+$m94#)fO|#kU>g?Yuz_ODA5;d8~MF=k1)XFl@jj7dh&<)-yKN~j)ySri&F~0 zKe#zK%^|w~7|f>chok)U-6JS)a`!a9cR&B3%U6A$hx!Kk`@w&^@m;#M51jSB>Tbp7CQ*fM{KVXl3?V5+`$F{+{Z_wcT-dcR`uHy!EE$nyq;48N@ zwv&5q--4>J+-mzbZtfU2eeS&?h{P>Uiw}rMP@{U|gw7TbNDKuaw_Iv^V8;aZQjNE* z2$fK1c;13K?@rkRzR*{7HN)mdlIWEt7z}wJ2x#%BhgoE>jbU1M!_LqG;}jMsdR~=5 z4#Um5sOA`ULI_Ot8e?K5y*y^l#M^`+*$(NV*)XnK9Eln%MC;1_b$Dg}y5&wTNN3^N zu;8~hR3`A33^9@2nl{E;yoD;{qZ&dqYfXd(4e&QM7EUF5Z@6x^fdiNPG+{C}(d9-c zDfIl!B)>2}PE;M-dPOHXJ-|IkKC4HWBLj485{;VAXR&84Zlw(PBXVaa`@wxeTh$4b zxYI}hXT8TJ!nOS%j#Ub_HkPuWjRQ_ga)2r&NS7sfy6NaiomD8z>l6=qM%^^d-ELN*>sZfO`^9r5Q5#xGoE@MO$kO@Fp z%Tyi;JSMU1DQ6_2V^7IMQwyqSC8VOv$cjP6EVBn@$LP!~VGv4$as!E-iQF!9(IX`q zcL`2;8W|M7*#sSKf(7$%Z<~%O3)jbT-^#m5m4VqD0eFL61}qvcR7o@Kz9%6 zq;t471GW`!Dbk`P+WsaKZGU4$+b@0SOK4y)%9=!+jM3TXuM!BZLga)(c>&v+iXqB% zT3T2!Hfmd1=)^AZ5?Uafn41vs#wk%tD%K|*#~u$KH5z^%>6pa0;)}47wi5=ow=$vp zKrxLiLGq2oYtgGC@|f2gSovUxe#_=<>z-1}X3h>TQN7#;lO<~Q>2WhI#*^`Me9NAF zwGSNu=`%ib=3M)9-x44Kj<_5F%X^S)XLln56ka$7#yd1_h)2M*^uVqH1aDvA8RrIU zq6~fEl`n{s9mh4-O9)kfR`o!su<2#h{T^g^c1nq-5a$ZoO-?AN`j!6OTq?n$sDkjbpv&F9MKRPLeO$pPAb7+gH;_{~2?{N^Pxg!r3UAk?q<9in z?xlhZ)Nv@yIQvpvI;1(h&>CR?xPcTe#n^Y=5d?#0G2?ZNhex@aStsHvwA1I1!1kSb z=Yw!Bc>gPs$iq7O^^vyB@_V@i4&jjViOFz*9aBsT?`108qV_ zO>Ynd6;L6y9@{EDQXvRUvORGog&8=t)9y!+jjT@)fWS;VF!~2k3O*JGL&Lf7iVPSk zya}UTy~{t%6l(>qw9^a-4gEqPrMSEJ$VC-I$oG!ZS+6{BqTOOzNnC(MCNDOhT!`Vz z>@`CLVE+J;hK45~+q5vOt87p@bgwXN%A4 z3@bG8dA~%sT{h?+ZZ`~H?qquK2J=v?PRKkyo|@A zlhNJihKIYLOevfe1z{PHbF-2+U>_N#=h|ZOZjnSZn@2W`_^IO~U*H%Dc&|4sVF$t`PIRCb z-2){AA@DfM2XF@55)MtZ^x#K%zPFm2(kTD+u(R6zJpZ+?;mX=c6c6v?9D^Dsd4AW* z^e+uQkXk{!$9Wf=YM;~=&(77ub`1_nrS%LkOeYgCd3UnFfL9XGZdc#l?YWg^S$umu z<5E;hO!_=$M$7N5O!x&Qf`KCmK=x4rYm*<|C(p*O#D;OHUi+Uu< z6ow^CW8}n<;N;BdBff|B*T4%G{y>~_h)3_u#&KCL4_fUAHjIQ#=;3`_^3U%-X8$&l z4?KIz!T)Kw8N45c9XtxkV56TJ`*3Pppo_6-ZrZ47+)P~Bjn0;B4+w{Ik_1TGF@7Dc zDV{1U)6EISk$1vL6vF^0rFQ3uw0xXh+maOE-AN)TKh?nV5B4ESC^0GN&KEQw5<4N! z6w>@nxltq`;}{+_f-f3%FA*3aAtXsHLqNkKq|=GRZeRrHqdUqv(271V<1vWVVT;65 zCAZhIOu;E;j77IyA*C|j9KR1b9%{^u4QP4T`Z(S|!gvhfxI;~n=fRTj2(~X;pj)2( zB5?TdWOCwV4Umf6z3gbQ?JojJOU#kvY5zW?;514$5legU{nqRrtg z!7uN?$+%p$pVaNdc#`&&3OFj0rgGHx7v|+0W>4{%tTTpqR&&Q9Z!RUE4oQqCYx5#nm$6GAQ}(y(A$5nuV} zoJ5lG6HaAEQix5fr&a^=rqWEa&>E*zZNbEBi?=IwmLT>bUzqf+L(&SN3a4OD;=G=M zjV7OMQEHNa!fIX!0>9G#DD&bNiA#=|JdsByaDh$X*qeI-tZT{~R% zSt+Fk4`2ZiDi`8tP6L>gY=_ZAapEoF>p^}mUMw)TgsE<2tI6#LKA3edCq4j51moNW zPCS&CxUkTB7G>I?r(o6N6_0p}Qk`*Ph^X<`mKwpY38tOVr@b#$I8Wt?>8szG|#R%|exdz=Q zp@6a*+{!52X*Zd{^FZ6svYaSK(DDX}Q(qjeXXH8thwToN+D^2}<^w2$X)WSh>OT zw6oOaLr0-ViRFljC)6ZnBqZ|JE&5AyV?JNDfNBKkrd!Ff?cu_)+3&g!r*tlfv|HWN zDcsR_ljyri_nrB^|L8q0j5B`FGs(Xc+mE+_qZdsx=O5ca;_cz7_bL$1^(24%-7^N@ zEjYaVED<%1j0DuESJjMyhlB@ZgJKSk?F*yjOU0eTLgLk&6?8GPFLT49pSCyzNI-!b zDAd)T=1P~lv2OcSS#cpvUPFfeWLZ41u4xHSLsFG5B^Wv{H&bz_@Krfz1#i8}`Wl%f z1@j}L;?VIJc7^nU6z6SX+(%&m#VCvm!*9q*f93>laOJThnPOsVC*pGk;3D7>6Sc}S zhm)OvcfNbuPuvYFDrj&vME~YM8Z*omr528;K*>zGtYb3*i_QW#r)!H$PIAP(Pe9m% zW#OoEKqelMg5^gH;+sLBjJrbc*#nnFI5`jwNXr2u zKi9ppZD>#+P7}id;oPy)BQ%_WD-+(+?%{>$%Gn_D_HAenInB<4OLJp7_I)DvXBN+K zoyq%;)iVOto1}*dW7Ia~+CWocPH>FV568^SPe`i)6G#XO{#B4}sO! z%bcN)MUG|C8$~6WNowD1D<9#akRN!K{CU0f+G&lVtS0PxO1qi#CbgDde$A(aE zApI1%;8c!v^4P#r(rX3T7{cpgawR&x8(uZ*;@aJ6a>>vqbG?kBn@O^lNCo*EQ~?G^ zh%3C%aTuRf&4MlUy$*gj zQChS*lkZs=GeSJ6_2TCfExc<#{}e{yU7K6uc6&=1KmC|-u%zy(;hPhiya>iTvLC5< z<;2Ki%C>cqAvq%qX!gA-u`%m)S19UD(p)riJ3bQjR;IBg(5tHXF}eFxAMF z?=oCkGl6BTtrS=8c*5>K01_<#*Fj&aqCG>b3iJk-hDf!Bf5ny(KD^C#(mK3{iNpJa zkdQIGLk+r!qf;)8yQ`+v_$NPAv zzEhtJKdF68W=!K9qg~b4t02=CJB{sfVWyG9T{Jag zR^@7YR%Mw~$e)xSc|K%NY?2JYR|%aIC#6b4J-A0ZrFjH?oLa zJ7!Gw78s7-zI8p{mKU{J4>-|3fCn*nN=(7(DU}a`r|WPR6;R3Ko#j?&0GB;pQh>F1 zKo1832@8H;fputb6{PA(SJjiKs^1H_$J~889>Z{OVLkbzAajJ8ZgDa3GIrffyKb8w zwSDt)+1k5b^*FGuUUXmq35ympT;$eLx*uF^EGK_bD@rO3S<1L|QkAtE|5d%pqd!68 zqzVYz-givr(#LTM=L60G&n}D^hEb2uBa8jI81cR;b=+q;7OnrjIcE#xySP32l7G z2??i~el~cjcD(EVJ~Z42?>8nHfZX9NCL&!djw3QX_HPPb=p-t1Vhg#hv6+Wh&~^u3 zBWcFnM;2bh1XabpM+X*ooCmEXDgWBV+jp%3oDgr}Mg4Ag#S>0jR8BVA9}kclRybqe z;?#7=91w#uY#S5!k)UCKVzHoU8iWSO1LCPQ=KF>eLdNeFQ5NB{&CVi*@41zodg|;; zprTvONf$(iV0l0u+5*;P62=GW9nrqt36`kOJ<)lcCogS$W+w0C^p(tbNq8+ICuP%| zXB6!VB$6N6J$Bw)sUFeQ1uXEZ%VfU^8K9FE=0BYPaJutm5bAiempCRe;UY~MWd~`b z?t``r@e9z#!(W~_9{x zRceUrNHpx2C3(t@|3ImRKa=6ys{nz=jlkryU62}1u@nmJ%Zw`P zU6yLH6MZjh+2O{1{jR)uqm3lQ3oIo^h>^uz9rJv?wC9PerfKP!9nTzzu+lqf4qLf` z+e8!1GC^GVjSXdI>duMJI7LIa58I6x3CB~??VIb#2>p^=(sIb6CQkLGT?uMEA@r;I zKx*OM>3Kl$VGaHPWw9}aFtERE_Px-S<#jjF_=J@);b6XCba3n-pr(_6MpW~cqNC!v z2?|R0>S(x+z+{EGXsmAsdr5D1M?W+5jcCyODDX1a{oMZfF;s}YYD9t7UBJ5^6@oJw z)0zB3=nOtn5P)3^_;&Adz)uvC5DD&>i8oJQseT`^54Vj{de=o7j`GJSTH4u;IlQyw z!S@^M!3W{{PkkI{W4%eiCD^!yfyW3xPU>@ZfRVfsYD)^dY%&fYVV4>9u!;R0%7vz~ zC*K=%+wfx&qz`aSH-oX^s}kNrIJn;5CsQ9F8M*rX_=mS?htr(|4M*b*eUQ*jO2EbN zXm@l9S;^I8U*zZR5NtVvH@na-*v(yARs_sVoq5NY9%JF8Bm_N3Zs)Le?D<~?+sa;+ zjCpON2t@&8!+}Wy!L7S>M1Mp=Ch^_?jQ=V4SX3VTuF3x_wD8aCVs>76zccx~!zloY zupDeE(Kpsj4!r7H6>SykVvI@`$zLoO!8Rs=>G+v}WYNxreug`zWBpwkKLYfsXzKY@nNdtGP7KLBiU=YHgDQ$|i>BSq zulr$h4o16s)`=`OwoR1oZF8J8BwKHnOOoZ$xx+Ypw|pJg_J0xff05|_tcL6X)e4+{k}E)qDk`smPcLL>Ya|Ym#65nd>TE4G^&@Q$XAJ1=TbnH5V{Q8ICW2bAO546OtM zB;{-kscu~9Wm(}I2rJ1gXANoOAbglw0|N7DlN!ezr7Xl4A@KdigK$`l9^gLJOMsgP zkA84;B;R-#T_erw=rNdZawB`p5Ll77q~zr#s~|u)gMrrl4Kd7I1|3N;-4W0z4~Sv0 zEQ(v>M=KByX2^7^DQ_-2`3@QWnk$*S=FOJeP~oEUyP@0gAZzE?GBgyV+hPw`AAey0 zzc2*L9c=gn+UR2a?$FgaY_7|4<(CL=WrFRxuEoz511i`b61;qPVGpNDUitK9ib+T| z?28!{flD1iZWKXtM?rUauEZy~;-F6N@YK<8=<5mlz^biiDGya;w3lmT`4&G5% zv4-7aFJ^#?iP}H}fa2l;-P-`5{P$F}S%6HjCeOfQJTh_b;CKoO2^a>Y&wv=Bp!>%j z%i+WvyW~8?@Uf|JGwC=~7})~UJgc{ag1=+7iZ~T6w_iwdoSYYA1YAL2jlhQKX!LhC zB{`JL1>nBeyQ1h?=~pzLARB3FqE$d=qYOEKa}HB;2zQ%IVLRN2S9L{5uQf*9 z2#Ct@(Gf3HLB6<3>BkVt#?PCkG!m1+dlx}>zPD+GXHpt zYXXhsQS>J3HV783RJjfE+DZ)%M8`+{aUOn;F(?;K%=WLhB(d|`!yQ=gaj)2&cR9a_ zu27|xS>Vza7k*d*++NMI~ar=NMd{^Li5CA!%f0EpQXaL|a0@F32Lt2`+ zToav5!T-YcG7u~v6p~Pkk_9E}c+d$ts+gYK`7lH4>^Z}FT1A?EM)}021*i1n=hKG6 zauo2N<5=|^(2=`_1W``htuTaz0ETDY$&o#SKtO>ZEdJ}W1iVb99AVs-2eR?tuTY48pEzxWx5LTzAB#6DIdRD;3KZm&MLA$(j z9W5hqBBzH-6JFwlk9aiEYjp2(z)BSHsf(%^c~YZoA@*MrKy(;g5Jscv&Q(q31L**~ zXvzLQ5!0I1YxmlAKeTz)aiBFg#w3JXxCyldnx9@4c+=@kW93m z8wkiCXNdq!AqhZIcB9RbCz!O12cEmLotP>xbAkTgH=vFiUP6KbA)eDPfeM_El>4(C zgOJ5>wJF5%6hb~V-iL(lV0d=-Fw`Ax3^+QR58Y#^`x(KbY$4MaWh=0%Qfi7s!dI_Q z4|2D}@11ZT{EH{KKd58R!g=7_BD!$|W)Z0n=UrH(-L!G`G=hnQIgvKFYoN3U?STf1 zgO4)=dZqS&a_VRUqLElJHkuo2&oGP^U$2Cg1qzFDy}*YG8&_sv4 zh9n&dI{+Y%rIYnGBx<4+QDGB=JTVvWkKQ7ams#>KJG!248;^t#rykm|h0m5aFyxI0 zaPkumQ8OaT5JP;I_I?vF1PY3%KP;i#k5Opj2K308fa#xZV&)w<%0LigVqhjOxcv+& z71{8}sBUz?jN8@X&m?JvSu|8lfw9>7i7!vy?Vy#R(xGfL-$g&gPUFqpiz4@PDI8S0 zQ@h=4GPx`-F0g0=aXRCKY9cvca#QL zy9Gvoi%IRoMPgOg9(ub|p;edG`Gn7jwxj$Vu=;w{Uq zPwPWS0{}e$-ZKA4sy;DO8f3(q{IZ(O+;o9Y9+sHdwozURdJov3Cma@D zu`U+d4mX6GMpP!&x%-*Gpxr%I&0xJaJv87OEvGjoW7bVvsGh0stbOfXZU$RYPS>b_aI`h=05B!NIB@IRQ;%&M?(0|?k|;Bj6?Y{DI}K9m7^ zyh21%v5@QTlaaqb%@gFJ+=%)Hdp1cTtl|uEaR}xgmZLN1zUEK$d1lYP`mZ#bin2tY zYr~nJA?Gfc-*^RU5y)!HG<>TDLCI%3^FQaSZF9+@y`=CW>y3(2fe?|xNPQx?w5;u0 zzYMWbVV%Ds`j!N?qYO_F;S*Z?D$h0e=+Je<%IxWe*920Dfx`p{u4+5nfa4t@4|38O zl#wjia4I}-KO?w5Mqfk6MWnZpzmBw|2zNed>iKrV)*~7cRdS0z@D3lF z{1~(#j%Y55oekFK=S|7EmW)#eJDIFBzYg>?&b~pn62_9VniU=jK)qr5CTdWOS(4fV z$8c;%;aMk_4c)DD4e`rsK%WH)0)-ckk^03Z&~r7TPRt;p-fT*cQ&alzn0=J!mE2jU zV}Ps>+(1ydLI6_3>2U8t7D&8TW8l**1cUX0oARlzl z@vxH|n8cUOR*Xgd5(+WN&=A_yfS5=SOcn01#V`!~dv`kAbp@Rsk11Z%OI0^Nen59R&ZKUm`4fuTEDEz3&%j$Hy*r@ zlPj=4fDy#v>^+AJ1Lw_iMd z{_5F_FQ5MJ0A@7usNWb5elvc3SY_Q^Jbm%|XD`2f5q5!-(sjm1YQlgYPb`Fx55lP0 zpt!-#h<8Q^Vjk|ac3Z?9k03onnEVnvJ0@>}I*s@2 zX}kw+0r?Zo?-1ScMYI#_ONE+XPzl!lMEDRcJVH#33~&onyXESf@X4LNC%MfHi8!u} z){NM#(6_pmquW$?D1$Sj2{37>921sG#o(^Csb4C+6YTfx$A(YN5HArYTZEU79!i)D z`T@f|z3~{$Axjc>&{dmju=>o{lH3zJ^MmD{_(Cy zIq;?!CND4Hr>&!M-yW6w?x?)vl2Nn`>77LRu+~C&$538Zk<&Q75q%yh2+rrw(bzYP z9{@q(+LcoolclB&M$F)9VxO&9W$tGb$@e_VyR z8{H&tR`L`zo>}O?g+72uZ!{EUWiGI*8A5Q)tBcD`$K3F$4*?E7}^MUpLn~M_ep{iLp9wEUyzFe_=U(G8REDu_*_%(-mc!xA09UtVk z+OAiC^NWmkKq|1xHEWE{1G_o6kRbvy}SCnDH} z%herp6y#;nFIrt0F7vtNGLW9@tH5k@2IeBqWqwzpPc9|uEdp?T0fB0AgOUpbS}om! zV|7_fN{k83G1wp)2MqNw&?Su~`|ai0{R94UdDqMai|A~?c|Q=p!9eIn;BM_4Z=z4~ z!6#a6m=Ea7t&{Zfet)RKYP0TL19Td1-P;KMzHOx?{Ow)_`ZUlt-pxwUz1xS_!vpi( zrM4_iM$KhwljslA*02PW7i!!u@J295$(;Y7EX=}_`~a7k*xbZhh&*Ub+U>QtuWx5Y z3U!aN;;&nF76M+E@YcBn7dYiU+&1}6v~gy<Yv-EqOi4*&Uu3{u`p8X3`e!pSA`K zXg)59del~>&azbpjY4tpacj6fHr)K07hA`aR7$JA*C9_A)O#!m61Crd7wioCvbDpXkn!YU|Nx)h8|(bE~go*X&msoe_Dw7h&4@*n4~LhNjY@Ty2YUv z1SR+$lFT8ap1;Lm7)Eb6c*vSVo}2&Ov1+U}+|EvsC*S!5_W?)$$sPR}Yo8{52Iy^U z4B(lLsKp$Q$H4VIq$-bJyn2R2S*fJ~O8`|5QFXtpbMh;oR@K=EN&rk2Bra8yrF4r- z6WA!t6CtCBE(i2EY+P#KGRZCULsCNp+fi&*?lH9Is^&sFFYCZKoSRzt06x5eJHmIq_V%mC&z^t(@~Ky?pt=oy7iUg%_bI&F5gNK7t)zbbVFa{LPwV*u$-NUOFXKShq%9m3 zrc1u!VowcEv7kM~>fm)luIVH;o2P5rugUa^KXA-B8x$$1Cw!X350mg&qJj;quDK3F z6`z>~3=O(UPMw^&jBvk{+RazMSRgW-RW0SvnDG!ap-#ky-R>YozZarKKv?bnp2_wqP2A&`Vzau2ap*M8<=paRCL@y3s zv0m=rFOR*Cvrjf2J7$IM&)d~?v7R;AfVJo;otR;Ttt8@@*sjsMc!4J-aNrp(O@w%h zJ1QBM6KTlL2M4af19z6k???IZJ+*P#SJx($&HudlIO0k18nSvBT6Md*e+9AiyX#qU4Pl$0rMn|= z7qc~{R`WuN@VgObJ(e{v4K}+sr7$b%Izi-=(BPT>x%e0wYK65;nv5wPRDOVhyM@2tq@MJf6#=76$wrpV(_)T2@!=6lz?Q89z;OZ_@=G z-3a+$zlbuV{KD<)n1Wwp1uVdM*Q>$vVF0ZpU#8*$jvlcL1vy+jpD|`2AOeglW3Sx}0ON#L^k~Fu?&5tG>h-fB9&c5qX4 zOxpBacqT^^&fJ7K6+#h-1Kz9vUKOICa5I~VhV$&M9^vq$_8REBw5Wy^Cuw1Y_jE?Z@-K}Z%P7K z%4auj;vS;bJ5Er9%Es--w}8I~$9$fz=EVlVZOIV?o=liAvZVJkKLdlbzLRoVpr^>( zL*6lz9DtIeVq;wbnF-E*>tzO@GB^y>`{9iRz78W)e;tbFBA0g3hPWXV`K)l$LX_en zzb+?k9&5y|S)db&44b=WYa7&TYIv77Wa<`WK7r+qGIfywD#pEVHv&>!ikK+Z;cjZe zGCj!&%Ofxd8pD?D>L}G!xmbZ66nh$HPi)pobl->gZ!b-t zFK>g9Yo!xJ+;xx6NDy}yd-C$0LUuvx$Qy3_s)x#SwO47XJbjhYnuZ#6%HtqblcegD z?DySqd>dFw<~!e7>F2MFm&jyQPz4#DfC#iVG8# zNC3-%c<444EWZYuF2Cs)HsvNSdugqy;kLEBf}qrFyIAd}04ULm13|$Q|M|nZ0yXe8 z{w3@O@lYc%2Yu#@jRtS%Nrl<7rST$noRi1 z(@NWR|6r?7W)XF$CDD<}!gd(%M(hdicCRZZ9e}c(%CbCE3dRsxpfAY;2naP(IGEE+ z;Hbd}&c3LMsL;C9!AgX+gZ&QmvkAJ!q@=qE8;kU!Y%H1LW~lx-Hvc|}X!<2{_hSjs z1^6`&g4vE#`zCW>C9>)f*pjJ!?1Qc03Y9UTeT(6B-1@b!Xn0XisEkBam z>Im*4gJgBYuLtQ*W`mA5ONsQU=m0$-N1pHdguAgWOv4!9zPrvja(kw#D<7`{(nP z|7S|zyx8N)ak1NrLzelX<+edsV3cfflP5U)6Pwi_0g2o`{hA|19+sP;c?T}w(<#EJ zUkFdJ7`k5VEe!KgUri6P-$Lp!$lzuJ;GVoX`}R97a(H-%AoiWZY*l{w^wrtpmuIFv zW8e30;>owqpFe$KoABvj+;X_1*o6e1Z0!3N;b^?1%ON=c^}VI2K7P>;93T2$lN)y` zhMdGg)wSskzUb&-T>?Z8A&h6U>Z+Ql9)iPxeBaog8AQ-=4uL1fM<@3ZBY1W8^t`?4XkC&k8T_6gz{*BfRo*VmR>zQ`|k1g zub%qF&KmH&YK`FzWTE#FV4Fy$KVmGJ?k|IQ&iv+UlBYtep(;& z)UB!+%XTk$kjHH23z`de%A3(je@D;aQ1rMg+wsprrR;#UF^_;$;H7oP*gv}fxO4CH z5cIWcej|b`L!|orlXqRy4ZM{6yl7aP*Y6}-v<9=%50QggVlfo9Km*ys*xkpHL2MMN zvQc{8tg8#mLS{s0Wrm#aI_H!kJ(AF*c7(h&_HGFk>%AxJ0}^eD-H9lmz0YPa1LL+u z`Lgi7=j1zXa8ei=POPiHVt|fdkb~zVcjxwSKx&4amNi$=Ecl+K)RO%KWK-eRhq$$n zzA0YJHpOOb{Euh)3?l?1V4z6Xm(%{-G3!BtEb!3%staT5#Pnv4`t@JGv zjZ*r@FYzzKI5MwVe7CEuv@c}zJd#%m#8yZCvxC)kqrT;&%z{tq!U4MX)f`}D{_(8L z&2>LX)cw?tRCMS2-wGwPO_J!tRZJnpjk7PP8~x~&5+%9_jS94T*0 z`a7>;N9RFYJlX`;M!f-vnGId?BC z7wY9UxZ11%QsFI;CD%MnM|)Zvg6E7Mx-rmqgk-Rmq|k0i+>wXFd~=W@%7&q__t2#j>vfW~bYJ3Z zX;~A@Ild#&Ooa31&PW$`ad)14~f?Vbs1!Jbpr@;~dOkyf4 zOM?L1Z+>`T@0}u+>N`u40e<%F6i?Q50JC%DZg)ih6A3_t05O%bsM_s)?sk@cG-!59Agv&4S- zO|vgUza=mK<=D9Nq}LkSiy&1x@b_MK8^ke!Bkb-qkW#%?Knnjf_Htc}))J%)<(1|k z&(yuQR|_X9F!wg3lSBPKkujZ7j&|*1-Sfag!IUe{OUf3p#=op9PhSiit4~D77*;9< zMDViGYqCDd!P==4KaFi%PhY-#^~V=yj|D0)M+=vMPs?Wn@C^=YGt3*1Z=@`4n^8{@6@Yw;@VaS1hoRC| z0yc7iUk_Bi>=!}tO+JNA3)d?kJw@MwI}g|=q6gg&F)HANAF-nj@aLg>F}>|QrOqVl-{Ws{!q{3r-55&(rp?{Q%CN968YIN?H)3>7P}?Ar-bjF^JghKn75yG7&{t3 zuoV%rdllQ%UquG>oS}?NRt^NVmoa$XZX(^#$JAOZ8Yfc-sx=JN1G(XegM-0lNQt0Q zG*U|QJtV+8Pzy%cuzdo|z#zkrS#T+He%#3zPX;Bt!%>A>ahyh4w z(ehUsWrza?;vk%I8ho0D`aNh&!Tks5lc+{46f(RPV@ZW7Zo50;g)bCFFmm4iD{@Mv zaJ*H*vw^DPL#GW9Osz6da2(={&@T83t={)i-B8~X%NO4aoQV(oP0-4Ar?x~`XJSyM|!kI zh_&K4vl^)=acDl+qQ~C4xTc?~&5eOkXH*kxRUHz;b(iOmdXJjtjs?&XTQ>cIY;{qr zIbu_rgj^eNYTf?N7*r2;&dx(;Ngn&qz!E#6phZ}_Fz``!C2?ln?=h%BiC!-zOr+V@ z5?y1QL)&&syDZNNC~zpkUA6XQ`C@80@DMi70nUo5cmN(M=2{%KA5-Yb7@H}*3qU*A z1XnG+Mkc=MC?B*v1%{HqdP9)m`DP6f;*I;)ysqCd>LKiT6kxB|F;!?u^(YL0+v0<& zVPqK0UCk-LUL(I@-F-PH)rxEY6M@@$GtB?Zfcr`Je|8l=4sah1PmqrPjGOea`TjTv z4aZEK=YxZfn*1>TsQD9QOEhm{=o$=BK$io4Xv1d)tr?DXmpC2{Z7@8}8$bmZPDXKU z8X4!QTY=J1AkF6-@gm=YC6QBTbVa8B0auFmi{Ry$NF>i;8+vS0&sCeO1fySCs_}Wc zmqhv_lk|w9s1$<+b`bVKT=PYRi}67eV(dzO=tzL$Q|KK5itluqJ0&jwK(kROc1o(- z%7ESD>?C;9iyn4~7yGReVw|4UTR23%R)=AlU@<0uAR~97w>ppb)}h8mImk^mYXXPP zd#B8KGL7V!zC+3o4v6sO!_=3Ad{(oft>nvRNzvXL0p5`@GYsOnd(@)>0U|C^?@V_; zJK=rz>Qb4VtIJ}LFMV6(FEVad?_zU#(Cz5eQei$oe;gv=hJAP>jG8Pi)aEJq?NAz> zpqPQs0>=O>t;)=N@Ml_vU-9h!qi}+7c{-%_)PNXv93vqcF)s|pv^PJsXwYUFA+n>y zw)F^|-XA%wrFue5GCIb34N~nM+{sj!Gyg)PaqhmsGa8P>5`_TO!h*2HsXCB_ z&SB%B1rP``iLf`HLE9rRE9-*RS}WZKtL)dR^y1mEsBKj2y+kngO2S1`2$pzhvN#8$-I8%Ez1?nV1Y#*s z8-8DUF`b?+$3f9soXsvb+~{z29m>uRxpy z6Qd&DFz(d?(G&oa!C5!mC16FwKeltii_(NatweJ|8#Z$|1P&^Aa8SwcJ`tsN?Z!8FRq2Wz_G9DSj=7DhrAsWYp3IG-1wUb(Jj zn@jh%o08kLsiqU{Y#Q`|XvcE=nsrkjeH1FE0MG&=n_w-ZNK``Y2kiGN#hUJx0G{p8 z5yhff7M^fMbW^wqq1H>L3$rlIo_9AJ9(&dGc4>Cqf%na>x|hC1>9vmZVj@|2%gFlyI`Fu6agyjHy}O!ge0EmN1?(t*X(S*H%pC zwCZd#7eiBEHRpUnE#&-?GjM!huLb)VjIV=qW$_ETLn&Kfx#4_nP5SxhA;D&e&=z~p{l z92=5j4J9ykV_d0+vp|3#PvsP{dQWZQVX&16Gdbqcx)abAi*g3?J6Hrk0hNqj7yKUz zlL7M*;f>~{qq7;{00OJ;+R439P+X}04z@y}I@wP(SIu<~KGP?j$(Osuc#}a*{;vAD z`Dfpwbla2E;~;e(p0sqZ^DzDQJu$>qQ-|i1884-##Cey?nV2w1e?X~BlUv)z2hx}8 zzqLL5AI)BJX}zN?CfM^^kt!1T{^?+`{+{H{Lq z<#*Nh>33DUrBv1Hi&(6QJak)Hob$FdcYLXA-?RJ5d!JTi7{3u%LQi$Wd_cB#m=6sK({kFKW1$ z9cxhaS%m5~t5EI0|Jq>%*bCpY{Mm57;1=XWset=ZT$?PN)y5mxNa1MLHNC7&57KIG zL0ZjEKw3?Lw3n%k4tmo;DiMl-62n?P0h!~E*!p)3Oo zb+xOlb_R~NpS=P@F>qyMUqBMpt@;VbSfkl?>|PY#w#z%wUhJHDk7^J1#g`^k9ORtF zuisBNNTKEL7{$sdCeN+H1;^P_3~WLRenq)p8ud?HRZdpe2?)P08qqt^bMS2jF;=ML zMKtLu14-%7#GsVaQHbg|mn8;x-WAh@W+iuMP2^Y8yzcx&MduGzqoMdg1&)9$Y z9t1XUd6=7NC6fMW!z`2!>s8^YlTJ^wm@&){C^tUMw!Im`Di&hAM#mE*r!I4 zzEoiz9h>fka3sgLeaj7H`Ytx6f9>tL>)rD9J*W&A+6=;aOr10w+Ihu3Iv2(27Y9Uh zFJFKM+_$h;sPD>R;hz+1PA0%XCUEankk?Y=4qb7RZUqBm7;2x!B(6(|OItcfN-ZTQ zIQFd&lG2(MD<+akntB zm#OG=8>y-@ZO5gG+sjh(#DhU!vp$is3iL-_aDg03xK#isxwW}CO-qRg6Wxlgg$Gwc zJTTtvT6i8s%^}-My~@un`4ZBHq^6(q>)mV{h!cg(#)7m?F=!e!%5iKy*ON_;%!)LM z+~x;$7fAIDLow@2Zvxb1m?!`rrE^5#bzIMGI$c_NETl}p)P$TA;3fFSXHTDhDV6mL zTemuoRt`tsjIyKlPw9o!vn?*WFk9=FZCyCoxjjL{d!0jv$wXtuZ<$ys`=FxsHO|vS z7zlvoSd$-DD$7WvZZ2)45zGwSabj27O?aHpBCc!<;_kDFB0?12(*&ObG;d2fnuTQf zfd?$XA)9_!^i3};dc8=RE*N_Fv=_^PV!FsnY(Eyg59pV{5gP#;ASO9!r>9G;!hUf0 zrUy8@+!W0%vEeDwlr(cuPJ0&K2}*?$kszU$$@Pvq_GUk}eRC^p`{u`C+ozNeN`-(-{r?Fi#E$@- zb_Dw4ai^Pp5cu&HoaR`>B=aw+goavuSP#djAjPD5LCy*vUSW{J&7DHF3YiBx@ZkXi~G2 z4#bPIi1W|OllEfaH~X>h13F0u#iXd@F%mPqzhc5h=ggx~rs9GzzCdQi+Nds69>7PW z`xUaON7>fvIYb|nCj1bk4%LRNOVoadmczsNn%qE^%zScZM492C1?`byCuQIhe4-tz z9wHX)QeHQk^>(^3_)Ge)aJ9cB>?|t2#c+^f!2>`u#Mm=Ch)4_6!Os8JFs(COLc#yfeLg- z+dmqrNe)E+?C?$>8kFH)CIkRx1ErxHPsJPAKQKd+z|>6@(CYbCCWeQ;nXVx;ICTbH zp>4D03}Tsnw-pxcosWWxOF{~gjYF>!@9WQn*{$aYFDghtw_c!nTrhBhr*Y7*=7b9# z*aE5`LD!lvIeySbtpN>?8YFqjHg&JKIW5*}d9`$3CijG3pJ}z9YdpzroL!Dk;jS|F zy*UD&cs%4VaEzyPZ*{#wq9=@<{*K9-XUs8eC_{cxLOqEW*zhZU^60#nLt4EFqX#IX zG#SS28|Vn7!XosGFp)B%RfaT%=4OY;>oAKUEfOgmSf?CBA~vH8)F9y^*hCS!2<@~G z1(}XY3Sgu5KBhbk<6(-jdIm?Cf_pI`ycs2`d233$6^&US#zNxkgsIvBK?eDC7yM-M z9QJao*J68DN?hiHTFF(K{S>D$6W5RGg5s@h_L7j?d{P&kR-D46c;qkAc(FwtydP0N zR+3Naay>^0M$`ieMdz=Y59-NB5|UKzE>mP!EH`In zaonmk)vQ!%W>DcXA9g4(Fo;Wvz6XlR^rxdR0Be{L?gq$o^Mc76!>uUzWtl%=kW+-F zXBTerP(lCgoYTXBoyey?gKK|#IP7Vz{a`9T9yl9z%tM1A0@W&*21vWZ6+ z31fPd?)lNTKg4=d_X(AdQhV=2j)JgteohHBGj~zS*wrVb@SoxyT($<$0Us4z4vRqfw?1>&7zOP^;=B7H+M&T&qUU@V&!DaOMP-q8} z0%W`oehqi5nAwTM6$F%2E+K@xAy(kuE`q(xu2%jB?xB%5VPYu+3JFpQr%#6^4LHk$ zZyQ9+6;LW%nFuN=((4I0624;KwbeqcPf}PvvFL-OqT8iN+7;H&|E4m25k_*+(8qp{ ziaudGQfe>zG|1&r=jT0fK&;~LVq<;^A#LqEIDS>rVwTj(2MKM7RqYod?91)f3x5(; z=)0`lCf=@Odj=zVl*z17uCVyrDN!{}OlK==oUp-|yVa7qSK^+mj7BS$UMI>` zgE~g_Gx9)b$mX0-*kn6V(jH`Xn$P?j%YOa+H(xw`nfm36Z@+#1^zn<-Pp{5iK6~+X z>X);}Up#-B`r)hZUpzT`_HDAc?_WKA`Q_uY$H@kN_wwoEFZCB6>x92PfA;n7;_4kl z3ZM29sxkNWykWRf%U2#KcN2%rS+d1iqL>B}E|(#PE!PJ&m zv_Gt?y;2{Q>1D@(^`O`TsWT8add<5g11^#c${Vu z)#w*jLLOR_{(is5`}_V5@9$gw?l7K_mBTi5I$Y}Md)DOeah{Z$>$0>0{e}~qFy8>x zQG+ZC06^Fz$=Z$%^F6z@2mvG^)5Js1eHl12`b=+&IAoCdRNc*lZ}z)|-R$)V6IlUE zCV8$PJx5FXM|6v|UZ1HIV%R#yLefwfoHC0|kd_7nEp=`*Ac2@@18?a#&jQ!=L&q?T z)==9>i^L&r>9I@#P=QZ8a-(*|OH;0nZ?E-eim96GZb_6eiXB6L#QG+!cdxQ%H(?T&Pe+6hc za~BzLOSddSEEK)~JmC_Oez1!8j2ub0BKqiF3vS<%ybzd{mCa=DswFWQ8e<7?x9;kL z1On@ZGN5vbfZ9EPX$K%SFF#<-t9kJs`27mpEm{l$7jHL%z#_MG8=+14dmwKh<~%qS zod#dWUWKRTw>zKYgXJ(tL6WF(?Uv%ScMV%wYP{N6qp7#+sTo(g22773z1<}kOap7o zlQovxRTC67HMT=@4!0{liHSy_KYo?8x=jxhl%lx627SH ziOYfPIDVq(a;=_k1J|cfmWX%&bOKi-njCzU6ed4>P@3DpKbSeegMozn?Sz}41EuvR z1jfxu6ptNTc)wqa1rv-QGXJ$(qRR^}LWa5A*CH_29qly~pvLYbY^(ZzLQ@sb*r*Hu zOdQw}v)f?ea)#o$7x@8#ZK8W+E^v_=wjT^@#P1RUK8jNIHi=%%L67?-hqa|%_~bXc z!MGprtdeUgSVmfwR7W9K`AIqhc`4BqaPd_8tb3+H2TlYyh#bAF-kfx%9&eg!J+XBd z2P(j&=5i4C*Dea3U_>A?J``8^o$4Ke4>my_+bi^ykBH$#d!($e#T0;+%M|zmtgRQBTgi-`5A8~OGhwKf*UYcWUWOCkJH=Dz$ zBkD%o!CWIZ0je$VkoWE!LN^bxSKyc88)J)>*DL`XfdG=n&a9|rn)Cgjb=_NhEyf*W zS?tdboZ2Q=ZnJjtp1CZi?;6AlkJ(}7VanYJ1Y&Ep)kYT%StzA*gc)-YjMKMV)8=0` z8`q)Aj<+v$lpzl(29tUfitWTqUl%snAUl@IiREY+Wu*KyM9{UrCHHv!TH2sctGFF5Z!cio>UXg_WXlCq_H1x63^s zMz&-xg^8{3VdKWC-Gg2fO}}M^g0~qml>e|1L(TMnSrFYl*g!PhGf*hID?|<0z{tEt zKPlGHEWWBl75tNn<0(y-cUG1RH`(AEbBTjxX*IsW$p!S96Wk;Fv|bqS4Ve$ zeTocU+2B~-r4+;F7Y_`6q#p}w zle)Qa66F$-7Yni(y5c4)3=?`aA;WH>a|`CpTiVvg;*gYJFV>C5>sWrTkhBGW2q6zr zPQ$!q5V6@oy()uyYnZ9iRIWhP`Z~)7^SWN4tMR(FueN+sLM9aVxnwQ9u_WPi1ugPr zmy1s_yLhGuJ?fEUvD+d+J-I0Y$0p(zE8 z?{g?z(M`NUg&p#b+X`}C5CXD+n8Rx3XrVfk{ON>3)*z0$Z^ih5yTcOb2HUT2(k$}uu-+`ZmG zl(E`Ih%J=YHD}Uu^ulZ>I>$Z?!Ftv-VmM|~EX=L^>lUO=&=pPR+Zic{fm!m9#=|zB z_UpTAHQi=kNYH%pHbRt1nXslRhT{BP2VWm`Fm@K^WDC@L2An4wf#sAGidIN=X>rdvP?cBd7be#pV#23L-`=f-4lr_gn;H+WT#e0k!#Y(#MXTTiMDhOcAW ztZMm5*?nY`7s??C`H3N_$T>W%FNzdX8ET$YQ3?W(@1S)ef45h+^SgbD9WfZA{|-5* zL7ia=3#;qeI0N@Rb$7p@gosAf)A&4^m?MWJFa={B8K7A&J*v!hSr9Fvtk1NF#%nKp zZG;Fp2yx1=8FW|)X`>{^4(OVq3FJ;GC4VB;X-uBRw#TXUDgE8I-~O*BkA3W39{%+5 z=~=>~6Mi{+{Oq~;HLCag*^8%%C$RST?e{OFs(r$unG+siGz-bDx$7B>1^^B=M8haN zlmZR8_fVsjR0X2jME*6TZvt`u!!4g*)#5v+Q%LMJ>*BkY8c!!-77+W(1ApiC`X?

OszaR^sn1v9y-kg=z^Lfd(;-52~9($^B-d&{sWpPc#Nugz-=JB?W&>M ziZ+k^ENd(v(J%m5I>H~>)rcd#^`i{6Wo&sJ2H${EeCW*c9& ze_5rxXW|umY_KZ=sA%xESGg#(2 zeTOU38+x7f88r_HhCMF}0ZI1tAVr?YZk(xtFIxo$rKGkYENqzio#%oVRNt9YjXXf> z%fLrc*`|I?;qwb=XmCQBTp%6ls|KgCehV)$6eg0BtS zLje2o0;=U*Zs9u6>YH8)&*noEp3RR{cq&Kt!p-e;o!@EB<+iA*%yH=%A0)*g1=za~+ywFeM!g*iNW;OS+0{(0fjuSNj|+JoHL=Ya+-{LI?8rl)qJ`7rH9 z^JBCdDcVgaHd++gda>V*Q2S~lI*7Gz^&yeUZK+R|^Ph?MI&}k~PyIb{oa&8uwteBm*?_FVy7e(k+ z_9Sy>@4OPdnxow3Zv)4va1bn8w5JI}z<39DMQ4VNb)gvnvnG8OuZj>GJuIi1r(*`u zj;x$;bmyv%nLE(7_Z$#AZ)fO=W-TN^l7g~Yvk3@(=e8Xpw%J5c>! zgYXG&hk&9`nT!F{I|v*!p7YgZ;Z7Z(QLx6db+bKxTg+x~5$(L!v{bJsKP`=y+4Hww zP>|*qBf9aXF%;}<)Cx# z*EW`+aBV#x+IhHiDh`SB!5pTy;(%bcm>Dmo*t#7X! z^rnio-mzIY-2Iz{#rjwbeCcE~J?&7RJ$U)wWJN<)9WuyD3NeInZ!g3@N+VnW&RT4P< zgjC2I3S^%#z9tlGDExI%77!c;*ivXuL_IaGU=!jah)p8@3Oxbg6*4QQb9`=j)f%nG z#CUeJfr5&_gHd_oecG97q;gZu3q94 z2OQoyf=EIs(@{VTuSb1N8q&co{)h<$0b3qq0%^wzS=;84Fb@W;LHc}q*1Ca+ej*EY zrAzZF@-GR~71c{*Tdr5`&CQSz5v8D`huK1}52D9oGq2%|4Q?!?tltvk4c8w@-Zyju zZ!n1?-jnb(I$a|J$Wmi=L`DW1n>LPq5#3C)MH>#NbJRS`1J^k<;D&+-JO$s;Ou&<3 z4*uUWpWT@hVwy&=XtfpPxMK;0tS+GS$vED!S}e+0<(MyE+p38~eSza<(E`E(24#0Z zQ#>b+Sa0Vz-sqSZQEi7{=8noRdwjkzG#ktMN^ha8uU}iWdN6&1ESZtgOBISdLtG0z znzK=cNi0)DTcPjOD#c&r*zV!5Qmm&`BgGTe^==9Ena-v0)DcRcd`R_D(rn?JP_Lw% z$*W>op4x}4_?I)=56i@^^XgMOxvTeG0J{1c^xv_&MxajlD@T z!lFA@1(v`h&IoJ%6RpsPWz^_cLy%DVEFhHIy?P+(gysLK){N%kXVJYPy;Oa+=xvPH zVa=`;GKn^R!o}i58?D8n?@zPpJXV5t<=Eix6#D)XDV{}{H9l@Mw?@ZW_W<}0O71DvF z2<*hC-4MgTe+YLh%u_3rE(5%sr+f*`c%KOM1^JO*d@+i`|&xL!Yun+@JkgO#X zfV*G!l*MLSHGz+(&8!%M6R^jGT>_6_BLT^%BH1pTEE_A-*hFl5!#9G@ag$Z&wk>Zt z=N7GYx)7iMAGHQn;O}X1pSQnr@ac~3(|7j)<+={fKM1cFGr0w1m2)5w< zDSr~x=yz>x5_!9S%~{>{F5SG0ohOIN3+KOoi(Tw<>u}JgZo)5 zMIT@$x}eAR58)dO!68bW4kJIBM=X9T?JDhHFQ1?%2D19g59wj`_s>dMSETuw#u$kpJJO`J7JWYO;b-RbTq+-9v+%D zbIe#eUAt4~4(QF#$1E?J?PT8~x+1p|H=xF@wQKgjlY;WAuzDQ#`$W@WPwUkU8MsVP zvwEscAcy#BUQ9_kxe-pZoR;2tWhzQGgZND@OhpgIcRsM4>@Hq*4~Zf45l`*Mye?*w zK2~X8upgW8<#+82l-RpDCi6#(yB+P!^SYQBb4wxksu;N$n_Ch&Ghxv7#)8j*O{>n~ zEB5JhZSu2DyyQ||T<}xiyNJ&QCY8ShGFuv}&EK{RZ(rPU*z%HyFf#ol2u%|mq?6g( zkdBfVzb#sVtGNdyL9zaHg!la}iOBuFgBq~$uSSc8}UYP%tMkIqAoE--5yq8}enVJk>ho8>1TCrr#r7BWanpn` zCJgrJ%a>n0)3j1qWno|eIq44Ovy(Y?5oE82t}oc1DAUi|T|S^fkD@XAB`7l6;d2^Z zS3ffgYVS@YPwd*Cq=d0^hir}8id8IksxVZ{fzod1z3qN@SKcIKC?i+V#WG_D z4OE}XS(y}+0yX5#PxM8Ibz)a9ii6^i<04-b%WCSIOvD!!8!Tf7%3p>(N{*7Kbu#dl%~e~Y2y>^Vw{6REjH%Ss9qlXEMc!)CwTp9=NkXH<5# zS}{HZaqfwJ<}lC4dfWP+B`hMv1Yr#8b!Z;(t+Rzj8?l*4V^vny0{3tw@C9$@NZ{*r zFS@Pti!AgI2kheCrF|PO;+ab*}n; z%}TrNS+}pmZMRDj@+1vEzsQz6>+OLt%FY$-J#r*de+-Yp#-jF4hYYtrz1%Uh+^w83 zwAOA8$W?yEgZGa*Tz${h2Oh0`{zSo%`EP$t!qpAJMt3c5B9Jt>zJ6tWjXgnxBF&Ob zea#3@1$kVfTGwmpo`3(?HT3;gUp;*ZS?5$!ixRE?yQ4Z--}g~G-cKHc$gcXXPqoR3 zw~fRD&`e->3R0N;wiO$|A^ zc67mRN#9r4v;SXVY>gnq(wir_OBg~UiyVa`B;!$16LxF9XQpfQR@(Cza0Qcj$GaZE zMj=4KU#@`??GPCFH4^g=+l)es+{WKtoWjam?vk-M9zDhv9!hYT_RPlnW%buBA%cMr z{jR)mbnRnsFgT1-T`h{Gr!Z4q-ee|f%#S#tb=rdTf;$>_Z@=wY$N>ko1fIZ?19gi> ziuU0~5_<@2gjWV9xh9W%KjF}dlchocWI&t0y56pfYrwvQurr8O_2FECs1fsu?J}Me zeq*O~zAjM{;zt4-gur{=I!Gh$h@|KUxeBg@+by+KEDCs|QT@Jr`qhhPK4;fiy3~tr zT{&~hU2KcBD^W7PElp-yLIqsf?XY1Jw;FuvaK9|~i3zU6&cmGw>2!6X1h%bAwZX4I zK~I!YKsKBnfz=*xa~DDQ5;ULEN;--0b{ zYk~UkXp4`RH|$&)yQ9eNr1zrWd>!S|2i}9^Q!UFm;8_yj40))c4z)dp^l%FeR&M8? zi!KITzTLM&w4l3hK`FjV`8}^DWcus#bW@6Kz1di6CICGi^*R7F;HglT>LmGBa4bz_ z>KkQEwOGw>l=PYiD~RtbL=g%fU`e5BHw_HEW{;z!x`Jbqb94JyFAtYnA4D8XGi?Nj zFRO;|P&x0s$Gk&zW0wz z4y+Wr-Mdg~r3Acc_I^haJgjA%Ao<@4kz%Df*VGP{1l4U3)++?)*XWR9I1_(+%cPq(-?q&KMQQi7e%#7 z84w8JEdjsB!$Vv!yBsTp)0ThiwotjJ&6@h4p;W=*nvuf?m8*YeCzVn1|MlqXq0>)E%aMJ@? z0fkVxzN!rR%e+{+_vl5baGZL4Rc9_{2lwpGx2_^|%$27I3pxoGii5tYO;gU#$&m}z@~>M+XUS{r_8c9q zr|XK)Io+L)L`_d_S9VQdQAl^$tc0PU?nHYkB*N@T9zdBk_1dJL%@~f>?|Qtic023y z^J)s)g!_s!h2p$M=!Mgikd$x(TfcC(G@@lc;iGm#iBbG1l}HFBKplofI3m1Teioh5 zcPt7=-zo~Re_BHNuzQTCncs={`qd9=v(k2lG|etE-o+N za1>SH1#i`gD6Lg5uv+xrR-^!v?S!HoVLU#%9V`98ule}QzRV9g$)`79qvfUKt)fUD$)=THzwOOBFzR)*D%pmh?$K=Yy;K^+?2+H^V>@ebzKvdW*_qR07IX z^J3H6@b+C9G5p-g?*KP5F5#9_Z92-~lSlX~LeKD}&el~i2t7U9<6;QL@t1w zDwAxylsStc<4I1SxuXubs2mOd+d+Hz_?dE1tS7F)&SeaXLCV_=ET|iEw3tcx(%k{@ zn=Bhp6WRsZ%NPa&fTTP!KF9(c>k`iY$3hR7oeGbkN2n|gJC z`*V1Bn8T;0Yba7>U81MGuf<>Nt;k>biaImMX5)6A>&iYL7}d=b{NQ~P+hx$RR~2pQ zjbpm(lUWgDp5rpWeg^L2|C-!vO2`@PXI`$7LrIJR$_lh_xyldFx{P^%=()sscKDR3 zn?g32Bc`TgSAv9DP7qsDGtCeaU80&*a){0H>*7Y4&UHa)uH{j-kpV#ep7n0FkSg%K zn?i+*gC1fnU8%)&(mWZHM*t>EX^qZ(2L#awLS){(8BlTsSpK?G#> zWODirzN)}>i>*)w42F|b@`)XWzkYJ?=wy6+B))Hq6A~1pWQ7ku|EMfA(MpY!)6=;1W`RFXXdji~TN+l;5oa&*D|qnmGxBmxXEJ(SL*HH?OQ(scXuwqMep(-@ zUL;a(b@i$^~@j?i8)Pyg#u5|2JWZ7HN51KCQ+#pq!o&jMtnN1^cvO|6_(Gc>6H zWmKapI9fC?H!gV6kH=$hl2LND;Dm8shB>4%EI7ge z9IC`nMq;b?Ed;FpHD=Zo`85kY0v9XLJMdZ*HVtu76=DXYu;G!wN9I|7bJP;#%M!L_ z#$5~)x1Q7*vXO>)N;t31m~7~6V;IV;Es%u{%G&t|^56)sIJN%KK#w#g(I!56@V)qzfctlDk2M{W`js*Y*f(2I_VOZWu;z2|uSw2R=G zz6F^(;{beolWdooRhNS=G&2F>Mg?4#G;RYwtwA#!4%EA(wM5L_(u)H>y4wVK*y|Cw zI3!l&F=h5B)D!{?nD|^tj$g(W!@TxcOKWERy~MA$DIp1u$JS=FERTaJE?nvn>KSx! z(c(;~o;Wt4F(~1{%r|!1?a;FZMq!UeH`*}<95v$j(jwBz3N#d=dsx9(_=9$qqN_`z}C%VPWV{$^3ZIMI;nLcsWBWI^1P| zmWsmAO!Ih(p3?1Vxp;)h*Woh2f~eBQ+MIi5aAr@Rcc7Hg*gb;u(4z&ubYux;0(d`@ z(E!zQ0e4f;(@2_uDC9GvtKp|~a(Gp*y*AV?9ykxV0dJRVWg?Ydbw0{iT*6Z-;u6sm zZsXQvrEHVf}s8Edawx6Sl2(CCKYT>we3Z4gVzUe_EDS1Eq66v_uhKB;SWR+dAX zR&WjPtaIbO2Kkdp=98e>6kL#Jm|KakWs)OCA4O}l6cC{xSKBC)>_=5N=0M%8i<#`n zT$O4&?R*flX=$yH9VuE`BmPF|$f!&a(M$IRtFB7IPW7p;jMV_0W7eW3t<=(`kF{nq za|^3JC-ekt^OH>-LaWN>6klPB*cF(v(cu6fxCx+JWG@_2M2sLZEN2V{=krXH>kvuB zl*fbj7c{j|wozwC#g)52Y5A*EyCipnI!KbPsiUWYo$0jXOdykyI^!VNL zW7p_G2{2%78A_Vr48E4f3wV0RR!*$;n%)Qf$8G8cs)b2u9|Bwq8~1@yA^;fkJTQS6 zK0jWAX7?I2@fwU+ArUOat6MIG*;SJ#?I&5F(Fd-Mb!xJM!nz=Jn|!pv8WQY&=Nd99 z|9}@Sc|)r5HW+jgx&brd=^aUYT^}jT8{2IK>efV8vWCV!0xDMZvoY@bz+vdwlAJGH4TU`}F}q<|CkKzRoKxUqi% zdYc=;Dsb|nr>%vp33Imym}H?0XzjJ}++qbfF4GXJbHV|(kCfu&1Uhn$SA1^r( ziwW+EIKu=ZCu^@nBE1~yI_9Jp!6NYBo{%f6m~KRwbAm6}yPu87BNS4w;=!9>v{o^3 zw3Hto(F=H9Lhj)F&otG?Jjeeiz_sQSebdScNqM_k(b~=HYeMEKhmJ5=S=3;I+{zbG zE4I|}Nc;@k(b`!Wo zk-T*y%J-{!iQz^C_@73hXytnlsL_9l-KX3j=ycX$z%zceY29kk zqoV6vh`zn-eE4`Gve^_t7-Yg0FjF6DwM1ZwqH$Aa2IpjYdLMul$kBt3vvQ5X>w>ch z;f%Ol(6Rj_kB4V*8UYm$l^I5yOBXI;T)~MAUF{`lDEd)5igNpnUa5G!Sh!W|!{pV~ zK(Jd$Fv{=x+Pu_R%`LCz_Eu}&o76UA@|vq|FARw+Zsju_p*n#9ZN(}A{9#o$4RADl z_ty+JWx%U6RlMU*x{?Eht-?p?M%^?`QqGZ9B(|=CAb%Zhj(*KAuK4TV3es<7oUI>7 zibx5c2ZG^y(0vtcmn%(jmDmaTIUiuOJ(zLeKYw}irh987<5X;-;>)<@T@BG#Zb9kR zQthGSE^*zyuHKCJADvNDAW{-)uaP8vj+!MFMX%SDW9mzmHduH6-cbt6 zqacCv$j8|iH^N2r4PgCK4A#b9%=dJ407{;m1Q;c^{-rugk-F1?=_y z_ed_rVksqsrEd;*35>qkjUWaO++5{uj^+ zXQ{4stA%+HNYfIncXT4|k56m})k%JsKdIMl-jHwM8xx`#MpAK*C4``?%Xz^GLZ(u) zK}ly_p=GbxP7Wnjiv8%rKrGnUDLES>`Nei4ZC0lc+Gq54lp&ARCc~jNj*w<$GhJ6J zG1>ZYCisK?I3|Rf9dSTm!Ir0I8?{}ljELGN_3S1(Z7uDG*Rxsm$Jktxa6W^^GmqOw zhsx)Vi!S(`^9M3o^qD^u%m>pNE_8SQ9`nWO{<%y!u28%X3dHdA*b1}2fP;9GlnQjr zXX;b8sTKqV$wMgYD)^)zq9Xwb57wNTU}J^q9z_YxgV*nudcYyR8vI&j8FNyvVH0#n z*ipYp&jeOM<^rPj4T#fdL&s)m=>BB$n5)gH54`(vqipdZ96|6r@FR3<<(Z$dp{8rJ z?LZ<;x5p!=vH1J(#w2#j236cY{@e^viQpTF!$yL2PPC$_L7HI%=Z7qtichVLt^8^B@di~CfkFL?Kkli%oVLvhjey#Io@!r<(OW)rKef~={_LFl z2R&rq@Rle*Tocq?Q^h3a*z_Vk_9t`u83&CEsqo>+6ZG_aE~*? z>f8NYA~*p@`Uz`nIqP$e5F5HGJ)mF;205gv>vgf}K~qrdA9QsZYXUAXt!fi36GA=U zMMKVK5+_9PjKcptmkSIE=y_DK;GM;08KtU#35|m%FeWKVaKS`H^V*OLQthyDfZZq= zOSf}FZ+!C3ojZC%c{pG95CrI?C2oI_mIIb2u&J^$J}tN$w-9TfFgDB)T__r55bs~| zfSbD%wve_@Zqu&Ki{$IOR=&RL zwD;Ks?|6CJa~>HegY&3H*C?2zpvBp`p~_maP~#Si)>~K4V^`r_H>)>|>czvw6S{_| z9l}$UQAjUv&mx=W_Cr_r+w zn^sz5ndk{g=NB2x02;M`IRP!*` z0qI#82ni)|ZyFFI2ad^JRmpKRWwA!BGHLb@9T98h>QtJo3dlvgsRL9ioq|W~;`5EviL6yK!5F>Q)H#B0&-zTk#8+ltHdCfj$C#e#UV(G3h-qW)M-_8d$7NotcE7 zcBkR^dMsX7mFGMLlN0--@mh?xQW zuW|N``!8@dRSejch{`W-R&GIHD;og^rAS{)5<&=JZtO$z2%{G5&J9yy zVUKBB&lpsClH-A*W=$tJ$#q?C0?_9076_LR)n7C-PdVXLU2SNkXaxR@o4LhTtXs2l zkXS~Pth#>3xmhZL8xS-^-3}Rgvz^c|!Bmz5I$Zg_0N;-h@q}w(h~btM!KVFzj$);# zZ%%$JR2~IGBAU}1h$KQBQ0=wJaFnnQz_~n*A$tSiY0%R7yRuw~dR&cf!NiDyzQs%{ zvXL+@T$?lx@|3~l`JD2AVu-Tvx>e0N*Y(khH*(D+JEgEJ@yY3T!KQl>-$;Dih<1;f zN4=Yg`|8t8ASiYW+A7f{-4()bqxMEX|3`ZTjm%~}?s^BbmLUjbw~BJTcR<2cXVX%- zfT{^u9Yfc{@a1-15qIn6XCl} zVnyv+)-by6(TNrY)qU5+4REWt5onm23C3$BoP$T5QV)fH`w$%KOB^Mt0Ic*U-#tG2 zotkObs6*OjL0rMHh&PIb5q0@Can`V?rKQrh!@7Vx%H}u*8R}Or)D8UY1 z4e4jwmn3jvkQB(6G^_xkSfxyV{W9?cDN=y(wIs_CU&QQp)y5OC_zl)+B=XQ}0vUFk z4PMowbSq>?Ac$JeeIsB&#UG3{V4yYnC9QU%K!H$e^t*N7k9sW z@#@P_h76n7_4iBnMj^`J0A3!7ambp@&!_4^AV4R(ICrn>_m{bSy)J-b0N4zBxLpy* zeRz*r$3cyP4iw#cZbox4I+-YAx%PIKqFT0-eKEywD`cwTxA5udK_oHk9eVuc-FUx# z9IYg>#F0~K-4ZfIQpQ+#*Ez}o5@ckDP&eC@j@Q?7JnLVHYE>%4Nh0=dF22wNf)AQP zw@`O&5a!{cSie(D1@6RKLnHJa zddF@CoU`F6$+z;>+^k8}0vI~p6^FnZnA<^0juBy$#R>rx_^L*onGeQy{&Vce=@kE- zp5ECu>pPH{X@2KF?*OI4j|bw*j3QRJPf&E?mE8XN<&xbN)ddo zuWlm)Czs-?SN z6r;1ryqkUstkI-%G66!UQf%jf?PWZUZ0+}~t^FQm+re3NIkFmcr5fA?p4}VDku2KT zOx%hvGk_PbnB&n$U`qK%wi5;>7;zdAhy(*G&1Omor0`9F`$2kLA3}t|j9!BX3FKU> zq;)BL-lqIGBbWP4euN%XkYffTs632M0b;9W(^{4nn9w7agfS78l8$EL2=Uqp0nNzo zssX_B;V|2V1Ko;U1BGkk@R*V_TOeGY_sHhx*p*Tx_7aw`TpN&tax*I4o76esZOJ^G z?~cPEIKYCoD-DquIRIv|Xj4Xw9i*Ei$K1nuT~SV-W^>clX4)x@0lIzw1`6Qrx@o+~ z-n|E~B>VONGe-`pW48r6AzF@dyv)~{c)YQ0ZcK;Qgr1GzLW=T%ZUZTB7sUl5W4Rt| zNg36#l9C_EfiZe*bWtc9fzsvkN$Bh~GDyXwXT;9yh7DEBQb zDuRJ=$;F4rjTMIex!tRlF+X{(dL4iB;bjTV5h5O8Q?b(2nhP6$2cTM->{|u36xizF zmz1GiK=4#|-l$m27Y01lr{sk*EyV=^uYcE9pIG(B(8wCR62(o!pMfa54lJ3z%q5at zMp9GfxtH@#QP>Nap2it+OuGmHFb;1fFy;rsr>(aTK%NMw=e>YER8I<=Vtszjs;N-a zF?oyl92grWYLW^fiTnVmMn$IsA8N$5t7UEP5@Ul82xC(6Sw%!dcg-Fwii>J`FwQ*J zQ8ynu5k+wgD8=r9oE-*EqmcI?m_lZMiP--uw=|roZAl)D7-QBnkX#TKh;oZi!I}8_ zlIW%pWe_hSfny~)bTXAjXH-MOTW~H>==koVOG!Hi^tXg8??4JuhiXN@;t)>pJ5}9A z;;zYj_CdO^eY6%WG5~kCVOm8$r@V~D$%$)u3L=8l1P!YumNhB*ZBQb@hWW(0#R9G! z$9WX@*K3OfKoit;9_*7gP2+~y>FN%G0ak7~n1_85J(=gx=jYMqW%PNaVv~1ZR5OxX zovLlj$TyJ2B&I!fWu_5IyMGNNtnfQ|t1&@Da0jR-Znl-at0%C^=OtPuidhD43DG=} zLQX?{A7n=QhkP9@(+bqatlmPKf8Dxc%ZPLEBnZC-zeh+O>;6?b>Y739#@|XOCQt?F zzH!f!%d!b?jEn#m*6axF=&ryR2RNxbkXSO`uw!}%O&J`U!N(u{_2W_gaVU2k&{z+U z5C3V2u9`6BkB0$rCFj#NgM7eU9fa-ui5vVAx0q>*2Nq-b%oAedai|G$qR&sG&t>%a zT*;398-4!YR&^wSwo2Y^!}UsGf)2fjc|A2ciG#%Np~*Zb(I|ndAWyM{xf=hSt)$(Ab2v^SWN? zX>9U``N5^Tkn8-qUe9L=4Rw$afb2CiAFMMh^T9{Orw4#0iw7Dng2DCBeb@^uixa8W zGhV>tGL1595q&6@B^cK5oU$hz>;g|s5{!}BgMezOsdweg!vG#nbTXO6V<+b%4p4ZY zi?VTx^7kKPb)e=$TpYKO^+U5Z??(AmdU*yPU4J@!i2wD=w0ZsRjcf2KT&7OacQV~x z!gpmX*^f{u5ATIIddN#0^6ZHub$z|UN_tsc^$|&m#aOM0yLPg`7$Bwr0+XVZ_9^>J zEY`~7K6u-q5lu#lmY4^|Yk8)@{5_}hXab`M=v_T++sJ8fExWswaxYVUBl{Kx=wxB2WZDq+fubmj7Z+EAW(!& zg933$`a=d3(l1n4phwPcMkKQNr(|Fv^YsoPJb-Cci*lt87VW>@E>yErhNm?z#D$}8qXirDbvhF26i0gRE(1HfVm|Hx6Zz< zxqVXzkiwUddxqXwJPEwZij36(aGo2E1cd|M-o?hm?S)D$G%x+wshY;~rZ)bJ!9$Sf zE{1?kR3VIO4+6;jTs4h>Y1BmP;L}Fo z4`o5#fqWDQ*TZonfI?Di%zWth!J_ocL)q`VS~&hgktxOdYO!5(GB)sT1tLhg0Y}ZE z_5+`4p7@RSrc<}%t>!e7-${}m^vU2WyYbg-{@&e&<|Z3hLF7PgQTWG4$N5Lc2OwYM zhlh{y_Yb+G6a>BY&=7mh-fSHV=M@*Vj5&boGVv8lBY{@l^; zy-)8$M+^k!KK(oQH$EJG1pn64H)w|PsPn*KHiykXe|JKU9Uk@Z8yW$cxk>OMNobDC z$x0DQUH(IIsQ(V-KRWz(fxy}n>+!|k!sXf6eqGClt~n{VPY#=x%Y9;)D+23~wlpYP zvaWR?HjrU~(^6pqm@tatz)M+DI6oR^PlKluLm+OK2!Pm#bM-;-r=z2z$rS#ZYUh6U zlMB%__s$q0H*Ys*t8w@Gc)5}?g!9CZdqMzh*sEnmE*01G<2ZW^@+tah8MP*?!n{1+ zFhW3w}G7_~<`;LJphmvzsDRdp~tjD8Q-n?vM z?>4df7fS27i(}2i4yBYMzcR#{U~M_>T1hyuSiuFQM(ZSCDO=Q|$HLmu6ZyKFu#9ju zq#5=JCcICGINMf6MPCF?(%J3x$**soUx2DIVzYHT*fXU%7YA<2kGxqUtUI7Zf z?IAy`5j@2`a{&)rAg5rb~L z1>gP8v0I=uueF%EhX^~f%0p^Xdow<|z#;^(pORRWMC~}O7hwIT=ZN*Qa#t5wuqNaq z5cTTb3)}gl?6>pkk-K4FSnqKllzWuey8l*OfkAI*^cQH%G=rlvL=^E~|2`OgG=BZ& zlTQ!-lc`~t9UdN9l<>eKC+Loynq+uHn@Ut}h|toY0FT+BZLuJ?U0tl8fscx~g{US| zSX^zorhi@^L@jOk4D_UYEJ_zcy4Uz7VI8;v!|72Tmbd zZ;7aJ1J`>RDCR47xH+9)_c-3~Y39+jtWtMA~@iolO@kyNDn`nnxYXZD44=(xblCJ@{ zZ6coz(=sM%#(02$AB!|%74aFn>iZDKnXMriQ?M}(+u(&c3>SuOH5{{IVOT{p(+Bf; zP{SccI1CB(_TJAqGnh8*iKVX2sFc|jS90Mt=BkuX3o(fCetdNOR>KMh>gV|S?MK&| zn>_1xf<5G=M@JBQ@9U$(&);~NC)nkBy3sRiWhSWe(fp&sKJ~C~6zkd&hz={gZGHw` z_lUj*g`n|~od79-9JXYS?5KKZtH}A-a#e zJ3+abj)yFe2X3D&{lw0BDYr;FMSt`vK|?SP;L`0IQOLjxp2!DiAS1d$$Ac&?r%>=X6RBo=Si_FkWGhry!4{j&UTmijt+;lndHfVtrna%rmtjMbf4> zL=q-DTxYG4tZcywr+XS?37BZ)&!IyTpTf9L@0;v)tlaob2$`PQcei1UEsaxeD59#E zyF0UCoeFUYILsTLltZj;A2O9scTeT`ztL0<(^J9w>BF~%Ba6Fsesi1YBDcB(FSUkQ z)=x6=|Lj4I$Dsu%c&4R}L#Hj80tz}!(Wew71gqfBpwZ+6Zuni6Y4TMwX6a~D6DyhA z@VHvSEZ)ZMA2U$!OeQ@wp*u}#&|+1UTzYH9miHZuP~6flc^oJNm^hoAq z?eO2z9dfK$kFIP~THMKouXTw-a~ERQJY6dtBN91IvN*Cl$I7&nbnZ98d&1vH=m=)S zP@&T8$GmPxZ)COQVHi=b(nU_%C` zJ35I&N}Rk!mys>#{hru*WTyuybLwP2JSfD}sx=+TfLbH;vt{6k!4|(k@yTF3{OEe{ zQS-@g=n>(m=vqZZjm+do12Gty+CE6T$#{Z=J-XrvGhi5168s6%o%|1uDX!aG5^;ZH z(}`!@6tO^UoQyJoX~pr!Ex3^ercJJPw=<3CMh&ep0cy!J5!u?zimtq18kso|=aOLp zmhPGmKW~ydG%SjNUtE%qv(V^!J}-)5%-)2WD4xg+Gh%JYFV(4HRa02qjp%!OcSrGH{-FZH6HWF zPmkX~084JZ>ls_>YM3+bPaiu_2EnEs5viU9vdkH#6GeLzN8b6K5l zNWZ|hyrv5T_b|XO7okEEVuUB)-8=VtQM~W=2=YaEuXiVYnHOt$z*dMd;Jq3!vObYg836==mka2L z&!+4|u5?2b_cl0luNMk4{!2ZH{6{&c5d7>RIp4YfOFh6^l4}7uX3*@037A3ph2UEE zEDjYiJj#tZkyPL%r@lm~ok%5Unud=843tp!bGw70J)!v>bnT|mnT5jnaW zk5GQEmWSw1%8$yJ5?(9zfmaIB56d?ny0YfRfU(<41A|=EpV&uH#yN4=g#cu=aF$_8 zMu;6Idy*HdL56Z@79*X=IvBn_f$pPZ2ntK3Uc8f-A!yBARw@iAxXT=;htdti1afB%dkZnM!DVxquP| zxoC{sOQE7@LpTS$I;*KnJS_C z;f_0lD8UJNulK7o8Q$_p8p|&gXT#?*4UA z&pNw2U+-#oKHK?g-923Q+woCnuTJpjthv~+V{Rtroj&_0>f-9D&w{~P-FZTTG zTUo>3&l(vH{C-TFeJWasGoFjsM^p2|kS$}!d?jnFz|X6Z7Q+Y1AEDA2l`SRTLr z-S=NVef#^z&y~@lVu1t&s{_D*cnp7m|RtqyaK4K6t%@UyHd#ayfQxet!tQgj&(n6 zrtFiTTS}5y{S6`*#ce}62dLg9dkKWS#tYPh|7P&9o>}MS$)V8U6&eNobf>?_bGVKygnKo56Kvj=dG?i zK!Xk4-8X_P9s%Q-G}|Q%OJruy1NSK zc066pHc$ab`_>z9SsC|4(oegoHk(-$<1NwGjxzLn&)Dg=a=i|8P2Vq3?cu}9fL|km zms=J%H2$9A5L1)L8&H;tYQ9~Unsy^hJkC+)M0I3*8D<2jDyf3a0VFL`&^+UhCG=u$ zI;cJD)QU-geDE5UIicr#ns9A{q7Sg1+9oNz5nfNGkghNmZURe*IkoALpS#8Cj$M=j zsYL6YW5yb4;FOeyy+?#RW!H#^MRl%a;!0K6aD*0wlgVH{#X?Ab05=n$$~dX73jf!j0<+plNFVK z1v=Fq0q|5P9GH)HrIkDLp3U^Eb8E8RV%wpP05eTvVtO|Wp5j0z2q-{kN8O8%L`!2h zJ<|a@KSi^HbevQ63ueb2x~G$ox%q(d5mt>jP}Zv<-S$CN62neB`M?EZtPMIvRXq<> zg7%w*c`Lp9Zl?S~PV->+AZ*6SEwELzJdNij!TO{~{TXAUAg$XBE#Ai6P}78Hq{6zPh+YcjK}r-HupUTTU&V)h zWa%M!VfyWE^{A-6^v(kJXoVnRjdK{Vcd$M%K}dXP^MTnr_RfT|*S;*k3DR=-p9}wU zu|hBN@b~qnzQA@hE4YCXg^;bwtEzUhb>A0+pXTJ#^;J1D{okqqN0^PRU3}UaU(iVR z2u6;Dz=Rpok+RybpKj>hM-)!pi#s<+Lu=4fqH#Oo`r39LG|4}fB?dxOoJ~hl;joi{ z9w1kM0i73k6P%f_SWHV_AWY;n$Azf<|}y0V}X;zi@>Z`u8}2_S+>fn;Q_C*h%x7 z#R@iR*D$z9N?!L+4ZP9hu?-1E_HBka`SJDs)rq`}!mb^n(j>zv47FVmEr<;`Qwf2hT z`s|b3tC`#sHdnR1mOH8<^@dYQtt=j_T}w+RZ-7tVTT(2sH%GGAMmNp+Cv4|He32B* zJ|Pjb_13kBbyl1q;zMJNy2KpeMXzPly zIOM=vO8}~T#6jou2w~}sj3(7<3Z4t*9=6DWvMMCJo8Vbn4g)`@sgY{X$p*2}Rv$Ww~|!?4|10BkBxBA;zivEA2Y_~iLyNe=;P zTILV$T90UeGJZG?Jt$-aGP)O!xvgCkwhQl}iH}K&H$zp;CQuBCi_|##b{S|3@<@{u zIzDTs^SD!8t9;PBt5z!uBmhyv?w6tP0K9Djy=w5Lv2YLJK8-E-3oVXEfRQz}Xgu4M z3X~oX)6-nf0X;j{ooLYEmUSx7A0&2e!2>NL|Mrlm>~L;&tG zE#JT^p*}xv${113XTEb?Uz8ie7=#u^*`h2OjJ{FE+zLh`9R;%sb+skFp?J)Kd>jL+-dw^j`Bfr*hanJjzPPD_-y#%ZoAsW z%^sfe9vZbOTM9<;qZYO+Y?^tQ(HhH5vz(bKA$?RB-x**2UcIPfJ{YD}j<+of*G`!~x`3h{Vsjcp zp81xMq_p`)&WF+z5qvu~lipeO@EK^3rGATOGgSJku}TF{e?#0^mRVFPJnn5{vI zXz>H`*q-G7^EVBYpn;E+pM{YU^s;vQx~^Ai*wLLdzWZ(Ki|l#b{sGEFF&!w^My^tz z^~}6qSn$q5X;8~aK!C;(uf0>rnJBv`_=Nno0AW6Ucx>u0rJa1X-UM}=2`|o6MO$OP zwACjRtjk=y`w@@6FU?KUa)0@?b$|JFewcqt2g)&sSEO}IyT62v@|8f?0G8I}y53$~ z2Hp$x4*b%(0i*h~TSSrqd)~50bMLD~kcE(+`k?$qj{$rzKKbr@eB5S|gWagO(gOsQ z*{<=SN^S6(UjU8`L-Q#uZwqFXRCl;kCZi6vhc}RGXO#K8VjZu&KmrS>BtYb6GOTO~ryx6O4XK%5js>E1Nr zKBAeL3MFoRtl8%f^c5vt2v$N872>0U4JiK>8c#{P2mcqrOYCz1JPj}8w{?)nD3=P&$n|2O)JJAL+- z&wO*&wx??+T)EGq{MB~p{>G?bEqP;0!moVBVV*;aw^lW?W@Agv0T3l`iYr{Cd4Z{D zCbfHF7t7&Jnqf8VZTCnis4zKZb{*q(R=$=g&9!oF&XaMb+vo9`rXolb=BN}%DPT7- zekAHMJRmLJpO@f3&sLeD3m?p6%?KE!e*y%~1YZ9sB$S$aFEUk7%*hws)9*$kRP<7k2`FC9ZqHKPGho_L_*PPjbUBP^_L5z5rxGC6uhFk)=aCHJw8if2s#oiJiNZ@1 z7Q~I}^jrF9YLx55*q5mZ?Fog~65esBJ)&YYnteKH$G0cHSMm3pcx609!z$zq*<5`ZNSj$CNst9|H??kd*I+ zaM!7rW<_M4*pmIz`IjL@GAI^LHU?ui`&m{P|ZmLL086ivNh zjTKRI+^HO=DeJ(J*OUsHXA(Qyz>AComfHx7fh7zP7OmWx8M(Eo0PGN(5G?^F%OO$N zRXHeE_4M+9vWm2N@q-qi2cZ^^)~&XA1C#j1x*op`4h%3<++r^LHi ztoB_^Tx7RLRgeb6IH}`H#!V!XiFEl~@!hVswbw4Q3l?kaKrQJS!j&|I0?(^uO_;cA z_Tg;n^k(H`d(qPA{l@C_egimfZdhMJ(fm2->^d}gCaTDD%VJ(_^sS8@hM*XLC&G7B zGtT~4Z=K9sZ|5*A0LhwyA>rD`Wo=A{as0D}gre4)n~@bS-%s7G?FgAn?KBjy3Q>rM zIDr<;J2>2|3wJHL{Xo0-ckZ>1=)6tUFjgGMQiT|7w&dusK=RBeREp=dpqF|*$0*$! zp=eCa+05%}h$vr|;F$t!#r=g)OCbVCc2(7L)Q8uY-KW_uI59b4&A~DPS!RQBd@&vo z#fgyGNJ_ohK-6UZ7AjC87o)Fh4#7t1H96lyl0fviShx#!L+$yx246+SFq8w%SdcJZ z2<3K-Lp+y>>~aq`Oj#!{0SJDNg5wQ+*|6WtAfoU=hYeLpkM5w>S;s^#rEplXQMTTap%85eHZPVG0WTA@34D*V&0*5~)NBl}It}JrRq5nv zgH23vAPuHtznIq($bshS(S|Dlj56A%oIK#z=#ZE251=Z8lq*+94z3}O$)UsOmNgeB zB<|K%-cnUw6i`w|;Y1#!N{pg-{YX+RAa#1iqeBWTvv=&%_3+P1vqfGNUE(z}ch6gL z{98Iv%Ml7}3OGM6Z%oo$o}z%$((8fG0p%DBmamhN+(Yzy*IP9x<=!>j3Ciq))E)ks z5NG-N>At+QgUh<^wt)ntc3ojsR>ZRIH3HHfWzi;st{@Jy$_6=!!=Dz8uljpG_z8uO zY)~{9fy|O*C{@w$8=a(?6Mwlw!b&e!wLGu)FBg<@k8%RFIY-nuzd=#_#uih5up&}zu=1H(@Y)>$Z)XH>`-EZERKS68cVfB$ z%_xBhlQzZl-Gl5o7C+LYguInL2Q0P3i>EI}Oo}r+&8W9yh5rul()dl1YT-09TI_tUjrEPaxmS}bA$lp;Bj zirI|9+T3sg%?vEQ^y^Jgsx0PAYOvC6)OUYb<%#n;I367=-K)eZetd+BeXqx~J0hK} zv20*z7T3-lpPE@aQP}IsZOx|TofPl`%o(KKFlK!-j~5&=K5SIT13#n~-7Y?d7ukMB zNB7+TPv?kkzkLe*mKH>~d!TO(FVc+pBA}TXeN@D5w2O#4;lHD@$dv%j^iseue1>#z z5f8dYU{vb;*oZl!jGSoHw}lx*Sb025Yk^v79!&v{^)u}}($V5L7zUDJtu^#AR?uje zf4Bl$loSv{#jSwcC**OKxIZIq6MSjO3bl3R^qq#(;JV;GkgchjvD^CZWoo30RZnAU zBOinu!O1`nHe(R&O~9&Hl+q$$e6wmP=wW`~L1S z7W1yrZCA(>_79E=lE^j6x2vCq330P+?z3HWv7Xi~)u99KKK(M6)Uoeetftp{qS5yR zQqw5!K$lk2K=ioSNtB^$5bNVw;QHyY_jrUf@(6+dj__eX;J}Ut@3L-iT#8-|7{KV7 zU>KnwDBiVc6@frH&@7X)IU>WAD* z|6p&raEn4f9*V!%w0k6kW9m22Oyz^gntuK-KjIZi>sX(kD@mCy+hZS*x-XJojD0SP z&5T!+H>cR3R0EKa7w8ZS?LeDqYn!HwZM4xEo;ol_GAE$s;m_(rCGN>B^T`1&w6~Xi zCE%P;WOz%fQbRseRSqW*-aqqq#kaZEgYnl6M5DkG-T^l zj$@Mtv1&(27WNO_WG7y|g*vzJZ5!xBh9G1zp0{kCw>2i#JcKS8;Smxzh^AT~3LKLH zRb(_aS`xK%w^n5?9l3>|sA$mb?qceFo)As)2{GzQY7t)Ig?r0g1kM`bh+&dk@U8R< zy(j(~N&2a6?kB<FO+t$O8P35!QlyOq8y0E%krTJkxzHOYK9!SVheLld&^L)sB?UsrY za)!t5aNL2ctcSHBXrFSHr851Ykx)7s=UK}ka&xm{TZP9l4rPw_E4;mV=JY9gt22-( zpg5!SW5JtP%<w)F_Cwii2; zYB`;6!5GejMfJ&)i7E>!pq@2o;WODFz`hT_6csq+8{`8w*8DY*XY(e1O&%)wYbUif zZ{7&x!I>&%F(N(nB*W3?`ugW$Kg zfy%xm_?6Hyt&(UjQW_2jXP#{F%C?AV(*~^VNR>wXi>n>lYR#rzG2$a0XIjm;iq1V) zHu1RkaHvF)3a6WHTpmIc3!=Y*K+GjZErNw5u@B^EWkwnJPjjR|wTTJ>(J-*H?zKTq z?-dvP{O+k2*jvbmI~ z?N+=}S8=&}jD_Se;stxKV8XXSKFbM|%J7gWzt$MAaBR{yXxMuP{g7Y1H;C%94 zN5Q&rrb5+;18NG7iw2W8Kny}e7DOLSDmk^u4}#!GC`lIid$9S@8c$v2K*-~3f)G<1 z$y5t;i=yKZW4GXLsb`%@7-gzo)CBA=b`)!veQeHJBfe@;117E~K8)BtI#+wkVl&Jx zYUpoSUQli)&0&|!gbT}%B-?qBPk;dO&2hdt5h{&`Kue%Z)sRpzwqgQO?i6!Js+BM7 z)~!SSF#mi0`tan9`v-_#2P60C7(cn;9E_x>{CRzZzu_er>SR-T2 z<oWll@McR+@Lui6 z=iUax^4W`SiMQXq{Pvsg&isKEmjIjS6z$vI*;iy-XjM8gsZpvP{hjRSu(K~xva#c) z>ops|)ZOp1EnP8*r39PWnTP3^Kq?lht?4$zAyB+nG`i2QujuTiubBg$+{2F-H`K?Y z{Nn>BO$foG7qSydAVqmmp=-xqw>2Eds!=5YGH#)Or4;1??yWFHFB^6cv(Bg(PKGaX zX5XnDRscHm#`9N~-my>-W!e_)o_e{36LT|4;x+oM{smlsOLR@0(_3hbVW^%d)8H0C z>|;DSR5H|rA8SV`kEBdkK=5*b=;Ze{#<2UD14vJexjaO%UpPA0F5j_D)5cEIK!0T! zk&qLNiUy?Av?ylSVa-wy(!OjF99MD+W^Ml^WWV~RIF z(Qn^9KKosG-GpO>QGyZBj1(niRC2HCH7!+B&*`x$iCRUU66#;*toxMG$Bx_5H`RoF zPCeuPPOyuAPj4#L5I}<{L0y-aD4VbMxEZ|td5zGghLoU-`ii)&z`mlX2iErf_(&YZ z?~jkY<6Lo7SAhDg$+!}o!Dn>f#_BMG%z}%E)Qr|`b5*)Eb-eL>ETJfl>;1022E!7i zp`bg>c6Os}iQ!Ou@mVfGbToN{(g|c8*yTyrVoPzi0^a2w6k$)0$EsxboV6RI_tLjM z-tm0PaxAPcX9bbsTsbQ9#o{9?%(4hHz)fad1i&ciE8Pjz->!`I5nfSG9EW;*_V)LW zUp{{MwYSZ6EWIEk@_c~2NV~J0Z02&?C^q`EUa6*0(!*rl4W55-?{~)n_?gc)TQ2xi zTwq>d0!TydDU=f>T_@8wnd`n3~i-n`LwtvYxRR|Yp_j4=44 z#ad?DSk%%(Z0ezJi{=fq2v9sbR{Qy@vzNWs+N04WXiYR&hS+3P^6aZn+04K*7fvkI z&}rB{iu0VMv1=~edwO~qVb{=?M)kR4u3vxk?8TR|M1IRqossU*5mVfs`^qX>BN@2} zJQ19T1%deMnNc(VQ!B3o(_@#Cot%Kqoy=U~XSd4W5(UYQiJDZ~4C_zOj<^~@N)9}g z?G*Je@n};xIdi#L+AW!Z6BdL)0bbAGXGq_Cn>Y!YyExcjkiiN)W5&22{OnU|uFHUEEc+@5pBFs$jLZj;w;JrnLdVeZ6_dyZYl!D5w_$lT*1<@_E{E=KiWe*+m-_91?1}%bvrLLs8Vix zC2!PkRyDpJK4cYRnv`e#Zol_W^`J*LK$&-YARiB=23Hcdiw z*nT5DCOJXSCF`9S3tKu3zqQ?h?Z=C^MuQfS`NcGd0kBMlSV5|z0sE2+(+01_DKcztqJR;s$MA&@+hflL$_( zD5z#m>eIR)kwz}u32qHR0VWFuvkJT&5)lQCOi@~~AqDbXXgAD)H{sf609-h^bxkQp z_?^>^SqZ`FTqn;{JwH!&t)gdS6a$!mj5KNt&?0X0zGPxh*#OX35kpAM8_vAqWq|QEuNiT+HlXldQA^3_lXnQxb~)$4c5stka3xVf+PqS z9|It@p>&2cGI=y{WcDt69W=l%I7A(RNk!3y2~>-QEOO?>fohToU=xmIvE16>OFsKo zQlC6{@G$>7)W~1|+4Xt~J+e~t%@6r&Xcc~K|MG;~Z)} zG&L!l9Dd3FPoDkjzv@9l4+;Lx)tS{ed+Nh|EerCQ$W7?JLn{mXV^Ys1FZR~ZQNHe^r#HDHKp|Kp!th|d z_61!J!5MQEb>L7D$MbjSX>5CfuYaHsJcz%C^Pn^jZMYBAM6f^Z+aIVT9TV&chT~4< zdG%g)`gLmi-`FqPby`D(_0V+-r!{I#%azq_N2ZV>x*uRHRFZ~oUYWe6{+Y>NY}Q-< z`2~65!arZps}uf-qaTl>=~>8^IeZ7;`H=^zQ$XltS}(!U2I#b8kAkB0g~v}^J!)~3MG zzf(ACxuVZMa2xK6H&R3U+J7{Y{2Qsile;tRN@p+<>2DNocYGDYMT{gbH9k$%I81%{ zN$SfxsW1O4_2oyYFO%mOe)x}H9es9mnyNy-JWT!cDEVcw=)>f<|2O`Yua?5!WAKqK zL${P$yOOO%1AbR;v?7%GRj?IoC{bw(zJWspHj&K&gw}uA^#|N1?~jk~%<3svh{n^V z*;)QW{u~`29esB1-oG3j9i6!U!QaQ9-#>!C@z33(d;bDO?%qB5{Ql?1uKeBOyPy9{ ze)N-%B=Khpmb^Uwm-*%S&T^Y_da*8cm-%n_2l?;cop4^y>-B^DSF|JfsXOAu^xef8 z%vp!><5&0xemt+2o5S;BQO$22b-M{Yr5C8uq z{@nQ_`y|JW&mpff{IgmV^VkK%6#}~v_*u>>RtcdhQ_542hIn|7UHN709fSm+%6%8> zNJp$+$`1${#OP)}xszqT;;4iCx6pGvzIRs4K3ZV|&)))cEj+KV0d8|u z<4)^be#rdFEU`%r&^*HX8Wwm_RLcRlyWmFHop~tsfdN#652BTI?K6>#2%82ri{}3P z?F?`YVN@@^fBt;tfwPFDj;)?L|L*WbG4n!9XFoUaPr3)cno3&H1d*IU}9px zC?A2x;KziEIVmQ9dRT81DwPw1s6~@97C|)Lwwlk-1ucJ7Zt`#b`25)yub}U5T+0-t zBq>H9r5e}@$J6Xzzk>87)wUdOw%1j;92e7Z zv3bN}Sh-bLy}LLBx2fuaQqi&_F&4OL#*<=`{p%}otF=p=y9b$@?7{CV#D;yf*}5A# zAHR5d29_{%js6b3oDW=IC}Y5EJ0uJ@m#^!Z9M;?gwO&dBQusn+PSBgQzFyibaScXW zvaDCd+C502!{_d?sbRAELruPx4N5gaTJReu0>s2Kjt<-cfH+au{-lwpQ!=z+ywJa% zt&3GdX?Y!i!!k|h1;nRBKJSffml}v#{khM-<^Omleuh5w@&A*1pE>@2a&q$7y}S4B z5&!@Ef8_sPo3y{H>cn@;Dqa_G*=rXh$HMr_rv05; zm-d&iF7##ez;oaHqfg2IcmG)aFQU><-N#<}|Ah5_$Dbb^-#-EU|J|d{{)hkn5`TV$ zqBjc20yW`CA^ZQa_iW2;+)BzhsZBf&d-4T)5K0@7vUrm$scLLGW=L9MMIu!qCEJ^m zRZ-+f{>DD;V;;6DemdH|02p9qbV*_>$*v}mIcPM1 zM&mLKpwaC#>zf6T>KzcH3t}b-!4yjPPPJCD!e3NtR=BZc$2S{I9R@je;y5KhIB2(> z(v$V#YNH_1^#zfBiYMCX>P!;yPXYeMbB<0q>a8H)b-k<-J?+n@D-MhK5bPg1(?&qX z!)ph!?W0$Fy2h36!*YifI_dtPjTfNC&eldjj3C9n<49w|u5BRv3v- zId{2W-sV{I`hB16)qI+m6@L|(Y%7EIy|jeu8X~PK$`EpAlF%M0I@t3sDRU+X%}8i% zY^z2ymBl-TJ`1yHSt@?q+f;l2l2_*)2bkbS>&k+KQIbj*DMgCUkViV8#=4RJV6U(+ z8;b5rzFRl z%#O1P1HKnoR%FV~I{Z=)!G%^w;qm9^1!KI#8>Bjlzf?L(ij+Efy4 zu9Sm{J}xy@IdJjiisC?2*m@P-=cs5yR_c1CBk#Mqf{5CZ){R`@toQcd2R<1un538T ztAStI5_$~A*y_xSfUMht_}}9bp8vbU;X5zmD*c~@l@*x(VHt2A1pnn6>Hpkcx}E=T z;>l)(+Q5d_i?*;a?%~5=1N+e&_OfsO|6uz_0 zcC;`zC&)>>xb!%ew_h(h;{88~~wn)%qW}|GSu5ybnTPp7j5gm-Dyd z|0bSv+5ySWIJAxC$t;!bCXz>Z8x4rZ%%!@=Lk;#sdZ-```-|G}~8yDj62`F~;Y zKCS;z`ENPL^562(?ficu51s!tl_tlYhc~EA|HLpc(BX7TpAE9PBYh=RYK)MLkGaSZ zdXkR%<^>+X!N1(UQuETMTi_;Xap|A6eQAG!#t?8T4KjT0AI+jM&;iMnf<`lWvut(n z-j(t+JeEdiN9@@VFD|ppDXp8(b{u49SiT}X6Udrfo+z~j+5-&?AB=hjXn!zVuTN7B z@l83&CG!awGq21r%i_^gSTd|OK)gdPrr5D*Z#;p_$S5xR$fP|H!`39SULVM2sJT#w z9*vc;OW+B6N1hO0Ag>s0h73}R-j8}PuXU8p0aSM{k)g^|+3p|->?bWY!Nvxu$eQ!f z;ZT{ANb)(X5A7(AeQWjd_QobMc-n$kXTxm6W2@qXk7m1Zr>ot_Nhj)bLLSxKC)>4> zAj*LJXS;YlDQx9V($d_nZ8s`q(&u|=rraF)P_;Qo@O)Qp!&<55#lKYRV(!~{v9WiA zCLzQe{-Q^p0lK>H!hA7@Dv(w&-;(B}3?RN4CTt92Im4rIx8Fm}*gk1AG6|~n;G3i| z`7=feiR#;g+Kp77>E1r@Rq;7`bZm1ARW2dN?Okfept^HnUDb=&GAE#(82c2>PmaXN zJTZEXHU#G>8ysXqtLj!&Ps{+OGQ*tq0TM6rb`uFh=W<#qpvG_u>A#X&)9}&m?E{zO z%db7j{)V5>{ts(=z2h>j-2Yi7{eQq(gm~Ql2Z>xvo%e0-2*Qebg_)N(IuDySA=&n~5akBo=#0B_LKGT5@ zD*BTW=W7E?tufbnau5IewR;p|F_rn-+38V$^W_K<*D3C{(gR8 z`99zOS{+~KO=O6qJLHG|mAD@-WYp-->AD8J-fRD=Zk;fEg zD!gW5>lBk9yo%wn@eum!^YgXy*JrQK|Aq-ZEWiH#`}*m3XK%lMTYikWzb=>SXZ5qU z<+oUZ4%dIAa9M@RYi}__9scoqJN){5qQeFOI{f{a4D<81^B>PJtZMh&Iiz3H;WgkD zmH(j`eypp{;a5R@DZRlD%zxG77nJ|%WN7j8w7fPn`F+MLRqgSSVySE|9X1-u3{RZ} zjYtpYZ#+=``Kv#j|9$GC^S4uX&VPU|@n2I@-@Tcd`W*it@t^PyF#mX+KZUQ-Ltd+p z=N-uV&flm00m}L(=yQL^es@Ry{U`Qw?D=9U=;s#E*7NEY^z$?BuxH$JKbAd~+w-w( zg*DZDvA?h1mI)6!Fr_;`e@ywje)~%1J6Yv&sH;4}^Wx65Kr`Y}p~XaCi-o59S&0jai9oG~_T)w+Sh7`S z%3}X$ger}q4XpPMd*4!Cs3lY=h|*fIwptO*wTfs|n$2o$wIRN!tk<84W?eM4t4;B| zzP%+XwVmo#y|z)QH6c~(gBh|@8z2_VWTHJx2Ij3ZGF(_-y;a}6TZ5M8S_#Co+>5!NUy z`GaF`(DMduPY=eiRHc@~u2B%J-YE=+aZl`xJL13_c%xn$ce#&F(aVHCK1IdZgA*LK z=*h$HLvxIIptdGvH*lJD?(e9shBFTWsDqPwi3lbmrClPlN(m|@8k$g;lDGqr2x=jK z`Z1Z@EoITRn#lGdjQfWq_Q|r4kNn}CFarmW?5=z0CH)q6W zpP>qM@yiM-k2?;k(Ytp$M~8>sICtgrDiCO@Q%i2RLgHCjVF!Q?G&F`6DnT1TsfKTi zeKQCwuwr4TnqeHeDZ5CspQq?PK)6H<#;3uaFVlp`!r+x@LbPL$(%>w5QJPQ%G3ZRA zzBi4QaCTW;j#Mfj-EeL&HBp!|bS7g>7zLPeh@+I8XLbyJ;9GR?rN>0rFCxG!T=k9E;$?F~n}~vJ9HVVaSt9(EjAFsq zvaoQhMX_KsSy(u_qFB()EiCNzQ7jlS78Z`6n7m-3urtG%BZ^lF9b?( z^zFK*)3yw4kf83L&Fln~*r{was&%Zz?99$A!qs4;_`mYaf`Yt2fcJLBS&)DWB9Wby z!I_yX2BtZbNMwQB?5s&prT&CiGwy;wN%}(!bOog6Ku^l6bEPT1`z%soV3F|4)zJ|B*fS zeUx#<{?Glzg*@&5EH5rCS({SZK>uzbU#JBkhXd*bbh zg`CLe-NhAmF(RMAnV0qZAZ#~yx`So?eeb5PSN@@UG zsM0|Y;m!A~szU}X-&!$!|G>{2^!9BaF5)7P_IMnDMf2m8Uj!6EJZueMl^KQOmE=Ru zhU3NSxcm4PFvJ3Fx5a{}^=r)OZUi=rB$XzAOeo)Fj#n17z=kHd0;7I`@gA)f$yQ_} zBns+=K+?QLEHs3xtzOt*wmlL93niE4F+xDLQW6IYC-)<0egubXeAqCyXA%Por9FsX z9Yk>0az_Z}$5e|9q(niX?E1aK9u6)Ws%?RUz-VD53JN7wCPP9{X^SNm8qPtPXo&}h zvBxpRMLMzx4P_wByu<+`m~8wd78=Ekp-Wndi34_{z?k%r7MMgDfOT&|kO)qsuc?(# z7#cGSl_{H8XbAT>Lh*5gVlsLY1=(0+48TAm(-USOJdYA=uQ&EWlNZ6;`%xH5(J|1$ zaTK`U!kzjad&|6&7Grd_JyRzX0=8MTkXXQ+WeslXmpU;-&HXl2;5QiiPF!};qkJ6=U) z?PB4sKL5n~JG*rN;M&X=yl{eFUIO8ZPyf>WAi)b4_&uP1aY+F`xD4>cpPjo(qQ~o8 zQe5}d9Wi`kv6@~;XofeIBk%?DpiHDB39w^?kuc~Z>zPho8UkD`2a&uz`NE4Kq)9Gf zkd(1}kwP_-DkXHjd8Sh1^2%o>HK8mRGWc4jR~b=~F>MZT9CCvtR6xS>hdL<)5O48t zk%*@k%uc>Q;uIm1K{aX^h0@e0O-3mOD1lWop%0qnu`^``L0<*x7^eb7I+5l~+!*rk zjI+3fN77>EbH_X!eXJ5TDWO>j%vD+mOZ${GsYgM$!m@rmYIObFfE(A&vJ{`EZO2RT zLj=6&ctdZ{;hlcluvvOzgRVpfwa^HiO3c`}@{58{ej1P49`Fy=GC zCCiPt4Tf(RFg4*&jGn;Ec*!k^pm=9tpf&A6Fpbf9N!w8DPzM}5yAJ7ozgG6R;1FAz z)l-P7i&FkDV;Se@IQ_!JoH*^b6GBd)37DA^LeHm(G~F$MS#x)@-l#qkLAbnL->lRU z(kwV&_B(wFl~vNc(WEcZd*0~~HHM&cm@7lY>w-AnVy#hi9GFfoLi;K7khwxAR?f^9 zW$8FHWnWGh764y??PsCvuVW1nNZ`-G)kSO+OZCPxJS%zaXs zxSTPZiNP6Mmg6VPY%4`@f($DjoEWqv_yg5fmyQw)X(9wK5hZZ)hEY_I69lQ6bzq`M zsBu)FJBcElrr-3@VBmRpt&kFis%>6dN~mE`NEkz?fC^!D8R1-r+d%qx&wp z6L#+#IeSz_4SiJUpmRu`Gx@+#=~9+Ka;Y~(xw2kqR-g})@ZbvG^Np%y(Y~+H`+Y)h zJSsV(3ymX`e9$FfpvxcrE{hjk5=6RE0O^td($#WASIH4FAGH@Hk`6|ifrw?4HjWmH&mFvLB|hk3^P$Wlgf zm9%ud8c8|ORptD&)|J&IT4a@fQPn7;NlbSLIs$hLZg-SjT|$i^JIc4X8U(z&x;I{0 z8QH-Vnc*(VBCjhY?HF?7h>K})o62BQmIZfLk{px2s!CirTs_Y7!h!10qQE8W8)0{3 z@Hotv9ExWo4{8m0A@pG-CR`sq*`d&Izc<{@b$IJn0Z^6~EF$AfxrW-Gy z=i;6ct@uc_usZL%RujuT4_6WWo*2fA(tJ_7AFkdAxhAzdRZL=MimPWhNgC05!B8_! zK&dD^!n_t~wDIDy*8Zg_E}R#x7CZHKF&I4|`Yn;u(c4$92L816WnszwB3?Qm!t4x4 zIp(H2{`r&q&y|0og1MYfX*18|++v6d3f6rkLR^R>M{c~iYU?JhYS;bT#BtlGmS*j5 zSI^Qs|Kau6yD#JN^Pi=~r6u(Ly||oPSy*0LA^Q(_BzSxNa{~|Bf149C)s9+@&mW70 z%+ez1^ksATY(6LQ3+__R&E>?%-}6QjUsO(qVg}Q#AGJhrvx={Hz*6#u-;8<(-HE9A zlV01C9@Jm}pdB#7muqVb^27w4xdt#4No~k@(rJwj!Z4mG9vMETfbQM)PDPPb>o~%bz?k6g<)L17>`liu*axwoX4nc*kcq{+i?uj zWqtG%+wlgIuf7%qn8Xq@(2A}|5aX1-eL{w{5+{Ub{yaz!e(`A1^+#isrnuc)t8X<- zjP0#;SDc)jWat|`I-r;bNQi1BYBRJmJMjA6;W)XD#y0P2D29`Rlz3PW$@TQ3i9Zx+ z0WY|}l1jy7a||E(4%rpOq`h!fy_EQrZtc}~2R+#wp=^L_qg{3aEQEMrrI#c;#FuuD z0;vZQdhgzYmsm6DZn(LFM~Y&OXjy1=BF5#&y>RC=6?hWvoQg*x#{i)-@I^t@SlnZ* zw8)dSGa)SMFzR8!pv~ab17#C7>5E4NNpecrT5Gq)lcXweKFl9ZOD={bzK@`nrr%*E z9=pL-WwqL9ZauHo%9UrTG7&nV6>@l|Djg6VN3bkU#@@rER?*{=-lW~7;-M%ZvU6fM z_KrG!8u$(~&se~WgBjsHvnYA4HuXxbg-72=6Lbc?JZ6^YFQnDn5-iS+M!+nb2cUuQ ze%CI(>kP;`aF@=NvCf}C6}-XmJlVR12FgG{V@e_<4ntqsWUQ{&zbLLZY^o0?x;TBf z_fsfD-WMX-LnBBw8?+^5J1O!9M?*d{Pf5Js`CNRauq4t~kT{+HI)dq5tK+?-27hS` zEwcVOci>InaA#GgKWQ^CPp#0v*C-c>u0d-7nhN~MvmSyyc2fDh-v}KWuA4;2`p;?3{bUjya z-J$0J_QE)rvgUdN(7-6z7!M43@@l%l8XgUdI_jBYY;#ey+U_aY5imK376jO=rUXoU=IJ0{ zXixEv%nd-_o%m{+wirDL8r1xLauEYNPC{4dH-(w5V)|I5iEn;BFobXL$>2N@Nk#&Q zAU=HBdfaq9VDl)`1X_z3t!Bh!vp%2w z?YeY#bx)5ZY$top^G2IB(oA2gtE;Q3>*67)TM&y3XgKbhY}5~+u6h~)d=46G&#^8% z6hGBVYI1u9Qee~m;CY1bHBGLI3%Je?*o9K{i#lZJN*rbc^PDkK_oo-4JIK5fgJ!^cp?Aq(;G#| z0TBYA5bQ}8vbqJhgy7c811)+SSAb$653^%AunOi1r`1JgSf5?Fz5sK#x?~fX@O|luq5M`Ow#Ye6^_|ZT*KipSGiaJcobQ*1QS+L;bhb(i>h( zTyOc%-mX}`@hI*svVd7&mH}ywMwQ)h`kAvScXmpwcw=D>%h@VLq1b#(*J1Wa3z$1B zDVQ+T(uLfiLgYg7dlpY7!vtpnwVIJv%-gQCC^)fFQ9I3NC03lcRg)fr*=fV5mIouJ z9~{(O@gF!(?DQ_gG{k?FR)4`0NSrEhPYHCn0Y@Iy>4aH(9_=;4M+>^&FM!Kc=&7Zj z3~haDx#6wp`Q=UQZ}cs(G90v{SwQHob@2TsmRt~N2bjRWgvXh=bGiL}zM$OmNzIu>W zj)Bx^vo$cV0K`QhAVXMS7vbde80@Y8^{+@Q%)2))I>(h`03Hg{Y0etO-DY10a;Do= zOMv51k4B(-70)ZiG>Na1e@vAu8yXRG+Y;Z~4ra7UBg66ydkALjV3D@Fty<-M1(Sfv zq5ZaDRR~-3TF>D~k=IO(H)~f+_OoXSZEj29OcFb!&k*nkeAl8PK94RHkDT?1LeB)# zOaOsAb$93}px`w1S)<`mEvO8`z#1t!TU^9pBJuwYyzWU{`q9k#Zm@G?yh9>(NJO&V zhVlWo;E_G8K*3?9#J3O!#R)WIQVm}$-A{|;+>Ck1zkY{7TV0MB18b8a2}@N;wd%}@ z-cxIB9&vpFK^fIESFy$|ewq&p!!l%NS%xO8Uyo4VAE^Ui5UT;qXArW{%+rcAUEM;J zPSS-=Yk>WII2Nc~I1dEqot^ms_d$_S$z|H9WFj0xs34B!r1?*5*{MRjyH>@cV*mz2 zj0Q0zVG^7x)KxQpivY-F)4=(l7Rj=kTN=ryd)4DFa*e5L&(#xw1i3|Fi2%Hu(1{{V(8w2XX8JxvGoyN? z%{>BhF6Ig$FkD$0T+bjVnkhe>S^RYO#X-lERnzz$lsjqtLf7(dSD0zC*A^NY5(~Zr zMO6!MGz5@T9RS|s)j6=ySOon>68Fr_izO>sfnTkdV&Du;MXN?8wp9+`+PPG3?4AeyB4`3pUI(FtEwYdj_A^%i zH4CI2brztw2yc6$`*H=wc=*mfdcSx9+#P!1LeUn3WMQZKM~9}Q#iP=m{~mmGEJ3Mk z)2!jl1@?BDgPU@y^VXbo2B5!?8iPI179e%^GzN~w10oq#Xy#otho{KBgH9vdZ;)e@ z%uwY(DI8L=Bpb0#|3H zN}j-t3UrHij7@CxOJ}jbBe2f8dgWZ?gcqBes)5-9>QDvebGIq0`bpZa-yH-FLiT#BMW1<-I!K+%YNL7YjTW10 z(9{cM$PrEU73{S=9t*y1M%Ks!tuU}Oax#!M8u`xy_d1$ygVMD%+Ayq(Mxp)z)zwxh z>3hA^S5r*}^f@P}KyPF~OZJNOVXk^9)ETE5KJR69RpN_@!VIDFtcuW{xrDZUhGtdT zSS3kuebC(#QgXwsUW@qRFCoEFx9E?S*qL$Fc*pK|Kj*mAQaTJ}_7%F@b?6d&!R{@S zM`i$!Po294)vtR;0fEm2yKyj$=Q12{{f)*%^BKPo#Vqc4wN~gk{%Cr}$MU+Ubak`{ zcBs|{!(>#&PP?@9V`*BfOZk}Gezi%OV;wiYYS|v?@Z@8o5)@SU%b7Y#A^)4Ltb3(d zG%9Z2Xi2p=uBGw9y&=5goQ9RlEY67Po8tKw!tUI%s=3*D0gGvb4>()CWZ_7qP`NMD zcruA^`THd4-GR|86C#`d`W1w{mZP@8%7cifOMg11BOscd{k>8+W$qID)$6H>E5fTMq}4HJYLPz97Bjh>>7wmup;A_6vS0jc z$Ns)lRqF&V3zuQnW{vlJgMcy~TxyHgz>E7+2Di7m0bf14Hi>KB=?LC6v^TtSX^5t^U>h73%lWz=uZ+2qxn zjR(iIH4DT$f==-S`DgPvUw}ii7@(qlz-Oy^0N+b|&sy7lHGHnIr>dw^#=JYh=nMI# zFR-wi#ZWo00!GSCop`AQ;gp5pG}qotvn~0Z*p@1W%p~F6++9cnh|`9bKH3j zOyUYhk0s2M-DNB=6mfwxcQhq0sSs=D48Ut*jtQmV!djK+eHRvtxoyq%eLYeTV$~Kz z%DZ!PCFX60aqWT(oy)u3y}c4YXW2uSk81{6UVyg~On-@=3!w0M&r;8d{uV(x!}=35 z_yHp5EF&ZI0qh)>C2KgDrY6xBvxdeAw*U8OUZ}>@gaE6QD4I7g&OsFYiaRpJ`H|V< zn|BAN$DLE~Zg4(uwY3)uZmu#mYLo@cRANzZ_?;H8Bb-zNY@f ziXp$Z6q546{39&hpXWxp$C1g+32C1@Hxk-9cw4WGHvLfjfNgoYk)&ValuyeGhexI;e4{CmkEc!6$5?&#j z=z>OqPIb0zy*Cl~gCOWheLU^67o+TX1&#Z`Thx85W`ekuunA~yUC#`R{tN;|3{ko$dP$3h+W^-bu6CO4 zaA*(>+9-G59@c7$SMt-$?Xp+iFcmvyPiz_QevR=%?}FgA*;{g&#_QZagRpwrL@VYypSs27pWd#$hHm4sH`w+YMrmc+7e3{q%vWnLI~*vNkVzC zW&=Jz3%s3g_KAjDZ+!~Rr_=sSgx{;ccvd1c*@$fsgf7{AXJuw_{{?>(vji>|pXVVN12G$6G zQ14a>W2bA`PCgfE5O5^~wZBY;V9#}pe03@w!)=%!NMk@;A_lE8T*E}_fAfa-daiXeC_$`J-9Z` zFUZCG&F)X#gLiK_Z|2L+ulJ5SC#So|r!$&62Q(<+(b;XGjp%1Lxp#DM(Ag7BqF^$Z zjz;G)M#$_Y-W`et6j^?~$Eh?h2{z{mR_Eg|jefw9ZAJfye;>C0Z)?LE>Cze)KW}F; z(evj~Yh&>Ny|5#i+3bU8<7RU(Sg7HX09Qb$zthfJ390U7a;X>qC1c>xN)MRwM9-ed z@xqRb!8P0I-KsQZucX@7v2Mw1#9%ceZL$T7SD<2a|+9-1jk?p0D;Tt$mxQg&Fe&1qC#_PJpEyc+;fzTEu*v0)g6<)%VFM2Mx!`Q zz*WHr?_p0@#lL5h1#Dp|&k|McHMMe?pU<&`;V3PNqmA)YyN)L*Wch|UhEB*dxmoyf z0G?lFlO#ZVKl45STBDQidmKqnuWyt_sB%;_WE2RGqcq;#97_m00B~aBT*h^KL%`_3 zp%FeNx50ZA16-PX*eW4QdvOqwVN=&ilRMPnfR3ase1Xa?GLG0cbqw$>nk%K!%`xiYo!W{B}0nBN2TN}9D5LoOYxY7UQ549gc_ydmmA z8Ii;t6$maBilwrHiCV8Jqd_*;wsEE2VX2jA0BQj&ozm7ul$dHS0cb2Ft}3WZ%a#CU zuPkT?I0Z))Ce>O#ml97rz3H-%X;f#u*pT;W({TDLs(@!oJ20XT5HZ8V4~7jBs!v}h zp~%hb`(S8LY5?N+FyGVL8XK#(;P_8LN1I|0H#dS?sqH9&v8fIo3>=CIGXH zzg11MR%N;hYk)_NLuO?gAUa9`PBj%kTozpgX4IXN%=FVhGW!5tDZ*+3}wtJ8b(uS{v=n&Gw_#(@pih)qeW;(I4@je~*tJ|M>#rKer+L z^W%pbj~=!kN3B0?wI6M@0^y%`r#HjVFrM6s8%7LYcyO1v(Em9cs9ipwIL;StSm%p- z_rh_Mk#y~M;m+CcK6i9)_Uvlw>Ad+6Nmx-sJ+#0El32sRKk&JcM_{ZG{1AG z_#W7sxG~_9$t2Ad2^HTTmWyGEkBW%$_msGJ3YiQsd$E#Ra=L1Q$Pn3JFzgK#PYUc( zHh@{J{>f?gxbtdhV+n3yCkp=Puc)RmNd{`DDM!pk2vGEn zB8oX02HDlBC5Lo|5E>Fn8l#c3yeq@5FV!K|`txW54K#)ro3a#sJNgb^Z9$Gj_%J(8 z%qs>vr;q?fBlc@WqUSjuytM_**4iW)XOlwe(pIXHN6&AR)o_poS17vt5r;R5K6U&;`XP}x%{2wpiz#%%*ApAM#{0SeDUbpeWZxoehFfZNy*O-d>P1^`#k7gBh?RdIZCdQQT0Cew>cKq zTb&~+f#hq?nV8#@k&5J=JsIgui?zWO5#A|kolOgIFT;3D%CZ8J0zbD3+9BkOg(*Q@ zH~44(1-8CXJVXugQZeC^qN`X+{3Tj9_e?ghxwWs=&5qzIIv$aVSNk-Na)l;}SMhL!xlz{F#SKIW`-7-Z?cncw^H=!l+a-7IQa;0R-zwVM9?ENyL0G5Y@agl; ztf=zLLd4>Ws)dMyI`3#tVvW^&<>p?h0Zpl1BO3g7l>xG*3yg#6pArx_bnXYijVfW z6TU|rC9&crO;9${H==o<+GmiIS{JuBHREjTZZ`;gPX_BeU=9jq!D8#`n8rL@-9)}P zG+apR_`Q_80GvZ&#bW5RD&*F*U%7A`WI@NOb)q9#W7xZ{Z7);QxmWlzf%P40-UfJi z&5W9I+^u=1BeD{3)&JWK6S~GdU15%eV|m4^+HN>Ere|4kVaJs_ARf;+hv(!m8OOcE z1@dJg0`K5tyc{D?Mb5@@a=DwZgxP9naNYo`LR1U>#12ZcB8H|x#1Hn5G2D(Nm&M%P zVBLVmn`7jkAW+^2R%*Ee zP!n+y9mBTyLsxWr-oO`Phy9}y4%_mK_0lNPo25xMVFFA%v$+3*3fwIRsf1%zow6Jo ziVjs1`;e!ro;tUC@{p5Dr6Vqpr zTaFGSvQ$UpnOYbvmx(H8JMWq6JC5XmRUCgqJ@@>2QqWb3^T{4 zYo#xGcJ_Bqg>$Ko zw9d+4ftf2~xL4f?@+#~h(9&%2Y%a8pV1>SyL|7Z&lL;p607RWu}J zU+sw`RSn_3;P#@Cb;4l14X(uS49>c!UeO$KZ%}}ZUQv`&a@^W;ykd_=kbVpbtgg!A z8#B9Aa6@KzUjYoIQ8U4rj>WM}O_@{L&WI;p*CriC>7z&{Xknm$k*bm#wRpME{v31% z3IWZg5Agl9?!nRS%g)Q1lQPd27=UrtW3(~?SN)may!YdPca77qCIO7rg<7L&+V^!w zMuwBy*NB1Son@vCqt5UfqJm8r`RAE%&>_1Swd$Ef~eue9S;IZCf*S^ zN_J`YrFPc<+w%V?2SS?g(Xdw_MqXz9sT!V@;SD@J^_ee<>UUBcUEB26qqG(~82#Fz zd7l=bmfVh85!VtkUtyKH!rj%Djw^`O=pyfytDzqs$UWNl${ITdH>bt=AZAK_ZM7RK~%Ffh{&-;&K^swO&W6iz< z6BcFTY;0+A%8}NMtf&y$&yGX7J(r<`Vq0J}@4}Z_mj+a24L_*M6<~rMMGGiFYVho2 z|8Jd>+AKy!AI=}3ujR<)oT@1qM3EMSsx(wq4IiWkoTv|bz8;Q7aFIMzL_fPu%Ulj4 zvcvf?lNMI2f4r(y?SVEN7F|Wg60Lo=%^o(^=@r~?sWxWLAlUr8)!;O+8D2X?noZGk zrBbN@n$Oe2a?tS41s+TDcZxHx zYVQ2JYHUh-Ym1L@TKtbmM+s>&hOSVNiCg zx)$ZqnO*U{gW-+C%d3i_-b9w>Je_0*kw%oXGaE$XxKPM#wj3xzv9r}^w5@aU6vK3? zsL}xF>4)*M<<$b6Izz;qw>d!M#vt$kVleUQb%v0WyuoS_@GO|8LN#o8Rh+a%(Zspf zB~~8AtbYO(E2BrU9omrE!K|P0f+n=$y^Bem8(m&sW>Sb@IE)<#7R54l(8*(Vr@Jp8H!CYn~pY|>ySCue}1Q%fMCO8(>DcCT$YoiLC87o}f`4h&uMFbuoF)h|dmRIN*EA zgglp2Q<{vK<&-;@+;6^)4D&ikk@sQJ>ZSw#LhCzieF#(<_ScKXQeFMC_8f!Gz?U=Z zwc(Tm!$&GgXF&rbAVvG%y?WI-2L4l3wk@CZ; zCTbU;g%gVY?Eb3HHiDxP6X{Y5$pXyt?LgiuT*uy5MQ}GUgEbzT+Bz8A43Gd* zty0g=qfx_j5$UI^J2r_~L=9-z>W$2+C*8^QuA~m1@uG-xz}g65k%nA50;xCRpuSt2 zw~AhjXJIQIY8ItoLtvKz1sHu9WdvGPN@%;{Iy0}Af#MO8+faz~aa3WL=Jsb>LZcCKD~v%VF&d_7R>saNW-V(&3{uPF4> zyeo823qQEB&U9)_&vqnDwdZF+=PymsoSB!&Wp8{76C5KfuWU>xv_~X?nF}MGQv2v? zBsiuZ^McMsf+~9VMO8RlQgpV(Xn0ecB?Hhw09)Z4<%V3+1!uo6ir~y&xJe|-`(=g} zLrWb2-|f=E!b(CIAjXptWjDC9@tYYBD#>MzSUw?Rf(pTW!TZBGi*92Gp=#;X;r;Q>8VLZt4`1!kw3 zf8X#oq!v%)5OceL4)9#X1sBj;j#El=_aGZT0T*&e|!t8`z?#l&&0|+wr)jV+Et^ur>IQSkk{>qRY zv^W8SbAZ6B{eupNSimC=NaW8R=l@>e1hpYTFUn(4t=+4t@Qc<&%f_;x@vMvxulYxV zqG{BjUgN+Jz`@#cGhRdeF3Zef5KOQ8^e z1C0kfkTfG|LTVPNHo6FW7wO8;mXI5zKs1>QhO^C*ZD=+WR7;s@m?cpyk@|)1UD5xq z;WIAK7fZXo0!lW%YNOcsR@l8bP0@Kp{kMfaEF3#dH?0<0^=);vMi>_z2ynr9)Hyx| z{Hr$lfzXTdz@+<^s5PRPAtsg}g+a7&1@R6~f3f3Z=tyrn6SWFnE4j-6GE4oO*rUOE z2`drf4D3s4(30kT2mCTqbNe*FAfoupy}fW6kjwOcaAgckoOT9a&QZ7PRh!hL)(i{j zA@V9Qnqt#XyH;9GjBN|y!jhtgZP;5N)S>+6vOa^~rNbLVe3ITej?W&!F5GzgYK5}f zHtLc)N3X!Pt_RWOW62I$XfhRc9=ps(f@@diuyOwIGarkSKVE7S0%@O;c>F*NhAxWTZ{p)i7{4Hk9Zz8Z<*%aV8de+X4`Y z!Z}FhEse7P#1X**@>#9}7y!^1|4waYY%gy}wo!K{H)+oFzy&bTh4T~yAsw9=`NR); zj>{ek?ygzf4{xSLh^LGO8aV4u%BO@7YuV-ofCwD#3Pt=K?>l6K?@3ZM~6`1R2&|3z6-!CYR+dJv?KsV6ty>B&smSDf70;vjKo!t z*b67H7jkxM3QnwUW=1<@rhQ^ww!pP8LB|cDwZS_r&B}h6EG$)`E2Az&MXOunVNac6 zV&I-pU^4!dTC5_}k!X}@5TakSz$4nNsBlqDyGHvq2f7FsY9t;UU>(PkvhknCtBvDy z*b5ocXw2LARx4Eu>WV1a=uRK^7yg(_4w%~#edoOBmT?p@d?C#xxn}@-#(=nP_6dE z_Mf8GFcidfQSU3lzXW2Y%r=7z9!X$>R62}E+qqp~ zW1m-6(MD<8_x=;9wV9pnNfDW0!xF-JKs7dOG~9YQ*K7X0Ve28?+c0hh+4w$2Z(&2A z3NReK?HsE4IPDut`K1wgy5JAf5}c{z=R=ep@(Upzd@#rIvWy!eWMdjBKT!XzV&E5# z=NoCWdY|pnkp=-ceol=~rrP$sfX1&br}Y~-LRcSwDlGY}Ju$W`@!9yC1d+7t_EOc9 zcAojdX0(fNu$ihTB^7OHhtzOe)642;Jlj=PN<3HL0a?}f?&o`$!N>S}&KryMI{iu` zsdhbehXQ>aTJJ{3J#ofR<}_klCc{na27D&BD?I_lxL7HEr-8Z6SdYT$q1^$@vV-z0 z1Zl8d=)r#Te|m20KKlAi!48|TyJnwe+HJhD0dF4gIO4i8OvOw(7ueJ!Oo=f}Dci!r z!4oRMi@{rh4blC3kg|lyN-&yC86IL56zXF^TDMrxmFlo7RU^UctUK{EctJLcshN}z z+7;_TJv1A9Rz2wQh8uJ-unBH$~jJ!XtxA?-w&JaI|0D^Toguz0#%Z6eEOc0QfW zr+f|DYS)~4d(M!I*=`Ug?qat)&vF-8IKGAa%!@;Nfw&Uo*(HW}985>iW!#%&UveX9 z8-G6=u(UgyB_jwt>Qj>TUc5+8xNB$a4D{!u^-aJ*D-ZSCP8BdG0bhB zW*NK69_8aTLc$F1}yd0}l zIUA0K#VrMN5IO^DbXu6fEtQ5_o(VeDzaV-*!(ZJ&6&#F1#H z-6)x4R7$Or(h|SB)Wa&L7LKSCMEa?KPyRda0$6 zYrZz4C3p8tlJh04iL%az{|hfk{vZB~bPi#VqB^ z7`lI2FylykWL!`h^RYUi(T5nCsK>}2s53{Mu4zBJjv(wvG|JA=xTuNuIYY%i#OjD@ zaME)dy=fZ1=;A;_b_6<3$VeI=`dqFKiJn_tc&P7oR3(Z4gh!^f3Lxt~jv~{7C^9=K z2azFjiIRoTtY{lE^3#WWgrOExBj*o*GR|I6-v>1}s?*-TW&M;B(X4pz7H487RbdT3m% zO~0loWam|A4eE_3-L}(`s;V~ncL8J`JfOeo_vRCXT@8OjAbH3iqG(N`ZERDr(k`;; zsGft%Sgwj=l28jIHC(V|Y#X-~2xSlP1t5kOMZxY5&xeI@w`Lp8VUBTl>vb~)k{;F6 zl>Dfg)E**e4_Zv(A*O%8O1W(f2BE5uwd{s5-No4Q)W4|;?Z>@Bp@5U?xV)BidoR^U z%`*B6sr^6wfcL2UkP$=RK#4V73#Gf?e^ z7M9msVP~9_wE(Hm*nTx$}l?_QJC_>@|nB6buI$Wk2-@1($A>lm0 z^vEV)!t4_!ubyg|FtkgA!39TYTBT^hf+@m7r^G5bCeauw6?d~-ZN;2uWjg`IhbldF zf}puB;pTBJpw)Kiz8j{vYN6Zaw#98q>=Xxw1v+YGoGT(%?~*WY(&s~P0ii6IwFQ<| z=WV#dQCWK2cGmSQQzB%XY9?1EhG=2zvV{f(vd}{4R&fr6#}^{#HpWt5D+ETC{}v;2 zA8!T*yeS8qR}Q#Lrh1tBsUlLQ=QgZG?H*=o)9KS^chJj}oZKtUMIbIKW+OR zqdB7LP!SU96Uph`$?4HsCartNos-ku<5T@}@95y5vv*4U>qqYn&HIznj;VUmIeokP z?xZ7r!|ONiXe8LVBdL)EkUkR4TycmET}69rdaV0~DWJfm)hg(kpeLBUhsgzF3j0Jl|= zodsQ)B>Bv?`pF=kj*4;{&M0RJ+(CUqDQC+(I_cf@j66GmsI|xjOO=521r*06dNPPY z9JN!CiEud33E%Q`nIv-KH#kB+nHwGbQl5eB0B2e$CRM_A91kZ|@q8DWrNdId1CGl~ z;TTL9YaYotm;}T{HfdJG_Yp2Lys_Rw~~2a@)9qy`nJ z65grSk|=oAvv~p`|pk zi$6@G7;1t7YI2qIqkNPBmz59ui8WJ__e8G$HBPR}W4ePUw(*&r<&Vh3zNk$fmuc% zQU{3@#WIOC!ez#la;X9d*C%p*X+lb*tKyRcED*cjC~F zS#+beQ->BCwK*s1t9OTcr~5~TVM)xnFKpWA6J)lG^c2`9cWWTPE8;}R%|Jv%5iAqn zBtT2}XbDp?vL^jHbS!*zdrv50%M^_xlZ_l@eQD2NJk@sxr^lUBXO^;~XwA$2VCER- zZ~%UehQG*!DB&@)9)e@6nJ^wv|LAQPtI7B8*Zhpt5?rAfOw(~GNu}Te63Ta3R**MyaXIR(PZ z31zbAY=~FX1RQa}kGK1YND+gv$(8W(^KgBAJ#m7e&0uFMuqjVK{9fF2K~Q(ICN}E{ zWswBk<;uvr?59!`G{|A_1S^`FD7LQLAdBy&9D5o)7_o+q8p(|Qb5zrwx%(y9J z+3HsHZkGHrx3U_+)O3`bilgl2a{(}0f$5CdNCL#qo1=M}Iwy76#3c;g4G)~HyMa^i zCcgnZ^}f2}AwaL#YuVl$TFV)8Eu#~;RHo-^$&4+zloz$u&7}|}%^N33(z(rpDkG16 z7`2s%AZ^HR(na)d z@mjtTkNLO~FX;&v0R^yr3E%lK9_{)${?ISb-c!GTAN)e!;Ock!w|%XqC0?pu_Eqk@ z%FQccxb-XgWnMW@%^j%b0jTC>sA_uwT}1yjuU+8j-}<#WH_R*bogcGI(v;#Gzq)b2 zdL!UUvOHc%-utxuH6khRWfR4NqrJPey8pc9$ca&$Z}Id7n6ArGKw9yum-)%VUG~)o z+Ct2OI+PjQk|--?8?~G@0avt{2I8h@q+V2W4U>Uf@RIuRtN^sE{p4Bp!7`+$0qTh} zYkb5qD?N(OT@rVrV_2HmmE;uartTE*ZUVqI#Qp^S=&$>ogO@U0YAUXI%}lM7=K~u= zNVwmuFpx6P*6g(hYdJX>xNc75fxQK0IN>x$xyKYk;efzeYP2O=oONSSy$)e}gb)Uo zqW|?WbLMJOAR{Ee#kvv1TpxaYU9Y#GdvrpeYO{rOg_4MBuwX*sxr?lV1K1Gj5im{) zUg#hLuH>iSeNOOdse%KOnSdvt18TV4POM%?Tc81>v>JV&=`R}t))|YXfOS2I$DgxS zRg4v`-rRKvuR*oCT_7MCSCQEs6?2n=36p1y;;xyrn@TLOuwgT3nF-9ORY~5TWaIc8 zKt&@otF4!+%5sM}{@Kt!6oE1wtGUwlAkewStU#hUcwVaJK2Lh%6}6eArs zeTX!Mp(86h0>01sh%UmN0LvqxU@U_dgC1uKAOne<(B)wmq&nZ3F~`EYNr=3|gtXUF zJEJe_FEU`6Ic*_*jlxU@;tV5v$0pcOw6M0|GRE*5XiGfI*-OVFy=!H?h@9KYN>VP7 z5G%scZ!Jv`k7i!dZ~c-tQPZ2U7MpPY*thhXUjjX{uizKIK+>Y$;E%9O^ED%CEBc7( z0%pXynh^^VDv3CtP4B_fwS09Bq-iDH9(c}DPO@|n%v??bl^ErTQ2(5?l#TSeuPZE< z%J%+t48j|>`uT5a#Ltr92kgA2t)Z1BD}aa;&K%H z+9Yuo6XaJk21w0CMqSJRr=;b>)f zr#P23IuZ@X4_d`b!vapvCsI@CRjWi@aF@#ZNzK>n)vp`t^hyyXXu%zJiKWrN^0tXU4qYOE90JsQ z%~MWx0E^c}ztg~GGCNIjr4q*}w6SXPaQ988X~?c*zuNyx_KpCDIC_5wdWr}DERS*!*_2$4o{#xh$eB={jYa#-twb?c*LBH zPKo$K7wm)Uz&|n39ps#`O-au>jy-k?R-+IB4=p5hI&v-l4f3_;bifH}isEX;BVgfgqaNOYiN;@dAol&< z(aTPKrEU_c??exv*TLFzSlFLw1Z%DL4V1Tz-gXa;c3&RuA6U5*fHFqy!cL^x+&zBX z-K`st7(oV$6`3vcB2-9?i`sg&LmCUUX8O0Pz1q?+gvc?9NlrmEb*7|tN8Ci%samV) zT1%~hswm~elT!c9NS79J7lYIh?nE$yAG!db-4}axz!3|WCgX~3(O!OYv;%Nj8eR_n z8EflWz(79vf9L{Yco=9e9sUl;fJmjj3ENl9WSR{uR@nr@SPiYps8(cfA0Gal^d3By z{Kbu)%zwRki)@|UCuY*9rGsJ*{@#QU@$A5K8Z1aIA(P%kHtIV{roa0eZ31qEp^XOV z-kSOvpfCbV3Ean>(|5;*O~{dqxu_A0uD(yF8? zwda}m(Bi2=0r_Y!ya^5gcSVo>Dxy{dh|AwE$NsJy_ugyOZ#Ed@m{A^TuhqxBRm+sp zwQ(KZ09lo52|FY{%j;AfG&yf}e}Y}1aKPMI{nX8G(;~hh?JLr<95r8QG08?80#tFv zXvhc=R*3iJ{RP+rgKzQ}9lL+6E7#=j!??F>j44o+gvJyIGa{alE?(PEPgGyfirh&# z1xWT%d;nl%iwtC{WHe9%V!oz_5N(wPz~&|JoJWN6cnlF8r(o`*!@s(QZ4Q<*crbWx zV^~R_;u53)P;WVG1$zrCz&Jz;ctw*>J13`V_cw$-&{0@!Xd5mFPccpV0ZYemT=Xtr zv6M&~oNTJrPzT>X4uZQrX>FC*n8D=gMcePvW+MoS`qdD~==22NHi4`t9Pv0_N{?TU!D!Jb*s z`td+EZ2LVEm&==vW3~V;sDYW;JyS6^SbjZyW)#F*9yK>3t}n_(^?(U$i40}>K0=?P z+8~kE0R~OG)CX*Tn1lZLJOQpTbQDU+;~<#DZ1NGP7ft_eRIs5gV`y5PvzT&i0Ji!- z)+e&zVz|j7!&_=+RXpne=9jpoXL8tq+0sxnO6jSJ#rhPQ84Y93-f`FvVkiUbw*fcL z$L)C2ab{v2O7{@gnsE%#Z{Z8 z;cPOLeTVA60M<);;|RL~7neg@W7H0=i8Uh%A2z}%2J@Gwa)e-znG}foD!G!NOOP%> za=+q7F5??~V!b*2k~_e6pPcUQ{UEHDD)??A{42_u+yG0LlPy4o(ZWZ`jlMPvbgzcp zQ?Tov-4==IKL`@`;!~3gllW8$M%D@o4_ULt4S04u7bKE~_-&|pbE>1M*Z#>5b$r5S z>2rd98uyATxPkuF&X?L;Tif>cGt}F0R;>}Hc<@#MwlpkX;RGWy%BI7k!{g4u(H^ZI zcYx4PMW*ZdI+(zeh0?g+FQeS)k9358v|q1+d0b&G=sBy44f`BA<@+w%kwcM-W<+cJ zc9N-sU}d0@*GP|}J|o9~ax#C^$XpaAGL>rEF{Ed(s;@`JIQHo5?{&?EfBYFS4g9lG zy7R#n-m9a`v#AP}(>x=Q6XL%zjKf=4&T-qd-dEIMa;xb9q=q!@HK`Ld72HVaM?C~J z{5Re6Np^je^a?T+gs~Ig(vM985xo{+Zh^(-7dIpr(=h4&N^we)!6>`dyOK$shWRto zLj#9A9MPa3APBkC>gs#0t%_s{$Ol09p#TjNfodkS*FB3TlOf#$4eTo+nWi6CS1tA% znU@T^ekfz)3Ar5U?9+^I88iVwh-k=&j%r|;7pMS`oX)BY{?EI>bV~SD?i7%W^WIH@ z-SYB6tCRWtiCqV_f93x0O|YXg+tJybI#R3Y_v3V+u;j1N^K&A+7lP zkIC&e${b*h0ngbdfdqWCXk{56YmiTt5>4IpVeGyLPer}OA-Kmu4mlD?SyN3HjlvEs zYy(tsZ};H9m=)Ty3yca=y2dxB8`zQ?ZSIK{P85Rx(mfH@M$`1g>MkdOfa&$e-D6c- z(=Ma;ozs>O&is=884{I_Of1?89;~o~(|n<8$~KJ&AiW{|C=P_e;nnWJNoPy{ zIz4{Z@tUgy0=92RCDfF=yrR1wg00`k)_<@~m-bCntB3F2EZ(qW$LtOTHY@1bEITqA z%=YFg=t0->z&#&ylU4}|Y7Bd*R(7U|v`hfmv#h=nd28 zL$NF_y`Xhrq9S#@gJBwvTyu*k9)MQ<`XZws?wV24CKqtI(H#iIr&}8`!lX8|66{WP zZgLtZ?$m(q%WW@`^e!(jSabRLKzJVDguzt6g?03uv8>th@4u-c&DWk>mI!Z1I!v<) z6>E91SIfHG!QUNcAzT;DKlmEdfD#vG+N4_Cr5f{$!i8VBu)H#w7O~NhG_ttEZnoSm z>=V#uF0zeho|CN95>IAqY~G!L4b6^xj{FX#7o;>ZhZxqU34Q5(XBRR*BEY(>g(H-T z_*#r3!SQ98*aUJtO8P{0@H=0(P7ffajD&rW2c$4r;p@881PZWcfHQK3?)xjRVMIPQ ze2pV{GN+|70$s&rW-)XINbp(;YL{26l?<$3wW1{?IWFs5f(XK6UWm&>21ooxKCQ&X zRk4NIx-R_)mSt~te?oEQ_=kqCaU2ZMY(&if(uc)q-!U|Ex3)lHFpyL95!66HeIo0w z<$heFMNY0+#fnw7QvRT#3#;260790Xvn1#T`-su%_=nw-AL>bf+tfZzs2G^f(E8iW zgLMef3Y+#E7|$J3cr2a>#ygCy4`SOb+XRv2E=Kv z@~f9}E8Muc3-xxM_QIj=Li&{?>IOohOag$D7LGG?92l8hpQ-+&Z`|YAY$*`O6ACp^qV+v|X!*2u+lQM6Dxr3a$x=N0vZJC)8 zs1IH>u_;f$^Op>UTN(&FEVFHTGV`S{GUW=|`uT@mSx^pGF8L%+S}FvM+Qz*G-j{mM zTr($CVBy0=eX84%CZ8(Zha7cGvx*mZ!D)}r^2s%#?ghBzWxKTRX)=x6So83Q?iV20X6#n}=(9CyQ?XTt%Cj&qquG|ObJw}&R9V4#7>ubt>VM}?pbr^HeMnFMM;!uFMn~}V>7v0b(rWy> zPz%L?>V*$s6b|@KC>21}uZdA#9dRmk;#G)K%tM@F5yTm2#2L&&9H8RBw11I~;d2l| zpY^bs^VIG036^dRJDJnmV)SFKMqbXcq&c5)w!o)+zVIaG+|sGD@#|c5F2e4zp~OWz zhI{Z?EH2`y6616l2squq--L(}peo;X{YuuQ33}ZCYHmx--nJ%lP+*&F+pSHsi`bzz zWkXGj=9J7}gbK-E6Yds9Vh9K#Wb#!opjmzic}3;LARF~DP>67avfHX9f3&S38r$Yv zsrOgyCdCdzHJ$L$Y@uFRK4~{Zv~*SD3M@yHmey|Iqc%Kh%SSeym$PdXqV2v^LfM4o zKLm|Q-0#vK)fIpynEqR$fsvBE4+Dk;8wVtj%HSPx&Nb9(EvQI+U&aNdK0iy zNL&C8p`T8Fcm-KR&TgX(!B>ioRe{+fJ$m`ubbOi3hUwd*zqlY8XV)_;ygPj3R+y%j zszSK%LFaI*xC(UoQDn?N$n@~gB(g|Li(?c5rIS+M*1i0!W1tzABlT6JmYl}MNQ>1*^ z2%$~NgLe%D-XCE~YB)o6M6KB5At3-WEz$g!+O5da zKS&z)&rqG^Ee3pIU6F3D3e1?(rhf%%2C<~UFQ%`MM!BY)I!csl;bWS~# z3`_OY(>e7(KrGi&Pv`Y_6q=uUI;S3rXQg`T>706ut=b zcW_#+cW^qtzk@)3aK$>W-s_6~=8f}pMSm6b7H3%0!8n45SYf~5G_k=)25ZmZ0c=x_ z&IG1e5K|Q%ha$p~JXLDixiIs43ONi)hj6RJ#>g!g#F3>59rY57D8M&wDEmnfd`jY& z#J5H_?D*lauM$V|u)gH%EJqK;*h8Y)o86zf`;fT4hP|P?o$HO~#(~UOH0@=AmlRznE5KUg#nqgpPM7=ZByWJR`+ax%ghNc+VF1y%2Ew zi2xUB^fCG%^w>{p#F2Usse_Ox^P(k4Ow)XLo+f<)$wI)mfq|EwLtv#D)85h3USP5} zda^U7>bRX%hEsrGqU^f|PWAj0(!*pEaSsQVMqoS)MbHrR;lV2iLVnVH+d1yOI(T>T zJ!VJX;%A^f;zo3m51sjxv#Il24RBEMeTn;nhyvtqC6NM&y@q#np%9M&!7NLD~})}#G`eTl8@ zAegR0P)!WNmzqFs&{*8>gJVk*FHbQ>ACfLb{60qY>ufse(|2%1;V>;G5FN$Y(=*q; zBXuS2nz5cwl5tc!I)2$X28O!^C%|ns)x4#eL=MxKUgppgBr5};!UL^G0#eT+VN=U^ zO)a!FwG`IWVpUViNlmWDGARE#>@-;*(oaB4Akm}Aq6Gi#=n}h!-0IP>Y3As~{-OGE z?-LJm+Xlfs8>ZP9&H{D7WMc?~3kt61JKVp5jWbQsZvSc(&P}bz)#EzUPu@Y7(I=|1 zE#mG9jR8j9Rm{ANpNG+RwI<+wLj)=I1BGVI-6pU#OTNi1yr{#QRT)*%Z3u$8E7^#h zX%lY5MjOzkDUx}>VCnl^NLC-+k(b-`csb<8DqEY!Bm1F3Wm9($>cZ6)i9sB$IX`qy zxZd0-NI_675HloLZ=tXs;ejq310dM(V*X0uo)`4Ts;)f87pHQ-vwdg6{oT!AJKV+{ z%~HaREMiDnF@?MOPE>;8?%_)+TbdufBe;yAn9fxjc(JI+;o5f$oj0SAc~R;r$jD+L z=YlY*3c6b{$c1lyuPV`d@f*U5F)V(abtSK}uG-ZI_L+h@p6!ac8xH;u8)tnS`LBNl zSs1>00+8AAUwiY>)5nPd7pSYd>xOA^-gzA1VLw@}mIQ+7KB){uH$yZ*8`> zS^)`gA52IGU?W566sIvuHxcIDh<4xZe@;4(VFuYiLK#BjGhnLRtRXlDFKx)d{);(T zLon&onI|?*V}9mdAN0?FGLy1ua$A)~v6RN^xbu4dt( z;@(8wTAd5HIy=1{90Y*T*+bLJ&oMPKrJfpJK4*MLiX+Y-sbn>q!*t|lk1Vu4^z?B5 z02Iac0ec6w!?tHNkP5O1$9*d&4b3?drs&zvb~_5B(&8ktb5;iul2@%gzqZRV2a+?| z;zc$fYzn|sPSm8zmg5k)AxBO&XlU@y2X&Kly%7L*P1`WB(m|CQPO=nr8QCB@A6_LX zXT_~m<~j7;Jo&=d;rL0Bb;$zYX1=SMIj5iFvOi2%N-b!$xJ#!#O=;SZudPFq1#0 z5RwabDf)l}os>1w>lxWVn?v2C9+nwb^}dC2+HBCt{#s7Z>ScN6nj22dgRpsM0U<n^8#9bBNxII~ySC{}!Ia>1zAc?MykZds zTv=PtoOaN}g{2VM2k;;SmZ3R(9Cqx59z zrnNVrWx1GLcuCVKt}sBMt_Inl7)l~VdKdq)KFy8-bJ)$b2uAS z0j?NtA;>WDo!&@Xl!uTuD4rgG(0?QM5*l*9gW%B8t#ZZ&!dalRHtrp;KU#GKKp53( zr5G4o2PX%oT`bL@2lv*DhDvC;DaYrwuXFvm3Fi?9e(3zQ`~A_;4+_%D7t7lozCNc64`D@1Ws?ViCf3>>ic1V%D|5LPsVoGL zIfocV7Y?CJ;7)r(q&e}WO|LjNgp@o)!$(dk3d^$s;7^d}5UC!zusW<% zkQTTCH810j$z_~>WXDQg?;IX!FG018_6)$XENKcJgexrffN#Pw|6&Wc-IE_6rgTO5 zNvQmB=d_~uC{+Al|FC1s=3unZbMOK#jpFFt;i=eF@ZQ;}H1%m}L82$zlwh&27)n53 zjR(%08xdCcdAPa?=Bf%f6@}46&@DTuDhspq3y-icKf@=#Y%GhZ=B2sfMpMWG2t7*! z`L*|{;Q}DQs7`F}?KnDsC2Ld`p?t<^!6D97QpDH!tl?L1O#sEO!ZZn0L6#=j1b2Q& z_;wi;2@M_&G9YkHBDi$q2%W7G30ZFSz=ClskpYL5@Dv@I>}fh7R3d`g*>ucHJ??`! zwlW7&o(>*hO+&IYRUitb|7u=XBDbnN>y&`*-2wq+#0)l2V@->6TVzn5kRJe|hPIq1 z+@`uR$`%$9s(H)V1UZtghHkjZXVbyp=f@_su3d876~bBo=zHiM$KVvxMKH7~yuDA1 z8u*au-?)Me_QNic34|?%XNIr0D^#HCC7f$c$(nE899riER@x<3EusSvjttmAyKJuZ z(iE&-yh<_eQ;<)!=S`i^8P=oWV58s`1iTU5VaAeG+zg=%-O>dRhO$*|8^=mvP!})EaUC z2w}}6Z7``6A@OkP0oA1k00X37QXe*-0wjCGMIaNrT$}8OR2b%tv-4x;;H0(GYA*qC zK@XV$TDPK+Of-%sg?>UNZNlc1Dz}$f8-C?H!B7Rk+8z?2h&?!~qB|&XYZ`)M!bW$r zf+;V+S?VkqfTx3*@rU*G^<|r~{fiY0AvJs39-OEY*qNbNm%M<(hq#v&x*c-?@?F%z zC?G=bzM)f#V5t4=ZOvMowJ>y zPH-LU>ldNG_TLeP6qC4@oT+bHR8nV(EopcF8mp`Bg#}I?!Sr0CHXIWMZ|oN2t82iT z;v!C?4~)#q^b8xxMdaiPH4_ekt4gK5Sxz1I@?(;Wqw~xOcUN`<4#4Y|Lg8{v^I4f1 zGbF{P@k#gJ*>G})=w$#cHx_B|YC5EyhUE_2&@X|!4%2DkQ>M^lYGNnIi;>z%3i3V- z&pm17RnRy2R`>>jPD#!`09qI@y zRm={p(Utj$ujzL%LHCb+tIfN7$z5N@!*rqkprAT+r|HL^S&1oSkU^TCci?96;wS@oj zg=*t)_f4lsI8nx+f4A}8SNMz^`%i$+?`{9N`Ly-)3EF?QA3ttwJbncBpPQ{e{QrKJ zk7NHy%ip|;+UxB=FSd-aYMj94G}mudPAe;QZJur_SKtumX2;Cvf6-MVJ4kN7Z_@TT3ibU z+3;;C*G95v37HaW_gA~9}?v8~j^5^!6+O?wxUEQN6X^<@2gJ?c+U6jU}IcFzKLP%nimg6-%hE7kSAAt>s8cK)9yy z7=P5u1eWX9&EiGhm1uahMdls>d5(>ehiN}xw&Wjs&(!;71QAla!=lm9HzCeJfgNj21*hAC1V%$jai4mJrO?;W9ylpJ?nBgp z%OMas=LA(yR9}>2tYD{JthT_WfDz*9wM8nM{@#MBqvzijOlqKAf;K;QY2?M*Z1;0acoHdn;O(cakQnYGt zemk)CaCT?}q6O0iM;^H{wtQAuwTpTZ;s&WMLvvLX#fU+sq0qJ=)SCs2utDDcKwyBE z@Y&z|<3&*QcjJI+p#H zC;NZv1e|qX)w=o+_Lh&92byBM)L%7daVQej(2#jphC~^bzMYm{LJuSA=1e8h_E}Ts zsZ7Uozy?CLD;6D+v5tm)H1aN;Wg3|Wf~}T3^}xexwIkEvi0v3~w}t$MPU+g3?KZye zrpdLw2^FRtD?0Wb&{A(TH2d*NhusMstvjbxiT>zl*iqMHQjbis)R?E z`Eu6G2B#OBpl)teJkE;4tKoG$jc_}He-$M4dUKd)d}*)GFox&y$+C?C92tsP2P$bJ zH#?DL?M)K3FmhTbZyn9N*@w*iD9WKJ^pymvnUBv1HR}}8- zR$ku8o}ETbv{qjLaQ&HdeeEh1VEqF!TH2z9aYp z3sKWKE^IX7hF2Q`qN~d4kFH&Z@2Zx1tmMzj_y(m%sNe9yEsQ4#R?#--EQ^n|lM6Nn zoy$fzKI+No?w&P2X5@ylkd-N(#FzOh{v76AC0v7>^n>Wf-D3#P_WkaO`qRKkdX4)H z-mhxou+w=-tq7|!`poH;4KVf8pjYEN!y_^-if%E>jqNx~0&HNY%!X(~1oMZY82V1O zvDSL8qxv6rPTw6nfq7X6>a06lx@HD%6v$q8<#Sqmim;~&thOMu9v=`+$*Ar`=5}*m z$mF$#e&}>rU}?YQJUQLnKPW$?`MA$G4z6Vu43s#3ZNmZ(K4rIQae%shQTq6lfxzPd zq*RYn$QFbl_&6=qY2c@KTI$EzxZeMqZm zitxkA2+j`UVG#xBv8}Jk5Eku3&Ze_sUL2Vm9=pzqGkaB|qi6F^8mnsbnL6v=aHA&; z@lxYbtff3gU=dJ!-0-9th`=tn{If_T7a0n%re|O5xi4^Bapz%q)dz`q__A*(>YSO#^{vM1?zig5Zx>q^2&XY7vQ>KfWDt}~slDPMSvPG21z z9~>RM4I%0C9plkuI>}Plln`1KnUG?V+3UTAlMl*;N_$n0Hy>ljJ$1Bmh*nuk1ME2f ztX-lC@nE1t+z2>KjEfwffu{*<61p6hwI-d0L87Hnqy7hq=q2=#Fz`Kt*;f_16jfm?W zO*_m+NdlmXtty&eQsjcd=T3yjN+tn`#iK@NTIb^*q!!j^PTn+o(Dbx+3D_ScD6G5g zMYfM#DOpLWx4I|lf!R^8Q=_x$(ZH*R-CGN7f57HBxXh%M5c*EY%mSd~c{Gg9=D_HT zSdf{ZpF;{gL32jC(Q0(&!G<#eMU>uXp&s`Rj!xbkcl^zz4h)~2mCWNrt6j%lO^v%(a zogkjhgdFK<%5=U;p|gKNUmA*VI805wp zY|Zy5cK_!TGkain&JQ4l&I2_V(3(b{K2M>EzKEXAs29?UxHd&v1wbGwWF9r5`3;?L zslu-4Bbn0b=AFb~usop8=)syt4wD2t5^FemjrVTsxSTZDr9uF6-{!OSU9ECx=V)#* z-_)0HQFQ+1Yr=<5Eylwsmg((x&%Y#GOQLj#_*0Kj)9-iz+*YPdT zBN98WFB0%9hJ<1mKVTws`H(kEXL%L(Il~-O`Djlc!k5z@$@(!PY$4l(u~qCxJI1JT zI|5!CktG|eAKI1*mVj;q8_q428%jo}-FS@=+tI-?Y@T68S)Z|j52jnepk)BxX8eDj8%PRjp`w&B-{2>x29(S z;DiyGXbi8rlWA(gOxEH8ES@pT+c!D`?iJ(L0;6Ei&_j*Kk*fdK zN`u7Q+zVjfxK(<>W9Hug9KB?!p&z?N#sNT}>H~P)FlHtQ;&B@$rhU{feu_@tu1Mwe zB-6nk0`r1M&#EjqY(+Q)bsDKnP63}kNkJu>^pnXKP0-m&t*X7G7NNA6igsn`wk6p` z>*w}+08PSZvp4@CK2d#;M0 zrJOWCv+*_3h_D$3#uPZ@{2mc0r$ft-bg= z$H(eFYanc05wxM0bU(17Mm#y6VtxzlD^;!vRhp3*9H)5CFFb~+WP%paFm-4t(^%Wa zenaz*VPOsaf)hJ_cUU5wdS}hr2!qR_8Lh9c(>h+oUA!4pGe%meeuGbZQHKZ3NEId{ zb=qJYUV~8UO5heY3RQ^gt5%Y1e_55GFA+#do;y13p~byB7?jV66|y{U4NckUba^)vIH-31(0b4yZn6 zyTb-jeJ2Yr9>xPSSghCUgNF5H0rNEH0hmTXWH-@3$&Gxe&c4~&T_c}o%;_i6F(Z$9l}73<4K-O ze$&`c)3iSYzy<?NhgE8|IWHO$DD5Pkd9Q`J(0)@4`OC@zK=bHn%?QiO6m z*YU80JArK>gTDkN5aMPvqKe*7Wrs|@es!K6bD$-=IavTDc zQDHD)!>b3n_MzA;)_H9$>il$iyxT?hH4_$t)ooCsOW}opqkFUa6I_&?m}pt3cDs&q z^dwSyZ!pTPzmvMhVLHtd8C(d}pXK;MtPaJ}3IfqHze6^&k3J~sk}a1zW2KdX?`V|u z_V!tEC7Q4rM-Q?y0!+~+B;eA>rC00rJrm|jD|Y#6jMm~+w>QdieH(-~Kdf+r$2Ru( z7?@v0S9;`JoEw$Dv$>%e8jom>Mv(5&T`l{$s3!o0YmP|9w{Im3vT?_(K6JxA$tM4G zIX2g6pB$Qly1^OL#@E?mTbjOzM~H~z!^<@Z8F1xJzdt_ui&e@}8{79vp(74ND>iJJ z9*M=S*J{FR&&P2(>{*K!yZ+FVTPfg$3m?&rc}lb;xlvH<{Iq}CeYLxP@b0)Hkd6hR zmyqc}iE5x#$JC!b6yM@X44QM$Ao9r5h%>%w229_Uksuu{X$cxfnl2?;?2 z%}geQbMDGNpdM&3j{k}=??-

9xKxXkgL^ilN*nr9&t=A{Jx|9S$lroyI436qjP&d?FiMiOb{nc@>z<7+?Mw6+SuCwSF+C2bVzcIZ#R175<}Br@X#3iy!Sc z10mncc!bC0j;@Nw)T%r@z3b^OJb_h9Z}c>-6wYz}bgtNRnrNEwX-wAp(e|=q%E(t; zws6O`zYH+vway!)(UG5c>!ApjCC)i95e6r5CK zG9nkJF_qqm(~N)bU9RBZ!z#v86YP*(8<>i}n9hk_$rfU~S!T^Rzl6DqEwOAfuTR|s zvL0hcGp9j_1AfNH?0N2)1JIJ`vDFNJ!KcycD&N<;iw*2nC>AZUK)}{D&CR>z%w@JJ z6NXh}se16h;oLM?9v74Ta4_hSD6tbkjA6N?Ha>|h*&BAlg_*G1n_(w$4JJ##@dHB! zf6Y@j$P)aqaOWE2A^;igz@iS^1Q_b7x(W12a)XW+vkmrd6ewRBFT`h%FL!9J!$k;3 z+tz%Mf|iPs#c2?L6T|)?$Lb)-EyajFm&0^;IlbhpL%2n_cMCQfpl8)-$wJf8eqBZE zb|kho?vCWq-4wQXAy0|%IOt_u$^+)HrS%oW8O}>2*4HT|t*0DZ3l6HaU7o*hFhQ8+ z1QQCBvO(Vj!6Ai2-2eMjEhPD+l%mbKJ`ZsZ#C2vSVcHryme9MrE)I>9$@cTd@g zr@=dYJSTX|uZRX#Eg@|qYj8keH=8R)GPGdYQk znMp1YNjnP63K3(lXOH&N>pg=~3|JYo4+bTyOE6_-^g*?|>}IEv0s5d01>|GPmZCIf zHQy}Mj8@UKQ#Kco;rn2C3VBwY(4Ppk)kxC`9a@9j^%GPmp%r}eAzc@ z4UIaOt=pm2$d6o!f5HG1tAr2O^U3J z0*!S!o0Du^AqiD?D>`drkV{An0aGQ&v4w+J)ex3DM!xxU&zP~%!WsbBi2MLw(U~7} z5jw*nB?>pp6$erzbwCXzGEqYf|AZ%fO^GZOlUtBaPTz#@qtOUUm_}+5qPW!Nj*t=P z^6ZusHx!%x^bH!KH!KB0G18vfP;BBK+r}ELY>QT0HiWUHV;@RAQdVrNt>AnF!G7Q< zK^-$5EH=?zTtpwB(z00ivA~(JVyZB9bA*nQ&bot>68ji==4Talb~sUO#iq3tcjZ#ihv#-?YU-MqIFHB?gDnA3xnZp0)IPGA2c)8b;!tD$a($Dd#;&*r$l~;i zDpzODg5))l2{2qEvd2(r3(MgJc>f}vkaz?UE-+Q2uZ^@UtD*|bST-6`H3ZRgOa$5x z%CR)TUihq+6yb#f*c3(_wqR7?<25&VF-j(ryn<#!Sd3>O)E(B~x?Y5;mvJRq zIS$5(nvMI0eZDV`UJ+H1St6n0W-5;Du0|%9Da$@^9z2gY-nC?dtdp8y&;q3#MJ7sL zI1uItd@ECCKbYx~yf__8L?GAfAbIRAyT`Nxn=$&;FCiID-cUOq6d26z)}A-l(T4=i z`(>A6m=KmmU1dYoTZNQRe_4canAQU!vBz*o#EQqs4M9>47W?T{R=&dv1F(u4km^qK+KA;iKa1 z-mz-Vy?P+i^8tDF+PsEM*P1#+X>j9wRSESA(R&tw3L?CzYlzTY1>`wMKNDN$pw%4_ zA|Okrpe0-ZjR!d%!gWt?9qv0CPOuf0y5zZ1lDJvrr&C$nf>@#UY}o@`;n-jII|nbf z1p$^*QH*-YhCek(Z5!FMbUYw!LlYA+8ZF7%%w~WPaE$P#9V+;V@)0fyGukPsZ5AU} zxh%(>Q?n{Ekq)y-!PA{#$cb#Vog!-V8=?@*P581+ZU1h z@d#|ig_NtBrU5Gf7d?zjCTNDK45*zzE!Kq?Org+jP9*ZF??Dz`wWS*C(J3Tw56Vn%z^Ua# z%QR>ON?N51FxMD%ly|uT0vg{@fZ0N{ik1Izk)%4bQ4<3xK@q(;<;Dz;qlN&FGu1j^ z9kgYJt1(dZ@G$bU^mApYV<}6)ZbHdSTU0#Xu@?#2^hF**#`2<6&QcWb#$hiC-8qPe zRc`lnw_QkO<34%*e6!JTPQBorim+0$7c&4^8V$X1lZ*+G)XLo!U~1097>V#ELHdlo zuoR>u;Y9XjzcV{)qB|vJW59A}S`LEXT1^NNyE{2&L8XpQjp@QH|4eIIa-a4U9?|+R zLgWN;l1&RxAC#4kKNTo*>~KPLp!eFJ`n2MBPf2q|=j1ZNo| zJ0UM(l*u57I?3y(?uTA>c?lvtmKJOaX%L6`MTC(DCetyH9~+8BodzE`@WQflz-rit zAPXyXU;@ymn$N;5=m-ynU9zCIT$Khj=j{U>{3t0vb+Ep^E<=MH2v*mK zNT|k4jgbl7)u~=Ur*f&b%TTrD2Tv5DwqXsEzI)@d6@j=6N=AiYQ_^FU!u`y!LSrKe z&qB!CkF##l8l~JdwC}oeeNBu5v=1*mHqXxUfIVcjCLNwZ8zHS?iD}muTwMWq`oND2JK*K_l zDHG1m5TvjXAlq-Ur*%95MI|T^qBxH}0HBuz(Vk^(>D+Pp!mcE_#M@v2{fFzH_7rG6udDhc^~er;aPqLVQb>a zZB4VX&b1RPsulrQi-!oH6&j-qg2E5YkCH)%P)t+EU97egreTA6)-2Zo+SSlQf`!@+Cm0f~=_ z9AWA&l;+?F(wDmBq_^PFB3XOg~O@TP=-G+H{qq`gs0{j<79?&TxRM&q~ z1T*^>U#Nou>?8iE>8Ni7Q9zoix{Y6avj6&U_w?Oy=jV<0aAT;dyz7!%RI~-Z{>l?< z@a54z@9L85eIQ;UMOYbg+BkEsh8s(Uw#F?5>|-=?1fj&UNO5hXj`i3pxX zH3B98(KAz57;7jopcuv@P)M6yYQp+ybu%`LPxGIL@5R9I83Qt$T&p)K^MEd$*H|4! z8$#J;3Gp1udW{HUjRTglkJtaH#{180^@T%>>0Hf-BQSl!e6+qAufvZ3*E2Sf2CqI8 zZU*i7N`YvwqroIe!W{*+{=eJTGxQmG{=Z*6_{V?DjsLOv_|aqV|J~SZwVphB^7s$` z-{0}$`TtVz4|f0E`1WD@5xW0A-g@+>-^l&f2K&gINFSLW<|F7)n+M!vjT@_JtaPQ9 zHkN*2{;5vHr{S94uSMcH--^}K#tMWHX}~>SHmI{%KUt{V4j!D*=tb+8N;(ds7c=M2VUu$L@{Xxylq z%+XCCIO%QlK}re86+&IuR>+^#SKgBGM-}t7eXkrJn{JojaPXVM;ovL4VZ?CQ zFuz?mjON3EO-kqqm^$@@f`y*G7Y!iaaD%x%-;smyovp5*Jm~Eh z7QzSs-|pDjblHw60b;sf&c_)k!5K@$y*!1LhP$o$xm^)R1*@$zh6Ua+I(g{GP|x+3 zf!Mm*egF`@CtWgaLMCf(sCY{RCg>oOn?mcXtFXr=(u1jOX-Bab%~dmPPXRbl6nq6l z_@vPZF7(j443Urqf9@a~LXd9}I35pWBpD5rR0`zZGZ=@8Xu`Oo7T<}OF)Va(b;yh{ z)q?cPB0LfsKo4WOKEgN{0GM<2^9r=d+Kd!^zG3%p^B?H-GR2!RBZ4+~RHlh_{czhW zyk_Yhfgytq0Y+N%k^g-=4T^N6=e?w(rL+7gT00>b% z4B90vvgiOW4;%@T&EW)>f##=x^G4)C%`00jtq{A?Kj|G>eAH(IC_$f+=UX0h3 zC~4iV?K9~)Bp!>=cteN4De*)$YoCas&;a|Y%c6?W48Nhw4`qIG5TbyAbvK^;14HwP zJYkL^ycDCwXv#Hc%5+s4G0OGErqbB-Q(gL_DgDujmJ=+j0p0ZR040hU^$6%qZ&{l9 zw(%hA{m5Y&g7r1lG<`%K- zbn&2JlT73|(e^>=lSh7LM=!MXfR)DZx=XPYnw&_|vq*3*&7XN&6KsGDhWtEyzm9gq zko1`{4GZUblm;Lhv|Axb``D#s7A!>6?60IWAjfL6x}y23ctdu2W+`oQGYE0ucCG#z z`+}KS?FuJ}8R>t@`oFJ#13WMPL#v$sq4j9v5B=Zo@hR#5=mz-F=cj-8it0aeH;jtD z3s3P^c|R;J933T@lL~?_arc8RFRLVmAYzot>s>GIx4A9uLob&t2$_8 zzv9kf0d`N`lzf@aa%M|+()!7k7Epv$6<Czj^2XqbEc8t}!vbE^ zUmWc2{qSP{wDGUMe7}F%QQuA^J98O- zdp96^!e{MskhxVy7zezq2ATT}HX|J9h8ihd?g`5h}&)1&6-ZRfY6QiD}r5s)=67W!MvqrQ6w>js%aXihFM#&`_ zbk|8*C>g1Ki0MMo(j5!L0ZWIY`Z=h3Q@*|~gYW!fa!YoNsLN49#jL&jm^HC4JG(E{ zLhG<7;8~~MZ)+twT^E)ew_O;iNxHWPO{w-Tjo-i?*Z01ojOU97y{}1`tkaxiv>%J2 zl<4I2+1njgzS9z#FY~fg!c^ z9R)#bie5Gl_8?V!{{)M;SGkvJv@SYb7Do5)zOY>}^aNzPN}%F99~zbnwPH>I-D8LJl2TiTj)*kW+8 zD6e_pHyTZtOI@kMzHg{Dlv8Zkzi6oHujE{af?*MJv5LciM`D55dLmseqO%N=5K*LL z_3hHRV8u96ic>7`enGS@s53@oeZ7aFBIK|mk1>*ClLII(qd}d}(8Z<^5jrk0$ODB# z$<;ue;F+|+Xt`E*Z~+kk+#$^$G?yS3$iS%Vo$m*Dy{u#IBxxU`c^Isem%p^W7WFL{ zsWnv+(ivQii(B^u5H-Bf@B!SDmP_2D$h3xzSaF#k5#|= z6uJcAr7FeEC?>Hw&lDqt+(Mb>(SgbX;mxlVxmA3X-mLl&UCe7MLMIOKC8tut0LlW} zX;-<_%y|!$F6sLFoVSiw1UJl^qn91SIAVFlivefJDca#tL)=hNrmz@?jqTguZDwxZ zlH0qO)F~(kHPMWgKQ3F6vTds9xmQ%WDpi7k>b?}&F>Q!J5~;^m0#`4Lq1l6-=)bjG zqa;fswHQD3L}4e$Z=uTna)eerl4s8%At*(GAUE<;w=-829jVD|?+f=NhZ@_K#z0sv z7$$fdVT7*NdzcW|j+pBRYnuz69~8?o49(7#aPb&y;U?g{6tD7|Z0a_)6Xi(kU?ZHk}5;24uNiYrso)CQsWMJ7$O>X(Zq(p9AdlXAVOWH(;3%oOXo;1M%oV zyfGJMCCm{KCJ1@l8AGH4^lLEZBR!!Q#EbMYHDAtNfpN$Z3RxKt6;_AbsYYx@M3Rx70a^;y25|)luWBM zd@qWgLuc4MwM1nE8joZ!%S^o*UIKvpP{8g{UDQYHnKZ?MFZxIyU906Hm8`+LBRf$I!WjfZpGoQ?!lURHQpNP-b6I5~$^=U@1uVBj!G3*)YARS}E5C53PX)!ErmrW!6b-{v+x*)9s zcO0LqHAI>>PvMohx;IDV&FXBNn5#U!w~&I{(^_g-lNG%eLeFc}eMXXyyrCn-qG-sD zMI_cL-pmu9B6&fkmAxO6WDKx%_1!v(4O<_fJgVq{YXcRnIATGxI$LDo%7>Vgc*U0k z7SSP#UveHamjdm>D7#7ztMF!ZCT*36-4r8bT%!JD^?F^c;bjgF(}ti zs=NAA^6yaZQDgF})>8Qv1`P)hw33H)pzxaLfsjQf@ij+1CQ}3AG6|RfwF)re(m7ne z#y#^pVCkTvX5*+d?D*mwCc}C;$9Tk=NjNx2%1yICMki&kgD}I_!eBMlcw0_q_C z>{sGS^ht?J5!44t-5i^|Tv(eGM?)G2As(nAw6RikH>YiTX;juM;>^tIYy2KWwlRbqXm{?PF`l=l@ut!Q}kGc=v*;cB#B!RY=d8DpkhUjWuutJTH}a1h}ADx^BvAx1*R zeW;7(! z7cm6BE&RWcwT_J*m^s_*kfj(Nt}DE@i8JOF`ULZP0>jRq$f#4;5D3E=Y(d-3d_7TxEfdpy-S$9I|6IF=WC9z2Z4N^72~5W#!H%&aJt@y*hOL8Md1yg#;o#PO-fM{a zYEFj?-b3I)uNE90!m9d)3{~!Yn+ucv9jkKy zw6QB~qjNoh^c$)O(qh?`*0vfIk`fkB>8dk$xkKkD<7U(&h>Z*{IW{sFFJWY4Ql~=_ z!WZvez3LpRu`u45K;_tvSx>f&;+TRF#{dsD{V-}94)kw4F%g^jT*u?K@d-nm!s|Uh z!Sv#hi?S-?7M$UEQg{fAb9{$ZEGycWMM)$25J8oxm&=+lhxsF_M1e7+g&M6w#v4hS zz>)n=YzJVV?3mN&cmgJOMukNVKbc@O%IqLY24zMfy!0*NL}G^+gdIPhL!?hh2<}J|6IS6=!pkJEp(V*|9HD;-r%>%r zaht#1E2U(Pyk=D+?G*riR>UJ19w+ID8BtZ+$=KZ0$$Z>8Ogm)c)-R`C5ckya>8I-7Sa`w;yra6szwTpgg85D^7S zoG@=zhGU4EF=wSUT!>6|07=)yoiB#K;jrC+kI;5%^&7GxzAU>A1miH! zjr8HWH{H|S*C#YA!+XK@FQ5#li34*71dlvL2fW00cUnNJ3)Xbd(~yhD zY?Y;-lt=3dL7HEq&iQOTOYC)(`Z0iQ0QF=DH2)gWZMspqX`CeIYT1-HePCZ+7R->N zuL?S_!L0XAjG8l)&kt(Sb$`XWI-#dGwX5A>ttU+94m+JeS(24n%X`i+q@>D?14eO+JfE>`vLuuQ`;O23KCD)hB!}mscvmF@v2?Sx9;!Uv>1nm~E z<<1m9(XKn@@z!yVHx`&B&WI>Nd6Lc@TLtw9v`#n@?F1YPfC6u5)il4DgE{Qe;m-KO z7(5y$R}duLR1eNpOcrC!oAag_DXws)+yd#eD$&2Oq zO~?xlM@c3R5ZgYV;&_i{#Bwb{m#)?5wa`JNS#$~K;0I`6+2D*2@re|h;d9zk#PRWk zNl_gdyQ@0Za}et-HGP`p_ZM9^HIGkn&~SD2y`!XearF6)!>Kj2Qt1LH8A3ztLM-p= zI?9O4nS~Vv$DeD=;(3q}6c?uW+?%7k9XI&AhFrVC`5-tL(!xVMgfBRzyFl65w^9Qt z-ZX``yaVMGS=$JG3qsfGcIq}$Z5imA^m=gj0siTC0=xpj%A7UOBQ9-OqbsntIz~M5 zHk2E2VB4Fd=LA&ZI)NZrc!g*VSL!F@LR0Yh8+vi;04wO-ofH!xCsVq*jo;w7gF~yA z(~;IWU||!}jjI|3{#vW?u&v{?MVMmHG8P1a)$+kp)3N1Qcv>2)Jl!!Cy= z)#l2=I8#Dv&spyG>faajg$Cb_`AD;uV`1^eL3T#ovZh#Rkg?v0wIJOOh=>hI|>pW*q^zwn+84UQj{!A1c;nFG--3S z33b{M#3(ClR;7@IY6yKznTMLmMT!2&proe*!?@~&vW#8HCx=9Zx$N4fd;X#YuoW*Z zOK%K7ncrv5B2I5jmeUe#7luPlW17eYq}tL36f=O!l<<3vVg9E6bkAk!W{k<%sKJIx z`0L^>%ZGy*SLyP{)m&04FO_7tXe|U@`9UR053+{eQsq*F7ad{ZH9>x556BR}`jz2b zy3yvqH4+)lrsxx6RO(?OYmn<69b;uTb{j^V6r!eGYSv_?Cr9VYVQN&zzGB=8eR0lm z6yAD4UNT%w+M&FhxgUDmEc96*RTEnU6?eNCu|Zd6uKRDYumOW-RK<}F4vCQ?{1-E< zX3G|{F5u8#d)DsImkq^S0A{}5v?H;aOU_J`tcXD^r|cfS!JDq?L*!1ILBxkI#sB*^|C3G1P1a@2Fyd;UvgsT8IrKnl8*%+w$v`Y zSlX12^mbc%WX6|gm!z0gEIwTFMXIIV$6O9ahoj5uH_c1PpnB7QFb3MP15So!^xySM zxS$YW$-El>Qqtq4D8a@=PNQxKedTzjUbmh-Q-7UzZF<>ip0!m0Qy5G?ZPm7@V`9?X zG*y#!grcKHY0^|!f*@F2n?_-2F|}Y}6QWO*rs0d$>vC!lOu!qISJfHXtjaJdudWkrM^%Ni$v+i)>M>2I}IWG)7kh!Ztzo{Y#I{BVz-w^u!$y*a|EeJenVGlDGx6^YLR5^p4Rp zH9IaFniD?LR@Ff_ZStQR&DHDSiD;Y7#m!RPzvGc6m!c0A53YdDUHOqlohH?9(Sm70 zrdGQlYU!GK?u0rP9OI1)$+94Lxo3rX;=#?Gwc7}) zv|sOG%5V(R`PCAWo1mX;V&mw^=$X*IVQ@~Pe#M)dPySdfmpyJ?=|G9F|S^M7x&HlMaI{{Lh3VQFkNiKs%SX!p zwEWGhsI}gDWHSK#DN^G9W_zpEDr*4tRh6NQv#G@K(eP{%lOHNv`zWEmw`i_!eK5f| zyc_@r`!D9C0GO&#oOzM<P5(C)wQmFcf1*B*+mBj6|2JEI=zo8gk3;`y`B4S@ zv<(NqlZP9vhwX2pR(tF5pSD_?%7YW=` zB3${RD~4DlY8elvaRf9SB7BlkBq}a2d!-3dfMTFemCv$ll*CArTTE$X_}GB`4Ag>v z1kwu03{+fgLAimY=e2M0t>~Lvfkqd`e64CO*`%JBxTnTdt*Vh)u$nHbV3eHGZC;YP z^Vtl$0>EgnwV>cSIiIy6cb+CJoVf`<=&I)Fg{p{ML4!qRTU%@CKp{q1osFSk1^uOZ z{nh?KCt6u)U}LBbGB)NdN+JR!zTZ83dC+MzTtpmZT~sRvPJD#R%Cv9BiA~4pt;Lcl z-%G2}n$RcaB|JY*3RHfhzDW(_xbu2nF+6|WKYZEwsWdiy2@K7$OZmV472W5Cj9ou< zVO~w*>*OC(3Z1alCTNAw)OdBrxG2H^1I1gHZA04|N3hqS_pruk0e zFBgi+VBlYh0i;HTQ8FPvay+_@Z*vhi{sT3-EXz>UqTDl>lu}?Xhp(a%v`wj! zO}#5-3BzJt?daCR0g($=!pGbI&ch&buh?2!uFZJh#8d>5ZUR-oT}*7eNFZ#`)o_xf zU=-MdtE1jUL{uZ!;Ou2;yuBjoa+XYB-IvDzQ(C}M2&b$&4&>8x!CJ;m@aX@@1cK_r z#8$=zbF+^P3LoHQJh!JK#^d5*ZA1~P65{s6W#mA~LpSNv2&iD2XoUK+5MC!!DXJ57hi7d(UnlR=b@Cfukv zg$AYa-;5hI%41(~8u7p}7)zxlz-5GJmotlCdu)l22ULOcUa-2Mutn9uU7OGxB%x+{ z&S0Tu0~lG|GFF(7LhcbPrd>n6^S14V<;fb+R(R^;|FLt&WySd)NZ#`6gP^z^FLIEE z#>iFccN!4A@CQR(0WAvfM#P*$j_BmZ*-x6H&Lm@84^>yN0UegWiGho9bpIO7P>z3Sun2n7+%#m|Vv@fhdp-rvDli%W(FlzYjrVU@jLB z;QE4WpoaN{cC0pe6r3aLSYi5PuWWPGl%*( zYs5UeV%$`(ReCckwEepCSs#pu-`RZ$e?PB<9a6{&+yT_?a@q}VBk~Dq_ue5D>ze~G z@5Sk$KA>ekeD~%>=eT>aw|m%(9+2Lou@0GbCJ$>h#k@Yo^-;ZI zR5tLLggN^T(+Y%cc*BFPV9cOdOG%xWaAFa0;tGDFL<^(jSt_WX4x)`~3KrGmrY$m= zQOs9vWh`bhLdhI-edC`;YpwUN63f4&%MCf^xQ_uF)PU8l6dGh1;?paICT>nv7kw}A zA<0I|Uka3#K;js5RuH5uPTj_h(?$uSV5v)IB%@T*gwW#%xAY4jN1a||*U=?rsL3K5 zFGW|H_(^xDFVf15ZbglSu@<_Hc6@x}*f^70GY&iiaby(Mb9l)|pK)?t5XG^>=Kuii zI@Q-87|BS~wL7nZiBiiOBoaxmv0>?^Hg%cs3wlIQv-`r1*%>B)o%GOQ-Ivx5<1 ztJxE74I(OPqKh)HS(F_b;A%@pWip#F;;S}}LFYJgB`IpFC^%O>j(emI1p`B>MM@-m zhL?znhjTZ*WKr0(7N@kzficmfR`DJX3G)*Cj?LUOGh(OKq6c^mm>F$TduwZeI~u4_ zYHcel$A>7yzz(+)fmaUJtbz~K0x9ubLoR(v5*(zA=r?e#hUDpe~ zVFS6VT@PU^fM$13CE*GUQEe^=SV{Lk`mtBKG*TVI!y6oK&e9F2Tt>AIF5^Nj<0l8D zWD?W?wJ>OCXY7E=e#2<&SyRF@a5z?=V@<;yaKI~!vMR|)_<9k3N9uthczIz?QW0-B z1xFg()D=?nOqtw-S=S0NDebciQj$~`Zq-PxL6Nsw%J)^-Gc;-Ngxzsb4OZ8Q=;*l6 zr-h?vv*-;s2_qQ9Eo;@jb7-*D!-Y!|9#J>p-Byi9UI(55g1yj(7N`d|0k1f5lprB9 zY!Z-!7NZ2CcEbqn=Sd2}xjG&=B`X5P3sIi)VQd4t2Gl53D*+$pdP6W8!@}j+OEGv< z$xojrqei}rdfuh*g|iqEMK&*lC!(>@?DeqtiwXG+pTSs_E_`wO)tggoBw|k@7$fp_ zm5NeVoOI9M+|jiNc^C~+9@w+IJY2P9aH;CK&rpxF%&DvU!Pgz)ObyPs>kS};N6Ba$ z0RqVvmK7B84h_$ykps2&l8>R59J4Vf3fgco7CY&5e(0Wb)RN-2y?4j_t#kPD)3#q% znw&u!(&|iYe6Ts|O(*b2i4!%p`L#DoWJ2QKhL4@qC+10COi^p5E7F@}kScXBfWScZ zLJOWktxZjMu-yTG1Q3|YQ&T@@Q&S7fz$Eux6yg@|H}^Y@gs0<^L3` zCV;kCQW}}=CJF9&f)lK!?E}_Q?cRSn_A1UAPAJ#$hO@VQLyi%!PStzRZE=9b>lNF) zQSQxI?$7GWtUz_^o{c=3stQj8vgT+Sy9_eTuVM4_7{BskZ9=N=e)ut}pXo7v<;S4t zrl;^tKP2PRroHju7h_v|EXo5%R5OBmt8 z0m?ao+#DEyRhSGNfR)-zJ2K+aupJu$8Cec#yXRhc8E$Z`B?TB;-IUIyaZ($NlaOt! zX}cd?Wu0HBH7qxC(4|P`L~aNou;eD{>nPEA06eX~fKp!cL)YRCXZX>x*R{9TEB2-c z4kvvEeUurCg5WW4W?l$?G67b$10x<8&!M2*iNOz%Y=+jlu2{q?jD#c% z|DyW!u(+VW6S=q#7FW4!UDmK`Obr?YYfIy_NirVAy(BbgJsz}~VJCr#75BWQkU;v= zL6fbdXqc-9v|udh09L?!2ZPEU+sq*PombhTkUVRT2IQ}UkAy}uosV_-83HE{xexH{+Dps z>H#O{dU1_1)nYQ=vrCQE^Xu9>I_}JI?CNKpQy0wHePV--iHGBOk|z`IA;uspJ)@C2 z5C1vLJijrBgIFKs4Rv_uCU}ctF#d@K2k`8l6fnxhtWjn5^TXsCRgkLcl3SJTx$y?i ze>_=kP`aF> zRqMY)#SK$gQYF*|F~3zO9f_?(_~E-PJjCC)>hL8U(w~g{;jp6OCe*2?D-hL(=fy=r zeqXyaN$Go%4W4sx zU`L5FH-X6FtE8*o)U~S%kJPuOT$D!BEPun}SfO}SSG$VYIjD(tDa6*j(Km_cOPy0f zJI#`U<8!ncwG?N1MsIQvd)UpRXYa;EQ3%tcZ+1=}wuQ;WPhGW5NOuh*s*QNt>pXUF zRSDXhnpGj&gnhDymFg6IFdcQ|pZWRuBHchT`5C6Ty851Tf1uh>G42gFl<7}hur~g#51qsALFbUWEELF!{A%5FBy*w+S6iWR$i!+IZ`Goo9Pe2z z^0yo6rKAjYG;KA$5Q5@MYfXqhqi0IUIzBly;0?sVrh+@Xpwl!To~KDaqLrmaU6mZf z&Po-G>ijbL4w^f1d>0s%YS2pkn?ATN@c7&-#qy`Jsc(9w5ov@bM<$mH|E#&Qe;?5O z5O|B5;uPU98?gFHT0G)g-P0esAR%ozPdHt&TM91(G!zVRTK;8Y*=X$TbpF;AdlPeP zQW@`lwlsf05^Prj%-y1zp7>LCtkm=K5)AMS4CQA++V?Cr9Cdpa)AZx8U#A?OVANL7 z!1HW6=_QKjQVkrAYMS zKEW0gfOzEvw6q}fvRhnCvTNM}ibBW7Cx1OW#RMlVIP=@Ih!=vW(GYnw9ft#b73+G{ zpbJ9;u?A3Pc2279M3pc$XCrGEs!1`QT<9kkCb7Unku*KgRv|k7X-37q2Pu(DL1P2; z{|f~`O?f$OyaL7tRZ3(;Es9|d_wO0s)=z(gin@9~?#^|I7xG*#$7w`VIe-y3! zvuP2DH#=dS8eu=_jloVyL3w$7d7GaC5+3Luqb&OvW2!i;hX(wN)n(J*{NJ#xhm*Sd+HES>vN^VOGx%f!aY2w+xc25sK>Tl-oABJ z|GTJng%6?6F1`VazAf0>*qm4vBsi+&rqfWvni{v`}N>@G@}O$ zt+nS9<1**LEJEG7cA|G6wq;V?(S@wB^YAAk=g_3-vL$do(~(>1aNtpomr0(-=Qf)_ zK!#IefI%t%5RFo-j$sf5%clCUmLz_LU2WV5aVr)>Cvmn7^ZxLBSk#?;2^|~r?%=H3M> z;e~ZmpFA+$(~q5U1fTc60es#s&s!ppwgQl9dq7=V+pd5eG=LlUIeJm>JUuu>(Rrq@ zM?F-6%6NM|d?a9$P`Bkim^h#kCsDdAFt@x%9q8US+eynYO3?OsS%(4<4v<5QK)c}3 zO^#1*Np+tUKQFT_`n$(&|DJQ)p6Ms4#_!>Oxnh&{cJzU$kG=c?Q{Evg!GScZyjm=h3zh-(i;A zZvhb7LkLt8PU0a1%}ZGhLv01n6L$~+0){98lrtz6d1RyFY|=J+zx>jSeo;vLi;@w* zJnEP4-0mIsl3#9aZv5ALRTeo}mwEP~hel%aOSU#vdO-igWY(59$poawA5%cR37+*3*^dkddV2(Jg zs1Uz=5;q$y>}Szkt0A6WWRoJ)DU-4Li`>bm(?!y&#W#OY8l1Cg)nE<+*{B+FlaE@L zMm#ihG9-zZ@VPAEKzIR-zdsB7#c}}xtsQ-ZSZ;|_kVw0b+4+n;wj=h~jz7j<1tVtx z(E0PW=XtCL@azi*@NBUG9CWG%@cau0@O-fWysjL;e}CZs{(G?j999mX=F{(GXGB7X z@(s6yZc`KwW4+twdP%6RkWWKe>h)T~qr(-2JPN4?_VVZyE;E5dt*@`UgiuCOQbqTU z4)=CXO<`F!u!+OGs#&S^(n|TXg|7}=wQ-Q7(EUT1q&Q$kru^5y(!gzQ1)JpQ5QaIb zAiNpLfeWp2nU*`F53#i6<0JsrFj#*B=sA7Hqwz(&$i0O#61a2jtCzz8B+1SuA!{@J z5#}CpoF(aD#{O{be-^%Jk@fGyyDq}FhS^r9Pc%L8jrGuhsAQj464i`}iC29sYAMdz zH8I=vceV#thkth$!9kbZH=TL>PN{hvKFzy?(Vx&#>HwH5aj2CTC2M?Vj`qj(RW;3r zK(!hnQY3?VxYi?OD*3JC=;+|x*Odf z-`nP#X(O`%UgjI4fH2=5<^ZB|8(zUNMieGo(6eHn5W64Hb9*;u>_8Ay#;(P)($k{} z!qO7L;K+BRCNDfUcX;-_rDlKl_58-4lK;=e*Y9Ia{=Y}+2l)Rydi-Rg^{9pUpVZSo z{C|FrkMI9;f$9GqKQ-z9Hl9NIzek%}8;`%1|IdF82dUz}$c5*^_2{{{H`f=(c+=RN z+VT)wYCnF8b}N_h&G2%18L4ymytsh-#kkC!=r)XP{ZgHSl2~_@#zPsWq`{VQ(O-6t z55dA34vpJvY7;0WiVx~jv_z!w32|!BR#VkGpD5wC=KA8)05DL_dglO*g?ol%atS%u zqx|;rEE~biXqtiD(%G%=VSuNBBD%YWFBNfhp@OpUi{sAj4^1lc@`$cl4o*7e%l<3+ zdPv1z?dq4Wj*jW?yTiTH{i8!}gUjz9;-7<~z1;({BHHJ_N2mCgYae&sc6Lv>?s4bz z-7!@>{l3Frj^9y#?+#D7iNAcmf6!?XC@{5m86bMvB)l}W$U{^4bCbkT8X^5T>5I| zfG{8L%iYu6KyVP(RSP_kz?%+s)-(mTTYXA%OkQMg93K3W)|oN~mR!b)lkepboW5Y{ z!_K?5VK(U_cLi-@f*QZ`+2|gIuK$rHw%jAXVE`=i;FmdczUszx3YY>fmQo zvJ~bSzf$CcS*StI>QM6x?QPgIAFdXGh>*{rYf33>p#k7z|175uLB`@ss$|{8z)cJb z@e@#cGvd%}T>EKv)@+@O5w^*#9&pf@YVyp{;H+e9_Q@1JCEK%G;?W_#Oz{igE*B=9o=r*RFG+= z_^0e_lw5L#NLimFy)uigyEgASv1DY`fXaErn zGNPghCVCBO5X2)@OJ4)KXrm;6?(V_<>%%u41-{ehp!-hM!V25eCdUp&q4mQwhZLA5 zL!O1$GG$#6On#}W-97f*7tkq5la$c$ltTKp5T#Gs2&9?gh2= zaOWAdpNLI?mr=>hxZZ0fjisf!bYW~Xqk5uXr3=U7A;lo9kFc;Pn*cVVD${Oj*^+9R zY}hv%)qN*{uCSM3SN+DHh5@kz<=vrLl$WL^{jA?KbdTz5W2w?k+iwkoKRZH@1eF}9 z#t6+R6oPLJQ%ja(-~GlCR^koagbd6Lw;bGj*kXG5LnQ%^bxD**v4~9$3djqqel?sx zPKUM2xOV}Sfo6lyp^5XQIw`>gR&8jrAy8(m>x>nR=urgY1#*@E_7s?p1qgUH?q&T% z5#q)@fuWkLstsrQ(&SR_B8s$+@$@lWwG1jH0~kQm{H6Be4P9NGD_9*|AyM49NVLTO z1(~bs35~OB67Aa!#&cXl48?zZy88m?r|n8UUD|BhwGVa59a`%a-MHhs=>)McPo2ii zxu=#|$yy(s{Q(akJ{^1*UEyxYDKkxNDO<+kplyE$j^_{t8=`Q@Hk=o_zh9lkx8-=Y zKS|&q3dOxi23rWOK_}UWlBj6Xj|{^Fq{D-tYH&5ei?2Ezfq)6iuFxkkqy2vO_$4m< zY3Jnh#G-wc_MsiDjctjIjFScuGrRPS1>TLi6vA|Kxqg! z0vy=!&H=#`a}Gmr7`nc1H>TmZSw!Yn1 z-)MMV>@f0fd=|{Zrz0eabRnu_ePp6G+ZU}yqwJyXcasl;NomX7sDfYAOE5Tcu$zm| z@28h72sBmji+WjbHc;~O`%#-_v2IksFY0B%*+9w9?O`s!H^6NuX zH5$we(9fnIb_~%)lYb1rEE_6R4&%Xa?8NuAZ!2F6#&VGDFwy?UBp4zuK(zlcDL#KO zlx($FH)9BO^|hB`l$|fuyDIqkb5xaE8w>Z-+W7pQ62)^Z)DNgbKD(EGvMAJoJv=P4 zL-YHbgmX?U+ULsW^f{PRz!OR&6?kxUMWSSnG+;2o5p!<4*{L6TtG2cd@E9Zo=ydLi!zJz;=(ppR~Z>9O&s8fUA=n9SK zq4Qop2f!HjL5T+1VwiFpSE2*^Fl=lElA5~t+T2x{FrM-7&ywOgNz!NoLD;f2g~RkG z+g(d{2e&EFbUcRJ1h_M^6=7kg4ni?i(Mc`>**06xcBYsRy@q!T3jDB|$>q4Xt;t$J z&Tq0ZZJ6M-(7T>f3+MD(jLn zSck2S0zmjMT3!GQ#=Rw+kMMc|4s-!rteNn(i)`{-ZO>p5EZj2zpi1(wF)J4mD|ke1 zpZE--u|`IL!bx;M&V%PhJk-x~j4N)%Q~eyoC`eFd#4qu}R!~3qIfy;xIsDMiGt4Oz zS+#+E;XLQZimS4Z)enBG&T;!#{V*wuG7NogWhebYNei|D{L(Kb)Rbjybe^NWc!59k z3t&dg3;1DQ*e=u$eyqs9eXM@y#{_7@Lg>dzsu9oCFOy8_+CEo5bmFC0%xhwDFA<{Q zn@FOb^BV9_PsBdanVN>FSSa{qUpUY8VMWfRk?kzSXF)}KTpn^-P7+)rX1cr6$0YheeM%Fr%yMYJlUlD zFHirt|M@*W&ixN8Ki>U3-LS@APomc5*5>1_M^DRlKae4EGKeu$O7teV%qF+dn>dZn zKO+^4Fw3&{Jjvx}LoZG5;{4mU7X zRUsD$JWXh%RP)1l8Rw^v0BySRanc(Ofd5l`d((mqZ8Mn4ti+2Ulmnq|xr-$$qq_0cl1;gUGQ15S*20 z#MWe-(hYr{*+7B3f0R5MW4{pJTpBN+^-v01{ib_9$*v&-w{I6uMG)*{e!b#g8~%X=E_sEqJh@mXdC4^Z zMfU03dXP3d|9=44{Of%Ms@xn#`EmdmB3NYg+xk^B?9}SDb z&uIR-JDH|N*f9ep`N$@w!G_uMrGVgF7Z83;8#AG2E?`JRQNA5lTUNQ)wrIGGm9|x| z=$Fr&)zj)0TUEa01O(EI$n>j$OtR>kE+ZCZ>f=@B73Q{^VvTX~E8L@A9`Zz{(7Y)B zWBgZ0QFDuX$HWji`oT$eV3+%oi;6{-oeis$$L^}sF6p!on}Y+4(qNKa< zZ=F|@X)}d+<^`^=oUc9CB&bnWKY+&ZXm}X!-@N57uae5cn(AWPn%DqRqdX@A>0HpA!H7`}=>lpSB_YV|#P6 ztwe#%Hu3)(fAIgm$H(XY$@ycm#kOCM9=0Dxtv_wGA8oY)&L3aQ{~Nng;PfwC#{Z&H zJP_#{*}tO}5(zZ()OiE6?&S3nWEE8GF-8TY^GCXo`={zzGfSIkQxURX?k&~Hp_gcX zQ=RUhqK2ewHe()GxkumO`Lx;!9#PQHl5^|;F|MD1iF}qeR_c(Zs!m@T(UvVv2P<4A zc*6w-Ma`s6ne*~SRqJ`98406#Qx_{Xss_bw?p^uTaXw+&cFc=-HJoJRlXw+RhTsRqdP3tGnX5CscM*-@?g=J3j(Z;!Kj%a`fkD3A zJ^g;EroYu(C9QqAM{l9`@kEulA?U#^nAV%3hu9t?&@j-`(W|AUn!XgHwruX8J2!Xq z>ZJ2_sn(UOpMv2g7uF(~QvSNd3u1 z3e^;m*gxL?sTsXejPZ+;mrZEwFe%_`w7dUP^k}`^jJ|*S?x(25CQj(GtlGR)v=3B{ zNK}xj4Ms|Om;l{jeIzs%%)8A4(dB zAVPAs2r`lh^r$z=@}y4K>8CGQ7(<2T8G6}K?ZOtU!^>uLe0uP*dwBF0qZ-39`UXVb zYjfmJFl!r;QqnO_QFWXFe&Jp)W}LQ-fwnU4oy5G`StX-9HN;#(f z^{)uOQBUeueFS?-p%~^)rJ9hdhDLjfY#dK1zI1cJW zw<$j9fjz~ck1EW;@g>6dKoR2(?YV8an#ttnR{Puc8oIAAfZ7{M#94oJbo>TPU^*u! zyRSRl{nv*_$Li1FN$2?VB>Gq6y?=Fl^rn0A*OSxE8!ZpgI^sA`2SHsnC1NC#Mw8X_ z1~e|U;8J=qoKgc@tVVn-&-$DGFJRz=KN`|h-0L*H2K_g! zMRW!nsG7Pf=3@fn-z+rW&-^>dy~3rpldQMf?@tt#c<`w_0xD+ko09y$9=!YwX#OD) zZ!LvI54B*n@03F zZ+}%^Uv-Wg8#HTc1j&jU4Yb7Ww}oiYqgrie~@czW4D`Gy^dHC4?uBWhYbFRkX= zG~iREd?zM{ zh*=tiRHtNN^0gU(!;=$?RIE7coIspqAE#q_xSxhMkUagdo}RXgRW8$pz0le7=M(h> z?a4Al32U~&DlDT^)eeJlc*4BN(SQaEBWZj!MnmzRU&K>D)mQOobfyDDIXc-dU>k@{ zptD_T`2uRc_zd^1P$RxPz+2|NqY@vIF=CV;>FsZ`BiL;=MGbi*V&DR_0m*KbxedWR*7C^gh+(pr~GDaCCyz{@w zzX6{kqs1nwZP++)MFiZ_mS4x6*ZU`@$A8^FeA)Sl2SnSdBaPEk}4#(RibE2q8TIZN`nOZX`W2_aS?MPRx_ae9OVU=tJ z^i(Z1mCs&5mx_;#G)v^Q+dc0^MSLEqp{PzMb;>R)=2S3CJihxu;*CYpct9Y-lAN=`NfWK2$w?j!9yv)tB;n65}AsCB+Dp2m=B*sD4AYTVRR zF*)Y!I}As8mW(RF4ANP-s4w11?Fv0GitR=1f)r_WqdcCVIh)^m$sMpw_WL+^s4JD(Ru)=&r zQ4dp{*wMuq#2dg>V~EnlQ>`$P5fWI*oUEiVZwA*(xX0Uj zNvaL)fbx!Q%!HBzltJ!PqS_YB5V-ZyKJ^zJ*4&c*07^86bMsMUD*dWiWlZs;_7@d?Z1YNZh#3z8xa?Q z*nUuT6%OnuGGp`Th-uK!Xf#o4lAr z%|+J=_{~Mv5YC5DxA*mNSAf{!kM7dmBD)fR-SP(XzbTf>Wte1HFm~f2OYzwh#o;#W zW*`_WuP-|ilVJ&}xLi2fU>2@Y&h|;ojukIvAXkAG!9)12Xo6#Lj-f@-q8=6y1L(o{ z!Q6%s8Sn3C;kr?UHab`Dh7i4|5k@_9ong+03|6jK1SZ zQdU5h5qK^_&Sze0+?B-xR$y9nU8}JOr)t`9*i~$$790zNv~j6NP;qLY_uV3EimgZ9 zn0{XVCSQJE6Wz@a5pjD$uJ$w;bro1V6Jj-PONfYomm{EchulKe?3p%jUJZ3``*Ha%-hQT?S=(=>l&H04C25hv zX)1t~LTOIoYc;>24nZ~K2En#5)=n-S0ysN7ytrk;Y>2>CP~NZTje z371tX&JwzTK3w?{Ynvrb#O#c%W8nHonhA`+L&>=|(z{m>sWRP=#Oh~w1W^lhRhP%{ zmxwoNo|DuK2L3wBS7DBE(?Vb!C(~4eTb7=2U6*F*ntH|nmPgMWW@lE1BC7^TLYS`3 zq>+lq3N!+&gYA*yp2MD;;Q~MfnbshIAhE?{iqMo|PUw`W(-~kSBWnVVj0znXYK0*JGr0ekV=y}dlg9vb zK#RWybraQX4zorzVrqIOH+6{!Y&61#d#X}7t@46OkbYK#LEH)wK@88>eN%IWyWV|6 zc?}%u<;Hbkj!|fg#e2+&lo{ZZp1b6F8^AxfQ)uHD|kKgdvtAj3ZP>vw}{g zy9Xx>8-o@tdq2U9OE{1-E~r}M!D!eka0is+1BqMJ`?`#G;gu+@0)`WlD8OR*-=?Hb~S(iudxvcr^THQesw1+@E83v@NO%?lE9- z#01u-W1nUaPIE3XMdL%qLRyi5mXzRw7AtuIVKgd(0wd7DRGkk9z=6}#-4_QP7l6KT zQ_C?|Cag9uH)yB8ni9Ihf}83yc`J!nUWb+N@^{4yqS!@JWX_&qou4SA?7j|}|9l1J zD~hK#!_g4bwy4~%Q^s7*q^o$(hII7aefJaG4=gR!ereUpPJ*QX&;GrZnl2Fp$Il|Y zTKE##Iogv!rOk}O2*6HmI((^X?eofE1WJs#a8Xs=TF#su6H2B^NQWuZVr_f77Myw^=xUB0}hwihgPvoGujyeZ zya^mn|0;Yp*bwr-8R^LR`WR8lQIZ8gsQGmxhd{e&G)^gb92HSZBv}0P}p_N<5jqV4w*F+ z#1L~RYa2#$mK}f*>MR>ly;U4bIk2akMe@#jRN0Q;0}puFW5mia;<zZ zu^CIOf0bOMjb*BrxgYA0X`t;A$Paf|-JWwtwlFW|k`|)h`YdP&Lq@RKRWvix(v!D2 z9j-cPAiG?qZGQxh{hFVV6aS53O8vg^-&*a*Po6;hx2Kz}#~YiQnE(6HlRx6W{w^OU z{u?iU^D1hux7!f^?a9N9_QTc&r2l@jx%D`d{u|P;>3G{V1{dBPDmE;lM)O6(!D`?9 z9`ICt0JVNRIWIjMW~E27Vz1fIYdEmaNH6iFsU)0dG%n}i)g>pKApZCCM@n7?rUB_t z4;%PxWSl>-lz+H?Akqw}s%ilW3aCR_DA6Y_g3MCtJWZ9LkYQS}+X7f}#c7c%GGyDs z#i}Rpxw*M%G}(Y(=e*!MpJ5)=Tkt+wiQ4~{iX-Qw1V?Cq9)Qsc3U75RiY}Vh!<^!< zGuM5jr1qjcIE(7jG#{P=cLi^5MEDi7R^XeOaR!2?wD!G$JOQmIn#ltBzkUPpd7nQg z(>o<;l1ldz%e6Prv*=r626SUoLD~_vo?v+2XVGRO`d5Upe_@dI8(K$X>&3i?)93)nf4`xU?I{UkJ zz+oD=Qna)t%sgrH-cnnrK+R`Cx^w=~ZV1~$y`^-}5mUhlJ)+5}7dwLqi74{!&5O>l zS4z!b2!U0Sf7DZAqYJP|)ZdNGhHd7>(a}L?_t0zS%v1)taAv9#5#(EMx@XolF|FwS zeJ7VFHh-}H`uo#&C!OP$yQjNeCu66RvF!wlc_BoAVdo?f!@QS`M(P+s>7r=qNtuSv zdrr&dr`C8m>#YvKcHeci%E{b?bDFNug^Y-vwvwd%F@?wBmwa6XZE?!F90J;4F{90- zpJ;O6Tci>p&(Td%cweC>ldZOVvkVc^%QI|qOx?i|}o*3=)plO1ScOH49XkTcTbV?wi>FK?MA z?x-Q+iGqRxKplY4LK;qA(@zq?f0TO zJlJ^8yRlCD!Wpevu13SF(0cELF7$>cLKDszVc!{{S}Hyy^ePz&Q67;5pTAObdL4XL zucPiX?s3NJFX??;u_}*NSPje8$BI4p_C09|FLY=oPTYYM4L3@xcI#MVK~~clt8G~f zIA~?<8_0X>%)<@+@YzfEjWZ3ojlZeQYr&*u4#8nFh@Gmx5DwB_^xm|;5IgDL6nHmI zW~Ru3YBE`EYXM5M2PA`afF4eA~F4aJ7ub=LfOE}}D0ws|D%v++y z9@Xz{cN(He%G^Xg)-WJX6BD~2hrNgX#DE{bEDY0RHkft4zrZwpQQdj~RK*1dX$<@` z2!Gq2+YpWSXI1UJWl;$LC<`g62ndlh7Uw z4SX)B$9rBjlGC@xN2f<_BhLGGZ-3l95bxXG`oN^II;yh}NRJ{S!OosC_b zhxb4S29Td(+1Gm%g42AlcM5x?WcWTY34SVC#q`dXac`2LB;6#J3QVv=Yl3dr6s?h~ zG$dT8BkE_#3}^-7cx)Tpbs@fkAzsq=2YNvR9YUO>$&}1vFXfE+@#{S<35UAuTQO_q zC1x`TK^2h3F0BhpXwZ)TyobCYWdYaM?X2QTwMG>pw?(Miw17X2&(9Uiel)!pNRbv4 zZ}jse(um?%wy~|ExaZFmx@6TU3{KXEj!#9;5DI&e<*;}~0;ei$bg@cBL1wsFV~G{1 z87lj<`n2JeB&A%qFe*~r^2}NX%b%Pc?;pN)%abZHSe)!%ozlkoCRhQyu_0KkTSt2u z1*@5PbZvVN=sD_ORk^yZ0&KNa%d(_17ll1t*CD>%&C~#ij(-7wPEGT z2Hl#`183Z7=DC2ltzUoOvbmd zxTt8rE~H=k!d5=3sBAZjvl?dtl$HJJ9S~TG3z^3foK<7RkTce6YJ@3F+%Z5tY%@~2 zXKiTW>X>i$(Kihg#PU4C@qtth7EftUi6>`&r!1M`PUOC~0iXzt1osjAgml{QMNa9w zcd=eL=}@t^(eNrsAuGgr^A4RssrrIF0!&mheSr0O(=SGeJRM2_rer_xy>7PvmLCj4zO-!_V7;qMn5sl;+X+=icY$;JGVU!wCxZ~ zzl*awcX1Zzg3k-Tajp4k&TF1B!-`JMdz7rzvKwkmZyJ8Tbad+aE~-J!`lc$~@JBWM ztw&{HeW!617r*tu=)}F_urx{j?S`cplsgXWw+9z+T6Y}OxcIF{g%Z{xqq^q|Om#|w zYQaBkJuuh&AZz33;9lN5YT=`n8FAL)0Y^Jg*5>cq_*e}Qo`5VWHyXJxA|f`t8zlHTb-pFVVMq z6il7U)zO_2+W{peK5Ue0+sY-Z$2)*VXW=e&QMvP-JX2R}}igw{n zsG^)-47@usMy^uXw0fGUn5ILr^x3S0Vs!>PXEpr7V^^2=S!%)CKlenTdsfoZcz9BL z-0w?|U9*e{Wmn3{r;X6+gjB60?2^)gwXfKFS++gp8X!g)768W31CzSq@G0%Pym^6S^ErAwTb|W$`>X*r_4RXSAqYLQ1hd)xk2j~ z$mXb4@$43FbKF4K`zf`G4 zvf0IKQGE}nl|-;yrm}d(aK%K9>RkBnaoJ869%}gM-v$EW+1P7i?6sk%%#WZ62Df>n zwvzW)D#75Um9$^9r_tzun*h8H>hx?dpo*=R)i7h zBD@xQaWy2M;EraNAF{IimwQVNxCHj@ZOfgY2|{VZKoce6U0R(z?v@rv4ngaiMK%br zXx#D7kcIY>X=OWrzB4;;=`!lL8I;&T&g~xr+9xb~Njs|$(` zt2JAD-dk6T&=Bn$EZ)xjKton*4>aG|L(Dn-kleCOzBtHTRlGpPLr7Q0mmj#TA;J7b zJWOpq+bI1g7PGkei2RP~Ca{9ooYnm+QRym11_nR6h+JNiWA1qNkJ);uzrpWhK@RY zc8YPB`QS4#p-(guL5@G@cwLH&O^Ce!9Jt_ggmr8RgFIfxw-8umoL$o~+IFthMyj29 z-ozZxKu+pb?}}|az<(j6%FfP4lbl|_eFZXufUgRbYCwU8Bc~MCYQHPNd#SEg90YL7 zF!Ng03)o3mOnqH@ZWh^T$8~X9TB<+roSqu!v%lX3T~Rd4J8D~~QuHAau`UbNhFjYkc*OYyU%{&)0SUo^AiL@%Zt^2H5{>K2mR6kI?`3N&C?s z_CLSJ$Fcv>%ip|;TI-un!2sy-!&d9z#3Z*4vaH~=qT++$36sE44_t>Zw; zBhh9%N5?Na$I;PS)L6;wYC^=k?Pi!ZCjS`>bB^Bb9lh+FthTgcW9`k+j~xuJTZ1SI zKiIEu6JviJ?(>h=9kRSJzbFiX`H8A-`gP*IJaKBCI7JUTe{m`vyrOTrFJJPbcQ5G6 zn|Iv6%l#ku$q|=%d-NCj^6u~rH+yu-Q|KJhm%XFIysR2Kd`?jg)e=7b##1iboAEzczfL8AE(YM)#$;#?q%=b=%i!6zB}e0 zBtPSK@CBh*KpIi9@g*`6&A55i>@_dprcv<{&z?O+58ZmKzCNL^XX@)C`r1=p+xYbo zSPjqpmCy#-b8Mxh;jPNQfS{=VSfd-yNZT3Q12KH};UGJibC4Gg|^G~S(@AM@YC zW;EP=vDb)}mH?mMb^#%gV{Dcy{oqtmj0@L6)UB%Y&i=)oWFNt)fWQU8^YKcGoJ34BokyqdU(Ps8ofb}=)_lb7{Q0gm4o>e}qvO}`=kISDILkh#j@qVo-Jx(c-nEWCQ}0TB==5C( zf8?_AY5Y0$;7qStuEVO?RrKf2&acOOLRGcH3ZNiIvDis<<5W_-$6XIN;!;pmv;Dtc zAPmZXU)cdQk!wI8tn*nYUtj#}St zJ!)?$Nw6dU9`S{#cKo;+PKs$f0uO)-#knsU`APeKu!wk3mKrZATs=TU{LK6X!JGzB z^cP4Tkx#*%<&)?P2Jc>Q z=TQ&hM?f_!nT+b5F z83B$@&OYxG{SqV1bXVW1tE;N(f@LYb0hF4K&M7K)48<}oC&PJheGf-se%f3ll#A3w zh=QRc*JL;T{f5j?R--=ieB6s%j3|6+r;DF*l>F~kqVKUla^2}p`+WCrY#`WhhQlEc zeA|<1HsU9BC>!?c^b?*GILu{!doK##x0c`yg|te$7g+zI(?9dt<~A_|F3+7NF9(iy|F+ZKURe0XfAS*#`xo-wc5OR&51ps?cBYt$(4rU2&r)=iP}J%w zuYJsZH6uWlVLIkCLll6;R;tnTBaSAY*ckxx1D& z3lG}RvpKEV5~4j1i*DsduvIjG7x{88ipp*0%WYFRj@3q?fboJ1O+YxJ?}y=HB#Y6R zy4@mHFAn_i_s#0CHb!rl|H1zh)s7qSvuDE?{u#$}+iBdYorbjYKdw>htKgps12)aS zNc!UdCG|1nStY#QIT0mSHH9|lhVO8^4QOA3IZNZ`&w2mhbsx7c+pyM%)wSNS0#hRw zp_J?w@$W+(gsCU+PzCq%J=mSxrkcK5G=iyFpYWx=p9Iy-wSjMKgU}KGoOZTwfPY_Vo?3eO(i9x0>&3 zf5Khmg5GD+eLa}EBd@uxW~Q&M>rkWSNB!byIE|MTAbtD3eYCT60{Hu4yE^?@N%1}zZ73QJA2Z~XYx3(@cDv)CD^R<~ z-=qD*0-8Ml@)Kl+f+oy#uGp+j%=;F=zyRRiS0}V1hSM0n0jU2mu+&jZC86t8dPiNB zV5!JnIpEwR(F(%?5aIlTG)zSEF4u~pRI4gbi4qJgbx>?yDcemZ42Q%lFH62hu2wBG}^Xh zt1m{Qe*9vCV#L7NH0~}hd({qh_rgxBtgM*6;NM}|w>8W~R#=5B8fVG77w@H0_w?;m zZUnDS`|o5F?-w+1y3@&z0=x1K&}uu@@Q-uwHC(Q@6+8IHLFZkk3(FSt1^e(qKx1!I zXUv6EzVp9+7IU=C=ta$|gO^cWd5o_t!`+Aq2QM|ZUcM}tCF~psdAe(S7gbia9+usI zTYy7cb}20Ta`%U_vX63b4@>*|AT0al@ULZM|2r)E_Fz9m#d@%Z4h~PkB4}u7O36;x zIS32&li@iCDM0*H(R=m|sTfIN=d95GN8C-R@}K)}usm=V3$Ot<@vj27^Ir}aZqq6c zc2kfnj{ave+7cSd`&T-BQdsXdhpW7g)Y})75syc1ZkQY> zi9UkAfa5iU2f-{rEX4d59hwElS370pq23jk^T%~6`1JAytVIU=- zY56r0j3I)syc%y(vCrHkxry@O)(zZ9A)8q~uP01&R`mc@m$&m%$?yPRsYN4qA3!1M zU?yeP`Q;6%zsV&wqR$31i6U+`|ic{`&zix!`QAb-+w6z zQi~KW@sAgj*;(9bXhA+ltY^?BJ<8-pi)ywFW1jo<_4@~auo(unt}eyV?$F%f)`)d@ zA(8lLSzll_=h1j2+BV8;=cUBkB0~n(*uPRz(9RIUl{VJx)i6OqhtTK)z(NH)IZ3tI z2p2;$W+MTBcK)0@M{9Viwu5eOs_W7iqfe8blHjl0^G3##Sui%N(CN}$jT;oN877YC z8K;;8Ri5Lh+D|{yHHH}$X|}c*V$i1PW3EjhC5)fcTfd^&CdDg36?7=TZC!%q?t_}Q zMZO?_@ok${UZMBI2>r;?4A}V^UUrO=ZhDr&7P>+SqKg`Tnsr=llCmTQEyl_jPo?!L z#a;(!6obT#AFqKvU}(y0F{&a-h`p;M>Z4v-lG%Ql4aQ&nHi4xK=kBIk9ZyhRox-43 zq7%|8(iK7qn*!>Pp0ZJIt^+2Lp__f!s;{oYlB2Vn_xy2vZ5>u9cpg1j_gY0vvf|p7 zDfDz*glFs{&IZmo$UK-=Ty8|RCg=O8OGQ&ob1Bc>9PWY&k7x2DB}+VWg&&p*N*v`& zbX*rH#xSl8Y>YGPysP+qR8Y|hh)~f0d8B1&v=|6I7;dyi-0&Qh`Ff~2FxoA3XH@fH z4Blgc5vACI+Aj(#%kY{)qxBT+KUP&J}|*Kr~wQUb90L~PK$2J_V-zh@PNX{PP=#>ZAdh{Tx)FM-ua&&OU`ebM#@2fz{ z#Xu^B)l6AQX@+HO1ZNq~Dv#%LZb_2sq&u4yru8iVn-LOMDc9v_Jav6*a=uH+g5W1Q z@f(x?>jmur7KKFbBeca z7zI|XnkF$`tT!5YUO1ZRU|c#Jn^l4Qw)fv0Z0)~z`wA~o-W#u6KrrJO&yXZ_1Uz?H zgW$WyFd86ZCgSRBXaW#X7DVhp2R*(2K1=LE_~}*Myx4RM^YDmMv(Lj@2T;cxSs{ z_bn}6r)@si2NIBUHy<36K~EH2QL!tO)j!eKUx1Wny==PqEl?XM@`aKboqjq$lF86J z&&Ty+@`(=;BKxH@jNcl}3se6B5Z+Ni>v&XrQ4esh@HzAhMRJO1Gn61OHWWXv^oGRi zNLXxhS&Wx-l4o^j-EAn?vGd!H#GSj7Br|P<$#3k5*dF@nY)8 zBjIe?|8)#s25FWdmk8`%4@X9KsTJ2n(~q9vOYSmtK&lAn4ToE1j;ZiuuRQ27sYb4` zJ&mSrsYk+De`XkR2gdQsIyxIJ|QKR#dLs4&<1A3mMA^e;(eRt z;_b<{-B3^tI(a^z?mV2DbX{JOln?h8{R}OtCh^v~GG*AnS0*EuPWjf;X*Kd}BH;%E zm~;nY%xPCynpPy{uHr7)M$V=~hg1F=Ih?+MJ~>gFEuZaJ636{prpo9HTQe$$r#yx?MiatXv}$fuapDF;c#j#*+s|x;Hwn^;{4O#`$HicqgvEFt`NeRbgym!_HCsMFK*O*kBWk_r7aZkV zmi>f>Y~3Vb<4q%>?NU4amsYZUDS(-kN&_$VYXvsgwMW+|e!knyTLIg1IQ z|H?7QiWQ#T$oylt*D@T=!#1U>wvR<;4Rrg4crAW)I3?9Vg=kPD{Q@d}{xTkzRjmHF z0nb_MQ#5cdnKf4EcBb#hYkzOMP1j`bcl&T}Z|h`-zn}c{hQI9}9-xinPh}GTMGoHX z?;P!JQ}L7C{hiMnVUt>!3{A5lncA-atpN0^VBppcWmd0HCi@CwGMspmPZepqf@y*$ zDek`t&Ub}13!g*Dx-U$~bQH?pG*@F!<{pvxmMoO?#&pqeqI;MSkxFB^K1Pl&B!A2j zNywe#dYp8pNv}+lwF_3o#Tbp>1LT`^B*}F;Em~oGZjq022vTQue%w82AHUt+-Z?(@ zfJ|i&7g+WGUi&CHM;%W;J$+|lg#20|aTO*EKSt{PT%%V#UQP1~ zf0{S4=kTrCu<};4PE^$?q3p|as(|88dBbu%zq2X;dB;j0`;LFwccgA`@9?L*vnzzT z_|y)Q*Jcb-RgFP(EM^SylV2jn3f|J~*6*bPcyY70`=X6XP6=m)x8dzkRzd;y+UBOs zFb#*t0N`M2f2SrZoX5g{wbuQA&&Rv}8FwaGGWqHkKy&YZnvJKcs}%oft+lq+Y^*)T z`=7PO+MoA7f5b=M|Cr^c{BMsN*88{BikeT>o8PRj6@-7n8;Lhm@y<6r?z+ZZ&Tts8#Bz%&Pwo52UcaW;!Zf zCW4DjHkkFNK)$LU$%6kQNz*@&1r8>dk>6r6<=F~wtmf(&$YkhF0$<|#^RxPMiQ)W? zA9T7?`1LM*|6XU;nRR|@OE!W5oW%g+vevH+Vm6|@jGtHgXxNU@nk|9vt^Rgsox)E^ zd(828>0eBp#*vHZ6=#17B8|SlH`~Lhj+APjQPAFWG?PH16b{uzL8h$695t6hh)R=a z$dOTsRPu5FIjKJ~5|RzU%ag$s|K0SG&Pl3j1eGfO~+_%(mr&`#@C}+4RH=<+Gh66+v`t!?n|TOn?WOWH>O)ODJi4 z`!0Suu7*|$Q_RGux|dwb>DxzEQkMYcaN-xJ;WKn7h?XuXf}$?o8Fnv5m^b`mG7R8a zO>#f0KcB8}5y0=0@7s8!6R(5uTw_rx55@EeG~mFwfbI`^d{Zoa;r7?(!?U0|9D5#t6hfUV;O0l;_hQ2= z8k_~ZVpszw9HxWyAb~7{wn=2$SAYrKQmpPOohahtH3&V~y!&}8?&Q{+X!RXhzmKi6 zBF;l)LaT26W{7nN^GC=sr2&u|)n|3AaqMAhYl)S*HJIFZ;aBSF{c0DEm!ge>OJMT# zlqAudPnr|cXC7GzZtNUgRsTIP5SY38-2>nf_D2O?%6ETX;f?2evx zWL**F4G&v{xbw|R8PU#d5!nmVEWa5r88NO!RJEs2LMPJ4bl8hNiWQEi8h{j_wGFfg ze+~}Y|M_mz;yp12~6#DdG(kh7WT_l5|CY*D2W zUDnvEZ*&HH|0DT^+(C@NHEPi?4vx%K7YGGCYM;;Mom zbX-GetYAU0l88HAeN+MZ-trkRsMA_*C(xA85)|yoPVbjlHZ?`FqEl$dcr$;vs%z3O zk_4*y`Lckb^1#zqH~4}4sn^ZX<%@wDL|s6vNWvM}o#SpX$IE)gvVl!U{p2#~-!wGY zQMwz?ZQX+Y*6XThyh8bHR6hf{MGoaghzhyh0P&P~Vl61rI}t0Lfr*wN-E3?`=`(oE zIgL_u{%{NgLNj$h+FtpH%)})gG7ld{;Y&Vg=)F03V$DF9Ot5EOHLPI?gkmC7eRgxM zB}{BLw4!Fg{^C)f3zpkkhyiMQW3@Sj zh4=8vTh!180#`6+f!ZEf(wTHGh$ffrjbJkfUaL)5ZvtXt{z1fbM`jSgNu&wYPUeV< z3oue$-XmDTOUy7inhkq$bK{YqL1*%jCZ<@Vbp*&Micb5ok5BswdEhCggzjr9B-N<` zzOgDM5f4u3rK}8;$=_$8T~i+^WM_6gXNooLL3V^xR-H^qB4?SizWG(Ag(Y0-q%%LT z{38MSK|%ybs0*QMA;@=Wyt`wueogCSc4qO~2yCPmMP98NpV z?18#zJBfCIgfWhS1s$iY1MH2ZTO^Osq*&r$7oQrxw2k92f0g$8=yOTlT^*-Ob2-1v z7^x*k4b3nE+zW@Y5lttb0OT00l7@)`ONKCN*@;#l=D_q2yN1dFq6Iv;ZaDc##}95W zPts5)8c#YwmBCZruVB1PdSI`*z~l}bQW+*iexgBAK%y2@FP7^V*C>|x*jChxyIk`J zJuOUihqx4qAscfUhk}W=?66F9Ge6Pcbb9iYf?y1zv6M?(C)_~ znd_Ry8dgF2Jzf!uk26gcaZOOlY&|%Ma6~JpU%pH!XXZs>6BKuod`r)9kqES8as~cc zVB>qS1`4SUR!20xkJlWByDtRXzZ4FX}yCUW7-TK7DIN_ZU1vJWTCX zjjwvaSE@V`LUjuw1)PYa*c0>8oYD>Rz#QiuJHX%Qzz?`Og$77fv=ovT{Al)y=Hdo! zL^bd88&1};if1)qYo==l8oND<3LlK&h6`b%M(EmPZQBUB*!$s>10Q?e!M7*@jJaNeTGn^te#IJY6@*)uY?&Hf6b8lzfwIzmMxjm*QHf)znUs)V%& zDYIT6_?njlzk(iXY~G~vRas+^$j4SFf^X7FkyvD7u#$5}@GWzOo5qky z5Nt2NFDUW~HF0!xTXjMt;hy<{B*P)7Tz0$Uw`e~Pjgzf`Y$m2ARL20p9#HEHhH%?9 z&^08KD#DRE?M%?Vc@qUTdHf5NQqo&uL6 z8{X&)(D1&+v*Soh<580$xl7Va_HM9Kbipg|9j<`*C-AycK2W^8HoNXjWih9K+vcjB zZf4jR@ial+7fnLx&PFm319Npj$kocoa;^S+Iud$tA)Bd-cjRMPeJDSk7FEa>&RrHD zM^u2E^Re-6bWj~xi1qe>LC%RaN<4{@ni>rbMA9%+e!q>OS`ZPKOfre=QeX=qU-E-6 zv!+Am#|9y!kf+Nmg>CYmyUPRjK-xfWCw^H%-BSZ-K9` zS&qbIub#yrV`IpM=u-kh$21fl@^*^qidK;OHt%zPYokZ93bsWEYy={{U7uif^()du zAhqC}3BYTk^@25r*x&&1P?kwbI&~iWcvNUJ8Fzy&D^5CFwk-=C1^>2t7%lyy7VV>Z zF(!LupJr{<;co3rVsAqhK$M^ZW5d03guosrG>uYn1;HZ|3x8zte?-wS9gb&Yxc$(S ztVRDIUf|f!RdbUPx#P2{N0$LaQ3o$4l_#-Em%V51uvM2&zHjdw9`id(b%RP8JMED8EZ10CRLW@O z$@V7P3T8c&`cUhI9S}yO-x*a6<^-nd_0iV;{?<`+^mcFOIHG626R3Z5i6?BSX&K=# zohVqY{yciOxUv}i7A>wXzK_UajMlFFEHkhu?|I}j3m`Qc#lmHQF^hAqB%Q~IVm`qU zKeEW;R9k?^#=DiklTt6~F>L!XJhVS?c;uUh&gEd}i|-cM5^wSSVu<4TK4WS2OoJ-a z%gflCflInAW*dY{hwauv23m=~g2R6Jp|HxczSt^mkK~XaO|swNW}k0_5sl~@wgLZ7 zC!@YNpYR-CDm|Bt`NYJ*OdPL;7@G1?VWKEQ=dDHR@WS|~Oub-xA11)9OnR_v{e;qo zs4AV}Dx4@jUmm@K;GmIPl(OREgwoldcJmaEFFKkeFj;Wh+b!IB1yi=v?OI&4)c_r< zY_J)9c(({M)%*bHf_66W^`<@Pv~m2*)5xg}OK|~=GNjmGR2kUit~k3O;0-VI4I>Bj zf^$P+xiR7y$H0<3ZPk^8EPgNSCW~Z0`&GFIcvY9%T$_vjZaiXzwXJG*?L*Sf+$#`d zb!=y9YU-5XwPMI$kjFg-2m4c??7`(LQSubZE4bqX1q1!!JRC$!z@c7>27vX&I_kuf z?D!~PpxV_=)fB3g9}+mbTm+cmZm9NT`(c~8=xz!JNvDpjS_Jgggz%vwFBqbcnEDv3 zMNr9W(D=TYD?-L$v(d%vKc}$-n)dr9SPi&gC-`3OZbGIk4(GtU4`%o-lZ57u`)~J7 zj&@GW2BkOkx(P2rH+tRC46pHm>wqfoa>LQpP?1VQBx65Tg1Ut;>u)b2?gd+*1aH20 z>5JFSt=sKsvm+O-TOmy}hrQ{F);7+gj9gx*nCpIEfgom*wr(kBGqtCQE)56Dx8L68 z;2_J_&`Q_5Bvn-rp|mmWqlQxV6wGM1%fnn5;%yoJz2LukLvjfU4&bRpr@mTr-1W7l zur@2GIYr!Z$`aVvV$t*|nZ_lQ%BZ}bvv*VSZ?G!o}z`Z#ed);gM+8M~>Atot;)`Gh=Wx6pxZA?Z*_DZswgygG}SL39W8~c40!TX>cqa7;wKUVnX;4-)Zj# z3{8HsX_3Mg+BI)cV8$Pv0WANA+M;~_9KFAZ)Rx_a4GDr%R1j6q5`d9*o+l2FxdC44t!3shPnoFDqORu-$De*Mpab zC&#%Sd{|joSq!L&@8W>jAjLhY%5JdxZ?;ZMaC}t{je0QnJIwJSnm-wnFJrk2SCL} z4uT1$z(IcK3Pq9(IlAw4@ZrNKN1v>q7ua~SJvh&r(OUz@VfR3>@pe6``Yrl%8ar_= zv^w$b(?#N@5-w;t9`e+FQYK!}#r+&F6*gE(dT1?Fvpkih9aJ3CoU8G+h3=68acY(*@#jbcNJTL!T1sbtBm*avU_--jyR=Dme!PogPuz=g9;5( zVR3OR&08oFZBbZY(k1e-Kwm#A?Gzcn@_i`UNTPIwhLNGcRiIleJN`ZCu!yZSa#R2h zCY{9&Wl22DOC30Gl+>bZ{AV{=ewdO7#hi3#o@zJ$jnc=Q!-_e*s^#=-ckz^fJ@(G6 z%6r;qp7|-Ycwd?n#B+y35w)yz2B+!y42_}0F05+ZYRORWn%o2EvH&IG*b&YGKhNSSn6Rxmy6+BC-$ON_>FGB^XVh_wVcmn$(pg`g!hibGD!JFle^#p7E~CP z>#h?QH2Bj_R1vowUk4lIiOq{1oPvbQ_C{4H zr5Nobc$;Hbl|sqnfk=i5N}vrA0M6$h zI5AM6@gKeM=oEU&wG@MKmR=+JQw_The8nxd?E=x8n{l_qXfbb>8Gn&MWTx1<{HHn_ z_Ti+EDE7UWjt>c$FFeaX;bLjWolkgo4qND-aH*t(unBMg*W`$NeBu{dq zXQ=+|juAtc=N(9;uhA^TJ@A2OH!@9h%2f%Oc z>*t$WY! zrm336H|)3Q?z-!4ZXs^b=lo_Wy){(5MY*J;tETb0OgU13kf|tTVtgfO{@}X&;?CGz zdGqGV(!sc&+-`5VvPdT1?!VYMf-NE}(r?kh?jHP0A(DRM)NJq<(-{6%a2jd$?YGE? zT`b`Krg!nJNH0<_>W?PC${zZAc3zanm+m_$eo!1R)=o#)J#93Y)T9@=CWe zlr(e&YA6#vtYdm)7$|oRg$+dyH>3Xv^=opuIb38dO|(dAKPMCF88f*bi?~Dcu0f$y z8}aQ$pj(MOw>k06mJ5#Vkci@jGE_(kUKxJm7dzPTXKu%Tz4Kq*>z)77U3eBONdS6pCs;9E_qkv9bx`-UU-xy; zt*wKX{+b-T^a~swdG8O8<{`_A-9l_(gJHP?|Mi{=N!U-$Ol(E?hP!GsNvEHP)l52o zLV#Vc&0JbfFQ6gC2Bph3juL9CQ}{yji^DQgBZo&X;gE+O3bFb1NiBNvx#s>ptwm1@ z{t_Fvycm6`!~c)q{|AOl{@TQh6IgVu7Cru4%TaP<;zw7>gcJIXfbW?`Rqk#l%SPR_ zgMlGq18%hzts*q}TLdooJ0^>RQ6fYjUgl>pgd9ZFMofB%p|`)bK#a%tK)IWr^9{1M z-g%17@l|N?(P$DIJ3r&|`SxJz=%@CZqus-!-IJdd{$fNIx0W++6>Ta^6q&QxDG8=% z=jT|m-y)=l<|W?f5uLH6DN_;$Qu{z}IC|yqQx0P&w{XXG=K|&)Mo$s`K9IS}q6$+f zbj>tV%0<>98{o$VK@=ZNhA<+Z38wEe{^8to&5<;tnCpi8d;B1&fzP5U7P-HvY4My$ zf6{Gp!uji>4TxC0voiGz-G4598$`Pn>VRXlKH?qg-`#?eE2qpcCO|HjWkxtNVm>x< zLpJV)YS2tm@G{Nr=+XH73K5LwdghhAZHvb$Yk`x*OHep#BIxM}ar5EK_+fJE>Q;jA zN`|Qk4_4s@F*bo(kcXGB)x04P8Ss{6l;wIs6{QftbfY2O!t=MrrzSbx*j($e(LOmL z%!X6Sm(%koYR;d0eh^kZ;(b&TH}J1zh#+PN|3q`}V{<3*&oBnJ_hsbD-98)j`=cvn zk(9J&xTHb>aEF8!{cHD?`VFVHSN!e42?|~I{o%1mC8eW(=8x@0?yTmEU3Nh)wD{n6 zcxOSkv^OY{tjjt(sykiL1MDBphT9?He6yL|P`aMp6F*jUOK){>$+ zqr%xnaWg@ak&4tWkfM=9g?8>ktk1DH5I^{EVArPaj!lpbTEE=WCF27Y82;NhIaQ7X zQsZbdH4{Ol7ExApQZ?DrRYt<$SmCHcbK@ErP7YP~C{slcbg;%l^PV9nG*t#UkA2AS zNR&VZ3L5#EvVl>&676EB=~|Q_aR;(>j?R_{$bgpMFC8dx2IRlr>9T_ximen8hMspv z<4dTSk&Q zPBBe^Kcnsr+xF9#DsdRS{ssPz4PUT#pbl|`&x|eP?!n8QA9r4=AR@Ma3po=;a5M5V zwd~!6s_rzEf-r!`6R=@!404!2k&tj9-5T09J{R^AgH?USZW6fP-%BHeli9U2=~)Q` z$_(`GuW78P=@B_&TFREC8!R-lF*j|wkUwh6-3qybn2!e6okdHaX_6pv&o(22X~004 zug@IPm1>~mLZ7ZZDwZ8BGPvODc{d<5Hb4VFr}b1XZL+~|l*3C#g5l+giAHe2PXb-b zLnvW*GqT#bv_{1or6JV6(UNmi(hI-3>z9FC<4Il);|CRuadXj`Q`j(SQx{yR%o8W# zBJ9GX3=$GOC@OJ(Q?EJoSci&Yn=$sTmbg$4-5r_(^IV{~P3Aj8p|3KRtee=M%5Rwo zrFc)vICaD`r*9+siP12@n{mU#KD<>hB~u;k!18D4O>L0xJI;?nr{dYmEhV)&qFfVW@+!^lNA zUtWkMFR)@5Ovr2muJPNZi_paAQ5XZsP=5es!y6Uc>Y^7H=Dt9WMr_X!z26xb2`ix9 z$8fwV;E?FkF`)=@um#S$G#&Z*F0iI_B>}(w`rYo{4rANPLt)tq>?w;FBZ7mQ$2>qN zm{F{NoiB3>=H{s}3(okBLbJevlJ02Oo`(uM2||KB zSx+f%s%x%eh28+p({kYl`{-ol4cjes!Pt5obT)yr1e{^ zzA6gKf3)*vXX`}Pon%AC18`io1GLf^QSHjynr$Rc74@;nKRs(-Pg&_HckD@-|D=v5Pi z#AQDAammEALBwFNnz?l7Y#r>Rt2Mn$-hr#pE631uN2ue2h0l^fX9#GQp`bYw&sID; zY}gd(hb8}RR?;&yCsV9Wh4MX@y%F|Zg&@W2^;=GiE?PV{!FJD25K5~2)J@KuW(zi{ zm_#>=&O(nv$ATaI6P|Gm5AI~;qa`9mCd&`KF#R73tdd8QB1?Q{T5PCAE}AH%Z+D?D z1P%}oduY(i1XO=M!GNQ848r)Z2jK8ok#+p4!BO#rbb6Trk3vV`5j2HxgkDGAs>3*Q z(coSk9=(ArZLAfIx+q%r5n_%qN)a8Deu?mb!e__6`pVX02E}EMkLB0vL_lbmUD$ja)y);Z84LCw}10 zETYl)WSRx^tKd|x8f=iE2J0O2WMK690`3YbVC5UKk`x@bQqdS#ax{t>{_~FheQ!6@ zEjTV?i0p@_DD^%e?_1Iq#?}dCeqp{OsTc-oe&K8ixKlyn-moky`^}uJ7P+&Ch>KI8 zP6+W^R5|H_YPF(joO8?`sCm@`3!z>e&RPs@;V87RwI|}y%gw0ioghI}$-Tp^m){49 zAP&w;#v2_!b@6w7kP{E(YRp}LjGFAKcA!B z1E-_7B}V2BuAz>nXm-MU+(pt(7fodpem)AGCqurSLOf)J%<`=;7XxG6sfu(jtmOJ% zMs{=i!mf!Asnk(P6hXIe6;;r32jlJmlh-oa?7Y5cwU$#mSr&u$0k%QD{)EKlsAe@# zHbxyk-l?Eg!LE}8yez?T6Lx$xm+;PD`>jMAQx0$(P6!G@fHe3wgZ%MrB;1g;-|~*C znPUs+P!gk#A`CARQa(UsxeK2c!(KQ~ytK6!4$cerM&td>#dSHOe4;JKt`4L?C2&~oa{1c{l)O0A57f;?Nz)3rN>@=7 zjXy46;BjlVQEq9^yY&o9p}+g?D?mQJntjjm^~rZT2bysXMeQ=A07x)N3`!2jVy#Gy z0APy&N68vM>??WI$`LB!gX>K$)!o^xcA*r5@k3X`LH{a42%dkA-r)=W@&2}os58pE zD?i{w>Wq_ofcGvS37(y~@NXXq(M^=s@fH=0afd-J)(H-Sch5TGe?XBth7hT`UNxb7A9 z-W9z`zqk9!5|>^UTM)ON&dF%|Rr<($AovJn(;0i$96Q6j=n zM7+gTCj$Lj?&7wb9_OtOE?K?k8yXlx0lsiGSFY#_9p~GZ^Ua2K0z$`u#0?}TM3C%c zgCd~$3dN9QpXDs4wJ^=(tthOigvn%(H)*&mw?UaC1y@VC$vxURd3$8F2zOQ<&;kQq zL1SU&1hSyzO-1sxyJslB;Gw=)m5?^C^kt#ne#-?=-LRx#Li`tY$pyVMn|tJSL=jji zo+HD)+R0pnz+w!UcG5m!m1kfDsMtPyvwiq- zM3wn+T9~m-mn#v)#YnO3^ zrCo>=eJMnZlnX5{5AV>)SLnp$_tGfSY~%9aZlmYB^ANVOMX=!Av%9sBckDFGlY)~w zjl;If;ggsU4#3G6H?ALx8D1PEkC9hHh+|Pzp%t-l+4U%u6*n~!c+o#?&vc3TD}+a8 zeuZ+&GcAGIRDpg@#emO|3y)NrHeVd=Y<(X#=?uqioKvbFL=O7>z03LV8t$@iD*0SB ziI=WAlOY^0-qDn2sMsN*#PE;a!94uRGxF}k#^QS&2rbR1^CI%(eZ@?KK`F<^aV6}J zH8eLc?UcB&=7OYJMUPDbVhkmNBv{XL(e$A=7DEl91|?J_pLYlg=E{{P^eggz`s&e8 z|LxDutv-M_^|h7eqioWB)aP_UD;Hn6jYhN4c=Gu1zcm_-7W{{Qn@`so_!mEqS0Ata zTeGp+YP43@;5U?Cef)Io-=fA>?nmKghPtaL`nUeY+1zr|q=>#bb^sK)Z1~|n z_umBbXw&>*{C+OvqUhgL(z+0+f)Zygm_-VgcM~{{nliW4XXH^n!XP&sUWx9?C|cwq z0t>N);cSTY`TRE#7ns2y_a&IO4PZMmciJCt-io0Z(SMF+Mt36`8@gGsi9kQltt6X? zPG-rX<6zEiC{7m8i*{VteROjS21ZzAhh{=Oh=rsifW}ab0K^vEa4DF~UA|I1vcIDt zN?j9tfSDpAw_=udwq{5u1`-Lfo#-6o@}Ub*2vvjbI#n2U*TgaxJ>P6HNro;>UxY~k z43eC%524BDM8BZ!87^d%O;cxC61$8`dWYm1XU|iy97M}sv~keg&gbU??$m_dxF%}B z^P$V?Y=FjKbNq=m^hH7hJ6}h8dPp5|zeVyT^Fe&8$~ZOdN`4ApM?J4gT8L`$_gM-H zEzYhVhWOO%@l-Oha5mWuCR!iH-9>DVnBNb0)fw@7g{;4rMh&8xJU7;AfS@?!)-Ix~ z)bUtSrLg}Prp_u{LJo01x9Hfc_Qhxdg-w3Uc~zv0&DzEr#^a<_N-t771#YdfE^Zsz z%*7^SJe?75caGmPJl{mzhQ;7cbHlbO&^%Mk7*^HojbUbTV19OpjXRqvqYxc^X~xP> zIGOv&Ww*pWNF@4yHIwzf_~Y^aL>5-MU%QR@{C{&5-V*;0-=J6%`Ty1C(?9wDKjNeL ze_4KD|641oYmWU#Nnri)ll9hGp8bE#%ph&$+X(=UJ%5%>dvGSNTs(I{iMSK(u6@9X zFOGIRp#XtZyeDMj5HSC}QSgAW!TOKR!v}Dz22TdbAb7$P6+S})#aoCZ(*a8)W`I0k zRMAwg@2w1-fZ!TXI~BLU{e6zQk6j+V9YwrEalK%;%*(-K*s*rg`g6L{-!$!$%|J38rhQ^{s`40Zd&J#ZIPFDL+)g;= z8JRwP=%$N476?>qME#UT%o{gm{I<-Orn?6+FFCstU_^O=0&d7d-q`Gj{Weyh1;zzb z=uy+y5ny6*MQXO@udG^g7m$Y{;E%kp5V01 zvY<0UxrO*^h@H!%M+TDWA&guIRwE=;gtG;ft(*s_U`cM;MNsxtn`+a(k)`l_j?t#U zN`;mb$}w*6ahr)rzh5=b>1EE0K;Oi z38pJUBrrO~eL%u+P*U`wlU;ZZgp?V75d-0G1cAj%1o05s!e8{>QevSgxn8+_g544p zZBMpV6?YPVAW|4(@ma5?STrOWiphg&&Y?yvA$;AzJuDMmu)5y4fXY?F$KeDGsCgWK zYRlG$?OboS`{|GdYS*C|v+Kvn$#+LPTQ7~zuG{@p$+<6J#%o#N3Og?gsINY3!dh9R&c-jI8S=E+uwQJF_2PoLDu+_}5 zZzvO5v&o|wHaF|ZuK~z!f>|&mQ{<9T;m%h2##r^CeVQ*K^OGy$vm6a$c{ce-xrwuA zHsmM`Nl&Y!&lM>*hogTq_|NbRP^+WQQN_8rlK>~Go=gX`UT4|~ z9;y>d9awfiGzv!H-S+G4H(S7DtI;Oo!L09IOW1aL*-OTL$i#FL7B+o$@OHm_vi15H zzJr8Ch&6qezE|C%-8k#KY)?8@li6@Q8BNKVkZ6q&6Kb+o?^9lRz7RvCA#o!L#f^1V z=c9y@`gb9b=9Q|(UUpA)C-hlTloC54bqvuj;KiUb@ZWj&WPiSF<4Z8K&9Uz5?UQ}S zMIpt1y$$1>V&=|^QIF|99R#$zVrXwDtvP-8C@EqW_JsY@JAA_#-=aEZpj9`WA=+XQ zICsXVNs%+l9+zbH__evqEWtcw(}c#1z^n_eypY)-X_UfO2b0G9gU?)>I6iFQYVX&2 zGvX180HDW^3ebcRnA1Lj7+{h-mUIoC8FqiqQ}tMxfZvE}z-bU{nLxC#E=OfMMWLOy zR{}1ESKiVF#T1150E^fH#DYpFz zuV}2{*F9wv(H{-Ze;JJPMkc+HGB7C;NlhO~fL*9Q1iIaCpHE||pf!J{pkh3sI1}T3 z+dSpV6BC?+WM&(p1H+m_`@mH2xj<3QM+4{)#&_d7UZ0ez98Q!qb+zPOFsQrozl24U zGG9K`){@pqK1`-5KQNcZuz0bjZ9Zx^*_9(Im_ka#%%YpdTHe42;ZCIC2ddntj;{K?# z98_UpYSK2~F<%0j4HR~jwb+tq1&!g>P+SR31NEh8lqrc)C5_7b<#c|PB`7x z+boNK0YH|fXFR?6_Jd3~%*^4uTO>iLmXnVoHh0Z+io0`(-Q{98<&xc06~$kF1K#12surrfJ?(Dn{~TrAWm{+rmKohgeyZ+9{^j1vwjED0xh~7zWvH< zXVN2Cha_BZ7!C6qN}}^*Nxp!M9G}4I_Ry$PiSwvk7(=Z{)NVW@C{n}FdZQU2TpjiO z(2(ABbRX+m07^4r-#VDSGx{7c{6i605ExMi4$-t5A(b?JH#aWR0h-^vJK1j^NL4mU zAiwcx=e*8>HrbD7eCTNE>JI!5V>+L3oQsYy=cWUx@%Csi7!AK8J6%oT_>ykJ9_;p< zR;Hj?e>5#S*h8*CS;P7#udk}^x5+-mav@9IRB3t0Zk)pH6oQ(=C$QCm{8}vU4foxd zS}0m_^N`tG!<-55jz&%e+<@3h#Zcsw^1f5#7zu#dO?lOWYDPbz&;kmZ_luepG&jYD zIg&eBfAcbk4+3_v(3Vy7D={(y5DV7W`LmJMxddOLOc$rQ{L&ZS56U5#H1?QNz>1p|y<1y>6PQtDU;+2=4 zVDaU~-Zz(L<=Q0ajxI5(6e0zK9Zx5{^z5unMI3AG*CVONvwp8~&p2W#(TNSklD;NZ zl*F*tj@f%V6waW8wLk*Go)&hjEV+n@|9O|h7A|5a+B9>|-qN8va}TzGm&SZm-Tp>M zL@(46Hh~_iCx&bnlK83dFRbyH@O|$AKUSKzM44VSKP_uurGNn)jbgji1rfYZ|hHs~t;@lmK>O&0@i(STH zYqOghdwaZd^m6ND%QiO)TAO)|&A7~^U#8o?xgq1!Z5!(LgO)CC2694vM+U-00APGG zfHy~nCx;fmI2`NcEhdZ|zRYZ0DiA|}F&z<*=;wPr9HR%uKr43yON)G)$)W2|hc`Gq z7I8hi9eyHTl#z$Kjs`ibHJ59b#@5vpszvaWq&??ua9f*-4OQpvcljIEyWsz7?RlX8 zB^&0i?Er9t|L>E=;}+_F*IH|9&Boee)c>wE|MdU;Lq5L#mzSRuz<&|@|JI{cD{4Mj zZ+^4B_9UtWCC|6+ zSB5{vz%wKi9RKYKU&Wzj6rLO9s8%5@O-~IAnVPF|RvKH|12R4^8W^a^VX<^xt!`&H z9HCb$b;{jt8kGgJW72~{t8nRcP4$?r45z1Pv*4`k!n=Q|Cs+T{f`9o>dU9%*dZBAi zPub*Bs`H({>j7SzViAGK7pHPbIySMiZ0hkLIv<)ep*HlH4^hlj#(a3;FA*#7KAB$H zN?yKboHSu}#xZwjL(0)>G|KA_M!o8VoyyqwNM1S3m5!uhu50mJLtT0G;($wBhsamsn#^JXp6T~%gbin z%@bIB;|WEVSgI>{+hFni*=B?|vU_mysAX|L8~>Y#+{iqljO~nk~ z;)%8EzsuGL&z#Z5y#hK$L(@;u&&!zFn0^UJNxV_*KYzX!FH7*I)OswS9nT2U@D0yv zQExO{obp8oDZ2psv5%Ptu-~*NNWZz+-+%|tH?bA`R;O>V7?%&mGt|h~gM*RdBKmJY zvx{fXpg+}%=g(X5vOgeflQ8rh0BpWz#H0pC)-1{z556wPUpCiZkLj$qv>&n0J;VI`|F+lzHq zgerzce{8>ukc;0aqBzqwkF!5*!~TE&DU$#H;P_w7$7?A6w^mnMkDE_dTP*+o>Hq(S zd3D)_n%$#kbnrqQ z=zvni7I=FW)vi;tla>DeeGr+D{`b?3`!-`u|6K0{TzOPxQaJ z+He}+Z=&Yf`f6*v*(^E$fW&tuXkce`jrQ z7Y$BO8C(=Y#(Re5zriCMTkxzkulU8}nSTNHfrZpXG+zah z)9FeaGSlJ=pH{oECC|Q88&|t@;pGQ{pS1g7hy@m|3@Hu>;^^P54^ z0em^d%YQO-O@_XfqzZMOZ#FO~E_{pDRkJZ3((rJ(Sr99K(#~e5H%*au6tFxvZ_3<& zk&KX1Stg_EYO48c#b!>GRm8BDtB08>T&>kwRBzgvBqCF5&oG;UX}D?LA-w0_q{PyO zeilI5#3EL-1x}>5>`QDvl$mRLW7utj8qbdx_hi?F+GN{DMWI z*J%D|!iGo&9OGzJug6@b)9caR!<0JNyZ(Du8wbbM*Hx)JcVPX|RT$(hKP>s4{xgTD zuUYzhzhc(dAMSKSeXcU`$=;>!UC4kt4}Ufu|6ezJ>hqTkKZn)he>O%F!|WBqtD`-W z{rLujAJ*$YAR7Kun05&F4XOE(#V2dIe-@R+o6-<@`vQ?YgWYX&R?yHn>njp!If=7=N)AY@$gjBdSDA(J zig+boJvxyidRw5DpQf(fBu49 zdNoO>`53IcCs9;iicXzeO*g&#^aT&LiofDLJ5h>wRMk{2#nFpeRMlHO7Pz{5jly;A zVf5eP5I6-(MRSUxfshT))X%cEnc#&VeOSZS(wBH`Q+CA7k z{%+^xLKQet@7W7~ji*ZR!jYx*FQ}z*aA3Mc>_Lfj|J7ZWBbk(upNnq!@U?s8VGQk8ucaBCw zPu=+gk_qis1NbY3+dA*HcaFCg78V~Y+DFH4cD8r7_Kp`S z|NVcKmcL!8zI#xw_}hrhG^Mqusuo~rV6t1vri$vD(PDGaVm}BL4a&ub`CkT@JPhXw zpWqKOfc|@Pf$5`$HcZm{1ncf8DrdSz7T%t;(9h8XDchcoOuP$!JSycGbyaoS-8AE` zdVPb7JjXLi9>w-%)*BzbEE}Wks%hfp@rw4tjHTj-chmUO?W0u?B6YZGy3|B3m5cw(CMSEZQ}ZjLZzgBbUEQ4Jiwgru{o&h9E_Kn z?mpS1s(-gw*p>f=Jv(OG3;fu)8-4Vf;9&kA-g~L}%Eocqkqpv|!tA?oybp#UZB%JO z(XJUM67T4t+57osvHLCy7ALUIF#Y5CO7!8u`^DJx-Ujy&NbeVKn7dr|D^pBg*av%s zv}2kgF91h;Xa(!J+`c_nKtjmq@ye%%5>2l<1UtDgc%dtpUSnkT77dSeK z%U$bo*K-E^4_C0-mDq>6ltl!i1nW{Pk#P#St{E2fkmGIyRi*&$SGM8>SiCUCn63WhBR)zf&mn=6}oH{_Mol<>fIPK&BzR;b|i} zI~YYbh;}=?uXYWa3{*09n^h(WI;A%msjx_jQ$wgPl9d-cXmM|JyPGZDu(VVi1LG5; z?A67ZUHs-caoaxF8oazgakbL-=~2i#Q#MtaiCe8^?hNs_|H|UJV^Ae{8x%zE+~FsI z@hErVNR8t4pcyuHtnO&gbu><5P3Uwot~cXgCs>pZrfef5ih9H{HS^BZ+%dZ`2h?e& z-x+ob_$wcxIxb2-1!ucMed5O)dgi4NbK=d0(j|N3RjgREl;Np^z=KGLDv2(+Hbz)# z!~RA^2Dj~=L2s?rS#8}6HVbw|`19C5^C^64;vVwjdYyrhX2syUIR{;mV!K5c42WY` z&Cr0rc8x}+P34Gz!Jr}NU@nWc^r#$7uF=D(a}y7Co0YxA{&QkN>H?OLA87_#;yNA7 z29b0Jc_I)<2fXoQ-mBSi8b4F>js!^20!yN>Tr4|EXi~~E2o19L#&q(D3_3=<8O3j# zg2i!1FeKVE~!wH^shFvn`~b+6o9tDgC9ZqjIVA?o>0JZBlSubi^Jvm{?Et z4~0Y$ed)z>$#?Fg^SFrAqULiz2chT-n9>%=kfhWQL(no2lX`6mm=4n4Wv6C_Mm9av z7{}JBGj<1bbk>0_*|Qp73)1YT*$^ZxvkLlhbrOVv_mCHz{=eGF6&-iDG-Su?OZza` zIJ`EH)htp-L|If1UpNI5>kquKo2d==-R&ng*9Bi)@H-}5xTxDryVmNs%XiW~;%3FjTc!gvElrVCMNs3C#c;?_v*nX(>-ez9I`J=#>K7 zhzmgqfb-E5Lr%b%f!9C-v`eEHS(BtYn`ABlUkPtqT~xWUCsTi64XIWFMZ6gM0gR-A zmrC4Bil&kl8<$%(Pt$632VSo6`5>CLP?MEc)x>sWcxL3rB@HNQpup$B1!^ceoh%3_ zR*)M%wT)XomN__Yo&b*7tWr$Pl2YUthk~*Y;N}A&-Qx|yh{#b2jgdZGSbhxBx$4g6 zU=U|^5N8wMQPX4+^xo$QHuxI`+D=Ea%UQ>N}%q>Cl%d%!mAgjM|c>X&igeVPInMd?QZ^&%u%gDFa942d$MMG`JS1#z2)@ zv<@;zX2n1^8F`tJ`5FT?b`m5AQT~YUmsMWU)ymOk6BqBcXp@Y~uqLPGGh;JKGGBN$ zPOoNbnz(?~2aWoJZ{h&g)LscUY>`Z^o4uT1GPIP6zq-SK>w|0mR3JDN^cPU0X$>a72>$d1Pyv%B4f zDWdZ}wv)X4ZG;*-C%)35Z3d(7wD3dI>?Tch-C`8JFjJD!{_EH|adIS$)}u*Zx}Qn2 zh&@myS8{>kA|IoIZ?HekXyF_>GMJs8c)Q8k0K*e`9w7otpw{g zvC>`kKAw&9&Wt5Hx(41h2Etb657jnd)D(7qdDEG1W!bjUymc!ubKmBg!g=Gy1YPGe zTEAgvRgk_>wGbB%(u(Fc53-by-XD~bFcNm}Ldh9ridWN-Bo={-7+4HM!3m>1p0()= zW}7z(P+rZJtJ!jj!+tAJsWr8^k#W$$Bs^$_`RVE+FMg1ICvWxfgmlh zX1gEy%|%tc{=4Ek;`EmZdydTX*6PD;__ z7JxHqi`>OGA(^w?xr2frar&p!=m>{|2PBjDSV7DTGHOjY`8*9`Xf7#Z5J=@3L$)hq z&3_s_GZmEiWUzne97-AWJflfd(KmcFv>u@()@461xx*8w-I-k%Ip^U!U#movDb&f$ zH|1^Sba>;k@+~ai3M_bq8sA{SOSZqw*d)oN4UQF`;T9JV4XbbR)LSfV@_}bazw(%{ z@aXKu^8qJnIyxP}X75m*yT>SDn&|EQw40)(#ouR1HdWj|40C)s`B()m#+Y$AHKP&j z03(JYj^qezuJsejEF8>WfC2NyeI)2|oSMs6k2#=ND$H@<)eG;SW}Ux`>4b6HJ!`o$ ztiWbBYt^%5CxVxi=sO*ZU}np|rBeh=ZPS6d_8DS$!0rW1!lq{_^ex`UFXJM^))S)w zpNHDy5%Q}+wt`8J_Utc9f88*yC1<=CsMPuC$FFqg+r0dQqnn$%w*5oV7Nu%t&?N0Jyqj8KsatT zJJBGl0aVspUZ$(!6(u6x=SA0s%`~oI>e7t{tj1hd1ZJ}HR>W3C>ZqPE3od{n`sQ1M zY2?A2v-TxNT^UYp2N)uol@M4UI*M500}1O(Y(o`E;KP3Y%4BS7&#BysbM;___^QS2 zrh>f`?xf6~Z19*aWtJmDYPlEM&oJ!9s!~T`{b!r10sTf9J?aD9?(Sfd(iTnZMGvFu zq+7B_v0J;`%ZPJXlB-=(&-9k3;Cuiiwq?xqDT`Xv)VCm9MjgD5LER8urxwS93-+;r z=#gBIoiPyfO%pd~bK-~-rK?xhHYZ*<_|E=(Xu8GhBtpa#aV$H?;K%JdKbb+=NK z-Wg_`LE_lk8!OGR12_f3$dII!)Utw+l#eunVXqrlEsdA*!!8PJo* zZKWdq-84`~+k3^!`;Bk{ol_-T8W|DeC3m~C!K_b-Huw@i*%}9$s1VOMIQSocYbE%m zcb`bIoW505z=Un$)3fTEC6j;8!Q1^8J4frmQx0M1^nbLYXu3~>DVE5oO0D6b7~dhK z_(zE_WP2qKlA${I!JBlS;2H(6N5Q+4L7lwm95=1ZeZvk>$Z^-3B6MmLG=r{i=$Pd9 zG1pE`YigX;EDc<>UVo2_SJNX7`D4;lfg~H1%d5gg?A9%jMpap$Z^59cFUZ@m|D(Nv8KQ?nkh35(I|=F*zUwi7ITq~%~W=- zLuaXONiWwTck7TFGi)V@M9FhvEQui-`uwC*D9~aj>Rfbzf1M#9GSO-#3eR5b%@Q-! z>g-kY0wIZz<{p2(mp>EjxLk{M9En}WyeDK4_nY(Kg{_cH)9FmzRyhsBX9~3P`OCZ= zqoqeCPz&3+nj|w6R+@7U;yFu~rq$=tG%t)#|xGEa`f+wiuj1m>1F_^nqhh@ zU{)6&)Em^(-XcX}t1dSiNPpPS82L9I$aOUC&(QLC0yLChBRP!k1w(puc(lKDVxyf= zCu0|76A!N4gOgWB`+GYF_`KPO^L)tPXCs`|e69tL3n8L1Isd{)0#MTr6`}aQ#mZtX z7zl4$dl#L#jm-C%mBn>qZ}7AGI$YG(j=6TAXaRd?UN2?prP^>#_o59Pa$poITKW0s zMx#+dW#kPI3oc9V+AaP!WAgU7bb3D*+X8nxlGF2sfNW=z!L%knu|nRq7tby!s1_5R z;8h(VW(~~%6T3u|nA|mi$dMy6EZ-1AmE((AWRXa%ti6ZAB4}n8yd%K$PJ)-avu0cP%4fXO`NUmtOIR3RPE!>({bd-U5@hnnc zJ%>Y6Vy>=&`6cO!$1@R(4d_A0Di%tZ1iX0)SKX&hRPa)hz>LYr}#$=GHB)qwNwtoVTAveE)#8W6#-qbr*eG zo@@-5GCiwee;HhjqvAMhVrEg0$+v3sPO!Y4QV$xFuW8V(-QHDi2&G+e8>@ZtRr)q^ zeVe(j*Y4|&zq7|S$lzD+dg3~{W7(y%#r2@rxqbKgHjB>LO}|P9|DK;ZW=olHFhC6t z9S_stOp9E&M;4(XQocnz|L{R@@fNn5h2vC=t!nCS46gZ*mP0roo-$$uK&B)Ir)Hz! z-#d!dUmdcPc|MooL9*Feda&WafRC?#2~Ae{lhdGuGaTwpgnZw)1Rri#0^i;^(9+Tx z6yRDGv>l+6hFN5a$V#7nh89@B6w=~n(TDMHuYa*vcrjbT5V6@S-8I-t1zv}W#&_Qq zu~;_e;R!o}KVqeSxNA@;#!;$ql$=K#L-ieU5;(WNRxl)7rDmhUeXh|{#A$hoU*##r zPm-tjRi4tFOU+)jnx{PWn&M65&AC)i_dVtf-@cezBl9$yoeCWMDob5GZLSmB z5eLqyhQ%~}eA{-lXSl>I2Cm3efOgN)q~GK6Fs^pnnB-AaC@d!b@`Ac2nXTvb&l|;O z8}RE8bMyNBL2V0c^1a;`?X5Sv?AbT#U=rW96fC=cvDQk&Y!pcX6vN=`ql0MMR1bq12+pGeVEOo*Ug_Mxg6avLDQoU4<%cRM@IhD zF|hw%{`7VHcUqyZ9{&A?`0uMvpEMg7|NY78+=eYLszXZ-g+;-llg%koqD z&(#)2e}D3*(R|eWOVn(xKmKOD(aJ}E-QYcC@B@B=goL>Pu+nG$Wb>L+sSv>wG&bGs_ z@HYWE7!B*znL+L#0PH7rk)VX)P%Z5NHOqtt{+NuXCf6iEM>qs9I>ATX=?pnwQPA5` z##^k9H>|)oeHboAq@pKpgw7P9u$j>R z&kT9XPBcibDUu=PkwO>RF1dV3nih)a@B*{1FJ{qYXOhzN6O1iRE`=N?JRVM^<5^-> zhWg$CQ6A0@m{gf=$&iH*C~sB9V62H#HC;(om_av^!J>Oh-~6#(7CF8t0XP(jRqt(OCy`p29iQp>Re(p&ryC;H-#? z#5$7%p=HteXw+MgtTZNZ0GxssH>VPy3A=li+Fo)xI}b7m^hUvhT*8~*k=vHHy`(9S zn&F+nC&zRZ1Qj-ckHCW}UMK z0Q2QcYw#~XPyk6w7`x<}u~*4hF-&V?o2fxp9>;b*iE$ncU<-X3Cuq1&a|xT7cI1eC zsUqm?3~${|VY(@NJj_0@R2|+57s;n+in1(}zrZxL!?Kluc4=@R^du;?!l9)bAeBgs!{2K9f z>`bJJUvp(d!1^qvC6rQ>ge@LBQ7l|w*ZT}dE8U@vEMXxSws9nrL`Bn@suW3z3@=Y- z=bcQ}dt)s@rg=lWtY{iDO`unplhCX}m9eSbh@BiFIfi9YI~1c%ehgXem%Of>TJ&&O zi)=yPuCFQHDcmQq?(4j3yvP1@BsH^e_6ldPMC^q(<}%_kjbv7x1tb4h!P{{WVEL5D z=saKtDTIYsXHE`U$T&Cs*n&HW!ZncJKQI!&3i~1PreuSLkLR19c_YVokN|qfGAC8u z2&Vez?t-00C zyFtCrO5)Wxz!Eg#*#{`Qh^&Qt$%t_qk0+xsaw!SzKp=sAX3~T->QhP>Ey5X;TB8yC zoLr^EBR$d=T2zUfu9hGHC2O6gnW&aE7U-=DdqXX?+_6FnADzh>Luetn`$%>z_NEEm zruaJfJ0}50-1!(|nIO2AwY8Dobs+&fRlu2&&9($Iz~cr6)w34n^JX6RoPfba;Qc09 z<2(IqC3=-kV0z9+$XfRM2*hKvy%i9CEiB-eZRCv+#AyP2;E>WpVf(f{Ty-RZ&=ULi z)|=tdp_V~b&Nm!z+xmF=akm$_m9(yXW=Ye&tY@p*;29U%Q z)#{WRV#=wWsjLkRA;>J}qMa#g!eu;qO&2~TKwXjCE$UUOieoQZn{UTCXKSW*6w66b zJlu&6Ep32hjw=C7F>VjH-4Jou6I|AfBnYRZmP1e{9u|*g)G1Gew;6rJE@BStlxX+| zj1i$!-GcXrZJ=_=-$6(^JpBbHwKaupL>wC}ToA2AXz@9`!*h!+Rgsdt+}V2h{mxIc z1{ul-FiE6qA|N(Am3$0U(qKGF<+*4{R$<~(07oLrO*LX`Zu&_UC><*CRO|I037=s1 z1PX3U5fbBx&S)_jCSD8%gBj7XhgqQ|48b`Pi$@WaxCnO!7r}`CXf0h1_Y+qG5#D?UYPiuvzvh#ziq#O@?Wp zhM8+Y%M|2UyvY-{1RLOxcf2}7l)cM+Ln|Hv2r5GU1m;o)tupIqx=i?^Z8DRoI}&P< zrR*t28rg7#F!6GRrs%` zfb-i^8d?t63`ml_d(Re+OG7zF{1XhmOs_`MQObjF{dejT+H_p}SSOa*X~{4hI)}X& z`t^qME5hzRr{smG(LGpZbXHf5hgE3dk&*<)#9; zKoqM8%`P2bLN|dK9-X&?2N|t#0KscDX`tn>z{Ap z#)IZDi&g*p*`_Gf@CR)-c(t@?cL`P^!*b5`WzGv6OgD&BolLyfDVj~vIGv;e&z=Vy zve~*)-aE+HSLT-)%qwRUghJ`m=OQtu8a#IHd1_DOP6e1Eo+~fPo1H-|vP?R|bJ*Lh z|Ar}}+?%*i?@dJx-^?68wC*`Nmh%mi;>>om-_@bZ1zWKVpke(kzaf0Ezty>iFG}!{ zPWN(jl&|Aqhca>%#plxUl0Es|$zXUVTFmSw?5>jT-^xD}rRq|H9z{$|!UM6&%P|DeIZiat^ab}?S zej5-LC{&k05Q{4qQ}gyiO>(g@X;qrJ&4B%ThCfv77~)0KzSvQP{H3leYg9N)T#dVr zvd{1&wg}EH$6ET;Y*4*7EnjLWxL|<@VO7SDn$zrx7=VipoYVkN?}L5k!hvzS?6wsI zAF(UpirE9hW~vkFMem=xTL{_4IgyIRKa+LQ#8MLI#6~bIdEv%L*f314947FJAJ9l0 z;gR%;Zkg>ia2rUm(gyL3Y#42NA@DSI7@4^6ooqUP*Ff+4W?vgw8Ew4O5U~h6KAR+o z?ijzf%!^T1uy9O;eQ!uY#7V+D*E|g5Z7km}3U(cS8TES|vm}9FEw3-!Ydb=GEprSd z_$57O0*LoA_?!^g+7l7G+7awA?Xqr2v3vtO=FTT7O{Y&=MD`W3jU90|T7WZ3sH59m z%^OkE1k~Hd2I7TT3BRw;R9}BB>}_^2NrxZxX4RC0!EBf#c9PW7A+nlo%Tspm%MQjK zbLm9&37c*T5WsfRnOmN<`lMxXbK06pz>M$EZV82Po&Xfd3k7e>9`HbA{LVFbF6lP? ztyz3jg!}WoxpNW-=vHQ8;$d);V_ZcP*bWIoc#blLBBCy*Wrrxdbiok{=gH|@_&lW= zBCpeTGaf=6Z1eu6BG7KGa7)wNkYgtltcBw-luiO?C%l>LtRpQTB0ybZN+8Vl&E!C( ziIsg_wS-sqH~KbeMC&1|!i{-bu*QH2f_O}X1uN^6FCir#Ro5)W7&=5up`19&&G%M5 z=g1U_IU_#b*oOeunqstTv=Z^8e5XIK9F2dbIB|e>nQKXSJQR+nCNm9z9U3yKq#?Td zBA!ce*VMywm=kjq<7sxgITNNAn5x0r;CMzke%<9w#r>M*@iMccjv2on!6tK3z%__b z=BC$?A=Ul@1Z*QZ)#v2ek618g$qY2!dcQw2(_exKgthvEoSFpbK!+ zPEZ{l`IoStzk()9kXlr`S4E)%he8keG)6NDLU*$r6x&lZyTq86ZnyhDcJVQ43(vcw zDp~`%co>Gea5lA$vw_F#+^Knz|7nYn? zyaC{byM{;I#BKW)*DO@JeD*qE?EE5iIc!c#|?$UAiD7)%0)VIlS@?KN{FxtlYTG{TEY=X?}! ze(^@Yu37{}Fhd{CXG1fLYI*3B6rKZ~kK%b|MiZyiv8_@bAPvS!7aX9HoeF)T!LZ(`FOI~eb+x}vlRPAoVd4(j7&ihCn6093);mCRcvrR1{_f|gLoNjvq-~2+2dJM@Xmwcr2%u|H`OPt zuhP?LYpaijrz1-#YuVzcsWNk+ zk=l3%+r4*(87`dPV0KI9_Or5)cTu;^ z^@1N-f9IPFALrRS-eB?Q8DZf8&t_G4PE3o^CnqT!(;nUerJ zCZpN;h0na?0wdkVvhMfOnA_UL=~$$+N9VT@07{DedpT70U*?^Ya;#drXqUI*Y#&-!UgY{VeFFM1jhtO_w z%x~$Sb5QXqJPR`c*HF9&bh6LWhTdZK&2CZx&+naZc_lQ&*~UHmSo4qaIRk(Aan88u z#3~zi{`@K*d~lZiQwE<|S9Bb|qaZhqTHW=}hNozY*_IzCb4}ITqNT0i`8qAAoC%WltRB~mqh|&D&y;4M2)~OguYm*IY6{u+(kZj zjlTXuCSOhf{3Uu`#8FbnqJtBcH$$#neTh%p9y?idI!pUO&K%BChOi4!P9xS~`Zr|A$ilG3nI=EFhZCwu<| zprF}H)6AN;x@bmIO_zU(AF0VJ>E-~t`3s(EnzEVSO68Sm*5_nGroy6hAT-2or$!I( zVY;{yZABl<8{@`d)c4kP$05)ZFBu4B*uE5T2%arB-wW-vKp ziEmnDf0j)S2x zoy^7M(AoHW^2by}Za2cf7B6>RynP+tyT?2nA<7pygxNfRMGW9)W#gV^9E3!4{OH(c zNxL^G8!*kr=k;IZ|6dUQ;o@tzF+cu8qt#k{Oz|HYPgk3(k6RS~q0#&^{=*;f$;W@V zp!g5XhKv8uh?=YG@L%J}SBw7un{_hI9v@xUpX_Ld;I75|3`en^BR*rnScB95QEN47K3!k^%X)LIfC1oW zbtK;~5!mkx(=jGAA(i;8qCx3EIz1pm`9M19X%I}J-HXAVA; zBZ^qvqj)KO8(`IB9~yc_N0OXCYLJ`0r3>t4P==maY%b)XiFjzQft(R*m~tbHUBd0o(F~>6S zOJ99xhi9u}S#^V1kOGmIzv4L#Xn{|i=7Y`3!QQY)Ru;sP2*%XPOw%<5MRHD2n$mw4 zAI*MozDB4{c^WYw#c4L`C)30WO`6*y&G|!|iuF?oVNY`OoU%wLlw-p+FH8Ye1YVj; z@#P?fz2k;ZIPpsB+<51bGSj~&ZmnC>FbbbSnr<>{ZCL`X%#hHQ(x#3oXtgMac5#}z zRsXs;-SAo{SigdUL*gRl?Q`fF1^_*el9=Y%PT2>vKwC8Kzh}_-Zjxolkl4!BeIg-e z39ifD65fJ>yjfjl%CMz*ySYamt=_X ze7kXIA!nWAfXy39nMv(RFTw!<0alp z#99}1smZrNLD!@}F^F02Pjp;+jE^DlnUsTL+t865I6ko($PKVRKZWXVGbR4~QW8aFAn^ z6dE}6-&-8cxi!0{OZ$Sg>GPkN=O5CCre->{1?)hSBfB%tKul0b3=z=(bEI7~JMa4M zF{)*?zdVZ{wcc|y>36gD9LHyY+PySi2J1@Zb?F59&!5qS;=@) z2gFO@QZB2}j9573t8kljc!pi`tPxee93VC0g>(KnocUIM=2vqwU#@|9lU|OdrJKLr zEXP3mPLIPrq*24{!D;vgy9rZ(4DB=e2K#_II!rhyA#D_LVeT&zftmrWQApF@AVUOz zz`*&e-LMWFChGV)wz;yBO0(41FDolEwTQI1m}40i4&2!4^g&MbeADhD8Wlr-QDpCi$05*m~(EMHuaGrpqloJ021J1>T}od2_ZA%{G6j zdnM(-#Yy?aO$o9H<`lh5fE-Z90vQ7Kk|h|8*H~gQnoUvvP6x3`hhQt@`LHrk@+Lhx zfMJgOaYH32>SP%R&MqNC5E}1s!#TMat`2%Onke2*e9+h+tmCONbO!s|DvvW!=s4xb zpz{$Xa>f}L+2{;YS_FC=wJ1$vYVV2VkA7!P?BXn6AjY(jIAki(7t4|$--%S|@^qmB zzEU%)c>j6oUZf@;7wYb6q^q>~wXX3A{*fo5=%S&JXqWeGp{&(>8lmGnNjrL!w&9x_D|J8c3_7t8s zTTdQ0{=EPFBR<~!??96O{Kd2VYOSv|)*Frd)$d7%va(%_df6A;^A;pb8QeWv%B{1U zmr41*O`n_gfLPp&qejHV+hfT8#+Or4DR&`BFLSVi=xAm_Ro2xi5Z;z)QPbmANy zz1%s9PWH|5W%J%q3cO)*CBMwe^De&`jCu)wOaAWOc6vR2$Vm;c+^o-Edg-OD=_-sz zSNwD~9Pk%T!H8d`=7B42j~o0B$9DzU46B(`*W?u2=48Kp;3@N7SNG6WcR+JM+IpCm zV-t!bm?Ik%iprd&*VUl9Ri$4__yxdANu5OKV)VGqklwP^oK0$$nfsbSr#l$|W^}UY zbWmC6c(dfnMzLg0GsnXFC~?Pu2$OdZl-cc|1PMH-DkJn@`p)$Fy_r0jw<;9-*24qL>Fwi`gdpk&sqHsJd=O?Rci2$J&gXkb#y=u?QoEM8qJWI!T8Lm zHefXsrTsyVA@nQf%q_Kh80ID!M-{`>RInFF+prT@k_q>Id-vew&W|}!Ut(PyQ^6}dj2IAX2`Sx=62iJ;x zdvo|#`S$i;U%u__9GGt>_K|$qK0MgoGEcX+_6+QUg@s3jG5y79jphLrE_k4A=wxf> z%z#wSYss_*d_lFEOk)#*2o3`JvmX5n?a(W8Vn2-NoUUR}EmzDPuTT~^hgwuUSLX%> z?6fUQ!+mae!F1$xwI4%GtR0J61)hIp46fqTH|D!x+?`39>(_7>Ho|H&@Az@tN0CcG zp-iw*U|H|cf7qyhy!_t+`F|DV|FtzJ_N4Kc=znwVPx}8yd^G*XL zeG@gGtheA0D9Qc{^Ed3(JAGD1Pm{?QxJ69)cvp=8rThxhs`k=R?h#pV-;{k7udaWm zfw)n8s!enbM^mT2XX8KKD-f|kSU*P^5wZQ}o1??msQufx7g#U!v*{>jSAf4>Vg}e~ zsWV}zp^ByB&P0Nn3`tJxOwRpu^%tWNDY;pR*}w!K2c3^2Hv+*?P-LJ&?*tPvm zSMv3u1T9(wT9|5Di;j0+w_mb1V1~~z|La9(j1~nT%c3@y$9EHbgYFE{ zA&wrVjZVy}h$aztCC-mh7NI6B&@At79eV8dtW5auHJY!wDt%HUpfvXPS&9=Zt`{n4 z7rgiDq%zM5CFr2#$9csBvgmikxyQH(83DW%&H#gon3$4WzEUM}Az9Z=Adik9Xj~C3n3>b6SqeAa0t+CeMBqUb*o$_$ z$!VwivCK9dV`ZjEzh~}MUhf^g*xEa0UOlQ%+U$x|Hpv8W9zcJJ%FUB(?w_!|I@#@+ z9_CsxioEiMT5}o-P0;xQyaS|=7s4Q~rGtT$zPT;TKBi+)g=u>(H?bCgZ`0-Oa5?pO zP@&Xvv^Szk#on{${H@zh%rWK=+GuFeK2Q+U8naWN>dATF`Jw{SmjP8#fHnOSXRK{t%saCZ~u?qMzou zWtAd|hKO&OyZDwt-6v~nTBfeuecRiIdwVrq_P@urNJRa4V0EP?9qMTgTA7%XY7oSnre71oINkbltaLAfU@={9KuiMw|oQ zgJDi>b@wq`mb~5A6_pmqY$SIw(0JvZgUAGB7qKLiky!@f->rDi1An$+_&M`iwEn~R zNW<{F;MK~}p0hN(gZGbeca`A?kFgW)k2*c9&!fU}zx^iUtjf%@=Ly6IG`^7oxu843 zzRl@ScDMeWlHENuitSGN$*`KmU#-7}cf8dM3Wa9Ao8$;#K`Wk*om*+k8s&QAk;kS8 zDt-rbAE4DXFc^bzA%8?(RT!>I-&qNBw{h<_Y=eaW)VYG9+Wwo93Q%eDy~QIOm-A5^ zAg!l_!H*>p4JI4#)TDDpQK0o*})$5=aEGiP2frh#1e{$MZ@YvrCTUNdY`vEoJA< zm(Lc3-cQHAFJ-{X-7aG+UI$8KsbEqOlWFa4fp9ob-l*?b&irxr;LY0;x;NulIE6{z z5`4<@9B+i!I-v_VhwV5Z*OS`k1k{ybb{>o%H)WZ27CwLMI(@QJ;sHC3QSW6?uj6X^_FaJzw8X>c2x z(gb@((reVjO{J+1n~RY)q9X!x<}j}!1AUNzpmn-z*;u|8NGXut2QIVd!iSX{Os94; zVjvbfyYsz4kx1w9q=?t`jr$r-dN8OaUP*cZO)7YQ1p|9&F{We#VZ4#mtRD4ECUD;I z64JFMM>uE;rpS}ZCduX%wNLLm@}tfg&x&306HGZ`V5irkUS-Y=CY*(am{pq8oiuhY zn}L}fZz=mJ>NWUi`gv$gJbOJ!xPjnp9Jx>euzoR6LIqtUQ%mZu=MFMyR_3DL9I5{|F2s6BEb9lSWG;$)rRFgBEiKVElj zaD#xmv93nm)aN+%oW^`MysOS9hi0g=7?vTI8zZ`Dr^8v|_zf{~RA{)#X!vFLg=^?0 z-m_#N4dkZX5X(_(!&^gB!mOWHVR_l4&JH@xr38UvA7W3PA5;z*zbd9yCch(;MJnMj z7|L6@#s3^4V##=s=xN$pIAmAIj5@4VI&fRCZ0w>FVcCnz7Uf!K8Uj8VV?|O#QIfzL z{nP9=2%>+?MRqwoVIXB@-g*+L44sF`@UmJ#W@7hX_rzUUaDiY8n+)!JW*mMWM0CbF z2GRdx(UVhH5l2pUP)H(N*u%vZa%hFc5UX_0c*K(#oYTjYSjFsGQYuupwJjzHL!#yW7U5YGY4gC@Ewb&T1N>QV{5B^5LaV{2Kav%e>>&-|liIYy*P&(c<2u93E zhJf~&jg5s5+~bZ<2)ZhUdB#~w%Rnw8?Wg-&zJz)7l<<+9t}tc$R@_Zf}Nw@ZC)vcdp3 z+IE_?5tQ;YE||QqNzW72krbxVtgmAWfy|f)psIr?Z%I%&jwY9iB@0fv#~&2Q7#=mS ziW@^jME!~TqiSRe&c2>;38U`XQ%M?`X|Qsl>|!8)q8QN-)`^8phQz%MlEG;5DaZq} z^W*MG`_WyZT%lx|Ia6lHMal%GyeY{ z@(JueFUbD0)qIlo0Bx=o+ke)hEg((Tz;9+Ln!CwYU^DhQ!}A%?Jt?^|LiNL&x7+oj zbX1F8OgjI-#4Z=p>3IFoqpPc{l|C0L&mo|~5gLPkJOqp>sf{D4y$k4@>gpMX1CiN0F_AtQQ~p3jn$a>+i7{<;!vC;cR2 zUkW%BCm%@=9#0Zf-=`QQvWvEW)ep~-tot0=UnHYTX?6jdJ>GqNuyq22eWCJmV|5kE zR0x{LvVnw7Tu~%g0;D_C#!vkHS>6g&g!BV0Xd&omBw=kV(f>gz96JfPF zJmo$|?6Yfl3d~nzq$%CzPrEyNFBg2o*f}~ndV8?Y3Lo+v?ZRsKe1B(u;c@s7{##gs zo){Mw;bvrL zf&rwmP_lp2b*xP_-X=!dp23?(O?D4JMBV;=q1CWcdY%lE2~28oJ)LwSL*&iz5$3B+B&_Rgi5$*czR=ZN?r&RFxj_r)s5vJb9SY5|hLNilXaS z%EQGv(=iOCo7={IQ7Utm+cbDy+Pf7MCrY;~s=T`O=g~ID z1NA%UK0Ggyp7qv)%+(j8_b;w*t(3nUgwaQSDFmbW^tf z=dGt@G0{IkQMGNPXiQi2VHKPvnDO*BrqSQS`98)L|F zK(~QYjO0u12tK<7l(WI~OC7N74aNtwrf}6H%v_fxzme9HC{@r+ROYj_HQofvg8y7Di^xK9NDr_H)0aBHePkA!D zyakEOd@QhhAD}}S7Gz(91=&}^g6s>hAiEP5sAb5$U>W@Cw_Jt~sLK)M9V_nCqToAD z@HAtw7xjo`tAn-6F!nsND2v9OSqbsD3kd#|OeWah5^1IwU_eIUOQC420O33of?<6Y zsmYRwfzrFfS(CE|5`#dm7t}E7+6w!?DzS*PbgmD$_1!9WM>ZI*R&IGiCD5NrcS_mP ziLi;mc1xG8u#UM{%pDVQO0XwmU3oHkZm;4p&T)sd!j}vtLOq!^Y6ul&*3WSvP?F(` zw+APol1v`I2(@I`?9Q7|O9oGOPTp+2J>Ch`Wb_8B?7!Vxcv`UD=Xv!AzPq~UNW$4* zi3cEzCjEYAm;k5jFLMz}lU4E@t&J*5*^uW@k|J6_R`kXA5DH$bo-(Hg>0!@Gn2rM7 zl~6mbRXu*qIdlx#Gh*p6qjJ_mNpz6#(+eykHV;l)(e<|JgB-a4kE z)|z5D|HZ3Q$_JjFWbN)(QBjSDH8cM?KkVvRY`jObaW(WI4&a4V&*FuUzZHP_zF5zc zRJzZiCzVgbhCJ_l$?s{?^kK(ro<19pJE(7_Wo~6oRut6q80DKFcpCW-5(j#qOy#8j z4tDp#YA!p=+@|G{AUAMg)NdR)sqJ$e9u1S5dwh71n=>!UdSS!QHggye_yA?`!q4|C zJ}H02N(H@XjUQqbKay{Fz{dG~qLDa@&CZ(RP6{CX@to%&%y&p72p$OK(~&X+&jquJ zX)MUx=$<;x2jk8(JxyUwJ_*sGL(wPux)ru-LhyU`exMrk1bWV70BvO5ezmbHa+k9C z`sZD8o;TI~cmfolCtTWX$1GkW&S>tCEJNH_alIShZ1D@OhG%i*JZK^{TSGCqq7FTZ)s>^Jca#4t#F zql=ahlU^jN5WRAj+!UBuQfZ!YVhakALa~&hY@Bq{GrUv0G_FP7eK6k!e>WQCuS;CF zFwU2RC)Ak+IKpl&9*$(Uf(H9}AO#>WI@3IL6Z4B@fOJU#h}Yn`pf5J)qJxqbUqfKo z*8~PV6GM%n`9iu!;_$6{bvHn{S(h+nMJtY|AQELN8%yHkAXN-B)Kpl;mIqk8+*l5w z-nJ}_`pZvVhyzmUH(ExB7Wges*8Cr z4#Y8l*qe2*^fp!Lq(l6R+1v^$W~14po7k#LChcx_HkrU+(5r=C_SMVbY@BUSx<<;z732JTUvm+mtA0*rfkxs2m-q=k9YsJ^PU3i*>V_~Xo9pViN>9Y zN*tWFyQv~(eiFdX8^0&>OZYLw@vDCBEk(Drf?J8AEzB~6MKkmPP9~R0Z{;4sc!Mzn zGY&?VMVKiENcH)oGn^*9T7)kBxN&>dI^v>iL+~7QGA2Z zjPgGM7f0(=6MGcyhbhoc2dT6|`I30-m{l#KxOL-CHH_kyp5fnw1~;Ca_S5VFLm&5$ zQA48`ITdxEPm zc8e^pvI`79c8c>ZMmjy5>y8@N1bYFe=n%bMBD8R)V?7uzW6{ZXJJIpstCPQO9qmNB z$I+Xk!yk5E?!1gDTgULbQj7k&d-C1k+Y<~%eYACO@>6v9D%v{uDf%9mU7YcqAKx79 z93MxAN73&7o4wtgm$hj3V0-WF%iV+5(F>?~aCj2!?e6cM0N9g5YEpph?m)d)0AzpX zX!|>Ou=QehZ};Sl%^8@^hj=#gunAn`L9|d667B%|raPQ>~JbbYOy+c8k8$0+3H|XBh z?tU$LxwXIbdWY&A0-Pf%C_Vh^cRTb5THJ#FNQlO{**-itIf9=!Hz$WjC${omcaL{! z(bm!KF;2{@qeEx_Cl=})5*Vm?u)}b0(y`|N!>$e#!m)s`?E3R^XA5}6*T-00FC|RH zSN)KsaTrDU|K3mExBq8*=dawxeEa{kRqHekqf}n^~aCb;atwS0Bl2*^n5mPry&_M!ufsgwh^GkY`;s8wCTQmqD=Ma zP|V8B_jy3SpW)%&cP8Bn8c*dv{-c728+5EEM~sXc%~7ete4?#yQ^B zNmaoE<_H0VVDT^&2kDj2V7A>x)8OqB>SVj^%j@{enapCf``XYJU&rWFXo3B8_h7Z< z!+=K?M1iGl8z}$VAN?x$7>>u?A9GJ%?j63_k*o+w(nHOd7zNAt)}wmA*AH!qu_|gh zNl9Vrl6GI$7O&ZPz1`p1K0LlvcVF(cU;ecBlKR>kB^-*ElI?mO)(vW$u|N%jlo9G0 zDFH*yOg}|vzJd|Ov*^c1hv@!${0SZm?)?Yw5NOYI*6Bh;=hjpG5mxL*Bm>rqz#x10 zBcU$qB>PDYeY~#br)B^9F|-qBHWv(@++bGa_{Bt(L&|^&p*RS^z+ZYkJYw$=RfvVH2V48 z!a`-`=byhtueFUzWT93Hp8WhX9uM*yYkHUbrcJ-*c2G0uqt_b%$$jbd`+j|SVjrNX z0xUK@#$*T-sljuqIy^jCs63iwlSibRc~r?yn<*DnKm?m4$TvPh9Yy(lpf?JG($(dJZ*s@$2)H<0kGJcCF2h8Oc;>njKx%t z3+wC!c$93gV1?hGPXat1vvxIP$&A1X(5ADt*0@RsJN4PIh&;5zXQRU~# zN?f+Ry%UPYw@{(YlEWtR_EF*7;B>3WK?O~xJLMeAQ!@;tjmZFL!jxzdP&y8xyoI^*;|?w@w`L})ggz~=A*6;BE5(L+moWoAFhw9X#GlBE7577UzgPJXU z21~dBM49QuC?l$BryDV1XXSjQhEOnz3z1MLrHXLxF%S?ywvQ1^%1r+whkulEX(f){ zfUE%X@`(Q@K$2)_)@l1~l7$&NIJIsaHI_Grm-U zF=XvLfuoJQu_(I=tgX4-6kF&=eDNy3{Q2+DE*(!NfZ%6smolM;UJFy0&!M-4c>@kc z*%YD3LpUQHfb;YcS+(eVH0r@rjZkPZktxZz56uETmMT zB**~v;VXMNY%tg6zRuM_m0GVe=~)I;)h*;!?7~ZD8NZwrh;i$u>rlr_8b<=!60k0pXKV&yFYq6G7Xx2X}BLFbbN#XCdmD4j@Wm|Fyc z)A-`;?%vDx)^QsfgSu$1418}PTdT{)d1(L>9CI*l^$?~#kf2}<+U;J_?c?-R;pk4T zQI{DPP~3dkbYRMgL_&4KN(&1hQ6!V0Rc?_7CQjh!Y)S!9JEV9u6PZ!0xe;C?p>d%% zALW_m(~ANuk9PWJkIuVY1X7hCIa##2(xRgq&!tJMK)`8V zxk!7xWJu}=lNne%yhIBeV9S3&PP`bJ zXE2_U2#ToXX$4*%yxnfMNxHAvpG(a~BU+B+=l<@&;SrX3z8S4HT2%ID7cNZz?d-h@ z)C$tCcDpl`TaI?STD?p&v3jYRS;8EIg4+4sTR;V@u(VKG*Ssi@yZ>ts`i{|)P63}V zSCW^=C5!$(8*#!bICcg$A!8xq#}uj)AvsS-qQN9vaQ*^8%$=P7wO7547b=UD=sJRb z{ddO;3sR=?AgjdwiAdLua_-Q< zq_RWZa(viiZe-lSg(r=#Y0^U~K9#+$t5um_Q;iqwGT368=DU3-E5bI8E|?aSoC0q} z!4-(yGM_6)Foy>x0=Ec-7x6B#GsPuI;h-~Bu98I{X_MIy?>eysVtXVPSpQS8)Dc~D zE-`%!@E*vPt0NIn0#yT~vU!BxAiR%1H#6?01P;d~IG zR*3Ul7zQ*`n2ERHe&tqJTLP7`dgUfi#RnE`MYj(Gad+ z{D$(DNZMI(LQB!Jx%r_cguM(Dp2Yr3oC@B&%vNv}EpF$f9~lq~mJ}3vuqMBR8LXkw zfUoCMzNhF6g&pSZlWKX}V?7Q^@Y*;|~)P z;opuyOup4mhU6I&b-1$_5rE|J9CcfsNIRV!rRu@nL86WN)<$&h|VXPqvx zFDdJRipi(Bgox)SN;U8w*&!6amZn4MsPc@Q*2eKdm2-BX#c}mC-n6gBoE3mAkUc8t z5+I->2

Zq)21Hk1r@lCWr7I)|r_!Sw^r@gn1m=(#vXK5lucOD%}Go{xGwtkXElf z4oMFPpTn4nNPRd9&>vNg;^dEQko;N@BA=6l6Xpxv^N7ySw6l6z^LA2=j}AAP9MC(N z+SCwpCU@aiNvXECAz$F>M)Y~k@N+dzsk{{utq}P6_cK9}f0w!2e!WdjPj(afmm?^Q z8+AwE=7pIOK6OFpLPA0Gc$@$OI-Ek8Is7HUf4z;Ufu4$(O&qQHfMSEN58tX6={Yh< zY}!X!nFI)F9}UJP+#zJX((VPnkZR8LY$c8g&Pdif06k!HQguXz^wiGCLJNc=TzL5V zAgW$Vc&LcR5dE%TRB^%V?!VnDoLdk)6AGPIkOy#*V6+@0VI=cPt19l* z9j04z31o>kgSkXnC}M*&PijaviBa`Cy$(Fr-BD+fd6NwsNdwieXaopi6DuK!GyO#T zE=*0*fu({)9%Fw|0HJWPGtzdIteL1pxzo2@Gjz_w6@vu>^a9+ZU&iDtF7(%{k0$WkNdZ^1D34)KV3Q8tp!DVjG*iZjkHa~g~Tb#g;F`4IE6 z5o2JeOYRsjivnlyo(fY(c9}{l#qhx?V1WxH1|S#5o$g0OXagZG8LW(|V7xzU9c>-G zzH#9$L2jR%8;gqDk9cA@){KobhW$^`;>ya(A{kfOFi8R)uT2ICY3-}1J4J3r_8oR& z5z0VC@*L0cb>4Ui2D*Rv^2SjP@P1}6a^6N?JkUh~bv8hIaK6sML103s#RrQRs+@1o z)F2m4vXSDL(4Dz}%Dmb=xOp8Hd8jMrX!Ep~ zyLY-_lTJ9-LI8yE)jovP>RyyC6?L6G)xp)5w1LU{DSfqQ~SB3_sv>jMP%YG|*{M3N*r6rEynhtt`V z%AO|C-)9&bRJ@-Fc}XpJj_AA1VQ2aN%o-Yz3L94t6&2BzsXIxO_9-=1@G?&;7p1}y zjA8q`o$c?nuw*KE0*{+O;EzWhe=PY!Mlo~9fs8Px;^zY8&u;t0?#c1)!HLJ9IR_J% zLB5)%t3JKT#M!_QaZTky*T1>9nuZ*_(V0b7dkJ}~>)Dh=f0VAsP7p-g$ypz7+AwW2 zZo5gEN&HRd8Vm~sntH1dJ&RUbPoFe=j!A~T(0n2~JgEROV5|A~>EpkwK6%{OyGMB( zrmS#5XE)&20U8e_WWo%{)s|Trrj!-B;+sKDwFk}Ab2iJ8ImZj$B7241_FJgCN}4w) z3Cv!4J|v$5j)+A-!~VK^C|&n%HQ(;i9#~T`=G>N-y z12^o?T%ZCGVS7OHh-xhou99@pGj<7D9#M9)=E@D>(7m^G0D%Oz=O-7Q#jUX*Tg2sG z6oLkOqkq-;1Y+B0@-cHX=?Y~(;LMSvlN}o0zVi}1d0dB?M+kV--`a*Db*gS}gX5J} z%g0v6pas2*egS@;drVpad?OnsfQr$eIdD@@4W2t&0Nx+4xtdRKoKZR~*iT^(aVCno zn162jh^Ce$oty&}U-Q#~od?j+v-p^OqC%R93=u{#r?aYDqX`JeWD?}UNz$E7G8A|9 z2}jUjOVD99fjPp9(v65nC^FsS*<_4{3w!`^1}GLi69aKH6!{!sB-a<688d6VYw|** z85zovjYfXd6vw!D*n2iGGMvg&b91f2BI6!K`4;x+TtzRP5EN-GHUMdZ*uA%{g{p9} zZaY&x5T-0cx-^*$30Bh6trt&~3G4j$FJINWU(HSx`#V6FZ=;BaOHD(vz}T5gZTYSp zA;415fY9P+lCwEcHc({#OWG!cAnK36j+)_8DFfH&(X+%LNQd!mIvSz7ARO4Tgh0xU zkrJ~Um?i8W+d%>#Tr_Je@Vb|o1!};AJx8{9GC^{xc~P-0AWd4p4c0i1EJ-qW|7fs9 z-�C4mKkrvTlLkxy53ieP=H-R$h)joCYmJssX^6>48y`6$L3p@s2u-Mx6 zr&*F*lRH+lILl_RJ<7{z*Y4jKdRFQqvE#RR%!m>djhXJ_peXX&S&SwNN`p3J7JD1akw&04mZl zH6!k-csgkbaMhf#4j+|Hn4Xe_h025eS*7STj2+*uG#{T=v^GEuvzlS}tBlg$omHz@ zTnhkjJgXcva$^ReHX?Q%w!wKirI^X*!x|f~vzPwQjoj6s9XNDg3>}zGrlTIWkGHjU z{ZWh}{RNa>GEt(eeJOgB_2qq>lNPFEbks z00`!4fj{}z$=?|QHM_Z4*i3(_$~-GBlISAEVA5>Z8Dd|m_f_lg0C1uc$8jih1q4*g zXHgl+Y&-5J9Za0u$fn_5H~NIzRL5VtMb`Ds*5c!kY)It#7NmO(t>eSvTfu2mR+B{!^NoD-f!>z=s%Ql z03*IP8=^E!__mF6^Q)Pde!I89w<-O0eZ)n27gI-mjV?!cJ>5rP(T6(Q zh-NDQ5fl1C>E-Cj)3vqLZ@zi_xY<}+d;0kCN@D|~{3aKkFQ)f(yQDnvze;JG)Wyuu&P}nbK&$pMCMH+{C$i+YE0Uv6eXxgS? zTWYGy*-3Jab|6N->cFo=FFqNaaEYBc6Z#LW%xh(J5%GTgW+P+N>%r2-FSh{ znri4}0qcjaYj8vZ;Rh_}M4v(SpLQ>*m<$5V#(t&r!cfyCf~K_2-jk@_3hLM0+ zxB;egip(U=1zAAL57ftE00jX8d>^@g zg`|(p7McPs$3%sRm&EeOoc)q9cuS{TY48!x!*SlXYm~wKmOGvlhAH8=8}t1%a?7xw zuDsktS5IpRUX24819`MN{)FbQl}GTB9BY51PbJ>K0trwt83)KR8^&-rLCe^BGmbbT zdEyGgt4(@E2V~wS((m7%bg8tL&`pABp2aqydy$2#Lh>=1e&FTB)sR#h$(0E|frv6p zy5c{m<5P@C*q-23r?GvfFcvUNNoP=UnrhMab8(}nik`_L}!gm!){Yg7JoYtaC$ zxG}Z_+4c}SVnSA`y{MUkR1dw1@e2stRUB--KBNPAOOHQ z$aiCt?xX$A$Aq?Lbu4T@agROHD^SoV+1|iqe8dBq*}<55V|a2xl?2U@Bepj1J%T{! z{;Lr~lo|EFv`xM0QFG$RKI2dV)Ny+C((H2{`U+)K=Q%bq3j19SKiN5!H8$sP%~>Ym zO(xwM65~I1e*XIC;@}``J!a>9k2vf7t!+HufAnAewD+=ZUa+dE{HeZ|IpGPRhpp>BhFWAX;RQ0tp8$#lm=hAjB*92fN$lrfk1 z>R-YQ*r3WLF`(XuqF9MpqacJ`EEE{|0H=ldVq0`A#ky?kV%eLMyp3?(%UjUoL{T>x zm>0)0OvI_6WB^M%Pr=-Dy5?#p;%pJ6-tb0gl$(7(5E~p~MB9FPA#PF}|FD@x4RQeVrZIX<=W_)8|@-(^)R34I~ z-ngOcC&?z^6%FE@ygJ(7+p$+X;x92>6?9JnG4H3tuS6bq%*q)@jm((jaGr3Lg3g`s}DFzvieYIhSjpDk#n3|3TVx zJ3Huc*{>A5Yo9DE*mes8Xm~K@fwViA zDILwRwym}Hx2P89;L?UCz%c7CIPa~dfH>`hkJkvivcl-4H_`m3g^R>hO-Vpy6 zzCV3}@qgDIx1P41K5k(A-__RIpYebHh>sutmzJNx|E@kk7sRzk&DNvVQw;yxY^^sM z`S8DDgQ%lHrEJ81m(ah|vX1;~9yr}Yh3c_CeDrlRB%4`P2zCQYeAJneuWE zz3E9D!}`8c#@_A=a<{M89EcT6mSJOGNqP(l!gkup!X$>6EyL3_Y`w4$$;YZ3T2b=O z5ZtcoUpguWm5y$Jb9ijwjIwe#qoRC^8qV>_kp;wTK{>F(WXB=E{jHPlEJU;wD2In{ zZ-DmFO+NXVlmnyJH$W4AKZYkxg5?mUKyhBAM7X>)<)0I|0v^#p_@)*;1W++I7m=enzZ}-E$#{bvO9Mmv^%?#r zc}=}QUH-;Byi1pCSU=d1B4N_5*`0VpL)R#?EnR1w&8di`ZkCw#qJDD5S8o$C@?&y@02?802 zZ31%RQm*Tocr#{FsiQELcy$P0pKV6Gp77K3^S;+n9upP9VaX1eGt)SIH3KXzMpUeK zvX3|2gZ#JuciyhD+bw{5uz;llHdT~DRmc63pOC{L|E+U z2xj3-!V+N+VJ|UTQSoKy!ni3ln%UGDdzV#cL4}r7XkktguL4gsIeMGEuEw(I&=+fY zGg{rar1Olu2PvzX?%^~-n6WbgJpeOzO0Y&T9FsSc{;%5xTrq|7OgX7^No}JHm6E^ZT>>#Sp#7kG*HN@2G0FtY>`pyq+z&o81DD?Qpsqr?TpP9uwPPfL1gw*8?) z=h|pAou79h4TEV@eJ`JD^|@iLo8GP__%a~{gJ4YIgN#_cag7gmoJD_X0gsnLC zJ1D)e)J%=!UV#oH+*PAVFPVJReRZoPp1+^wF16iDO^5OIX2E2Bt5<0LW;0vrrdfCX z#dD^<-puVkBR>$h{2sjDZ^KsZ^wEe!3qfkJ`l#OOqV2rQ%rR@AmikVTHIL9G%}u-{ zt7q*1s)hO@g;E5Vs85G?2F+%dEB#~`W^13giW9#gzM1$HiBZ|uFvkgY91U|(5Qg55 zK*B&SR3Ak6_CBdz4C2C*4R;tai^A$Qj`~Au6V1l#&i3Kw#-cmOP1lkkH;HkB`$9|U z5JY1HCel<9j-Aud^uogTI1_>bb2H(!C&xrIe89}r9`hhQw-tbi`8H}q>#Rld&UIA; zVfJr=X%L$Vdf^FRqE8bJSTQj{#0{j_L4vy82qjK8f%pKuS=_+XEF&A93zeFkv#F#F zz)4cTp#1W()r6t^i0h6hRF|(4_i$n!Ds`BrMFqN=Q9tI=o__dX;`n3OU5+dO(*tXb z$i&|#zOI!R52ALK^{}|;vt6vL?dPf+4_i^Y_T!q-z)s>k7|~FNU}PItfyjtPmH?@r z01TM>h6k|9QmCfbW&p$p?w!QOY+1J^^K;`2gtP`0hIiTjRV$PHAuF?a*QMF9OGCSn zsSh%Cu>BT;qeG_cCg2l-@2|V#z8Us3gnj=m*kCs);lbris4&ej2-8;a;V=3obKlGe zF>R8NCO=xdW*LYN-HXT-vC?fP6YGhC-Mw}1#=?6^w`BiKihewg-)ryumz57sCrRfc&xw_Jfx-0TTsJDTfZ6ef zbm0x@;%-B_C?3*9;gG(d=VHNbSMR**_16Au#pXVdMSz?H(6Ah8_ANelsqNX6M#mWrf8W8!k?zPgM#-h z8IpB3G`Xt8LAS>a(J7|K%rf9JObpAGWRT&%bzMw@)q1@x9Qd>|xrzWs9rKJ4@ z3%-4Lu)TF+H725x;Q4V{6IIz<=&4gg4g`K(e~w(;b9UV%PV)@;p3O#0yeBS*D_0zu z9r*NWWP;3aY^n{?B6rX?9wR-#OpUTE6~|kyFFfuP`Sya2SS>bj?;K#tJfq+o8?GM` z-d-Ygik-J@h?sd?SKvX1z>;vOhYzE0A%^5kH+1?()y=S%!?2&iYh(D!{jDF{=yZ1y z)nRyXfv!mAN_uKyvsIK5Zpv(FsD+b2TOQ{zI#6apH&EsHxXiI_spGW2j zOtgZt;WX`Ybg!n-^7fN6QVWOIxLXrcAr@cZc5>|JY2g_a6za0N4@e{-t2{@k^Rz~P zx_R{jyjijq2h~$XBWLYWg_fg-1j41afsG=)sdn=fx>BL5^5Mwl(MBGp&dTEynU${l zZEp7sn`8z=Lq;kMq;Biw%XMY;f>YL40hNZQ2oe+G@W~g{K7RY6tTx74x}o;|+r6^d z7>4PF+Anv1D65STnr>?QuyouQyy=G8Zw~)jRvUvi-BA1O!G2k74Dd8O&DFFlh2o1F zej#H_Vo#vptV0AuoWj;dV>#Q1d}1P%3rj$`oVj9WYd&(Flz3i9y>qg4^tz2tC}spD zYUMDAtbwp+ABQg`cQ=(0#ln1nFsTpF&2be@&=>ooUQ&ey+J|qp4`1$J6Uc!bj<+V~ zM?eEr`!A?{3v4?FZ2JztwtZmV-?3}o*U)=-_xSs&?p*Y3^l_OkdV=Tc^9J($9Y>OD zd%L9V?Si)baex2f`p)D2Xoqo4upG|xMre=(=r!)v0P3$*v@C=34~lK@-eRvh@obAX zKC8-TUj-~qm9k!iHe}JS*BhTVXdsTg<+wSfKJ6c17=XUkrUN|lf3}B=J9wZruk}XJ z>n^?C4qgXZjmarlGU_MY*l(}&Y?y?H1MYFJqEC=uIF5?BVxQG_qBI(UnMgX4iI#L6 z-ND-@2Z@M_6Fr1<6v-Y#d`B^B`S9A??vJt=CWY=2cf&_Lt%^IVm&yzW>FAy$AaP7S zt+PG^zp_Iub1MaggRG zHY_V92QqiS$-uBx%~yVkSVJB^#Z{ke8p|rKiQo7c_iEXGMTsE~M5?&9@E5Ei3$I9M zQK*59oyGxU7?50#M?8E3ywVR!{}S5e!5*jMRS6%GIyMQH$N)q?nD6rt9Y8)E?g$Z; zaRJa%N6_>M=nIzKnME6nFO)u}V@`>utc2l2Ig7SqjjFfl8fhV2&-_#2g+(U(Shb2B z#4zm}8V(|*D`}-D00W}&q;rS)f-zH!YTYZOfY>25QyZl#gtU#KWoPeB-`AgC-mUG| zdxtN!il*dzqj-`SA-wL0z7ECnbM8+v)ZOq@$X2C4In~Q=PAt!G(SW3rt8*7Dgpmcx z$~jHYy4U2?ziUg!x0}N+o+jCVWmA;}Q^m!pYPCON)oIrTIU9sFLe>0PGcVCS#7rsnQPvd(ZXx65~jh?n0PKMpcr zI6I|~p~w{K-`%n$-{u44^)@iicbdVyS9(aov=orN;7mcoXxOT^*r~WnzibbY>cjQT zvhhm)Q4FeSA zc^!;+UZLC_ppwdE4%9J*KW5d;9iWmb=5_~jUKoqLle%2++EAr#Q2V&U-50ZTL*-%? zV-}357}AYI=lP3c?`}A^TBX;EMazVNxN(`P#>RhWZXgkE>@9HQYwr9N(Cr?d9PJ*wzGcJKzTlK^ z1@6?Q)gJz8Ek;9oLiaJ)}F z^ox@&XLl8ycK)lJ0)Fq$PLaAQH#=&UhX|J@x@8nmJ$hJ4?e`9#oHz~K~}icPN3Iw8}3 zsvJCQSQ4#0LDwEEU9RcNAK>JA2+)l8Ax@&{WYMAiX8Q=v*YI3*YGgfo_&G=KYEcQB zTWAd7G4)l`oTnz?Ncg^AXMT-bSGL2Bpz#L=%gnsQic$503~`Y(lV}Ko9v+<@g@H6{ z5}eiKOl{sh_m{)z00T~;KuubPOyQs$BjHsOeJqWQRJmo-^0{mWZtd>f4N?CH1XP-l zU?&)DHb`41M>{74TxSu|>KeDkTjbX|DXXj3qw#FY-uReb8*g4YmAKAaH5w)%nruVe z-Qn3NTI!|-GiXDzqq3>VKtmM6psurPA5U0}N8F{D1bi1#RAek=s@-%Mje4kD(5l%1 zY8NKo04MUhv6{0Ib;s-*1HlA z!#s11W$v$5#`Wie&UJXPpnKx>hkq{?^cV2dP+00CqN0TU$Ji31Y#MfziB#Q?U7AIQ z-$7xIP~U>=-i_9Vt^IGLlR!D%9v%FCDp?QC@_9Qf*j=U6QcRwJ>Wwl-^@85i>+T$u za4LK|mlY6%$!v&scF_ln(!Cfs_v*PEj;yV%Dx-XZJ|)?@T{KE5%%^(p1g9Ch@eoxT zEX{x&kZ>$}Ny1uS_dxZxe!JDIfrQ*Se&ohDP57t z!=#2NcHN?0#a^;P-``ZewXeyV0B1GjOrV&lu&D}yR}9$Kd-Sl2AOIn%XjLAr^Ea@YNe9`YQ#)o_muDkSdmrbu0ZE)F5H4J zOx;rqd=t>DutZaquCzpOAXzF8b)_d1rw=;T!Z10QB%4f;*c=3Qq{k#EZJ-N{gN

  • v9k9an2CQr4THFE_!*MNT{dmw zrKt^vH0cC-k{cHNv)4{n+UaW8WbmZ}h=k^}E?SF!`KcnZ_?O~niNA>gP`w#1?Y%;K ztmF0@%pbh>_V_zQztHajYdpv3DJUIuCX>#mSm=7v%b39@Pl*7z=&odv*h&%*g&c@1 zg4fyf3aDoXQx|nT3}chHh#Y6&5BXE52Fy{!!DV3U4>xkS&EZ;1;2FG0alHU|VSJX` z#BjO8-NWAD@lL>vDbD&%wg?F8?NLtii*W%R5NjGa?Dl;`2j0FG{h~Ca&OC8!jVrEw z>k6oYr+EE2e96?~uEg?rg%$;SU2YQxM2+MvOosRf#7qRX;V6fq&@e6#mkXMwsXBuL zgdQ513O1V884pg;O&8#=wLlduXjkLq@3+?YVe1I`bAxypXo8`DLaQQ8Q-Fw?x>@B+ z-704gz91%E>USocK~|)E4m5Cu7vu%O?ShL_WzG2oM=lG!9@SA|wogev2Z+yFrC*|F z(J7&R9_jJjFb+^MxK4mJesM}Ln5Q8=DM6(|9QW)CJ9BE^MD}d-hJSSc>OVjK(oa8# z|NhmJfBf5x`9E5%#wx~tZ?qo6^w4;lhUhNBj_Tv6olS8ortqu(E;XQK$(?+7QN;eC1N`NCe^9M4@>`<>BnZ&Y*Y zj|&P~+=DL)HTqS1a69j=;<~pFO0l7mko@`imwmkR{~zh-pOFCOhVy^5x!Qp9zqQtA zuC6s7)A|4O>FS^7{~z(u=RYk!Xa8yn2k_)kV->!xH`mr%1sp&pI!}hlgrbb0u>)tV z=8KiHPWMZ)!Q|7tK)3Fm=Y@3qVIr165++kAO3i}PK>UQ9CVy+6VeFvl-*yk9rGH2$ zc@6@Ce^9Q{UfenS8x{s|6h0B(i*OE)Q0_IolJeM9@+?`ZVgZnI{pewT zgD#9db}ldxt2ZCm9d1P_U*)=x=dbz?VqBm{MgipaF%WkVm@!OnYrr-KJqfvnNk}%x z$c8l5sj^qV-g8z07iu9lMl2MBRr*_-?%RU%i$_X|$@UQ~Qp9UjJ%!-!$Pszdar#mT`N=3%r>-xO&@7tj5_^Ys(ipS2b9bpsebe-wCVScbJSEd7+O6?vv}_)`8VZXVv^u|k zaoj3F*Cnv47tkog#eE5Uw8Y_!{Keu6kmt0mIRFyT549gL>=S9?b`M^>ef4VRC?*}B z_lSorD1rdENfTz0MkMm^O#q$moJpYK{Y^m4d=M6ZlJVq*JPKu44EHf16dS)m) z66-M5pCR+=yP@ttZ%tJ-D9g+Ev>Vl7^w&^p;WcWJe$0#{FmeGrfkh=30zk1}R2>@y z#pzVa!^Ys=LFr-G2g>87A-fR`rO&wv1xFa4i>OzFLi=qADsq{0r)@3%J2fuSc~zeR}Gun#GcGdz^+F zwRU)6$q>o@>GMXB7C4Y;|5V2Pzxwg`zus&x{wF8^Z{Yu)G#=Ca-_x}wyl$=`|JQu{ z^iTfpkN9Z*kC&eqz~-7{fNni%K8c!Z>ualc1qhSmm_IT(MAwYbV4R{`1`?s}#ccTT zmVBU>@fprYU+sszxx3!4@Pe>N%QqX+aIt#8hXLKU6n2R;Ir#IhlN5u$UC|$SrbzWY zqN=F69NX_0MGZN#m(U17QoI>H+fN47)7r2`T*S+G0iV4f{oZM?RUcMgF03a)ru*=(Ulp-GdVrHOvr(1iJ`-3R~ptL4JB6*tR9h z4a;m4$&wu?i}{f(zUt#9=_<{TZ68o2#L2e9@-C^+a+CQZvlFM2PTEKP-=fX?lZUI& z*!HcaoBizXu5FA=dPW;XP5oK@Ii_c?ow02!eV3i1A~zQAp;sm?8_y;gb1p?LMXj0L zaWK0Z1-OkhI>Tv}gOy(wbl0g3H>JlPH*&ZjQOq%b`7;b<4ua;rT$+xhXtendV0?U+ zzBjW;JIt6f$SnIoSVrXMK&nGOLC3uX7r!K*T;tw?1ux-a1b$&H$?3tBWTy>pt|rk~ zxSHU(%IlJ^YJB|eEhsb5Ml9@ew==|SOBbCn2vvxLuI6XLYP$sETP=Z)GG}PDo4zN! z8_g!&(hd6(#J}@fW5ot`OUN`FJtjq!bQDu*r^B<6A&+(om={7k0Qmu)V8A?hARTum z*&Q%YEe$ry^ zm(m79+NH6o#gENRiUg`hL!_Ap?PBtxkPrLMtO~#9!ibZe!RhqS7 z6*`mi{44F8tlk=mY=0Xfs2(!@pOww?cYHru%nw|=1H!P~{%&XM<<1f2oOsWS+uQa9 zSGzE+@Hui(3(A{TnIlH#(2pI#POp~PB}Nz7SdpmTwy8>0vyKJ>97bqPvZi>*nqwgq zTA)1t5_`R}x4B1unY-G&q90gsQ#jCtXL*An80YO23+h2w~TRodxWAw?a&03iG@Dj* zRrrnOHMo+Z9d{`uVMU>9aK11L?XNI77pl_OVJzL0(sWjqmZn2&tfA8r=oat?5i+ln z0VNI56^RQtqz=D(zxiv#!;3y|lnuzthnFZDp)5(UO@>AQI$bhzzh!-#a(umM=2pW9 z*Tds;&fqxjS2e6bl4YIqgxG?!F`&crtO}S8TcTEZkgZ1#vY&^QnrX3Sio;o+T&L6O z&X2n%?N?j7dvA|+@@y3gK3;oQ7oBNoVA?H@;K^oa3PMy{JNCz$(!@ zZaRA(y+ee-s@eM$fCQzsE<0(T?7XEAWL{&oI89E3t(#HVuP}l~7JE`zn)HC4149yENr4Mpw~g zGRgS%D_^i~0glF;P!RP%G9NhM_v}Wh@m8FJMuw{G9#^w?p(?3gK|;Ai$qiLmjo2e# zy%7ctAhjTT>DC0{sK$FIXKygx(c{MZ`<* z36VYH1(|`3=wp(Momrz*N!aKVFxE=FUWrSpQ%VF=o%A@%%k1B&wHpDrQfQc$n$U25 zcls6pod{fZd0CE&eEE?r9~?H)Wg*2hThM)W0>;|%!YVD7%mY{trXvRNu?;{tc7O*! zGYo?x5jga?O44~ci1hZrwSXexJ` zCtJ{2lrac9-NaSv;%2GJ@>AANnWw#2DJor;?^aU5662>F}F z*Ip{IW;L0Pr!JGDq=G$*Hz+Ps8-7SZrvvJnERQJhlV4Y5vs#H9w-#4S4Xtuv+!=Q_ zTT4TZ2PA6mO)_)=fY!)m+^uQ7w`pEfYx_uDY-awMH$STX?%F;klq>v(~h@Jg+!MYoiJc zsvxU>7Ti(cnzI_FP}jpcopErb!%t^~VQ&xK9`C&5^_DiOX9Tf2=1Yxct@>(rZ)Yi< z#rFXdX$Rp8JZpq!qMOQN%26dJ6&*6H3|r!3Y=ewHRJX@i-s?4WNJ9hif>zMpqZn&U zM{od4P}_vYNi?OVRlMEFw=Pei7j|oG_-E>UgzGu{BNU*+%mi1aqY-D#W#d|>U>j%5*1wEhD^%U};*3M4=o0j#5_{B~E$CCq zL;zShhYt&G<2~fh3{GtdKSwaIGPZ_4>YM2XL0jHb%v|@G;}a^wkw&rTJiU}@+e6An zmUdOMTzh7Y1xZmHN`|A^`2~6%j3%E5JIUgJKx8YlMPz@_uggu@7lL~2?pOj+(FUzO z%x=azs>Y#d6dlnA`0Z4;zW#6cPq6^HN&olcaU-<SrDq70?y*je-X5Q{U+f-i9qsNM+Zo$^RqcZCd+*#ZkFlVq zj**y#rb$@QTI8#WJ{bai*dEWai!&ip$7uW`niGn99bTMOYEVR!MxTV9y=+sgNv@1b zy>oPQ{L{h7){n&Wh=Hm@2Iv-A!5r6&9ZbA{&-i)|pE^4#YemH+J^`zB48sT7+D0X0 zj8EzQ@;LV3qZP_=?HY=@)_jAjpgi-(VV8n#`jhPX>`!!&r53Ym{Cl!#t*CLz{wBs& zIGMYzqUr>WkXlrk4U_9J^a>^(=C9(Z-0OPy z4tDbT8TRqC(<7JRbBT*t)Pl0ULO5b6l50yFY2B{t_I93O@hKaE_1%3PR5RgZKZU{< zS<0DqM33OaMcy^prft z-Mo){hGVx2INUVrOPYZanUeZ445dmfR1VGjnVn*cvW7*bSRT4cpRl&QyY_qSEGu7k!^{N-(@Va<{Hry8*ouTjZHrnTvUnrz3_8uAn~0NI=&0B6~S6s0Nj zq$`VE@d_Jbu5e{@8V*@mr{wT-97QW@bQ-eh=N0iV_}H0+Wo+ zo_-%$mEbJmMCi5;#ty;7tSyg*zS&#uJzBkODu&QJ6|1-WD{J+Zf90uQ{kQgrJ;oWh z7o0`vA@6i~fW!8nfSwKg`0IZnLE3}@YH`%T1>U@4B zs9}bKQ5go~>P0~bW>#@%47H+d@p59OwY?K$r0%c;78>BOWK~mw6*)zQq7}`Aoto%a zc)BH`8Jmm$u}C*e@@tbWo{v}PC;mfvc6(hT#qdl!-hF+rb@KLT=UwBys#7^lhn>l% zh^3{981p1Q49L;Sh2R=K7M#yE4oDZwi3J9jRu{MiA*}q zsBsK6%gX^VmZA&C%F_*lMA#rJN;gb%GMs3F%@1#ey* z9_??P_%D{YlkvmrjRkvonRbRlygEm=SCv(V*GAC`X7!8T1$=G3fD=E0_tmO?*H~Gj z`)Kim$h>?WC!1FAf5@jm|HmO99ye|_ z0sIR3KM4dOs=kYy^6%ni?>?htdn6qiQA`Ku#71;B84a9X({~;JdS}N5wXF#0{D#X( zECZsh8qQbJEfu+Nm7t)d>{6Qo|cb{E9D#_@Zs64kC7*hIuFx$0RJjeF*=Ln zY~-t$dYzL~!+(fdK&g}kW2BFYg@wlTTJsL@Fh=<3>@4kK1{yZS$ie2r20#;Bis}Fm zOJIkU9ecB|&}{uL^|06UU)J=iw{gS$PxEo(DboKZ&DF-*+LNc`|NZpIpY;Ea_$c}> z%g+YjkLC7{ z=FBT|R#;}}l^GV6nRsO;g=MB*nQ38}ORvnOU&g2x>8>oz*o?yu3>Cw4Qm{jiJ**X8 zw^CceD9H;8B-^Q1KmYuou{x{N@<5!5(qGKa1qfp_2!$w&e&^r!Sq27_9Hx&9B^zhHB6q9JvA44_n`M4 z3*mFvm69l0-qqj#ELOaB)78JpsQ9e&rac;y!Tr0@d+&AxI&?VR$K?wB+taNV+jQmO z-~kSptWVfIsQW^y-rqbNZ%xh*TwfzBy?gvUW+eSKs@9wJ-Gi4qKjLqU{dVfZ*}fT0 zH-OV6I419LK*gZ**XujR*;~PYcgVd#w^st?P%!`k@E?K~|};23l$6 z5jnp#@iDZH{q#L94jLKGY5xCX@9Cf0ww3I!;$MNsIZsH7Qb~RJE;W}sgQ|G0^nltwb)%O7SGOKe!X74 z7Q2Q(Wu5OYuI&$je{=Hn`PmBe^QUE3i9v-o4Q^}2a>RWl?+aQl@N!duC#R=X1it&a z^8W32)#{(V_($da)yw~?yr2DN<@Nkc_4TY;xjtR#A*)F#G>q0pjfgD2vhQkuzP&n# ziw-X5>l(oDZh+z40PkvNm|B%etBX2U;^-FHwJ|hJnVgMvAhfMJM~}L%Zha6=OoupG z+PwVW2vpZS7F`nhzDCOl8sI|wGA&wl!0B3otF(#Ax=!ng&E7TYQGA<7J5%kbz~v=z z>I*dMe{7l$&D<>0FlpgXmJJKLRI=Z>v@3?ZBnib{uGkF7%k6`_*gMGS8qIRYAm6-Q zko%_97n=mOwo8D~T5MVKgPa{7B2CWLeJXbj8$#L zeFXN}V-qb=p{11j0~kY&QCsmdvB9;3QMPR7=q?HpciaJC}`7mccNp@53e9-PEE zkJG7qlmr*wOo348r9$7Kdu-MLdlUOr&toeD_5C{Axl~RtR`6hP8V0c}TA38cSJg7& ztc_N0xm7Hol0As_JgFMBtTXhhZh`J{1f;N3Xyw@9HZhI|6Ff=iBzoiCxlg{zkVTRo zTcu!8m3`Bu*;-Z3vDH4N9;H(m1(zE9eyRc;BmUlqaSjESvvl1wfQIV2DL~y@iKp#< z(MFqV|DEIsKBE4bV;Y6Kiu!O9$j$M>U_fqz=gQ7z8J)yZWBL?M&lw(VaDcXA=O))mvLsYRZJTeJg^k3M=iPHbV zqA>mP6P4k*9Ty#X+_C?M0sX%p^^T6Zy|#<~KOp}Xtow=Zsf53{{h`Hx7 zw(S36cYgsL-s-_qw?*eaI{W*db`u&6hP{r*V#j!k3i5Kr8R^_Gkd^`|b?8pICae<) zo}RMVO)8fxE5g%OxLg>pGX8Z5>HpJEng4M#;JcsyUC(Rd{BO5Cpa5NQ{>$y`=l?DO z%zxGE20W)(G>p*Oe1FMK(ZBQ8X^bZbc*c%Ti|4ZN9z3it0aS@eakboc# zVEa)j9O4 z!U7;HoCQEwNC8;Y@r?gcDBp4^ULj}!%7+YBW)k=PcA9>uv5ir#VnM?OxxIz}`+ zZ3M7NKS5skNO_kcuRcnY*Q5~_V;YBj9%h`ckBXZtm|Nv|fG>U1L<$gu;cPsM(SR7f z&Nz*;K^%qed8W-?F+yZ_syQn)J>q$v&wqD{mrC5Smwrigb+!iFmo@U5gn zp+XBWqgkE92#>^7$k<4@A|Ul)g1A6C^izNfA3Q%hdHn`S7xRR>5BUrKzG8E~4b-#E zel?z*zc@X6P5E3cpSzmx?E6>eFHg^8Mh#ez-BsB;kp1b4%jZSjGN&tZt0zyz;J01* z?bqMEd2{yq>G=-@_O7EB>1v=fY*m~B)n$TciLVOXR7b8=QB=& zbe@XAo|h}mD9V8#0zMlC0?y&J#0tbb9dqI*L@aa>%qd(dH7c9qVh)%&h;M>d$i@+x z)6qh|Y>?*!_*`Nl*AmfrPS@$!YiY8>oK_cB<@IFjAgAMaErlyC2(x4w#bN`Ys2+Uc zd&N{S|J!XHUA4Y3?HYVT+)Eg9JP;wMf+EhvQl(1O77ci{^)#n!LHXp!6hZB^f}d;U zj<8k3S(c|+rKExo6`!6%)3b)w*vxdW6jIkxMy%uzz3{7D8hCls!XBdDpcW}eNuwe8 zq#ELqq=IeIDJKoAj_b6b;XgMkyAOXLROG)w)c*wH-&Xs75cg32>m7BxPP^AZ`LEsC z`~TQUfO!qQo+iM%M5V8DT4=){9C2D$Zh3}Im^fKW3(=?HnZPG*{$fqw4~O?077wb2 zIf-#w*a1+s0YAQMaeNgSDB?!u_}qhgAGU@n{SQzWh=TZjSAlKxzwMI#@2H1r|4t9` zcea_k-IT<4sIG+RtR)yHFt1z^n=<#49 zzzx8|Eg%8uwRDOjf{m?NOfy<%QAEl(viG=*K3!>#YW>TUWUUNb!I9;Tv!!Q{Xgu%}elB%RX|xV|Rh;;Iz5 z*1|FW2GC*MP*CwQJ0Z3R9AJ42;~ldsso@5wZN~nip;RgvTGp|b#4&_nPh*j@0aI1=JX`B$!5Zfmit+~-sh zzcCj6FXlG^>fE04KKy@0rzu(Lf`i(JuHiX|xK7rqtAu>o8=`H-8^3eR% zFe;t)@$|p4{*QPZe*y#0?e?E?{dar4u1oe`y}kYCZi3u4mMfaPnGBXiPCEY>7RMQ^ z#)eT6jORE=*gVbR8%M0+rc+!qWB!fk$>*-sK74Gb%>UPCC#T<@-Fq3^`2SYhL;1hc zYIj?`qb}Y5+41)Ce;47+h$CB^!JC^`3{BC%WR~;6 zEGAb5O#?tI3Bs5M$y6?JWObJcr&y>|CJ_Nd2a*lo!z_bUH(m;jL7b zHSvt=`It{f>5aIpBaLrS07=q>z`=mvKh1Ja;^QeFlfoP815Kgs;1WhkR>?h0npbWF$4hH=`* zy+oBtHfH*^PVGb5XUr^i32U_vZwrf@(0Hqv#kOKD^QO`iDW{H>b}4B_XbDtv0U+ZO zswF;#`3waP%2bXHC9_uf?=vSDkngI z#9I}S5sb)Ska|A2AxW4r)1Y7Nh$0W>&m+LMtPQ==WqSj5h7FV>^Um{P8wI50mG&ek zQe6W;K2C&(Z^Su{5>0w{*bw02y+1G)WAX||^MY^-XhWNi>1z<(c>^!25#2`bjNZ#+ zy{*E2gv$C~63TlmW8403%N6!NuIKe!%;$C7 zc5A=>?;@c7|93Bm#to0Bf$#A~4`u#o8UtBRLayl$1W;>$j%1uc;0*eODk1c(px(E? zY-wtU#4#b>bVB$W_~<0YWPSMCSEh^60Mh*c?Ofn*AODiNFX-o1(CFL8gi>YeGj#fm zK&U%NRiVls;AU?qU=D)AL3muasMYUC;rO z$0Z_U7jB{WD`=7Hro4@GUTjXb+;WcaQ%5z%RhN>gH?8U{;7%KE%@VWP1#y0&=r_)vYKW%yb*X!-& zznugm-+w@=A$yF_^&2hM>ADR(4@Y(xrJCpo1F~JCY<}oEp+RM@6gb#eV4)iS+@16ZLuLL8F8toh*f#&W z-Od-D3sb(=al0K?`2XGS|L!Ef{4Zp#s>O#G4D6WfHPpG=bTG*I6gU#G6@>0RX*)_D zNyHPmbRnJB6Z}<9b|4k@s=EKQIw9SE|DM5w6y+dWBQp&1S>MVX(`wq}_o>*G0p{#( zV6E=~mW)NmSLlDumK!&#UuArP&fJ{#AzF=36kFb-q? zBqF4ZNQfbAmPjb{ScajW!&{|8>r_ZP;U-Did*`haJL$w3`ig*nyh79Z>Y(x1I=DHs z53UdLL+k3<<+ZIGb~YPd9prVZd1(Ke6j0Om$_fKtCcbZ8nxas6ftm{`5}!?JQc%#8 zAy5u zz}ZD7vD97UFtURw`)QVdlH}Mda@U4L7wZ*nk=~P60+EjC|xY*oR4=SZdP%FI^ z*kWRlPwv2m*(I;fDomdwgR#m5{De-N4W_(js%+(@>LOLy#wZNpv@D!ibXRd2-#7`M zYYsYmarwZIPw{RPVv00{*3+!n#oMj+6k)KR`(odWD2q@ayJPT#r$p5wPuG;QA zlpe5GsfPIwSP{a^M7oRCccxQR3o(TRYaZl!G*kkjfs4}UjH>ex56med3j9l1|EVa4 z?Ab*9hN4Y|SNP|;Opy`3G<_qK0oIsL10ve!oO-~MTg!HSdHWV9EnoOU=Plk+CSD-( zubSOVVQXj@f$tf8zlDEYe83+d?DXi$V{E7v3->Cej}05>f3dxDUuA5i|K0A2|G&=B z-u`Ddp`ia_6ORmZX|@R=un}uxLfc4J@?gwwc?{y9d@bn3C{5p6kd{mfwf`Ee)MYAy z1H|glqerE5r6e*+v;~hfEe{%0=;}Jv)Tpb26tt4vLATw4Hm%~-5(N?Ru*hJ|izP-> zmww5fQ>-XjY{Mfmj*n_rK{ko8WdY0CVqqH3#!1dBOmpZP zTP+7C8)Wl%MK+H=B%8kl(Ht1Mid-H$56s8b)!T#lb=@`}qg;+M_yYkh_{~2Nz)t+2 zN+obp`Jtlv6>VN$5Res`^0~WaCt=n9i?ryv*D|)A|2#tb@1su7JL-6zu>a`p^?y4F zCBsM73NYD8Pghv#6)at@8F$E3SmFEfB)T%WQ1)psk%EbK3g6b;AHsxYKJy%THeHa2 z0M7*_rT@DU(lX-ljgZkX1P;T``wk20eeKLrdBmPvbfTq!hNgv1$jJ4kbXqLPz~^rL z&mSuDzqEL~*D|)v|5n$d{l8Ynb35H5n*Y81{NG6s8kRe4Tgy2wFOFz7n|Iq9VWOOb z>YfR4TI3)XCq>{dfD*S(q&bRQJh?T$yF7bs63dTni@0{21o8kwu|K~3=|a{2zc4z# z?=rT||6W(<{~`2T;s33-xBuKpko$jkA1#PThreWV+~r%}7LaQtKj>a9*9fdA_Fw_ZX`FAJnmg`z>Re{ufqzW&hpncr9`Mv%8=Fy9o09 z=N~zNvT+}uH8{KQ$>nb`n%F<3mO!|cms~li7|08|JTXKZLJM~vlZvSEyF?7(pTFgx zD6u9)ME07nK-S4IT1e}tC>-&+Joe-8fdi$FQ!THphj3fs7dT zpKvCLeWIUIGZu&#Ppk{!6u9V3Ak$-Ll-UG3@S>vl(W`{4A4jf-@*ge%U?0a&6X*fq9eyI6{S*lv_!|elSmaw$Lq>v9gqY`tRMgffRdP0{`>Xw z^vnRHB*(S2N!`{Fl~^P=?=Rg?_w;n*e*IZA3zGsSo&ISw?0x-Mf13-Bo?DQFAWns| z?Kz%!P_Xv9)9k)Gck; zR=)yenH@iUdUJCFM%PL65Ab9#vQ2~2B*kovc2E?lj3n^wJe{p8#UHG13!(2avCXl~(L7)!^Du}T_AaCQ zspdfdia>G)go2&L>p9xsevYH7$ku@D9EYNzVZPdIXIrCx;cv)pW$S4i6|1(HM<{wK zQ!JB*mz=0J`tcO^RKqxKNC{Esm!xZ5TdhP=jE&T9hlu8lH!Fd)TRn*i0rGhwRcZh- zksgYaHU2%E(WwR94y3WHYjkavCh8HnIBviLhK8eIUv!#<%S1CBZcac}&8q#WSV01s zhIYV0MC)$gmFrH9>KOr-t3J*B#r}HJWyMV1_RM(rX7au}>Y4u7T#Sa__fLDLrr90K z_h#F??@!(i-%ZSW1o9b7KA7Pf(;a*;|J5IywoUJ^7o*;IY=)yo|NP>t-;;O!!O7XX z)BfN)^IGx^h7)tvm(4DPPKE{*+M@csF$z2HjZWUm*Y4~7S%31O-FVZV3{d8q;mCB& zMRzpmpS(Nkj%1;aE{5ZtRDUYP4*G*PBdMi#-WyChMyi#UruV&kGvl}2voqAy=)RNY zkI+El8I^fEJUi{l%hx?=TKDx?PwSFiot$<1=WTP^J@0^>KSQRtEq@W=)Y11ah->D&HT_R0q) z4eFkFgheGw7>5giQ={-WD8MY@FaV>sH%(>5KQ`|H4}?rgBmSMPBWqa1INT6;uk>x< zDMDorZ$c8=n!9=L14cMj5iJu7D8k!PHUSOHO^{{6M%0%<$Cn)!DVQq)Qo=D2p$J^- z?1ml@rXVDFei+26uWhxL zK@@={S`r1FaJDWHqtOocgTRI%xIC;e-c#!|3={36@boJn2w}gA5cZK6O)x#g0Z7;6 zU!nSY^DQv6=i_yu2WytX3t#bL)4dir7EGf!DmM>KFoq6Jp){?H{I-P!%>!5vO~YcW z*aH&&7SdZ(K(S+6VUg%Oy-DC$8jIlG>2L{ZUF_HP$%9?=N3A;a8E#!O%GXKT^(`X` zTPHpss-y!hxJ*(8*~_E~tRV}kSBTRpt=3Xp0eQ!~BV>P;)IcE2=V|MqwjtuLs?|JFzkT*JfAFJNYVQHCWI%*!<2C_+}DeXx%4!)d*S&)}J zZvtmRK-rSYyD>rx&4_U=CRRXtkqQo4P~ChI2(FZgMBhk6N*0Tx^U(Zfkc3fAAE}9X zod-Wh@qt^pS82Yr18s;phJ9R1p?UG}PSW4~d^@J96!c&9P|ERtJMX_s9lyc}z9mN#k5DDNRQl`HAtV~$sGhrd{>X(8Y zP3^8i8V21(2xUuL8-|Vqa}lPT8*u6s((I6y+U8uS6EA{-W7V4i>k-g1Q*4Sd6ar}J zmk@0Fe-m7>>6kZk4kr?vk~xr7kUH7c(ZX!t!NyTg)o>tob;tAd%(6RU}yZ{Bch^3aXQKQ0Xnn?@OtLW#uc#I6hAvXV#*D(-k6)qMz9X!d?7-8?D zL^xUDxkkY;?{l2YjrHd^TZOaBN`vF^!;Uk@b~SD|P5^&V=R?!l6n0EE#yBh2qDx2c z3M>F;i0J)2M(T^Y&Rp+blU$WUa1At@MQht6X`An^f{pKv#j_^j;tgQ$gur$|th{vw z4xy8*%S_frqC)&E0RHp6v;{SF`tOtyIP9d3pIx=8WP#Gb-jP6ce#x5;Xst}K6vK{q zjY&;~P~0i+zG>6RMk`!WZrlWJGwBVgy|vJNciME0ZkPN63;v$!>XlHjj}^faJYNf6 zbGUF#Jc=<^Hgv3`9ngGCBd~lhtS{d7>%a1$-kdc`E-OX;DY&MDhsrR=!ku>otit zTfM?q!RwdBRs>4GKOLJl5AAjNgb@(b2`f6mvsbAFW1?s{$z`!wgnJe1zyv&UCWN1{ zlr?VSCrp9A^Hd68fZjs48N9c;Ev7}_S1HAMcP+~Gg6_-0a;D32o+gh_t9H>shRY|Q@G|i!d!AfKc1@mNiDF3!S25@Dxp;M|eE1Oxk zNsvVySqOBhEr0bkBR-`3cYT%NFHYg{cgcU_@U}BUG}|kIDOg23uHdH(1r_)xf_4$+ z_{8Aq`hj-a%&NEkxpikdNTuI|{J&#h;8T2L! z2SK6nyRbHFfa{_&4NBD*z&faTVojbdL^#RHrekKj|J2T`Jtgq_qYA&cdv8Y#*IM6KuyiW|*sR;@T}m%4>oLo}{q>)L7cF@h~>M zNj#|DqMhgfv`UuwRA>wpqev|Y?42^h)^=dkU7YVG*o}?~RsAMSuE@&{LH9gq8sfU~ z&OWXwSS-W;SJklm-+r9_$13rEmpVSJ|2cZ~)pP29UcLP4#h0&M(*EPw(f<7B4|(c` zH#Pmwi9NcZa>jWCebM<6n;1!clg&d*WDiCFb)N{ixxpF#S_qz%s{QLCyuumxOmVnX z4b||YUQ8?=${^S?dAgK;Y6&(;8QebIPA3Hh`Lb3_Ea1#}E~?HI1m#spev&3Xs=^$% ze)y6uf2zj7t*B`oFFb> zw5zYOb+Kxd=>gcx5)>F^37yWVXNp0m1qeXPF13n)#Wo`&f@=b_r&k)_0Jd}l0|#1$ zyh4(XkE>Rd-oAE5kSshdPuI(pQfFa@TX)8)Zh_iI%eC6vm}0h)MCLjQOikWET9L?e z%^#a(kWX=BH-k!$)oYq*Se8~epymhRJ(Brhy3nW}R`n<#$c=@_t%TcBEDUChLLUQP zNGd@%8^)i2KI~lDTCA#$llJoY;Z&H{RWMt@*4-|MfJbf?w``?94`yaKHhe%E)z!M{)LS-SuNpyKt`B(MT6^2~}j! zs|@(PZPp2P0WO97&pLvk8A!t8HWg(o#nbuOYMorFve%v_Pd8T11r^4-Z6_^q2lI|-md?bI1`yW%0W1KXH`6`nEsN#B_u5l+9IDa<3&Q@%ok%WpWp-I(!ZHj& znFWdN0+B>yh0d_l*O^a+^Xp|2#D_(&kl}`FAIn)j#fj`u|1peIYeg-Bg5p^oE}=Zh z52tF466Mf)Iht>YV2#GZgd~R>L*5+`ZWvN!W0Au)@kI6d-YSL4?SV6T0&Pj>-NDxA z5Y3_#v9+^mDv(Gv)Gx{kt^`FVMRFdj&&5J7UsJt7f9|Ef*aR6&0Z+yFMb6~qn6)Jm z_gw`wXYaZn`-A?3Iyw<>3#fQazXT~&mAfpt|G?tK@j#P`F~k5lI5TV0ryYGV?Uv+pn@A*FjJ1_-J-sIwWtZB+1Gz}rBIvs84!N&Ru{4j|9 zQKs@iI~waG;t^B{tn6$@tiRf0_km-D66esWS^kjH`(VcvR8H)U!^hSemM{zC4vb`v1nKwoz3kql2<^s-n zCr`A`tA`6Sa2HyWw;pH%sDo`scl6z;H_-;%h4ou7u$ta`I{d_*?peR49ywP9Fn^lQ zl{b2pJCNbW7cUDOT4BH%K{>4~r#R%9Esv{QUY%7b;UU(d`~%8%4Lf(N>`Gqkun<;* z)vyYRl{(d00s^g^?3*TsHum22ePm@PxvXU}ek?O;1C~u$z^Lf8E&EwK1mPDbRAb)?hrn=ouI|-p8B@``QHRC@m^k%eQh0>og(7|yDdgPoEE3}&8%VH1rpKOY`bq9D1%B*}M#Is0Z#?dP z*JE2gcF%gFNljuVR^f#T2dL~NS{U3yY!9%Z8Ew&$L&!|qds=T=|Ly1{>U{RMXV2~Y zap^BHx*%$*IneE(2bAe$abT{vDx949ktE!&blEnnq5{xZMbTWr;4;(!*3&|qb4fKd z7R{<4T7#(=RXJ5usVZ$+2bPflk*3D=HqBB6H-6Nc!1xHoQL`#3 zO1FxM*TsrugyCiLQ|sYNT@Rn9852U&dvD(Kx|4UK-mwfxnryDpby2HYFWbjyK^1um z`jh55Q!?JHNh&JmxYJ}611rs$jFUA1_-!yBqQg?+qN6oz_B3wT6~^f3O9oa6F-VUjy0-?Tt!mWE>2G??Z};?Hz#R zq|M;(#GG@;J0jmMMS`&=Sp@!I35V1Jw(cd z!5(c?aBS_%TM1b85kC^1dm$a?iMtkaS*r z=B9{Jg%cW&qUw(m09COA=XEMr!9@y?>r&NLv;&IgI~jLH9IIN8A|ii#MW9mZ6?INx z_nqCAxyZYHXbLOuK6vmT2%ClO96+d|`! + +Lua 5.1 reference manual - contents + + + + + +
    +     + + +Copyright +© 2006 Lua.org, PUC-Rio. All rights reserved. + +
    + +

    Contents

    + + +

    Quick index

    + + + + + + +
    +

    Functions

    +_G
    +_VERSION
    +assert
    +collectgarbage
    +coroutine.create
    +coroutine.resume
    +coroutine.running
    +coroutine.status
    +coroutine.wrap
    +coroutine.yield
    +debug.debug
    +debug.getfenv
    +debug.gethook
    +debug.getinfo
    +debug.getlocal
    +debug.getmetatable
    +debug.getregistry
    +debug.getupvalue
    +debug.setfenv
    +debug.sethook
    +debug.setlocal
    +debug.setmetatable
    +debug.setupvalue
    +debug.traceback
    +dofile
    +error
    +file:close
    +file:flush
    +file:lines
    +file:read
    +file:seek
    +file:setvbuf
    +file:write
    +getfenv
    +getmetatable
    +io.close
    +io.flush
    +io.input
    +io.lines
    +io.open
    +io.output
    +io.popen
    +io.read
    +io.tmpfile
    +io.type
    +io.write
    +ipairs
    +load
    +loadfile
    +loadstring
    +math.abs
    +math.acos
    +math.asin
    +math.atan2
    +math.atan
    +math.ceil
    +math.cosh
    +math.cos
    +math.deg
    +math.exp
    +math.floor
    +math.fmod
    +math.frexp
    +math.ldexp
    +math.log10
    +math.log
    +math.max
    +math.min
    +math.modf
    +math.pow
    +math.rad
    +math.random
    +math.randomseed
    +math.sinh
    +math.sin
    +math.sqrt
    +math.tanh
    +math.tan
    +module
    +next
    +os.clock
    +os.date
    +os.difftime
    +os.execute
    +os.exit
    +os.getenv
    +os.remove
    +os.rename
    +os.setlocale
    +os.time
    +os.tmpname
    +package.cpath
    +package.loaded
    +package.loadlib
    +package.path
    +package.preload
    +package.seeall
    +pairs
    +pcall
    +print
    +rawequal
    +rawget
    +rawset
    +require
    +select
    +setfenv
    +setmetatable
    +string.byte
    +string.char
    +string.dump
    +string.find
    +string.format
    +string.gmatch
    +string.gsub
    +string.len
    +string.lower
    +string.match
    +string.rep
    +string.reverse
    +string.sub
    +string.upper
    +table.concat
    +table.insert
    +table.maxn
    +table.remove
    +table.sort
    +tonumber
    +tostring
    +type
    +unpack
    +xpcall
    + +    		 +

    API

    +lua_Alloc
    +lua_CFunction
    +lua_Debug
    +lua_Hook
    +lua_Integer
    +lua_Number
    +lua_Reader
    +lua_State
    +lua_Writer
    +lua_atpanic
    +lua_call
    +lua_checkstack
    +lua_close
    +lua_concat
    +lua_cpcall
    +lua_createtable
    +lua_dump
    +lua_equal
    +lua_error
    +lua_gc
    +lua_getallocf
    +lua_getfenv
    +lua_getfield
    +lua_getglobal
    +lua_gethook
    +lua_gethookcount
    +lua_gethookmask
    +lua_getinfo
    +lua_getlocal
    +lua_getmetatable
    +lua_getstack
    +lua_gettable
    +lua_gettop
    +lua_getupvalue
    +lua_insert
    +lua_isboolean
    +lua_iscfunction
    +lua_isfunction
    +lua_islightuserdata
    +lua_isnil
    +lua_isnumber
    +lua_isstring
    +lua_istable
    +lua_isthread
    +lua_isuserdata
    +lua_lessthan
    +lua_load
    +lua_newstate
    +lua_newtable
    +lua_newthread
    +lua_newuserdata
    +lua_next
    +lua_objlen
    +lua_pcall
    +lua_pop
    +lua_pushboolean
    +lua_pushcclosure
    +lua_pushcfunction
    +lua_pushfstring
    +lua_pushinteger
    +lua_pushlightuserdata
    +lua_pushlstring
    +lua_pushnil
    +lua_pushnumber
    +lua_pushstring
    +lua_pushthread
    +lua_pushvalue
    +lua_pushvfstring
    +lua_rawequal
    +lua_rawget
    +lua_rawgeti
    +lua_rawset
    +lua_rawseti
    +lua_register
    +lua_remove
    +lua_replace
    +lua_resume
    +lua_setallocf
    +lua_setfenv
    +lua_setfield
    +lua_setglobal
    +lua_sethook
    +lua_setlocal
    +lua_setmetatable
    +lua_settable
    +lua_settop
    +lua_setupvalue
    +lua_status
    +lua_toboolean
    +lua_tocfunction
    +lua_tointeger
    +lua_tolstring
    +lua_tonumber
    +lua_topointer
    +lua_tostring
    +lua_tothread
    +lua_touserdata
    +lua_type
    +lua_typename
    +lua_xmove
    +lua_yield
    + +    		 +

    Auxiliary library

    +luaL_Buffer
    +luaL_Reg
    +luaL_addchar
    +luaL_addlstring
    +luaL_addsize
    +luaL_addstring
    +luaL_addvalue
    +luaL_argcheck
    +luaL_argerror
    +luaL_buffinit
    +luaL_callmeta
    +luaL_checkany
    +luaL_checkint
    +luaL_checkinteger
    +luaL_checklong
    +luaL_checklstring
    +luaL_checknumber
    +luaL_checkoption
    +luaL_checkstack
    +luaL_checkstring
    +luaL_checktype
    +luaL_checkudata
    +luaL_error
    +luaL_getmetafield
    +luaL_getmetatable
    +luaL_gsub
    +luaL_loadbuffer
    +luaL_loadfile
    +luaL_loadstring
    +luaL_newmetatable
    +luaL_newstate
    +luaL_openlibs
    +luaL_optint
    +luaL_optinteger
    +luaL_optlong
    +luaL_optlstring
    +luaL_optnumber
    +luaL_optstring
    +luaL_prepbuffer
    +luaL_pushresult
    +luaL_ref
    +luaL_register
    +luaL_typename
    +luaL_typerror
    +luaL_unref
    +luaL_where
    + +
    +

    + +

    + +Last update: +Fri Feb 10 17:15:37 BRST 2006 + + + + diff --git a/ref/lua-5.1/doc/logo.gif b/ref/lua-5.1/doc/logo.gif new file mode 100644 index 0000000000000000000000000000000000000000..2f5e4ac2e742fbb7675e739879211553758aea9c GIT binary patch literal 4232 zcmeH``9G8i;K!fm@ywWE@XWZzZ5SF?A>^uN#>^O6HI%DVL*tw8h1>$H%uPC0$QQ=txe!o}PX)Ev+jn>*nFZ-TC=<^76WcLZL(=DJm)| zEiIKwrInSHXU?3duCC_u@5try#>U2`rlw1mF15F}U%!66tE;QKyIUmcDJ<+QF77*W zFJd#&)VAl)kJ6K zi<>tmZ{3>g>+2gB7#JQNe(>OdLh;A=`1q42PbMZNCMPF*dXxhLZw3aYhlZwyhu@Bj z%#4n{d-Q1b$&i4QMce4L#8^!oMdw{PDnm4D66&3*dxX=-YIX6DQL_g`jbzkd4k zZDCoLf=%jL&vIeE zO=XcZ9fxt`f}-DQ^%H*PHMUs(JN%UWkI|Y8h9#6~I$Cw@{RqzO4&P-x;jHCPJ6Ks2 zoU%foi)nXd_sdkiuJa@@5J4RrreKfWSnz5>eMa5yTP=)16uu)TIdx~Fhho))6jZl) z($*i>QrIX4u}u3>m{WSn_ehkUGQ& zs})aUlTH1Cj1g3ZE3=MPXsSniEwJ{e6C3N#HjD=B4`8rWIsz!a7ecYpec?WuH+y?Wsm18^$cS4WmHhH3_=r zh*ILlm*X1dB^E5($KVl&zT524%l}vpHg%;Y+LezV_&TAJCmH`idhuj-n$4FZ)UE|jXLayXa-&O3Q z?Iyo!x*$5hD_HfFnDfGYj-RD|eIb7I?%>Y_kf%}Nbd`BXb4l1(Pc+}zoUR|9%_!7f zum2T;wbx&pohtI+&@~wm3nH9xLbOYkg*`phY~TK5iC#3tZNXo9s`cahx+8j2)rh5C zQgZh6D7Ekgib|hpdhxYf{r!PTJc z!vsYG@{hA}l5kL)g)0N_)(nC<*L0qdUi*3fD5<0sn58>zklX@6Tyv3*X^}m=Cqc40 zQ6GfjG@kd1mFIm`qaubWunm_?P>WUZ`9|f_z%gGHi{n|uu(N8!L=aw5(qAcDj$-QK zu;D#j6e42OXTQD>)i zlvM$LX`$n9EEjxM$_QDF&a z7cme_rat}aXmiN&7`6Q98}dh4Z@8L_uAb#nK&GQiZOOUnA9kAEVb-csuN1AWL=sXt z{z9GCN%%l0N9QvJM;tl1nf?rrhT{*sE%4WqR?{0~aIrfCcCPxf4eh_*jjQ=`$p53Y z@_|Rsx2i}|3dNFetMQQ5y8agTK-E0D&7;@3-LUxfvZ7 z7~!p@&mFe^oca2^F|CBt+4Ly?^ViUVSAhAH>JH1GN{^TQb3QnM*x0ZiZgDyNI@_c3 z@{}(WH4*e3T~}n_^0}da4ElIxAf9B!IaL7z9X0Icvj@cIkE*~W--17&WN`Ea5)Gn> z#gpfRb#44;jVTOS{FuaZgd(-ZD848=fQzgST2MxR>wSLc1P=2HDvByz$B$IsNCC6L zCM?nK*OHj6JA9gz4|b<~2%RqelN^1Y)jIqnRs!mDKV^BQTfo@hOtz7*Ug}Ee^cbsj zNNlumRgAmt`1$b5MO;&X#5-EP<}AaY;52ihIpem&MTea$?3!DrwbYa?V`NjEfWF3z zUq5JY8Ch;L{kx&J<1K&Fe_Vn;8gk{%c;n?nA2(%(f%DCRHko3uT~VI7RE^JWEqaCq z)i|%nfj(*4|V*XhY3W%M# z*yn6SN4eUOHFxAD7B&9E_PO`G5bqgs^@J{9bk>&;PlUAiqo`j3rjQDgD!}mqLUtb` zCB}ZD@m@s#pf7bV4jreOC*JVfHZ|hyHkX!rauVdd_I9FL45d{gWH!DNYu;i(|8wVx z!)eLY6YXxZ2{Coae0xuTnxo1ACb5wtED?VJAz&@114$Ao6uG9YSy*!K;m5_mj=0^j zw%?b%AOs}ql@$TGC-!^^*_#RT5+y_kTzQG9?LPPZNAtt6cJ%d2$q(I)ws21*?xF%p zN+NeGnWRQ<5w70Rc(bl|S0Xr&5@WrmdurS|IgPB|EyuZO#=tf!35)G!HJ`E1jh^lH zTBu~rL#DhQO*XAWtBt}JHH$lc>3%r0yD|maW_(W=B_J+y164F>O4dO|@&@N3Z3p=B zmVl{|^Z&#atHY|9n&la)SBo}=3AFIF=_~LDJk6MTlA73CXtX+4bnn+c!}N}IPa5pp zwyqbqIkN|I3j_3vD6$zlu{Ps(N-J|*qzEt<$5Soh;s^AuKv_ z-Tz+O1_~6*9CJh4r}`}mbUtjbf#fX58RIIkP6&@*y9kI|5fK*_eZ%jv3U$5*x<>D_ za2M(TV8?XY+9xy>0En#Te<6X4$0&dbyd(go$~eq4u(u)EA2msyF<5ssLZ zDP|I}=~Bi_q)whWv=Ri~L1TYaNrR;5cMB@s78HF1{w&r(6GJ;_2@bD?#1p&P4n_?n0#9Vx~$qjMX=Lk?*!@aKo8m&$iPO7S{g3sFUwr`*<53(68xx7?z`2xf# zGSicy_zI(PJ|%qc2VxT+6bOE--a{k&aq7$<<= zFt)C<@|TPs`+eycPGoGL1Wn9|Ed&a2JyAmjnkm3DQBECX&`bt~odH9cUPq4M{#$-q?G3!)qO-it*&YHw+j-O* zYy78V*`4Q=kQ@^Yz*b6Tal4(Me7BGeS^;phWAW8+L^5A(=D)t?k!rLIwVAKtq=f7h z&^n&VX1-T$ScvN~639QLZ^d@niMaS{C-Q)8oHHBhwD*r~-1Ze#Q)GFOFptW32a-uF z;M@ux%i%a25NwIgXt*=GHX$3~aZfwovGL!}sf?j9TsVo^cn(%&a<--0mIXYqGe>c PWz_J}_#7St0k8iB@FZjZ literal 0 HcmV?d00001 diff --git a/ref/lua-5.1/doc/lua.1 b/ref/lua-5.1/doc/lua.1 new file mode 100644 index 0000000..24809cc --- /dev/null +++ b/ref/lua-5.1/doc/lua.1 @@ -0,0 +1,163 @@ +.\" $Id: lua.man,v 1.11 2006/01/06 16:03:34 lhf Exp $ +.TH LUA 1 "$Date: 2006/01/06 16:03:34 $" +.SH NAME +lua \- Lua interpreter +.SH SYNOPSIS +.B lua +[ +.I options +] +[ +.I script +[ +.I args +] +] +.SH DESCRIPTION +.B lua +is the stand-alone 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 +The given +.I options +(see below) +are executed and then +the Lua program in file +.I script +is loaded and executed. +The given +.I args +are available to +.I script +as strings in a global table named +.BR arg . +If these arguments contain spaces or other characters special to the shell, +then they should be quoted +(but note that the quotes will be removed by the shell). +The arguments in +.B arg +start at 0, +which contains the string +.RI ' script '. +The index of the last argument is stored in +.BR arg.n . +The arguments given in the command line before +.IR script , +including the name of the interpreter, +are available in negative indices in +.BR arg . +.LP +At the very start, +before even handling the command line, +.B lua +executes the contents of the environment variable +.BR LUA_INIT , +if it is defined. +If the value of +.B LUA_INIT +is of the form +.RI '@ filename ', +then +.I filename +is executed. +Otherwise, the string is assumed to be a Lua statement and is executed. +.LP +Options start with +.B '\-' +and are described below. +You can use +.B "'\--'" +to signal the end of options. +.LP +If no arguments are given, +then +.B "\-v \-i" +is assumed when the standard input is a terminal; +otherwise, +.B "\-" +is assumed. +.LP +In interactive mode, +.B lua +prompts the user, +reads lines from the standard input, +and executes them as they are read. +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. +So, one way to interrupt the reading of an incomplete statement is +to force a syntax error: +adding a +.B ';' +in the middle of a statement is a sure way of forcing a syntax error +(except inside multiline strings and comments; these must be closed explicitly). +If a line starts with +.BR '=' , +then +.B lua +displays the values of all the expressions in the remainder of the +line. The expressions must be separated by commas. +The primary prompt is the value of the global variable +.BR _PROMPT , +if this value is a string; +otherwise, the default prompt is used. +Similarly, the secondary prompt is the value of the global variable +.BR _PROMPT2 . +So, +to change the prompts, +set the corresponding variable to a string of your choice. +You can do that after calling the interpreter +or on the command line +(but in this case you have to be careful with quotes +if the prompt string contains a space; otherwise you may confuse the shell.) +The default prompts are "> " and ">> ". +.SH OPTIONS +.TP +.B \- +load and execute the standard input as a file, +that is, +not interactively, +even when the standard input is a terminal. +.TP +.BI \-e " stat" +execute statement +.IR stat . +You need to quote +.I stat +if it contains spaces, quotes, +or other characters special to the shell. +.TP +.B \-i +enter interactive mode after +.I script +is executed. +.TP +.BI \-l " name" +call +.BI require(' name ') +before executing +.IR script . +Typically used to load libraries. +.TP +.B \-v +show version information. +.SH "SEE ALSO" +.BR luac (1) +.br +http://www.lua.org/ +.SH DIAGNOSTICS +Error messages should be self explanatory. +.SH AUTHORS +R. Ierusalimschy, +L. H. de Figueiredo, +and +W. Celes +.\" EOF diff --git a/ref/lua-5.1/doc/lua.css b/ref/lua-5.1/doc/lua.css new file mode 100644 index 0000000..90f6231 --- /dev/null +++ b/ref/lua-5.1/doc/lua.css @@ -0,0 +1,15 @@ +body { + color: #000000 ; + background-color: #FFFFFF ; + font-family: sans-serif ; +} + +a:link { + color: #000080 ; +} + +a:link:hover, a:visited:hover { + color: #000080 ; + background-color: #E0E0FF ; +} + diff --git a/ref/lua-5.1/doc/lua.html b/ref/lua-5.1/doc/lua.html new file mode 100644 index 0000000..1d435ab --- /dev/null +++ b/ref/lua-5.1/doc/lua.html @@ -0,0 +1,172 @@ + + + +LUA man page + + + + + +

    NAME

    +lua - Lua interpreter +

    SYNOPSIS

    +lua +[ +options +] +[ +script +[ +args +] +] +

    DESCRIPTION

    +lua +is the stand-alone Lua interpreter. +It loads and executes Lua programs, +either in textual source form or +in precompiled binary form. +(Precompiled binaries are output by +luac, +the Lua compiler.) +lua +can be used as a batch interpreter and also interactively. +

    +The given +options +(see below) +are executed and then +the Lua program in file +script +is loaded and executed. +The given +args +are available to +script +as strings in a global table named +arg. +If these arguments contain spaces or other characters special to the shell, +then they should be quoted +(but note that the quotes will be removed by the shell). +The arguments in +arg +start at 0, +which contains the string +'script'. +The index of the last argument is stored in +arg.n. +The arguments given in the command line before +script, +including the name of the interpreter, +are available in negative indices in +arg. +

    +At the very start, +before even handling the command line, +lua +executes the contents of the environment variable +LUA_INIT, +if it is defined. +If the value of +LUA_INIT +is of the form +'@filename', +then +filename +is executed. +Otherwise, the string is assumed to be a Lua statement and is executed. +

    +Options start with +'-' +and are described below. +You can use +'--' +to signal the end of options. +

    +If no arguments are given, +then +"-v -i" +is assumed when the standard input is a terminal; +otherwise, +"-" +is assumed. +

    +In interactive mode, +lua +prompts the user, +reads lines from the standard input, +and executes them as they are read. +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. +So, one way to interrupt the reading of an incomplete statement is +to force a syntax error: +adding a +';' +in the middle of a statement is a sure way of forcing a syntax error +(except inside multiline strings and comments; these must be closed explicitly). +If a line starts with +'=', +then +lua +displays the values of all the expressions in the remainder of the +line. The expressions must be separated by commas. +The primary prompt is the value of the global variable +_PROMPT, +if this value is a string; +otherwise, the default prompt is used. +Similarly, the secondary prompt is the value of the global variable +_PROMPT2. +So, +to change the prompts, +set the corresponding variable to a string of your choice. +You can do that after calling the interpreter +or on the command line +(but in this case you have to be careful with quotes +if the prompt string contains a space; otherwise you may confuse the shell.) +The default prompts are "> " and ">> ". +

    OPTIONS

    +

    +- +load and execute the standard input as a file, +that is, +not interactively, +even when the standard input is a terminal. +

    +-e stat +execute statement +stat. +You need to quote +stat +if it contains spaces, quotes, +or other characters special to the shell. +

    +-i +enter interactive mode after +script +is executed. +

    +-l name +call +require('name') +before executing +script. +Typically used to load libraries. +

    +-v +show version information. +

    SEE ALSO

    +luac(1) +
    +http://www.lua.org/ +

    DIAGNOSTICS

    +Error messages should be self explanatory. +

    AUTHORS

    +R. Ierusalimschy, +L. H. de Figueiredo, +and +W. Celes + + + diff --git a/ref/lua-5.1/doc/luac.1 b/ref/lua-5.1/doc/luac.1 new file mode 100644 index 0000000..d814678 --- /dev/null +++ b/ref/lua-5.1/doc/luac.1 @@ -0,0 +1,136 @@ +.\" $Id: luac.man,v 1.28 2006/01/06 16:03:34 lhf Exp $ +.TH LUAC 1 "$Date: 2006/01/06 16:03:34 $" +.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 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. +.LP +Pre-compiling 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. +.LP +Pre-compiled chunks are not necessarily smaller than the corresponding source. +The main goal in pre-compiling is faster loading. +.LP +The binary files created by +.B luac +are portable only among architectures with the same word size and byte order. +.LP +.B luac +produces a single output file containing the bytecodes +for all source files given. +By default, +the output file is named +.BR luac.out , +but you can change this with the +.B \-o +option. +.LP +In the command line, +you can mix +text files containing Lua source and +binary files containing precompiled chunks. +This is useful to combine several precompiled chunks, +even from different (but compatible) platforms, +into a single precompiled chunk. +.LP +You can use +.B "'\-'" +to indicate the standard input as a source file +and +.B "'\--'" +to signal the end of options +(that is, +all remaining arguments will be treated as files even if they start with +.BR "'\-'" ). +.LP +The internal format of the binary files produced by +.B luac +is likely to change when a new version of Lua is released. +So, +save the source files of all Lua programs that you precompile. +.LP +.SH OPTIONS +Options must be separate. +.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. +.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 a source file 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. +Lua always performs a thorough integrity test on precompiled chunks. +Bytecode that passes this test is completely safe, +in the sense that it will not break the interpreter. +However, +there is no guarantee that such code does anything sensible. +(None can be given, because the halting problem is unsolvable.) +If no files are given, then +.B luac +loads +.B luac.out +and tests its contents. +No messages are displayed if the file passes the integrity test. +.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. +For instance, +line numbers and names of local variables are lost. +.TP +.B \-v +show version information. +.SH FILES +.TP 15 +.B luac.out +default output file +.SH "SEE ALSO" +.BR lua (1) +.br +http://www.lua.org/ +.SH DIAGNOSTICS +Error messages should be self explanatory. +.SH AUTHORS +L. H. de Figueiredo, +R. Ierusalimschy and +W. Celes +.\" EOF diff --git a/ref/lua-5.1/doc/luac.html b/ref/lua-5.1/doc/luac.html new file mode 100644 index 0000000..179ffe8 --- /dev/null +++ b/ref/lua-5.1/doc/luac.html @@ -0,0 +1,145 @@ + + + +LUAC man page + + + + + +

    NAME

    +luac - Lua compiler +

    SYNOPSIS

    +luac +[ +options +] [ +filenames +] +

    DESCRIPTION

    +luac +is the Lua compiler. +It translates programs written in the Lua programming language +into binary files that can be later loaded and executed. +

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

    +The binary files created by +luac +are portable only among architectures with the same word size and byte order. +

    +luac +produces a single output file containing the bytecodes +for all source files given. +By default, +the output file is named +luac.out, +but you can change this with the +-o +option. +

    +In the command line, +you can mix +text files containing Lua source and +binary files containing precompiled chunks. +This is useful because several precompiled chunks, +even from different (but compatible) platforms, +can be combined into a single precompiled chunk. +

    +You can use +'-' +to indicate the standard input as a source file +and +'--' +to signal the end of options +(that is, +all remaining arguments will be treated as files even if they start with +'-'). +

    +The internal format of the binary files produced by +luac +is likely to change when a new version of Lua is released. +So, +save the source files of all Lua programs that you precompile. +

    +

    OPTIONS

    +Options must be separate. +

    +-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 +luac +loads +luac.out +and lists its contents. +

    +-o file +output to +file, +instead of the default +luac.out. +(You can use +'-' +for standard output, +but not on platforms that open standard output in text mode.) +The output file may be a source file because +all files are loaded before the output file is written. +Be careful not to overwrite precious files. +

    +-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. +Lua always performs a thorough integrity test on precompiled chunks. +Bytecode that passes this test is completely safe, +in the sense that it will not break the interpreter. +However, +there is no guarantee that such code does anything sensible. +(None can be given, because the halting problem is unsolvable.) +If no files are given, then +luac +loads +luac.out +and tests its contents. +No messages are displayed if the file passes the integrity test. +

    +-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. +For instance, +line numbers and names of local variables are lost. +

    +-v +show version information. +

    FILES

    +

    +luac.out +default output file +

    SEE ALSO

    +lua(1) +
    +http://www.lua.org/ +

    DIAGNOSTICS

    +Error messages should be self explanatory. +

    AUTHORS

    +L. H. de Figueiredo, +R. Ierusalimschy and +W. Celes + + + diff --git a/ref/lua-5.1/doc/manual.html b/ref/lua-5.1/doc/manual.html new file mode 100644 index 0000000..a44d2e8 --- /dev/null +++ b/ref/lua-5.1/doc/manual.html @@ -0,0 +1,6247 @@ + + + + +Lua 5.1 Reference Manual + + + + + +
    +

    +[Lua logo] +Lua 5.1 Reference Manual +

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

    + +Copyright +© 2006 Lua.org, PUC-Rio. All rights reserved. + +

    + +

    +

    + + + +

    1 - Introduction

    + +

    Lua is an extension programming language designed to support +general procedural programming with data description +facilities. +It also offers good support for object-oriented programming, +functional programming, and data-driven programming. +Lua is intended to be used as a powerful, light-weight +scripting language for any program that needs one. +Lua is implemented as a library, written in clean C +(that is, in the common subset of ANSI C and C++). + +

    Being an extension language, Lua has no notion of a "main" program: +it only works embedded in a host client, +called the embedding program or simply the host. +This 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. +The Lua distribution includes a sample host program called lua, +which uses the Lua library to offer a complete, stand-alone Lua interpreter. + +

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

    The 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 in italics, +keywords are shown in bold, +and other terminal symbols are shown in typewriter font, +enclosed in single quotes. +The complete syntax of Lua can be found at the end of this manual. + +

    2.1 - Lexical Conventions

    + +

    Names +(also called identifiers) +in Lua can be any string of letters, +digits, and underscores, +not beginning with a digit. +This coincides with the definition of names in most languages. +(The definition of letter depends on the current locale: +any character considered alphabetic by the current locale +can be used in an identifier.) +Identifiers are used to name variables and table fields. + +

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

    +       and       break     do        else      elseif
+       end       false     for       function  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, names starting with an underscore followed by +uppercase letters (such as _VERSION) +are reserved for internal global variables used by Lua. + +

    The following strings denote other tokens: +

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

    Literal strings +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) +
    • \' --- apostrophe (single quote) +
    +Moreover, a `\newline´ +(that is, a backslash followed by a real newline) +results in a newline in the string. +A character in a string may also be specified by its numerical value +using the escape sequence `\ddd´, +where ddd is a sequence of up to three decimal digits. +(Note that if a numerical escape is to be followed by a digit, +it must be expressed using exactly three digits.) +Strings in Lua may contain any 8-bit value, including embedded zeros, +which can be specified as `\0´. + +

    To put a double (single) quote, a newline, a backslash, +or an embedded zero +inside a literal string enclosed by double (single) quotes +you must use an escape sequence. +Any other character may be directly inserted into the literal. +(Some control characters may cause problems for the file system, +but Lua has no problem with them.) + +

    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 string starts with an opening long bracket of any level and +ends at the first closing long bracket of the same level. +Literals in this bracketed form may run for several lines, +do not interpret any escape sequences, +and ignore long brackets of any other level. +They may contain anything except a closing bracket of the proper level +or embedded zeros. + +

    For convenience, +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 four literals below denote the same string: +

    +      (1)   'alo\n123"'
+      (2)   "alo\n123\""
+      (3)   '\97lo\10\04923"'
+      (4)   [[alo
+            123"]]
+      (5)   [==[
+            alo
+            123"]==]
+
    + +

    Numerical constants may be written with an optional decimal part +and an optional decimal exponent. +Lua also accepts integer hexadecimal constants, +by prefixing them with 0x. +Examples of valid numerical constants are +

    +       3       3.0     3.1416  314.16e-2   0.31416E1  0xff  0x56
+
    + +

    Comments start 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. +Long comments are frequently used to disable code temporarily. + +

    2.2 - 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. +Nil is the type of the value nil, +whose main property is to be different from any other value; +it usually represents the absence of a useful value. +Boolean is the type of the values false and true. +Both nil and false make a condition false; +any other value makes it true. +Number represents real (double-precision floating-point) numbers. +(It is easy to build Lua interpreters that use other +internal representations for numbers, +such as single-precision float or long integers. +See file luaconf.h.) +String represents arrays of characters. + +Lua is 8-bit clean: +Strings may contain any 8-bit character, +including embedded zeros (`\0´) (see 2.1). + +

    Lua can call (and manipulate) functions written in Lua and +functions written in C +(see 2.5.8). + +

    The type userdata is provided to allow arbitrary C data to +be stored in Lua variables. +This type corresponds to a block of raw memory +and has no pre-defined operations in Lua, +except assignment and identity test. +However, by using metatables, +the programmer can define operations for userdata values +(see 2.8). +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. + +

    The type thread represents independent threads of execution +and it is used to implement coroutines (see 2.11). +Do not confuse Lua threads with operating-system threads. +Lua supports coroutines on all systems, +even those that do not support threads. + +

    The type table implements associative arrays, +that is, arrays that can be indexed not only with numbers, +but with any value (except nil). +Tables can be heterogeneous; +that is, they can contain values of all types (except nil). +Tables are the sole data structuring mechanism in Lua; +they may be used to represent ordinary arrays, +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 2.5.7). + +

    Like indices, +the value of a table field can be of any type (except nil). +In particular, +because functions are first-class values, +table fields may contain functions. +Thus tables may also carry methods (see 2.5.9). + +

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

    2.2.1 - Coercion

    + +

    Lua provides automatic conversion between +string and number values at run time. +Any arithmetic operation applied to a string tries to convert +this string to a number, following the usual conversion rules. +Conversely, whenever a number is used where a string is expected, +the number is converted to a string, in a reasonable format. +For complete control over how numbers are converted to strings, +use the format function from the string library +(see string.format). + +

    2.3 - 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, as defined in (see 2.1). + +

    Variables are assumed to be global unless explicitly declared local +(see 2.4.7). +Local variables are lexically scoped: +Local variables can be freely accessed by functions +defined inside their scope (see 2.6). + +

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

    Square brackets are used to index a table: +

    +	var ::= prefixexp `[´ exp `]´
+
    +The first expression (prefixexp) should result in a table value; +the second expression (exp) +identifies a specific entry in this table. +The expression denoting the table to be indexed has a restricted syntax; +see 2.5 for details. + +

    The syntax var.Name is just syntactic sugar for +var["Name"] and is used to denote table fields: +

    +	var ::= prefixexp `.´ Name
+
    + +

    The meaning of accesses to global variables +and table fields can be changed via metatables. +An access to an indexed variable t[i] is equivalent to +a call gettable_event(t,i). +(See 2.8 for a complete description of the +gettable_event function. +This function is not defined or callable in Lua. +We use it here only for explanatory purposes.) + +

    All global variables live as fields in ordinary Lua tables, +called environment tables or simply +environments (see 2.9). +Each function has its own reference to an environment, +so that all global variables in this function +will refer to this environment table. +When a function is created, +it inherits the environment from the function that created it. +To get the environment table of a Lua function, +you call getfenv. +To replace it, +you call setfenv. +(You can only manipulate the environment of C functions +through the debug library; (see 5.9).) + +

    An access to a global variable x +is equivalent to _env.x, +which in turn is equivalent to +

    +       gettable_event(_env, "x")
+
    +where _env is the environment of the running function. +(See 2.8 for a complete description of the +gettable_event function. +This function is not defined or callable in Lua. +Similarly, the _env variable is not defined in Lua. +We use them here only for explanatory purposes.) + +

    2.4 - Statements

    + +

    Lua supports an almost conventional set of statements, +similar to those in Pascal or C. +This set includes +assignment, control structures, function calls, +table constructors, and variable declarations. + +

    2.4.1 - Chunks

    + +

    The unit of execution of Lua is called a chunk. +A chunk is simply a sequence of statements, +which are executed sequentially. +Each statement can be optionally followed by a semicolon: +

    +	chunk ::= {stat [`;´]}
+
    +There are no empty statements and thus `;;´ is not legal. + +

    Lua handles a chunk as the body of an anonymous function +with a variable number of arguments +(see 2.5.9). +As such, chunks can define local variables, +receive arguments, and return values. + +

    A chunk may be stored in a file or in a string inside the host program. +When a chunk is executed, first it is pre-compiled into instructions for +a virtual machine, +and then the compiled code is executed +by an interpreter for the virtual machine. + +

    Chunks may also be pre-compiled into binary form; +see program luac for details. +Programs in source and compiled forms are interchangeable; +Lua automatically detects the file type and acts accordingly. + + +

    2.4.2 - Blocks

    +A block is a list of statements; +syntactically, a block is the same as a chunk: +
    +	block ::= chunk
+
    + +

    A block may 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 or break statement in the middle +of another block (see 2.4.4). + + +

    2.4.3 - Assignment

    + +

    Lua allows multiple assignment. +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 ::= varlist1 `=´ explist1
+	varlist1 ::= var {`,´ var}
+	explist1 ::= exp {`,´ exp}
+
    +Expressions are discussed in 2.5. + +

    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 as many nil's as needed. +If the list of expressions ends with a function call, +then all values returned by this call enter in the list of values, +before the adjustment +(except when the call is enclosed in parentheses; see 2.5). + +

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

    +       i = 3
+       i, a[i] = i+1, 20
+
    +sets a[3] to 20, without affecting a[4] +because the i in a[i] is evaluated (to 3) +before it is assigned 4. +Similarly, the line +
    +       x, y = y, x
+
    +exchanges the values of x and y. + +

    The meaning of assignments to global variables +and table fields can be changed via metatables. +An assignment to an indexed variable t[i] = val is equivalent to +settable_event(t,i,val). +(See 2.8 for a complete description of the +settable_event function. +This function is not defined or callable in Lua. +We use it here only for explanatory purposes.) + +

    An assignment to a global variable x = val +is equivalent to the assignment +_env.x = val, +which in turn is equivalent to +

    +       settable_event(_env, "x", val)
+
    +where _env is the environment of the running function. +(The _env variable is not defined in Lua. +We use it here only for explanatory purposes.) + +

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

    The condition expression of a +control structure may return any value. +Both false and nil are considered false. +All values different from nil and false are considered true +(in particular, the number 0 and the empty string are also 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 return statement is used to return values +from a function or a chunk (which is just a function). + +Functions and chunks may return more than one value, +so the syntax for the return statement is +

    +	stat ::= return [explist1]
+
    + +

    The break statement is used to terminate 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 and break +statements can only be written as the last statement of a block. +If it is really necessary to return or break in the +middle of a block, +then an explicit inner block can be used, +as in the idioms +`do return end´ and +`do break end´, +because now return and break are the last statements in +their (inner) blocks. + +

    2.4.5 - For Statement

    + +

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

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

    +	stat ::= for Name `=´ exp `,´ exp [`,´ exp] do block end
+
    +The block is repeated for name starting at the value of +the first exp, until it passes the second exp by steps of the +third exp. +More precisely, a for statement like +
    +       for var = e1, e2, e3 do block end
+
    +is equivalent to the code: +
    +       do
+         local _var, _limit, _step = tonumber(e1), tonumber(e2), tonumber(e3)
+         if not (_var and _limit and _step) then error() end
+         while (_step>0 and _var<=_limit) or (_step<=0 and _var>=_limit) do
+           local var = _var
+           block
+           _var = _var + _step
+         end
+       end
+
    +Note the following: +
      +
    • All three control expressions are evaluated only once, +before the loop starts. +They must all result in numbers. +
    • _var, _limit, and _step are invisible variables. +The names are here for explanatory purposes only. +
    • If the third expression (the step) is absent, +then a step of 1 is used. +
    • You can use break to exit a for loop. +
    • The loop variable var is local to the loop; +you cannot use its value after the for ends or is broken. +If you need the value of the loop variable var, +then assign it to another variable before breaking or exiting the 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 explist1 do block end
+	namelist ::= Name {`,´ Name}
+
    +A for statement like +
    +       for var_1, ..., var_n in explist do block end
+
    +is equivalent to the code: +
    +       do
+         local _f, _s, _var = explist
+         while true do
+           local var_1, ... , var_n = _f(_s, _var)
+           _var = var_1
+           if _var == nil then break end
+           block
+         end
+       end
+
    +Note the following: +
      +
    • explist is evaluated only once. +Its results are an iterator function, +a state, and an initial value for the first iterator variable. +
    • _f, _s, and _var are invisible variables. +The names are here for explanatory purposes only. +
    • You can use break to exit a for loop. +
    • The loop variables var_i are local to the loop; +you cannot use their values after the for ends. +If you need these values, +then assign them to other variables before breaking or exiting the loop. +
    + +

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

    2.4.7 - Local Declarations

    +Local variables may be declared anywhere inside a block. +The declaration may include an initial assignment: +
    +	stat ::= local namelist [`=´ explist1]
+
    +If present, an initial assignment has the same semantics +of a multiple assignment (see 2.4.3). +Otherwise, all variables are initialized with nil. + +

    A chunk is also a block (see 2.4.1), +and so local variables can be declared in a chunk outside any explicit block. +The scope of such local variables extends until the end of the chunk. + +

    The visibility rules for local variables are explained in 2.6. + +

    2.5 - Expressions

    + +

    +The basic expressions in Lua are the following: +

    +	exp ::= prefixexp
+	exp ::= nil  |  false  |  true
+	exp ::= Number
+	exp ::= String
+	exp ::= function
+	exp ::= tableconstructor
+	exp ::= `...´
+	exp ::= exp binop exp
+	exp ::= unop exp
+	prefixexp ::= var  |  functioncall  |  `(´ exp `)´
+
    + +

    Numbers and literal strings are explained in 2.1; +variables are explained in 2.3; +function definitions are explained in 2.5.9; +function calls are explained in 2.5.8; +table constructors are explained in 2.5.7. +Vararg expressions, +denoted by three dots (`...´), can only be used inside +vararg functions; +they are explained in 2.5.9. + + +

    Binary operators comprise arithmetic operators (see 2.5.1), +relational operators (see 2.5.2), and logical operators (see 2.5.3). +Unary operators comprise the unary minus (see 2.5.1), +the unary not (see 2.5.3), +and the unary length operator (see 2.5.5). + +

    Both function calls and vararg expressions may result in multiple values. +If the expression is used as a statement (see 2.4.6) +(only possible for function calls), +then its return list is adjusted to zero elements, +thus discarding all returned values. +If the expression is used inside another expression +or in the middle of a list of expressions, +then its result list is adjusted to one element, +thus discarding all values except the first one. +If the expression is used as the last element of a list of expressions, +then no adjustment is made, +unless the call is enclosed in parentheses. + +

    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 values returned by f()
+       a,b,c = f(), x     -- f() is adjusted to 1 result (c gets nil)
+       a,b = ...          -- a gets the first vararg parameter, b gets
+                          -- the second (both a and b may get nil if there is
+                          -- no corresponding vararg parameter)
+       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 values returned by f()
+       return ...         -- returns all received vararg parameters
+       return x,y,f()     -- returns x, y, and all values returned by f()
+       {f()}              -- creates a list with all values returned by f()
+       {...}              -- creates a list with all vararg parameters
+       {f(), nil}         -- f() is adjusted to 1 result
+
    + +

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

    2.5.1 - Arithmetic Operators

    +Lua supports the usual arithmetic operators: +the binary + (addition), +- (subtraction), * (multiplication), +/ (division), % (modulo), and ^ (exponentiation); +and unary - (negation). +If the operands are numbers, or strings that can be converted to +numbers (see 2.2.1), +then all operations have the usual meaning. +Exponentiation works for any exponent. +For instance, x^(-0.5) computes the inverse of the square root of x. +Modulus is defined as +
    +       a % b == a - math.floor(a/b)*b
+
    +That is, it is the remainder of a division that rounds +the quotient towards minus infinity. + +

    2.5.2 - Relational Operators

    +The relational operators in Lua are +
    +       ==    ~=    <     >     <=    >=
+
    +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. +Numbers and strings are compared in the usual way. +Objects (tables, userdata, threads, and functions) +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, userdata, thread, or function), +this new object is different from any previously existing object. + +

    You can change the way that Lua compares tables and userdata +by using the "eq" metamethod (see 2.8). + +

    The conversion rules of 2.2.1 +do not apply to equality comparisons. +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 as such. +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.8). + +

    2.5.3 - Logical Operators

    +The logical operators in Lua are + +
    +       and   or    not
+
    +Like the control structures (see 2.4.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-cut 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
+
    +(In this manual, +`-->´ indicates the result of the preceding expression.) + +

    2.5.4 - Concatenation

    +The string concatenation operator in Lua is +denoted by two dots (`..´). +If both operands are strings or numbers, then they are converted to +strings according to the rules mentioned in 2.2.1. +Otherwise, the "concat" metamethod is called (see 2.8). + +

    2.5.5 - The Length Operator

    + +

    The length operator is denoted by the unary 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 of a table t is defined to be any +integer index n +such that t[n] is not nil and t[n+1] is nil; +moreover, if t[1] is nil, n may be zero. +For a regular array, with non-nil values from 1 to a given n, +its length is exactly that n, +the index of its last value. +If the array has "holes" +(that is, nil values between other non-nil values), +then #t may be any of the indices that +directly precedes a nil value +(that is, it may consider any such nil value as the end of +the array). + +

    2.5.6 - Precedence

    +Operator precedence in Lua follows the table below, +from lower to higher priority: +
    +       or
+       and
+       <     >     <=    >=    ~=    ==
+       ..
+       +     -
+       *     /     %
+       not   #     - (unary)
+       ^
+
    +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. + +

    2.5.7 - Table Constructors

    +Table constructors are expressions that create tables. +Every time a constructor is evaluated, a new table is created. +Constructors can be used to create empty tables, +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. +Finally, fields of the form exp are equivalent to +[i] = exp, where i are consecutive numerical 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
+
    + +

    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 2.5.8). +To avoid this, +enclose the function call (or the vararg expression) +in parentheses (see 2.5). + +

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

    2.5.8 - 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, the prefixexp "call" metamethod is called, +having as first parameter the value of prefixexp, +followed by the original call arguments +(see 2.8). + +

    The form +

    +	functioncall ::= prefixexp `:´ Name args
+
    +can be used to call "methods". +A call v:name(...) +is syntactic sugar for v.name(v,...), +except that v is evaluated only once. + +

    Arguments have the following syntax: +

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

    As an exception to the free-format syntax of Lua, +you cannot put a line break before the `(´ in a function call. +This restriction avoids some ambiguities in the language. +If you write +

    +       a = f
+       (g).x(a)
+
    +Lua would see that as a single statement, a = f(g).x(a). +So, if you want two statements, you must add a semi-colon between them. +If you actually want to call f, +you must remove the line break before (g). + +

    A call of the form return functioncall 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; +this syntax makes the calling function return exactly +the returns of the called function. +So, none of the following examples are tail calls: +

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

    2.5.9 - Function Definitions

    + +

    The syntax for function definition is +

    +	function ::= function funcbody
+	funcbody ::= `(´ [parlist1] `)´ 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 () ... end
+
    +translates to +
    +       f = function () ... end
+
    +The statement +
    +       function t.a.b.c.f () ... end
+
    +translates to +
    +       t.a.b.c.f = function () ... end
+
    +The statement +
    +       local function f () ... end
+
    +translates to +
    +       local f; f = function () ... end
+
    +not this: +
    +       local f = function () ... 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 pre-compiles a chunk, +all its function bodies are pre-compiled too. +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. +Different instances of the same function +may refer to different external local variables +and may have different environment tables. + +

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

    +	parlist1 ::= namelist [`,´ `...´]  |  `...´
+
    +When a function is called, +the list of arguments is adjusted to +the length of the list of parameters, +unless the function is a variadic or 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 the call 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 2.4.4). +If control reaches the end of a function +without encountering a return statement, +then the function returns with no results. + +

    The colon syntax +is used for defining methods, +that is, functions that have an implicit extra parameter self. +Thus, the statement +

    +       function t.a.b.c:f (...) ... end
+
    +is syntactic sugar for +
    +       t.a.b.c.f = function (self, ...) ... end
+
    + +

    2.6 - Visibility Rules

    + + +

    Lua is a lexically scoped language. +The scope of variables begins at the first statement after +their declaration and lasts until the end 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, +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. + +

    2.7 - Error Handling

    + +

    Because Lua is an embedded extension language, +all Lua actions start from C code in the host program +calling a function from the Lua library (see lua_pcall). +Whenever an error occurs during Lua compilation or execution, +control returns to C, +which can take appropriate measures +(such as printing an error message). + +

    Lua code can explicitly generate an error by calling the +error function. +If you need to catch errors in Lua, +you can use the pcall function. + +

    2.8 - Metatables

    + +

    Every value in Lua may have a metatable. +This metatable is an ordinary Lua table +that defines the behavior of the original value +under certain special operations. +You can change several aspects of the behavior +of operations over 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" in its metatable. +If it finds one, +Lua calls this function to perform the addition. + +

    We call the keys in a metatable events +and the values metamethods. +In the previous example, the event is "add" +and the metamethod is the function that performs the addition. + +

    You can query the metatable of any value +through the getmetatable function. + +

    You can replace the metatable of tables +through the setmetatable +function. +You cannot change the metatable of other types from Lua +(except using the debug library); +you must use the C API for that. + +

    Tables and userdata have individual metatables +(although multiple tables and userdata can share +a same table as their metatable); +values of all other types share one single metatable per type. +So, there is one single metatable for all numbers, +and for all strings, etc. + +

    A metatable may control how an object behaves in arithmetic operations, +order comparisons, concatenation, length operation, and indexing. +A metatable can also define a function to be called when a userdata +is garbage collected. +For each of these operations Lua associates a specific key +called an event. +When Lua performs one of these operations over a value, +it checks whether this value has a metatable with the corresponding event. +If so, the value associated with that key (the metamethod) +controls how Lua will perform the operation. + +

    Metatables control the operations listed next. +Each operation is identified by its corresponding name. +The key for each operation is a string with its name prefixed by +two underscores, `__´; +for instance, the key for operation "add" is the +string "__add". +The semantics of these operations is better explained by a Lua function +describing how the interpreter executes the operation. + +

    The code shown here in Lua is only illustrative; +the real behavior is hard coded in the interpreter +and it is much more efficient than this simulation. +All functions used in these descriptions +(rawget, tonumber, etc.) +are described in 5.1. +In particular, to retrieve the metamethod of a given object, +we use the expression +

    +       metatable(obj)[event]
+
    +This should be read as +
    +       rawget(getmetatable(obj) or {}, event)
+
    +That is, the access to a metamethod does not invoke other metamethods, +and the access to objects with no metatables does not fail +(it simply results in nil). + +

      +
    • "add": +the + operation. + +

      The function getbinhandler below defines how Lua chooses a handler +for a binary operation. +First, Lua tries the first operand. +If its type does not define a handler for the operation, +then Lua tries the second operand. +

      + function getbinhandler (op1, op2, event)
+   return metatable(op1)[event] or metatable(op2)[event]
+ end
+
      +Using this function, +the behavior of the op1 + op2 is +
      + function add_event (op1, op2)
+   local o1, o2 = tonumber(op1), tonumber(op2)
+   if o1 and o2 then  -- both operands are numeric?
+     return o1 + o2   -- `+' here is the primitive `add'
+   else  -- at least one of the operands is not numeric
+     local h = getbinhandler(op1, op2, "__add")
+     if h then
+       -- call the handler with both operands
+       return h(op1, op2)
+     else  -- no handler available: default behavior
+       error("...")
+     end
+   end
+ end
+
      + +

    • "sub": +the - operation. +Behavior similar to the "add" operation. + +

    • "mul": +the * operation. +Behavior similar to the "add" operation. + +

    • "div": +the / operation. +Behavior similar to the "add" operation. + +

    • "mod": +the % operation. +Behavior similar to the "add" operation, +with the operation +o1 - floor(o1/o2)*o2 as the primitive operation. + +

    • "pow": +the ^ (exponentiation) operation. +Behavior similar to the "add" operation, +with the function pow (from the C math library) +as the primitive operation. + +

    • "unm": +the unary - operation. +
      + function unm_event (op)
+   local o = tonumber(op)
+   if o then  -- operand is numeric?
+     return -o  -- `-' here is the primitive `unm'
+   else  -- the operand is not numeric.
+     -- Try to get a handler from the operand
+     local h = metatable(op).__unm
+     if h then
+       -- call the handler with the operand
+       return h(op)
+     else  -- no handler available: default behavior
+       error("...")
+     end
+   end
+ end
+
      + +

    • "concat": +the .. (concatenation) operation. +
      + function concat_event (op1, op2)
+   if (type(op1) == "string" or type(op1) == "number") and
+      (type(op2) == "string" or type(op2) == "number") then
+     return op1 .. op2  -- primitive string concatenation
+   else
+     local h = getbinhandler(op1, op2, "__concat")
+     if h then
+       return h(op1, op2)
+     else
+       error("...")
+     end
+   end
+ end
+
      + +

    • "len": +the # operation. +
      + function len_event (op)
+   if type(op) == "string" then
+     return strlen(op)         -- primitive string length
+   elseif type(op) == "table" then
+     return #op                -- primitive table length
+   else
+     local h = metatable(op).__len
+     if h then
+       -- call the handler with the operand
+       return h(op)
+     else  -- no handler available: default behavior
+       error("...")
+     end
+   end
+ end
+
      +See 2.5.5 for a description of the length of a table. + +

    • "eq": +the == operation. +The function getcomphandler defines how Lua chooses a metamethod +for comparison operators. +A metamethod only is selected when both objects +being compared have the same type +and the same metamethod for the selected operation. +
      + function getcomphandler (op1, op2, event)
+   if type(op1) ~= type(op2) then return nil end
+   local mm1 = metatable(op1)[event]
+   local mm2 = metatable(op2)[event]
+   if mm1 == mm2 then return mm1 else return nil end
+ end
+
      +The "eq" event is defined as follows: +
      + function eq_event (op1, op2)
+   if type(op1) ~= type(op2) then  -- different types?
+     return false   -- different objects
+   end
+   if op1 == op2 then   -- primitive equal?
+     return true   -- objects are equal
+   end
+   -- try metamethod
+   local h = getcomphandler(op1, op2, "__eq")
+   if h then
+     return h(op1, op2)
+   else
+     return false
+   end
+ end
+
      +a ~= b is equivalent to not (a == b). + +

    • "lt": +the < operation. +
      + function lt_event (op1, op2)
+   if type(op1) == "number" and type(op2) == "number" then
+     return op1 < op2   -- numeric comparison
+   elseif type(op1) == "string" and type(op2) == "string" then
+     return op1 < op2   -- lexicographic comparison
+   else
+     local h = getcomphandler(op1, op2, "__lt")
+     if h then
+       return h(op1, op2)
+     else
+       error("...");
+     end
+   end
+ end
+
      +a > b is equivalent to b < a. + +

    • "le": +the <= operation. +
      + function le_event (op1, op2)
+   if type(op1) == "number" and type(op2) == "number" then
+     return op1 <= op2   -- numeric comparison
+   elseif type(op1) == "string" and type(op2) == "string" then
+     return op1 <= op2   -- lexicographic comparison
+   else
+     local h = getcomphandler(op1, op2, "__le")
+     if h then
+       return h(op1, op2)
+     else
+       h = getcomphandler(op1, op2, "__lt")
+       if h then
+         return not h(op2, op1)
+       else
+         error("...");
+       end
+     end
+   end
+ end
+
      +a >= b is equivalent to b <= a. +Note that, in the absence of a "le" metamethod, +Lua tries the "lt", assuming that a <= b is +equivalent to not (b < a). + +

    • "index": +The indexing access table[key]. +
      + function gettable_event (table, key)
+   local h
+   if type(table) == "table" then
+     local v = rawget(table, key)
+     if v ~= nil then return v end
+     h = metatable(table).__index
+     if h == nil then return nil end
+   else
+     h = metatable(table).__index
+     if h == nil then
+       error("...");
+     end
+   end
+   if type(h) == "function" then
+     return h(table, key)      -- call the handler
+   else return h[key]          -- or repeat operation on it
+   end
+ end
+
      + +

    • "newindex": +The indexing assignment table[key] = value. +
      + function settable_event (table, key, value)
+   local h
+   if type(table) == "table" then
+     local v = rawget(table, key)
+     if v ~= nil then rawset(table, key, value); return end
+     h = metatable(table).__newindex
+     if h == nil then rawset(table, key, value); return end
+   else
+     h = metatable(table).__newindex
+     if h == nil then
+       error("...");
+     end
+   end
+   if type(h) == "function" then
+     return h(table, key,value)    -- call the handler
+   else h[key] = value             -- or repeat operation on it
+   end
+ end
+
      + +

    • "call": +called when Lua calls a value. +
      + function function_event (func, ...)
+   if type(func) == "function" then
+     return func(...)   -- primitive call
+   else
+     local h = metatable(func).__call
+     if h then
+       return h(func, ...)
+     else
+       error("...")
+     end
+   end
+ end
+
      + +

    + +

    2.9 - Environments

    + +

    Besides metatables, +objects of types thread, function, and userdata +have another table associated with them, +called their environment. +Like metatables, environments are regular tables and +multiple objects can share the same environment. + +

    Environments associated with userdata have no meaning for Lua. +It is only a feature for programmers to associate a table to +a userdata. + +

    Environments associated with threads are called +global environments. +They are used as the default environment for threads and +non-nested functions created by the thread +(through loadfile, loadstring or load) +and can be directly accessed by C code (see 3.3). + +

    Environments associated with C functions can be directly +accessed by C code (see 3.3). +They are used as the default environment for other C functions +created by the function. + +

    Environments associated with Lua functions are used to resolve +all accesses to global variables within the function (see 2.3). +They are used as the default environment for other Lua functions +created by the function. + +

    You can change the environment of a Lua function or the +running thread by calling setfenv. +You can get the environment of a Lua function or the running thread +by calling getfenv. +To manipulate the environment of other objects +(userdata, C functions, other threads) you must +use the C API. + +

    2.10 - Garbage Collection

    + +

    Lua performs automatic memory management. +This means that +you have to worry neither about allocating memory for new objects +nor about freeing it when the objects are no longer needed. +Lua manages memory automatically by running +a garbage collector from time to time +to collect all dead objects +(that is, these objects that are no longer accessible from Lua). +All objects in Lua are subject to automatic management: +tables, userdata, functions, threads, and strings. + +

    Lua implements an incremental mark-and-sweep collector. +It uses two numbers to control its garbage-collection cycles: +the garbage-collector pause and +the garbage-collector step multiplier. + +

    The garbage-collector pause +controls how long the collector waits before starting a new cycle. +Larger values make the collector less aggressive. +Values smaller than 1 mean the collector will not wait to +start a new cycle. +A value of 2 means that the collector waits for the total memory in use +to double before starting a new cycle. + +

    The step multiplier +controls the relative speed of the collector relative to +memory allocation. +Larger values make the collector more aggressive but also increases +the size of each incremental step. +Values smaller than 1 make the collector too slow and +may result in the collector never finishing a cycle. +The default, 2, means that the collector runs at "twice" +the speed of memory allocation. + +

    You can change these numbers by calling lua_gc in C +or collectgarbage in Lua. +Both get as arguments percentage points +(so an argument 100 means a real value of 1). +With these functions you can also control +the collector directly (e.g., stop and restart it). + +

    2.10.1 - Garbage-Collection Metamethods

    + +

    Using the C API, +you can set garbage-collector metamethods for userdata (see 2.8). +These metamethods are also called finalizers. +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). + +

    Garbage userdata with a field __gc in their metatables are not +collected immediately by the garbage collector. +Instead, Lua puts them in a list. +After the collection, +Lua does the equivalent of the following function +for each userdata in that list: +

    + function gc_event (udata)
+   local h = metatable(udata).__gc
+   if h then
+     h(udata)
+   end
+ end
+
    + +

    At the end of each garbage-collection cycle, +the finalizers for userdata are called in reverse +order of their creation, +among those collected in that cycle. +That is, the first finalizer to be called is the one associated +with the userdata created last in the program. + +

    2.10.2 - 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 this object. + +

    A weak table can have weak keys, weak values, or both. +A table with weak keys allows the collection of its keys, +but prevents the collection of its values. +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 value of the +__mode field of its metatable. +If the __mode field is a string containing the character `k´, +the keys in the table are weak. +If __mode contains `v´, +the values in the table are weak. + +

    After you use a table as a metatable, +you should not change the value of its field __mode. +Otherwise, the weak behavior of the tables controlled by this +metatable is undefined. + +

    2.11 - 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 with a call to 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 execution. + +

    When you first call coroutine.resume, +passing as its first argument +the thread returned by coroutine.create, +the coroutine starts its execution, +at the first line of its main function. +Extra arguments passed to coroutine.resume are passed on +to the coroutine main 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 the first case, coroutine.resume returns true, +plus any values returned by the coroutine main function. +In case of errors, coroutine.resume returns false +plus an error message. + +

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

    The coroutine.wrap function creates a coroutine, +just like coroutine.create, +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, +coroutine.wrap does not catch errors; +any error is propagated to the caller. + +

    As an example, +consider the next 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
+
    + +

    +

    3 - 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. +All such macros use each of its 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 a proper definition for the macro luai_apicheck, +in file luaconf.h. + +

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

    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 pushes 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); +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. +We say that an index is valid +if it lies between 1 and the stack top +(that is, if 1 <= abs(index) <= top). + + +

    3.2 - Stack Size

    + +

    When you interact with Lua API, +you are responsible for ensuring consistency. +In particular, +you are responsible for controlling stack overflow. +You can use the function lua_checkstack +to grow the stack size. + +

    Whenever Lua calls C, +it ensures that at least LUA_MINSTACK stack positions are available. +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. + +

    Most query functions accept as indices any value inside the +available stack space, that is, indices up to the maximum stack size +you have set through lua_checkstack. +Such indices are called acceptable indices. +More formally, we define an acceptable index +as follows: +

    +       (index < 0 && abs(index) <= top) || (index > 0 && index <= stackspace)
+
    +Note that 0 is never an acceptable index. + +

    3.3 - Pseudo-Indices

    + +

    Unless otherwise noted, +any function that accepts valid indices can also be called with +pseudo-indices, +which represent some Lua values that are accessible to C code +but which are not in the stack. +Pseudo-indices are used to access the thread environment, +the function environment, +the registry, +and the upvalues of a C function (see 3.4). + +

    The thread environment (where global variables live) is +always at pseudo-index LUA_GLOBALSINDEX. +The environment of the running C function is always +at pseudo-index LUA_ENVIRONINDEX. + +

    To access and change the value of global variables, +you can use regular table operations over an environment table. +For instance, to access the value of a global variable, do +

    +       lua_getfield(L, LUA_GLOBALSINDEX, varname);
+
    + +

    3.4 - C Closures

    + +

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

    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 value associated with a function is at position +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, +produces an acceptable (but invalid) index. + +

    3.5 - Registry

    + +

    Lua provides a registry, +a pre-defined table that can be used by any C code to +store whatever Lua value it needs to store. +This table is always located at pseudo-index +LUA_REGISTRYINDEX. +Any C library can store data into this table, +but it should take care to choose keys 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. + +

    The integer keys in the registry are used by the reference mechanism, +implemented by the auxiliary library, +and therefore should not be used for other purposes. + +

    3.6 - Error Handling in C

    + +

    Internally, Lua uses the C longjmp facility to handle errors. +(You can also choose to use exceptions if you use C++; +See file luaconf.h.) +When Lua faces any error +(such as memory allocation errors, type errors, syntax errors, +and runtime errors) +it raises an error; +that is, it does a long jump. +A protected environment uses setjmp +to set a recover point; +any error jumps to the most recent active recover point. + +

    Almost any function in the API may raise an error, +for instance due to a memory allocation error. +The following functions run in protected mode +(that is, they create a protected environment to run), +so they never raise an error: +lua_newstate, lua_close, lua_load, +lua_pcall, and lua_cpcall. + +

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

    3.7 - Functions and Types

    + +

    Here we list all functions and types from the C API in +alphabetical order. + +

    +

    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; +nsize, the new size of the block. +ptr is NULL if and only if osize is zero. +When nsize is zero, the allocator must return NULL; +if osize is not zero, +it should free the block pointed to by ptr. +When nsize is not zero, the allocator returns NULL +if and only if it cannot fill the request. +When nsize is not zero and osize is zero, +the allocator should behave like malloc. +When nsize and osize are not zero, +the allocator behaves like realloc. +Lua assumes that the allocator never fails when +osize >= nsize. + +

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

    +static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) {
+  (void)ud;     /* not used */
+  (void)osize;  /* not used */
+  if (nsize == 0) {
+    free(ptr);  /* ANSI requires that free(NULL) has no effect */
+    return NULL;
+  }
+  else
+    /* ANSI requires that realloc(NULL, size) == malloc(size) */
+    return realloc(ptr, nsize);
+}
+
    + +

    +

    lua_atpanic

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

    Sets a new panic function and returns the old one. + +

    If an error happens outside any protected environment, +Lua calls a panic function +and then calls exit(EXIT_FAILURE), +thus exiting the host application. +Your panic function may avoid this exit by +never returning (e.g., doing a long jump). + +

    The panic function can access the error message at the top of the stack. + +

    +

    lua_call

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

    Calls a function. + +

    To call a function you must use the following protocol: +First, the function to be called is pushed onto the stack; +then, the arguments to the function 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. +All arguments and the function value are popped from the stack +when the function is called. +The function results are pushed onto the stack when the function returns. +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. +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 inside the called function is propagated upwards +(with a longjmp). + +

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

    +       a = f("how", t.x, 14)
+
    +Here it is in C: +
    +    lua_getfield(L, LUA_GLOBALSINDEX, "f");          /* function to be called */
+    lua_pushstring(L, "how");                                 /* 1st argument */
+    lua_getfield(L, LUA_GLOBALSINDEX, "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 function with 3 arguments and 1 result */
+    lua_setfield(L, LUA_GLOBALSINDEX, "a");        /* set global variable `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_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 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 numerical arguments and returns their average and sum: +

    +       static int foo (lua_State *L) {
+         int n = lua_gettop(L);    /* number of arguments */
+         lua_Number sum = 0;
+         int i;
+         for (i = 1; i <= n; i++) {
+           if (!lua_isnumber(L, i)) {
+             lua_pushstring(L, "incorrect argument to function `average'");
+             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

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

    Ensures that there are at least extra free stack slots in the stack. +It returns false if it cannot grow the stack to that size. +This function never shrinks the stack; +if the stack is already larger than the new size, +it is left unchanged. + +

    +

    lua_close

    +
    +          void lua_close (lua_State *L);
+
    + + +

    Destroys 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, +such as a daemon or a web server, +might need to release states as soon as they are not needed, +to avoid growing too large. + +

    +

    lua_concat

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

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

    +

    lua_cpcall

    +
    +          int lua_cpcall (lua_State *L, lua_CFunction func, void *ud);
+
    + + +

    Calls the C function func in protected mode. +func starts with only one element in its stack, +a light userdata containing ud. +In case of errors, +lua_cpcall returns the same error codes as lua_pcall, +plus the error object on the top of the stack; +otherwise, it returns zero, and does not change the stack. +All values returned by func are discarded. + +

    +

    lua_createtable

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

    Creates a new empty table and pushes it onto the stack. +The new table has space pre-allocated +for narr array elements and nrec non-array elements. +This pre-allocation is useful when you know exactly how many elements +the table will have. +Otherwise you can use the function lua_newtable. + +

    +

    lua_dump

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

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

    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_equal

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

    Returns 1 if the two values in acceptable indices index1 and +index2 are equal, +following the semantics of the Lua == operator +(that is, may call metamethods). +Otherwise returns 0. +Also returns 0 if any of the indices is non valid. + +

    +

    lua_error

    +
    +          int lua_error (lua_State *L);
+
    + + +

    Generates a Lua error. +The error message (which can actually be a Lua value of any type) +must be on the stack top. +This function does a long jump, +and therefore never returns. +(see luaL_error). + +

    +

    lua_gc

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

    Controls the garbage collector. + +

    This function performs several tasks, +according to the value of the parameter what: +

      +
    • LUA_GCSTOP--- stops the garbage collector. +
    • LUA_GCRESTART--- restarts the garbage collector. +
    • LUA_GCCOLLECT--- performs a full garbage-collection cycle. +
    • 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--- performs an incremental step of +garbage collection. +The step "size" is controlled by data +(larger values mean more steps) in a non-specified way. +If you want to control the step size +you must tune experimentally the value of data. +The function returns 1 if the step finished a +garbage-collection cycle. +
    • LUA_GCSETPAUSE--- +sets data/100 as the new value +for the pause of the collector (see 2.10). +The function returns the previous value of the pause. +
    • LUA_GCSETSTEPMUL--- +sets arg/100 as the new value for the step multiplier of +the collector (see 2.10). +The function returns the previous value of the step multiplier. +
    + +

    +

    lua_getallocf

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

    Returns the memory allocator function of a given state. +If ud is not NULL, Lua stores in *ud the +opaque pointer passed to lua_newstate. + +

    +

    lua_getfenv

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

    Pushes on the stack the environment table of +the value at the given index. + +

    +

    lua_getfield

    +
    +          void 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 valid index index. +As in Lua, this function may trigger a metamethod +for the "index" event (see 2.8). + +

    +

    lua_getglobal

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

    Pushes onto the stack the value of the global name. +It is defined as a macro: +

    +#define lua_getglobal(L,s)  lua_getfield(L, LUA_GLOBALSINDEX, s)
+
    + +

    +

    lua_getmetatable

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

    Pushes onto the stack the metatable of the value at the given +acceptable index. +If the index is not valid, +or if the value does not have a metatable, +the function returns 0 and pushes nothing on the stack. + +

    +

    lua_gettable

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

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

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

    +

    lua_gettop

    +
    +          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 +(and so 0 means an empty stack). + +

    +

    lua_insert

    +
    +          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. +Cannot be called with a pseudo-index, +because a pseudo-index is not an actual stack position. + +

    +

    lua_Integer

    +
    +          typedef ptrdiff_t lua_Integer;
+
    + + +

    The type used by the Lua API to represent integral values. + +

    By default it is a ptrdiff_t, +which is usually the largest integral type the machine handles +"comfortably". + +

    +

    lua_isboolean

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

    Returns 1 if the value at the given acceptable index has type boolean, +and 0 otherwise. + +

    +

    lua_iscfunction

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

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

    +

    lua_isfunction

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

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

    +

    lua_islightuserdata

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

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

    +

    lua_isnil

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

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

    +

    lua_isnumber

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

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

    +

    lua_isstring

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

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

    +

    lua_istable

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

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

    +

    lua_isthread

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

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

    +

    lua_isuserdata

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

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

    +

    lua_lessthan

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

    Returns 1 if the value at acceptable index index1 is smaller +than the value at acceptable index index2, +following the semantics of the Lua < operator +(that is, may call metamethods). +Otherwise returns 0. +Also returns 0 if any of the indices is non valid. + +

    +

    lua_load

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

    Loads a Lua chunk. +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 return values of lua_load are: +

      +
    • 0 --- no errors; +
    • LUA_ERRSYNTAX --- +syntax error during pre-compilation. +
    • LUA_ERRMEM --- +memory allocation error. +
    + +

    lua_load automatically detects whether the chunk is text or binary, +and loads it accordingly (see program luac). + +

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

    +

    lua_newstate

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

    Creates a new, independent state. +Returns NULL if cannot create the state +(due to lack of memory). +The argument f is the allocator function; +Lua does all memory allocation for this state through this function. +The second argument, ud, is an opaque pointer that Lua +simply passes to the allocator in every call. + +

    +

    lua_newtable

    +
    +          void lua_newtable (lua_State *L);
+
    + + +

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

    +

    lua_newthread

    +
    +          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 state returned by this function shares with the original state +all global objects (such as tables), +but has an independent execution stack. + +

    There is no explicit function to close or to destroy a thread. +Threads are subject to garbage collection, +like any Lua object. + +

    +

    lua_newuserdata

    +
    +          void *lua_newuserdata (lua_State *L, size_t size);
+
    + + +

    This function allocates a new block of memory with the given size, +pushes on the stack a new full userdata with the block address, +and returns this address. + +

    Userdata represents C values in Lua. +A full userdata represents a block of memory. +It is an object (like a table): +You must create it, it can have its own metatable, +and you can detect when it is being collected. +A full userdata is only equal to itself (under raw equality). + +

    When Lua collects a full userdata with a gc metamethod, +Lua calls the metamethod and marks the userdata as finalized. +When this userdata is collected again then +Lua frees its corresponding memory. + +

    +

    lua_next

    +
    +          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 traversal looks like this: +

    +       /* table is in the stack at index `t' */
+       lua_pushnil(L);  /* first key */
+       while (lua_next(L, t) != 0) {
+         /* `key' is 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)));
+         lua_pop(L, 1);  /* removes `value'; keeps `key' for next iteration */
+       }
+
    + +

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

    +

    lua_Number

    +
    +          typedef double lua_Number;
+
    + + +

    The type of numbers in Lua. +By default, it is double, but that can be changed in luaconf.h. + +

    Through the configuration file you can change +Lua to operate with another type for numbers (e.g., float or long). + +

    +

    lua_objlen

    +
    +          size_t lua_objlen (lua_State *L, int index);
+
    + + +

    Returns the "length" of the value at the given acceptable index: +for strings, this is the string length; +for tables, this is the result of the length operator (`#´); +for userdata, this is the size of the block of memory allocated +for the userdata; +for other values, it is 0. + +

    +

    lua_pcall

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

    Calls a function 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 message), +and returns an error code. +Like lua_call, +lua_pcall always removes the function +and its arguments from the stack. + +

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

    Typically, the error handler function is used to add more debug +information to the error message, 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 0 in case of success +or one of the following error codes +(defined in lua.h): +

      +
    • LUA_ERRRUN --- a runtime error. +
    • LUA_ERRMEM --- memory allocation error. +For such errors, Lua does not call the error handler function. +
    • LUA_ERRERR --- +error while running the error handler function. +
    + +

    +

    lua_pop

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

    Pops n elements from the stack. + +

    +

    lua_pushboolean

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

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

    +

    lua_pushcclosure

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

    Pushes a new C closure onto the stack. + +

    When a C function is created, +it is possible to associate some values with it, +thus creating a C closure (see 3.4); +these values are then accessible to the function whenever it is called. +To associate values with a C function, +first these values should be pushed onto the stack +(when there are multiple values, 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 should be +associated with the function. +lua_pushcclosure also pops these values from the stack. + +

    +

    lua_pushcfunction

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

    Pushes a C function onto the stack. +This function receives a pointer to a C function +and pushes on the stack a Lua value of type function that, +when called, invokes the corresponding C function. + +

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

    The call lua_pushcfunction(L, f) is equivalent to +lua_pushcclosure(L, f, 0). + +

    +

    lua_pushfstring

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

    Pushes onto the stack a formatted string +and returns a pointer to this string. +It is similar to the C function sprintf, +but has some important differences: +

      +
    • 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). +
    • The conversion specifiers are quite restricted. +There are no flags, widths, or precisions. +The conversion specifiers can only be +`%%´ (inserts a `%´ in the string), +`%s´ (inserts a zero-terminated string, with no size restrictions), +`%f´ (inserts a lua_Number), +`%p´ (inserts a pointer as a hexadecimal numeral), +`%d´ (inserts an int), and +`%c´ (inserts an int as a character). +
    + +

    +

    lua_pushinteger

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

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

    +

    lua_pushlightuserdata

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

    Pushes a light userdata onto the stack. + +

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

    +

    lua_pushlstring

    +
    +          void 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 makes (or reuses) 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 embedded zeros. + +

    +

    lua_pushnil

    +
    +          void lua_pushnil (lua_State *L);
+
    + + +

    Pushes a nil value onto the stack. + +

    +

    lua_pushnumber

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

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

    +

    lua_pushstring

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

    Pushes the zero-terminated string pointed to by s +onto the stack. +Lua makes (or reuses) an internal copy of the given string, +so the memory at s can be freed or reused immediately after +the function returns. +The string cannot contain embedded zeros; +it is assumed to end at the first zero. + +

    +

    lua_pushthread

    +
    +          void lua_pushthread (lua_State *L);
+
    + + +

    Pushes the thread represented by L onto the stack. + +

    +

    lua_pushvalue

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

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

    +

    lua_pushvfstring

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

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

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

    +

    lua_rawget

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

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

    +

    lua_rawgeti

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

    Pushes onto the stack the value t[n], +where t is the value at the given valid index index. +The access is raw; +that is, it does not invoke metamethods. + +

    +

    lua_rawset

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

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

    +

    lua_rawseti

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

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

    This function pops the value from the stack. +The assignment is raw; +that is, it does not invoke metamethods. + +

    +

    lua_Reader

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

    The reader function used by lua_load. +Every time it needs another piece of the chunk, +lua_load 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. +The reader function may return pieces of any size greater than zero. + +

    +

    lua_register

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

    +
    +          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. +Cannot be called with a pseudo-index, +because a pseudo-index is not an actual stack position. + +

    +

    lua_replace

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

    Moves the top element into the given position (and pops it), +without shifting any element +(therefore replacing the value at the given position). + +

    +

    lua_resume

    +
    +          int lua_resume (lua_State *L, int narg);
+
    + + +

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

    To start a coroutine, you first create a new thread +(see lua_newthread); +then you push on its stack the main function plus any eventual arguments; +then you call lua_resume, +with narg being the number of arguments. +This call returns when the coroutine suspends or finishes its execution. +When it returns, the stack contains all values passed to lua_yield, +or all values returned by the body function. +lua_resume returns +LUA_YIELD if the coroutine yields, +0 if the coroutine finishes its execution +without errors, +or an error code in case of errors (see lua_pcall). +In case of errors, +the stack is not unwound, +so you can use the debug API over it. +The error message is on the top of the stack. +To restart a coroutine, you put on its stack only the values to +be passed as results from yield, +and then call lua_resume. + +

    +

    lua_setallocf

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

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

    Pops a table from the stack and sets it as +the new environment for the value at the given index. +If the value at the given index is +neither a function nor a thread nor a userdata, +lua_setfenv returns 0. +Otherwise it returns 1. + +

    +

    lua_setfield

    +
    +          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 valid index index +and v is the value at 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.8). + +

    +

    lua_setglobal

    +
    +          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. +It is defined as a macro: +

    +#define lua_setglobal(L,s)   lua_setfield(L, LUA_GLOBALSINDEX, s)
+
    + +

    +

    lua_setmetatable

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

    Pops a table from the stack and +sets it as the new metatable for the value at the given +acceptable index. + +

    +

    lua_settable

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

    Does the equivalent to t[k] = v, +where t is the value at the given valid index index, +v is the value at 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.8). + +

    +

    lua_settop

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

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

    +

    lua_State

    +
    +          typedef struct lua_State lua_State;
+
    + + +

    Opaque structure that keeps the whole state of a Lua interpreter. +The Lua library is fully reentrant: +it has no global variables. +All information about a state is kept in this structure. + +

    A pointer to this state 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

    +
    +          int lua_status (lua_State *L);
+
    + + +

    Returns the status of the thread L. + +

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

    +

    lua_toboolean

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

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

    +

    lua_tocfunction

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

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

    +

    lua_tointeger

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

    Converts the Lua value at the given acceptable index +to the signed integral type lua_Integer. +The Lua value must be a number or a string convertible to a number +(see 2.2.1); +otherwise, lua_tointeger returns 0. + +

    If the number is not an integer, +it is truncated in some non-specified way. + +

    +

    lua_tolstring

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

    Converts the Lua value at the given acceptable index to a string +(const char*). +If len is not NULL, +it also 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 fully aligned pointer +to a string inside the Lua state. +This string always has a zero (`\0´) +after its last character (as in C), +but may contain other zeros in its body. +Because Lua has garbage collection, +there is no guarantee that the pointer returned by lua_tolstring +will be valid after the corresponding value is removed from the stack. + +

    +

    lua_tonumber

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

    Converts the Lua value at the given acceptable index +to a number (see lua_Number). +The Lua value must be a number or a string convertible to a number +(see 2.2.1); +otherwise, lua_tonumber returns 0. + +

    +

    lua_topointer

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

    Converts the value at the given acceptable index to a generic +C pointer (void*). +The value may be a userdata, a table, a thread, or a function; +otherwise, lua_topointer returns NULL. +Lua ensures that different objects return different pointers. +There is no direct way to convert the pointer back to its original value. + +

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

    +

    lua_tostring

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

    Equivalent to lua_tolstring with len equal to NULL. + +

    +

    lua_tothread

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

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

    +

    lua_touserdata

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

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

    +

    lua_type

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

    Returns the type of the value in the given acceptable index, +or LUA_TNONE for a non-valid index +(that is, an index to an "empty" stack position). +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

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

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

    The writer function used by lua_dump. +Every time it produces another piece of chunk, +lua_dump calls the writer, +passing along the buffer to be written (p), +its size (sz), +and the data 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 global state. + +

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

    +

    lua_yield

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

    Yields a coroutine. + +

    This function should only be called as the +return expression of a C function, as follows: +

    +       return lua_yield (L, nresults);
+
    +When a C function calls lua_yield in that way, +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 are passed as results to lua_resume. + +

    +

    3.8 - 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) */
+            int currentline;            /* (l) */
+            int nups;                   /* (u) number of upvalues */
+            int linedefined;            /* (S) */
+            int lastlinedefined;        /* (S) */
+            char short_src[LUA_IDSIZE]; /* (S) */
+            /* private part */
+            ...
+          } lua_Debug;
+
+
    + + +

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

    The fields of lua_Debug have the following meaning: +

      +
    • source --- +If the function was defined in a string, +then source is that string. +If the function was defined in a file, +then source starts with a `@´ followed by the file name. + +

    • 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, +and "tail" if it was a function that did a tail call. +In the latter case, +Lua has no other information about the function. + +

    • 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 may be the value of multiple global variables, +while others may 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.) + +

    • nups --- +the number of upvalues of the function. + +

    + +

    +

    lua_gethook

    +
    +          lua_Hook lua_gethook (lua_State *L);
+
    + + +

    Returns the current hook function. + +

    +

    lua_gethookcount

    +
    +          int lua_gethookcount (lua_State *L);
+
    + + +

    Returns the current hook count. + +

    +

    lua_gethookmask

    +
    +          int lua_gethookmask (lua_State *L);
+
    + + +

    Returns the current hook mask. + +

    +

    lua_getinfo

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

    Fills the fields of lua_Debug with useful information. + +

    This function returns 0 on error +(for instance, an invalid option in what). +Each character in the string what +selects some fields of the structure ar to be filled, +as indicated by the letter in parentheses in the definition of lua_Debug: +`S´ fills in the fields source, linedefined, +lastlinedefined, +and what; +`l´ fills in the field currentline, etc. +Moreover, `f´ pushes onto the stack the function that is +running at the given level. + +

    To get information about a function that is not active +(that is, not in the stack), +you push it onto the stack +and start the what string with the character `>´. +For instance, to know in which line a function f was defined, +you can write the following code: +

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

    +

    lua_getlocal

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

    Gets information about a local variable of a given activation record. +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 +(1 is the first parameter or active local variable, and so on, +until the last active local variable). +lua_getlocal pushes the variable's value onto the stack +and returns its name. + +

    Variable names starting with `(´ (open parentheses) +represent internal variables +(loop control variables, temporaries, and C function locals). + +

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

    +

    lua_getstack

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

    Get 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. +When there are no errors, lua_getstack returns 1; +when called with a level greater than the stack depth, +it returns 0. + +

    +

    lua_getupvalue

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

    Gets information about a closure's upvalue. +(For Lua functions, +upvalues are the external local variables that the function uses, +and that are consequently included in its closure.) +lua_getupvalue gets the index n of an upvalue, +pushes the upvalue's value onto the stack, +and returns its name. +funcindex points to the closure in the stack. +(Upvalues have no particular order, +as they are active through the whole function. +So, they are numbered in an arbitrary order.) + +

    Returns NULL (and pushes nothing) +when the index is greater than the number of upvalues. +For C functions, this function uses the empty string "" +as a name for all 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_HOOKTAILRET, 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 return events, event may be LUA_HOOKRET, +the normal value, or LUA_HOOKTAILRET. +In the latter case, Lua is simulating a return from +a function that did a tail call; +in this case, it is useless to call lua_getinfo. + +

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

    +

    lua_sethook

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

    Sets the debugging hook function. + +

    func 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, +before the function gets its arguments. +
    • The return hook is called when the interpreter returns from a function. +The hook is called just before Lua leaves the function. +You have no access to the values to be returned by 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.) +
    + +

    A hook is disabled by setting mask to zero. + +

    +

    lua_setlocal

    +
    +          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. +Parameters ar and n are as in lua_getlocal +(see lua_getlocal). +lua_setlocal assigns the value at 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. + +

    +

    lua_setupvalue

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

    Sets the value of a closure's upvalue. +Parameters funcindex and n are as in lua_getupvalue +(see lua_getupvalue). +It assigns the value at 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 is greater than the number of upvalues. + +

    +

    4 - 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 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 this API. + +

    Several functions in the auxiliary library are used to +check C function arguments. +Their names are always luaL_check* or luaL_opt*. +All of these functions raise an error if the check is not satisfied. +Because the error message is formatted for arguments +(e.g., "bad argument #1"), +you should not use these functions for other stack values. + +

    4.1 - Functions and Types

    + +

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

    +

    luaL_addchar

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

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

    +

    luaL_addlstring

    +
    +          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 may contain embedded zeros. + +

    +

    luaL_addsize

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

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

    +

    luaL_addstring

    +
    +          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). +The string may not contain embedded zeros. + +

    +

    luaL_addvalue

    +
    +          void luaL_addvalue (luaL_Buffer *B);
+
    + + +

    Adds the value at 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

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

    Checks whether cond is true. +If not, raises an error with message +"bad argument #<numarg> to <func> (<extramsg>)", +where func is retrieved from the call stack. + +

    +

    luaL_argerror

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

    Raises an error with message +"bad argument #<numarg> to <func> (<extramsg>)", +where func is retrieved from the call stack. + +

    This function never returns, +but it is an idiom to use it as return luaL_argerror ... +in C functions. + +

    +

    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 you declare a variable b of type luaL_Buffer. +
    • Then you initialize it with a call luaL_buffinit(L, &b). +
    • Then you add string pieces to the buffer calling any of +the luaL_add* functions. +
    • You finish by calling luaL_pushresult(&b). +This call leaves the final string on the top of the stack. +
    + +

    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_buffinit

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

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

    +

    luaL_callmeta

    +
    +          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 and passes the object as its only argument. +In this case this function returns 1 and pushes on the +stack the value returned by the call. +If there is no metatable or no metamethod, +this function returns 0 (without pushing any value on the stack). + +

    +

    luaL_checkany

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

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

    +

    luaL_checkint

    +
    +          int luaL_checkint (lua_State *L, int narg);
+
    + + +

    Checks whether the function argument narg is a number +and returns this number cast to an int. + +

    +

    luaL_checkinteger

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

    Checks whether the function argument narg is a number +and returns this number cast to a lua_Integer. + +

    +

    luaL_checklong

    +
    +          long luaL_checklong (lua_State *L, int narg);
+
    + + +

    Checks whether the function argument narg is a number +and returns this number cast to a long. + +

    +

    luaL_checklstring

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

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

    +

    luaL_checknumber

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

    Checks whether the function argument narg is a number +and returns this number. + +

    +

    luaL_checkoption

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

    Checks whether the function argument narg is a string and +searches for this string in the array lst +(which must be NULL-terminated). +If def is not NULL, +uses def as a default value when +the function has no argument narg or if this argument is nil. + +

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

    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

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

    +

    luaL_checkstring

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

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

    +

    luaL_checktype

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

    Checks whether the function argument narg has type t. + +

    +

    luaL_checkudata

    +
    +          void *luaL_checkudata (lua_State *L, int narg, const char *tname);
+
    + + +

    Checks whether the function argument narg is a userdata +of the type tname (see luaL_newmetatable). + +

    +

    luaL_error

    +
    +          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 as return luaL_error ... +in C functions. + +

    +

    luaL_getmetafield

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

    Pushes on the stack the field e from the metatable +of the object at index obj. +If the object does not have a metatable, +or if the metatable does not have this field, +returns 0 and pushes nothing. + +

    +

    luaL_getmetatable

    +
    +          void luaL_getmetatable (lua_State *L, const char *tname);
+
    + + +

    Pushes on the stack the metatable associated with name tname +in the registry (see luaL_newmetatable). + +

    +

    luaL_gsub

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

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

    +

    luaL_loadbuffer

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

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

    +

    luaL_loadfile

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

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

    This function returns the same results as lua_load, +but it has an extra error code LUA_ERRFILE +if it cannot open/read the file. + +

    +

    luaL_loadstring

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

    +

    luaL_newmetatable

    +
    +          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 it to the registry with key tname, +and returns 1. + +

    In both cases pushes on the stack the final value associated +with tname in the registry. + +

    +

    luaL_newstate

    +
    +          lua_State *luaL_newstate (void);
+
    + + +

    Creates a new Lua state, calling lua_newstate with an +allocation function based on the standard C realloc function +and setting a panic function (see lua_atpanic) that prints +an error message to the standard error output in case of fatal +errors. + +

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

    +

    luaL_openlibs

    +
    +          void luaL_openlibs (lua_State *L);
+
    + + +

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

    +

    luaL_optint

    +
    +          int luaL_optint (lua_State *L, int narg, int d);
+
    + + +

    If the function argument narg is a number, +returns this number cast to an int. +If this argument is absent or is nil, +returns d. +Otherwise, raises an error. + +

    +

    luaL_optinteger

    +
    +          lua_Integer luaL_optinteger (lua_State *L, int narg, lua_Integer d);
+
    + + +

    If the function argument narg is a number, +returns this number cast to a lua_Integer. +If this argument is absent or is nil, +returns d. +Otherwise, raises an error. + +

    +

    luaL_optlong

    +
    +          long luaL_optlong (lua_State *L, int narg, long d);
+
    + + +

    If the function argument narg is a number, +returns this number cast to a long. +If this argument is absent or is nil, +returns d. +Otherwise, raises an error. + +

    +

    luaL_optlstring

    +
    +          const char *luaL_optlstring (lua_State *L, int narg,
+                                       const char *d, size_t *l);
+
    + + +

    If the function argument narg 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 the position *l with the results's length. + +

    +

    luaL_optnumber

    +
    +          lua_Number luaL_optnumber (lua_State *L, int narg, lua_Number d);
+
    + + +

    If the function argument narg is a number, +returns this number. +If this argument is absent or is nil, +returns d. +Otherwise, raises an error. + +

    +

    luaL_optstring

    +
    +          const char *luaL_optstring (lua_State *L, int narg, const char *d);
+
    + + +

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

    +

    luaL_prepbuffer

    +
    +          char *luaL_prepbuffer (luaL_Buffer *B);
+
    + + +

    Returns an address to a space of size LUAL_BUFFERSIZE +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_pushresult

    +
    +          void luaL_pushresult (luaL_Buffer *B);
+
    + + +

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

    +

    luaL_ref

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

    Creates and returns a reference, +in the table at index t, +for the object at 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 table t, +luaL_ref ensures the uniqueness of the key it returns. +You can retrieve an object referred by reference r +by calling lua_rawgeti(L, t, r). +Function luaL_unref frees a reference and its associated object. + +

    If the object at 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_register. +name is the function name and func is a pointer to +the function. +Any array of luaL_Reg must end with an sentinel entry +in which both name and func are NULL. + +

    +

    luaL_register

    +
    +          void luaL_register (lua_State *L, const char *libname,
+                              const luaL_Reg *l);
+
    + + +

    Opens a library. + +

    When called with libname equal to NULL, +simply registers all functions in the list l +(see luaL_Reg) into the table on the top of the stack. + +

    When called with a non-null libname, +creates a new table t, +sets it as the value of the global variable libname, +sets it as the value of package.loaded[libname], +and registers on it all functions in the list l. +If there is a table in package.loaded[libname] or in +variable libname, +reuses this table instead of creating a new one. + +

    In any case the function leaves the table +on the top of the stack. + +

    +

    luaL_typename

    +
    +          const char *luaL_typename (lua_State *L, int idx);
+
    + + +

    Returns the name of the type of the value at index idx. + +

    +

    luaL_typerror

    +
    +          int luaL_typerror (lua_State *L, int narg, const char *tname);
+
    + + +

    Generates an error with a message like +

    +<location>: bad argument <narg> to <function> (<tname> expected, got <realt>)
+
    +where <location> is produced by luaL_where, +<function> is the name of the current function, +and <realt> is the type name of the actual argument. + +

    +

    luaL_unref

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

    Releases 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

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

    Pushes on the stack a string identifying the current position +of the control at level lvl in the call stack. +Typically this string has the 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. + +

    +

    5 - Standard Libraries

    + +

    The standard Lua libraries provide useful functions +that are implemented directly 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 are quite useful or have critical performance requirements that +deserve an implementation in C (e.g., sort). + +

    All libraries are implemented through the official C API +and are provided as separate C modules. +Currently, Lua has the following standard libraries: +

      +
    • basic library; +
    • package library; +
    • string manipulation; +
    • table manipulation; +
    • mathematical functions (sin, log, etc.); +
    • input and output; +
    • operating system facilities; +
    • debug facilities. +
    +Except for the basic and 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 must call +luaL_openlibs, +which open all standard libraries. +Alternatively, +it can open them individually by calling +luaopen_base (for the basic library), +luaopen_package (for the package library), +luaopen_string (for the string library), +luaopen_table (for the table library), +luaopen_math (for the mathematical library), +luaopen_io (for the I/O and the Operating System libraries), +and luaopen_debug (for the debug library). +These functions are declared in lualib.h +and should not be called directly: +you must call them like any other Lua C function, +e.g., by using lua_call. + +

    5.1 - Basic Functions

    + +

    The basic library provides some 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])

    +Issues an error when +the value of its argument v is false (i.e., nil or false); +otherwise, returns all its arguments. +message is an error message; +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: +

      +
    • "stop" --- stops the garbage collector. +
    • "restart" --- restarts the garbage collector. +
    • "collect" --- performs a full garbage-collection cycle. +
    • "count" --- returns the total memory in use by Lua (in Kbytes). +
    • "step" --- performs a garbage-collection step. +The step "size" is controlled by arg +(larger values mean more steps) in a non-specified way. +If you want to control the step size +you must tune experimentally the value of arg. +Returns true if the step finished a collection cycle. +
    • "steppause" --- +sets arg/100 as the new value for the pause of +the collector (see 2.10). +
    • "setstepmul" --- +sets arg/100 as the new value for the step multiplier of +the collector (see 2.10). +
    + +

    dofile (filename)

    +Opens the named file and executes its contents as a Lua chunk. +When called without arguments, +dofile executes the contents 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])

    +Terminates the last protected function called +and returns message as the error message. +Function error never returns. + +

    Usually, error adds some information about the error position +at the beginning of the message. +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 (that is, _G._G = _G). +Lua itself does not use this variable; +changing its value does not affect any environment, +nor vice-versa. +(Use setfenv to change environments.) + +

    getfenv (f)

    +Returns the current environment in use by the function. +f can be a Lua function or a number +that specifies the function at that stack level: +Level 1 is the function calling getfenv. +If the given function is not a Lua function, +or if f is 0, +getfenv returns the global environment. +The default for f is 1. + +

    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 ... end
+
    +will iterate over the pairs (1,t[1]), (2,t[2]), ..., +up to the first integer key with a nil value in the table. + +

    See next for the caveats of modifying the table during its traversal. + +

    load (func [, chunkname])

    + +

    Loads a chunk using function func to get its pieces. +Each call to func must return a string that concatenates +with previous results. +A return of nil (or no value) signals the end of the chunk. + +

    If there are no errors, +returns the compiled chunk as a function; +otherwise, returns nil plus the error message. +The environment of the returned function is the global environment. + +

    chunkname is used as the chunk name for error messages +and debug information. + +

    loadfile ([filename])

    + +

    Similar to load, +but gets the chunk from file filename +or from the standard input, +if no file name is given. + +

    loadstring (string [, chunkname])

    + +

    Similar to load, +but gets the chunk from the given string. + +

    To load and run a given string, use the idiom +

    +      assert(loadstring(s))()
+
    + +

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

    Lua has no declaration of fields. +There is no difference between a +field not present in a table or a field with value nil. +Therefore, next only considers fields with non-nil values. +The order in which the indices are enumerated is not specified, +even for numeric indices. +(To traverse a table in numeric order, +use a numerical for or the ipairs function.) + +

    The behavior of next is undefined if, +during the traversal, +you assign any value to a non-existent field in the table. +You may however modify existing fields. +In particular, you may clear existing fields. + +

    pairs (t)

    + +

    Returns three values: the next function, the table t, and nil, +so that the construction +

    +       for k,v in pairs(t) do ... end
+
    +will iterate over all key--value pairs of table t. + +

    See next for the caveats of modifying the table during its traversal. + +

    pcall (f, arg1, arg2, ...)

    + +

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

    print (e1, e2, ...)

    +Receives any number of arguments, +and prints their values to stdout, +using the tostring function to convert them to strings. +print is not intended for formatted output, +but only as a quick way to show a value, +typically for debugging. +For formatted output, use string.format. + +

    rawequal (v1, v2)

    +Checks whether v1 is equal to v2, +without invoking any metamethod. +Returns a boolean. + +

    rawget (table, index)

    +Gets the real value of table[index], +without invoking any metamethod. +table must be a table and +index any value different from nil. + +

    rawset (table, index, value)

    +Sets the real value of table[index] to value, +without invoking any metamethod. +table must be a table, +index any value different from nil, +and value any Lua value. + +

    select (index, ...)

    + +

    If index is a number, +returns all arguments after argument number index. +Otherwise, index must be the string "#", +and select returns the total number of extra arguments it received. + +

    setfenv (f, table)

    + +

    Sets the environment to be used by the given function. +f can be a Lua function or a number +that specifies the function at that stack level: +Level 1 is the function calling setfenv. +setfenv returns the given function. + +

    As a special case, when f is 0 setfenv changes +the environment of the running thread. +In this case, setfenv returns no values. + +

    setmetatable (table, metatable)

    + +

    Sets the metatable for the given table. +(You cannot change the metatable of other types from Lua, only from C.) +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. + +

    tonumber (e [, base])

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

    An optional argument specifies the base to interpret the numeral. +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. +In base 10 (the default), the number may have a decimal part, +as well as an optional exponent part (see 2.1). +In other bases, only unsigned integers are accepted. + +

    tostring (e)

    +Receives an argument of any type and +converts it to a string in a reasonable format. +For complete control of how numbers are converted, +use string.format. + +

    If the metatable of e has a "__tostring" field, +then tostring calls the corresponding value +with e as argument, +and uses the result of the call as its result. + +

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

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

    +Returns the elements from the given table. +This function is equivalent to +
    +  return list[i], list[i+1], ..., list[j]
+
    +except that the above code can be written only for a fixed number +of elements. +By default, i is 1 and j is the length of the list, +as defined by the length operator (see 2.5.5). + +

    _VERSION

    +A global variable (not a function) that +holds a string containing the current interpreter version. +The current contents of this variable is "Lua 5.1". + +

    xpcall (f, err)

    + +

    This function is similar to pcall, +except that you can set a new error handler. + +

    xpcall calls function f in protected mode, +using err as the error handler. +Any error inside f is not propagated; +instead, xpcall catches the error, +calls the err function with the original error object, +and returns a status code. +Its first result is the status code (a boolean), +which is true if the call succeeds without errors. +In this case, xpcall also returns all results from the call, +after this first result. +In case of any error, +xpcall returns false plus the result from err. + +

    5.2 - Coroutine Manipulation

    + +

    The operations related to coroutines comprise a sub-library of +the basic library and come inside the table coroutine. +See 2.11 for a general description of coroutines. + +

    coroutine.create (f)

    + +

    Creates a new coroutine, with body f. +f must be a Lua function. +Returns this new coroutine, +an object with type "thread". + +

    coroutine.resume (co [, val1, ..., valn])

    + +

    Starts or continues the execution of coroutine co. +The first time you resume a coroutine, +it starts running its body. +The values val1, ..., valn are passed +as the arguments to the body function. +If the coroutine has yielded, +resume restarts it; +the values val1, ..., valn are passed +as the results from the yield. + +

    If the coroutine runs without any errors, +resume returns true plus any values passed to yield +(if the coroutine yields) or any values returned by the body function +(if the coroutine terminates). +If there is any error, +resume returns false plus the error message. + +

    coroutine.running ()

    + +

    Returns the running coroutine, +or nil when called by the main thread. + +

    coroutine.status (co)

    + +

    Returns the status of coroutine co, as a string: +"running", +if the coroutine is running (that is, it 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 Lua function. +Returns a function that resumes the coroutine each time it is called. +Any arguments passed to the function behave as the +extra arguments to resume. +Returns the same values returned by resume, +except the first boolean. +In case of error, propagates the error. + +

    coroutine.yield ([val1, ..., valn])

    + +

    Suspends the execution of the calling coroutine. +The coroutine cannot be running a C function, +a metamethod, or an iterator. +Any arguments to yield are passed as extra results to resume. + +

    5.3 - Modules

    + +

    The package library provides basic +facilities for loading and building modules in Lua. +It exports two of its functions directly in the global environment: +require and module. +Everything else is exported in a table package. + +

    module (name [, ...])

    + +

    Creates a module. +If there is a table in package.loaded[name], +this table is the module. +Otherwise, if there is a global table t with the given name, +this table is the module. +Otherwise creates a new table t and +sets it as the value of the global name and +the value of package.loaded[name]. +This function also initializes t._NAME with the given name, +t._M with the module (t itself), +and t._PACKAGE with the package name +(the full module name minus last component; see below). +Finally, module sets t as the new environment +of the current function and the new value of package.loaded[name], +so that require returns t. + +

    If name is a compound name +(that is, one with components separated by dots), +module creates (or reuses, if they already exist) +tables for each component. +For instance, if name is a.b.c, +then module stores the module table in field c of +field b of global a. + +

    This function may receive optional options after +the module name, +where each option is a function to be applied over the module. + +

    require (modname)

    + +

    Loads the given module. +The function starts by looking into the table package.loaded +to determine whether modname is already loaded. +If it is, then require returns the value stored +at package.loaded[modname]. +Otherwise, it tries to find a loader for the module. + +

    To find a loader, +first require queries package.preload[modname]. +If it has a value, +this value (which should 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 below). + +

    When loading a C library, +require first uses a dynamic link facility to link the +application with the library. +Then it tries to find a C function inside this 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 prefix up to (and including) the first hyphen is removed. +For instance, if the module name is a.v1-b.c, +the function name will be luaopen_b_c. + +

    If require finds neither a Lua library nor a +C library for a module, +it calls the all-in-one loader. +This loader 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. + +

    Once a loader is found, +require calls the loader with a single argument, modname. +If the loader returns any value, +require assigns it to package.loaded[modname]. +If the loader returns no 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]. + +

    If there is any error loading or running the module, +or if it cannot find any loader for the module, +then require signals an error. + +

    package.cpath

    + +

    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 +(plus another 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. + +

    package.loadlib (libname, funcname)

    + +

    Dynamically links the host program with the C library libname. +Inside this library, looks for a function funcname +and returns this function as a C function. +(So, funcname must follow the protocol (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 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 ANSI 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). + +

    package.path

    + +

    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 or +with a default path defined in luaconf.h, +if the environment variable is not defined. +Any ";;" in the value of the environment variable +is replaced by the default path. + +

    A path is a sequence of templates separated by semicolons. +For each template, require will change each interrogation +mark in the template by filename, +which is modname with each dot replaced by a +"directory separator" (such as "/" in Unix); +then it will try to load the resulting file name. +So, for instance, if the Lua path is +

    +  "./?.lua;./?.lc;/usr/local/?/init.lua"
+
    +the search for a Lua loader for module foo +will try to load the files +./foo.lua, ./foo.lc, and +/usr/local/foo/init.lua, in that order. + +

    package.preload

    + +

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

    package.seeall (module)

    + +

    Sets a metatable for module with +its __index field referring to the global environment, +so that this module inherits values +from the global environment. +To be used as an option to function module. + +

    5.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 metatable itself. +Therefore, you can use the string functions in object-oriented style. +For instance, string.byte(s, i) +can be written as s:byte(i). + +

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

    +Returns the internal numerical 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. + +

    Note that numerical codes are not necessarily portable across platforms. + +

    string.char (i1, i2, ...)

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

    Note that numerical codes are not necessarily portable across platforms. + +

    string.dump (function)

    + +

    Returns a string containing a binary representation of the given function, +so that a later loadstring on this string returns +a copy of the function. +function must be a Lua function without upvalues. + +

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

    +Looks for the first match of +pattern 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 nil. +A third, optional numerical argument init specifies +where to start the search; +its default value is 1 and may be negative. +A value of true as a fourth, optional argument plain +turns off the pattern matching facilities, +so the function does a plain "find substring" operation, +with no characters in pattern being considered "magic". +Note that if plain is given, then init must be given as well. + +

    If the pattern has captures, +then in a successful match +the captured values are also returned, +after the two indices. + +

    string.format (formatstring, e1, e2, ...)

    +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 printf family of +standard C functions. +The only differences are that the options/modifiers +*, l, L, n, p, +and h are not supported +and that there is an extra option, q. +The q option formats a string in a form suitable to be safely read +back by the Lua interpreter: +The string is written between double quotes, +and all double quotes, newlines, embedded zeros, +and backslashes in the string +are correctly escaped when written. +For instance, the call +
    +       string.format('%q', 'a string with "quotes" and \n new line')
+
    +will produce the string: +
    +"a string with \"quotes\" and \
+ new line"
+
    + +

    The options c, d, E, e, f, +g, G, i, o, u, X, and x all +expect a number as argument, +whereas q and s expect a string. + +

    This function does not accept string values +containing embedded zeros. + +

    string.gmatch (s, pattern)

    +Returns an iterator function that, +each time it is called, +returns the next captures from pattern over string s. + +

    If pattern specifies no captures, +then the whole match is produced in each call. + +

    As an example, the following loop +

    +  s = "hello world from Lua"
+  for w in string.gmatch(s, "%a+") do
+    print(w)
+  end
+
    +will iterate over all the words from string s, +printing one per line. +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
+
    + +

    string.gsub (s, pattern, repl [, n])

    +Returns a copy of s +in which all occurrences of the pattern have been +replaced by a replacement string specified by repl, +which may be a string, a table, or a function. +gsub also returns, as its second value, +the total number of substitutions made. + +

    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 %n, +with n between 1 and 9, +stands for the value of the n-th captured substring (see below). +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 the pattern specifies no captures, +then the whole match is used 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; +if the pattern specifies no captures, +then the whole match is passed as a sole argument. + +

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

    The optional last parameter n limits +the maximum number of substitutions to occur. +For instance, when n is 1 only the first occurrence of +pattern is replaced. + +

    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 loadstring(s)()
+       end)
+   --> x="4+5 = 9"
+
+   local t = {name="lua", version="5.1"}
+   x = string.gsub("$name%-$version.tar.gz", "%$(%w+)", t)
+   --> x="lua-5.1.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 +pattern in the string s. +If it finds one, then match returns +the captures from the pattern; +otherwise it returns nil. +If pattern specifies no captures, +then the whole match is returned. +A third, optional numerical argument init specifies +where to start the search; +its default value is 1 and may be negative. + +

    string.rep (s, n)

    +Returns a string that is the concatenation of n copies of +the string s. + +

    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 may 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) returns a suffix of s +with length i. + +

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

    Patterns

    + +

    +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. +
    • %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. +
    • %z --- represents the character with representation 0. +
    • %x (where x is any non-alphanumeric character) --- +represents the character x. +This is the standard way to escape the magic characters. +Any punctuation character (even the non magic) +can be preceded by a `%´ +when used to represent itself in a pattern. + +

    • [set] --- +represents the class which is the union of all +characters in set. +A range of characters may be specified by +separating the end characters of the range with a `-´. +All classes %x described above may 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. + +

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

    +A pattern item may be +

      +
    • +a single character class, +which matches any single character in the class; +
    • +a single character class followed by `*´, +which matches 0 or more repetitions of characters in the class. +These repetition items will always match the longest possible sequence; +
    • +a single character class followed by `+´, +which matches 1 or more repetitions of characters in the class. +These repetition items will always match the longest possible sequence; +
    • +a single character class followed by `-´, +which also matches 0 or more repetitions of characters in the class. +Unlike `*´, +these repetition items will always match the shortest possible sequence; +
    • +a single character class followed by `?´, +which matches 0 or 1 occurrence of a character in the class; +
    • +%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. +
    + +

    +A pattern is a sequence of pattern items. +A `^´ 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. + +

    +A pattern may 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 empty 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. + +

    A pattern cannot contain embedded zeros. Use %z instead. + +

    5.5 - Table Manipulation

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

    Most functions in the table library assume that the table +represents an array or a list. +For these functions, when we talk about the "length" of a table +we mean the result of the length operator. + +

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

    +Returns table[i]..sep..table[i+1] ... sep..table[j]. +The default value for sep is the empty string, +the default for i is 1, +and the default for j is the length of the table. +If i is greater than j, returns the empty string. + +

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

    + +

    Inserts element value at position pos in table, +shifting up other elements to open space, if necessary. +The default value for pos is n+1, +where n is the length of the table (see 2.5.5), +so that a call table.insert(t,x) inserts x at the end +of table t. + +

    table.maxn (table)

    + +

    Returns the largest positive numerical index of the given table, +or zero if the table has no positive numerical indices. +(To do its job this function does a linear traversal of +the whole table.) + +

    table.remove (table [, pos])

    + +

    Removes from table the element at position pos, +shifting down other elements to close the space, if necessary. +Returns the value of the removed element. +The default value for pos is n, +where n is the length of the table, +so that a call table.remove(t) removes the last element +of table t. + +

    table.sort (table [, comp])

    +Sorts table elements in a given order, in-place, +from table[1] to table[n], +where n is the length of the table. +If comp is given, +then it must be a function that receives two table elements, +and returns true +when the first is less than the second +(so that not comp(a[i+1],a[i]) will be true after the sort). +If comp is not given, +then the standard Lua operator < is used instead. + +

    The sort algorithm is not stable; +that is, elements considered equal by the given order +may have their relative positions changed by the sort. + +

    5.6 - Mathematical Functions

    + +

    This library is an interface to the standard C math library. +It provides all its functions inside the table math. +The library provides the following functions: + + + + + + + + +

    +       math.abs     math.acos    math.asin    math.atan    math.atan2
+       math.ceil    math.cos     math.cosh    math.deg     math.exp
+       math.floor   math.fmod    math.frexp   math.ldexp   math.log
+       math.log10   math.max     math.min     math.modf    math.pow
+       math.rad     math.random  math.randomseed           math.sin
+       math.sinh    math.sqrt    math.tan     math.tanh
+
    +plus a variable math.pi and +a variable math.huge, +with the value HUGE_VAL. +Most of these functions +are only interfaces to the corresponding functions in the C library. +All trigonometric functions work in radians. +The functions math.deg and math.rad convert +between radians and degrees. + +

    The function math.max returns the maximum +value of its numeric arguments. +Similarly, math.min computes the minimum. +Both can be used with 1, 2, or more arguments. + +

    The function math.modf corresponds to the modf C function. +It returns two values: +The integral part and the fractional part of its argument. +The function math.frexp also returns 2 values: +The normalized fraction and the exponent of its argument. + +

    The functions math.random and math.randomseed +are interfaces to the simple random generator functions +rand and srand that are provided by ANSI C. +(No guarantees can be given for their statistical properties.) +When called without arguments, +math.random returns a pseudo-random real number +in the range [0,1). +When called with a number n, +math.random returns +a pseudo-random integer in the range [1,n]. +When called with two arguments, +l and u, +math.random returns a pseudo-random +integer in the range [l,u]. +The math.randomseed function sets a "seed" +for the pseudo-random generator: +Equal seeds produce equal sequences of numbers. + +

    5.7 - Input and Output Facilities

    + +

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

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

    The table io also provides +three predefined file descriptors with their usual meanings from C: +io.stdin, io.stdout, and io.stderr. + +

    Unless otherwise stated, +all I/O functions return nil on failure +(plus an error message as a second result) +and some value different from nil on success. + +

    io.close ([file])

    + +

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

    io.flush ()

    + +

    Equivalent to file:flush over the default output file. + +

    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 parameters, +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, +each time it is called, +returns a new line from the file. +Therefore, the construction +

    +       for line in io.lines(filename) do ... end
+
    +will iterate over all lines of the file. +When the iterator function detects the end of file, +it returns nil (to finish the loop) and automatically closes the file. + +

    The call io.lines() (without a file name) is equivalent +to io.input():lines(); +that is, it iterates over the lines of the default input file. +In this case it does not close the file when the loop ends. + +

    io.open (filename [, mode])

    + +

    This function opens a file, +in the mode specified in the string mode. +It returns a new file handle, +or, in case of errors, nil plus an error message. + +

    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 may also have a `b´ at the end, +which is needed in some systems to open the file in binary mode. +This string is exactly what is used in the +standard C function fopen. + +

    io.output ([file])

    + +

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

    io.popen ([prog [, mode]])

    + +

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

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

    io.read (format1, ...)

    + +

    Equivalent to io.input():read. + +

    io.tmpfile ()

    + +

    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 nil if obj is not a file handle. + +

    io.write (value1, ...)

    + +

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

    file:flush ()

    + +

    Saves any written data to file. + +

    file:lines ()

    + +

    Returns an iterator function that, +each time it is called, +returns a new line from the file. +Therefore, the construction +

    +       for line in file:lines() do ... end
+
    +will iterate over all lines of the file. +(Unlike io.lines, this function does not close the file +when the loop ends.) + +

    file:read (format1, ...)

    + +

    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 nil if it cannot read data with the specified format. +When called without formats, +it uses a default format that reads the entire next line +(see below). + +

    The available formats are +

      +
    • "*n" reads a number; +this is the only format that returns a number instead of a string. +
    • "*a" reads the whole file, starting at the current position. +On end of file, it returns the empty string. +
    • "*l" reads the next line (skipping the end of line), +returning nil on end of file. +This is the default format. +
    • number reads a string with up to this number of characters, +returning nil on end of file. +If number is zero, +it reads nothing and returns an empty string, +or nil on end of file. +
    + +

    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, function seek returns the final file position, +measured in bytes from the beginning of the file. +If this function fails, it returns nil, +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 an output file. +There are three available modes: +

      +
    • "no" --- +no buffering; the result of any output operation appears immediately. +
    • "full" --- +full buffering; output operation is performed only +when the buffer is full (or when you explicitly flush the file (see 5.7)). +
    • "line" --- +line buffering; output is buffered until a newline is output +or there is any input from some special files +(such as a terminal device). +
    +For the last two cases, sizes +specifies the size of the buffer, in bytes. +The default is an appropriate size. + +

    file:write (value1, ...)

    + +

    Writes the value of each of its arguments to +the file. +The arguments must be strings or numbers. +To write other values, +use tostring or string.format before write. + +

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

    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 *t, +then date returns a table with the following fields: +year (four digits), month (1--12), day (1--31), +hour (0--23), min (0--59), sec (0--61), +wday (weekday, Sunday is 1), +yday (day of the year), +and isdst (daylight saving flag, a boolean). + +

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

    When called without arguments, +date returns a reasonable date and time representation that depends on +the host system and on the current locale +(that is, os.date() is equivalent to os.date("%c")). + +

    os.difftime (t2, t1)

    + +

    Returns the number of seconds from time t1 to time t2. +In POSIX, Windows, and some other systems, +this value is exactly t2-t1. + +

    os.execute ([command])

    + +

    This function is equivalent to the C function system. +It passes command to be executed by an operating system shell. +It returns a status code, which is system-dependent. +If command is absent, then it returns nonzero if a shell is available +and zero otherwise. + +

    os.exit ([code])

    + +

    Calls the C function exit, +with an optional code, +to terminate the host program. +The default value for code is the success code. + +

    os.getenv (varname)

    + +

    Returns the value of the process environment variable varname, +or nil if the variable is not defined. + +

    os.remove (filename)

    + +

    Deletes the file or directory with the given name. +Directories must be empty to be removed. +If this function fails, it returns nil, +plus a string describing the error. + +

    os.rename (oldname, newname)

    + +

    Renames file or directory named oldname to newname. +If this function fails, it returns nil, +plus a string describing the error. + +

    os.setlocale (locale [, category])

    + +

    Sets the current locale of the program. +locale is a 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 nil if the request cannot be honored. + +

    os.time ([table])

    + +

    Returns the current time when called without arguments, +or a time representing the date and time specified by the given table. +This table must have fields year, month, and day, +and may have fields hour, min, sec, and isdst +(for a description of these fields, see the os.date function). + +

    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 +date and difftime. + +

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

    5.9 - The Debug Library

    + +

    This library provides +the functionality of the debug interface to Lua programs. +You should exert care when using this library. +The functions provided here should be used exclusively for debugging +and similar tasks, such as profiling. +Please resist the temptation to use them as a +usual programming tool: +They can be very slow. +Moreover, several of its functions +violate some assumptions about Lua code +(e.g., that variables local to a function +cannot be accessed from outside or +that userdata metatables cannot be changed by Lua code) +and therefore can compromise otherwise secure code. + +

    All functions in this library are provided +inside the debug table. + +

    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.getfenv (o)

    +Returns the environment of object o. + +

    debug.gethook ()

    + +

    Returns the current hook settings, as three values: +the current hook function, the current hook mask, +and the current hook count +(as set by the debug.sethook function). + +

    debug.getinfo (function [, 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 function, +which means the function running at level function of the call stack: +Level 0 is the current function (getinfo itself); +level 1 is the function that called getinfo; +and so on. +If function is a number larger than the number of active functions, +then getinfo returns nil. + +

    The returned table contains 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. +If present, +the option `f´ +adds a field named func with the function itself. + +

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

    debug.getlocal (level, local)

    + +

    This function returns the name and the value of the local variable +with index local of the function at level level of the stack. +(The first parameter or local variable has index 1, and so on, +until the last active local variable.) +The function returns nil 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 debug.getinfo to check whether the level is valid.) + +

    Variable names starting with `(´ (open parentheses) +represent internal variables +(loop control variables, temporaries, and C function locals). + +

    debug.getmetatable (object)

    + +

    Returns the metatable of the given object +or nil if it does not have a metatable. + +

    debug.getregistry ()

    + +

    Returns the registry table (see 3.5). + +

    debug.getupvalue (func, up)

    + +

    This function returns the name and the value of the upvalue +with index up of the function func. +The function returns nil if there is no upvalue with the given index. + +

    debug.setfenv (object, table)

    + +

    Sets the environment of the given object to the given table. + +

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

    + +

    Sets the given function as a hook. +The string mask and the number count describe +when the hook will be called. +The string mask may have 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. +
    +With a count different from zero, +the hook is called 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", "return" (or "tail 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), +unless the event is "tail return". +In this case, Lua is only simulating the return, +and a call to getinfo will return invalid data. + +

    debug.setlocal (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 nil 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. + +

    debug.setmetatable (object, table)

    + +

    Sets the metatable for the given object to the given table +(which can be nil). + +

    debug.setupvalue (func, up, value)

    + +

    This function assigns the value value to the upvalue +with index up of the function func. +The function returns nil if there is no upvalue +with the given index. +Otherwise, it returns the name of the upvalue. + +

    debug.traceback ([message])

    + +

    Returns a string with a traceback of the call stack. +An optional message string is appended +at the beginning of the traceback. +This function is typically used with xpcall to produce +better error messages. + +

    +

    6 - Lua Stand-alone

    + +

    Although Lua has been designed as an extension language, +to be embedded in a host C program, +it is also frequently used as a stand-alone language. +An interpreter for Lua as a stand-alone language, +called simply lua, +is provided with the standard distribution. +The stand-alone interpreter includes +all standard libraries, including the debug library. +Its usage is: +

    +      lua [options] [script [args]]
+
    +The options are: +
      +
    • -e stat executes string stat; +
    • -l mod "requires" mod; +
    • -i enters interactive mode after running script; +
    • -v prints version information; +
    • -- stops handling options; +
    • - executes stdin as a file and stops handling options. +
    +After handling its options, lua runs the given script, +passing to it the given args as string arguments. +When called without arguments, +lua behaves as lua -v -i +when the standard input (stdin) is a terminal, +and as lua - otherwise. + +

    Before running any argument, +the interpreter checks for an environment variable LUA_INIT. +If its format is @filename, +then lua executes the file. +Otherwise, lua executes the string itself. + +

    All options are handled in order, except -i. +For instance, an invocation like +

    +       $ lua -e'a=1' -e 'print(a)' script.lua
+
    +will first set a to 1, then print the value of a (which is `1´), +and finally run the file script.lua with no arguments. +(Here $ is the shell prompt. Your prompt may be different.) + +

    Before starting to run the script, +lua collects all arguments in the command line +in a global table called arg. +The script name is stored at 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 the options) +go to negative indices. +For instance, in the call +

    +       $ lua -la b.lua t1 t2
+
    +the interpreter first runs the file a.lua, +then creates a table +
    +       arg = { [-2] = "lua", [-1] = "-la",
+               [0] = "b.lua",
+               [1] = "t1", [2] = "t2" }
+
    +and finally runs the file b.lua. +The script is called with arg[1], arg[2], ... +as arguments; +it can also access these arguments with the vararg expression `...´. + +

    In interactive mode, +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). +Therefore, both prompts can be changed directly on the command line. +For instance, +

    +       $ lua -e"_PROMPT='myprompt> '" -i
+
    +(the outer pair of quotes is for the shell, +the inner pair is for Lua), +or in any Lua programs by assigning to _PROMPT. +Note the use of -i to enter interactive mode; otherwise, +the program would just end silently right after the assignment to _PROMPT. + +

    To allow the use of Lua as a +script interpreter in Unix systems, +the stand-alone interpreter skips +the first line of a 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.) + +

    + +

    Incompatibilities with the Previous Version

    + + +

    Here we list the incompatibilities that may be found when moving a program +from Lua 5.0 to Lua 5.1. +You can avoid most of the incompatibilities compiling Lua with +appropriate options (see file luaconf.h). +However, +all these compatibility options will be removed in the next version of Lua. + +

    Incompatibilities with version 5.0

    + +

    Changes in the Language

    +
      +
    • +The vararg system changed from the pseudo-argument arg with a +table with the extra arguments to the vararg expression. +(Option LUA_COMPAT_VARARG in luaconf.h.) + +

    • +There was a subtle change in the scope of the implicit +variables of the for statement and for the repeat statement. + +

    • +The long string/long comment syntax ([[...]]) does not allow nesting. +You can use the new syntax ([=[...]=]) in these cases. +(Option LUA_COMPAT_LSTR in luaconf.h.) + +

    + +

    Changes in the Libraries

    +
      + +

    • +Function string.gfind was renamed string.gmatch. +(Option LUA_COMPAT_GFIND) + +

    • +When string.gsub is called with a function as its +third argument, +whenever this function returns nil or false the +replacement string is the whole match, +instead of the empty string. + +

    • +Function table.setn was deprecated. +Function table.getn corresponds +to the new length operator (#); +use the operator instead of the function. +(Option LUA_COMPAT_GETN) + +

    • +Function loadlib was renamed package.loadlib. +(Option LUA_COMPAT_LOADLIB) + +

    • +Function math.mod was renamed math.fmod. +(Option LUA_COMPAT_MOD) + +

    • +Functions table.foreach and table.foreachi are deprecated. +You can use a for loop with pairs or ipairs instead. + +

    • +There were substantial changes in function require due to +the new module system. +However, the new behavior is mostly compatible with the old, +but require gets the path from package.path instead +of from LUA_PATH. + +

    • +Function collectgarbage has different arguments. +Function gcinfo is deprecated; +use collectgarbage("count") instead. + +

    + +

    Changes in the API

    +
      + +

    • +The luaopen_* functions (to open libraries) +cannot be called directly, +like a regular C function. +They must be called through Lua, +like a Lua function. + +

    • +Function lua_open was replaced by lua_newstate to +allow the user to set a memory allocation function. +You can use luaL_newstate from the standard library to +create a state with a standard allocation function +(based on realloc). + +

    • +Functions luaL_getn and luaL_setn +(from the auxiliary library) are deprecated. +Use lua_objlen instead of luaL_getn +and nothing instead of luaL_setn. + +

    • +Function luaL_openlib was replaced by luaL_register. + +

    + +

    + +

    The Complete Syntax of Lua

    + + +

    Here is the complete syntax of Lua in extended BNF. +It does not describe operator priorities or some syntactical restrictions, +such as return and break statements +can only appear as the last statement of a block. + +

    + +

    +
+	chunk ::= {stat [`;´]} [laststat[`;´]]
+
+	block ::= chunk
+
+	stat ::=  varlist1 `=´ explist1  | 
+		 functioncall  | 
+		 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 explist1 do block end  | 
+		 function funcname funcbody  | 
+		 local function Name funcbody  | 
+		 local namelist [`=´ explist1] 
+
+	laststat ::= return [explist1]  |  break
+
+	funcname ::= Name {`.´ Name} [`:´ Name]
+
+	varlist1 ::= var {`,´ var}
+
+	var ::=  Name  |  prefixexp `[´ exp `]´  |  prefixexp `.´ Name 
+
+	namelist ::= Name {`,´ Name}
+
+	explist1 ::= {exp `,´} exp
+
+	exp ::=  nil  |  false  |  true  |  Number  |  String  |  `...´  | 
+		 function  |  prefixexp  |  tableconstructor  |  exp binop exp  |  unop exp 
+
+	prefixexp ::= var  |  functioncall  |  `(´ exp `)´
+
+	functioncall ::=  prefixexp args  |  prefixexp `:´ Name args 
+
+	args ::=  `(´ [explist1] `)´  |  tableconstructor  |  String 
+
+	function ::= function funcbody
+
+	funcbody ::= `(´ [parlist1] `)´ block end
+
+	parlist1 ::= namelist [`,´ `...´]  |  `...´
+
+	tableconstructor ::= `{´ [fieldlist] `}´
+
+	fieldlist ::= field {fieldsep field} [fieldsep]
+
+	field ::= `[´ exp `]´ `=´ exp  |  Name `=´ exp  |  exp
+
+	fieldsep ::= `,´  |  `;´
+
+	binop ::= `+´  |  `-´  |  `*´  |  `/´  |  `^´  |  `%´  |  `..´  | 
+		 `<´  |  `<=´  |  `>´  |  `>=´  |  `==´  |  `~=´  | 
+		 and  |  or
+
+	unop ::= `-´  |  not  |  `#´
+
+
    + +

    + +

    + + + diff --git a/ref/lua-5.1/doc/readme.html b/ref/lua-5.1/doc/readme.html new file mode 100644 index 0000000..db20a69 --- /dev/null +++ b/ref/lua-5.1/doc/readme.html @@ -0,0 +1,32 @@ + + +Lua documentation + + + + + +

    +

    +Lua +Documentation +

    + + + +
    + +Last update: +Wed Sep 7 12:57:50 BRST 2005 + + + + diff --git a/ref/lua-5.1/etc/Makefile b/ref/lua-5.1/etc/Makefile new file mode 100644 index 0000000..6d00008 --- /dev/null +++ b/ref/lua-5.1/etc/Makefile @@ -0,0 +1,44 @@ +# makefile for Lua etc + +TOP= .. +LIB= $(TOP)/src +INC= $(TOP)/src +BIN= $(TOP)/src +SRC= $(TOP)/src +TST= $(TOP)/test + +CC= gcc +CFLAGS= -O2 -Wall -I$(INC) $(MYCFLAGS) +MYCFLAGS= +MYLDFLAGS= -Wl,-E +MYLIBS= -lm +#MYLIBS= -lm -Wl,-E -ldl -lreadline -lhistory -lncurses +RM= rm -f + +default: + @echo 'Please choose a target: min noparser one strict clean' + +min: min.c + $(CC) $(CFLAGS) $@.c -L$(LIB) -llua $(MYLIBS) + echo 'print"Hello there!"' | ./a.out + +noparser: noparser.o + $(CC) noparser.o $(SRC)/lua.o -L$(LIB) -llua $(MYLIBS) + $(BIN)/luac $(TST)/hello.lua + -./a.out luac.out + -./a.out -e'a=1' + +one: + $(CC) $(CFLAGS) all.c $(MYLIBS) + ./a.out $(TST)/hello.lua + +strict: + -$(BIN)/lua -e 'print(a);b=2' + -$(BIN)/lua -lstrict -e 'print(a)' + -$(BIN)/lua -e 'function f() b=2 end f()' + -$(BIN)/lua -lstrict -e 'function f() b=2 end f()' + +clean: + $(RM) a.out core core.* *.o luac.out + +.PHONY: default min noparser one strict clean diff --git a/ref/lua-5.1/etc/README b/ref/lua-5.1/etc/README new file mode 100644 index 0000000..ad9ca6a --- /dev/null +++ b/ref/lua-5.1/etc/README @@ -0,0 +1,36 @@ +This directory contains some useful files and code. +Unlike the code in ../src, everything here is in the public domain. + +If any of the makes fail, you're probably not using the same libraries +used to build Lua. Set MYLIBS in Makefile accordingly. + +all.c + Full Lua interpreter in a single file. + Do "make one" for a demo. + +lua.hpp + Lua header files for C++ using 'extern "C"'. + +lua.ico + A Lua icon for Windows (and web sites: save as favicon.ico). + Drawn by hand by Markus Gritsch . + +lua.pc + pkg-config data for Lua + +luavs.bat + Script to build Lua under "Visual Studio .NET Command Prompt". + +min.c + A minimal Lua interpreter. + Good for learning and for starting your own. + Do "make min" for a demo. + +noparser.c + Linking with noparser.o avoids loading the parsing modules in lualib.a. + Do "make noparser" for a demo. + +strict.lua + Traps uses of undeclared global variables. + Do "make strict" for a demo. + diff --git a/ref/lua-5.1/etc/all.c b/ref/lua-5.1/etc/all.c new file mode 100644 index 0000000..dab68fa --- /dev/null +++ b/ref/lua-5.1/etc/all.c @@ -0,0 +1,38 @@ +/* +* all.c -- Lua core, libraries and interpreter in a single file +*/ + +#define luaall_c + +#include "lapi.c" +#include "lcode.c" +#include "ldebug.c" +#include "ldo.c" +#include "ldump.c" +#include "lfunc.c" +#include "lgc.c" +#include "llex.c" +#include "lmem.c" +#include "lobject.c" +#include "lopcodes.c" +#include "lparser.c" +#include "lstate.c" +#include "lstring.c" +#include "ltable.c" +#include "ltm.c" +#include "lundump.c" +#include "lvm.c" +#include "lzio.c" + +#include "lauxlib.c" +#include "lbaselib.c" +#include "ldblib.c" +#include "liolib.c" +#include "linit.c" +#include "lmathlib.c" +#include "loadlib.c" +#include "loslib.c" +#include "lstrlib.c" +#include "ltablib.c" + +#include "lua.c" diff --git a/ref/lua-5.1/etc/lua.hpp b/ref/lua-5.1/etc/lua.hpp new file mode 100644 index 0000000..ec417f5 --- /dev/null +++ b/ref/lua-5.1/etc/lua.hpp @@ -0,0 +1,9 @@ +// lua.hpp +// Lua header files for C++ +// <> not supplied automatically because Lua also compiles as C++ + +extern "C" { +#include "lua.h" +#include "lualib.h" +#include "lauxlib.h" +} diff --git a/ref/lua-5.1/etc/lua.ico b/ref/lua-5.1/etc/lua.ico new file mode 100644 index 0000000000000000000000000000000000000000..ccbabc4e2004683f29598a991006d7caff6d837d GIT binary patch literal 1078 zcma)5y>7xl4E|D3VJbX9VX7GW1~6FSw!BIQq_T0tNo32b^bxZ4H5fZGR7xh?&v!Y3 zDh3=J`#b+#Yy%W{!g4u>(a#g`Mme7+yefc~5wPOflDr`o81qe{?|t$BfABsDzNw;V z8cH*0{6W<;G9Np#7ik(qoR4aR5-A@{5)}DJ9&}FRBA#X_5+im4-kQSzMF^)-t2(Vi ztw-^|Sn8@O_lM9`oos+0wMZGt&`Bq(aK&XCv1Gfr&Jtd6%lKPdD{s=unqGWyb3%y{X9SS{jB~HMh0oKMISQrDC zJ;K?)>ElnpmN^UNE-rXxtyk{c#rCe~`P=qnFT7 bCxwx*w%~s~=?o*z_6Fk4@7l(poWF`cPpA(! literal 0 HcmV?d00001 diff --git a/ref/lua-5.1/etc/lua.pc b/ref/lua-5.1/etc/lua.pc new file mode 100644 index 0000000..5fd2b1e --- /dev/null +++ b/ref/lua-5.1/etc/lua.pc @@ -0,0 +1,27 @@ +# lua.pc -- pkg-config data for Lua + +# vars from install Makefile + +# grep '^V=' ../Makefile +V= 5.1 + +# grep '^INSTALL_.*=' ../Makefile | sed 's/INSTALL_TOP/prefix/' +prefix= /usr/local +INSTALL_BIN= ${prefix}/bin +INSTALL_INC= ${prefix}/include +INSTALL_LIB= ${prefix}/lib +INSTALL_MAN= ${prefix}/man/man1 +INSTALL_LMOD= ${prefix}/share/lua/${V} +INSTALL_CMOD= ${prefix}/lib/lua/${V} + +exec_prefix=${prefix} +libdir=${exec_prefix}/lib +includedir=${prefix}/include + +Name: Lua +Description: An Extensible Extension Language +Version: ${V} +Requires: +Libs: -L${libdir} -llua -lm +Cflags: -I${includedir} + diff --git a/ref/lua-5.1/etc/luavs.bat b/ref/lua-5.1/etc/luavs.bat new file mode 100644 index 0000000..eea175e --- /dev/null +++ b/ref/lua-5.1/etc/luavs.bat @@ -0,0 +1,7 @@ +cd src +cl /O2 /W3 /c /DLUA_BUILD_AS_DLL l*.c +del lua.obj luac.obj +link /DLL /out:lua51.dll l*.obj +cl /O2 /W3 /c /DLUA_BUILD_AS_DLL lua.c +link /out:lua.exe lua.obj lua51.lib +cd .. diff --git a/ref/lua-5.1/etc/min.c b/ref/lua-5.1/etc/min.c new file mode 100644 index 0000000..404bd50 --- /dev/null +++ b/ref/lua-5.1/etc/min.c @@ -0,0 +1,39 @@ +/* +* min.c -- a minimal Lua interpreter +* loads stdin only with minimal error handling. +* no interaction, and no standard library, only a "print" function. +*/ + +#include + +#include "lua.h" +#include "lauxlib.h" + +static int print(lua_State *L) +{ + int n=lua_gettop(L); + int i; + for (i=1; i<=n; i++) + { + if (i>1) printf("\t"); + if (lua_isstring(L,i)) + printf("%s",lua_tostring(L,i)); + else if (lua_isnil(L,i)==2) + printf("%s","nil"); + else if (lua_isboolean(L,i)) + printf("%s",lua_toboolean(L,i) ? "true" : "false"); + else + printf("%s:%p",luaL_typename(L,i),lua_topointer(L,i)); + } + printf("\n"); + return 0; +} + +int main(void) +{ + lua_State *L=lua_open(); + lua_register(L,"print",print); + if (luaL_dofile(L,NULL)!=0) fprintf(stderr,"%s\n",lua_tostring(L,-1)); + lua_close(L); + return 0; +} diff --git a/ref/lua-5.1/etc/noparser.c b/ref/lua-5.1/etc/noparser.c new file mode 100644 index 0000000..13ba546 --- /dev/null +++ b/ref/lua-5.1/etc/noparser.c @@ -0,0 +1,50 @@ +/* +* The code below can be used to make a Lua core that does not contain the +* parsing modules (lcode, llex, lparser), which represent 35% of the total core. +* You'll only be able to load binary files and strings, precompiled with luac. +* (Of course, you'll have to build luac with the original parsing modules!) +* +* To use this module, simply compile it ("make noparser" does that) and list +* its object file before the Lua libraries. The linker should then not load +* the parsing modules. To try it, do "make luab". +* +* If you also want to avoid the dump module (ldump.o), define NODUMP. +* #define NODUMP +*/ + +#define LUA_CORE + +#include "llex.h" +#include "lparser.h" +#include "lzio.h" + +LUAI_FUNC void luaX_init (lua_State *L) { + UNUSED(L); +} + +LUAI_FUNC Proto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, const char *name) { + UNUSED(z); + UNUSED(buff); + UNUSED(name); + lua_pushliteral(L,"parser not loaded"); + lua_error(L); + return NULL; +} + +#ifdef NODUMP +#include "lundump.h" + +LUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, void* data, int strip) { + UNUSED(f); + UNUSED(w); + UNUSED(data); + UNUSED(strip); +#if 1 + UNUSED(L); + return 0; +#else + lua_pushliteral(L,"dumper not loaded"); + lua_error(L); +#endif +} +#endif diff --git a/ref/lua-5.1/etc/strict.lua b/ref/lua-5.1/etc/strict.lua new file mode 100644 index 0000000..7c9fa15 --- /dev/null +++ b/ref/lua-5.1/etc/strict.lua @@ -0,0 +1,34 @@ +-- +-- strict.lua +-- checks uses of undeclared global variables +-- All global variables must be 'declared' through a regular assignment +-- (even assigning nil will do) in a main chunk before being used +-- anywhere or assigned to inside a function. +-- + +local mt = getmetatable(_G) +if mt == nil then + mt = {} + setmetatable(_G, mt) +end + +mt.__declared = {} + +mt.__newindex = function (t, n, v) + if not mt.__declared[n] then + local w = debug.getinfo(2, "S").what + if w ~= "main" and w ~= "C" then + error("assign to undeclared variable '"..n.."'", 2) + end + mt.__declared[n] = true + end + rawset(t, n, v) +end + +mt.__index = function (t, n) + if not mt.__declared[n] and debug.getinfo(2, "S").what ~= "C" then + error("variable '"..n.."' is not declared", 2) + end + return rawget(t, n) +end + diff --git a/ref/lua-5.1/src/Makefile b/ref/lua-5.1/src/Makefile new file mode 100644 index 0000000..1d46d34 --- /dev/null +++ b/ref/lua-5.1/src/Makefile @@ -0,0 +1,178 @@ +# makefile for building Lua +# see ../INSTALL for installation instructions +# see ../Makefile and luaconf.h for further customization + +# == CHANGE THE SETTINGS BELOW TO SUIT YOUR ENVIRONMENT ======================= + +# Your platform. See PLATS for possible values. +PLAT= none + +CC= gcc +CFLAGS= -O2 -Wall $(MYCFLAGS) +AR= ar rcu +RANLIB= ranlib +RM= rm -f +LIBS= -lm $(MYLIBS) + +MYCFLAGS= +MYLDFLAGS= +MYLIBS= + +# == END OF USER SETTINGS. NO NEED TO CHANGE ANYTHING BELOW THIS LINE ========= + +PLATS= aix ansi bsd generic linux macosx mingw posix solaris + +LUA_A= liblua.a +CORE_O= lapi.o lcode.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 ldblib.o liolib.o lmathlib.o loslib.o ltablib.o \ + lstrlib.o loadlib.o linit.o + +LUA_T= lua +LUA_O= lua.o + +LUAC_T= luac +LUAC_O= luac.o print.o + +ALL_O= $(CORE_O) $(LIB_O) $(LUA_O) $(LUAC_O) +ALL_T= $(LUA_A) $(LUA_T) $(LUAC_T) +ALL_A= $(LUA_A) + +default: $(PLAT) + +all: $(ALL_T) + +o: $(ALL_O) + +a: $(ALL_A) + +$(LUA_A): $(CORE_O) $(LIB_O) + $(AR) $@ $? + $(RANLIB) $@ + +$(LUA_T): $(LUA_O) $(LUA_A) + $(CC) -o $@ $(MYLDFLAGS) $(LUA_O) $(LUA_A) $(LIBS) + +$(LUAC_T): $(LUAC_O) $(LUA_A) + $(CC) -o $@ $(MYLDFLAGS) $(LUAC_O) $(LUA_A) $(LIBS) + +clean: + $(RM) $(ALL_T) $(ALL_O) + +depend: + @$(CC) $(CFLAGS) -MM l*.c print.c + +echo: + @echo "PLAT = $(PLAT)" + @echo "CC = $(CC)" + @echo "CFLAGS = $(CFLAGS)" + @echo "AR = $(AR)" + @echo "RANLIB = $(RANLIB)" + @echo "RM = $(RM)" + @echo "MYCFLAGS = $(MYCFLAGS)" + @echo "MYLDFLAGS = $(MYLDFLAGS)" + @echo "MYLIBS = $(MYLIBS)" + +# convenience targets for popular platforms + +none: + @echo "Please choose a platform: $(PLATS)" + +aix: + $(MAKE) all CC="xlc" CFLAGS="-O2" MYCFLAGS="-DLUA_USE_POSIX -DLUA_USE_DLOPEN" MYLIBS="-ldl" MYLDFLAGS="-brtl -bexpall" + +ansi: + $(MAKE) all MYCFLAGS=-DLUA_ANSI + +bsd: + $(MAKE) all MYCFLAGS="-DLUA_USE_POSIX -DLUA_USE_DLOPEN" MYLIBS="-Wl,-E" + +generic: + $(MAKE) all MYCFLAGS= + +linux: + $(MAKE) all MYCFLAGS=-DLUA_USE_LINUX MYLIBS="-Wl,-E -ldl -lreadline -lhistory -lncurses" + +macosx: + $(MAKE) all MYCFLAGS=-DLUA_USE_MACOSX +# use this on Mac OS X 10.4 +# $(MAKE) all MYCFLAGS="-DLUA_USE_MACOSX -DLUA_USE_READLINE" MYLIBS="-lreadline" + +mingw: + $(MAKE) "LUA_A=lua51.dll" "LUA_T=lua.exe" \ + "AR=$(CC) -shared -o" "RANLIB=strip --strip-unneeded" \ + "MYCFLAGS=-DLUA_BUILD_AS_DLL" "MYLIBS=" "MYLDFLAGS=-s" lua.exe + +posix: + $(MAKE) all MYCFLAGS=-DLUA_USE_POSIX + +solaris: + $(MAKE) all MYCFLAGS="-DLUA_USE_POSIX -DLUA_USE_DLOPEN" MYLIBS="-ldl" + +# list targets that do not create files (but not all makes understand .PHONY) +.PHONY: all $(PLATS) default o a clean depend echo none + +# DO NOT DELETE + +lapi.o: lapi.c lua.h luaconf.h lapi.h lobject.h llimits.h ldebug.h \ + lstate.h ltm.h lzio.h lmem.h ldo.h lfunc.h lgc.h lstring.h ltable.h \ + lundump.h lvm.h +lauxlib.o: lauxlib.c lua.h luaconf.h lauxlib.h +lbaselib.o: lbaselib.c lua.h luaconf.h lauxlib.h lualib.h +lcode.o: lcode.c lua.h luaconf.h lcode.h llex.h lobject.h llimits.h \ + lzio.h lmem.h lopcodes.h lparser.h ltable.h ldebug.h lstate.h ltm.h \ + ldo.h lgc.h +ldblib.o: ldblib.c lua.h luaconf.h lauxlib.h lualib.h +ldebug.o: ldebug.c lua.h luaconf.h lapi.h lobject.h llimits.h lcode.h \ + llex.h lzio.h lmem.h lopcodes.h lparser.h ltable.h ldebug.h lstate.h \ + ltm.h ldo.h lfunc.h lstring.h lgc.h lvm.h +ldo.o: ldo.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h ltm.h \ + lzio.h lmem.h ldo.h lfunc.h lgc.h lopcodes.h lparser.h ltable.h \ + lstring.h lundump.h lvm.h +ldump.o: ldump.c lua.h luaconf.h lobject.h llimits.h lstate.h ltm.h \ + lzio.h lmem.h lundump.h +lfunc.o: lfunc.c lua.h luaconf.h lfunc.h lobject.h llimits.h lgc.h lmem.h \ + lstate.h ltm.h lzio.h +lgc.o: lgc.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h ltm.h \ + lzio.h lmem.h ldo.h lfunc.h lgc.h lstring.h ltable.h +linit.o: linit.c lua.h luaconf.h lualib.h lauxlib.h +liolib.o: liolib.c lua.h luaconf.h lauxlib.h lualib.h +llex.o: llex.c lua.h luaconf.h ldo.h lobject.h llimits.h lstate.h ltm.h \ + lzio.h lmem.h llex.h lparser.h ltable.h lstring.h lgc.h +lmathlib.o: lmathlib.c lua.h luaconf.h lauxlib.h lualib.h +lmem.o: lmem.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h \ + ltm.h lzio.h lmem.h ldo.h +loadlib.o: loadlib.c lauxlib.h lua.h luaconf.h lobject.h llimits.h \ + lualib.h +lobject.o: lobject.c lua.h luaconf.h ldo.h lobject.h llimits.h lstate.h \ + ltm.h lzio.h lmem.h lstring.h lgc.h lvm.h +lopcodes.o: lopcodes.c lopcodes.h llimits.h lua.h luaconf.h +loslib.o: loslib.c lua.h luaconf.h lauxlib.h lualib.h +lparser.o: lparser.c lua.h luaconf.h lcode.h llex.h lobject.h llimits.h \ + lzio.h lmem.h lopcodes.h lparser.h ltable.h ldebug.h lstate.h ltm.h \ + ldo.h lfunc.h lstring.h lgc.h +lstate.o: lstate.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h \ + ltm.h lzio.h lmem.h ldo.h lfunc.h lgc.h llex.h lstring.h ltable.h +lstring.o: lstring.c lua.h luaconf.h lmem.h llimits.h lobject.h lstate.h \ + ltm.h lzio.h lstring.h lgc.h +lstrlib.o: lstrlib.c lua.h luaconf.h lauxlib.h lualib.h +ltable.o: ltable.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h \ + ltm.h lzio.h lmem.h ldo.h lgc.h ltable.h +ltablib.o: ltablib.c lua.h luaconf.h lauxlib.h lualib.h +ltm.o: ltm.c lua.h luaconf.h lobject.h llimits.h lstate.h ltm.h lzio.h \ + lmem.h lstring.h lgc.h ltable.h +lua.o: lua.c lua.h luaconf.h lauxlib.h lualib.h +luac.o: luac.c lua.h luaconf.h lauxlib.h ldo.h lobject.h llimits.h \ + lstate.h ltm.h lzio.h lmem.h lfunc.h lopcodes.h lstring.h lgc.h \ + lundump.h +lundump.o: lundump.c lua.h luaconf.h ldebug.h lstate.h lobject.h \ + llimits.h ltm.h lzio.h lmem.h ldo.h lfunc.h lstring.h lgc.h lundump.h +lvm.o: lvm.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h ltm.h \ + lzio.h lmem.h ldo.h lfunc.h lgc.h lopcodes.h lstring.h ltable.h lvm.h +lzio.o: lzio.c lua.h luaconf.h llimits.h lmem.h lstate.h lobject.h ltm.h \ + lzio.h +print.o: print.c ldebug.h lstate.h lua.h luaconf.h lobject.h llimits.h \ + ltm.h lzio.h lmem.h lopcodes.h lundump.h + +# (end of Makefile) diff --git a/ref/lua-5.1/src/lapi.c b/ref/lua-5.1/src/lapi.c new file mode 100644 index 0000000..ce7bcf6 --- /dev/null +++ b/ref/lua-5.1/src/lapi.c @@ -0,0 +1,1077 @@ +/* +** $Id: lapi.c,v 2.53 2006/01/10 12:50:00 roberto Exp $ +** Lua API +** See Copyright Notice in lua.h +*/ + + +#include +#include +#include +#include + +#define lapi_c +#define LUA_CORE + +#include "lua.h" + +#include "lapi.h" +#include "ldebug.h" +#include "ldo.h" +#include "lfunc.h" +#include "lgc.h" +#include "lmem.h" +#include "lobject.h" +#include "lstate.h" +#include "lstring.h" +#include "ltable.h" +#include "ltm.h" +#include "lundump.h" +#include "lvm.h" + + + +const char lua_ident[] = + "$Lua: " LUA_VERSION " " LUA_COPYRIGHT " $\n" + "$Authors: " LUA_AUTHORS " $\n" + "$URL: www.lua.org $\n"; + + + +#define api_checknelems(L, n) api_check(L, (n) <= (L->top - L->base)) + +#define api_checkvalidindex(L, i) api_check(L, (i) != luaO_nilobject) + +#define api_incr_top(L) {api_check(L, L->top < L->ci->top); L->top++;} + + + +static TValue *index2adr (lua_State *L, int idx) { + if (idx > 0) { + TValue *o = L->base + (idx - 1); + api_check(L, idx <= L->ci->top - L->base); + if (o >= L->top) return cast(TValue *, luaO_nilobject); + else return o; + } + else if (idx > LUA_REGISTRYINDEX) { + api_check(L, idx != 0 && -idx <= L->top - L->base); + return L->top + idx; + } + else switch (idx) { /* pseudo-indices */ + case LUA_REGISTRYINDEX: return registry(L); + case LUA_ENVIRONINDEX: { + Closure *func = curr_func(L); + sethvalue(L, &L->env, func->c.env); + return &L->env; + } + case LUA_GLOBALSINDEX: return gt(L); + default: { + Closure *func = curr_func(L); + idx = LUA_GLOBALSINDEX - idx; + return (idx <= func->c.nupvalues) + ? &func->c.upvalue[idx-1] + : cast(TValue *, luaO_nilobject); + } + } +} + + +static Table *getcurrenv (lua_State *L) { + if (L->ci == L->base_ci) /* no enclosing function? */ + return hvalue(gt(L)); /* use global table as environment */ + else { + Closure *func = curr_func(L); + return func->c.env; + } +} + + +void luaA_pushobject (lua_State *L, const TValue *o) { + setobj2s(L, L->top, o); + api_incr_top(L); +} + + +LUA_API int lua_checkstack (lua_State *L, int size) { + int res; + lua_lock(L); + if ((L->top - L->base + size) > LUAI_MAXCSTACK) + res = 0; /* stack overflow */ + else { + luaD_checkstack(L, size); + if (L->ci->top < L->top + size) + L->ci->top = L->top + size; + res = 1; + } + 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)); + api_check(from, to->ci->top - to->top >= n); + from->top -= n; + for (i = 0; i < n; i++) { + setobj2s(to, to->top++, from->top + i); + } + lua_unlock(to); +} + + +LUA_API lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf) { + lua_CFunction old; + lua_lock(L); + old = G(L)->panic; + G(L)->panic = panicf; + lua_unlock(L); + return old; +} + + +LUA_API lua_State *lua_newthread (lua_State *L) { + lua_State *L1; + lua_lock(L); + luaC_checkGC(L); + L1 = luaE_newthread(L); + setthvalue(L, L->top, L1); + api_incr_top(L); + lua_unlock(L); + luai_userstatethread(L, L1); + return L1; +} + + + +/* +** basic stack manipulation +*/ + + +LUA_API int lua_gettop (lua_State *L) { + return cast_int(L->top - L->base); +} + + +LUA_API void lua_settop (lua_State *L, int idx) { + lua_lock(L); + if (idx >= 0) { + api_check(L, idx <= L->stack_last - L->base); + while (L->top < L->base + idx) + setnilvalue(L->top++); + L->top = L->base + idx; + } + else { + api_check(L, -(idx+1) <= (L->top - L->base)); + L->top += idx+1; /* `subtract' index (index is negative) */ + } + lua_unlock(L); +} + + +LUA_API void lua_remove (lua_State *L, int idx) { + StkId p; + lua_lock(L); + p = index2adr(L, idx); + api_checkvalidindex(L, p); + while (++p < L->top) setobjs2s(L, p-1, p); + L->top--; + lua_unlock(L); +} + + +LUA_API void lua_insert (lua_State *L, int idx) { + StkId p; + StkId q; + lua_lock(L); + p = index2adr(L, idx); + api_checkvalidindex(L, p); + for (q = L->top; q>p; q--) setobjs2s(L, q, q-1); + setobjs2s(L, p, L->top); + lua_unlock(L); +} + + +LUA_API void lua_replace (lua_State *L, int idx) { + StkId o; + lua_lock(L); + api_checknelems(L, 1); + o = index2adr(L, idx); + api_checkvalidindex(L, o); + if (idx == LUA_ENVIRONINDEX) { + Closure *func = curr_func(L); + api_check(L, ttistable(L->top - 1)); + func->c.env = hvalue(L->top - 1); + luaC_barrier(L, func, L->top - 1); + } + else { + setobj(L, o, L->top - 1); + if (idx < LUA_GLOBALSINDEX) /* function upvalue? */ + luaC_barrier(L, curr_func(L), L->top - 1); + } + L->top--; + lua_unlock(L); +} + + +LUA_API void lua_pushvalue (lua_State *L, int idx) { + lua_lock(L); + setobj2s(L, L->top, index2adr(L, idx)); + api_incr_top(L); + lua_unlock(L); +} + + + +/* +** access functions (stack -> C) +*/ + + +LUA_API int lua_type (lua_State *L, int idx) { + StkId o = index2adr(L, idx); + return (o == luaO_nilobject) ? LUA_TNONE : ttype(o); +} + + +LUA_API const char *lua_typename (lua_State *L, int t) { + UNUSED(L); + return (t == LUA_TNONE) ? "no value" : luaT_typenames[t]; +} + + +LUA_API int lua_iscfunction (lua_State *L, int idx) { + StkId o = index2adr(L, idx); + return iscfunction(o); +} + + +LUA_API int lua_isnumber (lua_State *L, int idx) { + TValue n; + const TValue *o = index2adr(L, idx); + return tonumber(o, &n); +} + + +LUA_API int lua_isstring (lua_State *L, int idx) { + int t = lua_type(L, idx); + return (t == LUA_TSTRING || t == LUA_TNUMBER); +} + + +LUA_API int lua_isuserdata (lua_State *L, int idx) { + const TValue *o = index2adr(L, idx); + return (ttisuserdata(o) || ttislightuserdata(o)); +} + + +LUA_API int lua_rawequal (lua_State *L, int index1, int index2) { + StkId o1 = index2adr(L, index1); + StkId o2 = index2adr(L, index2); + return (o1 == luaO_nilobject || o2 == luaO_nilobject) ? 0 + : luaO_rawequalObj(o1, o2); +} + + +LUA_API int lua_equal (lua_State *L, int index1, int index2) { + StkId o1, o2; + int i; + lua_lock(L); /* may call tag method */ + o1 = index2adr(L, index1); + o2 = index2adr(L, index2); + i = (o1 == luaO_nilobject || o2 == luaO_nilobject) ? 0 : equalobj(L, o1, o2); + lua_unlock(L); + return i; +} + + +LUA_API int lua_lessthan (lua_State *L, int index1, int index2) { + StkId o1, o2; + int i; + lua_lock(L); /* may call tag method */ + o1 = index2adr(L, index1); + o2 = index2adr(L, index2); + i = (o1 == luaO_nilobject || o2 == luaO_nilobject) ? 0 + : luaV_lessthan(L, o1, o2); + lua_unlock(L); + return i; +} + + + +LUA_API lua_Number lua_tonumber (lua_State *L, int idx) { + TValue n; + const TValue *o = index2adr(L, idx); + if (tonumber(o, &n)) + return nvalue(o); + else + return 0; +} + + +LUA_API lua_Integer lua_tointeger (lua_State *L, int idx) { + TValue n; + const TValue *o = index2adr(L, idx); + if (tonumber(o, &n)) { + lua_Integer res; + lua_Number num = nvalue(o); + lua_number2integer(res, num); + return res; + } + else + return 0; +} + + +LUA_API int lua_toboolean (lua_State *L, int idx) { + const TValue *o = index2adr(L, idx); + return !l_isfalse(o); +} + + +LUA_API const char *lua_tolstring (lua_State *L, int idx, size_t *len) { + StkId o = index2adr(L, idx); + if (!ttisstring(o)) { + lua_lock(L); /* `luaV_tostring' may create a new string */ + if (!luaV_tostring(L, o)) { /* conversion failed? */ + if (len != NULL) *len = 0; + lua_unlock(L); + return NULL; + } + luaC_checkGC(L); + o = index2adr(L, idx); /* previous call may reallocate the stack */ + lua_unlock(L); + } + if (len != NULL) *len = tsvalue(o)->len; + return svalue(o); +} + + +LUA_API size_t lua_objlen (lua_State *L, int idx) { + StkId o = index2adr(L, idx); + switch (ttype(o)) { + case LUA_TSTRING: return tsvalue(o)->len; + case LUA_TUSERDATA: return uvalue(o)->len; + case LUA_TTABLE: return luaH_getn(hvalue(o)); + case LUA_TNUMBER: { + size_t l; + lua_lock(L); /* `luaV_tostring' may create a new string */ + l = (luaV_tostring(L, o) ? tsvalue(o)->len : 0); + lua_unlock(L); + return l; + } + default: return 0; + } +} + + +LUA_API lua_CFunction lua_tocfunction (lua_State *L, int idx) { + StkId o = index2adr(L, idx); + return (!iscfunction(o)) ? NULL : clvalue(o)->c.f; +} + + +LUA_API void *lua_touserdata (lua_State *L, int idx) { + StkId o = index2adr(L, idx); + switch (ttype(o)) { + case LUA_TUSERDATA: return (rawuvalue(o) + 1); + case LUA_TLIGHTUSERDATA: return pvalue(o); + default: return NULL; + } +} + + +LUA_API lua_State *lua_tothread (lua_State *L, int idx) { + StkId o = index2adr(L, idx); + return (!ttisthread(o)) ? NULL : thvalue(o); +} + + +LUA_API const void *lua_topointer (lua_State *L, int idx) { + StkId o = index2adr(L, idx); + switch (ttype(o)) { + case LUA_TTABLE: return hvalue(o); + case LUA_TFUNCTION: return clvalue(o); + case LUA_TTHREAD: return thvalue(o); + case LUA_TUSERDATA: + case LUA_TLIGHTUSERDATA: + return lua_touserdata(L, idx); + default: return NULL; + } +} + + + +/* +** push functions (C -> stack) +*/ + + +LUA_API void lua_pushnil (lua_State *L) { + lua_lock(L); + setnilvalue(L->top); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API void lua_pushnumber (lua_State *L, lua_Number n) { + lua_lock(L); + setnvalue(L->top, n); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API void lua_pushinteger (lua_State *L, lua_Integer n) { + lua_lock(L); + setnvalue(L->top, cast_num(n)); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API void lua_pushlstring (lua_State *L, const char *s, size_t len) { + lua_lock(L); + luaC_checkGC(L); + setsvalue2s(L, L->top, luaS_newlstr(L, s, len)); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API void lua_pushstring (lua_State *L, const char *s) { + if (s == NULL) + lua_pushnil(L); + else + lua_pushlstring(L, s, strlen(s)); +} + + +LUA_API const char *lua_pushvfstring (lua_State *L, const char *fmt, + va_list argp) { + const char *ret; + lua_lock(L); + luaC_checkGC(L); + ret = luaO_pushvfstring(L, fmt, argp); + lua_unlock(L); + return ret; +} + + +LUA_API const char *lua_pushfstring (lua_State *L, const char *fmt, ...) { + const char *ret; + va_list argp; + lua_lock(L); + luaC_checkGC(L); + va_start(argp, fmt); + ret = luaO_pushvfstring(L, fmt, argp); + va_end(argp); + lua_unlock(L); + return ret; +} + + +LUA_API void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) { + Closure *cl; + lua_lock(L); + luaC_checkGC(L); + api_checknelems(L, n); + cl = luaF_newCclosure(L, n, getcurrenv(L)); + cl->c.f = fn; + L->top -= n; + while (n--) + setobj2n(L, &cl->c.upvalue[n], L->top+n); + setclvalue(L, L->top, cl); + lua_assert(iswhite(obj2gco(cl))); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API void lua_pushboolean (lua_State *L, int b) { + lua_lock(L); + setbvalue(L->top, (b != 0)); /* ensure that true is 1 */ + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API void lua_pushlightuserdata (lua_State *L, void *p) { + lua_lock(L); + setpvalue(L->top, p); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API int lua_pushthread (lua_State *L) { + lua_lock(L); + setthvalue(L, L->top, L); + api_incr_top(L); + lua_unlock(L); + return (G(L)->mainthread == L); +} + + + +/* +** get functions (Lua -> stack) +*/ + + +LUA_API void lua_gettable (lua_State *L, int idx) { + StkId t; + lua_lock(L); + t = index2adr(L, idx); + api_checkvalidindex(L, t); + luaV_gettable(L, t, L->top - 1, L->top - 1); + lua_unlock(L); +} + + +LUA_API void lua_getfield (lua_State *L, int idx, const char *k) { + StkId t; + TValue key; + lua_lock(L); + t = index2adr(L, idx); + api_checkvalidindex(L, t); + setsvalue(L, &key, luaS_new(L, k)); + luaV_gettable(L, t, &key, L->top); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API void lua_rawget (lua_State *L, int idx) { + StkId t; + lua_lock(L); + t = index2adr(L, idx); + api_check(L, ttistable(t)); + setobj2s(L, L->top - 1, luaH_get(hvalue(t), L->top - 1)); + lua_unlock(L); +} + + +LUA_API void lua_rawgeti (lua_State *L, int idx, int n) { + StkId o; + lua_lock(L); + o = index2adr(L, idx); + api_check(L, ttistable(o)); + setobj2s(L, L->top, luaH_getnum(hvalue(o), n)); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API void lua_createtable (lua_State *L, int narray, int nrec) { + lua_lock(L); + luaC_checkGC(L); + sethvalue(L, L->top, luaH_new(L, narray, nrec)); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API int lua_getmetatable (lua_State *L, int objindex) { + const TValue *obj; + Table *mt = NULL; + int res; + lua_lock(L); + obj = index2adr(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) + res = 0; + else { + sethvalue(L, L->top, mt); + api_incr_top(L); + res = 1; + } + lua_unlock(L); + return res; +} + + +LUA_API void lua_getfenv (lua_State *L, int idx) { + StkId o; + lua_lock(L); + o = index2adr(L, idx); + api_checkvalidindex(L, o); + switch (ttype(o)) { + case LUA_TFUNCTION: + sethvalue(L, L->top, clvalue(o)->c.env); + break; + case LUA_TUSERDATA: + sethvalue(L, L->top, uvalue(o)->env); + break; + case LUA_TTHREAD: + setobj2s(L, L->top, gt(thvalue(o))); + break; + default: + setnilvalue(L->top); + break; + } + api_incr_top(L); + lua_unlock(L); +} + + +/* +** set functions (stack -> Lua) +*/ + + +LUA_API void lua_settable (lua_State *L, int idx) { + StkId t; + lua_lock(L); + api_checknelems(L, 2); + t = index2adr(L, idx); + api_checkvalidindex(L, t); + luaV_settable(L, t, L->top - 2, L->top - 1); + L->top -= 2; /* pop index and value */ + lua_unlock(L); +} + + +LUA_API void lua_setfield (lua_State *L, int idx, const char *k) { + StkId t; + TValue key; + lua_lock(L); + api_checknelems(L, 1); + t = index2adr(L, idx); + api_checkvalidindex(L, t); + setsvalue(L, &key, luaS_new(L, k)); + luaV_settable(L, t, &key, L->top - 1); + L->top--; /* pop value */ + lua_unlock(L); +} + + +LUA_API void lua_rawset (lua_State *L, int idx) { + StkId t; + lua_lock(L); + api_checknelems(L, 2); + t = index2adr(L, idx); + api_check(L, ttistable(t)); + setobj2t(L, luaH_set(L, hvalue(t), L->top-2), L->top-1); + luaC_barriert(L, hvalue(t), L->top-1); + L->top -= 2; + lua_unlock(L); +} + + +LUA_API void lua_rawseti (lua_State *L, int idx, int n) { + StkId o; + lua_lock(L); + api_checknelems(L, 1); + o = index2adr(L, idx); + api_check(L, ttistable(o)); + setobj2t(L, luaH_setnum(L, hvalue(o), n), L->top-1); + luaC_barriert(L, hvalue(o), 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 = index2adr(L, objindex); + api_checkvalidindex(L, obj); + if (ttisnil(L->top - 1)) + mt = NULL; + else { + api_check(L, ttistable(L->top - 1)); + mt = hvalue(L->top - 1); + } + switch (ttype(obj)) { + case LUA_TTABLE: { + hvalue(obj)->metatable = mt; + if (mt) + luaC_objbarriert(L, hvalue(obj), mt); + break; + } + case LUA_TUSERDATA: { + uvalue(obj)->metatable = mt; + if (mt) + luaC_objbarrier(L, rawuvalue(obj), mt); + break; + } + default: { + G(L)->mt[ttype(obj)] = mt; + break; + } + } + L->top--; + lua_unlock(L); + return 1; +} + + +LUA_API int lua_setfenv (lua_State *L, int idx) { + StkId o; + int res = 1; + lua_lock(L); + api_checknelems(L, 1); + o = index2adr(L, idx); + api_checkvalidindex(L, o); + api_check(L, ttistable(L->top - 1)); + switch (ttype(o)) { + case LUA_TFUNCTION: + clvalue(o)->c.env = hvalue(L->top - 1); + break; + case LUA_TUSERDATA: + uvalue(o)->env = hvalue(L->top - 1); + break; + case LUA_TTHREAD: + sethvalue(L, gt(thvalue(o)), hvalue(L->top - 1)); + break; + default: + res = 0; + break; + } + luaC_objbarrier(L, gcvalue(o), hvalue(L->top - 1)); + L->top--; + lua_unlock(L); + return res; +} + + +/* +** `load' and `call' functions (run Lua code) +*/ + + +#define adjustresults(L,nres) \ + { if (nres == LUA_MULTRET && L->top >= L->ci->top) L->ci->top = L->top; } + + +#define checkresults(L,na,nr) \ + api_check(L, (nr) == LUA_MULTRET || (L->ci->top - L->top >= (nr) - (na))) + + +LUA_API void lua_call (lua_State *L, int nargs, int nresults) { + StkId func; + lua_lock(L); + api_checknelems(L, nargs+1); + checkresults(L, nargs, nresults); + func = L->top - (nargs+1); + luaD_call(L, func, nresults); + adjustresults(L, nresults); + lua_unlock(L); +} + + + +/* +** Execute a protected call. +*/ +struct CallS { /* data to `f_call' */ + StkId func; + int nresults; +}; + + +static void f_call (lua_State *L, void *ud) { + struct CallS *c = cast(struct CallS *, ud); + luaD_call(L, c->func, c->nresults); +} + + + +LUA_API int lua_pcall (lua_State *L, int nargs, int nresults, int errfunc) { + struct CallS c; + int status; + ptrdiff_t func; + lua_lock(L); + api_checknelems(L, nargs+1); + checkresults(L, nargs, nresults); + if (errfunc == 0) + func = 0; + else { + StkId o = index2adr(L, errfunc); + api_checkvalidindex(L, o); + func = savestack(L, o); + } + c.func = L->top - (nargs+1); /* function to be called */ + c.nresults = nresults; + status = luaD_pcall(L, f_call, &c, savestack(L, c.func), func); + adjustresults(L, nresults); + lua_unlock(L); + return status; +} + + +/* +** Execute a protected C call. +*/ +struct CCallS { /* data to `f_Ccall' */ + lua_CFunction func; + void *ud; +}; + + +static void f_Ccall (lua_State *L, void *ud) { + struct CCallS *c = cast(struct CCallS *, ud); + Closure *cl; + cl = luaF_newCclosure(L, 0, getcurrenv(L)); + cl->c.f = c->func; + setclvalue(L, L->top, cl); /* push function */ + api_incr_top(L); + setpvalue(L->top, c->ud); /* push only argument */ + api_incr_top(L); + luaD_call(L, L->top - 2, 0); +} + + +LUA_API int lua_cpcall (lua_State *L, lua_CFunction func, void *ud) { + struct CCallS c; + int status; + lua_lock(L); + c.func = func; + c.ud = ud; + status = luaD_pcall(L, f_Ccall, &c, savestack(L, L->top), 0); + lua_unlock(L); + return status; +} + + +LUA_API int lua_load (lua_State *L, lua_Reader reader, void *data, + const char *chunkname) { + ZIO z; + int status; + lua_lock(L); + if (!chunkname) chunkname = "?"; + luaZ_init(L, &z, reader, data); + status = luaD_protectedparser(L, &z, chunkname); + lua_unlock(L); + return status; +} + + +LUA_API int lua_dump (lua_State *L, lua_Writer writer, void *data) { + int status; + TValue *o; + lua_lock(L); + api_checknelems(L, 1); + o = L->top - 1; + if (isLfunction(o)) + status = luaU_dump(L, clvalue(o)->l.p, writer, data, 0); + else + status = 1; + lua_unlock(L); + return status; +} + + +LUA_API int lua_status (lua_State *L) { + return L->status; +} + + +/* +** Garbage-collection function +*/ + +LUA_API int lua_gc (lua_State *L, int what, int data) { + int res = 0; + global_State *g; + lua_lock(L); + g = G(L); + switch (what) { + case LUA_GCSTOP: { + g->GCthreshold = MAX_LUMEM; + break; + } + case LUA_GCRESTART: { + g->GCthreshold = g->totalbytes; + break; + } + case LUA_GCCOLLECT: { + luaC_fullgc(L); + break; + } + case LUA_GCCOUNT: { + /* GC values are expressed in Kbytes: #bytes/2^10 */ + res = cast_int(g->totalbytes >> 10); + break; + } + case LUA_GCCOUNTB: { + res = cast_int(g->totalbytes & 0x3ff); + break; + } + case LUA_GCSTEP: { + lu_mem a = (cast(lu_mem, data) << 10); + if (a <= g->totalbytes) + g->GCthreshold = g->totalbytes - a; + else + g->GCthreshold = 0; + while (g->GCthreshold <= g->totalbytes) + luaC_step(L); + if (g->gcstate == GCSpause) /* end of cycle? */ + res = 1; /* signal it */ + break; + } + case LUA_GCSETPAUSE: { + res = g->gcpause; + g->gcpause = data; + break; + } + case LUA_GCSETSTEPMUL: { + res = g->gcstepmul; + g->gcstepmul = data; + break; + } + default: res = -1; /* invalid option */ + } + lua_unlock(L); + return res; +} + + + +/* +** miscellaneous functions +*/ + + +LUA_API int lua_error (lua_State *L) { + lua_lock(L); + api_checknelems(L, 1); + luaG_errormsg(L); + lua_unlock(L); + return 0; /* to avoid warnings */ +} + + +LUA_API int lua_next (lua_State *L, int idx) { + StkId t; + int more; + lua_lock(L); + t = index2adr(L, idx); + api_check(L, ttistable(t)); + more = luaH_next(L, hvalue(t), L->top - 1); + if (more) { + api_incr_top(L); + } + else /* no more elements */ + L->top -= 1; /* remove key */ + lua_unlock(L); + return more; +} + + +LUA_API void lua_concat (lua_State *L, int n) { + lua_lock(L); + api_checknelems(L, n); + if (n >= 2) { + luaC_checkGC(L); + luaV_concat(L, n, cast_int(L->top - L->base) - 1); + L->top -= (n-1); + } + else if (n == 0) { /* push empty string */ + setsvalue2s(L, L->top, luaS_newlstr(L, "", 0)); + api_incr_top(L); + } + /* else n == 1; nothing to do */ + lua_unlock(L); +} + + +LUA_API lua_Alloc lua_getallocf (lua_State *L, void **ud) { + lua_Alloc f; + lua_lock(L); + if (ud) *ud = G(L)->ud; + f = G(L)->frealloc; + lua_unlock(L); + return f; +} + + +LUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud) { + lua_lock(L); + G(L)->ud = ud; + G(L)->frealloc = f; + lua_unlock(L); +} + + +LUA_API void *lua_newuserdata (lua_State *L, size_t size) { + Udata *u; + lua_lock(L); + luaC_checkGC(L); + u = luaS_newudata(L, size, getcurrenv(L)); + setuvalue(L, L->top, u); + api_incr_top(L); + lua_unlock(L); + return u + 1; +} + + + + +static const char *aux_upvalue (StkId fi, int n, TValue **val) { + Closure *f; + if (!ttisfunction(fi)) return NULL; + f = clvalue(fi); + if (f->c.isC) { + if (!(1 <= n && n <= f->c.nupvalues)) return NULL; + *val = &f->c.upvalue[n-1]; + return ""; + } + else { + Proto *p = f->l.p; + if (!(1 <= n && n <= p->sizeupvalues)) return NULL; + *val = f->l.upvals[n-1]->v; + return getstr(p->upvalues[n-1]); + } +} + + +LUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n) { + const char *name; + TValue *val; + lua_lock(L); + name = aux_upvalue(index2adr(L, funcindex), n, &val); + 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; + StkId fi; + lua_lock(L); + fi = index2adr(L, funcindex); + api_checknelems(L, 1); + name = aux_upvalue(fi, n, &val); + if (name) { + L->top--; + setobj(L, val, L->top); + luaC_barrier(L, clvalue(fi), L->top); + } + lua_unlock(L); + return name; +} + diff --git a/ref/lua-5.1/src/lapi.h b/ref/lua-5.1/src/lapi.h new file mode 100644 index 0000000..9d1d435 --- /dev/null +++ b/ref/lua-5.1/src/lapi.h @@ -0,0 +1,16 @@ +/* +** $Id: lapi.h,v 2.2 2005/04/25 19:24:10 roberto Exp $ +** Auxiliary functions from Lua API +** See Copyright Notice in lua.h +*/ + +#ifndef lapi_h +#define lapi_h + + +#include "lobject.h" + + +LUAI_FUNC void luaA_pushobject (lua_State *L, const TValue *o); + +#endif diff --git a/ref/lua-5.1/src/lauxlib.c b/ref/lua-5.1/src/lauxlib.c new file mode 100644 index 0000000..317a48d --- /dev/null +++ b/ref/lua-5.1/src/lauxlib.c @@ -0,0 +1,647 @@ +/* +** $Id: lauxlib.c,v 1.158 2006/01/16 12:42:21 roberto Exp $ +** Auxiliary functions for building Lua libraries +** See Copyright Notice in lua.h +*/ + + +#include +#include +#include +#include +#include +#include + + +/* This file uses only the official API of Lua. +** Any function declared here could be written as an application function. +*/ + +#define lauxlib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" + + +#define FREELIST_REF 0 /* free list of references */ + + +/* convert a stack index to positive */ +#define abs_index(L, i) ((i) > 0 || (i) <= LUA_REGISTRYINDEX ? (i) : \ + lua_gettop(L) + (i) + 1) + + +/* +** {====================================================== +** Error-report functions +** ======================================================= +*/ + + +LUALIB_API int luaL_argerror (lua_State *L, int narg, const char *extramsg) { + lua_Debug ar; + if (!lua_getstack(L, 0, &ar)) /* no stack frame? */ + return luaL_error(L, "bad argument #%d (%s)", narg, extramsg); + lua_getinfo(L, "n", &ar); + if (strcmp(ar.namewhat, "method") == 0) { + narg--; /* do not count `self' */ + if (narg == 0) /* error is in the self argument itself? */ + return luaL_error(L, "calling " LUA_QS " on bad self (%s)", + ar.name, extramsg); + } + if (ar.name == NULL) + ar.name = "?"; + return luaL_error(L, "bad argument #%d to " LUA_QS " (%s)", + narg, ar.name, extramsg); +} + + +LUALIB_API int luaL_typerror (lua_State *L, int narg, const char *tname) { + const char *msg = lua_pushfstring(L, "%s expected, got %s", + tname, luaL_typename(L, narg)); + return luaL_argerror(L, narg, msg); +} + + +static void tag_error (lua_State *L, int narg, int tag) { + luaL_typerror(L, narg, lua_typename(L, tag)); +} + + +LUALIB_API void luaL_where (lua_State *L, int level) { + lua_Debug ar; + if (lua_getstack(L, level, &ar)) { /* check function at level */ + lua_getinfo(L, "Sl", &ar); /* get info about it */ + if (ar.currentline > 0) { /* is there info? */ + lua_pushfstring(L, "%s:%d: ", ar.short_src, ar.currentline); + return; + } + } + lua_pushliteral(L, ""); /* else, no information available... */ +} + + +LUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) { + va_list argp; + va_start(argp, fmt); + luaL_where(L, 1); + lua_pushvfstring(L, fmt, argp); + va_end(argp); + lua_concat(L, 2); + return lua_error(L); +} + +/* }====================================================== */ + + +LUALIB_API int luaL_checkoption (lua_State *L, int narg, const char *def, + const char *const lst[]) { + const char *name = (def) ? luaL_optstring(L, narg, def) : + luaL_checkstring(L, narg); + int i; + for (i=0; lst[i]; i++) + if (strcmp(lst[i], name) == 0) + return i; + return luaL_argerror(L, narg, + lua_pushfstring(L, "invalid option " LUA_QS, name)); +} + + +LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) { + lua_getfield(L, LUA_REGISTRYINDEX, tname); /* get registry.name */ + if (!lua_isnil(L, -1)) /* name already in use? */ + return 0; /* leave previous value on top, but return 0 */ + lua_pop(L, 1); + lua_newtable(L); /* create metatable */ + lua_pushvalue(L, -1); + lua_setfield(L, LUA_REGISTRYINDEX, tname); /* registry.name = metatable */ + return 1; +} + + +LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) { + void *p = lua_touserdata(L, ud); + lua_getfield(L, LUA_REGISTRYINDEX, tname); /* get correct metatable */ + if (p == NULL || !lua_getmetatable(L, ud) || !lua_rawequal(L, -1, -2)) + luaL_typerror(L, ud, tname); + lua_pop(L, 2); /* remove both metatables */ + return p; +} + + +LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *mes) { + if (!lua_checkstack(L, space)) + luaL_error(L, "stack overflow (%s)", mes); +} + + +LUALIB_API void luaL_checktype (lua_State *L, int narg, int t) { + if (lua_type(L, narg) != t) + tag_error(L, narg, t); +} + + +LUALIB_API void luaL_checkany (lua_State *L, int narg) { + if (lua_type(L, narg) == LUA_TNONE) + luaL_argerror(L, narg, "value expected"); +} + + +LUALIB_API const char *luaL_checklstring (lua_State *L, int narg, size_t *len) { + const char *s = lua_tolstring(L, narg, len); + if (!s) tag_error(L, narg, LUA_TSTRING); + return s; +} + + +LUALIB_API const char *luaL_optlstring (lua_State *L, int narg, + const char *def, size_t *len) { + if (lua_isnoneornil(L, narg)) { + if (len) + *len = (def ? strlen(def) : 0); + return def; + } + else return luaL_checklstring(L, narg, len); +} + + +LUALIB_API lua_Number luaL_checknumber (lua_State *L, int narg) { + lua_Number d = lua_tonumber(L, narg); + if (d == 0 && !lua_isnumber(L, narg)) /* avoid extra test when d is not 0 */ + tag_error(L, narg, LUA_TNUMBER); + return d; +} + + +LUALIB_API lua_Number luaL_optnumber (lua_State *L, int narg, lua_Number def) { + return luaL_opt(L, luaL_checknumber, narg, def); +} + + +LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int narg) { + lua_Integer d = lua_tointeger(L, narg); + if (d == 0 && !lua_isnumber(L, narg)) /* avoid extra test when d is not 0 */ + tag_error(L, narg, LUA_TNUMBER); + return d; +} + + +LUALIB_API lua_Integer luaL_optinteger (lua_State *L, int narg, + lua_Integer def) { + return luaL_opt(L, luaL_checkinteger, narg, def); +} + + +LUALIB_API int luaL_getmetafield (lua_State *L, int obj, const char *event) { + if (!lua_getmetatable(L, obj)) /* no metatable? */ + return 0; + lua_pushstring(L, event); + lua_rawget(L, -2); + if (lua_isnil(L, -1)) { + lua_pop(L, 2); /* remove metatable and metafield */ + return 0; + } + else { + lua_remove(L, -2); /* remove only metatable */ + return 1; + } +} + + +LUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) { + obj = abs_index(L, obj); + if (!luaL_getmetafield(L, obj, event)) /* no metafield? */ + return 0; + lua_pushvalue(L, obj); + lua_call(L, 1, 1); + return 1; +} + + +LUALIB_API void (luaL_register) (lua_State *L, const char *libname, + const luaL_Reg *l) { + luaI_openlib(L, libname, l, 0); +} + + +static int libsize (const luaL_Reg *l) { + int size = 0; + for (; l->name; l++) size++; + return size; +} + + +LUALIB_API void luaI_openlib (lua_State *L, const char *libname, + const luaL_Reg *l, int nup) { + if (libname) { + int size = libsize(l); + /* check whether lib already exists */ + luaL_findtable(L, LUA_REGISTRYINDEX, "_LOADED", size); + lua_getfield(L, -1, libname); /* get _LOADED[libname] */ + if (!lua_istable(L, -1)) { /* not found? */ + lua_pop(L, 1); /* remove previous result */ + /* try global variable (and create one if it does not exist) */ + if (luaL_findtable(L, LUA_GLOBALSINDEX, libname, size) != NULL) + luaL_error(L, "name conflict for module " LUA_QS, libname); + lua_pushvalue(L, -1); + lua_setfield(L, -3, libname); /* _LOADED[libname] = new table */ + } + lua_remove(L, -2); /* remove _LOADED table */ + lua_insert(L, -(nup+1)); /* move library table to below upvalues */ + } + for (; l->name; l++) { + int i; + for (i=0; ifunc, nup); + lua_setfield(L, -(nup+2), l->name); + } + lua_pop(L, nup); /* remove upvalues */ +} + + + +/* +** {====================================================== +** getn-setn: size for arrays +** ======================================================= +*/ + +#if defined(LUA_COMPAT_GETN) + +static int checkint (lua_State *L, int topop) { + int n = (lua_type(L, -1) == LUA_TNUMBER) ? lua_tointeger(L, -1) : -1; + lua_pop(L, topop); + return n; +} + + +static void getsizes (lua_State *L) { + lua_getfield(L, LUA_REGISTRYINDEX, "LUA_SIZES"); + if (lua_isnil(L, -1)) { /* no `size' table? */ + lua_pop(L, 1); /* remove nil */ + lua_newtable(L); /* create it */ + lua_pushvalue(L, -1); /* `size' will be its own metatable */ + lua_setmetatable(L, -2); + lua_pushliteral(L, "kv"); + lua_setfield(L, -2, "__mode"); /* metatable(N).__mode = "kv" */ + lua_pushvalue(L, -1); + lua_setfield(L, LUA_REGISTRYINDEX, "LUA_SIZES"); /* store in register */ + } +} + + +LUALIB_API void luaL_setn (lua_State *L, int t, int n) { + t = abs_index(L, t); + lua_pushliteral(L, "n"); + lua_rawget(L, t); + if (checkint(L, 1) >= 0) { /* is there a numeric field `n'? */ + lua_pushliteral(L, "n"); /* use it */ + lua_pushinteger(L, n); + lua_rawset(L, t); + } + else { /* use `sizes' */ + getsizes(L); + lua_pushvalue(L, t); + lua_pushinteger(L, n); + lua_rawset(L, -3); /* sizes[t] = n */ + lua_pop(L, 1); /* remove `sizes' */ + } +} + + +LUALIB_API int luaL_getn (lua_State *L, int t) { + int n; + t = abs_index(L, t); + lua_pushliteral(L, "n"); /* try t.n */ + lua_rawget(L, t); + if ((n = checkint(L, 1)) >= 0) return n; + getsizes(L); /* else try sizes[t] */ + lua_pushvalue(L, t); + lua_rawget(L, -2); + if ((n = checkint(L, 2)) >= 0) return n; + return (int)lua_objlen(L, t); +} + +#endif + +/* }====================================================== */ + + + +LUALIB_API const char *luaL_gsub (lua_State *L, const char *s, const char *p, + const char *r) { + const char *wild; + size_t l = strlen(p); + luaL_Buffer b; + luaL_buffinit(L, &b); + while ((wild = strstr(s, p)) != NULL) { + luaL_addlstring(&b, s, wild - s); /* push prefix */ + luaL_addstring(&b, r); /* push replacement in place of pattern */ + s = wild + l; /* continue after `p' */ + } + luaL_addstring(&b, s); /* push last suffix */ + luaL_pushresult(&b); + return lua_tostring(L, -1); +} + + +LUALIB_API const char *luaL_findtable (lua_State *L, int idx, + const char *fname, int szhint) { + const char *e; + lua_pushvalue(L, idx); + do { + e = strchr(fname, '.'); + if (e == NULL) e = fname + strlen(fname); + lua_pushlstring(L, fname, e - fname); + lua_rawget(L, -2); + if (lua_isnil(L, -1)) { /* no such field? */ + lua_pop(L, 1); /* remove this nil */ + lua_createtable(L, 0, (*e == '.' ? 1 : szhint)); /* new table for field */ + lua_pushlstring(L, fname, e - fname); + lua_pushvalue(L, -2); + lua_settable(L, -4); /* set new table into field */ + } + else if (!lua_istable(L, -1)) { /* field has a non-table value? */ + lua_pop(L, 2); /* remove table and value */ + return fname; /* return problematic part of the name */ + } + lua_remove(L, -2); /* remove previous table */ + fname = e + 1; + } while (*e == '.'); + return NULL; +} + + + +/* +** {====================================================== +** Generic Buffer manipulation +** ======================================================= +*/ + + +#define bufflen(B) ((B)->p - (B)->buffer) +#define bufffree(B) ((size_t)(LUAL_BUFFERSIZE - bufflen(B))) + +#define LIMIT (LUA_MINSTACK/2) + + +static int emptybuffer (luaL_Buffer *B) { + size_t l = bufflen(B); + if (l == 0) return 0; /* put nothing on stack */ + else { + lua_pushlstring(B->L, B->buffer, l); + B->p = B->buffer; + B->lvl++; + return 1; + } +} + + +static void adjuststack (luaL_Buffer *B) { + if (B->lvl > 1) { + lua_State *L = B->L; + int toget = 1; /* number of levels to concat */ + size_t toplen = lua_strlen(L, -1); + do { + size_t l = lua_strlen(L, -(toget+1)); + if (B->lvl - toget + 1 >= LIMIT || toplen > l) { + toplen += l; + toget++; + } + else break; + } while (toget < B->lvl); + lua_concat(L, toget); + B->lvl = B->lvl - toget + 1; + } +} + + +LUALIB_API char *luaL_prepbuffer (luaL_Buffer *B) { + if (emptybuffer(B)) + adjuststack(B); + return B->buffer; +} + + +LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) { + while (l--) + luaL_addchar(B, *s++); +} + + +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) { + emptybuffer(B); + lua_concat(B->L, B->lvl); + B->lvl = 1; +} + + +LUALIB_API void luaL_addvalue (luaL_Buffer *B) { + lua_State *L = B->L; + size_t vl; + const char *s = lua_tolstring(L, -1, &vl); + if (vl <= bufffree(B)) { /* fit into buffer? */ + memcpy(B->p, s, vl); /* put it there */ + B->p += vl; + lua_pop(L, 1); /* remove from stack */ + } + else { + if (emptybuffer(B)) + lua_insert(L, -2); /* put buffer before new value */ + B->lvl++; /* add new value into B stack */ + adjuststack(B); + } +} + + +LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) { + B->L = L; + B->p = B->buffer; + B->lvl = 0; +} + +/* }====================================================== */ + + +LUALIB_API int luaL_ref (lua_State *L, int t) { + int ref; + t = abs_index(L, t); + if (lua_isnil(L, -1)) { + lua_pop(L, 1); /* remove from stack */ + return LUA_REFNIL; /* `nil' has a unique fixed reference */ + } + lua_rawgeti(L, t, FREELIST_REF); /* get first free element */ + ref = (int)lua_tointeger(L, -1); /* ref = t[FREELIST_REF] */ + lua_pop(L, 1); /* remove it from stack */ + if (ref != 0) { /* any free element? */ + lua_rawgeti(L, t, ref); /* remove it from list */ + lua_rawseti(L, t, FREELIST_REF); /* (t[FREELIST_REF] = t[ref]) */ + } + else { /* no free elements */ + ref = (int)lua_objlen(L, t); + ref++; /* create 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 = abs_index(L, t); + lua_rawgeti(L, t, FREELIST_REF); + lua_rawseti(L, t, ref); /* t[ref] = t[FREELIST_REF] */ + lua_pushinteger(L, ref); + lua_rawseti(L, t, FREELIST_REF); /* t[FREELIST_REF] = ref */ + } +} + + + +/* +** {====================================================== +** Load functions +** ======================================================= +*/ + +typedef struct LoadF { + int extraline; + FILE *f; + char buff[LUAL_BUFFERSIZE]; +} LoadF; + + +static const char *getF (lua_State *L, void *ud, size_t *size) { + LoadF *lf = (LoadF *)ud; + (void)L; + if (lf->extraline) { + lf->extraline = 0; + *size = 1; + return "\n"; + } + if (feof(lf->f)) return NULL; + *size = fread(lf->buff, 1, LUAL_BUFFERSIZE, lf->f); + return (*size > 0) ? lf->buff : NULL; +} + + +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; +} + + +LUALIB_API int luaL_loadfile (lua_State *L, const char *filename) { + LoadF lf; + int status, readstatus; + int c; + int fnameindex = lua_gettop(L) + 1; /* index of filename on the stack */ + lf.extraline = 0; + 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); + } + c = getc(lf.f); + if (c == '#') { /* Unix exec. file? */ + lf.extraline = 1; + while ((c = getc(lf.f)) != EOF && c != '\n') ; /* skip first line */ + if (c == '\n') c = getc(lf.f); + } + if (c == LUA_SIGNATURE[0] && lf.f != stdin) { /* binary file? */ + fclose(lf.f); + lf.f = fopen(filename, "rb"); /* reopen in binary mode */ + if (lf.f == NULL) return errfile(L, "reopen", fnameindex); + /* skip eventual `#!...' */ + while ((c = getc(lf.f)) != EOF && c != LUA_SIGNATURE[0]) ; + lf.extraline = 0; + } + ungetc(c, lf.f); + status = lua_load(L, getF, &lf, lua_tostring(L, -1)); + readstatus = ferror(lf.f); + if (lf.f != stdin) 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; + if (ls->size == 0) return NULL; + *size = ls->size; + ls->size = 0; + return ls->s; +} + + +LUALIB_API int luaL_loadbuffer (lua_State *L, const char *buff, size_t size, + const char *name) { + LoadS ls; + ls.s = buff; + ls.size = size; + return lua_load(L, getS, &ls, name); +} + + +LUALIB_API int (luaL_loadstring) (lua_State *L, const char *s) { + return luaL_loadbuffer(L, s, strlen(s), s); +} + + + +/* }====================================================== */ + + +static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) { + (void)ud; + (void)osize; + if (nsize == 0) { + free(ptr); + return NULL; + } + else + return realloc(ptr, nsize); +} + + +static int panic (lua_State *L) { + (void)L; /* to avoid warnings */ + fprintf(stderr, "PANIC: unprotected error in call to Lua API (%s)\n", + lua_tostring(L, -1)); + return 0; +} + + +LUALIB_API lua_State *luaL_newstate (void) { + lua_State *L = lua_newstate(l_alloc, NULL); + if (L) lua_atpanic(L, &panic); + return L; +} + diff --git a/ref/lua-5.1/src/lauxlib.h b/ref/lua-5.1/src/lauxlib.h new file mode 100644 index 0000000..1bba1c0 --- /dev/null +++ b/ref/lua-5.1/src/lauxlib.h @@ -0,0 +1,172 @@ +/* +** $Id: lauxlib.h,v 1.87 2005/12/29 15:32:11 roberto Exp $ +** Auxiliary functions for building Lua libraries +** See Copyright Notice in lua.h +*/ + + +#ifndef lauxlib_h +#define lauxlib_h + + +#include +#include + +#include "lua.h" + + +#if defined(LUA_COMPAT_GETN) +LUALIB_API int (luaL_getn) (lua_State *L, int t); +LUALIB_API void (luaL_setn) (lua_State *L, int t, int n); +#else +#define luaL_getn(L,i) ((int)lua_objlen(L, i)) +#define luaL_setn(L,i,j) ((void)0) /* no op! */ +#endif + +#if defined(LUA_COMPAT_OPENLIB) +#define luaI_openlib luaL_openlib +#endif + + +/* extra error code for `luaL_load' */ +#define LUA_ERRFILE (LUA_ERRERR+1) + + +typedef struct luaL_Reg { + const char *name; + lua_CFunction func; +} luaL_Reg; + + + +LUALIB_API void (luaI_openlib) (lua_State *L, const char *libname, + const luaL_Reg *l, int nup); +LUALIB_API void (luaL_register) (lua_State *L, const char *libname, + const luaL_Reg *l); +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 int (luaL_typerror) (lua_State *L, int narg, const char *tname); +LUALIB_API int (luaL_argerror) (lua_State *L, int numarg, const char *extramsg); +LUALIB_API const char *(luaL_checklstring) (lua_State *L, int numArg, + size_t *l); +LUALIB_API const char *(luaL_optlstring) (lua_State *L, int numArg, + const char *def, size_t *l); +LUALIB_API lua_Number (luaL_checknumber) (lua_State *L, int numArg); +LUALIB_API lua_Number (luaL_optnumber) (lua_State *L, int nArg, lua_Number def); + +LUALIB_API lua_Integer (luaL_checkinteger) (lua_State *L, int numArg); +LUALIB_API lua_Integer (luaL_optinteger) (lua_State *L, int nArg, + lua_Integer def); + +LUALIB_API void (luaL_checkstack) (lua_State *L, int sz, const char *msg); +LUALIB_API void (luaL_checktype) (lua_State *L, int narg, int t); +LUALIB_API void (luaL_checkany) (lua_State *L, int narg); + +LUALIB_API int (luaL_newmetatable) (lua_State *L, const char *tname); +LUALIB_API void *(luaL_checkudata) (lua_State *L, int ud, const char *tname); + +LUALIB_API void (luaL_where) (lua_State *L, int lvl); +LUALIB_API int (luaL_error) (lua_State *L, const char *fmt, ...); + +LUALIB_API int (luaL_checkoption) (lua_State *L, int narg, const char *def, + const char *const lst[]); + +LUALIB_API int (luaL_ref) (lua_State *L, int t); +LUALIB_API void (luaL_unref) (lua_State *L, int t, int ref); + +LUALIB_API int (luaL_loadfile) (lua_State *L, const char *filename); +LUALIB_API int (luaL_loadbuffer) (lua_State *L, const char *buff, size_t sz, + const char *name); +LUALIB_API int (luaL_loadstring) (lua_State *L, const char *s); + +LUALIB_API lua_State *(luaL_newstate) (void); + + +LUALIB_API const char *(luaL_gsub) (lua_State *L, const char *s, const char *p, + const char *r); + +LUALIB_API const char *(luaL_findtable) (lua_State *L, int idx, + const char *fname, int szhint); + + + + +/* +** =============================================================== +** some useful macros +** =============================================================== +*/ + +#define luaL_argcheck(L, cond,numarg,extramsg) \ + ((void)((cond) || luaL_argerror(L, (numarg), (extramsg)))) +#define luaL_checkstring(L,n) (luaL_checklstring(L, (n), NULL)) +#define luaL_optstring(L,n,d) (luaL_optlstring(L, (n), (d), NULL)) +#define luaL_checkint(L,n) ((int)luaL_checkinteger(L, (n))) +#define luaL_optint(L,n,d) ((int)luaL_optinteger(L, (n), (d))) +#define luaL_checklong(L,n) ((long)luaL_checkinteger(L, (n))) +#define luaL_optlong(L,n,d) ((long)luaL_optinteger(L, (n), (d))) + +#define luaL_typename(L,i) lua_typename(L, lua_type(L,(i))) + +#define luaL_dofile(L, fn) (luaL_loadfile(L, fn) || lua_pcall(L, 0, 0, 0)) + +#define luaL_dostring(L, s) (luaL_loadstring(L, s) || lua_pcall(L, 0, 0, 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))) + +/* +** {====================================================== +** Generic Buffer manipulation +** ======================================================= +*/ + + + +typedef struct luaL_Buffer { + char *p; /* current position in buffer */ + int lvl; /* number of strings in the stack (level) */ + lua_State *L; + char buffer[LUAL_BUFFERSIZE]; +} luaL_Buffer; + +#define luaL_addchar(B,c) \ + ((void)((B)->p < ((B)->buffer+LUAL_BUFFERSIZE) || luaL_prepbuffer(B)), \ + (*(B)->p++ = (char)(c))) + +/* compatibility only */ +#define luaL_putchar(B,c) luaL_addchar(B,c) + +#define luaL_addsize(B,n) ((B)->p += (n)) + +LUALIB_API void (luaL_buffinit) (lua_State *L, luaL_Buffer *B); +LUALIB_API char *(luaL_prepbuffer) (luaL_Buffer *B); +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); + + +/* }====================================================== */ + + +/* compatibility with ref system */ + +/* pre-defined references */ +#define LUA_NOREF (-2) +#define LUA_REFNIL (-1) + +#define lua_ref(L,lock) ((lock) ? luaL_ref(L, LUA_REGISTRYINDEX) : \ + (lua_pushstring(L, "unlocked references are obsolete"), lua_error(L), 0)) + +#define lua_unref(L,ref) luaL_unref(L, LUA_REGISTRYINDEX, (ref)) + +#define lua_getref(L,ref) lua_rawgeti(L, LUA_REGISTRYINDEX, (ref)) + + +#define luaL_reg luaL_Reg + +#endif + + diff --git a/ref/lua-5.1/src/lbaselib.c b/ref/lua-5.1/src/lbaselib.c new file mode 100644 index 0000000..1d922a8 --- /dev/null +++ b/ref/lua-5.1/src/lbaselib.c @@ -0,0 +1,643 @@ +/* +** $Id: lbaselib.c,v 1.189 2006/01/18 11:49:12 roberto Exp $ +** Basic library +** See Copyright Notice in lua.h +*/ + + + +#include +#include +#include +#include + +#define lbaselib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + + + +/* +** If your system does not support `stdout', you can just remove this function. +** If you need, you can define your own `print' function, following this +** model but changing `fputs' to put the strings at a proper place +** (a console window or a log file, for instance). +*/ +static int luaB_print (lua_State *L) { + int n = lua_gettop(L); /* number of arguments */ + int i; + lua_getglobal(L, "tostring"); + for (i=1; i<=n; i++) { + const char *s; + lua_pushvalue(L, -1); /* function to be called */ + lua_pushvalue(L, i); /* value to print */ + lua_call(L, 1, 1); + s = lua_tostring(L, -1); /* get result */ + if (s == NULL) + return luaL_error(L, LUA_QL("tostring") " must return a string to " + LUA_QL("print")); + if (i>1) fputs("\t", stdout); + fputs(s, stdout); + lua_pop(L, 1); /* pop result */ + } + fputs("\n", stdout); + return 0; +} + + +static int luaB_tonumber (lua_State *L) { + int base = luaL_optint(L, 2, 10); + if (base == 10) { /* standard conversion */ + luaL_checkany(L, 1); + if (lua_isnumber(L, 1)) { + lua_pushnumber(L, lua_tonumber(L, 1)); + return 1; + } + } + else { + const char *s1 = luaL_checkstring(L, 1); + char *s2; + unsigned long n; + luaL_argcheck(L, 2 <= base && base <= 36, 2, "base out of range"); + n = strtoul(s1, &s2, base); + if (s1 != s2) { /* at least one valid digit? */ + while (isspace((unsigned char)(*s2))) s2++; /* skip trailing spaces */ + if (*s2 == '\0') { /* no invalid trailing characters? */ + lua_pushnumber(L, (lua_Number)n); + return 1; + } + } + } + lua_pushnil(L); /* else not a number */ + return 1; +} + + +static int luaB_error (lua_State *L) { + int level = luaL_optint(L, 2, 1); + lua_settop(L, 1); + if (lua_isstring(L, 1) && level > 0) { /* add extra information? */ + luaL_where(L, level); + lua_pushvalue(L, 1); + lua_concat(L, 2); + } + return lua_error(L); +} + + +static int luaB_getmetatable (lua_State *L) { + luaL_checkany(L, 1); + if (!lua_getmetatable(L, 1)) { + lua_pushnil(L); + return 1; /* no metatable */ + } + luaL_getmetafield(L, 1, "__metatable"); + return 1; /* returns either __metatable field (if present) or metatable */ +} + + +static int luaB_setmetatable (lua_State *L) { + int t = lua_type(L, 2); + luaL_checktype(L, 1, LUA_TTABLE); + luaL_argcheck(L, t == LUA_TNIL || t == LUA_TTABLE, 2, + "nil or table expected"); + if (luaL_getmetafield(L, 1, "__metatable")) + luaL_error(L, "cannot change a protected metatable"); + lua_settop(L, 2); + lua_setmetatable(L, 1); + return 1; +} + + +static void getfunc (lua_State *L) { + if (lua_isfunction(L, 1)) lua_pushvalue(L, 1); + else { + lua_Debug ar; + int level = luaL_optint(L, 1, 1); + luaL_argcheck(L, level >= 0, 1, "level must be non-negative"); + if (lua_getstack(L, level, &ar) == 0) + luaL_argerror(L, 1, "invalid level"); + lua_getinfo(L, "f", &ar); + if (lua_isnil(L, -1)) + luaL_error(L, "no function environment for tail call at level %d", + level); + } +} + + +static int luaB_getfenv (lua_State *L) { + getfunc(L); + if (lua_iscfunction(L, -1)) /* is a C function? */ + lua_pushvalue(L, LUA_GLOBALSINDEX); /* return the thread's global env. */ + else + lua_getfenv(L, -1); + return 1; +} + + +static int luaB_setfenv (lua_State *L) { + luaL_checktype(L, 2, LUA_TTABLE); + getfunc(L); + lua_pushvalue(L, 2); + if (lua_isnumber(L, 1) && lua_tonumber(L, 1) == 0) { + /* change environment of current thread */ + lua_pushthread(L); + lua_insert(L, -2); + lua_setfenv(L, -2); + return 0; + } + else if (lua_iscfunction(L, -2) || lua_setfenv(L, -2) == 0) + luaL_error(L, + LUA_QL("setfenv") " cannot change environment of given object"); + 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_rawget (lua_State *L) { + luaL_checktype(L, 1, LUA_TTABLE); + luaL_checkany(L, 2); + lua_settop(L, 2); + lua_rawget(L, 1); + return 1; +} + +static int luaB_rawset (lua_State *L) { + luaL_checktype(L, 1, LUA_TTABLE); + luaL_checkany(L, 2); + luaL_checkany(L, 3); + lua_settop(L, 3); + lua_rawset(L, 1); + return 1; +} + + +static int luaB_gcinfo (lua_State *L) { + lua_pushinteger(L, lua_getgccount(L)); + return 1; +} + + +static int luaB_collectgarbage (lua_State *L) { + static const char *const opts[] = {"stop", "restart", "collect", + "count", "step", "setpause", "setstepmul", NULL}; + static const int optsnum[] = {LUA_GCSTOP, LUA_GCRESTART, LUA_GCCOLLECT, + LUA_GCCOUNT, LUA_GCSTEP, LUA_GCSETPAUSE, LUA_GCSETSTEPMUL}; + int o = luaL_checkoption(L, 1, "collect", opts); + int ex = luaL_optint(L, 2, 0); + int res = lua_gc(L, optsnum[o], ex); + switch (optsnum[o]) { + case LUA_GCCOUNT: { + int b = lua_gc(L, LUA_GCCOUNTB, 0); + lua_pushnumber(L, res + ((lua_Number)b/1024)); + return 1; + } + case LUA_GCSTEP: { + lua_pushboolean(L, res); + return 1; + } + default: { + lua_pushnumber(L, res); + return 1; + } + } +} + + +static int luaB_type (lua_State *L) { + luaL_checkany(L, 1); + lua_pushstring(L, luaL_typename(L, 1)); + return 1; +} + + +static int luaB_next (lua_State *L) { + luaL_checktype(L, 1, LUA_TTABLE); + lua_settop(L, 2); /* create a 2nd argument if there isn't one */ + if (lua_next(L, 1)) + return 2; + else { + lua_pushnil(L); + return 1; + } +} + + +static int luaB_pairs (lua_State *L) { + luaL_checktype(L, 1, LUA_TTABLE); + lua_pushvalue(L, lua_upvalueindex(1)); /* return generator, */ + lua_pushvalue(L, 1); /* state, */ + lua_pushnil(L); /* and initial value */ + return 3; +} + + +static int ipairsaux (lua_State *L) { + int i = luaL_checkint(L, 2); + luaL_checktype(L, 1, LUA_TTABLE); + i++; /* next value */ + lua_pushinteger(L, i); + lua_rawgeti(L, 1, i); + return (lua_isnil(L, -1)) ? 0 : 2; +} + + +static int luaB_ipairs (lua_State *L) { + luaL_checktype(L, 1, LUA_TTABLE); + lua_pushvalue(L, lua_upvalueindex(1)); /* return generator, */ + lua_pushvalue(L, 1); /* state, */ + lua_pushinteger(L, 0); /* and initial value */ + return 3; +} + + +static int load_aux (lua_State *L, int status) { + if (status == 0) /* OK? */ + return 1; + else { + lua_pushnil(L); + lua_insert(L, -2); /* put before error message */ + return 2; /* return nil plus error message */ + } +} + + +static int luaB_loadstring (lua_State *L) { + size_t l; + const char *s = luaL_checklstring(L, 1, &l); + const char *chunkname = luaL_optstring(L, 2, s); + return load_aux(L, luaL_loadbuffer(L, s, l, chunkname)); +} + + +static int luaB_loadfile (lua_State *L) { + const char *fname = luaL_optstring(L, 1, NULL); + return load_aux(L, luaL_loadfile(L, fname)); +} + + +/* +** 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; /* to avoid warnings */ + 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)) { + *size = 0; + return NULL; + } + else if (lua_isstring(L, -1)) { + lua_replace(L, 3); /* save string in a reserved stack slot */ + return lua_tolstring(L, 3, size); + } + else luaL_error(L, "reader function must return a string"); + return NULL; /* to avoid warnings */ +} + + +static int luaB_load (lua_State *L) { + int status; + const char *cname = luaL_optstring(L, 2, "=(load)"); + luaL_checktype(L, 1, LUA_TFUNCTION); + lua_settop(L, 3); /* function, eventual name, plus one reserved slot */ + status = lua_load(L, generic_reader, NULL, cname); + return load_aux(L, status); +} + + +static int luaB_dofile (lua_State *L) { + const char *fname = luaL_optstring(L, 1, NULL); + int n = lua_gettop(L); + if (luaL_loadfile(L, fname) != 0) lua_error(L); + lua_call(L, 0, LUA_MULTRET); + return lua_gettop(L) - n; +} + + +static int luaB_assert (lua_State *L) { + luaL_checkany(L, 1); + if (!lua_toboolean(L, 1)) + return luaL_error(L, "%s", luaL_optstring(L, 2, "assertion failed!")); + return lua_gettop(L); +} + + +static int luaB_unpack (lua_State *L) { + int i, e, n; + luaL_checktype(L, 1, LUA_TTABLE); + i = luaL_optint(L, 2, 1); + e = luaL_opt(L, luaL_checkint, 3, luaL_getn(L, 1)); + n = e - i + 1; /* number of elements */ + if (n <= 0) return 0; /* empty range */ + luaL_checkstack(L, n, "table too big to unpack"); + for (; i<=e; i++) /* push arg[i...e] */ + lua_rawgeti(L, 1, i); + return n; +} + + +static int luaB_select (lua_State *L) { + int n = lua_gettop(L); + if (lua_type(L, 1) == LUA_TSTRING && *lua_tostring(L, 1) == '#') { + lua_pushinteger(L, n-1); + return 1; + } + else { + int i = luaL_checkint(L, 1); + if (i < 0) i = n + i; + else if (i > n) i = n; + luaL_argcheck(L, 1 <= i, 1, "index out of range"); + return n - i; + } +} + + +static int luaB_pcall (lua_State *L) { + int status; + luaL_checkany(L, 1); + status = lua_pcall(L, lua_gettop(L) - 1, LUA_MULTRET, 0); + lua_pushboolean(L, (status == 0)); + lua_insert(L, 1); + return lua_gettop(L); /* return status + all results */ +} + + +static int luaB_xpcall (lua_State *L) { + int status; + luaL_checkany(L, 2); + lua_settop(L, 2); + lua_insert(L, 1); /* put error function under function to be called */ + status = lua_pcall(L, 0, LUA_MULTRET, 1); + lua_pushboolean(L, (status == 0)); + lua_replace(L, 1); + return lua_gettop(L); /* return status + all results */ +} + + +static int luaB_tostring (lua_State *L) { + luaL_checkany(L, 1); + if (luaL_callmeta(L, 1, "__tostring")) /* is there a metafield? */ + return 1; /* use its value */ + switch (lua_type(L, 1)) { + case LUA_TNUMBER: + lua_pushstring(L, lua_tostring(L, 1)); + break; + case LUA_TSTRING: + lua_pushvalue(L, 1); + break; + case LUA_TBOOLEAN: + lua_pushstring(L, (lua_toboolean(L, 1) ? "true" : "false")); + break; + case LUA_TNIL: + lua_pushliteral(L, "nil"); + break; + default: + lua_pushfstring(L, "%s: %p", luaL_typename(L, 1), lua_topointer(L, 1)); + break; + } + return 1; +} + + +static int luaB_newproxy (lua_State *L) { + lua_settop(L, 1); + lua_newuserdata(L, 0); /* create proxy */ + if (lua_toboolean(L, 1) == 0) + return 1; /* no metatable */ + else if (lua_isboolean(L, 1)) { + lua_newtable(L); /* create a new metatable `m' ... */ + lua_pushvalue(L, -1); /* ... and mark `m' as a valid metatable */ + lua_pushboolean(L, 1); + lua_rawset(L, lua_upvalueindex(1)); /* weaktable[m] = true */ + } + else { + int validproxy = 0; /* to check if weaktable[metatable(u)] == true */ + if (lua_getmetatable(L, 1)) { + lua_rawget(L, lua_upvalueindex(1)); + validproxy = lua_toboolean(L, -1); + lua_pop(L, 1); /* remove value */ + } + luaL_argcheck(L, validproxy, 1, "boolean or proxy expected"); + lua_getmetatable(L, 1); /* metatable is valid; get it */ + } + lua_setmetatable(L, 2); + return 1; +} + + +static const luaL_Reg base_funcs[] = { + {"assert", luaB_assert}, + {"collectgarbage", luaB_collectgarbage}, + {"dofile", luaB_dofile}, + {"error", luaB_error}, + {"gcinfo", luaB_gcinfo}, + {"getfenv", luaB_getfenv}, + {"getmetatable", luaB_getmetatable}, + {"loadfile", luaB_loadfile}, + {"load", luaB_load}, + {"loadstring", luaB_loadstring}, + {"next", luaB_next}, + {"pcall", luaB_pcall}, + {"print", luaB_print}, + {"rawequal", luaB_rawequal}, + {"rawget", luaB_rawget}, + {"rawset", luaB_rawset}, + {"select", luaB_select}, + {"setfenv", luaB_setfenv}, + {"setmetatable", luaB_setmetatable}, + {"tonumber", luaB_tonumber}, + {"tostring", luaB_tostring}, + {"type", luaB_type}, + {"unpack", luaB_unpack}, + {"xpcall", luaB_xpcall}, + {NULL, NULL} +}; + + +/* +** {====================================================== +** Coroutine library +** ======================================================= +*/ + +static int auxresume (lua_State *L, lua_State *co, int narg) { + int status; + if (!lua_checkstack(co, narg)) + luaL_error(L, "too many arguments to resume"); + if (lua_status(co) == 0 && lua_gettop(co) == 0) { + lua_pushliteral(L, "cannot resume dead coroutine"); + return -1; /* error flag */ + } + lua_xmove(L, co, narg); + status = lua_resume(co, narg); + if (status == 0 || status == LUA_YIELD) { + int nres = lua_gettop(co); + if (!lua_checkstack(L, nres)) + luaL_error(L, "too many results to resume"); + lua_xmove(co, L, nres); /* move yielded values */ + return nres; + } + else { + lua_xmove(co, L, 1); /* move error message */ + return -1; /* error flag */ + } +} + + +static int luaB_coresume (lua_State *L) { + lua_State *co = lua_tothread(L, 1); + int r; + luaL_argcheck(L, co, 1, "coroutine expected"); + r = auxresume(L, co, lua_gettop(L) - 1); + if (r < 0) { + lua_pushboolean(L, 0); + lua_insert(L, -2); + return 2; /* return false + error message */ + } + else { + lua_pushboolean(L, 1); + lua_insert(L, -(r + 1)); + return r + 1; /* return true + `resume' returns */ + } +} + + +static int luaB_auxwrap (lua_State *L) { + lua_State *co = lua_tothread(L, lua_upvalueindex(1)); + int r = auxresume(L, co, lua_gettop(L)); + if (r < 0) { + if (lua_isstring(L, -1)) { /* error object is a string? */ + luaL_where(L, 1); /* add extra info */ + lua_insert(L, -2); + lua_concat(L, 2); + } + lua_error(L); /* propagate error */ + } + return r; +} + + +static int luaB_cocreate (lua_State *L) { + lua_State *NL = lua_newthread(L); + luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), 1, + "Lua function expected"); + lua_pushvalue(L, 1); /* move function to top */ + lua_xmove(L, NL, 1); /* move function from L to NL */ + return 1; +} + + +static int luaB_cowrap (lua_State *L) { + luaB_cocreate(L); + lua_pushcclosure(L, luaB_auxwrap, 1); + return 1; +} + + +static int luaB_yield (lua_State *L) { + return lua_yield(L, lua_gettop(L)); +} + + +static int luaB_costatus (lua_State *L) { + lua_State *co = lua_tothread(L, 1); + luaL_argcheck(L, co, 1, "coroutine expected"); + if (L == co) lua_pushliteral(L, "running"); + else { + switch (lua_status(co)) { + case LUA_YIELD: + lua_pushliteral(L, "suspended"); + break; + case 0: { + lua_Debug ar; + if (lua_getstack(co, 0, &ar) > 0) /* does it have frames? */ + lua_pushliteral(L, "normal"); /* it is running */ + else if (lua_gettop(co) == 0) + lua_pushliteral(L, "dead"); + else + lua_pushliteral(L, "suspended"); /* initial state */ + break; + } + default: /* some error occured */ + lua_pushliteral(L, "dead"); + break; + } + } + return 1; +} + + +static int luaB_corunning (lua_State *L) { + if (lua_pushthread(L)) + return 0; /* main thread is not a coroutine */ + else + return 1; +} + + +static const luaL_Reg co_funcs[] = { + {"create", luaB_cocreate}, + {"resume", luaB_coresume}, + {"running", luaB_corunning}, + {"status", luaB_costatus}, + {"wrap", luaB_cowrap}, + {"yield", luaB_yield}, + {NULL, NULL} +}; + +/* }====================================================== */ + + +static void auxopen (lua_State *L, const char *name, + lua_CFunction f, lua_CFunction u) { + lua_pushcfunction(L, u); + lua_pushcclosure(L, f, 1); + lua_setfield(L, -2, name); +} + + +static void base_open (lua_State *L) { + /* set global _G */ + lua_pushvalue(L, LUA_GLOBALSINDEX); + lua_setglobal(L, "_G"); + /* open lib into global table */ + luaL_register(L, "_G", base_funcs); + lua_pushliteral(L, LUA_VERSION); + lua_setglobal(L, "_VERSION"); /* set global _VERSION */ + /* `ipairs' and `pairs' need auxliliary functions as upvalues */ + auxopen(L, "ipairs", luaB_ipairs, ipairsaux); + auxopen(L, "pairs", luaB_pairs, luaB_next); + /* `newproxy' needs a weaktable as upvalue */ + lua_createtable(L, 0, 1); /* new table `w' */ + lua_pushvalue(L, -1); /* `w' will be its own metatable */ + lua_setmetatable(L, -2); + lua_pushliteral(L, "kv"); + lua_setfield(L, -2, "__mode"); /* metatable(w).__mode = "kv" */ + lua_pushcclosure(L, luaB_newproxy, 1); + lua_setglobal(L, "newproxy"); /* set global `newproxy' */ +} + + +LUALIB_API int luaopen_base (lua_State *L) { + base_open(L); + luaL_register(L, LUA_COLIBNAME, co_funcs); + return 2; +} + diff --git a/ref/lua-5.1/src/lcode.c b/ref/lua-5.1/src/lcode.c new file mode 100644 index 0000000..dd3e37e --- /dev/null +++ b/ref/lua-5.1/src/lcode.c @@ -0,0 +1,825 @@ +/* +** $Id: lcode.c,v 2.24 2005/12/22 16:19:56 roberto Exp $ +** Code generator for Lua +** See Copyright Notice in lua.h +*/ + + +#include + +#define lcode_c +#define LUA_CORE + +#include "lua.h" + +#include "lcode.h" +#include "ldebug.h" +#include "ldo.h" +#include "lgc.h" +#include "llex.h" +#include "lmem.h" +#include "lobject.h" +#include "lopcodes.h" +#include "lparser.h" +#include "ltable.h" + + +#define hasjumps(e) ((e)->t != (e)->f) + + +static int isnumeral(expdesc *e) { + return (e->k == VKNUM && e->t == NO_JUMP && e->f == NO_JUMP); +} + + +void luaK_nil (FuncState *fs, int from, int n) { + Instruction *previous; + if (fs->pc > fs->lasttarget) { /* no jumps to current position? */ + if (fs->pc == 0) /* function start? */ + return; /* positions are already clean */ + if (GET_OPCODE(*(previous = &fs->f->code[fs->pc-1])) == OP_LOADNIL) { + int pfrom = GETARG_A(*previous); + int pto = GETARG_B(*previous); + if (pfrom <= from && from <= pto+1) { /* can connect both? */ + if (from+n-1 > pto) + SETARG_B(*previous, from+n-1); + return; + } + } + } + luaK_codeABC(fs, OP_LOADNIL, from, from+n-1, 0); /* else no optimization */ +} + + +int luaK_jump (FuncState *fs) { + int jpc = fs->jpc; /* save list of jumps to here */ + int j; + fs->jpc = NO_JUMP; + j = luaK_codeAsBx(fs, OP_JMP, 0, NO_JUMP); + luaK_concat(fs, &j, jpc); /* keep them on hold */ + return j; +} + + +void luaK_ret (FuncState *fs, int first, int nret) { + luaK_codeABC(fs, OP_RETURN, first, nret+1, 0); +} + + +static int condjump (FuncState *fs, OpCode op, int A, int B, int C) { + luaK_codeABC(fs, op, A, B, C); + return luaK_jump(fs); +} + + +static void fixjump (FuncState *fs, int pc, int dest) { + Instruction *jmp = &fs->f->code[pc]; + int offset = dest-(pc+1); + lua_assert(dest != NO_JUMP); + if (abs(offset) > MAXARG_sBx) + luaX_syntaxerror(fs->ls, "control structure too long"); + SETARG_sBx(*jmp, offset); +} + + +/* +** returns current `pc' and marks it as a jump target (to avoid wrong +** optimizations with consecutive instructions not in the same basic block). +*/ +int luaK_getlabel (FuncState *fs) { + fs->lasttarget = fs->pc; + return fs->pc; +} + + +static int getjump (FuncState *fs, int pc) { + int offset = GETARG_sBx(fs->f->code[pc]); + if (offset == NO_JUMP) /* point to itself represents end of list */ + return NO_JUMP; /* end of list */ + else + return (pc+1)+offset; /* turn offset into absolute position */ +} + + +static Instruction *getjumpcontrol (FuncState *fs, int pc) { + Instruction *pi = &fs->f->code[pc]; + if (pc >= 1 && testTMode(GET_OPCODE(*(pi-1)))) + return pi-1; + else + return pi; +} + + +/* +** check whether list has any jump that do not produce a value +** (or produce an inverted value) +*/ +static int need_value (FuncState *fs, int list) { + for (; list != NO_JUMP; list = getjump(fs, list)) { + Instruction i = *getjumpcontrol(fs, list); + if (GET_OPCODE(i) != OP_TESTSET) return 1; + } + return 0; /* not found */ +} + + +static int patchtestreg (FuncState *fs, int node, int reg) { + Instruction *i = getjumpcontrol(fs, node); + if (GET_OPCODE(*i) != OP_TESTSET) + return 0; /* cannot patch other instructions */ + if (reg != NO_REG && reg != GETARG_B(*i)) + SETARG_A(*i, reg); + else /* no register to put value or register already has the value */ + *i = CREATE_ABC(OP_TEST, GETARG_B(*i), 0, GETARG_C(*i)); + + return 1; +} + + +static void removevalues (FuncState *fs, int list) { + for (; list != NO_JUMP; list = getjump(fs, list)) + patchtestreg(fs, list, NO_REG); +} + + +static void patchlistaux (FuncState *fs, int list, int vtarget, int reg, + int dtarget) { + while (list != NO_JUMP) { + int next = getjump(fs, list); + if (patchtestreg(fs, list, reg)) + fixjump(fs, list, vtarget); + else + fixjump(fs, list, dtarget); /* jump to default target */ + list = next; + } +} + + +static void dischargejpc (FuncState *fs) { + patchlistaux(fs, fs->jpc, fs->pc, NO_REG, fs->pc); + fs->jpc = NO_JUMP; +} + + +void luaK_patchlist (FuncState *fs, int list, int target) { + if (target == fs->pc) + luaK_patchtohere(fs, list); + else { + lua_assert(target < fs->pc); + patchlistaux(fs, list, target, NO_REG, target); + } +} + + +void luaK_patchtohere (FuncState *fs, int list) { + luaK_getlabel(fs); + luaK_concat(fs, &fs->jpc, list); +} + + +void luaK_concat (FuncState *fs, int *l1, int l2) { + if (l2 == NO_JUMP) return; + else if (*l1 == NO_JUMP) + *l1 = l2; + else { + int list = *l1; + int next; + while ((next = getjump(fs, list)) != NO_JUMP) /* find last element */ + list = next; + fixjump(fs, list, l2); + } +} + + +void luaK_checkstack (FuncState *fs, int n) { + int newstack = fs->freereg + n; + if (newstack > fs->f->maxstacksize) { + if (newstack >= MAXSTACK) + luaX_syntaxerror(fs->ls, "function or expression too complex"); + fs->f->maxstacksize = cast_byte(newstack); + } +} + + +void luaK_reserveregs (FuncState *fs, int n) { + luaK_checkstack(fs, n); + fs->freereg += n; +} + + +static void freereg (FuncState *fs, int reg) { + if (!ISK(reg) && reg >= fs->nactvar) { + fs->freereg--; + lua_assert(reg == fs->freereg); + } +} + + +static void freeexp (FuncState *fs, expdesc *e) { + if (e->k == VNONRELOC) + freereg(fs, e->u.s.info); +} + + +static int addk (FuncState *fs, TValue *k, TValue *v) { + lua_State *L = fs->L; + TValue *idx = luaH_set(L, fs->h, k); + Proto *f = fs->f; + int oldsize = f->sizek; + if (ttisnumber(idx)) { + lua_assert(luaO_rawequalObj(&fs->f->k[cast_int(nvalue(idx))], v)); + return cast_int(nvalue(idx)); + } + else { /* constant not found; create a new entry */ + setnvalue(idx, cast_num(fs->nk)); + luaM_growvector(L, f->k, fs->nk, f->sizek, TValue, + MAXARG_Bx, "constant table overflow"); + while (oldsize < f->sizek) setnilvalue(&f->k[oldsize++]); + setobj(L, &f->k[fs->nk], v); + luaC_barrier(L, f, v); + return fs->nk++; + } +} + + +int luaK_stringK (FuncState *fs, TString *s) { + TValue o; + setsvalue(fs->L, &o, s); + return addk(fs, &o, &o); +} + + +int luaK_numberK (FuncState *fs, lua_Number r) { + TValue o; + setnvalue(&o, r); + return addk(fs, &o, &o); +} + + +static int boolK (FuncState *fs, int b) { + TValue o; + setbvalue(&o, b); + return addk(fs, &o, &o); +} + + +static int nilK (FuncState *fs) { + TValue k, v; + setnilvalue(&v); + /* cannot use nil as key; instead use table itself to represent nil */ + sethvalue(fs->L, &k, fs->h); + return addk(fs, &k, &v); +} + + +void luaK_setreturns (FuncState *fs, expdesc *e, int nresults) { + if (e->k == VCALL) { /* expression is an open function call? */ + SETARG_C(getcode(fs, e), nresults+1); + } + else if (e->k == VVARARG) { + SETARG_B(getcode(fs, e), nresults+1); + SETARG_A(getcode(fs, e), fs->freereg); + luaK_reserveregs(fs, 1); + } +} + + +void luaK_setoneret (FuncState *fs, expdesc *e) { + if (e->k == VCALL) { /* expression is an open function call? */ + e->k = VNONRELOC; + e->u.s.info = GETARG_A(getcode(fs, e)); + } + else if (e->k == VVARARG) { + SETARG_B(getcode(fs, e), 2); + e->k = VRELOCABLE; /* can relocate its simple result */ + } +} + + +void luaK_dischargevars (FuncState *fs, expdesc *e) { + switch (e->k) { + case VLOCAL: { + e->k = VNONRELOC; + break; + } + case VUPVAL: { + e->u.s.info = luaK_codeABC(fs, OP_GETUPVAL, 0, e->u.s.info, 0); + e->k = VRELOCABLE; + break; + } + case VGLOBAL: { + e->u.s.info = luaK_codeABx(fs, OP_GETGLOBAL, 0, e->u.s.info); + e->k = VRELOCABLE; + break; + } + case VINDEXED: { + freereg(fs, e->u.s.aux); + freereg(fs, e->u.s.info); + e->u.s.info = luaK_codeABC(fs, OP_GETTABLE, 0, e->u.s.info, e->u.s.aux); + e->k = VRELOCABLE; + break; + } + case VVARARG: + case VCALL: { + luaK_setoneret(fs, e); + break; + } + default: break; /* there is one value available (somewhere) */ + } +} + + +static int code_label (FuncState *fs, int A, int b, int jump) { + luaK_getlabel(fs); /* those instructions may be jump targets */ + return luaK_codeABC(fs, OP_LOADBOOL, A, b, jump); +} + + +static void discharge2reg (FuncState *fs, expdesc *e, int reg) { + luaK_dischargevars(fs, e); + switch (e->k) { + case VNIL: { + luaK_nil(fs, reg, 1); + break; + } + case VFALSE: case VTRUE: { + luaK_codeABC(fs, OP_LOADBOOL, reg, e->k == VTRUE, 0); + break; + } + case VK: { + luaK_codeABx(fs, OP_LOADK, reg, e->u.s.info); + break; + } + case VKNUM: { + luaK_codeABx(fs, OP_LOADK, reg, luaK_numberK(fs, e->u.nval)); + break; + } + case VRELOCABLE: { + Instruction *pc = &getcode(fs, e); + SETARG_A(*pc, reg); + break; + } + case VNONRELOC: { + if (reg != e->u.s.info) + luaK_codeABC(fs, OP_MOVE, reg, e->u.s.info, 0); + break; + } + default: { + lua_assert(e->k == VVOID || e->k == VJMP); + return; /* nothing to do... */ + } + } + e->u.s.info = reg; + e->k = VNONRELOC; +} + + +static void discharge2anyreg (FuncState *fs, expdesc *e) { + if (e->k != VNONRELOC) { + luaK_reserveregs(fs, 1); + discharge2reg(fs, e, fs->freereg-1); + } +} + + +static void exp2reg (FuncState *fs, expdesc *e, int reg) { + discharge2reg(fs, e, reg); + if (e->k == VJMP) + luaK_concat(fs, &e->t, e->u.s.info); /* put this jump in `t' list */ + if (hasjumps(e)) { + int final; /* position after whole expression */ + int p_f = NO_JUMP; /* position of an eventual LOAD false */ + int p_t = NO_JUMP; /* position of an eventual LOAD true */ + if (need_value(fs, e->t) || need_value(fs, e->f)) { + int fj = (e->k == VJMP) ? NO_JUMP : luaK_jump(fs); + p_f = code_label(fs, reg, 0, 1); + p_t = code_label(fs, reg, 1, 0); + luaK_patchtohere(fs, fj); + } + final = luaK_getlabel(fs); + patchlistaux(fs, e->f, final, reg, p_f); + patchlistaux(fs, e->t, final, reg, p_t); + } + e->f = e->t = NO_JUMP; + e->u.s.info = reg; + e->k = VNONRELOC; +} + + +void luaK_exp2nextreg (FuncState *fs, expdesc *e) { + luaK_dischargevars(fs, e); + freeexp(fs, e); + luaK_reserveregs(fs, 1); + exp2reg(fs, e, fs->freereg - 1); +} + + +int luaK_exp2anyreg (FuncState *fs, expdesc *e) { + luaK_dischargevars(fs, e); + if (e->k == VNONRELOC) { + if (!hasjumps(e)) return e->u.s.info; /* exp is already in a register */ + if (e->u.s.info >= fs->nactvar) { /* reg. is not a local? */ + exp2reg(fs, e, e->u.s.info); /* put value on it */ + return e->u.s.info; + } + } + luaK_exp2nextreg(fs, e); /* default */ + return e->u.s.info; +} + + +void luaK_exp2val (FuncState *fs, expdesc *e) { + if (hasjumps(e)) + luaK_exp2anyreg(fs, e); + else + luaK_dischargevars(fs, e); +} + + +int luaK_exp2RK (FuncState *fs, expdesc *e) { + luaK_exp2val(fs, e); + switch (e->k) { + case VKNUM: + case VTRUE: + case VFALSE: + case VNIL: { + if (fs->nk <= MAXINDEXRK) { /* constant fit in RK operand? */ + e->u.s.info = (e->k == VNIL) ? nilK(fs) : + (e->k == VKNUM) ? luaK_numberK(fs, e->u.nval) : + boolK(fs, (e->k == VTRUE)); + e->k = VK; + return RKASK(e->u.s.info); + } + else break; + } + case VK: { + if (e->u.s.info <= MAXINDEXRK) /* constant fit in argC? */ + return RKASK(e->u.s.info); + else break; + } + default: break; + } + /* not a constant in the right range: put it in a register */ + return luaK_exp2anyreg(fs, e); +} + + +void luaK_storevar (FuncState *fs, expdesc *var, expdesc *ex) { + switch (var->k) { + case VLOCAL: { + freeexp(fs, ex); + exp2reg(fs, ex, var->u.s.info); + return; + } + case VUPVAL: { + int e = luaK_exp2anyreg(fs, ex); + luaK_codeABC(fs, OP_SETUPVAL, e, var->u.s.info, 0); + break; + } + case VGLOBAL: { + int e = luaK_exp2anyreg(fs, ex); + luaK_codeABx(fs, OP_SETGLOBAL, e, var->u.s.info); + break; + } + case VINDEXED: { + int e = luaK_exp2RK(fs, ex); + luaK_codeABC(fs, OP_SETTABLE, var->u.s.info, var->u.s.aux, e); + break; + } + default: { + lua_assert(0); /* invalid var kind to store */ + break; + } + } + freeexp(fs, ex); +} + + +void luaK_self (FuncState *fs, expdesc *e, expdesc *key) { + int func; + luaK_exp2anyreg(fs, e); + freeexp(fs, e); + func = fs->freereg; + luaK_reserveregs(fs, 2); + luaK_codeABC(fs, OP_SELF, func, e->u.s.info, luaK_exp2RK(fs, key)); + freeexp(fs, key); + e->u.s.info = func; + e->k = VNONRELOC; +} + + +static void invertjump (FuncState *fs, expdesc *e) { + Instruction *pc = getjumpcontrol(fs, e->u.s.info); + lua_assert(testTMode(GET_OPCODE(*pc)) && GET_OPCODE(*pc) != OP_TESTSET && + GET_OPCODE(*pc) != OP_TEST); + SETARG_A(*pc, !(GETARG_A(*pc))); +} + + +static int jumponcond (FuncState *fs, expdesc *e, int cond) { + if (e->k == VRELOCABLE) { + Instruction ie = getcode(fs, e); + if (GET_OPCODE(ie) == OP_NOT) { + fs->pc--; /* remove previous OP_NOT */ + return condjump(fs, OP_TEST, GETARG_B(ie), 0, !cond); + } + /* else go through */ + } + discharge2anyreg(fs, e); + freeexp(fs, e); + return condjump(fs, OP_TESTSET, NO_REG, e->u.s.info, cond); +} + + +void luaK_goiftrue (FuncState *fs, expdesc *e) { + int pc; /* pc of last jump */ + luaK_dischargevars(fs, e); + switch (e->k) { + case VK: case VKNUM: case VTRUE: { + pc = NO_JUMP; /* always true; do nothing */ + break; + } + case VFALSE: { + pc = luaK_jump(fs); /* always jump */ + break; + } + case VJMP: { + invertjump(fs, e); + pc = e->u.s.info; + break; + } + default: { + pc = jumponcond(fs, e, 0); + break; + } + } + luaK_concat(fs, &e->f, pc); /* insert last jump in `f' list */ + luaK_patchtohere(fs, e->t); + e->t = NO_JUMP; +} + + +static void luaK_goiffalse (FuncState *fs, expdesc *e) { + int pc; /* pc of last jump */ + luaK_dischargevars(fs, e); + switch (e->k) { + case VNIL: case VFALSE: { + pc = NO_JUMP; /* always false; do nothing */ + break; + } + case VTRUE: { + pc = luaK_jump(fs); /* always jump */ + break; + } + case VJMP: { + pc = e->u.s.info; + break; + } + default: { + pc = jumponcond(fs, e, 1); + break; + } + } + luaK_concat(fs, &e->t, pc); /* insert last jump in `t' list */ + luaK_patchtohere(fs, e->f); + e->f = NO_JUMP; +} + + +static void codenot (FuncState *fs, expdesc *e) { + luaK_dischargevars(fs, e); + switch (e->k) { + case VNIL: case VFALSE: { + e->k = VTRUE; + break; + } + case VK: case VKNUM: case VTRUE: { + e->k = VFALSE; + break; + } + case VJMP: { + invertjump(fs, e); + break; + } + case VRELOCABLE: + case VNONRELOC: { + discharge2anyreg(fs, e); + freeexp(fs, e); + e->u.s.info = luaK_codeABC(fs, OP_NOT, 0, e->u.s.info, 0); + e->k = VRELOCABLE; + break; + } + default: { + lua_assert(0); /* cannot happen */ + break; + } + } + /* interchange true and false lists */ + { int temp = e->f; e->f = e->t; e->t = temp; } + removevalues(fs, e->f); + removevalues(fs, e->t); +} + + +void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) { + t->u.s.aux = luaK_exp2RK(fs, k); + t->k = VINDEXED; +} + + +static int constfolding (OpCode op, expdesc *e1, expdesc *e2) { + lua_Number v1, v2, r; + if (!isnumeral(e1) || !isnumeral(e2)) return 0; + v1 = e1->u.nval; + v2 = e2->u.nval; + switch (op) { + case OP_ADD: r = luai_numadd(v1, v2); break; + case OP_SUB: r = luai_numsub(v1, v2); break; + case OP_MUL: r = luai_nummul(v1, v2); break; + case OP_DIV: + if (v2 == 0) return 0; /* do not attempt to divide by 0 */ + r = luai_numdiv(v1, v2); break; + case OP_MOD: + if (v2 == 0) return 0; /* do not attempt to divide by 0 */ + r = luai_nummod(v1, v2); break; + case OP_POW: r = luai_numpow(v1, v2); break; + case OP_UNM: r = luai_numunm(v1); break; + case OP_LEN: return 0; /* no constant folding for 'len' */ + default: lua_assert(0); r = 0; break; + } + if (luai_numisnan(r)) return 0; /* do not attempt to produce NaN */ + e1->u.nval = r; + return 1; +} + + +static void codearith (FuncState *fs, OpCode op, expdesc *e1, expdesc *e2) { + if (constfolding(op, e1, e2)) + return; + else { + int o1 = luaK_exp2RK(fs, e1); + int o2 = (op != OP_UNM && op != OP_LEN) ? luaK_exp2RK(fs, e2) : 0; + freeexp(fs, e2); + freeexp(fs, e1); + e1->u.s.info = luaK_codeABC(fs, op, 0, o1, o2); + e1->k = VRELOCABLE; + } +} + + +static void codecomp (FuncState *fs, OpCode op, int cond, expdesc *e1, + expdesc *e2) { + int o1 = luaK_exp2RK(fs, e1); + int o2 = luaK_exp2RK(fs, e2); + freeexp(fs, e2); + freeexp(fs, e1); + if (cond == 0 && op != OP_EQ) { + int temp; /* exchange args to replace by `<' or `<=' */ + temp = o1; o1 = o2; o2 = temp; /* o1 <==> o2 */ + cond = 1; + } + e1->u.s.info = condjump(fs, op, cond, o1, o2); + e1->k = VJMP; +} + + +void luaK_prefix (FuncState *fs, UnOpr op, expdesc *e) { + expdesc e2; + e2.t = e2.f = NO_JUMP; e2.k = VKNUM; e2.u.nval = 0; + switch (op) { + case OPR_MINUS: { + if (e->k == VK) + luaK_exp2anyreg(fs, e); /* cannot operate on non-numeric constants */ + codearith(fs, OP_UNM, e, &e2); + break; + } + case OPR_NOT: codenot(fs, e); break; + case OPR_LEN: { + luaK_exp2anyreg(fs, e); /* cannot operate on constants */ + codearith(fs, OP_LEN, e, &e2); + break; + } + default: lua_assert(0); + } +} + + +void luaK_infix (FuncState *fs, BinOpr op, expdesc *v) { + switch (op) { + case OPR_AND: { + luaK_goiftrue(fs, v); + break; + } + case OPR_OR: { + luaK_goiffalse(fs, v); + break; + } + case OPR_CONCAT: { + luaK_exp2nextreg(fs, v); /* operand must be on the `stack' */ + break; + } + default: { + if (!isnumeral(v)) luaK_exp2RK(fs, v); + break; + } + } +} + + +void luaK_posfix (FuncState *fs, BinOpr op, expdesc *e1, expdesc *e2) { + switch (op) { + case OPR_AND: { + lua_assert(e1->t == NO_JUMP); /* list must be closed */ + luaK_dischargevars(fs, e2); + luaK_concat(fs, &e1->f, e2->f); + e1->k = e2->k; e1->u.s.info = e2->u.s.info; + e1->u.s.aux = e2->u.s.aux; e1->t = e2->t; + break; + } + case OPR_OR: { + lua_assert(e1->f == NO_JUMP); /* list must be closed */ + luaK_dischargevars(fs, e2); + luaK_concat(fs, &e1->t, e2->t); + e1->k = e2->k; e1->u.s.info = e2->u.s.info; + e1->u.s.aux = e2->u.s.aux; e1->f = e2->f; + break; + } + case OPR_CONCAT: { + luaK_exp2val(fs, e2); + if (e2->k == VRELOCABLE && GET_OPCODE(getcode(fs, e2)) == OP_CONCAT) { + lua_assert(e1->u.s.info == GETARG_B(getcode(fs, e2))-1); + freeexp(fs, e1); + SETARG_B(getcode(fs, e2), e1->u.s.info); + e1->k = e2->k; e1->u.s.info = e2->u.s.info; + } + else { + luaK_exp2nextreg(fs, e2); /* operand must be on the 'stack' */ + codearith(fs, OP_CONCAT, e1, e2); + } + break; + } + case OPR_ADD: codearith(fs, OP_ADD, e1, e2); break; + case OPR_SUB: codearith(fs, OP_SUB, e1, e2); break; + case OPR_MUL: codearith(fs, OP_MUL, e1, e2); break; + case OPR_DIV: codearith(fs, OP_DIV, e1, e2); break; + case OPR_MOD: codearith(fs, OP_MOD, e1, e2); break; + case OPR_POW: codearith(fs, OP_POW, e1, e2); break; + case OPR_EQ: codecomp(fs, OP_EQ, 1, e1, e2); break; + case OPR_NE: codecomp(fs, OP_EQ, 0, e1, e2); break; + case OPR_LT: codecomp(fs, OP_LT, 1, e1, e2); break; + case OPR_LE: codecomp(fs, OP_LE, 1, e1, e2); break; + case OPR_GT: codecomp(fs, OP_LT, 0, e1, e2); break; + case OPR_GE: codecomp(fs, OP_LE, 0, e1, e2); break; + default: lua_assert(0); + } +} + + +void luaK_fixline (FuncState *fs, int line) { + fs->f->lineinfo[fs->pc - 1] = line; +} + + +static int luaK_code (FuncState *fs, Instruction i, int line) { + Proto *f = fs->f; + dischargejpc(fs); /* `pc' will change */ + /* put new instruction in code array */ + luaM_growvector(fs->L, f->code, fs->pc, f->sizecode, Instruction, + MAX_INT, "code size overflow"); + f->code[fs->pc] = i; + /* save corresponding line information */ + luaM_growvector(fs->L, f->lineinfo, fs->pc, f->sizelineinfo, int, + MAX_INT, "code size overflow"); + f->lineinfo[fs->pc] = line; + return fs->pc++; +} + + +int luaK_codeABC (FuncState *fs, OpCode o, int a, int b, int c) { + lua_assert(getOpMode(o) == iABC); + lua_assert(getBMode(o) != OpArgN || b == 0); + lua_assert(getCMode(o) != OpArgN || c == 0); + return luaK_code(fs, CREATE_ABC(o, a, b, c), fs->ls->lastline); +} + + +int luaK_codeABx (FuncState *fs, OpCode o, int a, unsigned int bc) { + lua_assert(getOpMode(o) == iABx || getOpMode(o) == iAsBx); + lua_assert(getCMode(o) == OpArgN); + return luaK_code(fs, CREATE_ABx(o, a, bc), fs->ls->lastline); +} + + +void luaK_setlist (FuncState *fs, int base, int nelems, int tostore) { + int c = (nelems - 1)/LFIELDS_PER_FLUSH + 1; + int b = (tostore == LUA_MULTRET) ? 0 : tostore; + lua_assert(tostore != 0); + if (c <= MAXARG_C) + luaK_codeABC(fs, OP_SETLIST, base, b, c); + else { + luaK_codeABC(fs, OP_SETLIST, base, b, 0); + luaK_code(fs, cast(Instruction, c), fs->ls->lastline); + } + fs->freereg = base + 1; /* free registers with list values */ +} + diff --git a/ref/lua-5.1/src/lcode.h b/ref/lua-5.1/src/lcode.h new file mode 100644 index 0000000..b5668f2 --- /dev/null +++ b/ref/lua-5.1/src/lcode.h @@ -0,0 +1,77 @@ +/* +** $Id: lcode.h,v 1.47 2005/11/08 19:44:31 roberto Exp $ +** Code generator for Lua +** See Copyright Notice in lua.h +*/ + +#ifndef lcode_h +#define lcode_h + +#include "llex.h" +#include "lobject.h" +#include "lopcodes.h" +#include "lparser.h" + + +/* +** Marks the end of a patch list. It is an invalid value both as an absolute +** address, and as a list link (would link an element to itself). +*/ +#define NO_JUMP (-1) + + +/* +** grep "ORDER OPR" if you change these enums +*/ +typedef enum BinOpr { + OPR_ADD, OPR_SUB, OPR_MUL, OPR_DIV, OPR_MOD, OPR_POW, + OPR_CONCAT, + OPR_NE, OPR_EQ, + OPR_LT, OPR_LE, OPR_GT, OPR_GE, + OPR_AND, OPR_OR, + OPR_NOBINOPR +} BinOpr; + +#define binopistest(op) ((op) >= OPR_NE) + +typedef enum UnOpr { OPR_MINUS, OPR_NOT, OPR_LEN, OPR_NOUNOPR } UnOpr; + + +#define getcode(fs,e) ((fs)->f->code[(e)->u.s.info]) + +#define luaK_codeAsBx(fs,o,A,sBx) luaK_codeABx(fs,o,A,(sBx)+MAXARG_sBx) + +#define luaK_setmultret(fs,e) luaK_setreturns(fs, e, LUA_MULTRET) + +LUAI_FUNC int luaK_codeABx (FuncState *fs, OpCode o, int A, unsigned int Bx); +LUAI_FUNC int luaK_codeABC (FuncState *fs, OpCode o, int A, int B, int C); +LUAI_FUNC void luaK_fixline (FuncState *fs, int line); +LUAI_FUNC void luaK_nil (FuncState *fs, int from, int n); +LUAI_FUNC void luaK_reserveregs (FuncState *fs, int n); +LUAI_FUNC void luaK_checkstack (FuncState *fs, int n); +LUAI_FUNC int luaK_stringK (FuncState *fs, TString *s); +LUAI_FUNC int luaK_numberK (FuncState *fs, lua_Number r); +LUAI_FUNC void luaK_dischargevars (FuncState *fs, expdesc *e); +LUAI_FUNC int luaK_exp2anyreg (FuncState *fs, expdesc *e); +LUAI_FUNC void luaK_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_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); +LUAI_FUNC void luaK_infix (FuncState *fs, BinOpr op, expdesc *v); +LUAI_FUNC void luaK_posfix (FuncState *fs, BinOpr op, expdesc *v1, expdesc *v2); +LUAI_FUNC void luaK_setlist (FuncState *fs, int base, int nelems, int tostore); + + +#endif diff --git a/ref/lua-5.1/src/ldblib.c b/ref/lua-5.1/src/ldblib.c new file mode 100644 index 0000000..26a19b6 --- /dev/null +++ b/ref/lua-5.1/src/ldblib.c @@ -0,0 +1,397 @@ +/* +** $Id: ldblib.c,v 1.104 2005/12/29 15:32:11 roberto Exp $ +** Interface from Lua to its debug API +** See Copyright Notice in lua.h +*/ + + +#include +#include +#include + +#define ldblib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + + +static int db_getregistry (lua_State *L) { + lua_pushvalue(L, LUA_REGISTRYINDEX); + return 1; +} + + +static int db_getmetatable (lua_State *L) { + luaL_checkany(L, 1); + if (!lua_getmetatable(L, 1)) { + lua_pushnil(L); /* no metatable */ + } + return 1; +} + + +static int db_setmetatable (lua_State *L) { + int t = lua_type(L, 2); + luaL_argcheck(L, t == LUA_TNIL || t == LUA_TTABLE, 2, + "nil or table expected"); + lua_settop(L, 2); + lua_pushboolean(L, lua_setmetatable(L, 1)); + return 1; +} + + +static int db_getfenv (lua_State *L) { + lua_getfenv(L, 1); + return 1; +} + + +static int db_setfenv (lua_State *L) { + luaL_checktype(L, 2, LUA_TTABLE); + lua_settop(L, 2); + if (lua_setfenv(L, 1) == 0) + luaL_error(L, LUA_QL("setfenv") + " cannot change environment of given object"); + return 1; +} + + +static void settabss (lua_State *L, const char *i, const char *v) { + lua_pushstring(L, v); + lua_setfield(L, -2, i); +} + + +static void settabsi (lua_State *L, const char *i, int v) { + lua_pushinteger(L, v); + lua_setfield(L, -2, i); +} + + +static lua_State *getthread (lua_State *L, int *arg) { + if (lua_isthread(L, 1)) { + *arg = 1; + return lua_tothread(L, 1); + } + else { + *arg = 0; + return L; + } +} + + +static void treatstackoption (lua_State *L, lua_State *L1, const char *fname) { + if (L == L1) { + lua_pushvalue(L, -2); + lua_remove(L, -3); + } + else + lua_xmove(L1, L, 1); + lua_setfield(L, -2, fname); +} + + +static int db_getinfo (lua_State *L) { + lua_Debug ar; + int arg; + lua_State *L1 = getthread(L, &arg); + const char *options = luaL_optstring(L, arg+2, "flnSu"); + if (lua_isnumber(L, arg+1)) { + if (!lua_getstack(L1, (int)lua_tointeger(L, arg+1), &ar)) { + lua_pushnil(L); /* level out of range */ + return 1; + } + } + else if (lua_isfunction(L, arg+1)) { + lua_pushfstring(L, ">%s", options); + options = lua_tostring(L, -1); + lua_pushvalue(L, arg+1); + lua_xmove(L, L1, 1); + } + else + return luaL_argerror(L, arg+1, "function or level expected"); + if (!lua_getinfo(L1, options, &ar)) + return luaL_argerror(L, arg+2, "invalid option"); + lua_createtable(L, 0, 2); + if (strchr(options, 'S')) { + settabss(L, "source", ar.source); + settabss(L, "short_src", ar.short_src); + settabsi(L, "linedefined", ar.linedefined); + settabsi(L, "lastlinedefined", ar.lastlinedefined); + settabss(L, "what", ar.what); + } + if (strchr(options, 'l')) + settabsi(L, "currentline", ar.currentline); + if (strchr(options, 'u')) + settabsi(L, "nups", ar.nups); + if (strchr(options, 'n')) { + settabss(L, "name", ar.name); + settabss(L, "namewhat", ar.namewhat); + } + if (strchr(options, 'L')) + treatstackoption(L, L1, "activelines"); + if (strchr(options, 'f')) + treatstackoption(L, L1, "func"); + return 1; /* return table */ +} + + +static int db_getlocal (lua_State *L) { + int arg; + lua_State *L1 = getthread(L, &arg); + lua_Debug ar; + const char *name; + if (!lua_getstack(L1, luaL_checkint(L, arg+1), &ar)) /* out of range? */ + return luaL_argerror(L, arg+1, "level out of range"); + name = lua_getlocal(L1, &ar, luaL_checkint(L, arg+2)); + if (name) { + lua_xmove(L1, L, 1); + lua_pushstring(L, name); + lua_pushvalue(L, -2); + return 2; + } + else { + lua_pushnil(L); + return 1; + } +} + + +static int db_setlocal (lua_State *L) { + int arg; + lua_State *L1 = getthread(L, &arg); + lua_Debug ar; + if (!lua_getstack(L1, luaL_checkint(L, arg+1), &ar)) /* out of range? */ + return luaL_argerror(L, arg+1, "level out of range"); + luaL_checkany(L, arg+3); + lua_settop(L, arg+3); + lua_xmove(L, L1, 1); + lua_pushstring(L, lua_setlocal(L1, &ar, luaL_checkint(L, arg+2))); + return 1; +} + + +static int auxupvalue (lua_State *L, int get) { + const char *name; + int n = luaL_checkint(L, 2); + luaL_checktype(L, 1, LUA_TFUNCTION); + if (lua_iscfunction(L, 1)) return 0; /* cannot touch C upvalues from Lua */ + name = get ? lua_getupvalue(L, 1, n) : lua_setupvalue(L, 1, n); + if (name == NULL) return 0; + lua_pushstring(L, name); + lua_insert(L, -(get+1)); + return get + 1; +} + + +static int db_getupvalue (lua_State *L) { + return auxupvalue(L, 1); +} + + +static int db_setupvalue (lua_State *L) { + luaL_checkany(L, 3); + return auxupvalue(L, 0); +} + + + +static const char KEY_HOOK = 'h'; + + +static void hookf (lua_State *L, lua_Debug *ar) { + static const char *const hooknames[] = + {"call", "return", "line", "count", "tail return"}; + lua_pushlightuserdata(L, (void *)&KEY_HOOK); + lua_rawget(L, LUA_REGISTRYINDEX); + lua_pushlightuserdata(L, L); + lua_rawget(L, -2); + if (lua_isfunction(L, -1)) { + lua_pushstring(L, hooknames[(int)ar->event]); + if (ar->currentline >= 0) + lua_pushinteger(L, ar->currentline); + else lua_pushnil(L); + lua_assert(lua_getinfo(L, "lS", ar)); + lua_call(L, 2, 0); + } +} + + +static int makemask (const char *smask, int count) { + int mask = 0; + if (strchr(smask, 'c')) mask |= LUA_MASKCALL; + if (strchr(smask, 'r')) mask |= LUA_MASKRET; + if (strchr(smask, 'l')) mask |= LUA_MASKLINE; + if (count > 0) mask |= LUA_MASKCOUNT; + return mask; +} + + +static char *unmakemask (int mask, char *smask) { + int i = 0; + if (mask & LUA_MASKCALL) smask[i++] = 'c'; + if (mask & LUA_MASKRET) smask[i++] = 'r'; + if (mask & LUA_MASKLINE) smask[i++] = 'l'; + smask[i] = '\0'; + return smask; +} + + +static void gethooktable (lua_State *L) { + lua_pushlightuserdata(L, (void *)&KEY_HOOK); + lua_rawget(L, LUA_REGISTRYINDEX); + if (!lua_istable(L, -1)) { + lua_pop(L, 1); + lua_createtable(L, 0, 1); + lua_pushlightuserdata(L, (void *)&KEY_HOOK); + lua_pushvalue(L, -2); + lua_rawset(L, LUA_REGISTRYINDEX); + } +} + + +static int db_sethook (lua_State *L) { + int arg; + lua_State *L1 = getthread(L, &arg); + if (lua_isnoneornil(L, arg+1)) { + lua_settop(L, arg+1); + lua_sethook(L1, NULL, 0, 0); /* turn off hooks */ + } + else { + const char *smask = luaL_checkstring(L, arg+2); + int count = luaL_optint(L, arg+3, 0); + luaL_checktype(L, arg+1, LUA_TFUNCTION); + lua_sethook(L1, hookf, makemask(smask, count), count); + } + gethooktable(L1); + lua_pushlightuserdata(L1, L1); + lua_pushvalue(L, arg+1); + lua_xmove(L, L1, 1); + lua_rawset(L1, -3); /* set new hook */ + lua_pop(L1, 1); /* remove hook table */ + return 0; +} + + +static int db_gethook (lua_State *L) { + int arg; + lua_State *L1 = getthread(L, &arg); + char buff[5]; + int mask = lua_gethookmask(L1); + lua_Hook hook = lua_gethook(L1); + if (hook != NULL && hook != hookf) /* external hook? */ + lua_pushliteral(L, "external hook"); + else { + gethooktable(L1); + lua_pushlightuserdata(L1, L1); + lua_rawget(L1, -2); /* get hook */ + lua_remove(L1, -2); /* remove hook table */ + lua_xmove(L1, L, 1); + } + lua_pushstring(L, unmakemask(mask, buff)); + lua_pushinteger(L, lua_gethookcount(L1)); + return 3; +} + + +static int db_debug (lua_State *L) { + for (;;) { + char buffer[250]; + fputs("lua_debug> ", stderr); + if (fgets(buffer, sizeof(buffer), stdin) == 0 || + strcmp(buffer, "cont\n") == 0) + return 0; + if (luaL_loadbuffer(L, buffer, strlen(buffer), "=(debug command)") || + lua_pcall(L, 0, 0, 0)) { + fputs(lua_tostring(L, -1), stderr); + fputs("\n", stderr); + } + lua_settop(L, 0); /* remove eventual returns */ + } +} + + +#define LEVELS1 12 /* size of the first part of the stack */ +#define LEVELS2 10 /* size of the second part of the stack */ + +static int db_errorfb (lua_State *L) { + int level; + int firstpart = 1; /* still before eventual `...' */ + int arg; + lua_State *L1 = getthread(L, &arg); + lua_Debug ar; + if (lua_isnumber(L, arg+2)) { + level = (int)lua_tointeger(L, arg+2); + lua_pop(L, 1); + } + else + level = (L == L1) ? 1 : 0; /* level 0 may be this own function */ + if (lua_gettop(L) == arg) + lua_pushliteral(L, ""); + else if (!lua_isstring(L, arg+1)) return 1; /* message is not a string */ + else lua_pushliteral(L, "\n"); + lua_pushliteral(L, "stack traceback:"); + while (lua_getstack(L1, level++, &ar)) { + if (level > LEVELS1 && firstpart) { + /* no more than `LEVELS2' more levels? */ + if (!lua_getstack(L1, level+LEVELS2, &ar)) + level--; /* keep going */ + else { + lua_pushliteral(L, "\n\t..."); /* too many levels */ + while (lua_getstack(L1, level+LEVELS2, &ar)) /* find last levels */ + level++; + } + firstpart = 0; + continue; + } + lua_pushliteral(L, "\n\t"); + lua_getinfo(L1, "Snl", &ar); + lua_pushfstring(L, "%s:", ar.short_src); + if (ar.currentline > 0) + lua_pushfstring(L, "%d:", ar.currentline); + if (*ar.namewhat != '\0') /* is there a name? */ + lua_pushfstring(L, " in function " LUA_QS, ar.name); + else { + if (*ar.what == 'm') /* main? */ + lua_pushfstring(L, " in main chunk"); + else if (*ar.what == 'C' || *ar.what == 't') + lua_pushliteral(L, " ?"); /* C function or tail call */ + else + lua_pushfstring(L, " in function <%s:%d>", + ar.short_src, ar.linedefined); + } + lua_concat(L, lua_gettop(L) - arg); + } + lua_concat(L, lua_gettop(L) - arg); + return 1; +} + + +static const luaL_Reg dblib[] = { + {"debug", db_debug}, + {"getfenv", db_getfenv}, + {"gethook", db_gethook}, + {"getinfo", db_getinfo}, + {"getlocal", db_getlocal}, + {"getregistry", db_getregistry}, + {"getmetatable", db_getmetatable}, + {"getupvalue", db_getupvalue}, + {"setfenv", db_setfenv}, + {"sethook", db_sethook}, + {"setlocal", db_setlocal}, + {"setmetatable", db_setmetatable}, + {"setupvalue", db_setupvalue}, + {"traceback", db_errorfb}, + {NULL, NULL} +}; + + +LUALIB_API int luaopen_debug (lua_State *L) { + luaL_register(L, LUA_DBLIBNAME, dblib); + return 1; +} + diff --git a/ref/lua-5.1/src/ldebug.c b/ref/lua-5.1/src/ldebug.c new file mode 100644 index 0000000..8919a01 --- /dev/null +++ b/ref/lua-5.1/src/ldebug.c @@ -0,0 +1,620 @@ +/* +** $Id: ldebug.c,v 2.29 2005/12/22 16:19:56 roberto Exp $ +** Debug Interface +** See Copyright Notice in lua.h +*/ + + +#include +#include +#include + + +#define ldebug_c +#define LUA_CORE + +#include "lua.h" + +#include "lapi.h" +#include "lcode.h" +#include "ldebug.h" +#include "ldo.h" +#include "lfunc.h" +#include "lobject.h" +#include "lopcodes.h" +#include "lstate.h" +#include "lstring.h" +#include "ltable.h" +#include "ltm.h" +#include "lvm.h" + + + +static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name); + + +static int currentpc (lua_State *L, CallInfo *ci) { + if (!isLua(ci)) return -1; /* function is not a Lua function? */ + if (ci == L->ci) + ci->savedpc = L->savedpc; + return pcRel(ci->savedpc, ci_func(ci)->l.p); +} + + +static int currentline (lua_State *L, CallInfo *ci) { + int pc = currentpc(L, ci); + if (pc < 0) + return -1; /* only active lua functions have current-line information */ + else + return getline(ci_func(ci)->l.p, pc); +} + + +/* +** this function can be called asynchronous (e.g. during a signal) +*/ +LUA_API int lua_sethook (lua_State *L, lua_Hook func, int mask, int count) { + if (func == NULL || mask == 0) { /* turn off hooks? */ + mask = 0; + func = NULL; + } + L->hook = func; + L->basehookcount = count; + resethookcount(L); + L->hookmask = cast_byte(mask); + return 1; +} + + +LUA_API lua_Hook lua_gethook (lua_State *L) { + return L->hook; +} + + +LUA_API int lua_gethookmask (lua_State *L) { + return L->hookmask; +} + + +LUA_API int lua_gethookcount (lua_State *L) { + return L->basehookcount; +} + + +LUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar) { + int status; + CallInfo *ci; + lua_lock(L); + for (ci = L->ci; level > 0 && ci > L->base_ci; ci--) { + level--; + if (f_isLua(ci)) /* Lua function? */ + level -= ci->tailcalls; /* skip lost tail calls */ + } + if (level == 0 && ci > L->base_ci) { /* level found? */ + status = 1; + ar->i_ci = cast_int(ci - L->base_ci); + } + else if (level < 0) { /* level is of a lost tail call? */ + status = 1; + ar->i_ci = 0; + } + else status = 0; /* no such level */ + lua_unlock(L); + return status; +} + + +static Proto *getluaproto (CallInfo *ci) { + return (isLua(ci) ? ci_func(ci)->l.p : NULL); +} + + +static const char *findlocal (lua_State *L, CallInfo *ci, int n) { + const char *name; + Proto *fp = getluaproto(ci); + if (fp && (name = luaF_getlocalname(fp, n, currentpc(L, ci))) != NULL) + return name; /* is a local variable in a Lua function */ + else { + StkId limit = (ci == L->ci) ? L->top : (ci+1)->func; + if (limit - ci->base >= n && n > 0) /* is 'n' inside 'ci' stack? */ + return "(*temporary)"; + else + return NULL; + } +} + + +LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n) { + CallInfo *ci = L->base_ci + ar->i_ci; + const char *name = findlocal(L, ci, n); + lua_lock(L); + if (name) + luaA_pushobject(L, ci->base + (n - 1)); + lua_unlock(L); + return name; +} + + +LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n) { + CallInfo *ci = L->base_ci + ar->i_ci; + const char *name = findlocal(L, ci, n); + lua_lock(L); + if (name) + setobjs2s(L, ci->base + (n - 1), L->top - 1); + L->top--; /* pop value */ + lua_unlock(L); + return name; +} + + +static void funcinfo (lua_Debug *ar, Closure *cl) { + if (cl->c.isC) { + ar->source = "=[C]"; + ar->linedefined = -1; + ar->lastlinedefined = -1; + ar->what = "C"; + } + else { + ar->source = getstr(cl->l.p->source); + ar->linedefined = cl->l.p->linedefined; + ar->lastlinedefined = cl->l.p->lastlinedefined; + ar->what = (ar->linedefined == 0) ? "main" : "Lua"; + } + luaO_chunkid(ar->short_src, ar->source, LUA_IDSIZE); +} + + +static void info_tailcall (lua_Debug *ar) { + ar->name = ar->namewhat = ""; + ar->what = "tail"; + ar->lastlinedefined = ar->linedefined = ar->currentline = -1; + ar->source = "=(tail call)"; + luaO_chunkid(ar->short_src, ar->source, LUA_IDSIZE); + ar->nups = 0; +} + + +static void collectvalidlines (lua_State *L, Closure *f) { + if (f == NULL || f->c.isC) { + setnilvalue(L->top); + } + else { + Table *t = luaH_new(L, 0, 0); + int *lineinfo = f->l.p->lineinfo; + int i; + for (i=0; il.p->sizelineinfo; i++) + setbvalue(luaH_setnum(L, t, lineinfo[i]), 1); + sethvalue(L, L->top, t); + } + incr_top(L); +} + + +static int auxgetinfo (lua_State *L, const char *what, lua_Debug *ar, + Closure *f, CallInfo *ci) { + int status = 1; + if (f == NULL) { + info_tailcall(ar); + return status; + } + for (; *what; what++) { + switch (*what) { + case 'S': { + funcinfo(ar, f); + break; + } + case 'l': { + ar->currentline = (ci) ? currentline(L, ci) : -1; + break; + } + case 'u': { + ar->nups = f->c.nupvalues; + break; + } + case 'n': { + ar->namewhat = (ci) ? getfuncname(L, ci, &ar->name) : NULL; + if (ar->namewhat == NULL) { + ar->namewhat = ""; /* not found */ + ar->name = NULL; + } + break; + } + case 'L': + case 'f': /* handled by lua_getinfo */ + break; + default: status = 0; /* invalid option */ + } + } + return status; +} + + +LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar) { + int status; + Closure *f = NULL; + CallInfo *ci = NULL; + lua_lock(L); + if (*what == '>') { + StkId func = L->top - 1; + luai_apicheck(L, ttisfunction(func)); + what++; /* skip the '>' */ + f = clvalue(func); + L->top--; /* pop function */ + } + else if (ar->i_ci != 0) { /* no tail call? */ + ci = L->base_ci + ar->i_ci; + lua_assert(ttisfunction(ci->func)); + f = clvalue(ci->func); + } + status = auxgetinfo(L, what, ar, f, ci); + if (strchr(what, 'f')) { + if (f == NULL) setnilvalue(L->top); + else setclvalue(L, L->top, f); + incr_top(L); + } + if (strchr(what, 'L')) + collectvalidlines(L, f); + lua_unlock(L); + return status; +} + + +/* +** {====================================================== +** Symbolic Execution and code checker +** ======================================================= +*/ + +#define check(x) if (!(x)) return 0; + +#define checkjump(pt,pc) check(0 <= pc && pc < pt->sizecode) + +#define checkreg(pt,reg) check((reg) < (pt)->maxstacksize) + + + +static int precheck (const Proto *pt) { + check(pt->maxstacksize <= MAXSTACK); + lua_assert(pt->numparams+(pt->is_vararg & VARARG_HASARG) <= pt->maxstacksize); + lua_assert(!(pt->is_vararg & VARARG_NEEDSARG) || + (pt->is_vararg & VARARG_HASARG)); + check(pt->sizeupvalues <= pt->nups); + check(pt->sizelineinfo == pt->sizecode || pt->sizelineinfo == 0); + check(GET_OPCODE(pt->code[pt->sizecode-1]) == OP_RETURN); + return 1; +} + + +#define checkopenop(pt,pc) luaG_checkopenop((pt)->code[(pc)+1]) + +int luaG_checkopenop (Instruction i) { + switch (GET_OPCODE(i)) { + case OP_CALL: + case OP_TAILCALL: + case OP_RETURN: + case OP_SETLIST: { + check(GETARG_B(i) == 0); + return 1; + } + default: return 0; /* invalid instruction after an open call */ + } +} + + +static int checkArgMode (const Proto *pt, int r, enum OpArgMask mode) { + switch (mode) { + case OpArgN: check(r == 0); break; + case OpArgU: break; + case OpArgR: checkreg(pt, r); break; + case OpArgK: + check(ISK(r) ? INDEXK(r) < pt->sizek : r < pt->maxstacksize); + break; + } + return 1; +} + + +static Instruction symbexec (const Proto *pt, int lastpc, int reg) { + int pc; + int last; /* stores position of last instruction that changed `reg' */ + last = pt->sizecode-1; /* points to final return (a `neutral' instruction) */ + check(precheck(pt)); + for (pc = 0; pc < lastpc; pc++) { + Instruction i = pt->code[pc]; + OpCode op = GET_OPCODE(i); + int a = GETARG_A(i); + int b = 0; + int c = 0; + check(op < NUM_OPCODES); + checkreg(pt, a); + switch (getOpMode(op)) { + case iABC: { + b = GETARG_B(i); + c = GETARG_C(i); + check(checkArgMode(pt, b, getBMode(op))); + check(checkArgMode(pt, c, getCMode(op))); + break; + } + case iABx: { + b = GETARG_Bx(i); + if (getBMode(op) == OpArgK) check(b < pt->sizek); + break; + } + case iAsBx: { + b = GETARG_sBx(i); + if (getBMode(op) == OpArgR) { + int dest = pc+1+b; + check(0 <= dest && dest < pt->sizecode); + if (dest > 0) { + /* cannot jump to a setlist count */ + Instruction d = pt->code[dest-1]; + check(!(GET_OPCODE(d) == OP_SETLIST && GETARG_C(d) == 0)); + } + } + break; + } + } + if (testAMode(op)) { + if (a == reg) last = pc; /* change register `a' */ + } + if (testTMode(op)) { + check(pc+2 < pt->sizecode); /* check skip */ + check(GET_OPCODE(pt->code[pc+1]) == OP_JMP); + } + switch (op) { + case OP_LOADBOOL: { + check(c == 0 || pc+2 < pt->sizecode); /* check its jump */ + break; + } + case OP_LOADNIL: { + if (a <= reg && reg <= b) + last = pc; /* set registers from `a' to `b' */ + break; + } + case OP_GETUPVAL: + case OP_SETUPVAL: { + check(b < pt->nups); + break; + } + case OP_GETGLOBAL: + case OP_SETGLOBAL: { + check(ttisstring(&pt->k[b])); + break; + } + case OP_SELF: { + checkreg(pt, a+1); + if (reg == a+1) last = pc; + break; + } + case OP_CONCAT: { + check(b < c); /* at least two operands */ + break; + } + case OP_TFORLOOP: { + check(c >= 1); /* at least one result (control variable) */ + checkreg(pt, a+2+c); /* space for results */ + if (reg >= a+2) last = pc; /* affect all regs above its base */ + break; + } + case OP_FORLOOP: + case OP_FORPREP: + checkreg(pt, a+3); + /* go through */ + case OP_JMP: { + int dest = pc+1+b; + /* not full check and jump is forward and do not skip `lastpc'? */ + if (reg != NO_REG && pc < dest && dest <= lastpc) + pc += b; /* do the jump */ + break; + } + case OP_CALL: + case OP_TAILCALL: { + if (b != 0) { + checkreg(pt, a+b-1); + } + c--; /* c = num. returns */ + if (c == LUA_MULTRET) { + check(checkopenop(pt, pc)); + } + else if (c != 0) + checkreg(pt, a+c-1); + if (reg >= a) last = pc; /* affect all registers above base */ + break; + } + case OP_RETURN: { + b--; /* b = num. returns */ + if (b > 0) checkreg(pt, a+b-1); + break; + } + case OP_SETLIST: { + if (b > 0) checkreg(pt, a + b); + if (c == 0) pc++; + break; + } + case OP_CLOSURE: { + int nup; + check(b < pt->sizep); + nup = pt->p[b]->nups; + check(pc + nup < pt->sizecode); + for (; nup>0; nup--) { + OpCode op1 = GET_OPCODE(pt->code[pc+nup]); + check(op1 == OP_GETUPVAL || op1 == OP_MOVE); + } + break; + } + case OP_VARARG: { + check((pt->is_vararg & VARARG_ISVARARG) && + !(pt->is_vararg & VARARG_NEEDSARG)); + b--; + if (b == LUA_MULTRET) check(checkopenop(pt, pc)); + checkreg(pt, a+b-1); + break; + } + default: break; + } + } + return pt->code[last]; +} + +#undef check +#undef checkjump +#undef checkreg + +/* }====================================================== */ + + +int luaG_checkcode (const Proto *pt) { + return (symbexec(pt, pt->sizecode, NO_REG) != 0); +} + + +static const char *kname (Proto *p, int c) { + if (ISK(c) && ttisstring(&p->k[INDEXK(c)])) + return svalue(&p->k[INDEXK(c)]); + else + return "?"; +} + + +static const char *getobjname (lua_State *L, CallInfo *ci, int stackpos, + const char **name) { + if (isLua(ci)) { /* a Lua function? */ + Proto *p = ci_func(ci)->l.p; + int pc = currentpc(L, ci); + Instruction i; + *name = luaF_getlocalname(p, stackpos+1, pc); + if (*name) /* is a local? */ + return "local"; + i = symbexec(p, pc, stackpos); /* try symbolic execution */ + lua_assert(pc != -1); + switch (GET_OPCODE(i)) { + case OP_GETGLOBAL: { + int g = GETARG_Bx(i); /* global index */ + lua_assert(ttisstring(&p->k[g])); + *name = svalue(&p->k[g]); + return "global"; + } + case OP_MOVE: { + int a = GETARG_A(i); + int b = GETARG_B(i); /* move from `b' to `a' */ + if (b < a) + return getobjname(L, ci, b, name); /* get name for `b' */ + break; + } + case OP_GETTABLE: { + int k = GETARG_C(i); /* key index */ + *name = kname(p, k); + return "field"; + } + case OP_GETUPVAL: { + int u = GETARG_B(i); /* upvalue index */ + *name = p->upvalues ? getstr(p->upvalues[u]) : "?"; + return "upvalue"; + } + case OP_SELF: { + int k = GETARG_C(i); /* key index */ + *name = kname(p, k); + return "method"; + } + default: break; + } + } + return NULL; /* no useful name found */ +} + + +static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name) { + Instruction i; + if ((isLua(ci) && ci->tailcalls > 0) || !isLua(ci - 1)) + return NULL; /* calling function is not Lua (or is unknown) */ + ci--; /* calling function */ + i = ci_func(ci)->l.p->code[currentpc(L, ci)]; + if (GET_OPCODE(i) == OP_CALL || GET_OPCODE(i) == OP_TAILCALL || + GET_OPCODE(i) == OP_TFORLOOP) + return getobjname(L, ci, GETARG_A(i), name); + else + return NULL; /* no useful name can be found */ +} + + +/* only ANSI way to check whether a pointer points to an array */ +static int isinstack (CallInfo *ci, const TValue *o) { + StkId p; + for (p = ci->base; p < ci->top; p++) + if (o == p) return 1; + return 0; +} + + +void luaG_typeerror (lua_State *L, const TValue *o, const char *op) { + const char *name = NULL; + const char *t = luaT_typenames[ttype(o)]; + const char *kind = (isinstack(L->ci, o)) ? + getobjname(L, L->ci, cast_int(o - L->base), &name) : + NULL; + if (kind) + luaG_runerror(L, "attempt to %s %s " LUA_QS " (a %s value)", + op, kind, name, t); + else + luaG_runerror(L, "attempt to %s a %s value", op, t); +} + + +void luaG_concaterror (lua_State *L, StkId p1, StkId p2) { + if (ttisstring(p1)) p1 = p2; + lua_assert(!ttisstring(p1)); + luaG_typeerror(L, p1, "concatenate"); +} + + +void luaG_aritherror (lua_State *L, const TValue *p1, const TValue *p2) { + TValue temp; + if (luaV_tonumber(p1, &temp) == NULL) + p2 = p1; /* first operand is wrong */ + luaG_typeerror(L, p2, "perform arithmetic on"); +} + + +int luaG_ordererror (lua_State *L, const TValue *p1, const TValue *p2) { + const char *t1 = luaT_typenames[ttype(p1)]; + const char *t2 = luaT_typenames[ttype(p2)]; + if (t1[2] == t2[2]) + luaG_runerror(L, "attempt to compare two %s values", t1); + else + luaG_runerror(L, "attempt to compare %s with %s", t1, t2); + return 0; +} + + +static void addinfo (lua_State *L, const char *msg) { + CallInfo *ci = L->ci; + if (isLua(ci)) { /* is Lua code? */ + char buff[LUA_IDSIZE]; /* add file:line information */ + int line = currentline(L, ci); + luaO_chunkid(buff, getstr(getluaproto(ci)->source), LUA_IDSIZE); + luaO_pushfstring(L, "%s:%d: %s", buff, line, msg); + } +} + + +void luaG_errormsg (lua_State *L) { + if (L->errfunc != 0) { /* is there an error handling function? */ + StkId errfunc = restorestack(L, L->errfunc); + if (!ttisfunction(errfunc)) luaD_throw(L, LUA_ERRERR); + setobjs2s(L, L->top, L->top - 1); /* move argument */ + setobjs2s(L, L->top - 1, errfunc); /* push function */ + incr_top(L); + luaD_call(L, L->top - 2, 1); /* call it */ + } + luaD_throw(L, LUA_ERRRUN); +} + + +void luaG_runerror (lua_State *L, const char *fmt, ...) { + va_list argp; + va_start(argp, fmt); + addinfo(L, luaO_pushvfstring(L, fmt, argp)); + va_end(argp); + luaG_errormsg(L); +} + diff --git a/ref/lua-5.1/src/ldebug.h b/ref/lua-5.1/src/ldebug.h new file mode 100644 index 0000000..9c76aa1 --- /dev/null +++ b/ref/lua-5.1/src/ldebug.h @@ -0,0 +1,33 @@ +/* +** $Id: ldebug.h,v 2.3 2005/04/25 19:24:10 roberto Exp $ +** Auxiliary functions from Debug Interface module +** See Copyright Notice in lua.h +*/ + +#ifndef ldebug_h +#define ldebug_h + + +#include "lstate.h" + + +#define pcRel(pc, p) (cast(int, (pc) - (p)->code) - 1) + +#define getline(f,pc) (((f)->lineinfo) ? (f)->lineinfo[pc] : 0) + +#define resethookcount(L) (L->hookcount = L->basehookcount) + + +LUAI_FUNC void luaG_typeerror (lua_State *L, const TValue *o, + const char *opname); +LUAI_FUNC void luaG_concaterror (lua_State *L, StkId p1, StkId p2); +LUAI_FUNC void luaG_aritherror (lua_State *L, const TValue *p1, + const TValue *p2); +LUAI_FUNC int luaG_ordererror (lua_State *L, const TValue *p1, + const TValue *p2); +LUAI_FUNC void luaG_runerror (lua_State *L, const char *fmt, ...); +LUAI_FUNC void luaG_errormsg (lua_State *L); +LUAI_FUNC int luaG_checkcode (const Proto *pt); +LUAI_FUNC int luaG_checkopenop (Instruction i); + +#endif diff --git a/ref/lua-5.1/src/ldo.c b/ref/lua-5.1/src/ldo.c new file mode 100644 index 0000000..b8eb1a8 --- /dev/null +++ b/ref/lua-5.1/src/ldo.c @@ -0,0 +1,515 @@ +/* +** $Id: ldo.c,v 2.37 2005/12/22 16:19:56 roberto Exp $ +** Stack and Call structure of Lua +** See Copyright Notice in lua.h +*/ + + +#include +#include +#include + +#define ldo_c +#define LUA_CORE + +#include "lua.h" + +#include "ldebug.h" +#include "ldo.h" +#include "lfunc.h" +#include "lgc.h" +#include "lmem.h" +#include "lobject.h" +#include "lopcodes.h" +#include "lparser.h" +#include "lstate.h" +#include "lstring.h" +#include "ltable.h" +#include "ltm.h" +#include "lundump.h" +#include "lvm.h" +#include "lzio.h" + + + + +/* +** {====================================================== +** Error-recovery functions +** ======================================================= +*/ + + +/* 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: { + setsvalue2s(L, oldtop, luaS_newliteral(L, MEMERRMSG)); + break; + } + case LUA_ERRERR: { + setsvalue2s(L, oldtop, luaS_newliteral(L, "error in error handling")); + break; + } + case LUA_ERRSYNTAX: + case LUA_ERRRUN: { + setobjs2s(L, oldtop, L->top - 1); /* error message on current top */ + break; + } + } + L->top = oldtop + 1; +} + + +static void restore_stack_limit (lua_State *L) { + lua_assert(L->stack_last - L->stack == L->stacksize - EXTRA_STACK - 1); + if (L->size_ci > LUAI_MAXCALLS) { /* there was an overflow? */ + int inuse = cast_int(L->ci - L->base_ci); + if (inuse + 1 < LUAI_MAXCALLS) /* can `undo' overflow? */ + luaD_reallocCI(L, LUAI_MAXCALLS); + } +} + + +static void resetstack (lua_State *L, int status) { + L->ci = L->base_ci; + L->base = L->ci->base; + luaF_close(L, L->base); /* close eventual pending closures */ + luaD_seterrorobj(L, status, L->base); + L->nCcalls = 0; + L->allowhook = 1; + restore_stack_limit(L); + L->errfunc = 0; + L->errorJmp = NULL; +} + + +void luaD_throw (lua_State *L, int errcode) { + if (L->errorJmp) { + L->errorJmp->status = errcode; + LUAI_THROW(L, L->errorJmp); + } + else { + L->status = cast_byte(errcode); + if (G(L)->panic) { + resetstack(L, errcode); + lua_unlock(L); + G(L)->panic(L); + } + exit(EXIT_FAILURE); + } +} + + +int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud) { + struct lua_longjmp lj; + lj.status = 0; + 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 */ + return lj.status; +} + +/* }====================================================== */ + + +static void correctstack (lua_State *L, TValue *oldstack) { + CallInfo *ci; + GCObject *up; + L->top = (L->top - oldstack) + L->stack; + for (up = L->openupval; up != NULL; up = up->gch.next) + gco2uv(up)->v = (gco2uv(up)->v - oldstack) + L->stack; + for (ci = L->base_ci; ci <= L->ci; ci++) { + ci->top = (ci->top - oldstack) + L->stack; + ci->base = (ci->base - oldstack) + L->stack; + ci->func = (ci->func - oldstack) + L->stack; + } + L->base = (L->base - oldstack) + L->stack; +} + + +void luaD_reallocstack (lua_State *L, int newsize) { + TValue *oldstack = L->stack; + int realsize = newsize + 1 + EXTRA_STACK; + lua_assert(L->stack_last - L->stack == L->stacksize - EXTRA_STACK - 1); + luaM_reallocvector(L, L->stack, L->stacksize, realsize, TValue); + L->stacksize = realsize; + L->stack_last = L->stack+newsize; + correctstack(L, oldstack); +} + + +void luaD_reallocCI (lua_State *L, int newsize) { + CallInfo *oldci = L->base_ci; + luaM_reallocvector(L, L->base_ci, L->size_ci, newsize, CallInfo); + L->size_ci = newsize; + L->ci = (L->ci - oldci) + L->base_ci; + L->end_ci = L->base_ci + L->size_ci - 1; +} + + +void luaD_growstack (lua_State *L, int n) { + if (n <= L->stacksize) /* double size is enough? */ + luaD_reallocstack(L, 2*L->stacksize); + else + luaD_reallocstack(L, L->stacksize + n); +} + + +static CallInfo *growCI (lua_State *L) { + if (L->size_ci > LUAI_MAXCALLS) /* overflow while handling overflow? */ + luaD_throw(L, LUA_ERRERR); + else { + luaD_reallocCI(L, 2*L->size_ci); + if (L->size_ci > LUAI_MAXCALLS) + luaG_runerror(L, "stack overflow"); + } + return ++L->ci; +} + + +void luaD_callhook (lua_State *L, int event, int line) { + lua_Hook hook = L->hook; + if (hook && L->allowhook) { + ptrdiff_t top = savestack(L, L->top); + ptrdiff_t ci_top = savestack(L, L->ci->top); + lua_Debug ar; + ar.event = event; + ar.currentline = line; + if (event == LUA_HOOKTAILRET) + ar.i_ci = 0; /* tail call; no debug information about it */ + else + ar.i_ci = cast_int(L->ci - L->base_ci); + luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */ + L->ci->top = L->top + LUA_MINSTACK; + lua_assert(L->ci->top <= L->stack_last); + L->allowhook = 0; /* cannot call hooks inside a hook */ + lua_unlock(L); + (*hook)(L, &ar); + lua_lock(L); + lua_assert(!L->allowhook); + L->allowhook = 1; + L->ci->top = restorestack(L, ci_top); + L->top = restorestack(L, top); + } +} + + +static StkId adjust_varargs (lua_State *L, Proto *p, int actual) { + int i; + int nfixargs = p->numparams; + Table *htab = NULL; + StkId base, fixed; + for (; actual < nfixargs; ++actual) + setnilvalue(L->top++); +#if defined(LUA_COMPAT_VARARG) + if (p->is_vararg & VARARG_NEEDSARG) { /* compat. with old-style vararg? */ + int nvar = actual - nfixargs; /* number of extra arguments */ + lua_assert(p->is_vararg & VARARG_HASARG); + luaC_checkGC(L); + htab = luaH_new(L, nvar, 1); /* create `arg' table */ + for (i=0; itop - nvar + i); + /* store counter in field `n' */ + setnvalue(luaH_setstr(L, htab, luaS_newliteral(L, "n")), cast_num(nvar)); + } +#endif + /* move fixed parameters to final position */ + fixed = L->top - actual; /* first fixed argument */ + base = L->top; /* final position of first argument */ + for (i=0; itop++, fixed+i); + setnilvalue(fixed+i); + } + /* add `arg' parameter */ + if (htab) { + sethvalue(L, L->top++, htab); + lua_assert(iswhite(obj2gco(htab))); + } + return base; +} + + +static StkId tryfuncTM (lua_State *L, StkId func) { + const TValue *tm = luaT_gettmbyobj(L, func, TM_CALL); + StkId p; + ptrdiff_t funcr = savestack(L, func); + if (!ttisfunction(tm)) + luaG_typeerror(L, func, "call"); + /* Open a hole inside the stack at `func' */ + for (p = L->top; p > func; p--) setobjs2s(L, p, p-1); + incr_top(L); + func = restorestack(L, funcr); /* previous call may change stack */ + setobj2s(L, func, tm); /* tag method is the new function to be called */ + return func; +} + + + +#define inc_ci(L) \ + ((L->ci == L->end_ci) ? growCI(L) : \ + (condhardstacktests(luaD_reallocCI(L, L->size_ci)), ++L->ci)) + + +int luaD_precall (lua_State *L, StkId func, int nresults) { + LClosure *cl; + ptrdiff_t funcr; + if (!ttisfunction(func)) /* `func' is not a function? */ + func = tryfuncTM(L, func); /* check the `function' tag method */ + funcr = savestack(L, func); + cl = &clvalue(func)->l; + L->ci->savedpc = L->savedpc; + if (!cl->isC) { /* Lua function? prepare its call */ + CallInfo *ci; + StkId st, base; + Proto *p = cl->p; + luaD_checkstack(L, p->maxstacksize); + func = restorestack(L, funcr); + if (!p->is_vararg) { /* no varargs? */ + base = func + 1; + if (L->top > base + p->numparams) + L->top = base + p->numparams; + } + else { /* vararg function */ + int nargs = cast_int(L->top - func) - 1; + base = adjust_varargs(L, p, nargs); + func = restorestack(L, funcr); /* previous call may change the stack */ + } + ci = inc_ci(L); /* now `enter' new function */ + ci->func = func; + L->base = ci->base = base; + ci->top = L->base + p->maxstacksize; + lua_assert(ci->top <= L->stack_last); + L->savedpc = p->code; /* starting point */ + ci->tailcalls = 0; + ci->nresults = nresults; + for (st = L->top; st < ci->top; st++) + setnilvalue(st); + L->top = ci->top; + if (L->hookmask & LUA_MASKCALL) { + L->savedpc++; /* hooks assume 'pc' is already incremented */ + luaD_callhook(L, LUA_HOOKCALL, -1); + L->savedpc--; /* correct 'pc' */ + } + return PCRLUA; + } + else { /* if is a C function, call it */ + CallInfo *ci; + int n; + luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */ + ci = inc_ci(L); /* now `enter' new function */ + ci->func = restorestack(L, funcr); + L->base = ci->base = ci->func + 1; + ci->top = L->top + LUA_MINSTACK; + lua_assert(ci->top <= L->stack_last); + ci->nresults = nresults; + if (L->hookmask & LUA_MASKCALL) + luaD_callhook(L, LUA_HOOKCALL, -1); + lua_unlock(L); + n = (*curr_func(L)->c.f)(L); /* do the actual call */ + lua_lock(L); + if (n < 0) /* yielding? */ + return PCRYIELD; + else { + luaD_poscall(L, L->top - n); + return PCRC; + } + } +} + + +static StkId callrethooks (lua_State *L, StkId firstResult) { + ptrdiff_t fr = savestack(L, firstResult); /* next call may change stack */ + luaD_callhook(L, LUA_HOOKRET, -1); + if (f_isLua(L->ci)) { /* Lua function? */ + while (L->ci->tailcalls--) /* call hook for eventual tail calls */ + luaD_callhook(L, LUA_HOOKTAILRET, -1); + } + return restorestack(L, fr); +} + + +int luaD_poscall (lua_State *L, StkId firstResult) { + StkId res; + int wanted, i; + CallInfo *ci; + if (L->hookmask & LUA_MASKRET) + firstResult = callrethooks(L, firstResult); + ci = L->ci--; + res = ci->func; /* res == final position of 1st result */ + wanted = ci->nresults; + L->base = (ci - 1)->base; /* restore base */ + L->savedpc = (ci - 1)->savedpc; /* restore savedpc */ + /* move results to correct place */ + for (i = wanted; i != 0 && firstResult < L->top; i--) + setobjs2s(L, res++, firstResult++); + while (i-- > 0) + setnilvalue(res++); + L->top = res; + return (wanted - LUA_MULTRET); /* 0 iff wanted == LUA_MULTRET */ +} + + +/* +** Call a function (C or Lua). The function to be called is at *func. +** The arguments are on the stack, right after the function. +** When returns, all the results are on the stack, starting at the original +** function position. +*/ +void luaD_call (lua_State *L, StkId func, int nResults) { + if (++L->nCcalls >= LUAI_MAXCCALLS) { + if (L->nCcalls == LUAI_MAXCCALLS) + luaG_runerror(L, "C stack overflow"); + else if (L->nCcalls >= (LUAI_MAXCCALLS + (LUAI_MAXCCALLS>>3))) + luaD_throw(L, LUA_ERRERR); /* error while handing stack error */ + } + if (luaD_precall(L, func, nResults) == PCRLUA) /* is a Lua function? */ + luaV_execute(L, 1); /* call it */ + L->nCcalls--; + luaC_checkGC(L); +} + + +static void resume (lua_State *L, void *ud) { + StkId firstArg = cast(StkId, ud); + CallInfo *ci = L->ci; + if (L->status != LUA_YIELD) { /* start coroutine */ + lua_assert(ci == L->base_ci && firstArg > L->base); + if (luaD_precall(L, firstArg - 1, LUA_MULTRET) != PCRLUA) + return; + } + else { /* resuming from previous yield */ + if (!f_isLua(ci)) { /* `common' yield? */ + /* finish interrupted execution of `OP_CALL' */ + lua_assert(GET_OPCODE(*((ci-1)->savedpc - 1)) == OP_CALL || + GET_OPCODE(*((ci-1)->savedpc - 1)) == OP_TAILCALL); + if (luaD_poscall(L, firstArg)) /* complete it... */ + L->top = L->ci->top; /* and correct top if not multiple results */ + } + else /* yielded inside a hook: just continue its execution */ + L->base = L->ci->base; + } + L->status = 0; + luaV_execute(L, cast_int(L->ci - L->base_ci)); +} + + +static int resume_error (lua_State *L, const char *msg) { + L->top = L->ci->base; + setsvalue2s(L, L->top, luaS_new(L, msg)); + incr_top(L); + lua_unlock(L); + return LUA_ERRRUN; +} + + +LUA_API int lua_resume (lua_State *L, int nargs) { + int status; + lua_lock(L); + if (L->status != LUA_YIELD) { + if (L->status != 0) + return resume_error(L, "cannot resume dead coroutine"); + else if (L->ci != L->base_ci) + return resume_error(L, "cannot resume non-suspended coroutine"); + } + luai_userstateresume(L, nargs); + lua_assert(L->errfunc == 0 && L->nCcalls == 0); + status = luaD_rawrunprotected(L, resume, L->top - nargs); + if (status != 0) { /* error? */ + L->status = cast_byte(status); /* mark thread as `dead' */ + luaD_seterrorobj(L, status, L->top); + L->ci->top = L->top; + } + else + status = L->status; + lua_unlock(L); + return status; +} + + +LUA_API int lua_yield (lua_State *L, int nresults) { + luai_userstateyield(L, nresults); + lua_lock(L); + if (L->nCcalls > 0) + luaG_runerror(L, "attempt to yield across metamethod/C-call boundary"); + L->base = L->top - nresults; /* protect stack slots below */ + L->status = LUA_YIELD; + lua_unlock(L); + return -1; +} + + +int luaD_pcall (lua_State *L, Pfunc func, void *u, + ptrdiff_t old_top, ptrdiff_t ef) { + int status; + unsigned short oldnCcalls = L->nCcalls; + ptrdiff_t old_ci = saveci(L, L->ci); + lu_byte old_allowhooks = L->allowhook; + ptrdiff_t old_errfunc = L->errfunc; + L->errfunc = ef; + status = luaD_rawrunprotected(L, func, u); + if (status != 0) { /* an error occurred? */ + StkId oldtop = restorestack(L, old_top); + luaF_close(L, oldtop); /* close eventual pending closures */ + luaD_seterrorobj(L, status, oldtop); + L->nCcalls = oldnCcalls; + L->ci = restoreci(L, old_ci); + L->base = L->ci->base; + L->savedpc = L->ci->savedpc; + L->allowhook = old_allowhooks; + restore_stack_limit(L); + } + L->errfunc = old_errfunc; + return status; +} + + + +/* +** Execute a protected parser. +*/ +struct SParser { /* data to `f_parser' */ + ZIO *z; + Mbuffer buff; /* buffer to be used by the scanner */ + const char *name; +}; + +static void f_parser (lua_State *L, void *ud) { + int i; + Proto *tf; + Closure *cl; + struct SParser *p = cast(struct SParser *, ud); + int c = luaZ_lookahead(p->z); + luaC_checkGC(L); + tf = ((c == LUA_SIGNATURE[0]) ? luaU_undump : luaY_parser)(L, p->z, + &p->buff, p->name); + cl = luaF_newLclosure(L, tf->nups, hvalue(gt(L))); + cl->l.p = tf; + for (i = 0; i < tf->nups; i++) /* initialize eventual upvalues */ + cl->l.upvals[i] = luaF_newupval(L); + setclvalue(L, L->top, cl); + incr_top(L); +} + + +int luaD_protectedparser (lua_State *L, ZIO *z, const char *name) { + struct SParser p; + int status; + p.z = z; p.name = name; + luaZ_initbuffer(L, &p.buff); + status = luaD_pcall(L, f_parser, &p, savestack(L, L->top), L->errfunc); + luaZ_freebuffer(L, &p.buff); + return status; +} + + diff --git a/ref/lua-5.1/src/ldo.h b/ref/lua-5.1/src/ldo.h new file mode 100644 index 0000000..b2de92b --- /dev/null +++ b/ref/lua-5.1/src/ldo.h @@ -0,0 +1,57 @@ +/* +** $Id: ldo.h,v 2.7 2005/08/24 16:15:49 roberto Exp $ +** Stack and Call structure of Lua +** See Copyright Notice in lua.h +*/ + +#ifndef ldo_h +#define ldo_h + + +#include "lobject.h" +#include "lstate.h" +#include "lzio.h" + + +#define luaD_checkstack(L,n) \ + if ((char *)L->stack_last - (char *)L->top <= (n)*(int)sizeof(TValue)) \ + luaD_growstack(L, n); \ + else condhardstacktests(luaD_reallocstack(L, L->stacksize - EXTRA_STACK - 1)); + + +#define incr_top(L) {luaD_checkstack(L,1); L->top++;} + +#define savestack(L,p) ((char *)(p) - (char *)L->stack) +#define restorestack(L,n) ((TValue *)((char *)L->stack + (n))) + +#define saveci(L,p) ((char *)(p) - (char *)L->base_ci) +#define restoreci(L,n) ((CallInfo *)((char *)L->base_ci + (n))) + + +/* results from luaD_precall */ +#define PCRLUA 0 /* initiated a call to a Lua function */ +#define PCRC 1 /* did a call to a C function */ +#define PCRYIELD 2 /* C funtion yielded */ + + +/* type of protected functions, to be ran by `runprotected' */ +typedef void (*Pfunc) (lua_State *L, void *ud); + +LUAI_FUNC int luaD_protectedparser (lua_State *L, ZIO *z, const char *name); +LUAI_FUNC void luaD_callhook (lua_State *L, int event, int line); +LUAI_FUNC int luaD_precall (lua_State *L, StkId func, int nresults); +LUAI_FUNC void luaD_call (lua_State *L, StkId func, int nResults); +LUAI_FUNC int luaD_pcall (lua_State *L, Pfunc func, void *u, + ptrdiff_t oldtop, ptrdiff_t ef); +LUAI_FUNC int luaD_poscall (lua_State *L, StkId firstResult); +LUAI_FUNC void luaD_reallocCI (lua_State *L, int newsize); +LUAI_FUNC void luaD_reallocstack (lua_State *L, int newsize); +LUAI_FUNC void luaD_growstack (lua_State *L, int n); + +LUAI_FUNC void luaD_throw (lua_State *L, int errcode); +LUAI_FUNC int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud); + +LUAI_FUNC void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop); + +#endif + diff --git a/ref/lua-5.1/src/ldump.c b/ref/lua-5.1/src/ldump.c new file mode 100644 index 0000000..f08277d --- /dev/null +++ b/ref/lua-5.1/src/ldump.c @@ -0,0 +1,164 @@ +/* +** $Id: ldump.c,v 1.15 2006/02/16 15:53:49 lhf Exp $ +** save precompiled Lua chunks +** See Copyright Notice in lua.h +*/ + +#include + +#define ldump_c +#define LUA_CORE + +#include "lua.h" + +#include "lobject.h" +#include "lstate.h" +#include "lundump.h" + +typedef struct { + lua_State* L; + lua_Writer writer; + void* data; + int strip; + int status; +} DumpState; + +#define DumpMem(b,n,size,D) DumpBlock(b,(n)*(size),D) +#define DumpVar(x,D) DumpMem(&x,1,sizeof(x),D) + +static void DumpBlock(const void* b, size_t size, DumpState* D) +{ + if (D->status==0) + { + lua_unlock(D->L); + D->status=(*D->writer)(D->L,b,size,D->data); + lua_lock(D->L); + } +} + +static void DumpChar(int y, DumpState* D) +{ + char x=(char)y; + DumpVar(x,D); +} + +static void DumpInt(int x, DumpState* D) +{ + DumpVar(x,D); +} + +static void DumpNumber(lua_Number x, DumpState* D) +{ + DumpVar(x,D); +} + +static void DumpVector(const void* b, int n, size_t size, DumpState* D) +{ + DumpInt(n,D); + DumpMem(b,n,size,D); +} + +static void DumpString(const TString* s, DumpState* D) +{ + if (s==NULL || getstr(s)==NULL) + { + size_t size=0; + DumpVar(size,D); + } + else + { + size_t size=s->tsv.len+1; /* include trailing '\0' */ + DumpVar(size,D); + DumpBlock(getstr(s),size,D); + } +} + +#define DumpCode(f,D) DumpVector(f->code,f->sizecode,sizeof(Instruction),D) + +static void DumpFunction(const Proto* f, const TString* p, DumpState* D); + +static void DumpConstants(const Proto* f, DumpState* D) +{ + int i,n=f->sizek; + DumpInt(n,D); + for (i=0; ik[i]; + DumpChar(ttype(o),D); + switch (ttype(o)) + { + case LUA_TNIL: + break; + case LUA_TBOOLEAN: + DumpChar(bvalue(o),D); + break; + case LUA_TNUMBER: + DumpNumber(nvalue(o),D); + break; + case LUA_TSTRING: + DumpString(rawtsvalue(o),D); + break; + default: + lua_assert(0); /* cannot happen */ + break; + } + } + n=f->sizep; + DumpInt(n,D); + for (i=0; ip[i],f->source,D); +} + +static void DumpDebug(const Proto* f, DumpState* D) +{ + int i,n; + n= (D->strip) ? 0 : f->sizelineinfo; + DumpVector(f->lineinfo,n,sizeof(int),D); + n= (D->strip) ? 0 : f->sizelocvars; + DumpInt(n,D); + for (i=0; ilocvars[i].varname,D); + DumpInt(f->locvars[i].startpc,D); + DumpInt(f->locvars[i].endpc,D); + } + n= (D->strip) ? 0 : f->sizeupvalues; + DumpInt(n,D); + for (i=0; iupvalues[i],D); +} + +static void DumpFunction(const Proto* f, const TString* p, DumpState* D) +{ + DumpString((f->source==p || D->strip) ? NULL : f->source,D); + DumpInt(f->linedefined,D); + DumpInt(f->lastlinedefined,D); + DumpChar(f->nups,D); + DumpChar(f->numparams,D); + DumpChar(f->is_vararg,D); + DumpChar(f->maxstacksize,D); + DumpCode(f,D); + DumpConstants(f,D); + DumpDebug(f,D); +} + +static void DumpHeader(DumpState* D) +{ + char h[LUAC_HEADERSIZE]; + luaU_header(h); + DumpBlock(h,LUAC_HEADERSIZE,D); +} + +/* +** dump Lua function as precompiled chunk +*/ +int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, void* data, int strip) +{ + DumpState D; + D.L=L; + D.writer=w; + D.data=data; + D.strip=strip; + D.status=0; + DumpHeader(&D); + DumpFunction(f,NULL,&D); + return D.status; +} diff --git a/ref/lua-5.1/src/lfunc.c b/ref/lua-5.1/src/lfunc.c new file mode 100644 index 0000000..b8cd67b --- /dev/null +++ b/ref/lua-5.1/src/lfunc.c @@ -0,0 +1,174 @@ +/* +** $Id: lfunc.c,v 2.12 2005/12/22 16:19:56 roberto Exp $ +** Auxiliary functions to manipulate prototypes and closures +** See Copyright Notice in lua.h +*/ + + +#include + +#define lfunc_c +#define LUA_CORE + +#include "lua.h" + +#include "lfunc.h" +#include "lgc.h" +#include "lmem.h" +#include "lobject.h" +#include "lstate.h" + + + +Closure *luaF_newCclosure (lua_State *L, int nelems, Table *e) { + Closure *c = cast(Closure *, luaM_malloc(L, sizeCclosure(nelems))); + luaC_link(L, obj2gco(c), LUA_TFUNCTION); + c->c.isC = 1; + c->c.env = e; + c->c.nupvalues = cast_byte(nelems); + return c; +} + + +Closure *luaF_newLclosure (lua_State *L, int nelems, Table *e) { + Closure *c = cast(Closure *, luaM_malloc(L, sizeLclosure(nelems))); + luaC_link(L, obj2gco(c), LUA_TFUNCTION); + c->l.isC = 0; + c->l.env = e; + c->l.nupvalues = cast_byte(nelems); + while (nelems--) c->l.upvals[nelems] = NULL; + return c; +} + + +UpVal *luaF_newupval (lua_State *L) { + UpVal *uv = luaM_new(L, UpVal); + luaC_link(L, obj2gco(uv), LUA_TUPVAL); + uv->v = &uv->u.value; + setnilvalue(uv->v); + return uv; +} + + +UpVal *luaF_findupval (lua_State *L, StkId level) { + global_State *g = G(L); + GCObject **pp = &L->openupval; + UpVal *p; + UpVal *uv; + while ((p = ngcotouv(*pp)) != NULL && p->v >= level) { + lua_assert(p->v != &p->u.value); + if (p->v == level) { /* found a corresponding upvalue? */ + if (isdead(g, obj2gco(p))) /* is it dead? */ + changewhite(obj2gco(p)); /* ressurect it */ + return p; + } + pp = &p->next; + } + uv = luaM_new(L, UpVal); /* not found: create a new one */ + uv->tt = LUA_TUPVAL; + uv->marked = luaC_white(g); + uv->v = level; /* current value lives in the stack */ + uv->next = *pp; /* chain it in the proper position */ + *pp = obj2gco(uv); + uv->u.l.prev = &g->uvhead; /* double link it in `uvhead' list */ + uv->u.l.next = g->uvhead.u.l.next; + uv->u.l.next->u.l.prev = uv; + g->uvhead.u.l.next = uv; + lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv); + return uv; +} + + +static void unlinkupval (UpVal *uv) { + lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv); + uv->u.l.next->u.l.prev = uv->u.l.prev; /* remove from `uvhead' list */ + uv->u.l.prev->u.l.next = uv->u.l.next; +} + + +void luaF_freeupval (lua_State *L, UpVal *uv) { + if (uv->v != &uv->u.value) /* is it open? */ + unlinkupval(uv); /* remove from open list */ + luaM_free(L, uv); /* free upvalue */ +} + + +void luaF_close (lua_State *L, StkId level) { + UpVal *uv; + global_State *g = G(L); + while ((uv = ngcotouv(L->openupval)) != NULL && uv->v >= level) { + GCObject *o = obj2gco(uv); + lua_assert(!isblack(o) && uv->v != &uv->u.value); + L->openupval = uv->next; /* remove from `open' list */ + if (isdead(g, o)) + luaF_freeupval(L, uv); /* free upvalue */ + else { + unlinkupval(uv); + setobj(L, &uv->u.value, uv->v); + uv->v = &uv->u.value; /* now current value lives here */ + luaC_linkupval(L, uv); /* link upvalue into `gcroot' list */ + } + } +} + + +Proto *luaF_newproto (lua_State *L) { + Proto *f = luaM_new(L, Proto); + luaC_link(L, obj2gco(f), LUA_TPROTO); + f->k = NULL; + f->sizek = 0; + f->p = NULL; + f->sizep = 0; + f->code = NULL; + f->sizecode = 0; + f->sizelineinfo = 0; + f->sizeupvalues = 0; + f->nups = 0; + f->upvalues = NULL; + f->numparams = 0; + f->is_vararg = 0; + f->maxstacksize = 0; + f->lineinfo = NULL; + f->sizelocvars = 0; + f->locvars = NULL; + 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, Instruction); + luaM_freearray(L, f->p, f->sizep, Proto *); + luaM_freearray(L, f->k, f->sizek, TValue); + luaM_freearray(L, f->lineinfo, f->sizelineinfo, int); + luaM_freearray(L, f->locvars, f->sizelocvars, struct LocVar); + luaM_freearray(L, f->upvalues, f->sizeupvalues, TString *); + luaM_free(L, f); +} + + +void luaF_freeclosure (lua_State *L, Closure *c) { + int size = (c->c.isC) ? sizeCclosure(c->c.nupvalues) : + sizeLclosure(c->l.nupvalues); + luaM_freemem(L, c, size); +} + + +/* +** 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/ref/lua-5.1/src/lfunc.h b/ref/lua-5.1/src/lfunc.h new file mode 100644 index 0000000..2e02419 --- /dev/null +++ b/ref/lua-5.1/src/lfunc.h @@ -0,0 +1,34 @@ +/* +** $Id: lfunc.h,v 2.4 2005/04/25 19:24:10 roberto Exp $ +** Auxiliary functions to manipulate prototypes and closures +** See Copyright Notice in lua.h +*/ + +#ifndef lfunc_h +#define lfunc_h + + +#include "lobject.h" + + +#define sizeCclosure(n) (cast(int, sizeof(CClosure)) + \ + cast(int, sizeof(TValue)*((n)-1))) + +#define sizeLclosure(n) (cast(int, sizeof(LClosure)) + \ + cast(int, sizeof(TValue *)*((n)-1))) + + +LUAI_FUNC Proto *luaF_newproto (lua_State *L); +LUAI_FUNC Closure *luaF_newCclosure (lua_State *L, int nelems, Table *e); +LUAI_FUNC Closure *luaF_newLclosure (lua_State *L, int nelems, Table *e); +LUAI_FUNC UpVal *luaF_newupval (lua_State *L); +LUAI_FUNC UpVal *luaF_findupval (lua_State *L, StkId level); +LUAI_FUNC void luaF_close (lua_State *L, StkId level); +LUAI_FUNC void luaF_freeproto (lua_State *L, Proto *f); +LUAI_FUNC void luaF_freeclosure (lua_State *L, Closure *c); +LUAI_FUNC void luaF_freeupval (lua_State *L, UpVal *uv); +LUAI_FUNC const char *luaF_getlocalname (const Proto *func, int local_number, + int pc); + + +#endif diff --git a/ref/lua-5.1/src/lgc.c b/ref/lua-5.1/src/lgc.c new file mode 100644 index 0000000..691565d --- /dev/null +++ b/ref/lua-5.1/src/lgc.c @@ -0,0 +1,707 @@ +/* +** $Id: lgc.c,v 2.37 2005/12/22 16:19:56 roberto Exp $ +** Garbage Collector +** See Copyright Notice in lua.h +*/ + +#include + +#define lgc_c +#define LUA_CORE + +#include "lua.h" + +#include "ldebug.h" +#include "ldo.h" +#include "lfunc.h" +#include "lgc.h" +#include "lmem.h" +#include "lobject.h" +#include "lstate.h" +#include "lstring.h" +#include "ltable.h" +#include "ltm.h" + + +#define GCSTEPSIZE 1024u +#define GCSWEEPMAX 40 +#define GCSWEEPCOST 10 +#define GCFINALIZECOST 100 + + +#define maskmarks cast_byte(~(bitmask(BLACKBIT)|WHITEBITS)) + +#define makewhite(g,x) \ + ((x)->gch.marked = cast_byte(((x)->gch.marked & maskmarks) | luaC_white(g))) + +#define white2gray(x) reset2bits((x)->gch.marked, WHITE0BIT, WHITE1BIT) +#define black2gray(x) resetbit((x)->gch.marked, BLACKBIT) + +#define stringmark(s) reset2bits((s)->tsv.marked, WHITE0BIT, WHITE1BIT) + + +#define isfinalized(u) testbit((u)->marked, FINALIZEDBIT) +#define markfinalized(u) l_setbit((u)->marked, FINALIZEDBIT) + + +#define KEYWEAK bitmask(KEYWEAKBIT) +#define VALUEWEAK bitmask(VALUEWEAKBIT) + + + +#define markvalue(g,o) { checkconsistency(o); \ + if (iscollectable(o) && iswhite(gcvalue(o))) reallymarkobject(g,gcvalue(o)); } + +#define markobject(g,t) { if (iswhite(obj2gco(t))) \ + reallymarkobject(g, obj2gco(t)); } + + +#define setthreshold(g) (g->GCthreshold = (g->estimate/100) * g->gcpause) + + +static void removeentry (Node *n) { + lua_assert(ttisnil(gval(n))); + if (iscollectable(gkey(n))) + setttype(gkey(n), LUA_TDEADKEY); /* dead key; remove it */ +} + + +static void reallymarkobject (global_State *g, GCObject *o) { + lua_assert(iswhite(o) && !isdead(g, o)); + white2gray(o); + switch (o->gch.tt) { + case LUA_TSTRING: { + return; + } + case LUA_TUSERDATA: { + Table *mt = gco2u(o)->metatable; + gray2black(o); /* udata are never gray */ + if (mt) markobject(g, mt); + markobject(g, gco2u(o)->env); + return; + } + case LUA_TUPVAL: { + UpVal *uv = gco2uv(o); + markvalue(g, uv->v); + if (uv->v == &uv->u.value) /* closed? */ + gray2black(o); /* open upvalues are never black */ + return; + } + case LUA_TFUNCTION: { + gco2cl(o)->c.gclist = g->gray; + g->gray = o; + break; + } + case LUA_TTABLE: { + gco2h(o)->gclist = g->gray; + g->gray = o; + break; + } + case LUA_TTHREAD: { + gco2th(o)->gclist = g->gray; + g->gray = o; + break; + } + case LUA_TPROTO: { + gco2p(o)->gclist = g->gray; + g->gray = o; + break; + } + default: lua_assert(0); + } +} + + +static void marktmu (global_State *g) { + GCObject *u = g->tmudata; + if (u) { + do { + u = u->gch.next; + makewhite(g, u); /* may be marked, if left from previous GC */ + reallymarkobject(g, u); + } while (u != g->tmudata); + } +} + + +/* move `dead' udata that need finalization to list `tmudata' */ +size_t luaC_separateudata (lua_State *L, int all) { + global_State *g = G(L); + size_t deadmem = 0; + GCObject **p = &g->mainthread->next; + GCObject *curr; + while ((curr = *p) != NULL) { + if (!(iswhite(curr) || all) || isfinalized(gco2u(curr))) + p = &curr->gch.next; /* don't bother with them */ + else if (fasttm(L, gco2u(curr)->metatable, TM_GC) == NULL) { + markfinalized(gco2u(curr)); /* don't need finalization */ + p = &curr->gch.next; + } + else { /* must call its gc method */ + deadmem += sizeudata(gco2u(curr)); + markfinalized(gco2u(curr)); + *p = curr->gch.next; + /* link `curr' at the end of `tmudata' list */ + if (g->tmudata == NULL) /* list is empty? */ + g->tmudata = curr->gch.next = curr; /* creates a circular list */ + else { + curr->gch.next = g->tmudata->gch.next; + g->tmudata->gch.next = curr; + g->tmudata = curr; + } + } + } + return deadmem; +} + + +static int traversetable (global_State *g, Table *h) { + int i; + int weakkey = 0; + int weakvalue = 0; + const TValue *mode; + if (h->metatable) + markobject(g, h->metatable); + mode = gfasttm(g, h->metatable, TM_MODE); + if (mode && ttisstring(mode)) { /* is there a weak mode? */ + weakkey = (strchr(svalue(mode), 'k') != NULL); + weakvalue = (strchr(svalue(mode), 'v') != NULL); + if (weakkey || weakvalue) { /* is really weak? */ + h->marked &= ~(KEYWEAK | VALUEWEAK); /* clear bits */ + h->marked |= cast_byte((weakkey << KEYWEAKBIT) | + (weakvalue << VALUEWEAKBIT)); + h->gclist = g->weak; /* must be cleared after GC, ... */ + g->weak = obj2gco(h); /* ... so put in the appropriate list */ + } + } + if (weakkey && weakvalue) return 1; + if (!weakvalue) { + i = h->sizearray; + while (i--) + markvalue(g, &h->array[i]); + } + i = sizenode(h); + while (i--) { + Node *n = gnode(h, i); + lua_assert(ttype(gkey(n)) != LUA_TDEADKEY || ttisnil(gval(n))); + if (ttisnil(gval(n))) + removeentry(n); /* remove empty entries */ + else { + lua_assert(!ttisnil(gkey(n))); + if (!weakkey) markvalue(g, gkey(n)); + if (!weakvalue) markvalue(g, gval(n)); + } + } + return weakkey || weakvalue; +} + + +/* +** All marks are conditional because a GC may happen while the +** prototype is still being created +*/ +static void traverseproto (global_State *g, Proto *f) { + int i; + if (f->source) stringmark(f->source); + for (i=0; isizek; i++) /* mark literals */ + markvalue(g, &f->k[i]); + for (i=0; isizeupvalues; i++) { /* mark upvalue names */ + if (f->upvalues[i]) + stringmark(f->upvalues[i]); + } + for (i=0; isizep; i++) { /* mark nested protos */ + if (f->p[i]) + markobject(g, f->p[i]); + } + for (i=0; isizelocvars; i++) { /* mark local-variable names */ + if (f->locvars[i].varname) + stringmark(f->locvars[i].varname); + } +} + + + +static void traverseclosure (global_State *g, Closure *cl) { + markobject(g, cl->c.env); + if (cl->c.isC) { + int i; + for (i=0; ic.nupvalues; i++) /* mark its upvalues */ + markvalue(g, &cl->c.upvalue[i]); + } + else { + int i; + lua_assert(cl->l.nupvalues == cl->l.p->nups); + markobject(g, cl->l.p); + for (i=0; il.nupvalues; i++) /* mark its upvalues */ + markobject(g, cl->l.upvals[i]); + } +} + + +static void checkstacksizes (lua_State *L, StkId max) { + int ci_used = cast_int(L->ci - L->base_ci); /* number of `ci' in use */ + int s_used = cast_int(max - L->stack); /* part of stack in use */ + if (L->size_ci > LUAI_MAXCALLS) /* handling overflow? */ + return; /* do not touch the stacks */ + if (4*ci_used < L->size_ci && 2*BASIC_CI_SIZE < L->size_ci) + luaD_reallocCI(L, L->size_ci/2); /* still big enough... */ + condhardstacktests(luaD_reallocCI(L, ci_used + 1)); + if (4*s_used < L->stacksize && + 2*(BASIC_STACK_SIZE+EXTRA_STACK) < L->stacksize) + luaD_reallocstack(L, L->stacksize/2); /* still big enough... */ + condhardstacktests(luaD_reallocstack(L, s_used)); +} + + +static void traversestack (global_State *g, lua_State *l) { + StkId o, lim; + CallInfo *ci; + markvalue(g, gt(l)); + lim = l->top; + for (ci = l->base_ci; ci <= l->ci; ci++) { + lua_assert(ci->top <= l->stack_last); + if (lim < ci->top) lim = ci->top; + } + for (o = l->stack; o < l->top; o++) + markvalue(g, o); + for (; o <= lim; o++) + setnilvalue(o); + checkstacksizes(l, lim); +} + + +/* +** traverse one gray object, turning it to black. +** Returns `quantity' traversed. +*/ +static l_mem propagatemark (global_State *g) { + GCObject *o = g->gray; + lua_assert(isgray(o)); + gray2black(o); + switch (o->gch.tt) { + case LUA_TTABLE: { + Table *h = gco2h(o); + g->gray = h->gclist; + if (traversetable(g, h)) /* table is weak? */ + black2gray(o); /* keep it gray */ + return sizeof(Table) + sizeof(TValue) * h->sizearray + + sizeof(Node) * sizenode(h); + } + case LUA_TFUNCTION: { + Closure *cl = gco2cl(o); + g->gray = cl->c.gclist; + traverseclosure(g, cl); + return (cl->c.isC) ? sizeCclosure(cl->c.nupvalues) : + sizeLclosure(cl->l.nupvalues); + } + case LUA_TTHREAD: { + lua_State *th = gco2th(o); + g->gray = th->gclist; + th->gclist = g->grayagain; + g->grayagain = o; + black2gray(o); + traversestack(g, th); + return sizeof(lua_State) + sizeof(TValue) * th->stacksize + + sizeof(CallInfo) * th->size_ci; + } + case LUA_TPROTO: { + Proto *p = gco2p(o); + g->gray = p->gclist; + traverseproto(g, p); + return sizeof(Proto) + sizeof(Instruction) * p->sizecode + + sizeof(Proto *) * p->sizep + + sizeof(TValue) * p->sizek + + sizeof(int) * p->sizelineinfo + + sizeof(LocVar) * p->sizelocvars + + sizeof(TString *) * p->sizeupvalues; + } + default: lua_assert(0); return 0; + } +} + + +static void propagateall (global_State *g) { + while (g->gray) propagatemark(g); +} + + +/* +** The next function 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 userdata +** being finalized, keep them in keys, but not in values +*/ +static int iscleared (const TValue *o, int iskey) { + if (!iscollectable(o)) return 0; + if (ttisstring(o)) { + stringmark(rawtsvalue(o)); /* strings are `values', so are never weak */ + return 0; + } + return iswhite(gcvalue(o)) || + (ttisuserdata(o) && (!iskey && isfinalized(uvalue(o)))); +} + + +/* +** clear collected entries from weaktables +*/ +static void cleartable (GCObject *l) { + while (l) { + Table *h = gco2h(l); + int i = h->sizearray; + lua_assert(testbit(h->marked, VALUEWEAKBIT) || + testbit(h->marked, KEYWEAKBIT)); + if (testbit(h->marked, VALUEWEAKBIT)) { + while (i--) { + TValue *o = &h->array[i]; + if (iscleared(o, 0)) /* value was collected? */ + setnilvalue(o); /* remove value */ + } + } + i = sizenode(h); + while (i--) { + Node *n = gnode(h, i); + if (!ttisnil(gval(n)) && /* non-empty entry? */ + (iscleared(key2tval(n), 1) || iscleared(gval(n), 0))) { + setnilvalue(gval(n)); /* remove value ... */ + removeentry(n); /* remove entry from table */ + } + } + l = h->gclist; + } +} + + +static void freeobj (lua_State *L, GCObject *o) { + switch (o->gch.tt) { + case LUA_TPROTO: luaF_freeproto(L, gco2p(o)); break; + case LUA_TFUNCTION: luaF_freeclosure(L, gco2cl(o)); break; + case LUA_TUPVAL: luaF_freeupval(L, gco2uv(o)); break; + case LUA_TTABLE: luaH_free(L, gco2h(o)); break; + case LUA_TTHREAD: { + lua_assert(gco2th(o) != L && gco2th(o) != G(L)->mainthread); + luaE_freethread(L, gco2th(o)); + break; + } + case LUA_TSTRING: { + G(L)->strt.nuse--; + luaM_freemem(L, o, sizestring(gco2ts(o))); + break; + } + case LUA_TUSERDATA: { + luaM_freemem(L, o, sizeudata(gco2u(o))); + break; + } + default: lua_assert(0); + } +} + + + +#define sweepwholelist(L,p) sweeplist(L,p,MAX_LUMEM) + + +static GCObject **sweeplist (lua_State *L, GCObject **p, lu_mem count) { + GCObject *curr; + global_State *g = G(L); + int deadmask = otherwhite(g); + while ((curr = *p) != NULL && count-- > 0) { + if (curr->gch.tt == LUA_TTHREAD) /* sweep open upvalues of each thread */ + sweepwholelist(L, &gco2th(curr)->openupval); + if ((curr->gch.marked ^ WHITEBITS) & deadmask) { /* not dead? */ + lua_assert(!isdead(g, curr) || testbit(curr->gch.marked, FIXEDBIT)); + makewhite(g, curr); /* make it white (for next cycle) */ + p = &curr->gch.next; + } + else { /* must erase `curr' */ + lua_assert(isdead(g, curr) || deadmask == bitmask(SFIXEDBIT)); + *p = curr->gch.next; + if (curr == g->rootgc) /* is the first element of the list? */ + g->rootgc = curr->gch.next; /* adjust first */ + freeobj(L, curr); + } + } + return p; +} + + +static void checkSizes (lua_State *L) { + global_State *g = G(L); + /* check size of string hash */ + if (g->strt.nuse < cast(lu_int32, g->strt.size/4) && + g->strt.size > MINSTRTABSIZE*2) + luaS_resize(L, g->strt.size/2); /* table is too big */ + /* check size of buffer */ + if (luaZ_sizebuffer(&g->buff) > LUA_MINBUFFER*2) { /* buffer too big? */ + size_t newsize = luaZ_sizebuffer(&g->buff) / 2; + luaZ_resizebuffer(L, &g->buff, newsize); + } +} + + +static void GCTM (lua_State *L) { + global_State *g = G(L); + GCObject *o = g->tmudata->gch.next; /* get first element */ + Udata *udata = rawgco2u(o); + const TValue *tm; + /* remove udata from `tmudata' */ + if (o == g->tmudata) /* last element? */ + g->tmudata = NULL; + else + g->tmudata->gch.next = udata->uv.next; + udata->uv.next = g->mainthread->next; /* return it to `root' list */ + g->mainthread->next = o; + makewhite(g, o); + tm = fasttm(L, udata->uv.metatable, TM_GC); + if (tm != NULL) { + lu_byte oldah = L->allowhook; + lu_mem oldt = g->GCthreshold; + L->allowhook = 0; /* stop debug hooks during GC tag method */ + g->GCthreshold = 2*g->totalbytes; /* avoid GC steps */ + setobj2s(L, L->top, tm); + setuvalue(L, L->top+1, udata); + L->top += 2; + luaD_call(L, L->top - 2, 0); + L->allowhook = oldah; /* restore hooks */ + g->GCthreshold = oldt; /* restore threshold */ + } +} + + +/* +** Call all GC tag methods +*/ +void luaC_callGCTM (lua_State *L) { + while (G(L)->tmudata) + GCTM(L); +} + + +void luaC_freeall (lua_State *L) { + global_State *g = G(L); + int i; + g->currentwhite = WHITEBITS | bitmask(SFIXEDBIT); /* mask to collect all elements */ + sweepwholelist(L, &g->rootgc); + for (i = 0; i < g->strt.size; i++) /* free all string lists */ + sweepwholelist(L, &g->strt.hash[i]); +} + + +static void markmt (global_State *g) { + int i; + for (i=0; imt[i]) markobject(g, g->mt[i]); +} + + +/* mark root set */ +static void markroot (lua_State *L) { + global_State *g = G(L); + g->gray = NULL; + g->grayagain = NULL; + g->weak = NULL; + markobject(g, g->mainthread); + /* make global table be traversed before main stack */ + markvalue(g, gt(g->mainthread)); + markvalue(g, registry(L)); + markmt(g); + g->gcstate = GCSpropagate; +} + + +static void remarkupvals (global_State *g) { + UpVal *uv; + for (uv = g->uvhead.u.l.next; uv != &g->uvhead; uv = uv->u.l.next) { + lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv); + if (isgray(obj2gco(uv))) + markvalue(g, uv->v); + } +} + + +static void atomic (lua_State *L) { + global_State *g = G(L); + size_t udsize; /* total size of userdata to be finalized */ + /* remark occasional upvalues of (maybe) dead threads */ + remarkupvals(g); + /* traverse objects cautch by write barrier and by 'remarkupvals' */ + propagateall(g); + /* remark weak tables */ + g->gray = g->weak; + g->weak = NULL; + lua_assert(!iswhite(obj2gco(g->mainthread))); + markobject(g, L); /* mark running thread */ + markmt(g); /* mark basic metatables (again) */ + propagateall(g); + /* remark gray again */ + g->gray = g->grayagain; + g->grayagain = NULL; + propagateall(g); + udsize = luaC_separateudata(L, 0); /* separate userdata to be finalized */ + marktmu(g); /* mark `preserved' userdata */ + propagateall(g); /* remark, to propagate `preserveness' */ + cleartable(g->weak); /* remove collected objects from weak tables */ + /* flip current white */ + g->currentwhite = cast_byte(otherwhite(g)); + g->sweepstrgc = 0; + g->sweepgc = &g->rootgc; + g->gcstate = GCSsweepstring; + g->estimate = g->totalbytes - udsize; /* first estimate */ +} + + +static l_mem singlestep (lua_State *L) { + global_State *g = G(L); + /*lua_checkmemory(L);*/ + switch (g->gcstate) { + case GCSpause: { + markroot(L); /* start a new collection */ + return 0; + } + case GCSpropagate: { + if (g->gray) + return propagatemark(g); + else { /* no more `gray' objects */ + atomic(L); /* finish mark phase */ + return 0; + } + } + case GCSsweepstring: { + lu_mem old = g->totalbytes; + sweepwholelist(L, &g->strt.hash[g->sweepstrgc++]); + if (g->sweepstrgc >= g->strt.size) /* nothing more to sweep? */ + g->gcstate = GCSsweep; /* end sweep-string phase */ + lua_assert(old >= g->totalbytes); + g->estimate -= old - g->totalbytes; + return GCSWEEPCOST; + } + case GCSsweep: { + lu_mem old = g->totalbytes; + g->sweepgc = sweeplist(L, g->sweepgc, GCSWEEPMAX); + if (*g->sweepgc == NULL) { /* nothing more to sweep? */ + checkSizes(L); + g->gcstate = GCSfinalize; /* end sweep phase */ + } + lua_assert(old >= g->totalbytes); + g->estimate -= old - g->totalbytes; + return GCSWEEPMAX*GCSWEEPCOST; + } + case GCSfinalize: { + if (g->tmudata) { + GCTM(L); + return GCFINALIZECOST; + } + else { + g->gcstate = GCSpause; /* end collection */ + g->gcdept = 0; + return 0; + } + } + default: lua_assert(0); return 0; + } +} + + +void luaC_step (lua_State *L) { + global_State *g = G(L); + l_mem lim = (GCSTEPSIZE/100) * g->gcstepmul; + if (lim == 0) + lim = (MAX_LUMEM-1)/2; /* no limit */ + g->gcdept += g->totalbytes - g->GCthreshold; + do { + lim -= singlestep(L); + if (g->gcstate == GCSpause) + break; + } while (lim > 0); + if (g->gcstate != GCSpause) { + if (g->gcdept < GCSTEPSIZE) + g->GCthreshold = g->totalbytes + GCSTEPSIZE; /* - lim/g->gcstepmul;*/ + else { + g->gcdept -= GCSTEPSIZE; + g->GCthreshold = g->totalbytes; + } + } + else { + lua_assert(g->totalbytes >= g->estimate); + setthreshold(g); + } +} + + +void luaC_fullgc (lua_State *L) { + global_State *g = G(L); + if (g->gcstate <= GCSpropagate) { + /* reset sweep marks to sweep all elements (returning them to white) */ + g->sweepstrgc = 0; + g->sweepgc = &g->rootgc; + /* reset other collector lists */ + g->gray = NULL; + g->grayagain = NULL; + g->weak = NULL; + g->gcstate = GCSsweepstring; + } + lua_assert(g->gcstate != GCSpause && g->gcstate != GCSpropagate); + /* finish any pending sweep phase */ + while (g->gcstate != GCSfinalize) { + lua_assert(g->gcstate == GCSsweepstring || g->gcstate == GCSsweep); + singlestep(L); + } + markroot(L); + while (g->gcstate != GCSpause) { + singlestep(L); + } + setthreshold(g); +} + + +void luaC_barrierf (lua_State *L, GCObject *o, GCObject *v) { + global_State *g = G(L); + lua_assert(isblack(o) && iswhite(v) && !isdead(g, v) && !isdead(g, o)); + lua_assert(g->gcstate != GCSfinalize && g->gcstate != GCSpause); + lua_assert(ttype(&o->gch) != LUA_TTABLE); + /* must keep invariant? */ + if (g->gcstate == GCSpropagate) + reallymarkobject(g, v); /* restore invariant */ + else /* don't mind */ + makewhite(g, o); /* mark as white just to avoid other barriers */ +} + + +void luaC_barrierback (lua_State *L, Table *t) { + global_State *g = G(L); + GCObject *o = obj2gco(t); + lua_assert(isblack(o) && !isdead(g, o)); + lua_assert(g->gcstate != GCSfinalize && g->gcstate != GCSpause); + black2gray(o); /* make table gray (again) */ + t->gclist = g->grayagain; + g->grayagain = o; +} + + +void luaC_link (lua_State *L, GCObject *o, lu_byte tt) { + global_State *g = G(L); + o->gch.next = g->rootgc; + g->rootgc = o; + o->gch.marked = luaC_white(g); + o->gch.tt = tt; +} + + +void luaC_linkupval (lua_State *L, UpVal *uv) { + global_State *g = G(L); + GCObject *o = obj2gco(uv); + o->gch.next = g->rootgc; /* link upvalue into `rootgc' list */ + g->rootgc = o; + if (isgray(o)) { + if (g->gcstate == GCSpropagate) { + gray2black(o); /* closed upvalues need barrier */ + luaC_barrier(L, uv, uv->v); + } + else { /* sweep phase: sweep it (turning it into white) */ + makewhite(g, o); + lua_assert(g->gcstate != GCSfinalize && g->gcstate != GCSpause); + } + } +} + diff --git a/ref/lua-5.1/src/lgc.h b/ref/lua-5.1/src/lgc.h new file mode 100644 index 0000000..5f69acb --- /dev/null +++ b/ref/lua-5.1/src/lgc.h @@ -0,0 +1,110 @@ +/* +** $Id: lgc.h,v 2.15 2005/08/24 16:15:49 roberto Exp $ +** Garbage Collector +** See Copyright Notice in lua.h +*/ + +#ifndef lgc_h +#define lgc_h + + +#include "lobject.h" + + +/* +** Possible states of the Garbage Collector +*/ +#define GCSpause 0 +#define GCSpropagate 1 +#define GCSsweepstring 2 +#define GCSsweep 3 +#define GCSfinalize 4 + + +/* +** some userful bit tricks +*/ +#define resetbits(x,m) ((x) &= cast(lu_byte, ~(m))) +#define setbits(x,m) ((x) |= (m)) +#define testbits(x,m) ((x) & (m)) +#define bitmask(b) (1<<(b)) +#define bit2mask(b1,b2) (bitmask(b1) | bitmask(b2)) +#define l_setbit(x,b) setbits(x, bitmask(b)) +#define resetbit(x,b) resetbits(x, bitmask(b)) +#define testbit(x,b) testbits(x, bitmask(b)) +#define set2bits(x,b1,b2) setbits(x, (bit2mask(b1, b2))) +#define reset2bits(x,b1,b2) resetbits(x, (bit2mask(b1, b2))) +#define test2bits(x,b1,b2) testbits(x, (bit2mask(b1, b2))) + + + +/* +** Layout for bit use in `marked' field: +** bit 0 - object is white (type 0) +** bit 1 - object is white (type 1) +** bit 2 - object is black +** bit 3 - for userdata: has been finalized +** bit 3 - for tables: has weak keys +** bit 4 - for tables: has weak values +** bit 5 - object is fixed (should not be collected) +** bit 6 - object is "super" fixed (only the main thread) +*/ + + +#define WHITE0BIT 0 +#define WHITE1BIT 1 +#define BLACKBIT 2 +#define FINALIZEDBIT 3 +#define KEYWEAKBIT 3 +#define VALUEWEAKBIT 4 +#define FIXEDBIT 5 +#define SFIXEDBIT 6 +#define WHITEBITS bit2mask(WHITE0BIT, WHITE1BIT) + + +#define iswhite(x) test2bits((x)->gch.marked, WHITE0BIT, WHITE1BIT) +#define isblack(x) testbit((x)->gch.marked, BLACKBIT) +#define isgray(x) (!isblack(x) && !iswhite(x)) + +#define otherwhite(g) (g->currentwhite ^ WHITEBITS) +#define isdead(g,v) ((v)->gch.marked & otherwhite(g) & WHITEBITS) + +#define changewhite(x) ((x)->gch.marked ^= WHITEBITS) +#define gray2black(x) l_setbit((x)->gch.marked, BLACKBIT) + +#define valiswhite(x) (iscollectable(x) && iswhite(gcvalue(x))) + +#define luaC_white(g) cast(lu_byte, (g)->currentwhite & WHITEBITS) + + +#define luaC_checkGC(L) { \ + condhardstacktests(luaD_reallocstack(L, L->stacksize - EXTRA_STACK - 1)); \ + if (G(L)->totalbytes >= G(L)->GCthreshold) \ + luaC_step(L); } + + +#define luaC_barrier(L,p,v) { if (valiswhite(v) && isblack(obj2gco(p))) \ + luaC_barrierf(L,obj2gco(p),gcvalue(v)); } + +#define luaC_barriert(L,t,v) { if (valiswhite(v) && isblack(obj2gco(t))) \ + luaC_barrierback(L,t); } + +#define luaC_objbarrier(L,p,o) \ + { if (iswhite(obj2gco(o)) && isblack(obj2gco(p))) \ + luaC_barrierf(L,obj2gco(p),obj2gco(o)); } + +#define luaC_objbarriert(L,t,o) \ + { if (iswhite(obj2gco(o)) && isblack(obj2gco(t))) luaC_barrierback(L,t); } + +LUAI_FUNC size_t luaC_separateudata (lua_State *L, int all); +LUAI_FUNC void luaC_callGCTM (lua_State *L); +LUAI_FUNC void luaC_freeall (lua_State *L); +LUAI_FUNC void luaC_step (lua_State *L); +LUAI_FUNC void luaC_fullgc (lua_State *L); +LUAI_FUNC void luaC_link (lua_State *L, GCObject *o, lu_byte tt); +LUAI_FUNC void luaC_linkupval (lua_State *L, UpVal *uv); +LUAI_FUNC void luaC_barrierf (lua_State *L, GCObject *o, GCObject *v); +LUAI_FUNC void luaC_barrierback (lua_State *L, Table *t); + + +#endif diff --git a/ref/lua-5.1/src/linit.c b/ref/lua-5.1/src/linit.c new file mode 100644 index 0000000..483d9c8 --- /dev/null +++ b/ref/lua-5.1/src/linit.c @@ -0,0 +1,38 @@ +/* +** $Id: linit.c,v 1.14 2005/12/29 15:32:11 roberto Exp $ +** Initialization of libraries for lua.c +** See Copyright Notice in lua.h +*/ + + +#define linit_c +#define LUA_LIB + +#include "lua.h" + +#include "lualib.h" +#include "lauxlib.h" + + +static const luaL_Reg lualibs[] = { + {"", luaopen_base}, + {LUA_LOADLIBNAME, luaopen_package}, + {LUA_TABLIBNAME, luaopen_table}, + {LUA_IOLIBNAME, luaopen_io}, + {LUA_OSLIBNAME, luaopen_os}, + {LUA_STRLIBNAME, luaopen_string}, + {LUA_MATHLIBNAME, luaopen_math}, + {LUA_DBLIBNAME, luaopen_debug}, + {NULL, NULL} +}; + + +LUALIB_API void luaL_openlibs (lua_State *L) { + const luaL_Reg *lib = lualibs; + for (; lib->func; lib++) { + lua_pushcfunction(L, lib->func); + lua_pushstring(L, lib->name); + lua_call(L, 1, 0); + } +} + diff --git a/ref/lua-5.1/src/liolib.c b/ref/lua-5.1/src/liolib.c new file mode 100644 index 0000000..bb3b519 --- /dev/null +++ b/ref/lua-5.1/src/liolib.c @@ -0,0 +1,532 @@ +/* +** $Id: liolib.c,v 2.72 2006/01/28 12:59:13 roberto Exp $ +** Standard I/O (and system) library +** See Copyright Notice in lua.h +*/ + + +#include +#include +#include +#include + +#define liolib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + + +#define IO_INPUT 1 +#define IO_OUTPUT 2 + + +static const char *const fnames[] = {"input", "output"}; + + +static int pushresult (lua_State *L, int i, const char *filename) { + int en = errno; /* calls to Lua API may change this value */ + if (i) { + lua_pushboolean(L, 1); + return 1; + } + else { + lua_pushnil(L); + if (filename) + lua_pushfstring(L, "%s: %s", filename, strerror(en)); + else + lua_pushfstring(L, "%s", strerror(en)); + lua_pushinteger(L, en); + return 3; + } +} + + +static void fileerror (lua_State *L, int arg, const char *filename) { + lua_pushfstring(L, "%s: %s", filename, strerror(errno)); + luaL_argerror(L, arg, lua_tostring(L, -1)); +} + + +#define topfile(L) ((FILE **)luaL_checkudata(L, 1, LUA_FILEHANDLE)) + + +static int io_type (lua_State *L) { + void *ud; + luaL_checkany(L, 1); + ud = lua_touserdata(L, 1); + lua_getfield(L, LUA_REGISTRYINDEX, LUA_FILEHANDLE); + if (ud == NULL || !lua_getmetatable(L, 1) || !lua_rawequal(L, -2, -1)) + lua_pushnil(L); /* not a file */ + else if (*((FILE **)ud) == NULL) + lua_pushliteral(L, "closed file"); + else + lua_pushliteral(L, "file"); + return 1; +} + + +static FILE *tofile (lua_State *L) { + FILE **f = topfile(L); + if (*f == NULL) + luaL_error(L, "attempt to use a closed file"); + return *f; +} + + + +/* +** When creating file handles, always creates a `closed' file handle +** before opening the actual file; so, if there is a memory error, the +** file is not left opened. +*/ +static FILE **newfile (lua_State *L) { + FILE **pf = (FILE **)lua_newuserdata(L, sizeof(FILE *)); + *pf = NULL; /* file handle is currently `closed' */ + luaL_getmetatable(L, LUA_FILEHANDLE); + lua_setmetatable(L, -2); + return pf; +} + + +/* +** this function has a separated environment, which defines the +** correct __close for 'popen' files +*/ +static int io_pclose (lua_State *L) { + FILE **p = topfile(L); + int ok = lua_pclose(L, *p); + if (ok) *p = NULL; + return pushresult(L, ok, NULL); +} + + +static int io_fclose (lua_State *L) { + FILE **p = topfile(L); + int ok = (fclose(*p) == 0); + if (ok) *p = NULL; + return pushresult(L, ok, NULL); +} + + +static int aux_close (lua_State *L) { + lua_getfenv(L, 1); + lua_getfield(L, -1, "__close"); + return (lua_tocfunction(L, -1))(L); +} + + +static int io_close (lua_State *L) { + if (lua_isnone(L, 1)) + lua_rawgeti(L, LUA_ENVIRONINDEX, IO_OUTPUT); + tofile(L); /* make sure argument is a file */ + return aux_close(L); +} + + +static int io_gc (lua_State *L) { + FILE *f = *topfile(L); + /* ignore closed files and standard files */ + if (f != NULL && f != stdin && f != stdout && f != stderr) + aux_close(L); + return 0; +} + + +static int io_tostring (lua_State *L) { + FILE *f = *topfile(L); + if (f == NULL) + lua_pushstring(L, "file (closed)"); + else + lua_pushfstring(L, "file (%p)", f); + return 1; +} + + +static int io_open (lua_State *L) { + const char *filename = luaL_checkstring(L, 1); + const char *mode = luaL_optstring(L, 2, "r"); + FILE **pf = newfile(L); + *pf = fopen(filename, mode); + return (*pf == NULL) ? pushresult(L, 0, filename) : 1; +} + + +static int io_popen (lua_State *L) { + const char *filename = luaL_checkstring(L, 1); + const char *mode = luaL_optstring(L, 2, "r"); + FILE **pf = newfile(L); + *pf = lua_popen(L, filename, mode); + return (*pf == NULL) ? pushresult(L, 0, filename) : 1; +} + + +static int io_tmpfile (lua_State *L) { + FILE **pf = newfile(L); + *pf = tmpfile(); + return (*pf == NULL) ? pushresult(L, 0, NULL) : 1; +} + + +static FILE *getiofile (lua_State *L, int findex) { + FILE *f; + lua_rawgeti(L, LUA_ENVIRONINDEX, findex); + f = *(FILE **)lua_touserdata(L, -1); + if (f == NULL) + luaL_error(L, "standard %s file is closed", fnames[findex - 1]); + return f; +} + + +static int g_iofile (lua_State *L, int f, const char *mode) { + if (!lua_isnoneornil(L, 1)) { + const char *filename = lua_tostring(L, 1); + if (filename) { + FILE **pf = newfile(L); + *pf = fopen(filename, mode); + if (*pf == NULL) + fileerror(L, 1, filename); + } + else { + tofile(L); /* check that it's a valid file handle */ + lua_pushvalue(L, 1); + } + lua_rawseti(L, LUA_ENVIRONINDEX, f); + } + /* return current value */ + lua_rawgeti(L, LUA_ENVIRONINDEX, f); + return 1; +} + + +static int io_input (lua_State *L) { + return g_iofile(L, IO_INPUT, "r"); +} + + +static int io_output (lua_State *L) { + return g_iofile(L, IO_OUTPUT, "w"); +} + + +static int io_readline (lua_State *L); + + +static void aux_lines (lua_State *L, int idx, int toclose) { + lua_pushvalue(L, idx); + lua_pushboolean(L, toclose); /* close/not close file when finished */ + lua_pushcclosure(L, io_readline, 2); +} + + +static int f_lines (lua_State *L) { + tofile(L); /* check that it's a valid file handle */ + aux_lines(L, 1, 0); + return 1; +} + + +static int io_lines (lua_State *L) { + if (lua_isnoneornil(L, 1)) { /* no arguments? */ + /* will iterate over default input */ + lua_rawgeti(L, LUA_ENVIRONINDEX, IO_INPUT); + return f_lines(L); + } + else { + const char *filename = luaL_checkstring(L, 1); + FILE **pf = newfile(L); + *pf = fopen(filename, "r"); + if (*pf == NULL) + fileerror(L, 1, filename); + aux_lines(L, lua_gettop(L), 1); + return 1; + } +} + + +/* +** {====================================================== +** READ +** ======================================================= +*/ + + +static int read_number (lua_State *L, FILE *f) { + lua_Number d; + if (fscanf(f, LUA_NUMBER_SCAN, &d) == 1) { + lua_pushnumber(L, d); + return 1; + } + else return 0; /* read fails */ +} + + +static int test_eof (lua_State *L, FILE *f) { + int c = getc(f); + ungetc(c, f); + lua_pushlstring(L, NULL, 0); + return (c != EOF); +} + + +static int read_line (lua_State *L, FILE *f) { + luaL_Buffer b; + luaL_buffinit(L, &b); + for (;;) { + size_t l; + char *p = luaL_prepbuffer(&b); + if (fgets(p, LUAL_BUFFERSIZE, f) == NULL) { /* eof? */ + luaL_pushresult(&b); /* close buffer */ + return (lua_strlen(L, -1) > 0); /* check whether read something */ + } + l = strlen(p); + if (l == 0 || p[l-1] != '\n') + luaL_addsize(&b, l); + else { + luaL_addsize(&b, l - 1); /* do not include `eol' */ + luaL_pushresult(&b); /* close buffer */ + return 1; /* read at least an `eol' */ + } + } +} + + +static int read_chars (lua_State *L, FILE *f, size_t n) { + size_t rlen; /* how much to read */ + size_t nr; /* number of chars actually read */ + luaL_Buffer b; + luaL_buffinit(L, &b); + rlen = LUAL_BUFFERSIZE; /* try to read that much each time */ + do { + char *p = luaL_prepbuffer(&b); + if (rlen > n) rlen = n; /* cannot read more than asked */ + nr = fread(p, sizeof(char), rlen, f); + luaL_addsize(&b, nr); + n -= nr; /* still have to read `n' chars */ + } while (n > 0 && nr == rlen); /* until end of count or eof */ + luaL_pushresult(&b); /* close buffer */ + return (n == 0 || lua_strlen(L, -1) > 0); +} + + +static int g_read (lua_State *L, FILE *f, int first) { + int nargs = lua_gettop(L) - 1; + int success; + int n; + clearerr(f); + if (nargs == 0) { /* no arguments? */ + success = read_line(L, f); + n = first+1; /* to return 1 result */ + } + else { /* ensure stack space for all results and for auxlib's buffer */ + luaL_checkstack(L, nargs+LUA_MINSTACK, "too many arguments"); + success = 1; + for (n = first; nargs-- && success; n++) { + if (lua_type(L, n) == LUA_TNUMBER) { + size_t l = (size_t)lua_tointeger(L, n); + success = (l == 0) ? test_eof(L, f) : read_chars(L, f, l); + } + else { + const char *p = lua_tostring(L, n); + luaL_argcheck(L, p && p[0] == '*', n, "invalid option"); + switch (p[1]) { + case 'n': /* number */ + success = read_number(L, f); + break; + case 'l': /* line */ + success = read_line(L, f); + break; + case 'a': /* file */ + read_chars(L, f, ~((size_t)0)); /* read MAX_SIZE_T chars */ + success = 1; /* always success */ + break; + default: + return luaL_argerror(L, n, "invalid format"); + } + } + } + } + if (ferror(f)) + return pushresult(L, 0, NULL); + if (!success) { + lua_pop(L, 1); /* remove last result */ + lua_pushnil(L); /* push nil instead */ + } + return n - first; +} + + +static int io_read (lua_State *L) { + return g_read(L, getiofile(L, IO_INPUT), 1); +} + + +static int f_read (lua_State *L) { + return g_read(L, tofile(L), 2); +} + + +static int io_readline (lua_State *L) { + FILE *f = *(FILE **)lua_touserdata(L, lua_upvalueindex(1)); + int sucess; + if (f == NULL) /* file is already closed? */ + luaL_error(L, "file is already closed"); + sucess = read_line(L, f); + if (ferror(f)) + return luaL_error(L, "%s", strerror(errno)); + if (sucess) return 1; + else { /* EOF */ + if (lua_toboolean(L, lua_upvalueindex(2))) { /* generator created file? */ + lua_settop(L, 0); + lua_pushvalue(L, lua_upvalueindex(1)); + aux_close(L); /* close it */ + } + return 0; + } +} + +/* }====================================================== */ + + +static int g_write (lua_State *L, FILE *f, int arg) { + int nargs = lua_gettop(L) - 1; + int status = 1; + for (; nargs--; arg++) { + if (lua_type(L, arg) == LUA_TNUMBER) { + /* optimization: could be done exactly as for strings */ + status = status && + fprintf(f, LUA_NUMBER_FMT, lua_tonumber(L, arg)) > 0; + } + else { + size_t l; + const char *s = luaL_checklstring(L, arg, &l); + status = status && (fwrite(s, sizeof(char), l, f) == l); + } + } + return pushresult(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) { + return g_write(L, tofile(L), 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); + long offset = luaL_optlong(L, 3, 0); + op = fseek(f, offset, mode[op]); + if (op) + return pushresult(L, 0, NULL); /* error */ + else { + lua_pushinteger(L, ftell(f)); + return 1; + } +} + + +static int f_setvbuf (lua_State *L) { + static const int mode[] = {_IONBF, _IOFBF, _IOLBF}; + static const char *const modenames[] = {"no", "full", "line", NULL}; + FILE *f = tofile(L); + int op = luaL_checkoption(L, 2, NULL, modenames); + lua_Integer sz = luaL_optinteger(L, 3, LUAL_BUFFERSIZE); + int res = setvbuf(f, NULL, mode[op], sz); + return pushresult(L, res == 0, NULL); +} + + + +static int io_flush (lua_State *L) { + return pushresult(L, fflush(getiofile(L, IO_OUTPUT)) == 0, NULL); +} + + +static int f_flush (lua_State *L) { + return pushresult(L, fflush(tofile(L)) == 0, NULL); +} + + +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} +}; + + +static const luaL_Reg flib[] = { + {"close", io_close}, + {"flush", f_flush}, + {"lines", f_lines}, + {"read", f_read}, + {"seek", f_seek}, + {"setvbuf", f_setvbuf}, + {"write", f_write}, + {"__gc", io_gc}, + {"__tostring", io_tostring}, + {NULL, NULL} +}; + + +static void createmeta (lua_State *L) { + luaL_newmetatable(L, LUA_FILEHANDLE); /* create metatable for file handles */ + lua_pushvalue(L, -1); /* push metatable */ + lua_setfield(L, -2, "__index"); /* metatable.__index = metatable */ + luaL_register(L, NULL, flib); /* file methods */ +} + + +static void createstdfile (lua_State *L, FILE *f, int k, const char *fname) { + *newfile(L) = f; + if (k > 0) { + lua_pushvalue(L, -1); + lua_rawseti(L, LUA_ENVIRONINDEX, k); + } + lua_setfield(L, -2, fname); +} + + +LUALIB_API int luaopen_io (lua_State *L) { + createmeta(L); + /* create (private) environment (with fields IO_INPUT, IO_OUTPUT, __close) */ + lua_createtable(L, 2, 1); + lua_replace(L, LUA_ENVIRONINDEX); + /* open library */ + luaL_register(L, LUA_IOLIBNAME, iolib); + /* create (and set) default files */ + createstdfile(L, stdin, IO_INPUT, "stdin"); + createstdfile(L, stdout, IO_OUTPUT, "stdout"); + createstdfile(L, stderr, 0, "stderr"); + /* create environment for 'popen' */ + lua_getfield(L, -1, "popen"); + lua_createtable(L, 0, 1); + lua_pushcfunction(L, io_pclose); + lua_setfield(L, -2, "__close"); + lua_setfenv(L, -2); + lua_pop(L, 1); /* pop 'popen' */ + /* set default close function */ + lua_pushcfunction(L, io_fclose); + lua_setfield(L, LUA_ENVIRONINDEX, "__close"); + return 1; +} + diff --git a/ref/lua-5.1/src/llex.c b/ref/lua-5.1/src/llex.c new file mode 100644 index 0000000..f3022df --- /dev/null +++ b/ref/lua-5.1/src/llex.c @@ -0,0 +1,460 @@ +/* +** $Id: llex.c,v 2.19 2006/02/06 18:28:16 roberto Exp $ +** Lexical Analyzer +** See Copyright Notice in lua.h +*/ + + +#include +#include +#include + +#define llex_c +#define LUA_CORE + +#include "lua.h" + +#include "ldo.h" +#include "llex.h" +#include "lobject.h" +#include "lparser.h" +#include "lstate.h" +#include "lstring.h" +#include "lzio.h" + + + +#define next(ls) (ls->current = zgetc(ls->z)) + + + + +#define currIsNewline(ls) (ls->current == '\n' || ls->current == '\r') + + +/* ORDER RESERVED */ +const char *const luaX_tokens [] = { + "and", "break", "do", "else", "elseif", + "end", "false", "for", "function", "if", + "in", "local", "nil", "not", "or", "repeat", + "return", "then", "true", "until", "while", + "..", "...", "==", ">=", "<=", "~=", + "", "", "", "", + NULL +}; + + +#define save_and_next(ls) (save(ls, ls->current), next(ls)) + + +static void save (LexState *ls, int c) { + Mbuffer *b = ls->buff; + if (b->n + 1 > b->buffsize) { + size_t newsize; + if (b->buffsize >= MAX_SIZET/2) + luaX_lexerror(ls, "lexical element too long", 0); + newsize = b->buffsize * 2; + luaZ_resizebuffer(ls->L, b, newsize); + } + b->buffer[b->n++] = cast(char, c); +} + + +void luaX_init (lua_State *L) { + int i; + for (i=0; itsv.reserved = cast_byte(i+1); /* reserved word */ + } +} + + +#define MAXSRC 80 + + +const char *luaX_token2str (LexState *ls, int token) { + if (token < FIRST_RESERVED) { + lua_assert(token == cast(unsigned char, token)); + return (iscntrl(token)) ? luaO_pushfstring(ls->L, "char(%d)", token) : + luaO_pushfstring(ls->L, "%c", token); + } + else + return luaX_tokens[token-FIRST_RESERVED]; +} + + +static const char *txtToken (LexState *ls, int token) { + switch (token) { + case TK_NAME: + case TK_STRING: + case TK_NUMBER: + save(ls, '\0'); + return luaZ_buffer(ls->buff); + default: + return luaX_token2str(ls, token); + } +} + + +void luaX_lexerror (LexState *ls, const char *msg, int token) { + char buff[MAXSRC]; + luaO_chunkid(buff, getstr(ls->source), MAXSRC); + msg = luaO_pushfstring(ls->L, "%s:%d: %s", buff, ls->linenumber, msg); + if (token) + luaO_pushfstring(ls->L, "%s near " LUA_QS, msg, txtToken(ls, token)); + luaD_throw(ls->L, LUA_ERRSYNTAX); +} + + +void luaX_syntaxerror (LexState *ls, const char *msg) { + luaX_lexerror(ls, msg, ls->t.token); +} + + +TString *luaX_newstring (LexState *ls, const char *str, size_t l) { + lua_State *L = ls->L; + TString *ts = luaS_newlstr(L, str, l); + TValue *o = luaH_setstr(L, ls->fs->h, ts); /* entry for `str' */ + if (ttisnil(o)) + setbvalue(o, 1); /* make sure `str' will not be collected */ + return ts; +} + + +static void inclinenumber (LexState *ls) { + int old = ls->current; + lua_assert(currIsNewline(ls)); + next(ls); /* skip `\n' or `\r' */ + if (currIsNewline(ls) && ls->current != old) + next(ls); /* skip `\n\r' or `\r\n' */ + if (++ls->linenumber >= MAX_INT) + luaX_syntaxerror(ls, "chunk has too many lines"); +} + + +void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source) { + ls->decpoint = '.'; + ls->L = L; + ls->lookahead.token = TK_EOS; /* no look-ahead token */ + ls->z = z; + ls->fs = NULL; + ls->linenumber = 1; + ls->lastline = 1; + ls->source = source; + luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER); /* initialize buffer */ + next(ls); /* read first char */ +} + + + +/* +** ======================================================= +** LEXICAL ANALYZER +** ======================================================= +*/ + + + +static int check_next (LexState *ls, const char *set) { + if (!strchr(set, ls->current)) + return 0; + save_and_next(ls); + return 1; +} + + +static void buffreplace (LexState *ls, char from, char to) { + size_t n = luaZ_bufflen(ls->buff); + char *p = luaZ_buffer(ls->buff); + while (n--) + if (p[n] == from) p[n] = to; +} + + +static void trydecpoint (LexState *ls, SemInfo *seminfo) { + /* format error: try to update decimal point separator */ + struct lconv *cv = localeconv(); + char old = ls->decpoint; + ls->decpoint = (cv ? cv->decimal_point[0] : '.'); + buffreplace(ls, old, ls->decpoint); /* try updated decimal separator */ + if (!luaO_str2d(luaZ_buffer(ls->buff), &seminfo->r)) { + /* format error with correct decimal point: no more options */ + buffreplace(ls, ls->decpoint, '.'); /* undo change (for error message) */ + luaX_lexerror(ls, "malformed number", TK_NUMBER); + } +} + + +/* LUA_NUMBER */ +static void read_numeral (LexState *ls, SemInfo *seminfo) { + lua_assert(isdigit(ls->current)); + do { + save_and_next(ls); + } while (isdigit(ls->current) || ls->current == '.'); + if (check_next(ls, "Ee")) /* `E'? */ + check_next(ls, "+-"); /* optional exponent sign */ + while (isalnum(ls->current) || ls->current == '_') + save_and_next(ls); + save(ls, '\0'); + buffreplace(ls, '.', ls->decpoint); /* follow locale for decimal point */ + if (!luaO_str2d(luaZ_buffer(ls->buff), &seminfo->r)) /* format error? */ + trydecpoint(ls, seminfo); /* try to update decimal point separator */ +} + + +static int skip_sep (LexState *ls) { + int count = 0; + int s = ls->current; + lua_assert(s == '[' || s == ']'); + save_and_next(ls); + while (ls->current == '=') { + save_and_next(ls); + count++; + } + return (ls->current == s) ? count : (-count) - 1; +} + + +static void read_long_string (LexState *ls, SemInfo *seminfo, int sep) { + int cont = 0; + (void)(cont); /* avoid warnings when `cont' is not used */ + save_and_next(ls); /* skip 2nd `[' */ + if (currIsNewline(ls)) /* string starts with a newline? */ + inclinenumber(ls); /* skip it */ + for (;;) { + switch (ls->current) { + case EOZ: + luaX_lexerror(ls, (seminfo) ? "unfinished long string" : + "unfinished long comment", TK_EOS); + break; /* to avoid warnings */ +#if defined(LUA_COMPAT_LSTR) + case '[': { + if (skip_sep(ls) == sep) { + save_and_next(ls); /* skip 2nd `[' */ + cont++; +#if LUA_COMPAT_LSTR == 1 + if (sep == 0) + luaX_lexerror(ls, "nesting of [[...]] is deprecated", '['); +#endif + } + break; + } +#endif + case ']': { + if (skip_sep(ls) == sep) { + save_and_next(ls); /* skip 2nd `]' */ +#if defined(LUA_COMPAT_LSTR) && LUA_COMPAT_LSTR == 2 + cont--; + if (sep == 0 && cont >= 0) break; +#endif + goto endloop; + } + break; + } + case '\n': + case '\r': { + save(ls, '\n'); + inclinenumber(ls); + if (!seminfo) luaZ_resetbuffer(ls->buff); /* avoid wasting space */ + break; + } + default: { + if (seminfo) save_and_next(ls); + else next(ls); + } + } + } endloop: + if (seminfo) + seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + (2 + sep), + luaZ_bufflen(ls->buff) - 2*(2 + sep)); +} + + +static void read_string (LexState *ls, int del, SemInfo *seminfo) { + save_and_next(ls); + while (ls->current != del) { + switch (ls->current) { + case EOZ: + luaX_lexerror(ls, "unfinished string", TK_EOS); + continue; /* to avoid warnings */ + case '\n': + case '\r': + luaX_lexerror(ls, "unfinished string", TK_STRING); + continue; /* to avoid warnings */ + case '\\': { + int c; + next(ls); /* do not save the `\' */ + switch (ls->current) { + case 'a': c = '\a'; break; + case 'b': c = '\b'; break; + case 'f': c = '\f'; break; + case 'n': c = '\n'; break; + case 'r': c = '\r'; break; + case 't': c = '\t'; break; + case 'v': c = '\v'; break; + case '\n': /* go through */ + case '\r': save(ls, '\n'); inclinenumber(ls); continue; + case EOZ: continue; /* will raise an error next loop */ + default: { + if (!isdigit(ls->current)) + save_and_next(ls); /* handles \\, \", \', and \? */ + else { /* \xxx */ + int i = 0; + c = 0; + do { + c = 10*c + (ls->current-'0'); + next(ls); + } while (++i<3 && isdigit(ls->current)); + if (c > UCHAR_MAX) + luaX_lexerror(ls, "escape sequence too large", TK_STRING); + save(ls, c); + } + continue; + } + } + save(ls, c); + next(ls); + continue; + } + 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': { + inclinenumber(ls); + continue; + } + case '-': { + next(ls); + if (ls->current != '-') return '-'; + /* else is a comment */ + next(ls); + if (ls->current == '[') { + int sep = skip_sep(ls); + luaZ_resetbuffer(ls->buff); /* `skip_sep' may dirty the buffer */ + if (sep >= 0) { + read_long_string(ls, NULL, sep); /* long comment */ + luaZ_resetbuffer(ls->buff); + continue; + } + } + /* else short comment */ + while (!currIsNewline(ls) && ls->current != EOZ) + next(ls); + continue; + } + case '[': { + int sep = skip_sep(ls); + if (sep >= 0) { + read_long_string(ls, seminfo, sep); + return TK_STRING; + } + else if (sep == -1) return '['; + else luaX_lexerror(ls, "invalid long string delimiter", TK_STRING); + } + case '=': { + next(ls); + if (ls->current != '=') return '='; + else { next(ls); return TK_EQ; } + } + case '<': { + next(ls); + if (ls->current != '=') return '<'; + else { next(ls); return TK_LE; } + } + case '>': { + next(ls); + if (ls->current != '=') return '>'; + else { next(ls); return TK_GE; } + } + case '~': { + next(ls); + if (ls->current != '=') return '~'; + else { next(ls); return TK_NE; } + } + case '"': + case '\'': { + read_string(ls, ls->current, seminfo); + return TK_STRING; + } + case '.': { + save_and_next(ls); + if (check_next(ls, ".")) { + if (check_next(ls, ".")) + return TK_DOTS; /* ... */ + else return TK_CONCAT; /* .. */ + } + else if (!isdigit(ls->current)) return '.'; + else { + read_numeral(ls, seminfo); + return TK_NUMBER; + } + } + case EOZ: { + return TK_EOS; + } + default: { + if (isspace(ls->current)) { + lua_assert(!currIsNewline(ls)); + next(ls); + continue; + } + else if (isdigit(ls->current)) { + read_numeral(ls, seminfo); + return TK_NUMBER; + } + else if (isalpha(ls->current) || ls->current == '_') { + /* identifier or reserved word */ + TString *ts; + do { + save_and_next(ls); + } while (isalnum(ls->current) || ls->current == '_'); + ts = luaX_newstring(ls, luaZ_buffer(ls->buff), + luaZ_bufflen(ls->buff)); + if (ts->tsv.reserved > 0) /* reserved word? */ + return ts->tsv.reserved - 1 + FIRST_RESERVED; + else { + seminfo->ts = ts; + return TK_NAME; + } + } + else { + int c = ls->current; + next(ls); + return c; /* single-char tokens (+ - / ...) */ + } + } + } + } +} + + +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 */ +} + + +void luaX_lookahead (LexState *ls) { + lua_assert(ls->lookahead.token == TK_EOS); + ls->lookahead.token = llex(ls, &ls->lookahead.seminfo); +} + diff --git a/ref/lua-5.1/src/llex.h b/ref/lua-5.1/src/llex.h new file mode 100644 index 0000000..d4ca7f2 --- /dev/null +++ b/ref/lua-5.1/src/llex.h @@ -0,0 +1,81 @@ +/* +** $Id: llex.h,v 1.57 2005/12/07 15:43:05 roberto Exp $ +** Lexical Analyzer +** See Copyright Notice in lua.h +*/ + +#ifndef llex_h +#define llex_h + +#include "lobject.h" +#include "lzio.h" + + +#define FIRST_RESERVED 257 + +/* maximum length of a reserved word */ +#define TOKEN_LEN (sizeof("function")/sizeof(char)) + + +/* +* 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_IF, TK_IN, TK_LOCAL, TK_NIL, TK_NOT, TK_OR, TK_REPEAT, + TK_RETURN, TK_THEN, TK_TRUE, TK_UNTIL, TK_WHILE, + /* other terminal symbols */ + TK_CONCAT, TK_DOTS, TK_EQ, TK_GE, TK_LE, TK_NE, TK_NUMBER, + TK_NAME, TK_STRING, TK_EOS +}; + +/* number of reserved words */ +#define NUM_RESERVED (cast(int, TK_WHILE-FIRST_RESERVED+1)) + + +/* array with token `names' */ +LUAI_DATA const char *const luaX_tokens []; + + +typedef union { + lua_Number r; + TString *ts; +} SemInfo; /* semantics information */ + + +typedef struct Token { + int token; + SemInfo seminfo; +} Token; + + +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; /* `FuncState' is private to the parser */ + struct lua_State *L; + ZIO *z; /* input stream */ + Mbuffer *buff; /* buffer for tokens */ + TString *source; /* current source name */ + char decpoint; /* locale decimal point */ +} LexState; + + +LUAI_FUNC void luaX_init (lua_State *L); +LUAI_FUNC void luaX_setinput (lua_State *L, LexState *LS, ZIO *z, + TString *source); +LUAI_FUNC TString *luaX_newstring (LexState *LS, const char *str, size_t l); +LUAI_FUNC void luaX_next (LexState *ls); +LUAI_FUNC void luaX_lookahead (LexState *ls); +LUAI_FUNC void luaX_lexerror (LexState *ls, const char *msg, int token); +LUAI_FUNC void luaX_syntaxerror (LexState *ls, const char *s); +LUAI_FUNC const char *luaX_token2str (LexState *ls, int token); + + +#endif diff --git a/ref/lua-5.1/src/llimits.h b/ref/lua-5.1/src/llimits.h new file mode 100644 index 0000000..b03221a --- /dev/null +++ b/ref/lua-5.1/src/llimits.h @@ -0,0 +1,128 @@ +/* +** $Id: llimits.h,v 1.69 2005/12/27 17:12:00 roberto Exp $ +** Limits, basic types, and some other `installation-dependent' definitions +** See Copyright Notice in lua.h +*/ + +#ifndef llimits_h +#define llimits_h + + +#include +#include + + +#include "lua.h" + + +typedef LUAI_UINT32 lu_int32; + +typedef LUAI_UMEM lu_mem; + +typedef LUAI_MEM l_mem; + + + +/* chars used as small naturals (so that `char' is reserved for characters) */ +typedef unsigned char lu_byte; + + +#define MAX_SIZET ((size_t)(~(size_t)0)-2) + +#define MAX_LUMEM ((lu_mem)(~(lu_mem)0)-2) + + +#define MAX_INT (INT_MAX-2) /* maximum value of an int (-2 for safety) */ + +/* +** conversion of pointer to integer +** this is for hashing only; there is no problem if the integer +** cannot hold the whole pointer value +*/ +#define IntPoint(p) ((unsigned int)(lu_mem)(p)) + + + +/* type to ensure maximum alignment */ +typedef LUAI_USER_ALIGNMENT_T L_Umaxalign; + + +/* result of a `usual argument conversion' over lua_Number */ +typedef LUAI_UACNUMBER l_uacNumber; + + +/* internal assertions for in-house debugging */ +#ifdef lua_assert + +#define check_exp(c,e) (lua_assert(c), (e)) +#define api_check(l,e) lua_assert(e) + +#else + +#define lua_assert(c) ((void)0) +#define check_exp(c,e) (e) +#define api_check luai_apicheck + +#endif + + +#ifndef UNUSED +#define UNUSED(x) ((void)(x)) /* to avoid warnings */ +#endif + + +#ifndef cast +#define cast(t, exp) ((t)(exp)) +#endif + +#define cast_byte(i) cast(lu_byte, (i)) +#define cast_num(i) cast(lua_Number, (i)) +#define cast_int(i) cast(int, (i)) + + + +/* +** type for virtual-machine instructions +** must be an unsigned with (at least) 4 bytes (see details in lopcodes.h) +*/ +typedef lu_int32 Instruction; + + + +/* maximum stack for a Lua function */ +#define MAXSTACK 250 + + + +/* minimum size for the string table (must be power of 2) */ +#ifndef MINSTRTABSIZE +#define MINSTRTABSIZE 32 +#endif + + +/* minimum size for string buffer */ +#ifndef LUA_MINBUFFER +#define LUA_MINBUFFER 32 +#endif + + +#ifndef lua_lock +#define lua_lock(L) ((void) 0) +#define lua_unlock(L) ((void) 0) +#endif + +#ifndef luai_threadyield +#define luai_threadyield(L) {lua_unlock(L); lua_lock(L);} +#endif + + +/* +** macro to control inclusion of some hard tests on stack reallocation +*/ +#ifndef HARDSTACKTESTS +#define condhardstacktests(x) ((void)0) +#else +#define condhardstacktests(x) x +#endif + +#endif diff --git a/ref/lua-5.1/src/lmathlib.c b/ref/lua-5.1/src/lmathlib.c new file mode 100644 index 0000000..d181a73 --- /dev/null +++ b/ref/lua-5.1/src/lmathlib.c @@ -0,0 +1,263 @@ +/* +** $Id: lmathlib.c,v 1.67 2005/08/26 17:36:32 roberto Exp $ +** Standard mathematical library +** See Copyright Notice in lua.h +*/ + + +#include +#include + +#define lmathlib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +#undef PI +#define PI (3.14159265358979323846) +#define RADIANS_PER_DEGREE (PI/180.0) + + + +static int math_abs (lua_State *L) { + lua_pushnumber(L, fabs(luaL_checknumber(L, 1))); + return 1; +} + +static int math_sin (lua_State *L) { + lua_pushnumber(L, sin(luaL_checknumber(L, 1))); + return 1; +} + +static int math_sinh (lua_State *L) { + lua_pushnumber(L, sinh(luaL_checknumber(L, 1))); + return 1; +} + +static int math_cos (lua_State *L) { + lua_pushnumber(L, cos(luaL_checknumber(L, 1))); + return 1; +} + +static int math_cosh (lua_State *L) { + lua_pushnumber(L, cosh(luaL_checknumber(L, 1))); + return 1; +} + +static int math_tan (lua_State *L) { + lua_pushnumber(L, tan(luaL_checknumber(L, 1))); + return 1; +} + +static int math_tanh (lua_State *L) { + lua_pushnumber(L, tanh(luaL_checknumber(L, 1))); + return 1; +} + +static int math_asin (lua_State *L) { + lua_pushnumber(L, asin(luaL_checknumber(L, 1))); + return 1; +} + +static int math_acos (lua_State *L) { + lua_pushnumber(L, acos(luaL_checknumber(L, 1))); + return 1; +} + +static int math_atan (lua_State *L) { + lua_pushnumber(L, atan(luaL_checknumber(L, 1))); + return 1; +} + +static int math_atan2 (lua_State *L) { + lua_pushnumber(L, atan2(luaL_checknumber(L, 1), luaL_checknumber(L, 2))); + return 1; +} + +static int math_ceil (lua_State *L) { + lua_pushnumber(L, ceil(luaL_checknumber(L, 1))); + return 1; +} + +static int math_floor (lua_State *L) { + lua_pushnumber(L, floor(luaL_checknumber(L, 1))); + return 1; +} + +static int math_fmod (lua_State *L) { + lua_pushnumber(L, fmod(luaL_checknumber(L, 1), luaL_checknumber(L, 2))); + return 1; +} + +static int math_modf (lua_State *L) { + double ip; + double fp = modf(luaL_checknumber(L, 1), &ip); + lua_pushnumber(L, ip); + lua_pushnumber(L, fp); + return 2; +} + +static int math_sqrt (lua_State *L) { + lua_pushnumber(L, sqrt(luaL_checknumber(L, 1))); + return 1; +} + +static int math_pow (lua_State *L) { + lua_pushnumber(L, pow(luaL_checknumber(L, 1), luaL_checknumber(L, 2))); + return 1; +} + +static int math_log (lua_State *L) { + lua_pushnumber(L, log(luaL_checknumber(L, 1))); + return 1; +} + +static int math_log10 (lua_State *L) { + lua_pushnumber(L, log10(luaL_checknumber(L, 1))); + return 1; +} + +static int math_exp (lua_State *L) { + lua_pushnumber(L, exp(luaL_checknumber(L, 1))); + return 1; +} + +static int math_deg (lua_State *L) { + lua_pushnumber(L, luaL_checknumber(L, 1)/RADIANS_PER_DEGREE); + return 1; +} + +static int math_rad (lua_State *L) { + lua_pushnumber(L, luaL_checknumber(L, 1)*RADIANS_PER_DEGREE); + return 1; +} + +static int math_frexp (lua_State *L) { + int e; + lua_pushnumber(L, frexp(luaL_checknumber(L, 1), &e)); + lua_pushinteger(L, e); + return 2; +} + +static int math_ldexp (lua_State *L) { + lua_pushnumber(L, ldexp(luaL_checknumber(L, 1), luaL_checkint(L, 2))); + return 1; +} + + + +static int math_min (lua_State *L) { + int n = lua_gettop(L); /* number of arguments */ + lua_Number dmin = luaL_checknumber(L, 1); + int i; + for (i=2; i<=n; i++) { + lua_Number d = luaL_checknumber(L, i); + if (d < dmin) + dmin = d; + } + lua_pushnumber(L, dmin); + return 1; +} + + +static int math_max (lua_State *L) { + int n = lua_gettop(L); /* number of arguments */ + lua_Number dmax = luaL_checknumber(L, 1); + int i; + for (i=2; i<=n; i++) { + lua_Number d = luaL_checknumber(L, i); + if (d > dmax) + dmax = d; + } + lua_pushnumber(L, dmax); + return 1; +} + + +static int math_random (lua_State *L) { + /* the `%' avoids the (rare) case of r==1, and is needed also because on + some systems (SunOS!) `rand()' may return a value larger than RAND_MAX */ + lua_Number r = (lua_Number)(rand()%RAND_MAX) / (lua_Number)RAND_MAX; + switch (lua_gettop(L)) { /* check number of arguments */ + case 0: { /* no arguments */ + lua_pushnumber(L, r); /* Number between 0 and 1 */ + break; + } + case 1: { /* only upper limit */ + int u = luaL_checkint(L, 1); + luaL_argcheck(L, 1<=u, 1, "interval is empty"); + lua_pushnumber(L, floor(r*u)+1); /* int between 1 and `u' */ + break; + } + case 2: { /* lower and upper limits */ + int l = luaL_checkint(L, 1); + int u = luaL_checkint(L, 2); + luaL_argcheck(L, l<=u, 2, "interval is empty"); + lua_pushnumber(L, floor(r*(u-l+1))+l); /* int between `l' and `u' */ + break; + } + default: return luaL_error(L, "wrong number of arguments"); + } + return 1; +} + + +static int math_randomseed (lua_State *L) { + srand(luaL_checkint(L, 1)); + return 0; +} + + +static const luaL_Reg mathlib[] = { + {"abs", math_abs}, + {"acos", math_acos}, + {"asin", math_asin}, + {"atan2", math_atan2}, + {"atan", math_atan}, + {"ceil", math_ceil}, + {"cosh", math_cosh}, + {"cos", math_cos}, + {"deg", math_deg}, + {"exp", math_exp}, + {"floor", math_floor}, + {"fmod", math_fmod}, + {"frexp", math_frexp}, + {"ldexp", math_ldexp}, + {"log10", math_log10}, + {"log", math_log}, + {"max", math_max}, + {"min", math_min}, + {"modf", math_modf}, + {"pow", math_pow}, + {"rad", math_rad}, + {"random", math_random}, + {"randomseed", math_randomseed}, + {"sinh", math_sinh}, + {"sin", math_sin}, + {"sqrt", math_sqrt}, + {"tanh", math_tanh}, + {"tan", math_tan}, + {NULL, NULL} +}; + + +/* +** Open math library +*/ +LUALIB_API int luaopen_math (lua_State *L) { + luaL_register(L, LUA_MATHLIBNAME, mathlib); + lua_pushnumber(L, PI); + lua_setfield(L, -2, "pi"); + lua_pushnumber(L, HUGE_VAL); + lua_setfield(L, -2, "huge"); +#if defined(LUA_COMPAT_MOD) + lua_getfield(L, -1, "fmod"); + lua_setfield(L, -2, "mod"); +#endif + return 1; +} + diff --git a/ref/lua-5.1/src/lmem.c b/ref/lua-5.1/src/lmem.c new file mode 100644 index 0000000..cef2bc5 --- /dev/null +++ b/ref/lua-5.1/src/lmem.c @@ -0,0 +1,86 @@ +/* +** $Id: lmem.c,v 1.70 2005/12/26 13:35:47 roberto Exp $ +** Interface to Memory Manager +** See Copyright Notice in lua.h +*/ + + +#include + +#define lmem_c +#define LUA_CORE + +#include "lua.h" + +#include "ldebug.h" +#include "ldo.h" +#include "lmem.h" +#include "lobject.h" +#include "lstate.h" + + + +/* +** About the realloc function: +** void * frealloc (void *ud, void *ptr, size_t osize, size_t nsize); +** (`osize' is the old size, `nsize' is the new size) +** +** Lua ensures that (ptr == NULL) iff (osize == 0). +** +** * frealloc(ud, NULL, 0, x) creates a new block of size `x' +** +** * frealloc(ud, p, x, 0) frees the block `p' +** (in this specific case, frealloc must return NULL). +** particularly, frealloc(ud, NULL, 0, 0) does nothing +** (which is equivalent to free(NULL) in ANSI C) +** +** frealloc returns NULL if it cannot create or reallocate the area +** (any reallocation to an equal or smaller size cannot fail!) +*/ + + + +#define MINSIZEARRAY 4 + + +void *luaM_growaux_ (lua_State *L, void *block, int *size, size_t size_elems, + int limit, const char *errormsg) { + void *newblock; + int newsize; + if (*size >= limit/2) { /* cannot double it? */ + if (*size >= limit) /* cannot grow even a little? */ + luaG_runerror(L, errormsg); + newsize = limit; /* still have at least one free place */ + } + else { + newsize = (*size)*2; + if (newsize < MINSIZEARRAY) + newsize = MINSIZEARRAY; /* minimum size */ + } + newblock = luaM_reallocv(L, block, *size, newsize, size_elems); + *size = newsize; /* update only when everything else is OK */ + return newblock; +} + + +void *luaM_toobig (lua_State *L) { + luaG_runerror(L, "memory allocation error: block too big"); + return NULL; /* to avoid warnings */ +} + + + +/* +** generic allocation routine. +*/ +void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) { + global_State *g = G(L); + lua_assert((osize == 0) == (block == NULL)); + block = (*g->frealloc)(g->ud, block, osize, nsize); + if (block == NULL && nsize > 0) + luaD_throw(L, LUA_ERRMEM); + lua_assert((nsize == 0) == (block == NULL)); + g->totalbytes = (g->totalbytes - osize) + nsize; + return block; +} + diff --git a/ref/lua-5.1/src/lmem.h b/ref/lua-5.1/src/lmem.h new file mode 100644 index 0000000..19df1fb --- /dev/null +++ b/ref/lua-5.1/src/lmem.h @@ -0,0 +1,49 @@ +/* +** $Id: lmem.h,v 1.31 2005/04/25 19:24:10 roberto Exp $ +** Interface to Memory Manager +** See Copyright Notice in lua.h +*/ + +#ifndef lmem_h +#define lmem_h + + +#include + +#include "llimits.h" +#include "lua.h" + +#define MEMERRMSG "not enough memory" + + +#define luaM_reallocv(L,b,on,n,e) \ + ((cast(size_t, (n)+1) <= MAX_SIZET/(e)) ? /* +1 to avoid warnings */ \ + luaM_realloc_(L, (b), (on)*(e), (n)*(e)) : \ + luaM_toobig(L)) + +#define luaM_freemem(L, b, s) luaM_realloc_(L, (b), (s), 0) +#define luaM_free(L, b) luaM_realloc_(L, (b), sizeof(*(b)), 0) +#define luaM_freearray(L, b, n, t) luaM_reallocv(L, (b), n, 0, sizeof(t)) + +#define luaM_malloc(L,t) luaM_realloc_(L, NULL, 0, (t)) +#define luaM_new(L,t) cast(t *, luaM_malloc(L, sizeof(t))) +#define luaM_newvector(L,n,t) \ + cast(t *, luaM_reallocv(L, NULL, 0, n, sizeof(t))) + +#define luaM_growvector(L,v,nelems,size,t,limit,e) \ + if ((nelems)+1 > (size)) \ + ((v)=cast(t *, luaM_growaux_(L,v,&(size),sizeof(t),limit,e))) + +#define luaM_reallocvector(L, v,oldn,n,t) \ + ((v)=cast(t *, luaM_reallocv(L, v, oldn, n, sizeof(t)))) + + +LUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize, + size_t size); +LUAI_FUNC void *luaM_toobig (lua_State *L); +LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int *size, + size_t size_elem, int limit, + const char *errormsg); + +#endif + diff --git a/ref/lua-5.1/src/loadlib.c b/ref/lua-5.1/src/loadlib.c new file mode 100644 index 0000000..19edaca --- /dev/null +++ b/ref/lua-5.1/src/loadlib.c @@ -0,0 +1,667 @@ +/* +** $Id: loadlib.c,v 1.51 2005/12/29 15:32:11 roberto Exp $ +** Dynamic library loader for Lua +** See Copyright Notice in lua.h +** +** This module contains an implementation of loadlib for Unix systems +** that have dlfcn, an implementation for Darwin (Mac OS X), an +** implementation for Windows, and a stub for other systems. +*/ + + +#include +#include + + +#define loadlib_c +#define LUA_LIB + +#include "lauxlib.h" +#include "lobject.h" +#include "lua.h" +#include "lualib.h" + + +/* environment variables that hold the search path for packages */ +#define LUA_PATH "LUA_PATH" +#define LUA_CPATH "LUA_CPATH" + +/* prefix for open functions in C libraries */ +#define LUA_POF "luaopen_" + +/* separator for open functions in C libraries */ +#define LUA_OFSEP "_" + + +#define LIBPREFIX "LOADLIB: " + +#define POF LUA_POF +#define LIB_FAIL "open" + + +/* error codes for ll_loadfunc */ +#define ERRLIB 1 +#define ERRFUNC 2 + +#define setprogdir(L) ((void)0) + + +static void ll_unloadlib (void *lib); +static void *ll_load (lua_State *L, const char *path); +static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym); + + + +#if defined(LUA_DL_DLOPEN) +/* +** {======================================================================== +** This is an implementation of loadlib based on the dlfcn interface. +** The dlfcn interface is available in Linux, SunOS, Solaris, IRIX, FreeBSD, +** NetBSD, AIX 4.2, HPUX 11, and probably most other Unix flavors, at least +** as an emulation layer on top of native functions. +** ========================================================================= +*/ + +#include + +static void ll_unloadlib (void *lib) { + dlclose(lib); +} + + +static void *ll_load (lua_State *L, const char *path) { + void *lib = dlopen(path, RTLD_NOW); + if (lib == NULL) lua_pushstring(L, dlerror()); + return lib; +} + + +static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) { + lua_CFunction f = (lua_CFunction)dlsym(lib, sym); + if (f == NULL) lua_pushstring(L, dlerror()); + return f; +} + +/* }====================================================== */ + + + +#elif defined(LUA_DL_DLL) +/* +** {====================================================================== +** This is an implementation of loadlib for Windows using native functions. +** ======================================================================= +*/ + +#include + + +#undef setprogdir + +static void setprogdir (lua_State *L) { + char buff[MAX_PATH + 1]; + char *lb; + DWORD nsize = sizeof(buff)/sizeof(char); + DWORD n = GetModuleFileName(NULL, buff, nsize); + if (n == 0 || n == nsize || (lb = strrchr(buff, '\\')) == NULL) + luaL_error(L, "unable to get ModuleFileName"); + else { + *lb = '\0'; + luaL_gsub(L, lua_tostring(L, -1), LUA_EXECDIR, buff); + lua_remove(L, -2); /* remove original string */ + } +} + + +static void pusherror (lua_State *L) { + int error = GetLastError(); + char buffer[128]; + if (FormatMessage(FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_FROM_SYSTEM, + NULL, error, 0, buffer, sizeof(buffer), NULL)) + lua_pushstring(L, buffer); + else + lua_pushfstring(L, "system error %d\n", error); +} + +static void ll_unloadlib (void *lib) { + FreeLibrary((HINSTANCE)lib); +} + + +static void *ll_load (lua_State *L, const char *path) { + HINSTANCE lib = LoadLibrary(path); + if (lib == NULL) pusherror(L); + return lib; +} + + +static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) { + lua_CFunction f = (lua_CFunction)GetProcAddress((HINSTANCE)lib, sym); + if (f == NULL) pusherror(L); + return f; +} + +/* }====================================================== */ + + + +#elif defined(LUA_DL_DYLD) +/* +** {====================================================================== +** Native Mac OS X / Darwin Implementation +** ======================================================================= +*/ + +#include + + +/* Mac appends a `_' before C function names */ +#undef POF +#define POF "_" LUA_POF + + +static void pusherror (lua_State *L) { + const char *err_str; + const char *err_file; + NSLinkEditErrors err; + int err_num; + NSLinkEditError(&err, &err_num, &err_file, &err_str); + lua_pushstring(L, err_str); +} + + +static const char *errorfromcode (NSObjectFileImageReturnCode ret) { + switch (ret) { + case NSObjectFileImageInappropriateFile: + return "file is not a bundle"; + case NSObjectFileImageArch: + return "library is for wrong CPU type"; + case NSObjectFileImageFormat: + return "bad format"; + case NSObjectFileImageAccess: + return "cannot access file"; + case NSObjectFileImageFailure: + default: + return "unable to load library"; + } +} + + +static void ll_unloadlib (void *lib) { + NSUnLinkModule((NSModule)lib, NSUNLINKMODULE_OPTION_RESET_LAZY_REFERENCES); +} + + +static void *ll_load (lua_State *L, const char *path) { + NSObjectFileImage img; + NSObjectFileImageReturnCode ret; + /* this would be a rare case, but prevents crashing if it happens */ + if(!_dyld_present()) { + lua_pushliteral(L, "dyld not present"); + return NULL; + } + ret = NSCreateObjectFileImageFromFile(path, &img); + if (ret == NSObjectFileImageSuccess) { + NSModule mod = NSLinkModule(img, path, NSLINKMODULE_OPTION_PRIVATE | + NSLINKMODULE_OPTION_RETURN_ON_ERROR); + NSDestroyObjectFileImage(img); + if (mod == NULL) pusherror(L); + return mod; + } + lua_pushstring(L, errorfromcode(ret)); + return NULL; +} + + +static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) { + NSSymbol nss = NSLookupSymbolInModule((NSModule)lib, sym); + if (nss == NULL) { + lua_pushfstring(L, "symbol " LUA_QS " not found", sym); + return NULL; + } + return (lua_CFunction)NSAddressOfSymbol(nss); +} + +/* }====================================================== */ + + + +#else +/* +** {====================================================== +** Fallback for other systems +** ======================================================= +*/ + +#undef LIB_FAIL +#define LIB_FAIL "absent" + + +#define DLMSG "dynamic libraries not enabled; check your Lua installation" + + +static void ll_unloadlib (void *lib) { + (void)lib; /* to avoid warnings */ +} + + +static void *ll_load (lua_State *L, const char *path) { + (void)path; /* to avoid warnings */ + lua_pushliteral(L, DLMSG); + return NULL; +} + + +static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) { + (void)lib; (void)sym; /* to avoid warnings */ + lua_pushliteral(L, DLMSG); + return NULL; +} + +/* }====================================================== */ +#endif + + + +static void **ll_register (lua_State *L, const char *path) { + void **plib; + lua_pushfstring(L, "%s%s", LIBPREFIX, path); + lua_gettable(L, LUA_REGISTRYINDEX); /* check library in registry? */ + if (!lua_isnil(L, -1)) /* is there an entry? */ + plib = (void **)lua_touserdata(L, -1); + else { /* no entry yet; create one */ + lua_pop(L, 1); + plib = (void **)lua_newuserdata(L, sizeof(const void *)); + *plib = NULL; + luaL_getmetatable(L, "_LOADLIB"); + lua_setmetatable(L, -2); + lua_pushfstring(L, "%s%s", LIBPREFIX, path); + lua_pushvalue(L, -2); + lua_settable(L, LUA_REGISTRYINDEX); + } + return plib; +} + + +/* +** __gc tag method: calls library's `ll_unloadlib' function with the lib +** handle +*/ +static int gctm (lua_State *L) { + void **lib = (void **)luaL_checkudata(L, 1, "_LOADLIB"); + if (*lib) ll_unloadlib(*lib); + *lib = NULL; /* mark library as closed */ + return 0; +} + + +static int ll_loadfunc (lua_State *L, const char *path, const char *sym) { + void **reg = ll_register(L, path); + if (*reg == NULL) *reg = ll_load(L, path); + if (*reg == NULL) + return ERRLIB; /* unable to load library */ + else { + lua_CFunction f = ll_sym(L, *reg, sym); + if (f == NULL) + return ERRFUNC; /* unable to find function */ + lua_pushcfunction(L, f); + return 0; /* return function */ + } +} + + +static int ll_loadlib (lua_State *L) { + const char *path = luaL_checkstring(L, 1); + const char *init = luaL_checkstring(L, 2); + int stat = ll_loadfunc(L, path, init); + if (stat == 0) /* no errors? */ + return 1; /* return the loaded function */ + else { /* error; error message is on stack top */ + lua_pushnil(L); + lua_insert(L, -2); + lua_pushstring(L, (stat == ERRLIB) ? LIB_FAIL : "init"); + return 3; /* return nil, error message, and where */ + } +} + + + +/* +** {====================================================== +** 'require' function +** ======================================================= +*/ + + +static int readable (const char *filename) { + FILE *f = fopen(filename, "r"); /* try to open file */ + if (f == NULL) return 0; /* open failed */ + fclose(f); + return 1; +} + + +static const char *pushnexttemplate (lua_State *L, const char *path) { + const char *l; + while (*path == *LUA_PATHSEP) path++; /* skip separators */ + if (*path == '\0') return NULL; /* no more templates */ + l = strchr(path, *LUA_PATHSEP); /* find next separator */ + if (l == NULL) l = path + strlen(path); + lua_pushlstring(L, path, l - path); /* template */ + return l; +} + + +static const char *findfile (lua_State *L, const char *name, + const char *pname) { + const char *path; + name = luaL_gsub(L, name, ".", LUA_DIRSEP); + lua_getfield(L, LUA_ENVIRONINDEX, pname); + path = lua_tostring(L, -1); + if (path == NULL) + luaL_error(L, LUA_QL("package.%s") " must be a string", pname); + lua_pushstring(L, ""); /* error accumulator */ + while ((path = pushnexttemplate(L, path)) != NULL) { + const char *filename; + filename = luaL_gsub(L, lua_tostring(L, -1), LUA_PATH_MARK, name); + if (readable(filename)) /* does file exist and is readable? */ + return filename; /* return that file name */ + lua_pop(L, 2); /* remove path template and file name */ + luaO_pushfstring(L, "\n\tno file " LUA_QS, filename); + lua_concat(L, 2); + } + return NULL; /* not found */ +} + + +static void loaderror (lua_State *L, const char *filename) { + luaL_error(L, "error loading module " LUA_QS " from file " LUA_QS ":\n\t%s", + lua_tostring(L, 1), filename, lua_tostring(L, -1)); +} + + +static int loader_Lua (lua_State *L) { + const char *filename; + const char *name = luaL_checkstring(L, 1); + filename = findfile(L, name, "path"); + if (filename == NULL) return 1; /* library not found in this path */ + if (luaL_loadfile(L, filename) != 0) + loaderror(L, filename); + return 1; /* library loaded successfully */ +} + + +static const char *mkfuncname (lua_State *L, const char *modname) { + const char *funcname; + const char *mark = strchr(modname, *LUA_IGMARK); + if (mark) modname = mark + 1; + funcname = luaL_gsub(L, modname, ".", LUA_OFSEP); + funcname = lua_pushfstring(L, POF"%s", funcname); + lua_remove(L, -2); /* remove 'gsub' result */ + return funcname; +} + + +static int loader_C (lua_State *L) { + const char *funcname; + const char *name = luaL_checkstring(L, 1); + const char *filename = findfile(L, name, "cpath"); + if (filename == NULL) return 1; /* library not found in this path */ + funcname = mkfuncname(L, name); + if (ll_loadfunc(L, filename, funcname) != 0) + loaderror(L, filename); + return 1; /* library loaded successfully */ +} + + +static int loader_Croot (lua_State *L) { + const char *funcname; + 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"); + if (filename == NULL) return 1; /* root not found */ + funcname = mkfuncname(L, name); + if ((stat = ll_loadfunc(L, filename, funcname)) != 0) { + if (stat != ERRFUNC) loaderror(L, filename); /* real error */ + luaO_pushfstring(L, "\n\tno module " LUA_QS " in file " LUA_QS, + name, filename); + return 1; /* function not found */ + } + return 1; +} + + +static int loader_preload (lua_State *L) { + const char *name = luaL_checkstring(L, 1); + lua_getfield(L, LUA_ENVIRONINDEX, "preload"); + if (!lua_istable(L, -1)) + luaL_error(L, LUA_QL("package.preload") " must be a table"); + lua_getfield(L, -1, name); + if (lua_isnil(L, -1)) /* not found? */ + luaO_pushfstring(L, "\n\tno field package.preload['%s']", name); + return 1; +} + + +static const int sentinel_ = 0; +#define sentinel ((void *)&sentinel_) + + +static int ll_require (lua_State *L) { + const char *name = luaL_checkstring(L, 1); + int i; + lua_settop(L, 1); /* _LOADED table will be at index 2 */ + lua_getfield(L, LUA_REGISTRYINDEX, "_LOADED"); + lua_getfield(L, 2, name); + if (lua_toboolean(L, -1)) { /* is it there? */ + if (lua_touserdata(L, -1) == sentinel) /* check loops */ + luaL_error(L, "loop or previous error loading module " LUA_QS, name); + return 1; /* package is already loaded */ + } + /* else must load it; iterate over available loaders */ + lua_getfield(L, LUA_ENVIRONINDEX, "loaders"); + if (!lua_istable(L, -1)) + luaL_error(L, LUA_QL("package.loaders") " must be a table"); + lua_pushstring(L, ""); /* error message accumulator */ + for (i=1; ; i++) { + lua_rawgeti(L, -2, i); /* get a loader */ + if (lua_isnil(L, -1)) + luaL_error(L, "module " LUA_QS " not found:%s", + name, lua_tostring(L, -2)); + lua_pushstring(L, name); + lua_call(L, 1, 1); /* call it */ + if (lua_isfunction(L, -1)) /* did it find module? */ + break; /* module loaded successfully */ + else if (lua_isstring(L, -1)) /* loader returned error message? */ + lua_concat(L, 2); /* accumulate it */ + else + lua_pop(L, 1); + } + lua_pushlightuserdata(L, sentinel); + lua_setfield(L, 2, name); /* _LOADED[name] = sentinel */ + lua_pushstring(L, name); /* pass name as argument to module */ + lua_call(L, 1, 1); /* run loaded module */ + if (!lua_isnil(L, -1)) /* non-nil return? */ + lua_setfield(L, 2, name); /* _LOADED[name] = returned value */ + lua_getfield(L, 2, name); + if (lua_touserdata(L, -1) == sentinel) { /* module did not set a value? */ + lua_pushboolean(L, 1); /* use true as result */ + lua_pushvalue(L, -1); /* extra copy to be returned */ + lua_setfield(L, 2, name); /* _LOADED[name] = true */ + } + return 1; +} + +/* }====================================================== */ + + + +/* +** {====================================================== +** 'module' function +** ======================================================= +*/ + + +static void setfenv (lua_State *L) { + lua_Debug ar; + lua_getstack(L, 1, &ar); + lua_getinfo(L, "f", &ar); + lua_pushvalue(L, -2); + lua_setfenv(L, -2); + lua_pop(L, 1); +} + + +static void dooptions (lua_State *L, int n) { + int i; + for (i = 2; i <= n; i++) { + lua_pushvalue(L, i); /* get option (a function) */ + lua_pushvalue(L, -2); /* module */ + lua_call(L, 1, 0); + } +} + + +static void modinit (lua_State *L, const char *modname) { + const char *dot; + lua_pushvalue(L, -1); + lua_setfield(L, -2, "_M"); /* module._M = module */ + lua_pushstring(L, modname); + lua_setfield(L, -2, "_NAME"); + dot = strrchr(modname, '.'); /* look for last dot in module name */ + if (dot == NULL) dot = modname; + else dot++; + /* set _PACKAGE as package name (full module name minus last part) */ + lua_pushlstring(L, modname, dot - modname); + lua_setfield(L, -2, "_PACKAGE"); +} + + +static int ll_module (lua_State *L) { + const char *modname = luaL_checkstring(L, 1); + int loaded = lua_gettop(L) + 1; /* index of _LOADED table */ + lua_getfield(L, LUA_REGISTRYINDEX, "_LOADED"); + lua_getfield(L, loaded, modname); /* get _LOADED[modname] */ + if (!lua_istable(L, -1)) { /* not found? */ + lua_pop(L, 1); /* remove previous result */ + /* try global variable (and create one if it does not exist) */ + if (luaL_findtable(L, LUA_GLOBALSINDEX, modname, 1) != NULL) + return luaL_error(L, "name conflict for module " LUA_QS, modname); + lua_pushvalue(L, -1); + lua_setfield(L, loaded, modname); /* _LOADED[modname] = new table */ + } + /* check whether table already has a _NAME field */ + lua_getfield(L, -1, "_NAME"); + if (!lua_isnil(L, -1)) /* is table an initialized module? */ + lua_pop(L, 1); + else { /* no; initialize it */ + lua_pop(L, 1); + modinit(L, modname); + } + lua_pushvalue(L, -1); + setfenv(L); + dooptions(L, loaded - 1); + return 0; +} + + +static int ll_seeall (lua_State *L) { + luaL_checktype(L, 1, LUA_TTABLE); + if (!lua_getmetatable(L, 1)) { + lua_createtable(L, 0, 1); /* create new metatable */ + lua_pushvalue(L, -1); + lua_setmetatable(L, 1); + } + lua_pushvalue(L, LUA_GLOBALSINDEX); + lua_setfield(L, -2, "__index"); /* mt.__index = _G */ + return 0; +} + + +/* }====================================================== */ + + + +/* auxiliary mark (for internal use) */ +#define AUXMARK "\1" + +static void setpath (lua_State *L, const char *fieldname, const char *envname, + const char *def) { + const char *path = getenv(envname); + if (path == NULL) /* no environment variable? */ + lua_pushstring(L, def); /* use default */ + else { + /* replace ";;" by ";AUXMARK;" and then AUXMARK by default path */ + path = luaL_gsub(L, path, LUA_PATHSEP LUA_PATHSEP, + LUA_PATHSEP AUXMARK LUA_PATHSEP); + luaL_gsub(L, path, AUXMARK, def); + lua_remove(L, -2); + } + setprogdir(L); + lua_setfield(L, -2, fieldname); +} + + +static const luaL_Reg pk_funcs[] = { + {"loadlib", ll_loadlib}, + {"seeall", ll_seeall}, + {NULL, NULL} +}; + + +static const luaL_Reg ll_funcs[] = { + {"module", ll_module}, + {"require", ll_require}, + {NULL, NULL} +}; + + +static const lua_CFunction loaders[] = + {loader_preload, loader_Lua, loader_C, loader_Croot, NULL}; + + +LUALIB_API int luaopen_package (lua_State *L) { + int i; + /* create new type _LOADLIB */ + luaL_newmetatable(L, "_LOADLIB"); + lua_pushcfunction(L, gctm); + lua_setfield(L, -2, "__gc"); + /* create `package' table */ + luaL_register(L, LUA_LOADLIBNAME, pk_funcs); +#if defined(LUA_COMPAT_LOADLIB) + lua_getfield(L, -1, "loadlib"); + lua_setfield(L, LUA_GLOBALSINDEX, "loadlib"); +#endif + lua_pushvalue(L, -1); + lua_replace(L, LUA_ENVIRONINDEX); + /* create `loaders' table */ + lua_createtable(L, 0, sizeof(loaders)/sizeof(loaders[0]) - 1); + /* fill it with pre-defined loaders */ + for (i=0; loaders[i] != NULL; i++) { + lua_pushcfunction(L, loaders[i]); + lua_rawseti(L, -2, i+1); + } + lua_setfield(L, -2, "loaders"); /* put it in field `loaders' */ + setpath(L, "path", LUA_PATH, LUA_PATH_DEFAULT); /* set field `path' */ + setpath(L, "cpath", LUA_CPATH, LUA_CPATH_DEFAULT); /* set field `cpath' */ + /* store config information */ + lua_pushstring(L, LUA_DIRSEP "\n" LUA_PATHSEP "\n" LUA_PATH_MARK "\n" + LUA_EXECDIR "\n" LUA_IGMARK); + lua_setfield(L, -2, "config"); + /* set field `loaded' */ + luaL_findtable(L, LUA_REGISTRYINDEX, "_LOADED", 2); + lua_setfield(L, -2, "loaded"); + /* set field `preload' */ + lua_newtable(L); + lua_setfield(L, -2, "preload"); + lua_pushvalue(L, LUA_GLOBALSINDEX); + luaL_register(L, NULL, ll_funcs); /* open lib into global table */ + lua_pop(L, 1); + return 1; /* return 'package' table */ +} + diff --git a/ref/lua-5.1/src/lobject.c b/ref/lua-5.1/src/lobject.c new file mode 100644 index 0000000..acde82c --- /dev/null +++ b/ref/lua-5.1/src/lobject.c @@ -0,0 +1,214 @@ +/* +** $Id: lobject.c,v 2.22 2006/02/10 17:43:52 roberto Exp $ +** Some generic functions over Lua objects +** See Copyright Notice in lua.h +*/ + +#include +#include +#include +#include +#include + +#define lobject_c +#define LUA_CORE + +#include "lua.h" + +#include "ldo.h" +#include "lmem.h" +#include "lobject.h" +#include "lstate.h" +#include "lstring.h" +#include "lvm.h" + + + +const TValue luaO_nilobject_ = {{NULL}, LUA_TNIL}; + + +/* +** converts an integer to a "floating point byte", represented as +** (eeeeexxx), where the real value is (1xxx) * 2^(eeeee - 1) if +** eeeee != 0 and (xxx) otherwise. +*/ +int luaO_int2fb (unsigned int x) { + int e = 0; /* expoent */ + while (x >= 16) { + x = (x+1) >> 1; + e++; + } + if (x < 8) return x; + else return ((e+1) << 3) | (cast_int(x) - 8); +} + + +/* converts back */ +int luaO_fb2int (int x) { + int e = (x >> 3) & 31; + if (e == 0) return x; + else return ((x & 7)+8) << (e - 1); +} + + +int luaO_log2 (unsigned int x) { + static const lu_byte log_2[256] = { + 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5, + 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, + 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, + 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, + 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, + 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, + 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, + 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8 + }; + int l = -1; + while (x >= 256) { l += 8; x >>= 8; } + return l + log_2[x]; + +} + + +int luaO_rawequalObj (const TValue *t1, const TValue *t2) { + if (ttype(t1) != ttype(t2)) return 0; + else switch (ttype(t1)) { + case LUA_TNIL: + return 1; + case LUA_TNUMBER: + return luai_numeq(nvalue(t1), nvalue(t2)); + case LUA_TBOOLEAN: + return bvalue(t1) == bvalue(t2); /* boolean true must be 1 !! */ + case LUA_TLIGHTUSERDATA: + return pvalue(t1) == pvalue(t2); + default: + lua_assert(iscollectable(t1)); + return gcvalue(t1) == gcvalue(t2); + } +} + + +int luaO_str2d (const char *s, lua_Number *result) { + char *endptr; + *result = lua_str2number(s, &endptr); + if (endptr == s) return 0; /* conversion failed */ + if (*endptr == 'x' || *endptr == 'X') /* maybe an hexadecimal constant? */ + *result = cast_num(strtoul(s, &endptr, 16)); + if (*endptr == '\0') return 1; /* most common case */ + while (isspace(cast(unsigned char, *endptr))) endptr++; + if (*endptr != '\0') return 0; /* invalid trailing characters? */ + return 1; +} + + + +static void pushstr (lua_State *L, const char *str) { + setsvalue2s(L, L->top, luaS_new(L, str)); + incr_top(L); +} + + +/* this function handles only `%d', `%c', %f, %p, and `%s' formats */ +const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) { + int n = 1; + pushstr(L, ""); + for (;;) { + const char *e = strchr(fmt, '%'); + if (e == NULL) break; + setsvalue2s(L, L->top, luaS_newlstr(L, fmt, e-fmt)); + incr_top(L); + switch (*(e+1)) { + case 's': { + const char *s = va_arg(argp, char *); + if (s == NULL) s = "(null)"; + pushstr(L, s); + break; + } + case 'c': { + char buff[2]; + buff[0] = cast(char, va_arg(argp, int)); + buff[1] = '\0'; + pushstr(L, buff); + break; + } + case 'd': { + setnvalue(L->top, cast_num(va_arg(argp, int))); + incr_top(L); + break; + } + case 'f': { + setnvalue(L->top, cast_num(va_arg(argp, l_uacNumber))); + incr_top(L); + break; + } + case 'p': { + char buff[4*sizeof(void *) + 8]; /* should be enough space for a `%p' */ + sprintf(buff, "%p", va_arg(argp, void *)); + pushstr(L, buff); + break; + } + case '%': { + pushstr(L, "%"); + break; + } + default: { + char buff[3]; + buff[0] = '%'; + buff[1] = *(e+1); + buff[2] = '\0'; + pushstr(L, buff); + break; + } + } + n += 2; + fmt = e+2; + } + pushstr(L, fmt); + luaV_concat(L, n+1, cast_int(L->top - L->base) - 1); + L->top -= n; + return svalue(L->top - 1); +} + + +const char *luaO_pushfstring (lua_State *L, const char *fmt, ...) { + const char *msg; + va_list argp; + va_start(argp, fmt); + msg = luaO_pushvfstring(L, fmt, argp); + va_end(argp); + return msg; +} + + +void luaO_chunkid (char *out, const char *source, size_t bufflen) { + if (*source == '=') { + strncpy(out, source+1, bufflen); /* remove first char */ + out[bufflen-1] = '\0'; /* ensures null termination */ + } + else { /* out = "source", or "...source" */ + if (*source == '@') { + size_t l; + source++; /* skip the `@' */ + bufflen -= sizeof(" '...' "); + l = strlen(source); + strcpy(out, ""); + if (l > bufflen) { + source += (l-bufflen); /* get last part of file name */ + strcat(out, "..."); + } + strcat(out, source); + } + else { /* out = [string "string"] */ + size_t len = strcspn(source, "\n\r"); /* stop at first newline */ + bufflen -= sizeof(" [string \"...\"] "); + if (len > bufflen) len = bufflen; + strcpy(out, "[string \""); + if (source[len] != '\0') { /* must truncate? */ + strncat(out, source, len); + strcat(out, "..."); + } + else + strcat(out, source); + strcat(out, "\"]"); + } + } +} diff --git a/ref/lua-5.1/src/lobject.h b/ref/lua-5.1/src/lobject.h new file mode 100644 index 0000000..8ce4405 --- /dev/null +++ b/ref/lua-5.1/src/lobject.h @@ -0,0 +1,381 @@ +/* +** $Id: lobject.h,v 2.20 2006/01/18 11:37:34 roberto Exp $ +** Type definitions for Lua objects +** See Copyright Notice in lua.h +*/ + + +#ifndef lobject_h +#define lobject_h + + +#include + + +#include "llimits.h" +#include "lua.h" + + +/* tags for values visible from Lua */ +#define LAST_TAG LUA_TTHREAD + +#define NUM_TAGS (LAST_TAG+1) + + +/* +** Extra tags for non-values +*/ +#define LUA_TPROTO (LAST_TAG+1) +#define LUA_TUPVAL (LAST_TAG+2) +#define LUA_TDEADKEY (LAST_TAG+3) + + +/* +** Union of all collectable objects +*/ +typedef union GCObject GCObject; + + +/* +** Common Header for all collectable objects (in macro form, to be +** included in other objects) +*/ +#define CommonHeader GCObject *next; lu_byte tt; lu_byte marked + + +/* +** Common header in struct form +*/ +typedef struct GCheader { + CommonHeader; +} GCheader; + + + + +/* +** Union of all Lua values +*/ +typedef union { + GCObject *gc; + void *p; + lua_Number n; + int b; +} Value; + + +/* +** Tagged Values +*/ + +#define TValuefields Value value; int tt + +typedef struct lua_TValue { + TValuefields; +} TValue; + + +/* Macros to test type */ +#define ttisnil(o) (ttype(o) == LUA_TNIL) +#define ttisnumber(o) (ttype(o) == LUA_TNUMBER) +#define ttisstring(o) (ttype(o) == LUA_TSTRING) +#define ttistable(o) (ttype(o) == LUA_TTABLE) +#define ttisfunction(o) (ttype(o) == LUA_TFUNCTION) +#define ttisboolean(o) (ttype(o) == LUA_TBOOLEAN) +#define ttisuserdata(o) (ttype(o) == LUA_TUSERDATA) +#define ttisthread(o) (ttype(o) == LUA_TTHREAD) +#define ttislightuserdata(o) (ttype(o) == LUA_TLIGHTUSERDATA) + +/* Macros to access values */ +#define ttype(o) ((o)->tt) +#define gcvalue(o) check_exp(iscollectable(o), (o)->value.gc) +#define pvalue(o) check_exp(ttislightuserdata(o), (o)->value.p) +#define nvalue(o) check_exp(ttisnumber(o), (o)->value.n) +#define rawtsvalue(o) check_exp(ttisstring(o), &(o)->value.gc->ts) +#define tsvalue(o) (&rawtsvalue(o)->tsv) +#define rawuvalue(o) check_exp(ttisuserdata(o), &(o)->value.gc->u) +#define uvalue(o) (&rawuvalue(o)->uv) +#define clvalue(o) check_exp(ttisfunction(o), &(o)->value.gc->cl) +#define hvalue(o) check_exp(ttistable(o), &(o)->value.gc->h) +#define bvalue(o) check_exp(ttisboolean(o), (o)->value.b) +#define thvalue(o) check_exp(ttisthread(o), &(o)->value.gc->th) + +#define l_isfalse(o) (ttisnil(o) || (ttisboolean(o) && bvalue(o) == 0)) + +/* +** for internal debug only +*/ +#define checkconsistency(obj) \ + lua_assert(!iscollectable(obj) || (ttype(obj) == (obj)->value.gc->gch.tt)) + +#define checkliveness(g,obj) \ + lua_assert(!iscollectable(obj) || \ + ((ttype(obj) == (obj)->value.gc->gch.tt) && !isdead(g, (obj)->value.gc))) + + +/* Macros to set values */ +#define setnilvalue(obj) ((obj)->tt=LUA_TNIL) + +#define setnvalue(obj,x) \ + { TValue *i_o=(obj); i_o->value.n=(x); i_o->tt=LUA_TNUMBER; } + +#define setpvalue(obj,x) \ + { TValue *i_o=(obj); i_o->value.p=(x); i_o->tt=LUA_TLIGHTUSERDATA; } + +#define setbvalue(obj,x) \ + { TValue *i_o=(obj); i_o->value.b=(x); i_o->tt=LUA_TBOOLEAN; } + +#define setsvalue(L,obj,x) \ + { TValue *i_o=(obj); \ + i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TSTRING; \ + checkliveness(G(L),i_o); } + +#define setuvalue(L,obj,x) \ + { TValue *i_o=(obj); \ + i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TUSERDATA; \ + checkliveness(G(L),i_o); } + +#define setthvalue(L,obj,x) \ + { TValue *i_o=(obj); \ + i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TTHREAD; \ + checkliveness(G(L),i_o); } + +#define setclvalue(L,obj,x) \ + { TValue *i_o=(obj); \ + i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TFUNCTION; \ + checkliveness(G(L),i_o); } + +#define sethvalue(L,obj,x) \ + { TValue *i_o=(obj); \ + i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TTABLE; \ + checkliveness(G(L),i_o); } + +#define setptvalue(L,obj,x) \ + { TValue *i_o=(obj); \ + i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TPROTO; \ + checkliveness(G(L),i_o); } + + + + +#define setobj(L,obj1,obj2) \ + { const TValue *o2=(obj2); TValue *o1=(obj1); \ + o1->value = o2->value; o1->tt=o2->tt; \ + checkliveness(G(L),o1); } + + +/* +** different types of sets, according to destination +*/ + +/* from stack to (same) stack */ +#define setobjs2s setobj +/* to stack (not from same stack) */ +#define setobj2s setobj +#define setsvalue2s setsvalue +#define sethvalue2s sethvalue +#define setptvalue2s setptvalue +/* from table to same table */ +#define setobjt2t setobj +/* to table */ +#define setobj2t setobj +/* to new object */ +#define setobj2n setobj +#define setsvalue2n setsvalue + +#define setttype(obj, tt) (ttype(obj) = (tt)) + + +#define iscollectable(o) (ttype(o) >= LUA_TSTRING) + + + +typedef TValue *StkId; /* index to stack elements */ + + +/* +** String headers for string table +*/ +typedef union TString { + L_Umaxalign dummy; /* ensures maximum alignment for strings */ + struct { + CommonHeader; + lu_byte reserved; + unsigned int hash; + size_t len; + } tsv; +} TString; + + +#define getstr(ts) cast(const char *, (ts) + 1) +#define svalue(o) getstr(tsvalue(o)) + + + +typedef union Udata { + L_Umaxalign dummy; /* ensures maximum alignment for `local' udata */ + struct { + CommonHeader; + struct Table *metatable; + struct Table *env; + size_t len; + } uv; +} Udata; + + + + +/* +** Function Prototypes +*/ +typedef struct Proto { + CommonHeader; + TValue *k; /* constants used by the function */ + Instruction *code; + struct Proto **p; /* functions defined inside the function */ + int *lineinfo; /* map from opcodes to source lines */ + struct LocVar *locvars; /* information about local variables */ + TString **upvalues; /* upvalue names */ + TString *source; + int sizeupvalues; + int sizek; /* size of `k' */ + int sizecode; + int sizelineinfo; + int sizep; /* size of `p' */ + int sizelocvars; + int linedefined; + int lastlinedefined; + GCObject *gclist; + lu_byte nups; /* number of upvalues */ + lu_byte numparams; + lu_byte is_vararg; + lu_byte maxstacksize; +} Proto; + + +/* masks for new-style vararg */ +#define VARARG_HASARG 1 +#define VARARG_ISVARARG 2 +#define VARARG_NEEDSARG 4 + + +typedef struct LocVar { + TString *varname; + int startpc; /* first point where variable is active */ + int endpc; /* first point where variable is dead */ +} LocVar; + + + +/* +** Upvalues +*/ + +typedef struct UpVal { + CommonHeader; + TValue *v; /* points to stack or to its own value */ + union { + TValue value; /* the value (when closed) */ + struct { /* double linked list (when open) */ + struct UpVal *prev; + struct UpVal *next; + } l; + } u; +} UpVal; + + +/* +** Closures +*/ + +#define ClosureHeader \ + CommonHeader; lu_byte isC; lu_byte nupvalues; GCObject *gclist; \ + struct Table *env + +typedef struct CClosure { + ClosureHeader; + lua_CFunction f; + TValue upvalue[1]; +} CClosure; + + +typedef struct LClosure { + ClosureHeader; + struct Proto *p; + UpVal *upvals[1]; +} LClosure; + + +typedef union Closure { + CClosure c; + LClosure l; +} Closure; + + +#define iscfunction(o) (ttype(o) == LUA_TFUNCTION && clvalue(o)->c.isC) +#define isLfunction(o) (ttype(o) == LUA_TFUNCTION && !clvalue(o)->c.isC) + + +/* +** Tables +*/ + +typedef union TKey { + struct { + TValuefields; + struct Node *next; /* for chaining */ + } nk; + TValue tvk; +} TKey; + + +typedef struct Node { + TValue i_val; + TKey i_key; +} Node; + + +typedef struct Table { + CommonHeader; + lu_byte flags; /* 1<

    lsizenode)) + + +#define luaO_nilobject (&luaO_nilobject_) + +LUAI_DATA const TValue luaO_nilobject_; + +#define ceillog2(x) (luaO_log2((x)-1) + 1) + +LUAI_FUNC int luaO_log2 (unsigned int x); +LUAI_FUNC int luaO_int2fb (unsigned int x); +LUAI_FUNC int luaO_fb2int (int x); +LUAI_FUNC int luaO_rawequalObj (const TValue *t1, const TValue *t2); +LUAI_FUNC int luaO_str2d (const char *s, lua_Number *result); +LUAI_FUNC const char *luaO_pushvfstring (lua_State *L, const char *fmt, + va_list argp); +LUAI_FUNC const char *luaO_pushfstring (lua_State *L, const char *fmt, ...); +LUAI_FUNC void luaO_chunkid (char *out, const char *source, size_t len); + + +#endif + diff --git a/ref/lua-5.1/src/lopcodes.c b/ref/lua-5.1/src/lopcodes.c new file mode 100644 index 0000000..bf9cd52 --- /dev/null +++ b/ref/lua-5.1/src/lopcodes.c @@ -0,0 +1,102 @@ +/* +** $Id: lopcodes.c,v 1.37 2005/11/08 19:45:36 roberto Exp $ +** See Copyright Notice in lua.h +*/ + + +#define lopcodes_c +#define LUA_CORE + + +#include "lopcodes.h" + + +/* ORDER OP */ + +const char *const luaP_opnames[NUM_OPCODES+1] = { + "MOVE", + "LOADK", + "LOADBOOL", + "LOADNIL", + "GETUPVAL", + "GETGLOBAL", + "GETTABLE", + "SETGLOBAL", + "SETUPVAL", + "SETTABLE", + "NEWTABLE", + "SELF", + "ADD", + "SUB", + "MUL", + "DIV", + "MOD", + "POW", + "UNM", + "NOT", + "LEN", + "CONCAT", + "JMP", + "EQ", + "LT", + "LE", + "TEST", + "TESTSET", + "CALL", + "TAILCALL", + "RETURN", + "FORLOOP", + "FORPREP", + "TFORLOOP", + "SETLIST", + "CLOSE", + "CLOSURE", + "VARARG", + NULL +}; + + +#define opmode(t,a,b,c,m) (((t)<<7) | ((a)<<6) | ((b)<<4) | ((c)<<2) | (m)) + +const lu_byte luaP_opmodes[NUM_OPCODES] = { +/* T A B C mode opcode */ + opmode(0, 1, OpArgR, OpArgN, iABC) /* OP_MOVE */ + ,opmode(0, 1, OpArgK, OpArgN, iABx) /* OP_LOADK */ + ,opmode(0, 1, OpArgU, OpArgU, iABC) /* OP_LOADBOOL */ + ,opmode(0, 1, OpArgR, OpArgN, iABC) /* OP_LOADNIL */ + ,opmode(0, 1, OpArgU, OpArgN, iABC) /* OP_GETUPVAL */ + ,opmode(0, 1, OpArgK, OpArgN, iABx) /* OP_GETGLOBAL */ + ,opmode(0, 1, OpArgR, OpArgK, iABC) /* OP_GETTABLE */ + ,opmode(0, 0, OpArgK, OpArgN, iABx) /* OP_SETGLOBAL */ + ,opmode(0, 0, OpArgU, OpArgN, iABC) /* OP_SETUPVAL */ + ,opmode(0, 0, OpArgK, OpArgK, iABC) /* OP_SETTABLE */ + ,opmode(0, 1, OpArgU, OpArgU, iABC) /* OP_NEWTABLE */ + ,opmode(0, 1, OpArgR, OpArgK, iABC) /* OP_SELF */ + ,opmode(0, 1, OpArgK, OpArgK, iABC) /* OP_ADD */ + ,opmode(0, 1, OpArgK, OpArgK, iABC) /* OP_SUB */ + ,opmode(0, 1, OpArgK, OpArgK, iABC) /* OP_MUL */ + ,opmode(0, 1, OpArgK, OpArgK, iABC) /* OP_DIV */ + ,opmode(0, 1, OpArgK, OpArgK, iABC) /* OP_MOD */ + ,opmode(0, 1, OpArgK, OpArgK, iABC) /* OP_POW */ + ,opmode(0, 1, OpArgR, OpArgN, iABC) /* OP_UNM */ + ,opmode(0, 1, OpArgR, OpArgN, iABC) /* OP_NOT */ + ,opmode(0, 1, OpArgR, OpArgN, iABC) /* OP_LEN */ + ,opmode(0, 1, OpArgR, OpArgR, iABC) /* OP_CONCAT */ + ,opmode(0, 0, OpArgR, OpArgN, iAsBx) /* OP_JMP */ + ,opmode(1, 0, OpArgK, OpArgK, iABC) /* OP_EQ */ + ,opmode(1, 0, OpArgK, OpArgK, iABC) /* OP_LT */ + ,opmode(1, 0, OpArgK, OpArgK, iABC) /* OP_LE */ + ,opmode(1, 1, OpArgR, OpArgU, iABC) /* OP_TEST */ + ,opmode(1, 1, OpArgR, OpArgU, iABC) /* OP_TESTSET */ + ,opmode(0, 1, OpArgU, OpArgU, iABC) /* OP_CALL */ + ,opmode(0, 1, OpArgU, OpArgU, iABC) /* OP_TAILCALL */ + ,opmode(0, 0, OpArgU, OpArgN, iABC) /* OP_RETURN */ + ,opmode(0, 1, OpArgR, OpArgN, iAsBx) /* OP_FORLOOP */ + ,opmode(0, 1, OpArgR, OpArgN, iAsBx) /* OP_FORPREP */ + ,opmode(1, 0, OpArgN, OpArgU, iABC) /* OP_TFORLOOP */ + ,opmode(0, 0, OpArgU, OpArgU, iABC) /* OP_SETLIST */ + ,opmode(0, 0, OpArgN, OpArgN, iABC) /* OP_CLOSE */ + ,opmode(0, 1, OpArgU, OpArgN, iABx) /* OP_CLOSURE */ + ,opmode(0, 1, OpArgU, OpArgN, iABC) /* OP_VARARG */ +}; + diff --git a/ref/lua-5.1/src/lopcodes.h b/ref/lua-5.1/src/lopcodes.h new file mode 100644 index 0000000..2834b1d --- /dev/null +++ b/ref/lua-5.1/src/lopcodes.h @@ -0,0 +1,268 @@ +/* +** $Id: lopcodes.h,v 1.124 2005/12/02 18:42:08 roberto Exp $ +** Opcodes for Lua virtual machine +** See Copyright Notice in lua.h +*/ + +#ifndef lopcodes_h +#define lopcodes_h + +#include "llimits.h" + + +/*=========================================================================== + We assume that instructions are unsigned numbers. + All instructions have an opcode in the first 6 bits. + Instructions can have the following fields: + `A' : 8 bits + `B' : 9 bits + `C' : 9 bits + `Bx' : 18 bits (`B' and `C' together) + `sBx' : signed Bx + + A signed argument is represented in excess K; that is, the number + value is the unsigned value minus K. K is exactly the maximum value + for that argument (so that -max is represented by 0, and +max is + represented by 2*max), which is half the maximum for the corresponding + unsigned argument. +===========================================================================*/ + + +enum OpMode {iABC, iABx, iAsBx}; /* basic instruction format */ + + +/* +** size and position of opcode arguments. +*/ +#define SIZE_C 9 +#define SIZE_B 9 +#define SIZE_Bx (SIZE_C + SIZE_B) +#define SIZE_A 8 + +#define SIZE_OP 6 + +#define POS_OP 0 +#define POS_A (POS_OP + SIZE_OP) +#define POS_C (POS_A + SIZE_A) +#define POS_B (POS_C + SIZE_C) +#define POS_Bx POS_C + + +/* +** limits for opcode arguments. +** we use (signed) int to manipulate most arguments, +** so they must fit in LUAI_BITSINT-1 bits (-1 for sign) +*/ +#if SIZE_Bx < LUAI_BITSINT-1 +#define MAXARG_Bx ((1<>1) /* `sBx' is signed */ +#else +#define MAXARG_Bx MAX_INT +#define MAXARG_sBx MAX_INT +#endif + + +#define MAXARG_A ((1<>POS_OP) & MASK1(SIZE_OP,0))) +#define SET_OPCODE(i,o) ((i) = (((i)&MASK0(SIZE_OP,POS_OP)) | \ + ((cast(Instruction, o)<>POS_A) & MASK1(SIZE_A,0))) +#define SETARG_A(i,u) ((i) = (((i)&MASK0(SIZE_A,POS_A)) | \ + ((cast(Instruction, u)<>POS_B) & MASK1(SIZE_B,0))) +#define SETARG_B(i,b) ((i) = (((i)&MASK0(SIZE_B,POS_B)) | \ + ((cast(Instruction, b)<>POS_C) & MASK1(SIZE_C,0))) +#define SETARG_C(i,b) ((i) = (((i)&MASK0(SIZE_C,POS_C)) | \ + ((cast(Instruction, b)<>POS_Bx) & MASK1(SIZE_Bx,0))) +#define SETARG_Bx(i,b) ((i) = (((i)&MASK0(SIZE_Bx,POS_Bx)) | \ + ((cast(Instruction, b)< C) then pc++ */ +OP_TESTSET,/* A B C if (R(B) <=> C) then R(A) := R(B) else pc++ */ + +OP_CALL,/* A B C R(A), ... ,R(A+C-2) := R(A)(R(A+1), ... ,R(A+B-1)) */ +OP_TAILCALL,/* A B C return R(A)(R(A+1), ... ,R(A+B-1)) */ +OP_RETURN,/* A B return R(A), ... ,R(A+B-2) (see note) */ + +OP_FORLOOP,/* A sBx R(A)+=R(A+2); + if R(A) =) R(A)*/ +OP_CLOSURE,/* A Bx R(A) := closure(KPROTO[Bx], R(A), ... ,R(A+n)) */ + +OP_VARARG/* A B R(A), R(A+1), ..., R(A+B-1) = vararg */ +} OpCode; + + +#define NUM_OPCODES (cast(int, OP_VARARG) + 1) + + + +/*=========================================================================== + Notes: + (*) In OP_CALL, if (B == 0) then B = top. C is the number of returns - 1, + and can be 0: OP_CALL then sets `top' to last_result+1, so + next open instruction (OP_CALL, OP_RETURN, OP_SETLIST) may use `top'. + + (*) In OP_VARARG, if (B == 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_SETLIST, if (B == 0) then B = `top'; + if (C == 0) then next `instruction' is real C + + (*) For comparisons, A specifies what condition the test should accept + (true or false). + + (*) All `skips' (pc++) assume that next instruction is a jump +===========================================================================*/ + + +/* +** masks for instruction properties. The format is: +** bits 0-1: op mode +** bits 2-3: C arg mode +** bits 4-5: B arg mode +** bit 6: instruction set register A +** bit 7: operator is a test +*/ + +enum OpArgMask { + OpArgN, /* argument is not used */ + OpArgU, /* argument is used */ + OpArgR, /* argument is a register or a jump offset */ + OpArgK /* argument is a constant or register/constant */ +}; + +LUAI_DATA const lu_byte luaP_opmodes[NUM_OPCODES]; + +#define getOpMode(m) (cast(enum OpMode, luaP_opmodes[m] & 3)) +#define getBMode(m) (cast(enum OpArgMask, (luaP_opmodes[m] >> 4) & 3)) +#define getCMode(m) (cast(enum OpArgMask, (luaP_opmodes[m] >> 2) & 3)) +#define testAMode(m) (luaP_opmodes[m] & (1 << 6)) +#define testTMode(m) (luaP_opmodes[m] & (1 << 7)) + + +LUAI_DATA const char *const luaP_opnames[NUM_OPCODES+1]; /* opcode names */ + + +/* number of list items to accumulate before a SETLIST instruction */ +#define LFIELDS_PER_FLUSH 50 + + +#endif diff --git a/ref/lua-5.1/src/loslib.c b/ref/lua-5.1/src/loslib.c new file mode 100644 index 0000000..509d7b7 --- /dev/null +++ b/ref/lua-5.1/src/loslib.c @@ -0,0 +1,238 @@ +/* +** $Id: loslib.c,v 1.17 2006/01/27 13:54:31 roberto Exp $ +** Standard Operating System library +** See Copyright Notice in lua.h +*/ + + +#include +#include +#include +#include +#include + +#define loslib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +static int os_pushresult (lua_State *L, int i, const char *filename) { + int en = errno; /* calls to Lua API may change this value */ + if (i) { + lua_pushboolean(L, 1); + return 1; + } + else { + lua_pushnil(L); + if (filename) + lua_pushfstring(L, "%s: %s", filename, strerror(en)); + else + lua_pushfstring(L, "%s", strerror(en)); + lua_pushinteger(L, en); + return 3; + } +} + + +static int os_execute (lua_State *L) { + lua_pushinteger(L, system(luaL_optstring(L, 1, NULL))); + return 1; +} + + +static int os_remove (lua_State *L) { + const char *filename = luaL_checkstring(L, 1); + return os_pushresult(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 os_pushresult(L, rename(fromname, toname) == 0, fromname); +} + + +static int os_tmpname (lua_State *L) { + char buff[LUA_TMPNAMBUFSIZE]; + int err; + lua_tmpnam(buff, err); + if (err) + return luaL_error(L, "unable to generate a unique filename"); + lua_pushstring(L, buff); + return 1; +} + + +static int os_getenv (lua_State *L) { + lua_pushstring(L, getenv(luaL_checkstring(L, 1))); /* if NULL push nil */ + return 1; +} + + +static int os_clock (lua_State *L) { + lua_pushnumber(L, ((lua_Number)clock())/(lua_Number)CLOCKS_PER_SEC); + return 1; +} + + +/* +** {====================================================== +** Time/Date operations +** { year=%Y, month=%m, day=%d, hour=%H, min=%M, sec=%S, +** wday=%w+1, yday=%j, isdst=? } +** ======================================================= +*/ + +static void setfield (lua_State *L, const char *key, int value) { + lua_pushinteger(L, value); + lua_setfield(L, -2, key); +} + +static void setboolfield (lua_State *L, const char *key, int value) { + if (value < 0) /* undefined? */ + return; /* does not set field */ + lua_pushboolean(L, value); + lua_setfield(L, -2, key); +} + +static int getboolfield (lua_State *L, const char *key) { + int res; + lua_getfield(L, -1, key); + res = lua_isnil(L, -1) ? -1 : lua_toboolean(L, -1); + lua_pop(L, 1); + return res; +} + + +static int getfield (lua_State *L, const char *key, int d) { + int res; + lua_getfield(L, -1, key); + if (lua_isnumber(L, -1)) + res = (int)lua_tointeger(L, -1); + else { + if (d < 0) + return luaL_error(L, "field " LUA_QS " missing in date table", key); + res = d; + } + lua_pop(L, 1); + return res; +} + + +static int os_date (lua_State *L) { + const char *s = luaL_optstring(L, 1, "%c"); + time_t t = lua_isnoneornil(L, 2) ? time(NULL) : + (time_t)luaL_checknumber(L, 2); + struct tm *stm; + if (*s == '!') { /* UTC? */ + stm = gmtime(&t); + s++; /* skip `!' */ + } + else + stm = localtime(&t); + if (stm == NULL) /* invalid date? */ + lua_pushnil(L); + else if (strcmp(s, "*t") == 0) { + lua_createtable(L, 0, 9); /* 9 = number of fields */ + setfield(L, "sec", stm->tm_sec); + setfield(L, "min", stm->tm_min); + setfield(L, "hour", stm->tm_hour); + setfield(L, "day", stm->tm_mday); + setfield(L, "month", stm->tm_mon+1); + setfield(L, "year", stm->tm_year+1900); + setfield(L, "wday", stm->tm_wday+1); + setfield(L, "yday", stm->tm_yday+1); + setboolfield(L, "isdst", stm->tm_isdst); + } + else { + char b[256]; + if (strftime(b, sizeof(b), s, stm)) + lua_pushstring(L, b); + else + return luaL_error(L, LUA_QL("date") " format too long"); + } + return 1; +} + + +static int os_time (lua_State *L) { + time_t t; + if (lua_isnoneornil(L, 1)) /* called without args? */ + t = time(NULL); /* get current time */ + else { + struct tm ts; + luaL_checktype(L, 1, LUA_TTABLE); + lua_settop(L, 1); /* make sure table is at the top */ + ts.tm_sec = getfield(L, "sec", 0); + ts.tm_min = getfield(L, "min", 0); + ts.tm_hour = getfield(L, "hour", 12); + ts.tm_mday = getfield(L, "day", -1); + ts.tm_mon = getfield(L, "month", -1) - 1; + ts.tm_year = getfield(L, "year", -1) - 1900; + ts.tm_isdst = getboolfield(L, "isdst"); + t = mktime(&ts); + } + if (t == (time_t)(-1)) + lua_pushnil(L); + else + lua_pushnumber(L, (lua_Number)t); + return 1; +} + + +static int os_difftime (lua_State *L) { + lua_pushnumber(L, difftime((time_t)(luaL_checknumber(L, 1)), + (time_t)(luaL_optnumber(L, 2, 0)))); + return 1; +} + +/* }====================================================== */ + + +static int os_setlocale (lua_State *L) { + static const int cat[] = {LC_ALL, LC_COLLATE, LC_CTYPE, LC_MONETARY, + LC_NUMERIC, LC_TIME}; + static const char *const catnames[] = {"all", "collate", "ctype", "monetary", + "numeric", "time", NULL}; + const char *l = lua_tostring(L, 1); + int op = luaL_checkoption(L, 2, "all", catnames); + luaL_argcheck(L, l || lua_isnoneornil(L, 1), 1, "string expected"); + lua_pushstring(L, setlocale(cat[op], l)); + return 1; +} + + +static int os_exit (lua_State *L) { + exit(luaL_optint(L, 1, EXIT_SUCCESS)); + return 0; /* to avoid warnings */ +} + +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} +}; + +/* }====================================================== */ + + + +LUALIB_API int luaopen_os (lua_State *L) { + luaL_register(L, LUA_OSLIBNAME, syslib); + return 1; +} + diff --git a/ref/lua-5.1/src/lparser.c b/ref/lua-5.1/src/lparser.c new file mode 100644 index 0000000..b40ee79 --- /dev/null +++ b/ref/lua-5.1/src/lparser.c @@ -0,0 +1,1336 @@ +/* +** $Id: lparser.c,v 2.40 2005/12/22 16:19:56 roberto Exp $ +** Lua Parser +** See Copyright Notice in lua.h +*/ + + +#include + +#define lparser_c +#define LUA_CORE + +#include "lua.h" + +#include "lcode.h" +#include "ldebug.h" +#include "ldo.h" +#include "lfunc.h" +#include "llex.h" +#include "lmem.h" +#include "lobject.h" +#include "lopcodes.h" +#include "lparser.h" +#include "lstate.h" +#include "lstring.h" + + + + +#define hasmultret(k) ((k) == VCALL || (k) == VVARARG) + +#define getlocvar(fs, i) ((fs)->f->locvars[(fs)->actvar[i]]) + +#define luaY_checklimit(fs,v,l,m) if ((v)>(l)) errorlimit(fs,l,m) + + +/* +** nodes for block list (list of active blocks) +*/ +typedef struct BlockCnt { + struct BlockCnt *previous; /* chain */ + int breaklist; /* list of jumps out of this loop */ + lu_byte nactvar; /* # active locals outside the breakable structure */ + lu_byte upval; /* true if some variable in the block is an upvalue */ + lu_byte isbreakable; /* true if `block' is a loop */ +} BlockCnt; + + + +/* +** prototypes for recursive non-terminal functions +*/ +static void chunk (LexState *ls); +static void expr (LexState *ls, expdesc *v); + + +static void anchor_token (LexState *ls) { + if (ls->t.token == TK_NAME || ls->t.token == TK_STRING) { + TString *ts = ls->t.seminfo.ts; + luaX_newstring(ls, getstr(ts), ts->tsv.len); + } +} + + +static void error_expected (LexState *ls, int token) { + luaX_syntaxerror(ls, + luaO_pushfstring(ls->L, LUA_QS " expected", luaX_token2str(ls, token))); +} + + +static void errorlimit (FuncState *fs, int limit, const char *what) { + const char *msg = (fs->f->linedefined == 0) ? + luaO_pushfstring(fs->L, "main function has more than %d %s", limit, what) : + luaO_pushfstring(fs->L, "function at line %d has more than %d %s", + fs->f->linedefined, limit, what); + luaX_lexerror(fs->ls, msg, 0); +} + + +static int testnext (LexState *ls, int c) { + if (ls->t.token == c) { + luaX_next(ls); + return 1; + } + else return 0; +} + + +static void check (LexState *ls, int c) { + if (ls->t.token != c) + error_expected(ls, c); +} + +static void checknext (LexState *ls, int c) { + check(ls, c); + luaX_next(ls); +} + + +#define check_condition(ls,c,msg) { if (!(c)) luaX_syntaxerror(ls, msg); } + + + +static void check_match (LexState *ls, int what, int who, int where) { + if (!testnext(ls, what)) { + if (where == ls->linenumber) + error_expected(ls, what); + else { + luaX_syntaxerror(ls, luaO_pushfstring(ls->L, + LUA_QS " expected (to close " LUA_QS " 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.s.info = i; +} + + +static void codestring (LexState *ls, expdesc *e, TString *s) { + init_exp(e, VK, luaK_stringK(ls->fs, s)); +} + + +static void checkname(LexState *ls, expdesc *e) { + codestring(ls, e, str_checkname(ls)); +} + + +static int registerlocalvar (LexState *ls, TString *varname) { + FuncState *fs = ls->fs; + Proto *f = fs->f; + int oldsize = f->sizelocvars; + luaM_growvector(ls->L, f->locvars, fs->nlocvars, f->sizelocvars, + LocVar, SHRT_MAX, "too many local variables"); + while (oldsize < f->sizelocvars) f->locvars[oldsize++].varname = NULL; + f->locvars[fs->nlocvars].varname = varname; + luaC_objbarrier(ls->L, f, varname); + return fs->nlocvars++; +} + + +#define new_localvarliteral(ls,v,n) \ + new_localvar(ls, luaX_newstring(ls, "" v, (sizeof(v)/sizeof(char))-1), n) + + +static void new_localvar (LexState *ls, TString *name, int n) { + FuncState *fs = ls->fs; + luaY_checklimit(fs, fs->nactvar+n+1, LUAI_MAXVARS, "local variables"); + fs->actvar[fs->nactvar+n] = cast(unsigned short, registerlocalvar(ls, name)); +} + + +static void adjustlocalvars (LexState *ls, int nvars) { + FuncState *fs = ls->fs; + fs->nactvar = cast_byte(fs->nactvar + nvars); + for (; nvars; nvars--) { + getlocvar(fs, fs->nactvar - nvars).startpc = fs->pc; + } +} + + +static void removevars (LexState *ls, int tolevel) { + FuncState *fs = ls->fs; + while (fs->nactvar > tolevel) + getlocvar(fs, --fs->nactvar).endpc = fs->pc; +} + + +static int indexupvalue (FuncState *fs, TString *name, expdesc *v) { + int i; + Proto *f = fs->f; + int oldsize = f->sizeupvalues; + for (i=0; inups; i++) { + if (fs->upvalues[i].k == v->k && fs->upvalues[i].info == v->u.s.info) { + lua_assert(f->upvalues[i] == name); + return i; + } + } + /* new one */ + luaY_checklimit(fs, f->nups + 1, LUAI_MAXUPVALUES, "upvalues"); + luaM_growvector(fs->L, f->upvalues, f->nups, f->sizeupvalues, + TString *, MAX_INT, ""); + while (oldsize < f->sizeupvalues) f->upvalues[oldsize++] = NULL; + f->upvalues[f->nups] = name; + luaC_objbarrier(fs->L, f, name); + lua_assert(v->k == VLOCAL || v->k == VUPVAL); + fs->upvalues[f->nups].k = cast_byte(v->k); + fs->upvalues[f->nups].info = cast_byte(v->u.s.info); + return f->nups++; +} + + +static int searchvar (FuncState *fs, TString *n) { + int i; + for (i=fs->nactvar-1; i >= 0; i--) { + if (n == getlocvar(fs, i).varname) + return i; + } + return -1; /* not found */ +} + + +static void markupval (FuncState *fs, int level) { + BlockCnt *bl = fs->bl; + while (bl && bl->nactvar > level) bl = bl->previous; + if (bl) bl->upval = 1; +} + + +static int singlevaraux (FuncState *fs, TString *n, expdesc *var, int base) { + if (fs == NULL) { /* no more levels? */ + init_exp(var, VGLOBAL, NO_REG); /* default is global variable */ + return VGLOBAL; + } + else { + int v = searchvar(fs, n); /* look up at current level */ + if (v >= 0) { + init_exp(var, VLOCAL, v); + if (!base) + markupval(fs, v); /* local will be used as an upval */ + return VLOCAL; + } + else { /* not found at current level; try upper one */ + if (singlevaraux(fs->prev, n, var, 0) == VGLOBAL) + return VGLOBAL; + var->u.s.info = indexupvalue(fs, n, var); /* else was LOCAL or UPVAL */ + var->k = VUPVAL; /* upvalue in this level */ + return VUPVAL; + } + } +} + + +static void singlevar (LexState *ls, expdesc *var) { + TString *varname = str_checkname(ls); + FuncState *fs = ls->fs; + if (singlevaraux(fs, varname, var, 1) == VGLOBAL) + var->u.s.info = luaK_stringK(fs, varname); /* info points to global name */ +} + + +static void adjust_assign (LexState *ls, int nvars, int nexps, expdesc *e) { + FuncState *fs = ls->fs; + int extra = nvars - nexps; + if (hasmultret(e->k)) { + extra++; /* includes call itself */ + if (extra < 0) extra = 0; + luaK_setreturns(fs, e, extra); /* last exp. provides the difference */ + if (extra > 1) luaK_reserveregs(fs, extra-1); + } + else { + if (e->k != VVOID) luaK_exp2nextreg(fs, e); /* close last expression */ + if (extra > 0) { + int reg = fs->freereg; + luaK_reserveregs(fs, extra); + luaK_nil(fs, reg, extra); + } + } +} + + +static void enterlevel (LexState *ls) { + if (++ls->L->nCcalls > LUAI_MAXCCALLS) + luaX_lexerror(ls, "chunk has too many syntax levels", 0); +} + + +#define leavelevel(ls) ((ls)->L->nCcalls--) + + +static void enterblock (FuncState *fs, BlockCnt *bl, lu_byte isbreakable) { + bl->breaklist = NO_JUMP; + bl->isbreakable = isbreakable; + bl->nactvar = fs->nactvar; + bl->upval = 0; + bl->previous = fs->bl; + fs->bl = bl; + lua_assert(fs->freereg == fs->nactvar); +} + + +static void leaveblock (FuncState *fs) { + BlockCnt *bl = fs->bl; + fs->bl = bl->previous; + removevars(fs->ls, bl->nactvar); + if (bl->upval) + luaK_codeABC(fs, OP_CLOSE, bl->nactvar, 0, 0); + lua_assert(!bl->isbreakable || !bl->upval); /* loops have no body */ + lua_assert(bl->nactvar == fs->nactvar); + fs->freereg = fs->nactvar; /* free registers */ + luaK_patchtohere(fs, bl->breaklist); +} + + +static void pushclosure (LexState *ls, FuncState *func, expdesc *v) { + FuncState *fs = ls->fs; + Proto *f = fs->f; + int oldsize = f->sizep; + int i; + luaM_growvector(ls->L, f->p, fs->np, f->sizep, Proto *, + MAXARG_Bx, "constant table overflow"); + while (oldsize < f->sizep) f->p[oldsize++] = NULL; + f->p[fs->np++] = func->f; + luaC_objbarrier(ls->L, f, func->f); + init_exp(v, VRELOCABLE, luaK_codeABx(fs, OP_CLOSURE, 0, fs->np-1)); + for (i=0; if->nups; i++) { + OpCode o = (func->upvalues[i].k == VLOCAL) ? OP_MOVE : OP_GETUPVAL; + luaK_codeABC(fs, o, 0, func->upvalues[i].info, 0); + } +} + + +static void open_func (LexState *ls, FuncState *fs) { + lua_State *L = ls->L; + Proto *f = luaF_newproto(L); + fs->f = f; + fs->prev = ls->fs; /* linked list of funcstates */ + fs->ls = ls; + fs->L = L; + ls->fs = fs; + fs->pc = 0; + fs->lasttarget = -1; + fs->jpc = NO_JUMP; + fs->freereg = 0; + fs->nk = 0; + fs->np = 0; + fs->nlocvars = 0; + fs->nactvar = 0; + fs->bl = NULL; + f->source = ls->source; + f->maxstacksize = 2; /* registers 0/1 are always valid */ + fs->h = luaH_new(L, 0, 0); + /* anchor table of constants and prototype (to avoid being collected) */ + sethvalue2s(L, L->top, fs->h); + incr_top(L); + setptvalue2s(L, L->top, f); + incr_top(L); +} + + +static void close_func (LexState *ls) { + lua_State *L = ls->L; + FuncState *fs = ls->fs; + Proto *f = fs->f; + removevars(ls, 0); + luaK_ret(fs, 0, 0); /* final return */ + luaM_reallocvector(L, f->code, f->sizecode, fs->pc, Instruction); + f->sizecode = fs->pc; + luaM_reallocvector(L, f->lineinfo, f->sizelineinfo, fs->pc, int); + f->sizelineinfo = fs->pc; + luaM_reallocvector(L, f->k, f->sizek, fs->nk, TValue); + f->sizek = fs->nk; + luaM_reallocvector(L, f->p, f->sizep, fs->np, Proto *); + f->sizep = fs->np; + luaM_reallocvector(L, f->locvars, f->sizelocvars, fs->nlocvars, LocVar); + f->sizelocvars = fs->nlocvars; + luaM_reallocvector(L, f->upvalues, f->sizeupvalues, f->nups, TString *); + f->sizeupvalues = f->nups; + lua_assert(luaG_checkcode(f)); + lua_assert(fs->bl == NULL); + ls->fs = fs->prev; + L->top -= 2; /* remove table and prototype from the stack */ + /* last token read was anchored in defunct function; must reanchor it */ + if (fs) anchor_token(ls); +} + + +Proto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, const char *name) { + struct LexState lexstate; + struct FuncState funcstate; + lexstate.buff = buff; + luaX_setinput(L, &lexstate, z, luaS_new(L, name)); + open_func(&lexstate, &funcstate); + funcstate.f->is_vararg = VARARG_ISVARARG; /* main func. is always vararg */ + luaX_next(&lexstate); /* read first token */ + chunk(&lexstate); + check(&lexstate, TK_EOS); + close_func(&lexstate); + lua_assert(funcstate.prev == NULL); + lua_assert(funcstate.f->nups == 0); + lua_assert(lexstate.fs == NULL); + return funcstate.f; +} + + + +/*============================================================*/ +/* GRAMMAR RULES */ +/*============================================================*/ + + +static void field (LexState *ls, expdesc *v) { + /* field -> ['.' | ':'] NAME */ + FuncState *fs = ls->fs; + expdesc key; + luaK_exp2anyreg(fs, v); + luaX_next(ls); /* skip the dot or colon */ + checkname(ls, &key); + luaK_indexed(fs, v, &key); +} + + +static void yindex (LexState *ls, expdesc *v) { + /* index -> '[' expr ']' */ + luaX_next(ls); /* skip the '[' */ + expr(ls, v); + luaK_exp2val(ls->fs, v); + checknext(ls, ']'); +} + + +/* +** {====================================================================== +** Rules for Constructors +** ======================================================================= +*/ + + +struct ConsControl { + expdesc v; /* last list item read */ + expdesc *t; /* table descriptor */ + int nh; /* total number of `record' elements */ + int na; /* total number of array elements */ + int tostore; /* number of array elements pending to be stored */ +}; + + +static void recfield (LexState *ls, struct ConsControl *cc) { + /* recfield -> (NAME | `['exp1`]') = exp1 */ + FuncState *fs = ls->fs; + int reg = ls->fs->freereg; + expdesc key, val; + if (ls->t.token == TK_NAME) { + luaY_checklimit(fs, cc->nh, MAX_INT, "items in a constructor"); + checkname(ls, &key); + } + else /* ls->t.token == '[' */ + yindex(ls, &key); + cc->nh++; + checknext(ls, '='); + luaK_exp2RK(fs, &key); + expr(ls, &val); + luaK_codeABC(fs, OP_SETTABLE, cc->t->u.s.info, luaK_exp2RK(fs, &key), + luaK_exp2RK(fs, &val)); + fs->freereg = reg; /* free registers */ +} + + +static void closelistfield (FuncState *fs, struct ConsControl *cc) { + if (cc->v.k == VVOID) return; /* there is no list item */ + luaK_exp2nextreg(fs, &cc->v); + cc->v.k = VVOID; + if (cc->tostore == LFIELDS_PER_FLUSH) { + luaK_setlist(fs, cc->t->u.s.info, cc->na, cc->tostore); /* flush */ + cc->tostore = 0; /* no more items pending */ + } +} + + +static void lastlistfield (FuncState *fs, struct ConsControl *cc) { + if (cc->tostore == 0) return; + if (hasmultret(cc->v.k)) { + luaK_setmultret(fs, &cc->v); + luaK_setlist(fs, cc->t->u.s.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.s.info, cc->na, cc->tostore); + } +} + + +static void listfield (LexState *ls, struct ConsControl *cc) { + expr(ls, &cc->v); + luaY_checklimit(ls->fs, cc->na, MAXARG_Bx, "items in a constructor"); + cc->na++; + cc->tostore++; +} + + +static void constructor (LexState *ls, expdesc *t) { + /* constructor -> ?? */ + FuncState *fs = ls->fs; + int line = ls->linenumber; + int pc = luaK_codeABC(fs, OP_NEWTABLE, 0, 0, 0); + struct ConsControl cc; + cc.na = cc.nh = cc.tostore = 0; + cc.t = t; + init_exp(t, VRELOCABLE, pc); + init_exp(&cc.v, VVOID, 0); /* no value (yet) */ + luaK_exp2nextreg(ls->fs, t); /* fix it at stack top (for gc) */ + checknext(ls, '{'); + do { + lua_assert(cc.v.k == VVOID || cc.tostore > 0); + if (ls->t.token == '}') break; + closelistfield(fs, &cc); + switch(ls->t.token) { + case TK_NAME: { /* may be listfields or recfields */ + luaX_lookahead(ls); + if (ls->lookahead.token != '=') /* expression? */ + listfield(ls, &cc); + else + recfield(ls, &cc); + break; + } + case '[': { /* constructor_item -> recfield */ + recfield(ls, &cc); + break; + } + default: { /* constructor_part -> listfield */ + listfield(ls, &cc); + break; + } + } + } while (testnext(ls, ',') || testnext(ls, ';')); + check_match(ls, '}', '{', line); + lastlistfield(fs, &cc); + SETARG_B(fs->f->code[pc], luaO_int2fb(cc.na)); /* set initial array size */ + SETARG_C(fs->f->code[pc], luaO_int2fb(cc.nh)); /* set initial table size */ +} + +/* }====================================================================== */ + + + +static void parlist (LexState *ls) { + /* parlist -> [ param { `,' param } ] */ + FuncState *fs = ls->fs; + Proto *f = fs->f; + int nparams = 0; + f->is_vararg = 0; + if (ls->t.token != ')') { /* is `parlist' not empty? */ + do { + switch (ls->t.token) { + case TK_NAME: { /* param -> NAME */ + new_localvar(ls, str_checkname(ls), nparams++); + break; + } + case TK_DOTS: { /* param -> `...' */ + luaX_next(ls); +#if defined(LUA_COMPAT_VARARG) + /* use `arg' as default name */ + new_localvarliteral(ls, "arg", nparams++); + f->is_vararg = VARARG_HASARG | VARARG_NEEDSARG; +#endif + f->is_vararg |= VARARG_ISVARARG; + break; + } + default: luaX_syntaxerror(ls, " or " LUA_QL("...") " expected"); + } + } while (!f->is_vararg && testnext(ls, ',')); + } + adjustlocalvars(ls, nparams); + f->numparams = cast_byte(fs->nactvar - (f->is_vararg & VARARG_HASARG)); + luaK_reserveregs(fs, fs->nactvar); /* reserve register for parameters */ +} + + +static void body (LexState *ls, expdesc *e, int needself, int line) { + /* body -> `(' parlist `)' chunk END */ + FuncState new_fs; + open_func(ls, &new_fs); + new_fs.f->linedefined = line; + checknext(ls, '('); + if (needself) { + new_localvarliteral(ls, "self", 0); + adjustlocalvars(ls, 1); + } + parlist(ls); + checknext(ls, ')'); + chunk(ls); + new_fs.f->lastlinedefined = ls->linenumber; + check_match(ls, TK_END, TK_FUNCTION, line); + close_func(ls); + pushclosure(ls, &new_fs, e); +} + + +static int explist1 (LexState *ls, expdesc *v) { + /* explist1 -> 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) { + FuncState *fs = ls->fs; + expdesc args; + int base, nparams; + int line = ls->linenumber; + switch (ls->t.token) { + case '(': { /* funcargs -> `(' [ explist1 ] `)' */ + if (line != ls->lastline) + luaX_syntaxerror(ls,"ambiguous syntax (function call x new statement)"); + luaX_next(ls); + if (ls->t.token == ')') /* arg list is empty? */ + args.k = VVOID; + else { + explist1(ls, &args); + luaK_setmultret(fs, &args); + } + check_match(ls, ')', '(', line); + break; + } + case '{': { /* funcargs -> constructor */ + constructor(ls, &args); + break; + } + case TK_STRING: { /* funcargs -> STRING */ + codestring(ls, &args, ls->t.seminfo.ts); + luaX_next(ls); /* must use `seminfo' before `next' */ + break; + } + default: { + luaX_syntaxerror(ls, "function arguments expected"); + return; + } + } + lua_assert(f->k == VNONRELOC); + base = f->u.s.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 prefixexp (LexState *ls, expdesc *v) { + /* prefixexp -> 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"); + return; + } + } +} + + +static void primaryexp (LexState *ls, expdesc *v) { + /* primaryexp -> + prefixexp { `.' NAME | `[' exp `]' | `:' NAME funcargs | funcargs } */ + FuncState *fs = ls->fs; + prefixexp(ls, v); + for (;;) { + switch (ls->t.token) { + case '.': { /* field */ + field(ls, v); + break; + } + case '[': { /* `[' exp1 `]' */ + expdesc key; + luaK_exp2anyreg(fs, v); + yindex(ls, &key); + luaK_indexed(fs, v, &key); + break; + } + case ':': { /* `:' NAME funcargs */ + expdesc key; + luaX_next(ls); + checkname(ls, &key); + luaK_self(fs, v, &key); + funcargs(ls, v); + break; + } + case '(': case TK_STRING: case '{': { /* funcargs */ + luaK_exp2nextreg(fs, v); + funcargs(ls, v); + break; + } + default: return; + } + } +} + + +static void simpleexp (LexState *ls, expdesc *v) { + /* simpleexp -> NUMBER | STRING | NIL | true | false | ... | + constructor | FUNCTION body | primaryexp */ + switch (ls->t.token) { + case TK_NUMBER: { + init_exp(v, VKNUM, 0); + v->u.nval = ls->t.seminfo.r; + break; + } + case TK_STRING: { + codestring(ls, v, ls->t.seminfo.ts); + break; + } + case TK_NIL: { + init_exp(v, VNIL, 0); + break; + } + case TK_TRUE: { + init_exp(v, VTRUE, 0); + break; + } + case TK_FALSE: { + init_exp(v, VFALSE, 0); + break; + } + case TK_DOTS: { /* vararg */ + FuncState *fs = ls->fs; + check_condition(ls, fs->f->is_vararg, + "cannot use " LUA_QL("...") " outside a vararg function"); + fs->f->is_vararg &= ~VARARG_NEEDSARG; /* don't need 'arg' */ + init_exp(v, VVARARG, luaK_codeABC(fs, OP_VARARG, 0, 1, 0)); + break; + } + case '{': { /* constructor */ + constructor(ls, v); + return; + } + case TK_FUNCTION: { + luaX_next(ls); + body(ls, v, 0, ls->linenumber); + return; + } + default: { + primaryexp(ls, v); + return; + } + } + luaX_next(ls); +} + + +static UnOpr getunopr (int op) { + switch (op) { + case TK_NOT: return OPR_NOT; + case '-': return OPR_MINUS; + case '#': return OPR_LEN; + default: return OPR_NOUNOPR; + } +} + + +static BinOpr getbinopr (int op) { + switch (op) { + case '+': return OPR_ADD; + case '-': return OPR_SUB; + case '*': return OPR_MUL; + case '/': return OPR_DIV; + case '%': return OPR_MOD; + case '^': return OPR_POW; + case TK_CONCAT: return OPR_CONCAT; + case TK_NE: return OPR_NE; + case TK_EQ: return OPR_EQ; + case '<': return OPR_LT; + case TK_LE: return OPR_LE; + case '>': return OPR_GT; + case TK_GE: return OPR_GE; + case TK_AND: return OPR_AND; + case TK_OR: return OPR_OR; + default: return OPR_NOBINOPR; + } +} + + +static const struct { + lu_byte left; /* left priority for each binary operator */ + lu_byte right; /* right priority */ +} priority[] = { /* ORDER OPR */ + {6, 6}, {6, 6}, {7, 7}, {7, 7}, {7, 7}, /* `+' `-' `/' `%' */ + {10, 9}, {5, 4}, /* power and concat (right associative) */ + {3, 3}, {3, 3}, /* equality and inequality */ + {3, 3}, {3, 3}, {3, 3}, {3, 3}, /* order */ + {2, 2}, {1, 1} /* logical (and/or) */ +}; + +#define UNARY_PRIORITY 8 /* priority for unary operators */ + + +/* +** subexpr -> (simpleexp | unop subexpr) { binop subexpr } +** where `binop' is any binary operator with a priority higher than `limit' +*/ +static BinOpr subexpr (LexState *ls, expdesc *v, unsigned int limit) { + BinOpr op; + UnOpr uop; + enterlevel(ls); + uop = getunopr(ls->t.token); + if (uop != OPR_NOUNOPR) { + luaX_next(ls); + subexpr(ls, v, UNARY_PRIORITY); + luaK_prefix(ls->fs, uop, v); + } + 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; + luaX_next(ls); + luaK_infix(ls->fs, op, v); + /* read sub-expression with higher priority */ + nextop = subexpr(ls, &v2, priority[op].right); + luaK_posfix(ls->fs, op, v, &v2); + 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 int block_follow (int token) { + switch (token) { + case TK_ELSE: case TK_ELSEIF: case TK_END: + case TK_UNTIL: case TK_EOS: + return 1; + default: return 0; + } +} + + +static void block (LexState *ls) { + /* block -> chunk */ + FuncState *fs = ls->fs; + BlockCnt bl; + enterblock(fs, &bl, 0); + chunk(ls); + lua_assert(bl.breaklist == NO_JUMP); + 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 a local variable, the local variable +** is needed in a previous assignment (to a table). If so, save original +** 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) { + if (lh->v.k == VINDEXED) { + if (lh->v.u.s.info == v->u.s.info) { /* conflict? */ + conflict = 1; + lh->v.u.s.info = extra; /* previous assignment will use safe copy */ + } + if (lh->v.u.s.aux == v->u.s.info) { /* conflict? */ + conflict = 1; + lh->v.u.s.aux = extra; /* previous assignment will use safe copy */ + } + } + } + if (conflict) { + luaK_codeABC(fs, OP_MOVE, fs->freereg, v->u.s.info, 0); /* make copy */ + luaK_reserveregs(fs, 1); + } +} + + +static void assignment (LexState *ls, struct LHS_assign *lh, int nvars) { + expdesc e; + check_condition(ls, VLOCAL <= lh->v.k && lh->v.k <= VINDEXED, + "syntax error"); + if (testnext(ls, ',')) { /* assignment -> `,' primaryexp assignment */ + struct LHS_assign nv; + nv.prev = lh; + primaryexp(ls, &nv.v); + if (nv.v.k == VLOCAL) + check_conflict(ls, lh, &nv.v); + assignment(ls, &nv, nvars+1); + } + else { /* assignment -> `=' explist1 */ + int nexps; + checknext(ls, '='); + nexps = explist1(ls, &e); + if (nexps != nvars) { + adjust_assign(ls, nvars, nexps, &e); + if (nexps > nvars) + ls->fs->freereg -= nexps - nvars; /* remove extra values */ + } + else { + luaK_setoneret(ls->fs, &e); /* close last expression */ + luaK_storevar(ls->fs, &lh->v, &e); + return; /* avoid default */ + } + } + init_exp(&e, VNONRELOC, ls->fs->freereg-1); /* default assignment */ + luaK_storevar(ls->fs, &lh->v, &e); +} + + +static int cond (LexState *ls) { + /* cond -> exp */ + expdesc v; + expr(ls, &v); /* read condition */ + if (v.k == VNIL) v.k = VFALSE; /* `falses' are all equal here */ + luaK_goiftrue(ls->fs, &v); + return v.f; +} + + +static void breakstat (LexState *ls) { + FuncState *fs = ls->fs; + BlockCnt *bl = fs->bl; + int upval = 0; + while (bl && !bl->isbreakable) { + upval |= bl->upval; + bl = bl->previous; + } + if (!bl) + luaX_syntaxerror(ls, "no loop to break"); + if (upval) + luaK_codeABC(fs, OP_CLOSE, bl->nactvar, 0, 0); + luaK_concat(fs, &bl->breaklist, luaK_jump(fs)); +} + + +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_patchlist(fs, luaK_jump(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 */ + chunk(ls); + check_match(ls, TK_UNTIL, TK_REPEAT, line); + condexit = cond(ls); /* read condition (inside scope block) */ + if (!bl2.upval) { /* no upvalues? */ + leaveblock(fs); /* finish scope */ + luaK_patchlist(ls->fs, condexit, repeat_init); /* close the loop */ + } + else { /* complete semantics when there are upvalues */ + breakstat(ls); /* if condition then break */ + luaK_patchtohere(ls->fs, condexit); /* else... */ + leaveblock(fs); /* finish scope... */ + luaK_patchlist(ls->fs, luaK_jump(fs), repeat_init); /* and repeat */ + } + leaveblock(fs); /* finish loop */ +} + + +static int exp1 (LexState *ls) { + expdesc e; + int k; + expr(ls, &e); + k = e.k; + luaK_exp2nextreg(ls->fs, &e); + return k; +} + + +static void forbody (LexState *ls, int base, int line, int nvars, int isnum) { + /* forbody -> DO block */ + BlockCnt bl; + FuncState *fs = ls->fs; + int prep, endfor; + adjustlocalvars(ls, 3); /* control variables */ + checknext(ls, TK_DO); + prep = isnum ? luaK_codeAsBx(fs, OP_FORPREP, base, NO_JUMP) : luaK_jump(fs); + enterblock(fs, &bl, 0); /* scope for declared variables */ + adjustlocalvars(ls, nvars); + luaK_reserveregs(fs, nvars); + block(ls); + leaveblock(fs); /* end of scope for declared variables */ + luaK_patchtohere(fs, prep); + endfor = (isnum) ? luaK_codeAsBx(fs, OP_FORLOOP, base, NO_JUMP) : + luaK_codeABC(fs, OP_TFORLOOP, base, 0, nvars); + luaK_fixline(fs, line); /* pretend that `OP_FOR' starts the loop */ + luaK_patchlist(fs, (isnum ? endfor : luaK_jump(fs)), prep + 1); +} + + +static void fornum (LexState *ls, TString *varname, int line) { + /* fornum -> NAME = exp1,exp1[,exp1] forbody */ + FuncState *fs = ls->fs; + int base = fs->freereg; + new_localvarliteral(ls, "(for index)", 0); + new_localvarliteral(ls, "(for limit)", 1); + new_localvarliteral(ls, "(for step)", 2); + new_localvar(ls, varname, 3); + checknext(ls, '='); + exp1(ls); /* initial value */ + checknext(ls, ','); + exp1(ls); /* limit */ + if (testnext(ls, ',')) + exp1(ls); /* optional step */ + else { /* default step = 1 */ + luaK_codeABx(fs, OP_LOADK, fs->freereg, luaK_numberK(fs, 1)); + luaK_reserveregs(fs, 1); + } + forbody(ls, base, line, 1, 1); +} + + +static void forlist (LexState *ls, TString *indexname) { + /* forlist -> NAME {,NAME} IN explist1 forbody */ + FuncState *fs = ls->fs; + expdesc e; + int nvars = 0; + int line; + int base = fs->freereg; + /* create control variables */ + new_localvarliteral(ls, "(for generator)", nvars++); + new_localvarliteral(ls, "(for state)", nvars++); + new_localvarliteral(ls, "(for control)", nvars++); + /* create declared variables */ + new_localvar(ls, indexname, nvars++); + while (testnext(ls, ',')) + new_localvar(ls, str_checkname(ls), nvars++); + checknext(ls, TK_IN); + line = ls->linenumber; + adjust_assign(ls, 3, explist1(ls, &e), &e); + luaK_checkstack(fs, 3); /* extra space to call generator */ + forbody(ls, base, line, nvars - 3, 0); +} + + +static void forstat (LexState *ls, int line) { + /* forstat -> FOR (fornum | forlist) END */ + FuncState *fs = ls->fs; + TString *varname; + BlockCnt bl; + enterblock(fs, &bl, 1); /* scope for loop and control variables */ + luaX_next(ls); /* skip `for' */ + varname = str_checkname(ls); /* first variable name */ + switch (ls->t.token) { + case '=': fornum(ls, varname, line); break; + case ',': case TK_IN: forlist(ls, varname); break; + default: luaX_syntaxerror(ls, LUA_QL("=") " or " LUA_QL("in") " expected"); + } + check_match(ls, TK_END, TK_FOR, line); + leaveblock(fs); /* loop scope (`break' jumps to this point) */ +} + + +static int test_then_block (LexState *ls) { + /* test_then_block -> [IF | ELSEIF] cond THEN block */ + int condexit; + luaX_next(ls); /* skip IF or ELSEIF */ + condexit = cond(ls); + checknext(ls, TK_THEN); + block(ls); /* `then' part */ + return condexit; +} + + +static void ifstat (LexState *ls, int line) { + /* ifstat -> IF cond THEN block {ELSEIF cond THEN block} [ELSE block] END */ + FuncState *fs = ls->fs; + int flist; + int escapelist = NO_JUMP; + flist = test_then_block(ls); /* IF cond THEN block */ + while (ls->t.token == TK_ELSEIF) { + luaK_concat(fs, &escapelist, luaK_jump(fs)); + luaK_patchtohere(fs, flist); + flist = test_then_block(ls); /* ELSEIF cond THEN block */ + } + if (ls->t.token == TK_ELSE) { + luaK_concat(fs, &escapelist, luaK_jump(fs)); + luaK_patchtohere(fs, flist); + luaX_next(ls); /* skip ELSE (after patch, for correct line info) */ + block(ls); /* `else' part */ + } + else + luaK_concat(fs, &escapelist, flist); + luaK_patchtohere(fs, escapelist); + check_match(ls, TK_END, TK_IF, line); +} + + +static void localfunc (LexState *ls) { + expdesc v, b; + FuncState *fs = ls->fs; + new_localvar(ls, str_checkname(ls), 0); + init_exp(&v, VLOCAL, fs->freereg); + luaK_reserveregs(fs, 1); + adjustlocalvars(ls, 1); + body(ls, &b, 0, ls->linenumber); + luaK_storevar(fs, &v, &b); + /* debug information will only see the variable after this point! */ + getlocvar(fs, fs->nactvar - 1).startpc = fs->pc; +} + + +static void localstat (LexState *ls) { + /* stat -> LOCAL NAME {`,' NAME} [`=' explist1] */ + int nvars = 0; + int nexps; + expdesc e; + do { + new_localvar(ls, str_checkname(ls), nvars++); + } while (testnext(ls, ',')); + if (testnext(ls, '=')) + nexps = explist1(ls, &e); + else { + e.k = VVOID; + nexps = 0; + } + adjust_assign(ls, nvars, nexps, &e); + adjustlocalvars(ls, nvars); +} + + +static int funcname (LexState *ls, expdesc *v) { + /* funcname -> NAME {field} [`:' NAME] */ + int needself = 0; + singlevar(ls, v); + while (ls->t.token == '.') + field(ls, v); + if (ls->t.token == ':') { + needself = 1; + field(ls, v); + } + return needself; +} + + +static void funcstat (LexState *ls, int line) { + /* funcstat -> FUNCTION funcname body */ + int needself; + expdesc v, b; + luaX_next(ls); /* skip FUNCTION */ + needself = funcname(ls, &v); + body(ls, &b, needself, line); + luaK_storevar(ls->fs, &v, &b); + luaK_fixline(ls->fs, line); /* definition `happens' in the first line */ +} + + +static void exprstat (LexState *ls) { + /* stat -> func | assignment */ + FuncState *fs = ls->fs; + struct LHS_assign v; + primaryexp(ls, &v.v); + if (v.v.k == VCALL) /* stat -> func */ + SETARG_C(getcode(fs, &v.v), 1); /* call statement uses no results */ + else { /* stat -> assignment */ + v.prev = NULL; + assignment(ls, &v, 1); + } +} + + +static void retstat (LexState *ls) { + /* stat -> RETURN explist */ + FuncState *fs = ls->fs; + expdesc e; + int first, nret; /* registers with returned values */ + luaX_next(ls); /* skip RETURN */ + if (block_follow(ls->t.token) || ls->t.token == ';') + first = nret = 0; /* return no values */ + else { + nret = explist1(ls, &e); /* optional return values */ + if (hasmultret(e.k)) { + luaK_setmultret(fs, &e); + if (e.k == VCALL && nret == 1) { /* tail call? */ + SET_OPCODE(getcode(fs,&e), OP_TAILCALL); + lua_assert(GETARG_A(getcode(fs,&e)) == fs->nactvar); + } + first = fs->nactvar; + nret = LUA_MULTRET; /* return all values */ + } + else { + if (nret == 1) /* only one single value? */ + first = luaK_exp2anyreg(fs, &e); + else { + luaK_exp2nextreg(fs, &e); /* values must go to the `stack' */ + first = fs->nactvar; /* return all `active' values */ + lua_assert(nret == fs->freereg - first); + } + } + } + luaK_ret(fs, first, nret); +} + + +static int statement (LexState *ls) { + int line = ls->linenumber; /* may be needed for error messages */ + switch (ls->t.token) { + case TK_IF: { /* stat -> ifstat */ + ifstat(ls, line); + return 0; + } + case TK_WHILE: { /* stat -> whilestat */ + whilestat(ls, line); + return 0; + } + case TK_DO: { /* stat -> DO block END */ + luaX_next(ls); /* skip DO */ + block(ls); + check_match(ls, TK_END, TK_DO, line); + return 0; + } + case TK_FOR: { /* stat -> forstat */ + forstat(ls, line); + return 0; + } + case TK_REPEAT: { /* stat -> repeatstat */ + repeatstat(ls, line); + return 0; + } + case TK_FUNCTION: { + funcstat(ls, line); /* stat -> funcstat */ + return 0; + } + case TK_LOCAL: { /* stat -> localstat */ + luaX_next(ls); /* skip LOCAL */ + if (testnext(ls, TK_FUNCTION)) /* local function? */ + localfunc(ls); + else + localstat(ls); + return 0; + } + case TK_RETURN: { /* stat -> retstat */ + retstat(ls); + return 1; /* must be last statement */ + } + case TK_BREAK: { /* stat -> breakstat */ + luaX_next(ls); /* skip BREAK */ + breakstat(ls); + return 1; /* must be last statement */ + } + default: { + exprstat(ls); + return 0; /* to avoid warnings */ + } + } +} + + +static void chunk (LexState *ls) { + /* chunk -> { stat [`;'] } */ + int islast = 0; + enterlevel(ls); + while (!islast && !block_follow(ls->t.token)) { + islast = statement(ls); + testnext(ls, ';'); + lua_assert(ls->fs->f->maxstacksize >= ls->fs->freereg && + ls->fs->freereg >= ls->fs->nactvar); + ls->fs->freereg = ls->fs->nactvar; /* free registers */ + } + leavelevel(ls); +} + +/* }====================================================================== */ diff --git a/ref/lua-5.1/src/lparser.h b/ref/lua-5.1/src/lparser.h new file mode 100644 index 0000000..d5e6e81 --- /dev/null +++ b/ref/lua-5.1/src/lparser.h @@ -0,0 +1,83 @@ +/* +** $Id: lparser.h,v 1.56 2005/10/03 14:02:40 roberto Exp $ +** Lua Parser +** See Copyright Notice in lua.h +*/ + +#ifndef lparser_h +#define lparser_h + +#include "llimits.h" +#include "lobject.h" +#include "ltable.h" +#include "lzio.h" + + +/* +** Expression descriptor +*/ + +typedef enum { + VVOID, /* no value */ + VNIL, + VTRUE, + VFALSE, + VK, /* info = index of constant in `k' */ + VKNUM, /* nval = numerical value */ + VLOCAL, /* info = local register */ + VUPVAL, /* info = index of upvalue in `upvalues' */ + VGLOBAL, /* info = index of table; aux = index of global name in `k' */ + VINDEXED, /* info = table register; aux = index register (or `k') */ + VJMP, /* info = instruction pc */ + VRELOCABLE, /* info = instruction pc */ + VNONRELOC, /* info = result register */ + VCALL, /* info = instruction pc */ + VVARARG /* info = instruction pc */ +} expkind; + +typedef struct expdesc { + expkind k; + union { + struct { int info, aux; } s; + lua_Number nval; + } u; + int t; /* patch list of `exit when true' */ + int f; /* patch list of `exit when false' */ +} expdesc; + + +typedef struct upvaldesc { + lu_byte k; + lu_byte info; +} upvaldesc; + + +struct BlockCnt; /* defined in lparser.c */ + + +/* state needed to generate code for a given function */ +typedef struct FuncState { + Proto *f; /* current function header */ + Table *h; /* table to find (and reuse) elements in `k' */ + struct FuncState *prev; /* enclosing function */ + struct LexState *ls; /* lexical state */ + struct lua_State *L; /* copy of the Lua state */ + struct BlockCnt *bl; /* chain of current blocks */ + int pc; /* next position to code (equivalent to `ncode') */ + int lasttarget; /* `pc' of last `jump target' */ + int jpc; /* list of pending jumps to `pc' */ + int freereg; /* first free register */ + int nk; /* number of elements in `k' */ + int np; /* number of elements in `p' */ + short nlocvars; /* number of elements in `locvars' */ + lu_byte nactvar; /* number of active local variables */ + upvaldesc upvalues[LUAI_MAXUPVALUES]; /* upvalues */ + unsigned short actvar[LUAI_MAXVARS]; /* declared-variable stack */ +} FuncState; + + +LUAI_FUNC Proto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, + const char *name); + + +#endif diff --git a/ref/lua-5.1/src/lstate.c b/ref/lua-5.1/src/lstate.c new file mode 100644 index 0000000..77e93fb --- /dev/null +++ b/ref/lua-5.1/src/lstate.c @@ -0,0 +1,214 @@ +/* +** $Id: lstate.c,v 2.35 2005/10/06 20:46:25 roberto Exp $ +** Global State +** See Copyright Notice in lua.h +*/ + + +#include + +#define lstate_c +#define LUA_CORE + +#include "lua.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" + + +#define state_size(x) (sizeof(x) + LUAI_EXTRASPACE) +#define fromstate(l) (cast(lu_byte *, (l)) - LUAI_EXTRASPACE) +#define tostate(l) (cast(lua_State *, cast(lu_byte *, l) + LUAI_EXTRASPACE)) + + +/* +** Main thread combines a thread state and the global state +*/ +typedef struct LG { + lua_State l; + global_State g; +} LG; + + + +static void stack_init (lua_State *L1, lua_State *L) { + /* initialize CallInfo array */ + L1->base_ci = luaM_newvector(L, BASIC_CI_SIZE, CallInfo); + L1->ci = L1->base_ci; + L1->size_ci = BASIC_CI_SIZE; + L1->end_ci = L1->base_ci + L1->size_ci - 1; + /* initialize stack array */ + L1->stack = luaM_newvector(L, BASIC_STACK_SIZE + EXTRA_STACK, TValue); + L1->stacksize = BASIC_STACK_SIZE + EXTRA_STACK; + L1->top = L1->stack; + L1->stack_last = L1->stack+(L1->stacksize - EXTRA_STACK)-1; + /* initialize first ci */ + L1->ci->func = L1->top; + setnilvalue(L1->top++); /* `function' entry for this `ci' */ + L1->base = L1->ci->base = L1->top; + L1->ci->top = L1->top + LUA_MINSTACK; +} + + +static void freestack (lua_State *L, lua_State *L1) { + luaM_freearray(L, L1->base_ci, L1->size_ci, CallInfo); + luaM_freearray(L, L1->stack, L1->stacksize, TValue); +} + + +/* +** open parts 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 */ + sethvalue(L, gt(L), luaH_new(L, 0, 2)); /* table of globals */ + sethvalue(L, registry(L), luaH_new(L, 0, 2)); /* registry */ + luaS_resize(L, MINSTRTABSIZE); /* initial size of string table */ + luaT_init(L); + luaX_init(L); + luaS_fix(luaS_newliteral(L, MEMERRMSG)); + g->GCthreshold = 4*g->totalbytes; +} + + +static void preinit_state (lua_State *L, global_State *g) { + G(L) = g; + L->stack = NULL; + L->stacksize = 0; + L->errorJmp = NULL; + L->hook = NULL; + L->hookmask = 0; + L->basehookcount = 0; + L->allowhook = 1; + resethookcount(L); + L->openupval = NULL; + L->size_ci = 0; + L->nCcalls = 0; + L->status = 0; + L->base_ci = L->ci = NULL; + L->savedpc = NULL; + L->errfunc = 0; + setnilvalue(gt(L)); +} + + +static void close_state (lua_State *L) { + global_State *g = G(L); + luaF_close(L, L->stack); /* close all upvalues for this thread */ + luaC_freeall(L); /* collect all objects */ + lua_assert(g->rootgc == obj2gco(L)); + lua_assert(g->strt.nuse == 0); + luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size, TString *); + luaZ_freebuffer(L, &g->buff); + freestack(L, L); + lua_assert(g->totalbytes == sizeof(LG)); + (*g->frealloc)(g->ud, fromstate(L), state_size(LG), 0); +} + + +lua_State *luaE_newthread (lua_State *L) { + lua_State *L1 = tostate(luaM_malloc(L, state_size(lua_State))); + luaC_link(L, obj2gco(L1), LUA_TTHREAD); + preinit_state(L1, G(L)); + stack_init(L1, L); /* init stack */ + setobj2n(L, gt(L1), gt(L)); /* share table of globals */ + L1->hookmask = L->hookmask; + L1->basehookcount = L->basehookcount; + L1->hook = L->hook; + resethookcount(L1); + lua_assert(iswhite(obj2gco(L1))); + return L1; +} + + +void luaE_freethread (lua_State *L, lua_State *L1) { + luaF_close(L1, L1->stack); /* close all upvalues for this thread */ + lua_assert(L1->openupval == NULL); + luai_userstatefree(L1); + freestack(L, L1); + luaM_freemem(L, fromstate(L1), state_size(lua_State)); +} + + +LUA_API lua_State *lua_newstate (lua_Alloc f, void *ud) { + int i; + lua_State *L; + global_State *g; + void *l = (*f)(ud, NULL, 0, state_size(LG)); + if (l == NULL) return NULL; + L = tostate(l); + g = &((LG *)L)->g; + L->next = NULL; + L->tt = LUA_TTHREAD; + g->currentwhite = bit2mask(WHITE0BIT, FIXEDBIT); + L->marked = luaC_white(g); + set2bits(L->marked, FIXEDBIT, SFIXEDBIT); + preinit_state(L, g); + g->frealloc = f; + g->ud = ud; + g->mainthread = L; + g->uvhead.u.l.prev = &g->uvhead; + g->uvhead.u.l.next = &g->uvhead; + g->GCthreshold = 0; /* mark it as unfinished state */ + g->strt.size = 0; + g->strt.nuse = 0; + g->strt.hash = NULL; + setnilvalue(registry(L)); + luaZ_initbuffer(L, &g->buff); + g->panic = NULL; + g->gcstate = GCSpause; + g->rootgc = obj2gco(L); + g->sweepstrgc = 0; + g->sweepgc = &g->rootgc; + g->gray = NULL; + g->grayagain = NULL; + g->weak = NULL; + g->tmudata = NULL; + g->totalbytes = sizeof(LG); + g->gcpause = LUAI_GCPAUSE; + g->gcstepmul = LUAI_GCMUL; + g->gcdept = 0; + for (i=0; imt[i] = NULL; + if (luaD_rawrunprotected(L, f_luaopen, NULL) != 0) { + /* memory allocation error: free partial state */ + close_state(L); + L = NULL; + } + else + luai_userstateopen(L); + return L; +} + + +static void callallgcTM (lua_State *L, void *ud) { + UNUSED(ud); + luaC_callGCTM(L); /* call GC metamethods for all udata */ +} + + +LUA_API void lua_close (lua_State *L) { + L = G(L)->mainthread; /* only the main thread can be closed */ + luai_userstateclose(L); + lua_lock(L); + luaF_close(L, L->stack); /* close all upvalues for this thread */ + luaC_separateudata(L, 1); /* separate udata that have GC metamethods */ + L->errfunc = 0; /* no error function during GC metamethods */ + do { /* repeat until no more errors */ + L->ci = L->base_ci; + L->base = L->top = L->ci->base; + L->nCcalls = 0; + } while (luaD_rawrunprotected(L, callallgcTM, NULL) != 0); + lua_assert(G(L)->tmudata == NULL); + close_state(L); +} + diff --git a/ref/lua-5.1/src/lstate.h b/ref/lua-5.1/src/lstate.h new file mode 100644 index 0000000..d296a4c --- /dev/null +++ b/ref/lua-5.1/src/lstate.h @@ -0,0 +1,168 @@ +/* +** $Id: lstate.h,v 2.24 2006/02/06 18:27:59 roberto Exp $ +** Global State +** See Copyright Notice in lua.h +*/ + +#ifndef lstate_h +#define lstate_h + +#include "lua.h" + +#include "lobject.h" +#include "ltm.h" +#include "lzio.h" + + + +struct lua_longjmp; /* defined in ldo.c */ + + +/* table of globals */ +#define gt(L) (&L->l_gt) + +/* registry */ +#define registry(L) (&G(L)->l_registry) + + +/* extra stack space to handle TM calls and some other extras */ +#define EXTRA_STACK 5 + + +#define BASIC_CI_SIZE 8 + +#define BASIC_STACK_SIZE (2*LUA_MINSTACK) + + + +typedef struct stringtable { + GCObject **hash; + lu_int32 nuse; /* number of elements */ + int size; +} stringtable; + + +/* +** informations about a call +*/ +typedef struct CallInfo { + StkId base; /* base for this function */ + StkId func; /* function index in the stack */ + StkId top; /* top for this function */ + const Instruction *savedpc; + int nresults; /* expected number of results from this function */ + int tailcalls; /* number of tail calls lost under this entry */ +} CallInfo; + + + +#define curr_func(L) (clvalue(L->ci->func)) +#define ci_func(ci) (clvalue((ci)->func)) +#define f_isLua(ci) (!ci_func(ci)->c.isC) +#define isLua(ci) (ttisfunction((ci)->func) && f_isLua(ci)) + + +/* +** `global state', shared by all threads of this state +*/ +typedef struct global_State { + stringtable strt; /* hash table for strings */ + lua_Alloc frealloc; /* function to reallocate memory */ + void *ud; /* auxiliary data to `frealloc' */ + lu_byte currentwhite; + lu_byte gcstate; /* state of garbage collector */ + int sweepstrgc; /* position of sweep in `strt' */ + GCObject *rootgc; /* list of all collectable objects */ + GCObject **sweepgc; /* position of sweep in `rootgc' */ + GCObject *gray; /* list of gray objects */ + GCObject *grayagain; /* list of objects to be traversed atomically */ + GCObject *weak; /* list of weak tables (to be cleared) */ + GCObject *tmudata; /* last element of list of userdata to be GC */ + Mbuffer buff; /* temporary buffer for string concatentation */ + lu_mem GCthreshold; + lu_mem totalbytes; /* number of bytes currently allocated */ + lu_mem estimate; /* an estimate of number of bytes actually in use */ + lu_mem gcdept; /* how much GC is `behind schedule' */ + int gcpause; /* size of pause between successive GCs */ + int gcstepmul; /* GC `granularity' */ + lua_CFunction panic; /* to be called in unprotected errors */ + TValue l_registry; + struct lua_State *mainthread; + UpVal uvhead; /* head of double-linked list of all open upvalues */ + struct Table *mt[NUM_TAGS]; /* metatables for basic types */ + TString *tmname[TM_N]; /* array with tag-method names */ +} global_State; + + +/* +** `per thread' state +*/ +struct lua_State { + CommonHeader; + lu_byte status; + StkId top; /* first free slot in the stack */ + StkId base; /* base of current function */ + global_State *l_G; + CallInfo *ci; /* call info for current function */ + const Instruction *savedpc; /* `savedpc' of current function */ + StkId stack_last; /* last free slot in the stack */ + StkId stack; /* stack base */ + CallInfo *end_ci; /* points after end of ci array*/ + CallInfo *base_ci; /* array of CallInfo's */ + int stacksize; + int size_ci; /* size of array `base_ci' */ + unsigned short nCcalls; /* number of nested C calls */ + lu_byte hookmask; + lu_byte allowhook; + int basehookcount; + int hookcount; + lua_Hook hook; + TValue l_gt; /* table of globals */ + TValue env; /* temporary place for environments */ + GCObject *openupval; /* list of open upvalues in this stack */ + GCObject *gclist; + struct lua_longjmp *errorJmp; /* current error recover point */ + ptrdiff_t errfunc; /* current error handling function (stack index) */ +}; + + +#define G(L) (L->l_G) + + +/* +** Union of all collectable objects +*/ +union GCObject { + GCheader gch; + union TString ts; + union Udata u; + union Closure cl; + struct Table h; + struct Proto p; + struct UpVal uv; + struct lua_State th; /* thread */ +}; + + +/* macros to convert a GCObject into a specific value */ +#define rawgco2ts(o) check_exp((o)->gch.tt == LUA_TSTRING, &((o)->ts)) +#define gco2ts(o) (&rawgco2ts(o)->tsv) +#define rawgco2u(o) check_exp((o)->gch.tt == LUA_TUSERDATA, &((o)->u)) +#define gco2u(o) (&rawgco2u(o)->uv) +#define gco2cl(o) check_exp((o)->gch.tt == LUA_TFUNCTION, &((o)->cl)) +#define gco2h(o) check_exp((o)->gch.tt == LUA_TTABLE, &((o)->h)) +#define gco2p(o) check_exp((o)->gch.tt == LUA_TPROTO, &((o)->p)) +#define gco2uv(o) check_exp((o)->gch.tt == LUA_TUPVAL, &((o)->uv)) +#define ngcotouv(o) \ + check_exp((o) == NULL || (o)->gch.tt == LUA_TUPVAL, &((o)->uv)) +#define gco2th(o) check_exp((o)->gch.tt == LUA_TTHREAD, &((o)->th)) + +/* macro to convert any Lua object into a GCObject */ +#define obj2gco(v) (cast(GCObject *, (v))) + + +LUAI_FUNC lua_State *luaE_newthread (lua_State *L); +LUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1); + +#endif + diff --git a/ref/lua-5.1/src/lstring.c b/ref/lua-5.1/src/lstring.c new file mode 100644 index 0000000..4319930 --- /dev/null +++ b/ref/lua-5.1/src/lstring.c @@ -0,0 +1,111 @@ +/* +** $Id: lstring.c,v 2.8 2005/12/22 16:19:56 roberto Exp $ +** String table (keeps all strings handled by Lua) +** See Copyright Notice in lua.h +*/ + + +#include + +#define lstring_c +#define LUA_CORE + +#include "lua.h" + +#include "lmem.h" +#include "lobject.h" +#include "lstate.h" +#include "lstring.h" + + + +void luaS_resize (lua_State *L, int newsize) { + GCObject **newhash; + stringtable *tb; + int i; + if (G(L)->gcstate == GCSsweepstring) + return; /* cannot resize during GC traverse */ + newhash = luaM_newvector(L, newsize, GCObject *); + tb = &G(L)->strt; + for (i=0; isize; i++) { + GCObject *p = tb->hash[i]; + while (p) { /* for each node in the list */ + GCObject *next = p->gch.next; /* save next */ + unsigned int h = gco2ts(p)->hash; + int h1 = lmod(h, newsize); /* new position */ + lua_assert(cast_int(h%newsize) == lmod(h, newsize)); + p->gch.next = newhash[h1]; /* chain it */ + newhash[h1] = p; + p = next; + } + } + luaM_freearray(L, tb->hash, tb->size, TString *); + tb->size = newsize; + tb->hash = newhash; +} + + +static TString *newlstr (lua_State *L, const char *str, size_t l, + unsigned int h) { + TString *ts; + stringtable *tb; + if (l+1 > (MAX_SIZET - sizeof(TString))/sizeof(char)) + luaM_toobig(L); + ts = cast(TString *, luaM_malloc(L, (l+1)*sizeof(char)+sizeof(TString))); + ts->tsv.len = l; + ts->tsv.hash = h; + ts->tsv.marked = luaC_white(G(L)); + ts->tsv.tt = LUA_TSTRING; + ts->tsv.reserved = 0; + memcpy(ts+1, str, l*sizeof(char)); + ((char *)(ts+1))[l] = '\0'; /* ending 0 */ + tb = &G(L)->strt; + h = lmod(h, tb->size); + ts->tsv.next = tb->hash[h]; /* chain new entry */ + tb->hash[h] = obj2gco(ts); + tb->nuse++; + if (tb->nuse > cast(lu_int32, tb->size) && tb->size <= MAX_INT/2) + luaS_resize(L, tb->size*2); /* too crowded */ + return ts; +} + + +TString *luaS_newlstr (lua_State *L, const char *str, size_t l) { + GCObject *o; + unsigned int h = cast(unsigned int, l); /* seed */ + size_t step = (l>>5)+1; /* if string is too long, don't hash all its chars */ + size_t l1; + for (l1=l; l1>=step; l1-=step) /* compute hash */ + h = h ^ ((h<<5)+(h>>2)+cast(unsigned char, str[l1-1])); + for (o = G(L)->strt.hash[lmod(h, G(L)->strt.size)]; + o != NULL; + o = o->gch.next) { + TString *ts = rawgco2ts(o); + if (ts->tsv.len == l && (memcmp(str, getstr(ts), l) == 0)) { + /* string may be dead */ + if (isdead(G(L), o)) changewhite(o); + return ts; + } + } + return newlstr(L, str, l, h); /* not found */ +} + + +Udata *luaS_newudata (lua_State *L, size_t s, Table *e) { + Udata *u; + if (s > MAX_SIZET - sizeof(Udata)) + luaM_toobig(L); + u = cast(Udata *, luaM_malloc(L, s + sizeof(Udata))); + u->uv.marked = luaC_white(G(L)); /* is not finalized */ + u->uv.tt = LUA_TUSERDATA; + u->uv.len = s; + u->uv.metatable = NULL; + u->uv.env = e; + /* chain it on udata list (after main thread) */ + u->uv.next = G(L)->mainthread->next; + G(L)->mainthread->next = obj2gco(u); + return u; +} + diff --git a/ref/lua-5.1/src/lstring.h b/ref/lua-5.1/src/lstring.h new file mode 100644 index 0000000..1d2e91e --- /dev/null +++ b/ref/lua-5.1/src/lstring.h @@ -0,0 +1,31 @@ +/* +** $Id: lstring.h,v 1.43 2005/04/25 19:24:10 roberto Exp $ +** String table (keep all strings handled by Lua) +** See Copyright Notice in lua.h +*/ + +#ifndef lstring_h +#define lstring_h + + +#include "lgc.h" +#include "lobject.h" +#include "lstate.h" + + +#define sizestring(s) (sizeof(union TString)+((s)->len+1)*sizeof(char)) + +#define sizeudata(u) (sizeof(union Udata)+(u)->len) + +#define luaS_new(L, s) (luaS_newlstr(L, s, strlen(s))) +#define luaS_newliteral(L, s) (luaS_newlstr(L, "" s, \ + (sizeof(s)/sizeof(char))-1)) + +#define luaS_fix(s) l_setbit((s)->tsv.marked, FIXEDBIT) + +LUAI_FUNC void luaS_resize (lua_State *L, int newsize); +LUAI_FUNC Udata *luaS_newudata (lua_State *L, size_t s, Table *e); +LUAI_FUNC TString *luaS_newlstr (lua_State *L, const char *str, size_t l); + + +#endif diff --git a/ref/lua-5.1/src/lstrlib.c b/ref/lua-5.1/src/lstrlib.c new file mode 100644 index 0000000..84478fd --- /dev/null +++ b/ref/lua-5.1/src/lstrlib.c @@ -0,0 +1,863 @@ +/* +** $Id: lstrlib.c,v 1.130 2005/12/29 15:32:11 roberto Exp $ +** Standard library for string operations and pattern-matching +** See Copyright Notice in lua.h +*/ + + +#include +#include +#include +#include +#include + +#define lstrlib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +/* macro to `unsign' a character */ +#define uchar(c) ((unsigned char)(c)) + + + +static int str_len (lua_State *L) { + size_t l; + luaL_checklstring(L, 1, &l); + lua_pushinteger(L, l); + return 1; +} + + +static ptrdiff_t posrelat (ptrdiff_t pos, size_t len) { + /* relative string position: negative means back from end */ + return (pos>=0) ? pos : (ptrdiff_t)len+pos+1; +} + + +static int str_sub (lua_State *L) { + size_t l; + const char *s = luaL_checklstring(L, 1, &l); + ptrdiff_t start = posrelat(luaL_checkinteger(L, 2), l); + ptrdiff_t end = posrelat(luaL_optinteger(L, 3, -1), l); + if (start < 1) start = 1; + if (end > (ptrdiff_t)l) end = (ptrdiff_t)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; + luaL_Buffer b; + const char *s = luaL_checklstring(L, 1, &l); + luaL_buffinit(L, &b); + while (l--) luaL_addchar(&b, s[l]); + luaL_pushresult(&b); + 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); + luaL_buffinit(L, &b); + for (i=0; i 0) + luaL_addlstring(&b, s, l); + luaL_pushresult(&b); + return 1; +} + + +static int str_byte (lua_State *L) { + size_t l; + const char *s = luaL_checklstring(L, 1, &l); + ptrdiff_t posi = posrelat(luaL_optinteger(L, 2, 1), l); + ptrdiff_t pose = posrelat(luaL_optinteger(L, 3, posi), l); + int n, i; + if (posi <= 0) posi = 1; + if ((size_t)pose > l) pose = l; + if (posi > pose) return 0; /* empty interval; return no values */ + n = (int)(pose - posi + 1); + if (posi + n <= pose) /* overflow? */ + luaL_error(L, "string slice too long"); + luaL_checkstack(L, n, "string slice too long"); + for (i=0; i= ms->level || ms->capture[l].len == CAP_UNFINISHED) + return luaL_error(ms->L, "invalid capture index"); + return l; +} + + +static int capture_to_close (MatchState *ms) { + int level = ms->level; + for (level--; level>=0; level--) + if (ms->capture[level].len == CAP_UNFINISHED) return level; + return luaL_error(ms->L, "invalid pattern capture"); +} + + +static const char *classend (MatchState *ms, const char *p) { + switch (*p++) { + case L_ESC: { + if (*p == '\0') + luaL_error(ms->L, "malformed pattern (ends with " LUA_QL("%%") ")"); + return p+1; + } + case '[': { + if (*p == '^') p++; + do { /* look for a `]' */ + if (*p == '\0') + luaL_error(ms->L, "malformed pattern (missing " LUA_QL("]") ")"); + if (*(p++) == L_ESC && *p != '\0') + 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 '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; + 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 (int c, const char *p, const char *ep) { + 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 *match (MatchState *ms, const char *s, const char *p); + + +static const char *matchbalance (MatchState *ms, const char *s, + const char *p) { + if (*p == 0 || *(p+1) == 0) + luaL_error(ms->L, "unbalanced pattern"); + 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 ((s+i)src_end && singlematch(uchar(*(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 (ssrc_end && singlematch(uchar(*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) { + init: /* using goto's to optimize tail recursion */ + switch (*p) { + case '(': { /* start capture */ + if (*(p+1) == ')') /* position capture? */ + return start_capture(ms, s, p+2, CAP_POSITION); + else + return start_capture(ms, s, p+1, CAP_UNFINISHED); + } + case ')': { /* end capture */ + return end_capture(ms, s, p+1); + } + case L_ESC: { + switch (*(p+1)) { + case 'b': { /* balanced string? */ + s = matchbalance(ms, s, p+2); + if (s == NULL) return NULL; + p+=4; goto init; /* else return match(ms, s, p+4); */ + } + case 'f': { /* frontier? */ + const char *ep; char previous; + p += 2; + if (*p != '[') + luaL_error(ms->L, "missing " LUA_QL("[") " after " + LUA_QL("%%f") " in pattern"); + ep = classend(ms, p); /* points to what is next */ + previous = (s == ms->src_init) ? '\0' : *(s-1); + if (matchbracketclass(uchar(previous), p, ep-1) || + !matchbracketclass(uchar(*s), p, ep-1)) return NULL; + p=ep; goto init; /* else return match(ms, s, ep); */ + } + default: { + if (isdigit(uchar(*(p+1)))) { /* capture results (%0-%9)? */ + s = match_capture(ms, s, uchar(*(p+1))); + if (s == NULL) return NULL; + p+=2; goto init; /* else return match(ms, s, p+2) */ + } + goto dflt; /* case default */ + } + } + } + case '\0': { /* end of pattern */ + return s; /* match succeeded */ + } + case '$': { + if (*(p+1) == '\0') /* is the `$' the last char in pattern? */ + return (s == ms->src_end) ? s : NULL; /* check end of string */ + else goto dflt; + } + default: dflt: { /* it is a pattern item */ + const char *ep = classend(ms, p); /* points to what is next */ + int m = ssrc_end && singlematch(uchar(*s), p, ep); + switch (*ep) { + case '?': { /* optional */ + const char *res; + if (m && ((res=match(ms, s+1, ep+1)) != NULL)) + return res; + p=ep+1; goto init; /* else return match(ms, s, ep+1); */ + } + case '*': { /* 0 or more repetitions */ + return max_expand(ms, s, p, ep); + } + case '+': { /* 1 or more repetitions */ + return (m ? max_expand(ms, s+1, p, ep) : NULL); + } + case '-': { /* 0 or more repetitions (minimum) */ + return min_expand(ms, s, p, ep); + } + default: { + if (!m) return NULL; + s++; p=ep; goto init; /* else return match(ms, s+1, ep); */ + } + } + } + } +} + + + +static const char *lmemfind (const char *s1, size_t l1, + const char *s2, size_t l2) { + if (l2 == 0) return s1; /* empty strings are everywhere */ + else if (l2 > l1) return NULL; /* avoids a negative `l1' */ + else { + const char *init; /* to search for a `*s2' inside `s1' */ + l2--; /* 1st char will be checked by `memchr' */ + l1 = l1-l2; /* `s2' cannot be found after that */ + while (l1 > 0 && (init = (const char *)memchr(s1, *s2, l1)) != NULL) { + init++; /* 1st char is already checked */ + if (memcmp(init, s2+1, l2) == 0) + return init-1; + else { /* correct `l1' and `s1' to try again */ + l1 -= init-s1; + s1 = init; + } + } + return NULL; /* not found */ + } +} + + +static void push_onecapture (MatchState *ms, int i, const char *s, + const char *e) { + if (i >= ms->level) { + if (i == 0) /* ms->level == 0, too */ + lua_pushlstring(ms->L, s, e - s); /* add whole match */ + else + luaL_error(ms->L, "invalid capture index"); + } + else { + ptrdiff_t l = ms->capture[i].len; + if (l == CAP_UNFINISHED) luaL_error(ms->L, "unfinished capture"); + if (l == CAP_POSITION) + lua_pushinteger(ms->L, ms->capture[i].init - ms->src_init + 1); + else + lua_pushlstring(ms->L, ms->capture[i].init, l); + } +} + + +static int push_captures (MatchState *ms, const char *s, const char *e) { + int i; + int nlevels = (ms->level == 0 && s) ? 1 : ms->level; + luaL_checkstack(ms->L, nlevels, "too many captures"); + for (i = 0; i < nlevels; i++) + push_onecapture(ms, i, s, e); + return nlevels; /* number of strings pushed */ +} + + +static int str_find_aux (lua_State *L, int find) { + size_t l1, l2; + const char *s = luaL_checklstring(L, 1, &l1); + const char *p = luaL_checklstring(L, 2, &l2); + ptrdiff_t init = posrelat(luaL_optinteger(L, 3, 1), l1) - 1; + if (init < 0) init = 0; + else if ((size_t)(init) > l1) init = (ptrdiff_t)l1; + if (find && (lua_toboolean(L, 4) || /* explicit request? */ + strpbrk(p, SPECIALS) == NULL)) { /* or no special characters? */ + /* do a plain search */ + const char *s2 = lmemfind(s+init, l1-init, p, l2); + if (s2) { + lua_pushinteger(L, s2-s+1); + lua_pushinteger(L, s2-s+l2); + return 2; + } + } + else { + MatchState ms; + int anchor = (*p == '^') ? (p++, 1) : 0; + const char *s1=s+init; + ms.L = L; + ms.src_init = s; + ms.src_end = s+l1; + do { + const char *res; + ms.level = 0; + if ((res=match(&ms, s1, p)) != NULL) { + if (find) { + lua_pushinteger(L, s1-s+1); /* start */ + lua_pushinteger(L, res-s); /* end */ + return push_captures(&ms, NULL, 0) + 2; + } + else + return push_captures(&ms, s1, res); + } + } while (s1++ < ms.src_end && !anchor); + } + lua_pushnil(L); /* not found */ + return 1; +} + + +static int str_find (lua_State *L) { + return str_find_aux(L, 1); +} + + +static int str_match (lua_State *L) { + return str_find_aux(L, 0); +} + + +static int gmatch_aux (lua_State *L) { + MatchState ms; + size_t ls; + const char *s = lua_tolstring(L, lua_upvalueindex(1), &ls); + const char *p = lua_tostring(L, lua_upvalueindex(2)); + const char *src; + ms.L = L; + ms.src_init = s; + ms.src_end = s+ls; + for (src = s + (size_t)lua_tointeger(L, lua_upvalueindex(3)); + src <= ms.src_end; + src++) { + const char *e; + ms.level = 0; + if ((e = match(&ms, src, p)) != NULL) { + lua_Integer newstart = e-s; + if (e == src) newstart++; /* empty match? go at least one position */ + lua_pushinteger(L, newstart); + lua_replace(L, lua_upvalueindex(3)); + return push_captures(&ms, src, e); + } + } + return 0; /* not found */ +} + + +static int gmatch (lua_State *L) { + luaL_checkstring(L, 1); + luaL_checkstring(L, 2); + lua_settop(L, 2); + lua_pushinteger(L, 0); + lua_pushcclosure(L, gmatch_aux, 3); + return 1; +} + + +static int gfind_nodef (lua_State *L) { + return luaL_error(L, LUA_QL("string.gfind") " was renamed to " + LUA_QL("string.gmatch")); +} + + +static void add_s (MatchState *ms, luaL_Buffer *b, const char *s, + const char *e) { + size_t l, i; + const char *news = lua_tolstring(ms->L, 3, &l); + for (i = 0; i < l; i++) { + if (news[i] != L_ESC) + luaL_addchar(b, news[i]); + else { + i++; /* skip ESC */ + if (!isdigit(uchar(news[i]))) + luaL_addchar(b, news[i]); + else if (news[i] == '0') + luaL_addlstring(b, s, e - s); + else { + push_onecapture(ms, news[i] - '1', s, e); + luaL_addvalue(b); /* add capture to accumulated result */ + } + } + } +} + + +static void add_value (MatchState *ms, luaL_Buffer *b, const char *s, + const char *e) { + lua_State *L = ms->L; + switch (lua_type(L, 3)) { + case LUA_TNUMBER: + case LUA_TSTRING: { + add_s(ms, b, s, e); + return; + } + case LUA_TFUNCTION: { + int n; + lua_pushvalue(L, 3); + n = push_captures(ms, s, e); + lua_call(L, n, 1); + break; + } + case LUA_TTABLE: { + push_onecapture(ms, 0, s, e); + lua_gettable(L, 3); + break; + } + default: { + luaL_argerror(L, 3, "string/function/table expected"); + return; + } + } + if (!lua_toboolean(L, -1)) { /* nil or false? */ + lua_pop(L, 1); + lua_pushlstring(L, s, e - s); /* keep original text */ + } + else if (!lua_isstring(L, -1)) + luaL_error(L, "invalid replacement value (a %s)", luaL_typename(L, -1)); + luaL_addvalue(b); /* add result to accumulator */ +} + + +static int str_gsub (lua_State *L) { + size_t srcl; + const char *src = luaL_checklstring(L, 1, &srcl); + const char *p = luaL_checkstring(L, 2); + int max_s = luaL_optint(L, 4, srcl+1); + int anchor = (*p == '^') ? (p++, 1) : 0; + int n = 0; + MatchState ms; + luaL_Buffer b; + luaL_buffinit(L, &b); + ms.L = L; + ms.src_init = src; + ms.src_end = src+srcl; + while (n < max_s) { + const char *e; + ms.level = 0; + e = match(&ms, src, p); + if (e) { + n++; + add_value(&ms, &b, src, e); + } + if (e && e>src) /* non empty match? */ + src = e; /* skip it */ + else if (src < ms.src_end) + luaL_addchar(&b, *src++); + else break; + if (anchor) break; + } + luaL_addlstring(&b, src, ms.src_end-src); + luaL_pushresult(&b); + lua_pushinteger(L, n); /* number of substitutions */ + return 2; +} + +/* }====================================================== */ + + +/* maximum size of each formatted item (> len(format('%99.99f', -1e308))) */ +#define MAX_ITEM 512 +/* valid flags in a format specification */ +#define FLAGS "-+ #0" +/* +** maximum size of each format specification (such as '%-099.99d') +** (+10 accounts for %99.99x plus margin of error) +*/ +#define MAX_FORMAT (sizeof(FLAGS) + sizeof(LUA_INTFRMLEN) + 10) + + +static void addquoted (lua_State *L, luaL_Buffer *b, int arg) { + size_t l; + const char *s = luaL_checklstring(L, arg, &l); + luaL_addchar(b, '"'); + while (l--) { + switch (*s) { + case '"': case '\\': case '\n': { + luaL_addchar(b, '\\'); + luaL_addchar(b, *s); + break; + } + case '\0': { + luaL_addlstring(b, "\\000", 4); + break; + } + default: { + luaL_addchar(b, *s); + break; + } + } + s++; + } + luaL_addchar(b, '"'); +} + +static const char *scanformat (lua_State *L, const char *strfrmt, char *form) { + const char *p = strfrmt; + while (strchr(FLAGS, *p)) p++; /* skip flags */ + if ((size_t)(p - strfrmt) >= sizeof(FLAGS)) + luaL_error(L, "invalid format (repeated flags)"); + if (isdigit(uchar(*p))) p++; /* skip width */ + if (isdigit(uchar(*p))) p++; /* (2 digits at most) */ + if (*p == '.') { + p++; + if (isdigit(uchar(*p))) p++; /* skip precision */ + if (isdigit(uchar(*p))) p++; /* (2 digits at most) */ + } + if (isdigit(uchar(*p))) + luaL_error(L, "invalid format (width or precision too long)"); + *(form++) = '%'; + strncpy(form, strfrmt, p - strfrmt + 1); + form += p - strfrmt + 1; + *form = '\0'; + return p; +} + + +static void addintlen (char *form) { + size_t l = strlen(form); + char spec = form[l - 1]; + strcpy(form + l - 1, LUA_INTFRMLEN); + form[l + sizeof(LUA_INTFRMLEN) - 2] = spec; + form[l + sizeof(LUA_INTFRMLEN) - 1] = '\0'; +} + + +static int str_format (lua_State *L) { + int arg = 1; + size_t sfl; + const char *strfrmt = luaL_checklstring(L, arg, &sfl); + const char *strfrmt_end = strfrmt+sfl; + luaL_Buffer b; + luaL_buffinit(L, &b); + while (strfrmt < strfrmt_end) { + if (*strfrmt != L_ESC) + luaL_addchar(&b, *strfrmt++); + else if (*++strfrmt == L_ESC) + luaL_addchar(&b, *strfrmt++); /* %% */ + else { /* format item */ + char form[MAX_FORMAT]; /* to store the format (`%...') */ + char buff[MAX_ITEM]; /* to store the formatted item */ + arg++; + strfrmt = scanformat(L, strfrmt, form); + switch (*strfrmt++) { + case 'c': { + sprintf(buff, form, (int)luaL_checknumber(L, arg)); + break; + } + case 'd': case 'i': { + addintlen(form); + sprintf(buff, form, (LUA_INTFRM_T)luaL_checknumber(L, arg)); + break; + } + case 'o': case 'u': case 'x': case 'X': { + addintlen(form); + sprintf(buff, form, (unsigned LUA_INTFRM_T)luaL_checknumber(L, arg)); + break; + } + case 'e': case 'E': case 'f': + case 'g': case 'G': { + sprintf(buff, form, (double)luaL_checknumber(L, arg)); + break; + } + case 'q': { + addquoted(L, &b, arg); + continue; /* skip the 'addsize' at the end */ + } + case 's': { + size_t l; + const char *s = luaL_checklstring(L, arg, &l); + if (!strchr(form, '.') && l >= 100) { + /* no precision and string is too long to be formatted; + keep original string */ + lua_pushvalue(L, arg); + luaL_addvalue(&b); + continue; /* skip the `addsize' at the end */ + } + else { + sprintf(buff, form, s); + break; + } + } + default: { /* also treat cases `pnLlh' */ + return luaL_error(L, "invalid option to " LUA_QL("format")); + } + } + luaL_addlstring(&b, buff, strlen(buff)); + } + } + luaL_pushresult(&b); + return 1; +} + + +static const luaL_Reg strlib[] = { + {"byte", str_byte}, + {"char", str_char}, + {"dump", str_dump}, + {"find", str_find}, + {"format", str_format}, + {"gfind", gfind_nodef}, + {"gmatch", gmatch}, + {"gsub", str_gsub}, + {"len", str_len}, + {"lower", str_lower}, + {"match", str_match}, + {"rep", str_rep}, + {"reverse", str_reverse}, + {"sub", str_sub}, + {"upper", str_upper}, + {NULL, NULL} +}; + + +static void createmetatable (lua_State *L) { + lua_createtable(L, 0, 1); /* create metatable for strings */ + lua_pushliteral(L, ""); /* dummy string */ + lua_pushvalue(L, -2); + lua_setmetatable(L, -2); /* set string metatable */ + lua_pop(L, 1); /* pop dummy string */ + lua_pushvalue(L, -2); /* string library... */ + lua_setfield(L, -2, "__index"); /* ...is the __index metamethod */ + lua_pop(L, 1); /* pop metatable */ +} + + +/* +** Open string library +*/ +LUALIB_API int luaopen_string (lua_State *L) { + luaL_register(L, LUA_STRLIBNAME, strlib); +#if defined(LUA_COMPAT_GFIND) + lua_getfield(L, -1, "gmatch"); + lua_setfield(L, -2, "gfind"); +#endif + createmetatable(L); + return 1; +} + diff --git a/ref/lua-5.1/src/ltable.c b/ref/lua-5.1/src/ltable.c new file mode 100644 index 0000000..bc91cac --- /dev/null +++ b/ref/lua-5.1/src/ltable.c @@ -0,0 +1,588 @@ +/* +** $Id: ltable.c,v 2.32 2006/01/18 11:49:02 roberto Exp $ +** Lua tables (hash) +** See Copyright Notice in lua.h +*/ + + +/* +** Implementation of tables (aka arrays, objects, or hash tables). +** Tables keep its elements in two parts: an array part and a hash part. +** Non-negative integer keys are all candidates to be kept in the array +** part. The actual size of the array is the largest `n' such that at +** least half the slots between 0 and n are in use. +** Hash uses a mix of chained scatter table with Brent's variation. +** A main invariant of these tables is that, if an element is not +** in its main position (i.e. the `original' position that its hash gives +** to it), then the colliding element is in its own main position. +** Hence even when the load factor reaches 100%, performance remains good. +*/ + +#include +#include + +#define ltable_c +#define LUA_CORE + +#include "lua.h" + +#include "ldebug.h" +#include "ldo.h" +#include "lgc.h" +#include "lmem.h" +#include "lobject.h" +#include "lstate.h" +#include "ltable.h" + + +/* +** max size of array part is 2^MAXBITS +*/ +#if LUAI_BITSINT > 26 +#define MAXBITS 26 +#else +#define MAXBITS (LUAI_BITSINT-2) +#endif + +#define MAXASIZE (1 << MAXBITS) + + +#define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t)))) + +#define hashstr(t,str) hashpow2(t, (str)->tsv.hash) +#define hashboolean(t,p) hashpow2(t, p) + + +/* +** for some types, it is better to avoid modulus by power of 2, as +** they tend to have many 2 factors. +*/ +#define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1)))) + + +#define hashpointer(t,p) hashmod(t, IntPoint(p)) + + +/* +** number of ints inside a lua_Number +*/ +#define numints cast_int(sizeof(lua_Number)/sizeof(int)) + + + +#define dummynode (&dummynode_) + +static const Node dummynode_ = { + {{NULL}, LUA_TNIL}, /* value */ + {{{NULL}, LUA_TNIL, NULL}} /* key */ +}; + + +/* +** hash for lua_Numbers +*/ +static Node *hashnum (const Table *t, lua_Number n) { + unsigned int a[numints]; + int i; + n += 1; /* normalize number (avoid -0) */ + lua_assert(sizeof(a) <= sizeof(n)); + memcpy(a, &n, sizeof(a)); + for (i = 1; i < numints; i++) a[0] += a[i]; + return hashmod(t, a[0]); +} + + + +/* +** returns the `main' position of an element in a table (that is, the index +** of its hash value) +*/ +static Node *mainposition (const Table *t, const TValue *key) { + switch (ttype(key)) { + case LUA_TNUMBER: + return hashnum(t, nvalue(key)); + case LUA_TSTRING: + return hashstr(t, rawtsvalue(key)); + case LUA_TBOOLEAN: + return hashboolean(t, bvalue(key)); + case LUA_TLIGHTUSERDATA: + return hashpointer(t, pvalue(key)); + default: + return hashpointer(t, gcvalue(key)); + } +} + + +/* +** returns the index for `key' if `key' is an appropriate key to live in +** the array part of the table, -1 otherwise. +*/ +static int arrayindex (const TValue *key) { + if (ttisnumber(key)) { + lua_Number n = nvalue(key); + int k; + lua_number2int(k, n); + if (luai_numeq(cast_num(k), n)) + return k; + } + return -1; /* `key' did not match some condition */ +} + + +/* +** returns the index of a `key' for table traversals. First goes all +** elements in the array part, then elements in the hash part. The +** beginning of a traversal is signalled by -1. +*/ +static int findindex (lua_State *L, Table *t, StkId key) { + int i; + if (ttisnil(key)) return -1; /* first iteration */ + i = arrayindex(key); + if (0 < i && i <= t->sizearray) /* is `key' inside array part? */ + return i-1; /* yes; that's the index (corrected to C) */ + else { + Node *n = mainposition(t, key); + do { /* check whether `key' is somewhere in the chain */ + /* key may be dead already, but it is ok to use it in `next' */ + if (luaO_rawequalObj(key2tval(n), key) || + (ttype(gkey(n)) == LUA_TDEADKEY && iscollectable(key) && + gcvalue(gkey(n)) == gcvalue(key))) { + i = cast_int(n - gnode(t, 0)); /* key index in hash table */ + /* hash elements are numbered after array ones */ + return i + t->sizearray; + } + else n = gnext(n); + } while (n); + luaG_runerror(L, "invalid key to " LUA_QL("next")); /* key not found */ + return 0; /* to avoid warnings */ + } +} + + +int luaH_next (lua_State *L, Table *t, StkId key) { + int i = findindex(L, t, key); /* find original element */ + for (i++; i < t->sizearray; i++) { /* try first array part */ + if (!ttisnil(&t->array[i])) { /* a non-nil value? */ + setnvalue(key, cast_num(i+1)); + setobj2s(L, key+1, &t->array[i]); + return 1; + } + } + for (i -= t->sizearray; i < sizenode(t); i++) { /* then hash part */ + if (!ttisnil(gval(gnode(t, i)))) { /* a non-nil value? */ + setobj2s(L, key, key2tval(gnode(t, i))); + setobj2s(L, key+1, gval(gnode(t, i))); + return 1; + } + } + return 0; /* no more elements */ +} + + +/* +** {============================================================= +** Rehash +** ============================================================== +*/ + + +static int computesizes (int nums[], int *narray) { + int i; + int twotoi; /* 2^i */ + int a = 0; /* number of elements smaller than 2^i */ + int na = 0; /* number of elements to go to array part */ + int n = 0; /* optimal size for array part */ + for (i = 0, twotoi = 1; twotoi/2 < *narray; i++, twotoi *= 2) { + if (nums[i] > 0) { + a += nums[i]; + if (a > twotoi/2) { /* more than half elements present? */ + n = twotoi; /* optimal size (till now) */ + na = a; /* all elements smaller than n will go to array part */ + } + } + if (a == *narray) break; /* all elements already counted */ + } + *narray = n; + lua_assert(*narray/2 <= na && na <= *narray); + return na; +} + + +static int countint (const TValue *key, int *nums) { + int k = arrayindex(key); + if (0 < k && k <= MAXASIZE) { /* is `key' an appropriate array index? */ + nums[ceillog2(k)]++; /* count as such */ + return 1; + } + else + return 0; +} + + +static int numusearray (const Table *t, int *nums) { + int lg; + int ttlg; /* 2^lg */ + int ause = 0; /* summation of `nums' */ + int i = 1; /* count to traverse all array keys */ + for (lg=0, ttlg=1; lg<=MAXBITS; lg++, ttlg*=2) { /* for each slice */ + int lc = 0; /* counter */ + int lim = ttlg; + if (lim > t->sizearray) { + lim = t->sizearray; /* adjust upper limit */ + if (i > lim) + break; /* no more elements to count */ + } + /* count elements in range (2^(lg-1), 2^lg] */ + for (; i <= lim; i++) { + if (!ttisnil(&t->array[i-1])) + lc++; + } + nums[lg] += lc; + ause += lc; + } + return ause; +} + + +static int numusehash (const Table *t, int *nums, int *pnasize) { + int totaluse = 0; /* total number of elements */ + int ause = 0; /* summation of `nums' */ + int i = sizenode(t); + while (i--) { + Node *n = &t->node[i]; + if (!ttisnil(gval(n))) { + ause += countint(key2tval(n), nums); + totaluse++; + } + } + *pnasize += ause; + return totaluse; +} + + +static void setarrayvector (lua_State *L, Table *t, int size) { + int i; + luaM_reallocvector(L, t->array, t->sizearray, size, TValue); + for (i=t->sizearray; iarray[i]); + t->sizearray = size; +} + + +static void setnodevector (lua_State *L, Table *t, int size) { + int lsize; + if (size == 0) { /* no elements to hash part? */ + t->node = cast(Node *, dummynode); /* use common `dummynode' */ + lsize = 0; + } + else { + int i; + lsize = ceillog2(size); + if (lsize > MAXBITS) + luaG_runerror(L, "table overflow"); + size = twoto(lsize); + t->node = luaM_newvector(L, size, Node); + for (i=0; ilsizenode = cast_byte(lsize); + t->lastfree = gnode(t, size); /* all positions are free */ +} + + +static void resize (lua_State *L, Table *t, int nasize, int nhsize) { + int i; + int oldasize = t->sizearray; + int oldhsize = t->lsizenode; + Node *nold = t->node; /* save old hash ... */ + if (nasize > oldasize) /* array part must grow? */ + setarrayvector(L, t, nasize); + /* create new hash part with appropriate size */ + setnodevector(L, t, nhsize); + if (nasize < oldasize) { /* array part must shrink? */ + t->sizearray = nasize; + /* re-insert elements from vanishing slice */ + for (i=nasize; iarray[i])) + setobjt2t(L, luaH_setnum(L, t, i+1), &t->array[i]); + } + /* shrink array */ + luaM_reallocvector(L, t->array, oldasize, nasize, TValue); + } + /* re-insert elements from hash part */ + for (i = twoto(oldhsize) - 1; i >= 0; i--) { + Node *old = nold+i; + if (!ttisnil(gval(old))) + setobjt2t(L, luaH_set(L, t, key2tval(old)), gval(old)); + } + if (nold != dummynode) + luaM_freearray(L, nold, twoto(oldhsize), Node); /* free old array */ +} + + +void luaH_resizearray (lua_State *L, Table *t, int nasize) { + int nsize = (t->node == dummynode) ? 0 : sizenode(t); + resize(L, t, nasize, nsize); +} + + +static void rehash (lua_State *L, Table *t, const TValue *ek) { + int nasize, na; + int nums[MAXBITS+1]; /* nums[i] = number of keys between 2^(i-1) and 2^i */ + int i; + int totaluse; + for (i=0; i<=MAXBITS; i++) nums[i] = 0; /* reset counts */ + nasize = numusearray(t, nums); /* count keys in array part */ + totaluse = nasize; /* all those keys are integer keys */ + totaluse += numusehash(t, nums, &nasize); /* count keys in hash part */ + /* count extra key */ + nasize += countint(ek, nums); + totaluse++; + /* compute new size for array part */ + na = computesizes(nums, &nasize); + /* resize the table to new computed sizes */ + resize(L, t, nasize, totaluse - na); +} + + + +/* +** }============================================================= +*/ + + +Table *luaH_new (lua_State *L, int narray, int nhash) { + Table *t = luaM_new(L, Table); + luaC_link(L, obj2gco(t), LUA_TTABLE); + t->metatable = NULL; + t->flags = cast_byte(~0); + /* temporary values (kept only if some malloc fails) */ + t->array = NULL; + t->sizearray = 0; + t->lsizenode = 0; + t->node = cast(Node *, dummynode); + setarrayvector(L, t, narray); + setnodevector(L, t, nhash); + return t; +} + + +void luaH_free (lua_State *L, Table *t) { + if (t->node != dummynode) + luaM_freearray(L, t->node, sizenode(t), Node); + luaM_freearray(L, t->array, t->sizearray, TValue); + luaM_free(L, t); +} + + +static Node *getfreepos (Table *t) { + while (t->lastfree-- > t->node) { + if (ttisnil(gkey(t->lastfree))) + return t->lastfree; + } + return NULL; /* could not find a free place */ +} + + + +/* +** inserts a new key into a hash table; first, check whether key's main +** position is free. If not, check whether colliding node is in its main +** position or not: if it is not, move colliding node to an empty place and +** put new key in its main position; otherwise (colliding node is in its main +** position), new key goes to an empty position. +*/ +static TValue *newkey (lua_State *L, Table *t, const TValue *key) { + Node *mp = mainposition(t, key); + if (!ttisnil(gval(mp)) || mp == dummynode) { + Node *othern; + Node *n = getfreepos(t); /* get a free place */ + if (n == NULL) { /* cannot find a free place? */ + rehash(L, t, key); /* grow table */ + return luaH_set(L, t, key); /* re-insert key into grown table */ + } + lua_assert(n != dummynode); + othern = mainposition(t, key2tval(mp)); + if (othern != mp) { /* is colliding node out of its main position? */ + /* yes; move colliding node into free position */ + while (gnext(othern) != mp) othern = gnext(othern); /* find previous */ + gnext(othern) = n; /* redo the chain with `n' in place of `mp' */ + *n = *mp; /* copy colliding node into free pos. (mp->next also goes) */ + gnext(mp) = NULL; /* now `mp' is free */ + setnilvalue(gval(mp)); + } + else { /* colliding node is in its own main position */ + /* new node will go into free position */ + gnext(n) = gnext(mp); /* chain new position */ + gnext(mp) = n; + mp = n; + } + } + gkey(mp)->value = key->value; gkey(mp)->tt = key->tt; + luaC_barriert(L, t, key); + lua_assert(ttisnil(gval(mp))); + return gval(mp); +} + + +/* +** search function for integers +*/ +const TValue *luaH_getnum (Table *t, int key) { + /* (1 <= key && key <= t->sizearray) */ + if (cast(unsigned int, key-1) < cast(unsigned int, t->sizearray)) + return &t->array[key-1]; + else { + lua_Number nk = cast_num(key); + Node *n = hashnum(t, nk); + do { /* check whether `key' is somewhere in the chain */ + if (ttisnumber(gkey(n)) && luai_numeq(nvalue(gkey(n)), nk)) + return gval(n); /* that's it */ + else n = gnext(n); + } while (n); + return luaO_nilobject; + } +} + + +/* +** search function for strings +*/ +const TValue *luaH_getstr (Table *t, TString *key) { + Node *n = hashstr(t, key); + do { /* check whether `key' is somewhere in the chain */ + if (ttisstring(gkey(n)) && rawtsvalue(gkey(n)) == key) + return gval(n); /* that's it */ + else n = gnext(n); + } while (n); + return luaO_nilobject; +} + + +/* +** main search function +*/ +const TValue *luaH_get (Table *t, const TValue *key) { + switch (ttype(key)) { + case LUA_TNIL: return luaO_nilobject; + case LUA_TSTRING: return luaH_getstr(t, rawtsvalue(key)); + case LUA_TNUMBER: { + int k; + lua_Number n = nvalue(key); + lua_number2int(k, n); + if (luai_numeq(cast_num(k), nvalue(key))) /* index is int? */ + return luaH_getnum(t, k); /* use specialized version */ + /* else go through */ + } + default: { + Node *n = mainposition(t, key); + do { /* check whether `key' is somewhere in the chain */ + if (luaO_rawequalObj(key2tval(n), key)) + return gval(n); /* that's it */ + else n = gnext(n); + } while (n); + return luaO_nilobject; + } + } +} + + +TValue *luaH_set (lua_State *L, Table *t, const TValue *key) { + const TValue *p = luaH_get(t, key); + t->flags = 0; + if (p != luaO_nilobject) + return cast(TValue *, p); + else { + if (ttisnil(key)) luaG_runerror(L, "table index is nil"); + else if (ttisnumber(key) && luai_numisnan(nvalue(key))) + luaG_runerror(L, "table index is NaN"); + return newkey(L, t, key); + } +} + + +TValue *luaH_setnum (lua_State *L, Table *t, int key) { + const TValue *p = luaH_getnum(t, key); + if (p != luaO_nilobject) + return cast(TValue *, p); + else { + TValue k; + setnvalue(&k, cast_num(key)); + return newkey(L, t, &k); + } +} + + +TValue *luaH_setstr (lua_State *L, Table *t, TString *key) { + const TValue *p = luaH_getstr(t, key); + if (p != luaO_nilobject) + return cast(TValue *, p); + else { + TValue k; + setsvalue(L, &k, key); + return newkey(L, t, &k); + } +} + + +static int unbound_search (Table *t, unsigned int j) { + unsigned int i = j; /* i is zero or a present index */ + j++; + /* find `i' and `j' such that i is present and j is not */ + while (!ttisnil(luaH_getnum(t, j))) { + i = j; + j *= 2; + if (j > cast(unsigned int, MAX_INT)) { /* overflow? */ + /* table was built with bad purposes: resort to linear search */ + i = 1; + while (!ttisnil(luaH_getnum(t, i))) i++; + return i - 1; + } + } + /* now do a binary search between them */ + while (j - i > 1) { + unsigned int m = (i+j)/2; + if (ttisnil(luaH_getnum(t, m))) j = m; + else i = m; + } + return i; +} + + +/* +** Try to find a boundary in table `t'. A `boundary' is an integer index +** such that t[i] is non-nil and t[i+1] is nil (and 0 if t[1] is nil). +*/ +int luaH_getn (Table *t) { + unsigned int j = t->sizearray; + if (j > 0 && ttisnil(&t->array[j - 1])) { + /* there is a boundary in the array part: (binary) search for it */ + unsigned int i = 0; + while (j - i > 1) { + unsigned int m = (i+j)/2; + if (ttisnil(&t->array[m - 1])) j = m; + else i = m; + } + return i; + } + /* else must find a boundary in hash part */ + else if (t->node == dummynode) /* hash part is empty? */ + return j; /* that is easy... */ + else return unbound_search(t, j); +} + + + +#if defined(LUA_DEBUG) + +Node *luaH_mainposition (const Table *t, const TValue *key) { + return mainposition(t, key); +} + +int luaH_isdummy (Node *n) { return n == dummynode; } + +#endif diff --git a/ref/lua-5.1/src/ltable.h b/ref/lua-5.1/src/ltable.h new file mode 100644 index 0000000..09193cd --- /dev/null +++ b/ref/lua-5.1/src/ltable.h @@ -0,0 +1,40 @@ +/* +** $Id: ltable.h,v 2.10 2006/01/10 13:13:06 roberto Exp $ +** Lua tables (hash) +** See Copyright Notice in lua.h +*/ + +#ifndef ltable_h +#define ltable_h + +#include "lobject.h" + + +#define gnode(t,i) (&(t)->node[i]) +#define gkey(n) (&(n)->i_key.nk) +#define gval(n) (&(n)->i_val) +#define gnext(n) ((n)->i_key.nk.next) + +#define key2tval(n) (&(n)->i_key.tvk) + + +LUAI_FUNC const TValue *luaH_getnum (Table *t, int key); +LUAI_FUNC TValue *luaH_setnum (lua_State *L, Table *t, int key); +LUAI_FUNC const TValue *luaH_getstr (Table *t, TString *key); +LUAI_FUNC TValue *luaH_setstr (lua_State *L, Table *t, TString *key); +LUAI_FUNC const TValue *luaH_get (Table *t, const TValue *key); +LUAI_FUNC TValue *luaH_set (lua_State *L, Table *t, const TValue *key); +LUAI_FUNC Table *luaH_new (lua_State *L, int narray, int lnhash); +LUAI_FUNC void luaH_resizearray (lua_State *L, Table *t, int nasize); +LUAI_FUNC void luaH_free (lua_State *L, Table *t); +LUAI_FUNC int luaH_next (lua_State *L, Table *t, StkId key); +LUAI_FUNC int luaH_getn (Table *t); + + +#if defined(LUA_DEBUG) +LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key); +LUAI_FUNC int luaH_isdummy (Node *n); +#endif + + +#endif diff --git a/ref/lua-5.1/src/ltablib.c b/ref/lua-5.1/src/ltablib.c new file mode 100644 index 0000000..453b23b --- /dev/null +++ b/ref/lua-5.1/src/ltablib.c @@ -0,0 +1,278 @@ +/* +** $Id: ltablib.c,v 1.38 2005/10/23 17:38:15 roberto Exp $ +** Library for Table Manipulation +** See Copyright Notice in lua.h +*/ + + +#include + +#define ltablib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +#define aux_getn(L,n) (luaL_checktype(L, n, LUA_TTABLE), luaL_getn(L, n)) + + +static int foreachi (lua_State *L) { + int i; + int n = aux_getn(L, 1); + luaL_checktype(L, 2, LUA_TFUNCTION); + for (i=1; i <= n; i++) { + lua_pushvalue(L, 2); /* function */ + lua_pushinteger(L, i); /* 1st argument */ + lua_rawgeti(L, 1, i); /* 2nd argument */ + lua_call(L, 2, 1); + if (!lua_isnil(L, -1)) + return 1; + lua_pop(L, 1); /* remove nil result */ + } + return 0; +} + + +static int foreach (lua_State *L) { + luaL_checktype(L, 1, LUA_TTABLE); + luaL_checktype(L, 2, LUA_TFUNCTION); + lua_pushnil(L); /* first key */ + while (lua_next(L, 1)) { + lua_pushvalue(L, 2); /* function */ + lua_pushvalue(L, -3); /* key */ + lua_pushvalue(L, -3); /* value */ + lua_call(L, 2, 1); + if (!lua_isnil(L, -1)) + return 1; + lua_pop(L, 2); /* remove value and result */ + } + return 0; +} + + +static int maxn (lua_State *L) { + lua_Number max = 0; + luaL_checktype(L, 1, LUA_TTABLE); + lua_pushnil(L); /* first key */ + while (lua_next(L, 1)) { + lua_pop(L, 1); /* remove value */ + if (lua_type(L, -1) == LUA_TNUMBER) { + lua_Number v = lua_tonumber(L, -1); + if (v > max) max = v; + } + } + lua_pushnumber(L, max); + return 1; +} + + +static int getn (lua_State *L) { + lua_pushinteger(L, aux_getn(L, 1)); + return 1; +} + + +static int setn (lua_State *L) { + luaL_checktype(L, 1, LUA_TTABLE); +#ifndef luaL_setn + luaL_setn(L, 1, luaL_checkint(L, 2)); +#else + luaL_error(L, LUA_QL("setn") " is obsolete"); +#endif + lua_pushvalue(L, 1); + return 1; +} + + +static int tinsert (lua_State *L) { + int e = aux_getn(L, 1) + 1; /* first empty element */ + int pos; /* where to insert new element */ + switch (lua_gettop(L)) { + case 2: { /* called with only 2 arguments */ + pos = e; /* insert new element at the end */ + break; + } + case 3: { + int i; + pos = luaL_checkint(L, 2); /* 2nd argument is the position */ + if (pos > e) e = pos; /* `grow' array if necessary */ + for (i = e; i > pos; i--) { /* move up elements */ + lua_rawgeti(L, 1, i-1); + lua_rawseti(L, 1, i); /* t[i] = t[i-1] */ + } + break; + } + default: { + return luaL_error(L, "wrong number of arguments to " LUA_QL("insert")); + } + } + luaL_setn(L, 1, e); /* new size */ + lua_rawseti(L, 1, pos); /* t[pos] = v */ + return 0; +} + + +static int tremove (lua_State *L) { + int e = aux_getn(L, 1); + int pos = luaL_optint(L, 2, e); + if (e == 0) return 0; /* table is `empty' */ + luaL_setn(L, 1, e - 1); /* t.n = n-1 */ + lua_rawgeti(L, 1, pos); /* result = t[pos] */ + for ( ;pos= P */ + while (lua_rawgeti(L, 1, ++i), sort_comp(L, -1, -2)) { + if (i>u) luaL_error(L, "invalid order function for sorting"); + lua_pop(L, 1); /* remove a[i] */ + } + /* repeat --j until a[j] <= P */ + while (lua_rawgeti(L, 1, --j), sort_comp(L, -3, -1)) { + if (j + +#define ltm_c +#define LUA_CORE + +#include "lua.h" + +#include "lobject.h" +#include "lstate.h" +#include "lstring.h" +#include "ltable.h" +#include "ltm.h" + + + +const char *const luaT_typenames[] = { + "nil", "boolean", "userdata", "number", + "string", "table", "function", "userdata", "thread", + "proto", "upval" +}; + + +void luaT_init (lua_State *L) { + static const char *const luaT_eventname[] = { /* ORDER TM */ + "__index", "__newindex", + "__gc", "__mode", "__eq", + "__add", "__sub", "__mul", "__div", "__mod", + "__pow", "__unm", "__len", "__lt", "__le", + "__concat", "__call" + }; + int i; + for (i=0; itmname[i] = luaS_new(L, luaT_eventname[i]); + luaS_fix(G(L)->tmname[i]); /* never collect these names */ + } +} + + +/* +** function to be used with macro "fasttm": optimized for absence of +** tag methods +*/ +const TValue *luaT_gettm (Table *events, TMS event, TString *ename) { + const TValue *tm = luaH_getstr(events, ename); + lua_assert(event <= TM_EQ); + if (ttisnil(tm)) { /* no tag method? */ + events->flags |= cast_byte(1u<metatable; + break; + case LUA_TUSERDATA: + mt = uvalue(o)->metatable; + break; + default: + mt = G(L)->mt[ttype(o)]; + } + return (mt ? luaH_getstr(mt, G(L)->tmname[event]) : luaO_nilobject); +} + diff --git a/ref/lua-5.1/src/ltm.h b/ref/lua-5.1/src/ltm.h new file mode 100644 index 0000000..866c796 --- /dev/null +++ b/ref/lua-5.1/src/ltm.h @@ -0,0 +1,54 @@ +/* +** $Id: ltm.h,v 2.6 2005/06/06 13:30:25 roberto Exp $ +** Tag methods +** See Copyright Notice in lua.h +*/ + +#ifndef ltm_h +#define ltm_h + + +#include "lobject.h" + + +/* +* WARNING: if you change the order of this enumeration, +* grep "ORDER TM" +*/ +typedef enum { + TM_INDEX, + TM_NEWINDEX, + TM_GC, + TM_MODE, + TM_EQ, /* last tag method with `fast' access */ + TM_ADD, + TM_SUB, + TM_MUL, + TM_DIV, + TM_MOD, + TM_POW, + TM_UNM, + TM_LEN, + TM_LT, + TM_LE, + TM_CONCAT, + TM_CALL, + TM_N /* number of elements in the enum */ +} TMS; + + + +#define gfasttm(g,et,e) ((et) == NULL ? NULL : \ + ((et)->flags & (1u<<(e))) ? NULL : luaT_gettm(et, e, (g)->tmname[e])) + +#define fasttm(l,et,e) gfasttm(G(l), et, e) + +LUAI_DATA const char *const luaT_typenames[]; + + +LUAI_FUNC const TValue *luaT_gettm (Table *events, TMS event, TString *ename); +LUAI_FUNC const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o, + TMS event); +LUAI_FUNC void luaT_init (lua_State *L); + +#endif diff --git a/ref/lua-5.1/src/lua.c b/ref/lua-5.1/src/lua.c new file mode 100644 index 0000000..6df527d --- /dev/null +++ b/ref/lua-5.1/src/lua.c @@ -0,0 +1,377 @@ +/* +** $Id: lua.c,v 1.157 2005/12/29 16:23:32 roberto Exp $ +** Lua stand-alone interpreter +** See Copyright Notice in lua.h +*/ + + +#include +#include +#include +#include + +#define lua_c + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + + +static lua_State *globalL = NULL; + +static const char *progname = LUA_PROGNAME; + + + +static void lstop (lua_State *L, lua_Debug *ar) { + (void)ar; /* unused arg. */ + lua_sethook(L, NULL, 0, 0); + luaL_error(L, "interrupted!"); +} + + +static void laction (int i) { + signal(i, SIG_DFL); /* if another SIGINT happens before lstop, + terminate process (default action) */ + lua_sethook(globalL, lstop, LUA_MASKCALL | LUA_MASKRET | LUA_MASKCOUNT, 1); +} + + +static void print_usage (void) { + fprintf(stderr, + "usage: %s [options] [script [args]].\n" + "Available options are:\n" + " -e stat execute string " LUA_QL("stat") "\n" + " -l name require library " LUA_QL("name") "\n" + " -i enter interactive mode after executing " LUA_QL("script") "\n" + " -v show version information\n" + " -- stop handling options\n" + " - execute stdin and stop handling options\n" + , + progname); + fflush(stderr); +} + + +static void l_message (const char *pname, const char *msg) { + if (pname) fprintf(stderr, "%s: ", pname); + fprintf(stderr, "%s\n", msg); + fflush(stderr); +} + + +static int report (lua_State *L, int status) { + if (status && !lua_isnil(L, -1)) { + const char *msg = lua_tostring(L, -1); + if (msg == NULL) msg = "(error object is not a string)"; + l_message(progname, msg); + lua_pop(L, 1); + } + return status; +} + + +static int traceback (lua_State *L) { + lua_getfield(L, LUA_GLOBALSINDEX, "debug"); + if (!lua_istable(L, -1)) { + lua_pop(L, 1); + return 1; + } + lua_getfield(L, -1, "traceback"); + if (!lua_isfunction(L, -1)) { + lua_pop(L, 2); + return 1; + } + lua_pushvalue(L, 1); /* pass error message */ + lua_pushinteger(L, 2); /* skip this function and traceback */ + lua_call(L, 2, 1); /* call debug.traceback */ + return 1; +} + + +static int docall (lua_State *L, int narg, int clear) { + int status; + int base = lua_gettop(L) - narg; /* function index */ + lua_pushcfunction(L, traceback); /* push traceback function */ + lua_insert(L, base); /* put it under chunk and args */ + signal(SIGINT, laction); + status = lua_pcall(L, narg, (clear ? 0 : LUA_MULTRET), base); + signal(SIGINT, SIG_DFL); + lua_remove(L, base); /* remove traceback function */ + /* force a complete garbage collection in case of errors */ + if (status != 0) lua_gc(L, LUA_GCCOLLECT, 0); + return status; +} + + +static void print_version (void) { + l_message(NULL, LUA_VERSION " " LUA_COPYRIGHT); +} + + +static int getargs (lua_State *L, char **argv, int n) { + int narg; + int i; + int argc = 0; + while (argv[argc]) argc++; /* count total number of arguments */ + narg = argc - (n + 1); /* number of arguments to the script */ + luaL_checkstack(L, narg + 3, "too many arguments to script"); + for (i=n+1; i < argc; i++) + lua_pushstring(L, argv[i]); + lua_createtable(L, narg, n + 1); + for (i=0; i < argc; i++) { + lua_pushstring(L, argv[i]); + lua_rawseti(L, -2, i - n); + } + return narg; +} + + +static int dofile (lua_State *L, const char *name) { + int status = luaL_loadfile(L, name) || docall(L, 0, 1); + return report(L, status); +} + + +static int dostring (lua_State *L, const char *s, const char *name) { + int status = luaL_loadbuffer(L, s, strlen(s), name) || docall(L, 0, 1); + return report(L, status); +} + + +static int dolibrary (lua_State *L, const char *name) { + lua_getglobal(L, "require"); + lua_pushstring(L, name); + return report(L, lua_pcall(L, 1, 0, 0)); +} + + +static const char *get_prompt (lua_State *L, int firstline) { + const char *p; + lua_getfield(L, LUA_GLOBALSINDEX, firstline ? "_PROMPT" : "_PROMPT2"); + p = lua_tostring(L, -1); + if (p == NULL) p = (firstline ? LUA_PROMPT : LUA_PROMPT2); + lua_pop(L, 1); /* remove global */ + return p; +} + + +static int incomplete (lua_State *L, int status) { + if (status == LUA_ERRSYNTAX) { + size_t lmsg; + const char *msg = lua_tolstring(L, -1, &lmsg); + const char *tp = msg + lmsg - (sizeof(LUA_QL("")) - 1); + if (strstr(msg, LUA_QL("")) == tp) { + lua_pop(L, 1); + return 1; + } + } + return 0; /* else... */ +} + + +static int pushline (lua_State *L, int firstline) { + char buffer[LUA_MAXINPUT]; + char *b = buffer; + size_t l; + const char *prmt = get_prompt(L, firstline); + if (lua_readline(L, b, prmt) == 0) + return 0; /* no input */ + l = strlen(b); + if (l > 0 && b[l-1] == '\n') /* line ends with newline? */ + b[l-1] = '\0'; /* remove it */ + if (firstline && b[0] == '=') /* first line starts with `=' ? */ + lua_pushfstring(L, "return %s", b+1); /* change it to `return' */ + else + lua_pushstring(L, b); + lua_freeline(L, b); + return 1; +} + + +static int loadline (lua_State *L) { + int status; + lua_settop(L, 0); + if (!pushline(L, 1)) + return -1; /* no input */ + for (;;) { /* repeat until gets a complete line */ + status = luaL_loadbuffer(L, lua_tostring(L, 1), lua_strlen(L, 1), "=stdin"); + if (!incomplete(L, status)) break; /* cannot try to add lines? */ + if (!pushline(L, 0)) /* no more input? */ + return -1; + lua_pushliteral(L, "\n"); /* add a new line... */ + lua_insert(L, -2); /* ...between the two lines */ + lua_concat(L, 3); /* join them */ + } + lua_saveline(L, 1); + lua_remove(L, 1); /* remove line */ + return status; +} + + +static void dotty (lua_State *L) { + int status; + const char *oldprogname = progname; + progname = NULL; + while ((status = loadline(L)) != -1) { + if (status == 0) status = docall(L, 0, 0); + report(L, status); + if (status == 0 && lua_gettop(L) > 0) { /* any result to print? */ + lua_getglobal(L, "print"); + lua_insert(L, 1); + if (lua_pcall(L, lua_gettop(L)-1, 0, 0) != 0) + l_message(progname, lua_pushfstring(L, + "error calling " LUA_QL("print") " (%s)", + lua_tostring(L, -1))); + } + } + lua_settop(L, 0); /* clear stack */ + fputs("\n", stdout); + fflush(stdout); + progname = oldprogname; +} + + +static int handle_script (lua_State *L, char **argv, int n) { + int status; + const char *fname; + int narg = getargs(L, argv, n); /* collect arguments */ + lua_setglobal(L, "arg"); + fname = argv[n]; + if (strcmp(fname, "-") == 0 && strcmp(argv[n-1], "--") != 0) + fname = NULL; /* stdin */ + status = luaL_loadfile(L, fname); + lua_insert(L, -(narg+1)); + if (status == 0) + status = docall(L, narg, 0); + else + lua_pop(L, narg); + return report(L, status); +} + + +static int collectargs (char **argv, int *pi, int *pv, int *pe) { + int i; + for (i = 1; argv[i] != NULL; i++) { + if (argv[i][0] != '-') /* not an option? */ + return i; + switch (argv[i][1]) { /* option */ + case '-': return (argv[i+1] != NULL ? i+1 : 0); + case '\0': return i; + case 'i': *pi = 1; /* go through */ + case 'v': *pv = 1; break; + case 'e': *pe = 1; /* go through */ + case 'l': + if (argv[i][2] == '\0') { + i++; + if (argv[i] == NULL) return -1; + } + break; + default: return -1; /* invalid option */ + } + } + return 0; +} + + +static int runargs (lua_State *L, char **argv, int n) { + int i; + for (i = 1; i < n; i++) { + if (argv[i] == NULL) continue; + lua_assert(argv[i][0] == '-'); + switch (argv[i][1]) { /* option */ + case 'e': { + const char *chunk = argv[i] + 2; + if (*chunk == '\0') chunk = argv[++i]; + lua_assert(chunk != NULL); + if (dostring(L, chunk, "=(command line)") != 0) + return 1; + break; + } + case 'l': { + const char *filename = argv[i] + 2; + if (*filename == '\0') filename = argv[++i]; + lua_assert(filename != NULL); + if (dolibrary(L, filename)) + return 1; /* stop if file fails */ + break; + } + default: break; + } + } + return 0; +} + + +static int handle_luainit (lua_State *L) { + const char *init = getenv("LUA_INIT"); + if (init == NULL) return 0; /* status OK */ + else if (init[0] == '@') + return dofile(L, init+1); + else + return dostring(L, init, "=LUA_INIT"); +} + + +struct Smain { + int argc; + char **argv; + int status; +}; + + +static int pmain (lua_State *L) { + struct Smain *s = (struct Smain *)lua_touserdata(L, 1); + char **argv = s->argv; + int script; + int has_i = 0, has_v = 0, has_e = 0; + globalL = L; + if (argv[0] && argv[0][0]) progname = argv[0]; + lua_gc(L, LUA_GCSTOP, 0); /* stop collector during initialization */ + luaL_openlibs(L); /* open libraries */ + lua_gc(L, LUA_GCRESTART, 0); + s->status = handle_luainit(L); + if (s->status != 0) return 0; + script = collectargs(argv, &has_i, &has_v, &has_e); + if (script < 0) { /* invalid args? */ + print_usage(); + s->status = 1; + return 0; + } + if (has_v) print_version(); + s->status = runargs(L, argv, (script > 0) ? script : s->argc); + if (s->status != 0) return 0; + if (script) + s->status = handle_script(L, argv, script); + if (s->status != 0) return 0; + if (has_i) + dotty(L); + else if (script == 0 && !has_e && !has_v) { + if (lua_stdin_is_tty()) { + print_version(); + dotty(L); + } + else dofile(L, NULL); /* executes stdin as a file */ + } + return 0; +} + + +int main (int argc, char **argv) { + int status; + struct Smain s; + lua_State *L = lua_open(); /* create state */ + if (L == NULL) { + l_message(argv[0], "cannot create state: not enough memory"); + return EXIT_FAILURE; + } + s.argc = argc; + s.argv = argv; + status = lua_cpcall(L, &pmain, &s); + report(L, status); + lua_close(L); + return (status || s.status) ? EXIT_FAILURE : EXIT_SUCCESS; +} + diff --git a/ref/lua-5.1/src/lua.h b/ref/lua-5.1/src/lua.h new file mode 100644 index 0000000..881f834 --- /dev/null +++ b/ref/lua-5.1/src/lua.h @@ -0,0 +1,384 @@ +/* +** $Id: lua.h,v 1.216 2006/01/10 12:50:13 roberto Exp $ +** Lua - An Extensible Extension 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 "Lua 5.1" +#define LUA_VERSION_NUM 501 +#define LUA_COPYRIGHT "Copyright (C) 1994-2006 Lua.org, PUC-Rio" +#define LUA_AUTHORS "R. Ierusalimschy, L. H. de Figueiredo & W. Celes" + + +/* mark for precompiled code (`Lua') */ +#define LUA_SIGNATURE "\033Lua" + +/* option for multiple returns in `lua_pcall' and `lua_call' */ +#define LUA_MULTRET (-1) + + +/* +** pseudo-indices +*/ +#define LUA_REGISTRYINDEX (-10000) +#define LUA_ENVIRONINDEX (-10001) +#define LUA_GLOBALSINDEX (-10002) +#define lua_upvalueindex(i) (LUA_GLOBALSINDEX-(i)) + + +/* thread status; 0 is OK */ +#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; + +typedef int (*lua_CFunction) (lua_State *L); + + +/* +** functions that read/write blocks when loading/dumping Lua chunks +*/ +typedef const char * (*lua_Reader) (lua_State *L, void *ud, size_t *sz); + +typedef int (*lua_Writer) (lua_State *L, const void* p, size_t sz, void* ud); + + +/* +** prototype for memory-allocation functions +*/ +typedef void * (*lua_Alloc) (void *ud, void *ptr, size_t osize, size_t nsize); + + +/* +** basic types +*/ +#define LUA_TNONE (-1) + +#define LUA_TNIL 0 +#define LUA_TBOOLEAN 1 +#define LUA_TLIGHTUSERDATA 2 +#define LUA_TNUMBER 3 +#define LUA_TSTRING 4 +#define LUA_TTABLE 5 +#define LUA_TFUNCTION 6 +#define LUA_TUSERDATA 7 +#define LUA_TTHREAD 8 + + + +/* minimum Lua stack available to a C function */ +#define LUA_MINSTACK 20 + + +/* +** generic extra include file +*/ +#if defined(LUA_USER_H) +#include LUA_USER_H +#endif + + +/* type of numbers in Lua */ +typedef LUA_NUMBER lua_Number; + + +/* type for integer functions */ +typedef LUA_INTEGER lua_Integer; + + + +/* +** state manipulation +*/ +LUA_API lua_State *(lua_newstate) (lua_Alloc f, void *ud); +LUA_API void (lua_close) (lua_State *L); +LUA_API lua_State *(lua_newthread) (lua_State *L); + +LUA_API lua_CFunction (lua_atpanic) (lua_State *L, lua_CFunction panicf); + + +/* +** basic stack manipulation +*/ +LUA_API int (lua_gettop) (lua_State *L); +LUA_API void (lua_settop) (lua_State *L, int idx); +LUA_API void (lua_pushvalue) (lua_State *L, int idx); +LUA_API void (lua_remove) (lua_State *L, int idx); +LUA_API void (lua_insert) (lua_State *L, int idx); +LUA_API void (lua_replace) (lua_State *L, int idx); +LUA_API int (lua_checkstack) (lua_State *L, int sz); + +LUA_API void (lua_xmove) (lua_State *from, lua_State *to, int n); + + +/* +** access functions (stack -> C) +*/ + +LUA_API int (lua_isnumber) (lua_State *L, int idx); +LUA_API int (lua_isstring) (lua_State *L, int idx); +LUA_API int (lua_iscfunction) (lua_State *L, int idx); +LUA_API int (lua_isuserdata) (lua_State *L, int idx); +LUA_API int (lua_type) (lua_State *L, int idx); +LUA_API const char *(lua_typename) (lua_State *L, int tp); + +LUA_API int (lua_equal) (lua_State *L, int idx1, int idx2); +LUA_API int (lua_rawequal) (lua_State *L, int idx1, int idx2); +LUA_API int (lua_lessthan) (lua_State *L, int idx1, int idx2); + +LUA_API lua_Number (lua_tonumber) (lua_State *L, int idx); +LUA_API lua_Integer (lua_tointeger) (lua_State *L, int idx); +LUA_API int (lua_toboolean) (lua_State *L, int idx); +LUA_API const char *(lua_tolstring) (lua_State *L, int idx, size_t *len); +LUA_API size_t (lua_objlen) (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); + + +/* +** push functions (C -> stack) +*/ +LUA_API void (lua_pushnil) (lua_State *L); +LUA_API void (lua_pushnumber) (lua_State *L, lua_Number n); +LUA_API void (lua_pushinteger) (lua_State *L, lua_Integer n); +LUA_API void (lua_pushlstring) (lua_State *L, const char *s, size_t l); +LUA_API void (lua_pushstring) (lua_State *L, const char *s); +LUA_API const char *(lua_pushvfstring) (lua_State *L, const char *fmt, + va_list argp); +LUA_API const char *(lua_pushfstring) (lua_State *L, const char *fmt, ...); +LUA_API void (lua_pushcclosure) (lua_State *L, lua_CFunction fn, int n); +LUA_API void (lua_pushboolean) (lua_State *L, int b); +LUA_API void (lua_pushlightuserdata) (lua_State *L, void *p); +LUA_API int (lua_pushthread) (lua_State *L); + + +/* +** get functions (Lua -> stack) +*/ +LUA_API void (lua_gettable) (lua_State *L, int idx); +LUA_API void (lua_getfield) (lua_State *L, int idx, const char *k); +LUA_API void (lua_rawget) (lua_State *L, int idx); +LUA_API void (lua_rawgeti) (lua_State *L, int idx, int n); +LUA_API void (lua_createtable) (lua_State *L, int narr, int nrec); +LUA_API void *(lua_newuserdata) (lua_State *L, size_t sz); +LUA_API int (lua_getmetatable) (lua_State *L, int objindex); +LUA_API void (lua_getfenv) (lua_State *L, int idx); + + +/* +** set functions (stack -> Lua) +*/ +LUA_API void (lua_settable) (lua_State *L, int idx); +LUA_API void (lua_setfield) (lua_State *L, int idx, const char *k); +LUA_API void (lua_rawset) (lua_State *L, int idx); +LUA_API void (lua_rawseti) (lua_State *L, int idx, int n); +LUA_API int (lua_setmetatable) (lua_State *L, int objindex); +LUA_API int (lua_setfenv) (lua_State *L, int idx); + + +/* +** `load' and `call' functions (load and run Lua code) +*/ +LUA_API void (lua_call) (lua_State *L, int nargs, int nresults); +LUA_API int (lua_pcall) (lua_State *L, int nargs, int nresults, int errfunc); +LUA_API int (lua_cpcall) (lua_State *L, lua_CFunction func, void *ud); +LUA_API int (lua_load) (lua_State *L, lua_Reader reader, void *dt, + const char *chunkname); + +LUA_API int (lua_dump) (lua_State *L, lua_Writer writer, void *data); + + +/* +** coroutine functions +*/ +LUA_API int (lua_yield) (lua_State *L, int nresults); +LUA_API int (lua_resume) (lua_State *L, int narg); +LUA_API int (lua_status) (lua_State *L); + +/* +** garbage-collection function and options +*/ + +#define LUA_GCSTOP 0 +#define LUA_GCRESTART 1 +#define LUA_GCCOLLECT 2 +#define LUA_GCCOUNT 3 +#define LUA_GCCOUNTB 4 +#define LUA_GCSTEP 5 +#define LUA_GCSETPAUSE 6 +#define LUA_GCSETSTEPMUL 7 + +LUA_API int (lua_gc) (lua_State *L, int what, int data); + + +/* +** miscellaneous functions +*/ + +LUA_API int (lua_error) (lua_State *L); + +LUA_API int (lua_next) (lua_State *L, int idx); + +LUA_API void (lua_concat) (lua_State *L, int n); + +LUA_API lua_Alloc (lua_getallocf) (lua_State *L, void **ud); +LUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud); + + + +/* +** =============================================================== +** some useful macros +** =============================================================== +*/ + +#define lua_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_strlen(L,i) lua_objlen(L, (i)) + +#define lua_isfunction(L,n) (lua_type(L, (n)) == LUA_TFUNCTION) +#define lua_istable(L,n) (lua_type(L, (n)) == LUA_TTABLE) +#define lua_islightuserdata(L,n) (lua_type(L, (n)) == LUA_TLIGHTUSERDATA) +#define lua_isnil(L,n) (lua_type(L, (n)) == LUA_TNIL) +#define lua_isboolean(L,n) (lua_type(L, (n)) == LUA_TBOOLEAN) +#define lua_isthread(L,n) (lua_type(L, (n)) == LUA_TTHREAD) +#define lua_isnone(L,n) (lua_type(L, (n)) == LUA_TNONE) +#define lua_isnoneornil(L, n) (lua_type(L, (n)) <= 0) + +#define lua_pushliteral(L, s) \ + lua_pushlstring(L, "" s, (sizeof(s)/sizeof(char))-1) + +#define lua_setglobal(L,s) lua_setfield(L, LUA_GLOBALSINDEX, (s)) +#define lua_getglobal(L,s) lua_getfield(L, LUA_GLOBALSINDEX, (s)) + +#define lua_tostring(L,i) lua_tolstring(L, (i), NULL) + + + +/* +** compatibility macros and functions +*/ + +#define lua_open() luaL_newstate() + +#define lua_getregistry(L) lua_pushvalue(L, LUA_REGISTRYINDEX) + +#define lua_getgccount(L) lua_gc(L, LUA_GCCOUNT, 0) + +#define lua_Chunkreader lua_Reader +#define lua_Chunkwriter lua_Writer + + + +/* +** {====================================================================== +** Debug API +** ======================================================================= +*/ + + +/* +** Event codes +*/ +#define LUA_HOOKCALL 0 +#define LUA_HOOKRET 1 +#define LUA_HOOKLINE 2 +#define LUA_HOOKCOUNT 3 +#define LUA_HOOKTAILRET 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 debuger 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 int lua_sethook (lua_State *L, lua_Hook func, int mask, int count); +LUA_API lua_Hook lua_gethook (lua_State *L); +LUA_API int lua_gethookmask (lua_State *L); +LUA_API int lua_gethookcount (lua_State *L); + + +struct lua_Debug { + int event; + const char *name; /* (n) */ + const char *namewhat; /* (n) `global', `local', `field', `method' */ + const char *what; /* (S) `Lua', `C', `main', `tail' */ + const char *source; /* (S) */ + int currentline; /* (l) */ + int nups; /* (u) number of upvalues */ + int linedefined; /* (S) */ + int lastlinedefined; /* (S) */ + char short_src[LUA_IDSIZE]; /* (S) */ + /* private part */ + int i_ci; /* active function */ +}; + +/* }====================================================================== */ + + +/****************************************************************************** +* Copyright (C) 1994-2006 Lua.org, PUC-Rio. All rights reserved. +* +* 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/ref/lua-5.1/src/luac.c b/ref/lua-5.1/src/luac.c new file mode 100644 index 0000000..2dd76b7 --- /dev/null +++ b/ref/lua-5.1/src/luac.c @@ -0,0 +1,196 @@ +/* +** $Id: luac.c,v 1.52 2005/11/11 14:03:13 lhf Exp $ +** Lua compiler (saves bytecodes to files; also list bytecodes) +** See Copyright Notice in lua.h +*/ + +#include +#include +#include +#include + +#define luac_c +#define LUA_CORE + +#include "lua.h" +#include "lauxlib.h" + +#include "ldo.h" +#include "lfunc.h" +#include "lmem.h" +#include "lobject.h" +#include "lopcodes.h" +#include "lstring.h" +#include "lundump.h" + +#define PROGNAME "luac" /* default program name */ +#define OUTPUT PROGNAME ".out" /* default output file */ + +static int listing=0; /* list bytecodes? */ +static int dumping=1; /* dump bytecodes? */ +static int stripping=0; /* strip debug information? */ +static char Output[]={ OUTPUT }; /* default output file name */ +static const char* output=Output; /* actual output file name */ +static const char* progname=PROGNAME; /* actual program name */ + +static void fatal(const char* message) +{ + fprintf(stderr,"%s: %s\n",progname,message); + exit(EXIT_FAILURE); +} + +static void cannot(const char* what) +{ + fprintf(stderr,"%s: cannot %s %s: %s\n",progname,what,output,strerror(errno)); + exit(EXIT_FAILURE); +} + +static void usage(const char* message) +{ + if (*message=='-') + fprintf(stderr,"%s: unrecognized option " LUA_QS "\n",progname,message); + else + fprintf(stderr,"%s: %s\n",progname,message); + fprintf(stderr, + "usage: %s [options] [filenames].\n" + "Available options are:\n" + " - process stdin\n" + " -l list\n" + " -o name output to file " LUA_QL("name") " (default is \"%s\")\n" + " -p parse only\n" + " -s strip debug information\n" + " -v show version information\n" + " -- stop handling options\n", + progname,Output); + exit(EXIT_FAILURE); +} + +#define IS(s) (strcmp(argv[i],s)==0) + +static int doargs(int argc, char* argv[]) +{ + int i; + if (argv[0]!=NULL && *argv[0]!=0) progname=argv[0]; + for (i=1; itop+(i))->l.p) + +static Proto* combine(lua_State* L, int n) +{ + if (n==1) + return toproto(L,-1); + else + { + int i,pc; + Proto* f=luaF_newproto(L); + setptvalue2s(L,L->top,f); incr_top(L); + f->source=luaS_newliteral(L,"=(" PROGNAME ")"); + f->maxstacksize=1; + pc=2*n+1; + f->code=luaM_newvector(L,pc,Instruction); + f->sizecode=pc; + f->p=luaM_newvector(L,n,Proto*); + f->sizep=n; + pc=0; + for (i=0; ip[i]=toproto(L,i-n-1); + f->code[pc++]=CREATE_ABx(OP_CLOSURE,0,i); + f->code[pc++]=CREATE_ABC(OP_CALL,0,1,1); + } + f->code[pc++]=CREATE_ABC(OP_RETURN,0,1,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); +} + +struct Smain { + int argc; + char** argv; +}; + +static int pmain(lua_State* L) +{ + struct Smain* s = (struct Smain*)lua_touserdata(L, 1); + int argc=s->argc; + char** argv=s->argv; + Proto* f; + int i; + if (!lua_checkstack(L,argc)) fatal("too many input files"); + for (i=0; i1); + if (dumping) + { + FILE* D= (output==NULL) ? stdout : fopen(output,"wb"); + if (D==NULL) cannot("open"); + lua_lock(L); + luaU_dump(L,f,writer,D,stripping); + lua_unlock(L); + if (ferror(D)) cannot("write"); + if (fclose(D)) cannot("close"); + } + return 0; +} + +int main(int argc, char* argv[]) +{ + lua_State* L; + struct Smain s; + int i=doargs(argc,argv); + argc-=i; argv+=i; + if (argc<=0) usage("no input files given"); + L=lua_open(); + if (L==NULL) fatal("not enough memory for state"); + s.argc=argc; + s.argv=argv; + if (lua_cpcall(L,pmain,&s)!=0) fatal(lua_tostring(L,-1)); + lua_close(L); + return EXIT_SUCCESS; +} diff --git a/ref/lua-5.1/src/luaconf.h b/ref/lua-5.1/src/luaconf.h new file mode 100644 index 0000000..97a3e30 --- /dev/null +++ b/ref/lua-5.1/src/luaconf.h @@ -0,0 +1,736 @@ +/* +** $Id: luaconf.h,v 1.81 2006/02/10 17:44:06 roberto Exp $ +** Configuration file for Lua +** See Copyright Notice in lua.h +*/ + + +#ifndef lconfig_h +#define lconfig_h + +#include +#include + + +/* +** ================================================================== +** Search for "@@" to find all configurable definitions. +** =================================================================== +*/ + + +/* +@@ LUA_ANSI controls the use of non-ansi features. +** CHANGE it (define it) if you want Lua to avoid the use of any +** non-ansi feature or library. +*/ +#if defined(__STRICT_ANSI__) +#define LUA_ANSI +#endif + + +#if !defined(LUA_ANSI) && defined(_WIN32) +#define LUA_WIN +#endif + +#if defined(LUA_USE_LINUX) +#define LUA_USE_POSIX +#define LUA_USE_DLOPEN /* needs an extra library: -ldl */ +#define LUA_USE_READLINE /* needs some extra libraries */ +#endif + +#if defined(LUA_USE_MACOSX) +#define LUA_USE_POSIX +#define LUA_DL_DYLD /* does not need extra library */ +#endif + + + +/* +@@ LUA_USE_POSIX includes all functionallity listed as X/Open System +@* Interfaces Extension (XSI). +** CHANGE it (define it) if your system is XSI compatible. +*/ +#if defined(LUA_USE_POSIX) +#define LUA_USE_MKSTEMP +#define LUA_USE_ISATTY +#define LUA_USE_POPEN +#define LUA_USE_ULONGJMP +#endif + + +/* +@@ LUA_PATH_DEFAULT is the default path that Lua uses to look for +@* Lua libraries. +@@ LUA_CPATH_DEFAULT is the default path that Lua uses to look for +@* C libraries. +** CHANGE them if your machine has a non-conventional directory +** hierarchy or if you want to install your libraries in +** non-conventional directories. +*/ +#if defined(_WIN32) +/* +** In Windows, any exclamation mark ('!') in the path is replaced by the +** path of the directory of the executable file of the current process. +*/ +#define LUA_LDIR "!\\lua\\" +#define LUA_CDIR "!\\" +#define LUA_PATH_DEFAULT \ + ".\\?.lua;" LUA_LDIR"?.lua;" LUA_LDIR"?\\init.lua;" \ + LUA_CDIR"?.lua;" LUA_CDIR"?\\init.lua" +#define LUA_CPATH_DEFAULT \ + ".\\?.dll;" LUA_CDIR"?.dll;" LUA_CDIR"loadall.dll" + +#else +#define LUA_ROOT "/usr/local/" +#define LUA_LDIR LUA_ROOT "share/lua/5.1/" +#define LUA_CDIR LUA_ROOT "lib/lua/5.1/" +#define LUA_PATH_DEFAULT \ + "./?.lua;" LUA_LDIR"?.lua;" LUA_LDIR"?/init.lua;" \ + LUA_CDIR"?.lua;" LUA_CDIR"?/init.lua" +#define LUA_CPATH_DEFAULT \ + "./?.so;" LUA_CDIR"?.so;" LUA_CDIR"loadall.so" +#endif + + +/* +@@ LUA_DIRSEP is the directory separator (for submodules). +** CHANGE it if your machine does not use "/" as the directory separator +** and is not Windows. (On Windows Lua automatically uses "\".) +*/ +#if defined(_WIN32) +#define LUA_DIRSEP "\\" +#else +#define LUA_DIRSEP "/" +#endif + + +/* +@@ LUA_PATHSEP is the character that separates templates in a path. +@@ LUA_PATH_MARK is the string that marks the substitution points in a +@* template. +@@ LUA_EXECDIR in a Windows path is replaced by the executable's +@* directory. +@@ LUA_IGMARK is a mark to ignore all before it when bulding the +@* luaopen_ function name. +** CHANGE them if for some reason your system cannot use those +** characters. (E.g., if one of those characters is a common character +** in file/directory names.) Probably you do not need to change them. +*/ +#define LUA_PATHSEP ";" +#define LUA_PATH_MARK "?" +#define LUA_EXECDIR "!" +#define LUA_IGMARK "-" + + +/* +@@ LUA_INTEGER is the integral type used by lua_pushinteger/lua_tointeger. +** CHANGE that if ptrdiff_t is not adequate on your machine. (On most +** machines, ptrdiff_t gives a good choice between int or long.) +*/ +#define LUA_INTEGER ptrdiff_t + + +/* +@@ LUA_API is a mark for all core API functions. +@@ LUALIB_API is a mark for all standard library 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 + + +/* +@@ LUAI_FUNC is a mark for all extern functions that are not to be +@* exported to outside modules. +@@ LUAI_DATA is a mark for all extern (const) variables that are not to +@* be exported to outside modules. +** 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. +*/ +#if defined(luaall_c) +#define LUAI_FUNC static +#define LUAI_DATA /* empty */ + +#elif defined(__GNUC__) && ((__GNUC__*100 + __GNUC_MINOR__) >= 302) && \ + defined(__ELF__) +#define LUAI_FUNC __attribute__((visibility("hidden"))) extern +#define LUAI_DATA LUAI_FUNC + +#else +#define LUAI_FUNC extern +#define LUAI_DATA extern +#endif + + + +/* +@@ LUA_QL describes how error messages quote program elements. +** CHANGE it if you want a different appearance. +*/ +#define LUA_QL(x) "'" x "'" +#define LUA_QS LUA_QL("%s") + + +/* +@@ LUA_IDSIZE gives the maximum size for the description of the source +@* of a function in debug information. +** CHANGE it if you want a different size. +*/ +#define LUA_IDSIZE 60 + + +/* +** {================================================================== +** Stand-alone configuration +** =================================================================== +*/ + +#if defined(lua_c) || defined(luaall_c) + +/* +@@ lua_stdin_is_tty detects whether the standard input is a 'tty' (that +@* is, whether we're running lua interactively). +** CHANGE it if you have a better definition for non-POSIX/non-Windows +** systems. +*/ +#if defined(LUA_USE_ISATTY) +#include +#define lua_stdin_is_tty() isatty(0) +#elif defined(LUA_WIN) +#include +#include +#define lua_stdin_is_tty() _isatty(_fileno(stdin)) +#else +#define lua_stdin_is_tty() 1 /* assume stdin is a tty */ +#endif + + +/* +@@ LUA_PROMPT is the default prompt used by stand-alone Lua. +@@ LUA_PROMPT2 is the default continuation prompt used by stand-alone Lua. +** CHANGE them if you want different prompts. (You can also change the +** prompts dynamically, assigning to globals _PROMPT/_PROMPT2.) +*/ +#define LUA_PROMPT "> " +#define LUA_PROMPT2 ">> " + + +/* +@@ LUA_PROGNAME is the default name for the stand-alone Lua program. +** CHANGE it if your stand-alone interpreter has a different name and +** your system is not able to detect that name automatically. +*/ +#define LUA_PROGNAME "lua" + + +/* +@@ LUA_MAXINPUT is the maximum length for an input line in the +@* stand-alone interpreter. +** CHANGE it if you need longer lines. +*/ +#define LUA_MAXINPUT 512 + + +/* +@@ 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. +** CHANGE them if you want to improve this functionality (e.g., by using +** GNU readline and history facilities). +*/ +#if defined(LUA_USE_READLINE) +#include +#include +#include +#define lua_readline(L,b,p) ((void)L, ((b)=readline(p)) != NULL) +#define lua_saveline(L,idx) \ + if (lua_strlen(L,idx) > 0) /* non-empty line? */ \ + add_history(lua_tostring(L, idx)); /* add it to history */ +#define lua_freeline(L,b) ((void)L, free(b)) +#else +#define lua_readline(L,b,p) \ + ((void)L, fputs(p, stdout), fflush(stdout), /* show prompt */ \ + fgets(b, LUA_MAXINPUT, stdin) != NULL) /* get line */ +#define lua_saveline(L,idx) { (void)L; (void)idx; } +#define lua_freeline(L,b) { (void)L; (void)b; } +#endif + +#endif + +/* }================================================================== */ + + +/* +@@ LUAI_GCPAUSE defines the default pause between garbage-collector cycles +@* as a percentage. +** CHANGE it if you want the GC to run faster or slower (higher values +** mean larger pauses which mean slower collection.) You can also change +** this value dynamically. +*/ +#define LUAI_GCPAUSE 200 /* 200% (wait memory to double before next GC) */ + + +/* +@@ LUAI_GCMUL defines the default speed of garbage collection relative to +@* memory allocation as a percentage. +** CHANGE it if you want to change the granularity of the garbage +** collection. (Higher values mean coarser collections. 0 represents +** infinity, where each step performs a full collection.) You can also +** change this value dynamically. +*/ +#define LUAI_GCMUL 200 /* GC runs 'twice the speed' of memory allocation */ + + + +/* +@@ LUA_COMPAT_GETN controls compatibility with old getn behavior. +** CHANGE it (define it) if you want exact compatibility with the +** behavior of setn/getn in Lua 5.0. +*/ +#undef LUA_COMPAT_GETN + +/* +@@ LUA_COMPAT_LOADLIB controls compatibility about global loadlib. +** CHANGE it to undefined as soon as you do not need a global 'loadlib' +** function (the function is still available as 'package.loadlib'). +*/ +#undef LUA_COMPAT_LOADLIB + +/* +@@ LUA_COMPAT_VARARG controls compatibility with old vararg feature. +** CHANGE it to undefined as soon as your programs use only '...' to +** access vararg parameters (instead of the old 'arg' table). +*/ +#define LUA_COMPAT_VARARG + +/* +@@ LUA_COMPAT_MOD controls compatibility with old math.mod function. +** CHANGE it to undefined as soon as your programs use 'math.fmod' or +** the new '%' operator instead of 'math.mod'. +*/ +#define LUA_COMPAT_MOD + +/* +@@ LUA_COMPAT_LSTR controls compatibility with old long string nesting +@* facility. +** CHANGE it to 2 if you want the old behaviour, or undefine it to turn +** off the advisory error when nesting [[...]]. +*/ +#define LUA_COMPAT_LSTR 1 + +/* +@@ LUA_COMPAT_GFIND controls compatibility with old 'string.gfind' name. +** CHANGE it to undefined as soon as you rename 'string.gfind' to +** 'string.gmatch'. +*/ +#define LUA_COMPAT_GFIND + +/* +@@ LUA_COMPAT_OPENLIB controls compatibility with old 'luaL_openlib' +@* behavior. +** CHANGE it to undefined as soon as you replace to 'luaL_registry' +** your uses of 'luaL_openlib' +*/ +#define LUA_COMPAT_OPENLIB + + + +/* +@@ luai_apicheck is the assert macro used by the Lua-C API. +** CHANGE luai_apicheck if you want Lua to perform some checks in the +** parameters it gets from API calls. This may slow down the interpreter +** a bit, but may be quite useful when debugging C code that interfaces +** with Lua. A useful redefinition is to use assert.h. +*/ +#if defined(LUA_USE_APICHECK) +#include +#define luai_apicheck(L,o) { (void)L; assert(o); } +#else +#define luai_apicheck(L,o) { (void)L; } +#endif + + +/* +@@ LUAI_BITSINT defines the number of bits in an int. +** CHANGE here if Lua cannot automatically detect the number of bits of +** your machine. Probably you do not need to change this. +*/ +/* avoid overflows in comparison */ +#if INT_MAX-20 < 32760 +#define LUAI_BITSINT 16 +#elif INT_MAX > 2147483640L +/* int has at least 32 bits */ +#define LUAI_BITSINT 32 +#else +#error "you must define LUA_BITSINT with number of bits in an integer" +#endif + + +/* +@@ LUAI_UINT32 is an unsigned integer with at least 32 bits. +@@ LUAI_INT32 is an signed integer with at least 32 bits. +@@ LUAI_UMEM is an unsigned integer big enough to count the total +@* memory used by Lua. +@@ LUAI_MEM is a signed integer big enough to count the total memory +@* used by Lua. +** CHANGE here if for some weird reason the default definitions are not +** good enough for your machine. (The definitions in the 'else' +** part always works, but may waste space on machines with 64-bit +** longs.) Probably you do not need to change this. +*/ +#if LUAI_BITSINT >= 32 +#define LUAI_UINT32 unsigned int +#define LUAI_INT32 int +#define LUAI_MAXINT32 INT_MAX +#define LUAI_UMEM size_t +#define LUAI_MEM ptrdiff_t +#else +/* 16-bit ints */ +#define LUAI_UINT32 unsigned long +#define LUAI_INT32 long +#define LUAI_MAXINT32 LONG_MAX +#define LUAI_UMEM unsigned long +#define LUAI_MEM long +#endif + + +/* +@@ LUAI_MAXCALLS limits the number of nested calls. +** CHANGE it if you need really deep recursive calls. This limit is +** arbitrary; its only purpose is to stop infinite recursion before +** exhausting memory. +*/ +#define LUAI_MAXCALLS 20000 + + +/* +@@ LUAI_MAXCSTACK limits the number of Lua stack slots that a C function +@* can use. +** CHANGE it if you need lots of (Lua) stack space for your C +** functions. This limit is arbitrary; its only purpose is to stop C +** functions to consume unlimited stack space. +*/ +#define LUAI_MAXCSTACK 2048 + + + +/* +** {================================================================== +** CHANGE (to smaller values) the following definitions if your system +** has a small C stack. (Or you may want to change them to larger +** values if your system has a large C stack and these limits are +** too rigid for you.) Some of these constants control the size of +** stack-allocated arrays used by the compiler or the interpreter, while +** others limit the maximum number of recursive calls that the compiler +** or the interpreter can perform. Values too large may cause a C stack +** overflow for some forms of deep constructs. +** =================================================================== +*/ + + +/* +@@ LUAI_MAXCCALLS is the maximum depth for nested C calls (short) and +@* syntactical nested non-terminals in a program. +*/ +#define LUAI_MAXCCALLS 200 + + +/* +@@ LUAI_MAXVARS is the maximum number of local variables per function +@* (must be smaller than 250). +*/ +#define LUAI_MAXVARS 200 + + +/* +@@ LUAI_MAXUPVALUES is the maximum number of upvalues per function +@* (must be smaller than 250). +*/ +#define LUAI_MAXUPVALUES 60 + + +/* +@@ LUAL_BUFFERSIZE is the buffer size used by the lauxlib buffer system. +*/ +#define LUAL_BUFFERSIZE BUFSIZ + +/* }================================================================== */ + + + + +/* +** {================================================================== +@@ LUA_NUMBER is the type of numbers in Lua. +** CHANGE the following definitions only if you want to build Lua +** with a number type different from double. You may also need to +** change lua_number2int & lua_number2integer. +** =================================================================== +*/ + +#define LUA_NUMBER_DOUBLE +#define LUA_NUMBER double + +/* +@@ LUAI_UACNUMBER is the result of an 'usual argument conversion' +@* over a number. +*/ +#define LUAI_UACNUMBER double + + +/* +@@ LUA_NUMBER_SCAN is the format for reading numbers. +@@ LUA_NUMBER_FMT is the format for writing numbers. +@@ lua_number2str converts a number to a string. +@@ LUAI_MAXNUMBER2STR is maximum size of previous conversion. +@@ lua_str2number converts a string to a number. +*/ +#define LUA_NUMBER_SCAN "%lf" +#define LUA_NUMBER_FMT "%.14g" +#define lua_number2str(s,n) sprintf((s), LUA_NUMBER_FMT, (n)) +#define LUAI_MAXNUMBER2STR 32 /* 16 digits, sign, point, and \0 */ +#define lua_str2number(s,p) strtod((s), (p)) + + +/* +@@ The luai_num* macros define the primitive operations over numbers. +*/ +#if defined(LUA_CORE) +#include +#define luai_numadd(a,b) ((a)+(b)) +#define luai_numsub(a,b) ((a)-(b)) +#define luai_nummul(a,b) ((a)*(b)) +#define luai_numdiv(a,b) ((a)/(b)) +#define luai_nummod(a,b) ((a) - floor((a)/(b))*(b)) +#define luai_numpow(a,b) (pow(a,b)) +#define luai_numunm(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_numisnan(a) (!luai_numeq((a), (a))) +#endif + + +/* +@@ lua_number2int is a macro to convert lua_Number to int. +@@ lua_number2integer is a macro to convert lua_Number to lua_Integer. +** CHANGE them if you know a faster way to convert a lua_Number to +** int (with any rounding method and without throwing errors) in your +** system. In Pentium machines, a naive typecast from double to int +** in C is extremely slow, so any alternative is worth trying. +*/ + +/* On a Pentium, resort to a trick */ +#if defined(LUA_NUMBER_DOUBLE) && !defined(LUA_ANSI) && !defined(__SSE2__) && \ + (defined(__i386) || defined (_M_IX86) || defined(__i386__)) +union luai_Cast { double l_d; long l_l; }; +#define lua_number2int(i,d) \ + { volatile union luai_Cast u; u.l_d = (d) + 6755399441055744.0; (i) = u.l_l; } +#define lua_number2integer(i,n) lua_number2int(i, n) + +/* this option always works, but may be slow */ +#else +#define lua_number2int(i,d) ((i)=(int)(d)) +#define lua_number2integer(i,d) ((i)=(lua_Integer)(d)) + +#endif + +/* }================================================================== */ + + +/* +@@ LUAI_USER_ALIGNMENT_T is a type that requires maximum alignment. +** CHANGE it if your system requires alignments larger than double. (For +** instance, if your system supports long doubles and they must be +** aligned in 16-byte boundaries, then you should add long double in the +** union.) Probably you do not need to change this. +*/ +#define LUAI_USER_ALIGNMENT_T union { double u; void *s; long l; } + + +/* +@@ LUAI_THROW/LUAI_TRY define how Lua does exception handling. +** CHANGE them if you prefer to use longjmp/setjmp even with C++ +** or if want/don't to use _longjmp/_setjmp instead of regular +** longjmp/setjmp. 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(__cplusplus) +/* C++ exceptions */ +#define LUAI_THROW(L,c) throw(c) +#define LUAI_TRY(L,c,a) try { a } catch(...) \ + { if ((c)->status == 0) (c)->status = -1; } +#define luai_jmpbuf int /* dummy variable */ + +#elif defined(LUA_USE_ULONGJMP) +/* in Unix, try _longjmp/_setjmp (more efficient) */ +#define LUAI_THROW(L,c) _longjmp((c)->b, 1) +#define LUAI_TRY(L,c,a) if (_setjmp((c)->b) == 0) { a } +#define luai_jmpbuf jmp_buf + +#else +/* default handling with long jumps */ +#define LUAI_THROW(L,c) longjmp((c)->b, 1) +#define LUAI_TRY(L,c,a) if (setjmp((c)->b) == 0) { a } +#define luai_jmpbuf jmp_buf + +#endif + + +/* +@@ LUA_MAXCAPTURES is the maximum number of captures that a pattern +@* can do during pattern-matching. +** CHANGE it if you need more captures. This limit is arbitrary. +*/ +#define LUA_MAXCAPTURES 32 + + +/* +@@ lua_tmpnam is the function that the OS library uses to create a +@* temporary name. +@@ LUA_TMPNAMBUFSIZE is the maximum size of a name created by lua_tmpnam. +** CHANGE them if you have an alternative to tmpnam (which is considered +** insecure) or if you want the original tmpnam anyway. By default, Lua +** uses tmpnam except when POSIX is available, where it uses mkstemp. +*/ +#if defined(loslib_c) || defined(luaall_c) + +#if defined(LUA_USE_MKSTEMP) +#include +#define LUA_TMPNAMBUFSIZE 32 +#define lua_tmpnam(b,e) { \ + strcpy(b, "/tmp/lua_XXXXXX"); \ + e = mkstemp(b); \ + if (e != -1) close(e); \ + e = (e == -1); } + +#else +#define LUA_TMPNAMBUFSIZE L_tmpnam +#define lua_tmpnam(b,e) { e = (tmpnam(b) == NULL); } +#endif + +#endif + + +/* +@@ lua_popen spawns a new process connected to the current one through +@* the file streams. +** CHANGE it if you have a way to implement it in your system. +*/ +#if defined(LUA_USE_POPEN) + +#define lua_popen(L,c,m) ((void)L, popen(c,m)) +#define lua_pclose(L,file) ((void)L, (pclose(file) != -1)) + +#elif defined(LUA_WIN) + +#define lua_popen(L,c,m) ((void)L, _popen(c,m)) +#define lua_pclose(L,file) ((void)L, (_pclose(file) != -1)) + +#else + +#define lua_popen(L,c,m) ((void)((void)c, m), \ + luaL_error(L, LUA_QL("popen") " not supported"), (FILE*)0) +#define lua_pclose(L,file) ((void)((void)L, file), 0) + +#endif + +/* +@@ LUA_DL_* define which dynamic-library system Lua should use. +** CHANGE here if Lua has problems choosing the appropriate +** dynamic-library system for your platform (either Windows' DLL, Mac's +** dyld, or Unix's dlopen). If your system is some kind of Unix, there +** is a good chance that it has dlopen, so LUA_DL_DLOPEN will work for +** it. To use dlopen you also need to adapt the src/Makefile (probably +** adding -ldl to the linker options), so Lua does not select it +** automatically. (When you change the makefile to add -ldl, you must +** also add -DLUA_USE_DLOPEN.) +** If you do not want any kind of dynamic library, undefine all these +** options. +** By default, _WIN32 gets LUA_DL_DLL and MAC OS X gets LUA_DL_DYLD. +*/ +#if defined(LUA_USE_DLOPEN) +#define LUA_DL_DLOPEN +#endif + +#if defined(LUA_WIN) +#define LUA_DL_DLL +#endif + + +/* +@@ LUAI_EXTRASPACE allows you to add user-specific data in a lua_State +@* (the data goes just *before* the lua_State pointer). +** CHANGE (define) this if you really need that. This value must be +** a multiple of the maximum alignment required for your machine. +*/ +#define LUAI_EXTRASPACE 0 + + +/* +@@ luai_userstate* allow user-specific actions on threads. +** CHANGE them if you defined LUAI_EXTRASPACE and need to do something +** extra when a thread is created/deleted/resumed/yielded. +*/ +#define luai_userstateopen(L) ((void)L) +#define luai_userstateclose(L) ((void)L) +#define luai_userstatethread(L,L1) ((void)L) +#define luai_userstatefree(L) ((void)L) +#define luai_userstateresume(L,n) ((void)L) +#define luai_userstateyield(L,n) ((void)L) + + +/* +@@ LUA_INTFRMLEN is the length modifier for integer conversions +@* in 'string.format'. +@@ LUA_INTFRM_T is the integer type correspoding to the previous length +@* modifier. +** CHANGE them if your system supports long long or does not support long. +*/ + +#if defined(LUA_USELONGLONG) + +#define LUA_INTFRMLEN "ll" +#define LUA_INTFRM_T long long + +#else + +#define LUA_INTFRMLEN "l" +#define LUA_INTFRM_T long + +#endif + + + +/* =================================================================== */ + +/* +** Local configuration. You can use this space to add your redefinitions +** without modifying the main part of the file. +*/ + + + +#endif + diff --git a/ref/lua-5.1/src/lualib.h b/ref/lua-5.1/src/lualib.h new file mode 100644 index 0000000..0c76232 --- /dev/null +++ b/ref/lua-5.1/src/lualib.h @@ -0,0 +1,53 @@ +/* +** $Id: lualib.h,v 1.36 2005/12/27 17:12:00 roberto Exp $ +** Lua standard libraries +** See Copyright Notice in lua.h +*/ + + +#ifndef lualib_h +#define lualib_h + +#include "lua.h" + + +/* Key to file-handle type */ +#define LUA_FILEHANDLE "FILE*" + + +#define LUA_COLIBNAME "coroutine" +LUALIB_API int (luaopen_base) (lua_State *L); + +#define LUA_TABLIBNAME "table" +LUALIB_API int (luaopen_table) (lua_State *L); + +#define LUA_IOLIBNAME "io" +LUALIB_API int (luaopen_io) (lua_State *L); + +#define LUA_OSLIBNAME "os" +LUALIB_API int (luaopen_os) (lua_State *L); + +#define LUA_STRLIBNAME "string" +LUALIB_API int (luaopen_string) (lua_State *L); + +#define LUA_MATHLIBNAME "math" +LUALIB_API int (luaopen_math) (lua_State *L); + +#define LUA_DBLIBNAME "debug" +LUALIB_API int (luaopen_debug) (lua_State *L); + +#define LUA_LOADLIBNAME "package" +LUALIB_API int (luaopen_package) (lua_State *L); + + +/* open all previous libraries */ +LUALIB_API void (luaL_openlibs) (lua_State *L); + + + +#ifndef lua_assert +#define lua_assert(x) ((void)0) +#endif + + +#endif diff --git a/ref/lua-5.1/src/lundump.c b/ref/lua-5.1/src/lundump.c new file mode 100644 index 0000000..7fc635e --- /dev/null +++ b/ref/lua-5.1/src/lundump.c @@ -0,0 +1,223 @@ +/* +** $Id: lundump.c,v 1.60 2006/02/16 15:53:49 lhf Exp $ +** load precompiled Lua chunks +** See Copyright Notice in lua.h +*/ + +#include + +#define lundump_c +#define LUA_CORE + +#include "lua.h" + +#include "ldebug.h" +#include "ldo.h" +#include "lfunc.h" +#include "lmem.h" +#include "lobject.h" +#include "lstring.h" +#include "lundump.h" +#include "lzio.h" + +typedef struct { + lua_State* L; + ZIO* Z; + Mbuffer* b; + const char* name; +} LoadState; + +#ifdef LUAC_TRUST_BINARIES +#define IF(c,s) +#else +#define IF(c,s) if (c) error(S,s) + +static void error(LoadState* S, const char* why) +{ + luaO_pushfstring(S->L,"%s: %s in precompiled chunk",S->name,why); + luaD_throw(S->L,LUA_ERRSYNTAX); +} +#endif + +#define LoadMem(S,b,n,size) LoadBlock(S,b,(n)*(size)) +#define LoadByte(S) (lu_byte)LoadChar(S) +#define LoadVar(S,x) LoadMem(S,&x,1,sizeof(x)) +#define LoadVector(S,b,n,size) LoadMem(S,b,n,size) + +static void LoadBlock(LoadState* S, void* b, size_t size) +{ + size_t r=luaZ_read(S->Z,b,size); + IF (r!=0, "unexpected end"); +} + +static int LoadChar(LoadState* S) +{ + char x; + LoadVar(S,x); + return x; +} + +static int LoadInt(LoadState* S) +{ + int x; + LoadVar(S,x); + IF (x<0, "bad integer"); + return x; +} + +static lua_Number LoadNumber(LoadState* S) +{ + lua_Number x; + LoadVar(S,x); + return x; +} + +static TString* LoadString(LoadState* S) +{ + size_t size; + LoadVar(S,size); + if (size==0) + return NULL; + else + { + char* s=luaZ_openspace(S->L,S->b,size); + LoadBlock(S,s,size); + return luaS_newlstr(S->L,s,size-1); /* remove trailing '\0' */ + } +} + +static void LoadCode(LoadState* S, Proto* f) +{ + int n=LoadInt(S); + f->code=luaM_newvector(S->L,n,Instruction); + f->sizecode=n; + LoadVector(S,f->code,n,sizeof(Instruction)); +} + +static Proto* LoadFunction(LoadState* S, TString* p); + +static void LoadConstants(LoadState* S, Proto* f) +{ + int i,n; + n=LoadInt(S); + f->k=luaM_newvector(S->L,n,TValue); + f->sizek=n; + for (i=0; ik[i]); + for (i=0; ik[i]; + int t=LoadChar(S); + switch (t) + { + case LUA_TNIL: + setnilvalue(o); + break; + case LUA_TBOOLEAN: + setbvalue(o,LoadChar(S)); + break; + case LUA_TNUMBER: + setnvalue(o,LoadNumber(S)); + break; + case LUA_TSTRING: + setsvalue2n(S->L,o,LoadString(S)); + break; + default: + IF (1, "bad constant"); + break; + } + } + n=LoadInt(S); + f->p=luaM_newvector(S->L,n,Proto*); + f->sizep=n; + for (i=0; ip[i]=NULL; + for (i=0; ip[i]=LoadFunction(S,f->source); +} + +static void LoadDebug(LoadState* S, Proto* f) +{ + int i,n; + n=LoadInt(S); + f->lineinfo=luaM_newvector(S->L,n,int); + f->sizelineinfo=n; + LoadVector(S,f->lineinfo,n,sizeof(int)); + n=LoadInt(S); + f->locvars=luaM_newvector(S->L,n,LocVar); + f->sizelocvars=n; + for (i=0; ilocvars[i].varname=NULL; + for (i=0; ilocvars[i].varname=LoadString(S); + f->locvars[i].startpc=LoadInt(S); + f->locvars[i].endpc=LoadInt(S); + } + n=LoadInt(S); + f->upvalues=luaM_newvector(S->L,n,TString*); + f->sizeupvalues=n; + for (i=0; iupvalues[i]=NULL; + for (i=0; iupvalues[i]=LoadString(S); +} + +static Proto* LoadFunction(LoadState* S, TString* p) +{ + Proto* f=luaF_newproto(S->L); + setptvalue2s(S->L,S->L->top,f); incr_top(S->L); + f->source=LoadString(S); if (f->source==NULL) f->source=p; + f->linedefined=LoadInt(S); + f->lastlinedefined=LoadInt(S); + f->nups=LoadByte(S); + f->numparams=LoadByte(S); + f->is_vararg=LoadByte(S); + f->maxstacksize=LoadByte(S); + LoadCode(S,f); + LoadConstants(S,f); + LoadDebug(S,f); + IF (!luaG_checkcode(f), "bad code"); + S->L->top--; + return f; +} + +static void LoadHeader(LoadState* S) +{ + char h[LUAC_HEADERSIZE]; + char s[LUAC_HEADERSIZE]; + luaU_header(h); + LoadBlock(S,s,LUAC_HEADERSIZE); + IF (memcmp(h,s,LUAC_HEADERSIZE)!=0, "bad header"); +} + +/* +** load precompiled chunk +*/ +Proto* luaU_undump (lua_State* L, ZIO* Z, Mbuffer* buff, const char* name) +{ + LoadState S; + if (*name=='@' || *name=='=') + S.name=name+1; + else if (*name==LUA_SIGNATURE[0]) + S.name="binary string"; + else + S.name=name; + S.L=L; + S.Z=Z; + S.b=buff; + LoadHeader(&S); + return LoadFunction(&S,luaS_newliteral(L,"=?")); +} + +/* +* make header +*/ +void luaU_header (char* h) +{ + int x=1; + memcpy(h,LUA_SIGNATURE,sizeof(LUA_SIGNATURE)-1); + h+=sizeof(LUA_SIGNATURE)-1; + *h++=(char)LUAC_VERSION; + *h++=(char)LUAC_FORMAT; + *h++=(char)*(char*)&x; /* endianness */ + *h++=(char)sizeof(int); + *h++=(char)sizeof(size_t); + *h++=(char)sizeof(Instruction); + *h++=(char)sizeof(lua_Number); + *h++=(char)(((lua_Number)0.5)==0); /* is lua_Number integral? */ +} diff --git a/ref/lua-5.1/src/lundump.h b/ref/lua-5.1/src/lundump.h new file mode 100644 index 0000000..58cca5d --- /dev/null +++ b/ref/lua-5.1/src/lundump.h @@ -0,0 +1,36 @@ +/* +** $Id: lundump.h,v 1.40 2005/11/11 14:03:13 lhf Exp $ +** load precompiled Lua chunks +** See Copyright Notice in lua.h +*/ + +#ifndef lundump_h +#define lundump_h + +#include "lobject.h" +#include "lzio.h" + +/* load one chunk; from lundump.c */ +LUAI_FUNC Proto* luaU_undump (lua_State* L, ZIO* Z, Mbuffer* buff, const char* name); + +/* make header; from lundump.c */ +LUAI_FUNC void luaU_header (char* h); + +/* dump one chunk; from ldump.c */ +LUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, void* data, int strip); + +#ifdef luac_c +/* print one chunk; from print.c */ +LUAI_FUNC void luaU_print (const Proto* f, int full); +#endif + +/* for header of binary files -- this is Lua 5.1 */ +#define LUAC_VERSION 0x51 + +/* for header of binary files -- this is the official format */ +#define LUAC_FORMAT 0 + +/* size of header of binary files */ +#define LUAC_HEADERSIZE 12 + +#endif diff --git a/ref/lua-5.1/src/lvm.c b/ref/lua-5.1/src/lvm.c new file mode 100644 index 0000000..6f4c029 --- /dev/null +++ b/ref/lua-5.1/src/lvm.c @@ -0,0 +1,762 @@ +/* +** $Id: lvm.c,v 2.62 2006/01/23 19:51:43 roberto Exp $ +** Lua virtual machine +** See Copyright Notice in lua.h +*/ + + +#include +#include +#include + +#define lvm_c +#define LUA_CORE + +#include "lua.h" + +#include "ldebug.h" +#include "ldo.h" +#include "lfunc.h" +#include "lgc.h" +#include "lobject.h" +#include "lopcodes.h" +#include "lstate.h" +#include "lstring.h" +#include "ltable.h" +#include "ltm.h" +#include "lvm.h" + + + +/* limit for table tag-method chains (to avoid loops) */ +#define MAXTAGLOOP 100 + + +const TValue *luaV_tonumber (const TValue *obj, TValue *n) { + lua_Number num; + if (ttisnumber(obj)) return obj; + if (ttisstring(obj) && luaO_str2d(svalue(obj), &num)) { + setnvalue(n, num); + return n; + } + else + return NULL; +} + + +int luaV_tostring (lua_State *L, StkId obj) { + if (!ttisnumber(obj)) + return 0; + else { + char s[LUAI_MAXNUMBER2STR]; + lua_Number n = nvalue(obj); + lua_number2str(s, n); + setsvalue2s(L, obj, luaS_new(L, s)); + return 1; + } +} + + +static void traceexec (lua_State *L, const Instruction *pc) { + lu_byte mask = L->hookmask; + const Instruction *oldpc = L->savedpc; + L->savedpc = pc; + if (mask > LUA_MASKLINE) { /* instruction-hook set? */ + if (L->hookcount == 0) { + resethookcount(L); + luaD_callhook(L, LUA_HOOKCOUNT, -1); + } + } + if (mask & LUA_MASKLINE) { + Proto *p = ci_func(L->ci)->l.p; + int npc = pcRel(pc, p); + int newline = getline(p, npc); + /* call linehook when enter a new function, when jump back (loop), + or when enter a new line */ + if (npc == 0 || pc <= oldpc || newline != getline(p, pcRel(oldpc, p))) + luaD_callhook(L, LUA_HOOKLINE, newline); + } +} + + +static void callTMres (lua_State *L, StkId res, const TValue *f, + const TValue *p1, const TValue *p2) { + ptrdiff_t result = savestack(L, res); + setobj2s(L, L->top, f); /* push function */ + setobj2s(L, L->top+1, p1); /* 1st argument */ + setobj2s(L, L->top+2, p2); /* 2nd argument */ + luaD_checkstack(L, 3); + L->top += 3; + luaD_call(L, L->top - 3, 1); + res = restorestack(L, result); + L->top--; + setobjs2s(L, res, L->top); +} + + + +static void callTM (lua_State *L, const TValue *f, const TValue *p1, + const TValue *p2, const TValue *p3) { + setobj2s(L, L->top, f); /* push function */ + setobj2s(L, L->top+1, p1); /* 1st argument */ + setobj2s(L, L->top+2, p2); /* 2nd argument */ + setobj2s(L, L->top+3, p3); /* 3th argument */ + luaD_checkstack(L, 4); + L->top += 4; + luaD_call(L, L->top - 4, 0); +} + + +void luaV_gettable (lua_State *L, const TValue *t, TValue *key, StkId val) { + int loop; + for (loop = 0; loop < MAXTAGLOOP; loop++) { + const TValue *tm; + if (ttistable(t)) { /* `t' is a table? */ + Table *h = hvalue(t); + const TValue *res = luaH_get(h, key); /* do a primitive get */ + if (!ttisnil(res) || /* result is no nil? */ + (tm = fasttm(L, h->metatable, TM_INDEX)) == NULL) { /* or no TM? */ + setobj2s(L, val, res); + return; + } + /* else will try the tag method */ + } + else if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_INDEX))) + luaG_typeerror(L, t, "index"); + if (ttisfunction(tm)) { + callTMres(L, val, tm, t, key); + return; + } + t = tm; /* else repeat with `tm' */ + } + luaG_runerror(L, "loop in gettable"); +} + + +void luaV_settable (lua_State *L, const TValue *t, TValue *key, StkId val) { + int loop; + for (loop = 0; loop < MAXTAGLOOP; loop++) { + const TValue *tm; + if (ttistable(t)) { /* `t' is a table? */ + Table *h = hvalue(t); + TValue *oldval = luaH_set(L, h, key); /* do a primitive set */ + if (!ttisnil(oldval) || /* result is no nil? */ + (tm = fasttm(L, h->metatable, TM_NEWINDEX)) == NULL) { /* or no TM? */ + setobj2t(L, oldval, val); + luaC_barriert(L, h, val); + return; + } + /* else will try the tag method */ + } + else if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_NEWINDEX))) + luaG_typeerror(L, t, "index"); + if (ttisfunction(tm)) { + callTM(L, tm, t, key, val); + return; + } + t = tm; /* else repeat with `tm' */ + } + luaG_runerror(L, "loop in settable"); +} + + +static int call_binTM (lua_State *L, const TValue *p1, const TValue *p2, + StkId res, TMS event) { + const TValue *tm = luaT_gettmbyobj(L, p1, event); /* try first operand */ + if (ttisnil(tm)) + tm = luaT_gettmbyobj(L, p2, event); /* try second operand */ + if (!ttisfunction(tm)) return 0; + callTMres(L, res, tm, p1, p2); + return 1; +} + + +static const TValue *get_compTM (lua_State *L, Table *mt1, Table *mt2, + TMS event) { + const TValue *tm1 = fasttm(L, mt1, event); + const TValue *tm2; + if (tm1 == NULL) return NULL; /* no metamethod */ + if (mt1 == mt2) return tm1; /* same metatables => same metamethods */ + tm2 = fasttm(L, mt2, event); + if (tm2 == NULL) return NULL; /* no metamethod */ + if (luaO_rawequalObj(tm1, tm2)) /* same metamethods? */ + return tm1; + return NULL; +} + + +static int call_orderTM (lua_State *L, const TValue *p1, const TValue *p2, + TMS event) { + const TValue *tm1 = luaT_gettmbyobj(L, p1, event); + const TValue *tm2; + if (ttisnil(tm1)) return -1; /* no metamethod? */ + tm2 = luaT_gettmbyobj(L, p2, event); + if (!luaO_rawequalObj(tm1, tm2)) /* different metamethods? */ + return -1; + callTMres(L, L->top, tm1, p1, p2); + return !l_isfalse(L->top); +} + + +static int l_strcmp (const TString *ls, const TString *rs) { + const char *l = getstr(ls); + size_t ll = ls->tsv.len; + const char *r = getstr(rs); + size_t lr = rs->tsv.len; + for (;;) { + int temp = strcoll(l, r); + if (temp != 0) return temp; + else { /* strings are equal up to a `\0' */ + size_t len = strlen(l); /* index of first `\0' in both strings */ + if (len == lr) /* r is finished? */ + return (len == ll) ? 0 : 1; + else if (len == ll) /* l is finished? */ + return -1; /* l is smaller than r (because r is not finished) */ + /* both strings longer than `len'; go on comparing (after the `\0') */ + len++; + l += len; ll -= len; r += len; lr -= len; + } + } +} + + +int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r) { + int res; + if (ttype(l) != ttype(r)) + return luaG_ordererror(L, l, r); + else if (ttisnumber(l)) + return luai_numlt(nvalue(l), nvalue(r)); + else if (ttisstring(l)) + return l_strcmp(rawtsvalue(l), rawtsvalue(r)) < 0; + else if ((res = call_orderTM(L, l, r, TM_LT)) != -1) + return res; + return luaG_ordererror(L, l, r); +} + + +static int lessequal (lua_State *L, const TValue *l, const TValue *r) { + int res; + if (ttype(l) != ttype(r)) + return luaG_ordererror(L, l, r); + else if (ttisnumber(l)) + return luai_numle(nvalue(l), nvalue(r)); + else if (ttisstring(l)) + return l_strcmp(rawtsvalue(l), rawtsvalue(r)) <= 0; + else if ((res = call_orderTM(L, l, r, TM_LE)) != -1) /* first try `le' */ + return res; + else if ((res = call_orderTM(L, r, l, TM_LT)) != -1) /* else try `lt' */ + return !res; + return luaG_ordererror(L, l, r); +} + + +int luaV_equalval (lua_State *L, const TValue *t1, const TValue *t2) { + const TValue *tm; + lua_assert(ttype(t1) == ttype(t2)); + switch (ttype(t1)) { + case LUA_TNIL: return 1; + case LUA_TNUMBER: return luai_numeq(nvalue(t1), nvalue(t2)); + case LUA_TBOOLEAN: return bvalue(t1) == bvalue(t2); /* true must be 1 !! */ + case LUA_TLIGHTUSERDATA: return pvalue(t1) == pvalue(t2); + case LUA_TUSERDATA: { + if (uvalue(t1) == uvalue(t2)) return 1; + tm = get_compTM(L, uvalue(t1)->metatable, uvalue(t2)->metatable, + TM_EQ); + break; /* will try TM */ + } + case LUA_TTABLE: { + if (hvalue(t1) == hvalue(t2)) return 1; + tm = get_compTM(L, hvalue(t1)->metatable, hvalue(t2)->metatable, TM_EQ); + break; /* will try TM */ + } + default: return gcvalue(t1) == gcvalue(t2); + } + if (tm == NULL) return 0; /* no TM? */ + callTMres(L, L->top, tm, t1, t2); /* call TM */ + return !l_isfalse(L->top); +} + + +void luaV_concat (lua_State *L, int total, int last) { + do { + StkId top = L->base + last + 1; + int n = 2; /* number of elements handled in this pass (at least 2) */ + if (!tostring(L, top-2) || !tostring(L, top-1)) { + if (!call_binTM(L, top-2, top-1, top-2, TM_CONCAT)) + luaG_concaterror(L, top-2, top-1); + } else if (tsvalue(top-1)->len > 0) { /* if len=0, do nothing */ + /* at least two string values; get as many as possible */ + size_t tl = tsvalue(top-1)->len; + char *buffer; + int i; + /* collect total length */ + for (n = 1; n < total && tostring(L, top-n-1); n++) { + size_t l = tsvalue(top-n-1)->len; + if (l >= MAX_SIZET - tl) luaG_runerror(L, "string length overflow"); + tl += l; + } + buffer = luaZ_openspace(L, &G(L)->buff, tl); + tl = 0; + for (i=n; i>0; i--) { /* concat all strings */ + size_t l = tsvalue(top-i)->len; + memcpy(buffer+tl, svalue(top-i), l); + tl += l; + } + setsvalue2s(L, top-n, luaS_newlstr(L, buffer, tl)); + } + total -= n-1; /* got `n' strings to create 1 new */ + last -= n-1; + } while (total > 1); /* repeat until only 1 result left */ +} + + +static void Arith (lua_State *L, StkId ra, const TValue *rb, + const TValue *rc, TMS op) { + TValue tempb, tempc; + const TValue *b, *c; + if ((b = luaV_tonumber(rb, &tempb)) != NULL && + (c = luaV_tonumber(rc, &tempc)) != NULL) { + lua_Number nb = nvalue(b), nc = nvalue(c); + switch (op) { + case TM_ADD: setnvalue(ra, luai_numadd(nb, nc)); break; + case TM_SUB: setnvalue(ra, luai_numsub(nb, nc)); break; + case TM_MUL: setnvalue(ra, luai_nummul(nb, nc)); break; + case TM_DIV: setnvalue(ra, luai_numdiv(nb, nc)); break; + case TM_MOD: setnvalue(ra, luai_nummod(nb, nc)); break; + case TM_POW: setnvalue(ra, luai_numpow(nb, nc)); break; + case TM_UNM: setnvalue(ra, luai_numunm(nb)); break; + default: lua_assert(0); break; + } + } + else if (!call_binTM(L, rb, rc, ra, op)) + luaG_aritherror(L, rb, rc); +} + + + +/* +** some macros for common tasks in `luaV_execute' +*/ + +#define runtime_check(L, c) { if (!(c)) break; } + +#define RA(i) (base+GETARG_A(i)) +/* to be used after possible stack reallocation */ +#define RB(i) check_exp(getBMode(GET_OPCODE(i)) == OpArgR, base+GETARG_B(i)) +#define RC(i) check_exp(getCMode(GET_OPCODE(i)) == OpArgR, base+GETARG_C(i)) +#define RKB(i) check_exp(getBMode(GET_OPCODE(i)) == OpArgK, \ + ISK(GETARG_B(i)) ? k+INDEXK(GETARG_B(i)) : base+GETARG_B(i)) +#define RKC(i) check_exp(getCMode(GET_OPCODE(i)) == OpArgK, \ + ISK(GETARG_C(i)) ? k+INDEXK(GETARG_C(i)) : base+GETARG_C(i)) +#define KBx(i) check_exp(getBMode(GET_OPCODE(i)) == OpArgK, k+GETARG_Bx(i)) + + +#define dojump(L,pc,i) {(pc) += (i); luai_threadyield(L);} + + +#define Protect(x) { L->savedpc = pc; {x;}; base = L->base; } + + +#define arith_op(op,tm) { \ + TValue *rb = RKB(i); \ + TValue *rc = RKC(i); \ + if (ttisnumber(rb) && ttisnumber(rc)) { \ + lua_Number nb = nvalue(rb), nc = nvalue(rc); \ + setnvalue(ra, op(nb, nc)); \ + } \ + else \ + Protect(Arith(L, ra, rb, rc, tm)); \ + } + + + +void luaV_execute (lua_State *L, int nexeccalls) { + LClosure *cl; + StkId base; + TValue *k; + const Instruction *pc; + reentry: /* entry point */ + pc = L->savedpc; + cl = &clvalue(L->ci->func)->l; + base = L->base; + k = cl->p->k; + /* main loop of interpreter */ + for (;;) { + const Instruction i = *pc++; + StkId ra; + if ((L->hookmask & (LUA_MASKLINE | LUA_MASKCOUNT)) && + (--L->hookcount == 0 || L->hookmask & LUA_MASKLINE)) { + traceexec(L, pc); + if (L->status == LUA_YIELD) { /* did hook yield? */ + L->savedpc = pc - 1; + return; + } + base = L->base; + } + /* warning!! several calls may realloc the stack and invalidate `ra' */ + ra = RA(i); + lua_assert(base == L->base && L->base == L->ci->base); + lua_assert(base <= L->top && L->top <= L->stack + L->stacksize); + lua_assert(L->top == L->ci->top || luaG_checkopenop(i)); + switch (GET_OPCODE(i)) { + case OP_MOVE: { + setobjs2s(L, ra, RB(i)); + continue; + } + case OP_LOADK: { + setobj2s(L, ra, KBx(i)); + continue; + } + case OP_LOADBOOL: { + setbvalue(ra, GETARG_B(i)); + if (GETARG_C(i)) pc++; /* skip next instruction (if C) */ + continue; + } + case OP_LOADNIL: { + TValue *rb = RB(i); + do { + setnilvalue(rb--); + } while (rb >= ra); + continue; + } + case OP_GETUPVAL: { + int b = GETARG_B(i); + setobj2s(L, ra, cl->upvals[b]->v); + continue; + } + case OP_GETGLOBAL: { + TValue g; + TValue *rb = KBx(i); + sethvalue(L, &g, cl->env); + lua_assert(ttisstring(rb)); + Protect(luaV_gettable(L, &g, rb, ra)); + continue; + } + case OP_GETTABLE: { + Protect(luaV_gettable(L, RB(i), RKC(i), ra)); + continue; + } + case OP_SETGLOBAL: { + TValue g; + sethvalue(L, &g, cl->env); + lua_assert(ttisstring(KBx(i))); + Protect(luaV_settable(L, &g, KBx(i), ra)); + continue; + } + case OP_SETUPVAL: { + UpVal *uv = cl->upvals[GETARG_B(i)]; + setobj(L, uv->v, ra); + luaC_barrier(L, uv, ra); + continue; + } + case OP_SETTABLE: { + Protect(luaV_settable(L, ra, RKB(i), RKC(i))); + continue; + } + case OP_NEWTABLE: { + int b = GETARG_B(i); + int c = GETARG_C(i); + sethvalue(L, ra, luaH_new(L, luaO_fb2int(b), luaO_fb2int(c))); + Protect(luaC_checkGC(L)); + continue; + } + case OP_SELF: { + StkId rb = RB(i); + setobjs2s(L, ra+1, rb); + Protect(luaV_gettable(L, rb, RKC(i), ra)); + continue; + } + case OP_ADD: { + arith_op(luai_numadd, TM_ADD); + continue; + } + case OP_SUB: { + arith_op(luai_numsub, TM_SUB); + continue; + } + case OP_MUL: { + arith_op(luai_nummul, TM_MUL); + continue; + } + case OP_DIV: { + arith_op(luai_numdiv, TM_DIV); + continue; + } + case OP_MOD: { + arith_op(luai_nummod, TM_MOD); + continue; + } + case OP_POW: { + arith_op(luai_numpow, TM_POW); + continue; + } + case OP_UNM: { + TValue *rb = RB(i); + if (ttisnumber(rb)) { + lua_Number nb = nvalue(rb); + setnvalue(ra, luai_numunm(nb)); + } + else { + Protect(Arith(L, ra, rb, rb, TM_UNM)); + } + continue; + } + case OP_NOT: { + int res = l_isfalse(RB(i)); /* next assignment may change this value */ + setbvalue(ra, res); + continue; + } + case OP_LEN: { + const TValue *rb = RB(i); + switch (ttype(rb)) { + case LUA_TTABLE: { + setnvalue(ra, cast_num(luaH_getn(hvalue(rb)))); + break; + } + case LUA_TSTRING: { + setnvalue(ra, cast_num(tsvalue(rb)->len)); + break; + } + default: { /* try metamethod */ + Protect( + if (!call_binTM(L, rb, luaO_nilobject, ra, TM_LEN)) + luaG_typeerror(L, rb, "get length of"); + ) + } + } + continue; + } + case OP_CONCAT: { + int b = GETARG_B(i); + int c = GETARG_C(i); + Protect(luaV_concat(L, c-b+1, c); luaC_checkGC(L)); + setobjs2s(L, RA(i), base+b); + continue; + } + case OP_JMP: { + dojump(L, pc, GETARG_sBx(i)); + continue; + } + case OP_EQ: { + TValue *rb = RKB(i); + TValue *rc = RKC(i); + Protect( + if (equalobj(L, rb, rc) == GETARG_A(i)) + dojump(L, pc, GETARG_sBx(*pc)); + ) + pc++; + continue; + } + case OP_LT: { + Protect( + if (luaV_lessthan(L, RKB(i), RKC(i)) == GETARG_A(i)) + dojump(L, pc, GETARG_sBx(*pc)); + ) + pc++; + continue; + } + case OP_LE: { + Protect( + if (lessequal(L, RKB(i), RKC(i)) == GETARG_A(i)) + dojump(L, pc, GETARG_sBx(*pc)); + ) + pc++; + continue; + } + case OP_TEST: { + if (l_isfalse(ra) != GETARG_C(i)) + dojump(L, pc, GETARG_sBx(*pc)); + pc++; + continue; + } + case OP_TESTSET: { + TValue *rb = RB(i); + if (l_isfalse(rb) != GETARG_C(i)) { + setobjs2s(L, ra, rb); + dojump(L, pc, GETARG_sBx(*pc)); + } + pc++; + continue; + } + case OP_CALL: { + int b = GETARG_B(i); + int nresults = GETARG_C(i) - 1; + if (b != 0) L->top = ra+b; /* else previous instruction set top */ + L->savedpc = pc; + switch (luaD_precall(L, ra, nresults)) { + case PCRLUA: { + nexeccalls++; + goto reentry; /* restart luaV_execute over new Lua function */ + } + case PCRC: { + /* it was a C function (`precall' called it); adjust results */ + if (nresults >= 0) L->top = L->ci->top; + base = L->base; + continue; + } + default: { + return; /* yield */ + } + } + } + case OP_TAILCALL: { + int b = GETARG_B(i); + if (b != 0) L->top = ra+b; /* else previous instruction set top */ + L->savedpc = pc; + lua_assert(GETARG_C(i) - 1 == LUA_MULTRET); + switch (luaD_precall(L, ra, LUA_MULTRET)) { + case PCRLUA: { + /* tail call: put new frame in place of previous one */ + CallInfo *ci = L->ci - 1; /* previous frame */ + int aux; + StkId func = ci->func; + StkId pfunc = (ci+1)->func; /* previous function index */ + if (L->openupval) luaF_close(L, ci->base); + L->base = ci->base = ci->func + ((ci+1)->base - pfunc); + for (aux = 0; pfunc+aux < L->top; aux++) /* move frame down */ + setobjs2s(L, func+aux, pfunc+aux); + ci->top = L->top = func+aux; /* correct top */ + lua_assert(L->top == L->base + clvalue(func)->l.p->maxstacksize); + ci->savedpc = L->savedpc; + ci->tailcalls++; /* one more call lost */ + L->ci--; /* remove new frame */ + goto reentry; + } + case PCRC: { /* it was a C function (`precall' called it) */ + base = L->base; + continue; + } + default: { + return; /* yield */ + } + } + } + case OP_RETURN: { + int b = GETARG_B(i); + if (b != 0) L->top = ra+b-1; + if (L->openupval) luaF_close(L, base); + L->savedpc = pc; + b = luaD_poscall(L, ra); + if (--nexeccalls == 0) /* was previous function running `here'? */ + return; /* no: return */ + else { /* yes: continue its execution */ + if (b) L->top = L->ci->top; + lua_assert(isLua(L->ci)); + lua_assert(GET_OPCODE(*((L->ci)->savedpc - 1)) == OP_CALL); + goto reentry; + } + } + case OP_FORLOOP: { + lua_Number step = nvalue(ra+2); + lua_Number idx = luai_numadd(nvalue(ra), step); /* increment index */ + lua_Number limit = nvalue(ra+1); + if (luai_numlt(0, step) ? luai_numle(idx, limit) + : luai_numle(limit, idx)) { + dojump(L, pc, GETARG_sBx(i)); /* jump back */ + setnvalue(ra, idx); /* update internal index... */ + setnvalue(ra+3, idx); /* ...and external index */ + } + continue; + } + case OP_FORPREP: { + const TValue *init = ra; + const TValue *plimit = ra+1; + const TValue *pstep = ra+2; + L->savedpc = pc; /* next steps may throw errors */ + if (!tonumber(init, ra)) + luaG_runerror(L, LUA_QL("for") " initial value must be a number"); + else if (!tonumber(plimit, ra+1)) + luaG_runerror(L, LUA_QL("for") " limit must be a number"); + else if (!tonumber(pstep, ra+2)) + luaG_runerror(L, LUA_QL("for") " step must be a number"); + setnvalue(ra, luai_numsub(nvalue(ra), nvalue(pstep))); + dojump(L, pc, GETARG_sBx(i)); + continue; + } + case OP_TFORLOOP: { + StkId cb = ra + 3; /* call base */ + setobjs2s(L, cb+2, ra+2); + setobjs2s(L, cb+1, ra+1); + setobjs2s(L, cb, ra); + L->top = cb+3; /* func. + 2 args (state and index) */ + Protect(luaD_call(L, cb, GETARG_C(i))); + L->top = L->ci->top; + cb = RA(i) + 3; /* previous call may change the stack */ + if (!ttisnil(cb)) { /* continue loop? */ + setobjs2s(L, cb-1, cb); /* save control variable */ + dojump(L, pc, GETARG_sBx(*pc)); /* jump back */ + } + pc++; + continue; + } + case OP_SETLIST: { + int n = GETARG_B(i); + int c = GETARG_C(i); + int last; + Table *h; + if (n == 0) { + n = cast_int(L->top - ra) - 1; + L->top = L->ci->top; + } + if (c == 0) c = cast_int(*pc++); + runtime_check(L, ttistable(ra)); + h = hvalue(ra); + last = ((c-1)*LFIELDS_PER_FLUSH) + n; + if (last > h->sizearray) /* needs more space? */ + luaH_resizearray(L, h, last); /* pre-alloc it at once */ + for (; n > 0; n--) { + TValue *val = ra+n; + setobj2t(L, luaH_setnum(L, h, last--), val); + luaC_barriert(L, h, val); + } + continue; + } + case OP_CLOSE: { + luaF_close(L, ra); + continue; + } + case OP_CLOSURE: { + Proto *p; + Closure *ncl; + int nup, j; + p = cl->p->p[GETARG_Bx(i)]; + nup = p->nups; + ncl = luaF_newLclosure(L, nup, cl->env); + ncl->l.p = p; + for (j=0; jl.upvals[j] = cl->upvals[GETARG_B(*pc)]; + else { + lua_assert(GET_OPCODE(*pc) == OP_MOVE); + ncl->l.upvals[j] = luaF_findupval(L, base + GETARG_B(*pc)); + } + } + setclvalue(L, ra, ncl); + Protect(luaC_checkGC(L)); + continue; + } + case OP_VARARG: { + int b = GETARG_B(i) - 1; + int j; + CallInfo *ci = L->ci; + int n = cast_int(ci->base - ci->func) - cl->p->numparams - 1; + if (b == LUA_MULTRET) { + Protect(luaD_checkstack(L, n)); + ra = RA(i); /* previous call may change the stack */ + b = n; + L->top = ra + n; + } + for (j = 0; j < b; j++) { + if (j < n) { + setobjs2s(L, ra + j, ci->base - n + j); + } + else { + setnilvalue(ra + j); + } + } + continue; + } + } + } +} + diff --git a/ref/lua-5.1/src/lvm.h b/ref/lua-5.1/src/lvm.h new file mode 100644 index 0000000..788423f --- /dev/null +++ b/ref/lua-5.1/src/lvm.h @@ -0,0 +1,36 @@ +/* +** $Id: lvm.h,v 2.5 2005/08/22 18:54:49 roberto Exp $ +** Lua virtual machine +** See Copyright Notice in lua.h +*/ + +#ifndef lvm_h +#define lvm_h + + +#include "ldo.h" +#include "lobject.h" +#include "ltm.h" + + +#define tostring(L,o) ((ttype(o) == LUA_TSTRING) || (luaV_tostring(L, o))) + +#define tonumber(o,n) (ttype(o) == LUA_TNUMBER || \ + (((o) = luaV_tonumber(o,n)) != NULL)) + +#define equalobj(L,o1,o2) \ + (ttype(o1) == ttype(o2) && luaV_equalval(L, o1, o2)) + + +LUAI_FUNC int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r); +LUAI_FUNC int luaV_equalval (lua_State *L, const TValue *t1, const TValue *t2); +LUAI_FUNC const TValue *luaV_tonumber (const TValue *obj, TValue *n); +LUAI_FUNC int luaV_tostring (lua_State *L, StkId obj); +LUAI_FUNC void luaV_gettable (lua_State *L, const TValue *t, TValue *key, + StkId val); +LUAI_FUNC void luaV_settable (lua_State *L, const TValue *t, TValue *key, + StkId val); +LUAI_FUNC void luaV_execute (lua_State *L, int nexeccalls); +LUAI_FUNC void luaV_concat (lua_State *L, int total, int last); + +#endif diff --git a/ref/lua-5.1/src/lzio.c b/ref/lua-5.1/src/lzio.c new file mode 100644 index 0000000..5121ada --- /dev/null +++ b/ref/lua-5.1/src/lzio.c @@ -0,0 +1,82 @@ +/* +** $Id: lzio.c,v 1.31 2005/06/03 20:15:29 roberto Exp $ +** a generic input stream interface +** See Copyright Notice in lua.h +*/ + + +#include + +#define lzio_c +#define LUA_CORE + +#include "lua.h" + +#include "llimits.h" +#include "lmem.h" +#include "lstate.h" +#include "lzio.h" + + +int luaZ_fill (ZIO *z) { + size_t size; + lua_State *L = z->L; + const char *buff; + lua_unlock(L); + buff = z->reader(L, z->data, &size); + lua_lock(L); + if (buff == NULL || size == 0) return EOZ; + z->n = size - 1; + z->p = buff; + return char2int(*(z->p++)); +} + + +int luaZ_lookahead (ZIO *z) { + if (z->n == 0) { + if (luaZ_fill(z) == EOZ) + return EOZ; + else { + z->n++; /* luaZ_fill removed first byte; put back it */ + z->p--; + } + } + return char2int(*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 (luaZ_lookahead(z) == EOZ) + return n; /* return number of missing bytes */ + m = (n <= z->n) ? n : z->n; /* min. between n and z->n */ + memcpy(b, z->p, m); + z->n -= m; + z->p += m; + b = (char *)b + m; + n -= m; + } + return 0; +} + +/* ------------------------------------------------------------------------ */ +char *luaZ_openspace (lua_State *L, Mbuffer *buff, size_t n) { + if (n > buff->buffsize) { + if (n < LUA_MINBUFFER) n = LUA_MINBUFFER; + luaZ_resizebuffer(L, buff, n); + } + return buff->buffer; +} + + diff --git a/ref/lua-5.1/src/lzio.h b/ref/lua-5.1/src/lzio.h new file mode 100644 index 0000000..8f403b8 --- /dev/null +++ b/ref/lua-5.1/src/lzio.h @@ -0,0 +1,67 @@ +/* +** $Id: lzio.h,v 1.21 2005/05/17 19:49:15 roberto Exp $ +** Buffered streams +** See Copyright Notice in lua.h +*/ + + +#ifndef lzio_h +#define lzio_h + +#include "lua.h" + +#include "lmem.h" + + +#define EOZ (-1) /* end of stream */ + +typedef struct Zio ZIO; + +#define char2int(c) cast(int, cast(unsigned char, (c))) + +#define zgetc(z) (((z)->n--)>0 ? char2int(*(z)->p++) : luaZ_fill(z)) + +typedef struct Mbuffer { + char *buffer; + size_t n; + size_t buffsize; +} Mbuffer; + +#define luaZ_initbuffer(L, buff) ((buff)->buffer = NULL, (buff)->buffsize = 0) + +#define luaZ_buffer(buff) ((buff)->buffer) +#define luaZ_sizebuffer(buff) ((buff)->buffsize) +#define luaZ_bufflen(buff) ((buff)->n) + +#define luaZ_resetbuffer(buff) ((buff)->n = 0) + + +#define luaZ_resizebuffer(L, buff, size) \ + (luaM_reallocvector(L, (buff)->buffer, (buff)->buffsize, size, char), \ + (buff)->buffsize = size) + +#define luaZ_freebuffer(L, buff) luaZ_resizebuffer(L, buff, 0) + + +LUAI_FUNC char *luaZ_openspace (lua_State *L, Mbuffer *buff, size_t n); +LUAI_FUNC void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, + void *data); +LUAI_FUNC size_t luaZ_read (ZIO* z, void* b, size_t n); /* read next n bytes */ +LUAI_FUNC int luaZ_lookahead (ZIO *z); + + + +/* --------- Private Part ------------------ */ + +struct Zio { + size_t n; /* bytes still unread */ + const char *p; /* current position in buffer */ + lua_Reader reader; + void* data; /* additional data */ + lua_State *L; /* Lua state (for reader) */ +}; + + +LUAI_FUNC int luaZ_fill (ZIO *z); + +#endif diff --git a/ref/lua-5.1/src/print.c b/ref/lua-5.1/src/print.c new file mode 100644 index 0000000..1c3a445 --- /dev/null +++ b/ref/lua-5.1/src/print.c @@ -0,0 +1,224 @@ +/* +** $Id: print.c,v 1.54 2006/01/11 22:49:27 lhf Exp $ +** print bytecodes +** See Copyright Notice in lua.h +*/ + +#include +#include + +#define luac_c +#define LUA_CORE + +#include "ldebug.h" +#include "lobject.h" +#include "lopcodes.h" +#include "lundump.h" + +#define PrintFunction luaU_print + +#define Sizeof(x) ((int)sizeof(x)) +#define VOID(p) ((const void*)(p)) + +static void PrintString(const Proto* f, int n) +{ + const char* s=svalue(&f->k[n]); + putchar('"'); + for (; *s; s++) + { + switch (*s) + { + case '"': printf("\\\""); break; + case '\a': printf("\\a"); break; + case '\b': printf("\\b"); break; + case '\f': printf("\\f"); break; + case '\n': printf("\\n"); break; + case '\r': printf("\\r"); break; + case '\t': printf("\\t"); break; + case '\v': printf("\\v"); break; + default: if (isprint((unsigned char)*s)) + printf("%c",*s); + else + printf("\\%03u",(unsigned char)*s); + } + } + putchar('"'); +} + +static void PrintConstant(const Proto* f, int i) +{ + const TValue* o=&f->k[i]; + switch (ttype(o)) + { + case LUA_TNIL: + printf("nil"); + break; + case LUA_TBOOLEAN: + printf(bvalue(o) ? "true" : "false"); + break; + case LUA_TNUMBER: + printf(LUA_NUMBER_FMT,nvalue(o)); + break; + case LUA_TSTRING: + PrintString(f,i); + break; + default: /* cannot happen */ + printf("? type=%d",ttype(o)); + break; + } +} + +static void PrintCode(const Proto* f) +{ + const Instruction* code=f->code; + int pc,n=f->sizecode; + for (pc=0; pc0) printf("[%d]\t",line); else printf("[-]\t"); + printf("%-9s\t",luaP_opnames[o]); + switch (getOpMode(o)) + { + case iABC: + printf("%d",a); + if (getBMode(o)!=OpArgN) printf(" %d",ISK(b) ? (-1-INDEXK(b)) : b); + if (getCMode(o)!=OpArgN) printf(" %d",ISK(c) ? (-1-INDEXK(c)) : c); + break; + case iABx: + if (getBMode(o)==OpArgK) printf("%d %d",a,-1-bx); else printf("%d %d",a,bx); + break; + case iAsBx: + if (o==OP_JMP) printf("%d",sbx); else printf("%d %d",a,sbx); + break; + } + switch (o) + { + case OP_LOADK: + printf("\t; "); PrintConstant(f,bx); + break; + case OP_GETUPVAL: + case OP_SETUPVAL: + printf("\t; %s", (f->sizeupvalues>0) ? getstr(f->upvalues[b]) : "-"); + break; + case OP_GETGLOBAL: + case OP_SETGLOBAL: + printf("\t; %s",svalue(&f->k[bx])); + break; + case OP_GETTABLE: + case OP_SELF: + if (ISK(c)) { printf("\t; "); PrintConstant(f,INDEXK(c)); } + break; + case OP_SETTABLE: + case OP_ADD: + case OP_SUB: + case OP_MUL: + case OP_DIV: + case OP_POW: + case OP_EQ: + case OP_LT: + case OP_LE: + if (ISK(b) || ISK(c)) + { + printf("\t; "); + if (ISK(b)) PrintConstant(f,INDEXK(b)); else printf("-"); + printf(" "); + if (ISK(c)) PrintConstant(f,INDEXK(c)); else printf("-"); + } + break; + case OP_JMP: + case OP_FORLOOP: + case OP_FORPREP: + printf("\t; to %d",sbx+pc+2); + break; + case OP_CLOSURE: + printf("\t; %p",VOID(f->p[bx])); + break; + case OP_SETLIST: + if (c==0) printf("\t; %d",(int)code[++pc]); + else printf("\t; %d",c); + break; + default: + break; + } + printf("\n"); + } +} + +#define SS(x) (x==1)?"":"s" +#define S(x) x,SS(x) + +static void PrintHeader(const Proto* f) +{ + const char* s=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, %d bytes at %p)\n", + (f->linedefined==0)?"main":"function",s, + f->linedefined,f->lastlinedefined, + S(f->sizecode),f->sizecode*Sizeof(Instruction),VOID(f)); + printf("%d%s param%s, %d slot%s, %d upvalue%s, ", + f->numparams,f->is_vararg?"+":"",SS(f->numparams), + S(f->maxstacksize),S(f->nups)); + printf("%d local%s, %d constant%s, %d function%s\n", + S(f->sizelocvars),S(f->sizek),S(f->sizep)); +} + +static void PrintConstants(const Proto* f) +{ + int i,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); + } +} + +static void PrintUpvalues(const Proto* f) +{ + int i,n=f->sizeupvalues; + printf("upvalues (%d) for %p:\n",n,VOID(f)); + if (f->upvalues==NULL) return; + for (i=0; iupvalues[i])); + } +} + +void PrintFunction(const Proto* f, int full) +{ + int i,n=f->sizep; + PrintHeader(f); + PrintCode(f); + if (full) + { + PrintConstants(f); + PrintLocals(f); + PrintUpvalues(f); + } + for (i=0; ip[i],full); +} diff --git a/ref/lua-5.1/test/README b/ref/lua-5.1/test/README new file mode 100644 index 0000000..0c7f38b --- /dev/null +++ b/ref/lua-5.1/test/README @@ -0,0 +1,26 @@ +These are simple tests for Lua. Some of them contain useful code. +They are meant to be run to make sure Lua is built correctly and also +to be read, to see how Lua programs look. + +Here is a one-line summary of each program: + + bisect.lua bisection method for solving non-linear equations + cf.lua temperature conversion table (celsius to farenheit) + echo.lua echo command line arguments + env.lua environment variables as automatic global variables + factorial.lua factorial without recursion + fib.lua fibonacci function with cache + fibfor.lua fibonacci numbers with coroutines and generators + globals.lua report global variable usage + hello.lua the first program in every language + life.lua Conway's Game of Life + luac.lua bare-bones luac + printf.lua an implementation of printf + readonly.lua make global variables readonly + sieve.lua the sieve of of Eratosthenes programmed with coroutines + sort.lua two implementations of a sort function + table.lua make table, grouping all data for the same item + trace-calls.lua trace calls + trace-globals.lua trace assigments to global variables + xd.lua hex dump + diff --git a/ref/lua-5.1/test/bisect.lua b/ref/lua-5.1/test/bisect.lua new file mode 100644 index 0000000..f91e69b --- /dev/null +++ b/ref/lua-5.1/test/bisect.lua @@ -0,0 +1,27 @@ +-- bisection method for solving non-linear equations + +delta=1e-6 -- tolerance + +function bisect(f,a,b,fa,fb) + local c=(a+b)/2 + io.write(n," c=",c," a=",a," b=",b,"\n") + if c==a or c==b or math.abs(a-b) posted to lua-l +-- modified to use ANSI terminal escape sequences +-- modified to use for instead of while + +local write=io.write + +ALIVE="¥" DEAD="þ" +ALIVE="O" DEAD="-" + +function delay() -- NOTE: SYSTEM-DEPENDENT, adjust as necessary + for i=1,10000 do end + -- local i=os.clock()+1 while(os.clock() 0 do + local xm1,x,xp1,xi=self.w-1,self.w,1,self.w + while xi > 0 do + local sum = self[ym1][xm1] + self[ym1][x] + self[ym1][xp1] + + self[y][xm1] + self[y][xp1] + + self[yp1][xm1] + self[yp1][x] + self[yp1][xp1] + next[y][x] = ((sum==2) and self[y][x]) or ((sum==3) and 1) or 0 + xm1,x,xp1,xi = x,xp1,xp1+1,xi-1 + end + ym1,y,yp1,yi = y,yp1,yp1+1,yi-1 + end +end + +-- output the array to screen +function _CELLS:draw() + local out="" -- accumulate to reduce flicker + for y=1,self.h do + for x=1,self.w do + out=out..(((self[y][x]>0) and ALIVE) or DEAD) + end + out=out.."\n" + end + write(out) +end + +-- constructor +function CELLS(w,h) + local c = ARRAY2D(w,h) + c.spawn = _CELLS.spawn + c.evolve = _CELLS.evolve + c.draw = _CELLS.draw + return c +end + +-- +-- shapes suitable for use with spawn() above +-- +HEART = { 1,0,1,1,0,1,1,1,1; w=3,h=3 } +GLIDER = { 0,0,1,1,0,1,0,1,1; w=3,h=3 } +EXPLODE = { 0,1,0,1,1,1,1,0,1,0,1,0; w=3,h=4 } +FISH = { 0,1,1,1,1,1,0,0,0,1,0,0,0,0,1,1,0,0,1,0; w=5,h=4 } +BUTTERFLY = { 1,0,0,0,1,0,1,1,1,0,1,0,0,0,1,1,0,1,0,1,1,0,0,0,1; w=5,h=5 } + +-- the main routine +function LIFE(w,h) + -- create two arrays + local thisgen = CELLS(w,h) + local nextgen = CELLS(w,h) + + -- create some life + -- about 1000 generations of fun, then a glider steady-state + thisgen:spawn(GLIDER,5,4) + thisgen:spawn(EXPLODE,25,10) + thisgen:spawn(FISH,4,12) + + -- run until break + local gen=1 + write("\027[2J") -- ANSI clear screen + while 1 do + thisgen:evolve(nextgen) + thisgen,nextgen = nextgen,thisgen + write("\027[H") -- ANSI home cursor + thisgen:draw() + write("Life - generation ",gen,"\n") + gen=gen+1 + if gen>2000 then break end + --delay() -- no delay + end +end + +LIFE(40,20) diff --git a/ref/lua-5.1/test/luac.lua b/ref/lua-5.1/test/luac.lua new file mode 100644 index 0000000..96a0a97 --- /dev/null +++ b/ref/lua-5.1/test/luac.lua @@ -0,0 +1,7 @@ +-- bare-bones luac in Lua +-- usage: lua luac.lua file.lua + +assert(arg[1]~=nil and arg[2]==nil,"usage: lua luac.lua file.lua") +f=assert(io.open("luac.out","wb")) +assert(f:write(string.dump(assert(loadfile(arg[1]))))) +assert(f:close()) diff --git a/ref/lua-5.1/test/printf.lua b/ref/lua-5.1/test/printf.lua new file mode 100644 index 0000000..58c63ff --- /dev/null +++ b/ref/lua-5.1/test/printf.lua @@ -0,0 +1,7 @@ +-- an implementation of printf + +function printf(...) + io.write(string.format(...)) +end + +printf("Hello %s from %s on %s\n",os.getenv"USER" or "there",_VERSION,os.date()) diff --git a/ref/lua-5.1/test/readonly.lua b/ref/lua-5.1/test/readonly.lua new file mode 100644 index 0000000..85c0b4e --- /dev/null +++ b/ref/lua-5.1/test/readonly.lua @@ -0,0 +1,12 @@ +-- make global variables readonly + +local f=function (t,i) error("cannot redefine global variable `"..i.."'",2) end +local g={} +local G=getfenv() +setmetatable(g,{__index=G,__newindex=f}) +setfenv(1,g) + +-- an example +rawset(g,"x",3) +x=2 +y=1 -- cannot redefine `y' diff --git a/ref/lua-5.1/test/sieve.lua b/ref/lua-5.1/test/sieve.lua new file mode 100644 index 0000000..0871bb2 --- /dev/null +++ b/ref/lua-5.1/test/sieve.lua @@ -0,0 +1,29 @@ +-- the sieve of of Eratosthenes programmed with coroutines +-- typical usage: lua -e N=1000 sieve.lua | column + +-- generate all the numbers from 2 to n +function gen (n) + return coroutine.wrap(function () + for i=2,n do coroutine.yield(i) end + end) +end + +-- filter the numbers generated by `g', removing multiples of `p' +function filter (p, g) + return coroutine.wrap(function () + while 1 do + local n = g() + if n == nil then return end + if math.mod(n, p) ~= 0 then coroutine.yield(n) end + end + end) +end + +N=N or 1000 -- from command line +x = gen(N) -- generate primes up to N +while 1 do + local n = x() -- pick a number until done + if n == nil then break end + print(n) -- must be a prime number + x = filter(n, x) -- now remove its multiples +end diff --git a/ref/lua-5.1/test/sort.lua b/ref/lua-5.1/test/sort.lua new file mode 100644 index 0000000..0bcb15f --- /dev/null +++ b/ref/lua-5.1/test/sort.lua @@ -0,0 +1,66 @@ +-- two implementations of a sort function +-- this is an example only. Lua has now a built-in function "sort" + +-- extracted from Programming Pearls, page 110 +function qsort(x,l,u,f) + if ly end) + show("after reverse selection sort",x) + qsort(x,1,n,function (x,y) return x>> ",string.rep(" ",level)) + if t~=nil and t.currentline>=0 then io.write(t.short_src,":",t.currentline," ") end + t=debug.getinfo(2) + if event=="call" then + level=level+1 + else + level=level-1 if level<0 then level=0 end + end + if t.what=="main" then + if event=="call" then + io.write("begin ",t.short_src) + else + io.write("end ",t.short_src) + end + elseif t.what=="Lua" then +-- table.foreach(t,print) + io.write(event," ",t.name or "(Lua)"," <",t.linedefined,":",t.short_src,">") + else + io.write(event," ",t.name or "(C)"," [",t.what,"] ") + end + io.write("\n") +end + +debug.sethook(hook,"cr") +level=0 diff --git a/ref/lua-5.1/test/trace-globals.lua b/ref/lua-5.1/test/trace-globals.lua new file mode 100644 index 0000000..295e670 --- /dev/null +++ b/ref/lua-5.1/test/trace-globals.lua @@ -0,0 +1,38 @@ +-- trace assigments to global variables + +do + -- a tostring that quotes strings. note the use of the original tostring. + local _tostring=tostring + local tostring=function(a) + if type(a)=="string" then + return string.format("%q",a) + else + return _tostring(a) + end + end + + local log=function (name,old,new) + local t=debug.getinfo(3,"Sl") + local line=t.currentline + io.write(t.short_src) + if line>=0 then io.write(":",line) end + io.write(": ",name," is now ",tostring(new)," (was ",tostring(old),")","\n") + end + + local g={} + local set=function (t,name,value) + log(name,g[name],value) + g[name]=value + end + setmetatable(getfenv(),{__index=g,__newindex=set}) +end + +-- an example + +a=1 +b=2 +a=10 +b=20 +b=nil +b=200 +print(a,b,c) diff --git a/ref/lua-5.1/test/xd.lua b/ref/lua-5.1/test/xd.lua new file mode 100644 index 0000000..ebc3eff --- /dev/null +++ b/ref/lua-5.1/test/xd.lua @@ -0,0 +1,14 @@ +-- hex dump +-- usage: lua xd.lua < file + +local offset=0 +while true do + local s=io.read(16) + if s==nil then return end + io.write(string.format("%08X ",offset)) + string.gsub(s,"(.)", + function (c) io.write(string.format("%02X ",string.byte(c))) end) + io.write(string.rep(" ",3*(16-string.len(s)))) + io.write(" ",string.gsub(s,"%c","."),"\n") + offset=offset+16 +end

    +Lua +Lua 5.1 Reference Manual +