From 29df5715c0a1817ba3ad76dd3e10c7fb6e235254 Mon Sep 17 00:00:00 2001 From: David Malcolm Date: Wed, 10 Dec 2014 18:25:58 +0000 Subject: [PATCH] Document libgccjit++.h gcc/jit/ChangeLog: * docs/cp/index.rst: New file. * docs/cp/intro/index.rst: New file. * docs/cp/intro/tutorial01.rst: New file. * docs/cp/intro/tutorial02.rst: New file. * docs/cp/intro/tutorial03.rst: New file. * docs/cp/intro/tutorial04.rst: New file. * docs/cp/topics/contexts.rst: New file. * docs/cp/topics/expressions.rst: New file. * docs/cp/topics/functions.rst: New file. * docs/cp/topics/index.rst: New file. * docs/cp/topics/locations.rst: New file. * docs/cp/topics/objects.rst: New file. * docs/cp/topics/results.rst: New file. * docs/cp/topics/types.rst: New file. * docs/examples/tut01-hello-world.cc: New file. * docs/examples/tut02-square.c: Fix missing newline in output. * docs/examples/tut02-square.cc: New file. * docs/examples/tut03-sum-of-squares.cc: New file. * docs/examples/tut04-toyvm/toyvm.cc: New file. * docs/index.rst: Move summary to above the table of contents. Add text about the C vs C++ APIs. * docs/topics/contexts.rst: Fix a typo. * docs/_build/texinfo/libgccjit.texi: Regenerate. * docs/_build/texinfo/factorial1.png: New file. * docs/_build/texinfo/sum-of-squares1.png: New file. From-SVN: r218588 --- gcc/jit/ChangeLog | 29 + gcc/jit/docs/_build/texinfo/factorial1.png | Bin 0 -> 183838 bytes gcc/jit/docs/_build/texinfo/libgccjit.texi | 5781 ++++++++++++++++- .../docs/_build/texinfo/sum-of-squares1.png | Bin 0 -> 22839 bytes gcc/jit/docs/cp/index.rst | 41 + gcc/jit/docs/cp/intro/index.rst | 27 + gcc/jit/docs/cp/intro/tutorial01.rst | 52 + gcc/jit/docs/cp/intro/tutorial02.rst | 344 + gcc/jit/docs/cp/intro/tutorial03.rst | 392 ++ gcc/jit/docs/cp/intro/tutorial04.rst | 1092 ++++ gcc/jit/docs/cp/topics/contexts.rst | 179 + gcc/jit/docs/cp/topics/expressions.rst | 606 ++ gcc/jit/docs/cp/topics/functions.rst | 243 + gcc/jit/docs/cp/topics/index.rst | 30 + gcc/jit/docs/cp/topics/locations.rst | 65 + gcc/jit/docs/cp/topics/objects.rst | 70 + gcc/jit/docs/cp/topics/results.rst | 48 + gcc/jit/docs/cp/topics/types.rst | 183 + gcc/jit/docs/examples/tut01-hello-world.cc | 107 + gcc/jit/docs/examples/tut02-square.c | 2 +- gcc/jit/docs/examples/tut02-square.cc | 95 + gcc/jit/docs/examples/tut03-sum-of-squares.cc | 137 + gcc/jit/docs/examples/tut04-toyvm/toyvm.cc | 902 +++ gcc/jit/docs/index.rst | 22 +- gcc/jit/docs/topics/contexts.rst | 2 +- 25 files changed, 10289 insertions(+), 160 deletions(-) create mode 100644 gcc/jit/docs/_build/texinfo/factorial1.png create mode 100644 gcc/jit/docs/_build/texinfo/sum-of-squares1.png create mode 100644 gcc/jit/docs/cp/index.rst create mode 100644 gcc/jit/docs/cp/intro/index.rst create mode 100644 gcc/jit/docs/cp/intro/tutorial01.rst create mode 100644 gcc/jit/docs/cp/intro/tutorial02.rst create mode 100644 gcc/jit/docs/cp/intro/tutorial03.rst create mode 100644 gcc/jit/docs/cp/intro/tutorial04.rst create mode 100644 gcc/jit/docs/cp/topics/contexts.rst create mode 100644 gcc/jit/docs/cp/topics/expressions.rst create mode 100644 gcc/jit/docs/cp/topics/functions.rst create mode 100644 gcc/jit/docs/cp/topics/index.rst create mode 100644 gcc/jit/docs/cp/topics/locations.rst create mode 100644 gcc/jit/docs/cp/topics/objects.rst create mode 100644 gcc/jit/docs/cp/topics/results.rst create mode 100644 gcc/jit/docs/cp/topics/types.rst create mode 100644 gcc/jit/docs/examples/tut01-hello-world.cc create mode 100644 gcc/jit/docs/examples/tut02-square.cc create mode 100644 gcc/jit/docs/examples/tut03-sum-of-squares.cc create mode 100644 gcc/jit/docs/examples/tut04-toyvm/toyvm.cc diff --git a/gcc/jit/ChangeLog b/gcc/jit/ChangeLog index c1d2a9ebc43..1eb31a11722 100644 --- a/gcc/jit/ChangeLog +++ b/gcc/jit/ChangeLog @@ -1,3 +1,32 @@ +2014-12-10 David Malcolm + + * docs/cp/index.rst: New file. + * docs/cp/intro/index.rst: New file. + * docs/cp/intro/tutorial01.rst: New file. + * docs/cp/intro/tutorial02.rst: New file. + * docs/cp/intro/tutorial03.rst: New file. + * docs/cp/intro/tutorial04.rst: New file. + * docs/cp/topics/contexts.rst: New file. + * docs/cp/topics/expressions.rst: New file. + * docs/cp/topics/functions.rst: New file. + * docs/cp/topics/index.rst: New file. + * docs/cp/topics/locations.rst: New file. + * docs/cp/topics/objects.rst: New file. + * docs/cp/topics/results.rst: New file. + * docs/cp/topics/types.rst: New file. + * docs/examples/tut01-hello-world.cc: New file. + * docs/examples/tut02-square.c: Fix missing newline in output. + * docs/examples/tut02-square.cc: New file. + * docs/examples/tut03-sum-of-squares.cc: New file. + * docs/examples/tut04-toyvm/toyvm.cc: New file. + * docs/index.rst: Move summary to above the table of contents. + Add text about the C vs C++ APIs. + * docs/topics/contexts.rst: Fix a typo. + + * docs/_build/texinfo/libgccjit.texi: Regenerate. + * docs/_build/texinfo/factorial1.png: New file. + * docs/_build/texinfo/sum-of-squares1.png: New file. + 2014-12-09 David Malcolm * docs/examples/tut04-toyvm/toyvm.c (toyvm_function_compile): Move diff --git a/gcc/jit/docs/_build/texinfo/factorial1.png b/gcc/jit/docs/_build/texinfo/factorial1.png new file mode 100644 index 0000000000000000000000000000000000000000..dff47ce276721746c2b1f1ae4059ea77c7bf5b75 GIT binary patch literal 183838 zcmce;2{@MR+BSTVGL*R_k}*jlQi?Js$&`=?p}{Q4kXeQ(LI_1jNaiwx3?WJbMdl%? zOpyx7`0rQGv%a;ScMaeB{oA{}t+lpity;OS`#R6_IQC;7&JbV`)rB0C68Gn$NbNXmw0ZZc%*j**c`xgYcj{GEd^~Vb zOT$%0FfqV#Ei0?VMw#GXGo9PPJc{B+i+p^Vozw0L2?-@fEFQmF^s#mC(1eFySD%Mw zB0nD=rA4Ut?&`V~Tm=5hs&k6wq2lRV_V9|=v$w2Hh+ww}9a&lH$KXp(zj^a!gJRna z9Gslg(rfEiCEmLy6c7}|aDmF zP5XkQqoe&80t+%2wg{xRr)wr&iHnPqwaL&}ma^}W*U@1y@mX~C{Qi84VM85zODHQ# zi;atmOMY>2+oAHeZ{M0s%Xu%j*>*lSFlNAR(Ob(MdfI)wqrgJi>X?B+aNz3od|S3; z99z5<7dIuesotP{4{t$6U!sib4v!hzXP>^~lf~01i_7G*h z1tS5LCvV;`r>cZ0dV9-$7#yS^QV)g)B_?u-nmoQ&Z0tIJ%&@|JSKWtVYU)+1R`mEg8GB z4i4cD9!SJ&a2g%e)6+}I&R)~+J->Zsy!$eije-z8@yHkNv$efFtB!)$qM6_u6SGcs zdErOjZ3zn{4s5j8(b3U}n>Xo*M;<>#i|x9Du&Sw#95_>9hRPCpau@C9!t>dW*5P9Jkp?-XMC;RjXI8UcIM<#F z!%QX~<3*y}UgGt-TT6Dx;Y1M!-~OCs_>U)uJieN$q2l#Zlv@PqmvYk5Rt~*R9DBHw zm6bK0{dFdq`}1kr`~ke<$M^3GtETA~7#Yy5H2+rk{QM;VM_G)FcPALc4b9jaA-W_$BK$>8q%yIE>xo z_*Y76x_>lnZb)tTFwn^o{fv579B~DI_ za|o@a3kVG4<>R~49%9^5s*$jVIX5@AhQE3RHA8Yy(YmFjCE;lk_mR!mj28WsUKLjY zr^Pf?)gAC)d^>h9>13`I7Z+!``t)8-&Ve&$1kXD;IezWiFJfG#doL*|DLf*ADciW5 zZ8e*SFaBraXy5eobjO3!tNHl&@~z(qt0zjY^Y`!HCB3(< zFB*UOZLq;{77ORzLeX zAqDFl5g)%{0|y7)c&qV>PkV9TghfQ|vTo62BEHYeOh|s#xV4*^2s0I{oV`>3!+UYM zotD@oC6yI@OkbbQQFtw#@b>MSckbLtDSznDAzfWvOxp)iFYV&t(jR_{KQnvYB7B6Q>O$pZb}{++&i3=A{m6%Jbm@HfWRjK{~V)| z>nB7ruxf8m^Mh3vIoodU_aNUya2JdJ)vK%V%q+}rZfrNAAwGTjL_2-!)~&7k_ZzdX zIaV2uEqjZPpMPX&ao#ZLtcuDiis6W7Jv}`EKbo+|roxu-nuVvkwHP|eoVQUVKfSu% z)tx?iC|SMid}%^IS8J)D|taYj4o&vz#^xDQ)Hb#xIjzBD*lD zw1!)DBQ`slva+!;7dDl24)?lsffs*#Hk+RrHz={^x_R?vK;j9lMCq0C({HXtMl$2r z1UxyHcKqR)l-yhf{)5+Ar9WeZ2%`QPSC)<_o7~dT`EL!}0|NsT*7J-hjqP7LAL@;k zByHT`I&p$v+GJ;S$5xE(s+om_e^Ah>oTdYuKPP&}&T;t_Kj$-!L8mo1ew>z5#N}yY zquQR&j~oYy3k#v`wU-&uZ&kuru9;a{cH}H|R--CU>04R~iJDff@$vClm}=3QoS9K^ zcX!X2b~=B4hgl8Pqta5q35qjk&eYg6cIubd_l|ylbW6&i9_^^WaZn}4LR3VAD*0D! zrbPUjz`#JR`WW8^qx7s)PbciEc4<+K3*teiPM%B_cQMuxl;pc~`7$*@b4yZqYt>I| z$Jn?ydw??cZD<7c_V&+SzgE%LXZv`5FTg=ydyK1`8Z$F9Q;2fhUME4{28RjdfUQT< zX}pS)>a=xr1-|fQN!qlDpg!`7iZUd5&BW`AZ~GcrIs4(N=9rtCTXITDic-ysSFfJF zPLz?c%TT}X?d`4D8P%S=MM6Si2e3<+>5rkN_KwRH6&0_K-5LJU6YVNDGc!X&PakL? z!ZzU>qnRX2&(F`F=q>3x?N8x(;#p9{?NHt@c5y}ahR7G6PMtn|01Zr8`ILi$7OMV* zPmSwRDwX+o3k=lJ22(3MeqIj?qo+vzTD5%Jdv<_&Kq(b%Cj;2;t;g4jgQ#Z$QO|>e zEnmio*UTP1e0a4+l5C>L_U$8Y(+>Au`&ART8ZS?N_wL`;$s&|7wvEdp&~ z?$;xTh=&h%ZWa`L`~B04t$X&wUAcNSK-|wfR>OkI%=JwId8)g`$F%`i<}ds*R5@AtOo1D6pvrH zAh~PzZtLlt!z6-WCFVX{6$_AvS64v^sriNzqL!JNS@RR0t7~k$UA?Wk>g>8U)XBwP z!sC4vx9ZHr*R5U4bfh~V&})9?&83yAg+xWKDJm&#-M(F8^T2k)!eHWFqFc(>ARR>( zX6ETdFLusRj5z`ACLZ()V{QBK5VdHs)bFOk1henH;$(_rZF4 z;DLb;Pp^8dJ>DND<*>=OxGE)si$uX1e3AEFOho^Mx6VbX$*rqV=CSC=6%Jfmyrb@J@l z%TC5=%mrV3kT#b%id+O|2n}nr2O$7xCmoFWD&!e`C?GsIx!MxYPk4j0YxWPtFThAIBS#GR+TaQQl_Ht*_ zu%uwR$G)Jtxs~J>*@^##>2Z4JU*YG0j@R=2)6UstCeA54Z{9F4S7HQc`Uw1{ARJTE z)x{wzD{I`gK13OC$Kc@^`rWo2z6%Qr-oX#TiVLh$3ksOA)hEAyAAQ*C6tml|iwf`| ztl>G{3!w94hTP(zIQ^#E_WLsZrmt4UwQ3t0cBO7OHp;|oYiIZE{S$vti?t!j=bW7n z;B1%7bKf&4de_`cP*YRy^PJTl@+zrX)wQVsAm{1Rr%LB_)@WIuRBu|x#x{CkKs{3R z?mJ_@-9{VMT*&U)v1?Z#cI)eTukRd|9vfL%SrZ%TrWhTVYF43oOq|4iT`cZZa9ERW zFi&T?qRrUzGOD?~y(s016}&NO%&e>{3JgNAPFQ0;DXH~n5w$2Pfpfop{i30zebQBA zQ*iPL4tCLzF}C8XPS@768RrQbTZzX zjlYbvb~Y(v629e7`Q*M{*84ACLNRFJNzJB)-`u-@pOSfC@n?Snu)AN{;aKyId^6z} zhbZKMtQQs+i)8b7Gkn_4omMi|(x0E1oaC{wu`zr188f7?nAjG+X`>V6rKOQT9Lz;_ zTJ}~}hXxzMxA5J;mP7eWUb&i$rrRSUEsdFw#!$<=-^A=z@V!3(TEE%0@2{`rT3C6qZDmz0|WNnM~+IC>zSD3i;IiNd7&YkdkYrNENx=v z+1Jf}E2y8nd>Oh14aQ|O*YEqryE~4ixz*~Z}Cq1@w(E)^V@;2 z_SA<-hb%1kz2?VDYA)uQR^6_g8{KADXvzGpt?ey_MpY5E7Jq6+^pN&k!QzSoryf4KY2sSMvKO2OOLTKA3@*9aG1n*J(ii*^CCDnVEblN)}E1F+PD2BMjAhzClT|}qb&>tE-?`o z6k3`BhQD3Z*Vn&ah}Xv#sVb1*115$ddA*67!o5^&AwcG|gO2oR0d?VD;`-($YZ=8c z@G2iXSliOV>g?>yvHo4?l`A!mFaF5)ns>=IDq+ABSCgCC$aR2=iz{$WMMWhzI2fJg z$jI5Y?Bn;cvTC12@+UPK#DGGgc>hhbM9uu$U`Zgi&jRzNO`ELOUr*fcQLN@=VPTQd zivf#*XwNhKD#38tqrhMdCnu+*q@<;nXj$^e*|)Nq*ibPpU`19i51=v;o4#6dGBNSA zGKVM|Y6NV!4|=I$9S6si7qMcs{r%i>i&LzRD=H#y-|n+oOi0+M9=C%6SVvV=)fXLl z^5*&ZuSO;I&KG-d&IVCHxQf|*49)cb+y4PqSs(k_CV9xL_1+PJaB_0W862fG4&}9) zi??Lq<_-tUFn@FBKyXNi0uDi2o@sbM0F`ksHP>IKo932QRw*&tj=jbA-8IvHRB0rV>rcR-63WgS8ukpk<-r3! zF)=Ydz6T{GTaF$*T6X@^6>U?#$Or?GbPURGKzKc`uMZ-cfA;%m$t_H-I3&OVqUzrv zt2mXvA}e9X%)_eWS6DB4f@j5w6%PsuQpBnju8)q5jf~}03E~Y?%CB6x5~PzrXri); z%3DkxhlFEvXr_J*CAEOMIDGNqMPUnT)Kkz5t-QZn zsllUM$lgLrOYD`AIcjdsx81Zd;gY|9=A%b(!Ck99Zf2nc)Js`9$nB-f5)vS&nV@>M z>2_Lgxoea%UkWPG{d@P4O}&2w0#l5{pS{hC?MlbUm;svXes=a=#c*(AWG!lgQy8h{oE6Wz@!yoYDf{0mc9v| zS7u|XnDflei{GBEw|aVIouchF{cP<+3wZd=on2inkNBfh1qywZz4`daf=9svfSfbP zp+*}L%V56v!K#Z9%l@Rd*GtvmSYIFJoO9TcvWuNF4dU+B%S(%HlkX|?a|~A!+CpoE zwr#5&X~|&b;tB)rNf7oukNooUcbs_ab|h=*^4qrx`^NnXHd$I*a||;{j=omB3*xuA z^TwE0&Z4c9*Y)V=030dQbK2A91?<LG0SK3rATVFhD*~S_s2THuaS& zSMtrD(uH#DqN`e7{Q9lOsfqrAs_@(o%{#@#Z1Uar8OJlcf9iwdT3Y&9m3sd^U5P_~ z+wrQhyFHYrz|#d^z3LwlLK{r8Ud*Hpq}b&1ElC7HM@N@$(ZJBBQn4D0>h#qNoEsbd zsOJ%QHVpL?1iDedspl-}w|3k4@{h@3idI!qs~Jl2xdt#xRvmOCnl)>1vI8_(rnKEp zHDEkn4fHhqQd>=R;fX;#yM?)&|u0v{VIE9O<1^NOgqNz=Wz)6;y}Th1m#bVMA} z(_5LTONWg$J3BjE__e-XngNj_4M+ZU)WO?4e|)be04vj-*upv zDn=iIjsp670u0ky>HTxU_-;mqMc?C#B;tBk5NGeGXzs6XWtFKpS5RE6a{m1JB-v9QwXoaH{CD^r62YW_rzMam>{J%-J@F%3rH|e!Vay-+9W**ROMHt-E^P zEJ?F-aD3=>?Z?L2Hi>EC!o4xj=%BJT%6b|Y#NQgB)>O6CMwzVx&d7YYgkF)AJkQCP&JB`Z0W+XX+)TaT^~MT1&Hf zwGtL1Z<#fDL|Xk1&aT3n>e(CsYkCPdIA(Ts8t|KOaqPiQ&0E{r_;&7OEiEktTHka- z)L6K+si}!1vf6TuuL8DIH#ISWL0V^$mzUQ79)*dS*-tM^-)yus69`EuBm6BG)ir2v z=%W14Bf1?yg!9YFZhCQJJFB_Rc{$#A^&qqfJkrU==&f<$7OMa^82D;_{TM26pSIp3 zBa?dfF4e;`uP%Ye-nW0hnU~FtPUk!L5a=Y%?v*$gkD+0)k`unT8r{fvut1so+(u_X0?nlqYRJi@iLDr2M)v?o+?|MJA!}mE4Aakd9 zd)4;s+pQL6zbUsCpVg3;C$<~p%Xe7(op)1pJ}?4uS!tD`}+ENWvMl`*^HU@r?i{;Bof+AP7l>C zo<5y+P7|!2+Tp{`fd>g~XiS(s-(XOpC2*QGEHfsgg^bHCgb>Yh(_=D^+m4rG&c7*X zb-mtcSWC&O$U##z+jL5RH*DkH>qK)~juEt@mLi+>fc$&ykqLpcz z?8TWIQBhG{cI<2E4qSF}|IM{I{2Q)~{B|;dif_!CQvD>OSy;q!8>iYXb9)Du^trDF zx7Go6!)2m}cJ*rTItLFN7{J!)sPvM#pOy6n9XgxEYqWJM;R_t2-T&+v4Jae7xp)xB zXpO;OS*^K#0A3RWj;!9+^;fy&xR(E5*Zh)vmP%W^qo=zWXPXjb*5jjU28A`E$Df*u z+uGWa-9&Q?lG)MmG0X_Ze%-!M_@xC{>!gE2f69qox=&g+{vg{@Fisma0JN}N>on$z zqzMXIXxqc&wkBjGr@2}CM5X5jFuJoN8A-~P4A3l6wTEG5slkB{DR$Pp$iYdmE4Cj6O_BG=d?*OTBpxh-E z9~IPt?3j{W^^>;o*|Tcwo?YIrlH^P+xWTMRn-<-9IF`JS5LqT8k$!pA=y6_7LwAWF zN%J}yvyBHuW1~=8fQXoxBP%NQlaeBkV!#}54tNvvjB7I!y@x@EQTbLbFL}%jT;>LY z#6;Yb^^zX%DUIs$__`l`k`HW*va&^eD0983p`oGW+|=htPT$j9%kZaKBA#PPr-x1Kjr1~=OF|Q zt8#EKuy>k7WjcAZOV8sls;OO3D^(ZdC!pfCrD%A1?%TU}?-2|y4w^^L{*NfT;1a&T!GL{+DTyx&pckfcBUcc54h&Nn8DzbxM7rz$Y|eVdq=LvroL zwJ83M(8+VoR9TJvdj>5LWV?aX8`g)fTfM?Kr8KuRfP-DxTs&Ia0veLRXTH0iiHj@8 zrP#~?8pL|c4EXJ~*&`Irf8sv%+xw0WIf}o+beVqel*9&1wf%-$zaAA;VAC#|IMe<1?IkVQUsO2kZZn-{i|pktem}Jje5!OS7U636N5{lEstqk~TQiTMSzkp%nw~ERp&1z&nH`c_4jH=b!GNagHj);5q0B?n zVnrY;3nvSDnTO<{8W%`Nh`eKW#nL9~QO~4-@CLyEN2m&r0<@sU&44Rc=(10g>STzE zxAo6Pa(RrB1lSbA2MnQbF66wP8?*NWKSqitckbNbiBu&BmJlj*9+eX(67pw-E&SJQ z5tz{}cN$_i({wuwc-xQRz;?S2GUwhChDJs*wt0(h4~wN#R+@}`a%69jN{EQ-7CFHohMkx{Ovfh_6lP zN^PLx**9A5J}pe}?A~3h^w!)~dwA&SiB6_>QST~C?7CIV3*t8IbCXwAE_WGc(a#aI z?#``#^(u^og(YA&Rs$tOg)DjcL-njidafmj(jdzfef}fJ7#bK*XlrY$*-iI{klDvu z2`oQ1)9vuQt}fs=^caE4j^o1?nU%GTf~h!38(sIm%6(Zjucq4nfovjW4U}vzhsGB# z^!nTeKYXAe@GzN$N9{R5Oe!gJvFf;XXM*REp8ARDC^O-fVhRuTjl}NVY>g_{Hg2`e z0`oosj{+nf#uuxq{JhUR3krgw1(oJHC{cK4!eLQy zB6q-6F)=Onqgd@!T2{dbe}Df*w`Pn|!%x?nuB|`vWqcf}YIN?2(mQ%G&i_?F%9sBw zAW`zvNt2EJ>UoITVEaCP`joa?mXGf@8^X&5pbSj5u09F29c366qT}L(T0_Fax8N6` z!|*7}Lxqzlv)~wXGPcxFp&UI`k`cz1a!kSF0K!pGA<&0KFeMMjvqjse`_;xFnfFV zP>pzf=m!7OFK&=5HL0VNf33_qABJlD@aE82t;ptLIUC-$X4&%zW(+ z2OV+p-F-cR2vqb#K~IqN;s6i@ccEY!C^HN?d4-vo*(0}aALK9BxLXO0U#@diRTqOt zf)r*UYbeGWhy=mg1)^Zpv19ENp_)~sO$dKzWo5O3i_XGu;1IpK7{C()kq-zjxqCOI zrBUfX1Gi5d4%j!43u{ifx#uJ&6EZGeszLFQ_PfFw@>9GZ!jL2a2DAdFA~gc&j`}%f*x6w8`v^=SnQ_Z+%uhgtB`Gqhy3ucN!I^_DEF{-90y2|TJEJuYO|}W(@nj9miIq-`t)>i z?XVMRAcQ`=$89n>-=4!_g5ldLVw{j{*xE*pP%oq4e{St2>%!V8q``phD+jY zKC+8bM;E5^eDt=KpBtcrYhX2~m=s$~YG@?~eJ(cy?Z6A57l$I*@yO94cKWv0%yD@7 zrj(RJiv|w5;E!-@zCQSEM&Re4=jEv1G$S|*3deJXK!R&+NM;r$eybseq zRiI*ujwnkAc?!-ZdAa!VStzaR=M~?ryd883xc@YD5w_YFFRn&0b24E)Iq#5W%c4)% z^@|&6E$jezb}M&wbddZ8X@{x^@a}v&*6&sm38_Ay)aNNM)J=F9d6mpm`K7*oZ<}KhQ;g3=e1a}2x zl8Y!U{Uv|7HfYB*_q#LMNjU}ulpqAzhj#=C1S(QM&*>?1UQIzkv4ZP$#3|5IkS)n$ zzk;jL_XA_SL z#krx^TrY3$=LC;o+_wJ@C^qo*Yo5;1A7E?~{4ir#J2rUSCrQ3*{|^SO)pnq$|1%p# z_aD&}aq!^5m`Bm!bGarJbi^L#(X|`7xJbp^yG$aK{(N2BCPE%{_>0RTSRqRJiHV83 z(4YznqcNG&5U91V4=^Y0y9lPG(5fZCX(Y(2oV&ud-H_~WRK5@x^vwSOK)nGy@eFMgFT5?wruMdX*V2+)4lI}SYK;Y) z$#!OHcyN+OCYZRn8POIWe{bBD|L|cgEKY%Cq>&BsT(Ltx1A2$^Slg4jy1PotwL$c? zzo%ynLBqhHg5eZjKecw}*)Jm?2k6yC^$+UD^1yQ! zKt(}td(ZL)F>+rU9=3FIcfSLd63D&8O$SBn=UJ`fZaMTkawL4gD#w&Da?4T?ykQ7xm!|J?};$oN1gMdsJ{52D$({#M&rmWaEY{*pS`l{&@TCf{L zbh56I(P|>%`6u8@8F^ufYY#jAb#h})CcMw z+h#c3l;ATV-cR(FcNE)ka&T~pPZrxV9r%@XpL~;wf8Sa5tzg5hXj$DzPjtm5>GgzgJOE z4*ziBcO>6PN@9c()&tJ9)&?irxOjOqD~~j&PfO(a8JcaTCtd1{Iu>%Uj-*{ zldv7=F@G5KQ(j@yhk+s=n1)}IZ_gff&|sC7m3yF}qrhH{-+5M1fJH%sjh}~y!0&_Z zuOYuMG*TPqzMHQ#T6USK=h08jtPf>A()80GbpDbe$~jYImG`2wo~|wv^P8llsVzD} zYp23}7W{!2TdlYoy+RWb69XlHE@8Reyng-q^DZvwc$xPLtt>5h2q9HxFJ$wP2595Lqmr#?sGI1l@HB)++{YGmr=E>#aXFj?$5@|yKUQQ zhsWQ7v|WaqdEG8v9Kf=(1N&XSetmLoEDwuQ)#B|von=bl+sGmZT?o?T(^99Q=8leF z*bQK|U7fe>r?yT>EDO=m)kR5s`SK;;0SL7f1lYL%2@E{8{gqtcs%P_-=fuK>x)Ys_ zx@xd#;3+H^IM(MWrorxZtmD^fWzhw6wXF2AZZai4S)FZWi7eIwaQd5 zxp~fwWbASL5YQ;-)um%E6`7crb2VS)5fBDZ4ac@c#YDobGMk!?lVo2}qYI>5p08T& z9(bdRBY}^e1T(OKfq}uG$a)>*i7TifDGekkdMPJoyElY^z99PK?JlU(I2#-Ho~HuR z1}A`~^0p&4%W3Qj`G}JL1{7!Kgp$LY_29J^I)Pkho_FC+u7MZ(U`S<6?88A;KoM9bLaAR z@G2Y z8;ui<&b9{>Jh{Z(S)h`ll8qg9 z$PF+O>X~S%sa+~45Jy!$qN78ZJg&JJ1Ta2~OaG|$rlIFC+!qwu@iYCZE%1g=;cD^F zjwpYLQ}EjFh0B8=VBGu0z5I=veYY(;86d!Bc|6l)L&j9%=!a&wGMZ{f6;$H3nhC z8*=`uWXS*$#_;F6r37rfZxiKT%^_M^w{u=NcTOG~l!05e=aYR!whs=lR$@(!;^SYR zZ%L1739w9eCI)6^ZiV&Cx$i4{t$Ej4j35daJUYiKJNte`jPvZDP|o^YY+2HLFf)Hd zM1(I&l%imivn79|syo}BF;;Zaqo4k&RPHp$^;1ldho1>8%sp{(SK<#0&;z5RU1JA* zv%iu6PUnBvYc@P}qzi8hQ)MV%2TJz^nTgMz&j1WqbUrw(_(f|%c^lMjcmyF=sK-mJ zM0==)6J0@h4}xI&c_#Fr6)@zS1T&hCssk41_3izjdrVfO!6{0$awXY3$)P0IxV&wA zHU@$Vd8)rVxXg|fg{Bc_|`tj;tv~IxpC46A)Zc6G{Y%fZrop6>klLPp%iVH zYTl&Hc&CHCF@~0t< z8GkG4dsEs!WClhzLW%n|KY!HC?GckJESDP~9D8kBONU%aDyNh^%{bBr&)V8<+`oT+ z7zEurzO^pzKVs$4*T+dWGnFrVN&N#wue)F)16>kT=Cs#c zqq~1O16*$U`ocwj^aKHlox4;C~{XsZ}!6F?wc8vOO z3Z@yV9I0SJw!I8IT3B36Y1w^eBY~;pZ{D@x9mD%!Zf||}&g|o}NW+Hgo;*u<*Xa*QyX>UK#RzL!N3zyj6q^84$_M}VU0nw!Zj!Ha1Gj z`E#Rr-qYKPoB_kIGx0ty0}Ew67L0vihJ-+I@4X|b1OX+^@M$X-G(fIKoY3+FNi%C} zIxL;0snm`g!zEV3jR7i;7jKz>u-Gk>2HVN2SM;!Gz$<*|gy=y}&&QKx-zN@k1@gxC zgy)iq7zm394lp)4s-vSTD86>xx`D}oTH(c)H+LQGxV-?DsYUqAr^GkwO+DXOaUt9T zuir^XL&Bf1YdT7u&Ss29A9~l+q$T9>onu%B>67|!?!0d{OAEg^=JQKR+JDilOH6$D z-ARSiH}`L9DIjwKafG3)5;uZvJFfA=EZW$31q3GYK9CC4H8e&*G%9+9C@X@~N8vr_ z@pED`T!xhLWXN?9Zb!J&X$Ue40Nwi#Mv_f%qeVg}RYU|u5p{3yVaG{bFi2<-S2PH9wWDNL1@E>U8-VW|(s3R=Mz1snfX9v*pi{-f7c z78MuMd7V9T<}K_~_W;aWY!Eh;C+?-Es|Y=W`HsMd)jj^BIRg})m=*plsqWeYU=8D0UnN`Dz00HN5azv_5LktfE7SH z-iy$V9TD);4C8C2KwWqL9Dnv%SJzGWN-%~eV9RXXy!k+!0UCumipCVAepW(4N-6`4 zuRG?hk`J;@pV$1FosGb|3EQ;)CJQSo8TNtDBqSqq3-VFs-Max8>JPzg2u5?e$zy}l zEP)cd)pF|iitDr@}Rz6UNI^?znS#oBA^xc0Nu;l*7nQHbbH`G zE14($Ny&74-~W*Qx02ZtL1*)*V+vphg8_9NJg`pXpLxX*9TP)ApxIu++-vWfI$F`c z@L39Jk9u_N3tbK{a?1Yt$co_200MgN$`=128?XUNW<_;VbEkHF)w10`1y|L>(N*8W zq_u)erDTds2)s+#8NO-%XzXDAHBwf+jQ)t`XJ%(d&&{1AI(8M4?^AO!b&7POJf>ec z?;x~bBAo8btx$vC?h-s#^@AUWhAc3g&$c8j38)X9Evt>Tg~E%n~q;9RS`?=3~ax<&Oakq1*R(!B2fK zBf56w!rFq0%u$6&VAm!Y#0mWT{36uS;5ha(5K(~>3o3Zzty@=7$js2~6&Dv4JmHu; z2``vI{z(c1EY3}j>J3aIONW^JN+>Gim`Dcg={a}bv-N+|_ZR55Z&yKadrwd3?5vxJ zQL%dP;&Z)?=o$dnq!xprm!!2Gff)#9k6qM{P00h*{=JJ(Z2|N))aq$6hq~E zZR1`=>-)4HSUf+NI%$S@!$2);?ErC$(oW9W7wQOuE;GLPe zR#H(#VDCWgd4rTI#93tn+J*m)`;5!n&ZkmY8DlIN3dnhV?9l&#T<+hgGkZ)e;SY?4 zH~nB_Cdc0Mck{QSi;^)-+WEDa9{$~bgI?XYa{g^dGZE(|c=+3`KFEh#Nq-~fm6=v9 zBU6ia0{r~`#0Aw;jr;Ee2gA%My~y|!&#yPS?WYg}SdkHSg%?ATx$9c0A?t-x@8gR*aW_SWnaz)k&H8CL`ovAS1mURXh?(4TaXzOJwHAJ&mBfzU zLCZF+RZ~l$1wKlQn~rBACIaGx>}NzXDMJ=i!V!kk6X?5+t2*Dyy8uDJtiAtru3wqUXrpAzPh~Cd z{E za{SOw>a)dbc7hOm?b|dz{lS?5y!Fh(W4A8$c#I#n;e38d0&sw({#onuJ213Z%Ix2t zh-m`e&HJ6Q$eC>>kc$+JCR67God3MxX4j!>cRaL<#+UXM8PDQvmK>Vm2 zytXj~?xpJhWgs|(w{A@V*{Xx{G(Gz6D(o(}GvtV)qc{w~I@Cr?8^U;LijRJthO~-ivb}s8}$^wxFb^YL+N@{CFTtq06R6= zTiHyP>1Wec)t3d|Fd5ykYx>mPIdAEsih5Ok_w-Fn$on?#rl;Q&y7M}`|H!HAtB+j9 zImi|YK436#y-76!JsMosgD(Htk$&e6rF?BRW0>ipeIA%{&mXU($W#K91Ic3ecLq?+ zKAvvsCLQ?3gxp03IABPFGzJz5;>^o9zYROjoCMTXvGSRG{{-GmYJzk$adbndv5&Uc zM~a*EWn@^1{B6VMmz)`XCnR5rU;~7TpJBtFx6y&N1y#PwnLX$2n}R-)?eDTz@1Ii0 zwt<8nx9Rlh(~wip*-@t)3Mw%cLTyDxmGsubU?dwL#L3Q)#fxzw;`((;5a0|(8}!Hh z8D*>C7oXa+1;_vyj%rZ*n;%QOmX=#G7umVGe#!hKSc$orahvGkV4D3NGj(ty7<%5) zzbjvGv0LDbx{XxYUt|f8WtCCdEZ`nJXQzS@W90~ zY#da5;zGKC4Bbx(8|c~w8OQ{OVJ9QOh!i>GiBv2STyF5*)q{xGfdM?l8$1_=ivr6x zeB?zJ5PkP}%w*?RAhvI}R}=vn0994PFo--~9e6xLt|~*1_9xOFGa|Uc0;=;4#}CTU@Z%#8k9hG@6l2lW ztKs1XF$<#ctu4E9Bh`2qV{cz3_6#=aH^AbT#T;~7~1la za%HuX{M7|h0VClA;vpp6rz~>}j0|I+v5%d64zPqLLxqDCG#$rOM^p2fN+OJW?vOC1 zi(57- zNU$ZU7?m$93j(cquswm|z=QJNq2_i!mV1Kq35KOH+`N6T#p0Gt_MB~RSqx#hSz=lm zfeBFYue__j_Ld(@^|rIiX|9K{20s2I*@{l`i%5@PUtCv9Ypw8b%`pfo)xIq|T67cC zqO+*u9i2?o6z#%HJ55!3i0@<3uSUMN3bA0M;e2N#&=qtv77gK=>;7ud<51`jk;t z!h3#P%FV;WpJT}^>)TG;@eno_wq;KuggxRtTJrY#ls;1!GM+!D#c5oXbhRLK<6aif z3v~c)-=Ogvw<%W@kQfeRONZJ!7L5&Z4$3Ums#Ro?oPEE$BytBgbCP0W0&)Ke4$cZB z;qyVb7o#gs61Z!k=Yu0oNFbMt%gIlTF~$=5MObBGt|~z|_C;h;Qr@myD*3O6>0q>9 zMapIz8;=Uy-UM2pWpp?Hgs|Q8qZUa2?-(#%fO$k#At7M zNpoAZ--=zMj2rhvkS}LJ*0Pz061ON_fn8LC5aQ!gBm<5}Cut!{Ex`AxK@sLsC=kk^ za9b{J(%_bh#}dPG8&6nnZ|HqAj*7%epshCFa~h~wX;@;PsP9z-L}qrn^Yfg1yZ5X8 zH$B)bRF#zhpfd0nM{$b|MKbVT@gpsp4epDsdO$tLcT6!pK=rNZ2-e9I0Ga&##}8b= z0QPsZuR;b~tjayI=OWMx3C0Q_mb`d~_)T=c&lV%VLi=02e2Y#z499O8vP{=se8Od1 zRX#pu>Pjiv&9MJG2g5|_<<6TlSg)7X-w$_xTnGAvynF(X;SPwyNXP}WZ6Aa(Hd8{$6%}7!=Osi zSHe&nuU^HKK+#~E0(=gEt38Sq;{~5Hl`p=Z6(oZT;2d~!(`lcdu&{d$rjbl+!W@j2hLxUsu?@8D zwLD^sR!ghrdIc&W6KoK?Gh3sd*4OJG{n;ii-3VG3kUH|rtDBpne_!Vif$K#kFV%uJ z<&E9|c6h~Y>EQUlTnXnZssc3;yh_sVbb7d+BiIb{KbLe)Q|%rV8{@}r%oy58Jyv1f zIcBV?f&?LMgFilL;Y#UtF9S#)5Q)w3ZL9Yd7qCfa%Q)y8Li& zxs-|9z{)k4AzFE@+~Qoxh!MeY#>;YH)YSuljSon^Dd2)JxH!!VUAp;kyh!JV`}FAP zQEln%@Q`hY+`DhL1U2-K!#6|}V1gmY$(ziEVe~j1JpRvU4uQ+&9=`5 z*HUD^Ag_%8oIg`I1LFO1?{NTCF2Em2_i~N-YJ-MfAS5E=<2xr@rk(?FpsY=T^0e}F z9l_963)l4;>%;9u&8Y_&1q21nA(|kxV>mBqT<^bsUjmTOpRgwR?%lf9lsNT+GYabJ zYk&hn`*Lrpr72=&K}YCb3@5x6ci>d5*|;aaH=KxfgnXB%AkxRPQkh*UaGRsce%9(xpmXErK>y0KM`IcUq2N z5go`EG_C{qN7i62>@r9<^?Cl#;GIbyqeb5)Z~l^&=HOQettRujOA8lqH5c4wAVX@A zzaVd0gbuZF&1x+WMG`~4-XH|pENzZ$i%{O2^)k{vPB80 z8{C;;WSq3&*@Yiv5;Me_gz=8o4BZF6?m+RTvssgtp3Xvafiq#YdM#v(fHkf-dt=yFzF95pIz9tsOD$MNOe`GN zLkOD_NEr zr5d+*L`Oy{5SDNq=Ezce?X=;v=uJ6hauKN_W8*}Xi^w~j(?rL^!#(>Ql}Aow7_g+! zpb?IgqycoA)Pg!i8@sB4<5gp5r2nXx9w zTX5JlU>YVb!$ba-?x8aGo^u4zoT0^?;*C>6CU)LwV#AWA2sripEnYu+Mi6T_Bvn&S zhu0y>O2U@vGKVH%@Yqe94EXt*>-TRM@2{%rltz;FUT$uinj5q}GSB>Q zJ~PT1_c3VC|{Q=f7_{SarW6Y z6(s)JbM1c~e=QvN3;udH8W+wjr-=!O1aagQ6(n~XF1MtLw@KxT`Gve90#U<|kQA_G z(DqV6QX^`(pH0`)RID)Z_HE7Ew{OEc^v;(1QCS%af!k}=H=@hY5U|4)j&788FP((c zl*1kp3}A*UT+7PnP6KpN$-5~81mA<nMh2w6uZCsw5CWPV%K^UwH9I!=B&n><8XuV*a*5_l!H_=RX4#8eCU8f8c^ZV2oI6$K=%GgP>;>uC~n-gxPkn!Nk>b74x^IXo_I}+qt+nGutDHVB*KIxX}!I2TGXbWr_!ZL0;Wg9G#^{97YC_;%2oW<=VOuByk z5>9J{>AL@qxi=NF*g|S&C#tQOPdZT1ZhU zE%u#^y*H`lqYbI#19&*#0|uls)9&n3OrA3fl} zY0pOsz-SzsiT<_;63Cw90|NCDL}AD>o32GM#}6AXUq0BdzSc1^^`xa{CAy$Fe6Zqz zGx68Hvc~Fi$+LQ}i+OnyRg<|+8;*o0jZqd*TBDup^hQJGMr11XXH?<1bGnocvO5;( zs8?g&>OscPTMA{NVkI|*?v%w3&?44OGhzoSY(Y*Ze5(Z5!dGwCr}u&kSsXBW1qGp~4GvR-c$GTX)Z z>Z*V0@pg<}_0#75ljfA#w#i`DuPT3%Ra`NoqM1psBl6&?kdTFy*HvRD^uct(x22+L zzJg3e#{Rh#nonEAYQs7GKi!nI3VNfdGJ{1MERXh`I|uMz0~B2yIhloB1_&$so;|NVrY3SlEc(JxqyADxy(E9qdXD?iU4bfS6BBFT4S#K$?z2uzQE}PbZ zHmWH!Rsj)k4P8CHxm4I67jAyCty=xcbOUM3iv1hggQ|*xPC{>QIS|VUKq8sjw^i1x z{&aS5?ntF!1&JJzxY{_B2ve560|s==cRBwpnPaOB;Ecb@-ri^6A~ZSzv0mXXQ?}zj z@BKW{!lIXyyx@_lTIRtwXdHG&neUHC>9A(S?IC%#)mDA?2sc4GLgS}wFXuTp^hl1I z9HYsK%CY4q%5CYBq~6F18|{R^Q$p5#Wt$|N7KLdePNA*7mXtQD9u7Kq_tB%{f=gtC zd1>y}lw-=jb$;aj{OKc|M+QGx=~mbbTf6j_q^KyT_g3i)^`Sz*6toQ7Hix7lgb zOKRastJ#+f<>g!6GljnW@1Up=p5x^7sy(Md{GeBhO0hpSd53Yhvvq+$$<;^X_7MWG z)vvbn=ILn-5J`VpdPtM0XMYF`RbezmQ-G<>RNHY?ATE-R;kr86>I)uan>m?~i3F__ zv{TqYW5(PbpnTE}@{CW5lTV@F{~d@bJ2-YFRtPH9aZr)IBM)va4dby3SQh=cQ^2jI z%a`LnlXC6t-2MXcM4z+lTkW!MUmmT`%|}!u=NZ0fA!D8XF-U(bWY|Y1>I6nr# z8FngT-{nx89?mMy2rDIA9emwN-&`5^R}{)wOZ)khxl`^vdekDU;a&{0F3q+6g4em9 zcN+h_|HRUOf6w zF2LI{rlzz{0;$wr@q6H(rdvGrnZVqF$Rnj=m1TUTzOG-R=@tmkF?RT3%{T#KWTU}x z^!kSS>mi$s!v)!XCq@p3^gYIxjcnZcOzBp=dJ9Ipg5@Oq@kZ6xs$=$~AkoA`3Q#jp zQ$u4j#&%|`;~9&5wFi5gj*gG-ls|FOq~5G~L9tv?+rgb^DG3(kd_HY+ABZ`+bJu~u zA<&G3$z`?r8au_>7F%x3)psx6ZrQs>j}2%{l6S6lU25!tn`Psh*kn778T1+%6fA0T zAau@&rfr&i{NHYM8g_EjM}aidl_x!tmH2*{7+@E3kQmQwgyr&gLJZtRi^D&fjKo2+ zPoFKEa0_{}c4IODeajsaPueeaz_Eu99}2Qp&_2!VJ9F`!6Aq?)YB9B)U-ka5##VoKkMcd?-7F)UySO7H#Gf^RwO{7K4@S6{e<;n9Z&Ltlj9qYvD!ZFivpcCH^B%I*7xEy1hle~d+4 z6}Z#xAqB3;xue>KXHg!MboBq&i#hG;Z~GRiI|`ZmO(8ESIXa1jTU?l>=2AxKwyq6q z?z-l#bgYYNI`@9|zw{tM`74o5i3#WJ+dPMp7f-CKyw(E1!Q8Lg?GU~~B7W$FtJnsy zPf9uY0Ax{gPrRi1XI@-fqX-W~R8IIX`5yh9hJg`H=&PwYX#5B)*m=3So;FWqDI(-P zj19UM&d&1EeJA*@MHt<^*X@_2s_!l<=zu&Y>bvoWGhyTTbZU{eNC2QFXmgoo68LZu z=%t@nTA`SJddcgI+qI-20{l7%(k__$X0DLOJsuzWg+n5Pg-qm`g5-9A9tSy~l`$o( zSUl!PdHEuo#M*RQSG6N;)xOJL-;F@y{##h8yM1c|&ni(&MX5eF^Hj>Dtob7!-?-6o zi$@>6XUHIjrgY@yUANwGpVti?TQm9y3?nEqd=OdAe?eG+;oWah z{D~9S>BNP%o8ac><%u1nbB$F#=Aj}Wf=(B{Sc?9;^XK*Pw0+4_)?x0F^M|*?7o~*- zBhyBu9@u$kTgXH$sUb%9ofRZ zIYr-lU0~w7bio2gWIyt2d6Mz|$uT$KcFJQ04qoZwUkS=M7w}XpIN1BS$)4^=V?7o$&e$RhAwE-yEtgtxc%D$BBeAOIBP>!ay9`@Ay41lg*m${JS0E z-dvgyVbiw{JW5E9zGpvu{P-KI4CfigCJUN_z*im*)YSC%tSKJ{dXtR3fpG7Xs?ao~ zgQJ&Vrq+|!3G!(NFr*fxD_9weT?&h)=02Rf&q`OM4^2wd&h083ie)ACNDFuG+q<{b zTOc*zTg@>nD``zX?F*;RjF~}Q5_Z#oTi?T0a`~DXu|>(t&wc8RWn2}mA zpMcm*+Zp=D&pc<$AFnc@e{wD~?3O-L)vV+3xCVXBDfj!rozyGM1M_isp?M9b^E} zUmJi+*VKCE_+<_C>mc{2^4gk+<;{dD3}q#0U0s!Y>8i5aHbAm=jTj2kIbtH+VZYO~ zN>{^1Z`8ee>s5C=PUi!Gtib!Te-X+Wc>f41t*X>Q_Ul#C`-PUZsQw)2{%nV~qIOP_ahl4; z4Uf{XQtuI1#Q6=Wn)IGgYHE1ch0`fyvGD!V`Kqgd=Wg8l%;_qc`*?qO)2R+}Hw5MO zk_vi6x5o(^1TU^t%a%QmLYkTaZFEYT&0HPSb;MqzuO;~S#BKW`q#q6rqxnOs;F?$> z9TqINd9JP#B(&qfIGk_Nj$qB54-EQu+L7aEx)I|7SP`#FO2&a=J*e3rykNpG6b-+B z>lT1B;K0d;;gS1V2XEV!yLE?uG(>D^I|(qBu=&j--%eOxd47Hur+qo08Api*Yo!3rl(R$cUvOW(x4b0!jzENI&l+paC z-U?g9+r?J<3ELtAT4^D&dXg9{?3_$C%UvUQM!#wptS4VKT__>fD<{AB3l&PM>nL%#S1h!vlWO>;@?AyJktP#lw^eb}?K5BOqHQShiCE*GFV;ZOGy()evC zNL4O2FxY3DoHj5r?WXEWZ62&zWqq&RAF5x#D8fX3|Bno#zjlOXugl6@Gkx zFhRI#%B&zY0yZY50$!=Ep$9N?y@!$eN^?@4pE4ojWKiP6UlkR+ zj-n?lO39n0W9Nm@eOG({<|WtUD;zOZ)6V~(>=m-wp>U08?*ubU6Aj0EVLUNAk9A- zps8!&_0b!Q+R?}&;sD8N`2M0HgDrb_%39N`Pm=?H)-fPBf2)3eyM2EJU|33mO|&d~ zj;{sz4P~<%#+#Z70*FN5&C$doo=^M%tP0NtjXFEy!jS=RcTQeH#pl{TFKlv*fS-kE zYB2jAhv`2tLj!y%<{D=1vCS^)1;=Gb=Lsu>L$d%kUKajdEmVumQjhygm`lHU}E5c5z^E;whX}%61Dw0~kFJ;#xNV-c(|&pbkj3x;A0FEt7(zD0fZJzg5-$a4c&(YM{yJ>xe;LT^TKl_8||54(PAzw03#MJ;;>BC|o5k?`^8Oq*?P+jT4HPr@dGzq3(T z!C}oE2-gU&@8E2NvR{SMRbqZ-G zkJVj}CFB03B0SkSoDT+ujDzc3E-&mni~9!$2Cn^W$Dmvv+J<0F-dhMPR~d9Q6$5So z!klgyIX8GP_r~Bl{M2w&vs9AhAf@O!xy~tffDQdvy&ML2`&kWBV{Aegr?;s8`S0W7 zQ3w~u+WMtjW4uG$&Kj@0my+C26yZXzUeIGDS+K(ZdY9FA@jYp1j z11w%xYMCGOetU?O$EH!O()4$ostPr1bn*P#EAgKnIrF<2cyt5!&}hU(=e_SkI+Pp!SW*PLBJ>k=(P&%xxgN0We7u!T9-1kcU~& z2JKwTd2IJt{UBW%#n^=M`E5IM3OXrput2#qWit#E(oF3-1c?CFidS=Te#QjfjO)h5 z733cZVC%0={~adOnm-Svz6b&lNk~*YZgLn5KbZBdQx3Lh+r{XJ;X3?w3b&QEN_)JX zM^UF`b?H$G{NT-U%1xzOjAnj?ykkt>49&zXD)&+to`Q!!BPBeWC28QLDh0N^n;5I0 zFBGEUp@gRacn6RPP*s}K8U>&+8aUd5N`4?BDoO?*ZMa~3=S-V@?e5(ZQK{TlnP21LcfvR2c||KyJ)3vLvOe9HEU!39&F@Z%uaV zW=3^3T-R^kZUK?;8q5Is_U(P}=4vG+FlOOb>j(t^J2P?o;$W{QU4;w13}SQ8Fp&>D ze8umQ1X{J3(dH#@>h+r2s$Ozj{ zCn!p}r5CGnXV@mr{RvOb_!QCQ3uj))0;)o_cX-Y3%HO`fUoVgxvrB^cO&h=`RML0X zWS^s(iUM7YbYniCpa#-***zNwx73%X7L--YcC~eN)Z1(D!C6)ciEVS<1e}3r6uQNg zwqBR#d)al1N7I`j@+jFh=6epm^!d4$$iFN6Oeql*VtM&Xd`2M1;uj6|L!U8jKN-U2 zwh70dOw0Muxgr|A9BBv_ybe%KVmr^D50w~a4?J9ny^*ZMU}~*No1rd=sJifS_UCx1 zkEr|h>CvXa9tBi~yeFwFlp0OJ4K9UivDp)!+>;(&ATa!9fB&&DHkouoqbJAg#v53- zW;pE~IDQr!tZ^|m3i71M7{pCa+I)ERtCj*0FyoJXuP8N!+vF)XlL+A4Ir{rfsDHvT z8X-w*4=J5<*7wExr{_#I%Cw2#zy_m^yQC31YeMj^!sJRMzgqh_bfD%~CF_aoJ(ZEG z2N4JGi{^x}W5w6EVl^IzXi)g4d-6mVQa(y1M%9&~v@xHLA@?qlrIQK-F$8JgLYp4ya~qF}0EpU4ph6&s&MbTN z%b1?X2T&A*>V7LxfHgImy{>vsS}G8IQzI0%#?xKv=JQHck@V%-_4vYW;-bLHU3KV# zLdv_)bPp|qR-9D1rZW^XVZ33mFuu$L3-}euD3!Ku+ZF}rZAmX0;8s!>hE;d(Mu_=R zb!cjqEqj9|VPp$TP`84;S%)geE^u_5R?Ct`6(cNMjZ4)kFOFUO`tCw=qqF@MmGZc& zNdz?}&mGveZ^W!ip3K^Za=T8LQ73FzI<(p}b%e!N9v3_HCncGgdKphsvU5Dhu5uiE z|EPc<1i->y#!q11Z{RC$^iPkQF;sY{0hy}=RHfts2RD&mq`Pff#<(r{1RK`LG8M3E zZkC>~bT-rTfdaRnMliRLa`0S`?!Pq%hOBhhyKdnj53a7H8yKVahAPSg5JBaPzxZ+M zbHgPTS4J{e#o4_~XDE7q`eWQV4R`wqvAeWA%;wpf%y_pQDgxv&7X#H$n9r~}gFp_& zRup9oLa1%XmLtv>NU!mVrnU=FXC3391!t02PKwal=mo!Z-C6eyy-7=nM2IY?rs8V6 zy{z?JNyM`?H*%DV>P2b}fYZ@46WKl|m+EeF1K()wBkIM93wEwwkCiN|s=hKn%UL9cuViYVcg@OsUA9Ol zmDJQ^B~XV+u3nCDCHtaoYwPw%aktQ2#p8B4t>rNa=ZEJ5Do2rLVMuJz9_Z-omQ)$R%%fI|$6nFR-D~K)B{9C2lRgD-oS>xAXUBPW z$Wy2;Z^}p4%C$c|uO-bJ& zj9xu528KENViFo(u~YMlSoZ#y(By3*lhRe(XRC)Quc~3V64&g+Fbk1 zJqGH*%JbypD`A6bHoS&=FdorxXr(b^_O$`CBQ9auC)6w=jv8$*U|Y$aX|uwif;i_? z=89$Bu3aP(u?3>$`MR-Gq6eLyK78-Kebyl6 z-@$J*P%nvdZ6O;I8oBK9&x-|k4QFs0?y$rD|PTYqAKXgj$W_l++USLxwGj$X#9) zmr-@)D~E#S$dNN$&uyofO=mCV%w|y+!a(D4HyJD`^^mE${lX|2YKUgwq3yh;<5}Dd zvGX#Gn;k4Gb1KjAuI+pzQt%k*#)p^5VM zr{tC}{p3U^K?WKU*ZSCmX^r;$`-Op>FcRm4L9+DAp+33WGN;!Wq3#Fpm>_*hkuXSPVlDW2%ry80`_2DPYgjrJ{b#o1sl&@=So|Lq z?*arOI6eCLEn}Z&0g+b&5$|ncAvIOgy6+zBr$mt#T-NsTm%rD{pz&&k7Ee@B=p6_{ zTfoXYIBNanDQ~;{P_z`$NeUGvFy^r-$8qizQV(xrFO3r5by>$k>N*B_v~gQA?`=he z1#KuIV0n3pg%Iw`mv}GwopZjKj9mAK%}8O1`k?0@{wL%DqqmNy_NqP+lpB=^*=2PL z^*gVzrpsy7B#eR*^pOwJ!<&sdA5{eWNX~b5_7Zug`Dd1NYZ7J^Y1Z;SienVCEN{qZ2Qkct@~jlc78u!W4|>#2EGhOZ(P9HM`Q-R992dH=xI z^z-wpe1XLGJb`_BvKR_`j083_-jt zuym4KU2kD(DrXpfYWH@53he(^6d>rAqR`OcD>O*e2&8*)#KQr ztm85q=V)tZnE%Osh4EYsMGkB1wP4D$?>*`8&Ekwm#D2MpzGERR)(PzU$C{h_1_cEr z#KBV$W9*xb!527f84sH=BbDz=JQ1^RWZvgDHt?U}Ma3=aW#l#dQ(E?f-332X$4ZTC z0^|3?m3QffTkU$Uj0IQ=I!)ZDyfv4(19FAj5v+4G&XA^rpC6qxsE=<&>4;V-FktBk z0=tb;Wd~!fb{+Fg-yxl^C@tlI6idR$L%5eY#C*gA`trS7C!#LvFz>BT@?g=An1REYp`kHT!!+!h@*^zAN3|*U&vFW zCeu&0c2vO!oe+Wv_}{rh-w8S!=D6tUOvjwJ|7(PUq7jT4|B-MY`y#_i$gKt48IJue@`j%j2A3jctChUGAe>g6x$-^8u&!9WZ~@~> zRYU!YhDfq)q?oOQ3J(-C_m<}9GMk7H>hJw_IeIOV@1bc|ST3W~Gm>M2EzjXVT zDRB+W8tyM`sjyvnw5fUJubuRJ--}f0yR*dxh26zVvu%2IANWFdmz>F#4$TIR>7ZkM z!)E0E?>9$Icj+B)F?^xjbCX^jI_S!e-c`Sbw+GHclGMaz}kzm;6X=%*bV$GMzh7u%2Xq+>n-dEfhCL>*}%A9~qWgzwXS=4RNXE}(j z0=X@n@}BCAA;t~x;mmS&!4aT=j(fWEsg(80g zf`RTfZ=Ky3i=v*L;kI&f6j0;b!t0yHT3EP6{$~E7$RKUIwiZkV;it}l^s_j#FeY#; z-);j9HiKhAs@7?(+okTA9rCtXUfzwUsbF&E%&91S_4>6hOGd2pRE~Jp^?}bkC%t9~ zv;-bY?3s(d+4*SDs|yuS+Vrlfo!FQun|cxNS_+9r1U1mMN|LXipCc1<->hdNPte(I z6^Ru<4Kl7tK&{lnn__XkYOqUCP1SGMQ|rirMk5Zk?z<~60>*f@bTsl&wKHO??R%!R)(36jnULc4w7*>o`CNVtYF zOU``I8u0ts+6Ixc>3Ify4(_Dxb!k~|$D!fHocLn=Rf zxCT4i_d5;%wwP6da|lYdobur2?5wluG_~-fL3Tp?RjzAGA22-Oy9|7#hITX$FMGRnIPS7a0Yh)BtU>xXPw1hiul)kKQRGwQ=`2;4vfR-nvX zhGVMJ?f8Hmxm|@sTF?VQLaiRdc@nnTO#6XK+D%P;1){)4X(RXK-P3a$e<;7NWo230 z*2c$_wWk%pf~r(63&^BD;`0OchYd{ALNfNGjMCa)AvD_DL%F?qu zY%+6Z7c3VtA(pn3+H^C#_~dPvt5e11BzIRYjt}z%Uul!NOE%Wlk*6;KFAVEV>xK~J zME^tc0@wiz~cMV8^(SKBEm3i3d>+ild8;lNKKKb6_(q=Wy1Doz_1=HrfTDZ`Qv*C%EJihFTU(o;nHF+R zwYpE8KHzWAXzI6R)9=EDw29?}d3W_T`TIlkNU0zEB56VJ_%(0x^-X*BUnX1vxb17& z-aXoH-#u`;oglfnA*eye3mwy}Ms@1^88==(v15o)*=I>Gx64~0joGt)C`|-qm`-}~ z2!5DH49H3$6y+fQT&R*^DFxF`0)C~eP^LP63h%*0HN9@1Nr2Nwh1sM zieTyp0)kioQL$V9soAD+4Zq03pC>;%za=_p+IBS6VXN*V_x!2ytxN3qxgU;9xu-d!iap9gXthyKue&D@Xa4oQh3Zh=QZ%KOGg2=MM{LlfxPJKw za}ATli%;2IQIHOqq+&q9Mk^&HXT$(|tajv1tXFBOCXT@-M)MC0R#uK^N8E6EcpHmp z8oDOEtes}k!)EmC)r;_&uAK9thh-%qB(dLv@_yUm@9)Fjox9NF+n0NX{0Cv96aHZH zMkS6iQ7iYX#MD5jF$Fk+-$L9h?SAhA2{nsP34{v7T$7_Pi=rg%PRilIF?EpL3siIU zM~|P8x@a`0l*eU61V@vEbNj|ecHtHJnpYMaE!h@m@M~ao?Dmv_S|ujHZoAThg@-c6 zHa|R+1p_NCPN)oxg?9|fTu!6$qW5B}(A22+#DihHe)}8!atPSTWS%Nv8x%<+=c zTJGU-OlwAJ^6$D9W?rQxP!z-)j`I85InloYrw6d(E#Xs`+KgIlq_%@_nuC_!)KVeX zMkpWz+jtjsMYtv0Mrqpw$qr}A$-JIIu+93NnmL)N0(7Qjv)1r8so_T&)rF1x*#6Uv zpfI*+`_o;;6Y(B+IOSo?s0<64$01x zwQMrHD8}i_mQjUz_?q-pfBD?AOp9kGl8tuj0#q5o~AxFD>p zH`(G>D5m@CkMI_7=T&!@)1rQ8)5M4fvh&03)N+$nA6d z)f9eT@c(ZR&fGdYxp4#TRc_lYrV$#m_YIsqWMxROFMQE*b_nqqOX~EAKo^4?gXg7E z*nxj<3vDOR29&Rl&WP5rhzFZjer?M!E|o4==N!x>69_(4$F+;wV>^QHO|eE~#IBk( zU?h&AuDP+-fPUMkc5>}1SSO}{mBRFtMp=@$-#4fr^Ik{ir?D*Bh()2GQ^~jysnk)# zf`|pi@xz|u-`62#H|5sLsVM5my)&6Bb8Q_>UyIL;fv_@c?_pkz`ytg9{a@@3i1tcu z8AC~%qF*10wpBou9PI+Ke0RVx7#eM?J=uptZD%muV;Xh*wxVJ)>~-kz zQ);QLtR;K_Uu-k^84<-`e^{Wvxz<{AL%rX!9pGs?;eO3NOF+*$M6u5+hX zp6Hddj&n4WF^GKNeg6JJc<+$w5>fZ26-UKFIx=H{tcr1!a3tBJ6_FW}a~{MUA1A~@ zhY!y2tN8OL2hI2_%W0t-(|2#ZpO4;v3zN`ZhX$)KqYF00t)N%{^fJkL11^%)$O3fbg?Y3+yEnI4{Y-@!c`(tM<8ruXixo~}!Q7bcj98G<5kuq+FF9^I zvmql(FZ4b89zSjqcx%qKC5s<-*N1nAwF zheW6?*&5AZiy(-hLVc~Hqa&?<-WdD3`$dV>^Kng#@cF51sLR&b%~2u9t?KH{*tPf} zm>~rrtv2){CUJyS=}T1D_mD?uC*}MmR@4A4dJbjHM?g{mg%{P*p?`!GSm}*wWwuKp3eAj z<9?WgVetaj*bfOvTCD^)tK#DsAtH7KD^?N!XCj!Ya8_q$a1#dZY^gf zNfiq%o5lNyGr6pX$d!dHcZ-`YWj`uf$zw05xD-Nmh>K@z`uf`i_Ywunb}QLyDUImh zG_PWzK~L2aHv${&ZXN~I2~OK zJUbYzdokgLVJPFK17lV#?8HFj!{hFe*1?`xxLPl`>@GtDOw}+CnN!|g?pLgqWUPP#kS%mve(vex@Pv-FxO7zF z8rTf1Hm&WZl&df5YlaHTjK>biDngozG>dgA=*npVE*z;L>TK|FbQJpbXtlm z*#G9U{lEERqfJfcm3LQiZ1)JB%ocEY)AIFL8HtDEYz>7s#l=s8MGCV z2GS%Ao&F9Nmg`Kzs>Y^)IU;q{z=?)Bd!8~&Gt{<*zRpTt6$LL>Nx13&fkh5rJScsoR5?n||RlnZqHR+ANW|!}K+^)Jy<4i}}2={o3anM&1F#$Vv z`*o3b1ZYaUohv4L22srpt@czf^iWD~TTe2WfAqJEq{{T6~Sf=$> zcY=u|{(i`y(M2^RDftoeT1{Q530dy$?n|lVcQiix;BPu}ZOWI?i6q{J2&c6B*>6M@ zK~CR&cTt-_19S1`1YRN&^LphHni4Kr=izEK!vuNR@jfoO125OA@f6`vHHab3(eI|J zqxg~g;v<>*3Sv4D=to8XzavMEB;If^o7*bs!lzD- z%EGA^l#j65dym5hr3Iqb>&CR1iaF*|U+Rt>smrQ}O&qeXfa8w>q=&{4yqqh&cYI;H+3Bcnz* zBP#UOsIl6pbaE^&6gU{}zfJIAz>WIAl$8Wk_buR83O6#w)zm5eBypw%mxny()Z#0n zYThQVZid>KV@}|WY$&d=dH%yEX0@m1E1)CeXLMHNgQ`R1pn4`1<4g}l7*?GmUn5k68n@NkJ=H}5c(QA{e<0ll#)$2+(L&zI||e7aqTk=8+i@SLrf zrrMiPy}R|;7HPpg%Jvf!b{dCUj_Yn}idxs|%NS6k-*D65hc~&w4Qq7hg3c#kni3!k zQ&SgyH{=aP2|Juzl?h<3V#|QJuI@XiwN8CSyOY=vdXL3o5@0xO$KXGj;Kp79DnT>G zr$QVY&}hQ#U1+e4W@eI2p7Uj%>TXEc>0zf89G`jkfVNW|kgi|fe~U&eUgiahYV)2w zKQjonQR?M*U#an5CX5nI=5N3KCUX6H?7Ju5t=qtIER$VV&JZ#;8uCiuijz+d>2(=$ zYLZu=b`i6x-BBQ0sk>m5a7m@G!83k6eeh$VJuVG0#7J^x1pg) z60_4yHZZIqw%}yeOcJ?xf~yL9s5Mm2pCtc)fE$=oTM^_6`3jJen=8vD0#9!v&0)qA z0JBIx7ycF4jT-aVNOM3YS68IuRSMw{v=z}g^FS;kC^V%Oc)gV*Tyy3uSm4+D@al-5 zcv;8$?M+Qbe#t8WDP1OAoe-i^6Eb;#!{T!HtN(*D^`FbcRO~`G166?b#-%PH-P$7e z2>kGahYmpup0jxIHXHzWzZ}!UM$5{|UgbJYx!jq~eG6j_OG*ACN&u$9dV-JCq?ruC zKZSIGW-vDIE@RFFWtGrrKn)d<_bNr;phUJRI302>=VdV-A&9!z@xWI30R2^6JUx#N zPq|=78iw&2aDj5Hu#erx7781HCGWvOlb)YHyX26hYp=~?5SuJxk0jt-A1mqbnU_?Q@m?|C;O=HRf@!W zWJC($1NELEi5fKsQwNdSivIEjT59*h2YS2^20bjS1(W#xeK`o1_*5A~ZwE&fhFx43 zZjXtpdC;Tbcy$i*24aT!9+OzkD=985H*~?_H8QAWH-P5xVjv>;RZyr!;vi5NJ#$8E zQCZ#ElDe6px{(j{9-7m49H&0~4fT`0jR&U-)@h3A1D?S7m%b zrD(zIOJ&*=L4qhT#h-6;_uiZ3t>ol-N>wm7?QL6+kAb(!+&K{^_Y6;S3$Vlz3(Q^RTON@e9Gh4r4Ko;`9vy@0)xX?D7ni zd(8Ii=t3n+m~nRv-&B`AyKp9I%V`ymeFV$`@Q1&abcM?^=D)#}*m%~u#_k=3h% z`ovEHUh>#m01xI8BCbaMnRD{fyOh=#`e}DUgyJf6KYz-pUGb!Y^>pv+weo`^T^AbT z3MOD=4xC*HT84&)5mZ>f0;yu;$YcT3NFU|Ol`J~>!EaZzx0X8OaooR-+kFA#arq`S z>CQvj)TrTo!}n2p)}btI?n6v>N}4vz8_&|1XZ^Z%%7aZE4{k5#{Z0f*PuuQ?GDli}IlLb%vBHDWoOKK&gd zPKWvi5Lk7|?)_LXMM*eEOq@SL8jq!uBwV;tJOesvMW8$w|K69trW2_V36p1B?v$@E zcIwoyAz;<0)-D#Smue(l1qGfU@k5`Lv0a)a0@lsW=zcU%AM zLkr=X+g|j3l@yY>*m3m@sM4E;r3}XnRL}5f2HX`ak45k=yBFu0#602{!Da+TrLd(r zFJN}r*}L9-ShWRxZNcUXML|0;)ls1E3mU}d7G@mC);zmTc+yUfG5OG&dW_Iz8`cYt zysIl785~bsMEl-EqB)sb(20c{XsIJBx3k=rgiA088AflT|E=2E%_sfEtBQ)a)cCj; z0h{Sn1dW4TVnlMXO?;7V-mXc8PhxMW;gU87xwOan6^64z4fh4hIW91DTB~)=1Ys;8 zR1r0`3lS~}pO+JHamNrS)$#5Bq;V%1Nb?pf7{fYC^z)wZf(5EB?p08*tNXJaeXww* z%VECPd$**RV?#tae7gw3-_(d@MTQE8d_Rmq4hoeemr;#5qZO@0naM&D12>}>9V=<- z>h5NNkg_*tK9F;BqhpgI`q1FKE-sEvGRJN>`>tmE6FeDlfDyES&-g~B^MC!ve)Wo2 zgbDN^fgW>}ssQS&s0P?vq(hLjxtm(;wV|PU%Rr-Zbm%_(cVZS z)<<7IlwWRhcWCb({7|blZKkYw9a&+rFC--TW9#<_g2On?e}x_ut2YY^7;qIs2xLMG zkUwy$n^3|w72IuM+8V1LBnnt_qXjKiJBIGGaKxsJ_Hs&UpZF&by~L->W+hc9AITDO z&+gsrt+HB<`$GR4!B@|MXQ!9;BKQ3-MW*!KCE_<1-tarH*4U-=)3FLlA2`vxXa=FCm}v*}AGMFBpfGV%*zQ%2MhxQ?MT?mZ%>~dgjt+DcM51i z$0lLSRll;owP0`3sivgB@93Qys|P0E!g+qcdGL*0+C$D5LzwjL)~ z1XY5-O|5t(XrXpybR0aHi>niNyEeAWS|^r3Cx@00j&xy{hDD~W6R=Onh*blk>)YuT zrhrY5@Kp#hmAU562w=KXGel?sud?@X8GY*Bf6?8?{3yMoPgnVT1m_ue1^Qo)2`M@4 z44}0@!ZCPHRka%WAmsfm5)yxfa2ZZ(y8PTlz2o7pc<3R$>DhXrOqjO9aG%Db)#tYF zZ?*3Ib`UcYg)K*?2fqq!ZC7tMk{HP*Va$+wDnjeUi=i&L1b_Cg|JK^l`VdXRX5QbN zQl5n!=^m4>^E-+eKR{cJp~{|^#YLHUSh zQ4cNfA|6%$pr2ekK=oUG=dx-Ic=%kaERuEViIdr>TitX(Q|A+9-9RqloHmEdlI8&Ai8Yk;5S zaX?ypw_4P^dltak&V`bqyUiy*DiF5(S_%~;0>x72^HD%(l8lL;6y`#z9Pm3;I zO7#0MOEZ2QK9Tv_?2H=2w-Jo^*gm~DJLv9;0sZNXq;~>&>DhJI(yQHXKZh_1+pFcOf%qT2e*b^*%o(fY2Fp3ShGLch8iM z!u+6k$@;Gc(&eupJk($IsyQ9(lwsbu(6fJ7Vtj}lj)GL0c`P99z3e&!z@n6gdxLih zy{*<|Zw~L>At7Ty@%qC8&6?d%H%&#?xjpU=&K3RYfa;u~ZHO1z8tV*<}mJaMfd9}Q;R0)MSo-lC8kf}xc zj&@7)T1GU{9@iI0Y{cS_#yyJ`?oL`74@jS`; z+_mp3pRwx2x-mkZVEG8}b@d3?un!9_KN2w>ggeQ+3QeD5PDvimS-PI}3z$UG}-<}U%bNT~e{Rbqle23+X z87K2}hu5)b^gfXCES-ly_3knyuMQww8gUp$AcJO4rIPnxVGwc+u?oL;uQh&^gPjY4 z;{HZhO1Ak6Vd>Y9kdUb<)5$M}G!MXTR8$WZGM5FMFwbR2ZRgQH*N{fcO>NYu7u_oW z@i14oe)sO(?iG5_jW@xL?acdOb)e=}dzD!mrzbfTGJ(n*O3tzr>meA4G3L8VU%zf1 zV{>BFj5d#+Jbl_l&@P3f5;KpOJs!AX5Dd@j7IV6|o7Y;tj10bG0f>22VhzyyI<4vm zQmyiKqHA1QURd0=EISS=G&-#W`Ek$ibg^M0YHD_Ts_v!teB0}cCE7q_4yxxi_f!~n zujzscqFtRV>7m7hWM#D@(L_6R%o`QJF$`FGsHsKdw49wcyq(e@37=<|YIURBdOn5L z&i|X#Bs0Ljq@q(XF{61~2;RoNcxl?wFmJPBcAWe*hj~{xS75g*!uxN@%5USb*EzfP%jt)CFg-m|6Y&-n zwz3>}5eb6%Z(z`s?n%UU`OAv=S;+m_OrXmWcK@*}+A?|biod0r%yoyzC$pGlJb6I3QN%2ytjjMI4Q5stG^ThleQE4IlaOG9F|gh7Re%z7s06_M z!BCQbpJvSWx^XLuenl{pQhFtCk%d9n_f6-vO_k7cNwUESe`6>uTD~I{QbEimxk3(Z zl@>qyn?`7yq3Hl6i;RkjntuEAnKPZXJ(&rT^ZV~38$K2JzHrM`1HTb$!}|9P_3eZ+ zuTY3*XWOt#aOr;p{Ak+jbw86eByg6?wXa$`%!Vo=y#!ReO$N)!PiH}osTU%UAd-rx%15=XPvId=u^hRg<$7RJkkb+QWM@vEYlvxU;Jvd_3wlw zquO7_nkwl!Z%=o+F=bN<8WUkua*e@Qhs zMaPWfcXQJTb=w)KdsY>(FySiy@GTb(khDf{dtxmGdmMU-Fjb~Nh_EOrozh*5TwVi0 zljMx?Nir~}CswbT-MjnXfG;mE(1zmmF${HZnkIvNiR6I?+rE&x1})KyZc%8Zt+8A9 zyQ^RC-hRLsn+zkc?iH?nyrd+o9Z4S(Ro;5?fI63v=@xIS3OS5?$}jA)Gb>ete1TTDUmV3S=4vk!cc8$g20Q^dVOi=dJK> zR8_XPB8spWh*3CQ3)(q-7#mk1=wUQF1`TJsOXipK;e2 zMT{UDg`3}SWiFdyc1t)42uD#2OFN|kl~}Wcp7nmT>%TIV&N8R`BV(yOjHUbp!C3lw zN_<6yfLp*|>WhSbRFo=ek!U*#FpImn*+o+w}O-;X9eqIJ6f0%?v?)e?+ zYjm0O+R;-i?DV~dKtaHv0;qy#N|p(q6-X7r?#DCdFI(qit9f$K4dtYiJTGpDI@fMX zN^5c^?(B=Y)+G4C|A@g95(5t+|EJ7B<`+KPv%GN(&I>kXCWkHdL$$^}a}zjbigG`> zLT1mgv#5_{pSj^HX_wBy{Ups(ANU@p~!6d4Lz=h!BH zUsAg>(cPkH4eDx^lWaY{l z6rYDLCzeK%`H9ULNVrSV6t6u~V{JFE>?$5Pky;=SY|&^dJ$#hkPBr^#eookCK&y4=gLxydaW=vjjNgERE}O9H)LmgZ6TX&j4sl-a-GxJ< zFi92>n^%ZY1wNxCYtAsT5!%=s0{Qyho1?q?;6XWHNtkWwIyypS zAf@n&g1iV56NqEpm(!k6gA2}lP@iL#x6{|1g{r`nSXnw0FlH>|du(nyi7=0i3H?Rb zyKq`6>#(ryr!x*WWX6-I5m7fgl@_VziWMu=)QC~;)gGE{sVQI9t|83wa>Lz^cT;vk zJt{NwgyKEXB5SZxQ?szsvK8j?N+9o0!c72nGt<{j1g&6Zd)f^z5k5x|z<1r8gl zg}spv(vYCqcixxSSLDfEJ#wrV{BdTiv#k-8J-bnejM=;Y_nd83CiBS}}u z^$ZO(nJ!{dGcx4q8Z3m(f@hol4pDx{U=s1rZ7)x~Un;!78@_$gU*AJ1qFtYVyJP)# zjPK~1&7>>DU+sDu3IM`T9L`R`=W(6dCPiy? zex6W)YHFus3HfaNe%Rna=&RzU&Wd3`wymC4pqFklDQk#*!Tx&lH#-hBKAfSx7z_L& z{dW8I?S#<_Gh(cJhc7YZY51F$Ipk^KCxQX~CK1ZOUa!#!nK&leo#s9h4-OkWs^ObX zV-N*};3&vZrq}yRV-TINI`a1y%P`|3La!9mW%y3$cw@1%n!06zwejE_TaV!ch45tV zz)gG|d5<<$R-^x(Msep(IG$1A!Gb$1(kSRk$wlj3wWH6jUm)J4uY|5Zl@3PumOQH& zBVbb_CWGrkXa$=ZLFDb52$_%F&}*95z2?)igdavmsIRH1(33ROf44i9x<&!^{l{rf)X|DxXS+(vI455N=y$sZZ82u?~Ah)Rm1=ASe<$E1h5zTdG? zP?*&9rk$RLsQhdU{Gr{yVnEP!cMg{0bOc8FIJl%C3#@4-5$+bpBQo3rsgOO8M4{83 zaG>iMgI6&dZ7*!cT?Jx>VeXx=G3U?cKkiX{^kAS(UYXVS=)3a%zW<=f50LSG;&r|d7h!X;xghH-&icW(9jlD7oyqEFq3 z;>{*kX7nQ%Q-F7tlPCX5?)QoEKe%23z0;Mth`0zi?B@TL+=*Yz>worf(A8@=sXAQdEQ1{OJjkqLXq zd^>!V#($$%>$K2~G&%o3a;q8pM{iRQE1aUvOfP6t61vkb@pf0>o6NuVHUFr`d*X6( zyhv(?$ejOenARQ)fLV-X)$nM{M4>c zGoc_I5KQl}BD#WzXSdTcQ`m=#=n8JzFJ)@0;xZ~##MK51(7p5XqBTr zLB%c=xU7EoAGCN+0m$cHOIo=JJ>prxTRJ!_V-BhB5koE{{k8i^pL%;Cd$In4)F1*Y z?tb3%UjbaS7b*Hd`yS2-9?A|S><4$;7bS$F-(20`yLu>+(0}57VtP{X@~IW7f0y3H zeuq|O*Rx;0*3bqZjhFz*QjkFP{)sAnml7a&4VOx9kWDWhvbvgG+lQC0V%4f?&nOB!yM0Xu@?;htP#dof39mWO}_QuiYb;n3|3M zn~3b*^UKc!0{)LkTde{r^gJF?RUe;S7MWk(>O9YFV`ued`iMEn3+?ycalW(Y#lK-t z?f89v{NL4gRVx`=8`XEFHZx{SfSj$n=Ht9SQ{_dxky_6FLjeH+3mLIpNR|JE!vKL4 z`IW7gy?y<9JJtIC1A3qKd@H%Q0kpf1W!!GM@P7=`0|Acy?LHAs<>@olkUs?oD5o?!W zQevN0>(*tKf49S{%v*ntdNEvTaPg6$Rm-tVmCvtM5u3jDc+dzV?V(SLY@C#3A zFk~dE3og%gI+ExC4Dk^bkXGfYvt}B>1u6bYQo}FrR}uN%(i8EAArYw>FTtA@qe3^_ z!1rep6=}z*@#-*L_da;|kl1qk5jrg=^IlDON9a*t_Bf3`5}Je(Iz)6=53@J#tE(by5Op zCUnjJ7zmcpf=HDyROBu3>=91(zor`+U zSu`0~vQjRUJ&@Eycb~{z=To4Jay!GUa@+qdFaAj3eK|pbaG44F#$i<$6dYOwzPV7h zAw2vqLLT-L^ruG`!p2Si{LD^O9)}9<&eA6EtU5L$i!q==lRah0k`s5{^DGH>b>Y#) zTQ6s)CijW7%4QPbGA9yTv;)HEzF<;`f4Hd<_Aodstj*D%_oEB<-^V10t9uF`1#;}8 z=VuH(kOrCF<{Ed1v;^nZhMm!)HC1IGl@-4{Dpq3T2s%7-wzK>6#P`_Xj*9gv7mZqC zjjS59Z(nn=Lr@Zn@I-V_+XDi+ei~^N!w4h|HU~!3Lh_=katCX$ZJjXLmg>Y4S~KF-o~*oZ`k zU$gt2m-^{bf038^{Ms0PeIN;n#z)47L*7G=xLf3h7mMW5tp^dGgRWo9oGzPsDW?c}+gfq@rRk#qWQa^gM$7|unmge5DyoNdcO->Q~ zpX3y6wv4K~p6QGBQL$w0zpuViOVbGUQR!2*?Q*~s#Qste!Jh7MFX9*mzDZn_SE|~t z!$s@~rq2Y9Up5XviKQUMLC~R`nCJLS$aU%ByKuvoNdG=I6Mrn-i0nkKY2-sMRA?X^ z#wnVz?c9rL1g%lPdiZb1%3~)aauU#iRnLh>W`rZ!Wa>xvDR+!y@z5U{=xbf*ztC54 z=mImd7Ltd(-aBUeU5gj<(A>J!-?ezI8&oImWyiwz?t7sBMn9pDI|x)uv$PGqvXlfA z(-+C$y}Pp#p8xwoJSV6UN$nxL_xP>DljZ07soUYapdLl&k8oaac&!#18Ed2U@l3nI zvF>%H$9il#*bBI8nP^UdYiO--^cy+PN=1IskS;c~apsAR-H;(F>FjIx=s!n^1{gqY z^MM0%!(t0#gk>hud!0%bp;Tlmef7($u$wD44T{rQu3OD#3KMGURN zk?ckxgk_IsovSX)-h9p`XB(VpE^)`YHQg6B^9rzGc&ZBtajAdb@yr6+&xtcPg`NDMLcKz!dbI6fx!wq zirC8=xH}5J;9y%dMZ@XSeaSqBXbrKpV8vo57*H)3_(Ddnj*?qnKCcIl0<>vvz)gZi z3+XipzqIYGgyTBv!WXdGk&pETfIuhCy?ToYPcpGqYbMRdR4hulW7XX27725&dr5x@ z0$+bv(!WaCxGclSe45?2{r8rL<)DxS}ze6J8VRd>r7LYTV$vuqDjHmLP`jnC4H+}GAeNVy=OwR8 zu5U~*AFMRY0M>K;o~gagRk`0*P1Gn_TRye7;sPSF*Ih}ON#Qtn=uoj_&z!u=Zp$Nw zY@U9yoG)sh_LQihE13iB*hSs5>{`UZ$bw3zLMo1lbScZ6eGS0jA%_k<;8g`(8s-7> zZ81{8S>1MK7`-Vnvx&XO!mrg)i$24%xA(aRC+5P&nU2pc=h%Dc#;ODv-rLE~2pz|3 zR#RCJK7A@Zg0{A{*{%c!ou{=8e0Y~WhirYLqLOU;XU&_;sY-&Ac$VN%i)jIt_sP+E za^ChA$jSgfz1Nyv2-va2uh%$5=W7jJ@LUZ5&5Ar-4VEbpey4MDopaB06F&Hv_I_Wx zjc`-|VR#}|lHFo%0Dnk|e@_rchRdnF>30SM8n%c=uKK&gj&FHh*UHY++dKUDVYm2-o(2r%NkZ zHe;0AB6Kzl!-Y!n;P95BOiTbNuz2*~TGyCOFZO2gi=Ec=ga|(xgpK zUsY60kw6I2+?i0LU_u@C^7KsNuxcyCC*3x?6R0>rIdsg8?ST!c4wr+3dZdzb~&KRib^ZJIAGD)S^_0_LwmjC`w!kLy2fkMQS!2#|Pf>*tKta=<4c5XWCa)SKkv1 zoN<$_^}C4Lz%K_wPe!k4#X@D?$@in5RJ-cUu!fm@pAX|DXnb%YOENC#3x(s`BH226 zwdGb@$9~H9vL_ukFz%Ucjyoe1?xD6%n_|E+i8fxcW%?8w2PJNiskk*j)v9b!mPS2#(U9h*#En`sJ5!wT^o5Oe7MNC)J&PB8{(!3-% zN7E}%PL{uRb{P~F>iAZi*6FEd)_x@x(;-1o2#I0(0}-t2di?6`r{=0IA6^-YRT5d6 zHwL9CUd4VuVbsb+{@<`b5r4I=Y}c?s0e&T_OoHZkkG+2<3?EpRuFYP`79D<(NZ~12 z=3X{kv+TgCt^TK+zw8L*0eIx#Ro&nbxlh+ga+WT-O9TCn#c7o32glzn9CW1Fw8rxC z^3{1M6;06H>d{rG4_Yn~Mu(c8O)X0~{j(S$e+Cf7VORpY%dh6;XBf%8moYG3Kpi{m z^=V#A!%52K*V&5DC^qTdw_zt-vwf-&)T$PdZ(*3J_tGV&7VFeFD$bnUsL_ z;VLS#hEdLNKA413#_mCgRDy*+E(APqy?K2wj&5Q!yRQMBM+Z7}aD2gkft4ZGPHFs^ zA;aj>VCr`0)@=vrFvqyQ%rDySnH9Y?WB-tOo9UzbBFN_&Fz%lV%$C94Yg<<<_endh zImq_m!DE9DG37YtTZpZQ@0}HRiziJTk|${aWi(j|Tx6)qg=Z9Hp_zBV>P3NUpQ(Uw z9sa;%eE_a~CY7IM&&+DMoVp`25PqT@9PFeW-cE@7h2>Sd9<72tvn5oAWJOyo3|4^% zg*_E{X!~w@C-nRv+Cn^P4{5u#hUl+HKf<}y^HbPFl@Ve_R#d6T2F*{F4+D3m)Ob($ z{-V90s-e1edH>Sj>W4>T>@Iz&iU=sJs%nKLFe|1(St{5x9p`unrL;tXQj$CJv}un< zpF1f_2PiJ|x)aEMUj6oM+`c2NWMwO8cnv}ie<=hMqdo4wF6Lw6zv{N)rvI(mI#K`N z5zLq#W7aq(XcWEr

u*ck; zzpAWU%?IX6Xr<&Q$qtp2$5ta_@yjI!w(&5<;{Ar9O?sJw`-&qk&(Uc zjZx1FH@Ku)c{8@D7&s(Ya6{~6=R9QKz!w17?kr*z%lq9UMQ$kWhHyQ&)og)jH?rNa zxHLROaM$a&jpr0XUVkWLTN&3QjvxPgw{Jjp@{HAvwr!*9`^x#pjhDHnwo=e@Yh1N^ zjb1f5daF&%0WWxbMtpMXY8Mx=&Znu|tHJ|rC>iTg=5u}ns{#TI4iba={?n9qR7}5} zJ2eKm%{&_XAY|81(%0Q;%_15GPiQU%3h7c5q+FP3>Iy+| zT=5jQo;`cU+_tdPIp2a=WUp<%j~-qLpOFdKbqcVGKMBi_yE5)#&b~m{h7%<{F!Fe6 zcdBC!(r)eGxnHPlRW&skurTV`oz8vkygv!Ufu22jjIzGjJkp69C*yJMN=J5|T^bhz z$Np|4ZISod7n~O}4a7)qP;snHLKbY~a}|s);m-qUREf?l!)ZHfNr?ntH2zGEZXxzAQ^;mw&Vqc=n$0P~*%<|uFg(Zo+ zyLy$KbAw59P2}i62ANDEpNP8?e*Cc5?D7zUrf+FKz7?!XyztWQ-7}bHH^Au!Z0VfK zB_hlWE2Er@r6YsQWf_~LvcFf%rY149Ig}fwzIk66B`#P=joY3x?U(y0(}?D{8|5z1 zw?Ct49cL9kl|~Ba(3>-rXW_7fYf~75VEVF)cCHLpguXyEi(Kw~!pzTGMUYEa@06cQ z@3q`S=2YmNZ!7ydPVrh%0Pr)Q=}2g(p~R7X*C4Cp518X^&~wLszXG<@eBw2$$M75F zB~$$sBa8d=xknrf(9oU}^-jlV1ZGB>xbXSq(DhlWCn_#CCcW8Ml9S;w_w9O)U-MMJ zga|i=1Tjp{wJa$G$TqY+a@+dL-?#wtR#&EGuX(lN;WIjUzOg5~(U<2>Pxx^8){2@C zS)*s?Em^{unwlPjX(l@!M>FhmRPsACxU4Wa|r^`Lkvn`xqV+ zbQAlXvq?$$uSeGb&`G*<>NLQKPW@N(ScLhzI|?R%y$SAjE!($~93>Xusom$}aWAap zg7^l*GtEPzZAOf8t&)>c1N>7-hT}0FgAT)uB1VS}e=X@>nd+EU`m>8aN)-TUiv6BB zGYpx8bSVp>)2g)I5di@+5+=+a(oe=9-|s7_QXd-{D!30vW6-(O8N5xt8E}z+* zJ9h@v!Zr9tzx*1bTI6jH!8=SMGSyU6d;o05dVSU8;knHa_!My#_rg`rFB*8U@92c1_m{>PD_{4<9HL>Vp?`OG|*8iw-Be}UAT!KWs{E@{w@@rRj9%aVd06@FgqrPFSU#xQNVmZ{h-E_dE;>fl|G7^J-pY-Q>P(HL;1pD#WnnrOzYNV z;u??jVr67FWbI8e`JkQqG8Q*pVS~_2GGaw>{@p#rqq)Ap$VyBjle(LTMK0yDg=%m2 zk)Na_LSjNcznkMUvT6ezf)r&2s%he+M$@?fUxZ(b1d-ZCQtWI?5wzj6ZCg16pt#2I z{PgWYpX+aBZ_>*_&Um_0vq%09)w(S+j$c3Un1%Mtg$tRzaPYg5ndO|D$b%ztCGdQ3 zJnLmX2+2O}pyolpe;5h2KlmD2SFTvL!HrN!VTvneW|3Hgn?me4U5!;En_8<58Pa@Z zZT#zufDI+l!Y_z{gSBruMdeJcvoWNb`hulLgf}haW(st<*uo}y7s1)Pc=4j*^)4$% zzAjGgh+6bENP&oiV~9F9pEjrs>-Q0mQr92o>!?5>-upEFQV++iW-+$~5wN~&isVu+ z-NTy88`nXI%@+Uwhl+_AaNEMkPR;Y3u_2oDWu2{$Hl zt!}KDSnH^LTaZXwSWjg4=L8h5wJn=^a%B1mvB(yrdCK-W8wbuVR>X!O)Eg$I%vc?Gh4{`@n2 z&=29^q^x{wQpS=oqehiNMYzF~`LIjgm5#xWZ_rWH*T!Feo*<+1E*rF|zHoW`i^v03 zCWU+lFW$ag;j%FJ@fOx$IK^xw^+^V%OI%_cTLD~#gw+}~BX+}$UF%s*TDwuD-AOBn z%{^im>2P*Nmwy~F&LkY+zLbLLx3+kOG5Z9y4d2~GgQ|zQEoyS%rn~E_MuU}o&gssA zy0_}3zI{TWLs7_};mU8@2L<}f37@dB7sRxw+|)MPp4uzE?}6i=@~BbyH9r)q8a#NY z`)X*s-`&*eRP|VaBEw-xF1PePzHE<=N{yIoKw_EkgiqU1vl#KzAl;*E3SFN_nmNCL z>6G^+UJCr9c7iI%LN~aAVhyixAV8KdX8ZW2s4Kc+jrD__*qktCj}~a{;loyyNq}?z zFiwn9{=Yg-EMM$@S(n0mTOcYsQ>$II9gCBwoE?}yd+Up=ms=+c_LicBgCr@eegV$$ zX_(o%DQ8VD;V1xxW3HJc7zU{9YObavrE5Mq6nArf_R>UWaHPvut_(JPzl}nU1%Qh2 z6LKyL|9`AvuW51hJk&ra>N?!+A%x&0Sdt|Jo3tg6`?h>K;c(U^=QgWdO1@SV zB))>=YYykp$Vw)1{rVT?)D*3aYkXJIp2y|F-g#zL*WY_L!3=?A5?dU1dWZG;1PfUJ zK5pWtuP@Uy3Xbvw#Fj_Kb~>SZhDTm@lu5L(;DH#N_gC*-YZz&w^+x`A z@(mhLQiQn~T9nUR%}=gx+(;06*n$aYrP`1G+#6ymAXIyRc-wixJEasbF~;q> z$YF$9e-`hAT{c)Iw3zwffN6q-D$R6^|6r+8^?Tkhy+}z|NUQFS>5tEn#QE7hi2)1H zo)W*pw)gHT+UT|6w7%zB60K<8wZGFAigtP=F5V^+vi zj%85m(oeU;Rq$Vr_&D#2vM)4c%h(bD zs9|yQKBhOQ)gP=_s(+fQV^a9mEWGy?9-?D>dRi&?d|TQm(e9ZYNw`_OPR;Z2-RwU# zT#h)LS-n(U=*qXmjPYWM$T6!-c+qqsFaJ^*FeqxAouLAW-P{tXECOqRN)YjPd# zKMv|aOE8C$dQwzmx$HxIy|Sc2s>AO#_H$_Thea!)+et4X^?lYAvzUI8uV22*De6CT z=x$EReAuSpJ)%zC{2TVmnU*}s%R4|jSix1-O;IreI4kICL!Gx?gtepNne&iXug~z; zO9Pd1fh`ZotRILkS?(cWVfRs%t!BgKSd^#=-3YbJ4IbCw?2%wjWo-H5Ut_!p+PANv zSZ}AG=FRg*E=XUH_WKYG!;EOJXTQ+^xDr-2)ZeX4ZjvP z5o2W_w9UD>(Vp#GwZk(zu4IX!fiFTb4|b$jqq8wSqxI8wy1wv6lB(kpH!Hkop=z^u z@jmkds+M>DXwzjt(_wJscy^Uz^EWk(-()_2zT^9Aiv(Sap~lYEcAyj8^CA?wQfE<% zl6Ex^`NF9oN6;fng?QHKWFKLKkKU$oqF2yXQa(1psT@&oE&y$=Jiu2v*F<;M33%^& zGcn-CygYNwKLW@*U;pge5a@HZ4+aIbwIC7xJztGe?$_@R2FXiR)gz|~Vzl7PunkZx zjKflr-3be1hog5V+XVTjgf=%@SMwlSAk=0Bb7{@JEia7MoI*n{j0h=gPVbkcjd6p> zFYs6*WXo2)09z8qN@4S>SGeo~Pp;9A$yrRFB)rQci^M#PcZ=fa)4ugjblcMoNFjiY zoAXT-U#F=`UOtG@pd{TWdjq4$pV`DhtH1S_C2bAvDg?>>DoZ-8ln2pG_{iPt|MwoR zeAzs1KlwA6YG{M44rxCLY26?P!3!|9^CPtpPYw*OH2F$b@89v(M&njC&exdpsq zZKbcTpUMz*4!O4wjMDJlhHt+#$KA*N^paj{Gfz>v2%m7@bvh;YC7YJ>h7(%szjX<3 zTq+TOa~H{qjW=8=&u0Dx+oKHSgX}f`0%G4;BsZHjPq73$0+ZNS#1q`w7uMM8Xd0}# zKRvsRfmq19BZUz$17qt_o9ShJlw7K5hi^qQP(k;K;JFyAZJukjZpy$hfk8o=83uVq zWbo6S^)=3Ej46vOF+LDR(zeGaIhA_K^kP0@2GlzYdypuEhLz-Gh0aeYa1)UhgWL&$ z$Eh5LPF=c~?V52iOOTF;=T_v(bD=wLtEkzE>u55GuCvB^Tb1f zm)dS7c9nX;COK};9_^!Ph@8N!$&jf%dUOX#<-@RaDmFH8ZMC$F1f%)?znosp-zzHn&VbXKP`iVFS~b9&IF);DM`u3rg7di z{jL#i-AZCt=^gWKP3oJVe60k6T@gEXGxocT+w?`p0+FUhTR9QwnE&1lr*kfCaC$KA z;mJ&Uq3U6PE5nkfnMA}^Wc+;d# zFuMQFUedkXe`Fm34w%L*xWPFV$JISIYp8jiOs_L&oz$Qbx~X5$ylKRI&^rirEvKDM zmAs3CeveIj58jySr{I$A(mL~{)~9j0nV)Nh`)V@aBZoi8p{!s^9tMf8Q2?_VQE;7Z zfw%_(2kVtj652SWjo)2td)y}2jAm}EYgOQsqJt(gXHJxS{PfAJ5TBD)6W5*cRw+tY zK2>6P21^_h!+o``+Lx1))z#FVEb&yShQcq&SuAXH!F+@3Poh3#p>c>0I^$<~S($jW zXbEyEG~2k$r6MJr#9UD)Ca27K)Q2^5xTdY4{z+DJ_O?v%98LJ;c5X{)iCFBjwpax7 zFXQBX%-+~I_Z~K^J-harh@dnKtDSgmBGC%I&|A|KNpDEqNv%Z8k0lDi2g>(A#m^4EXy z#YbhxCnynuzHWYf!#E++;{lL!D!eF66NEII7cg?o_7T(M_sG3syzlY>`V9rCDBrr3 za;O5o@}I5^fP%9!jJ0w)`OOXVxmX-GkG1_}?gzS&iUy|U`+=m&`<<|<$hN6G#~Z)IzxtE{-?7Z~xMe+QT1 zKW#=^Df<`){-+!5U%a&cZU5P9m4f_9t(4y$<})v+;tY47t56c6Z#XTHv9!&i4|uo6 zy=;7c8H4TLjF@^cUY=j;A+}}!hHrHy>lF97^x7xsFbK%KxaGC%w-fcqWTQxv7wtEG-lEdiC6BMXY`i8? zE{e+D`+{f%)OMxE9yxB??cZ{-7}|*>pLJ;W1Tyvrr0>E@u|IM5)(^w+$}%oTgtgx6 zLBX@aEMoN*Ejp^wH*)}ADSuA<=eWOA$N&JqHKHxXBhg|jYp5BFEfqFVU6P2 zSFhjOr94ha0q{N3)chQOyF}i!Pi&$5wm%P8ak>EED(anCx^Afgq@>U zPwGaR9HR|X7`oW!j`qg(xsJm+D$D^H`+MIQuDHag6Q>}U#s2n z;vJ>kxFH3HraNoA?qhnmD4~2y<;mX#AfT9VzpIVYKEueHHUZ=Mm$dA_-HkicO@_47 z<1z;x33N1fb-g%t^I#wQRi`&77frnLPeqM(kyp|MAC-f`V=c zFw^+PghhtluBokDocH)-`=DX4@QQi`?@~K%3jqEO`H360zA%`gajEX1eMr^nX5CFBo5rhVq|KP0_>H?ry6uV)nZ${nw!V>QB6 zek|q&?ZT(eJ=w5uT}7~i6GheJ(Zp7>mae)VCj(IftpoD6KEgaZ@Ro39hTm|bs7N@s zOhQ#hl)2a|L(m>nWVd8VZxkOOgu+NE+d&IeCzj*?(1&fBeliV&MwCynn}#nTw%{nz zwo`K>+(AWzaoi#V=H>|w!B10Y8Yzrc;<$r1d5NkG<(8=C~gqVuzILemTE8u3;>^|6uQ-qpV> z+kj8wXydBagXao{5v~tz>6Lsx?=;qW?e$p_0aM50+VcUM0+%qynSXI^cg+eMdj_Fh z^Or4uc3DemC34^FYS*!=Ubb>BPC9mLX7Yrfj~_ntl|TeK=+~D_5tJb1a2Iq%WJ@Vh zwqRC~6>j7ED^Jc^^7d>0ORqy)nO>+gb25#djl@Nl4e`^&|J>Ge;5&Hmc4}-&!+!Nf z%_Djdn}}S1>%3DK^-1cu0|wrgtvJ6`?)V@B{l?^fO*9+i1&}5!u}E}W7W~sk&Nxiv z#JBnXqV*Vf9|2FzvqtVXDG8(0S;LJyfX4DB9lU<}Yo zgs>!$EFx=0NPI+3Gq`7h-0^`Nk>;$Qe%=3K5iTx!A#{6mcw8Haps$K7F7^w9k63Vf z&w>$53r%moi0jZDKPh!We1sW*#GAo0m2$ut$Ka=f=pAURB@#0KcC!*2qz?55XN_Kf zvy;%*g7kL4cO0*eh28FZlx}K?wd>}Vz1&MzgexlF8aMfN#>Vk&!j73l8|5DAsw3%6rmnkbUZAG~b@L71BxHp-=sFcX%fqJt7j zyi>CWG3GRH+0q6CADf_CVyOH0$Fr~00RC~dUE(PRj73rX^XrA+M3|!B`$pH)5+m3f z(7YGb)Ov~?Gq$7t_^t&oSefm1;t_Y-tqKapjFyoo$U35musTkK9tmrS))(f?4Tv}* zVS$o(jNJ$?9|`^Z*l%K0O_Lx# z%92wky?U*GtuB_@*k^0hTp9na+wxvvlZ@Z}2;H#s)`B$$miFxG*1XOA846cF6)yLL zIJ0k~66T_;`c&?b$F>Jz?LyD`ttN|)lW;M_q`{^H=3lzV@k=FF6zm;Wf*$ zsXPeApPWO~i$xb8dQD5`Yg>VVuaaYv&?{gx$h2_Jd+zzcnC-~kT7?WJg$!rOrAPMx zi`r2kuYP-bMX#0|Qi+5~YhNPdF&g9-Y~#D6+mG7D_%O2&NL)7c^C1PE>^GL*tKf zr6%v`Crt~*xbl&4$?BX%88D1H7LNWy-@g(uzbxMq;u`t!X-ENIuVMi$x%6jUY)t6$ z;ZY)qRXfIJ)lDsEU>^RZ?KwDE!+Tb zBZOfn%w~N<=_`@EyZWJ>NKHhZD!J6Ulke88IfHXA3;8iS<9cX1x$DB%_GU+~JkE5V zdGh#ah#wLOg(3Pwit4evT9+^HZLfYV+m&(Vy;k)7^(EQw{Ol*MZG3d>)L`>bz9+J( ztKPhMC6mj)$zD#+*I@m`m6%cE-`z8zAt-u(U@%n>;W z0HpnzCXOhMfu;P-FZnhBnaJ7kEb8T^y&$1sq+|ZkecRWrTv^IO_q4x%&K%jO}bePuiJ3v%>)6Gj7{gU(G^jg)bXMcJ=vT;mb#lu`D zDk|M=m+2G|icWsqGR-RE=U*cMTM*Ay@Dv#YK}>S1xu7inlpYb^uW9&Q9%iYoa<8;> z5rj1&E_9WA4^TD*6#=I1dyr-~?Zc;0;QIwV=J!3~KJyl-6IYt3M|I5L5ANO-l!Ax2 z$DW0WN2#)dPoLmKQMdzh7ZzAY31n=6Y3;I!t$hrSWiv>rXVtN7L!M7H{t;?{7t*7R z-^-Pt${pRcYnuPYPT7s)OxJY}pPmkq6ArB>-c;xGn`_Q**Xn7GrB6|q))8!OuYgWN z7p!oKP`pXm$appr$o zQDU=FKIq!3O~4KvBud;~L6?5Mf6f{yp#em-)@w{`$`P~L`$0Y@@@hweuS$yt$|!DO zNu!amdZ$jELcY(o=qlSVrfu@6KQnE3L!XBUdE02)slkMk);ZkQ^H6H5lDUTt`|w&dck{Z2*(vSwyWx5ymy z4MFDwgwc;M=%W4I3C-6b!Hu0f#cK8V_jmjLCc&A9vLI_roA*@d1&;2wXP z$QU7AO8ahmQ7{3d1o7q6vpU-cjC;@P)oFvaiJNoDnlJP`Qzf1x8W_D@7@s%z4Mc@S zXkQAT_WdLfO649GqMQVPKi1EG&r2vOGTyLFx}+DQ=8#tV`rbh-g3hu>?9w=QFPnMA z#|bay&;D_|ma9Ae_>?vzy1!@A)4M;!>#@S(x`u|>#3owZ6tY{si!Q-KDMD-GQlE+k z3rbX!3r=0`uM%r^pSrk`$HlDR9V<6cjM^z`ZpVsoal)-dD}hd-GCfUC-$ts|>+I-` z>3-d8T)+9Nu;vzIfR2)Fvfb~n1`N8i;sc(Q124_zT}O?rXyHx87M^u8g1(b^AkNvK z`%u-5p3BGV!XL>GpvW2qOtM4HX@~pxi>wx-+3a42ASZW#UipY~W81W8(%{ zx_K&eGeOnjqqn6`t`>{+hF*VO`1H>2>>+Aq&Gj~0{nh8LwgQ52dll!b;j0qbHm&(# zt!v@|%eNl%R_|(K;ph&HmkO^RR=qW@%<9|OjU&shKvVo>~ z6Du(1vnhjPEYkH`iF;ONmzW+#jOar7Ylxe)|$k%`5 z%ydQMnG`XeVM`dSU+BDi7(Ez$p%5?ep|8C-Ou0r^{;AhLa%OHgj;a5jVHP?1wpKf`%kaafJ3E@*#1;10z=K$Vhi|b`Ie37gQRJ(I*f6 z2VW-2V{U2Zvg!Idm)m2RUQP{6u-G^#`1FnO^9YbQj^xMe-KCn*_NRUnN3(7biYBi5 z-Lu?s|IbwX*hGK5i0Fl-I_8^HPV|3E`=&77a}-{9-N)?HTOEI>8GsKD7hKxsE;r+= zLy)s<h*R?LP%!W%bj3_+Lz!Hv!8}Yinyv zu15%UKH$>}CX9^tVAMkvT<*k=5L+BEM6i)Mcr7>)EtRJ8^Byb<^k>Y7UtP?N$+VS* zmG9A8RxwzXbW(onHkZLlqEE!vWtK%q-j|23DrG5w=0AeBZws^GIp2PPMc_Um0 zQmL;;t06rWib*lTu(Rug{5g8{_ZBeDN4badYQ6v}&k+<{I|(`AwHGTsWsq zI1&;PT^_02gO@^OIu8h`;ykC0Bl}7e!AJ{2&F=xxLQ9m>r0De04f zoUhjV-mAF~ypXMcyT2FwCtnH1&EhjN{LW;C+&056kM3PC zB}^-43pG|3(V+-IWAy!Mx#N1A`Jh0@eUUQJtR$MJqF|qOGOHdc$W@ne-=}kP+C2C_ zF=rw|NAN5dO`mR7^G#vstKSO7PVw`T7uT!DSzg*LIo(f#tFxbSykhyLT=03F2)RK{I< zlLY?j6T$vDnO6&AWJRXBjP*`RS@HSheUP?nWv$c)!XZly($hCXcP(h(%=^(#mm^`n z$+4mXV!P2=l1jz@XMJOgtVequR6ZfxloD>MI}_9=Azxr_#F~V!pNdvdLQx90bpBDl zHJ87OZdkEbz&I3!B<> z?{g$DbUSv+pTB%jR#lZ{T4L6w9+>X$KK_S-p!wsC$FwRrI=_{H(B2px307J>3Q^ez zr@|%Kk6CJnWO+KemLh{ob!S1{y((I$5m$Bt&S6L-2tN^@D4A!>&)s~z#`lCafK+5` z&FHgH|B6O)>}Iig_mri$UfAaRka3y%_LZ0JthHxX{%>c}_^zr_Iry6mKA>N|arl4L zLZ12HV!rE`%DM`7{qskUvXCbH3iUkLKT^tZODq9Y++&Hzp#y3zrR@2z>ZE0Nj?(6Vh({o&EXRi4M{3vBtXps%~iA4 zzCE_B7fzkh&%GKK#C)=(aYO#risLQJm~R)ssOrwVmf&EdGrPZy{s=>{+%XRRy_j6~ zAIs0O!+&e})+o3=eR9rXy;;lEBGPQ`r@lTaDlRhw+=UbnduDY&5{taK(X(k&LPoFd zPc!d>ztt7F3f2909CiRJ_Cah-M<;8RkXPzI@_8zW*2{}$!0Z)&6)1Anx(2YBj_4ppHEK`3)YQd2$;#EB>3^B z$Zz!x4Y%1_hu!MBZ%P_J>(+t;7=SE2;+5<0gVMZfd}ni$LC4P7B=~^e0rT24Y=}85 zB%ELd4I#IFOv#wBy@kuq@9UTlzsCieCUtByIU_se(WbM1yqAfV5l9xGEU>qT8x!6< zG-d+K8~?pd_d*dnjTb!fS}CCOmgOnKNmhfX!(kK{KdMziCiKb7#ekST&j*lUKOf?#jaqU72d2ss(myxo=VYB@DoOwL}WjVic$SjFjE+rWwmAi71Jdn_BKx`p8q8YM=NGdihOf!g<}bF8m52~6r^c} zhNJi#4r5b)$7#@Gcc-@v3^IB7+o=6ese(0HQ3?={oL|*;&NS<9f3;!G!Bf_v)Wew6 zAc#-wZ*AE5vj1qqu8zAf(tzC&ITYt|43CBtU5dS9(eZ!UjZHcz=+%C;=-hzorM`q#=^05V;cSD+(A;x0z)EX)s zPTtgKc<%o?SBNQDOMmar0!7bFr14E&t%K^g6{iF1; zNJOzbB40T8bQJiQL?ZT&^R6=+u|o0Di%_o-RAV|W9cJUOC1+YNjW%0(<#OC63$Jf; z*ZyvtMvmU}hH1k;my(@){uy1S)GyFLt6kbB9(U|W1`He+?bbcm&^B{RKOF%xv-8kQNiT!~7D+#jr**nodSV$xEODo$MhPDt@`| z{!w3NIPmSir>-lS@ek@c-~Ucsm$UGfqAse?!J+H%L96pdu4~L603ryzb zSOP~fk@EXRatD3|2d?bU**^s4{1omM;Rwr93|5<=n)O*hUqwE7a205803Hj=cuDi; zL5iONme-deBaSj?n!s!?!1|NzY9s8s z1Ex-aS|HY3(~E{itj~Wk$tWPJ(70!4|L%SlBb62yo;p89&KA-BS(f%N7A$o;s9*Md zw)dW^B{Qt~Rd;o0H+86qFh8G?rF^eCbn*Gy@+5+NETp049bNeZYK4y;$D z)uG_nWE~#vbVpu3OZD9Tsuskfv+KJ9*;yh1+fK#0Lk&H7LiRfl2L@d!3A>cujfIq< zob$3#m5XF{SYKABp%vaS^Ug0)aJuz1P{G$)AvRTBK25D{L}zoI#f7nvFC4RREtUvX zF!SmG$AHXUuZtUp3{iIL3yY8>00*-aC~0TrC(DblBmT}x`ll|n!dQZBaHsw8Z1Vw3 zZ*hTZJLzTLdHejDaN}po@;sGlEYU2sx(e(v*5jjo#aHd~aU*7}iMyghq@?J4=nllb zPxMSY8rdm5r&Ol=nfY?`iW(d(TLz@pewTHtE>AWJJJ!>tfbghb2;GC{3aD3O#E2+@ zIT8CEqkFl$s$%C;Z8qq-$XKI_HUBWaPq?W5fKF=)l5BARd#GpinZZnW*1avc9>2<~ z=e$dO0i$xv4jfZ0x2A%Lu;p?4pdp>e8g)fazt8c>3 zYlFXe+Q=A8OCU6_j6t7`kdwtHMvap&>7QV%Zu=9_Rk{PUw1Sae6gnCuBv#$M z{HC7xu&sLwm+eZta|!nZ>E0v1*kEub(_ET^Q@bzUwV$%vfz`$4WQ?`}F+m$11O@`VTCW4f{rYW76! zoF!fmlo9eX0$5Vv41pv5;4@-<$+z4BR55Zy@O|PW`{L-u@KX2TLmFRsavm%L*lGiY zSSGd=E}6vjZD)#-uq_{?niZ6qIuS8$OP=v`5ToAmJ5tN*)qu0Oot259WRyw;zRxMU zoFUf%A+V`ng2UsU2=-Rt`)S$z@$7+>$Bhdg)4pdxV^n46c7clzF+VF|VdVbx<3M^- zYdgCZtb>y8HPRlcgS-jzeSWs*cqN*xhh=;9RYqZ_^PJ5O$YvRvBn6g;!kJm@EGN3S zoSQ#?|Ni}?bbsanl#+-{gozU;E z3kM@XBS)e!*zZDYrFlPxD=loYTMrsh0NZL{&li_fANBksL& z7yAT)NoUTP(^-V8#jT5ubnA@1cX0g|&$#6GN1DF>Ir6DihlF)Xp?BglQby){oSG+Y+7@auztgWKG@zcJ|t_g={nc(TH! zMs`Z=h|UTM`eSJ)O!QK7PDyVsHD^$woZ=$xYYU9Z9@t*}i|RjhBSZ2vA*a!q#hX*#2eyTetqv z^`swSm;FN*?Bx3tj6u_7&!R*aN}roN;!@tr9q{azJbCL?bvI?OcAoKl_p!Y&Wg;-{ ze()Q11t{Z1<9pyhSKj3!JG&^?F`gUJ(zoy&WI&1ZWhEiR6b!H&b@*xBwzmRnM#EH@ zIPBYX4d#q3xDcFrvFlv%V_||5chYe}p{3H8^!JsYx!LY;>_s9sKp5<$m3=Fh^1sH# zPNUOLFP7OMCBaN;QlC8+ljlRa>MrpP5AWHi_xRquSxJ7$$?L>hd>yb)(JhKE2^T|a zXnP^Um+pSLY(S^jqS-KL5i)OKU+v;0#r+SZu(RaidZp}h?@qUdam2JJ{5@#Y(pXm_ zks6d&&T10vgzk_oeL?+nj>&=S-G-(TX)=yeUQkd#8)yH?V%odWw%;J5urElNvrkEw9tES1zHz(e_ys)~Wo%7G94H2U`%KghvXWh?KYCw`6ykH2=utp@+zqFa?8M2u2wT#P>5Gfh&aSP6c`Q%7VuNAjG+ zT|XB4Z4vQBdU|^MLPJkK_1HN;JMULsT9I>~KIGU*r{2bqW#I~o)g%aT3B4>Yk5D6X zT97P{YVIe{fUjSfah_VYcfD%={=TRR>^V(_jf8^v)~2;;-~J>6uqjvqSz&P{x|zvy z6P28zXLMMzJNSrAw<%uwJfRr_eqZ^~L4i1+3zLP~RM?Jfu%Fy&7B}BOvOT>#lVQ4w zE?}-jI;)CS5=<;+I1OqNl@gRi6LAT`xL((I;}>1Z^^!-f;RJ!o@6lH|EoP@Cq`B>ip-Yh2B{Rgr5o0Et3mdDgz;tFPgX{I-#%YmlmHB=2RV zEf(?}h~*)r%GLD*|3ZYf!_9Pw7_7N_#*i)|4m-I)B;1ii6S%7{U5yC74y9kia((2k z)!YQdF3twHzwuw~nb^BGCpeVZx^dI#*Tt7EDyin2Y&#}>=VKR}o$@A@kI(h_HGsqi zW{V}{aoY3vhZTj3GWHD=z~^+!wO~CWeC+L7zEl=Lzk-qZv!a9r3qH|8iG-Hec^CBF zh9&kv!TgasckQetZ_*#Rd`oETalz+=jpm*}VIzDuQ28T!hs5alS%Sz%qoz6{-F3+` z-lBBxwNv`LBM!C*422?sg4!n(L3RZpPc5_F1#LD86rHNI#XH5j%V)XV)FN z*WLN*q{Ziwj4MLlS7r7M9lLJTl@_}kYcF#UBr_>MG?*P`=`Jjw2dWkhL|;=?b;VDM z{U#mJYE1f@ygjQQ$OrAtoUPNx;j>*5O0E$H)+Q7dS{Ul<+vf%E8B_~nCrdbYKgHEV zzqec<*!DH%RBUzP>>`d0zq}*d=HbjwU+#Rn-nE-*T6z6SBrHa-JFwNzE&g>9DhWKr+fsT%+ik6W!DJHBYp9l1XBs>3s|lJtTW6)6^SPxqjzHUP;x*Fm z_Qf5wp|85)ZN{08i&%;^mk5p_t=pM`-I)W#Z)yodrvt`^*`T*T19>ZQvM{g-LAj>z5bx!GJdx&XdXk4L?Sq?obKMihFU#(W|{taIZtRt z1ZPcfjOQ1GIj8L4b@U!Rdft{j>f^fc6=bD>_)Fn@a0?+v9hN^X70_rmv3aL7pS)2O za@en*if{F#70<8k01+)ktat|~EBkeW*wfRg5FVd9(bZ^1x_FmzEIDoiv5G7xSj(Fq zJO8XyLIuHWf}QG|W*s!f^%TGKA(>9%CE*zC{$gua;T9(n6=w5abzN=5h!rm3O+QMS{*aJw6ggODi9$Q^!)2e5|H&*O z?D1(@g=7tV^oWP+s5HWT9SH+|coA)m+lI6lyLii7b)!o&F&1WjxR`@1K5VlP|H9IM&C0EI$^fRs^N8`{4z}qM zZ{kYexT}FFqSomGg;-5Zt?FVDfA-|cT4zM`1Fnq;u+HAZPn@+SG*l5!uNMIHqT&EP z*1s+o&Ph4r_wD*?t$FMCRjdqO)&QLAfG|SZYypuTGkt`)JwYVoT5nx&*_mX&TZ|?F z486IY>8^wL`t)|NdV2ZtWhqRc;u%Piv51BX->1>p);98{Hsb$gm=ZFVtZuR}H^2L1 zg{|!$T%eq#8-<06iHV8WFIAUab1J~BU>B4NVS5W1HrsWS(MV2LR(a=6ol3a~KGOxc zR6gn{%t`oFVxUg4CD!2uHhz@-R$FyiHJ9dplbga09=ySM1~r;CiVfV;(!}ly0NUjOp`D0q;3E6TS-$HcVy{@FLm|xn|Qi8#^S3o zx3F-~Hj15VVj|6`DEit7KR$M(C~EbT&+ffZ@RGW7`241S;V9my{7`?h&9Iee`Na7NWFU=tRL?*; zwYJxwH*ZDP4LBeYgDH)9uA}_g*~sk390=3;?xROo)vAltCQN^8C>%VyLgSuqzFcwQ zWOsb-0}mY7mYtnFz5CpN>YwI&dq$Wp>8pf%wG@F?8m1JYtYGvljyL4nCo6r%wGT*7 z6I~+ba4}mUKJ!fL*RA=5cs<>s%MT0w@Wr#veJsGAh(V?pZz62HMW5HnLd}6QEZ+?e z5${p2<+;HsdM6dScON|DfMFz`h{PNG>uk|gEzBp!i&Kr7M5|}(h=}}!su89ZSFAUs zms`WmV`o%*e7iz73NGK4a2VFHun3Jxvv!r6#;3Mypt8VQ=*9bUG30ISpzbeZ>zL;W zkukSe#1@_sS3}Asc4m2J=JRX`)I$hfWGCOg%d7W<@ckJJw&Ypa-J)Xu_P0BIYR@?D zNhtd3ZYrvBJ$hhK+1?X-Dz3{+b?$cU+jsAtDrnUfoI}XiASP&b>YO#3K9PH78@0-K z+s!IDYDM@{XidpJ*)em6i3A~GG|(bqacJo9rR_d@jwkpazIvuY&zth{5vHWkCpFd9 z)}~P;gvzr;-^HEOwX|*vjwlL^W!jzewsBgjI`L`TJzUYhk0%JJqlb&CV7rw<0fnD= zEK1kfwYm6gpue}TsjWR0A0Hr8!1P{R#k0z`cD0(wwIEKK_<>W!58TIHJ#kR*V)lke zb8{&}Z8)9kAVr>-GKja_!BJ1Oa|H!CeC_i|gu+DWR_~#pTHD*-^;di7Iu1n`_876o z_pwm!40NGQMO5z8ddz4Iy}WZb=FEX}qb#N>!0KZl0@7Fy9ZnU4KS=~;9C z{-=M+?^p@ljI1pOKAc^m=P)`cL_N$jE|B2(R_)dI2VUMzL%|fG*|UYDl*_?+#MWkM zuKlT+h-G}ViqusX%S7+W&(A;g!=M3@O>kcFnm3BT1*daIDMYCP)7_*I-aE`~O}CLqg;v z7S}wqDqg;PLfMv)`2Rn&y?I>C``Z7%%9tG~Aw#GP$rx#GnUW9_`6}3f$h-{=N zWhi7vG)qyMBSRF0H18&vLK4~}GX0+K*k}5ka}VFg_j^Ci{l{^twbp07hwFMx7eciq zc`!q}^i(LcR8=Vu0Lr9QRbwZro~G|?rU$rn@1CE;6b*ua1?g?ZYy2bJWnp1)yk3|h zZr!};nL#3%K!bo z+RZwFej=ejS{E>Xj@4YFjaLI-rn#S=U>NRjKr7xW*Hq1v@uf36lrbcz{f zn|2`=nHo@+A$Jmyg$%;`ETFh__0G$qgD`0P#Qi6pu_w@8HzWZ<4nbBwGTJ@d%48VL zJM$R3S~liPkd?a_qn=1?j@k?(%({!}YNZ=&e$?c7oJpLri-%&n0Ib^)U#Ant0!@~xxNvfc+-?*j;DdMu_%ca`2YbSA!i5VtV6hT>zb-96$$`36> zODsj^jbPR_&gG6gX?6q{fIEq%>aWNV_-tKePAY1>n9ag*iarA_N#cL5$NEVGx z$E2K_%PFoiol;@NMbsyy=rK;fg!Yv7{3}NgC+{Oirorbe+S z!of?{X7dj(^e~UyD=eG>%Xgua^spGpcem#0lC@x6XCzi8y+v@>d%ueT#Zd(b^q7VJgR%9w(O?SziJ>;aj~G!$|C@lEZhWyak$;)+IIVX%3)~R504z zb=C-R1r$Uf-JQtl*c)#4bs1wO4D@!Xd;YGA@fXBP*B>`L=fIk~B*^>KiUkH1yFAyS z78W#!c^O8u2i!PFZ>{*I7jhuo-}Ja622za}4$X;@em`HAJDHb_4@(RYp1WXyn!0*> zz`M#iVEgsow5{#!J4(*S#XZdN_VJOD;2bwUMxitD)63Cp3mn%ShrRlB$$R5`&E>A$ zP`W;^tGlqRe_P3#__|S)!}=yBotBa)8@rYYM-(V=+rMoi>PLXhQ)oHxixkJ&|50AP z-l`nUQq-NgTL(=ZKMC<(yRHOzMp0xm^_$q$i&A1^;y3RdpMfMM`Vy1^XF4-fkc9 z9g00oS0J{I_L{)O=`O?8uU{{0(O2)^?;}Pgz;)|r4ZRFn4ocR*d9zV#t)yd|VSfeD zF;Loq2LicY0n1-velF2%j*AgD1S?&HL4E!Z$1c(GzO$&R4a08X1@a_ z@mAN~jmOtP?|4O|jxdnccu%GcXPpIiSSxbSA2}HKJ$&11xTz4y)A&iAuN!qHCT1$S zy06c+f1MsH3Q4o5xes+38yiJH-nCLLFx2m-*7yGF1>Bn7?SLbIBF$7Vlgkc#sj~?F zQP6@b3Kc1>=_F1E)ZYsCaBvL~>NNjOjh4u;M3-#+$#`&ia#HUu;j5Q_F_68YU>3nV z4Mlek+vDSwaOR895w2CM{L@p{pJVu}g22rH z&-hJO?u6ccX9UX}Px=IT0->44j-%qA?E^rr$-zc1#dK7(0iW3wLb16;B$D%hL|hZJ zt(2B|6uEmMKk&}9IezvLwKwHn1i!Mn_B;a)E0{Bp-si0N#ylHUoKMppllv}9te&Z% z8*U$wKO-d(oixIKcm7KVzrl0sPOAS7R0!9uUk@!y!_ASh`RzdQ=}4wXgc@p624{Rs8PRBlZk;T{5{cgOxaX)%zktg z$jY9PR$1OA_5~}H?2C`R{zgo0YiNneuHy^eo*y_4?Cv)pC)jYs_Zvn{XeG{Nn>Gv= zVfFlVE{j4QOplFCm83Uw=3enh1#GcALFnlIU;rt)0pLC>8a^??oH{j%y1ruz8W{e1*nvGR84x(&#-b2JO zYSfnW*AC7}OD)8BYesC(v7Zw;GHvI8{vC7g-pxWyT0Flmx`TuvKhf4KT(Ttk(*5x4 z;0sBGv%#C;ojQq7tyISkRBc;^T4tDsr6~qAu}fAEZ7Iwq*H<`RaBeL<`IB_1CYzd* z;qj_Lt6Vz;_-S#*{Ke9bQQn*NJV(=SW*EZ^rV>f9r^`0OPm~GkNLx$EG9lci9B%)P(Eg`7`0B8e;8Gk9ysh3sQVCt}SXVOaRU?h`+WQxKaK>&TD(WF$ z3F`B~_A?nI)kRiT7O`Yh!4yW5C3<>!T_va@^Tz#z9#f&m5LWU_LdU;!Ys1va47XnT zyFknyqO%neQkK3Z*`2)oD+Ek!DbX*}^t+XtI|Va2>emOLl;k37XOEaOckV8_$!^;h zAAkSg?;?T$u|}!~1lD+zKtNVbJJoA=PtGs9D$Q5*n1-=^r%oQnj`a{R68IIh>o@R+ z1?(V(|8DL}o}h=jySw&?bM;W2nau}WRaeYi4=`@lc>X(y-Jg3~U!SsIE{RwA`jVT) z#q%6CL#J~!Fzg!u9@*0%nnhJr&K)(Tee>7`aUG$lqYTbUAALK8HpRwV@~vP z%@DY^u3z6pQJdPRsNAY-B2efYj0{1)IQ}L9_&+!E(`0?Y6G`8Dl!p;;$yp(#=_g@| z?2rX`l&;?x;XiXQagT%twU@*!y%fl&d5*NPwYzu>F%dQ=t=WQ;CFR*%w})-+HcsfVKNdic@=ICb8$Y8!qcFk z-EG{zHZ%$PMSe=aPX?BjCp|q0KQWT1tEuf=l97}Yz)p^0c7o^EuOlyS|27dyyO30` zdH3@!ZD~?)U*&Zh*<8gpQjNp#4sxWJ8&AgbFLMLd}>c&%13i9 z;2Bd!5raibI?g%VN*DY!wMN{w=g*&C6?C6+oebSJ6vFfNFVeQm$LRGW=i}$g)h*Qb z3y)T}|Iz|*H$a2?w9w#B0)E}v<%)2|yRW%s=e5>t;z_w7L!##ol6Bg!Va@xHPE>>) ze$}9UhzV%eG@fk~3>a%%5r6*tgQT+g^kL1-RjXYuP@G*YDmvV#)`)!1S(xHDx4K{n z5|AK{G`xn9P9J%`A|-&s(x>5%1lJ8Mrjy_;X%4mlgXOkrsrw01-y(2e0KesyP!CCaJC5Ff z=+z{dRK9yM>GPYNGc|K#y|>tUnFia`$FQ$^4j#!ZA3#trr+f@M(MeCug%Q<@Y!+avL852J$rf z5%Qy|8lRXbR9vY^>v!nt(w5*L(`7uL%8(&Lq;)ZXghSK#!C*?BkSPSR93f@{aN>B~ zSfQ#a1URMN%oZ$|4u!DN!NCMR)MmqNp$ud22BO~6NJ(c~TMzgG(jml+5@HYbF>W(u z;%RJ-@UfGGuFIhRqvo3{-6s2ti$EDddV&u!EB`*NkY`KlqWdvFM!zW)46pCM|FRBF z-ZA_3c#1Le-^ux>BIGgU_+(E{6opTk3l!@w7%{s|D)_^PO{weS78*%zmX)QJ=^zhy z!jE!c*57nUIuqUO=jnOy&>)ZcdY2WQD`JDkgA9~ZuKgmXE zgF+2&*e^kowx4i$`Nw1+ec&Pk^p@|SV`11&!Db#XRS%`iF{2)(J(^9H-bSm*3_b%& z%O?hAhU6y8mv+_=sNa6?C*T(hv(s5^TI5ab_3;@%zp)r+%z#0I=D4{{0N5jQEFczL>-jc@9p`ot;Xx}Mm0?C)HA>`UlE z#XfyZB$0f}37g-p60@V5n$eE7cfZzaL{Zd`E(aG59Y|rX!^aTH$?<(=%Q-|k>=Eb| zXYqtIH_NU+q@>BeEEQR~l;v^Uy(U$6NiV}x1OZbQdNb|o zmr3MIV**aQF>qPV|K^}sTMpi z2Mlx)dmPN~b5?G~RN&LvTUrfYljGthll#kbgOK4B14DWM@1s}M7GvPkU5pEtkF;=a zDRKj8WDE@^2wb_G=C$^=^6Vhx=(Oq1rr}|yg3^9M`XYSH9PZS&wJSj}lwqp9$*_Q( z!t9rrHr_Y872PtN)Oli0cz`aG4|kmFGp{QM5>H_dGesiqln=SUH4KOmd!wEoSwZ6I zCLs9KijU3*kV;7&@OgUf-&MQzWq8}J&Jo9ZQnZ&lPd}on-k$-UQ!g-s}j@DfR+0qCtjHB5LBt9r7(6-=#xJtO7-T5-^o}45nnd!U32*_5tRV$$b zWfg>mg(dcEBAbl#x_eK*6lw8qWc;fB{PO~o6G2f!rmd?tDIZ-P$3CVETu*GtnKK%J zI?fuDap!J0_w?Nq^Kvz<$*>Z>mC1Ui{EoL(K^70ZeG&mCcQIMb2B_6s zj3DEwW)}~mzQfUokUBR82H<9Sc_92nErl}?cQ<`nZ~LE=k-uJ8*z5HO`Pn}-nPFcB zyeQAl=*2Oo#)XBD$l%DY$7^+lszgOz+U^(sarebbmj-KU#&uC$a~B2V@op&cg#7X6 zSqDzbrJzvFhnV$>e3)6n&?1UgFHakIz1Hs3YbiCXLw@%F?~>0ccZvFZ&ZbQ%m0F5E zgUgeWvdRzss059)rz^_OreQ4@q1aLhF4bP3An!P5{_T^KENeCW>UR#Uo!MVOp~G%C z=Axk`7z04zEi8g^KAnvcTAVOzQUiOIX%~)Jc*vrA1MyPycSI`A8{bs9!6KfDeB(7} zexMK08B+o6+v&nR-&v&0;)C;mnFyx%JYM{c!(HMIYOx`=3CfNxr*r$(>l=+ujPJn} zc0M8DWk6gGp%l_rsxQ>#y!p8O+ajJpM@&5(+MN$#EJx*^EZ|C4n8;QV8l&{$Usl#Z zKtigYVwQNZv)HRY2iUY?#hG7noyXx7Z&=%Hy&ANEyi*s zd|r2keS`V=TK*a9IfX-3tX|ztGIGqAd1GT=#Dc`~1 zFY5|NC6~Ml-aj#v8Cb8rwfO5fK&R_>G}Z;j30Sg?7b-$h_NqxBnR6UREKWfA1Qt_@ zHvDi^}Td}r7w zX)InKw4n(Lq#;N2fo@0sMt1gw1rCTD7`reX8hC(IKPH?Bd=)+VI>#}_2IW21tO1Le z4va4fU)GZl62i@ez&e=GA{3XF&iPk?U`C~}V*JWDMiPj6jtS88Ub2QWFuKltUgz6vEXq?Un43>`U$Dow~J4U;jyM?F?q#6#Vi2*xef*oy=x$ z?5SfghxUUqt4yo*TlSqh9cf+bikc3ewihA>WJ?;x+ahY4w!@5b=7x;k`C-(VH&C;b?cXvg*Ko+=J3oHcc*{gM6@FBWc8pC1&Fvis!Rs`(q_PaVg%yA& zLmp)$R99^ll8H@084}QJVQwz;!ICS;vY#wv7Io<2r2Jz3OIz@9NI`*V9Ebaadvjr*|22o z>TI0X<+jd0mlV92?Cr|ml4X%_F$;d0cUt75*uA?LS_+rVS06Jx?{Nd=fhY?_z$Z0< zMQ7_)^Q`7gb#@*j1k8^g7ut@_%n{>(5RP#Cr zq$;gO{n*$S-h+ynD~wNPu0~DxdYg`l-o7P0jc=Se1E}Tjp`Y`bt+I2g_QRM?o38U* z-PpHCx9ClVCh&&HKc-J#3N%F2$8-4I^>;&H<&?lWf=^2#?1CEVGl<~-%)*!~@vF(D5pRq#lwb-CV=74<`3D%r@n zSWRiV9_yE;3k@x7F4UF?e|F?OW5`}_th~g_uptELkWwQi!uIa%4XthkdL;-xYy>wh zEnT$83*Cwu257-gaQ})3zOc-wwf{|Z)b7ClmFg(Z#ci33Qy;#p|5yUTC#-8V8e63o@n8Qnh)6aV9e)B7tNNK72lwR`tMx|J4+ z{T^ybePSR&ka7fqhzWdZ$*g=z333FqtXHotB>S$tgjh7~eTj*iy^1vD0{&gGH_PD| zZF*1575e)c)lYYHGtk$+{Iz+AR50cknBB+&PpcQ{gioMS+W+bAl)J<5-c$Ro6OAeL zVwc&Odt#XPOk#c)`FzeP8HqJMhuqSV5;JaY-gTG!>b|a!;}N`6YE-A5a}ru=K+$qb z?kF5v+Xqnce-4w`b&F0Ln6t)bZR|kkf!%X{HwZHW#+;M7)P9BmSb|^^!4GMHW~<>O zYs1I@87nI*Vok2W$y4Qw96fqY+GqGKfx~Zw$r2p1fGqL@VQ@N1#Ps9jtqgD$Lo;^h z_FIq#%1BtRl%Zj+Lyzd&JXwhZIqQKT&)$C9w#D*$eN;Jeg3osLi)!-L$5JK{#>d-A z#8}&C$D1Y3-hM=?r#Ek&f6k}V!%<#{`DL+7FYSGHVoPjU-S|GU!g?)E@QI2V3^{ha z`9K+R8l^jUpHF0 z=)}N%|56_9J=vxwA+(LJt51G%gOzRV4n#>f&HuVK+MoVk)kepxzt=`<0_*lpM8g64 z0pcJ5E$JdzoaSU3U6-&sNvlj=KE^!tAkXAX?MS6D1^YJ!bh6FsyAmclH3R$450AtY zeSJVi%4>Zf(n?|MMfW9=h&Y<2%%4BMwY!)ALhkp&KG)whHATSc7t$~e9ywC@ALQjb z5=&QC2(6(8I}dywfv)i8jWBf;+cjs09cVm40h|vtN}Y31jF=rYX3PKyve&6pGv<9o zH$uwaNxZ}}`YSlPt&Cqe+tMC&ZJeA2Hz##1zK;>lUa zp=$!*&RUA585hTtANI>&gw?2#BW)H~Duo0kJPrz*QvSA`%>TR6s5+Dx7^ETkGUwh< zS{F+)Q6Ak0{tj|OBkZQpV1xy0>fu$K>UILzfdQHLT8^jcP^r`(wu%$l|ofp zTU(1M6{*M7SKeBI$XOI-bnl1#{B#9SHOj|#hra58^wXPxyCNCp%6Nx7|EbfanQ>)b zuy+bT3F(I@XsW*cI&0KygCqczcdH(ZM1B-&)Rm_rl04lWE=z0IM?U?4Wml^9YiM24 zZoHKPY-Z4j&X}$nSHtRL(y!?>R=V8KE`LGW2S;^-BBtc2b3*MG%cV;@aU+Y~=+Hpp z0?L-2=a2Vv{l)(E%Ycs4$_spl513n~>>0>f@<7bAoB|B^p$f%Z{yED@$g*eAdfS~& zZ*m)DcYp!qWQ=Ftz1s=EK?8-8mh!>hV?PfBr|%TJyl78W^0tk0NlC#pw1jfwF%6qt zbg~+FtI)8&t1IP?IeB6_IMUA)_8Vd2;<#LfycHdIi#$XzZeikhy6Kp>J&j=gg1GL1`~h% z8046K2y2p0oVMy$v4^TV=kDEb@X5}SKN}nE-%d=>icivcs_ZH#3ru z>dYB4W;ZWqQj241%^E5)9q}>}F=Gdeb8X+1GZv^Gz@^J8}SRA5edr@~GOuo~|4kpu1#XN8E96;ddiEe?mD zv(j2g$oR_}R*kw`a91r{pNRczAx=NyT#~p0Al*c%zdiZSrQhpC;VSVjQCpJXxaS*O zDPn}O@Y)FLA7EPIADbuG7WChJEe1m-|U?zy0|~f z6NZ8RI2^aX@wg%QT=nR$*W1Y|-3yPZ>QSH7{J*Xu%iphT{tmEBK5Kb-Y0c3K|A?=- zT-Y{1GVFf5J@{Ji@@9#14$0YBA!@3x27k@6j$awNez8=mmgz~UVb?Y}kgooD-yX+Do$tlipW3gSDIT0>h3@HjGTh!d3l z9}}o)t|x-I&v6l5x^WT>L*hc7UrhP*7*m(tEAx5`PE)n&si2Uq_oA&<@%+eWI=lP$ zYGeCOXNmD_MM|Ii0cc4?zOx}4lP|)NQhY(52a|+F9$8nZV5*Hm=u)hUY{dUmHExgk zr>Zew>{Hz82RQ-2ME<2_tO@stjf#5M?1}5k7BU_LOW2O<)DAVa0Z!WBJZQjx12}B3 zu4+tZi%qb#JNYXqqd@+ob)g;Y%lF(pF?>8X!6I*ceVU=x?l0@>Q%CVVNMEVyr>76R zIjHnin_6U_!g{fw# zosSx(p7sqjF;LytbNDgqQz`*wE0R*)ZLOPZtQohyNv8Acsl$%f{iOxy+kl&_oO8 z=b*7hT|IO>6#Mp_h2Nrhqtfjzqb?4~y^>hdoo$|ya*x*8hGSl_b7x&7n*C3E>}kiR zoS}MPUETJE8{Jp_`s*x^rEt*Lf{2sbX7ZS{94dbi-d~D#Qz+KPmt{!9y5+)%Rrt<{w`F5%YerX*1628S08=z>Ue!Hdc^5(7um+owct<8V$DG(!IG->)2-ow>x{FDQj*QfWeM3!CF?duaet%iX+TLEzI4^cRkBhil zbP4#_DgGR|m!#u`iArj53%!MQa{PGn`a+LcXCfop(_0uA8Ww(-C*>?uiOzNNLk2I1 z^+KtY=2VNPCl7ov;U^$Ad|Oo0tt7a>c5-ajjXm?e0duMfslw>!yi6+mZ>{`*E!gki z!GdsyNNS7I^jbPTw@d+tv63Di(Eo&$mBHdsMH8JoYTJ8k{qm`~dBqiXsShY%8*%GS zd)W!1?I=$J&mcvlR}?AH1~^59r~HOdJ3A`{$L89;`LJP|?sRTgXW! zPu?-vWzeXYOnwf9(;j`*9R~fc!4@wux9ry$RUdGgG$A0IhbHax%XBLiCN@BF5)pl^ zq9VQO%rgx)TxJX}@y-$^f@Ki4V(3TH!U-W;*i*1AwMA`4eB3{wC^+oBQqi!XLyO9e zeDrKD0x&rt7kkg{*IA5pM3-Uj{Hb~Gyd`w4VoV3xUg!HRk2eI@Z=(eellks{?fUCY zxiRq49r+TjQ_tw!2ziy|S*21d20!0tyh%{vpw8_R(uUj%AHO5Rs@Q|h3@Gu`TbI6* z+Lgb`2J?QVsoC*xm%RHKZcFkGjI=KvyEjZJ5;$%-x^?CG*B;DxGq~jawYxi(GyCN? zav#(023}1V;j*Vl3jG#3%U`IbgxC)Rmc5H3Vj8Uyuy#utM%}X~Px_J1Bh1H;UBa#e zh2r>{RzoCBh@KAm`$0|3ZUhNYheK?JGI*A14jD9a#nSSxm$Rpo#dLXE(&6v3SDT<# zL?AdBpP|SE5d|zTft0)ojt{h4J87=Cher~+^G8|PRp=(+$#y4N(F}d~=PzG`+yV08 zF*I?^e#_b!by`eYk^wq~c{|Fc5&>EWX~n+z0Oyg~i1Jp-($X^K@n|QE8Uy-ItaFz! z_nEn5)i~zPVf?u6-v?+i7@4rDndP=}hQUL~Lt53`B5vbWRaKCu=gLt%5LxB(`BVSA z4^qHs!Z;*Vv!I$ZL^a&-C83I&H+<4AS~%uFZp{;BU8<<4m{;N!TDfAywZs@xbsKPZ zjRCj6eEuAX%SjLtg6k5c#`}8e&U>hbZ{_6drM*q9FA8c^qse!IwP%GBDJ(^WXo=^QFoq?BW@xF^xED$<)>hA? znGdDTdNEEm+())4XOyY^$K7Ha+Je2DnuUPLsjib>One{&{47@C_jb$s zOxPPVe*E|%lm6qV6a5?S+_{rlFDxVyCSc6m=cu0Cy~A!M|6xw@Dak%PMD&DPUSHaS zFs>EYrR|>?y8Z6G*wHOxnT5;eECsW6^f^GH-5>l&3T5akDqB03FW5)Nzr8>Y9jq zG`8)Oro%Ot&sn6GJlfVpLE$_!}Wy;WEv^SZ?q;NM^}0 zd;1t?bNhx+D}$LGc1yF$#KcTZqW^LDx#+%Y#^s+^+xXRcPkDj0JhrAU+d(;{f*Au& zzC?FZ3ZZ!=uR&!SIf6fJ=DaokSVuZ>X9*kcQ5soUC{WbN=)Ul0@Xs_kF(j;x4HjZNLJ z1cj(x8+7oX9@l$o_xn7#ZppSCr@W5;#7XbGSmj9VLXR!hJtC7n>$%jG`1I<Qd2Q{JmYu(Jb7_|z2i z!D1P2x$+oEiVA6lf(=MEAwm%Om5-53KH1p3bQla;ddqgdOCa|)8IGCG+Q`zr$3*}5G4yCIwuf7Pp3k1qN(TG zJWZ6^L1ZLwvLfORVHY~Nny&}`Eb*gHXmZaaRy4)B zd?b$upAFwgZf>D?MCYS+Caki)px!OI^$xl^wWf zKRU5GUX@1dBKazUY4%HE^g( zLw7@iw!!Dmn+~c+d4X~(!SL8xE=4hQLrj-XO1Xc?W^1QzLl?S#``UE*V$^M9@0TCp zuD?REXo@vCTR?VoNj*=t18@+&$AttBAzRO1X@Q}xb=$TpIP6}wN|7(I&W4r#=c1~- z{_eGc0tL#pdz;gJPqwnCf5r_@>AU5Ti_tSuHW1V2^vG&Bi_3B zD|Toj{6Y8b-5c~(O}B8fm_G>I@$I^Wd(dt+H}3Z0f$Or)LyiAmug}I*_y_p;Nxr$~}X>qZ@WjGL@t=N9?gx_3^skCi+Q>F;7W{YBu2~eKx>DmR##~z~LbBD4M z11F*0ej)KsqP3;dVafsAwQ>Y_h`CVcpdFk)2R=XjN;s9)ef_*yAdHoxQqA`xr`fe@ z*D`$b{ZxhdRhVIL1P}*m!S{77E2}Mk*8Jh+fV(>}Fd-H`Rcs_jQlI;|bH7HH{@g7m zeOignttqa7MgGa%>EpC0t`k||Bn zI~9zF-xMM_Ify^e_&k3nXHhL5ZRPUilO@kBzcqIkzKi#-stn;Pkgw#}N4)B-?kmJ^ zl<~?Fw;q+;Bk*ytn{42!l9H)ar*OCiNlb+#?N1KnS4UYDw93e3K|ur@nU@zq<q6VFgum!{YF{u+mLrWv}D+c2ij&Lmm4q+eA}gO?``sPB=v`i}(xQg&#^ z;Y;vg(B(c^Kh}cDV$oMaUS&SPq!5B6Ox4bSL$OhfO{1z>&d^?|VE%x^7wlUA@u$&^ zt2Tey`GGo^&Ntj_#i>Nnal_spS-fbDr>8pWrcCZF>g1@imPG$0#vy8!*2U=I@Lqi8 zV@@^e$MTiLCnT)Ze#!|rhX>cR-qBG-qLJHkP~M=LmoLvIZQZGN%4WS0UC-Q92R=RW zcxb?90k$&@I4Q_qG&*|k$)%@BbJP|4AG(#G6CUtJMMZqS6948|vXi(2bglp-w&02& z_ne4ViBDT*WmWjH8DsAa3bY1nn-5XVM#jX{tn!-Z@={46JbjhTbsbWM{i&LGL7+Ark^qZ7jyDLL$1C;dvYZ|KkgP5fqRce?a-CL7SEq0ZMS-LcKwA! zqK=J>$5o$8`O`dZ__(jjtqhcjhi?zAz#1PxMZ1TwyDEf!mo<`FAckvR!H5oH4(t8s zKGMrp5*o&s8(#)8<{6S>;pJ_YN;IF<)JWa?Tr-!x9QE$N$1^2b6XUCZP$lj#Cnb)y z2ZMq-+NIRBlV8rADG81@I_B-9=|O{1u-rF%NSDCagHf8ymzWM?SQb(}{yIghr;pF> z=;$G!(zNi>Y+eezS6{N%Jb@q4~iN696kQPJZQUENA5m_VX?LNnNc^=0i>HY6cA1lH&zoh2es1^L;6 z=x*qK%xD_y#{hsp9s1U2tFIJkH}PBj?<&Qbg{Bx0N?lN|QKioo{OYqS!1)qWIFjVs z`T4Y0po-D^PhHC0%}ix&uLGW)46$~F{N*W&8slsX#?l!M7q<6y;enT6U+ zwDIK2w3Q&WZ^wn}pMD%U0EUd8To2{6%FQBh3f6#oL5EL!W? zFjGhwV$+9V-Q4)9@~W88iaF<6c6K`ss+i{JZ6Dq|{Dpl-p)BIzt|6r3+qj1BNsvqs z*qPU_x27MS%GsSEoRB2`vO{ms4IlSDARt$#c_!2o@9(5<8cml;6#J#E$ie_^~#;E%T;orm!?1Yvdnx zM_=xLzyQxy2&kV9sM{_*74m;mtsyp^t=a=gkS*|gI*(Uh;94s&Oc@3Y&2Ko+Yog1Z z>$9X)O9sdIaHF+u*X}~b=lO#3rV90Wzg3Ku-`Td~HF)B3=Se`P9t($Nv9%M+hYuO@ z6Hy|&^m*f^u1cYgESk7BQ%Re8QpNRU)M)1sgnk9RjQ&xVW)boGSh&FD zSfUx~!{7q{kw6Crke z^CmR)<~83y?>#^p^I=VD+M7nAZ+CO zDwgrmR3BzsnmID&YTC;WUIRi+Zs+D2o|{@dknK;OPaH94^@s=-t?a4x@6Hrz4SH4m-aI zx>2YsoN5cET35EVi5!;zk|kIgAh#P>vd=U2+~K#IC_aQ)hvjsXK+sYb!-^=iBe^1d zi#`t}MqB+|WCh66L+s!j5lQOA%#z!~6rMR@e&W~_Hd*X;z&~gQPNRdEv2}fFZ_%6* zCM|}Sfa{9*FYNx4X?i#uMTVCcItp~R1A_w6n|Y7S<5sl6IOzOw)>S73pVxj$eQH0* zWPOYoR`~i?_7-~yJsTZ>n71vhi}itmES9^>9}7r|J(UJdT7Sms86svIbUHlj%#!pV z9bsSF(qZ>+e0c&9lb9mFBP6sCkwtq6xzN8=+$A&zx?#aIm45x)`743fn}BbdQS;oq zcI`KbDaNrc%=SD5NfmY2chj2(QZW|k0WCh)1!+N^qMsMpfiZW-6lQ!d+eQj3QbGd$ z-r-GelX*E_)@aE#l`q@}{W`C6{*@PKFS+#Q+E4oWjA7J})AttBuOJI;*k+ynv z^)4^e755IT@7Vhn)0#j2p_*}ieLqMd;vHxF0Ncu^`zBA^_B_gDBx#G)0TKWmX(k$G>CX)vKYt_lzP*o?DJ=*nNh@GT&dn@CNV|d_2sg5 zMeR(QPmxMNup1i3n>FhZBA)S?)r)V1=6QaUXU<4_YX^r;lD4xK9nJqO8nlJ09LLY~uN>+APFl6&j!-Tk!2#aYw!pFDb`Cz-o~ zMc8rJ!t?Gx?OvXsMS*~ddWc>ix$t}ycHCnw4fnLIH6(4_hPlM{oZ)QLRi(ycAY%4CTmg6yIyPeli>>xy1uy(B7Y;OPZ zA?Ek#(S*os-TRk|-1b}xwlBS$0Y4xDXJ{bzvr`s(O(?o|mvc$JYgaKT-r<<3x;{@x zBn7>DU2W-`-y?|x59HMU%%PFznHD#jjuI65^&xydbVXup7cdMuCp_%a9od30e&C2goZIgMIPggyZP|ajp{)K zXkB*q-S$CB!ArmTl+)szKL>j3A0Ynv3`5jGn`-ID;PMSqQ^94ly2&Z9r!plJFrzQ z5F%TW_nwcF^=QWp(5tQn`K{8@Tj(uNKV)Ps+vLvmE+_tkpuN6R(z0^rzkle5K4^X( zaXpa>TeMOAAO0PLVhSw>6(wcTLn+FyNl=0p#X$h**bN*=d?{C6wLAxppG7&@x^-*u zHU?2u@Z_(*xyF4b)J{gf|I)GmuKxJp?#!FpFaC%a|HV?;^xOA$=zSG3^@_On(G{`k z-n37j@~AJLW@j=8b7y%#9qx=wH7XbJ<;X6kswdOHdtH` z^LPyilr))Ce!;tSUHs#|yxQ|B9)b8eX&tXXPXp4*h796CgzV$0Vr7!Hswi7=* zX!W_y^4o7X3&fwwl8CfO)UK^jR{GEjTC$L)?WKs6tBbeNsYHe>^0SyJ*&e1bUpyV9 z_B`=~Xf9IKAwvwqhToy15G@rk61AG6!bdOLXz=;kE5D;IW3Zh<$_SVdcreRds?{4J z$OMxWdG6evsKM#2dwAHgW{KS>BH_S70vpYb530X(e5{KVn(YF9;KgX9HQC&k;A4ACwhmuX$VZ8 zt7z~{AjU+pZY+hEh&A@N<~ULMWnI5+!_6ZjB9GqvjhFq&(7-7D?VC5IAD8ifvN=xw zII`lH%Z=|FHN2`tHlD=!BxdeWdN%TIdT?}X6OUt~n4;O|OSkr|8TEeQgc@gQXYqd0 zu}KDJWb{GYFXX2boYAi_pSz2XDPC{R#OA7)B|pQsPMA*K<=Nc*mYYVO0qAr`I{6qC ziRjA|O=kdQh03Gmq~I6=MiqcP79S7VS*N6r0g3{Sh4g&RIB+i^Sm-Kbp!th$HJ|4@9ta#ZK?_>n( ztz%ERu^h08KG_}n>PUMm6%(w5+bSsQ%1EPJakwhE=@o?iP#pN>)(ne{HdQ~r?Tagd zN0G$4lME{mWrW+8J9!>nuA~YeG2SY{%7C5&`+z7KkiY2ai{x%iCgJ`vcI-n+f%dYp zyU-erpD@9ZU_^(C+qaE`E)_Nco!B03cXBdN!HAI{0B*~eA;4>kkSSpvOG!xyPDv4! z3yMNHY=ofGzHmQMBn}E;5|}WnGe+SVSwUhs!g!qynI)g8G$z1rljkN8G9GH5(jxi7 zMWX*dX-Ebub|A&`hm=4yc7p0@>fU_Vt!dn~t=*}kYbTK?4X3vc8Z7la`DMD)UISVt z=s-DDZb6LKiopy8Z1{?;4ocw@E)fUzu6)h8+HtZmVrT@&Ud!1VVq(x?x88sqo#jQ# z5vIIbkI4c@NxDh3rsWzW5jhhFb8DOkm3RH{Mn!)1q4%DiY;}gYAv*V7{rA4Z9J<}v zT({j?b^U9 zU(-L<^<3f__$v&lC^R{u<^~)Oj6XHrBYzC5_o7viOjHc1*CI~vLv!;Z?gh~y!1kX= zvEY-#`;blkqTfscA=$*-qh@N_+TCywK*UUex28#;CrNE0Lb##`2dO4pB~s+G@fTz2 z5z`Zo|9J(k0ni~qrQha7g99FF&}QFwY8K4C8Gd7-^;1vEV&N(f(KASpj^rGGA@TXa!GAo1tm4Md0lI(;hy@q~zrxQtd3MBGAiN>;KjqJ*;+>D|Ci zCGLcakV*NIq^CkD+H66>2(|>fx?r|4K0fWmSmSk$F0}=1uz5VEnwTEc)1y{V92xCB z2W_ABLwWY4ICG@3(V}bPv2Euauvty0UJ4&Edeyw;vODwdqovCHacrWmy6!qh6ptRu zy%lZr$2J4T4yx@W~}?8i^@ixGqPMPx(E= zos^8_Fgh}iKlitNvIognUr!E+0!c(jc#vJm3USS=O9Y)L zKr-C;_G$Y!Il43RUU-dLNys)3NmdU6Ml6cobv(3@t5^6Kn(i}R<5c6u5v&)HttP0e zO_KWoHQ`V`x{4nzrKi~s5#0%zLGR}w> zq=LD<*5&eqr+j-m>Dv^z3nz*$qQ;`4R3r@eI-3*(GAXSKYf>3cqK34t&}1aPM2vP@2@Q2j@#e8ygJ0gB{6=hA zPR!2inY%FS_!0)9OK!lg?|Ub_58U*5@eA1xi?^-dQz4dW>2#I8C@aXT3>eTx%r;9N z%G3_DA0&xfqh{(%89^1UO#gi+sgTL@64PVvr-NvQ_)h%IXdvH7FNuURR^ywSIUg>? z-k)nhN`l9)G9Kis|G+!aWK!rIEqz!K5g{*>=ZF^{)9gL_dPcFs zZgIVJ>ivs5yVBt}b*KnV73yQfD*hx6mXiNr_6cr2II(d*27fp{f*ueRWQy;vHL|omSRmS z*)qS0-qD=i0Cmx1)&`$3-1$?^j0FgHs?Rj~%fvXYm^09w0)5KxBO7up2~{Pp-d6dL zHnssD6w#{a7$768`XjUYh2#znik3cQNCL&hqUm z$0P`cGLhX24ELKS0}edcQQcqz<_|6?UA+BsLpyhm%bzRkZXFyTaTn3;+{_3h+uSov z89_qxo%*CKRDDtsSkI!A`$XdBd=bdFl!PSPi{;KtLYC6#u{%a`ZB3>t7RZH-=4;&mllT$>Dht9CE8%~d*RJ{&o~pk^?Pxd9_U zV+g{TG3uB%EXNc+_5k(?qw7Mm-U~uy2+Ht6P>1J;P9i8}#XKu$rYY8!vU7i*bbo)^ z<2eB)$>+}to|a8GJKf%JggtqSM==XyYRsYt$F(Hst4b08OA=oX zNqm2Cd`4g6XO=+$v0hJO!|uADvoa7zk58|kO+>3U^2M%qd@wUeIPRF4)~UR6E_c?d z7WyuBJ)VWQOIdxJS?)qQ9XMf&%b}}(CiU;HdiuKy(G#{#V6|Kuei%H>c~uQhizZ{9kod|>F`-k*#u zPl?OGd-le%u+Y$cB%95e(0CY<)U-Y4AGLUF-SjydO{}0hq~%YAhqo0uzc`gSH6r5o z({!+>%ImqlQyUIuBVHCrcZyT30$XGsBf3x`Bx}SbneD$pz)50pMM`>lNJ4@lnrs+V zqk&UUl#3HetHMLKpRSpi0$dUU!LJpEnnkGHH8d>M-%zSxmEuV;zdwIqD2)(vM=T$A zna$zL`5u3_sfx$sKj?PPAtOdi7lh%-S-=0XgVycL*~bqbUUkcRDym%HbDA}+q#&p4 z8ns!Ok}LBv-72Z1ci>s;mK}z@-;o}WQ4`A$3TV8pt-BbRK5+4dVVWLXoL@D|cfF&p zlSlwAA`ZPb*f-q(dFNiBj5Fh>h95q0;;vh8tB!qh@U3|m4V<$mj{zOD62ueRIm?z` zk5p7r@)WfxQ)z4ujY!Y{K5EY|Ki#%8W9wKb$2Wv-L|S~KWZ#Vn8~NM>hhu*ZPR*K? zE7ftvz`=uMK<=Y+*4y7Tw6Y)DZdiU};&rFqT-!HnTJ|U9*W#+Kr3y7Kr2{i^Pve5< zhy;Y08mEGTCAyiGWvKE*+Fy>5M9h(Zc^ZpC_M0}1l-S9eE zjS)Rtnj8fF#>gHY<1^cz-#vpce1%(nu zbe*y$LEwt%7)`pFd%F%1S=U7=cW7g#QbLH4mt<%Z;XQGsSE;3ywu^UQnzM|A)W>`L z0e}!+F6p_e)Ja!}NWSm7Zy!31dz_@ibQ7x$A(+xcyE1sf1dC{^vyqX(*zbA*F|c;? zCw*;@>#4m~iRob;Vg#%UbJc$>BOw9qpr z&Kg}(T$~Spn>cZV&zINVzMjh&>xv2YIoNLDi}B-4N=p^`HZ-2{fW`?Nx%@Z4vV?y9 z9%Y{tM;=JZs_l&*S*!Ik8dzx8 zp^uy0>xIXUKQk!}Jbv11`S;E=v=!bMLUV~jk2$lC_?LdP`ttHSP=MQ>og2NTJnM`P zt&a+IJeRn}+s4E_V#E!3#rY{GNkS089yphu^x5!QojaZQpa?)KLBT8ly3i8h^ zVe&SpV`16ktq`T8%poTZ;ihdoEnF?0Ae>w%jSozQ1*_kWPLqnem+@I2 zD&fB=#TML6iNOqsxOgYOi26eoIjU-`d8)Lk-n40Lsj}M&5>Zic8NomVBQ3F~mQNC=(LMD7_Oa}0ARGbfW|3fyFsLxWY{}(8M|9s^O z-&JEfAYYT4l@_#!|EuSp%iAax&(d+SiT46D`!n~3A~)1j9XZo?64BGZ?bsSj4I;Wo ze$4HO_6&_Ax*JyK&@C}eoLOHcl*gW)a9c7G5wou!x>)bx*%tZ#G`dMUg(Kgk@NiO? zNW<8}!(Rbhj?&b8SUz7}QH!Czuquy|pwU7A#Z1xCE9*FUg2gcE5j^tr|I`Pd@%k(C z8_pb#T+rmYRr}9uF?F!DyU48#IO6Z`*f2z~18GS8TLMWbCJ&!HIjbcxOA98%VVraJ z+5e;^)7h##<;Dl zP=}b1iD3#vXtrdOQ1C|p3JkPXIt&|WYE`_FvZi(L4Al)}A%Bg*JbnC&`y{95emTuP zeWd~IMoR@Fi})EiVRo=l8jo8fATM65?Ufj|EA%J4H!IhysaTnca!lbHYKD1_W}^=4 zw(nMDKYY4+w=`wk=#W?O6&Y^h1f0r}-sI|f zn(`{lrt&eSvwifekLV??(Mt+Zi^%VNFmpAEjN?nH8SX;flX2UFnsI%1{RNRq^NhGDa!@SmSp;&6yu3b>KXN6gW%N0$W z8ys8lyuq3x1zds{42~|cSX11R0)&rXIW4`-v>?BKi<<;mOv3b@H~y_GfDU9=8@}jQ zBC}H>(3i!PzoLx+N#BDHu9x-MnK=ia1!nwk5tObpm$6xV_oAk?*LqanF^}zjvhY^H z3~e)hpoQ5$trfElYEHWz*~RSNkgV%p4|%PAn0ryBb9>R?OSW%crXWvSl9gEY;i@~c z@uLqbAKnzBc_hF!j|SD#=l8wJi-`G+TU zF)asW?!cB=t%wansjk-7Ra8_QB1aZaNIvz*P4b^5_lR#5b5);Zc#cK?U!G*&>k`9q zL_RMXDo;-e(Oe(fn=4249Op8WB((yX;dzgK3!J!ZiqE`5I6QU&S&P3Ul1PYz4ToAi zNPv)3Fx#7gye7+&Zr_F)gVI5q6}{Bv?0;Q^ztoV(Wq!xmV%%LCS@#2$`!s(q_ zyrtZbTFAYatVLM3tA@IIFd;ngyc?2+sl(@Q_S8EzR2Yzir4-5ZUSHn`@*&pMX-#am zKGnP?Dur;5Ie@(}mX}W~>4vGECf_dJ_q`Lwc4=LZh|$SL3>BspOi2-$;#}^Pd4lm5 ze?`vm!M79IXG!w?^g8xkZN$lgEDydohcb{~p#_mJhp~sSI+5^r<a7f|soaN2~rZ4?>I zH1%e)+a+2cfE8CbA2!MLIEM|Bla-%z$;hfY)}vABph`61VH?}`96U&^_}!y9diHq@ z5n2Bud#A_dQ7?O#P7u@{diZf85wU7zdoInVcWo@Bx|q)N=`KCZXd&D#yytLRM%^#1182qoqbg?L z^>80G$T`Rw@J&pN+y+HyY&|t=!1e?GUZ+QVlQv+S6V+bVhXzhXXxNo4SLqTSE#2)CMUu_5shggO~e#^ku@%=wQ1#)_5!uO zxVlj=G^QlYAXfTKIj*Xyr1i1Q2~bPxMOgCjNhh-ZR$(6P`i9;eF^?!vNByzpp4R&R zNuQ|J=p2fzSLy`(uGu^$VC6{Te^D?O)#m%X>;*EIisK}8TcIZcrFUe6lzpvp;d}G) z>xKJHrCtx*Fv)4^KWwC;H2tJ`y#^y zCG~&O>K-$nRV#jUVl%o>NsP)L{HTj_Gune#l#OD1REa@ip7vG8@<#Hb`J3Ln93!yX z{R)sLa>@@L96WIW_4qu8|C03@j2szpba#o3|7`r$>gZ@PX>5Lc|Dd;KiPPt7FfS#sM>-g`Kg3o)VNR=3Ovm;X8y;-arj1K^m?XjS!Q%~lg(F%BuY-tWqG*o|gA z7KITvQxg!Y7vqsS4JzfVQ51U3m$^WzeZ0NBqblvF^oDW3bRLpYmd;dQ5G?{;;ZSPSRtu{WlU8}e%}x9!}yvkcR{aj+Y;SlU}8^ZUO$ zblvu`5QW>6HVLNJ0(?D;)oYF;Rurzyt@s+swEW4wFnU|I>6IO7cph!UtSiPIr=ozErL7(mg^1bt!XqNL1szm2 zPP{rHewDeAmR3}~g_fhYX3g2?fB+)e#YD1R;Q^5(*F{YXk4vccZ;yjc_8W{(9HvNM z=*meDGL-aJ>&87VuHCh34O`UyR12UL$?n_lcHq2I&+_pH@8K80|qDeHS@yw|4YujNq^9uC(39KE!;FUU$4($578X z4xChZQ?BW_{{KdU|7U19nZRzoaNhO9url2!9S4Fva=@POD+ZS() z!Ttyg+|o0shtx;}XrCqg3!0+enZ@NYoD?*Y5gN7SEBO2+1`pi~X=AHjPg}KSO(tiI zjNB`r5rskR&DpZQVqbGu8FpovZ+((6_l(uOAnfCW%j(y$g+r*IBt1t_prNiF3})Dj zc!3Mh<0)7SjJ+nH8Mw$3IpghP8l+_*S);*jf8rVZon0d!|@A6dyr6d6A6cM?wFnrmR?Bsius~^X*+&smodp ziuZC;Q>OWBZz>{6nX*f9d+Zb8N;ChGN%p^KmJxZkPe9uO8Zsn;L1k0B_0666*<*NEWgif@VuJU7wh@H6Ii2xoL(&4U z+x=9ZD7XB7cf1yB>t4_?!9bvH^D$@Z@y*Di27eqjVuV_ZXKoEI+H66o6vaG8@#K>f!`DJGH2hiSpkr`h}no; z{f1M`$=GAaqi8Vi14ju9XocN2>CP4%q(Xl$2D|;e7_=^MGnvP=LYc2F>O@Ghr$t5k zke`PZ#@}zczM06|PQ4n*%>jq144C-wIkTraN!RN&E|>)%Ch|a6eAv-xRFYw3i8d#D z(|YR?oB8h)d|bUa`H20_vux7^Y0W`wn6(JMlh|LkVPmbj%zqa%IL{^9`ZPerbDGLb z*qaP_UDahR;~Qdil^Uz)@T?knd=D0)0_K}uLdq)o`PA8S>fm0OoP$9pgiWUa9{VhV zKoFld+UOGy9D2MD%9czDXc790)@9JD z=bdL6x-Q+;*TYnA%Zfmsmig~OybZ!yhHmt$d+o^7zK*r0zWth%Y&dA#fOw*8|%GkL|fR_s@TDI+Wm{}Eso;(FXpolx3 zHP@>wXWf+vh%qk24~R0uEvK#_+DZpTB2(Z1;LP zlpb^5#G?SBACf z*m1qk`v+EA`JRaI*RA0d`OPPHkCy9<8D`icJs(jiyir#Iz&OLgB!H<}FqWnbMZ&OG zx*jx=jN|v@4(U(2QR+QS!W;qm2CsZV7(S)+!48wacp~IUA;T=$PR#eEVRDEfp08&2ig@ZwELy zT*Ql}(*0|8`&O--_x&zeMa&j;$)7g+warRAt~;2>hu#kJktG(C6cl9#@(UjvF~QQZ z-_j&zeEd$L4sJf17-8<0Rv5yScn4=I!f|(;DU^beU~>+O+1WS?y-T_qY<i`%lJA zz!0?WXROQSwB%UA6^CW9r|Xa*`cYTZ8#mr>eLD0cOaXPUn@2$@UNl8v^3x;L8#-Pd z-gne|$g-APZaN}lK|cymCR`%4EM$_e7!4$mYW zX!Wn6k_RLTd0*9R<~=Xov|R82Iaxq3jF5_FfRqT^IM&@p3p~eX3bD(hUhDC|EVD{pL90 zsm^?VUmF9_j2{){n`+&ACFwuZ%9UwQeLMpuCBLqv>-*5@h;_FO#6Q*p6zn%(z{JoY~vZ1UX(L;RgVi6 z-mG&ZMIEGH`Rm&);=y`a@JmF$O))NL2WgFJA`;?VOUU6{^|}pB3^KO#NPQ5(qZ=Uu zap3tgbbNPPFTAqaJY&nuf{=?kUe{a9upJ*^K1sc^zIld@Ma>;+b-W^UtHtR~+`C16 z*rWG#BT_b%;aPdzt=dOzvuz>Za!V;?`WQzQcGKR|5^FBN#>ukWkqD8p=XFljtzd2b z`OU}v*is_(8IWbA-RAD_v3KWn{-gD|*$;G^pI&j%V-!?G@bMAZx?T=igYA^QCqVhRvr4Jdd~SZ(mg5nH^&t zVxHTIkJJ|fa2?JUk}=FDRg>3>+PO25wf6i^&x5()S$^vlvCZ-B;n&XK1BlR7k;@?| z1(=+cx?i7ek>URQ^Y*1_VQ4KX4J!5O<;ur2JjYLm@k?SrvV}cFbhSxSUGQwBFThit&X(4&2qEXQN$LAH5zq~cqZUpDz#)?1+N73U!-^WE8 zjE~UmcKZIU)Q@1Xq5$)La@vMm2`PfQQ-aZk;o`NDkPTYd3y&T(5pVne zlgg?~a6%;6c<_s7+1+_E#bivOuAD`6$C1$e@)Gl0qwkLAQeVD(d*~NO20 zT0l^P=fsH#znmhR>egxurXvz;wNwAbuAa>is0BoXF`SoG zKIsVlxy8ODDXoC?vgv;jb>)t=_qANwb~2~BVpQa-E_xYT%zeui+B1ppECws*VZ-j` zjXu)Q+10fQ(9<9JN9*@2FO9+|(N$#9iwK0|A+lNSVWUqQ(*$|DKp-9`d~>VF*&o-x zK2D%H@%&zy^1`xc6wr9$=1rUS96G4$r3ZfLNkEglLc-@}nqCp+%XseC1$%Sl|MM=` zee-AwN$VF~G!DFX8I7llhxG}2O|5D?B7{HoX)!D8Sb^&fa3>=%n5K}LdOwNSDVv|kX&%y_t2?O;Kiin zab6KAd!x=h=|fQAzg9ax^Wg0O}ZDLGJFg-wj#T#(U)`rm#!q^bCU}s03>~1MtHPnhV zG{ip1b-4@$t2m?jDu42$yt!j^_pRV<5_MNCShDnm*&#fji1&bb6p+u@U^l(@di1h# zy^nWxh$!qkyT`83q60@C??#g|h_j-dPG4Kz)j+k7utds-fyF!zv*yk9;Pe-@$# z@_B6bTy3Q(nhAv|M>X@c2gTg$>Fcs#$f)!|g9kU%%;aS8^!2R`Froy*2GUnZ22ZSr zJ(Rl_JNo5WGAVT&P_}Il$tk$Rqs$h9y{l4smOy3<@4t{@*QwDmCwpLJF_kJ$DQM7$ zH9-C_6Esyhi}YMV6a;yrtW|>P?O_Q;TF-Su+kXf*J2Kh{Y@3zR*x6X@yi+TP9((%i8KhD*m_H0_<1x3&AQQZ*DIC%XPsR!d zgXIJb6#s4MJkvnBV)nMG92k-}Dvbbs(}cxxXBnrB(E%H3bDlcq#%mmmm+jiM%k1^V z=hEt?8fvZ-)T)kd$7&r;m1@E!Z`jk(waG48pxEy*y_ezejU76P)1BDB+)4~7@i4`TXfK~a%u>1>!FdI4`cm2UOC{xp@Q-KpcLa+FXGY|Ra*;?Gwn>aCfE zhA{9LrhQ<|&ueNGwaRsSUs|f2&UOMipsf-^N3}1fkZrAUjIC!rzfVn3i9u44m;>Kw zqKLO8GUbm4M^-3V6bqJ{7?)Trm=|w96+uKCdlF++_khc{+PL}31mUrjS5liCZn(h~ zE*Y&_Bmxwxk4ZNXs;Vhm+(Gw0;*Ub4d85 zw(}pWApAigkpy~X`l4}V9u&;436cW0FRRjH%e&8e(}XSOHt|9=6?O%u{qx^GI?-Rb zeDB_Hzn!#g>k%E344FlP1Po(hvSLg?VN0aix9@K@=CCAyGU!KO!UTpW7UGidwS1hp zYxvOvtq%=Yu;AEL+pwY{bn~@>>RA5%S;MN>N=B`#DMU!Pd3Cch+A+e~WU-^(!neL( zuUm#tADhG-TY;x99EE*d5bpEo=n=H21<*os>F=lcHUdrD(6G>VA9K~PLe%Hedfc5o zb7pVGV$x!l(A9N1_Ew%@fyYEQz#&t~=PqvWDM57qAHN`O^g>k1?6)3B*VSnE#EyxR z%yd;<>q~4_iX!C}Lm1X>-drPQn#*}Ae&0u9h9oX@r0w5o+%Ci$w>u|i$idayL2<^c=%2}`|^8rV`Oj4xqtEg4olbv6(4dxAH@5T zyeZ-i2t&*J%@p}x^iH?IT)?r$$jn5!UU$cA@_AKfKmmF&L*n5+PEEUYPo@)Z>%QQZ zcW*1RM!PQjn4B^H(Zh$rV#?mhzjZ{ww3^^NJDMfEPe)kDJe&O$QEBj0SZ(qPr^Tvy z?L5#lVBU_rird#MjQqxE`F*?d@v~K#RS{M{73bq7@dq-V4d0vc>GYmk4ql(@aMrsR z#j^pq(4uTmZJ>TP@D(;8R5^DzXI6&kox0w8=%?yZyox%7Et52xUEVm0+2s3ybD4hX zv~B%beguJM>(P0)Q+JV^FmUWtNsX096Lu=bd<=O>9+*ZTa}6(La8U0D6#`y_Qu~*SoVLB$FY;Q5Dejed>^g|(lq>TtS+V%n*2`+DYc({Rz-t&*H7PV6bK>6c}4 zgPHB2iVOToQdJs9d;*hhsg!b`It9GUx?j;_B`8U)swVJ@8>207jOm#V-$hb7fl^jo z`Z=;)742Jix^<@0_Iq+sU{GV0T1Wp@cDwZP^gk@()Tr{ERDzt5<8GYVXJHi(}+a`gQs{ne^-YsCm`%URcNpYP&=X>w|GJ z4_J;=VlY-=f17kE=>Yrxb9RA&`NV51f70A$@k!|r@t5rL+aDiajdd|~))S|%+qxgD ze4nidR8wXUFuL>N-gf?P%l9mrq+?-!V5dr2dF{3~HaqE6wlOp;DW;%9Hn5bYqGuD3 znmyNlvi-Ku4q7&O{r&yN%rB^32?6iK3B*j_7Pv$bZo8sLYB`2ESRfO`7`HMsj5`-N zZ1~ubq^0ZuPTkjZCpe}9#jRW3o?quAz3Ir5@Dm~WS!F)owzaZM56WxS({HRHzK(}) zv*+jnc(13vzn}bh`||-kEEa{bMLxZ?7BG?kmE5OchJG>zQUSi%I7tyZ6g1LpI@9ah zJ9Ue@=kk{pz$t0p5*_$)#CMj+7BkN(wEHcl{$S^y3E%^_ zHauw&S^n3_R%R$OkpW8LxBY?OaSWJTa`k$Z8w(tB?hfmp|9o$;FV{%A5{VXrz@ime zHq^Ai*Bk8`bH^N&08qx|jpn(3&JWf-6j!fe|gpwtpJ9D9@OubPVB=*4fx z@i6qIBh)TpX!IR1gidODV(`wcYK8^m_t>JC6DOPH>^^}s1@WjWWUj=q6DNiU3BkGU z7QV~=+r9YH{JNl0j9|6=sf7mtooPkiWAFOi$`vTB!-Q_CBld^6=OeZRqJZ@!jS> z+^@MhbkEC@pmgR1n19sv{%-O-+0nOlkeUSzAb8V%#vA{wK(>l^^;tEz`Ue{2H23^6 zpKYgCP&sRu#0Su3s%vRUI9we)OZ&ZkM8Xg}qe1|?$Bh@cO+cy7(ru1Bx$7kf%6(m3 z*T0+ovrF&kvYl3{(qe|j`{Nh!i<5^XhEH;pqZ2!1xL@(EjC~Cf4sQd%M3fzcZyF!ox8sMeE{N~no=l<_{wuTgN2B(O`EpAqQ~}a z+XQ6#{B&9U8Ej`8e}S~pu?eu0!3&n<8eZ3DU|uI~GZXpaoLuGxO-ZpJ5U+OH?0B1` z%r(6Sm3@e3wu0o*FJcu9{E#dSD?IjTvS1fJqMQ$d!1ZFl{rM(~%dm)8b(oRiz8@c# z=q~9To>6=eCOkdjg%16z7@MQCKaLhgY@oy@IlPJz8UpyEl&ed3hNoKVTwbYbJ|wty(1OY$JkP@n$2i zi$7W6f|;D0zGyUIhlX9p4v0O%hnWes4?z^k#WYB5xA|IY@;*tpFv_XTa6RO_5~EFq zdnFxMO2FuCx-B21C6YRcx6{_fKeJa#eefHR-Gh!*3x>H$%d2m&o4F&2qixbE;wrAc zEINt(l5^BC0q?HFTTICEmdaD+S1ASp16W{OH6F}x+ zDNKa*iy5gt-Saz9f!f=HkyZ;vGdjRH%7wsw8+@r@IYH;Jm2Yx&bqz~wZ%)I%mb&=o zct<6R4R85-VmMQ|Q+y`<-TlYDByu@{gij`D9nAf9%=3b3m6-LHiCy*p)Bo&m7(u83#rA2E#vrnm+!nR5it0Y4m0 zPtSEf-(n9WE~8%Fu&nopiEK}j6> z@L-RW&$sn^5>-s`Fl^IRV~LH&2c=pN{dnFr-bc3?cO#tF3u~i_Brl;QujFp zoR?E-GzhcX-S6m6?o+(G0|MEbYXw?wv^QFs)cTgyb!xIpCT0xZrR_gQv+UHQ^9(Xk zE9?gh=sjUVeBOJWy7|BFoJWA_QkKed>8Ia~V&y4Mal!WDHaGsG6AnJqk+1TP9?EDi z$cpy1hV!TAIh=z1{B+^-piig*;wWGT-XgIZDQe<@d&g!^R)VRM-OR0)A5SnQ6`^rc zOJs5?fIgA8wr|;znrAkrudQM9l^y1BMf=&{I2sVo8AS?_^oPlYK!TI>*5I7dCNK0XIFzW7W9d?eS#uV z8s_HRtGRu4U8RST$(D9@X!WGaChyt#*GI_IvVl`lLwA*nV+QKzohHRVxj6GskPEYM+1AG{#+Rc z4Gml~yz7Yp0|zc8Cq)$INbfvp(r{c|KoI^E2_cBFjE2Ubbe^v`ySs-G8xwc@xE^9C zt@cM-;*Dpa&xiRDG>^or7Ut$D1A+?c>zFBk0U?_=HDmAFOn@wsADDqy%I2tXS9bXZk)TQ;^ktjwM1nqEzl2<&dU}D0jhnnn%_m)(3%vL4t4@Bb4}GA8+W8}WL!&QX+kaBUY%!( zfQZw$uAM#~QT$1)5N~h{Vdq`ftTNBF+_ARK23&w-<%TRY;q6_b1>5&~V)R20sbH$h zMV!URuS_?N=lQzeRWcBp3q3~D)XR=X>pakD!J9X$Y2R8H8C7H3m1r7}Vx`w}b7vqIJE&4r zyym#v*ke2CeL|_GuA_7RxAF-QR=s^4T8|k!d(Y8b$emSUo&^0EeP7@L@myQwjz}55 zJmbZ=25ac%kDXh5>eMMllZN*E8DbkRA)>&sTSO^vf%vY;qtM4Ghry zbLiM1!&BeXz=^SHiU5NK0jW9FH2y5t#!OV3<0vzS>LN?SIB$>MPV?E#Yu98`kM*OJ zqF*FIw`J@YM$>UFxv(M=_U?^B67_QkC@h!*6`LXEU6khyijumih6j>s8_PM%#FiEc z&agw8zUAdD4Z0%aYBJzEWm?B6t6v&MhWW9_wn z)aW6G!qzQYE)Od@J=LarcfowZ!rTsy8lb%52HJk%W_g@hY$LJux8pjTLj3AV&2U&X z=Xp+0ZF1)u4*A*3y1Tp`5kv!erN-xfnkoREb%mJ@P?Y|*U%;?BSDBJTUB-f(wRhk_* zxW5JT_Q+_$eJIwam>jNKx9%|0=?JHC8h4pxqzL61nGu`Vq2VeSTMJ{@?=>970o6@r z8G4ho)zlR9#J%m9NR~maKuPwX4pyI+$E;dtPnm<@wJr7fOxStM#9ln+de?}ldv@&i zXb~bK?5V^3O_*O;wh}UkCl@*LhE1FL*4H?9_VSHeBeHaR6C~hCv(Q0lb0y@mrz@S#0 zI`Nb-ugwf@C~HZh1|tcPNEczI5!PtAJgU0@5S{8x<7&{i;-gX{QlG~HT4w?HOh=y? zN0oIOl#YpFzJwk1+u7CM08E2fwwjNQ&0fLQ-CAG2cjwuN&-cotBt)tzEg+UWAVX0K z_X_)Ic(i^=CnMww8QQzCHQiY1SePv*Ue!+MtsOog zg$eJ%g>ik?z^Y18h33_qo~j+UIuzFViYrJmqQCwY!?9t^}9CzlXY%$Hjp_|k|Wm%72n zEna=?b7t32&N)d%CtE~JECX+`R0@ExpH94`dq*GEnKGDIe-XK(dp)xFZFX+z@@uV+ z%V|a#EYke5lECC&G?dU%;G$3P>x_@8sw|>68F-5d&&edvETftE=Mdq!Mje~g7ePT) zI_#BLM25B;fo3Vn<&i*OxpR@N{Y1i&^ebzd+YNnxa5JW)q`&s{9@q>y9%WS#wiL+? z1XnWWcJE9dO%yVkI}*;)?oZiY>wgsYI^B2Ee(O%1GS5_$b&&V|++d#5?h13c+>3vd z&s#Q1U#`B`|4Po)XkIfPFO%o=>4*GBmVJ7VlcO#3Piiz@6b##!w1J@$0z2%m+^{UTL?xVK;Zq=$i z<$uqAz=R7XI_n`Y2a`-Lp>7Jf-+b&nCK3}^ z3J0wrjJ^=s2o8e77(u+8E=Ck*XrX%9+t(B!E~&2U8cJ}6SBx}I5c%#SM|zzNR$;@O zHtTz>YH6Msp;%BNY{|Y1lUX-u)hw z3|_c0O^>v(oPd;oyvwPx79cP3E`Bg-yTx|qu6Ghx1tXimZV=_$JXB%!<=5|_SpE&e zp`HJr>G}8XI|FAi-pF*LEA@`!7PH>&uT7{q6qzZx(tg3D-+`F)dM-YBwPSwd|Iw1^ z?qc=ANq$N6*V`5Lq{!@#|3|>B^urBTAMdaQs!+1WH14)kC3)eeg%EsLQ#roq%P-ES z;SO^Tjdfxv*pHvjd&cJM)w=I~%Xk%-8la zGBIJGdB=(2-0%A}`erl1R>lgV9P@a)syzv7Nu&4mMv#B;i3svPNelrU8sY9*=~f%o zasc#Iyb+d}-tyUp(}0OGQ_`ILG%7dhnOCMk*aEOth5mcWxFuqkVN=(Ks=f778TK=d9NBLngEUA1l7Hsi91zP@cr z9}GoR1W?>Fs-c(PHkUQibwlCJc=mo*#5aL%d%$! z5+lT!^4kB+LtSMYqRC+nj{v>P`ZpMT(c4p`S2y)G-vBzEHUL>)j9 zLN7onQ-Xdhjt7P1Ii!A?Ur~}ag)7I0G+Xp}hN6DD=E|D1&W-YtdxlB&6>R0uDJFD3 zlB+F7Zl?T9X>jD(^;ZnK&UVkp&u^KFjw6x_!TS`O>And&|u;JluW98cw}wRfI^n)~A__k_ACr z51XZ-!SHPvjm~2|xYcy31DqqPo7oJ62{nXds?v)gG<(^D*Y4ceR3(Oq_gSoBA7lX9 zO`13`jWR4u)GiN$)(uRsL_PFNN=huTLzZ1$QV2v!WCbwUVy0d*(>VrXKKmP984SQg zSTua2(YIeek=D01HU`aE8nSRg_(F-9v(2X=G$QktpURpq5hG;AZrW5UpU+maGCkJ+ zyT3jOO)Z-l>?W+CN-yfR^Bh*4sHjTRTzyq~(H9KNZ>g!K(t-@s zja{K0P}TI~y3Jqz$TDD2ec|SJ=(ApA+{oYU1638t5u(*fII_UlD*dxos#e&GEBuUKRxN8;WxqrK_UVlo(XC$ zIsnN7g*V#h1w*xN!-f#(Er2O6Fa34)@4!o+ky2Jo;r%7v9lnEMaRv(2X*7$k^% zRY}~QHA>jNH@+ z;oquDLT4gjT1_gUTi7qF(^ICz5e+O*`-cy{DZ>^vVEXhDJZPQnJ5lq>cfxy()wy{~ z$G1!O!~!*14{Kk$&0X!P!7Z_r&fN9_I}{~~7^;s22432C0DFxT5WGs)=_e}8v(lU6 z`#~0c%JJm%#@U;C?CPEvuujGLFD<~i&+l|yEl{C(Vf5+h>tv+qS2vJ z$e2W)&AiLzRsFu1cj|O+0heZCzm)GGvBwyaO1{rXzb?y7JRMTfwR@;W=+;=)vyZs^ z*&}2d1qH?GW7xH;9{QF`pkh|JZQ8fbfK6(=sFiU^4(DeLK#M+9%Jl9au`cumG(b>i zH2_XBkS{EM55y;>(92u9)~IP2OQIwL1{y^lV%WmfjctUAWNON}d-oc_B@XvcjXV7} z4%5##_bX9CIJH(Gf~uL)v&Slu4X^}vXRFT=`8}$AQvVeVF%%>22&F?L)n*BaT*we) zIvJV)6(usWS1dAhh7`asNi;wE>?7}ov=M#AjT;yBDGF)n0rQ0Ufj7239>X9<_IV~{ zMRJDvTny8gL&}BfYnfg3{QcALOwu18j%)mrlI+lS*`M~odKyV%YvrRz#)ux4IBmon zBqT+TPIS`HK!_~kdHMJ?uZ8c8k5^anh(*+}@tCqSEb-T0w}?RImukoNoUTigjVM?; zUUXJ!Ga2)@4kuPt`l$AM(ezUwtat7JzX>jy7#|-37$s>~N)`jL?NG<;VY6C?VstB% zPgzdWs+W2&W!0Gjm;wUY;nSz#E7K|}G%HU78nDE>6?#?2EM6*tDWl!}U)TQf^=mf0 z<;WHthy9&mOg}t$-SG~;{#z9m_#oiFB^U$#Bp5yGCT1qRCJ@Z;G89qG;DH81k~R9; zZP>assib~5>}taM@U-<|Vepx1isROfeE}r@SY}XobwWoGq027o-rR}w_#N@CNx9#q zzQPz1*zxnAxwRy|^5L=BB?z3Xj+g#=5M`Vy(tut_N}*6lih2Arekb{(7vR6&Ay)Om z%ZAUdp_>&weG4Uq_Sp6dI3@>N6@s}cnJsIZCTI%pL|(h?~|oiFeA+&QPws!O_GkF{E1t2t2#)>E7GD;?a4&%7080d zqpOQ-Z?^aU3Z!)b=_O@NIFgR0fFzm7H&=r%b#hw$g$V=C zUjy)_kg>`gVssbO$}|6YX0Z9BaUS3FJZB$tnLKggZ8(1GdCwk2|b4H?nfbmM!?| z9^h{=;4(tnz@X^ysS`7t`Vbuj?sYjMBNUb*PPd`5InaT)9DQ#Gj!z0L3GU$ zE3=MUf#v4ThSozisJgUTe+h(*G1Loj0NM<6aEK?=WKgRiKXlmD5?r7KiZ38u^-{3YcHi!Vnpm#9NIqF8}f2{d*Atd6e2D{6{$;AaT_xIaJ7tnmsJC&~U-b9Go z0=+`cJo|wjA3FRYiF*D=dgL_!S{@H?Rf0A=7NsG3*sy^11fPsuR8qae!kb&_&9v=k z>sK%^@~NGx;tmUH(vE3?1_>S`97I6o5fuVmzjUW#y2SyD@X~| z;Xb3Xb9~N37Cbn;RV2|O&Q*jC zgZBX1U!FE2C-9uie5{l{y}6c4BDI5~5XeCdo3Gg? z0?JJ3h)vu1JMTJPS#(YP3nuCcdGoKsM5ZasV4c%9#f>rI(^s{fIg81)h{g6oVAakC z#t88mF!WRZU_?&~p46>$M6_!EfV9THmnrqg(};Yr7o~-{SH@F_l}gLh=+W&)H6(%L zUoBK-R2C{W61+>Hg3Q`{;2Pq36W*7ZbZ+`j3Alj=KJ^_gdOjjFo&n_bL7%jJXeMJ; zU&O9NRVmTqELC0XFj#%ThR>1WV!AExVR5heEpb$=6eSkX`%$$|8RJf ztfwuOLts@^IG9pb??(vRZ2i(v?fY{SOQ0+Cm9@{Y`u>4dMl>dNA=m-L z<6AuBmzSe7!`7^6RMFGQYNO(e6l7)M8%<~Q0~@X~Jan1hY~RJy(ozvq(*FbEuF1Ur zJ#p7Mx$XW!;q3~uNBKVNLvk6%ApD^aL@F^{YHN?ZU1Xw?q?l6Ff90Zh#Mk$G*RmS~ z&$_k$?@FJiKL|YXbQ$*T$Jr+qqn7^GH9RaaCe$E0YGSyj=>qjuE^3BW)2lV>U^C{n znf5w6jUgw8dW1GLvN)5p@kPShTlKbuhi_WosBYWaMN>mt=gsv+i-SJzYMMP9t+Fw(eaHmzP&M(!9g?k62-Rdu70==DUjC#ffthd zF>q$mAo~MWZhqS3Eh%Cu=|eaol>8Bu=`3V+xq<*@^%w6JGO|607|45V`1P{(6{L9m zyt|p3uLGY-N=|lo-i1orNEu4P%Lbf3>I#xZm+-WfU)Qn)yaL?OR-J$H+nW=l7>Q;q z;K^`w8b2YaPn2$i+HIjz&f@SH*!mvEArS*PS`j^AS%$SoECB`FVM+ zc6K4oKTz@27m+qy<14_3%2?3@2ikr4{8@S{F#T0<(@As_gnR%bg`v|CLoHBF$n=Kgq@#AQy&m_w*+jVW3V>noNW~8S8ZKa<}ykZ9z&u$TQWy2e9EbI25;iXtH zYE49KIMl@@_Lns;-=j@;g%0$l_O<2sxmHsdF>++5Yf23;K;GEqfnS6-DNolPY=3=i z-ld%0p$61q^zzne+Vf`5^7rq{V6Y=&@;BY@KL{>ROzncrJmX;+wxB0$h_qW&-5y5K zA4}gx?X5RuVcx}<(A;GGosUA}w?quh-`}p~&`UKhel!5ap;{QSJwir2F~t+TQdK)t z;m`GL95MMu;v0&A(~_W7s$8#EYd56+*69($d=#hCW%rtWeKZu^fp9J^Ff~w7MF&Rr z=|U1BFojq#g>9slo${KM^^8YMQoB7m+h){Rrsb-Yx*}8WD+8otWF1wJa+cOnSS3j) z?NI!w@JO28-N{OZssbB~DLLvzjW@O6vW`Vt0uQcmdNcX#>)ds1J#4`Y z*F{H9du68M>;G$gZ0_#+E8Xt$$ACy+emug*ALIoQV|yfR^!9WzO}&!S3POesBB(}i zYXC2B>r?5Y8PEy#goM{J-}F!|&{G)+ye+Wj*A2{mWxjdAj}>)vmr_?5r;QjgWSK;i z!Z%HMat3~x!cX#=<%fO7Mx^ZVZKOsq)xSeA-v56+x!ionDNZ`v}Y>^549Q%6UBYVyjrCtCw90oSPf+s24- zI5IM61$LL_Cs3h|XF+yNOL#Lq7Ij`&c=&ll`rM;o=}9LdY9QUmK8;wpJ*e<9=*&JV z#+%((P>HZ3TA?W!{O-kUEtxy|GjBJB?pgosep&9g#j|aaR@h=P$v1{ z6zVmAitzV~=ShhvY0`=pI}0L)Gf@Yl=D{(i@}7Q9yPbI)Nmo;eklWZWA?nJ6`wXuF zsS}t^U4tgPzszw)n;}E6F$cn^RHu#fEI9M^<}!S~_%mbgIMiol6B{#SMj$?tw9=^u zBey!<2k8>)PLp7^Kj;~abzgOljvh5Ck@m-~bi$SC6eyKZ`5N@XQ4p1mJG%~Z_i9BK zsbn$ip_koNi-8OP$f64zy6MwF9M6PBb^!B2t9AXl5mj8JR*TJnX)l(Z-6&9?4lKyq z&5rG}0^T-4$-=+fU-m-C_-#B_mk})Amn73BqB;Ur5$(O2f-5NbTxN{lB)`DqZqnCQ z>4h0};0r*B^X6Ax%p&(#AIPXmFUi6uD&S`p{+w6Np56R^?_I#UuNDkWKkV_H)X|W> zrwA(XSQC3nic5Xg2sgl_N-uU3W5mgP`UbgAT|RmK!Z)zZkwndex;ro6>zkX6J2t=gqzIm0;_DW)qOQue58xXhaMOGf<<+{4y) z4<#pS=l#sUM_@ChdyQ}}XQR>lPM97Z8LNy%v_{Bdw8kJJsn#ngdG7nEkn|>LgW4dk z-{^(+aZUDn%Yu^5ouIf+paF$mQH%u(9xq0+%Zq{M@hqHOIjvDtS3L* z?1r}S5*tPel4ti3BYcv3V#`BWTOgtM2!t3X(fYb(Ap4XePUw)Y5OA13+*j5ajEp>dD-^-O z$@tD*?GhbJ^{cC@J|jwiwR>K`EEGM6|9g9tQ~!zD5g8GC#!~p8cVmcoQ=US>B+oko z$s{9adVGJ^XQ$WAt5>VUlxHUKSmJmwEgz_))_d?KFRcv$2idN_|C)M?iLtM)jJ61? z$&9S(NBDQar^nHU?dC%lAj^66fK zU5h}xRjZbF=lscZNb=M75= zawM1d*F|4Cs>s})gjq>L2P(qFPTbBmjFW3O`>XW}vwZD0ea4687{6KjGmC1qj5;6n zt2){W8Fj8G6dKEE`?4Q7vZIR*mI!;;>_(J@ODXkGajrydUjUucpCIq->}*l!vP+Lc zQJt8ae35N^d8Qv_n3%RDrith2+?_jGe5LMJx1IzkHX%O;@^n6f(nYw;(f53LqcLaE zVFu{pTHW{qBoCs|S^rHKI4F0Z+PdHr%5I z0x2GQ6@|JMJ(GmyeFr$gE7E3odicg^_*CmD2)Q(_iUJ)Cn&PzQqu>tgfy*<4B!Jb$ zMI(Lc1B2u<+E6j56w-of*W#F7?%p1|TVu&D6(`Xre)~*1UHDD= zTm5h94C!x|^Gp4^xHnhOoV`EtUG>jG@r2D-cJr<>`-_AD%h!uDRyVE9h9$W|UH!-j z3I%}#Kd*g5d&KMP=!(F>Tg+6>MtP0*>$CmWK2!Ygrk*;)KC9F9x;1m$HQ3B=`;=}! zNCiPi#u7p`3sXl6tg?GIy5}bj>&!EzJP*mKIdrl_n(p7ff6T{WBpW@wl3c%7)Uu*N zLoczfso(vfsFsAcA}%?#VrZ|OL=;Fc)X5F(HX&NBZCY|MiRFylH31Da^3&ucaZ{SH z$h%8q3^Yq&+9OIj5!lNlc&PbS=j7Sg_zC)bj3}aeC8d%EHg}{$3CM z`L`rB+@#|V_kBX2Y*nwzy@@xPlNHylV(t)K1PGQ>E^h1!dduvk0G~mz`X!?YMhu>h)GC4aWr|DD%aZ2q9rf*z}FwqQc`A)aMyE5r4z^8v~YzgFDU3?g(*Tzeu zJpEMJrZFIJDVyFO9bhkRJm?XRsmH30F4TMi?KJc%q?e?>CM+nRLT%@x75Ha>Da}I$ zUW0enEpD|c+p0L_Hl_XV!$<+q-%?q%9dpv%eJ+*~nP4Rk0-d#C>gXqPi$H%RTMFQu zk>1t9YEo<(ig6L)gQS4ra*-@hVy&}n1Nd1{TbUF0CKwhnvWHo%u* zh(wG>7ol4X-oda+A^@0rPwJL2yc;w#+ZI*mdL{Qw{o}W1k=q|HMz$}#AO(b-T`B|0 zs`R2IqOdtug*}|O9L;oGK8E~%5pk2Kd&9zpZr(TT)!ZTktTl`O>#BlHdp+*=j`#xNqavVyn&lIgS ze;|*mWpG|>0o_NJ-$4+g%y@ZSSJ^ixV2zG>6~*$V%Dwx=!Fvad_idxK(oWJlx9OA- z`yh2Gnx9&fn}|oJ>?|G9cJZv0sgW6uf#oh?4+W1YT@lYUY-SVe-9rX<-U`gTu(YAgr|MW!0EK#2_&4N7 z?!<0^u&YbROkx{2%m_}_smPon59wnhTiv9~`3t9Xz5K>(x3}kjxJ0SCcE^s0AD@0y zG?&~bxXS{U`_v>711C|(=Q}=94zs>wF2|Nm)0-)0&z(~N@J5jvJ~%%q&V4V!y;>7d zGAc2aLuNfHi(r6B1kH?cmaW#)%d4uCcqJ<8oAmB&NW>FglfP5kjD2y6{rvoc2fDmn zy*10w8LhHjx0b`bMNn&tVSi}>HV!NyS){RSxnmZ*Xn>4hH=x94Z2cw7s5M~RDxFzB zbc1rf&^4aFd9$8)(!aWpT2LG0S(-UT@8sywxZK=N%xxEJQv0mmgI}u4xfb}%S`kT9 zD?C*wbwbJ_IMJcUR^tw%brF#O!pacPXqj8Q@w1#ac=QTpK0_oeYMqVl67V2tUw*sX zkVlA0hY1;01%HsUh!^~|K4n5vOZ9v7c$`ISq5CP1a>EmxyH)3B ze{wys<|T;d1t5@jBxLG#Jn7aB%u-C{*l@jHk%yQ(=0HWgLdmU0sw%OHP>s7WOTMCU zfnJuGh+D99biL@dN=rlb$uc$InPzxREanhwnXzre{-6n&I$nRgt<0WEar>u##9r$E zptZ5xuugaDdR>2~{iC0*uTQ(^wRq&;K|v8@m{xjlgoQ-0%A90+SDmifdrZP#4A-gr zJ~kP%#os?~dfd*}n8uBy+TUMv(D8E22((Wg06;T8y-voKF~nmzx{e-wgYdmQjdrYc zk3wHwuyt~@Id3#&ZZJ`Y>mlOs_~~@5li}VC*urW6$13=1ou;Z@$xS6FQ9}MSS6lvSPnjbicc54yJ=7cUNmV(`X!m36D~-Kz0!ZzB@wLRMI5DF3>F=EVT>XY&VteSwv$D75Gk zo|1uDEWf7}!47uR2)Efy`w+S5Yr;qDcZ?x=mFvTdZ-dgS{I=f+GrZFV?s78C2aGAW z;-7!t++nP$Mgd7VKR=-a2tA;HLcLv|GPm+&`?K}#B-M81Te2bp#JuwdJHC$DxZv0e z<08^5=-mcmKb=9JDXzRz&qFTGnZ;j-uanTT!ltNAqv#h{iswnVmW7@tL7*mpVhnzQE+e32hHp_KEg`(lfHSRM3b<+P6^Z=PTD6nxTE8SMx=ZU z=XVj;P(LH1XnK5K0}ZJpgBYLJu1N#0WE(DYs#wrAHhXZ_xZ$cVZ^F#?bmD@!Ndmki zjHbP%rq^%PDsj2t_=vROto&0vSmW^S4V^T8{8A)Bh)i`_nP#{zBqQ+dYvN(G`rU2K zwSD)zD+?K~K-v3}k|plnOPwy=zpsOP%JkOc%*wl)Jmx1lbJ*f0A#>@(`>a5N zwqoewr9nUAR~m6#godq18;`Ul7+af+QD^CR=n7SspI(=GrE)tQGQb|DLuRm+Fgrol zpjmGCDRQ|&>n%xhh1Jc3yO*c*cIW(0GSj?cy$tup8NQz8flqsgIPSpDpuGR`kEM?_ zMLa<1Re-j4KT32A&{+uX3>@AYg| ztn{dK#{mNZ-}U1hqjm?*uaCBG-^Dq2WhLkyghT5p8qw8g#0zloIND5*4;gc19`h3V ziHjP~a~QXwiXv%cq8$K}*o7pVR%|I08mY(iC19KaUs0&o8wx^+E5eqLKDrP)%y*(S zq{+qnSe;$7KjwUp$P#2uafE}wpxQFdLXKi~hJ6>sSh+FNpT1hWo`51l>Td<1w#d3> z*o|$v;0zC!L@XgwqLZwOAzle)8kLOg;J8&UBEm;ucl-P*Zq4Cw=c*)+Ii-gM)wH&T=VOK~J8y2K4F+O%2#&|QxKEYjY4PJL*)%e7<1{U_05 zLId}2FFZPp9Yp->oK+#eh;ds4Tm-Gk-~d=dwxAp5!gq!2_p^M0mnTHt6Qb}JHiP?d zg9CI+SELXbFSAXl`XvwEi^7i)v)-=TX^Z=g8y6F8FoExMt+Q<{d<-d%OOY4Sbl1Rm zHUDA_h25xYnh8#z-!5xJUO46Nw}#7d?e-vBI3<;LMrD*x0y>a79*V|YW@t+2xBZL0rb-Yz+qj(fK1KQ#JU^-i`vPk(Ga0m*+1MKX;RJyjBJ`q|9*+$!WWnS;U^hcJjEw0*NP$5?Aq4$qD%w9jLpt{A!yqsIjdBI3z zbLNjrRz4<}iyVj>i!vDfg7BI~(8Q1~yzFL4 zn?DH8X0y0BsKcphbfKQ#06sf??fg2fIKcaaz-dzxS93+yZ+oWtg)||t^qv1P_Qc%C z_a8nWEg&i$>bMa4ix~U(l)8dDRq~!AkQg}b=)4ZX2y0}oB(!TiRAPRQUN|_R9q=xH z6=clL4*ao{PjUxt(Mdw%Xfk6TGb^tz05F_JNb$96^nDnblOnA;bwU`yo6&0;gj!D} zh9M+wt-is0T|u6Oe(`SN^PKqDdvS04CnWc%47>@g*XPQ}>8JWiuTLG(H7mcVriLJu z^YKS62hRQ|GX~h2FGz4HV3@-;OEoG6z5GHPD@v<&Cnq!e4g?;snKQ;QX)&as(tSj$ z!|fS!2s^@@pDG}C^O=7wqnXg%K0~IVy+;RZaSNGsm3}`l612&k{n6f7dlRr8+jZ~%&JdYPNF*g>h$K@;DpW!uQlpZ{bcewDe0Z*Y` zm{*vbkkII(%b$6hgzqw()}{hp!n#RhHcXwm=SJ&tZmLzW`SW+00UJ{^Chv>**3NVV z%n&eJ!|!kp<)%;1m%To@W@zH#o0S%8RKN|oztvJJV~Y@t6fdv$X-I6%ky&W@H3bU) z2KA2I1H14s)yj_0ghgJ&5%<#DuU10hwqs#j4R}?Lj*BkPCfNhP&vi$Pn(p;fzzgXz z^R5PnBk&q*;C6cdT*M`LgCD3IAKda>mv^z<=5I^%OUd}CoFfh{A?Xl1c=%@~(^-(I zBSB!re3&g+s8eD0?a8b9=vg}$IZg#L&TNLaH;Ip9D0Je&g_+JC6Zi_%TmAf)g&9cn zp6^_iNGFy(y=3!rnd1*O$Z*~bc?m(&G02Z&RgVv@oYi_l{;v3HuNwdTUEX$AL%Z-N zwVALzF?$8!Mi?nho0iSBFy{wsstb{TED``i`6b=BCJvFnyz0c=o6LJ06Q2#^vBx@# zR05kCd5N^=ocKY5)k+jb$#Z7z)YR48vu*o!ISFfkOorZxH;$GMO^p2D?vS!$+XG*U zza|$)oE9k<*eZ!0w)ftx*XQvf)2cMxdBkx|mD7CO&aI-S+0k}krgVe(j@rIEof2Z` z1cBlNCc$!(+EmYnE8WT6S~@&JFDKzCeOqX4#EoV1=Wi6rJn+!pg8Tq0@&i$W2D_%u znB(D`Z4Z@$D0y_ua5e z`xxh0+gw@>#(tb@g}bHg;(TxfVA zD#{SL1Dc6go#GAsK8<3uBvk(q6Ax{H6e(9JGKP7AQNTwKCy;Q43fgVu ztXZ>erKkHcu$chkuv`7?kV5QS=2$vl5v(hmA%)t?6S14ne%oM7L(OgCJX4TzIanAo zsDoMw>~KP`u4%8N8`mZo=hA*OFrY=y<*0+m5`m&i^IlQr{^DGpOL5(5YGhhF&UNpq zZn^#jQ4jj&2Zv66mDP6sw#D!*PEo9x@7KPP8QN4a9^5qJ@~%^xUWj&KTVk{NtdM{I zf6h8;%xOzUH1_Y;Wz_njCC>Q~i_O$;DAf#ioFW|eC~xKI(Gc*Ron07v;)DS>I9SrV zLq}pGMf#b1x3Ri4>y<@v7?tAHpRIAKwzIRF;D|@7EQpeoP2=Pwb`RkMhO{seRG&;d7+o^M-k39$Bz$jo3>(Bu6`3V7ij=3Ss|M(YzqK& zVH>ClD!E}05Itk)`_2#a7tWtQ{{p7bf`(AARz^idMV#}zf_)|&yQWlA<51;|qlynL zL1_%eF1btAw8uRVXy(k5!k9l=1v`zJuos(No^bK*N&1t6bIPg8ur?2x=p1>z9M+LB zA_3f;dfvS^{Xk5Nb8&-3+Y+1K3-%Y1FIaf!6jO(-$%#s=pRx#pZD#*NhCO#0{+jTG z5K!|8>l=Y&dR7Do`%WPohOp%AG0dR&IJp8Zs>a4)|tqkLZT*WeXwf* z34UDv+wY&PL}=MaQM$tZsjF{>hwDb{+tBCiI(V??+1co*s5TutZiYP8ES|AR?+2&= ztYQ`X{p}ZOxA6)GXkoT}bY)B#iI=ahfoH@Q5NZa2Ss6nj#mAoZ1 z%e3teWHItX#?O?+!2{-#ty8Dp9D`3dBFQa4qlqQE5ul-P@KnEwjhUa&>(JYZyh~1S zP$JS@c2Lg_db{7l!vinwRz(-qp1G2)1cpHPu53Q{cC_mvTj#q9uhII$k}~PHudTe` zT7g+*{hUw~b-K}6P*^U9!-`hmW<*Wn~jEH|kFLWNeHTZzC@Og+b`Y zL9NYvX1$0;d}3#wJ32+!`q2l#!7}k1K5*b}b|LR1utfIw?ab`F%W#B?L@zI*5BQeq zbkGe9@JQ)$XvEq8kz7EYYFAdC;0hS5Xu)g3A{)bD-b2y_bUw6Wqn`tt#8vZW!L#Eo zeBP2bSlAa!>|JJ&7eYb|{K!3>0xY6^-VMxf!J@V{Y8I!6*YtN&^Fk_-)?d%Q>0a5JH7QR!-|Lv?`WN7=(4jaktHW*k77TQx$?( zR?B}te^VaythI_>*wob1r!5`k^FB866094nig^3=o5oyam(0fdQxaw6&9RRwL6vi|MM@BX6b9>Cj)E|Ce3e_DW`q z+fhV46RZOiBCrlNb1X}30zZ`J#T>AB3TT8{tM{QN)Xcc0j$sMA?D&oWhjh4az;xTP z#^vj4%7!pl*l<{5X?Q*j!=88fT^eaGEgCAd>0-C|*u&X<+o#b~u*Pgk&!?nBU8s0o zS6hS4-wE3dNq=cPl@t2Izp*>glEZ!Ok|jmYs<*`_jqCsOYQu&Ng&~sQ5{k?jYMD(u z1N`w$#2jG|0D#olW!Eh;;J-ZkW8oleeZFsU4z4`!Ot;zHT_&Ip+ zpzft*_V&5+(lXo0ZFjq;b;DZA{hSfTC;w@L(dr4`fnnlh7`;(MJtUEUQAn z$&r3)40C~mraQvum}EWnhtNOwT6q0X7Dd^hycMff8G$bd%0&3*|42o6FtSN?0`3x^ ztCLEd@FTJ*T)upHW=)HB!8>Mr8r}_D^J4kV0eLqbcx=kwuOCLm)2wzV?hpQF9A^8}#UCCl$pZT6vs5rPy^HHi>=h8x27seu77;8a*G74ql1Kv3@^NxxoI~OR2pdeBTl4#ZT>AEj1 zrMdVlX%8GYCFT5P4gm~TU*A8pmHKHOf?)yAQmba6jS+6RR8Gd&$_sJ=3{%n3(vmT^ ziTQX|i-DT3b;Cyjnu0j*#gMOYd}tl0MTfKe+8gK= zQN@p8r|6p`!Ia=(46eQUb}mFt$qO%m(38IrkdO9`N1z7a4meH8@DlSPcoTMvYj57W z*H~iOfgEpUnd@{>3DQvmnrZH-rH;G$z73?4huHLpWpv@lfdgCFAO$ziU4P{bYbQ18 zD*x19b=9sTABOltG@$_~y#8I_#aYSA<}7)1I()|0fj9@E@hzrt%v^l_AM+)Lh?~~) z@d17R_uY%2^K5`PDf5|HMvSO={zglL2P zPt3JM%l{VL+x^1Uorktz%#h_|zAZk_rv{%tF(Wcp{g2E9(PgF zi3LTme=o@~?kany;3>w`+~WRFs7wj1Jm~0n6?H=(Y^*8M+%tsZ zAKmq?prA+3s#>;-jwL-o_=eF8lw2$;cw>-XOY2gMtybBK4@p`tMz=IqEhtm5B;koE z`^n@gM3@uTG*0QeckWwjSG%Q4cfgw|z4$mq{3IU9B_n$P^f~Tpez)l2A05Ey7stO+ z3_hxLyj*bF5WV?BB!?$9tejNkdHkcigTD z)z_y6UR_N#2$U)LtlbN;Vq#(<5yBZ8!$_RK9o0oIXE);$XK4ci(Lc+NoF$adaOMTM zO(>x~lJl$+LHp?V#=sgeEMf;IjYUJ4G%v=l0hU3JC2uGU;de#g*ab$>hW|ufa;Kbo z3*ue@3kr+k#vMC#YF-#Q9DXH6tsy5*_SFNCl?j187F1K)Wmx2)%d7A1A7EBV zE}l;ry;T#5rPE_?U z`ImTpruC>{!#dJV`O+pp_nK>G7pmA=`oXxPvWpX(J-7wYrxVuxvDs>Le4C?5=!wED z?H4SFJft$Su&WPajRukk;@W|2s(y)pB*3YGug)p2p)HIacjj=QrO0YE;GgilG%wc)|B5xMjBxxIf9^9 zjlZWLJaJPK=*BqJy9oexn6P$0$U^?be_ysUdV;5k({`&)V^Tx@hn3aOiT|C-O3~@D ze%N2gn%{U2L)%rU0i|rl7h&03?ftES5BguKt+IuY-}YY6z;T+4OghSRb#f|QsPatm zVxJSXiMl8zu{bzRA<#B!cdNCGwL}WsyPqh_)%X`>?YR=|)fWBQiYce5I~m3@T0V|* z%Va2>0vF;;gGN3Xof%9i3v=^rnKM#x%7juLin(xrRIgMgxbt(qo(35krXPVJIu=!v4Y;I zI;#CUz!An$ixpo(iHyYGL6qR3eE~^n1E*Gn3a-@iW&VRw^Y;4-CK(HOlR)sODifW7SKbWfY&+|khRjR3cVVt_%i@`=Y2RqP!q zTfWoQML%6I+qqY0UYRFxx?{mez~@^k$`90yw?6sF_r*!q7c1iLY0y64p=7`@D4<7H zS$d{guf?~9KdV>gEc7@rvf_LsK}a9jgN}hWvG+}N@Bf=$)BlgUAvfeA%bt7Zw)nQ< zOj(C-!-qN*b@Bu)@%BzDT>A&x8U^ zXEb7Jn?J4lzV7eq+=9~jMnU)W_W4zU9FaKwpnt*P!9o7?3Zlw2^3CdcPoOK=qGaCW-g@7^0&!tEvo`b_-$qGq+AJdFj!~(&FH0^Tmgzc* zak2YO(?gT=zc+%%tvz_~CU!271O<6)NaO^MIiAu`#I8`w@}5^FFFr7UrCk`x^~_fzW|fL)^0h=Q;OtE)nsWwsAXU3$x=J zP73@ZXt1*~y>O?>@I`p})w^G)_DmYX>gaM&LufO?AU?L85#hxq&ySUzqdT?q=vvrLFC?u0oAC#RA#xiR1sjtK81Z?)qP= z+y)O_?-LQb(UpM|SK0&$zTrWL0~@CHcFs=Bc6kq9xaof+=_;{N{rO)JYPpf|{~$~l z{!w}Tp~XKTg41JXZa@Nr$bp5k74{#CIFxsY@Uwkpod6e!qx99jGv-%8>9Qj{@rCM* zq|vTNo)3y>Ej)FE(&&fx-<3u|asN;nl{o)PrBRCBUzJ9~|E@H8l$Y=!PdR$<|6AB^ zuXXADlv&fuW?UF_5nkn9_YBijGow?S+jr`s5h%oKAWzA{t)Q&=`|mi*}C~kgNyM(}fbgwzz<}fa~e$ z9D%J1slRuj+mn}fE;>tw0^N#tH9Z7L1O|{fj4LXPKJeoxZjUD9Zpgk8`DhI%{Q-6s z1!=Ewgf$r(nvigcoBXJ+OY_U6r~h1)uJgZRufzP$9t=Ri$wSU`PH?f!1Lsx9TN-&m z;M`kv%=$Kg1l#-$AI@i`gu9cc6+XdvfaCC_6ai=TiwU((cO=fiW}oLd)Qd796jjYX z30m^wxE?VB)U;-$>=C>?Q3X`!xMt$Dyh->E!ry*~why6-poshe6Tvyw5z^xJ^_fzIa6Cn1f%@}Osp5*h%JDr+4*f&&+E~|*k@5VS9`puX3M*B?_NvBI{6QG97VF{BU!j4XzG)r|~ zl9H>~K86k*dctEF5Q^K++OP7sSb>I`&+mj&gQ4vfH`k7hatl_dS{5GLryuq&SFZnz%9wXvAdFxX(-(YyU!@RjNbf6^jhcur8Z<=9lIaZ& z_w$UM$kof7SpRnLzKANd#mC~D!b41SsZ`Bgp)El9;^cJk#);+#P`2k={Zl2&$0J*V6S3TM!Kdv4c^k%!t~{8tNh|%Hd3v z>J<1W3=89Oci@01?9eDqivb%Q*TnbMEZ>IzUR3-JlC$V8trTX%z2bRBtr&j238ogu zE%Np+d*3qguUO-DM_bkWsH*rr<=&99k0x+yI!j*3$;q?l=lY-{yD>vgz)r&21yeSd zUZa?kh9^DY%=1nv=r+;B+2Zjcx9ufH94E&zhp7M0HBz&`slEO$F-hHj#w4e1Y3_LV zx@cr4SI9m5HyWuqWB;>8>VwE9{y%A?%;J-bRgukiM-kOTQ@7IQ!N@9vY$8Z(n4Vtm z%5GZLr@RCeJT&$Cqenr~iHcPG+}cW{p)9f32BRjF|GI$zdyh>9t=_5IgVfZ`Oie?F zJY6?M>Bnb+%S5Uwbhi@;L>nwLNfn#c>HDOy?44HiT{jAQ#0)<-URaSUYvjJzi<1lzTNrY@$je$h(}9b@A2-q8Dt0$i9Y zP^V|&swga4MJgqO`J+r2gb~vBnws5^h>=W)z{|b$#zmr?A2sR-pWkcn;6MhaeRCr{ zTG{IaWuG_;Kx+xH$K%^`U&9&TF<3;Mcz^61m0Z@Ac72*kK!w#Tw-R=8IABn{SLw;uZj6DBC%s4+PIl9H8s^HmUuVTPBGYK{)K*YIiz0tmer6)7P#U zcOJIVSgHH*tu(Bn_@%=zobh*IR$PX5%S|9^q$f>3`{416YC%nXCT+mhM^q*&l0K zrjtsnn#HmHwtJFx`JHri%$JMoKI*;gKp<0SPW7ZZghxJ%Fzui+xGzqfbVR>t>())A z*|8UV{(_-y0@2K~O(i-9ugP{~-W>Z}a~?Lu;OYBi?HnDqz?X;H?vfeXR^bm3s0e5C zjeXX{O5nlKx0d%aGp8gkX^>*}cY}Ie! z)1AWTuWP@46Tkfgz0zH~BAN9r0<@S{Th-J-Aro;j4BalLr5!V^nddp`$IaNX#k;)2 z_SZy5(*7cD%jtW^{yVi(TwuLtu-><9U z4ohAi0t);WPWYR=4UXE=gXb4N2>#NU>7B0Qjgn0yX6*mf799A|-JozSlzYjY1@&^A z*R}@{CMHEYb62yK@j?g>Nk+kx(HmhEu}Br#wk1?+3x%FYx-qPUVh@j4L^KKN8+>5+ zW$m8VVkx$y=&U?LOlyK-QTqK!48!6Jl{@~;a6f<6BxqXmu#QG?eFI*&@Rpp3e$UvO zSF7)g(~Z!BpJfLVJa+U#2(Aw5xi*t@4>$DTFvJ!8Ds*Pd6mC!ucIuouxY~LR>)hxp z6vNqnlnn|shpP@u(6m{ztC&g{7=I(@a{$g4L-q6oQAiN|frXh%`S|>NH@x-la(?2# zkwPSJ=T7vM%12M{{9N?mN!rn2mOFbEK9lLBNjsx$`?k-)Cqt94>OQz{j$wPnJ7qLsh8k^}HkCw>xeJgF ze6~2jw5zDBJh$?5?1q<}IoCv>7@{o`$wAj;$n0k!?2y%Iwsa8Kqe|`Jb`Bn-L*wiJ!p*~*@A6*IAhI8%X z;EWAx^)g%boIa9(JDCt9P7{2uYMN@vMY53PK+@!zQ7A*a_X_G7z;toUFrM}$yjpL6-Kt1u=pQjPSHT5!A-+i(dxif^(f4nn7 zOKXDT&+2OT*d6ttJz&5Tx0V`jx|*i&fdH$w;ELMaMXD3Q_Fmq7hVSuLNrAV{oMG7e zvfmh#4GZosMhS0uq!Z&_ieGyNhnvn$eFV~?AR)2XwRY0vVe!^|&&bLj>-czpnh;Rd zb6#~-njO_qC1~vGI|4nXw{;D&^stBp2kFW(- z)^t)*>WYFqq6Or~S`Bl{%r4Ll?5< ze3Vwe=XLt3u(-~y{StB2!(-jLmzPGd!Xkg}4u1U+FWkWM!6)oXN|Ta4xs4EjM_8C~ z`q!?^5YjMpo?kG<53LUtziY)wX`s2c26J`IoM5$zYL<% z7+lI6+p6YdyDhOBUk>ZGR!e77Nz=jaZJQ@v^3C6+ABHGoRqasL6`lpR9zQ%CjHjFiB2`bQ=n(Vrm9HR%2t7%((EhS#2$_sE2ByfL?F-~p{nmmF7xW{26T=^gP}(>xZJW0&gqbsrv41RP}=oZWeo&sS?FU(=?twPNCyGN%V*DsS2H~{ zY{J-Fx4YeR#YbL9TNj zl~%Ib&!dOOuw~W0E{jNwMf!Y2u+}K=~P$B9^olL_1t^!AD>^! z!S(jR!MWd-ZCMM&o11mZ+c;+Ip<938xElS+8Yo9{NiNQ1x+^$(*4F!rvNj#EqFAKV zg>aet{e;&Dr$h6N)b6J^Hr(R z+O}xXLMW{+R24V{xAL9bz)5XDi(|}TE3dryGNZZa)>Gcsw71aof0 z<$O8Q^DfctEt&E}Oga*qR4r8Ed`fhTzSWCDFeR_l9?cVx_dvZ7AVZRy(x%0o#+wv` z7itJ>Pbjlkz`?D?^s_1^NJq*%s3;SH?&wNB64ff)6VlSS^OLQty0<+7I0MmE zu;J0V2x}75A9PeF;QnHGTK)CIPULPg&o18({Q=LB*E}pRffs z8A%1Z9$n&nFlYA_LjhxBIQPX1V|qBwjwMQQGmG{5Ue*c})1Cr>7&3f_jh0o+l3{Cs zcg|Haykx58PsoBy2vxfny|FRX`xWUh~M?uaW*_wMf7Nxn;$C!Nisy~DWPYxCmGJ>bd( z=neTxwNjdMymj(P1WZS1FJCWZ~n6RY!6>xhIwfCa`Kw&Ur; zhbKOERvK&TlJEVpxY!6>K1(e8+?98hqH5}@-kBWp%X6YV-Pf*_k;E8XI*ro;{fwlD z(?ZtD%X7xhOHSO*fs9F=+pRjY$sO0R3`@~^JTEEP%u6|sN>>2?w<|?OKy5AT z`ULqO7e-04?Y+V7uzH?v*sRzDJ<=<4HGtNqbE&jeR+B8$d zM(gPg;3;H4M$}X5zrX5$Rf#O?_2p6@P-I2n-J)OjZ9aY@UVV~!T3))Kl zfq}9iYahBnju6L2*%{bw^it~J=Fit^x5!!1S8Z{JM3=ctx#sh}xD{_75|(6ZZT$>z zlDWXZ|FRI^W?jlRB3Kv;XXeJWI6kfK*4 zx7~*o1kQJJ!N{cG{BbWnxuKrC4EV7eRTgg1Goum#yS#Da6j5KS;K}Jb|FqlR-r6v` zpW}?yi-o4_+ebB+>M|1WIKz;koYx>C!m+4wY>W})1JPgNt)m*;%EwOc~XyKamrO$@lGSqPbtDFUY{eT#G6=i;q(*Pt^FoDrNnuh z8>f8dDQ(J{As%U+QWEn^16m;+S}A0ujth-&_7}8-JUmb`{NAXXrhsAJi>ek3Kjh}^0lh?^Q38w|YiXa6ywZM^p5A~30sFK@N|@iq150~gH}#}xU6 z%{iF&EVQ@3Hnz_I8y^nLs|pIobRo6_Dm&=4*fd$07luC{yO@UPdHeqMO3s%R0#@6} zZJr!VH9X#A+cZ1zb-k}?-up$Mw!Cw7p!phpWh4C~843Y`bNNpTa4K%C&d?z+!pKgE zW4k(`2|t?6anhR4;ts`JUHBufOJB7CW@K)qfo8z)jVZBE8oQWV*qZ-fFBHBr-q#$& zT@XKOCMeca@9+b z%WDteG`jv`PPGrH64xk46DE>=ILO84_FD2Vx&F_CIB$i83!zKmgBEvi`h7vQHBWzT z3Jq1eRQ;}x_@uIVS{h|nxP7MyH^gkF4JEl)#|77A2RZN+_P3JbSjLi3U_RmpoIx&G zE91F&E;p$@;Vj;?F*Q$4U;0RV<^8Rmv$}arMMNKOr;}diO_Tj-5XEg$8I0|ilCrY; zfB~Y)-)8te@Q}FNl2bG#LR!eXX<%fuF(S=Q=^SsM_?bheQP+&X8f=bdZKC+@fB%bl zNaK1;Wf0-6QDO-FvG^`J z4>gC^fBE*b-QVC^?K*HETHMEGzi(IKeiAexL+>Kny#CKijp{GTk;>x}#%lAJJ)w@s zb{X0tZGesrEQ+yHrtIc33&brQ%yu$*{`_u&yTwm$n$Pl*-X|SuFP_{1j4Cd}DAXE% z#YL1;5=+60r4U2awu6yG2npldqZVGNHYO)kBWvdKGtr#$SBXUAO)5?TlgGa4RR2a} zyK&C_`Wj-d#EO7S;BCA&!h#kVM>95csP~Ofj#eF1I3_RFrpJUPmmP-C7(=Xl4pC2% zy6kL%8~{rIT&l;H;ePt9qM?0VRg0D_WxOUxCmUNg-&~?Na^y&e@vZU5l_Yic#EnI2 zNfa*Y3Z4&WQBir|XZgakOXo+i3MLALk9FUrt5gx3wNTQ2)@#f)ZBJghKg7BThOW%u zz>cH#t4Eie={DoG-8ki4|BQ0g_4I6>_rI`VgAC3A;m146r|DACiXS_1eN^42)=(L4 zI(HwWt9z=w!m$Cr-?K#U?(J9Sxbw`4N_-qYv?*(?p!~Tsb>vc4 z&-E~Ak@j{3TT;XE|KXqXkF-|LW|}g*en)>p2FXXa5fgl`B(OpX) z&G;UQdo`{zs$yz24^``|cIs)`%~*gcE}wf++4=*1hlF$$z`L+5yF?5Gq*8T6NVPJ0|;U&0mW1S&z?V* z;Y}3uab8baw{bvm{bruM{NO8;-c{+K{z^hXgO#0S+kKnu>IRD{cC^hiqJI0=atc~S znxkHk38D4=_YkWH^|M!*T1MrXW5Wi0yl>SSl__ts`G4k6>9d`tK_oYyj$U8EYT`p5Xbl5i`7vLdQ;D z)=uP^;ik6@^`t@9HaByT`v{)tF=(l1c-zCgYR%A7D9elVv991Pxy%qv@JN-El;*Nh zieeffNgc8Fv$yTMAiMpsquJZrxqJ>(kVy4cXxwrhNx7p@fz3-W8_CM$asAV6h=%i_vQNs*Bb;P0% zh?lU*aCg^3cTEOHn9ZQu_mzqsJ|s^?TU(OE@&=c$0Yd&S57~DT&Z^huk^y8p zuh(|P2-?N4COLy;BE$hg@_Xj^9c}YY*3C_azqM~7{OiG(Bw>33?lTZkG8Rg16xv3nHe(TWqNY8?Gm(U{R=^>pNK%|rVi(Y+wD*7KDaP>^)q?bpJNO)#`iwc z{cgvI(vlY+4saA)`u3tZY`Iw+h|Y7Jt=WpYoL_KU<>4ehJEcQ;+|qdKyGyq_$<$Y^ zivu={>#OGK$%fnFSdPXqr&ssRUUljJ>tFfy;w;hLHu3kVBK|4)eS+`(o?)z8N>Pvr z>(>|C^_iAnt4~V+)tJpZGe6%Kjt7U9FgN8Go`-hBa^NU23}!C&YsVMckszI}V~Q^^Z9uGao!s}#7XvGIosUs|yrRr6Q4D_Gj81SIaI1wQLcuCt&JNJ3wrvw)35 zPJ+z2s*s~YPLc`1AL7=Yde=x{NbM8<<6~OuMqbE1BbTd&S|Dcg{8?9&#LPOFHUH`R zI`IKvRdAJFmX?l}-X8h+qi1saJ;u(?f)X*s#wPgc{M&5fX@@>w2&z~<1pTwl;K4m4 zf}i@VS|R~WcTHXbcqkKs_9Cdbps+Bx<5S+G#hexzip|bBJH)?kC!YmqTXOEr;bTy; z`OMH%=m|raHr7`xq zigT6!?%l^ub-9(Tprv{ekM^q&E$o&o*+zSIYtMkegJmV~l#PWwX55&^I(T?))p7Ga zL^ijQL_(lXypYBTAP_=hf4J4H$4yt?iLJ>g@rJjtnSDWE zr$tG$?du?mi7^)wk8J|TJbAJO*iP^KxZ}s0;Ag>NiJDq2VCI1tBQ_$IET%*)T7B#8 zGp)9!;~{8X5epx`j8a z#&9ltC0mHegb8EVaCtxx74f6Kzif+5ufU_k0f&^tN-s8S% z(x38Kf9u^GHN|G3ad8`>ETits0b~jAR9E&yGe4d_Y)cV7j|3`931b zxlH~=LOYXk0qTk*dSQ+=b;mNX05Kn3Pjq{@>~y~5Xnf7Ns2)9f2=nI^IAjNnZl;CI z?m2j-uzP;uR@@R2tuU&)R~!S5CeosQ%^|knMIaK>dmouIzPh^F?aiSz7DPUP)~zf| zg*+`*jEdu9m!4%F5sDt|gN`3dNlCd^c-nl((X1|gySs+%uB5sW{@szI8ynwK`9{Rv zyVBCdjI>Z=&6)FbsfXn7?D7VoL;yN=fktd|cDY(dWo1jsE-DPuGGSgFux738(zaW# z3s#mS_yjs1k`oa3+`fDFW!+Eop`2AmA-(qAmYeb2kmdN+IG&?}grj@RROAD*p30C`} zUKP}s_p0u@dV0#>69P!bN&R?=EOPcq>?|_EFa$_^E*R9t5YSCB&l10&?oM1W! zIy-H~wUnUq=?VR|ZZ)D#fFc;TavSv+)7L+7N)Yq^#2_0d2ZzguCq)Lw(xGQyhjE`i zvC^MW8n3*=&9P(9^)Sh~)8P?o{{)qr^xVKN5P^^+;XL8kskakV1mixD5G zq~^`HuD-)>>a*=UZ{3vSwhuxtX6!kdq5j3CsgEH(HsCR1<@AF5m6et8{dh8X*)GnF zAD|HB74aHQ>77Mg`Rb3#cRrXlg|eg2&G?_sU`85me@g+l$q59GPUtEsrlQvaIOc?h zpfGZ!zEasTMMZcsbCNN(7iNJ#w$q{x5+rtYLpRDzsPM_Robe9p&Y(!lMJ2^GPoj6f++Yg7X7$&0n~g1hnw>p+RydyzUGc)ZNJqp=0%6)e zY0i8b(T3>J%(fpqHqEIYc(Y*cEMKugpm)nzIfILr%(`^U=13glXE-e4Fy&xdsTE(f zV;K5SF2!uS$sTm1xQh7ZCRM%YseYj{&sN7{`a8W3frno&+O=yZfL7>kIq~e#ikUs# z;xvh^!|U~%X*TN@^QG+YVr0AV@7P{zZPjSY_6~K?7ha`m;S$jp+OSR`u{unQZjD@) zBh2f$2n(zSKtpeJKL2W4Gr+)W++A_Hz=(SWKe}1QbRF}g$|VX>0c$P+gupn(#Mbd? zVE)-e_G*FGfD6%KHOwsf3}-4GN}#>$Vv~1_GXu^&n9gs9>L<$iz7O-JwNME!&rm;> z!eLB@>9eUicIr{Hp3xSX^>jrJp4^r18H{9cN6&U_!uE2jueX8ez1!>uxrfxE+VTS zv`oFUlxbK`&c^a}pnFW7yN<&RWJuGOoXtY7U+%`3HJoB=Lc}GO$Zq&L!-fv^r^~DS z@bm~feGk{A#>V7E9GLopQy~JYuN-EitUGw{3p7!)rlr2@ z5FH(vlGHZMWl@0dX$)_5JIftw5$LZM$-EFo!Ks9VYe0k#Y}U-0rNY>qy5~vg_kyYM z_+-*u$KKhQGa0Qe`&Mz?D2QNiu+~J~kBI02r*G=>mkFXZfxv@kw!xY;Uni<;&DsW` zmm1x*Fk?`+vSkNE+(EA8PP$yCx`o}hdNOUjz}_Y3ES6_nqN8375+e{XmkC;1m9miv z{8?J-QG0^7J-Bfr!l>JEo5N?=M(b#+1tD;z~KpSy0kFc_eO zw~8A7B;z8RpEZUv`P3XXHd45sG8zlLiPer4%OKTnJR?`D_(Mb=+cj zZ{kV@&>|9@^bC`Qq8d)Whi6xGV@nnJJ|Y&LH>KIKaBOz3WM;NuCt#bh&?|>VMLYk3 z9^v)8Wy9tV%^cC`D;2#wDp86R(X0QGWpmnHr|-jE!jFNDNWA9YzzHjjmsv7+KFA;6 zntC5_=%x6^yucL2EWJN+#2u{Wgzsb@Ej{20<@h;W;x{IZ*PZcT7ljk%JVI{!%bbU5 zP?(<3-wG}t{UdwF^0Ik)TX{h(sn1QkH7BBgF|VL(8{a##6pm;Xf+s(}6JULmg$@WC!G@5G z5Y#4Ra%gTgahEGcQik`vEK>S0;rlTeUF+^{$@O+v!;}W{%?eix-RP*>W0te(6~9I} z{~)Ww@MSv#UYQWUts_JlnhF+f(Ek1Ytj6gRpA7OpC{lrhdk_^Sp(Py$jt&3PRlR`1 zYsjjkqtovM-FqceUoy`EN9==__vQr}fh&R(|U$LhE{i+*n*s#u9zVq9Pl;Zj;$HT)-%OI|0Jdjsaog@hwO|v+dh8m{RH57L7PNQv) zUf1s(iC2Qsq*HjEx%Cg`)-Pgr*{jlp=;-RcOiJAAPh^0cL|Wa=3&&3!gmnn7WAA;_ zPH!y@nbW5hjndg)Zn|jMBj=}=R5<;NDg1;;8R9oBpifPI$l9QzSLg{&p@xNHcPuhe zPFhYKD_zF>|4!L5vH=CrY2q@jcIx!$$DktiPG9%&*=Xr9jY!YLi?0k1D zii3lL#XD>Mp=iL~>&2f!;xbrtn z&_4^do%mY3z?L5vEBK_@QsFh1@YmjFHlUZ$6U(-&#IjbwLe+>2l_oe^u@T)zi|OJ=<%}Kp}2CswD9i!tc5BxUyesY4YP)gKRggwv{mUR zrF*+Zd@PEaGpgmdtC|xwCO6-kx9g7rTG-dsE4WnHjl1y>ke7$*769@&>(aWQ!lzKZ z*jx|kdjt!!DJIyByr})h(JzSv_XY;IsD$8#P%XSv*@plLHlO%Ddr)26Us-v08Fvq# zf9e00m#1;ZyRCfpo;`O{)DtnJc|jJ=T_Z2*^{dWjP<%^ZhvC_k(}j~ykei<$e*rO! z6z#&-yh761D_xC^sj~OJ8^3$aeFeB37zl;gRT!!gsV?bP)Fh7El8Sh zNj5>)6COSo%RR%tQn>n{n-YHl|4w+BGU*%#khtc&aP{Hz5gZSIAMv}P-GZJuz!OexgF%d4ub5>j11qyhr94vGy@tI(2#Hk0jw7eF}Esqc`$1iOB7O% zpGX~|D`g=E)*r8|EX}@s8%Z2+hMJ1=08vD^oHQ4~4_Ec!N9(bT@qU$+4g%;D{+*aG zrAEZYvXvIK`3#aBa{9D_Fi#e2Ga<8O3b)d;TmcJ4nIjqL=vmG=GlzY%(3dMsr!ZWO z)~LJ|IiGN5p=5W|Uo}=m#0^kr_#~%twvWrLT^2lvf*t@kIO@4c!bZNbuorDxt0qRp z!qx=s(VCJKaL5|56|Unu_TGEv{{0)&)xz&G>6jiw~I zE?klET=U;!=ap=u6h2eeO)E_ydy3)8O^cJ)M>?H#Ar?;39QpFx@H4OlDbTTx=`nD= zj~*upQ#@skKWF{+T_^p6uW({yzlbkV(6&+v}i3xyo&i=`$JH=f2v%q|RCuE`p`Y^RF@S@$yKe zE;Gmula11T%(w^uc$K)Zxw+oVL#dR$=|Qc6$AY;ek-PWWyM~ctBtjY%&gIcw7UB8eIML4P(A9->p+zdZFj?1;#wy zX2C$K`Br28QS2^=t}-KfSq4JNk2bU;F=AkN*~Vm&Fnah!0dyO2*es@jRiIg>%gHF#etCe^Xxljrt#)>6(=@kB z+hd*c46`Tdo&RCHW)+f7POp)PuN3u+4$Ld-{a)Fjzxq}17;crJ-XlZy$sstwTq*w4 zrcFrk$KGY3z3E9k6$AV{#BNQ|ih%9-29HPLqif$4;Bp z9_^R_m6rYlaR<(ri=I|sO-vO8OR2mTRnKo_iHP#UY+cCCBNu4f@PiwHHKE^-j}R>v;yL;wE_r%9%_i5S6Vr3kjvAbkHLIjRT*39<91s7f%%G_1* z@h4q_yi^TKc08Un z-+8NvhB}wV+J5ok{=IwM8O+Bnh0I60a1_RF>_JE&Gi+_A(Bn}l?=t90uZyEv4u+y4 z@wgdmoDH;ZXCrZGF;Y(W0QN zE_w(2c@U;u+td>lojD4CH6qGChS3%JN)|v+6cH(8kS9;vb)o-RCc73$ROAPFK5C_; z?FD1@FFrz7%AO)@0jW9))~sG#I{w2ip~lr1nFqla=C8@OE)4ixI@)j7R6mLq$;Z>e zWPM#gZFi^c^729oF45W_zUtIoakQ5h3%>DQEPIz6?nGOpjqaxNnaSP|S(Xr@6kohKHY zV+@ZgaAW*gu29rlP`f^!H-dq!WO6Tk!S5>ZO&{iQu)DWI@OW!~Qh_6<(Z~FEDGKZA z=BT~`nouFiab?d_m0!N>F5t`i_ZfmxOuC%tlwYvj$ntQ;n=~X&oFQd_&p)~KZrRsP zuLm$U@&Xz~^CoYX7&Z{8Pi^EO?tMbsQB3}dzP%BME;$tS2zklZ3 z(o)d7f9o%(#5|{G+o}a;vCmN~OZ|NYA5Mx2)*g zZo2uV5?kL6%tR(}5H#`<>I#(C6*&54f;*d1ILS|DfObxQJ55J0lRNnLS)6HMFaA7O z=U=YuWXovZ0HO($=P|;;QRH1SZH`3HQg0y;dFj&O(r(T0N~JZi;CKNhUg2RMP?`!jzlyf7itmnp4*sgPH!x5^ zs)kO$k)I=@cf{Y%4^d7D%Y5p5<1I2>AxYbi#Gqx9;3w3}oFc}#MQTEM0%%iIC%EY| ztgSP_!Aq!KDsJ^W;?JES>1GPEU*Y!ybFYNF1vO^%Y(Yn17WD4l|2VAt*fZ<#cNC52 z9IO;&Lf~~xrnKW&_S+imYWOZTKB->8jGlt_zk?7c^Z&wnO;B9SCQUld*CuSEi%>B0 znLz597uJ3Wlbvi5aGeqmG1Ru(w{L6yQZU~w%lWJ`1%hD7+AQY>QM*L}Ga=gZ0 z5^WjJsLr-$x6LSQCirIdxMd&ad@-R{Xi~YS``=X$#x2K$)gWct(qXpShVI?8!gtTN zAg^Krkzt{+v90(nFu9PK~Y2m=!-22U2->n6t2B!{~P*7Lx=QQPY@4u(I2KB!p=?9 zaKw4^|60pbRt!_Y12&vL|Htti*Ih31F)ca`HqWusKJ+npf(eC!V`O@EwgLj8vVd1n zjT^`a1_X}KQ=Y4@Ih6HTSy)}8OVh> z1s4XH*Uk4%6n7$S93lnoHSerH-kl=ydl;_?9XE{367SRnhLG{oIAkA8Q{9;^`LG!>Y_6_t2D%^QZZvLeYM?<=$n#;#&#+{tc#D%>dH;Qbz9ppO5Z4z;p| z;Lom9BX{=o7e|Na@%l`UUH&0IH+L?zqu`g|KY&ce2QhK43wtr4X+nJ|#)sXy8I_#v zq^vBQ!kLL4*m|)tMIWIL4`K{HejFg5Zug0M1~l1KoqnyoFbW5aXLoA?Zi9MJFvS@i zG?0Aq4Fnkc>8 zVF8Q~qSdFmdq$KV9Oc;scAOy9En2*E_Vib-_EmNyaf%RO>NR6y#(Tm%$N2N2ORLHA zrAclx`Ac@;zm)pAxc)`zd-wj|q`nK1{@+S{dmm~dZ+dTA%-c$w8j@#-q^+hB8>fjg z8sz^!$fNUtvh$#;Y`mi}lou;dccug%g;4V_yB`o_lC zCpSxdmXn?yRp z<43}dB`HCT^|;j5RwNDhOa41|?!5cQmfNse5M@s-Ihe2^se2fE#<|oX+p4l2*{)`E zKaLrueEasYWU10bq`?h%UWdWlWkhs>ip<+3i<+uv$vwVgLuo|K`!hv#va+(g41pyT zRh5-c2V8w$XAGx6_ez~MX795vKdT4SQqNP1$qf2AK&_H9Vs}C6tFB%Y_zk5s&7=RW z>_v^{yvh^gBxs)=6M;J_Q@bwf@#Zf~xscp=D0AoL3)$Z2Idgh0dYauESj(3;<3Q-> zCU4&_n*t4vl}HH?5m7)PsmRP4&FVqb&4rrEcrX%vRPMM-)228U3Q zGkf^0ES`I7n*! zX&Up#^(bi$nET=#O==I8O;lv$WVe>@-@k7vA<6eHTnc}{`p#AP%K@=8j6bi?9LIJUpBdrh7*XD8aC^3}G;z-VGcdIfAF z@wvbpTQ3us!}3Wlns=W#J#r2d!$!qzT7E3qnIBKSCQUG_Ns576-g^nOWSC>Mdsk z%$WHj^O*5(UZ(D(vNPl)T)S~&rP0lNLb-X(b*O3w38cl znfx_%vHpVFiV|F$s7>9nS_$h72B#A%d@tbtAZ{t~y+z^aL5LvW&ws>ZH*#vfzm&ma zc8&BXsHjOINc;!cJl|+C1;{9#-Mgi3BW9oPzjkB8x^mo|SK$1xcWi3pJAfGcmal+< zPVM~_U5{u;+52ZHcFZ|U*?c;0S1UWYl3r@V(h_V_a|g|YN6<{#)8%u~AzFdC!r7yF z^W8!5h9a6pImnfg-JGELr7Iy`8Ur#_^n zW6w|MeGobj>V$Y?a*26`4bpl8)S)lgFM% zH?_$w%;C-l+uzZH3|Pifr8-`MSzD+OO{+i z&oxM8lVytDG}nxGAtnnJyqYqs)v<>(6dULipks^`zl;n2--a5GtrsjYkbIH$K(&5C zUORb3p6_l+=aghv_*n^TW{=dK;m1uIfN+r3vB8`MMKmG}k|ClbG*RZUl4MqB zARGX5@d#$`_ z!jm*}Fh{7n47Y1QP8z-huqe?OKD;w%h6vT7OrH9&jKP2i9+c8HTFc`nWrR-0i8y<956ts(%FE3>0RQ>8z8@ySBpny?ZlGLDPj;d!CDN%WOSdlF;!`g`4%TM>AB*o_zmE8PUZVH# zSNHsxwabs}vF#ggvrzNiwlmJ!x&7T$68f(QcHX`taNhhaXUa7C?AwC$c4TsPivNP8&EH zG^bN*1qDYR)l8}Rp2nJAeFB979EXvGL6>#7UOgoOfWhXHqN9~*XJ01s0A@}f9i8|LEV5YsMh;6rb{|>*5SA;xj~HKoK|ww1I6hhNrJp(>_=dg@ZD$SoZJl@np-xX zp0}r4d~=Vw+NmNw<77Z1D;<{iHqWGmNX)*^A)W*EVW?gu`8;MG8%%e2(y1cWl%<1e!y75ulA=e?aaM zt45l@vMt!OnBbZ*i*cI92GK~L!j?(a%e-lCs>8dlI&k#pseOeyy=Thi>>Ie>QcD@W ziNkOMU#sBul_wUplMEU%#D2tpa(x7qEtt}*>(wk%RBjWo7%G}yegnByt$`ff`{i*s zf8;bPs({qxk%06ZgqCv_vNBa@4P?03P*?jHPzLE&0#4w5IF{eZq_G#Kie$* z(UnKM@=Nzao5q(zhP_E?*VZ0=+ykafo>%-~f`Nv{8nJ&(uK9-Bh$dqu<#SPl;&0H& zJA5_c#lfr)OJpS_Dqt*>6Jfj3XOXL`F?cz!GEPobc%E8IUH~?HteCkvR@fT!fbApf z2m|q5dHVSA7?M0AA_$`E_i+I*MJylgu?2U+Km-mcc1nNIZb5oZx#`1!^Z7ZPKFuKp zOP|WZyj7MUUP}ctOpd;c08*sYp$-?OhRM+r9_HE2m@%OA9Agpa@_sfw?)UTI%t$bm z-<5rXKv0Rzs#UqhnZ=(pev^@j15-gHe(GjLhJw|xc72ClPYZ4THy2(yA2aLi$Z=GQ9QNTkpONgU;PC$ zuP6VHV8t{CX%Sf|T&;kQuim`5k1ySX+7^TKO^i%mzJ9$8+pkaW-r>CVkegp&soS6d z@~S!=FNtAyB^+Oy4b~eyjorCK&w+@9wJv9ga6S|-1L0N)|1E49skDM)EEYq+_QLIk zCdpCNRAXXCOa_u@ZpBOBQ1k!Zlw-5cwF@zUp_5pk-`oq|{wp1Cs2Bbj_ApaksxReO zP+rw)$KibmF+A-rSRB}jvi7cYO#cv|d4MNh?A7NjS`U`8GvUx3e(r%hbsO;gCy+*8@g`@oI>-P;K>ZuCtyy#Gry0X%>pifMiK zJpY};mP!di175IJs1)T=y^(V16K+LtcY5^SHzuGK$;S(s> z_K-o0St1K!WA;Ejy$&AbnUCib@4f&vihSUr3+MFId++VIr}N0|UhVNTXQK{rO(GGS z8bRzqmu+vm8vg2FCVk1oaej`akU!#grt}i28Z%b^@SYDv$)J6C5Vq?bFXrbglmBz!lR_x(rD8-&>pF5fHMD}4zH(XkqHaY(z~S{-2I z!NNX!`oe*@u&72@pYo1AWA!j&A0iSaM7AVbQBjShdhhk;3=s4-){c*#JhAog`!j7u z7#4sbu`yW?(r35rP{%n;?xMm_6XlQVW3aug8nbU>Ou67Z?g*Q@<*zF{P+q+c&YYg3 zlL7tk_(ijL#Mx?kRtWmW%d*bQu?pe-Y*^tT>SBXBFM6=wfO2 z)wLeRQ!If&94>$UV$HWPoUsjH6&aa^q^XxqU!(g+hYSP9IWJzlO2H&k=g{YSLv22d zqz>vtTf`Ih`x`Tt2#$u0XaW}aFz|Dg*}0Vq*Yhk0=WcPch=XBM$6@u~0QXdfFP**d zn&OZSH~N-`-BzybL7&F$d65Mk;eu^x5h2u{Xqq#KgH+6BtEN?~onPM-J&rQ$W2N@( zL*Q2Zse5)KnaSMJQfN>Ge|Pgl3kwm{EZ}evB*Muz*41@Sb{-zZET@7HgyFUM8{L2q zm$;;buE!)VDI;S8KyKm1iwh=Xc3=~uiF-ONevaa|BOZzb&k2)5BHx4`qhRm?ga$_l z+e)6W3tVb8$!h>Z=$1tq5KnsxBhLA)yLKsHHioy33u*@9uWb`+wr0E?F`3y(m3Rgk zFoBtheR``_dwBa0`KM;p<^kqX_F8JLjfzs>KY}SudyXDGdi6cGbXPX9#HW!#Fkr$Y ztY=%|Naa~|x`Sj8&j}4_->Pm_7om#3!%l|qYHMz!qT4U-oH7ir-5z+CL7%%e^jU8T z<_n%gQ~Sp26`X(~7*x~$^v4xDhI$DB1TqYyUts_HF)ouG?=)`gSS1N(ZFi-?$?-L;=r_s8z6OS!wXJ&w0`zAx>e2QTFY5e zxZH<=^AZI``=77>>>0D{+IG+jy_Y*jx3gHjo0~^C*UZ{D-c4l_j3}ujb{d%D3KE!0 z|DEZE)nt(xu{_78{K9dBRCK0Rrl#CjG;9!BlLIIhW5q8V?A#rhnD)l`&&H=iRu#1FUq~+O0UcN(R z{EL_2{-~!nIo%qfY}*{u%}Y+xQz$<<efSd>XV%Pq;GK__rZG1+i@3l=C`j!=!BWqYl%a6+T(LdM^`uOHAcT?#v8m zKcl&eoVjG}9X6;fCE!ZaJk;OUTyz}_fH{er@{h+3ToqF;JE`xqPrme1uL59%V%{wt z0BTlC$ua9Dcak-*=TXG3<^m&_k*Nqj6z4#4q`8*+@$rGb05kA{lM&dRsMN7V+FBHC z45Xw4X9QGF5U_}pcE3ijdosIR5&wh9H6CFhf$vkZ4$aJ)@yZWbIJ=+G_RfY=?Ofw2 zoGooWY_;p9EJsDuY5ZO4z>*kah?bbbk7#^#KU|B5L?Jz=NMp%5?&UK>p6Z7IA8w4; z+OBO|X(bVj1*hyhn#$XrDkVn*NBz5NfwQ9C!^E*Y*qNMheki0#gpgQRwM&eK+NKG;S6zI98Z9qS<}`cV>l=cqHTRVzQ$gUzd}XWBexOPowHwS&$;)c4a}=G?2ROiHgwUpb^gH4yVG zHao)3y5F%;R5a)4v_tI-n}WDLf*ra1$5-$8(zG|@R$vLNEm@98=GevjQWG~7TRxM} zTqSZ4VQ@UHuV+C5dMTVe2|;Xsbq5S-2);0r$;eWHsi`6n%X*y0X3nO2m0V^nMhP%p zY_Qq*4$tEWIj^CIid-Ug+S^+@&&y4j;(x!bH9izVpx#(f4FzA zRtqDJldPiy_4T(=dvt!>w&~*CdoMl~1RVue-YhO1=cb}8ft`@bMp%TSBY)ihwcW~e zqQO(E2@^yJY@c740z|WF6|9zK+g3bDgl#JaTVEVrVGLR@Cka9f+IOLx0hCPQkN`YW zSrs<}Mih>Qcc8DyNodS(L%e^t91X;n(75eY zn|T5m?u|2Mx9Jte$L^*DmyXp^PG&Q4!@cjDFrr)kZeIuAOdbIJ33tElKYxB(bkw~p z{q|2*eXiVtL@s(JzOt|Vb%N9K@v({-7uaT(u<sMz+rQ+Ua&*hDi{v_9;(Bth8X%p$u~ z1b121p;R~Eq>z!QotSotc?tdmDq-wSAG+s_LoAqQ7L~b*5A+=lvqC&WbCo97TWeoO z(2^#cA%_f@G9-+Ls3(G@DwhKf_)oEDO#<$0{!-!lT}sThEVb+cft)FCY__Q_A)hF% zihQ>9kbGyj?+L95*{jJj$jWU|_Sf#CS3Q{J?PPz)-Y8OUGsmbKOQP1x1|8lKu3|gt z+4JX`efr39%Ys);T2RHs5SDO9jw}n#darW=AFQ^Wb@!exPO-%9j=jI)&(}|%(#7Tb zmrVioqkFFA0y(_NgGYkuXfUBVPzowuO{-4>r1%a%M>?Q`PoD`loIQ=SW$oV|j$MCyx`46)2c5cixGz#Y8T&1dOxfPZ<2xDsDAaNdPs|a~pQPRPcJP#; z<$!9^iB(WO@8x0m3gLo|Z?SA?}dOi@o-O*t)XhhYarM)5rZzj28v~(T^{L zXPlieeEWnj;VV>JeCT1GbZMyq``0n>#$Nr9jVbE~n}rth`^hM&l4>lvH%l}1O8@qo z28uw`Nla?O(Suc(u%u*~mV1W!a1e$xf<6K#KA)qWd7w}Iz<&J-A#+vN)`nB#NL`kr z*UtDf$r;Mia&K>ZRf5>Kjkq+OykM4g0r;sI*B2k`O_;V=v4}llevp*vP)}8k{kEDw zFfHa5?~-S5ht4g7&_`$!*!H8Pk&~1iUo(xF8(ak6Bf{fWI=BeF(+8C#ou(eAl3#gffa%xVwi8?YC#;QH!+g-NeH* zY}knrTNk~Ar5pyPC(KjDO!8aZj*4S%cFp_bLeGLDe1|P98{WU)L;tBbsqBx1_wU`C zgz0s}iHq*Slm^AW$K^x$*@ zMAt6CyEo{yQ`-@9{rYuT2_WVsdmV@t1LQm!>>FJUb7TMmYVO&;F8ROhg~tT^-3z-W zA7n>0L88-3_e%mKTKN2BtG0F5Uu={dU}3S&W*nOusU()-PWM~A_lW5|oz8-1orYqj z*L4tyBu<0Y1Gy|MlCra0-)9n(y+dcKUCfo)@dwk`)V97di3~!BXfNyPTHklKGzUiL zDH-Bg7-9J>-N2fzSvU$oUK!$OEcmm~03eWfG%U+`KE`dof^*)gQHD*`Ed|M$>L{qm z*qx;JA5B0g9yZea_9Et=Nw&6{*OddwPn6g+MTPv;7?;)HK?#Y}-XL$XmFS9_vwjLz z80uWtrUH6GRK%p14cMZX&;2u^XMV~Za z|JAT45qdthnu8F{L+x~$Y6v`X&cAUjOCp}hSuh3auU)w!C7G7D>RkB;EI$P5n$KaM zw){GMro{c{(sWbJG0x7;srY;ADcqx_86^?+gfCCJFJ{OjHa+4kVV3r*U%g_Z z`oBS5-~0o4Ed+V(j}yk!X6RaEbqFp7Lfk#}*WVkYz|cKcsmme-2tR#u1GOz1P{KVr zu6J3oNqFn~YAX|ysPRHArI+jeEeNkC+b@|N%8mtpUuou06`S+*9wJ0cpR-kaxJici z*qDf(c9r`7dQbaf;J@u@D~3M@cG zRcHO;m}#y+;Q^Ysf|3jm6C+d?2vW4$_7eht|ES&dUjOa?6N7F2pJT8}i~l1G*5kW; zVhr=0ndAk+&rZjIg9LY7(StGtFl^uSSzrxdh6VWw-+###0wL?H?)Wqp#95@@BqZo~ z8nA?c9IGO^ed|^-E=47njD`FF+0~RdD4d-?KyAcd;R4J+_h!}3x)B#~;N|EZTOXCb ztvojVM(mJwOfBdz%J1ej2T2LV4BiE5A4js>TuY@B-bATUXQ1yBM;^hpa;VL0`HbXW zc~}U@zkByiv_iq9#R&s9zBX}pH`Sb!b%^;g&EWc67j7Wo^=+H-XmdP>7VRz63){3B z$Uch7%4-2wTCLCYi!;|k6fOg{u=kD4WR*g>wAhkAQf{XEi?o%e)BZw#lh*a?*RKH= zSgR)Ij z%=W#tiY5mWpiqP<4D`cCI{W=x+g6KE9BDzzWX|v%)G|Y(0)b&>4{}3V9jEMX~NFAZAB_gaZf1t$b?S@D7gMZB8^X z+C8Ql2L0@*r6rANrk=<}`S|uxcjoX(3r0pd2<(bHBWbJ^oP7FZuB!>L-|&xS^erBS zMI7i3jx(p%Og*)<*TI>23Sb{DJ7|*x0*h`Z{^EtZM_}JYFbVvgiOaBqzDAj7xq)J} z@WUrN2)jNNti=6KPg}!Di7Hz565d%s(5eoACl=H{@SU4hce(+9 zwK8ErM~9oAsxZz#yRg=>&NX2oU?uk$YXO(49infQh!pgQi23X&rGtcUJ1TBq7l>8n zrtvDa)1x!iPteY=pGjNPVT%WClUPw<(Ni##S>9#JZyb6wyvpT<{>Ke9mCMJIHLP^J zm$o)OMA{7S>!YIuI&gtIYAcl&{VoZq}BC%PWmyR>Ej zC$QxEnXmf;u5RKs&a!yQJ)<)aSF8qz=4qv!-|8!+DP0zC;} z^y6oqM)8ob*R5omWvhP^?*r3DdB+RJz>GU^oOY| z;(Cd@ng%zYc9b;30-5dsN$EFM<>m=LWSqgC?D6;j5IPoaMyy6`FFB0OwT=b1Jl>&GrXm7Y{*az;vqmggp)_1FtuYn-+@C-xQ%eO5{dV_@EQaF4yR@@C2j-}$fuy9 zU{m@!i8t694xg|>lhg$~IKqxMn|+F8VyB>~_;WDFEcy1yOOlUN`Q6iIf|}*zV$e2O zz#phLg5Vj`S0gdiV^XJ-4EW5!6q9N5I`UJ??_v@Gf_y{_rDDdH;7o{S|7^l`HS zf4|{cFnPLwrONK}ZiLsRux=8!z1vPs_r~M?jqZZX%q(HYvDo>}Wkb&Jn&B%yWe)1u z+O6@tIOzSS@RM;Bl>-J5CE?WECE<+Xp#XsIZETCwu5c-)?q76 zd*M^}wf;k%WmG6Eqgj9QMb@0Y;G!1vEoO4?U~s=Jw`V2HqdW*n4Z;dOtviZ4`8PnB zjRn#tCM=shcdih^GyypJ-RQYbSN!A4dq;YU7l!PGcVq7f^NlS`#*#6XMVl|mt<&4K zb%wtjCo3Bc@k&F*3XxvRjeIPU;N!&$2vJe?7$jD;JfBORU+*k_4)=5KZJ3^rZy)^& z#eSVa_ySdH^UU+}Jv;~qc$m*tkr!wu^(XXXtP`)Pt7}{Jc#wP{zZ5%@fjddzW7M0( z2eAuN*l0FC)j&zSI6EKx2`%{;<=q*1OR!yM^~BH02p2_@_uqu2m!FV^JK1q4Wh z;Dn*Lw-hh#lATPBSq{9P3A;vi25DHlVuhoRex?Frr-0LV({5xGjP%p-Sj@#u={(AR zh|tHd!!2L%#Cl&h(-83phJ}fZF!F?*k&{#C2-U1stuo|Dz!Sg5XOL$0Cdk9egHd{`O?tiV6Ki0Tm2NCyKFoIG=; zhHk(5QLNfSmcRmw1?S5@e_o2VihbGB*@dO+SAX5+eDB`9$Iul_rcG1lyld`R>&n^) zfP@>atm`hb%DmO1g}X3#iAb6d_L0Erhu&nX){I+`xxfN9N2r+%l>HR6J)(rLMrU2D zz8>{M@~JH~;F@^oyT1T%N5fj3wAw(@6n&U%=SW*>h#~zGxn@ z<8L0G`(0~4bR*6F{pAIFhNEJVvvcd}m(_B7#v-1LXMj_%{ZFqsb5a{V16v^In0dn~ zRc-aJAH%TGTFX%`aBAT=RyKV~9QVfpbsj?O9eVOZsXHLVW{lG8f5{EwXUv<|W7wcU zMu1l?3l^*st4YMkq?0!PjhEL(s7y(qMee5$R|;!7xPk!kMo40F7TnPmw@sbGhMW;x zVdta5@zl3LLTxmDa+Q7oQZAyqXfP>C(-UfPvlGWrulpVO#KZCMYnVs#Rl*fIHsczH zPy~K;N!+sN#R?hN{S-!&XD&8&&5XjFERr`S=(V8s1+SAb%QGh_LO!y4D zq~`782QZlzvY38{^jla;kDS=UV~f7VV8@BzDdyZp&=v(D1Md-GcF1B&_*x2H?}f6m z4jeW*qd!yct4Y@2V|S(Y(Vk5DGF;W89|wttMEH}6r<1bY6IC>88{xeJ3?>WC7{9Xy zz#4CO;Ukg5)|Dz|(yLK--vIHwvv9Q-M=T7KKQXy-k1`8Z{66?%QPC63(F-u7%I15z zjkz?W1rw&)I(r?#bHRLJW{*GqP@y^92Aps^`aPRFDFExpt_B?;Esk9I+Z|Q$^JlY4 z;q%GIrc0QO2piTHEFBV~&f&Tz+7)OYE~wbP_j1}diA%Ci``7mm?Lel3!~y{o6Sl_l zH$MCD;lnNF2UefeFqB8mQNE-9{Z$7y_uKS`g_kb5p_WoL4A5^*{F#_{_Y6J;-zm#@ z-74pvrDK{Vuuss{XR`~3C_m!Y%;k(>co$}&s5my#>Gou^cK0oVEP4=EIzVAeIk5lD zAsu+QjF{+<>hAdzc#Q)$BZA}h902g)~zw%=z~4)4iXjT!iC^@ zZnM;aRg~S_bwLk#cxCv!jSJG+K)Rymhr{?7%tWB7EyrD*TvN^QUkZ!|2&QgoUprgc zX!4UlgvvW3x0yXQ;NPBt)A(}fg^VLrSy_Tn;uCH?EM4a(y-@WC2na9SmY~|DiyIe| z=h?C=Iwv7ax)QNK-P$}d?H0siC1qvX+JPtQUc8uvXHf%KSoLMT_50u zmQ4q~O+J?7$+L|II zC{lg6vcr$9rCcBQeT#WOTTO9Vm$NUZ`76wbJo| zO@KI1Xj=IC`>?_8?!p1*9u<`nMt6{-{Tv<|Jf@(S7;d6)zLII&>_+V1^6aMAu5MP> zNm>@ki;o{MNY&0Rbe7IFaV-;KBfx_LZw5JMiW!dZFBHbMK7IO^v-2XaCX0V*OSj<6 z$8N&A-L;)3@w~(iRSBqLV)W2Wk;AdQDyWt3nwqeC{^d^E6 z=W76p1suE-;Bl}%a?!mBqgsJ-Fkq+L_EmLDr?jR$AcQB9-ZmpM_b-6u*p|OAm4k!I zHvAhzMb(2RbaEV-&(p<6#&LLT%f<~GT1tQ*Ebi`0NeQMxx-n-v3<$WS>M??+GoGE0 z@JGaN0ydzcqLN_avHFECs|F82^^du2**1t82+6F?CGB3l&R11+<#gfP4I!$8zJrYI zwU7}+Z^*ixQBkBD2~r!S3ck}U<`zixDtJ~)NzjzHUPARA!|26pkpux^?O~3 zPr)tIac9i7t8giW;!ixUAmb7VRZt{2L^JycPnQhGtOAB%(J4;YG1Lm?4Zh|OYPOKm z#HZm#IRtkv0EJSJh=C4@9L!$@K~3Yk;UN|=4WLDCO9L*N9f>H@p(mFwUoIJGwM~LR zD;lVV=1I?Y$DpFkMv)F~{05QVm>Ly(Wwvw>+gJ_HSFFSxzE9!_`&Yc8g%PooTJe?` zkB%T@MUa!u3X2TE9*|&yHKpBvG37i=r8WD#H zLM_(Z@dqz)JVB@l1NvmKHVd0Ybc@1FI=x-O;C;5@_EJQJN|-0AGEG!;R9%jYf}gm{ zq`tcTZ_t6h^(%LMRdti!prUM-CM^Af{$;55@EiWc?F>)0%lywQ{9E$=XksK13^O>k z)}RV_+yuW{Qr3G5e>8pjW}>C6p{;G^TPPy|Qwl-0z6u!O>-2tZ6H>*EOgd*i7hOui z{e1y68ct#qOT?BEp^xu9an~$zW1Bg>te%BK0hm7e8B^Gyb8qfk2Ph<@*ODOKwK4f( zoK%#r)RgUh0;hOf%Uh^T}v&^x>^A?Nw04~OJ@4=CMHr4=XwD=6#Q%B_C* zyPgI`s%}=|aQ^TADDMFYHHqmFT+#9yf#Wu>-hqZ;3@pRN=Kq)q{*PS!z zfepC50kla4HPjyAtdx<^CHTI%`)s@yy@?1!jeoNiCkLsKKi)6$s=Hn8aBf^=T9@L| zeET;nT}3pCfO1`?a>wIvv4MjJHcn?gD*AQeypnG>UW<;MSmNA?NqsC`&n-YOmcPat zlk98JfY@%^d~C#f>B$b70ghfdzxdb$CrS(i>{9ozZ-gtb#l8V%<4Dmq@IpE8a~d1;70$~Lz7Wz7XKl#C<-(Ky?f=YBtz-YvCIkD7a$im;1we~e#;4% zR@QAkGEbECmFkmn{4UC(Szpw%DQxSTI zP={&)#zaII-#l#r#iuPN?X~(iHhc0Xjkv9HW z#>%R^)p>72ZXqkQL@#6>IjB;InvR&Fc9@Krd%<#V7 zn+A(e*6cuZcHH;G2ws4TC2|#@jaR%>(1NffjC(|28eks5ho_2ig@QvEO-Ob<)ZjI` zaKtp8$*$e&S-(`wml)n=;}9)+0y=%u#A4XMPM>+V3u)}q>{&NKnie=^=xYXM8X#6A z;{p(bUK&sHEM8kxY{rqvl~2bj*A7 zqI!M=ZGQHN6Cj?4vRBzpr`;=SzJ=g%>CztGJ-59;;eT~wd<;Im;d1<{*ux;1YAGWl1L!EQ8_SAeE(OvNrhC+i?c#w5HQ?9) zer6sW2-GaNkWTgQwZ3>BUcPv-5hGAk_t7&vBE6IAK1U38coI@*kN%|E_4GY$UcY`VvcBoJ z$MBeFgDtc$VxMQPUrhSBS@(d3HH#l`mcQgjWa{qY+rqg;E*BMrkqw>(ZupTxq*K^9 zGUr!QP4q`5S4GMDj~_FaK4mQLdk(pF;{x0Gym1LpDhDoyIT%PG6#0^WpV*QyV@ zbGC%7{@JDb=)-Q2gUhv;ng0iW+;E1Mgchtz=1 zU1z$}MGurLMO;;!&?0qeTOIv(q`Vu-{I>a=4gV0Rl+N<$$o(|G;$Y&{SAoan)#^qz z#zT8!6c?M1)*l}JD*-Q;pw*5*d8(uQj}DS?5gM)HPWm3@V2@@3Vg9R=uTvQ7l`y^w z@Q#4#5q~sVH|b4Z26$fr>C}I8i`faxrFH}ZYk`;bWY>W4Kbb9p0*Yr{43=u3B%)vL zvm3#WFm{6>D}sWAEeGwE%WCZF95W}2C>N2|%{f2$xaX8((YODNBBgBj8z4>~g&Owi z9bLB;w;0g-f017|b3pIjGB5`--g$!;sl5{8yZ}HE5Kh0V9d9Y%4y+elnRI(-iUGD}8;%u}D~>S>mB3SVIHhWGwS5k38VB(5Za$sAA7c zP;`XuRd;)21P;c3icn0O8~kLOhj^u(UjEY9bmF|D3-9cc7ZMM2%U7=o%F7Vy5JC)7 z(|?lfOiRh0-SkTpccKzFo_z_ZOxu=f+n1RqmXfOI!)gQilAQOo*}4h%L{2~F@1Vbs zpC!m`h`3TgR|)d%CY3}8TBP7j!hTNqIT9P36z zM2IA;>$)?lGLBEVfFx&n3nPkk>-&h&Lz+;LKv!vV*lh*}W-$|l%JOPj>P}^P z*Ahps-X*cY%{?`+tZVIG0+jK~O4}5Fs%qi}bRSi`+MF%yznf~(zqS;zaPj6%C#skL zPr?h_5fQ=tGe#odAmcCGB?z4NF-d8D{e0m&V3|-wGgDg5to=)LGI!p*-dcO+{A*X`fWP}e3V zj_3edZ~-qlVYLNMRiHMK#ez|11Y0rWJtr(ETt?~3*O2O)7ejv!_ob68INUz!9g41etCY9A2Sn5lY5XS8Eg{4Ii(iWjP;9 zKOEW2s#9Z|S;Dax8pv!1$%U zmJVX7T7ZP?BYCfJj9Ls7nwoVFP8})vWs6dc9IDcNR$WG*`Ac*|wwPxze*6aXMK94y zBK9yBHmDdtwJ>6TfpM4SM-d=!hf#?cHiC7-fRC|PzODTqNkr0rIGl%dZ9CG`ltxZE zhyftfi{MXbBh|LXrlovvp}9xX4^DZ*cnQI_prHNn@mk6)jM%BhN69HDXv4g#JnOeC zaKI7A2jQhnO$zJM?Ae!sE{H@2U~E@vhFC;OW`Sw2EVDa#h6Dp6xJ?b@RfFGj6Y&@b zNE*Nmlb8bp6eG|DHp;@%SERjwx6n|nWwve|eV^@kEKKiqhD{Q|#H1n-EI(uaqmS%O zBKUa)1VPcz3?;!0Q~zi_@y^HuF7n8VIafGWT)Wl=nhu;;x~Ob8(ryLyiejzIRc-QjnJOBEg(UP%qBNf9v&_Pc>DfK=ideR#9mcAG^ zr<^3$OkQQ|@+T zhjekh{=t;{?Qf>s7?vsa-8$I~1bZ%v`;#6Qk{btJSPky#9+mzRbJUH<)x~aIC+h@! zIw2Bexml9qHZC>#Efb@#FH}?UP&?Ufox_IR$w#(CioTNfQl#pk43P8JAD`4YX%)M7 zKlEl$-QHw3hsI2WGK7d0DLcc{kVqG8j$zlyrvRc_aPeYl`FrM0^Rd#!?brtAr zt=cVz4*!%m=Sk!0R&q>r(#fF`N!x1{reo|qoc8Y9SAJ@h_r>%~=5qM{HFWbjht9Zm z>9evM$R{L?GY`oQE?&Kit^WiOrumq?qSKT>%~Ebm!^y_@>iN6F z3m30hEUlwv>=`p{_2%c%bM!C0a36p0$kLm=Ug&GrmA9T}rSf`Tlbh>=W%g#TqMVPe zst7warBcg%yX)NH1KzhcFS2dbOTF8ApW?UO14eh(uU1GicvD#6c4lCHz1-=wp{m<>9HFTfy4%g}y)eu6*9L_71wm5#`#4>zd zOe~XDzA~_PYrObu>0oqtfZnz>$M3)13CYgi^ThodJl2(-L%m0zn^6p=aRhK5gK5w@ zElF-eL7U99G#5;)Qugdo?bhw!n_&<1Y;KZDx($bLB7hX7U_mT1&um$|Rm)0SWgZ)u z^bfsKzncy+H&&kU0q(yt+t$NKe(1DE$!Zw` z9W&x3VOqMWX6-GQul#=m6DVAna?bYmby^~cOCrqED?E~R25(wEeL$z0Cr?-q6l&xs zSeq|Av4gd4is3v9bGM1z?#botFz^{5h@=oQA}9Mlm?@G1ANbWKPDVFDpBet<&BEOq zRvd&!B%XFW*4Be3v*)$Sa{mhBwuR(P?ze@hnE4)mL~go*CC3>R>BLL{wBa?`f_9u_0RD53E_(*_{ncLH-Ho{R z%oSZmcmEd}n-Ga=_O{-6dFHAwW4#WQxp(f^u?Ql@u0`h>JE|xv%LV~6)Uwev&2k(s zxqkJkD=F8AYzr=RTN$Yk9<1d@!0-V#HEtmBk6>tkB=e$A4!Z7ZexRssgYJNBF){h< z-4lR7pHa^{ckOB=IeP!~*%hx7Mwrdk-QEQ0F^9*<|J;nOJ?)Bogr7*aGlvgvqVIo- zxxl#@!89H!680lyUWneL^A8>z5ItEYT0@w(z$`fGoHZ;kcW9 z{5MbAZgIxantHn*b0*&=#S?}UNQQ8D0M3u698H6iI1oR(PoIEBPuX?Nd<1!Z;Ec1E z1!gW$?b`JQu=YEyq+^ZR&KP68@>l|g7Zdyy85Q*$gO!t*+(Ai<5w0mr9ll7XF!0$u zL~UcK`>~yn%eY>z2d^`>=*Vhj_SC6e?pIb4(!B5|Zhr1N)>Py_Tk3bcAb{_=S5|fr zEzyDdh(?Q%+-U^%VcaM!uAXmhthVy-@|Xt8E!JP&4pEbTbMEtuzHvWSb7f6UOoAV6 zRZ~lAx8p__b+5Fntm@;EryoXtn%&kSLegb{?YQi|8)CouS6Rw=H#FHXR`T2sk+rsc z?8zy*oopi{c(4_Sz*nejkJI+=B2wEw+vNSAE$u8=f;E22E2^6mjU!@u$XUp0n3~6gXoVv5+6Tid__G9ftz%(A4iay=Sr;jIG79(3VxK7E1MXbMGZ?6_`|+8lOpblj7h+imra z#!l$m+eid6rEHEzQ0}vtv|OcL55Ed>dzt%K@F223qS(IF0Ld3ZBoeM3yT?`wLxpoQ z+HEvz8GJs7drEM0@H{DixR`PLKGbFi{4IU;LQh)#wrq}*Ql;6E$|Y=$RyRGCF%!mP zG&VO#{0YOb0rvWAGDf_H?x>t`sAAdsr&kQe`{3HKv|*h6z2{k@mDCHaU$bBDJW&OQo%DhEw#cYng?H#ZF|D&#+E+28Z)rFMxn2U_%iGL!FOI3!gC*ayn=)= z^j1Io7I*FPYyboExT<{*9uEr2n7?()7GVv@If6R9-}Sl6^1mt@e~jZCuspRxb=$PI zty%&vh-r*D2M ze00+2b@CIYwe)!By9~8C&!eDCvPUX{K1W3B49dp=FZ=@MFkKOCv~+o=ak7u&_#`@U zuHpnY#?DSfG7AKW*qkBFfk(`dp||E2vb2wq?=rL+`1e41dI9%b^Oz(eA4GTAxQ$hb zpt?gI5M)On%@@l@AZp!{n)=(^BYt;(3fA9{VZ&O!7(Z8#sQ9`v=aEpB7LQ0Yx%rr5 zCiMI)Bk~^neL8mO(uOlR<(6zlS!>CBFR!swSk@BX13HABJhwpg^1SX(wm@#smE@BM z(Eh2parBM3SQT`utE*evb-k?Om+#S|PMIjXZXRJ^z_H5qNU7c?MAd2bn{>sL*(dHV zsm_<0kT^o`ZnEs)gFND{o7p0Ftyc_D-TE{(@xQ17avCABa+_j86pcfqw}0w?R)j(z z0S(qjRS!8i9g)w-yBZH1XTR+6xQsf#nEmUla1GOvk$eeRhw>{_Psm%C8_Q}KuZ^Vq q{PSo1`IpA}L0e|YXz. +This document describes libgccjit@footnote{http://gcc.gnu.org/wiki/JIT}, an API +for embedding GCC inside programs and libraries. + +Note that libgccjit is currently of "Alpha" quality; +the APIs are not yet set in stone, and they shouldn't be used in +production yet. + +There are actually two APIs for the library: + + +@itemize * + +@item +a pure C API: @code{libgccjit.h} + +@item +a C++ wrapper API: @code{libgccjit++.h}. This is a collection of "thin" +wrapper classes around the C API, to save typing. +@end itemize + Contents: @c Copyright (C) 2014 Free Software Foundation, Inc. @@ -85,6 +105,7 @@ Contents: @menu * Tutorial:: * Topic Reference:: +* C++ bindings for libgccjit:: * Internals:: * Indices and tables:: * Index:: @@ -190,6 +211,107 @@ Source Locations * Faking it:: +C++ bindings for libgccjit + +* Tutorial: Tutorial<2>. +* Topic Reference: Topic Reference<2>. + +Tutorial + +* Tutorial part 1; "Hello world": Tutorial part 1 "Hello world"<2>. +* Tutorial part 2; Creating a trivial machine code function: Tutorial part 2 Creating a trivial machine code function<2>. +* Tutorial part 3; Loops and variables: Tutorial part 3 Loops and variables<2>. +* Tutorial part 4; Adding JIT-compilation to a toy interpreter: Tutorial part 4 Adding JIT-compilation to a toy interpreter<2>. + +Tutorial part 2: Creating a trivial machine code function + +* Options: Options<3>. +* Full example: Full example<3>. + +Tutorial part 3: Loops and variables + +* Expressions; lvalues and rvalues: Expressions lvalues and rvalues<2>. +* Control flow: Control flow<2>. +* Visualizing the control flow graph: Visualizing the control flow graph<2>. +* Full example: Full example<4>. + +Tutorial part 4: Adding JIT-compilation to a toy interpreter + +* Our toy interpreter: Our toy interpreter<2>. +* Compiling to machine code: Compiling to machine code<2>. +* Setting things up: Setting things up<2>. +* Populating the function: Populating the function<2>. +* Verifying the control flow graph: Verifying the control flow graph<2>. +* Compiling the context: Compiling the context<2>. +* Single-stepping through the generated code: Single-stepping through the generated code<2>. +* Examining the generated code: Examining the generated code<2>. +* Putting it all together: Putting it all together<2>. +* Behind the curtain; How does our code get optimized?: Behind the curtain How does our code get optimized?<2>. + +Behind the curtain: How does our code get optimized? + +* Optimizing away stack manipulation: Optimizing away stack manipulation<2>. +* Elimination of tail recursion: Elimination of tail recursion<2>. + +Topic Reference + +* Compilation contexts: Compilation contexts<2>. +* Objects: Objects<2>. +* Types: Types<2>. +* Expressions: Expressions<2>. +* Creating and using functions: Creating and using functions<2>. +* Source Locations: Source Locations<2>. +* Compilation results: Compilation results<2>. + +Compilation contexts + +* Lifetime-management: Lifetime-management<2>. +* Thread-safety: Thread-safety<2>. +* Error-handling: Error-handling<3>. +* Debugging: Debugging<2>. +* Options: Options<4>. + +Options + +* Boolean options: Boolean options<2>. +* Integer options: Integer options<2>. + +Types + +* Standard types: Standard types<2>. +* Pointers@comma{} const@comma{} and volatile: Pointers const and volatile<2>. +* Structures and unions: Structures and unions<2>. + +Expressions + +* Rvalues: Rvalues<2>. +* Lvalues: Lvalues<2>. +* Working with pointers@comma{} structs and unions: Working with pointers structs and unions<2>. + +Rvalues + +* Simple expressions: Simple expressions<2>. +* Unary Operations: Unary Operations<2>. +* Binary Operations: Binary Operations<2>. +* Comparisons: Comparisons<2>. +* Function calls: Function calls<2>. +* Type-coercion: Type-coercion<2>. + +Lvalues + +* Global variables: Global variables<2>. + +Creating and using functions + +* Params: Params<2>. +* Functions: Functions<2>. +* Blocks: Blocks<2>. +* Statements: Statements<2>. + +Source Locations + +* Faking it: Faking it<2>. + Internals * Working on the JIT library:: @@ -961,7 +1083,7 @@ main (int argc, char **argv) typedef int (*fn_type) (int); fn_type square = (fn_type)fn_ptr; - printf ("result: %d", square (5)); + printf ("result: %d\n", square (5)); error: if (ctxt) @@ -3820,7 +3942,7 @@ instr9: @c along with this program. If not, see @c . -@node Topic Reference,Internals,Tutorial,Top +@node Topic Reference,C++ bindings for libgccjit,Tutorial,Top @anchor{topics/index doc}@anchor{48}@anchor{topics/index topic-reference}@anchor{49} @chapter Topic Reference @@ -4006,7 +4128,7 @@ there will likely be a performance hit for such nesting. @subsection Thread-safety -Instances of @pxref{e,,gcc_jit_object *} created via +Instances of @pxref{8,,gcc_jit_context *} created via @pxref{9,,gcc_jit_context_acquire()} are independent from each other: only one thread may use a given context at once, but multiple threads could each have their own contexts without needing locks. @@ -6406,197 +6528,5561 @@ valid to use the result, or any code that was obtained by calling @c along with this program. If not, see @c . -@node Internals,Indices and tables,Topic Reference,Top -@anchor{internals/index internals}@anchor{c1}@anchor{internals/index doc}@anchor{c2} -@chapter Internals +@node C++ bindings for libgccjit,Internals,Topic Reference,Top +@anchor{cp/index c-bindings-for-libgccjit}@anchor{c1}@anchor{cp/index doc}@anchor{c2} +@chapter C++ bindings for libgccjit -@menu -* Working on the JIT library:: -* Running the test suite:: -* Environment variables:: -* Overview of code structure:: +This document describes the C++ bindings to +libgccjit@footnote{http://gcc.gnu.org/wiki/JIT}, an API for embedding GCC +inside programs and libraries. -@end menu +The C++ bindings consist of a single header file @code{libgccjit++.h}. -@node Working on the JIT library,Running the test suite,,Internals -@anchor{internals/index working-on-the-jit-library}@anchor{c3} -@section Working on the JIT library +This is a collection of "thin" wrapper classes around the C API. +Everything is an inline function, implemented in terms of the C API, +so there is nothing extra to link against. +Note that libgccjit is currently of "Alpha" quality; +the APIs are not yet set in stone, and they shouldn't be used in +production yet. -Having checked out the source code (to "src"), you can configure and build -the JIT library like this: +Contents: -@example -mkdir build -mkdir install -PREFIX=$(pwd)/install -cd build -../src/configure \ - --enable-host-shared \ - --enable-languages=jit \ - --disable-bootstrap \ - --enable-checking=release \ - --prefix=$PREFIX -nice make -j4 # altering the "4" to however many cores you have -@end example +@c Copyright (C) 2014 Free Software Foundation, Inc. +@c Originally contributed by David Malcolm +@c +@c This is free software: you can redistribute it and/or modify it +@c under the terms of the GNU General Public License as published by +@c the Free Software Foundation, either version 3 of the License, or +@c (at your option) any later version. +@c +@c This program is distributed in the hope that it will be useful, but +@c WITHOUT ANY WARRANTY; without even the implied warranty of +@c MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +@c General Public License for more details. +@c +@c You should have received a copy of the GNU General Public License +@c along with this program. If not, see +@c . -@noindent +@menu +* Tutorial: Tutorial<2>. +* Topic Reference: Topic Reference<2>. -This should build a libgccjit.so within jit/build/gcc: +Tutorial -@example -[build] $ file gcc/libgccjit.so* -gcc/libgccjit.so: symbolic link to `libgccjit.so.0' -gcc/libgccjit.so.0: symbolic link to `libgccjit.so.0.0.1' -gcc/libgccjit.so.0.0.1: ELF 64-bit LSB shared object, x86-64, version 1 (SYSV), dynamically linked, not stripped -@end example +* Tutorial part 1; "Hello world": Tutorial part 1 "Hello world"<2>. +* Tutorial part 2; Creating a trivial machine code function: Tutorial part 2 Creating a trivial machine code function<2>. +* Tutorial part 3; Loops and variables: Tutorial part 3 Loops and variables<2>. +* Tutorial part 4; Adding JIT-compilation to a toy interpreter: Tutorial part 4 Adding JIT-compilation to a toy interpreter<2>. -@noindent +Tutorial part 2: Creating a trivial machine code function -Here's what those configuration options mean: +* Options: Options<3>. +* Full example: Full example<3>. -@geindex command line option; --enable-host-shared -@anchor{internals/index cmdoption--enable-host-shared}@anchor{c4} -@deffn {Option} --enable-host-shared +Tutorial part 3: Loops and variables -Configuring with this option means that the compiler is built as -position-independent code, which incurs a slight performance hit, -but it necessary for a shared library. -@end deffn +* Expressions; lvalues and rvalues: Expressions lvalues and rvalues<2>. +* Control flow: Control flow<2>. +* Visualizing the control flow graph: Visualizing the control flow graph<2>. +* Full example: Full example<4>. -@geindex command line option; --enable-languages=jit -@anchor{internals/index cmdoption--enable-languages}@anchor{c5} -@deffn {Option} --enable-languages=jit +Tutorial part 4: Adding JIT-compilation to a toy interpreter -This specifies which frontends to build. The JIT library looks like -a frontend to the rest of the code. -@end deffn +* Our toy interpreter: Our toy interpreter<2>. +* Compiling to machine code: Compiling to machine code<2>. +* Setting things up: Setting things up<2>. +* Populating the function: Populating the function<2>. +* Verifying the control flow graph: Verifying the control flow graph<2>. +* Compiling the context: Compiling the context<2>. +* Single-stepping through the generated code: Single-stepping through the generated code<2>. +* Examining the generated code: Examining the generated code<2>. +* Putting it all together: Putting it all together<2>. +* Behind the curtain; How does our code get optimized?: Behind the curtain How does our code get optimized?<2>. -@geindex command line option; --disable-bootstrap -@anchor{internals/index cmdoption--disable-bootstrap}@anchor{c6} -@deffn {Option} --disable-bootstrap +Behind the curtain: How does our code get optimized? -For hacking on the "jit" subdirectory, performing a full -bootstrap can be overkill, since it's unused by a bootstrap. However, -when submitting patches, you should remove this option, to ensure that -the compiler can still bootstrap itself. -@end deffn +* Optimizing away stack manipulation: Optimizing away stack manipulation<2>. +* Elimination of tail recursion: Elimination of tail recursion<2>. -@geindex command line option; --enable-checking=release -@anchor{internals/index cmdoption--enable-checking}@anchor{c7} -@deffn {Option} --enable-checking=release +Topic Reference -The compile can perform extensive self-checking as it runs, useful when -debugging, but slowing things down. +* Compilation contexts: Compilation contexts<2>. +* Objects: Objects<2>. +* Types: Types<2>. +* Expressions: Expressions<2>. +* Creating and using functions: Creating and using functions<2>. +* Source Locations: Source Locations<2>. +* Compilation results: Compilation results<2>. -For maximum speed, configure with @code{--enable-checking=release} to -disable this self-checking. -@end deffn +Compilation contexts -@node Running the test suite,Environment variables,Working on the JIT library,Internals -@anchor{internals/index running-the-test-suite}@anchor{c8} -@section Running the test suite +* Lifetime-management: Lifetime-management<2>. +* Thread-safety: Thread-safety<2>. +* Error-handling: Error-handling<3>. +* Debugging: Debugging<2>. +* Options: Options<4>. +Options -@example -[build] $ cd gcc -[gcc] $ make check-jit RUNTESTFLAGS="-v -v -v" -@end example +* Boolean options: Boolean options<2>. +* Integer options: Integer options<2>. -@noindent +Types -A summary of the tests can then be seen in: +* Standard types: Standard types<2>. +* Pointers@comma{} const@comma{} and volatile: Pointers const and volatile<2>. +* Structures and unions: Structures and unions<2>. -@example -jit/build/gcc/testsuite/jit/jit.sum -@end example +Expressions -@noindent +* Rvalues: Rvalues<2>. +* Lvalues: Lvalues<2>. +* Working with pointers@comma{} structs and unions: Working with pointers structs and unions<2>. -and detailed logs in: +Rvalues -@example -jit/build/gcc/testsuite/jit/jit.log -@end example +* Simple expressions: Simple expressions<2>. +* Unary Operations: Unary Operations<2>. +* Binary Operations: Binary Operations<2>. +* Comparisons: Comparisons<2>. +* Function calls: Function calls<2>. +* Type-coercion: Type-coercion<2>. -@noindent +Lvalues -The test executables can be seen as: +* Global variables: Global variables<2>. -@example -jit/build/gcc/testsuite/jit/*.exe -@end example +Creating and using functions -@noindent +* Params: Params<2>. +* Functions: Functions<2>. +* Blocks: Blocks<2>. +* Statements: Statements<2>. -which can be run independently. +Source Locations -You can compile and run individual tests by passing "jit.exp=TESTNAME" to RUNTESTFLAGS e.g.: +* Faking it: Faking it<2>. -@example -[gcc] $ make check-jit RUNTESTFLAGS="-v -v -v jit.exp=test-factorial.c" -@end example +@end menu -@noindent -and once a test has been compiled, you can debug it directly: +@node Tutorial<2>,Topic Reference<2>,,C++ bindings for libgccjit +@anchor{cp/intro/index doc}@anchor{c3}@anchor{cp/intro/index tutorial}@anchor{c4} +@section Tutorial -@example -[gcc] $ PATH=.:$PATH \ - LD_LIBRARY_PATH=. \ - LIBRARY_PATH=. \ - gdb --args \ - testsuite/jit/test-factorial.exe -@end example -@noindent +@c Copyright (C) 2014 Free Software Foundation, Inc. +@c Originally contributed by David Malcolm +@c +@c This is free software: you can redistribute it and/or modify it +@c under the terms of the GNU General Public License as published by +@c the Free Software Foundation, either version 3 of the License, or +@c (at your option) any later version. +@c +@c This program is distributed in the hope that it will be useful, but +@c WITHOUT ANY WARRANTY; without even the implied warranty of +@c MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +@c General Public License for more details. +@c +@c You should have received a copy of the GNU General Public License +@c along with this program. If not, see +@c . @menu -* Running under valgrind:: +* Tutorial part 1; "Hello world": Tutorial part 1 "Hello world"<2>. +* Tutorial part 2; Creating a trivial machine code function: Tutorial part 2 Creating a trivial machine code function<2>. +* Tutorial part 3; Loops and variables: Tutorial part 3 Loops and variables<2>. +* Tutorial part 4; Adding JIT-compilation to a toy interpreter: Tutorial part 4 Adding JIT-compilation to a toy interpreter<2>. @end menu -@node Running under valgrind,,,Running the test suite -@anchor{internals/index running-under-valgrind}@anchor{c9} -@subsection Running under valgrind +@node Tutorial part 1 "Hello world"<2>,Tutorial part 2 Creating a trivial machine code function<2>,,Tutorial<2> +@anchor{cp/intro/tutorial01 doc}@anchor{c5}@anchor{cp/intro/tutorial01 tutorial-part-1-hello-world}@anchor{c6} +@subsection Tutorial part 1: "Hello world" -The jit testsuite detects if RUN_UNDER_VALGRIND is present in the -environment (with any value). If it is present, it runs the test client -code under valgrind@footnote{http://valgrind.org}, -specifcally, the default -memcheck@footnote{http://valgrind.org/docs/manual/mc-manual.html} -tool with ---leak-check=full@footnote{http://valgrind.org/docs/manual/mc-manual.html#opt.leak-check}. +Before we look at the details of the API, let's look at building and +running programs that use the library. -It automatically parses the output from valgrind, injecting XFAIL results if -any issues are found, or PASS results if the output is clean. The output -is saved to @code{TESTNAME.exe.valgrind.txt}. +Here's a toy "hello world" program that uses the library's C++ API to +synthesize a call to @cite{printf} and uses it to write a message to stdout. -For example, the following invocation verbosely runs the testcase -@code{test-sum-of-squares.c} under valgrind, showing an issue: +Don't worry about the content of the program for now; we'll cover +the details in later parts of this tutorial. + +@quotation @example -$ RUN_UNDER_VALGRIND= \ - make check-jit \ - RUNTESTFLAGS="-v -v -v jit.exp=test-sum-of-squares.c" +/* Smoketest example for libgccjit.so C++ API + Copyright (C) 2014 Free Software Foundation, Inc. -(...verbose log contains detailed valgrind errors, if any...) +This file is part of GCC. - === jit Summary === +GCC is free software; you can redistribute it and/or modify it +under the terms of the GNU General Public License as published by +the Free Software Foundation; either version 3, or (at your option) +any later version. -# of expected passes 28 -# of expected failures 2 +GCC is distributed in the hope that it will be useful, but +WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +General Public License for more details. -$ less testsuite/jit/jit.sum -(...other results...) -XFAIL: jit.dg/test-sum-of-squares.c: test-sum-of-squares.exe.valgrind.txt: definitely lost: 8 bytes in 1 blocks -XFAIL: jit.dg/test-sum-of-squares.c: test-sum-of-squares.exe.valgrind.txt: unsuppressed errors: 1 -(...other results...) +You should have received a copy of the GNU General Public License +along with GCC; see the file COPYING3. If not see +. */ -$ less testsuite/jit/test-sum-of-squares.exe.valgrind.txt -(...shows full valgrind report for this test case...) +#include + +#include +#include + +static void +create_code (gccjit::context ctxt) +@{ + /* Let's try to inject the equivalent of this C code: + void + greet (const char *name) + @{ + printf ("hello %s\n", name); + @} + */ + gccjit::type void_type = ctxt.get_type (GCC_JIT_TYPE_VOID); + gccjit::type const_char_ptr_type = + ctxt.get_type (GCC_JIT_TYPE_CONST_CHAR_PTR); + gccjit::param param_name = + ctxt.new_param (const_char_ptr_type, "name"); + std::vector func_params; + func_params.push_back (param_name); + gccjit::function func = + ctxt.new_function (GCC_JIT_FUNCTION_EXPORTED, + void_type, + "greet", + func_params, 0); + + gccjit::param param_format = + ctxt.new_param (const_char_ptr_type, "format"); + std::vector printf_params; + printf_params.push_back (param_format); + gccjit::function printf_func = + ctxt.new_function (GCC_JIT_FUNCTION_IMPORTED, + ctxt.get_type (GCC_JIT_TYPE_INT), + "printf", + printf_params, 1); + + gccjit::block block = func.new_block (); + block.add_eval (ctxt.new_call (printf_func, + ctxt.new_rvalue ("hello %s\n"), + param_name)); + block.end_with_return (); +@} + +int +main (int argc, char **argv) +@{ + gccjit::context ctxt; + gcc_jit_result *result; + + /* Get a "context" object for working with the library. */ + ctxt = gccjit::context::acquire (); + + /* Set some options on the context. + Turn this on to see the code being generated, in assembler form. */ + ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DUMP_GENERATED_CODE, 0); + + /* Populate the context. */ + create_code (ctxt); + + /* Compile the code. */ + result = ctxt.compile (); + if (!result) + @{ + fprintf (stderr, "NULL result"); + exit (1); + @} + + ctxt.release (); + + /* Extract the generated code from "result". */ + typedef void (*fn_type) (const char *); + fn_type greet = + (fn_type)gcc_jit_result_get_code (result, "greet"); + if (!greet) + @{ + fprintf (stderr, "NULL greet"); + exit (1); + @} + + /* Now call the generated function: */ + greet ("world"); + fflush (stdout); + + gcc_jit_result_release (result); + return 0; +@} + +@end example + +@noindent +@end quotation + +Copy the above to @cite{tut01-hello-world.cc}. + +Assuming you have the jit library installed, build the test program +using: + +@example +$ gcc \ + tut01-hello-world.cc \ + -o tut01-hello-world \ + -lgccjit +@end example + +@noindent + +You should then be able to run the built program: + +@example +$ ./tut01-hello-world +hello world +@end example + +@noindent + +@c Copyright (C) 2014 Free Software Foundation, Inc. +@c Originally contributed by David Malcolm +@c +@c This is free software: you can redistribute it and/or modify it +@c under the terms of the GNU General Public License as published by +@c the Free Software Foundation, either version 3 of the License, or +@c (at your option) any later version. +@c +@c This program is distributed in the hope that it will be useful, but +@c WITHOUT ANY WARRANTY; without even the implied warranty of +@c MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +@c General Public License for more details. +@c +@c You should have received a copy of the GNU General Public License +@c along with this program. If not, see +@c . + +@node Tutorial part 2 Creating a trivial machine code function<2>,Tutorial part 3 Loops and variables<2>,Tutorial part 1 "Hello world"<2>,Tutorial<2> +@anchor{cp/intro/tutorial02 doc}@anchor{c7}@anchor{cp/intro/tutorial02 tutorial-part-2-creating-a-trivial-machine-code-function}@anchor{c8} +@subsection Tutorial part 2: Creating a trivial machine code function + + +Consider this C function: + +@example +int square (int i) +@{ + return i * i; +@} +@end example + +@noindent + +How can we construct this at run-time using libgccjit's C++ API? + +First we need to include the relevant header: + +@example +#include +@end example + +@noindent + +All state associated with compilation is associated with a +@code{gccjit::context}, which is a thin C++ wrapper around the C API's +@pxref{8,,gcc_jit_context *}. + +Create one using @pxref{c9,,gccjit;;context;;acquire()}: + +@example +gccjit::context ctxt; +ctxt = gccjit::context::acquire (); +@end example + +@noindent + +The JIT library has a system of types. It is statically-typed: every +expression is of a specific type, fixed at compile-time. In our example, +all of the expressions are of the C @cite{int} type, so let's obtain this from +the context, as a @code{gccjit::type}, using +@pxref{ca,,gccjit;;context;;get_type()}: + +@example +gccjit::type int_type = ctxt.get_type (GCC_JIT_TYPE_INT); +@end example + +@noindent + +@code{gccjit::type} is an example of a "contextual" object: every +entity in the API is associated with a @code{gccjit::context}. + +Memory management is easy: all such "contextual" objects are automatically +cleaned up for you when the context is released, using +@pxref{cb,,gccjit;;context;;release()}: + +@example +ctxt.release (); +@end example + +@noindent + +so you don't need to manually track and cleanup all objects, just the +contexts. + +All of the C++ classes in the API are thin wrappers around pointers to +types in the C API. + +The C++ class hierarchy within the @code{gccjit} namespace looks like this: + +@example ++- object + +- location + +- type + +- struct + +- field + +- function + +- block + +- rvalue + +- lvalue + +- param +@end example + +@noindent + +One thing you can do with a @code{gccjit::object} is +to ask it for a human-readable description as a @code{std::string}, using +@pxref{cc,,gccjit;;object;;get_debug_string()}: + +@example +printf ("obj: %s\n", obj.get_debug_string ().c_str ()); +@end example + +@noindent + +giving this text on stdout: + +@example +obj: int +@end example + +@noindent + +This is invaluable when debugging. + +Let's create the function. To do so, we first need to construct +its single parameter, specifying its type and giving it a name, +using @pxref{cd,,gccjit;;context;;new_param()}: + +@example +gccjit::param param_i = ctxt.new_param (int_type, "i"); +@end example + +@noindent + +and we can then make a vector of all of the params of the function, +in this case just one: + +@example +std::vector params; +params.push_back (param_i); +@end example + +@noindent + +Now we can create the function, using +@code{gccjit::context::new_function()}: + +@example +gccjit::function func = + ctxt.new_function (GCC_JIT_FUNCTION_EXPORTED, + int_type, + "square", + params, + 0); +@end example + +@noindent + +To define the code within the function, we must create basic blocks +containing statements. + +Every basic block contains a list of statements, eventually terminated +by a statement that either returns, or jumps to another basic block. + +Our function has no control-flow, so we just need one basic block: + +@example +gccjit::block block = func.new_block (); +@end example + +@noindent + +Our basic block is relatively simple: it immediately terminates by +returning the value of an expression. + +We can build the expression using @pxref{ce,,gccjit;;context;;new_binary_op()}: + +@example +gccjit::rvalue expr = + ctxt.new_binary_op ( + GCC_JIT_BINARY_OP_MULT, int_type, + param_i, param_i); +@end example + +@noindent + +A @code{gccjit::rvalue} is another example of a +@code{gccjit::object} subclass. As before, we can print it with +@pxref{cc,,gccjit;;object;;get_debug_string()}. + +@example +printf ("expr: %s\n", expr.get_debug_string ().c_str ()); +@end example + +@noindent + +giving this output: + +@example +expr: i * i +@end example + +@noindent + +Note that @code{gccjit::rvalue} provides numerous overloaded operators +which can be used to dramatically reduce the amount of typing needed. +We can build the above binary operation more directly with this one-liner: + +@example +gccjit::rvalue expr = param_i * param_i; +@end example + +@noindent + +Creating the expression in itself doesn't do anything; we have to add +this expression to a statement within the block. In this case, we use it +to build a return statement, which terminates the basic block: + +@example +block.end_with_return (expr); +@end example + +@noindent + +OK, we've populated the context. We can now compile it using +@pxref{cf,,gccjit;;context;;compile()}: + +@example +gcc_jit_result *result; +result = ctxt.compile (); +@end example + +@noindent + +and get a @pxref{16,,gcc_jit_result *}. + +We can now use @pxref{17,,gcc_jit_result_get_code()} to look up a specific +machine code routine within the result, in this case, the function we +created above. + +@example +void *fn_ptr = gcc_jit_result_get_code (result, "square"); +if (!fn_ptr) + @{ + fprintf (stderr, "NULL fn_ptr"); + goto error; + @} +@end example + +@noindent + +We can now cast the pointer to an appropriate function pointer type, and +then call it: + +@example +typedef int (*fn_type) (int); +fn_type square = (fn_type)fn_ptr; +printf ("result: %d", square (5)); +@end example + +@noindent + +@example +result: 25 +@end example + +@noindent + +@menu +* Options: Options<3>. +* Full example: Full example<3>. + +@end menu + +@node Options<3>,Full example<3>,,Tutorial part 2 Creating a trivial machine code function<2> +@anchor{cp/intro/tutorial02 options}@anchor{d0} +@subsubsection Options + + +To get more information on what's going on, you can set debugging flags +on the context using @pxref{d1,,gccjit;;context;;set_bool_option()}. + +@c (I'm deliberately not mentioning +@c :c:macro:`GCC_JIT_BOOL_OPTION_DUMP_INITIAL_TREE` here since I think +@c it's probably more of use to implementors than to users) + +Setting @pxref{1c,,GCC_JIT_BOOL_OPTION_DUMP_INITIAL_GIMPLE} will dump a +C-like representation to stderr when you compile (GCC's "GIMPLE" +representation): + +@example +ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DUMP_INITIAL_GIMPLE, 1); +result = ctxt.compile (); +@end example + +@noindent + +@example +square (signed int i) +@{ + signed int D.260; + + entry: + D.260 = i * i; + return D.260; +@} +@end example + +@noindent + +We can see the generated machine code in assembler form (on stderr) by +setting @pxref{1d,,GCC_JIT_BOOL_OPTION_DUMP_GENERATED_CODE} on the context +before compiling: + +@example +ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DUMP_GENERATED_CODE, 1); +result = ctxt.compile (); +@end example + +@noindent + +@example + .file "fake.c" + .text + .globl square + .type square, @@function +square: +.LFB6: + .cfi_startproc + pushq %rbp + .cfi_def_cfa_offset 16 + .cfi_offset 6, -16 + movq %rsp, %rbp + .cfi_def_cfa_register 6 + movl %edi, -4(%rbp) +.L14: + movl -4(%rbp), %eax + imull -4(%rbp), %eax + popq %rbp + .cfi_def_cfa 7, 8 + ret + .cfi_endproc +.LFE6: + .size square, .-square + .ident "GCC: (GNU) 4.9.0 20131023 (Red Hat 0.2-0.5.1920c315ff984892399893b380305ab36e07b455.fc20)" + .section .note.GNU-stack,"",@@progbits +@end example + +@noindent + +By default, no optimizations are performed, the equivalent of GCC's +@cite{-O0} option. We can turn things up to e.g. @cite{-O3} by calling +@pxref{d2,,gccjit;;context;;set_int_option()} with +@pxref{1f,,GCC_JIT_INT_OPTION_OPTIMIZATION_LEVEL}: + +@example +ctxt.set_int_option (GCC_JIT_INT_OPTION_OPTIMIZATION_LEVEL, 3); +@end example + +@noindent + +@example + .file "fake.c" + .text + .p2align 4,,15 + .globl square + .type square, @@function +square: +.LFB7: + .cfi_startproc +.L16: + movl %edi, %eax + imull %edi, %eax + ret + .cfi_endproc +.LFE7: + .size square, .-square + .ident "GCC: (GNU) 4.9.0 20131023 (Red Hat 0.2-0.5.1920c315ff984892399893b380305ab36e07b455.fc20)" + .section .note.GNU-stack,"",@@progbits +@end example + +@noindent + +Naturally this has only a small effect on such a trivial function. + +@node Full example<3>,,Options<3>,Tutorial part 2 Creating a trivial machine code function<2> +@anchor{cp/intro/tutorial02 full-example}@anchor{d3} +@subsubsection Full example + + +Here's what the above looks like as a complete program: + +@quotation + +@example +/* Usage example for libgccjit.so's C++ API + Copyright (C) 2014 Free Software Foundation, Inc. + +This file is part of GCC. + +GCC is free software; you can redistribute it and/or modify it +under the terms of the GNU General Public License as published by +the Free Software Foundation; either version 3, or (at your option) +any later version. + +GCC is distributed in the hope that it will be useful, but +WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +General Public License for more details. + +You should have received a copy of the GNU General Public License +along with GCC; see the file COPYING3. If not see +. */ + +#include + +#include +#include + +void +create_code (gccjit::context ctxt) +@{ + /* Let's try to inject the equivalent of this C code: + + int square (int i) + @{ + return i * i; + @} + */ + gccjit::type int_type = ctxt.get_type (GCC_JIT_TYPE_INT); + gccjit::param param_i = ctxt.new_param (int_type, "i"); + std::vector params; + params.push_back (param_i); + gccjit::function func = ctxt.new_function (GCC_JIT_FUNCTION_EXPORTED, + int_type, + "square", + params, 0); + + gccjit::block block = func.new_block (); + + gccjit::rvalue expr = + ctxt.new_binary_op (GCC_JIT_BINARY_OP_MULT, int_type, + param_i, param_i); + + block.end_with_return (expr); +@} + +int +main (int argc, char **argv) +@{ + /* Get a "context" object for working with the library. */ + gccjit::context ctxt = gccjit::context::acquire (); + + /* Set some options on the context. + Turn this on to see the code being generated, in assembler form. */ + ctxt.set_bool_option ( + GCC_JIT_BOOL_OPTION_DUMP_GENERATED_CODE, + 0); + + /* Populate the context. */ + create_code (ctxt); + + /* Compile the code. */ + gcc_jit_result *result = ctxt.compile (); + + /* We're done with the context; we can release it: */ + ctxt.release (); + + if (!result) + @{ + fprintf (stderr, "NULL result"); + return 1; + @} + + /* Extract the generated code from "result". */ + void *fn_ptr = gcc_jit_result_get_code (result, "square"); + if (!fn_ptr) + @{ + fprintf (stderr, "NULL fn_ptr"); + gcc_jit_result_release (result); + return 1; + @} + + typedef int (*fn_type) (int); + fn_type square = (fn_type)fn_ptr; + printf ("result: %d\n", square (5)); + + gcc_jit_result_release (result); + return 0; +@} + +@end example + +@noindent +@end quotation + +Building and running it: + +@example +$ gcc \ + tut02-square.cc \ + -o tut02-square \ + -lgccjit + +# Run the built program: +$ ./tut02-square +result: 25 +@end example + +@noindent + +@c Copyright (C) 2014 Free Software Foundation, Inc. +@c Originally contributed by David Malcolm +@c +@c This is free software: you can redistribute it and/or modify it +@c under the terms of the GNU General Public License as published by +@c the Free Software Foundation, either version 3 of the License, or +@c (at your option) any later version. +@c +@c This program is distributed in the hope that it will be useful, but +@c WITHOUT ANY WARRANTY; without even the implied warranty of +@c MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +@c General Public License for more details. +@c +@c You should have received a copy of the GNU General Public License +@c along with this program. If not, see +@c . + +@node Tutorial part 3 Loops and variables<2>,Tutorial part 4 Adding JIT-compilation to a toy interpreter<2>,Tutorial part 2 Creating a trivial machine code function<2>,Tutorial<2> +@anchor{cp/intro/tutorial03 tutorial-part-3-loops-and-variables}@anchor{d4}@anchor{cp/intro/tutorial03 doc}@anchor{d5} +@subsection Tutorial part 3: Loops and variables + + +Consider this C function: + +@quotation + +@example +int loop_test (int n) +@{ + int sum = 0; + for (int i = 0; i < n; i++) + sum += i * i; + return sum; +@} +@end example + +@noindent +@end quotation + +This example demonstrates some more features of libgccjit, with local +variables and a loop. + +To break this down into libgccjit terms, it's usually easier to reword +the @cite{for} loop as a @cite{while} loop, giving: + +@quotation + +@example +int loop_test (int n) +@{ + int sum = 0; + int i = 0; + while (i < n) + @{ + sum += i * i; + i++; + @} + return sum; +@} +@end example + +@noindent +@end quotation + +Here's what the final control flow graph will look like: + +@quotation + + +@float Figure + +@image{sum-of-squares1,,,image of a control flow graph,png} + +@end float + +@end quotation + +As before, we include the libgccjit++ header and make a +@code{gccjit::context}. + +@example +#include + +void test (void) +@{ + gccjit::context ctxt; + ctxt = gccjit::context::acquire (); +@end example + +@noindent + +The function works with the C @cite{int} type. + +In the previous tutorial we acquired this via + +@example +gccjit::type the_type = ctxt.get_type (ctxt, GCC_JIT_TYPE_INT); +@end example + +@noindent + +though we could equally well make it work on, say, @cite{double}: + +@example +gccjit::type the_type = ctxt.get_type (ctxt, GCC_JIT_TYPE_DOUBLE); +@end example + +@noindent + +For integer types we can use @code{gccjit::context::get_int_type} +to directly bind a specific type: + +@example +gccjit::type the_type = ctxt.get_int_type (); +@end example + +@noindent + +Let's build the function: + +@example +gcc_jit_param n = ctxt.new_param (the_type, "n"); +std::vector params; +params.push_back (n); +gccjit::function func = + ctxt.new_function (GCC_JIT_FUNCTION_EXPORTED, + return_type, + "loop_test", + params, 0); +@end example + +@noindent + +@menu +* Expressions; lvalues and rvalues: Expressions lvalues and rvalues<2>. +* Control flow: Control flow<2>. +* Visualizing the control flow graph: Visualizing the control flow graph<2>. +* Full example: Full example<4>. + +@end menu + +@node Expressions lvalues and rvalues<2>,Control flow<2>,,Tutorial part 3 Loops and variables<2> +@anchor{cp/intro/tutorial03 expressions-lvalues-and-rvalues}@anchor{d6} +@subsubsection Expressions: lvalues and rvalues + + +The base class of expression is the @code{gccjit::rvalue}, +representing an expression that can be on the @emph{right}-hand side of +an assignment: a value that can be computed somehow, and assigned +@emph{to} a storage area (such as a variable). It has a specific +@code{gccjit::type}. + +Anothe important class is @code{gccjit::lvalue}. +A @code{gccjit::lvalue}. is something that can of the @emph{left}-hand +side of an assignment: a storage area (such as a variable). + +In other words, every assignment can be thought of as: + +@example +LVALUE = RVALUE; +@end example + +@noindent + +Note that @code{gccjit::lvalue} is a subclass of +@code{gccjit::rvalue}, where in an assignment of the form: + +@example +LVALUE_A = LVALUE_B; +@end example + +@noindent + +the @cite{LVALUE_B} implies reading the current value of that storage +area, assigning it into the @cite{LVALUE_A}. + +So far the only expressions we've seen are from the previous tutorial: + + +@enumerate + +@item +the multiplication @cite{i * i}: +@end enumerate + +@quotation + +@example +gccjit::rvalue expr = + ctxt.new_binary_op ( + GCC_JIT_BINARY_OP_MULT, int_type, + param_i, param_i); + +/* Alternatively, using operator-overloading: */ +gccjit::rvalue expr = param_i * param_i; +@end example + +@noindent + +which is a @code{gccjit::rvalue}, and +@end quotation + + +@enumerate 2 + +@item +the various function parameters: @cite{param_i} and @cite{param_n}, instances of +@code{gccjit::param}, which is a subclass of @code{gccjit::lvalue} +(and, in turn, of @code{gccjit::rvalue}): +we can both read from and write to function parameters within the +body of a function. +@end enumerate + +Our new example has a new kind of expression: we have two local +variables. We create them by calling +@pxref{d7,,gccjit;;function;;new_local()}, supplying a type and a name: + +@example +/* Build locals: */ +gccjit::lvalue i = func.new_local (the_type, "i"); +gccjit::lvalue sum = func.new_local (the_type, "sum"); +@end example + +@noindent + +These are instances of @code{gccjit::lvalue} - they can be read from +and written to. + +Note that there is no precanned way to create @emph{and} initialize a variable +like in C: + +@example +int i = 0; +@end example + +@noindent + +Instead, having added the local to the function, we have to separately add +an assignment of @cite{0} to @cite{local_i} at the beginning of the function. + +@node Control flow<2>,Visualizing the control flow graph<2>,Expressions lvalues and rvalues<2>,Tutorial part 3 Loops and variables<2> +@anchor{cp/intro/tutorial03 control-flow}@anchor{d8} +@subsubsection Control flow + + +This function has a loop, so we need to build some basic blocks to +handle the control flow. In this case, we need 4 blocks: + + +@enumerate + +@item +before the loop (initializing the locals) + +@item +the conditional at the top of the loop (comparing @cite{i < n}) + +@item +the body of the loop + +@item +after the loop terminates (@cite{return sum}) +@end enumerate + +so we create these as @code{gccjit::block} instances within the +@code{gccjit::function}: + +@example +gccjit::block b_initial = func.new_block ("initial"); +gccjit::block b_loop_cond = func.new_block ("loop_cond"); +gccjit::block b_loop_body = func.new_block ("loop_body"); +gccjit::block b_after_loop = func.new_block ("after_loop"); +@end example + +@noindent + +We now populate each block with statements. + +The entry block @cite{b_initial} consists of initializations followed by a jump +to the conditional. We assign @cite{0} to @cite{i} and to @cite{sum}, using +@pxref{d9,,gccjit;;block;;add_assignment()} to add +an assignment statement, and using @pxref{da,,gccjit;;context;;zero()} to get +the constant value @cite{0} for the relevant type for the right-hand side of +the assignment: + +@example +/* sum = 0; */ +b_initial.add_assignment (sum, ctxt.zero (the_type)); + +/* i = 0; */ +b_initial.add_assignment (i, ctxt.zero (the_type)); +@end example + +@noindent + +We can then terminate the entry block by jumping to the conditional: + +@example +b_initial.end_with_jump (b_loop_cond); +@end example + +@noindent + +The conditional block is equivalent to the line @cite{while (i < n)} from our +C example. It contains a single statement: a conditional, which jumps to +one of two destination blocks depending on a boolean +@code{gccjit::rvalue}, in this case the comparison of @cite{i} and @cite{n}. + +We could build the comparison using @pxref{db,,gccjit;;context;;new_comparison()}: + +@example +gccjit::rvalue guard = + ctxt.new_comparison (GCC_JIT_COMPARISON_GE, + i, n); +@end example + +@noindent + +and can then use this to add @cite{b_loop_cond}'s sole statement, via +@pxref{dc,,gccjit;;block;;end_with_conditional()}: + +@example +b_loop_cond.end_with_conditional (guard); +@end example + +@noindent + +However @code{gccjit::rvalue} has overloaded operators for this, so we +express the conditional as + +@example +gccjit::rvalue guard = (i >= n); +@end example + +@noindent + +and hence write the block more concisely as: + +@example +b_loop_cond.end_with_conditional ( + i >= n, + b_after_loop, + b_loop_body); +@end example + +@noindent + +Next, we populate the body of the loop. + +The C statement @cite{sum += i * i;} is an assignment operation, where an +lvalue is modified "in-place". We use +@pxref{dd,,gccjit;;block;;add_assignment_op()} to handle these operations: + +@example +/* sum += i * i */ +b_loop_body.add_assignment_op (sum, + GCC_JIT_BINARY_OP_PLUS, + i * i); +@end example + +@noindent + +The @cite{i++} can be thought of as @cite{i += 1}, and can thus be handled in +a similar way. We use @pxref{2f,,gcc_jit_context_one()} to get the constant +value @cite{1} (for the relevant type) for the right-hand side +of the assignment. + +@example +/* i++ */ +b_loop_body.add_assignment_op (i, + GCC_JIT_BINARY_OP_PLUS, + ctxt.one (the_type)); +@end example + +@noindent + +@cartouche +@quotation Note +For numeric constants other than 0 or 1, we could use +@pxref{de,,gccjit;;context;;new_rvalue()}, which has overloads +for both @code{int} and @code{double}. +@end quotation +@end cartouche + +The loop body completes by jumping back to the conditional: + +@example +b_loop_body.end_with_jump (b_loop_cond); +@end example + +@noindent + +Finally, we populate the @cite{b_after_loop} block, reached when the loop +conditional is false. We want to generate the equivalent of: + +@example +return sum; +@end example + +@noindent + +so the block is just one statement: + +@example +/* return sum */ +b_after_loop.end_with_return (sum); +@end example + +@noindent + +@cartouche +@quotation Note +You can intermingle block creation with statement creation, +but given that the terminator statements generally include references +to other blocks, I find it's clearer to create all the blocks, +@emph{then} all the statements. +@end quotation +@end cartouche + +We've finished populating the function. As before, we can now compile it +to machine code: + +@example +gcc_jit_result *result; +result = ctxt.compile (); + +ctxt.release (); + +if (!result) + @{ + fprintf (stderr, "NULL result"); + return 1; + @} + +typedef int (*loop_test_fn_type) (int); +loop_test_fn_type loop_test = + (loop_test_fn_type)gcc_jit_result_get_code (result, "loop_test"); +if (!loop_test) + @{ + fprintf (stderr, "NULL loop_test"); + gcc_jit_result_release (result); + return 1; + @} +printf ("result: %d", loop_test (10)); +@end example + +@noindent + +@example +result: 285 +@end example + +@noindent + +@node Visualizing the control flow graph<2>,Full example<4>,Control flow<2>,Tutorial part 3 Loops and variables<2> +@anchor{cp/intro/tutorial03 visualizing-the-control-flow-graph}@anchor{df} +@subsubsection Visualizing the control flow graph + + +You can see the control flow graph of a function using +@pxref{e0,,gccjit;;function;;dump_to_dot()}: + +@example +func.dump_to_dot ("/tmp/sum-of-squares.dot"); +@end example + +@noindent + +giving a .dot file in GraphViz format. + +You can convert this to an image using @cite{dot}: + +@example +$ dot -Tpng /tmp/sum-of-squares.dot -o /tmp/sum-of-squares.png +@end example + +@noindent + +or use a viewer (my preferred one is xdot.py; see +@indicateurl{https://github.com/jrfonseca/xdot.py}; on Fedora you can +install it with @cite{yum install python-xdot}): + +@quotation + + +@float Figure + +@image{sum-of-squares1,,,image of a control flow graph,png} + +@end float + +@end quotation + +@node Full example<4>,,Visualizing the control flow graph<2>,Tutorial part 3 Loops and variables<2> +@anchor{cp/intro/tutorial03 full-example}@anchor{e1} +@subsubsection Full example + + +@quotation + +@example +/* Usage example for libgccjit.so's C++ API + Copyright (C) 2014 Free Software Foundation, Inc. + +This file is part of GCC. + +GCC is free software; you can redistribute it and/or modify it +under the terms of the GNU General Public License as published by +the Free Software Foundation; either version 3, or (at your option) +any later version. + +GCC is distributed in the hope that it will be useful, but +WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +General Public License for more details. + +You should have received a copy of the GNU General Public License +along with GCC; see the file COPYING3. If not see +. */ + +#include + +#include +#include + +void +create_code (gccjit::context ctxt) +@{ + /* + Simple sum-of-squares, to test conditionals and looping + + int loop_test (int n) + @{ + int i; + int sum = 0; + for (i = 0; i < n ; i ++) + @{ + sum += i * i; + @} + return sum; + */ + gccjit::type the_type = ctxt.get_int_type (); + gccjit::type return_type = the_type; + + gccjit::param n = ctxt.new_param (the_type, "n"); + std::vector params; + params.push_back (n); + gccjit::function func = + ctxt.new_function (GCC_JIT_FUNCTION_EXPORTED, + return_type, + "loop_test", + params, 0); + + /* Build locals: */ + gccjit::lvalue i = func.new_local (the_type, "i"); + gccjit::lvalue sum = func.new_local (the_type, "sum"); + + gccjit::block b_initial = func.new_block ("initial"); + gccjit::block b_loop_cond = func.new_block ("loop_cond"); + gccjit::block b_loop_body = func.new_block ("loop_body"); + gccjit::block b_after_loop = func.new_block ("after_loop"); + + /* sum = 0; */ + b_initial.add_assignment (sum, ctxt.zero (the_type)); + + /* i = 0; */ + b_initial.add_assignment (i, ctxt.zero (the_type)); + + b_initial.end_with_jump (b_loop_cond); + + /* if (i >= n) */ + b_loop_cond.end_with_conditional ( + i >= n, + b_after_loop, + b_loop_body); + + /* sum += i * i */ + b_loop_body.add_assignment_op (sum, + GCC_JIT_BINARY_OP_PLUS, + i * i); + + /* i++ */ + b_loop_body.add_assignment_op (i, + GCC_JIT_BINARY_OP_PLUS, + ctxt.one (the_type)); + + b_loop_body.end_with_jump (b_loop_cond); + + /* return sum */ + b_after_loop.end_with_return (sum); +@} + +int +main (int argc, char **argv) +@{ + gccjit::context ctxt; + gcc_jit_result *result = NULL; + + /* Get a "context" object for working with the library. */ + ctxt = gccjit::context::acquire (); + + /* Set some options on the context. + Turn this on to see the code being generated, in assembler form. */ + ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DUMP_GENERATED_CODE, + 0); + + /* Populate the context. */ + create_code (ctxt); + + /* Compile the code. */ + result = ctxt.compile (); + + ctxt.release (); + + if (!result) + @{ + fprintf (stderr, "NULL result"); + return 1; + @} + + /* Extract the generated code from "result". */ + typedef int (*loop_test_fn_type) (int); + loop_test_fn_type loop_test = + (loop_test_fn_type)gcc_jit_result_get_code (result, "loop_test"); + if (!loop_test) + @{ + fprintf (stderr, "NULL loop_test"); + gcc_jit_result_release (result); + return 1; + @} + + /* Run the generated code. */ + int val = loop_test (10); + printf("loop_test returned: %d\n", val); + + gcc_jit_result_release (result); + return 0; +@} + +@end example + +@noindent +@end quotation + +Building and running it: + +@example +$ gcc \ + tut03-sum-of-squares.cc \ + -o tut03-sum-of-squares \ + -lgccjit + +# Run the built program: +$ ./tut03-sum-of-squares +loop_test returned: 285 +@end example + +@noindent + +@c Copyright (C) 2014 Free Software Foundation, Inc. +@c Originally contributed by David Malcolm +@c +@c This is free software: you can redistribute it and/or modify it +@c under the terms of the GNU General Public License as published by +@c the Free Software Foundation, either version 3 of the License, or +@c (at your option) any later version. +@c +@c This program is distributed in the hope that it will be useful, but +@c WITHOUT ANY WARRANTY; without even the implied warranty of +@c MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +@c General Public License for more details. +@c +@c You should have received a copy of the GNU General Public License +@c along with this program. If not, see +@c . + +@node Tutorial part 4 Adding JIT-compilation to a toy interpreter<2>,,Tutorial part 3 Loops and variables<2>,Tutorial<2> +@anchor{cp/intro/tutorial04 tutorial-part-4-adding-jit-compilation-to-a-toy-interpreter}@anchor{e2}@anchor{cp/intro/tutorial04 doc}@anchor{e3} +@subsection Tutorial part 4: Adding JIT-compilation to a toy interpreter + + +In this example we construct a "toy" interpreter, and add JIT-compilation +to it. + +@menu +* Our toy interpreter: Our toy interpreter<2>. +* Compiling to machine code: Compiling to machine code<2>. +* Setting things up: Setting things up<2>. +* Populating the function: Populating the function<2>. +* Verifying the control flow graph: Verifying the control flow graph<2>. +* Compiling the context: Compiling the context<2>. +* Single-stepping through the generated code: Single-stepping through the generated code<2>. +* Examining the generated code: Examining the generated code<2>. +* Putting it all together: Putting it all together<2>. +* Behind the curtain; How does our code get optimized?: Behind the curtain How does our code get optimized?<2>. + +@end menu + +@node Our toy interpreter<2>,Compiling to machine code<2>,,Tutorial part 4 Adding JIT-compilation to a toy interpreter<2> +@anchor{cp/intro/tutorial04 our-toy-interpreter}@anchor{e4} +@subsubsection Our toy interpreter + + +It's a stack-based interpreter, and is intended as a (very simple) example +of the kind of bytecode interpreter seen in dynamic languages such as +Python, Ruby etc. + +For the sake of simplicity, our toy virtual machine is very limited: + +@quotation + + +@itemize * + +@item +The only data type is @cite{int} + +@item +It can only work on one function at a time (so that the only +function call that can be made is to recurse). + +@item +Functions can only take one parameter. + +@item +Functions have a stack of @cite{int} values. + +@item +We'll implement function call within the interpreter by calling a +function in our implementation, rather than implementing our own +frame stack. + +@item +The parser is only good enough to get the examples to work. +@end itemize +@end quotation + +Naturally, a real interpreter would be much more complicated that this. + +The following operations are supported: + + +@multitable {xxxxxxxxxxxxxxxxxxxxxxxx} {xxxxxxxxxxxxxxxxxxxxxxxxxx} {xxxxxxxxxxxxxxxxx} {xxxxxxxxxxxxxxxxxx} +@headitem + +Operation + +@tab + +Meaning + +@tab + +Old Stack + +@tab + +New Stack + +@item + +DUP + +@tab + +Duplicate top of stack. + +@tab + +@code{[..., x]} + +@tab + +@code{[..., x, x]} + +@item + +ROT + +@tab + +Swap top two elements +of stack. + +@tab + +@code{[..., x, y]} + +@tab + +@code{[..., y, x]} + +@item + +BINARY_ADD + +@tab + +Add the top two elements +on the stack. + +@tab + +@code{[..., x, y]} + +@tab + +@code{[..., (x+y)]} + +@item + +BINARY_SUBTRACT + +@tab + +Likewise, but subtract. + +@tab + +@code{[..., x, y]} + +@tab + +@code{[..., (x-y)]} + +@item + +BINARY_MULT + +@tab + +Likewise, but multiply. + +@tab + +@code{[..., x, y]} + +@tab + +@code{[..., (x*y)]} + +@item + +BINARY_COMPARE_LT + +@tab + +Compare the top two +elements on the stack +and push a nonzero/zero +if (xop_opcode) + @{ + /* Ops taking no operand. */ + case DUP: + x = POP (); + PUSH (x); + PUSH (x); + break; + + case ROT: + y = POP (); + x = POP (); + PUSH (y); + PUSH (x); + break; + + case BINARY_ADD: + y = POP (); + x = POP (); + PUSH (x + y); + break; + + case BINARY_SUBTRACT: + y = POP (); + x = POP (); + PUSH (x - y); + break; + + case BINARY_MULT: + y = POP (); + x = POP (); + PUSH (x * y); + break; + + case BINARY_COMPARE_LT: + y = POP (); + x = POP (); + PUSH (x < y); + break; + + case RECURSE: + x = POP (); + x = interpret (x, trace); + PUSH (x); + break; + + case RETURN: + return POP (); + + /* Ops taking an operand. */ + case PUSH_CONST: + PUSH (op->op_operand); + break; + + case JUMP_ABS_IF_TRUE: + x = POP (); + if (x) + frame.frm_pc = op->op_operand; + break; + + default: + assert (0); /* unknown opcode */ + + @} /* end of switch on opcode */ + @} /* end of while loop */ + +#undef PUSH +#undef POP +@} + + +@end example + +@noindent +@end quotation + +@node Compiling to machine code<2>,Setting things up<2>,Our toy interpreter<2>,Tutorial part 4 Adding JIT-compilation to a toy interpreter<2> +@anchor{cp/intro/tutorial04 compiling-to-machine-code}@anchor{e5} +@subsubsection Compiling to machine code + + +We want to generate machine code that can be cast to this type and +then directly executed in-process: + +@quotation + +@example +typedef int (*toyvm_compiled_func) (int); + + +@end example + +@noindent +@end quotation + +Our compiler isn't very sophisticated; it takes the implementation of +each opcode above, and maps it directly to the operations supported by +the libgccjit API. + +How should we handle the stack? In theory we could calculate what the +stack depth will be at each opcode, and optimize away the stack +manipulation "by hand". We'll see below that libgccjit is able to do +this for us, so we'll implement stack manipulation +in a direct way, by creating a @code{stack} array and @code{stack_depth} +variables, local within the generated function, equivalent to this C code: + +@example +int stack_depth; +int stack[MAX_STACK_DEPTH]; +@end example + +@noindent + +We'll also have local variables @code{x} and @code{y} for use when implementing +the opcodes, equivalent to this: + +@example +int x; +int y; +@end example + +@noindent + +This means our compiler has the following state: + +@quotation + +@example + + toyvm_function &toyvmfn; + + gccjit::context ctxt; + + gccjit::type int_type; + gccjit::type bool_type; + gccjit::type stack_type; /* int[MAX_STACK_DEPTH] */ + + gccjit::rvalue const_one; + + gccjit::function fn; + gccjit::param param_arg; + gccjit::lvalue stack; + gccjit::lvalue stack_depth; + gccjit::lvalue x; + gccjit::lvalue y; + + gccjit::location op_locs[MAX_OPS]; + gccjit::block initial_block; + gccjit::block op_blocks[MAX_OPS]; + + +@end example + +@noindent +@end quotation + +@node Setting things up<2>,Populating the function<2>,Compiling to machine code<2>,Tutorial part 4 Adding JIT-compilation to a toy interpreter<2> +@anchor{cp/intro/tutorial04 setting-things-up}@anchor{e6} +@subsubsection Setting things up + + +First we create our types: + +@quotation + +@example + +void +compilation_state::create_types () +@{ + /* Create types. */ + int_type = ctxt.get_type (GCC_JIT_TYPE_INT); + bool_type = ctxt.get_type (GCC_JIT_TYPE_BOOL); + stack_type = ctxt.new_array_type (int_type, MAX_STACK_DEPTH); + + +@end example + +@noindent +@end quotation + +along with extracting a useful @cite{int} constant: + +@quotation + +@example + const_one = ctxt.one (int_type); + +@} + + +@end example + +@noindent +@end quotation + +We'll implement push and pop in terms of the @code{stack} array and +@code{stack_depth}. Here are helper functions for adding statements to +a block, implementing pushing and popping values: + +@quotation + +@example + +void +compilation_state::add_push (gccjit::block block, + gccjit::rvalue rvalue, + gccjit::location loc) +@{ + /* stack[stack_depth] = RVALUE */ + block.add_assignment ( + /* stack[stack_depth] */ + ctxt.new_array_access ( + stack, + stack_depth, + loc), + rvalue, + loc); + + /* "stack_depth++;". */ + block.add_assignment_op ( + stack_depth, + GCC_JIT_BINARY_OP_PLUS, + const_one, + loc); +@} + +void +compilation_state::add_pop (gccjit::block block, + gccjit::lvalue lvalue, + gccjit::location loc) +@{ + /* "--stack_depth;". */ + block.add_assignment_op ( + stack_depth, + GCC_JIT_BINARY_OP_MINUS, + const_one, + loc); + + /* "LVALUE = stack[stack_depth];". */ + block.add_assignment ( + lvalue, + /* stack[stack_depth] */ + ctxt.new_array_access (stack, + stack_depth, + loc), + loc); +@} + + +@end example + +@noindent +@end quotation + +We will support single-stepping through the generated code in the +debugger, so we need to create @code{gccjit::location} instances, one +per operation in the source code. These will reference the lines of +e.g. @code{factorial.toy}. + +@quotation + +@example + +void +compilation_state::create_locations () +@{ + for (int pc = 0; pc < toyvmfn.fn_num_ops; pc++) + @{ + toyvm_op *op = &toyvmfn.fn_ops[pc]; + + op_locs[pc] = ctxt.new_location (toyvmfn.fn_filename, + op->op_linenum, + 0); /* column */ + @} +@} + + +@end example + +@noindent +@end quotation + +Let's create the function itself. As usual, we create its parameter +first, then use the parameter to create the function: + +@quotation + +@example + +void +compilation_state::create_function (const char *funcname) +@{ + std::vector params; + param_arg = ctxt.new_param (int_type, "arg", op_locs[0]); + params.push_back (param_arg); + fn = ctxt.new_function (GCC_JIT_FUNCTION_EXPORTED, + int_type, + funcname, + params, 0, + op_locs[0]); + + +@end example + +@noindent +@end quotation + +We create the locals within the function. + +@quotation + +@example + stack = fn.new_local (stack_type, "stack"); + stack_depth = fn.new_local (int_type, "stack_depth"); + x = fn.new_local (int_type, "x"); + y = fn.new_local (int_type, "y"); + + +@end example + +@noindent +@end quotation + +@node Populating the function<2>,Verifying the control flow graph<2>,Setting things up<2>,Tutorial part 4 Adding JIT-compilation to a toy interpreter<2> +@anchor{cp/intro/tutorial04 populating-the-function}@anchor{e7} +@subsubsection Populating the function + + +There's some one-time initialization, and the API treats the first block +you create as the entrypoint of the function, so we need to create that +block first: + +@quotation + +@example + initial_block = fn.new_block ("initial"); + + +@end example + +@noindent +@end quotation + +We can now create blocks for each of the operations. Most of these will +be consolidated into larger blocks when the optimizer runs. + +@quotation + +@example + for (int pc = 0; pc < toyvmfn.fn_num_ops; pc++) + @{ + char buf[16]; + sprintf (buf, "instr%i", pc); + op_blocks[pc] = fn.new_block (buf); + @} + + +@end example + +@noindent +@end quotation + +Now that we have a block it can jump to when it's done, we can populate +the initial block: + +@quotation + +@example + + /* "stack_depth = 0;". */ + initial_block.add_assignment (stack_depth, + ctxt.zero (int_type), + op_locs[0]); + + /* "PUSH (arg);". */ + add_push (initial_block, + param_arg, + op_locs[0]); + + /* ...and jump to insn 0. */ + initial_block.end_with_jump (op_blocks[0], + op_locs[0]); + + +@end example + +@noindent +@end quotation + +We can now populate the blocks for the individual operations. We loop +through them, adding instructions to their blocks: + +@quotation + +@example + for (int pc = 0; pc < toyvmfn.fn_num_ops; pc++) + @{ + gccjit::location loc = op_locs[pc]; + + gccjit::block block = op_blocks[pc]; + gccjit::block next_block = (pc < toyvmfn.fn_num_ops + ? op_blocks[pc + 1] + : NULL); + + toyvm_op *op; + op = &toyvmfn.fn_ops[pc]; + + +@end example + +@noindent +@end quotation + +We're going to have another big @code{switch} statement for implementing +the opcodes, this time for compiling them, rather than interpreting +them. It's helpful to have macros for implementing push and pop, so that +we can make the @code{switch} statement that's coming up look as much as +possible like the one above within the interpreter: + +@example + +#define X_EQUALS_POP()\ + add_pop (block, x, loc) +#define Y_EQUALS_POP()\ + add_pop (block, y, loc) +#define PUSH_RVALUE(RVALUE)\ + add_push (block, (RVALUE), loc) +#define PUSH_X()\ + PUSH_RVALUE (x) +#define PUSH_Y() \ + PUSH_RVALUE (y) + + +@end example + +@noindent + +@cartouche +@quotation Note +A particularly clever implementation would have an @emph{identical} +@code{switch} statement shared by the interpreter and the compiler, with +some preprocessor "magic". We're not doing that here, for the sake +of simplicity. +@end quotation +@end cartouche + +When I first implemented this compiler, I accidentally missed an edit +when copying and pasting the @code{Y_EQUALS_POP} macro, so that popping the +stack into @code{y} instead erroneously assigned it to @code{x}, leaving @code{y} +uninitialized. + +To track this kind of thing down, we can use +@pxref{e8,,gccjit;;block;;add_comment()} to add descriptive comments +to the internal representation. This is invaluable when looking through +the generated IR for, say @code{factorial}: + +@quotation + +@example + + block.add_comment (opcode_names[op->op_opcode], loc); + + +@end example + +@noindent +@end quotation + +We can now write the big @code{switch} statement that implements the +individual opcodes, populating the relevant block with statements: + +@quotation + +@example + + switch (op->op_opcode) + @{ + case DUP: + X_EQUALS_POP (); + PUSH_X (); + PUSH_X (); + break; + + case ROT: + Y_EQUALS_POP (); + X_EQUALS_POP (); + PUSH_Y (); + PUSH_X (); + break; + + case BINARY_ADD: + Y_EQUALS_POP (); + X_EQUALS_POP (); + PUSH_RVALUE ( + ctxt.new_binary_op ( + GCC_JIT_BINARY_OP_PLUS, + int_type, + x, y, + loc)); + break; + + case BINARY_SUBTRACT: + Y_EQUALS_POP (); + X_EQUALS_POP (); + PUSH_RVALUE ( + ctxt.new_binary_op ( + GCC_JIT_BINARY_OP_MINUS, + int_type, + x, y, + loc)); + break; + + case BINARY_MULT: + Y_EQUALS_POP (); + X_EQUALS_POP (); + PUSH_RVALUE ( + ctxt.new_binary_op ( + GCC_JIT_BINARY_OP_MULT, + int_type, + x, y, + loc)); + break; + + case BINARY_COMPARE_LT: + Y_EQUALS_POP (); + X_EQUALS_POP (); + PUSH_RVALUE ( + /* cast of bool to int */ + ctxt.new_cast ( + /* (x < y) as a bool */ + ctxt.new_comparison ( + GCC_JIT_COMPARISON_LT, + x, y, + loc), + int_type, + loc)); + break; + + case RECURSE: + @{ + X_EQUALS_POP (); + PUSH_RVALUE ( + ctxt.new_call ( + fn, + x, + loc)); + break; + @} + + case RETURN: + X_EQUALS_POP (); + block.end_with_return (x, loc); + break; + + /* Ops taking an operand. */ + case PUSH_CONST: + PUSH_RVALUE ( + ctxt.new_rvalue (int_type, op->op_operand)); + break; + + case JUMP_ABS_IF_TRUE: + X_EQUALS_POP (); + block.end_with_conditional ( + /* "(bool)x". */ + ctxt.new_cast (x, bool_type, loc), + op_blocks[op->op_operand], /* on_true */ + next_block, /* on_false */ + loc); + break; + + default: + assert(0); + @} /* end of switch on opcode */ + + +@end example + +@noindent +@end quotation + +Every block must be terminated, via a call to one of the +@code{gccjit::block::end_with_} entrypoints. This has been done for two +of the opcodes, but we need to do it for the other ones, by jumping +to the next block. + +@quotation + +@example + if (op->op_opcode != JUMP_ABS_IF_TRUE + && op->op_opcode != RETURN) + block.end_with_jump (next_block, loc); + + +@end example + +@noindent +@end quotation + +This is analogous to simply incrementing the program counter. + +@node Verifying the control flow graph<2>,Compiling the context<2>,Populating the function<2>,Tutorial part 4 Adding JIT-compilation to a toy interpreter<2> +@anchor{cp/intro/tutorial04 verifying-the-control-flow-graph}@anchor{e9} +@subsubsection Verifying the control flow graph + + +Having finished looping over the blocks, the context is complete. + +As before, we can verify that the control flow and statements are sane by +using @pxref{e0,,gccjit;;function;;dump_to_dot()}: + +@example +fn.dump_to_dot ("/tmp/factorial.dot"); +@end example + +@noindent + +and viewing the result. Note how the label names, comments, and +variable names show up in the dump, to make it easier to spot +errors in our compiler. + +@quotation + + +@float Figure + +@image{factorial1,,,image of a control flow graph,png} + +@end float + +@end quotation + +@node Compiling the context<2>,Single-stepping through the generated code<2>,Verifying the control flow graph<2>,Tutorial part 4 Adding JIT-compilation to a toy interpreter<2> +@anchor{cp/intro/tutorial04 compiling-the-context}@anchor{ea} +@subsubsection Compiling the context + + +Having finished looping over the blocks and populating them with +statements, the context is complete. + +We can now compile it, and extract machine code from the result: + +@quotation + +@example + gcc_jit_result *result = state.compile (); + + return (toyvm_compiled_func)gcc_jit_result_get_code (result, funcname); + +@end example + +@noindent +@end quotation + +We can now run the result: + +@quotation + +@example + toyvm_compiled_func code = fn->compile (); + printf ("compiler result: %d\n", + code (atoi (argv[2]))); + + +@end example + +@noindent +@end quotation + +@node Single-stepping through the generated code<2>,Examining the generated code<2>,Compiling the context<2>,Tutorial part 4 Adding JIT-compilation to a toy interpreter<2> +@anchor{cp/intro/tutorial04 single-stepping-through-the-generated-code}@anchor{eb} +@subsubsection Single-stepping through the generated code + + +It's possible to debug the generated code. To do this we need to both: + +@quotation + + +@itemize * + +@item +Set up source code locations for our statements, so that we can +meaningfully step through the code. We did this above by +calling @pxref{ec,,gccjit;;context;;new_location()} and using the +results. + +@item +Enable the generation of debugging information, by setting +@pxref{42,,GCC_JIT_BOOL_OPTION_DEBUGINFO} on the +@code{gccjit::context} via +@pxref{d1,,gccjit;;context;;set_bool_option()}: + +@example +ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DEBUGINFO, 1); +@end example + +@noindent +@end itemize +@end quotation + +Having done this, we can put a breakpoint on the generated function: + +@example +$ gdb --args ./toyvm factorial.toy 10 +(gdb) break factorial +Function "factorial" not defined. +Make breakpoint pending on future shared library load? (y or [n]) y +Breakpoint 1 (factorial) pending. +(gdb) run +Breakpoint 1, factorial (arg=10) at factorial.toy:14 +14 DUP +@end example + +@noindent + +We've set up location information, which references @code{factorial.toy}. +This allows us to use e.g. @code{list} to see where we are in the script: + +@example +(gdb) list +9 +10 # Initial state: +11 # stack: [arg] +12 +13 # 0: +14 DUP +15 # stack: [arg, arg] +16 +17 # 1: +18 PUSH_CONST 2 +@end example + +@noindent + +and to step through the function, examining the data: + +@example +(gdb) n +18 PUSH_CONST 2 +(gdb) n +22 BINARY_COMPARE_LT +(gdb) print stack +$5 = @{10, 10, 2, 0, -7152, 32767, 0, 0@} +(gdb) print stack_depth +$6 = 3 +@end example + +@noindent + +You'll see that the parts of the @code{stack} array that haven't been +touched yet are uninitialized. + +@cartouche +@quotation Note +Turning on optimizations may lead to unpredictable results when +stepping through the generated code: the execution may appear to +"jump around" the source code. This is analogous to turning up the +optimization level in a regular compiler. +@end quotation +@end cartouche + +@node Examining the generated code<2>,Putting it all together<2>,Single-stepping through the generated code<2>,Tutorial part 4 Adding JIT-compilation to a toy interpreter<2> +@anchor{cp/intro/tutorial04 examining-the-generated-code}@anchor{ed} +@subsubsection Examining the generated code + + +How good is the optimized code? + +We can turn up optimizations, by calling +@pxref{d2,,gccjit;;context;;set_int_option()} with +@pxref{1f,,GCC_JIT_INT_OPTION_OPTIMIZATION_LEVEL}: + +@example +ctxt.set_int_option (GCC_JIT_INT_OPTION_OPTIMIZATION_LEVEL, 3); +@end example + +@noindent + +One of GCC's internal representations is called "gimple". A dump of the +initial gimple representation of the code can be seen by setting: + +@example +ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DUMP_INITIAL_GIMPLE, 1); +@end example + +@noindent + +With optimization on and source locations displayed, this gives: + +@c We'll use "c" for gimple dumps + +@example +factorial (signed int arg) +@{ + D.80; + signed int D.81; + signed int D.82; + signed int D.83; + signed int D.84; + signed int D.85; + signed int y; + signed int x; + signed int stack_depth; + signed int stack[8]; + + try + @{ + initial: + stack_depth = 0; + stack[stack_depth] = arg; + stack_depth = stack_depth + 1; + goto instr0; + instr0: + /* DUP */: + stack_depth = stack_depth + -1; + x = stack[stack_depth]; + stack[stack_depth] = x; + stack_depth = stack_depth + 1; + stack[stack_depth] = x; + stack_depth = stack_depth + 1; + goto instr1; + instr1: + /* PUSH_CONST */: + stack[stack_depth] = 2; + stack_depth = stack_depth + 1; + goto instr2; + + /* etc */ +@end example + +@noindent + +You can see the generated machine code in assembly form via: + +@example +ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DUMP_GENERATED_CODE, 1); +result = ctxt.compile (); +@end example + +@noindent + +which shows that (on this x86_64 box) the compiler has unrolled the loop +and is using MMX instructions to perform several multiplications +simultaneously: + +@example + .file "fake.c" + .text +.Ltext0: + .p2align 4,,15 + .globl factorial + .type factorial, @@function +factorial: +.LFB0: + .file 1 "factorial.toy" + .loc 1 14 0 + .cfi_startproc +.LVL0: +.L2: + .loc 1 26 0 + cmpl $1, %edi + jle .L13 + leal -1(%rdi), %edx + movl %edx, %ecx + shrl $2, %ecx + leal 0(,%rcx,4), %esi + testl %esi, %esi + je .L14 + cmpl $9, %edx + jbe .L14 + leal -2(%rdi), %eax + movl %eax, -16(%rsp) + leal -3(%rdi), %eax + movd -16(%rsp), %xmm0 + movl %edi, -16(%rsp) + movl %eax, -12(%rsp) + movd -16(%rsp), %xmm1 + xorl %eax, %eax + movl %edx, -16(%rsp) + movd -12(%rsp), %xmm4 + movd -16(%rsp), %xmm6 + punpckldq %xmm4, %xmm0 + movdqa .LC1(%rip), %xmm4 + punpckldq %xmm6, %xmm1 + punpcklqdq %xmm0, %xmm1 + movdqa .LC0(%rip), %xmm0 + jmp .L5 + # etc - edited for brevity +@end example + +@noindent + +This is clearly overkill for a function that will likely overflow the +@code{int} type before the vectorization is worthwhile - but then again, this +is a toy example. + +Turning down the optimization level to 2: + +@example +ctxt.set_int_option (GCC_JIT_INT_OPTION_OPTIMIZATION_LEVEL, 2); +@end example + +@noindent + +yields this code, which is simple enough to quote in its entirety: + +@example + .file "fake.c" + .text + .p2align 4,,15 + .globl factorial + .type factorial, @@function +factorial: +.LFB0: + .cfi_startproc +.L2: + cmpl $1, %edi + jle .L8 + movl $1, %edx + jmp .L4 + .p2align 4,,10 + .p2align 3 +.L6: + movl %eax, %edi +.L4: +.L5: + leal -1(%rdi), %eax + imull %edi, %edx + cmpl $1, %eax + jne .L6 +.L3: +.L7: + imull %edx, %eax + ret +.L8: + movl %edi, %eax + movl $1, %edx + jmp .L7 + .cfi_endproc +.LFE0: + .size factorial, .-factorial + .ident "GCC: (GNU) 4.9.0 20131023 (Red Hat 0.2-%@{gcc_release@})" + .section .note.GNU-stack,"",@@progbits +@end example + +@noindent + +Note that the stack pushing and popping have been eliminated, as has the +recursive call (in favor of an iteration). + +@node Putting it all together<2>,Behind the curtain How does our code get optimized?<2>,Examining the generated code<2>,Tutorial part 4 Adding JIT-compilation to a toy interpreter<2> +@anchor{cp/intro/tutorial04 putting-it-all-together}@anchor{ee} +@subsubsection Putting it all together + + +The complete example can be seen in the source tree at +@code{gcc/jit/docs/examples/tut04-toyvm/toyvm.cc} + +along with a Makefile and a couple of sample .toy scripts: + +@example +$ ls -al +drwxrwxr-x. 2 david david 4096 Sep 19 17:46 . +drwxrwxr-x. 3 david david 4096 Sep 19 15:26 .. +-rw-rw-r--. 1 david david 615 Sep 19 12:43 factorial.toy +-rw-rw-r--. 1 david david 834 Sep 19 13:08 fibonacci.toy +-rw-rw-r--. 1 david david 238 Sep 19 14:22 Makefile +-rw-rw-r--. 1 david david 16457 Sep 19 17:07 toyvm.cc + +$ make toyvm +g++ -Wall -g -o toyvm toyvm.cc -lgccjit + +$ ./toyvm factorial.toy 10 +interpreter result: 3628800 +compiler result: 3628800 + +$ ./toyvm fibonacci.toy 10 +interpreter result: 55 +compiler result: 55 +@end example + +@noindent + +@node Behind the curtain How does our code get optimized?<2>,,Putting it all together<2>,Tutorial part 4 Adding JIT-compilation to a toy interpreter<2> +@anchor{cp/intro/tutorial04 behind-the-curtain-how-does-our-code-get-optimized}@anchor{ef} +@subsubsection Behind the curtain: How does our code get optimized? + + +Our example is done, but you may be wondering about exactly how the +compiler turned what we gave it into the machine code seen above. + +We can examine what the compiler is doing in detail by setting: + +@example +state.ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DUMP_EVERYTHING, 1); +state.ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_KEEP_INTERMEDIATES, 1); +@end example + +@noindent + +This will dump detailed information about the compiler's state to a +directory under @code{/tmp}, and keep it from being cleaned up. + +The precise names and their formats of these files is subject to change. +Higher optimization levels lead to more files. +Here's what I saw (edited for brevity; there were almost 200 files): + +@example +intermediate files written to /tmp/libgccjit-KPQbGw +$ ls /tmp/libgccjit-KPQbGw/ +fake.c.000i.cgraph +fake.c.000i.type-inheritance +fake.c.004t.gimple +fake.c.007t.omplower +fake.c.008t.lower +fake.c.011t.eh +fake.c.012t.cfg +fake.c.014i.visibility +fake.c.015i.early_local_cleanups +fake.c.016t.ssa +# etc +@end example + +@noindent + +The gimple code is converted into Static Single Assignment form, +with annotations for use when generating the debuginfo: + +@example +$ less /tmp/libgccjit-KPQbGw/fake.c.016t.ssa +@end example + +@noindent + +@example +;; Function factorial (factorial, funcdef_no=0, decl_uid=53, symbol_order=0) + +factorial (signed int arg) +@{ + signed int stack[8]; + signed int stack_depth; + signed int x; + signed int y; + _20; + signed int _21; + signed int _38; + signed int _44; + signed int _51; + signed int _56; + +initial: + stack_depth_3 = 0; + # DEBUG stack_depth => stack_depth_3 + stack[stack_depth_3] = arg_5(D); + stack_depth_7 = stack_depth_3 + 1; + # DEBUG stack_depth => stack_depth_7 + # DEBUG instr0 => NULL + # DEBUG /* DUP */ => NULL + stack_depth_8 = stack_depth_7 + -1; + # DEBUG stack_depth => stack_depth_8 + x_9 = stack[stack_depth_8]; + # DEBUG x => x_9 + stack[stack_depth_8] = x_9; + stack_depth_11 = stack_depth_8 + 1; + # DEBUG stack_depth => stack_depth_11 + stack[stack_depth_11] = x_9; + stack_depth_13 = stack_depth_11 + 1; + # DEBUG stack_depth => stack_depth_13 + # DEBUG instr1 => NULL + # DEBUG /* PUSH_CONST */ => NULL + stack[stack_depth_13] = 2; + + /* etc; edited for brevity */ +@end example + +@noindent + +We can perhaps better see the code by turning off +@pxref{42,,GCC_JIT_BOOL_OPTION_DEBUGINFO} to suppress all those @code{DEBUG} +statements, giving: + +@example +$ less /tmp/libgccjit-1Hywc0/fake.c.016t.ssa +@end example + +@noindent + +@example +;; Function factorial (factorial, funcdef_no=0, decl_uid=53, symbol_order=0) + +factorial (signed int arg) +@{ + signed int stack[8]; + signed int stack_depth; + signed int x; + signed int y; + _20; + signed int _21; + signed int _38; + signed int _44; + signed int _51; + signed int _56; + +initial: + stack_depth_3 = 0; + stack[stack_depth_3] = arg_5(D); + stack_depth_7 = stack_depth_3 + 1; + stack_depth_8 = stack_depth_7 + -1; + x_9 = stack[stack_depth_8]; + stack[stack_depth_8] = x_9; + stack_depth_11 = stack_depth_8 + 1; + stack[stack_depth_11] = x_9; + stack_depth_13 = stack_depth_11 + 1; + stack[stack_depth_13] = 2; + stack_depth_15 = stack_depth_13 + 1; + stack_depth_16 = stack_depth_15 + -1; + y_17 = stack[stack_depth_16]; + stack_depth_18 = stack_depth_16 + -1; + x_19 = stack[stack_depth_18]; + _20 = x_19 < y_17; + _21 = (signed int) _20; + stack[stack_depth_18] = _21; + stack_depth_23 = stack_depth_18 + 1; + stack_depth_24 = stack_depth_23 + -1; + x_25 = stack[stack_depth_24]; + if (x_25 != 0) + goto (instr9); + else + goto (instr4); + +instr4: +/* DUP */: + stack_depth_26 = stack_depth_24 + -1; + x_27 = stack[stack_depth_26]; + stack[stack_depth_26] = x_27; + stack_depth_29 = stack_depth_26 + 1; + stack[stack_depth_29] = x_27; + stack_depth_31 = stack_depth_29 + 1; + stack[stack_depth_31] = 1; + stack_depth_33 = stack_depth_31 + 1; + stack_depth_34 = stack_depth_33 + -1; + y_35 = stack[stack_depth_34]; + stack_depth_36 = stack_depth_34 + -1; + x_37 = stack[stack_depth_36]; + _38 = x_37 - y_35; + stack[stack_depth_36] = _38; + stack_depth_40 = stack_depth_36 + 1; + stack_depth_41 = stack_depth_40 + -1; + x_42 = stack[stack_depth_41]; + _44 = factorial (x_42); + stack[stack_depth_41] = _44; + stack_depth_46 = stack_depth_41 + 1; + stack_depth_47 = stack_depth_46 + -1; + y_48 = stack[stack_depth_47]; + stack_depth_49 = stack_depth_47 + -1; + x_50 = stack[stack_depth_49]; + _51 = x_50 * y_48; + stack[stack_depth_49] = _51; + stack_depth_53 = stack_depth_49 + 1; + + # stack_depth_1 = PHI +instr9: +/* RETURN */: + stack_depth_54 = stack_depth_1 + -1; + x_55 = stack[stack_depth_54]; + _56 = x_55; + stack =@{v@} @{CLOBBER@}; + return _56; + +@} +@end example + +@noindent + +Note in the above how all the @code{gccjit::block} instances we +created have been consolidated into just 3 blocks in GCC's internal +representation: @code{initial}, @code{instr4} and @code{instr9}. + +@menu +* Optimizing away stack manipulation: Optimizing away stack manipulation<2>. +* Elimination of tail recursion: Elimination of tail recursion<2>. + +@end menu + +@node Optimizing away stack manipulation<2>,Elimination of tail recursion<2>,,Behind the curtain How does our code get optimized?<2> +@anchor{cp/intro/tutorial04 optimizing-away-stack-manipulation}@anchor{f0} +@subsubsection Optimizing away stack manipulation + + +Recall our simple implementation of stack operations. Let's examine +how the stack operations are optimized away. + +After a pass of constant-propagation, the depth of the stack at each +opcode can be determined at compile-time: + +@example +$ less /tmp/libgccjit-1Hywc0/fake.c.021t.ccp1 +@end example + +@noindent + +@example +;; Function factorial (factorial, funcdef_no=0, decl_uid=53, symbol_order=0) + +factorial (signed int arg) +@{ + signed int stack[8]; + signed int stack_depth; + signed int x; + signed int y; + _20; + signed int _21; + signed int _38; + signed int _44; + signed int _51; + +initial: + stack[0] = arg_5(D); + x_9 = stack[0]; + stack[0] = x_9; + stack[1] = x_9; + stack[2] = 2; + y_17 = stack[2]; + x_19 = stack[1]; + _20 = x_19 < y_17; + _21 = (signed int) _20; + stack[1] = _21; + x_25 = stack[1]; + if (x_25 != 0) + goto (instr9); + else + goto (instr4); + +instr4: +/* DUP */: + x_27 = stack[0]; + stack[0] = x_27; + stack[1] = x_27; + stack[2] = 1; + y_35 = stack[2]; + x_37 = stack[1]; + _38 = x_37 - y_35; + stack[1] = _38; + x_42 = stack[1]; + _44 = factorial (x_42); + stack[1] = _44; + y_48 = stack[1]; + x_50 = stack[0]; + _51 = x_50 * y_48; + stack[0] = _51; + +instr9: +/* RETURN */: + x_55 = stack[0]; + x_56 = x_55; + stack =@{v@} @{CLOBBER@}; + return x_56; + +@} +@end example + +@noindent + +Note how, in the above, all those @code{stack_depth} values are now just +constants: we're accessing specific stack locations at each opcode. + +The "esra" pass ("Early Scalar Replacement of Aggregates") breaks +out our "stack" array into individual elements: + +@example +$ less /tmp/libgccjit-1Hywc0/fake.c.024t.esra +@end example + +@noindent + +@example +;; Function factorial (factorial, funcdef_no=0, decl_uid=53, symbol_order=0) + +Created a replacement for stack offset: 0, size: 32: stack$0 +Created a replacement for stack offset: 32, size: 32: stack$1 +Created a replacement for stack offset: 64, size: 32: stack$2 + +Symbols to be put in SSA form +@{ D.89 D.90 D.91 @} +Incremental SSA update started at block: 0 +Number of blocks in CFG: 5 +Number of blocks to update: 4 ( 80%) + + +factorial (signed int arg) +@{ + signed int stack$2; + signed int stack$1; + signed int stack$0; + signed int stack[8]; + signed int stack_depth; + signed int x; + signed int y; + _20; + signed int _21; + signed int _38; + signed int _44; + signed int _51; + +initial: + stack$0_45 = arg_5(D); + x_9 = stack$0_45; + stack$0_39 = x_9; + stack$1_32 = x_9; + stack$2_30 = 2; + y_17 = stack$2_30; + x_19 = stack$1_32; + _20 = x_19 < y_17; + _21 = (signed int) _20; + stack$1_28 = _21; + x_25 = stack$1_28; + if (x_25 != 0) + goto (instr9); + else + goto (instr4); + +instr4: +/* DUP */: + x_27 = stack$0_39; + stack$0_22 = x_27; + stack$1_14 = x_27; + stack$2_12 = 1; + y_35 = stack$2_12; + x_37 = stack$1_14; + _38 = x_37 - y_35; + stack$1_10 = _38; + x_42 = stack$1_10; + _44 = factorial (x_42); + stack$1_6 = _44; + y_48 = stack$1_6; + x_50 = stack$0_22; + _51 = x_50 * y_48; + stack$0_1 = _51; + + # stack$0_52 = PHI +instr9: +/* RETURN */: + x_55 = stack$0_52; + x_56 = x_55; + stack =@{v@} @{CLOBBER@}; + return x_56; + +@} +@end example + +@noindent + +Hence at this point, all those pushes and pops of the stack are now +simply assignments to specific temporary variables. + +After some copy propagation, the stack manipulation has been completely +optimized away: + +@example +$ less /tmp/libgccjit-1Hywc0/fake.c.026t.copyprop1 +@end example + +@noindent + +@example +;; Function factorial (factorial, funcdef_no=0, decl_uid=53, symbol_order=0) + +factorial (signed int arg) +@{ + signed int stack$2; + signed int stack$1; + signed int stack$0; + signed int stack[8]; + signed int stack_depth; + signed int x; + signed int y; + _20; + signed int _21; + signed int _38; + signed int _44; + signed int _51; + +initial: + stack$0_39 = arg_5(D); + _20 = arg_5(D) <= 1; + _21 = (signed int) _20; + if (_21 != 0) + goto (instr9); + else + goto (instr4); + +instr4: +/* DUP */: + _38 = arg_5(D) + -1; + _44 = factorial (_38); + _51 = arg_5(D) * _44; + stack$0_1 = _51; + + # stack$0_52 = PHI +instr9: +/* RETURN */: + stack =@{v@} @{CLOBBER@}; + return stack$0_52; + +@} +@end example + +@noindent + +Later on, another pass finally eliminated @code{stack_depth} local and the +unused parts of the @cite{stack`} array altogether: + +@example +$ less /tmp/libgccjit-1Hywc0/fake.c.036t.release_ssa +@end example + +@noindent + +@example +;; Function factorial (factorial, funcdef_no=0, decl_uid=53, symbol_order=0) + +Released 44 names, 314.29%, removed 44 holes +factorial (signed int arg) +@{ + signed int stack$0; + signed int mult_acc_1; + _5; + signed int _6; + signed int _7; + signed int mul_tmp_10; + signed int mult_acc_11; + signed int mult_acc_13; + + # arg_9 = PHI + # mult_acc_13 = PHI <1(0)> +initial: + + : + # arg_4 = PHI + # mult_acc_1 = PHI + _5 = arg_4 <= 1; + _6 = (signed int) _5; + if (_6 != 0) + goto (instr9); + else + goto (instr4); + +instr4: +/* DUP */: + _7 = arg_4 + -1; + mult_acc_11 = mult_acc_1 * arg_4; + goto ; + + # stack$0_12 = PHI +instr9: +/* RETURN */: + mul_tmp_10 = mult_acc_1 * stack$0_12; + return mul_tmp_10; + +@} +@end example + +@noindent + +@node Elimination of tail recursion<2>,,Optimizing away stack manipulation<2>,Behind the curtain How does our code get optimized?<2> +@anchor{cp/intro/tutorial04 elimination-of-tail-recursion}@anchor{f1} +@subsubsection Elimination of tail recursion + + +Another significant optimization is the detection that the call to +@code{factorial} is tail recursion, which can be eliminated in favor of +an iteration: + +@example +$ less /tmp/libgccjit-1Hywc0/fake.c.030t.tailr1 +@end example + +@noindent + +@example +;; Function factorial (factorial, funcdef_no=0, decl_uid=53, symbol_order=0) + + +Symbols to be put in SSA form +@{ D.88 @} +Incremental SSA update started at block: 0 +Number of blocks in CFG: 5 +Number of blocks to update: 4 ( 80%) + + +factorial (signed int arg) +@{ + signed int stack$2; + signed int stack$1; + signed int stack$0; + signed int stack[8]; + signed int stack_depth; + signed int x; + signed int y; + signed int mult_acc_1; + _20; + signed int _21; + signed int _38; + signed int mul_tmp_44; + signed int mult_acc_51; + + # arg_5 = PHI + # mult_acc_1 = PHI <1(0), mult_acc_51(3)> +initial: + _20 = arg_5 <= 1; + _21 = (signed int) _20; + if (_21 != 0) + goto (instr9); + else + goto (instr4); + +instr4: +/* DUP */: + _38 = arg_5 + -1; + mult_acc_51 = mult_acc_1 * arg_5; + goto (initial); + + # stack$0_52 = PHI +instr9: +/* RETURN */: + stack =@{v@} @{CLOBBER@}; + mul_tmp_44 = mult_acc_1 * stack$0_52; + return mul_tmp_44; + +@} +@end example + +@noindent + +@c Copyright (C) 2014 Free Software Foundation, Inc. +@c Originally contributed by David Malcolm +@c +@c This is free software: you can redistribute it and/or modify it +@c under the terms of the GNU General Public License as published by +@c the Free Software Foundation, either version 3 of the License, or +@c (at your option) any later version. +@c +@c This program is distributed in the hope that it will be useful, but +@c WITHOUT ANY WARRANTY; without even the implied warranty of +@c MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +@c General Public License for more details. +@c +@c You should have received a copy of the GNU General Public License +@c along with this program. If not, see +@c . + +@node Topic Reference<2>,,Tutorial<2>,C++ bindings for libgccjit +@anchor{cp/topics/index doc}@anchor{f2}@anchor{cp/topics/index topic-reference}@anchor{f3} +@section Topic Reference + + +@c Copyright (C) 2014 Free Software Foundation, Inc. +@c Originally contributed by David Malcolm +@c +@c This is free software: you can redistribute it and/or modify it +@c under the terms of the GNU General Public License as published by +@c the Free Software Foundation, either version 3 of the License, or +@c (at your option) any later version. +@c +@c This program is distributed in the hope that it will be useful, but +@c WITHOUT ANY WARRANTY; without even the implied warranty of +@c MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +@c General Public License for more details. +@c +@c You should have received a copy of the GNU General Public License +@c along with this program. If not, see +@c . + +@menu +* Compilation contexts: Compilation contexts<2>. +* Objects: Objects<2>. +* Types: Types<2>. +* Expressions: Expressions<2>. +* Creating and using functions: Creating and using functions<2>. +* Source Locations: Source Locations<2>. +* Compilation results: Compilation results<2>. + +Compilation contexts + +* Lifetime-management: Lifetime-management<2>. +* Thread-safety: Thread-safety<2>. +* Error-handling: Error-handling<3>. +* Debugging: Debugging<2>. +* Options: Options<4>. + +Options + +* Boolean options: Boolean options<2>. +* Integer options: Integer options<2>. + +Types + +* Standard types: Standard types<2>. +* Pointers@comma{} const@comma{} and volatile: Pointers const and volatile<2>. +* Structures and unions: Structures and unions<2>. + +Expressions + +* Rvalues: Rvalues<2>. +* Lvalues: Lvalues<2>. +* Working with pointers@comma{} structs and unions: Working with pointers structs and unions<2>. + +Rvalues + +* Simple expressions: Simple expressions<2>. +* Unary Operations: Unary Operations<2>. +* Binary Operations: Binary Operations<2>. +* Comparisons: Comparisons<2>. +* Function calls: Function calls<2>. +* Type-coercion: Type-coercion<2>. + +Lvalues + +* Global variables: Global variables<2>. + +Creating and using functions + +* Params: Params<2>. +* Functions: Functions<2>. +* Blocks: Blocks<2>. +* Statements: Statements<2>. + +Source Locations + +* Faking it: Faking it<2>. + +@end menu + + +@node Compilation contexts<2>,Objects<2>,,Topic Reference<2> +@anchor{cp/topics/contexts compilation-contexts}@anchor{f4}@anchor{cp/topics/contexts doc}@anchor{f5} +@subsection Compilation contexts + + +@geindex gccjit;;context (C++ class) +@anchor{cp/topics/contexts gccjit context}@anchor{f6} +@deffn {C++ Class} gccjit::context +@end deffn + +The top-level of the C++ API is the @pxref{f6,,gccjit;;context} type. + +A @pxref{f6,,gccjit;;context} instance encapsulates the state of a +compilation. + +You can set up options on it, and add types, functions and code. +Invoking @pxref{cf,,gccjit;;context;;compile()} on it gives you a +@pxref{16,,gcc_jit_result *}. + +It is a thin wrapper around the C API's @pxref{8,,gcc_jit_context *}. + +@menu +* Lifetime-management: Lifetime-management<2>. +* Thread-safety: Thread-safety<2>. +* Error-handling: Error-handling<3>. +* Debugging: Debugging<2>. +* Options: Options<4>. + +@end menu + +@node Lifetime-management<2>,Thread-safety<2>,,Compilation contexts<2> +@anchor{cp/topics/contexts lifetime-management}@anchor{f7} +@subsubsection Lifetime-management + + +Contexts are the unit of lifetime-management within the API: objects +have their lifetime bounded by the context they are created within, and +cleanup of such objects is done for you when the context is released. + +@geindex gccjit;;context;;acquire (C++ function) +@anchor{cp/topics/contexts gccjit context acquire}@anchor{c9} +@deffn {C++ Function} gccjit::context gccjit::context::acquire () + +This function acquires a new @pxref{f6,,gccjit;;context} instance, +which is independent of any others that may be present within this +process. +@end deffn + +@geindex gccjit;;context;;release (C++ function) +@anchor{cp/topics/contexts gccjit context release}@anchor{cb} +@deffn {C++ Function} void gccjit::context::release () + +This function releases all resources associated with the given context. +Both the context itself and all of its @code{gccjit::object *} +instances are cleaned up. It should be called exactly once on a given +context. + +It is invalid to use the context or any of its "contextual" objects +after calling this. + +@example +ctxt.release (); +@end example + +@noindent +@end deffn + +@geindex gccjit;;context;;new_child_context (C++ function) +@anchor{cp/topics/contexts gccjit context new_child_context}@anchor{f8} +@deffn {C++ Function} gccjit::context gccjit::context::new_child_context () + +Given an existing JIT context, create a child context. + +The child inherits a copy of all option-settings from the parent. + +The child can reference objects created within the parent, but not +vice-versa. + +The lifetime of the child context must be bounded by that of the +parent: you should release a child context before releasing the parent +context. + +If you use a function from a parent context within a child context, +you have to compile the parent context before you can compile the +child context, and the gccjit::result of the parent context must +outlive the gccjit::result of the child context. + +This allows caching of shared initializations. For example, you could +create types and declarations of global functions in a parent context +once within a process, and then create child contexts whenever a +function or loop becomes hot. Each such child context can be used for +JIT-compiling just one function or loop, but can reference types +and helper functions created within the parent context. + +Contexts can be arbitrarily nested, provided the above rules are +followed, but it's probably not worth going above 2 or 3 levels, and +there will likely be a performance hit for such nesting. +@end deffn + +@node Thread-safety<2>,Error-handling<3>,Lifetime-management<2>,Compilation contexts<2> +@anchor{cp/topics/contexts thread-safety}@anchor{f9} +@subsubsection Thread-safety + + +Instances of @pxref{f6,,gccjit;;context} created via +@pxref{c9,,gccjit;;context;;acquire()} are independent from each other: +only one thread may use a given context at once, but multiple threads +could each have their own contexts without needing locks. + +Contexts created via @pxref{f8,,gccjit;;context;;new_child_context()} are +related to their parent context. They can be partitioned by their +ultimate ancestor into independent "family trees". Only one thread +within a process may use a given "family tree" of such contexts at once, +and if you're using multiple threads you should provide your own locking +around entire such context partitions. + +@node Error-handling<3>,Debugging<2>,Thread-safety<2>,Compilation contexts<2> +@anchor{cp/topics/contexts error-handling}@anchor{fa} +@subsubsection Error-handling + + +@c FIXME: How does error-handling work for C++ API? + +You can only compile and get code from a context if no errors occur. + +In general, if an error occurs when using an API entrypoint, it returns +NULL. You don't have to check everywhere for NULL results, since the +API gracefully handles a NULL being passed in for any argument. + +Errors are printed on stderr and can be queried using +@pxref{fb,,gccjit;;context;;get_first_error()}. + +@geindex gccjit;;context;;get_first_error (C++ function) +@anchor{cp/topics/contexts gccjit context get_first_error__gccjit contextP}@anchor{fb} +@deffn {C++ Function} const char* gccjit::context::get_first_error (gccjit::context* ctxt) + +Returns the first error message that occurred on the context. + +The returned string is valid for the rest of the lifetime of the +context. + +If no errors occurred, this will be NULL. +@end deffn + +@node Debugging<2>,Options<4>,Error-handling<3>,Compilation contexts<2> +@anchor{cp/topics/contexts debugging}@anchor{fc} +@subsubsection Debugging + + +@geindex gccjit;;context;;dump_to_file (C++ function) +@anchor{cp/topics/contexts gccjit context dump_to_file__ssCR i}@anchor{fd} +@deffn {C++ Function} void gccjit::context::dump_to_file (const std::string& path, int update_locations) + +To help with debugging: dump a C-like representation to the given path, +describing what's been set up on the context. + +If "update_locations" is true, then also set up @pxref{fe,,gccjit;;location} +information throughout the context, pointing at the dump file as if it +were a source file. This may be of use in conjunction with +@code{GCCJIT::BOOL_OPTION_DEBUGINFO} to allow stepping through the +code in a debugger. +@end deffn + +@node Options<4>,,Debugging<2>,Compilation contexts<2> +@anchor{cp/topics/contexts options}@anchor{ff} +@subsubsection Options + + +@c FIXME: gccjit::context::set_str_option doesn't seem to exist yet in the +@c C++ API + +@menu +* Boolean options: Boolean options<2>. +* Integer options: Integer options<2>. + +@end menu + +@node Boolean options<2>,Integer options<2>,,Options<4> +@anchor{cp/topics/contexts boolean-options}@anchor{100} +@subsubsection Boolean options + + +@geindex gccjit;;context;;set_bool_option (C++ function) +@anchor{cp/topics/contexts gccjit context set_bool_option__enum i}@anchor{d1} +@deffn {C++ Function} void gccjit::context::set_bool_option (enum gcc_jit_bool_option, int value) + +Set a boolean option of the context. + +This is a thin wrapper around the C API +@pxref{1b,,gcc_jit_context_set_bool_option()}; the options have the same +meaning. +@end deffn + +@node Integer options<2>,,Boolean options<2>,Options<4> +@anchor{cp/topics/contexts integer-options}@anchor{101} +@subsubsection Integer options + + +@geindex gccjit;;context;;set_int_option (C++ function) +@anchor{cp/topics/contexts gccjit context set_int_option__enum i}@anchor{d2} +@deffn {C++ Function} void gccjit::context::set_int_option (enum gcc_jit_int_option, int value) + +Set an integer option of the context. + +This is a thin wrapper around the C API +@pxref{1e,,gcc_jit_context_set_int_option()}; the options have the same +meaning. +@end deffn + +@c Copyright (C) 2014 Free Software Foundation, Inc. +@c Originally contributed by David Malcolm +@c +@c This is free software: you can redistribute it and/or modify it +@c under the terms of the GNU General Public License as published by +@c the Free Software Foundation, either version 3 of the License, or +@c (at your option) any later version. +@c +@c This program is distributed in the hope that it will be useful, but +@c WITHOUT ANY WARRANTY; without even the implied warranty of +@c MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +@c General Public License for more details. +@c +@c You should have received a copy of the GNU General Public License +@c along with this program. If not, see +@c . + +@node Objects<2>,Types<2>,Compilation contexts<2>,Topic Reference<2> +@anchor{cp/topics/objects objects}@anchor{102}@anchor{cp/topics/objects doc}@anchor{103} +@subsection Objects + + +@geindex gccjit;;object (C++ class) +@anchor{cp/topics/objects gccjit object}@anchor{104} +@deffn {C++ Class} gccjit::object +@end deffn + +Almost every entity in the API (with the exception of +@pxref{f6,,gccjit;;context} and @pxref{16,,gcc_jit_result *}) is a +"contextual" object, a @pxref{104,,gccjit;;object}. + +A JIT object: + +@quotation + + +@itemize * + +@item +is associated with a @pxref{f6,,gccjit;;context}. + +@item +is automatically cleaned up for you when its context is released so +you don't need to manually track and cleanup all objects, just the +contexts. +@end itemize +@end quotation + +The C++ class hierarchy within the @code{gccjit} namespace looks like this: + +@example ++- object + +- location + +- type + +- struct + +- field + +- function + +- block + +- rvalue + +- lvalue + +- param +@end example + +@noindent + +The @pxref{104,,gccjit;;object} base class has the following operations: + +@geindex gccjit;;object;;get_context (C++ function) +@anchor{cp/topics/objects gccjit object get_contextC}@anchor{105} +@deffn {C++ Function} gccjit::context gccjit::object::get_context () const + +Which context is the obj within? +@end deffn + +@geindex gccjit;;object;;get_debug_string (C++ function) +@anchor{cp/topics/objects gccjit object get_debug_stringC}@anchor{cc} +@deffn {C++ Function} std::string gccjit::object::get_debug_string () const + +Generate a human-readable description for the given object. + +For example, + +@example +printf ("obj: %s\n", obj.get_debug_string ().c_str ()); +@end example + +@noindent + +might give this text on stdout: + +@example +obj: 4.0 * (float)i +@end example + +@noindent +@end deffn + +@c Copyright (C) 2014 Free Software Foundation, Inc. +@c Originally contributed by David Malcolm +@c +@c This is free software: you can redistribute it and/or modify it +@c under the terms of the GNU General Public License as published by +@c the Free Software Foundation, either version 3 of the License, or +@c (at your option) any later version. +@c +@c This program is distributed in the hope that it will be useful, but +@c WITHOUT ANY WARRANTY; without even the implied warranty of +@c MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +@c General Public License for more details. +@c +@c You should have received a copy of the GNU General Public License +@c along with this program. If not, see +@c . + +@node Types<2>,Expressions<2>,Objects<2>,Topic Reference<2> +@anchor{cp/topics/types doc}@anchor{106}@anchor{cp/topics/types types}@anchor{107} +@subsection Types + + +@geindex gccjit;;type (C++ class) +@anchor{cp/topics/types gccjit type}@anchor{108} +@deffn {C++ Class} gccjit::type + +gccjit::type represents a type within the library. It is a subclass +of @pxref{104,,gccjit;;object}. +@end deffn + +Types can be created in several ways: + + +@itemize * + +@item +fundamental types can be accessed using +@pxref{ca,,gccjit;;context;;get_type()}: + +@example +gccjit::type int_type = ctxt.get_type (GCC_JIT_TYPE_INT); +@end example + +@noindent + +or using the @code{gccjit::context::get_int_type} template: + +@example +gccjit::type t = ctxt.get_int_type (); +@end example + +@noindent + +See @pxref{b,,gcc_jit_context_get_type()} for the available types. + +@item +derived types can be accessed by using functions such as +@pxref{109,,gccjit;;type;;get_pointer()} and @pxref{10a,,gccjit;;type;;get_const()}: + +@example +gccjit::type const_int_star = int_type.get_const ().get_pointer (); +gccjit::type int_const_star = int_type.get_pointer ().get_const (); +@end example + +@noindent + +@item +by creating structures (see below). +@end itemize + +@menu +* Standard types: Standard types<2>. +* Pointers@comma{} const@comma{} and volatile: Pointers const and volatile<2>. +* Structures and unions: Structures and unions<2>. + +@end menu + +@node Standard types<2>,Pointers const and volatile<2>,,Types<2> +@anchor{cp/topics/types standard-types}@anchor{10b} +@subsubsection Standard types + + +@geindex gccjit;;context;;get_type (C++ function) +@anchor{cp/topics/types gccjit context get_type__enum}@anchor{ca} +@deffn {C++ Function} gccjit::type gccjit::context::get_type (enum gcc_jit_types) + +Access a specific type. This is a thin wrapper around +@pxref{b,,gcc_jit_context_get_type()}; the parameter has the same meaning. +@end deffn + +@geindex gccjit;;context;;get_int_type (C++ function) +@anchor{cp/topics/types gccjit context get_int_type__s i}@anchor{10c} +@deffn {C++ Function} gccjit::type gccjit::context::get_int_type (size_t num_bytes, int is_signed) + +Access the integer type of the given size. +@end deffn + +@geindex gccjit;;context;;get_int_type (C++ function) +@anchor{cp/topics/types gccjit context get_int_type T}@anchor{10d} +@deffn {C++ Function} gccjit::type gccjit::context::get_int_type () + +Access the given integer type. For example, you could map the +@code{unsigned short} type into a gccjit::type via: + +@example +gccjit::type t = ctxt.get_int_type (); +@end example + +@noindent +@end deffn + +@node Pointers const and volatile<2>,Structures and unions<2>,Standard types<2>,Types<2> +@anchor{cp/topics/types pointers-const-and-volatile}@anchor{10e} +@subsubsection Pointers, @cite{const}, and @cite{volatile} + + +@geindex gccjit;;type;;get_pointer (C++ function) +@anchor{cp/topics/types gccjit type get_pointer}@anchor{109} +@deffn {C++ Function} gccjit::type gccjit::type::get_pointer () + +Given type "T", get type "T*". +@end deffn + +@c FIXME: get_const doesn't seem to exist + +@geindex gccjit;;type;;get_const (C++ function) +@anchor{cp/topics/types gccjit type get_const}@anchor{10a} +@deffn {C++ Function} gccjit::type gccjit::type::get_const () + +Given type "T", get type "const T". +@end deffn + +@geindex gccjit;;type;;get_volatile (C++ function) +@anchor{cp/topics/types gccjit type get_volatile}@anchor{10f} +@deffn {C++ Function} gccjit::type gccjit::type::get_volatile () + +Given type "T", get type "volatile T". +@end deffn + +@geindex gccjit;;context;;new_array_type (C++ function) +@anchor{cp/topics/types gccjit context new_array_type__gccjit type i gccjit location}@anchor{110} +@deffn {C++ Function} gccjit::type gccjit::context::new_array_type (gccjit::type element_type, int num_elements, gccjit::location loc) + +Given type "T", get type "T[N]" (for a constant N). +Param "loc" is optional. +@end deffn + +@node Structures and unions<2>,,Pointers const and volatile<2>,Types<2> +@anchor{cp/topics/types structures-and-unions}@anchor{111} +@subsubsection Structures and unions + + +@geindex gccjit;;struct_ (C++ class) +@anchor{cp/topics/types gccjit struct_}@anchor{112} +@deffn {C++ Class} gccjit::struct_ +@end deffn + +A compound type analagous to a C @cite{struct}. + +@pxref{112,,gccjit;;struct_} is a subclass of @pxref{108,,gccjit;;type} (and thus +of @pxref{104,,gccjit;;object} in turn). + +@geindex gccjit;;field (C++ class) +@anchor{cp/topics/types gccjit field}@anchor{113} +@deffn {C++ Class} gccjit::field +@end deffn + +A field within a @pxref{112,,gccjit;;struct_}. + +@pxref{113,,gccjit;;field} is a subclass of @pxref{104,,gccjit;;object}. + +You can model C @cite{struct} types by creating @pxref{112,,gccjit;;struct_} and +@pxref{113,,gccjit;;field} instances, in either order: + + +@itemize * + +@item +by creating the fields, then the structure. For example, to model: + +@example +struct coord @{double x; double y; @}; +@end example + +@noindent + +you could call: + +@example +gccjit::field field_x = ctxt.new_field (double_type, "x"); +gccjit::field field_y = ctxt.new_field (double_type, "y"); +std::vector fields; +fields.push_back (field_x); +fields.push_back (field_y); +gccjit::struct_ coord = ctxt.new_struct_type ("coord", fields); +@end example + +@noindent + +@item +by creating the structure, then populating it with fields, typically +to allow modelling self-referential structs such as: + +@example +struct node @{ int m_hash; struct node *m_next; @}; +@end example + +@noindent + +like this: + +@example +gccjit::struct_ node = ctxt.new_opaque_struct_type ("node"); +gccjit::type node_ptr = node.get_pointer (); +gccjit::field field_hash = ctxt.new_field (int_type, "m_hash"); +gccjit::field field_next = ctxt.new_field (node_ptr, "m_next"); +std::vector fields; +fields.push_back (field_hash); +fields.push_back (field_next); +node.set_fields (fields); +@end example + +@noindent +@end itemize + +@c FIXME: the above API doesn't seem to exist yet + +@geindex gccjit;;context;;new_field (C++ function) +@anchor{cp/topics/types gccjit context new_field__gccjit type cCP gccjit location}@anchor{114} +@deffn {C++ Function} gccjit::field gccjit::context::new_field (gccjit::type type, const char* name, gccjit::location loc) + +Construct a new field, with the given type and name. +@end deffn + +@geindex gccjit;;context;;new_struct_type (C++ function) +@anchor{cp/topics/types gccjit context new_struct_type__ssCR std vector field R gccjit location}@anchor{115} +@deffn {C++ Function} gccjit::struct_ gccjit::context::new_struct_type (const std::string& name, std::vector& fields, gccjit::location loc) + +@quotation + +Construct a new struct type, with the given name and fields. +@end quotation +@end deffn + +@geindex gccjit;;context;;new_opaque_struct (C++ function) +@anchor{cp/topics/types gccjit context new_opaque_struct__ssCR gccjit location}@anchor{116} +@deffn {C++ Function} gccjit::struct_ gccjit::context::new_opaque_struct (const std::string& name, gccjit::location loc) + +Construct a new struct type, with the given name, but without +specifying the fields. The fields can be omitted (in which case the +size of the struct is not known), or later specified using +@pxref{75,,gcc_jit_struct_set_fields()}. +@end deffn + +@c Copyright (C) 2014 Free Software Foundation, Inc. +@c Originally contributed by David Malcolm +@c +@c This is free software: you can redistribute it and/or modify it +@c under the terms of the GNU General Public License as published by +@c the Free Software Foundation, either version 3 of the License, or +@c (at your option) any later version. +@c +@c This program is distributed in the hope that it will be useful, but +@c WITHOUT ANY WARRANTY; without even the implied warranty of +@c MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +@c General Public License for more details. +@c +@c You should have received a copy of the GNU General Public License +@c along with this program. If not, see +@c . + +@node Expressions<2>,Creating and using functions<2>,Types<2>,Topic Reference<2> +@anchor{cp/topics/expressions expressions}@anchor{117}@anchor{cp/topics/expressions doc}@anchor{118} +@subsection Expressions + + +@menu +* Rvalues: Rvalues<2>. +* Lvalues: Lvalues<2>. +* Working with pointers@comma{} structs and unions: Working with pointers structs and unions<2>. + +Rvalues + +* Simple expressions: Simple expressions<2>. +* Unary Operations: Unary Operations<2>. +* Binary Operations: Binary Operations<2>. +* Comparisons: Comparisons<2>. +* Function calls: Function calls<2>. +* Type-coercion: Type-coercion<2>. + +Lvalues + +* Global variables: Global variables<2>. + +@end menu + + +@node Rvalues<2>,Lvalues<2>,,Expressions<2> +@anchor{cp/topics/expressions rvalues}@anchor{119} +@subsubsection Rvalues + + +@geindex gccjit;;rvalue (C++ class) +@anchor{cp/topics/expressions gccjit rvalue}@anchor{11a} +@deffn {C++ Class} gccjit::rvalue +@end deffn + +A @pxref{11a,,gccjit;;rvalue} is an expression that can be computed. It is a +subclass of @pxref{104,,gccjit;;object}, and is a thin wrapper around +@pxref{13,,gcc_jit_rvalue *} from the C API. + +It can be simple, e.g.: + +@quotation + + +@itemize * + +@item +an integer value e.g. @cite{0} or @cite{42} + +@item +a string literal e.g. @cite{"Hello world"} + +@item +a variable e.g. @cite{i}. These are also lvalues (see below). +@end itemize +@end quotation + +or compound e.g.: + +@quotation + + +@itemize * + +@item +a unary expression e.g. @cite{!cond} + +@item +a binary expression e.g. @cite{(a + b)} + +@item +a function call e.g. @cite{get_distance (&player_ship@comma{} &target)} + +@item +etc. +@end itemize +@end quotation + +Every rvalue has an associated type, and the API will check to ensure +that types match up correctly (otherwise the context will emit an error). + +@geindex gccjit;;rvalue;;get_type (C++ function) +@anchor{cp/topics/expressions gccjit rvalue get_type}@anchor{11b} +@deffn {C++ Function} gccjit::type gccjit::rvalue::get_type () + +Get the type of this rvalue. +@end deffn + +@menu +* Simple expressions: Simple expressions<2>. +* Unary Operations: Unary Operations<2>. +* Binary Operations: Binary Operations<2>. +* Comparisons: Comparisons<2>. +* Function calls: Function calls<2>. +* Type-coercion: Type-coercion<2>. + +@end menu + +@node Simple expressions<2>,Unary Operations<2>,,Rvalues<2> +@anchor{cp/topics/expressions simple-expressions}@anchor{11c} +@subsubsection Simple expressions + + +@geindex gccjit;;context;;new_rvalue (C++ function) +@anchor{cp/topics/expressions gccjit context new_rvalue__gccjit type iC}@anchor{de} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_rvalue (gccjit::type numeric_type, int value) const + +Given a numeric type (integer or floating point), build an rvalue for +the given constant @code{int} value. +@end deffn + +@geindex gccjit;;context;;zero (C++ function) +@anchor{cp/topics/expressions gccjit context zero__gccjit typeC}@anchor{da} +@deffn {C++ Function} gccjit::rvalue gccjit::context::zero (gccjit::type numeric_type) const + +Given a numeric type (integer or floating point), get the rvalue for +zero. Essentially this is just a shortcut for: + +@example +ctxt.new_rvalue (numeric_type, 0) +@end example + +@noindent +@end deffn + +@geindex gccjit;;context;;one (C++ function) +@anchor{cp/topics/expressions gccjit context one__gccjit typeC}@anchor{11d} +@deffn {C++ Function} gccjit::rvalue gccjit::context::one (gccjit::type numeric_type) const + +Given a numeric type (integer or floating point), get the rvalue for +zero. Essentially this is just a shortcut for: + +@example +ctxt.new_rvalue (numeric_type, 1) +@end example + +@noindent +@end deffn + +@geindex gccjit;;context;;new_rvalue (C++ function) +@anchor{cp/topics/expressions gccjit context new_rvalue__gccjit type doubleC}@anchor{11e} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_rvalue (gccjit::type numeric_type, double value) const + +Given a numeric type (integer or floating point), build an rvalue for +the given constant value. +@end deffn + +@geindex gccjit;;context;;new_rvalue (C++ function) +@anchor{cp/topics/expressions gccjit context new_rvalue__gccjit type voidPC}@anchor{11f} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_rvalue (gccjit::type pointer_type, void* value) const + +Given a pointer type, build an rvalue for the given address. +@end deffn + +@geindex gccjit;;context;;new_rvalue (C++ function) +@anchor{cp/topics/expressions gccjit context new_rvalue__ssCRC}@anchor{120} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_rvalue (const std::string& value) const + +Generate an rvalue of type @code{GCC_JIT_TYPE_CONST_CHAR_PTR} for +the given string. This is akin to a string literal. +@end deffn + +@node Unary Operations<2>,Binary Operations<2>,Simple expressions<2>,Rvalues<2> +@anchor{cp/topics/expressions unary-operations}@anchor{121} +@subsubsection Unary Operations + + +@geindex gccjit;;context;;new_unary_op (C++ function) +@anchor{cp/topics/expressions gccjit context new_unary_op__enum gccjit type gccjit rvalue gccjit location}@anchor{122} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_unary_op (enum gcc_jit_unary_op, gccjit::type result_type, gccjit::rvalue rvalue, gccjit::location loc) + +Build a unary operation out of an input rvalue. + +Parameter @code{loc} is optional. + +This is a thin wrapper around the C API's +@pxref{80,,gcc_jit_context_new_unary_op()} and the available unary +operations are documented there. +@end deffn + +There are shorter ways to spell the various specific kinds of unary +operation: + +@geindex gccjit;;context;;new_minus (C++ function) +@anchor{cp/topics/expressions gccjit context new_minus__gccjit type gccjit rvalue gccjit location}@anchor{123} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_minus (gccjit::type result_type, gccjit::rvalue a, gccjit::location loc) + +Negate an arithmetic value; for example: + +@example +gccjit::rvalue negpi = ctxt.new_minus (t_double, pi); +@end example + +@noindent + +builds the equivalent of this C expression: + +@example +-pi +@end example + +@noindent +@end deffn + +@geindex new_bitwise_negate (C++ function) +@anchor{cp/topics/expressions new_bitwise_negate__gccjit type gccjit rvalue gccjit location}@anchor{124} +@deffn {C++ Function} gccjit::rvalue new_bitwise_negate (gccjit::type result_type, gccjit::rvalue a, gccjit::location loc) + +Bitwise negation of an integer value (one's complement); for example: + +@example +gccjit::rvalue mask = ctxt.new_bitwise_negate (t_int, a); +@end example + +@noindent + +builds the equivalent of this C expression: + +@example +~a +@end example + +@noindent +@end deffn + +@geindex new_logical_negate (C++ function) +@anchor{cp/topics/expressions new_logical_negate__gccjit type gccjit rvalue gccjit location}@anchor{125} +@deffn {C++ Function} gccjit::rvalue new_logical_negate (gccjit::type result_type, gccjit::rvalue a, gccjit::location loc) + +Logical negation of an arithmetic or pointer value; for example: + +@example +gccjit::rvalue guard = ctxt.new_logical_negate (t_bool, cond); +@end example + +@noindent + +builds the equivalent of this C expression: + +@example +!cond +@end example + +@noindent +@end deffn + +The most concise way to spell them is with overloaded operators: + +@geindex operator- (C++ function) +@anchor{cp/topics/expressions sub-operator__gccjit rvalue}@anchor{126} +@deffn {C++ Function} gccjit::rvalue operator- (gccjit::rvalue a) + +@example +gccjit::rvalue negpi = -pi; +@end example + +@noindent +@end deffn + +@geindex operator~ (C++ function) +@anchor{cp/topics/expressions inv-operator__gccjit rvalue}@anchor{127} +@deffn {C++ Function} gccjit::rvalue operator~ (gccjit::rvalue a) + +@example +gccjit::rvalue mask = ~a; +@end example + +@noindent +@end deffn + +@geindex operator! (C++ function) +@anchor{cp/topics/expressions not-operator__gccjit rvalue}@anchor{128} +@deffn {C++ Function} gccjit::rvalue operator! (gccjit::rvalue a) + +@example +gccjit::rvalue guard = !cond; +@end example + +@noindent +@end deffn + +@node Binary Operations<2>,Comparisons<2>,Unary Operations<2>,Rvalues<2> +@anchor{cp/topics/expressions binary-operations}@anchor{129} +@subsubsection Binary Operations + + +@geindex gccjit;;context;;new_binary_op (C++ function) +@anchor{cp/topics/expressions gccjit context new_binary_op__enum gccjit type gccjit rvalue gccjit rvalue gccjit location}@anchor{ce} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_binary_op (enum gcc_jit_binary_op, gccjit::type result_type, gccjit::rvalue a, gccjit::rvalue b, gccjit::location loc) + +Build a binary operation out of two constituent rvalues. + +Parameter @code{loc} is optional. + +This is a thin wrapper around the C API's +@pxref{12,,gcc_jit_context_new_binary_op()} and the available binary +operations are documented there. +@end deffn + +There are shorter ways to spell the various specific kinds of binary +operation: + +@geindex gccjit;;context;;new_plus (C++ function) +@anchor{cp/topics/expressions gccjit context new_plus__gccjit type gccjit rvalue gccjit rvalue gccjit location}@anchor{12a} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_plus (gccjit::type result_type, gccjit::rvalue a, gccjit::rvalue b, gccjit::location loc) +@end deffn + +@geindex gccjit;;context;;new_minus (C++ function) +@anchor{cp/topics/expressions gccjit context new_minus__gccjit type gccjit rvalue gccjit rvalue gccjit location}@anchor{12b} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_minus (gccjit::type result_type, gccjit::rvalue a, gccjit::rvalue b, gccjit::location loc) +@end deffn + +@geindex gccjit;;context;;new_mult (C++ function) +@anchor{cp/topics/expressions gccjit context new_mult__gccjit type gccjit rvalue gccjit rvalue gccjit location}@anchor{12c} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_mult (gccjit::type result_type, gccjit::rvalue a, gccjit::rvalue b, gccjit::location loc) +@end deffn + +@geindex gccjit;;context;;new_divide (C++ function) +@anchor{cp/topics/expressions gccjit context new_divide__gccjit type gccjit rvalue gccjit rvalue gccjit location}@anchor{12d} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_divide (gccjit::type result_type, gccjit::rvalue a, gccjit::rvalue b, gccjit::location loc) +@end deffn + +@geindex gccjit;;context;;new_modulo (C++ function) +@anchor{cp/topics/expressions gccjit context new_modulo__gccjit type gccjit rvalue gccjit rvalue gccjit location}@anchor{12e} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_modulo (gccjit::type result_type, gccjit::rvalue a, gccjit::rvalue b, gccjit::location loc) +@end deffn + +@geindex gccjit;;context;;new_bitwise_and (C++ function) +@anchor{cp/topics/expressions gccjit context new_bitwise_and__gccjit type gccjit rvalue gccjit rvalue gccjit location}@anchor{12f} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_bitwise_and (gccjit::type result_type, gccjit::rvalue a, gccjit::rvalue b, gccjit::location loc) +@end deffn + +@geindex gccjit;;context;;new_bitwise_xor (C++ function) +@anchor{cp/topics/expressions gccjit context new_bitwise_xor__gccjit type gccjit rvalue gccjit rvalue gccjit location}@anchor{130} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_bitwise_xor (gccjit::type result_type, gccjit::rvalue a, gccjit::rvalue b, gccjit::location loc) +@end deffn + +@geindex gccjit;;context;;new_bitwise_or (C++ function) +@anchor{cp/topics/expressions gccjit context new_bitwise_or__gccjit type gccjit rvalue gccjit rvalue gccjit location}@anchor{131} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_bitwise_or (gccjit::type result_type, gccjit::rvalue a, gccjit::rvalue b, gccjit::location loc) +@end deffn + +@geindex gccjit;;context;;new_logical_and (C++ function) +@anchor{cp/topics/expressions gccjit context new_logical_and__gccjit type gccjit rvalue gccjit rvalue gccjit location}@anchor{132} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_logical_and (gccjit::type result_type, gccjit::rvalue a, gccjit::rvalue b, gccjit::location loc) +@end deffn + +@geindex gccjit;;context;;new_logical_or (C++ function) +@anchor{cp/topics/expressions gccjit context new_logical_or__gccjit type gccjit rvalue gccjit rvalue gccjit location}@anchor{133} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_logical_or (gccjit::type result_type, gccjit::rvalue a, gccjit::rvalue b, gccjit::location loc) +@end deffn + +The most concise way to spell them is with overloaded operators: + +@geindex operator+ (C++ function) +@anchor{cp/topics/expressions add-operator__gccjit rvalue gccjit rvalue}@anchor{134} +@deffn {C++ Function} gccjit::rvalue operator+ (gccjit::rvalue a, gccjit::rvalue b) + +@example +gccjit::rvalue sum = a + b; +@end example + +@noindent +@end deffn + +@geindex operator- (C++ function) +@anchor{cp/topics/expressions sub-operator__gccjit rvalue gccjit rvalue}@anchor{135} +@deffn {C++ Function} gccjit::rvalue operator- (gccjit::rvalue a, gccjit::rvalue b) + +@example +gccjit::rvalue diff = a - b; +@end example + +@noindent +@end deffn + +@geindex operator* (C++ function) +@anchor{cp/topics/expressions mul-operator__gccjit rvalue gccjit rvalue}@anchor{136} +@deffn {C++ Function} gccjit::rvalue operator* (gccjit::rvalue a, gccjit::rvalue b) + +@example +gccjit::rvalue prod = a * b; +@end example + +@noindent +@end deffn + +@geindex operator/ (C++ function) +@anchor{cp/topics/expressions div-operator__gccjit rvalue gccjit rvalue}@anchor{137} +@deffn {C++ Function} gccjit::rvalue operator/ (gccjit::rvalue a, gccjit::rvalue b) + +@example +gccjit::rvalue result = a / b; +@end example + +@noindent +@end deffn + +@geindex operator% (C++ function) +@anchor{cp/topics/expressions mod-operator__gccjit rvalue gccjit rvalue}@anchor{138} +@deffn {C++ Function} gccjit::rvalue operator% (gccjit::rvalue a, gccjit::rvalue b) + +@example +gccjit::rvalue mod = a % b; +@end example + +@noindent +@end deffn + +@geindex operator& (C++ function) +@anchor{cp/topics/expressions and-operator__gccjit rvalue gccjit rvalue}@anchor{139} +@deffn {C++ Function} gccjit::rvalue operator& (gccjit::rvalue a, gccjit::rvalue b) + +@example +gccjit::rvalue x = a & b; +@end example + +@noindent +@end deffn + +@geindex operator^ (C++ function) +@anchor{cp/topics/expressions xor-operator__gccjit rvalue gccjit rvalue}@anchor{13a} +@deffn {C++ Function} gccjit::rvalue operator^ (gccjit::rvalue a, gccjit::rvalue b) + +@example +gccjit::rvalue x = a ^ b; +@end example + +@noindent +@end deffn + +@geindex operator| (C++ function) +@anchor{cp/topics/expressions or-operator__gccjit rvalue gccjit rvalue}@anchor{13b} +@deffn {C++ Function} gccjit::rvalue operator| (gccjit::rvalue a, gccjit::rvalue b) + +@example +gccjit::rvalue x = a | b; +@end example + +@noindent +@end deffn + +@geindex operator&& (C++ function) +@anchor{cp/topics/expressions sand-operator__gccjit rvalue gccjit rvalue}@anchor{13c} +@deffn {C++ Function} gccjit::rvalue operator&& (gccjit::rvalue a, gccjit::rvalue b) + +@example +gccjit::rvalue cond = a && b; +@end example + +@noindent +@end deffn + +@geindex operator|| (C++ function) +@anchor{cp/topics/expressions sor-operator__gccjit rvalue gccjit rvalue}@anchor{13d} +@deffn {C++ Function} gccjit::rvalue operator|| (gccjit::rvalue a, gccjit::rvalue b) + +@example +gccjit::rvalue cond = a || b; +@end example + +@noindent +@end deffn + +These can of course be combined, giving a terse way to build compound +expressions: + +@quotation + +@example +gccjit::rvalue discriminant = (b * b) - (four * a * c); +@end example + +@noindent +@end quotation + +@node Comparisons<2>,Function calls<2>,Binary Operations<2>,Rvalues<2> +@anchor{cp/topics/expressions comparisons}@anchor{13e} +@subsubsection Comparisons + + +@geindex gccjit;;context;;new_comparison (C++ function) +@anchor{cp/topics/expressions gccjit context new_comparison__enum gccjit rvalue gccjit rvalue gccjit location}@anchor{db} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_comparison (enum gcc_jit_comparison, gccjit::rvalue a, gccjit::rvalue b, gccjit::location loc) + +Build a boolean rvalue out of the comparison of two other rvalues. + +Parameter @code{loc} is optional. + +This is a thin wrapper around the C API's +@pxref{2c,,gcc_jit_context_new_comparison()} and the available kinds +of comparison are documented there. +@end deffn + +There are shorter ways to spell the various specific kinds of binary +operation: + +@geindex gccjit;;context;;new_eq (C++ function) +@anchor{cp/topics/expressions gccjit context new_eq__gccjit rvalue gccjit rvalue gccjit location}@anchor{13f} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_eq (gccjit::rvalue a, gccjit::rvalue b, gccjit::location loc) +@end deffn + +@geindex gccjit;;context;;new_ne (C++ function) +@anchor{cp/topics/expressions gccjit context new_ne__gccjit rvalue gccjit rvalue gccjit location}@anchor{140} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_ne (gccjit::rvalue a, gccjit::rvalue b, gccjit::location loc) +@end deffn + +@geindex gccjit;;context;;new_lt (C++ function) +@anchor{cp/topics/expressions gccjit context new_lt__gccjit rvalue gccjit rvalue gccjit location}@anchor{141} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_lt (gccjit::rvalue a, gccjit::rvalue b, gccjit::location loc) +@end deffn + +@geindex gccjit;;context;;new_le (C++ function) +@anchor{cp/topics/expressions gccjit context new_le__gccjit rvalue gccjit rvalue gccjit location}@anchor{142} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_le (gccjit::rvalue a, gccjit::rvalue b, gccjit::location loc) +@end deffn + +@geindex gccjit;;context;;new_gt (C++ function) +@anchor{cp/topics/expressions gccjit context new_gt__gccjit rvalue gccjit rvalue gccjit location}@anchor{143} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_gt (gccjit::rvalue a, gccjit::rvalue b, gccjit::location loc) +@end deffn + +@geindex gccjit;;context;;new_ge (C++ function) +@anchor{cp/topics/expressions gccjit context new_ge__gccjit rvalue gccjit rvalue gccjit location}@anchor{144} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_ge (gccjit::rvalue a, gccjit::rvalue b, gccjit::location loc) +@end deffn + +The most concise way to spell them is with overloaded operators: + +@geindex operator== (C++ function) +@anchor{cp/topics/expressions eq-operator__gccjit rvalue gccjit rvalue}@anchor{145} +@deffn {C++ Function} gccjit::rvalue operator== (gccjit::rvalue a, gccjit::rvalue b) + +@example +gccjit::rvalue cond = (a == ctxt.zero (t_int)); +@end example + +@noindent +@end deffn + +@geindex operator!= (C++ function) +@anchor{cp/topics/expressions neq-operator__gccjit rvalue gccjit rvalue}@anchor{146} +@deffn {C++ Function} gccjit::rvalue operator!= (gccjit::rvalue a, gccjit::rvalue b) + +@example +gccjit::rvalue cond = (i != j); +@end example + +@noindent +@end deffn + +@geindex operator< (C++ function) +@anchor{cp/topics/expressions lt-operator__gccjit rvalue gccjit rvalue}@anchor{147} +@deffn {C++ Function} gccjit::rvalue operator< (gccjit::rvalue a, gccjit::rvalue b) + +@example +gccjit::rvalue cond = i < n; +@end example + +@noindent +@end deffn + +@geindex operator<= (C++ function) +@anchor{cp/topics/expressions lte-operator__gccjit rvalue gccjit rvalue}@anchor{148} +@deffn {C++ Function} gccjit::rvalue operator<= (gccjit::rvalue a, gccjit::rvalue b) + +@example +gccjit::rvalue cond = i <= n; +@end example + +@noindent +@end deffn + +@geindex operator> (C++ function) +@anchor{cp/topics/expressions gt-operator__gccjit rvalue gccjit rvalue}@anchor{149} +@deffn {C++ Function} gccjit::rvalue operator> (gccjit::rvalue a, gccjit::rvalue b) + +@example +gccjit::rvalue cond = (ch > limit); +@end example + +@noindent +@end deffn + +@geindex operator>= (C++ function) +@anchor{cp/topics/expressions gte-operator__gccjit rvalue gccjit rvalue}@anchor{14a} +@deffn {C++ Function} gccjit::rvalue operator>= (gccjit::rvalue a, gccjit::rvalue b) + +@example +gccjit::rvalue cond = (score >= ctxt.new_rvalue (t_int, 100)); +@end example + +@noindent +@end deffn + +@c TODO: beyond this point + +@node Function calls<2>,Type-coercion<2>,Comparisons<2>,Rvalues<2> +@anchor{cp/topics/expressions function-calls}@anchor{14b} +@subsubsection Function calls + + +@geindex gcc_jit_context_new_call (C++ function) +@anchor{cp/topics/expressions gcc_jit_context_new_call__gcc_jit_contextP gcc_jit_locationP gcc_jit_functionP i gcc_jit_rvaluePP}@anchor{14c} +@deffn {C++ Function} gcc_jit_rvalue* gcc_jit_context_new_call (gcc_jit_context* ctxt, gcc_jit_location* loc, gcc_jit_function* func, int numargs, gcc_jit_rvalue** args) + +Given a function and the given table of argument rvalues, construct a +call to the function, with the result as an rvalue. + +@cartouche +@quotation Note +@code{gccjit::context::new_call()} merely builds a +@pxref{11a,,gccjit;;rvalue} i.e. an expression that can be evaluated, +perhaps as part of a more complicated expression. +The call @emph{won't} happen unless you add a statement to a function +that evaluates the expression. + +For example, if you want to call a function and discard the result +(or to call a function with @code{void} return type), use +@pxref{14d,,gccjit;;block;;add_eval()}: + +@example +/* Add "(void)printf (arg0, arg1);". */ +block.add_eval (ctxt.new_call (printf_func, arg0, arg1)); +@end example + +@noindent +@end quotation +@end cartouche +@end deffn + +@node Type-coercion<2>,,Function calls<2>,Rvalues<2> +@anchor{cp/topics/expressions type-coercion}@anchor{14e} +@subsubsection Type-coercion + + +@geindex gccjit;;context;;new_cast (C++ function) +@anchor{cp/topics/expressions gccjit context new_cast__gccjit rvalue gccjit type gccjit location}@anchor{14f} +@deffn {C++ Function} gccjit::rvalue gccjit::context::new_cast (gccjit::rvalue rvalue, gccjit::type type, gccjit::location loc) + +Given an rvalue of T, construct another rvalue of another type. + +Currently only a limited set of conversions are possible: + +@quotation + + +@itemize * + +@item +int <-> float + +@item +int <-> bool + +@item +P* <-> Q*, for pointer types P and Q +@end itemize +@end quotation +@end deffn + +@node Lvalues<2>,Working with pointers structs and unions<2>,Rvalues<2>,Expressions<2> +@anchor{cp/topics/expressions lvalues}@anchor{150} +@subsubsection Lvalues + + +@geindex gccjit;;lvalue (C++ class) +@anchor{cp/topics/expressions gccjit lvalue}@anchor{151} +@deffn {C++ Class} gccjit::lvalue +@end deffn + +An lvalue is something that can of the @emph{left}-hand side of an assignment: +a storage area (such as a variable). It is a subclass of +@pxref{11a,,gccjit;;rvalue}, where the rvalue is computed by reading from the +storage area. + +It iss a thin wrapper around @pxref{24,,gcc_jit_lvalue *} from the C API. + +@geindex gccjit;;lvalue;;get_address (C++ function) +@anchor{cp/topics/expressions gccjit lvalue get_address__gccjit location}@anchor{152} +@deffn {C++ Function} gccjit::rvalue gccjit::lvalue::get_address (gccjit::location loc) + +Take the address of an lvalue; analogous to: + +@example +&(EXPR) +@end example + +@noindent + +in C. + +Parameter "loc" is optional. +@end deffn + +@menu +* Global variables: Global variables<2>. + +@end menu + +@node Global variables<2>,,,Lvalues<2> +@anchor{cp/topics/expressions global-variables}@anchor{153} +@subsubsection Global variables + + +@geindex gccjit;;context;;new_global (C++ function) +@anchor{cp/topics/expressions gccjit context new_global__gccjit type cCP gccjit location}@anchor{154} +@deffn {C++ Function} gccjit::lvalue gccjit::context::new_global (gccjit::type type, const char* name, gccjit::location loc) + +Add a new global variable of the given type and name to the context. +@end deffn + +@node Working with pointers structs and unions<2>,,Lvalues<2>,Expressions<2> +@anchor{cp/topics/expressions working-with-pointers-structs-and-unions}@anchor{155} +@subsubsection Working with pointers, structs and unions + + +@geindex gccjit;;rvalue;;dereference (C++ function) +@anchor{cp/topics/expressions gccjit rvalue dereference__gccjit location}@anchor{156} +@deffn {C++ Function} gccjit::lvalue gccjit::rvalue::dereference (gccjit::location loc) + +Given an rvalue of pointer type @code{T *}, dereferencing the pointer, +getting an lvalue of type @code{T}. Analogous to: + +@example +*(EXPR) +@end example + +@noindent + +in C. + +Parameter "loc" is optional. +@end deffn + +If you don't need to specify the location, this can also be expressed using +an overloaded operator: + + +@deffn {C++ Function} gccjit::lvalue gccjit::rvalue::operator* (); + +@example +gccjit::lvalue content = *ptr; +@end example + +@noindent +@end deffn + +Field access is provided separately for both lvalues and rvalues: + +@geindex gccjit;;lvalue;;access_field (C++ function) +@anchor{cp/topics/expressions gccjit lvalue access_field__gccjit field gccjit location}@anchor{157} +@deffn {C++ Function} gccjit::lvalue gccjit::lvalue::access_field (gccjit::field field, gccjit::location loc) + +Given an lvalue of struct or union type, access the given field, +getting an lvalue of the field's type. Analogous to: + +@example +(EXPR).field = ...; +@end example + +@noindent + +in C. +@end deffn + +@geindex gccjit;;rvalue;;access_field (C++ function) +@anchor{cp/topics/expressions gccjit rvalue access_field__gccjit field gccjit location}@anchor{158} +@deffn {C++ Function} gccjit::rvalue gccjit::rvalue::access_field (gccjit::field field, gccjit::location loc) + +Given an rvalue of struct or union type, access the given field +as an rvalue. Analogous to: + +@example +(EXPR).field +@end example + +@noindent + +in C. +@end deffn + +@geindex gccjit;;rvalue;;dereference_field (C++ function) +@anchor{cp/topics/expressions gccjit rvalue dereference_field__gccjit field gccjit location}@anchor{159} +@deffn {C++ Function} gccjit::lvalue gccjit::rvalue::dereference_field (gccjit::field field, gccjit::location loc) + +Given an rvalue of pointer type @code{T *} where T is of struct or union +type, access the given field as an lvalue. Analogous to: + +@example +(EXPR)->field +@end example + +@noindent + +in C, itself equivalent to @code{(*EXPR).FIELD}. +@end deffn + +@geindex gccjit;;context;;new_array_access (C++ function) +@anchor{cp/topics/expressions gccjit context new_array_access__gccjit rvalue gccjit rvalue gccjit location}@anchor{15a} +@deffn {C++ Function} gccjit::lvalue gccjit::context::new_array_access (gccjit::rvalue ptr, gccjit::rvalue index, gccjit::location loc) + +Given an rvalue of pointer type @code{T *}, get at the element @cite{T} at +the given index, using standard C array indexing rules i.e. each +increment of @code{index} corresponds to @code{sizeof(T)} bytes. +Analogous to: + +@example +PTR[INDEX] +@end example + +@noindent + +in C (or, indeed, to @code{PTR + INDEX}). + +Parameter "loc" is optional. +@end deffn + +For array accesses where you don't need to specify a @pxref{fe,,gccjit;;location}, +two overloaded operators are available: + +@quotation + +gccjit::lvalue gccjit::rvalue::operator[] (gccjit::rvalue index) + +@example +gccjit::lvalue element = array[idx]; +@end example + +@noindent + +gccjit::lvalue gccjit::rvalue::operator[] (int index) + +@example +gccjit::lvalue element = array[0]; +@end example + +@noindent +@end quotation + +@c Copyright (C) 2014 Free Software Foundation, Inc. +@c Originally contributed by David Malcolm +@c +@c This is free software: you can redistribute it and/or modify it +@c under the terms of the GNU General Public License as published by +@c the Free Software Foundation, either version 3 of the License, or +@c (at your option) any later version. +@c +@c This program is distributed in the hope that it will be useful, but +@c WITHOUT ANY WARRANTY; without even the implied warranty of +@c MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +@c General Public License for more details. +@c +@c You should have received a copy of the GNU General Public License +@c along with this program. If not, see +@c . + +@node Creating and using functions<2>,Source Locations<2>,Expressions<2>,Topic Reference<2> +@anchor{cp/topics/functions doc}@anchor{15b}@anchor{cp/topics/functions creating-and-using-functions}@anchor{15c} +@subsection Creating and using functions + + +@menu +* Params: Params<2>. +* Functions: Functions<2>. +* Blocks: Blocks<2>. +* Statements: Statements<2>. + +@end menu + +@node Params<2>,Functions<2>,,Creating and using functions<2> +@anchor{cp/topics/functions params}@anchor{15d} +@subsubsection Params + + +@geindex gccjit;;param (C++ class) +@anchor{cp/topics/functions gccjit param}@anchor{15e} +@deffn {C++ Class} gccjit::param + +A @cite{gccjit::param} represents a parameter to a function. +@end deffn + +@geindex gccjit;;context;;new_param (C++ function) +@anchor{cp/topics/functions gccjit context new_param__gccjit type cCP gccjit location}@anchor{cd} +@deffn {C++ Function} gccjit::param gccjit::context::new_param (gccjit::type type, const char* name, gccjit::location loc) + +In preparation for creating a function, create a new parameter of the +given type and name. +@end deffn + +@pxref{15e,,gccjit;;param} is a subclass of @pxref{151,,gccjit;;lvalue} (and thus +of @pxref{11a,,gccjit;;rvalue} and @pxref{104,,gccjit;;object}). It is a thin +wrapper around the C API's @pxref{25,,gcc_jit_param *}. + +@node Functions<2>,Blocks<2>,Params<2>,Creating and using functions<2> +@anchor{cp/topics/functions functions}@anchor{15f} +@subsubsection Functions + + +@geindex gccjit;;function (C++ class) +@anchor{cp/topics/functions gccjit function}@anchor{160} +@deffn {C++ Class} gccjit::function + +A @cite{gccjit::function} represents a function - either one that we're +creating ourselves, or one that we're referencing. +@end deffn + + +@deffn {C++ Function} gccjit::function gccjit::context::new_function (enum gcc_jit_function_kind, gccjit::type return_type, const char *name, std::vector ¶ms, int is_variadic, gccjit::location loc) \ + +Create a gcc_jit_function with the given name and parameters. + +Parameters "is_variadic" and "loc" are optional. + +This is a wrapper around the C API's @pxref{11,,gcc_jit_context_new_function()}. +@end deffn + +@geindex gccjit;;context;;get_builtin_function (C++ function) +@anchor{cp/topics/functions gccjit context get_builtin_function__cCP}@anchor{161} +@deffn {C++ Function} gccjit::function gccjit::context::get_builtin_function (const char* name) + +This is a wrapper around the C API's +@pxref{b1,,gcc_jit_context_get_builtin_function()}. +@end deffn + +@geindex gccjit;;function;;get_param (C++ function) +@anchor{cp/topics/functions gccjit function get_param__iC}@anchor{162} +@deffn {C++ Function} gccjit::param gccjit::function::get_param (int index) const + +Get the param of the given index (0-based). +@end deffn + +@geindex gccjit;;function;;dump_to_dot (C++ function) +@anchor{cp/topics/functions gccjit function dump_to_dot__cCP}@anchor{e0} +@deffn {C++ Function} void gccjit::function::dump_to_dot (const char* path) + +Emit the function in graphviz format to the given path. +@end deffn + +@geindex gccjit;;function;;new_local (C++ function) +@anchor{cp/topics/functions gccjit function new_local__gccjit type cCP gccjit location}@anchor{d7} +@deffn {C++ Function} gccjit::lvalue gccjit::function::new_local (gccjit::type type, const char* name, gccjit::location loc) + +Create a new local variable within the function, of the given type and +name. +@end deffn + +@node Blocks<2>,Statements<2>,Functions<2>,Creating and using functions<2> +@anchor{cp/topics/functions blocks}@anchor{163} +@subsubsection Blocks + + +@geindex gccjit;;block (C++ class) +@anchor{cp/topics/functions gccjit block}@anchor{164} +@deffn {C++ Class} gccjit::block + +A @cite{gccjit::block} represents a basic block within a function i.e. a +sequence of statements with a single entry point and a single exit +point. + +@pxref{164,,gccjit;;block} is a subclass of @pxref{104,,gccjit;;object}. + +The first basic block that you create within a function will +be the entrypoint. + +Each basic block that you create within a function must be +terminated, either with a conditional, a jump, or a return. + +It's legal to have multiple basic blocks that return within +one function. +@end deffn + +@geindex gccjit;;function;;new_block (C++ function) +@anchor{cp/topics/functions gccjit function new_block__cCP}@anchor{165} +@deffn {C++ Function} gccjit::block gccjit::function::new_block (const char* name) + +Create a basic block of the given name. The name may be NULL, but +providing meaningful names is often helpful when debugging: it may +show up in dumps of the internal representation, and in error +messages. +@end deffn + +@node Statements<2>,,Blocks<2>,Creating and using functions<2> +@anchor{cp/topics/functions statements}@anchor{166} +@subsubsection Statements + + +@geindex gccjit;;block;;add_eval (C++ function) +@anchor{cp/topics/functions gccjit block add_eval__gccjit rvalue gccjit location}@anchor{14d} +@deffn {C++ Function} void gccjit::block::add_eval (gccjit::rvalue rvalue, gccjit::location loc) + +Add evaluation of an rvalue, discarding the result +(e.g. a function call that "returns" void). + +This is equivalent to this C code: + +@example +(void)expression; +@end example + +@noindent +@end deffn + +@geindex gccjit;;block;;add_assignment (C++ function) +@anchor{cp/topics/functions gccjit block add_assignment__gccjit lvalue gccjit rvalue gccjit location}@anchor{d9} +@deffn {C++ Function} void gccjit::block::add_assignment (gccjit::lvalue lvalue, gccjit::rvalue rvalue, gccjit::location loc) + +Add evaluation of an rvalue, assigning the result to the given +lvalue. + +This is roughly equivalent to this C code: + +@example +lvalue = rvalue; +@end example + +@noindent +@end deffn + +@geindex gccjit;;block;;add_assignment_op (C++ function) +@anchor{cp/topics/functions gccjit block add_assignment_op__gccjit lvalue enum gccjit rvalue gccjit location}@anchor{dd} +@deffn {C++ Function} void gccjit::block::add_assignment_op (gccjit::lvalue lvalue, enum gcc_jit_binary_op, gccjit::rvalue rvalue, gccjit::location loc) + +Add evaluation of an rvalue, using the result to modify an +lvalue. + +This is analogous to "+=" and friends: + +@example +lvalue += rvalue; +lvalue *= rvalue; +lvalue /= rvalue; +@end example + +@noindent + +etc. For example: + +@example +/* "i++" */ +loop_body.add_assignment_op ( + i, + GCC_JIT_BINARY_OP_PLUS, + ctxt.one (int_type)); +@end example + +@noindent +@end deffn + +@geindex gccjit;;block;;add_comment (C++ function) +@anchor{cp/topics/functions gccjit block add_comment__cCP gccjit location}@anchor{e8} +@deffn {C++ Function} void gccjit::block::add_comment (const char* text, gccjit::location loc) + +Add a no-op textual comment to the internal representation of the +code. It will be optimized away, but will be visible in the dumps +seen via @pxref{5b,,GCC_JIT_BOOL_OPTION_DUMP_INITIAL_TREE} +and @pxref{1c,,GCC_JIT_BOOL_OPTION_DUMP_INITIAL_GIMPLE}, +and thus may be of use when debugging how your project's internal +representation gets converted to the libgccjit IR. + +Parameter "loc" is optional. +@end deffn + +@geindex gccjit;;block;;end_with_conditional (C++ function) +@anchor{cp/topics/functions gccjit block end_with_conditional__gccjit rvalue gccjit block gccjit block gccjit location}@anchor{dc} +@deffn {C++ Function} void gccjit::block::end_with_conditional (gccjit::rvalue boolval, gccjit::block on_true, gccjit::block on_false, gccjit::location loc) + +Terminate a block by adding evaluation of an rvalue, branching on the +result to the appropriate successor block. + +This is roughly equivalent to this C code: + +@example +if (boolval) + goto on_true; +else + goto on_false; +@end example + +@noindent + +block, boolval, on_true, and on_false must be non-NULL. +@end deffn + +@geindex gccjit;;block;;end_with_jump (C++ function) +@anchor{cp/topics/functions gccjit block end_with_jump__gccjit block gccjit location}@anchor{167} +@deffn {C++ Function} void gccjit::block::end_with_jump (gccjit::block target, gccjit::location loc) + +Terminate a block by adding a jump to the given target block. + +This is roughly equivalent to this C code: + +@example +goto target; +@end example + +@noindent +@end deffn + +@geindex gccjit;;block;;end_with_return (C++ function) +@anchor{cp/topics/functions gccjit block end_with_return__gccjit rvalue gccjit location}@anchor{168} +@deffn {C++ Function} void gccjit::block::end_with_return (gccjit::rvalue rvalue, gccjit::location loc) + +Terminate a block. + +Both params are optional. + +An rvalue must be provided for a function returning non-void, and +must not be provided by a function "returning" @cite{void}. + +If an rvalue is provided, the block is terminated by evaluating the +rvalue and returning the value. + +This is roughly equivalent to this C code: + +@example +return expression; +@end example + +@noindent + +If an rvalue is not provided, the block is terminated by adding a +valueless return, for use within a function with "void" return type. + +This is equivalent to this C code: + +@example +return; +@end example + +@noindent +@end deffn + +@c Copyright (C) 2014 Free Software Foundation, Inc. +@c Originally contributed by David Malcolm +@c +@c This is free software: you can redistribute it and/or modify it +@c under the terms of the GNU General Public License as published by +@c the Free Software Foundation, either version 3 of the License, or +@c (at your option) any later version. +@c +@c This program is distributed in the hope that it will be useful, but +@c WITHOUT ANY WARRANTY; without even the implied warranty of +@c MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +@c General Public License for more details. +@c +@c You should have received a copy of the GNU General Public License +@c along with this program. If not, see +@c . + +@node Source Locations<2>,Compilation results<2>,Creating and using functions<2>,Topic Reference<2> +@anchor{cp/topics/locations source-locations}@anchor{169}@anchor{cp/topics/locations doc}@anchor{16a} +@subsection Source Locations + + +@geindex gccjit;;location (C++ class) +@anchor{cp/topics/locations gccjit location}@anchor{fe} +@deffn {C++ Class} gccjit::location + +A @cite{gccjit::location} encapsulates a source code location, so that +you can (optionally) associate locations in your language with +statements in the JIT-compiled code, allowing the debugger to +single-step through your language. + +@cite{gccjit::location} instances are optional: you can always omit them +from any C++ API entrypoint accepting one. + +You can construct them using @pxref{ec,,gccjit;;context;;new_location()}. + +You need to enable @pxref{42,,GCC_JIT_BOOL_OPTION_DEBUGINFO} on the +@pxref{f6,,gccjit;;context} for these locations to actually be usable by +the debugger: + +@example +ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DEBUGINFO, 1); +@end example + +@noindent +@end deffn + +@geindex gccjit;;context;;new_location (C++ function) +@anchor{cp/topics/locations gccjit context new_location__cCP i i}@anchor{ec} +@deffn {C++ Function} gccjit::location gccjit::context::new_location (const char* filename, int line, int column) + +Create a @cite{gccjit::location} instance representing the given source +location. +@end deffn + +@menu +* Faking it: Faking it<2>. + +@end menu + +@node Faking it<2>,,,Source Locations<2> +@anchor{cp/topics/locations faking-it}@anchor{16b} +@subsubsection Faking it + + +If you don't have source code for your internal representation, but need +to debug, you can generate a C-like representation of the functions in +your context using @pxref{fd,,gccjit;;context;;dump_to_file()}: + +@example +ctxt.dump_to_file ("/tmp/something.c", + 1 /* update_locations */); +@end example + +@noindent + +This will dump C-like code to the given path. If the @cite{update_locations} +argument is true, this will also set up @cite{gccjit::location} information +throughout the context, pointing at the dump file as if it were a source +file, giving you @emph{something} you can step through in the debugger. + +@c Copyright (C) 2014 Free Software Foundation, Inc. +@c Originally contributed by David Malcolm +@c +@c This is free software: you can redistribute it and/or modify it +@c under the terms of the GNU General Public License as published by +@c the Free Software Foundation, either version 3 of the License, or +@c (at your option) any later version. +@c +@c This program is distributed in the hope that it will be useful, but +@c WITHOUT ANY WARRANTY; without even the implied warranty of +@c MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +@c General Public License for more details. +@c +@c You should have received a copy of the GNU General Public License +@c along with this program. If not, see +@c . + +@node Compilation results<2>,,Source Locations<2>,Topic Reference<2> +@anchor{cp/topics/results compilation-results}@anchor{16c}@anchor{cp/topics/results doc}@anchor{16d} +@subsection Compilation results + + +@geindex gcc_jit_result (C++ type) +@anchor{cp/topics/results gcc_jit_result}@anchor{16e} +@deffn {C++ Type} gcc_jit_result + +A @cite{gcc_jit_result} encapsulates the result of compiling a context. +@end deffn + +@geindex gccjit;;context;;compile (C++ function) +@anchor{cp/topics/results gccjit context compile}@anchor{cf} +@deffn {C++ Function} @pxref{16e,,gcc_jit_result*} gccjit::context::compile () + +This calls into GCC and builds the code, returning a +@cite{gcc_jit_result *}. +@end deffn + +@geindex gcc_jit_result_get_code (C++ function) +@anchor{cp/topics/results gcc_jit_result_get_code__gcc_jit_resultP cCP}@anchor{16f} +@deffn {C++ Function} void* gcc_jit_result_get_code (gcc_jit_result* result, const char* funcname) + +Locate a given function within the built machine code. +This will need to be cast to a function pointer of the +correct type before it can be called. +@end deffn + +@geindex gcc_jit_result_release (C++ function) +@anchor{cp/topics/results gcc_jit_result_release__gcc_jit_resultP}@anchor{170} +@deffn {C++ Function} void gcc_jit_result_release (gcc_jit_result* result) + +Once we're done with the code, this unloads the built .so file. +This cleans up the result; after calling this, it's no longer +valid to use the result. +@end deffn + +@c Copyright (C) 2014 Free Software Foundation, Inc. +@c Originally contributed by David Malcolm +@c +@c This is free software: you can redistribute it and/or modify it +@c under the terms of the GNU General Public License as published by +@c the Free Software Foundation, either version 3 of the License, or +@c (at your option) any later version. +@c +@c This program is distributed in the hope that it will be useful, but +@c WITHOUT ANY WARRANTY; without even the implied warranty of +@c MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +@c General Public License for more details. +@c +@c You should have received a copy of the GNU General Public License +@c along with this program. If not, see +@c . + +@node Internals,Indices and tables,C++ bindings for libgccjit,Top +@anchor{internals/index internals}@anchor{171}@anchor{internals/index doc}@anchor{172} +@chapter Internals + + +@menu +* Working on the JIT library:: +* Running the test suite:: +* Environment variables:: +* Overview of code structure:: + +@end menu + +@node Working on the JIT library,Running the test suite,,Internals +@anchor{internals/index working-on-the-jit-library}@anchor{173} +@section Working on the JIT library + + +Having checked out the source code (to "src"), you can configure and build +the JIT library like this: + +@example +mkdir build +mkdir install +PREFIX=$(pwd)/install +cd build +../src/configure \ + --enable-host-shared \ + --enable-languages=jit \ + --disable-bootstrap \ + --enable-checking=release \ + --prefix=$PREFIX +nice make -j4 # altering the "4" to however many cores you have +@end example + +@noindent + +This should build a libgccjit.so within jit/build/gcc: + +@example +[build] $ file gcc/libgccjit.so* +gcc/libgccjit.so: symbolic link to `libgccjit.so.0' +gcc/libgccjit.so.0: symbolic link to `libgccjit.so.0.0.1' +gcc/libgccjit.so.0.0.1: ELF 64-bit LSB shared object, x86-64, version 1 (SYSV), dynamically linked, not stripped +@end example + +@noindent + +Here's what those configuration options mean: + +@geindex command line option; --enable-host-shared +@anchor{internals/index cmdoption--enable-host-shared}@anchor{174} +@deffn {Option} --enable-host-shared + +Configuring with this option means that the compiler is built as +position-independent code, which incurs a slight performance hit, +but it necessary for a shared library. +@end deffn + +@geindex command line option; --enable-languages=jit +@anchor{internals/index cmdoption--enable-languages}@anchor{175} +@deffn {Option} --enable-languages=jit + +This specifies which frontends to build. The JIT library looks like +a frontend to the rest of the code. +@end deffn + +@geindex command line option; --disable-bootstrap +@anchor{internals/index cmdoption--disable-bootstrap}@anchor{176} +@deffn {Option} --disable-bootstrap + +For hacking on the "jit" subdirectory, performing a full +bootstrap can be overkill, since it's unused by a bootstrap. However, +when submitting patches, you should remove this option, to ensure that +the compiler can still bootstrap itself. +@end deffn + +@geindex command line option; --enable-checking=release +@anchor{internals/index cmdoption--enable-checking}@anchor{177} +@deffn {Option} --enable-checking=release + +The compile can perform extensive self-checking as it runs, useful when +debugging, but slowing things down. + +For maximum speed, configure with @code{--enable-checking=release} to +disable this self-checking. +@end deffn + +@node Running the test suite,Environment variables,Working on the JIT library,Internals +@anchor{internals/index running-the-test-suite}@anchor{178} +@section Running the test suite + + +@example +[build] $ cd gcc +[gcc] $ make check-jit RUNTESTFLAGS="-v -v -v" +@end example + +@noindent + +A summary of the tests can then be seen in: + +@example +jit/build/gcc/testsuite/jit/jit.sum +@end example + +@noindent + +and detailed logs in: + +@example +jit/build/gcc/testsuite/jit/jit.log +@end example + +@noindent + +The test executables can be seen as: + +@example +jit/build/gcc/testsuite/jit/*.exe +@end example + +@noindent + +which can be run independently. + +You can compile and run individual tests by passing "jit.exp=TESTNAME" to RUNTESTFLAGS e.g.: + +@example +[gcc] $ make check-jit RUNTESTFLAGS="-v -v -v jit.exp=test-factorial.c" +@end example + +@noindent + +and once a test has been compiled, you can debug it directly: + +@example +[gcc] $ PATH=.:$PATH \ + LD_LIBRARY_PATH=. \ + LIBRARY_PATH=. \ + gdb --args \ + testsuite/jit/test-factorial.exe +@end example + +@noindent + +@menu +* Running under valgrind:: + +@end menu + +@node Running under valgrind,,,Running the test suite +@anchor{internals/index running-under-valgrind}@anchor{179} +@subsection Running under valgrind + + +The jit testsuite detects if RUN_UNDER_VALGRIND is present in the +environment (with any value). If it is present, it runs the test client +code under valgrind@footnote{http://valgrind.org}, +specifcally, the default +memcheck@footnote{http://valgrind.org/docs/manual/mc-manual.html} +tool with +--leak-check=full@footnote{http://valgrind.org/docs/manual/mc-manual.html#opt.leak-check}. + +It automatically parses the output from valgrind, injecting XFAIL results if +any issues are found, or PASS results if the output is clean. The output +is saved to @code{TESTNAME.exe.valgrind.txt}. + +For example, the following invocation verbosely runs the testcase +@code{test-sum-of-squares.c} under valgrind, showing an issue: + +@example +$ RUN_UNDER_VALGRIND= \ + make check-jit \ + RUNTESTFLAGS="-v -v -v jit.exp=test-sum-of-squares.c" + +(...verbose log contains detailed valgrind errors, if any...) + + === jit Summary === + +# of expected passes 28 +# of expected failures 2 + +$ less testsuite/jit/jit.sum +(...other results...) +XFAIL: jit.dg/test-sum-of-squares.c: test-sum-of-squares.exe.valgrind.txt: definitely lost: 8 bytes in 1 blocks +XFAIL: jit.dg/test-sum-of-squares.c: test-sum-of-squares.exe.valgrind.txt: unsuppressed errors: 1 +(...other results...) + +$ less testsuite/jit/test-sum-of-squares.exe.valgrind.txt +(...shows full valgrind report for this test case...) @end example @noindent @@ -6606,7 +12092,7 @@ When running under valgrind, it's best to have configured gcc with various known false positives. @node Environment variables,Overview of code structure,Running the test suite,Internals -@anchor{internals/index environment-variables}@anchor{ca} +@anchor{internals/index environment-variables}@anchor{17a} @section Environment variables @@ -6614,7 +12100,7 @@ When running client code against a locally-built libgccjit, three environment variables need to be set up: @geindex environment variable; LD_LIBRARY_PATH -@anchor{internals/index envvar-LD_LIBRARY_PATH}@anchor{cb} +@anchor{internals/index envvar-LD_LIBRARY_PATH}@anchor{17b} @deffn {Environment Variable} LD_LIBRARY_PATH @quotation @@ -6636,7 +12122,7 @@ libgccjit.so.0.0.1: ELF 64-bit LSB shared object, x86-64, version 1 (GNU/Linux), @end deffn @geindex environment variable; PATH -@anchor{internals/index envvar-PATH}@anchor{cc} +@anchor{internals/index envvar-PATH}@anchor{17c} @deffn {Environment Variable} PATH The library uses a driver executable for converting from .s assembler @@ -6655,7 +12141,7 @@ of development. @end deffn @geindex environment variable; LIBRARY_PATH -@anchor{internals/index envvar-LIBRARY_PATH}@anchor{cd} +@anchor{internals/index envvar-LIBRARY_PATH}@anchor{17d} @deffn {Environment Variable} LIBRARY_PATH The driver executable invokes the linker, and the latter needs to locate @@ -6691,7 +12177,7 @@ hello world @noindent @node Overview of code structure,,Environment variables,Internals -@anchor{internals/index overview-of-code-structure}@anchor{ce} +@anchor{internals/index overview-of-code-structure}@anchor{17e} @section Overview of code structure @@ -6954,15 +12440,8 @@ the GC doesn't collect, and are set back to NULL before the GC can run. @end quotation -This document describes libgccjit@footnote{http://gcc.gnu.org/wiki/JIT}, an API -for embedding GCC inside programs and libraries. - -Note that libgccjit is currently of "Alpha" quality; -the APIs are not yet set in stone, and they shouldn't be used in -production yet. - @node Indices and tables,Index,Internals,Top -@anchor{index indices-and-tables}@anchor{cf} +@anchor{index indices-and-tables}@anchor{17f} @unnumbered Indices and tables diff --git a/gcc/jit/docs/_build/texinfo/sum-of-squares1.png b/gcc/jit/docs/_build/texinfo/sum-of-squares1.png new file mode 100644 index 0000000000000000000000000000000000000000..7a3b4afff38e2f365ef2a09df997cb98d032fbcb GIT binary patch literal 22839 zcmcG$c{rAB+c$cWLYY-WDw3jzNHR|$5}A@Y^NZf}lUHrmRB{ z6!!SP6U_#E<@Y7l>-f(GOAS?J;xGBXwAzQU1hI=auB@QvmNfU;-B8cw7xlsyI*na5 z8-sm!g`WG7Ym;S}xXJ$W9pfw>%L_m1Y^p5wC5B`;Z@62-cPI3$0q?CM+RvdOn|ORV zI|pJ!%fX15CG=PK@{5N>79 z z>CG1EC!SUg^B;*;^WUR!#{yqe3~JiEkB5h{uC8vPXr~iRszN1&-v;`o#gDH782tE| z_S*6>?(qA+Uwrfb^sfK;#+hUt9UXs$o5fe7SjF=8aC1|X+VyOeq-!0K@rt>n|9xRn z=|qAs1xtwXj5fQ|@(P_%%jV6SEt&)AFJ8Xf>_f3m*kjRttoq6(W&d&Szg&O+EZ4s% zFh26&;X|w0zMS5{!DkIO*IoKFAV@U)S^LGz$r)BwCU(H6jD{tI%C0-9@!3vqy8Zk2 zKgi0mTv?c$c~dJ@xAw!>-pNUcm*woMEY0lfY=WSoqLSCuWtIEAu#TAM%h44+a^%@? zsonbP=Il)ZoltN*0^-(Qi)A>cek~rrJ`1a8CPvB}Sd*pQW5!;;=9iO8mHj!z zN+~ZQB2qHHQ`${lH|s?7n$*61!T80GL&a8Io>F=$78bj{4o1l^?&MZ46ro-H{qs9j zTKDOT7loObmp;F)F|xd+o@wpqsGgXZ*uR>8qBri`xpOpxjg5`Iamt-LDn>>|Q=dNz z8NZ*O7yMMD=1W`Z8CUhnbF^ z{*-~ifW@fg*HWcSt7nn@ckU%7T23|vtbBd8^Xtru-Av3UQ)MHHt)3YeYndh=ye2$g zn3Sfkrl3Hhy_ufQ9l2AkFiplL-*W*%-kqeS6AI8 z1K5ntf7qt0U=pj{9-_=cwPAy0Yxp+BpqFVSC5N6YzSMZ^GQCmKb!L~Vg!-4Z=-mlN zFZ0FMS<=51wa;Rzx%Q>?!SPs$qoP^zH*%5>58oBFTWF--nfBlT)z6H{ucH_0(=UJMRt$QYpgt*TKVU86vDoms<{FNY=P<8$Fi#Pft!xzHnT_4>Fp2uaztQD$34o2;H)OVPUe_NNzXJ zjlXNl39_D&Po6w^ba7G<2TLqZuJtyvIj^2VR#sNIZL$+Tc`UJUi@pE;v0YA$iJ{!I zX%o?7TmNe+R%_vN&6l^Iis}Q)%gfKzE`1ub8n5$weCgeW@bK_kv9W$Q)^8*i0nAtzQ(OWS8V}8{7>{*4ockgzc|J3M5E#^AYYt(r^Bctubi|B9P zzlQ|x6A_8->+g5KTJ#T$K03SZ%1o~UcX8Q<6vo7MzaR<2ShY-@=gCrR*i1911EnLm z`F;t}(WgGydH(uwtS3drMu{(oflKk&vGpnu9Qw|+(YsYMva@NfFMoD6I1tXyik+>@ z6Fq@Nx_ISE%cHZ+v!)04@85Lo^O(be{?QyAPhUU3OV~M%tltOcQWFiSi?c+mS}pL( zkG=oO3Yk162o#^9ij&j5YSVN#Qc_aNVX}koW9KDeTlEH^f>%B}37>h5A*HQU|hKA-A=o%WT5%xHN z%F1OHjg+(F_1=EJcJc0bYw>L&%wM3jt!<|2(*g6k?Va%lFBr(7y$A~n`veB6)UJgo z^CaB6ci(BS@bR@TI|lO4teY67`itd!?6H(<;(0eQk&@_6m1Feu^gJ`Fum7jU<>aT@ z>&q4PTeh_ttz*2Dosbxkm-!$wv;SvjTH&92M%2YI>FMeDT2fL{M8m6xT6qPrv9arj znUV6md`6*~mJvx=-_i8^{CvrSZTgu71@sykogUtWSy=;)cG+>XDZvvH69l2Asd+43 z$kh6i-c~MlNmu*4r%w%?Ca7LB{QUJxZdrk4@7}$`>#M30?%w5=kugob)PMS9-nY4- z=g;X-_sLUzakh`2JYFSNP|4`==Xr{Zak_{IAMT2_NZiu;O&d4Pn%e#RHoYrjgE{>k zJAz&O96NTB&D!BUZ{1J3405GMuerGRR#hD}C^QK%t+~p5@E{{`D?UC5e?Pl4+h0<1 zRCaAq*YM04{p&t~#T9`#M*Ig3JVlwHAkc_?Q&Uq9gz%3%asN(8*BB0I|Gg*f?C8q% zG*QU3nyT0^9H+TsLcy8zs z1X~X(+I}ME z(!A0@$|YX|k>cXwic_ zUuhXen=txi`7fAIVne@Y1`Eeba2z?mz4ph56KX_QSYCmyo}Mx>gH?%HI%Q_|W@Zhw zpS+C%w$CEDdSAR~jM<|hd~re^OE2!2kzVb%adu{=&&bx^eqWyJ%NX1Wr=FEI9TA)_ zCDiS&e|~-0EiJtros--}#TJde22lY{I}Z&=-`G%KdE>?n3o9$XM~{R_{KXU9CJ>>= zm)60e*C4m&VfK2y$mQkbpxRnbzoKhz+#fcIKY#w*F}X!N{z*Awi>1iPWJ!Hzu0qc? zBi6n4Ti$*8v|q|88I2LZ#Rf&fF5uH((KA5ChyvqEo+C%th>N)2YP>AB@7$rxPI=VX z*-4>SBx+b?res%%9aL<~VmouMeN)5}H5wmO9{bnTR~FGmd#BoC`T6-nf`fr-?4JfR z_oXXQb4Xm=_4@H8zd!~qbs&{=A0I+pT|L95^A0odvajy}7XBrWsvLm9ZlcWXt7XUY z=MTQr{W^J-t(DFEhQhXO+XTyhxvnlcP|EK;nRH8V|Gs^@w6wI&&|!VcF1=G3t{*Hg zRt31+1LQPZGTj-kd+HQ3>RN1cG_$+Ad;hG{uOIWgTf_KeWmAGvOo_3YYX`gTiUt`J z7#+jizmEpp`S}(%kIS`ddxJnLyz9hLu~k3cv+XeLU1@AEei_`v zk^LuoPkbZ~iy6p+Gv%PH^*r-9b=L?T`AtsQ|0m|p`nGwEm&d9gfK^QQ_?|s`7QTLM zoM`mBC-XwiN^z2^Yc?(>hR2mgGYd#4QzQN@79Sv0F{s%v7Qpk0x|*8(cUDRVC#UA8 zPnBnc*_{s6bw&2;oT(`)&-!T{-XFnQ7Rt@DvbxH1=n%_>4I37gmy5*D$}n?d9XZ9% z`6MQCbaZquv9kKfdahb@B_0+&bSS3(v#79eL&mYNN0&dGB-}nL!q2V4 zA7y1_3s44BnDtLBFZs=LaB#c@#-^dCKZgB#e(dqhWvB zeHth-kD8l1H>|vNI8}OaaZ%aYnzyOB*?8i$-HAr3SvOlu4(y09_YT3Z7>7H1TW9z9y(m3JpF=2}f6Fj@QX@ZI;% z?<%o`_y-4H{qjbW*tc)rOx3)ton5E?1#O<_-t1HN+xq+U#YatU+<0=1uTEXFfIHh> z`W{y-HAxMMX+54Ni14z6WS5oQ4o=x4rN{45?bt6sDW8**(_isxGH53a;qKxVU(Eg_AnH z!m)Q`EnuV7e}0QwNnRPZZT*5)9Fv`$9nsJd#zsMSczE^<=<1?ZQBiTJ{Po1ckDHsD@G-0P&^OjPuyt@G(ut;|!Z%89OQ~%ahwJ>v z7C`&Qt{++6zI#{f@QTmP&5c;udv*^WUj|M@$@~dTO$q|L;-9xDDJdZc@4stDR+m0K ze00?bdkY*U=?Q9%i*s{A$vaW|ExV)D$h`t!^DeKbuIWPk+6El9?3^5ml@HI$zR}g_ zOw07d*^S6Ajd(^37v@r|+d#M(>@S{OYXhHK`S~IB-q?A~IJ<80tU7tNj!>mPGc;`O zZ4;Tf@@W9Y{qX$jns`u%lWYgg9!OpL+}8R4n6@3Tvl;}(dF&c;U=YWE(t*u7j zD4$qnU|Pl{O+`M&I<;)YC$+W3SLcnaacu73IAZ&eeSBuP^r6oSe(FN*wh(Ot-f92qI}!JZOTC=YiHV2g}htqs2LhYM>(k(cRa=VOwP>E zu(Gl~e*Aa>pQ*R6Z?mLw<0VU5XIiu%G}qjPjNEXM$pt2AC^P&g|4$NikfnkG6~^SQ zQHx2*7J(`h$jXmz3-Y~Cx8r4+x(!Xiy)uEpDJF(*@Pvy1rK>+39AqP) zw+MVarug3=B1k>|5ncXw4e0;hZ)6I&65%ThY-s7Z+WvZEPlif!tOX z`GIbt@7)Un{|#8WU~NrBV1wPnD~XAT_2%gAb)D^_O_sW*^6+G`g{7s={J8$#&JppG zz4@s~0L2M39D#j*VNlZhiFVk^J)K*Jm9ZXhlUu zgIlCu=HyE#lwQqz@?<;Y9}p>lLbKXX94>Bg@vRU>m_n5CJ3a*kf*#ACBTn5{X?*#T z<<6Zuq=HrL`ccR3tv>lib{}_$OegAU~K!D@9sCU47#Y84v%dDeK|Cd-v>_1W0b{ z?%qIns*!!K{oiDedk{Z9U)a_I3p|H5y-EU#6{F1D`yR zUYr|dy{{V88qB<#1euF7FO-#=39$XxaOc_CNqyLxZ$ zGfg|tAD=@tVyNtzpz6AI~>GB56{GLm$U zb??ckr(=Oz*x23y4A3w#s$yFen%6TBM?L0PZal^h#lIaTTzR z%Y$1W1`ieQMh%#po?d_O;K4d$`SsINQxlM(CEUO9Dk>^MZ&Cuiv3&b9Btgu9MJ00k z@Mj^3Z@ZOGFhK`R5U~n8Hns1A{9&qE=hl!V62oC}YO^me< zpkV=GQAc@UVBiMHt8>A?pl@5)%+F1NqQ~616G$o*AQNq%z++XHi^1%NMn^Ys8I_XD zTv}0~g4^x)33Vjxbdec(`+;c&)T4_lvQQqV8MgZr6&?KirZx;3)Z{BIIps7zQYVVWy2w|D)`_^$@Xd~tgtw;%Q8*Uh5g+N!Idld~CQZsFUvCah05#L_L$P85Um_mY()At7NG zWI?DV>>`%_y_3RQ*tobN0FWpNQi;C3+&`$^OKwIJlO*l0kFFlryO$at45|SfnvoE+ z#j(ei)`5AseJZHDxUz6IT`4!qz;|niGP{^P(}4pA{6j-TT8%W_-H)P{lTydfkYT3B zTthMOW;zEHmXKuwzA z8vrT!KJDdWbv=HZ7Hc5vwqSwAe|+X5yOqFfGo##7cp)O5tFBLwHMT$-&|5 z$CsIpuP+Nd(8 zmaCs)Z4q{Pg@5z2Yw{6y{Y8znb432fJewdL{7 zP`^8IapcBA?+io}!!0BY6u~>X4^N(b^TeI35`m06-;9}Bg^S#Ec$IZ_b@3zaC^Nd& z3skc^Uv4`R@;7hZJj^zj^W;fVQgX6GchXTPMZv-LfE`pm=(76`9*lxDWIsPrUgDf0 z?XHM!(}!~1(cPW(KUr8n3DIiya4e=~XVqbU1qXwZ9R~-={j8|1%>)Mj3U5CZnkv#7 z989@xT~4H{p~ls#;?UqMydm6mXf6U$9vef&+NvqL2H-(<9qtFGFk zRMnZ?D&LH3qAOqD6}x?XyY-;_Xg*bPT-z;}AZ`PZS~3>F`{lLbe#N?8_RWDg-+ZRhMD_49>E2+G8E~LOhYs-& zV(9N9)mQcxnAIlY*eI=Ezg`b2e`I82A4D(5cVq?OBUNy>Vi-RZw@e9M9yFc(6lrKt z)$o*{3`7?fi>!g+>OuO$c|)sGCH9e`QZSr~@1sX2xQ0 z<$z}`S}ccJ4O!scWq-^5OUGb>Q|A~9-f26L3h=|q%p=ds7dBPEc8VzGvC@$tGR zPcmpGOUB_{i#$dpJXghP*M5xZ85xaO)F^_QKS1Ytx%O+>xO^N;AfQaw#N-44ZQ6i) zo;I^!J}5(0&b@Eh)2WMnWaNXczV42t!Z3KVo_~IR*cd#sEr55X8kj@(%bVJ1qvij_ z#`|2Es}V2s0#$kQO9MT<%||6Ab-cXl6i2S7;B@suz}PZiX1w;cug~Cz(u>sb?|n<2 zPV?-+Bi$c#V>4J5aeN(c?Rby7TRHtss;lQ7?zwD=;sU6)>Bx~I=q5SCYwDRg{{H?J zLyykFMcVi6+qcBme8l4XD4PsqkvQ)7AjX}R=!9);ZT4U565i5&{n`J!?yCqdow2d8 zwA+IG+4;jxSFZy`n|u9SPkJe8Y7JGFKad>k)-5I|`rLwo^w?pP#ErG3!QTG|V3%I!qs$vfQcy@w~JW`|`a=@CLhBJrokkGV4! zYOw9W)%#c_cANpgT-1vDY za)(SP`7u$Lno-H3P$4p|eR)G}ADdTQVC0Iwv`AJ&CFsNwJ+iu0g_@c9%8!lN7 z`?O&B7mNZ!JG!OXy$lQt65fBLN$$6Kvp?2&a=vmLK$8;OHPOUdYg<(59WdGeKWavS z!p6jheg9>BdJpuK=LI0j{bEy?!@T-fxSG51=o|RhsAM37nRB znv2_flCVd4TB`W;;e)DWv7xw0sq?5fr93pG=$29KO zl8Oxpp`CvJexPcnvNEo-uh>d;Sg-uwUQpX>Gfmv2;h~{hkPVq-_Ve3WSjdAW_YXvW zkQ(Z}9+Q$ns))BeQ(y#U;J0FGYOdc8T)Mp`kr$N_D1il3=ZOv$5D-Xwy)~M$H7!%e zp_HWz^?e&Vd)w>t`eZ-EU$vncegyJ7w-9zZ^+Uf>{w$~&l@EN!(-*E=wT5#?tMS$h z{hVq?{sajh9_+J|$eYApt69}^)=H_EnlCC5vhEKfcN&$?8_#7^9*-X>vPA|{K+&}F z$wjbWC71nzvk@Yo^1;?P&J(Q-DvK-c_}4Ygk5$EzLbh_x#(g*`vDMWcS9T zqvB$PdapIde%ag4zRz+S*g&-ptCCd;q@!SN&uxRgN~}Ee2!C>g!^v^>s;0BXn?C}b zi4KmA9Rqhk5s3*vdLpIvVNc!`_%HuTy~GAO7SXcu_0_yaPfNRh-;c~eO*GtukmFxh z=M_7u+uHL5V67Q4$pW^hB{14PK|yDo>0Rz`Vmo?DbCfvr`QKd{c!^F&Obm-X2;H^f zC*bJl2t8ACf8MV!YXEUq^9#QVO6q++Lm{6>`YiO-)I7#SJe zJUlG1Q4MRZ3i@OXI_T+ns=ALlp7aJoTd(~~WAGMqT*z5{?y=rV&z^x9Ayh&i&T)7n z*18$RkaYX`Dj$ZYj$@5Tt&&X2nATKuJ01OIKYRV9UWZ#!d0EHU{cQ8izI)NROKtUc zUvzbSid04Pty?|_GmrtFnb$Q(DlUu{J{q@-6X?l;?KW$w$`egu-uQ#&t*6aB1IE36 z(L+iA)LrMJ((jPJ8m4k;iEG+9@93KTR@NP|Hy)3PfSjd0e#~xu1Ktu~Sz`=zq8(3giv1dVRO4x4(YHgkkP0#sqT=$=Q3&)*e-$J}f zmk6Vn3!NlzETN5>WZkK*p+W02*QBB}Ha0f9y)-A!)E(QP7n{7jukW_xwa+KOFX#*Z zKJf_FhZ@98eEa$}r?U2c5bZ}|Do@@=TLP+u5vq5;B2VM&S#FA5U=LNJF_m)I#FX0e z8Ev>*?cLpxPz8amVLn+qI2`};=g(3r1PK97JCjEi6kO77w-AA81FXC1oc`X6iTTQG zU&zZ>uR>;qSMpIy>32vQ7XFyc2v1Fg0RW-88glsjaA^?87%gF1cjGP+N}ty1`ok4c zmY;TXgc4#72Py@(+bx~yV=t?(mqVKDa80s$mwGQy-_*yC{58E3pFU}LuPw2WaFD?M z%YYN#izfcb`5oXCmCwl}i5C_%5w(ON+B5v%tZkyUeKp-U7B-&w#+8vNvYrAp3qF7A zElqw-vdUaH(m1fSGqi7D8fcZ5l{MCg?JQC_Gf=*j7w6)mf`X_~?Op+(wl_EX!6efH zA1%3xe$?L9mTjb`!{P6_rPSCd> zKkm$bfgbS@_5*#ZzP_G1V}c<3sEKX_-;7tJ(U$&V`~v+(H%h z`viM{EOj=2@2K(Kj)_r}`?Ine3!9UvbnZ%=dD4fFh=|O1bFZo`JdP-UOnrS5Tl7FQ!94hUu%g}>qhTt2?sGyA$``SM@s4f4ao!{uIEcka}J z>2R){X+3uj+ukEb;q8qw5 zGlW=(keZhw2A&TwP0&^A+_)j_`L%`3chNKzr~r!^YhpElUAmb1_jeF!cmkgzk)`bc z0nP#Nqg+U$;tDkOsmV!hDL;g||3TsWyu4JPsL0V}ktm$R_GQonpL}iQd{kDZXJ6CQeV~cm%Gm^%^JI#2 z2-aC?()s%~67e_NrFw1vsS4+kGMIE8tPTT@sXb;}VHqxB1BGW`=B_aIorrz!uHT41 z(4Vv#)hlON1Rh*KuMN2Nl-;W1IS8D1O^P&{_`*w#gNi z<{W<7n4k@i7=o?7!_rD!Qy{Jh@-12(0As#EpvH?8aj7gZWE?q@=z>IS7KZIoxe@tA zX+QsBiVg~mx-u%Bc-VHU4ydqJq_@u~_uB_JH1x8LA729c)H*H9!ny2JQ5s5fl_eT-Izx zJ7J^8?-h~ONUpGJ7Amw zRe|$wo`m2|-1sqU2TQNJ^AhRd7@^T20kaW@ZZjJj)Ig_qs0@?u-)}%DfaFg{F1&dP zDc+wUPl5b-WW0y!z2zX7F5qO4KYyQ>g_ewCFV6OFB2%Hzl5nMTq%x;;U5LETXQ1%| zW0RpVD1iP9LFFQ#D=m=giq8!ndVcQ+{Ne@khn`e6NnXB39qkc+ zevSXN{Jrv(G}l#kdiK4K6~zfCSHN~B*HIJt2KWGV=)He`rT#HD?1uwNfmmiBf-3NJ0vIC7ckwhKJ$Ms{ zZVL<>WhjMYR{HniD=oN%Y?9Ie$b5{Hxqp98`g&v@AJRX>?hw2xH+uO@Zvy2OTq3f> z0f@Mep8^=^Dfl7QXXe$zsNTtPc9^nV2G@U{$247|>lvJBL)6 z$rFXni%dXPFKjdAW5><{$)cG1<7(ljk?QkZXO;MNt#x|0aWvu8H`tb<~ z!MGQe@D$rRI+~DjCeMY{+)y!7*y!@kpX8ab|43!}3grasfqv|XJ1chkWB2cTXwo2X zgf!=&;*t_YfpO3^Ek*>CBwd+k#P@rErE-tQ_j~|g*ukVsA;Pe0e`^I+J8|-9a zyxeJ!TuAKGoe<`JvuSSm&CBgn39N5{j0fJW{Z8EN+q*d!fD0E_vgFR^&;$IctE=bOf`N8XH$hp_G_i0J@T1h`=@a>uDhBY4b{yVXh`9~Q~$Aly0lvq;Q_!li3&ZQVfb zN5nVpvpN9bK;r%ikBb{E2!Q8NwYIia2pkoE|0V8RA_dYwPQ? zCPeJ{5`bIYKEErv^d~78+2OH)O~L(nsB<8V{`c=&l~0pi92}M~2wkLeY+1~XPRPf{ z$1ZA12O9RQy=og;8!aEQ#Awe~B9ke7(7yoe(~645JEDsN$?$}j*k&Zc9z&i&Izbq~ zpEPUWyEZ`{BU78dF>wN`#RoU`eNSo>$Zhk;h|$c#=w`GCZS0$4Xz~D4xq_!ppMHkG z^H+F+8#iyu(=#y%7q#o&B_Y917D3b>@+^k$l-mJeB@jtoGYnryRz{%Q;!b~ss>K6W zj?`=sBl-$8uJW5%*{P=qKL1u-2tCMrJgcDb{tQL0LxJ`|jgY8HB4b&Irr0C10Aoyb z`OEkP*Xy7|uCTdgM=KBFw>;p~%|P1}WU6vRrkO7rvnsBi$EpUz(y{d*E@ppEG0$>C zrh|;WkqM0YziVW7gJ2j?S}IC<<~W!9Qxq&bO@IZVD8iF?Ju)y*hrJ?xdjBJ`jr(54 z-~loZHp|LR_VyMi{AjxMk8b7&L!rdT3lCa41U~XjkXg03aDfrWgS;iMk}nhosX`qk zZA`>A6%TA}9v|O{NhiUVr;S^&!#?BQvP)e(S70L~Bt&`afk!Y6h<%Cw4QP_s+Zhn@ z*bh5yCYux>fGfJE{=1I$_C~;vV7$B)SPE3ub#jNy*TWr`2vMd)s~_h5MTShUA}e7d zbhv3`G7O%)5BLDe042^7aOnL5+$eKK4xe*}%AMFybi)A_cu=e*B_$Pu9&9G_QVXCO z)QJ4b1k<2B2m#0NxvDvZsnF;7xRijmrM#Uspr$ATvACr2}g_Np6M&8dy-^e9!v}87m=Q>(B3>06Ag3lQbC0iIKW8 zyBX~ufZ@JA88{(?Q9Ew#cHlyNBE99YPa2szbe!UJ2w1EjWR4ihUq{`0xiJ$H7ANi= zT2C6Bd3kwwF^nd}yz1@EUb@YtOOL!mPxATl+zWL-H(;`f>^aCGz4ndf4+3bk0(gAv zwI=DYG`q)D!WT1BQz-E$jyC-&362sjQ#7{SNwn_uULf+o0gQKqOhbEQf92cw>9XK+ zxJ}2MMhzM}ZzndzpT+L94yok;&>Tx(Doi~&f}0dO4GNLzi^fLGB<`kxvBFjzBsX?YrzyUJXICBxdCh1Cpf_N_e*d|0~Lcm@IrP#=X-YP0d$Ek8zaxxFsdhf^u%xGp2 zh^7UHgg9KY>(O@}F3EgTYM-N*`|Vv1a)@!ScJx%}oq`LDIGQhx5)D_V1)Tj!Xqoi% z5k_+0-9CPPe#EJAAo+0q^o50sP*Jm9vkBsqC?(T!kdZCpqlp90Xsfx%NjjiDB#4R; zZbRhA0zQ6QdwaAK7mp$mId=q&H(-ntHk%djv9OrfQ*!JRsf9CAq)mtc93blbPYZMX z5kmwC5_8Ow(zmg+q&#@A$f!OWxtHt`(VzOS1j?Jw#8RX+G&HDOuyS(JP*w(1u(q;N z0@jRM`;C!5@*fBWrlG2TD2%;(_c*p7MwgBe_Lu{5MWKVz%k*(}Hm15-62+RCnY;!6 zHo_BYzvLbe7QQw6Yc*NUJB8@Q;WaucFpWNR0x$sKY#M?h4M%O8?ChYznO z*kLu4pY+6J%*M25Zx*Qguj$k>8{nm@LQsajg{{Q3P|YrS%&G)ZFdk<-$4r7N9+yf64X@o?VA z0(S$gQ6>yN0wOZu^WXt5^1@{CB~u@e4ku@4L&*^Vlmjxk=H~YJT*adg1-kttlo&9+ zKtb$~^9o1kT*=s&lUQilbWk2Z{I%wRqJ4nVh!DZpHLG&jLuwuP6gTwd*%%2@=;%5! zo?j9E&oEc+aeE}D0oXfCRipZg>Jt6Qs5_Ym1yN5!Ve6W`|1IGtSW4;0S;3;ZFGr&k zM6;CPPf^JKV54;!M_a6#{_tU)n}PG)^6(C-uFJW?KCEJ~N|=F#6@L>-6wv^nabdXj zMZQh2GEcgag}To{mXZ&!x>~@fLJrpd)|t`PGn>}`4Z-K;?z0^}J!#u?dE#gjgQD3% zPen3yek$9VnWZ#D3)_(Y-t!Wc7x7m*y?u7T%<%%$Ac5)r)8;tes`o3-lsoE&RgAL( z^B_O13{5d?DV+uxw??p|udpGl5cdZEbtEA6pJQ|qx5lN^n*uf;uoBnSo_W`2yyqTa6{vPR~4 zv-9#$l9|wm_Cu#9lX(VV>9u2fyDNu_4N5H!h#3@) z`eu53Imp7Umn08l{0aIaI07{g-ZMmfD5US@TzrvnY@dLDBBbuEf=2$w!nTr9N^nF( zoM0Y|WfJO;10kT*4R|ebd>@lp2n=ojM;8G_zLl65iu-XNGC>!|_0#Pm_k8aTpE)d7U`~t&SA5pWFm93qfP4k}X^xI&52EzqFQ5Tht6mB#(>S{zVHBSt`Y0`m(B zLV~mN^TUx6YJ2mhZbb4*?X$!2$1`;jrLGm`8|-0@2DZPO0Lj)v()5YjDT8+|umD}Z zO&!PR))gbcG*G|es6u=hc3;SGmz=!3)5fYPRHkQEDhmI3 z6v3MAyF(a1=C66EQ-0*ruaxiXWue2xR@5Y4gQrT4OAH~Ygec7Po4UfIyO4Tz6cj}p z$6@0<=LFmDN}+D42{XU_iE5GWr}ggqeA(MeX6q=@2CP4RD?7*%vf0e<1s)mzj06Pd zxYQv4V|E8f{8#w0Z!tFTk1rdL1Yv?qg#ynk73%)nw(o5ryZfx8f!9gRg4!zU_85br z+IFj60b4i}Se+q zo6x3FX9mbBq+)sG{FwbxT@MDIRaI4ohK4MVtOHqd){%lJK@K6H5f!ACKW$OgFQ{#& zHELN|S!sZxfGOFl<_}>!v=2>Bcx{xj<2zH)>%T`L+%vqSNfH zkr+&b#kq?mMELxe1o4+w*F7>S*KP#y0`i#y=t8HQlacT|_qtmDCbQiAlJX;4#DklR zs5p*pc#UxhbuF#E8Fp5|2qKE1)ba3;CJZf6U{p@39IE4<%UoCHhN6jHNZdIY8NMKf zGz14%3mC|Mzo zhmac@JkCW(wu4nKq#hVJACcWEv+LP$NL-wcaQ*qs26L}jNFGt{s<~y@{``43LZuki z3k^<*_;5OMTFCH`55o>=H4u-fxw!*1d^+xQhiwj2qD&IE5aOI0|F4Lf)$@Nx+yK|( zowzc*BVXk{`|-aTwEH9^60q53qU8SAyUtz7`EtG6u2+B$G#@UTe`Vznk_XW3lr=Gk zKM#Zt%0%`1_itgl?(HP`!VOLkwPQeKSilo6Fn&$p_QTEsQFfFTZcZbldlfMUg0!E& zFHuORf1SR(@yo~^mGJRqRuEwp=R3u$r+w%P?&wR2J&9-N-j%axCg`XJ=~3}3D2Jct zIB6-F=9}?e&C$Va@@=Nxc9GtgC&+B3nNY3|99@0lz3@4tQ)sT~b4v5-4ciqzo1QPy zohhF0=c<0!8T(6pd#ZQp)J?!@LLQV6A0oG(Hb^hxFFq+;a0`$rBV#u0dg|oZ*!#=I zbx`B!5a%aH{7Fe4X;kjm_D4vIZ@KbJ#EBjAx(WPIa2=e&)shMW*Pe|Z_>Mt*e0rS-^OUv&ue9Yn}T#h z%Bu=1<`hIHmNvTFIR`~=m#YuBan``Lop3v1byidJ2ojq*B<{{FDnNd0SZXQz*G7}kq{1q^-ycw z4z8|mCI21MZVmbT87wcMtNbT;$I`aNK7v@`;^%eqlApMIb$6Fj6pE=Owp-Jek?iuq zLI%)Ux0QwTm-Qc}r^$F>g48u3JnCeq@XE(gG|1?b6rroz$d{tOCF}BiUp z9q??#$f@~v4f?qi>d(T`QVaCFdotv0fg^<_yddU&U3Fq=${!;(@C|}Z)$Thpdt(b8db<*m^9i-Xkt!32NpjR$Sx)x8LmQ{0Q^Vsq|JXx{3wwtC& zYy>;JMt<)s>0D$x4i1KvKqS!3Q|;A5cNlS-!Z6 zm`6ZTO_rYE;DAZv4}0g52Z1;@AhXBcU9mrOMn_*it|O@ddpP$wo8Aeo+&S-2oef#J zOYYaNzrqpe8)3N3EE-!XGa8-SbM%OP$g47iyx7i%U-BEg)>fk-hZ&Va^b+q>E32sB zLq1}%_>P%5DgZ?qTye2q_j0F4688`7NEDlayAT6((CgaQKhSF^)=sOp*Iaw}uR${1 z3H>Vn*>lt#!FSt-Q|8rhuoy3~vtM!fY5P3k#l9S6k%JdrQL#Gn@7t&C5pz<%)%?{s zcu~Mq`~X5O8$apA3%RT>$ABv{HtVZS!SN0k$}K;A`*?H1gM}}@KT%M`X#eZ#Bhphx zj=-?oaSP57j%#}9iSDe^R39y+Vm=$RyJmfKjQ~Y%#pk@;&1+y{GB(@36MwB7%0jFgGlkUUA1! z|Arffmjy?6&!)a3gDwI3OMOo9n2_WF&@nERp*pZrAT6b8ZB<%OvO}Ddl6t zfS3U6zSTLcK1iKi$+eG_nVI|CI#d-u^vH$zld&Egg_RW*Tjk%)>wSF^I8Jw^gsc2x zu=p!Z`-?G;fNLSx1+YrM$7-UDxicgA_5-jFl@A67URf4EB5wKudl3qRI{6b;NNS~b zbf|}hgmB+Ip#n7TR8fc$mx4(=e3mm!R(N{H9^7$CdC31|NRS}j!}RC#yLU>&?Uc5@ zEt)4;SeUUHU*Ks$Vn#uHduj0q2J%TfO@BuqaFB5{ONU@V;$<6a>t3v}eWUMs5&+}F=vLPO_?1_zvmwY#Ccl{2ZO~fUK95K*%*MD_z;NK@nxE56Bn4+TZ z$q%<-4YUB{k|@=&EUAz@HW*5C3MxoAKVvENc0<=<)5r)1CNLWjbM}ANI0DZr2(|)A zYB@{|*8h&*pPjI*7z%4n`^*{stK0I|R}V!#RuHY-2CO3PJmL?h+v&;}9FeCjEt3G+ z*jfE^Gc&FJlj8javgXz$FTqRzlhk1`zj7)pzjt;sa#(gG0w8;rxpc*KY%uGx^ zc=|}WL?KeQ7}tvQ_osr%wrlrpQhgvtV#%3%thv?7!XzG<&w;i~JeYPKSy z9F3_vxXoO@m#>fy@F6v9Ou!Fi3VS;JUEFmdK5f$aIN)_A-UKxhr_Xu3E}7`X{s<19 zK?f8=xM(9SE%P0B%2VsE@+qP-Is8e+YJQOJMhn)i`!i^0})1YYamqJV!z$EK=FF*e&2uCn1x)9Tith8SgIN7UABB83kh2}&?AurAii9pWZ*q9P3 zqua8hLJ`3eLaf@h;w)V>U*}=5t8<3L(wR&2MXFv46BLk&My1c|hRS?^c%QxWJ8~C1 zdC0Ty{?f5+ii17F1Ip<*cKAVg--EGe43@INQwzmY9+ctGZjC$+FPt2gXm4%JdT|NT zfjI(qTOxaYe13foM{WirlS6Qjv?bK|Vws7=LpB?asi^2c+19)#9)V%Z{vDN28>!?a zDAbhuFxEyX-{0Twih*fV(5%yD?g3Eea!N{K5bkLk8%rW+m<@5J`rw11VVwHqox7=k z%dap$pBFI!qgs#h9eI{I&GbfZ#hiPw^~on7af@nx-5uL*kLs?Jeb_Vc)Xt` z!nH`!sOanKH%W9Hdf#{Elfh@BKpY|1I9cF-K9i#HjtGq_SkxYkLpFe*R z`Xc!}MlyX58A98|JJ?3G)Fe-<5+Oi}S5V~8{*IirZDrI26Q>q5jh zKbK!i;shsd1u+-4YNadgJj>ERKjLF(Z0sa+EAFEzU<0ax55zSq=uDRJ&Ah&xVpcqP zg@u6+AMS_6{Hn*F-~U$!=Ni&v9EEW$%)|?9Y8aYQPAV*MTC9suSrVfm zXniniI_FT-5++P4hWB)dW+pW4Ls?1)VJU)TNqCvJ!py+Shp@a6q=E>RN@~B;*Nwe< z-}it1|8vgsJm)!yj9ChA3g89|`;2ynszkm@gm$J0E`)v0h}wT9(n_1-eXdvggg{V3 z;a7(m<4ueY<|=f@(L+jyT^nVySYfJU>X(o*gT+Gh*!0SpLsP|%-jXBSyjG4H^K!`?0iC$y8GIXWdb&tyo(MSA+(_5qAEisMY4@?*cNWputIKF%(XQw0f2N zsjoA6_=P*M>|Dt=ry~GYn=YVFQOtlqbEQ-gpb7H<@%}?tZnS?510pL#zzlJ(VDJaF zfSI*>`aKJhONadM*^)8at-rThFJ;sKeXOmor;r{PG;q*;DSUiXj!N~5!`WYS5g?G^ zxr>u&>m~6A?Vl7BvfxXos)P*3Gb1`MIQ3?q=VR?h*C1=b+S)A~t;%WYY`dvF`?$>( z>w1ou7>ZDi*_F|b$fx<~O9S!?A>yS|B=U{+=Ss!25c)_pq<*I4B&c>)S636N%J)%e zXSs8&TBEs$y5hsuM%IviG!8!x8a4wNczJobfayHyHZx}#NmRGEQtK?sFh@zzJvIiD z=__&=wpY_Cl|wLR7U^toWTXtHkKLoj*)?v#SX$+OtfrBzR^hJ^!w4BMXO4aK-4^Su z3JFP}ZWrtU4Y6}jP|%TU?G-<7q}}P|dB(}p;S2!7;~H2&;Pax`3Er7`y2m8|s*@KI zV>YYlJ%m;4#A-$?24g2i5-ziVjcC_;h$1Z7N{BQ>pkh1GT!|%L6#)a+7z{TBmM5A9 zDu6P${+_9+q^t#_PJTb9P{@QiL^^<%JTQezKU%ovxVF6Ci+jZ#g!*WPL?Gi}59;dN zXx51ME>VQ04Hq>uGpDfd*~|r01Y1f~Knn-$KqV zu^s`mC4vR6p{y;iiKe9!6E_5U#YA9I{-y;oS-)r>NQnGaf3-}-3)$STKw?hw6u_ju zdDL!(%uG~(?$ZNE9Ox~&5kWB0)Ac5~&8v_NUZM5*-h>8PNu;U!RptLbx{~g+vb~Mn eaE;gOwsT^8pt54$vI|bgPTH8*3$LOLMgIT|uYo}T literal 0 HcmV?d00001 diff --git a/gcc/jit/docs/cp/index.rst b/gcc/jit/docs/cp/index.rst new file mode 100644 index 00000000000..9483f14611f --- /dev/null +++ b/gcc/jit/docs/cp/index.rst @@ -0,0 +1,41 @@ +.. Copyright (C) 2014 Free Software Foundation, Inc. + Originally contributed by David Malcolm + + This is free software: you can redistribute it and/or modify it + under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, but + WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see + . + +C++ bindings for libgccjit +========================== + +This document describes the C++ bindings to +`libgccjit `_, an API for embedding GCC +inside programs and libraries. + +The C++ bindings consist of a single header file ``libgccjit++.h``. + +This is a collection of "thin" wrapper classes around the C API. +Everything is an inline function, implemented in terms of the C API, +so there is nothing extra to link against. + +Note that libgccjit is currently of "Alpha" quality; +the APIs are not yet set in stone, and they shouldn't be used in +production yet. + +Contents: + +.. toctree:: + :maxdepth: 2 + + intro/index.rst + topics/index.rst diff --git a/gcc/jit/docs/cp/intro/index.rst b/gcc/jit/docs/cp/intro/index.rst new file mode 100644 index 00000000000..d3bcec93c75 --- /dev/null +++ b/gcc/jit/docs/cp/intro/index.rst @@ -0,0 +1,27 @@ +.. Copyright (C) 2014 Free Software Foundation, Inc. + Originally contributed by David Malcolm + + This is free software: you can redistribute it and/or modify it + under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, but + WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see + . + +Tutorial +======== + +.. toctree:: + :maxdepth: 2 + + tutorial01.rst + tutorial02.rst + tutorial03.rst + tutorial04.rst diff --git a/gcc/jit/docs/cp/intro/tutorial01.rst b/gcc/jit/docs/cp/intro/tutorial01.rst new file mode 100644 index 00000000000..f9348ebbfde --- /dev/null +++ b/gcc/jit/docs/cp/intro/tutorial01.rst @@ -0,0 +1,52 @@ +.. Copyright (C) 2014 Free Software Foundation, Inc. + Originally contributed by David Malcolm + + This is free software: you can redistribute it and/or modify it + under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, but + WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see + . + +.. default-domain:: cpp + +Tutorial part 1: "Hello world" +============================== + +Before we look at the details of the API, let's look at building and +running programs that use the library. + +Here's a toy "hello world" program that uses the library's C++ API to +synthesize a call to `printf` and uses it to write a message to stdout. + +Don't worry about the content of the program for now; we'll cover +the details in later parts of this tutorial. + + .. literalinclude:: ../../examples/tut01-hello-world.cc + :language: c++ + +Copy the above to `tut01-hello-world.cc`. + +Assuming you have the jit library installed, build the test program +using: + +.. code-block:: console + + $ gcc \ + tut01-hello-world.cc \ + -o tut01-hello-world \ + -lgccjit + +You should then be able to run the built program: + +.. code-block:: console + + $ ./tut01-hello-world + hello world diff --git a/gcc/jit/docs/cp/intro/tutorial02.rst b/gcc/jit/docs/cp/intro/tutorial02.rst new file mode 100644 index 00000000000..97f001fdb62 --- /dev/null +++ b/gcc/jit/docs/cp/intro/tutorial02.rst @@ -0,0 +1,344 @@ +.. Copyright (C) 2014 Free Software Foundation, Inc. + Originally contributed by David Malcolm + + This is free software: you can redistribute it and/or modify it + under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, but + WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see + . + +.. default-domain:: cpp + +Tutorial part 2: Creating a trivial machine code function +--------------------------------------------------------- + +Consider this C function: + +.. code-block:: c + + int square (int i) + { + return i * i; + } + +How can we construct this at run-time using libgccjit's C++ API? + +First we need to include the relevant header: + +.. code-block:: c++ + + #include + +All state associated with compilation is associated with a +:type:`gccjit::context`, which is a thin C++ wrapper around the C API's +:c:type:`gcc_jit_context *`. + +Create one using :func:`gccjit::context::acquire`: + +.. code-block:: c++ + + gccjit::context ctxt; + ctxt = gccjit::context::acquire (); + +The JIT library has a system of types. It is statically-typed: every +expression is of a specific type, fixed at compile-time. In our example, +all of the expressions are of the C `int` type, so let's obtain this from +the context, as a :type:`gccjit::type`, using +:func:`gccjit::context::get_type`: + +.. code-block:: c++ + + gccjit::type int_type = ctxt.get_type (GCC_JIT_TYPE_INT); + +:type:`gccjit::type` is an example of a "contextual" object: every +entity in the API is associated with a :type:`gccjit::context`. + +Memory management is easy: all such "contextual" objects are automatically +cleaned up for you when the context is released, using +:func:`gccjit::context::release`: + +.. code-block:: c++ + + ctxt.release (); + +so you don't need to manually track and cleanup all objects, just the +contexts. + +All of the C++ classes in the API are thin wrappers around pointers to +types in the C API. + +The C++ class hierarchy within the ``gccjit`` namespace looks like this:: + + +- object + +- location + +- type + +- struct + +- field + +- function + +- block + +- rvalue + +- lvalue + +- param + +One thing you can do with a :type:`gccjit::object` is +to ask it for a human-readable description as a :type:`std::string`, using +:func:`gccjit::object::get_debug_string`: + +.. code-block:: c++ + + printf ("obj: %s\n", obj.get_debug_string ().c_str ()); + +giving this text on stdout: + +.. code-block:: bash + + obj: int + +This is invaluable when debugging. + +Let's create the function. To do so, we first need to construct +its single parameter, specifying its type and giving it a name, +using :func:`gccjit::context::new_param`: + +.. code-block:: c++ + + gccjit::param param_i = ctxt.new_param (int_type, "i"); + +and we can then make a vector of all of the params of the function, +in this case just one: + +.. code-block:: c++ + + std::vector params; + params.push_back (param_i); + +Now we can create the function, using +:c:func:`gccjit::context::new_function`: + +.. code-block:: c++ + + gccjit::function func = + ctxt.new_function (GCC_JIT_FUNCTION_EXPORTED, + int_type, + "square", + params, + 0); + +To define the code within the function, we must create basic blocks +containing statements. + +Every basic block contains a list of statements, eventually terminated +by a statement that either returns, or jumps to another basic block. + +Our function has no control-flow, so we just need one basic block: + +.. code-block:: c++ + + gccjit::block block = func.new_block (); + +Our basic block is relatively simple: it immediately terminates by +returning the value of an expression. + +We can build the expression using :func:`gccjit::context::new_binary_op`: + +.. code-block:: c++ + + gccjit::rvalue expr = + ctxt.new_binary_op ( + GCC_JIT_BINARY_OP_MULT, int_type, + param_i, param_i); + +A :type:`gccjit::rvalue` is another example of a +:type:`gccjit::object` subclass. As before, we can print it with +:func:`gccjit::object::get_debug_string`. + +.. code-block:: c++ + + printf ("expr: %s\n", expr.get_debug_string ().c_str ()); + +giving this output: + +.. code-block:: bash + + expr: i * i + +Note that :type:`gccjit::rvalue` provides numerous overloaded operators +which can be used to dramatically reduce the amount of typing needed. +We can build the above binary operation more directly with this one-liner: + +.. code-block:: c++ + + gccjit::rvalue expr = param_i * param_i; + +Creating the expression in itself doesn't do anything; we have to add +this expression to a statement within the block. In this case, we use it +to build a return statement, which terminates the basic block: + +.. code-block:: c++ + + block.end_with_return (expr); + +OK, we've populated the context. We can now compile it using +:func:`gccjit::context::compile`: + +.. code-block:: c++ + + gcc_jit_result *result; + result = ctxt.compile (); + +and get a :c:type:`gcc_jit_result *`. + +We can now use :c:func:`gcc_jit_result_get_code` to look up a specific +machine code routine within the result, in this case, the function we +created above. + +.. code-block:: c++ + + void *fn_ptr = gcc_jit_result_get_code (result, "square"); + if (!fn_ptr) + { + fprintf (stderr, "NULL fn_ptr"); + goto error; + } + +We can now cast the pointer to an appropriate function pointer type, and +then call it: + +.. code-block:: c++ + + typedef int (*fn_type) (int); + fn_type square = (fn_type)fn_ptr; + printf ("result: %d", square (5)); + +.. code-block:: bash + + result: 25 + + +Options +******* + +To get more information on what's going on, you can set debugging flags +on the context using :func:`gccjit::context::set_bool_option`. + +.. (I'm deliberately not mentioning + :c:macro:`GCC_JIT_BOOL_OPTION_DUMP_INITIAL_TREE` here since I think + it's probably more of use to implementors than to users) + +Setting :c:macro:`GCC_JIT_BOOL_OPTION_DUMP_INITIAL_GIMPLE` will dump a +C-like representation to stderr when you compile (GCC's "GIMPLE" +representation): + +.. code-block:: c++ + + ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DUMP_INITIAL_GIMPLE, 1); + result = ctxt.compile (); + +.. code-block:: c + + square (signed int i) + { + signed int D.260; + + entry: + D.260 = i * i; + return D.260; + } + +We can see the generated machine code in assembler form (on stderr) by +setting :c:macro:`GCC_JIT_BOOL_OPTION_DUMP_GENERATED_CODE` on the context +before compiling: + +.. code-block:: c++ + + ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DUMP_GENERATED_CODE, 1); + result = ctxt.compile (); + +.. code-block:: gas + + .file "fake.c" + .text + .globl square + .type square, @function + square: + .LFB6: + .cfi_startproc + pushq %rbp + .cfi_def_cfa_offset 16 + .cfi_offset 6, -16 + movq %rsp, %rbp + .cfi_def_cfa_register 6 + movl %edi, -4(%rbp) + .L14: + movl -4(%rbp), %eax + imull -4(%rbp), %eax + popq %rbp + .cfi_def_cfa 7, 8 + ret + .cfi_endproc + .LFE6: + .size square, .-square + .ident "GCC: (GNU) 4.9.0 20131023 (Red Hat 0.2-0.5.1920c315ff984892399893b380305ab36e07b455.fc20)" + .section .note.GNU-stack,"",@progbits + +By default, no optimizations are performed, the equivalent of GCC's +`-O0` option. We can turn things up to e.g. `-O3` by calling +:func:`gccjit::context::set_int_option` with +:c:macro:`GCC_JIT_INT_OPTION_OPTIMIZATION_LEVEL`: + +.. code-block:: c++ + + ctxt.set_int_option (GCC_JIT_INT_OPTION_OPTIMIZATION_LEVEL, 3); + +.. code-block:: gas + + .file "fake.c" + .text + .p2align 4,,15 + .globl square + .type square, @function + square: + .LFB7: + .cfi_startproc + .L16: + movl %edi, %eax + imull %edi, %eax + ret + .cfi_endproc + .LFE7: + .size square, .-square + .ident "GCC: (GNU) 4.9.0 20131023 (Red Hat 0.2-0.5.1920c315ff984892399893b380305ab36e07b455.fc20)" + .section .note.GNU-stack,"",@progbits + +Naturally this has only a small effect on such a trivial function. + + +Full example +************ + +Here's what the above looks like as a complete program: + + .. literalinclude:: ../../examples/tut02-square.cc + :lines: 1- + :language: c++ + +Building and running it: + +.. code-block:: console + + $ gcc \ + tut02-square.cc \ + -o tut02-square \ + -lgccjit + + # Run the built program: + $ ./tut02-square + result: 25 diff --git a/gcc/jit/docs/cp/intro/tutorial03.rst b/gcc/jit/docs/cp/intro/tutorial03.rst new file mode 100644 index 00000000000..c72d78f2415 --- /dev/null +++ b/gcc/jit/docs/cp/intro/tutorial03.rst @@ -0,0 +1,392 @@ +.. Copyright (C) 2014 Free Software Foundation, Inc. + Originally contributed by David Malcolm + + This is free software: you can redistribute it and/or modify it + under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, but + WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see + . + +.. default-domain:: cpp + +Tutorial part 3: Loops and variables +------------------------------------ +Consider this C function: + + .. code-block:: c + + int loop_test (int n) + { + int sum = 0; + for (int i = 0; i < n; i++) + sum += i * i; + return sum; + } + +This example demonstrates some more features of libgccjit, with local +variables and a loop. + +To break this down into libgccjit terms, it's usually easier to reword +the `for` loop as a `while` loop, giving: + + .. code-block:: c + + int loop_test (int n) + { + int sum = 0; + int i = 0; + while (i < n) + { + sum += i * i; + i++; + } + return sum; + } + +Here's what the final control flow graph will look like: + + .. figure:: ../../intro/sum-of-squares.png + :alt: image of a control flow graph + +As before, we include the libgccjit++ header and make a +:type:`gccjit::context`. + +.. code-block:: c++ + + #include + + void test (void) + { + gccjit::context ctxt; + ctxt = gccjit::context::acquire (); + +The function works with the C `int` type. + +In the previous tutorial we acquired this via + +.. code-block:: c++ + + gccjit::type the_type = ctxt.get_type (ctxt, GCC_JIT_TYPE_INT); + +though we could equally well make it work on, say, `double`: + +.. code-block:: c++ + + gccjit::type the_type = ctxt.get_type (ctxt, GCC_JIT_TYPE_DOUBLE); + +For integer types we can use :func:`gccjit::context::get_int_type` +to directly bind a specific type: + +.. code-block:: c++ + + gccjit::type the_type = ctxt.get_int_type (); + +Let's build the function: + +.. code-block:: c++ + + gcc_jit_param n = ctxt.new_param (the_type, "n"); + std::vector params; + params.push_back (n); + gccjit::function func = + ctxt.new_function (GCC_JIT_FUNCTION_EXPORTED, + return_type, + "loop_test", + params, 0); + +Expressions: lvalues and rvalues +******************************** + +The base class of expression is the :type:`gccjit::rvalue`, +representing an expression that can be on the *right*-hand side of +an assignment: a value that can be computed somehow, and assigned +*to* a storage area (such as a variable). It has a specific +:type:`gccjit::type`. + +Anothe important class is :type:`gccjit::lvalue`. +A :type:`gccjit::lvalue`. is something that can of the *left*-hand +side of an assignment: a storage area (such as a variable). + +In other words, every assignment can be thought of as: + +.. code-block:: c + + LVALUE = RVALUE; + +Note that :type:`gccjit::lvalue` is a subclass of +:type:`gccjit::rvalue`, where in an assignment of the form: + +.. code-block:: c + + LVALUE_A = LVALUE_B; + +the `LVALUE_B` implies reading the current value of that storage +area, assigning it into the `LVALUE_A`. + +So far the only expressions we've seen are from the previous tutorial: + +1. the multiplication `i * i`: + + .. code-block:: c++ + + gccjit::rvalue expr = + ctxt.new_binary_op ( + GCC_JIT_BINARY_OP_MULT, int_type, + param_i, param_i); + + /* Alternatively, using operator-overloading: */ + gccjit::rvalue expr = param_i * param_i; + + which is a :type:`gccjit::rvalue`, and + +2. the various function parameters: `param_i` and `param_n`, instances of + :type:`gccjit::param`, which is a subclass of :type:`gccjit::lvalue` + (and, in turn, of :type:`gccjit::rvalue`): + we can both read from and write to function parameters within the + body of a function. + +Our new example has a new kind of expression: we have two local +variables. We create them by calling +:func:`gccjit::function::new_local`, supplying a type and a name: + +.. code-block:: c++ + + /* Build locals: */ + gccjit::lvalue i = func.new_local (the_type, "i"); + gccjit::lvalue sum = func.new_local (the_type, "sum"); + +These are instances of :type:`gccjit::lvalue` - they can be read from +and written to. + +Note that there is no precanned way to create *and* initialize a variable +like in C: + +.. code-block:: c + + int i = 0; + +Instead, having added the local to the function, we have to separately add +an assignment of `0` to `local_i` at the beginning of the function. + +Control flow +************ + +This function has a loop, so we need to build some basic blocks to +handle the control flow. In this case, we need 4 blocks: + +1. before the loop (initializing the locals) +2. the conditional at the top of the loop (comparing `i < n`) +3. the body of the loop +4. after the loop terminates (`return sum`) + +so we create these as :type:`gccjit::block` instances within the +:type:`gccjit::function`: + +.. code-block:: c++ + + gccjit::block b_initial = func.new_block ("initial"); + gccjit::block b_loop_cond = func.new_block ("loop_cond"); + gccjit::block b_loop_body = func.new_block ("loop_body"); + gccjit::block b_after_loop = func.new_block ("after_loop"); + +We now populate each block with statements. + +The entry block `b_initial` consists of initializations followed by a jump +to the conditional. We assign `0` to `i` and to `sum`, using +:func:`gccjit::block::add_assignment` to add +an assignment statement, and using :func:`gccjit::context::zero` to get +the constant value `0` for the relevant type for the right-hand side of +the assignment: + +.. code-block:: c++ + + /* sum = 0; */ + b_initial.add_assignment (sum, ctxt.zero (the_type)); + + /* i = 0; */ + b_initial.add_assignment (i, ctxt.zero (the_type)); + +We can then terminate the entry block by jumping to the conditional: + +.. code-block:: c++ + + b_initial.end_with_jump (b_loop_cond); + +The conditional block is equivalent to the line `while (i < n)` from our +C example. It contains a single statement: a conditional, which jumps to +one of two destination blocks depending on a boolean +:type:`gccjit::rvalue`, in this case the comparison of `i` and `n`. + +We could build the comparison using :func:`gccjit::context::new_comparison`: + +.. code-block:: c++ + + gccjit::rvalue guard = + ctxt.new_comparison (GCC_JIT_COMPARISON_GE, + i, n); + +and can then use this to add `b_loop_cond`'s sole statement, via +:func:`gccjit::block::end_with_conditional`: + +.. code-block:: c++ + + b_loop_cond.end_with_conditional (guard); + +However :type:`gccjit::rvalue` has overloaded operators for this, so we +express the conditional as + +.. code-block:: c++ + + gccjit::rvalue guard = (i >= n); + +and hence write the block more concisely as: + +.. code-block:: c++ + + b_loop_cond.end_with_conditional ( + i >= n, + b_after_loop, + b_loop_body); + +Next, we populate the body of the loop. + +The C statement `sum += i * i;` is an assignment operation, where an +lvalue is modified "in-place". We use +:func:`gccjit::block::add_assignment_op` to handle these operations: + +.. code-block:: c++ + + /* sum += i * i */ + b_loop_body.add_assignment_op (sum, + GCC_JIT_BINARY_OP_PLUS, + i * i); + +The `i++` can be thought of as `i += 1`, and can thus be handled in +a similar way. We use :c:func:`gcc_jit_context_one` to get the constant +value `1` (for the relevant type) for the right-hand side +of the assignment. + +.. code-block:: c++ + + /* i++ */ + b_loop_body.add_assignment_op (i, + GCC_JIT_BINARY_OP_PLUS, + ctxt.one (the_type)); + +.. note:: + + For numeric constants other than 0 or 1, we could use + :func:`gccjit::context::new_rvalue`, which has overloads + for both ``int`` and ``double``. + +The loop body completes by jumping back to the conditional: + +.. code-block:: c++ + + b_loop_body.end_with_jump (b_loop_cond); + +Finally, we populate the `b_after_loop` block, reached when the loop +conditional is false. We want to generate the equivalent of: + +.. code-block:: c++ + + return sum; + +so the block is just one statement: + +.. code-block:: c++ + + /* return sum */ + b_after_loop.end_with_return (sum); + +.. note:: + + You can intermingle block creation with statement creation, + but given that the terminator statements generally include references + to other blocks, I find it's clearer to create all the blocks, + *then* all the statements. + +We've finished populating the function. As before, we can now compile it +to machine code: + +.. code-block:: c++ + + gcc_jit_result *result; + result = ctxt.compile (); + + ctxt.release (); + + if (!result) + { + fprintf (stderr, "NULL result"); + return 1; + } + + typedef int (*loop_test_fn_type) (int); + loop_test_fn_type loop_test = + (loop_test_fn_type)gcc_jit_result_get_code (result, "loop_test"); + if (!loop_test) + { + fprintf (stderr, "NULL loop_test"); + gcc_jit_result_release (result); + return 1; + } + printf ("result: %d", loop_test (10)); + +.. code-block:: bash + + result: 285 + + +Visualizing the control flow graph +********************************** + +You can see the control flow graph of a function using +:func:`gccjit::function::dump_to_dot`: + +.. code-block:: c++ + + func.dump_to_dot ("/tmp/sum-of-squares.dot"); + +giving a .dot file in GraphViz format. + +You can convert this to an image using `dot`: + +.. code-block:: bash + + $ dot -Tpng /tmp/sum-of-squares.dot -o /tmp/sum-of-squares.png + +or use a viewer (my preferred one is xdot.py; see +https://github.com/jrfonseca/xdot.py; on Fedora you can +install it with `yum install python-xdot`): + + .. figure:: ../../intro/sum-of-squares.png + :alt: image of a control flow graph + +Full example +************ + + .. literalinclude:: ../../examples/tut03-sum-of-squares.cc + :lines: 1- + :language: c++ + +Building and running it: + +.. code-block:: console + + $ gcc \ + tut03-sum-of-squares.cc \ + -o tut03-sum-of-squares \ + -lgccjit + + # Run the built program: + $ ./tut03-sum-of-squares + loop_test returned: 285 diff --git a/gcc/jit/docs/cp/intro/tutorial04.rst b/gcc/jit/docs/cp/intro/tutorial04.rst new file mode 100644 index 00000000000..9244195ac6c --- /dev/null +++ b/gcc/jit/docs/cp/intro/tutorial04.rst @@ -0,0 +1,1092 @@ +.. Copyright (C) 2014 Free Software Foundation, Inc. + Originally contributed by David Malcolm + + This is free software: you can redistribute it and/or modify it + under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, but + WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see + . + +.. default-domain:: cpp + +Tutorial part 4: Adding JIT-compilation to a toy interpreter +------------------------------------------------------------ +In this example we construct a "toy" interpreter, and add JIT-compilation +to it. + +Our toy interpreter +******************* + +It's a stack-based interpreter, and is intended as a (very simple) example +of the kind of bytecode interpreter seen in dynamic languages such as +Python, Ruby etc. + +For the sake of simplicity, our toy virtual machine is very limited: + + * The only data type is `int` + + * It can only work on one function at a time (so that the only + function call that can be made is to recurse). + + * Functions can only take one parameter. + + * Functions have a stack of `int` values. + + * We'll implement function call within the interpreter by calling a + function in our implementation, rather than implementing our own + frame stack. + + * The parser is only good enough to get the examples to work. + +Naturally, a real interpreter would be much more complicated that this. + +The following operations are supported: + +====================== ======================== =============== ============== +Operation Meaning Old Stack New Stack +====================== ======================== =============== ============== +DUP Duplicate top of stack. ``[..., x]`` ``[..., x, x]`` +ROT Swap top two elements ``[..., x, y]`` ``[..., y, x]`` + of stack. +BINARY_ADD Add the top two elements ``[..., x, y]`` ``[..., (x+y)]`` + on the stack. +BINARY_SUBTRACT Likewise, but subtract. ``[..., x, y]`` ``[..., (x-y)]`` +BINARY_MULT Likewise, but multiply. ``[..., x, y]`` ``[..., (x*y)]`` +BINARY_COMPARE_LT Compare the top two ``[..., x, y]`` ``[..., (x D.80; + signed int D.81; + signed int D.82; + signed int D.83; + signed int D.84; + signed int D.85; + signed int y; + signed int x; + signed int stack_depth; + signed int stack[8]; + + try + { + initial: + stack_depth = 0; + stack[stack_depth] = arg; + stack_depth = stack_depth + 1; + goto instr0; + instr0: + /* DUP */: + stack_depth = stack_depth + -1; + x = stack[stack_depth]; + stack[stack_depth] = x; + stack_depth = stack_depth + 1; + stack[stack_depth] = x; + stack_depth = stack_depth + 1; + goto instr1; + instr1: + /* PUSH_CONST */: + stack[stack_depth] = 2; + stack_depth = stack_depth + 1; + goto instr2; + + /* etc */ + +You can see the generated machine code in assembly form via: + +.. code-block:: c++ + + ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DUMP_GENERATED_CODE, 1); + result = ctxt.compile (); + +which shows that (on this x86_64 box) the compiler has unrolled the loop +and is using MMX instructions to perform several multiplications +simultaneously: + +.. code-block:: gas + + .file "fake.c" + .text + .Ltext0: + .p2align 4,,15 + .globl factorial + .type factorial, @function + factorial: + .LFB0: + .file 1 "factorial.toy" + .loc 1 14 0 + .cfi_startproc + .LVL0: + .L2: + .loc 1 26 0 + cmpl $1, %edi + jle .L13 + leal -1(%rdi), %edx + movl %edx, %ecx + shrl $2, %ecx + leal 0(,%rcx,4), %esi + testl %esi, %esi + je .L14 + cmpl $9, %edx + jbe .L14 + leal -2(%rdi), %eax + movl %eax, -16(%rsp) + leal -3(%rdi), %eax + movd -16(%rsp), %xmm0 + movl %edi, -16(%rsp) + movl %eax, -12(%rsp) + movd -16(%rsp), %xmm1 + xorl %eax, %eax + movl %edx, -16(%rsp) + movd -12(%rsp), %xmm4 + movd -16(%rsp), %xmm6 + punpckldq %xmm4, %xmm0 + movdqa .LC1(%rip), %xmm4 + punpckldq %xmm6, %xmm1 + punpcklqdq %xmm0, %xmm1 + movdqa .LC0(%rip), %xmm0 + jmp .L5 + # etc - edited for brevity + +This is clearly overkill for a function that will likely overflow the +``int`` type before the vectorization is worthwhile - but then again, this +is a toy example. + +Turning down the optimization level to 2: + +.. code-block:: c++ + + ctxt.set_int_option (GCC_JIT_INT_OPTION_OPTIMIZATION_LEVEL, 2); + +yields this code, which is simple enough to quote in its entirety: + +.. code-block:: gas + + .file "fake.c" + .text + .p2align 4,,15 + .globl factorial + .type factorial, @function + factorial: + .LFB0: + .cfi_startproc + .L2: + cmpl $1, %edi + jle .L8 + movl $1, %edx + jmp .L4 + .p2align 4,,10 + .p2align 3 + .L6: + movl %eax, %edi + .L4: + .L5: + leal -1(%rdi), %eax + imull %edi, %edx + cmpl $1, %eax + jne .L6 + .L3: + .L7: + imull %edx, %eax + ret + .L8: + movl %edi, %eax + movl $1, %edx + jmp .L7 + .cfi_endproc + .LFE0: + .size factorial, .-factorial + .ident "GCC: (GNU) 4.9.0 20131023 (Red Hat 0.2-%{gcc_release})" + .section .note.GNU-stack,"",@progbits + +Note that the stack pushing and popping have been eliminated, as has the +recursive call (in favor of an iteration). + +Putting it all together +*********************** + +The complete example can be seen in the source tree at +``gcc/jit/docs/examples/tut04-toyvm/toyvm.cc`` + +along with a Makefile and a couple of sample .toy scripts: + +.. code-block:: console + + $ ls -al + drwxrwxr-x. 2 david david 4096 Sep 19 17:46 . + drwxrwxr-x. 3 david david 4096 Sep 19 15:26 .. + -rw-rw-r--. 1 david david 615 Sep 19 12:43 factorial.toy + -rw-rw-r--. 1 david david 834 Sep 19 13:08 fibonacci.toy + -rw-rw-r--. 1 david david 238 Sep 19 14:22 Makefile + -rw-rw-r--. 1 david david 16457 Sep 19 17:07 toyvm.cc + + $ make toyvm + g++ -Wall -g -o toyvm toyvm.cc -lgccjit + + $ ./toyvm factorial.toy 10 + interpreter result: 3628800 + compiler result: 3628800 + + $ ./toyvm fibonacci.toy 10 + interpreter result: 55 + compiler result: 55 + +Behind the curtain: How does our code get optimized? +**************************************************** + +Our example is done, but you may be wondering about exactly how the +compiler turned what we gave it into the machine code seen above. + +We can examine what the compiler is doing in detail by setting: + +.. code-block:: c++ + + state.ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DUMP_EVERYTHING, 1); + state.ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_KEEP_INTERMEDIATES, 1); + +This will dump detailed information about the compiler's state to a +directory under ``/tmp``, and keep it from being cleaned up. + +The precise names and their formats of these files is subject to change. +Higher optimization levels lead to more files. +Here's what I saw (edited for brevity; there were almost 200 files): + +.. code-block:: console + + intermediate files written to /tmp/libgccjit-KPQbGw + $ ls /tmp/libgccjit-KPQbGw/ + fake.c.000i.cgraph + fake.c.000i.type-inheritance + fake.c.004t.gimple + fake.c.007t.omplower + fake.c.008t.lower + fake.c.011t.eh + fake.c.012t.cfg + fake.c.014i.visibility + fake.c.015i.early_local_cleanups + fake.c.016t.ssa + # etc + +The gimple code is converted into Static Single Assignment form, +with annotations for use when generating the debuginfo: + +.. code-block:: console + + $ less /tmp/libgccjit-KPQbGw/fake.c.016t.ssa + +.. code-block:: c + + ;; Function factorial (factorial, funcdef_no=0, decl_uid=53, symbol_order=0) + + factorial (signed int arg) + { + signed int stack[8]; + signed int stack_depth; + signed int x; + signed int y; + _20; + signed int _21; + signed int _38; + signed int _44; + signed int _51; + signed int _56; + + initial: + stack_depth_3 = 0; + # DEBUG stack_depth => stack_depth_3 + stack[stack_depth_3] = arg_5(D); + stack_depth_7 = stack_depth_3 + 1; + # DEBUG stack_depth => stack_depth_7 + # DEBUG instr0 => NULL + # DEBUG /* DUP */ => NULL + stack_depth_8 = stack_depth_7 + -1; + # DEBUG stack_depth => stack_depth_8 + x_9 = stack[stack_depth_8]; + # DEBUG x => x_9 + stack[stack_depth_8] = x_9; + stack_depth_11 = stack_depth_8 + 1; + # DEBUG stack_depth => stack_depth_11 + stack[stack_depth_11] = x_9; + stack_depth_13 = stack_depth_11 + 1; + # DEBUG stack_depth => stack_depth_13 + # DEBUG instr1 => NULL + # DEBUG /* PUSH_CONST */ => NULL + stack[stack_depth_13] = 2; + + /* etc; edited for brevity */ + +We can perhaps better see the code by turning off +:c:macro:`GCC_JIT_BOOL_OPTION_DEBUGINFO` to suppress all those ``DEBUG`` +statements, giving: + +.. code-block:: console + + $ less /tmp/libgccjit-1Hywc0/fake.c.016t.ssa + +.. code-block:: c + + ;; Function factorial (factorial, funcdef_no=0, decl_uid=53, symbol_order=0) + + factorial (signed int arg) + { + signed int stack[8]; + signed int stack_depth; + signed int x; + signed int y; + _20; + signed int _21; + signed int _38; + signed int _44; + signed int _51; + signed int _56; + + initial: + stack_depth_3 = 0; + stack[stack_depth_3] = arg_5(D); + stack_depth_7 = stack_depth_3 + 1; + stack_depth_8 = stack_depth_7 + -1; + x_9 = stack[stack_depth_8]; + stack[stack_depth_8] = x_9; + stack_depth_11 = stack_depth_8 + 1; + stack[stack_depth_11] = x_9; + stack_depth_13 = stack_depth_11 + 1; + stack[stack_depth_13] = 2; + stack_depth_15 = stack_depth_13 + 1; + stack_depth_16 = stack_depth_15 + -1; + y_17 = stack[stack_depth_16]; + stack_depth_18 = stack_depth_16 + -1; + x_19 = stack[stack_depth_18]; + _20 = x_19 < y_17; + _21 = (signed int) _20; + stack[stack_depth_18] = _21; + stack_depth_23 = stack_depth_18 + 1; + stack_depth_24 = stack_depth_23 + -1; + x_25 = stack[stack_depth_24]; + if (x_25 != 0) + goto (instr9); + else + goto (instr4); + + instr4: + /* DUP */: + stack_depth_26 = stack_depth_24 + -1; + x_27 = stack[stack_depth_26]; + stack[stack_depth_26] = x_27; + stack_depth_29 = stack_depth_26 + 1; + stack[stack_depth_29] = x_27; + stack_depth_31 = stack_depth_29 + 1; + stack[stack_depth_31] = 1; + stack_depth_33 = stack_depth_31 + 1; + stack_depth_34 = stack_depth_33 + -1; + y_35 = stack[stack_depth_34]; + stack_depth_36 = stack_depth_34 + -1; + x_37 = stack[stack_depth_36]; + _38 = x_37 - y_35; + stack[stack_depth_36] = _38; + stack_depth_40 = stack_depth_36 + 1; + stack_depth_41 = stack_depth_40 + -1; + x_42 = stack[stack_depth_41]; + _44 = factorial (x_42); + stack[stack_depth_41] = _44; + stack_depth_46 = stack_depth_41 + 1; + stack_depth_47 = stack_depth_46 + -1; + y_48 = stack[stack_depth_47]; + stack_depth_49 = stack_depth_47 + -1; + x_50 = stack[stack_depth_49]; + _51 = x_50 * y_48; + stack[stack_depth_49] = _51; + stack_depth_53 = stack_depth_49 + 1; + + # stack_depth_1 = PHI + instr9: + /* RETURN */: + stack_depth_54 = stack_depth_1 + -1; + x_55 = stack[stack_depth_54]; + _56 = x_55; + stack ={v} {CLOBBER}; + return _56; + + } + +Note in the above how all the :type:`gccjit::block` instances we +created have been consolidated into just 3 blocks in GCC's internal +representation: ``initial``, ``instr4`` and ``instr9``. + +Optimizing away stack manipulation +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +Recall our simple implementation of stack operations. Let's examine +how the stack operations are optimized away. + +After a pass of constant-propagation, the depth of the stack at each +opcode can be determined at compile-time: + +.. code-block:: console + + $ less /tmp/libgccjit-1Hywc0/fake.c.021t.ccp1 + +.. code-block:: c + + ;; Function factorial (factorial, funcdef_no=0, decl_uid=53, symbol_order=0) + + factorial (signed int arg) + { + signed int stack[8]; + signed int stack_depth; + signed int x; + signed int y; + _20; + signed int _21; + signed int _38; + signed int _44; + signed int _51; + + initial: + stack[0] = arg_5(D); + x_9 = stack[0]; + stack[0] = x_9; + stack[1] = x_9; + stack[2] = 2; + y_17 = stack[2]; + x_19 = stack[1]; + _20 = x_19 < y_17; + _21 = (signed int) _20; + stack[1] = _21; + x_25 = stack[1]; + if (x_25 != 0) + goto (instr9); + else + goto (instr4); + + instr4: + /* DUP */: + x_27 = stack[0]; + stack[0] = x_27; + stack[1] = x_27; + stack[2] = 1; + y_35 = stack[2]; + x_37 = stack[1]; + _38 = x_37 - y_35; + stack[1] = _38; + x_42 = stack[1]; + _44 = factorial (x_42); + stack[1] = _44; + y_48 = stack[1]; + x_50 = stack[0]; + _51 = x_50 * y_48; + stack[0] = _51; + + instr9: + /* RETURN */: + x_55 = stack[0]; + x_56 = x_55; + stack ={v} {CLOBBER}; + return x_56; + + } + +Note how, in the above, all those ``stack_depth`` values are now just +constants: we're accessing specific stack locations at each opcode. + +The "esra" pass ("Early Scalar Replacement of Aggregates") breaks +out our "stack" array into individual elements: + +.. code-block:: console + + $ less /tmp/libgccjit-1Hywc0/fake.c.024t.esra + +.. code-block:: c + + ;; Function factorial (factorial, funcdef_no=0, decl_uid=53, symbol_order=0) + + Created a replacement for stack offset: 0, size: 32: stack$0 + Created a replacement for stack offset: 32, size: 32: stack$1 + Created a replacement for stack offset: 64, size: 32: stack$2 + + Symbols to be put in SSA form + { D.89 D.90 D.91 } + Incremental SSA update started at block: 0 + Number of blocks in CFG: 5 + Number of blocks to update: 4 ( 80%) + + + factorial (signed int arg) + { + signed int stack$2; + signed int stack$1; + signed int stack$0; + signed int stack[8]; + signed int stack_depth; + signed int x; + signed int y; + _20; + signed int _21; + signed int _38; + signed int _44; + signed int _51; + + initial: + stack$0_45 = arg_5(D); + x_9 = stack$0_45; + stack$0_39 = x_9; + stack$1_32 = x_9; + stack$2_30 = 2; + y_17 = stack$2_30; + x_19 = stack$1_32; + _20 = x_19 < y_17; + _21 = (signed int) _20; + stack$1_28 = _21; + x_25 = stack$1_28; + if (x_25 != 0) + goto (instr9); + else + goto (instr4); + + instr4: + /* DUP */: + x_27 = stack$0_39; + stack$0_22 = x_27; + stack$1_14 = x_27; + stack$2_12 = 1; + y_35 = stack$2_12; + x_37 = stack$1_14; + _38 = x_37 - y_35; + stack$1_10 = _38; + x_42 = stack$1_10; + _44 = factorial (x_42); + stack$1_6 = _44; + y_48 = stack$1_6; + x_50 = stack$0_22; + _51 = x_50 * y_48; + stack$0_1 = _51; + + # stack$0_52 = PHI + instr9: + /* RETURN */: + x_55 = stack$0_52; + x_56 = x_55; + stack ={v} {CLOBBER}; + return x_56; + + } + +Hence at this point, all those pushes and pops of the stack are now +simply assignments to specific temporary variables. + +After some copy propagation, the stack manipulation has been completely +optimized away: + +.. code-block:: console + + $ less /tmp/libgccjit-1Hywc0/fake.c.026t.copyprop1 + +.. code-block:: c + + ;; Function factorial (factorial, funcdef_no=0, decl_uid=53, symbol_order=0) + + factorial (signed int arg) + { + signed int stack$2; + signed int stack$1; + signed int stack$0; + signed int stack[8]; + signed int stack_depth; + signed int x; + signed int y; + _20; + signed int _21; + signed int _38; + signed int _44; + signed int _51; + + initial: + stack$0_39 = arg_5(D); + _20 = arg_5(D) <= 1; + _21 = (signed int) _20; + if (_21 != 0) + goto (instr9); + else + goto (instr4); + + instr4: + /* DUP */: + _38 = arg_5(D) + -1; + _44 = factorial (_38); + _51 = arg_5(D) * _44; + stack$0_1 = _51; + + # stack$0_52 = PHI + instr9: + /* RETURN */: + stack ={v} {CLOBBER}; + return stack$0_52; + + } + +Later on, another pass finally eliminated ``stack_depth`` local and the +unused parts of the `stack`` array altogether: + +.. code-block:: console + + $ less /tmp/libgccjit-1Hywc0/fake.c.036t.release_ssa + +.. code-block:: c + + ;; Function factorial (factorial, funcdef_no=0, decl_uid=53, symbol_order=0) + + Released 44 names, 314.29%, removed 44 holes + factorial (signed int arg) + { + signed int stack$0; + signed int mult_acc_1; + _5; + signed int _6; + signed int _7; + signed int mul_tmp_10; + signed int mult_acc_11; + signed int mult_acc_13; + + # arg_9 = PHI + # mult_acc_13 = PHI <1(0)> + initial: + + : + # arg_4 = PHI + # mult_acc_1 = PHI + _5 = arg_4 <= 1; + _6 = (signed int) _5; + if (_6 != 0) + goto (instr9); + else + goto (instr4); + + instr4: + /* DUP */: + _7 = arg_4 + -1; + mult_acc_11 = mult_acc_1 * arg_4; + goto ; + + # stack$0_12 = PHI + instr9: + /* RETURN */: + mul_tmp_10 = mult_acc_1 * stack$0_12; + return mul_tmp_10; + + } + + +Elimination of tail recursion +^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +Another significant optimization is the detection that the call to +``factorial`` is tail recursion, which can be eliminated in favor of +an iteration: + +.. code-block:: console + + $ less /tmp/libgccjit-1Hywc0/fake.c.030t.tailr1 + +.. code-block:: c + + ;; Function factorial (factorial, funcdef_no=0, decl_uid=53, symbol_order=0) + + + Symbols to be put in SSA form + { D.88 } + Incremental SSA update started at block: 0 + Number of blocks in CFG: 5 + Number of blocks to update: 4 ( 80%) + + + factorial (signed int arg) + { + signed int stack$2; + signed int stack$1; + signed int stack$0; + signed int stack[8]; + signed int stack_depth; + signed int x; + signed int y; + signed int mult_acc_1; + _20; + signed int _21; + signed int _38; + signed int mul_tmp_44; + signed int mult_acc_51; + + # arg_5 = PHI + # mult_acc_1 = PHI <1(0), mult_acc_51(3)> + initial: + _20 = arg_5 <= 1; + _21 = (signed int) _20; + if (_21 != 0) + goto (instr9); + else + goto (instr4); + + instr4: + /* DUP */: + _38 = arg_5 + -1; + mult_acc_51 = mult_acc_1 * arg_5; + goto (initial); + + # stack$0_52 = PHI + instr9: + /* RETURN */: + stack ={v} {CLOBBER}; + mul_tmp_44 = mult_acc_1 * stack$0_52; + return mul_tmp_44; + + } diff --git a/gcc/jit/docs/cp/topics/contexts.rst b/gcc/jit/docs/cp/topics/contexts.rst new file mode 100644 index 00000000000..72815fbd35c --- /dev/null +++ b/gcc/jit/docs/cp/topics/contexts.rst @@ -0,0 +1,179 @@ +.. Copyright (C) 2014 Free Software Foundation, Inc. + Originally contributed by David Malcolm + + This is free software: you can redistribute it and/or modify it + under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, but + WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see + . + +.. default-domain:: cpp + +Compilation contexts +==================== + +.. class:: gccjit::context + +The top-level of the C++ API is the :class:`gccjit::context` type. + +A :class:`gccjit::context` instance encapsulates the state of a +compilation. + +You can set up options on it, and add types, functions and code. +Invoking :func:`gccjit::context::compile` on it gives you a +:c:type:`gcc_jit_result *`. + +It is a thin wrapper around the C API's :c:type:`gcc_jit_context *`. + +Lifetime-management +------------------- +Contexts are the unit of lifetime-management within the API: objects +have their lifetime bounded by the context they are created within, and +cleanup of such objects is done for you when the context is released. + +.. function:: gccjit::context gccjit::context::acquire () + + This function acquires a new :class:`gccjit::context` instance, + which is independent of any others that may be present within this + process. + +.. function:: void gccjit::context::release () + + This function releases all resources associated with the given context. + Both the context itself and all of its :c:type:`gccjit::object *` + instances are cleaned up. It should be called exactly once on a given + context. + + It is invalid to use the context or any of its "contextual" objects + after calling this. + + .. code-block:: c++ + + ctxt.release (); + +.. function:: gccjit::context \ + gccjit::context::new_child_context () + + Given an existing JIT context, create a child context. + + The child inherits a copy of all option-settings from the parent. + + The child can reference objects created within the parent, but not + vice-versa. + + The lifetime of the child context must be bounded by that of the + parent: you should release a child context before releasing the parent + context. + + If you use a function from a parent context within a child context, + you have to compile the parent context before you can compile the + child context, and the gccjit::result of the parent context must + outlive the gccjit::result of the child context. + + This allows caching of shared initializations. For example, you could + create types and declarations of global functions in a parent context + once within a process, and then create child contexts whenever a + function or loop becomes hot. Each such child context can be used for + JIT-compiling just one function or loop, but can reference types + and helper functions created within the parent context. + + Contexts can be arbitrarily nested, provided the above rules are + followed, but it's probably not worth going above 2 or 3 levels, and + there will likely be a performance hit for such nesting. + + +Thread-safety +------------- +Instances of :class:`gccjit::context` created via +:func:`gccjit::context::acquire` are independent from each other: +only one thread may use a given context at once, but multiple threads +could each have their own contexts without needing locks. + +Contexts created via :func:`gccjit::context::new_child_context` are +related to their parent context. They can be partitioned by their +ultimate ancestor into independent "family trees". Only one thread +within a process may use a given "family tree" of such contexts at once, +and if you're using multiple threads you should provide your own locking +around entire such context partitions. + + +Error-handling +-------------- +.. FIXME: How does error-handling work for C++ API? + +You can only compile and get code from a context if no errors occur. + +In general, if an error occurs when using an API entrypoint, it returns +NULL. You don't have to check everywhere for NULL results, since the +API gracefully handles a NULL being passed in for any argument. + +Errors are printed on stderr and can be queried using +:func:`gccjit::context::get_first_error`. + +.. function:: const char *\ + gccjit::context::get_first_error (gccjit::context *ctxt) + + Returns the first error message that occurred on the context. + + The returned string is valid for the rest of the lifetime of the + context. + + If no errors occurred, this will be NULL. + +Debugging +--------- + +.. function:: void\ + gccjit::context::dump_to_file (const std::string &path, \ + int update_locations) + + To help with debugging: dump a C-like representation to the given path, + describing what's been set up on the context. + + If "update_locations" is true, then also set up :class:`gccjit::location` + information throughout the context, pointing at the dump file as if it + were a source file. This may be of use in conjunction with + :c:macro:`GCCJIT::BOOL_OPTION_DEBUGINFO` to allow stepping through the + code in a debugger. + + +Options +------- + +.. + FIXME: gccjit::context::set_str_option doesn't seem to exist yet in the + C++ API + +Boolean options +*************** + +.. function:: void \ + gccjit::context::set_bool_option(enum gcc_jit_bool_option, \ + int value) + + Set a boolean option of the context. + + This is a thin wrapper around the C API + :c:func:`gcc_jit_context_set_bool_option`; the options have the same + meaning. + +Integer options +*************** + +.. function:: void \ + gccjit::context::set_int_option (enum gcc_jit_int_option, \ + int value) + + Set an integer option of the context. + + This is a thin wrapper around the C API + :c:func:`gcc_jit_context_set_int_option`; the options have the same + meaning. diff --git a/gcc/jit/docs/cp/topics/expressions.rst b/gcc/jit/docs/cp/topics/expressions.rst new file mode 100644 index 00000000000..6d9e53b7aa4 --- /dev/null +++ b/gcc/jit/docs/cp/topics/expressions.rst @@ -0,0 +1,606 @@ +.. Copyright (C) 2014 Free Software Foundation, Inc. + Originally contributed by David Malcolm + + This is free software: you can redistribute it and/or modify it + under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, but + WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see + . + +.. default-domain:: cpp + +Expressions +=========== + +Rvalues +------- +.. class:: gccjit::rvalue + +A :class:`gccjit::rvalue` is an expression that can be computed. It is a +subclass of :class:`gccjit::object`, and is a thin wrapper around +:c:type:`gcc_jit_rvalue *` from the C API. + +It can be simple, e.g.: + + * an integer value e.g. `0` or `42` + * a string literal e.g. `"Hello world"` + * a variable e.g. `i`. These are also lvalues (see below). + +or compound e.g.: + + * a unary expression e.g. `!cond` + * a binary expression e.g. `(a + b)` + * a function call e.g. `get_distance (&player_ship, &target)` + * etc. + +Every rvalue has an associated type, and the API will check to ensure +that types match up correctly (otherwise the context will emit an error). + +.. function:: gccjit::type gccjit::rvalue::get_type () + + Get the type of this rvalue. + + +Simple expressions +****************** + +.. function:: gccjit::rvalue \ + gccjit::context::new_rvalue (gccjit::type numeric_type, \ + int value) const + + Given a numeric type (integer or floating point), build an rvalue for + the given constant ``int`` value. + +.. function:: gccjit::rvalue \ + gccjit::context::zero (gccjit::type numeric_type) const + + Given a numeric type (integer or floating point), get the rvalue for + zero. Essentially this is just a shortcut for: + + .. code-block:: c++ + + ctxt.new_rvalue (numeric_type, 0) + +.. function:: gccjit::rvalue \ + gccjit::context::one (gccjit::type numeric_type) const + + Given a numeric type (integer or floating point), get the rvalue for + zero. Essentially this is just a shortcut for: + + .. code-block:: c++ + + ctxt.new_rvalue (numeric_type, 1) + +.. function:: gccjit::rvalue \ + gccjit::context::new_rvalue (gccjit::type numeric_type, \ + double value) const + + Given a numeric type (integer or floating point), build an rvalue for + the given constant value. + +.. function:: gccjit::rvalue \ + gccjit::context::new_rvalue (gccjit::type pointer_type, \ + void *value) const + + Given a pointer type, build an rvalue for the given address. + +.. function:: gccjit::rvalue \ + gccjit::context::new_rvalue (const std::string &value) const + + Generate an rvalue of type :c:data:`GCC_JIT_TYPE_CONST_CHAR_PTR` for + the given string. This is akin to a string literal. + + +Unary Operations +**************** + +.. function:: gccjit::rvalue \ + gccjit::context::new_unary_op (enum gcc_jit_unary_op, \ + gccjit::type result_type, \ + gccjit::rvalue rvalue, \ + gccjit::location loc) + + Build a unary operation out of an input rvalue. + + Parameter ``loc`` is optional. + + This is a thin wrapper around the C API's + :c:func:`gcc_jit_context_new_unary_op` and the available unary + operations are documented there. + +There are shorter ways to spell the various specific kinds of unary +operation: + +.. function:: gccjit::rvalue \ + gccjit::context::new_minus (gccjit::type result_type, \ + gccjit::rvalue a, \ + gccjit::location loc) + + Negate an arithmetic value; for example: + + .. code-block:: c++ + + gccjit::rvalue negpi = ctxt.new_minus (t_double, pi); + + builds the equivalent of this C expression: + + .. code-block:: c + + -pi + +.. function:: gccjit::rvalue \ + new_bitwise_negate (gccjit::type result_type, \ + gccjit::rvalue a, \ + gccjit::location loc) + + Bitwise negation of an integer value (one's complement); for example: + + .. code-block:: c++ + + gccjit::rvalue mask = ctxt.new_bitwise_negate (t_int, a); + + builds the equivalent of this C expression: + + .. code-block:: c + + ~a + +.. function:: gccjit::rvalue \ + new_logical_negate (gccjit::type result_type, \ + gccjit::rvalue a, \ + gccjit::location loc) + + Logical negation of an arithmetic or pointer value; for example: + + .. code-block:: c++ + + gccjit::rvalue guard = ctxt.new_logical_negate (t_bool, cond); + + builds the equivalent of this C expression: + + .. code-block:: c + + !cond + + +The most concise way to spell them is with overloaded operators: + +.. function:: gccjit::rvalue operator- (gccjit::rvalue a) + + .. code-block:: c++ + + gccjit::rvalue negpi = -pi; + + +.. function:: gccjit::rvalue operator~ (gccjit::rvalue a) + + .. code-block:: c++ + + gccjit::rvalue mask = ~a; + +.. function:: gccjit::rvalue operator! (gccjit::rvalue a) + + .. code-block:: c++ + + gccjit::rvalue guard = !cond; + + +Binary Operations +***************** + +.. function:: gccjit::rvalue\ + gccjit::context::new_binary_op (enum gcc_jit_binary_op, \ + gccjit::type result_type, \ + gccjit::rvalue a, \ + gccjit::rvalue b, \ + gccjit::location loc) + + Build a binary operation out of two constituent rvalues. + + Parameter ``loc`` is optional. + + This is a thin wrapper around the C API's + :c:func:`gcc_jit_context_new_binary_op` and the available binary + operations are documented there. + +There are shorter ways to spell the various specific kinds of binary +operation: + +.. function:: gccjit::rvalue \ + gccjit::context::new_plus (gccjit::type result_type, \ + gccjit::rvalue a, gccjit::rvalue b, \ + gccjit::location loc) + +.. function:: gccjit::rvalue \ + gccjit::context::new_minus (gccjit::type result_type, \ + gccjit::rvalue a, gccjit::rvalue b, \ + gccjit::location loc) + +.. function:: gccjit::rvalue \ + gccjit::context::new_mult (gccjit::type result_type, \ + gccjit::rvalue a, gccjit::rvalue b, \ + gccjit::location loc) + +.. function:: gccjit::rvalue \ + gccjit::context::new_divide (gccjit::type result_type, \ + gccjit::rvalue a, gccjit::rvalue b, \ + gccjit::location loc) + +.. function:: gccjit::rvalue \ + gccjit::context::new_modulo (gccjit::type result_type, \ + gccjit::rvalue a, gccjit::rvalue b, \ + gccjit::location loc) + +.. function:: gccjit::rvalue \ + gccjit::context::new_bitwise_and (gccjit::type result_type, \ + gccjit::rvalue a, gccjit::rvalue b, \ + gccjit::location loc) + +.. function:: gccjit::rvalue \ + gccjit::context::new_bitwise_xor (gccjit::type result_type, \ + gccjit::rvalue a, gccjit::rvalue b, \ + gccjit::location loc) + +.. function:: gccjit::rvalue \ + gccjit::context::new_bitwise_or (gccjit::type result_type, \ + gccjit::rvalue a, gccjit::rvalue b, \ + gccjit::location loc) + +.. function:: gccjit::rvalue \ + gccjit::context::new_logical_and (gccjit::type result_type, \ + gccjit::rvalue a, gccjit::rvalue b, \ + gccjit::location loc) + +.. function:: gccjit::rvalue \ + gccjit::context::new_logical_or (gccjit::type result_type, \ + gccjit::rvalue a, gccjit::rvalue b, \ + gccjit::location loc) + +The most concise way to spell them is with overloaded operators: + +.. function:: gccjit::rvalue operator+ (gccjit::rvalue a, gccjit::rvalue b) + + .. code-block:: c++ + + gccjit::rvalue sum = a + b; + +.. function:: gccjit::rvalue operator- (gccjit::rvalue a, gccjit::rvalue b) + + .. code-block:: c++ + + gccjit::rvalue diff = a - b; + +.. function:: gccjit::rvalue operator* (gccjit::rvalue a, gccjit::rvalue b) + + .. code-block:: c++ + + gccjit::rvalue prod = a * b; + +.. function:: gccjit::rvalue operator/ (gccjit::rvalue a, gccjit::rvalue b) + + .. code-block:: c++ + + gccjit::rvalue result = a / b; + +.. function:: gccjit::rvalue operator% (gccjit::rvalue a, gccjit::rvalue b) + + .. code-block:: c++ + + gccjit::rvalue mod = a % b; + +.. function:: gccjit::rvalue operator& (gccjit::rvalue a, gccjit::rvalue b) + + .. code-block:: c++ + + gccjit::rvalue x = a & b; + +.. function:: gccjit::rvalue operator^ (gccjit::rvalue a, gccjit::rvalue b) + + .. code-block:: c++ + + gccjit::rvalue x = a ^ b; + +.. function:: gccjit::rvalue operator| (gccjit::rvalue a, gccjit::rvalue b) + + .. code-block:: c++ + + gccjit::rvalue x = a | b; + +.. function:: gccjit::rvalue operator&& (gccjit::rvalue a, gccjit::rvalue b) + + .. code-block:: c++ + + gccjit::rvalue cond = a && b; + +.. function:: gccjit::rvalue operator|| (gccjit::rvalue a, gccjit::rvalue b) + + .. code-block:: c++ + + gccjit::rvalue cond = a || b; + +These can of course be combined, giving a terse way to build compound +expressions: + + .. code-block:: c++ + + gccjit::rvalue discriminant = (b * b) - (four * a * c); + + +Comparisons +*********** + +.. function:: gccjit::rvalue \ + gccjit::context::new_comparison (enum gcc_jit_comparison,\ + gccjit::rvalue a, \ + gccjit::rvalue b, \ + gccjit::location loc) + + Build a boolean rvalue out of the comparison of two other rvalues. + + Parameter ``loc`` is optional. + + This is a thin wrapper around the C API's + :c:func:`gcc_jit_context_new_comparison` and the available kinds + of comparison are documented there. + +There are shorter ways to spell the various specific kinds of binary +operation: + +.. function:: gccjit::rvalue \ + gccjit::context::new_eq (gccjit::rvalue a, gccjit::rvalue b, \ + gccjit::location loc) + +.. function:: gccjit::rvalue \ + gccjit::context::new_ne (gccjit::rvalue a, gccjit::rvalue b, \ + gccjit::location loc) + +.. function:: gccjit::rvalue \ + gccjit::context::new_lt (gccjit::rvalue a, gccjit::rvalue b, \ + gccjit::location loc) + +.. function:: gccjit::rvalue \ + gccjit::context::new_le (gccjit::rvalue a, gccjit::rvalue b, \ + gccjit::location loc) + +.. function:: gccjit::rvalue \ + gccjit::context::new_gt (gccjit::rvalue a, gccjit::rvalue b, \ + gccjit::location loc) + +.. function:: gccjit::rvalue \ + gccjit::context::new_ge (gccjit::rvalue a, gccjit::rvalue b, \ + gccjit::location loc) + +The most concise way to spell them is with overloaded operators: + +.. function:: gccjit::rvalue \ + operator== (gccjit::rvalue a, gccjit::rvalue b) + + .. code-block:: c++ + + gccjit::rvalue cond = (a == ctxt.zero (t_int)); + +.. function:: gccjit::rvalue \ + operator!= (gccjit::rvalue a, gccjit::rvalue b) + + .. code-block:: c++ + + gccjit::rvalue cond = (i != j); + +.. function:: gccjit::rvalue \ + operator< (gccjit::rvalue a, gccjit::rvalue b) + + .. code-block:: c++ + + gccjit::rvalue cond = i < n; + +.. function:: gccjit::rvalue \ + operator<= (gccjit::rvalue a, gccjit::rvalue b) + + .. code-block:: c++ + + gccjit::rvalue cond = i <= n; + +.. function:: gccjit::rvalue \ + operator> (gccjit::rvalue a, gccjit::rvalue b) + + .. code-block:: c++ + + gccjit::rvalue cond = (ch > limit); + +.. function:: gccjit::rvalue \ + operator>= (gccjit::rvalue a, gccjit::rvalue b) + + .. code-block:: c++ + + gccjit::rvalue cond = (score >= ctxt.new_rvalue (t_int, 100)); + +.. TODO: beyond this point + +Function calls +************** +.. function:: gcc_jit_rvalue *\ + gcc_jit_context_new_call (gcc_jit_context *ctxt,\ + gcc_jit_location *loc,\ + gcc_jit_function *func,\ + int numargs , gcc_jit_rvalue **args) + + Given a function and the given table of argument rvalues, construct a + call to the function, with the result as an rvalue. + + .. note:: + + :func:`gccjit::context::new_call` merely builds a + :class:`gccjit::rvalue` i.e. an expression that can be evaluated, + perhaps as part of a more complicated expression. + The call *won't* happen unless you add a statement to a function + that evaluates the expression. + + For example, if you want to call a function and discard the result + (or to call a function with ``void`` return type), use + :func:`gccjit::block::add_eval`: + + .. code-block:: c++ + + /* Add "(void)printf (arg0, arg1);". */ + block.add_eval (ctxt.new_call (printf_func, arg0, arg1)); + +Type-coercion +************* + +.. function:: gccjit::rvalue \ + gccjit::context::new_cast (gccjit::rvalue rvalue,\ + gccjit::type type, \ + gccjit::location loc) + + Given an rvalue of T, construct another rvalue of another type. + + Currently only a limited set of conversions are possible: + + * int <-> float + * int <-> bool + * P* <-> Q*, for pointer types P and Q + +Lvalues +------- + +.. class:: gccjit::lvalue + +An lvalue is something that can of the *left*-hand side of an assignment: +a storage area (such as a variable). It is a subclass of +:class:`gccjit::rvalue`, where the rvalue is computed by reading from the +storage area. + +It iss a thin wrapper around :c:type:`gcc_jit_lvalue *` from the C API. + +.. function:: gccjit::rvalue \ + gccjit::lvalue::get_address (gccjit::location loc) + + Take the address of an lvalue; analogous to: + + .. code-block:: c + + &(EXPR) + + in C. + + Parameter "loc" is optional. + +Global variables +**************** + +.. function:: gccjit::lvalue \ + gccjit::context::new_global (gccjit::type type, \ + const char *name, \ + gccjit::location loc) + + Add a new global variable of the given type and name to the context. + + +Working with pointers, structs and unions +----------------------------------------- + +.. function:: gccjit::lvalue \ + gccjit::rvalue::dereference (gccjit::location loc) + + Given an rvalue of pointer type ``T *``, dereferencing the pointer, + getting an lvalue of type ``T``. Analogous to: + + .. code-block:: c++ + + *(EXPR) + + in C. + + Parameter "loc" is optional. + +If you don't need to specify the location, this can also be expressed using +an overloaded operator: + +.. function:: gccjit::lvalue \ + gccjit::rvalue::operator* (); + + .. code-block:: c++ + + gccjit::lvalue content = *ptr; + +Field access is provided separately for both lvalues and rvalues: + +.. function:: gccjit::lvalue \ + gccjit::lvalue::access_field (gccjit::field field, \ + gccjit::location loc) + + Given an lvalue of struct or union type, access the given field, + getting an lvalue of the field's type. Analogous to: + + .. code-block:: c++ + + (EXPR).field = ...; + + in C. + +.. function:: gccjit::rvalue \ + gccjit::rvalue::access_field (gccjit::field field, \ + gccjit::location loc) + + Given an rvalue of struct or union type, access the given field + as an rvalue. Analogous to: + + .. code-block:: c++ + + (EXPR).field + + in C. + +.. function:: gccjit::lvalue \ + gccjit::rvalue::dereference_field (gccjit::field field, \ + gccjit::location loc) + + Given an rvalue of pointer type ``T *`` where T is of struct or union + type, access the given field as an lvalue. Analogous to: + + .. code-block:: c++ + + (EXPR)->field + + in C, itself equivalent to ``(*EXPR).FIELD``. + +.. function:: gccjit::lvalue \ + gccjit::context::new_array_access (gccjit::rvalue ptr, \ + gccjit::rvalue index, \ + gccjit::location loc) + + Given an rvalue of pointer type ``T *``, get at the element `T` at + the given index, using standard C array indexing rules i.e. each + increment of ``index`` corresponds to ``sizeof(T)`` bytes. + Analogous to: + + .. code-block:: c++ + + PTR[INDEX] + + in C (or, indeed, to ``PTR + INDEX``). + + Parameter "loc" is optional. + +For array accesses where you don't need to specify a :class:`gccjit::location`, +two overloaded operators are available: + + gccjit::lvalue gccjit::rvalue::operator[] (gccjit::rvalue index) + + .. code-block:: c++ + + gccjit::lvalue element = array[idx]; + + gccjit::lvalue gccjit::rvalue::operator[] (int index) + + .. code-block:: c++ + + gccjit::lvalue element = array[0]; diff --git a/gcc/jit/docs/cp/topics/functions.rst b/gcc/jit/docs/cp/topics/functions.rst new file mode 100644 index 00000000000..3acc608d194 --- /dev/null +++ b/gcc/jit/docs/cp/topics/functions.rst @@ -0,0 +1,243 @@ +.. Copyright (C) 2014 Free Software Foundation, Inc. + Originally contributed by David Malcolm + + This is free software: you can redistribute it and/or modify it + under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, but + WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see + . + +.. default-domain:: cpp + +Creating and using functions +============================ + +Params +------ +.. class:: gccjit::param + + A `gccjit::param` represents a parameter to a function. + +.. function:: gccjit::param \ + gccjit::context::new_param (gccjit::type type,\ + const char *name, \ + gccjit::location loc) + + In preparation for creating a function, create a new parameter of the + given type and name. + +:class:`gccjit::param` is a subclass of :class:`gccjit::lvalue` (and thus +of :class:`gccjit::rvalue` and :class:`gccjit::object`). It is a thin +wrapper around the C API's :c:type:`gcc_jit_param *`. + +Functions +--------- + +.. class:: gccjit::function + + A `gccjit::function` represents a function - either one that we're + creating ourselves, or one that we're referencing. + +.. function:: gccjit::function \ + gccjit::context::new_function (enum gcc_jit_function_kind,\ + gccjit::type return_type, \ + const char *name, \ + std::vector ¶ms, \ + int is_variadic, \ + gccjit::location loc) \ + + Create a gcc_jit_function with the given name and parameters. + + Parameters "is_variadic" and "loc" are optional. + + This is a wrapper around the C API's :c:func:`gcc_jit_context_new_function`. + +.. function:: gccjit::function \ + gccjit::context::get_builtin_function (const char *name) + + This is a wrapper around the C API's + :c:func:`gcc_jit_context_get_builtin_function`. + +.. function:: gccjit::param \ + gccjit::function::get_param (int index) const + + Get the param of the given index (0-based). + +.. function:: void \ + gccjit::function::dump_to_dot (const char *path) + + Emit the function in graphviz format to the given path. + +.. function:: gccjit::lvalue \ + gccjit::function::new_local (gccjit::type type,\ + const char *name, \ + gccjit::location loc) + + Create a new local variable within the function, of the given type and + name. + +Blocks +------ +.. class:: gccjit::block + + A `gccjit::block` represents a basic block within a function i.e. a + sequence of statements with a single entry point and a single exit + point. + + :class:`gccjit::block` is a subclass of :class:`gccjit::object`. + + The first basic block that you create within a function will + be the entrypoint. + + Each basic block that you create within a function must be + terminated, either with a conditional, a jump, or a return. + + It's legal to have multiple basic blocks that return within + one function. + +.. function:: gccjit::block \ + gccjit::function::new_block (const char *name) + + Create a basic block of the given name. The name may be NULL, but + providing meaningful names is often helpful when debugging: it may + show up in dumps of the internal representation, and in error + messages. + +Statements +---------- + +.. function:: void\ + gccjit::block::add_eval (gccjit::rvalue rvalue, \ + gccjit::location loc) + + Add evaluation of an rvalue, discarding the result + (e.g. a function call that "returns" void). + + This is equivalent to this C code: + + .. code-block:: c + + (void)expression; + +.. function:: void\ + gccjit::block::add_assignment (gccjit::lvalue lvalue, \ + gccjit::rvalue rvalue, \ + gccjit::location loc) + + Add evaluation of an rvalue, assigning the result to the given + lvalue. + + This is roughly equivalent to this C code: + + .. code-block:: c + + lvalue = rvalue; + +.. function:: void\ + gccjit::block::add_assignment_op (gccjit::lvalue lvalue, \ + enum gcc_jit_binary_op, \ + gccjit::rvalue rvalue, \ + gccjit::location loc) + + Add evaluation of an rvalue, using the result to modify an + lvalue. + + This is analogous to "+=" and friends: + + .. code-block:: c + + lvalue += rvalue; + lvalue *= rvalue; + lvalue /= rvalue; + + etc. For example: + + .. code-block:: c + + /* "i++" */ + loop_body.add_assignment_op ( + i, + GCC_JIT_BINARY_OP_PLUS, + ctxt.one (int_type)); + +.. function:: void\ + gccjit::block::add_comment (const char *text, \ + gccjit::location loc) + + Add a no-op textual comment to the internal representation of the + code. It will be optimized away, but will be visible in the dumps + seen via :c:macro:`GCC_JIT_BOOL_OPTION_DUMP_INITIAL_TREE` + and :c:macro:`GCC_JIT_BOOL_OPTION_DUMP_INITIAL_GIMPLE`, + and thus may be of use when debugging how your project's internal + representation gets converted to the libgccjit IR. + + Parameter "loc" is optional. + +.. function:: void\ + gccjit::block::end_with_conditional (gccjit::rvalue boolval,\ + gccjit::block on_true,\ + gccjit::block on_false, \ + gccjit::location loc) + + Terminate a block by adding evaluation of an rvalue, branching on the + result to the appropriate successor block. + + This is roughly equivalent to this C code: + + .. code-block:: c + + if (boolval) + goto on_true; + else + goto on_false; + + block, boolval, on_true, and on_false must be non-NULL. + +.. function:: void\ + gccjit::block::end_with_jump (gccjit::block target, \ + gccjit::location loc) + + Terminate a block by adding a jump to the given target block. + + This is roughly equivalent to this C code: + + .. code-block:: c + + goto target; + +.. function:: void\ + gccjit::block::end_with_return (gccjit::rvalue rvalue, \ + gccjit::location loc) + + Terminate a block. + + Both params are optional. + + An rvalue must be provided for a function returning non-void, and + must not be provided by a function "returning" `void`. + + If an rvalue is provided, the block is terminated by evaluating the + rvalue and returning the value. + + This is roughly equivalent to this C code: + + .. code-block:: c + + return expression; + + If an rvalue is not provided, the block is terminated by adding a + valueless return, for use within a function with "void" return type. + + This is equivalent to this C code: + + .. code-block:: c + + return; diff --git a/gcc/jit/docs/cp/topics/index.rst b/gcc/jit/docs/cp/topics/index.rst new file mode 100644 index 00000000000..a1291375153 --- /dev/null +++ b/gcc/jit/docs/cp/topics/index.rst @@ -0,0 +1,30 @@ +.. Copyright (C) 2014 Free Software Foundation, Inc. + Originally contributed by David Malcolm + + This is free software: you can redistribute it and/or modify it + under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, but + WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see + . + +Topic Reference +=============== + +.. toctree:: + :maxdepth: 2 + + contexts.rst + objects.rst + types.rst + expressions.rst + functions.rst + locations.rst + results.rst diff --git a/gcc/jit/docs/cp/topics/locations.rst b/gcc/jit/docs/cp/topics/locations.rst new file mode 100644 index 00000000000..255e6f934bc --- /dev/null +++ b/gcc/jit/docs/cp/topics/locations.rst @@ -0,0 +1,65 @@ +.. Copyright (C) 2014 Free Software Foundation, Inc. + Originally contributed by David Malcolm + + This is free software: you can redistribute it and/or modify it + under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, but + WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see + . + +.. default-domain:: cpp + +Source Locations +================ + +.. class:: gccjit::location + + A `gccjit::location` encapsulates a source code location, so that + you can (optionally) associate locations in your language with + statements in the JIT-compiled code, allowing the debugger to + single-step through your language. + + `gccjit::location` instances are optional: you can always omit them + from any C++ API entrypoint accepting one. + + You can construct them using :func:`gccjit::context::new_location`. + + You need to enable :c:macro:`GCC_JIT_BOOL_OPTION_DEBUGINFO` on the + :class:`gccjit::context` for these locations to actually be usable by + the debugger: + + .. code-block:: cpp + + ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DEBUGINFO, 1); + +.. function:: gccjit::location \ + gccjit::context::new_location (const char *filename, \ + int line, \ + int column) + + Create a `gccjit::location` instance representing the given source + location. + +Faking it +--------- +If you don't have source code for your internal representation, but need +to debug, you can generate a C-like representation of the functions in +your context using :func:`gccjit::context::dump_to_file()`: + +.. code-block:: cpp + + ctxt.dump_to_file ("/tmp/something.c", + 1 /* update_locations */); + +This will dump C-like code to the given path. If the `update_locations` +argument is true, this will also set up `gccjit::location` information +throughout the context, pointing at the dump file as if it were a source +file, giving you *something* you can step through in the debugger. diff --git a/gcc/jit/docs/cp/topics/objects.rst b/gcc/jit/docs/cp/topics/objects.rst new file mode 100644 index 00000000000..cb4fc8b6d10 --- /dev/null +++ b/gcc/jit/docs/cp/topics/objects.rst @@ -0,0 +1,70 @@ +.. Copyright (C) 2014 Free Software Foundation, Inc. + Originally contributed by David Malcolm + + This is free software: you can redistribute it and/or modify it + under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, but + WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see + . + +.. default-domain:: cpp + +Objects +======= + +.. class:: gccjit::object + +Almost every entity in the API (with the exception of +:class:`gccjit::context` and :c:type:`gcc_jit_result *`) is a +"contextual" object, a :class:`gccjit::object`. + +A JIT object: + + * is associated with a :class:`gccjit::context`. + + * is automatically cleaned up for you when its context is released so + you don't need to manually track and cleanup all objects, just the + contexts. + +The C++ class hierarchy within the ``gccjit`` namespace looks like this:: + + +- object + +- location + +- type + +- struct + +- field + +- function + +- block + +- rvalue + +- lvalue + +- param + +The :class:`gccjit::object` base class has the following operations: + +.. function:: gccjit::context gccjit::object::get_context () const + + Which context is the obj within? + +.. function:: std::string gccjit::object::get_debug_string () const + + Generate a human-readable description for the given object. + + For example, + + .. code-block:: c++ + + printf ("obj: %s\n", obj.get_debug_string ().c_str ()); + + might give this text on stdout: + + .. code-block:: bash + + obj: 4.0 * (float)i diff --git a/gcc/jit/docs/cp/topics/results.rst b/gcc/jit/docs/cp/topics/results.rst new file mode 100644 index 00000000000..18200acdbb2 --- /dev/null +++ b/gcc/jit/docs/cp/topics/results.rst @@ -0,0 +1,48 @@ +.. Copyright (C) 2014 Free Software Foundation, Inc. + Originally contributed by David Malcolm + + This is free software: you can redistribute it and/or modify it + under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, but + WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see + . + +.. default-domain:: cpp + +Compilation results +=================== + +.. type:: gcc_jit_result + + A `gcc_jit_result` encapsulates the result of compiling a context. + +.. function:: gcc_jit_result *\ + gccjit::context::compile () + + This calls into GCC and builds the code, returning a + `gcc_jit_result *`. + + +.. function:: void *\ + gcc_jit_result_get_code (gcc_jit_result *result,\ + const char *funcname) + + Locate a given function within the built machine code. + This will need to be cast to a function pointer of the + correct type before it can be called. + + +.. function:: void\ + gcc_jit_result_release (gcc_jit_result *result) + + Once we're done with the code, this unloads the built .so file. + This cleans up the result; after calling this, it's no longer + valid to use the result. diff --git a/gcc/jit/docs/cp/topics/types.rst b/gcc/jit/docs/cp/topics/types.rst new file mode 100644 index 00000000000..af1e4dca3da --- /dev/null +++ b/gcc/jit/docs/cp/topics/types.rst @@ -0,0 +1,183 @@ +.. Copyright (C) 2014 Free Software Foundation, Inc. + Originally contributed by David Malcolm + + This is free software: you can redistribute it and/or modify it + under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, but + WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see + . + +.. default-domain:: cpp + +Types +===== + +.. class:: gccjit::type + + gccjit::type represents a type within the library. It is a subclass + of :class:`gccjit::object`. + +Types can be created in several ways: + +* fundamental types can be accessed using + :func:`gccjit::context::get_type`: + + .. code-block:: c++ + + gccjit::type int_type = ctxt.get_type (GCC_JIT_TYPE_INT); + + or using the :func:`gccjit::context::get_int_type` template: + + .. code-block:: c++ + + gccjit::type t = ctxt.get_int_type (); + + See :c:func:`gcc_jit_context_get_type` for the available types. + +* derived types can be accessed by using functions such as + :func:`gccjit::type::get_pointer` and :func:`gccjit::type::get_const`: + + .. code-block:: c++ + + gccjit::type const_int_star = int_type.get_const ().get_pointer (); + gccjit::type int_const_star = int_type.get_pointer ().get_const (); + +* by creating structures (see below). + +Standard types +-------------- + +.. function:: gccjit::type gccjit::context::get_type (enum gcc_jit_types) + + Access a specific type. This is a thin wrapper around + :c:func:`gcc_jit_context_get_type`; the parameter has the same meaning. + +.. function:: gccjit::type \ + gccjit::context::get_int_type (size_t num_bytes, int is_signed) + + Access the integer type of the given size. + +.. function:: gccjit::type \ + gccjit::context::get_int_type () + + Access the given integer type. For example, you could map the + ``unsigned short`` type into a gccjit::type via: + + .. code-block:: c++ + + gccjit::type t = ctxt.get_int_type (); + +Pointers, `const`, and `volatile` +--------------------------------- + +.. function:: gccjit::type gccjit::type::get_pointer () + + Given type "T", get type "T*". + +.. FIXME: get_const doesn't seem to exist + +.. function:: gccjit::type gccjit::type::get_const () + + Given type "T", get type "const T". + +.. function:: gccjit::type gccjit::type::get_volatile () + + Given type "T", get type "volatile T". + +.. function:: gccjit::type \ + gccjit::context::new_array_type (gccjit::type element_type, \ + int num_elements, \ + gccjit::location loc) + + Given type "T", get type "T[N]" (for a constant N). + Param "loc" is optional. + + +Structures and unions +--------------------- + +.. class:: gccjit::struct_ + +A compound type analagous to a C `struct`. + +:class:`gccjit::struct_` is a subclass of :class:`gccjit::type` (and thus +of :class:`gccjit::object` in turn). + +.. class:: gccjit::field + +A field within a :class:`gccjit::struct_`. + +:class:`gccjit::field` is a subclass of :class:`gccjit::object`. + +You can model C `struct` types by creating :class:`gccjit::struct_` and +:class:`gccjit::field` instances, in either order: + +* by creating the fields, then the structure. For example, to model: + + .. code-block:: c + + struct coord {double x; double y; }; + + you could call: + + .. code-block:: c++ + + gccjit::field field_x = ctxt.new_field (double_type, "x"); + gccjit::field field_y = ctxt.new_field (double_type, "y"); + std::vector fields; + fields.push_back (field_x); + fields.push_back (field_y); + gccjit::struct_ coord = ctxt.new_struct_type ("coord", fields); + +* by creating the structure, then populating it with fields, typically + to allow modelling self-referential structs such as: + + .. code-block:: c + + struct node { int m_hash; struct node *m_next; }; + + like this: + + .. code-block:: c++ + + gccjit::struct_ node = ctxt.new_opaque_struct_type ("node"); + gccjit::type node_ptr = node.get_pointer (); + gccjit::field field_hash = ctxt.new_field (int_type, "m_hash"); + gccjit::field field_next = ctxt.new_field (node_ptr, "m_next"); + std::vector fields; + fields.push_back (field_hash); + fields.push_back (field_next); + node.set_fields (fields); + +.. FIXME: the above API doesn't seem to exist yet + +.. function:: gccjit::field \ + gccjit::context::new_field (gccjit::type type,\ + const char *name, \ + gccjit::location loc) + + Construct a new field, with the given type and name. + +.. function:: gccjit::struct_ \ + gccjit::context::new_struct_type (const std::string &name,\ + std::vector &fields,\ + gccjit::location loc) + + Construct a new struct type, with the given name and fields. + +.. function:: gccjit::struct_ \ + gccjit::context::new_opaque_struct (const std::string &name, \ + gccjit::location loc) + + Construct a new struct type, with the given name, but without + specifying the fields. The fields can be omitted (in which case the + size of the struct is not known), or later specified using + :c:func:`gcc_jit_struct_set_fields`. diff --git a/gcc/jit/docs/examples/tut01-hello-world.cc b/gcc/jit/docs/examples/tut01-hello-world.cc new file mode 100644 index 00000000000..d70fe6791af --- /dev/null +++ b/gcc/jit/docs/examples/tut01-hello-world.cc @@ -0,0 +1,107 @@ +/* Smoketest example for libgccjit.so C++ API + Copyright (C) 2014 Free Software Foundation, Inc. + +This file is part of GCC. + +GCC is free software; you can redistribute it and/or modify it +under the terms of the GNU General Public License as published by +the Free Software Foundation; either version 3, or (at your option) +any later version. + +GCC is distributed in the hope that it will be useful, but +WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +General Public License for more details. + +You should have received a copy of the GNU General Public License +along with GCC; see the file COPYING3. If not see +. */ + +#include + +#include +#include + +static void +create_code (gccjit::context ctxt) +{ + /* Let's try to inject the equivalent of this C code: + void + greet (const char *name) + { + printf ("hello %s\n", name); + } + */ + gccjit::type void_type = ctxt.get_type (GCC_JIT_TYPE_VOID); + gccjit::type const_char_ptr_type = + ctxt.get_type (GCC_JIT_TYPE_CONST_CHAR_PTR); + gccjit::param param_name = + ctxt.new_param (const_char_ptr_type, "name"); + std::vector func_params; + func_params.push_back (param_name); + gccjit::function func = + ctxt.new_function (GCC_JIT_FUNCTION_EXPORTED, + void_type, + "greet", + func_params, 0); + + gccjit::param param_format = + ctxt.new_param (const_char_ptr_type, "format"); + std::vector printf_params; + printf_params.push_back (param_format); + gccjit::function printf_func = + ctxt.new_function (GCC_JIT_FUNCTION_IMPORTED, + ctxt.get_type (GCC_JIT_TYPE_INT), + "printf", + printf_params, 1); + + gccjit::block block = func.new_block (); + block.add_eval (ctxt.new_call (printf_func, + ctxt.new_rvalue ("hello %s\n"), + param_name)); + block.end_with_return (); +} + +int +main (int argc, char **argv) +{ + gccjit::context ctxt; + gcc_jit_result *result; + + /* Get a "context" object for working with the library. */ + ctxt = gccjit::context::acquire (); + + /* Set some options on the context. + Turn this on to see the code being generated, in assembler form. */ + ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DUMP_GENERATED_CODE, 0); + + /* Populate the context. */ + create_code (ctxt); + + /* Compile the code. */ + result = ctxt.compile (); + if (!result) + { + fprintf (stderr, "NULL result"); + exit (1); + } + + ctxt.release (); + + /* Extract the generated code from "result". */ + typedef void (*fn_type) (const char *); + fn_type greet = + (fn_type)gcc_jit_result_get_code (result, "greet"); + if (!greet) + { + fprintf (stderr, "NULL greet"); + exit (1); + } + + /* Now call the generated function: */ + greet ("world"); + fflush (stdout); + + gcc_jit_result_release (result); + return 0; +} diff --git a/gcc/jit/docs/examples/tut02-square.c b/gcc/jit/docs/examples/tut02-square.c index fea3f1104d5..9ee1f38ea86 100644 --- a/gcc/jit/docs/examples/tut02-square.c +++ b/gcc/jit/docs/examples/tut02-square.c @@ -102,7 +102,7 @@ main (int argc, char **argv) typedef int (*fn_type) (int); fn_type square = (fn_type)fn_ptr; - printf ("result: %d", square (5)); + printf ("result: %d\n", square (5)); error: if (ctxt) diff --git a/gcc/jit/docs/examples/tut02-square.cc b/gcc/jit/docs/examples/tut02-square.cc new file mode 100644 index 00000000000..a48245ee1f9 --- /dev/null +++ b/gcc/jit/docs/examples/tut02-square.cc @@ -0,0 +1,95 @@ +/* Usage example for libgccjit.so's C++ API + Copyright (C) 2014 Free Software Foundation, Inc. + +This file is part of GCC. + +GCC is free software; you can redistribute it and/or modify it +under the terms of the GNU General Public License as published by +the Free Software Foundation; either version 3, or (at your option) +any later version. + +GCC is distributed in the hope that it will be useful, but +WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +General Public License for more details. + +You should have received a copy of the GNU General Public License +along with GCC; see the file COPYING3. If not see +. */ + +#include + +#include +#include + +void +create_code (gccjit::context ctxt) +{ + /* Let's try to inject the equivalent of this C code: + + int square (int i) + { + return i * i; + } + */ + gccjit::type int_type = ctxt.get_type (GCC_JIT_TYPE_INT); + gccjit::param param_i = ctxt.new_param (int_type, "i"); + std::vector params; + params.push_back (param_i); + gccjit::function func = ctxt.new_function (GCC_JIT_FUNCTION_EXPORTED, + int_type, + "square", + params, 0); + + gccjit::block block = func.new_block (); + + gccjit::rvalue expr = + ctxt.new_binary_op (GCC_JIT_BINARY_OP_MULT, int_type, + param_i, param_i); + + block.end_with_return (expr); +} + +int +main (int argc, char **argv) +{ + /* Get a "context" object for working with the library. */ + gccjit::context ctxt = gccjit::context::acquire (); + + /* Set some options on the context. + Turn this on to see the code being generated, in assembler form. */ + ctxt.set_bool_option ( + GCC_JIT_BOOL_OPTION_DUMP_GENERATED_CODE, + 0); + + /* Populate the context. */ + create_code (ctxt); + + /* Compile the code. */ + gcc_jit_result *result = ctxt.compile (); + + /* We're done with the context; we can release it: */ + ctxt.release (); + + if (!result) + { + fprintf (stderr, "NULL result"); + return 1; + } + + /* Extract the generated code from "result". */ + void *fn_ptr = gcc_jit_result_get_code (result, "square"); + if (!fn_ptr) + { + fprintf (stderr, "NULL fn_ptr"); + gcc_jit_result_release (result); + return 1; + } + + typedef int (*fn_type) (int); + fn_type square = (fn_type)fn_ptr; + printf ("result: %d\n", square (5)); + + gcc_jit_result_release (result); + return 0; +} diff --git a/gcc/jit/docs/examples/tut03-sum-of-squares.cc b/gcc/jit/docs/examples/tut03-sum-of-squares.cc new file mode 100644 index 00000000000..dc0832fac2e --- /dev/null +++ b/gcc/jit/docs/examples/tut03-sum-of-squares.cc @@ -0,0 +1,137 @@ +/* Usage example for libgccjit.so's C++ API + Copyright (C) 2014 Free Software Foundation, Inc. + +This file is part of GCC. + +GCC is free software; you can redistribute it and/or modify it +under the terms of the GNU General Public License as published by +the Free Software Foundation; either version 3, or (at your option) +any later version. + +GCC is distributed in the hope that it will be useful, but +WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +General Public License for more details. + +You should have received a copy of the GNU General Public License +along with GCC; see the file COPYING3. If not see +. */ + +#include + +#include +#include + +void +create_code (gccjit::context ctxt) +{ + /* + Simple sum-of-squares, to test conditionals and looping + + int loop_test (int n) + { + int i; + int sum = 0; + for (i = 0; i < n ; i ++) + { + sum += i * i; + } + return sum; + */ + gccjit::type the_type = ctxt.get_int_type (); + gccjit::type return_type = the_type; + + gccjit::param n = ctxt.new_param (the_type, "n"); + std::vector params; + params.push_back (n); + gccjit::function func = + ctxt.new_function (GCC_JIT_FUNCTION_EXPORTED, + return_type, + "loop_test", + params, 0); + + /* Build locals: */ + gccjit::lvalue i = func.new_local (the_type, "i"); + gccjit::lvalue sum = func.new_local (the_type, "sum"); + + gccjit::block b_initial = func.new_block ("initial"); + gccjit::block b_loop_cond = func.new_block ("loop_cond"); + gccjit::block b_loop_body = func.new_block ("loop_body"); + gccjit::block b_after_loop = func.new_block ("after_loop"); + + /* sum = 0; */ + b_initial.add_assignment (sum, ctxt.zero (the_type)); + + /* i = 0; */ + b_initial.add_assignment (i, ctxt.zero (the_type)); + + b_initial.end_with_jump (b_loop_cond); + + /* if (i >= n) */ + b_loop_cond.end_with_conditional ( + i >= n, + b_after_loop, + b_loop_body); + + /* sum += i * i */ + b_loop_body.add_assignment_op (sum, + GCC_JIT_BINARY_OP_PLUS, + i * i); + + /* i++ */ + b_loop_body.add_assignment_op (i, + GCC_JIT_BINARY_OP_PLUS, + ctxt.one (the_type)); + + b_loop_body.end_with_jump (b_loop_cond); + + /* return sum */ + b_after_loop.end_with_return (sum); +} + +int +main (int argc, char **argv) +{ + gccjit::context ctxt; + gcc_jit_result *result = NULL; + + /* Get a "context" object for working with the library. */ + ctxt = gccjit::context::acquire (); + + /* Set some options on the context. + Turn this on to see the code being generated, in assembler form. */ + ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DUMP_GENERATED_CODE, + 0); + + /* Populate the context. */ + create_code (ctxt); + + /* Compile the code. */ + result = ctxt.compile (); + + ctxt.release (); + + if (!result) + { + fprintf (stderr, "NULL result"); + return 1; + } + + /* Extract the generated code from "result". */ + typedef int (*loop_test_fn_type) (int); + loop_test_fn_type loop_test = + (loop_test_fn_type)gcc_jit_result_get_code (result, "loop_test"); + if (!loop_test) + { + fprintf (stderr, "NULL loop_test"); + gcc_jit_result_release (result); + return 1; + } + + /* Run the generated code. */ + int val = loop_test (10); + printf("loop_test returned: %d\n", val); + + gcc_jit_result_release (result); + return 0; +} diff --git a/gcc/jit/docs/examples/tut04-toyvm/toyvm.cc b/gcc/jit/docs/examples/tut04-toyvm/toyvm.cc new file mode 100644 index 00000000000..3a9bbdea86a --- /dev/null +++ b/gcc/jit/docs/examples/tut04-toyvm/toyvm.cc @@ -0,0 +1,902 @@ +/* A simple stack-based virtual machine to demonstrate + JIT-compilation. + Copyright (C) 2014 Free Software Foundation, Inc. + +This file is part of GCC. + +GCC is free software; you can redistribute it and/or modify it +under the terms of the GNU General Public License as published by +the Free Software Foundation; either version 3, or (at your option) +any later version. + +GCC is distributed in the hope that it will be useful, but +WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +General Public License for more details. + +You should have received a copy of the GNU General Public License +along with GCC; see the file COPYING3. If not see +. */ + +#include +#include +#include +#include +#include + +#include + +#include + +/* Functions are compiled to this function ptr type. */ +typedef int (*toyvm_compiled_func) (int); + +enum opcode { + /* Ops taking no operand. */ + DUP, + ROT, + BINARY_ADD, + BINARY_SUBTRACT, + BINARY_MULT, + BINARY_COMPARE_LT, + RECURSE, + RETURN, + + /* Ops taking an operand. */ + PUSH_CONST, + JUMP_ABS_IF_TRUE +}; + +#define FIRST_UNARY_OPCODE (PUSH_CONST) + +const char * const opcode_names[] = { + "DUP", + "ROT", + "BINARY_ADD", + "BINARY_SUBTRACT", + "BINARY_MULT", + "BINARY_COMPARE_LT", + "RECURSE", + "RETURN", + + "PUSH_CONST", + "JUMP_ABS_IF_TRUE", +}; + +struct toyvm_op +{ + /* Which operation. */ + enum opcode op_opcode; + + /* Some opcodes take an argument. */ + int op_operand; + + /* The line number of the operation within the source file. */ + int op_linenum; +}; + +#define MAX_OPS (64) + +class toyvm_function +{ +public: + void + add_op (enum opcode opcode, + int operand, int linenum); + + void + add_unary_op (enum opcode opcode, + const char *rest_of_line, int linenum); + + static toyvm_function * + parse (const char *filename, const char *name); + + void + disassemble_op (toyvm_op *op, int index, FILE *out); + + void + disassemble (FILE *out); + + int + interpret (int arg, FILE *trace); + + toyvm_compiled_func + compile (); + +private: + const char *fn_filename; + int fn_num_ops; + toyvm_op fn_ops[MAX_OPS]; + friend struct compilation_state; +}; + +#define MAX_STACK_DEPTH (8) + +class toyvm_frame +{ +public: + void push (int arg); + int pop (); + void dump_stack (FILE *out); + +private: + toyvm_function *frm_function; + int frm_pc; + int frm_stack[MAX_STACK_DEPTH]; + int frm_cur_depth; + + friend int toyvm_function::interpret (int arg, FILE *trace); + +}; + +void +toyvm_function::add_op (enum opcode opcode, + int operand, int linenum) +{ + toyvm_op *op; + assert (fn_num_ops < MAX_OPS); + op = &fn_ops[fn_num_ops++]; + op->op_opcode = opcode; + op->op_operand = operand; + op->op_linenum = linenum; +} + +void +toyvm_function::add_unary_op (enum opcode opcode, + const char *rest_of_line, int linenum) +{ + int operand = atoi (rest_of_line); + add_op (opcode, operand, linenum); +} + +static char * +get_function_name (const char *filename) +{ + /* Skip any path separators. */ + const char *pathsep = strrchr (filename, '/'); + if (pathsep) + filename = pathsep + 1; + + /* Copy filename to funcname. */ + char *funcname = (char *)malloc (strlen (filename) + 1); + + strcpy (funcname, filename); + + /* Convert "." to NIL terminator. */ + *(strchr (funcname, '.')) = '\0'; + + return funcname; +} + +toyvm_function * +toyvm_function::parse (const char *filename, const char *name) +{ + FILE *f = NULL; + toyvm_function *fn = NULL; + char *line = NULL; + ssize_t linelen; + size_t bufsize; + int linenum = 0; + + assert (filename); + assert (name); + + f = fopen (filename, "r"); + if (!f) + { + fprintf (stderr, + "cannot open file %s: %s\n", + filename, strerror (errno)); + goto error; + } + + fn = (toyvm_function *)calloc (1, sizeof (toyvm_function)); + if (!fn) + { + fprintf (stderr, "out of memory allocating toyvm_function\n"); + goto error; + } + fn->fn_filename = filename; + + /* Read the lines of the file. */ + while ((linelen = getline (&line, &bufsize, f)) != -1) + { + /* Note that this is a terrible parser, but it avoids the need to + bring in lex/yacc as a dependency. */ + linenum++; + + if (0) + fprintf (stdout, "%3d: %s", linenum, line); + + /* Lines beginning with # are comments. */ + if (line[0] == '#') + continue; + + /* Skip blank lines. */ + if (line[0] == '\n') + continue; + +#define LINE_MATCHES(OPCODE) (0 == strncmp ((OPCODE), line, strlen (OPCODE))) + if (LINE_MATCHES ("DUP\n")) + fn->add_op (DUP, 0, linenum); + else if (LINE_MATCHES ("ROT\n")) + fn->add_op (ROT, 0, linenum); + else if (LINE_MATCHES ("BINARY_ADD\n")) + fn->add_op (BINARY_ADD, 0, linenum); + else if (LINE_MATCHES ("BINARY_SUBTRACT\n")) + fn->add_op (BINARY_SUBTRACT, 0, linenum); + else if (LINE_MATCHES ("BINARY_MULT\n")) + fn->add_op (BINARY_MULT, 0, linenum); + else if (LINE_MATCHES ("BINARY_COMPARE_LT\n")) + fn->add_op (BINARY_COMPARE_LT, 0, linenum); + else if (LINE_MATCHES ("RECURSE\n")) + fn->add_op (RECURSE, 0, linenum); + else if (LINE_MATCHES ("RETURN\n")) + fn->add_op (RETURN, 0, linenum); + else if (LINE_MATCHES ("PUSH_CONST ")) + fn->add_unary_op (PUSH_CONST, + line + strlen ("PUSH_CONST "), linenum); + else if (LINE_MATCHES ("JUMP_ABS_IF_TRUE ")) + fn->add_unary_op (JUMP_ABS_IF_TRUE, + line + strlen("JUMP_ABS_IF_TRUE "), linenum); + else + { + fprintf (stderr, "%s:%d: parse error\n", filename, linenum); + free (fn); + fn = NULL; + goto error; + } +#undef LINE_MATCHES + } + free (line); + fclose (f); + + return fn; + + error: + free (line); + if (f) + fclose (f); + free (fn); + return NULL; +} + +void +toyvm_function::disassemble_op (toyvm_op *op, int index, FILE *out) +{ + fprintf (out, "%s:%d: index %d: %s", + fn_filename, op->op_linenum, index, + opcode_names[op->op_opcode]); + if (op->op_opcode >= FIRST_UNARY_OPCODE) + fprintf (out, " %d", op->op_operand); + fprintf (out, "\n"); +} + +void +toyvm_function::disassemble (FILE *out) +{ + int i; + for (i = 0; i < fn_num_ops; i++) + { + toyvm_op *op = &fn_ops[i]; + disassemble_op (op, i, out); + } +} + +void +toyvm_frame::push (int arg) +{ + assert (frm_cur_depth < MAX_STACK_DEPTH); + frm_stack[frm_cur_depth++] = arg; +} + +int +toyvm_frame::pop () +{ + assert (frm_cur_depth > 0); + return frm_stack[--frm_cur_depth]; +} + +void +toyvm_frame::dump_stack (FILE *out) +{ + int i; + fprintf (out, "stack:"); + for (i = 0; i < frm_cur_depth; i++) + { + fprintf (out, " %d", frm_stack[i]); + } + fprintf (out, "\n"); +} + +/* Execute the given function. */ + +int +toyvm_function::interpret (int arg, FILE *trace) +{ + toyvm_frame frame; +#define PUSH(ARG) (frame.push (ARG)) +#define POP(ARG) (frame.pop ()) + + frame.frm_function = this; + frame.frm_pc = 0; + frame.frm_cur_depth = 0; + + PUSH (arg); + + while (1) + { + toyvm_op *op; + int x, y; + assert (frame.frm_pc < fn_num_ops); + op = &fn_ops[frame.frm_pc++]; + + if (trace) + { + frame.dump_stack (trace); + disassemble_op (op, frame.frm_pc, trace); + } + + switch (op->op_opcode) + { + /* Ops taking no operand. */ + case DUP: + x = POP (); + PUSH (x); + PUSH (x); + break; + + case ROT: + y = POP (); + x = POP (); + PUSH (y); + PUSH (x); + break; + + case BINARY_ADD: + y = POP (); + x = POP (); + PUSH (x + y); + break; + + case BINARY_SUBTRACT: + y = POP (); + x = POP (); + PUSH (x - y); + break; + + case BINARY_MULT: + y = POP (); + x = POP (); + PUSH (x * y); + break; + + case BINARY_COMPARE_LT: + y = POP (); + x = POP (); + PUSH (x < y); + break; + + case RECURSE: + x = POP (); + x = interpret (x, trace); + PUSH (x); + break; + + case RETURN: + return POP (); + + /* Ops taking an operand. */ + case PUSH_CONST: + PUSH (op->op_operand); + break; + + case JUMP_ABS_IF_TRUE: + x = POP (); + if (x) + frame.frm_pc = op->op_operand; + break; + + default: + assert (0); /* unknown opcode */ + + } /* end of switch on opcode */ + } /* end of while loop */ + +#undef PUSH +#undef POP +} + +/* JIT compilation. */ + +class compilation_state +{ +public: + compilation_state (toyvm_function &toyvmfn) : + toyvmfn (toyvmfn) + {} + + void create_context (); + void create_types (); + void create_locations (); + void create_function (const char *funcname); + gcc_jit_result *compile (); + +private: + void + add_push (gccjit::block block, + gccjit::rvalue rvalue, + gccjit::location loc); + + void + add_pop (gccjit::block block, + gccjit::lvalue lvalue, + gccjit::location loc); + +private: + + /* State. */ + + toyvm_function &toyvmfn; + + gccjit::context ctxt; + + gccjit::type int_type; + gccjit::type bool_type; + gccjit::type stack_type; /* int[MAX_STACK_DEPTH] */ + + gccjit::rvalue const_one; + + gccjit::function fn; + gccjit::param param_arg; + gccjit::lvalue stack; + gccjit::lvalue stack_depth; + gccjit::lvalue x; + gccjit::lvalue y; + + gccjit::location op_locs[MAX_OPS]; + gccjit::block initial_block; + gccjit::block op_blocks[MAX_OPS]; + +}; + +/* The main compilation hook. */ + +toyvm_compiled_func +toyvm_function::compile () +{ + compilation_state state (*this); + char *funcname; + + funcname = get_function_name (fn_filename); + + state.create_context (); + state.create_types (); + state.create_locations (); + state.create_function (funcname); + + /* We've now finished populating the context. Compile it. */ + gcc_jit_result *result = state.compile (); + + return (toyvm_compiled_func)gcc_jit_result_get_code (result, funcname); + /* (this leaks "result" and "funcname") */ +} + +/* Stack manipulation. */ + +void +compilation_state::add_push (gccjit::block block, + gccjit::rvalue rvalue, + gccjit::location loc) +{ + /* stack[stack_depth] = RVALUE */ + block.add_assignment ( + /* stack[stack_depth] */ + ctxt.new_array_access ( + stack, + stack_depth, + loc), + rvalue, + loc); + + /* "stack_depth++;". */ + block.add_assignment_op ( + stack_depth, + GCC_JIT_BINARY_OP_PLUS, + const_one, + loc); +} + +void +compilation_state::add_pop (gccjit::block block, + gccjit::lvalue lvalue, + gccjit::location loc) +{ + /* "--stack_depth;". */ + block.add_assignment_op ( + stack_depth, + GCC_JIT_BINARY_OP_MINUS, + const_one, + loc); + + /* "LVALUE = stack[stack_depth];". */ + block.add_assignment ( + lvalue, + /* stack[stack_depth] */ + ctxt.new_array_access (stack, + stack_depth, + loc), + loc); +} + +/* Create the context. */ + +void +compilation_state::create_context () +{ + ctxt = gccjit::context::acquire (); + + ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DUMP_INITIAL_GIMPLE, + 0); + ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DUMP_GENERATED_CODE, + 0); + ctxt.set_int_option (GCC_JIT_INT_OPTION_OPTIMIZATION_LEVEL, + 3); + ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_KEEP_INTERMEDIATES, + 0); + ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DUMP_EVERYTHING, + 0); + ctxt.set_bool_option (GCC_JIT_BOOL_OPTION_DEBUGINFO, + 1); +} + +/* Create types. */ + +void +compilation_state::create_types () +{ + /* Create types. */ + int_type = ctxt.get_type (GCC_JIT_TYPE_INT); + bool_type = ctxt.get_type (GCC_JIT_TYPE_BOOL); + stack_type = ctxt.new_array_type (int_type, MAX_STACK_DEPTH); + + /* The constant value 1. */ + const_one = ctxt.one (int_type); + +} + +/* Create locations. */ + +void +compilation_state::create_locations () +{ + for (int pc = 0; pc < toyvmfn.fn_num_ops; pc++) + { + toyvm_op *op = &toyvmfn.fn_ops[pc]; + + op_locs[pc] = ctxt.new_location (toyvmfn.fn_filename, + op->op_linenum, + 0); /* column */ + } +} + +/* Creating the function. */ + +void +compilation_state::create_function (const char *funcname) +{ + std::vector params; + param_arg = ctxt.new_param (int_type, "arg", op_locs[0]); + params.push_back (param_arg); + fn = ctxt.new_function (GCC_JIT_FUNCTION_EXPORTED, + int_type, + funcname, + params, 0, + op_locs[0]); + + /* Create stack lvalues. */ + stack = fn.new_local (stack_type, "stack"); + stack_depth = fn.new_local (int_type, "stack_depth"); + x = fn.new_local (int_type, "x"); + y = fn.new_local (int_type, "y"); + + /* 1st pass: create blocks, one per opcode. */ + + /* We need an entry block to do one-time initialization, so create that + first. */ + initial_block = fn.new_block ("initial"); + + /* Create a block per operation. */ + for (int pc = 0; pc < toyvmfn.fn_num_ops; pc++) + { + char buf[16]; + sprintf (buf, "instr%i", pc); + op_blocks[pc] = fn.new_block (buf); + } + + /* Populate the initial block. */ + + /* "stack_depth = 0;". */ + initial_block.add_assignment (stack_depth, + ctxt.zero (int_type), + op_locs[0]); + + /* "PUSH (arg);". */ + add_push (initial_block, + param_arg, + op_locs[0]); + + /* ...and jump to insn 0. */ + initial_block.end_with_jump (op_blocks[0], + op_locs[0]); + + /* 2nd pass: fill in instructions. */ + for (int pc = 0; pc < toyvmfn.fn_num_ops; pc++) + { + gccjit::location loc = op_locs[pc]; + + gccjit::block block = op_blocks[pc]; + gccjit::block next_block = (pc < toyvmfn.fn_num_ops + ? op_blocks[pc + 1] + : NULL); + + toyvm_op *op; + op = &toyvmfn.fn_ops[pc]; + + /* Helper macros. */ + +#define X_EQUALS_POP()\ + add_pop (block, x, loc) +#define Y_EQUALS_POP()\ + add_pop (block, y, loc) +#define PUSH_RVALUE(RVALUE)\ + add_push (block, (RVALUE), loc) +#define PUSH_X()\ + PUSH_RVALUE (x) +#define PUSH_Y() \ + PUSH_RVALUE (y) + + block.add_comment (opcode_names[op->op_opcode], loc); + + /* Handle the individual opcodes. */ + + switch (op->op_opcode) + { + case DUP: + X_EQUALS_POP (); + PUSH_X (); + PUSH_X (); + break; + + case ROT: + Y_EQUALS_POP (); + X_EQUALS_POP (); + PUSH_Y (); + PUSH_X (); + break; + + case BINARY_ADD: + Y_EQUALS_POP (); + X_EQUALS_POP (); + PUSH_RVALUE ( + ctxt.new_binary_op ( + GCC_JIT_BINARY_OP_PLUS, + int_type, + x, y, + loc)); + break; + + case BINARY_SUBTRACT: + Y_EQUALS_POP (); + X_EQUALS_POP (); + PUSH_RVALUE ( + ctxt.new_binary_op ( + GCC_JIT_BINARY_OP_MINUS, + int_type, + x, y, + loc)); + break; + + case BINARY_MULT: + Y_EQUALS_POP (); + X_EQUALS_POP (); + PUSH_RVALUE ( + ctxt.new_binary_op ( + GCC_JIT_BINARY_OP_MULT, + int_type, + x, y, + loc)); + break; + + case BINARY_COMPARE_LT: + Y_EQUALS_POP (); + X_EQUALS_POP (); + PUSH_RVALUE ( + /* cast of bool to int */ + ctxt.new_cast ( + /* (x < y) as a bool */ + ctxt.new_comparison ( + GCC_JIT_COMPARISON_LT, + x, y, + loc), + int_type, + loc)); + break; + + case RECURSE: + { + X_EQUALS_POP (); + PUSH_RVALUE ( + ctxt.new_call ( + fn, + x, + loc)); + break; + } + + case RETURN: + X_EQUALS_POP (); + block.end_with_return (x, loc); + break; + + /* Ops taking an operand. */ + case PUSH_CONST: + PUSH_RVALUE ( + ctxt.new_rvalue (int_type, op->op_operand)); + break; + + case JUMP_ABS_IF_TRUE: + X_EQUALS_POP (); + block.end_with_conditional ( + /* "(bool)x". */ + ctxt.new_cast (x, bool_type, loc), + op_blocks[op->op_operand], /* on_true */ + next_block, /* on_false */ + loc); + break; + + default: + assert(0); + } /* end of switch on opcode */ + + /* Go to the next block. */ + if (op->op_opcode != JUMP_ABS_IF_TRUE + && op->op_opcode != RETURN) + block.end_with_jump (next_block, loc); + + } /* end of loop on PC locations. */ +} + +gcc_jit_result * +compilation_state::compile () +{ + return ctxt.compile (); +} + +char test[1024]; + +#define CHECK_NON_NULL(PTR) \ + do { \ + if ((PTR) != NULL) \ + { \ + pass ("%s: %s is non-null", test, #PTR); \ + } \ + else \ + { \ + fail ("%s: %s is NULL", test, #PTR); \ + abort (); \ + } \ + } while (0) + +#define CHECK_VALUE(ACTUAL, EXPECTED) \ + do { \ + if ((ACTUAL) == (EXPECTED)) \ + { \ + pass ("%s: actual: %s == expected: %s", test, #ACTUAL, #EXPECTED); \ + } \ + else \ + { \ + fail ("%s: actual: %s != expected: %s", test, #ACTUAL, #EXPECTED); \ + fprintf (stderr, "incorrect value\n"); \ + abort (); \ + } \ + } while (0) + +static void +test_script (const char *scripts_dir, const char *script_name, int input, + int expected_result) +{ + char *script_path; + toyvm_function *fn; + int interpreted_result; + toyvm_compiled_func code; + int compiled_result; + + snprintf (test, sizeof (test), "toyvm.cc: %s", script_name); + + script_path = (char *)malloc (strlen (scripts_dir) + + strlen (script_name) + 1); + CHECK_NON_NULL (script_path); + sprintf (script_path, "%s%s", scripts_dir, script_name); + + fn = toyvm_function::parse (script_path, script_name); + CHECK_NON_NULL (fn); + + interpreted_result = fn->interpret (input, NULL); + CHECK_VALUE (interpreted_result, expected_result); + + code = fn->compile (); + CHECK_NON_NULL (code); + + compiled_result = code (input); + CHECK_VALUE (compiled_result, expected_result); + + free (script_path); +} + +#define PATH_TO_SCRIPTS ("/jit/docs/examples/tut04-toyvm/") + +static void +test_suite (void) +{ + const char *srcdir; + char *scripts_dir; + + snprintf (test, sizeof (test), "toyvm.cc"); + + /* We need to locate the test scripts. + Rely on "srcdir" being set in the environment. */ + + srcdir = getenv ("srcdir"); + CHECK_NON_NULL (srcdir); + + scripts_dir = (char *)malloc (strlen (srcdir) + strlen(PATH_TO_SCRIPTS) + + 1); + CHECK_NON_NULL (scripts_dir); + sprintf (scripts_dir, "%s%s", srcdir, PATH_TO_SCRIPTS); + + test_script (scripts_dir, "factorial.toy", 10, 3628800); + test_script (scripts_dir, "fibonacci.toy", 10, 55); + + free (scripts_dir); +} + +int +main (int argc, char **argv) +{ + const char *filename = NULL; + toyvm_function *fn = NULL; + + /* If called with no args, assume we're being run by the test suite. */ + if (argc < 3) + { + test_suite (); + return 0; + } + + if (argc != 3) + { + fprintf (stdout, + "%s FILENAME INPUT: Parse and run a .toy file\n", + argv[0]); + exit (1); + } + + filename = argv[1]; + fn = toyvm_function::parse (filename, filename); + if (!fn) + exit (1); + + if (0) + fn->disassemble (stdout); + + printf ("interpreter result: %d\n", + fn->interpret (atoi (argv[2]), NULL)); + + /* JIT-compilation. */ + toyvm_compiled_func code = fn->compile (); + printf ("compiler result: %d\n", + code (atoi (argv[2]))); + + return 0; +} diff --git a/gcc/jit/docs/index.rst b/gcc/jit/docs/index.rst index ed75e36c201..343279a38a4 100644 --- a/gcc/jit/docs/index.rst +++ b/gcc/jit/docs/index.rst @@ -18,6 +18,20 @@ libgccjit ========= +This document describes `libgccjit `_, an API +for embedding GCC inside programs and libraries. + +Note that libgccjit is currently of "Alpha" quality; +the APIs are not yet set in stone, and they shouldn't be used in +production yet. + +There are actually two APIs for the library: + +* a pure C API: ``libgccjit.h`` + +* a C++ wrapper API: ``libgccjit++.h``. This is a collection of "thin" + wrapper classes around the C API, to save typing. + Contents: .. toctree:: @@ -25,15 +39,9 @@ Contents: intro/index.rst topics/index.rst + cp/index.rst internals/index.rst -This document describes `libgccjit `_, an API -for embedding GCC inside programs and libraries. - -Note that libgccjit is currently of "Alpha" quality; -the APIs are not yet set in stone, and they shouldn't be used in -production yet. - Indices and tables ================== diff --git a/gcc/jit/docs/topics/contexts.rst b/gcc/jit/docs/topics/contexts.rst index d03ccf4b12d..626e7c8c7cc 100644 --- a/gcc/jit/docs/topics/contexts.rst +++ b/gcc/jit/docs/topics/contexts.rst @@ -89,7 +89,7 @@ cleanup of such objects is done for you when the context is released. Thread-safety ------------- -Instances of :c:type:`gcc_jit_object *` created via +Instances of :c:type:`gcc_jit_context *` created via :c:func:`gcc_jit_context_acquire` are independent from each other: only one thread may use a given context at once, but multiple threads could each have their own contexts without needing locks. -- 2.30.2