From 89ca1f75915463941c29777af72bedd7c0e107f4 Mon Sep 17 00:00:00 2001 From: Daniel Baumann Date: Fri, 21 Feb 2025 10:09:52 +0100 Subject: [PATCH] Adding upstream version 1.13~rc1. Signed-off-by: Daniel Baumann --- AUTHORS | 1 + COPYING | 676 ++++++++++++++++++++++++++++++++++++++++ ChangeLog | 55 ++++ INSTALL | 57 ++++ Makefile.in | 111 +++++++ NEWS | 10 + README | 34 ++ arg_parser.cc | 203 ++++++++++++ arg_parser.h | 105 +++++++ configure | 192 ++++++++++++ decoder.cc | 310 ++++++++++++++++++ decoder.h | 268 ++++++++++++++++ doc/lziprecover.1 | 71 +++++ doc/lziprecover.info | 368 ++++++++++++++++++++++ doc/lziprecover.texinfo | 397 +++++++++++++++++++++++ lzip.h | 323 +++++++++++++++++++ main.cc | 676 ++++++++++++++++++++++++++++++++++++++++ merge.cc | 406 ++++++++++++++++++++++++ repair.cc | 114 +++++++ split.cc | 176 +++++++++++ testsuite/check.sh | 103 ++++++ testsuite/test.txt | 676 ++++++++++++++++++++++++++++++++++++++++ testsuite/test_bad1.lz | Bin 0 -> 11548 bytes testsuite/test_bad2.lz | Bin 0 -> 11548 bytes testsuite/test_bad3.lz | Bin 0 -> 11548 bytes testsuite/test_bad4.lz | Bin 0 -> 11548 bytes testsuite/test_bad5.lz | Bin 0 -> 11548 bytes testsuite/test_v0.lz | Bin 0 -> 11540 bytes testsuite/test_v1.lz | Bin 0 -> 11548 bytes 29 files changed, 5332 insertions(+) create mode 100644 AUTHORS create mode 100644 COPYING create mode 100644 ChangeLog create mode 100644 INSTALL create mode 100644 Makefile.in create mode 100644 NEWS create mode 100644 README create mode 100644 arg_parser.cc create mode 100644 arg_parser.h create mode 100755 configure create mode 100644 decoder.cc create mode 100644 decoder.h create mode 100644 doc/lziprecover.1 create mode 100644 doc/lziprecover.info create mode 100644 doc/lziprecover.texinfo create mode 100644 lzip.h create mode 100644 main.cc create mode 100644 merge.cc create mode 100644 repair.cc create mode 100644 split.cc create mode 100755 testsuite/check.sh create mode 100644 testsuite/test.txt create mode 100644 testsuite/test_bad1.lz create mode 100644 testsuite/test_bad2.lz create mode 100644 testsuite/test_bad3.lz create mode 100644 testsuite/test_bad4.lz create mode 100644 testsuite/test_bad5.lz create mode 100644 testsuite/test_v0.lz create mode 100644 testsuite/test_v1.lz diff --git a/AUTHORS b/AUTHORS new file mode 100644 index 0000000..e6cadef --- /dev/null +++ b/AUTHORS @@ -0,0 +1 @@ +Lziprecover was written by Antonio Diaz Diaz. diff --git a/COPYING b/COPYING new file mode 100644 index 0000000..4432540 --- /dev/null +++ b/COPYING @@ -0,0 +1,676 @@ + + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program 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 . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. + diff --git a/ChangeLog b/ChangeLog new file mode 100644 index 0000000..15e7746 --- /dev/null +++ b/ChangeLog @@ -0,0 +1,55 @@ +2011-11-12 Antonio Diaz Diaz + + * Version 1.13-rc1 released. + * Lziprecover is now distributed in its own package. Until + version 1.12 it was included in the lzip package. + * lziprecover.cc: Renamed to main.cc. + * main.cc: Added decompressor options (-c, -d, -k, -t) so that + a external decompressor is not needed for recovery nor for + "make check". + * New files merge.cc, repair.cc and split.cc. + * merge.cc repair.cc: Remove output file if recovery fails. + * split.cc: Use Boyer-Moore algorithm to search for headers. + * testsuite/check.sh: Use `ln' instead of `cat' for input files. + +2011-04-30 Antonio Diaz Diaz + + * Version 1.12 released. + * lziprecover.cc: If `-v' is not specified show errors only. + +2010-09-16 Antonio Diaz Diaz + + * Version 1.11 released. + * lziprecover.cc: Added new option `-m, --merge' which tries to + produce a correct file merging the good parts of two or more + damaged copies. + * lziprecover.cc: Added new option `-R, --repair' for repairing + a 1-byte error in single-member files. + * decoder.cc (decode_member): Detect file errors earlier to + improve efficiency of lziprecover's new repair capability. + This change also prevents (harmless) access to uninitialized + memory when decompressing a corrupt file. + * lziprecover.cc: Added new option `-f, --force'. + * lziprecover.cc: Added new option `-o, --output'. + * lziprecover.cc: Added new option `-s, --split' to select the + until now only operation of splitting multimember files. + * lziprecover.cc: If no operation is specified, warn the user + and do nothing. + +2009-06-22 Antonio Diaz Diaz + + * Version 1.6 released. + * Added man page for lziprecover. + * testsuite/check.sh: Test lziprecover. + +2009-01-24 Antonio Diaz Diaz + + * Version 1.4 released. + * Added `lziprecover', a member recoverer program. + + +Copyright (C) 2009, 2010, 2011 Antonio Diaz Diaz. + +This file is a collection of facts, and thus it is not copyrightable, +but just in case, you have unlimited permission to copy, distribute and +modify it. diff --git a/INSTALL b/INSTALL new file mode 100644 index 0000000..c2a3dcc --- /dev/null +++ b/INSTALL @@ -0,0 +1,57 @@ +Requirements +------------ +You will need a C++ compiler. +I use gcc 4.3.5 and 3.3.6, but the code should compile with any +standards compliant compiler. +Gcc is available at http://gcc.gnu.org. + + +Procedure +--------- +1. Unpack the archive if you have not done so already: + + lzip -cd lziprecover[version].tar.lz | tar -xf - +or + gzip -cd lziprecover[version].tar.gz | tar -xf - + +This creates the directory ./lziprecover[version] containing the source +from the main archive. + +2. Change to lziprecover directory and run configure. + (Try `configure --help' for usage instructions). + + cd lziprecover[version] + ./configure + +3. Run make. + + make + +4. Optionally, type `make check' to run the tests that come with + lziprecover. + +5. Type `make install' to install the programs and any data files and + documentation. + + +Another way +----------- +You can also compile lziprecover into a separate directory. To do this, +you must use a version of `make' that supports the `VPATH' variable, +such as GNU `make'. `cd' to the directory where you want the object +files and executables to go and run the `configure' script. `configure' +automatically checks for the source code in `.', in `..' and in the +directory that `configure' is in. + +`configure' recognizes the option `--srcdir=DIR' to control where to +look for the sources. Usually `configure' can determine that directory +automatically. + +After running `configure', you can run `make' and `make install' as +explained above. + + +Copyright (C) 2009, 2010, 2011 Antonio Diaz Diaz. + +This file is free documentation: you have unlimited permission to copy, +distribute and modify it. diff --git a/Makefile.in b/Makefile.in new file mode 100644 index 0000000..6c12f88 --- /dev/null +++ b/Makefile.in @@ -0,0 +1,111 @@ + +DISTNAME = $(pkgname)-$(pkgversion) +INSTALL = install +INSTALL_PROGRAM = $(INSTALL) -p -m 755 +INSTALL_DATA = $(INSTALL) -p -m 644 +INSTALL_DIR = $(INSTALL) -d -m 755 +SHELL = /bin/sh + +objs = arg_parser.o decoder.o merge.o repair.o split.o main.o + + +.PHONY : all install install-info install-man install-strip \ + uninstall uninstall-info uninstall-man \ + doc info man check dist clean distclean + +all : $(progname) + +$(progname) : $(objs) + $(CXX) $(LDFLAGS) -o $@ $(objs) + +$(progname)_profiled : $(objs) + $(CXX) $(LDFLAGS) -pg -o $@ $(objs) + +main.o : main.cc + $(CXX) $(CPPFLAGS) $(CXXFLAGS) -DPROGVERSION=\"$(pkgversion)\" -c -o $@ $< + +%.o : %.cc + $(CXX) $(CPPFLAGS) $(CXXFLAGS) -c -o $@ $< + +$(objs) : Makefile +arg_parser.o : arg_parser.h +decoder.o : lzip.h decoder.h +main.o : arg_parser.h lzip.h decoder.h +merge.o : lzip.h decoder.h +repair.o : lzip.h +split.o : lzip.h + + +doc : info man + +info : $(VPATH)/doc/$(pkgname).info + +$(VPATH)/doc/$(pkgname).info : $(VPATH)/doc/$(pkgname).texinfo + cd $(VPATH)/doc && makeinfo $(pkgname).texinfo + +man : $(VPATH)/doc/$(progname).1 + +$(VPATH)/doc/$(progname).1 : $(progname) + help2man -n 'recovers data from damaged lzip files' \ + -o $@ ./$(progname) + +Makefile : $(VPATH)/configure $(VPATH)/Makefile.in + ./config.status + +check : all + @$(VPATH)/testsuite/check.sh $(VPATH)/testsuite $(pkgversion) + +install : all install-info install-man + if [ ! -d "$(DESTDIR)$(bindir)" ] ; then $(INSTALL_DIR) "$(DESTDIR)$(bindir)" ; fi + $(INSTALL_PROGRAM) ./$(progname) "$(DESTDIR)$(bindir)/$(progname)" + +install-info : + if [ ! -d "$(DESTDIR)$(infodir)" ] ; then $(INSTALL_DIR) "$(DESTDIR)$(infodir)" ; fi + $(INSTALL_DATA) $(VPATH)/doc/$(pkgname).info "$(DESTDIR)$(infodir)/$(pkgname).info" + -install-info --info-dir="$(DESTDIR)$(infodir)" $(DESTDIR)$(infodir)/$(pkgname).info + +install-man : + if [ ! -d "$(DESTDIR)$(mandir)/man1" ] ; then $(INSTALL_DIR) "$(DESTDIR)$(mandir)/man1" ; fi + $(INSTALL_DATA) $(VPATH)/doc/$(progname).1 "$(DESTDIR)$(mandir)/man1/$(progname).1" + +install-strip : all + $(MAKE) INSTALL_PROGRAM='$(INSTALL_PROGRAM) -s' install + +uninstall : uninstall-info uninstall-man + -rm -f "$(DESTDIR)$(bindir)/$(progname)" + +uninstall-info : + -install-info --info-dir="$(DESTDIR)$(infodir)" --remove "$(DESTDIR)$(infodir)/$(pkgname).info" + -rm -f "$(DESTDIR)$(infodir)/$(pkgname).info" + +uninstall-man : + -rm -f "$(DESTDIR)$(mandir)/man1/$(progname).1" + +dist : doc + ln -sf $(VPATH) $(DISTNAME) + tar -cvf $(DISTNAME).tar \ + $(DISTNAME)/AUTHORS \ + $(DISTNAME)/COPYING \ + $(DISTNAME)/ChangeLog \ + $(DISTNAME)/INSTALL \ + $(DISTNAME)/Makefile.in \ + $(DISTNAME)/NEWS \ + $(DISTNAME)/README \ + $(DISTNAME)/configure \ + $(DISTNAME)/doc/$(progname).1 \ + $(DISTNAME)/doc/$(pkgname).info \ + $(DISTNAME)/doc/$(pkgname).texinfo \ + $(DISTNAME)/testsuite/check.sh \ + $(DISTNAME)/testsuite/test.txt \ + $(DISTNAME)/testsuite/test_bad[1-5].lz \ + $(DISTNAME)/testsuite/test_v[01].lz \ + $(DISTNAME)/*.h \ + $(DISTNAME)/*.cc + rm -f $(DISTNAME) + lzip -v -9 $(DISTNAME).tar + +clean : + -rm -f $(progname) $(progname)_profiled $(objs) + +distclean : clean + -rm -f Makefile config.status *.tar *.tar.lz diff --git a/NEWS b/NEWS new file mode 100644 index 0000000..12d88ed --- /dev/null +++ b/NEWS @@ -0,0 +1,10 @@ +Changes in version 1.13: + +Lziprecover is now distributed in its own package. Until version 1.12 it +was included in the lzip package. + +Decompressor options (-c, -d, -k, -t) have been implemented in +lziprecover so that a external decompressor is not needed for recovery +nor for "make check". + +"--merge" and "--repair" now remove the output file if recovery fails. diff --git a/README b/README new file mode 100644 index 0000000..7d390e6 --- /dev/null +++ b/README @@ -0,0 +1,34 @@ +Description + +Lziprecover is a data recovery tool and decompressor for files in the +lzip compressed data format (.lz) able to repair slightly damaged files, +recover badly damaged files from two or more copies, extract undamaged +members from multi-member files, decompress files and test integrity of +files. + +Lziprecover is able to recover or decompress files produced by any of +the compressors in the lzip family; lzip, plzip, minilzip/lzlib, clzip +and pdlzip. This recovery capability contributes to make the lzip format +one of the best options for long-term data archiving. + +When recovering data, lziprecover takes as arguments the names of the +damaged files and writes zero or more recovered files depending on the +operation selected and whether the recovery succeeded or not. The +damaged files themselves are never modified. + +When decompressing or testing file integrity, lziprecover behaves like +lzip or lunzip. + +If the files are too damaged for lziprecover to repair them, data from +damaged members can be partially recovered writing it to stdout. + +To give you an idea of its possibilities, when merging two copies each +of them with one damaged area affecting 1 percent of the copy, the +probability of obtaining a correct file is about 98 percent. With three +such copies the probability rises to 99.97 percent. For large files with +small errors, the probability approaches 100 percent even with only two +copies. + +If the cause of file corruption is damaged media, the combination +GNU ddrescue + lziprecover is the best option for recovering data from +multiple damaged copies. diff --git a/arg_parser.cc b/arg_parser.cc new file mode 100644 index 0000000..bc4b4a3 --- /dev/null +++ b/arg_parser.cc @@ -0,0 +1,203 @@ +/* Arg_parser - POSIX/GNU command line argument parser. (C++ version) + Copyright (C) 2006, 2007, 2008, 2009, 2010, 2011 Antonio Diaz Diaz. + + This library 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 library 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 library. If not, see . + + As a special exception, you may use this file as part of a free + software library without restriction. Specifically, if other files + instantiate templates or use macros or inline functions from this + file, or you compile this file and link it with other files to + produce an executable, this file does not by itself cause the + resulting executable to be covered by the GNU General Public + License. This exception does not however invalidate any other + reasons why the executable file might be covered by the GNU General + Public License. +*/ + +#include +#include +#include + +#include "arg_parser.h" + + +bool Arg_parser::parse_long_option( const char * const opt, const char * const arg, + const Option options[], int & argind ) + { + unsigned int len; + int index = -1; + bool exact = false, ambig = false; + + for( len = 0; opt[len+2] && opt[len+2] != '='; ++len ) ; + + // Test all long options for either exact match or abbreviated matches. + for( int i = 0; options[i].code != 0; ++i ) + if( options[i].name && !std::strncmp( options[i].name, &opt[2], len ) ) + { + if( std::strlen( options[i].name ) == len ) // Exact match found + { index = i; exact = true; break; } + else if( index < 0 ) index = i; // First nonexact match found + else if( options[index].code != options[i].code || + options[index].has_arg != options[i].has_arg ) + ambig = true; // Second or later nonexact match found + } + + if( ambig && !exact ) + { + error_ = "option `"; error_ += opt; error_ += "' is ambiguous"; + return false; + } + + if( index < 0 ) // nothing found + { + error_ = "unrecognized option `"; error_ += opt; error_ += '\''; + return false; + } + + ++argind; + data.push_back( Record( options[index].code ) ); + + if( opt[len+2] ) // `--=' syntax + { + if( options[index].has_arg == no ) + { + error_ = "option `--"; error_ += options[index].name; + error_ += "' doesn't allow an argument"; + return false; + } + if( options[index].has_arg == yes && !opt[len+3] ) + { + error_ = "option `--"; error_ += options[index].name; + error_ += "' requires an argument"; + return false; + } + data.back().argument = &opt[len+3]; + return true; + } + + if( options[index].has_arg == yes ) + { + if( !arg || !arg[0] ) + { + error_ = "option `--"; error_ += options[index].name; + error_ += "' requires an argument"; + return false; + } + ++argind; data.back().argument = arg; + return true; + } + + return true; + } + + +bool Arg_parser::parse_short_option( const char * const opt, const char * const arg, + const Option options[], int & argind ) + { + int cind = 1; // character index in opt + + while( cind > 0 ) + { + int index = -1; + const unsigned char c = opt[cind]; + + if( c != 0 ) + for( int i = 0; options[i].code; ++i ) + if( c == options[i].code ) + { index = i; break; } + + if( index < 0 ) + { + error_ = "invalid option -- "; error_ += c; + return false; + } + + data.push_back( Record( c ) ); + if( opt[++cind] == 0 ) { ++argind; cind = 0; } // opt finished + + if( options[index].has_arg != no && cind > 0 && opt[cind] ) + { + data.back().argument = &opt[cind]; ++argind; cind = 0; + } + else if( options[index].has_arg == yes ) + { + if( !arg || !arg[0] ) + { + error_ = "option requires an argument -- "; error_ += c; + return false; + } + data.back().argument = arg; ++argind; cind = 0; + } + } + return true; + } + + +Arg_parser::Arg_parser( const int argc, const char * const argv[], + const Option options[], const bool in_order ) + { + if( argc < 2 || !argv || !options ) return; + + std::vector< std::string > non_options; // skipped non-options + int argind = 1; // index in argv + + while( argind < argc ) + { + const unsigned char ch1 = argv[argind][0]; + const unsigned char ch2 = ( ch1 ? argv[argind][1] : 0 ); + + if( ch1 == '-' && ch2 ) // we found an option + { + const char * const opt = argv[argind]; + const char * const arg = (argind + 1 < argc) ? argv[argind+1] : 0; + if( ch2 == '-' ) + { + if( !argv[argind][2] ) { ++argind; break; } // we found "--" + else if( !parse_long_option( opt, arg, options, argind ) ) break; + } + else if( !parse_short_option( opt, arg, options, argind ) ) break; + } + else + { + if( !in_order ) non_options.push_back( argv[argind++] ); + else { data.push_back( Record() ); data.back().argument = argv[argind++]; } + } + } + if( error_.size() ) data.clear(); + else + { + for( unsigned int i = 0; i < non_options.size(); ++i ) + { data.push_back( Record() ); data.back().argument.swap( non_options[i] ); } + while( argind < argc ) + { data.push_back( Record() ); data.back().argument = argv[argind++]; } + } + } + + +Arg_parser::Arg_parser( const char * const opt, const char * const arg, + const Option options[] ) + { + if( !opt || !opt[0] || !options ) return; + + if( opt[0] == '-' && opt[1] ) // we found an option + { + int argind = 1; // dummy + if( opt[1] == '-' ) + { if( opt[2] ) parse_long_option( opt, arg, options, argind ); } + else + parse_short_option( opt, arg, options, argind ); + if( error_.size() ) data.clear(); + } + else { data.push_back( Record() ); data.back().argument = opt; } + } diff --git a/arg_parser.h b/arg_parser.h new file mode 100644 index 0000000..d1e5c02 --- /dev/null +++ b/arg_parser.h @@ -0,0 +1,105 @@ +/* Arg_parser - POSIX/GNU command line argument parser. (C++ version) + Copyright (C) 2006, 2007, 2008, 2009, 2010, 2011 Antonio Diaz Diaz. + + This library 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 library 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 library. If not, see . + + As a special exception, you may use this file as part of a free + software library without restriction. Specifically, if other files + instantiate templates or use macros or inline functions from this + file, or you compile this file and link it with other files to + produce an executable, this file does not by itself cause the + resulting executable to be covered by the GNU General Public + License. This exception does not however invalidate any other + reasons why the executable file might be covered by the GNU General + Public License. +*/ + +/* Arg_parser reads the arguments in `argv' and creates a number of + option codes, option arguments and non-option arguments. + + In case of error, `error' returns a non-empty error message. + + `options' is an array of `struct Option' terminated by an element + containing a code which is zero. A null name means a short-only + option. A code value outside the unsigned char range means a + long-only option. + + Arg_parser normally makes it appear as if all the option arguments + were specified before all the non-option arguments for the purposes + of parsing, even if the user of your program intermixed option and + non-option arguments. If you want the arguments in the exact order + the user typed them, call `Arg_parser' with `in_order' = true. + + The argument `--' terminates all options; any following arguments are + treated as non-option arguments, even if they begin with a hyphen. + + The syntax for optional option arguments is `-' + (without whitespace), or `--='. +*/ + +class Arg_parser + { +public: + enum Has_arg { no, yes, maybe }; + + struct Option + { + int code; // Short option letter or code ( code != 0 ) + const char * name; // Long option name (maybe null) + Has_arg has_arg; + }; + +private: + struct Record + { + int code; + std::string argument; + Record( const int c = 0 ) : code( c ) {} + }; + + std::string error_; + std::vector< Record > data; + + bool parse_long_option( const char * const opt, const char * const arg, + const Option options[], int & argind ); + bool parse_short_option( const char * const opt, const char * const arg, + const Option options[], int & argind ); + +public: + Arg_parser( const int argc, const char * const argv[], + const Option options[], const bool in_order = false ); + + // Restricted constructor. Parses a single token and argument (if any) + Arg_parser( const char * const opt, const char * const arg, + const Option options[] ); + + const std::string & error() const throw() { return error_; } + + // The number of arguments parsed (may be different from argc) + int arguments() const throw() { return data.size(); } + + // If code( i ) is 0, argument( i ) is a non-option. + // Else argument( i ) is the option's argument (or empty). + int code( const int i ) const throw() + { + if( i >= 0 && i < arguments() ) return data[i].code; + else return 0; + } + + const std::string & argument( const int i ) const throw() + { + if( i >= 0 && i < arguments() ) return data[i].argument; + else return error_; + } + }; diff --git a/configure b/configure new file mode 100755 index 0000000..43bf621 --- /dev/null +++ b/configure @@ -0,0 +1,192 @@ +#! /bin/sh +# configure script for Lziprecover - Data recovery tool for lzipped files +# Copyright (C) 2009, 2010, 2011 Antonio Diaz Diaz. +# +# This configure script is free software: you have unlimited permission +# to copy, distribute and modify it. + +args= +no_create= +pkgname=lziprecover +pkgversion=1.13-rc1 +progname=lziprecover +srctrigger=lzip.h + +# clear some things potentially inherited from environment. +LC_ALL=C +export LC_ALL +srcdir= +prefix=/usr/local +exec_prefix='$(prefix)' +bindir='$(exec_prefix)/bin' +datadir='$(prefix)/share' +infodir='$(datadir)/info' +mandir='$(datadir)/man' +sysconfdir='$(prefix)/etc' +CXX= +CPPFLAGS= +CXXFLAGS='-Wall -W -O2' +LDFLAGS= + +# Loop over all args +while [ -n "$1" ] ; do + + # Get the first arg, and shuffle + option=$1 + shift + + # Add the argument quoted to args + args="${args} \"${option}\"" + + # Split out the argument for options that take them + case ${option} in + *=*) optarg=`echo ${option} | sed -e 's,^[^=]*=,,'` ;; + esac + + # Process the options + case ${option} in + --help | --he* | -h) + echo "Usage: configure [options]" + echo + echo "Options: [defaults in brackets]" + echo " -h, --help display this help and exit" + echo " -V, --version output version information and exit" + echo " --srcdir=DIR find the sources in DIR [. or ..]" + echo " --prefix=DIR install into DIR [${prefix}]" + echo " --exec-prefix=DIR base directory for arch-dependent files [${exec_prefix}]" + echo " --bindir=DIR user executables directory [${bindir}]" + echo " --datadir=DIR base directory for doc and data [${datadir}]" + echo " --infodir=DIR info files directory [${infodir}]" + echo " --mandir=DIR man pages directory [${mandir}]" + echo " --sysconfdir=DIR read-only single-machine data directory [${sysconfdir}]" + echo " CXX=COMPILER C++ compiler to use [g++]" + echo " CPPFLAGS=OPTIONS command line options for the preprocessor [${CPPFLAGS}]" + echo " CXXFLAGS=OPTIONS command line options for the C++ compiler [${CXXFLAGS}]" + echo " LDFLAGS=OPTIONS command line options for the linker [${LDFLAGS}]" + echo + exit 0 ;; + --version | --ve* | -V) + echo "Configure script for ${pkgname} version ${pkgversion}" + exit 0 ;; + --srcdir* | --sr*) + srcdir=`echo ${optarg} | sed -e 's,/$,,'` ;; + --prefix* | --pr*) + prefix=`echo ${optarg} | sed -e 's,/$,,'` ;; + --exec-prefix* | --ex*) + exec_prefix=`echo ${optarg} | sed -e 's,/$,,'` ;; + --bindir* | --bi*) + bindir=`echo ${optarg} | sed -e 's,/$,,'` ;; + --datadir* | --da*) + datadir=`echo ${optarg} | sed -e 's,/$,,'` ;; + --infodir* | --inf*) + infodir=`echo ${optarg} | sed -e 's,/$,,'` ;; + --mandir* | --ma*) + mandir=`echo ${optarg} | sed -e 's,/$,,'` ;; + --sysconfdir* | --sy*) + sysconfdir=`echo ${optarg} | sed -e 's,/$,,'` ;; + --no-create | --no-c*) + no_create=yes ;; + + CXX=*) CXX=${optarg} ;; + CPPFLAGS=*) CPPFLAGS=${optarg} ;; + CXXFLAGS=*) CXXFLAGS=${optarg} ;; + LDFLAGS=*) LDFLAGS=${optarg} ;; + + --* | *=* | *-*-*) ;; + *) + echo "configure: Unrecognized option: \"${option}\"; use --help for usage." 1>&2 + exit 1 ;; + esac +done + +# Find the source files, if location was not specified. +srcdirtext= +if [ -z "${srcdir}" ] ; then + srcdirtext="or . or .." ; srcdir=. + if [ ! -r ${srcdir}/${srctrigger} ] ; then srcdir=.. ; fi + if [ ! -r ${srcdir}/${srctrigger} ] ; then + ## the sed command below emulates the dirname command + srcdir=`echo $0 | sed -e 's,[^/]*$,,;s,/$,,;s,^$,.,'` + fi +fi + +if [ ! -r ${srcdir}/${srctrigger} ] ; then + exec 1>&2 + echo + echo "configure: Can't find sources in ${srcdir} ${srcdirtext}" + echo "configure: (At least ${srctrigger} is missing)." + exit 1 +fi + +# Set srcdir to . if that's what it is. +if [ "`pwd`" = "`cd ${srcdir} ; pwd`" ] ; then srcdir=. ; fi + +# checking whether we are using GNU C++. +if [ -z "${CXX}" ] ; then # Let the user override the test. + if [ -x /bin/g++ ] || + [ -x /usr/bin/g++ ] || + [ -x /usr/local/bin/g++ ] ; then + CXX="g++" + else + CXX="c++" + fi +fi + +echo +if [ -z "${no_create}" ] ; then + echo "creating config.status" + rm -f config.status + cat > config.status << EOF +#! /bin/sh +# This file was generated automatically by configure. Do not edit. +# Run this file to recreate the current configuration. +# +# This script is free software: you have unlimited permission +# to copy, distribute and modify it. + +exec /bin/sh $0 ${args} --no-create +EOF + chmod +x config.status +fi + +echo "creating Makefile" +echo "VPATH = ${srcdir}" +echo "prefix = ${prefix}" +echo "exec_prefix = ${exec_prefix}" +echo "bindir = ${bindir}" +echo "datadir = ${datadir}" +echo "infodir = ${infodir}" +echo "mandir = ${mandir}" +echo "sysconfdir = ${sysconfdir}" +echo "CXX = ${CXX}" +echo "CPPFLAGS = ${CPPFLAGS}" +echo "CXXFLAGS = ${CXXFLAGS}" +echo "LDFLAGS = ${LDFLAGS}" +rm -f Makefile +cat > Makefile << EOF +# Makefile for Lziprecover - Data recovery tool for lzipped files +# Copyright (C) 2009, 2010, 2011 Antonio Diaz Diaz. +# This file was generated automatically by configure. Do not edit. +# +# This Makefile is free software: you have unlimited permission +# to copy, distribute and modify it. + +pkgname = ${pkgname} +pkgversion = ${pkgversion} +progname = ${progname} +VPATH = ${srcdir} +prefix = ${prefix} +exec_prefix = ${exec_prefix} +bindir = ${bindir} +datadir = ${datadir} +infodir = ${infodir} +mandir = ${mandir} +sysconfdir = ${sysconfdir} +CXX = ${CXX} +CPPFLAGS = ${CPPFLAGS} +CXXFLAGS = ${CXXFLAGS} +LDFLAGS = ${LDFLAGS} +EOF +cat ${srcdir}/Makefile.in >> Makefile + +echo "OK. Now you can run make." diff --git a/decoder.cc b/decoder.cc new file mode 100644 index 0000000..b9fc3d8 --- /dev/null +++ b/decoder.cc @@ -0,0 +1,310 @@ +/* Lziprecover - Data recovery tool for lzipped files + Copyright (C) 2009, 2010, 2011 Antonio Diaz Diaz. + + This program 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 . +*/ + +#define _FILE_OFFSET_BITS 64 + +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#include "lzip.h" +#include "decoder.h" + + +const CRC32 crc32; + + +void Pretty_print::operator()( const char * const msg ) const throw() + { + if( verbosity_ >= 0 ) + { + if( first_post ) + { + first_post = false; + std::fprintf( stderr, " %s: ", name_.c_str() ); + for( unsigned int i = 0; i < longest_name - name_.size(); ++i ) + std::fprintf( stderr, " " ); + if( !msg ) std::fflush( stderr ); + } + if( msg ) std::fprintf( stderr, "%s.\n", msg ); + } + } + + +// Returns the number of bytes really read. +// If (returned value < size) and (errno == 0), means EOF was reached. +// +int readblock( const int fd, uint8_t * const buf, const int size ) throw() + { + int rest = size; + errno = 0; + while( rest > 0 ) + { + errno = 0; + const int n = read( fd, buf + size - rest, rest ); + if( n > 0 ) rest -= n; + else if( n == 0 ) break; + else if( errno != EINTR && errno != EAGAIN ) break; + } + return ( rest > 0 ) ? size - rest : size; + } + + +// Returns the number of bytes really written. +// If (returned value < size), it is always an error. +// +int writeblock( const int fd, const uint8_t * const buf, const int size ) throw() + { + int rest = size; + errno = 0; + while( rest > 0 ) + { + errno = 0; + const int n = write( fd, buf + size - rest, rest ); + if( n > 0 ) rest -= n; + else if( errno && errno != EINTR && errno != EAGAIN ) break; + } + return ( rest > 0 ) ? size - rest : size; + } + + +bool Range_decoder::read_block() + { + if( !at_stream_end ) + { + stream_pos = readblock( infd, buffer, buffer_size ); + if( stream_pos != buffer_size && errno ) throw Error( "Read error" ); + at_stream_end = ( stream_pos < buffer_size ); + partial_member_pos += pos; + pos = 0; + } + return pos < stream_pos; + } + + +void LZ_decoder::flush_data() + { + const int size = pos - stream_pos; + if( size > 0 ) + { + crc32.update( crc_, buffer + stream_pos, size ); + if( outfd >= 0 && + writeblock( outfd, buffer + stream_pos, size ) != size ) + throw Error( "Write error" ); + if( pos >= buffer_size ) { partial_data_pos += pos; pos = 0; } + stream_pos = pos; + } + } + + +bool LZ_decoder::verify_trailer( const Pretty_print & pp ) const + { + File_trailer trailer; + const int trailer_size = File_trailer::size( member_version ); + const long long member_size = range_decoder.member_position() + trailer_size; + bool error = false; + + for( int i = 0; i < trailer_size && !error; ++i ) + { + if( !range_decoder.finished() ) + trailer.data[i] = range_decoder.get_byte(); + else + { + error = true; + if( pp.verbosity() >= 0 ) + { + pp(); + std::fprintf( stderr, "Trailer truncated at trailer position %d;" + " some checks may fail.\n", i ); + } + for( ; i < trailer_size; ++i ) trailer.data[i] = 0; + } + } + if( member_version == 0 ) trailer.member_size( member_size ); + if( !range_decoder.code_is_zero() ) + { + error = true; + pp( "Range decoder final code is not zero" ); + } + if( trailer.data_crc() != crc() ) + { + error = true; + if( pp.verbosity() >= 0 ) + { + pp(); + std::fprintf( stderr, "CRC mismatch; trailer says %08X, data CRC is %08X.\n", + (unsigned int)trailer.data_crc(), (unsigned int)crc() ); + } + } + if( trailer.data_size() != data_position() ) + { + error = true; + if( pp.verbosity() >= 0 ) + { + pp(); + std::fprintf( stderr, "Data size mismatch; trailer says %lld, data size is %lld (0x%llX).\n", + trailer.data_size(), data_position(), data_position() ); + } + } + if( trailer.member_size() != member_size ) + { + error = true; + if( pp.verbosity() >= 0 ) + { + pp(); + std::fprintf( stderr, "Member size mismatch; trailer says %lld, member size is %lld (0x%llX).\n", + trailer.member_size(), member_size, member_size ); + } + } + if( !error && pp.verbosity() >= 3 && data_position() > 0 && member_size > 0 ) + std::fprintf( stderr, "%6.3f:1, %6.3f bits/byte, %5.2f%% saved. ", + (double)data_position() / member_size, + ( 8.0 * member_size ) / data_position(), + 100.0 * ( 1.0 - ( (double)member_size / data_position() ) ) ); + if( !error && pp.verbosity() >= 4 ) + std::fprintf( stderr, "data CRC %08X, data size %9lld, member size %8lld. ", + (unsigned int)trailer.data_crc(), trailer.data_size(), + trailer.member_size() ); + return !error; + } + + +// Return value: 0 = OK, 1 = decoder error, 2 = unexpected EOF, +// 3 = trailer error, 4 = unknown marker found. +int LZ_decoder::decode_member( const Pretty_print & pp ) + { + Bit_model bm_match[State::states][pos_states]; + Bit_model bm_rep[State::states]; + Bit_model bm_rep0[State::states]; + Bit_model bm_rep1[State::states]; + Bit_model bm_rep2[State::states]; + Bit_model bm_len[State::states][pos_states]; + Bit_model bm_dis_slot[max_dis_states][1<> 1 ) - 1; + rep0 = ( 2 | ( dis_slot & 1 ) ) << direct_bits; + if( dis_slot < end_dis_model ) + rep0 += range_decoder.decode_tree_reversed( bm_dis + rep0 - dis_slot, direct_bits ); + else + { + rep0 += range_decoder.decode( direct_bits - dis_align_bits ) << dis_align_bits; + rep0 += range_decoder.decode_tree_reversed( bm_align, dis_align_bits ); + if( rep0 == 0xFFFFFFFFU ) // Marker found + { + rep0 = rep0_saved; + range_decoder.normalize(); + flush_data(); + if( len == min_match_len ) // End Of Stream marker + { + if( verify_trailer( pp ) ) return 0; else return 3; + } + if( len == min_match_len + 1 ) // Sync Flush marker + { + range_decoder.load(); continue; + } + if( pp.verbosity() >= 0 ) + { + pp(); + std::fprintf( stderr, "Unsupported marker code `%d'.\n", len ); + } + return 4; + } + } + } + rep3 = rep2; rep2 = rep1; rep1 = rep0_saved; + state.set_match(); + if( rep0 >= (unsigned int)dictionary_size || + ( rep0 >= (unsigned int)pos && !partial_data_pos ) ) + { flush_data(); return 1; } + } + copy_block( rep0, len ); + } + } + } diff --git a/decoder.h b/decoder.h new file mode 100644 index 0000000..3b5dc7d --- /dev/null +++ b/decoder.h @@ -0,0 +1,268 @@ +/* Lziprecover - Data recovery tool for lzipped files + Copyright (C) 2009, 2010, 2011 Antonio Diaz Diaz. + + This program 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 . +*/ + +class Range_decoder + { + enum { buffer_size = 16384 }; + long long partial_member_pos; + uint8_t * const buffer; // input buffer + int pos; // current pos in buffer + int stream_pos; // when reached, a new block must be read + uint32_t code; + uint32_t range; + const int infd; // input file descriptor + bool at_stream_end; + + bool read_block(); + +public: + Range_decoder( const int ifd ) + : + partial_member_pos( 0 ), + buffer( new uint8_t[buffer_size] ), + pos( 0 ), + stream_pos( 0 ), + code( 0 ), + range( 0xFFFFFFFFU ), + infd( ifd ), + at_stream_end( false ) {} + + ~Range_decoder() { delete[] buffer; } + + bool code_is_zero() const throw() { return ( code == 0 ); } + bool finished() { return pos >= stream_pos && !read_block(); } + long long member_position() const throw() + { return partial_member_pos + pos; } + void reset_member_position() throw() + { partial_member_pos = -pos; } + + uint8_t get_byte() + { + if( finished() ) return 0x55; // make code != 0 + return buffer[pos++]; + } + + void load() + { + code = 0; + range = 0xFFFFFFFFU; + for( int i = 0; i < 5; ++i ) code = (code << 8) | get_byte(); + } + + void normalize() + { + if( range <= 0x00FFFFFFU ) + { range <<= 8; code = (code << 8) | get_byte(); } + } + + int decode( const int num_bits ) + { + int symbol = 0; + for( int i = num_bits; i > 0; --i ) + { + symbol <<= 1; + if( range <= 0x00FFFFFFU ) + { + range <<= 7; code = (code << 8) | get_byte(); + if( code >= range ) { code -= range; symbol |= 1; } + } + else + { + range >>= 1; + if( code >= range ) { code -= range; symbol |= 1; } + } + } + return symbol; + } + + int decode_bit( Bit_model & bm ) + { + normalize(); + const uint32_t bound = ( range >> bit_model_total_bits ) * bm.probability; + if( code < bound ) + { + range = bound; + bm.probability += (bit_model_total - bm.probability) >> bit_model_move_bits; + return 0; + } + else + { + range -= bound; + code -= bound; + bm.probability -= bm.probability >> bit_model_move_bits; + return 1; + } + } + + int decode_tree( Bit_model bm[], const int num_bits ) + { + int model = 1; + for( int i = num_bits; i > 0; --i ) + model = ( model << 1 ) | decode_bit( bm[model] ); + return model - (1 << num_bits); + } + + int decode_tree_reversed( Bit_model bm[], const int num_bits ) + { + int model = 1; + int symbol = 0; + for( int i = 0; i < num_bits; ++i ) + { + const int bit = decode_bit( bm[model] ); + model <<= 1; + if( bit ) { model |= 1; symbol |= (1 << i); } + } + return symbol; + } + + int decode_matched( Bit_model bm[], const int match_byte ) + { + Bit_model * const bm1 = bm + 0x100; + int symbol = 1; + for( int i = 7; i >= 0; --i ) + { + const int match_bit = ( match_byte >> i ) & 1; + const int bit = decode_bit( bm1[(match_bit<<8)+symbol] ); + symbol = ( symbol << 1 ) | bit; + if( match_bit != bit ) + { + while( --i >= 0 ) + symbol = ( symbol << 1 ) | decode_bit( bm[symbol] ); + break; + } + } + return symbol & 0xFF; + } + }; + + +class Len_decoder + { + Bit_model choice1; + Bit_model choice2; + Bit_model bm_low[pos_states][len_low_symbols]; + Bit_model bm_mid[pos_states][len_mid_symbols]; + Bit_model bm_high[len_high_symbols]; + +public: + int decode( Range_decoder & range_decoder, const int pos_state ) + { + if( range_decoder.decode_bit( choice1 ) == 0 ) + return range_decoder.decode_tree( bm_low[pos_state], len_low_bits ); + if( range_decoder.decode_bit( choice2 ) == 0 ) + return len_low_symbols + + range_decoder.decode_tree( bm_mid[pos_state], len_mid_bits ); + return len_low_symbols + len_mid_symbols + + range_decoder.decode_tree( bm_high, len_high_bits ); + } + }; + + +class Literal_decoder + { + Bit_model bm_literal[1<> ( 8 - literal_context_bits ) ); } + +public: + uint8_t decode( Range_decoder & range_decoder, const uint8_t prev_byte ) + { return range_decoder.decode_tree( bm_literal[lstate(prev_byte)], 8 ); } + + uint8_t decode_matched( Range_decoder & range_decoder, + const uint8_t prev_byte, const uint8_t match_byte ) + { return range_decoder.decode_matched( bm_literal[lstate(prev_byte)], + match_byte ); } + }; + + +class LZ_decoder + { + long long partial_data_pos; + const int dictionary_size; + const int buffer_size; + uint8_t * const buffer; // output buffer + int pos; // current pos in buffer + int stream_pos; // first byte not yet written to file + uint32_t crc_; + const int outfd; // output file descriptor + const int member_version; + Range_decoder & range_decoder; + + void flush_data(); + bool verify_trailer( const Pretty_print & pp ) const; + + uint8_t get_prev_byte() const throw() + { + const int i = ( ( pos > 0 ) ? pos : buffer_size ) - 1; + return buffer[i]; + } + + uint8_t get_byte( const int distance ) const throw() + { + int i = pos - distance - 1; + if( i < 0 ) i += buffer_size; + return buffer[i]; + } + + void put_byte( const uint8_t b ) + { + buffer[pos] = b; + if( ++pos >= buffer_size ) flush_data(); + } + + void copy_block( const int distance, int len ) + { + int i = pos - distance - 1; + if( i < 0 ) i += buffer_size; + if( len < buffer_size - std::max( pos, i ) && len <= std::abs( pos - i ) ) + { + std::memcpy( buffer + pos, buffer + i, len ); + pos += len; + } + else for( ; len > 0; --len ) + { + buffer[pos] = buffer[i]; + if( ++pos >= buffer_size ) flush_data(); + if( ++i >= buffer_size ) i = 0; + } + } + +public: + LZ_decoder( const File_header & header, Range_decoder & rdec, const int ofd ) + : + partial_data_pos( 0 ), + dictionary_size( header.dictionary_size() ), + buffer_size( std::max( 65536, dictionary_size ) ), + buffer( new uint8_t[buffer_size] ), + pos( 0 ), + stream_pos( 0 ), + crc_( 0xFFFFFFFFU ), + outfd( ofd ), + member_version( header.version() ), + range_decoder( rdec ) + { buffer[buffer_size-1] = 0; } // prev_byte of first_byte + + ~LZ_decoder() { delete[] buffer; } + + uint32_t crc() const throw() { return crc_ ^ 0xFFFFFFFFU; } + + long long data_position() const throw() + { return partial_data_pos + pos; } + + int decode_member( const Pretty_print & pp ); + }; diff --git a/doc/lziprecover.1 b/doc/lziprecover.1 new file mode 100644 index 0000000..495de0b --- /dev/null +++ b/doc/lziprecover.1 @@ -0,0 +1,71 @@ +.\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.37.1. +.TH LZIPRECOVER "1" "November 2011" "Lziprecover 1.13-rc1" "User Commands" +.SH NAME +Lziprecover \- recovers data from damaged lzip files +.SH SYNOPSIS +.B lziprecover +[\fIoptions\fR] [\fIfiles\fR] +.SH DESCRIPTION +Lziprecover \- Data recovery tool and decompressor for lzipped files. +.SH OPTIONS +.TP +\fB\-h\fR, \fB\-\-help\fR +display this help and exit +.TP +\fB\-V\fR, \fB\-\-version\fR +output version information and exit +.TP +\fB\-c\fR, \fB\-\-stdout\fR +send decompressed output to standard output +.TP +\fB\-d\fR, \fB\-\-decompress\fR +decompress +.TP +\fB\-f\fR, \fB\-\-force\fR +overwrite existing output files +.TP +\fB\-k\fR, \fB\-\-keep\fR +keep (don't delete) input files +.TP +\fB\-m\fR, \fB\-\-merge\fR +correct errors in file using several copies +.TP +\fB\-o\fR, \fB\-\-output=\fR +place the output into +.TP +\fB\-q\fR, \fB\-\-quiet\fR +suppress all messages +.TP +\fB\-R\fR, \fB\-\-repair\fR +try to repair a small error in file +.TP +\fB\-s\fR, \fB\-\-split\fR +split a multimember file in single\-member files +.TP +\fB\-t\fR, \fB\-\-test\fR +test compressed file integrity +.TP +\fB\-v\fR, \fB\-\-verbose\fR +be verbose (a 2nd \fB\-v\fR gives more) +.SH "REPORTING BUGS" +Report bugs to lzip\-bug@nongnu.org +.br +Lziprecover home page: http://www.nongnu.org/lzip/lziprecover.html +.SH COPYRIGHT +Copyright \(co 2011 Antonio Diaz Diaz. +License GPLv3+: GNU GPL version 3 or later +.br +This is free software: you are free to change and redistribute it. +There is NO WARRANTY, to the extent permitted by law. +.SH "SEE ALSO" +The full documentation for +.B Lziprecover +is maintained as a Texinfo manual. If the +.B info +and +.B Lziprecover +programs are properly installed at your site, the command +.IP +.B info Lziprecover +.PP +should give you access to the complete manual. diff --git a/doc/lziprecover.info b/doc/lziprecover.info new file mode 100644 index 0000000..4528103 --- /dev/null +++ b/doc/lziprecover.info @@ -0,0 +1,368 @@ +This is lziprecover.info, produced by makeinfo version 4.13 from +lziprecover.texinfo. + +INFO-DIR-SECTION Data Compression +START-INFO-DIR-ENTRY +* Lziprecover: (lziprecover). Data recovery tool for lzipped files +END-INFO-DIR-ENTRY + + +File: lziprecover.info, Node: Top, Next: Introduction, Up: (dir) + +Lziprecover Manual +****************** + +This manual is for Lziprecover (version 1.13-rc1, 12 November 2011). + +* Menu: + +* Introduction:: Purpose and features of lziprecover +* Invoking Lziprecover:: Command line interface +* File Format:: Detailed format of the compressed file +* Examples:: A small tutorial with examples +* Problems:: Reporting bugs +* Concept Index:: Index of concepts + + + Copyright (C) 2009, 2010, 2011 Antonio Diaz Diaz. + + This manual is free documentation: you have unlimited permission to +copy, distribute and modify it. + + +File: lziprecover.info, Node: Introduction, Next: Invoking Lziprecover, Prev: Top, Up: Top + +1 Introduction +************** + +Lziprecover is a data recovery tool and decompressor for files in the +lzip compressed data format (.lz) able to repair slightly damaged files, +recover badly damaged files from two or more copies, extract undamaged +members from multi-member files, decompress files and test integrity of +files. + + Lziprecover is able to recover or decompress files produced by any of +the compressors in the lzip family; lzip, plzip, minilzip/lzlib, clzip +and pdlzip. This recovery capability contributes to make the lzip format +one of the best options for long-term data archiving. + + When recovering data, lziprecover takes as arguments the names of the +damaged files and writes zero or more recovered files depending on the +operation selected and whether the recovery succeeded or not. The +damaged files themselves are never modified. + + When decompressing or testing file integrity, lziprecover behaves +like lzip or lunzip. + + If the files are too damaged for lziprecover to repair them, data +from damaged members can be partially recovered writing it to stdout as +shown in the following example (the resulting file may contain some +garbage data at the end): + + lziprecover -cd rec00001file.lz > rec00001file + + If the cause of file corruption is damaged media, the combination +GNU ddrescue + lziprecover is the best option for recovering data from +multiple damaged copies. *Note ddrescue-example::, for an example. + + Return values: 0 for a normal exit, 1 for environmental problems +(file not found, invalid flags, I/O errors, etc), 2 to indicate a +corrupt or invalid input file, 3 for an internal consistency error (eg, +bug) which caused lziprecover to panic. + + +File: lziprecover.info, Node: Invoking Lziprecover, Next: File Format, Prev: Introduction, Up: Top + +2 Invoking Lziprecover +********************** + +The format for running lziprecover is: + + lziprecover [OPTIONS] [FILES] + + Lziprecover supports the following options: + +`-h' +`--help' + Print an informative help message describing the options and exit. + +`-V' +`--version' + Print the version number of lziprecover on the standard output and + exit. + +`-c' +`--stdout' + Decompress to standard output. Needed when reading from a named + pipe (fifo) or from a device. Use it to recover as much of the + uncompressed data as possible when decompressing a corrupt file. + +`-d' +`--decompress' + Decompress. + +`-f' +`--force' + Force overwrite of output files. + +`-k' +`--keep' + Keep (don't delete) input files during decompression. + +`-m' +`--merge' + Try to produce a correct file merging the good parts of two or more + damaged copies. The copies must be single-member files. The merge + will fail if the copies have too many damaged areas or if the same + byte is damaged in all copies. If successful, a repaired copy is + written to the file `FILE_fixed.lz'. The exit status is 0 if the + file could be repaired, 2 otherwise. + + To give you an idea of its possibilities, when merging two copies + each of them with one damaged area affecting 1 percent of the + copy, the probability of obtaining a correct file is about 98 + percent. With three such copies the probability rises to 99.97 + percent. For large files with small errors, the probability + approaches 100 percent even with only two copies. + +`-o FILE' +`--output=FILE' + Place the output into `FILE' instead of into `FILE_fixed.lz'. If + splitting, the names of the files produced are in the form + `rec00001FILE', `rec00002FILE', etc. If decompressing from + standard input and `--stdout' has not been specified, use `FILE' + as the name of the decompressed file. + +`-q' +`--quiet' + Quiet operation. Suppress all messages. + +`-R' +`--repair' + Try to repair a small error, affecting only one byte, in a + single-member FILE. If successful, a repaired copy is written to + the file `FILE_fixed.lz'. `FILE' is not modified at all. The exit + status is 0 if the file could be repaired, 2 otherwise. + +`-s' +`--split' + Search for members in `FILE' and write each member in its own + `.lz' file. You can then use `lziprecover -t' to test the + integrity of the resulting files, decompress those which are + undamaged, and try to repair or partially decompress those which + are damaged. + + The names of the files produced are in the form `rec00001FILE.lz', + `rec00002FILE.lz', etc, and are designed so that the use of + wildcards in subsequent processing, for example, + `lziprecover -cd rec*FILE.lz > recovered_data', processes the + files in the correct order. + +`-t' +`--test' + Check integrity of the specified file(s), but don't decompress + them. This really performs a trial decompression and throws away + the result. Use it together with `-v' to see information about + the file. + +`-v' +`--verbose' + Verbose mode. + When decompressing or testing, further -v's (up to 4) increase the + verbosity level, showing status, dictionary size, compression + ratio, trailer contents (CRC, data size, member size), and up to 6 + bytes of trailing garbage (if any). + + + +File: lziprecover.info, Node: File Format, Next: Examples, Prev: Invoking Lziprecover, Up: Top + +3 File Format +************* + +In the diagram below, a box like this: ++---+ +| | <-- the vertical bars might be missing ++---+ + + represents one byte; a box like this: ++==============+ +| | ++==============+ + + represents a variable number of bytes. + + + A lzip file consists of a series of "members" (compressed data sets). +The members simply appear one after another in the file, with no +additional information before, between, or after them. + + Each member has the following structure: ++--+--+--+--+----+----+=============+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +| ID string | VN | DS | Lzma stream | CRC32 | Data size | Member size | ++--+--+--+--+----+----+=============+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + + All multibyte values are stored in little endian order. + +`ID string' + A four byte string, identifying the lzip format, with the value + "LZIP". + +`VN (version number, 1 byte)' + Just in case something needs to be modified in the future. Valid + values are 0 and 1. Version 0 files are deprecated. They can + contain only one member and lack the `Member size' field. + +`DS (coded dictionary size, 1 byte)' + Bits 4-0 contain the base 2 logarithm of the base dictionary size. + Bits 7-5 contain the number of "wedges" to substract from the base + dictionary size to obtain the dictionary size. The size of a wedge + is (base dictionary size / 16). + Valid values for dictionary size range from 4KiB to 512MiB. + +`Lzma stream' + The lzma stream, finished by an end of stream marker. Uses default + values for encoder properties. + +`CRC32 (4 bytes)' + CRC of the uncompressed original data. + +`Data size (8 bytes)' + Size of the uncompressed original data. + +`Member size (8 bytes)' + Total size of the member, including header and trailer. This + facilitates safe recovery of undamaged members from multimember + files. + + + +File: lziprecover.info, Node: Examples, Next: Problems, Prev: File Format, Up: Top + +4 A small tutorial with examples +******************************** + +Example 1: Restore a regular file from its compressed version +`file.lz'. If the operation is successful, `file.lz' is removed. + + lziprecover -d file.lz + + +Example 2: Verify the integrity of the compressed file `file.lz' and +show status. + + lziprecover -tv file.lz + + +Example 3: Decompress `file.lz' partially until 10KiB of decompressed +data are produced. + + lziprecover -cd file.lz | dd bs=1024 count=10 + + +Example 4: Decompress `file.lz' partially from decompressed byte 10000 +to decompressed byte 15000 (5000 bytes are produced). + + lziprecover -cd file.lz | dd bs=1000 skip=10 count=5 + + +Example 5: Repair a one-byte corruption in the single-member file +`file.lz'. (Indented lines are abridged error messages from +lziprecover). + + lziprecover -v -R file.lz + Copy of input file repaired successfully. + mv file_fixed.lz file.lz + + +Example 6: Split the multi-member file `file.lz' and write each member +in its own `recXXXXXfile.lz' file. Then use `lziprecover -t' to test +the integrity of the resulting files. + + lziprecover -s file.lz + lziprecover -tv rec*file.lz + + +Example 7: Recover a compressed backup from two copies on CD-ROM (see +the GNU ddrescue manual for details about ddrescue) + + ddrescue -b2048 /dev/cdrom cdimage1 logfile1 + mount -t iso9660 -o loop,ro cdimage1 /mnt/cdimage + cp /mnt/cdimage/backup.tar.lz rescued1.tar.lz + umount /mnt/cdimage + (insert second copy in the CD drive) + ddrescue -b2048 /dev/cdrom cdimage2 logfile2 + mount -t iso9660 -o loop,ro cdimage2 /mnt/cdimage + cp /mnt/cdimage/backup.tar.lz rescued2.tar.lz + umount /mnt/cdimage + lziprecover -m -v -o rescued.tar.lz rescued1.tar.lz rescued2.tar.lz + + +Example 8: Recover the first volume of those created with the command +`lzip -b 32MiB -S 650MB big_db' from two copies, `big_db1_00001.lz' and +`big_db2_00001.lz', with member 00007 damaged in the first copy, member +00018 damaged in the second copy, and member 00012 damaged in both +copies. Two correct copies are produced and compared. + + lziprecover -s big_db1_00001.lz + lziprecover -s big_db2_00001.lz + lziprecover -t rec*big_db1_00001.lz + rec00007big_db1_00001.lz: crc mismatch + rec00012big_db1_00001.lz: crc mismatch + lziprecover -t rec*big_db2_00001.lz + rec00012big_db2_00001.lz: crc mismatch + rec00018big_db2_00001.lz: crc mismatch + lziprecover -m -v rec00012big_db1_00001.lz rec00012big_db2_00001.lz + Input files merged successfully + cp rec00007big_db2_00001.lz rec00007big_db1_00001.lz + cp rec00012big_db1_00001_fixed.lz rec00012big_db1_00001.lz + cp rec00012big_db1_00001_fixed.lz rec00012big_db2_00001.lz + cp rec00018big_db1_00001.lz rec00018big_db2_00001.lz + cat rec*big_db1_00001.lz > big_db3_00001.lz + cat rec*big_db2_00001.lz > big_db4_00001.lz + zcmp big_db3_00001.lz big_db4_00001.lz + + +File: lziprecover.info, Node: Problems, Next: Concept Index, Prev: Examples, Up: Top + +5 Reporting Bugs +**************** + +There are probably bugs in lziprecover. There are certainly errors and +omissions in this manual. If you report them, they will get fixed. If +you don't, no one will ever know about them and they will remain unfixed +for all eternity, if not longer. + + If you find a bug in lziprecover, please send electronic mail to +. Include the version number, which you can find +by running `lziprecover --version'. + + +File: lziprecover.info, Node: Concept Index, Prev: Problems, Up: Top + +Concept Index +************* + +[index] +* Menu: + +* bugs: Problems. (line 6) +* examples: Examples. (line 6) +* file format: File Format. (line 6) +* getting help: Problems. (line 6) +* introduction: Introduction. (line 6) +* invoking lziprecover: Invoking Lziprecover. (line 6) + + + +Tag Table: +Node: Top231 +Node: Introduction898 +Node: Invoking Lziprecover2684 +Node: File Format6150 +Node: Examples8156 +Ref: ddrescue-example9409 +Node: Problems11188 +Node: Concept Index11738 + +End Tag Table diff --git a/doc/lziprecover.texinfo b/doc/lziprecover.texinfo new file mode 100644 index 0000000..2447c14 --- /dev/null +++ b/doc/lziprecover.texinfo @@ -0,0 +1,397 @@ +\input texinfo @c -*-texinfo-*- +@c %**start of header +@setfilename lziprecover.info +@settitle Lziprecover Manual +@finalout +@c %**end of header + +@set UPDATED 12 November 2011 +@set VERSION 1.13-rc1 + +@dircategory Data Compression +@direntry +* Lziprecover: (lziprecover). Data recovery tool for lzipped files +@end direntry + + +@ifnothtml +@titlepage +@title Lziprecover +@subtitle Data recovery tool for lzipped files +@subtitle for Lziprecover version @value{VERSION}, @value{UPDATED} +@author by Antonio Diaz Diaz + +@page +@vskip 0pt plus 1filll +@end titlepage + +@contents +@end ifnothtml + +@node Top +@top + +This manual is for Lziprecover (version @value{VERSION}, @value{UPDATED}). + +@menu +* Introduction:: Purpose and features of lziprecover +* Invoking Lziprecover:: Command line interface +* File Format:: Detailed format of the compressed file +* Examples:: A small tutorial with examples +* Problems:: Reporting bugs +* Concept Index:: Index of concepts +@end menu + +@sp 1 +Copyright @copyright{} 2009, 2010, 2011 Antonio Diaz Diaz. + +This manual is free documentation: you have unlimited permission +to copy, distribute and modify it. + + +@node Introduction +@chapter Introduction +@cindex introduction + +Lziprecover is a data recovery tool and decompressor for files in the +lzip compressed data format (.lz) able to repair slightly damaged files, +recover badly damaged files from two or more copies, extract undamaged +members from multi-member files, decompress files and test integrity of +files. + +Lziprecover is able to recover or decompress files produced by any of +the compressors in the lzip family; lzip, plzip, minilzip/lzlib, clzip +and pdlzip. This recovery capability contributes to make the lzip format +one of the best options for long-term data archiving. + +When recovering data, lziprecover takes as arguments the names of the +damaged files and writes zero or more recovered files depending on the +operation selected and whether the recovery succeeded or not. The +damaged files themselves are never modified. + +When decompressing or testing file integrity, lziprecover behaves like +lzip or lunzip. + +If the files are too damaged for lziprecover to repair them, data from +damaged members can be partially recovered writing it to stdout as shown +in the following example (the resulting file may contain some garbage +data at the end): + +@example +lziprecover -cd rec00001file.lz > rec00001file +@end example + +If the cause of file corruption is damaged media, the combination +@w{GNU ddrescue + lziprecover} is the best option for recovering data +from multiple damaged copies. @xref{ddrescue-example}, for an example. + +Return values: 0 for a normal exit, 1 for environmental problems (file +not found, invalid flags, I/O errors, etc), 2 to indicate a corrupt or +invalid input file, 3 for an internal consistency error (eg, bug) which +caused lziprecover to panic. + + +@node Invoking Lziprecover +@chapter Invoking Lziprecover +@cindex invoking lziprecover + +The format for running lziprecover is: + +@example +lziprecover [@var{options}] [@var{files}] +@end example + +Lziprecover supports the following options: + +@table @samp +@item -h +@itemx --help +Print an informative help message describing the options and exit. + +@item -V +@itemx --version +Print the version number of lziprecover on the standard output and exit. + +@item -c +@itemx --stdout +Decompress to standard output. Needed when reading from a named pipe +(fifo) or from a device. Use it to recover as much of the uncompressed +data as possible when decompressing a corrupt file. + +@item -d +@itemx --decompress +Decompress. + +@item -f +@itemx --force +Force overwrite of output files. + +@item -k +@itemx --keep +Keep (don't delete) input files during decompression. + +@item -m +@itemx --merge +Try to produce a correct file merging the good parts of two or more +damaged copies. The copies must be single-member files. The merge will +fail if the copies have too many damaged areas or if the same byte is +damaged in all copies. If successful, a repaired copy is written to the +file @samp{@var{file}_fixed.lz}. The exit status is 0 if the file could +be repaired, 2 otherwise. + +To give you an idea of its possibilities, when merging two copies each +of them with one damaged area affecting 1 percent of the copy, the +probability of obtaining a correct file is about 98 percent. With three +such copies the probability rises to 99.97 percent. For large files with +small errors, the probability approaches 100 percent even with only two +copies. + +@item -o @var{file} +@itemx --output=@var{file} +Place the output into @samp{@var{file}} instead of into +@samp{@var{file}_fixed.lz}. If splitting, the names of the files +produced are in the form @samp{rec00001@var{file}}, +@samp{rec00002@var{file}}, etc. If decompressing from standard input and +@samp{--stdout} has not been specified, use @samp{@var{file}} as the +name of the decompressed file. + +@item -q +@itemx --quiet +Quiet operation. Suppress all messages. + +@item -R +@itemx --repair +Try to repair a small error, affecting only one byte, in a single-member +@var{file}. If successful, a repaired copy is written to the file +@samp{@var{file}_fixed.lz}. @samp{@var{file}} is not modified at all. +The exit status is 0 if the file could be repaired, 2 otherwise. + +@item -s +@itemx --split +Search for members in @samp{@var{file}} and write each member in its own +@samp{.lz} file. You can then use @samp{lziprecover -t} to test the +integrity of the resulting files, decompress those which are undamaged, +and try to repair or partially decompress those which are damaged. + +The names of the files produced are in the form +@samp{rec00001@var{file}.lz}, @samp{rec00002@var{file}.lz}, etc, and are +designed so that the use of wildcards in subsequent processing, for +example, @w{@samp{lziprecover -cd rec*@var{file}.lz > recovered_data}}, +processes the files in the correct order. + +@item -t +@itemx --test +Check integrity of the specified file(s), but don't decompress them. +This really performs a trial decompression and throws away the result. +Use it together with @samp{-v} to see information about the file. + +@item -v +@itemx --verbose +Verbose mode.@* +When decompressing or testing, further -v's (up to 4) increase the +verbosity level, showing status, dictionary size, compression ratio, +trailer contents (CRC, data size, member size), and up to 6 bytes of +trailing garbage (if any). + +@end table + + +@node File Format +@chapter File Format +@cindex file format + +In the diagram below, a box like this: +@verbatim ++---+ +| | <-- the vertical bars might be missing ++---+ +@end verbatim + +represents one byte; a box like this: +@verbatim ++==============+ +| | ++==============+ +@end verbatim + +represents a variable number of bytes. + +@sp 1 +A lzip file consists of a series of "members" (compressed data sets). +The members simply appear one after another in the file, with no +additional information before, between, or after them. + +Each member has the following structure: +@verbatim ++--+--+--+--+----+----+=============+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +| ID string | VN | DS | Lzma stream | CRC32 | Data size | Member size | ++--+--+--+--+----+----+=============+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +@end verbatim + +All multibyte values are stored in little endian order. + +@table @samp +@item ID string +A four byte string, identifying the lzip format, with the value "LZIP". + +@item VN (version number, 1 byte) +Just in case something needs to be modified in the future. Valid values +are 0 and 1. Version 0 files are deprecated. They can contain only one +member and lack the @samp{Member size} field. + +@item DS (coded dictionary size, 1 byte) +Bits 4-0 contain the base 2 logarithm of the base dictionary size.@* +Bits 7-5 contain the number of "wedges" to substract from the base +dictionary size to obtain the dictionary size. The size of a wedge is +(base dictionary size / 16).@* +Valid values for dictionary size range from 4KiB to 512MiB. + +@item Lzma stream +The lzma stream, finished by an end of stream marker. Uses default values +for encoder properties. + +@item CRC32 (4 bytes) +CRC of the uncompressed original data. + +@item Data size (8 bytes) +Size of the uncompressed original data. + +@item Member size (8 bytes) +Total size of the member, including header and trailer. This facilitates +safe recovery of undamaged members from multimember files. + +@end table + + +@node Examples +@chapter A small tutorial with examples +@cindex examples + +Example 1: Restore a regular file from its compressed version +@samp{file.lz}. If the operation is successful, @samp{file.lz} is +removed. + +@example +lziprecover -d file.lz +@end example + +@sp 1 +@noindent +Example 2: Verify the integrity of the compressed file @samp{file.lz} +and show status. + +@example +lziprecover -tv file.lz +@end example + +@sp 1 +@noindent +Example 3: Decompress @samp{file.lz} partially until 10KiB of +decompressed data are produced. + +@example +lziprecover -cd file.lz | dd bs=1024 count=10 +@end example + +@sp 1 +@noindent +Example 4: Decompress @samp{file.lz} partially from decompressed byte +10000 to decompressed byte 15000 (5000 bytes are produced). + +@example +lziprecover -cd file.lz | dd bs=1000 skip=10 count=5 +@end example + +@sp 1 +@noindent +Example 5: Repair a one-byte corruption in the single-member file +@samp{file.lz}. (Indented lines are abridged error messages from +lziprecover). + +@example +lziprecover -v -R file.lz + Copy of input file repaired successfully. +mv file_fixed.lz file.lz +@end example + +@sp 1 +@noindent +Example 6: Split the multi-member file @samp{file.lz} and write each +member in its own @samp{recXXXXXfile.lz} file. Then use +@w{@samp{lziprecover -t}} to test the integrity of the resulting files. + +@example +lziprecover -s file.lz +lziprecover -tv rec*file.lz +@end example + +@sp 1 +@anchor{ddrescue-example} +@noindent +Example 7: Recover a compressed backup from two copies on CD-ROM (see +the GNU ddrescue manual for details about ddrescue) + +@example +ddrescue -b2048 /dev/cdrom cdimage1 logfile1 +mount -t iso9660 -o loop,ro cdimage1 /mnt/cdimage +cp /mnt/cdimage/backup.tar.lz rescued1.tar.lz +umount /mnt/cdimage + (insert second copy in the CD drive) +ddrescue -b2048 /dev/cdrom cdimage2 logfile2 +mount -t iso9660 -o loop,ro cdimage2 /mnt/cdimage +cp /mnt/cdimage/backup.tar.lz rescued2.tar.lz +umount /mnt/cdimage +lziprecover -m -v -o rescued.tar.lz rescued1.tar.lz rescued2.tar.lz +@end example + +@sp 1 +@noindent +Example 8: Recover the first volume of those created with the command +@w{@code{lzip -b 32MiB -S 650MB big_db}} from two copies, +@samp{big_db1_00001.lz} and @samp{big_db2_00001.lz}, with member 00007 +damaged in the first copy, member 00018 damaged in the second copy, and +member 00012 damaged in both copies. Two correct copies are produced and +compared. + +@example +lziprecover -s big_db1_00001.lz +lziprecover -s big_db2_00001.lz +lziprecover -t rec*big_db1_00001.lz + rec00007big_db1_00001.lz: crc mismatch + rec00012big_db1_00001.lz: crc mismatch +lziprecover -t rec*big_db2_00001.lz + rec00012big_db2_00001.lz: crc mismatch + rec00018big_db2_00001.lz: crc mismatch +lziprecover -m -v rec00012big_db1_00001.lz rec00012big_db2_00001.lz + Input files merged successfully +cp rec00007big_db2_00001.lz rec00007big_db1_00001.lz +cp rec00012big_db1_00001_fixed.lz rec00012big_db1_00001.lz +cp rec00012big_db1_00001_fixed.lz rec00012big_db2_00001.lz +cp rec00018big_db1_00001.lz rec00018big_db2_00001.lz +cat rec*big_db1_00001.lz > big_db3_00001.lz +cat rec*big_db2_00001.lz > big_db4_00001.lz +zcmp big_db3_00001.lz big_db4_00001.lz +@end example + + +@node Problems +@chapter Reporting Bugs +@cindex bugs +@cindex getting help + +There are probably bugs in lziprecover. There are certainly errors and +omissions in this manual. If you report them, they will get fixed. If +you don't, no one will ever know about them and they will remain unfixed +for all eternity, if not longer. + +If you find a bug in lziprecover, please send electronic mail to +@email{lzip-bug@@nongnu.org}. Include the version number, which you can +find by running @w{@samp{lziprecover --version}}. + + +@node Concept Index +@unnumbered Concept Index + +@printindex cp + +@bye diff --git a/lzip.h b/lzip.h new file mode 100644 index 0000000..440ce71 --- /dev/null +++ b/lzip.h @@ -0,0 +1,323 @@ +/* Lziprecover - Data recovery tool for lzipped files + Copyright (C) 2009, 2010, 2011 Antonio Diaz Diaz. + + This program 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 . +*/ + +class State + { + unsigned char st; + +public: + enum { states = 12 }; + State() throw() : st( 0 ) {} + unsigned char operator()() const throw() { return st; } + bool is_char() const throw() { return st < 7; } + + void set_char() throw() + { + static const unsigned char next[states] = + { 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 4, 5 }; + st = next[st]; + } + + void set_match() throw() + { + static const unsigned char next[states] = + { 7, 7, 7, 7, 7, 7, 7, 10, 10, 10, 10, 10 }; + st = next[st]; + } + + void set_rep() throw() + { + static const unsigned char next[states] = + { 8, 8, 8, 8, 8, 8, 8, 11, 11, 11, 11, 11 }; + st = next[st]; + } + + void set_short_rep() throw() + { + static const unsigned char next[states] = + { 9, 9, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11 }; + st = next[st]; + } + }; + + +enum { + min_dictionary_bits = 12, + min_dictionary_size = 1 << min_dictionary_bits, + max_dictionary_bits = 29, + max_dictionary_size = 1 << max_dictionary_bits, + literal_context_bits = 3, + pos_state_bits = 2, + pos_states = 1 << pos_state_bits, + pos_state_mask = pos_states - 1, + + dis_slot_bits = 6, + start_dis_model = 4, + end_dis_model = 14, + modeled_distances = 1 << (end_dis_model / 2), + dis_align_bits = 4, + dis_align_size = 1 << dis_align_bits, + + len_low_bits = 3, + len_mid_bits = 3, + len_high_bits = 8, + len_low_symbols = 1 << len_low_bits, + len_mid_symbols = 1 << len_mid_bits, + len_high_symbols = 1 << len_high_bits, + max_len_symbols = len_low_symbols + len_mid_symbols + len_high_symbols, + + min_match_len = 2, // must be 2 + max_match_len = min_match_len + max_len_symbols - 1, // 273 + min_match_len_limit = 5, + + max_dis_states = 4 }; + +inline int get_dis_state( int len ) throw() + { + len -= min_match_len; + if( len >= max_dis_states ) len = max_dis_states - 1; + return len; + } + + +enum { bit_model_move_bits = 5, + bit_model_total_bits = 11, + bit_model_total = 1 << bit_model_total_bits }; + +struct Bit_model + { + unsigned int probability; + Bit_model() throw() : probability( bit_model_total / 2 ) {} + }; + + +class Pretty_print + { + const char * const stdin_name; + unsigned int longest_name; + const int verbosity_; + std::string name_; + mutable bool first_post; + +public: + Pretty_print( const std::vector< std::string > & filenames, const int v ) + : stdin_name( "(stdin)" ), longest_name( 0 ), verbosity_( v ), + first_post( false ) + { + const unsigned int stdin_name_len = std::strlen( stdin_name ); + for( unsigned int i = 0; i < filenames.size(); ++i ) + { + const std::string & s = filenames[i]; + const unsigned int len = ( ( s == "-" ) ? stdin_name_len : s.size() ); + if( len > longest_name ) longest_name = len; + } + if( longest_name == 0 ) longest_name = stdin_name_len; + } + + void set_name( const std::string & filename ) + { + if( filename.size() && filename != "-" ) name_ = filename; + else name_ = stdin_name; + first_post = true; + } + + void reset() const throw() { if( name_.size() ) first_post = true; } + const char * name() const throw() { return name_.c_str(); } + int verbosity() const throw() { return verbosity_; } + void operator()( const char * const msg = 0 ) const throw(); + }; + + +class CRC32 + { + uint32_t data[256]; // Table of CRCs of all 8-bit messages. + +public: + CRC32() + { + for( unsigned int n = 0; n < 256; ++n ) + { + unsigned int c = n; + for( int k = 0; k < 8; ++k ) + { if( c & 1 ) c = 0xEDB88320U ^ ( c >> 1 ); else c >>= 1; } + data[n] = c; + } + } + + uint32_t operator[]( const uint8_t byte ) const throw() { return data[byte]; } + void update( uint32_t & crc, const uint8_t byte ) const throw() + { crc = data[(crc^byte)&0xFF] ^ ( crc >> 8 ); } + void update( uint32_t & crc, const uint8_t * const buffer, const int size ) const throw() + { + for( int i = 0; i < size; ++i ) + crc = data[(crc^buffer[i])&0xFF] ^ ( crc >> 8 ); + } + }; + +extern const CRC32 crc32; + + +inline int real_bits( const int value ) throw() + { + int bits = 0; + for( int i = 1, mask = 1; mask > 0; ++i, mask <<= 1 ) + if( value & mask ) bits = i; + return bits; + } + +const uint8_t magic_string[4] = { 'L', 'Z', 'I', 'P' }; + +struct File_header + { + uint8_t data[6]; // 0-3 magic bytes + // 4 version + // 5 coded_dict_size + enum { size = 6 }; + + void set_magic() throw() + { std::memcpy( data, magic_string, 4 ); data[4] = 1; } + + bool verify_magic() const throw() + { return ( std::memcmp( data, magic_string, 4 ) == 0 ); } + + uint8_t version() const throw() { return data[4]; } + bool verify_version() const throw() { return ( data[4] <= 1 ); } + + int dictionary_size() const throw() + { + int sz = ( 1 << ( data[5] & 0x1F ) ); + if( sz > min_dictionary_size && sz <= max_dictionary_size ) + sz -= ( sz / 16 ) * ( ( data[5] >> 5 ) & 0x07 ); + return sz; + } + + bool dictionary_size( const int sz ) throw() + { + if( sz >= min_dictionary_size && sz <= max_dictionary_size ) + { + data[5] = real_bits( sz - 1 ); + if( sz > min_dictionary_size ) + { + const int base_size = 1 << data[5]; + const int wedge = base_size / 16; + for( int i = 7; i >= 1; --i ) + if( base_size - ( i * wedge ) >= sz ) + { data[5] |= ( i << 5 ); break; } + } + return true; + } + return false; + } + }; + + +struct File_trailer + { + uint8_t data[20]; // 0-3 CRC32 of the uncompressed data + // 4-11 size of the uncompressed data + // 12-19 member size including header and trailer + + static int size( const int version = 1 ) + { return ( ( version >= 1 ) ? 20 : 12 ); } + + uint32_t data_crc() const throw() + { + uint32_t tmp = 0; + for( int i = 3; i >= 0; --i ) { tmp <<= 8; tmp += data[i]; } + return tmp; + } + + void data_crc( uint32_t crc ) throw() + { for( int i = 0; i <= 3; ++i ) { data[i] = (uint8_t)crc; crc >>= 8; } } + + long long data_size() const throw() + { + long long tmp = 0; + for( int i = 11; i >= 4; --i ) { tmp <<= 8; tmp += data[i]; } + return tmp; + } + + void data_size( long long sz ) throw() + { + for( int i = 4; i <= 11; ++i ) { data[i] = (uint8_t)sz; sz >>= 8; } + } + + long long member_size() const throw() + { + long long tmp = 0; + for( int i = 19; i >= 12; --i ) { tmp <<= 8; tmp += data[i]; } + return tmp; + } + + void member_size( long long sz ) throw() + { + for( int i = 12; i <= 19; ++i ) { data[i] = (uint8_t)sz; sz >>= 8; } + } + }; + + +struct Error + { + const char * const msg; + Error( const char * const s ) throw() : msg( s ) {} + }; + + +#ifndef LLONG_MAX +#define LLONG_MAX 0x7FFFFFFFFFFFFFFFLL +#endif +#ifndef LLONG_MIN +#define LLONG_MIN (-LLONG_MAX - 1LL) +#endif +#ifndef ULLONG_MAX +#define ULLONG_MAX 0xFFFFFFFFFFFFFFFFULL +#endif + + +// defined in decoder.cc +int readblock( const int fd, uint8_t * const buf, const int size ) throw(); +int writeblock( const int fd, const uint8_t * const buf, const int size ) throw(); + +// defined in main.cc +extern int verbosity; +int open_instream( const std::string & name, struct stat * const in_statsp, + const bool to_stdout, const bool reg_only = false ) throw(); +int open_outstream_rw( const std::string & output_filename, + const bool force ) throw(); +void show_error( const char * const msg, const int errcode = 0, + const bool help = false ) throw(); +void internal_error( const char * const msg ); + +// defined in merge.cc +void cleanup_and_fail( const std::string & output_filename, + const int outfd, const int retval ) throw(); +bool copy_file( const int infd, const int outfd, + const long long size = LLONG_MAX ); +bool try_decompress( const int fd, const long long file_size, + long long * failure_posp = 0 ); +bool verify_header( const File_header & header ); +bool verify_single_member( const int fd, const long long file_size ); +int merge_files( const std::vector< std::string > & filenames, + const std::string & output_filename, const bool force ); + +// defined in repair.cc +int repair_file( const std::string & input_filename, + const std::string & output_filename, const bool force ); + +// defined in split.cc +int split_file( const std::string & input_filename, + const std::string & default_output_filename, const bool force ); diff --git a/main.cc b/main.cc new file mode 100644 index 0000000..2abbc0e --- /dev/null +++ b/main.cc @@ -0,0 +1,676 @@ +/* Lziprecover - Data recovery tool for lzipped files + Copyright (C) 2009, 2010, 2011 Antonio Diaz Diaz. + + This program 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 . +*/ +/* + Return values: 0 for a normal exit, 1 for environmental problems + (file not found, invalid flags, I/O errors, etc), 2 to indicate a + corrupt or invalid input file, 3 for an internal consistency error + (eg, bug) which caused lziprecover to panic. +*/ + +#define _FILE_OFFSET_BITS 64 + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#if defined(__MSVCRT__) +#define S_IRGRP 0 +#define S_IWGRP 0 +#define S_IROTH 0 +#define S_IWOTH 0 +#endif + +#include "arg_parser.h" +#include "lzip.h" +#include "decoder.h" + +#if CHAR_BIT != 8 +#error "Environments where CHAR_BIT != 8 are not supported." +#endif + + +namespace { + +const char * const Program_name = "Lziprecover"; +const char * const program_name = "lziprecover"; +const char * const program_year = "2011"; +const char * invocation_name = 0; + +#ifdef O_BINARY +const int o_binary = O_BINARY; +#else +const int o_binary = 0; +#endif + +struct { const char * from; const char * to; } const known_extensions[] = { + { ".lz", "" }, + { ".tlz", ".tar" }, + { 0, 0 } }; + +enum Mode { m_none, m_decompress, m_generate, m_merge, m_recover, m_repair, + m_split, m_test, m_update }; + +std::string output_filename; +int outfd = -1; +const mode_t usr_rw = S_IRUSR | S_IWUSR; +const mode_t all_rw = usr_rw | S_IRGRP | S_IWGRP | S_IROTH | S_IWOTH; +mode_t outfd_mode = usr_rw; +bool delete_output_on_interrupt = false; + + +void show_help() throw() + { + std::printf( "%s - Data recovery tool and decompressor for lzipped files.\n", Program_name ); + std::printf( "\nUsage: %s [options] [files]\n", invocation_name ); + std::printf( "\nOptions:\n" + " -h, --help display this help and exit\n" + " -V, --version output version information and exit\n" + " -c, --stdout send decompressed output to standard output\n" + " -d, --decompress decompress\n" + " -f, --force overwrite existing output files\n" +// " -g, --generate-recover-file generate a recover file\n" + " -k, --keep keep (don't delete) input files\n" + " -m, --merge correct errors in file using several copies\n" + " -o, --output= place the output into \n" + " -q, --quiet suppress all messages\n" +// " -r, --recover correct errors in file using a recover file\n" + " -R, --repair try to repair a small error in file\n" + " -s, --split split a multimember file in single-member files\n" + " -t, --test test compressed file integrity\n" +// " -u, --update convert file from version 0 to version 1\n" + " -v, --verbose be verbose (a 2nd -v gives more)\n" + "\nReport bugs to lzip-bug@nongnu.org\n" + "Lziprecover home page: http://www.nongnu.org/lzip/lziprecover.html\n" ); + } + + +void show_version() throw() + { + std::printf( "%s %s\n", Program_name, PROGVERSION ); + std::printf( "Copyright (C) %s Antonio Diaz Diaz.\n", program_year ); + std::printf( "License GPLv3+: GNU GPL version 3 or later \n" + "This is free software: you are free to change and redistribute it.\n" + "There is NO WARRANTY, to the extent permitted by law.\n" ); + } + + +const char * format_num( long long num ) throw() + { + const char * const prefix[8] = + { "Ki", "Mi", "Gi", "Ti", "Pi", "Ei", "Zi", "Yi" }; + enum { buf_size = 16, factor = 1024 }; + static char buf[buf_size]; + const char *p = ""; + bool exact = ( num % factor == 0 ); + + for( int i = 0; i < 8 && ( llabs( num ) > 9999 || + ( exact && llabs( num ) >= factor ) ); ++i ) + { num /= factor; if( num % factor != 0 ) exact = false; p = prefix[i]; } + snprintf( buf, buf_size, "%lld %s", num, p ); + return buf; + } + + +void set_mode( Mode & program_mode, const Mode new_mode ) throw() + { + if( program_mode != m_none && program_mode != new_mode ) + { + show_error( "Only one operation can be specified.", 0, true ); + std::exit( 1 ); + } + program_mode = new_mode; + } + + +int extension_index( const std::string & name ) throw() + { + for( int i = 0; known_extensions[i].from; ++i ) + { + const std::string ext( known_extensions[i].from ); + if( name.size() > ext.size() && + name.compare( name.size() - ext.size(), ext.size(), ext ) == 0 ) + return i; + } + return -1; + } + + +void set_d_outname( const std::string & name, const int i ) throw() + { + if( i >= 0 ) + { + const std::string from( known_extensions[i].from ); + if( name.size() > from.size() ) + { + output_filename.assign( name, 0, name.size() - from.size() ); + output_filename += known_extensions[i].to; + return; + } + } + output_filename = name; output_filename += ".out"; + if( verbosity >= 1 ) + std::fprintf( stderr, "%s: Can't guess original name for `%s' -- using `%s'.\n", + program_name, name.c_str(), output_filename.c_str() ); + } + + +bool open_outstream( const bool force ) throw() + { + int flags = O_CREAT | O_WRONLY | o_binary; + if( force ) flags |= O_TRUNC; else flags |= O_EXCL; + + outfd = open( output_filename.c_str(), flags, outfd_mode ); + if( outfd < 0 && verbosity >= 0 ) + { + if( errno == EEXIST ) + std::fprintf( stderr, "%s: Output file `%s' already exists, skipping.\n", + program_name, output_filename.c_str() ); + else + std::fprintf( stderr, "%s: Can't create output file `%s': %s.\n", + program_name, output_filename.c_str(), std::strerror( errno ) ); + } + return ( outfd >= 0 ); + } + + +bool check_tty( const int infd ) throw() + { + if( isatty( infd ) ) + { + show_error( "I won't read compressed data from a terminal.", 0, true ); + return false; + } + return true; + } + + +void cleanup_and_fail( const int retval ) throw() + { + if( delete_output_on_interrupt ) + { + delete_output_on_interrupt = false; + if( verbosity >= 0 ) + std::fprintf( stderr, "%s: Deleting output file `%s', if it exists.\n", + program_name, output_filename.c_str() ); + if( outfd >= 0 ) { close( outfd ); outfd = -1; } + if( std::remove( output_filename.c_str() ) != 0 && errno != ENOENT ) + show_error( "WARNING: deletion of output file (apparently) failed." ); + } + std::exit( retval ); + } + + + // Set permissions, owner and times. +void close_and_set_permissions( const struct stat * const in_statsp ) + { + bool warning = false; + if( in_statsp ) + { + // fchown will in many cases return with EPERM, which can be safely ignored. + if( ( fchown( outfd, in_statsp->st_uid, in_statsp->st_gid ) != 0 && + errno != EPERM ) || + fchmod( outfd, in_statsp->st_mode ) != 0 ) warning = true; + } + if( close( outfd ) != 0 ) cleanup_and_fail( 1 ); + outfd = -1; + delete_output_on_interrupt = false; + if( in_statsp ) + { + struct utimbuf t; + t.actime = in_statsp->st_atime; + t.modtime = in_statsp->st_mtime; + if( utime( output_filename.c_str(), &t ) != 0 ) warning = true; + } + if( warning && verbosity >= 1 ) + show_error( "Can't change output file attributes." ); + } + + +std::string insert_fixed( std::string name ) throw() + { + if( name.size() > 4 && name.compare( name.size() - 4, 4, ".tlz" ) == 0 ) + name.insert( name.size() - 4, "_fixed" ); + else if( name.size() > 3 && name.compare( name.size() - 3, 3, ".lz" ) == 0 ) + name.insert( name.size() - 3, "_fixed" ); + else name += "_fixed.lz"; + return name; + } + + +unsigned char xdigit( const int value ) throw() + { + if( value >= 0 && value <= 9 ) return '0' + value; + if( value >= 10 && value <= 15 ) return 'A' + value - 10; + return 0; + } + + +void show_trailing_garbage( const uint8_t * const data, const int size, + const Pretty_print & pp, const bool all ) throw() + { + std::string garbage_msg; + if( !all ) garbage_msg = "first bytes of "; + garbage_msg += "trailing garbage found = "; + bool text = true; + for( int i = 0; i < size; ++i ) + if( !std::isprint( data[i] ) ) { text = false; break; } + if( text ) + { + garbage_msg += '`'; + garbage_msg.append( (const char *)data, size ); + garbage_msg += '\''; + } + else + { + for( int i = 0; i < size; ++i ) + { + if( i > 0 ) garbage_msg += ' '; + garbage_msg += xdigit( data[i] >> 4 ); + garbage_msg += xdigit( data[i] & 0x0F ); + } + } + pp( garbage_msg.c_str() ); + } + + +int decompress( const int infd, const Pretty_print & pp, const bool testing ) + { + int retval = 0; + + try { + Range_decoder rdec( infd ); + long long partial_file_pos = 0; + for( bool first_member = true; ; first_member = false, pp.reset() ) + { + File_header header; + int size; + rdec.reset_member_position(); + for( size = 0; size < File_header::size && !rdec.finished(); ++size ) + header.data[size] = rdec.get_byte(); + if( rdec.finished() ) // End Of File + { + if( first_member ) + { pp( "Error reading member header" ); retval = 1; } + else if( verbosity >= 4 && size > 0 ) + show_trailing_garbage( header.data, size, pp, true ); + break; + } + if( !header.verify_magic() ) + { + if( first_member ) + { pp( "Bad magic number (file not in lzip format)" ); retval = 2; } + else if( verbosity >= 4 ) + show_trailing_garbage( header.data, size, pp, false ); + break; + } + if( !header.verify_version() ) + { + if( verbosity >= 0 ) + { pp(); + std::fprintf( stderr, "Version %d member format not supported.\n", + header.version() ); } + retval = 2; break; + } + if( header.dictionary_size() < min_dictionary_size || + header.dictionary_size() > max_dictionary_size ) + { pp( "Invalid dictionary size in member header" ); retval = 2; break; } + + if( verbosity >= 2 || ( verbosity == 1 && first_member ) ) + { + pp(); + if( verbosity >= 2 ) + std::fprintf( stderr, "version %d, dictionary size %7sB. ", + header.version(), + format_num( header.dictionary_size() ) ); + } + LZ_decoder decoder( header, rdec, outfd ); + + const int result = decoder.decode_member( pp ); + partial_file_pos += rdec.member_position(); + if( result != 0 ) + { + if( verbosity >= 0 && result <= 2 ) + { + pp(); + if( result == 2 ) + std::fprintf( stderr, "File ends unexpectedly at pos %lld\n", + partial_file_pos ); + else + std::fprintf( stderr, "Decoder error at pos %lld\n", + partial_file_pos ); + } + retval = 2; break; + } + if( verbosity >= 2 ) + { if( testing ) std::fprintf( stderr, "ok\n" ); + else std::fprintf( stderr, "done\n" ); } + } + } + catch( std::bad_alloc ) + { + pp( "Not enough memory. Find a machine with more memory" ); + retval = 1; + } + catch( Error e ) { pp(); show_error( e.msg, errno ); retval = 1; } + if( verbosity == 1 && retval == 0 ) + { if( testing ) std::fprintf( stderr, "ok\n" ); + else std::fprintf( stderr, "done\n" ); } + return retval; + } + + +extern "C" void signal_handler( int ) throw() + { + show_error( "Control-C or similar caught, quitting." ); + cleanup_and_fail( 1 ); + } + + +void set_signals() throw() + { + std::signal( SIGHUP, signal_handler ); + std::signal( SIGINT, signal_handler ); + std::signal( SIGTERM, signal_handler ); + } + +} // end namespace + + +int verbosity = 0; + + +int open_instream( const std::string & name, struct stat * const in_statsp, + const bool to_stdout, const bool reg_only ) throw() + { + int infd = open( name.c_str(), O_RDONLY | o_binary ); + if( infd < 0 ) + { + if( verbosity >= 0 ) + std::fprintf( stderr, "%s: Can't open input file `%s': %s.\n", + program_name, name.c_str(), std::strerror( errno ) ); + } + else + { + const int i = fstat( infd, in_statsp ); + const mode_t & mode = in_statsp->st_mode; + const bool can_read = ( i == 0 && !reg_only && + ( S_ISBLK( mode ) || S_ISCHR( mode ) || + S_ISFIFO( mode ) || S_ISSOCK( mode ) ) ); + if( i != 0 || ( !S_ISREG( mode ) && ( !to_stdout || !can_read ) ) ) + { + if( verbosity >= 0 ) + std::fprintf( stderr, "%s: Input file `%s' is not a regular file%s.\n", + program_name, name.c_str(), + ( can_read && !to_stdout ) ? + " and `--stdout' was not specified" : "" ); + close( infd ); + infd = -1; + } + } + return infd; + } + + +int open_outstream_rw( const std::string & output_filename, + const bool force ) throw() + { + int flags = O_CREAT | O_RDWR | o_binary; + if( force ) flags |= O_TRUNC; else flags |= O_EXCL; + + int outfd = open( output_filename.c_str(), flags, all_rw ); + if( outfd < 0 && verbosity >= 0 ) + { + if( errno == EEXIST ) + std::fprintf( stderr, "%s: Output file `%s' already exists." + " Use `--force' to overwrite it.\n", + program_name, output_filename.c_str() ); + else + std::fprintf( stderr, "%s: Can't create output file `%s': %s.\n", + program_name, output_filename.c_str(), std::strerror( errno ) ); + } + return outfd; + } + + +void show_error( const char * const msg, const int errcode, const bool help ) throw() + { + if( verbosity >= 0 ) + { + if( msg && msg[0] ) + { + std::fprintf( stderr, "%s: %s", program_name, msg ); + if( errcode > 0 ) + std::fprintf( stderr, ": %s", std::strerror( errcode ) ); + std::fprintf( stderr, "\n" ); + } + if( help && invocation_name && invocation_name[0] ) + std::fprintf( stderr, "Try `%s --help' for more information.\n", + invocation_name ); + } + } + + +void internal_error( const char * const msg ) + { + if( verbosity >= 0 ) + std::fprintf( stderr, "%s: internal error: %s.\n", program_name, msg ); + std::exit( 3 ); + } + + +int main( const int argc, const char * const argv[] ) + { + int infd = -1; + Mode program_mode = m_none; + bool force = false; + bool keep_input_files = false; + bool to_stdout = false; + std::string input_filename; + std::string default_output_filename; + std::vector< std::string > filenames; + invocation_name = argv[0]; + + const Arg_parser::Option options[] = + { + { 'c', "stdout", Arg_parser::no }, + { 'd', "decompress", Arg_parser::no }, + { 'f', "force", Arg_parser::no }, + { 'h', "help", Arg_parser::no }, + { 'k', "keep", Arg_parser::no }, + { 'm', "merge", Arg_parser::no }, + { 'o', "output", Arg_parser::yes }, + { 'q', "quiet", Arg_parser::no }, + { 'R', "repair", Arg_parser::no }, + { 's', "split", Arg_parser::no }, + { 't', "test", Arg_parser::no }, + { 'v', "verbose", Arg_parser::no }, + { 'V', "version", Arg_parser::no }, + { 0 , 0, Arg_parser::no } }; + + const Arg_parser parser( argc, argv, options ); + if( parser.error().size() ) // bad option + { show_error( parser.error().c_str(), 0, true ); return 1; } + + int argind = 0; + for( ; argind < parser.arguments(); ++argind ) + { + const int code = parser.code( argind ); + if( !code ) break; // no more options + switch( code ) + { + case 'c': to_stdout = true; break; + case 'd': set_mode( program_mode, m_decompress ); break; + case 'f': force = true; break; + case 'h': show_help(); return 0; + case 'k': keep_input_files = true; break; + case 'm': set_mode( program_mode, m_merge ); break; + case 'o': default_output_filename = parser.argument( argind ); break; + case 'q': verbosity = -1; break; + case 'R': set_mode( program_mode, m_repair ); break; + case 's': set_mode( program_mode, m_split ); break; + case 't': set_mode( program_mode, m_test ); break; + case 'v': if( verbosity < 4 ) ++verbosity; break; + case 'V': show_version(); return 0; + default : internal_error( "uncaught option" ); + } + } // end process options + + if( program_mode == m_none ) + { + show_error( "You must specify the operation to be performed.", 0, true ); + return 1; + } + + switch( program_mode ) + { + case m_generate: + case m_recover: + case m_update: + case m_none: internal_error( "invalid operation" ); break; + case m_decompress: break; + case m_merge: + { + std::vector< std::string > filenames; + for( ; argind < parser.arguments(); ++argind ) + filenames.push_back( parser.argument( argind ) ); + if( filenames.size() < 2 ) + { show_error( "You must specify at least 2 files.", 0, true ); return 1; } + if( !default_output_filename.size() ) + default_output_filename = insert_fixed( filenames[0] ); + return merge_files( filenames, default_output_filename, force ); + } break; + case m_repair: + { + if( argind + 1 != parser.arguments() ) + { show_error( "You must specify exactly 1 file.", 0, true ); return 1; } + if( !default_output_filename.size() ) + default_output_filename = insert_fixed( parser.argument( argind ) ); + return repair_file( parser.argument( argind ), default_output_filename, force ); + } break; + case m_split: + { + if( argind + 1 != parser.arguments() ) + { show_error( "You must specify exactly 1 file.", 0, true ); return 1; } + return split_file( parser.argument( argind ), default_output_filename, force ); + } break; + case m_test: break; + } + + bool filenames_given = false; + for( ; argind < parser.arguments(); ++argind ) + { + if( parser.argument( argind ) != "-" ) filenames_given = true; + filenames.push_back( parser.argument( argind ) ); + } + + if( filenames.empty() ) filenames.push_back("-"); + if( !to_stdout && program_mode != m_test && + ( filenames_given || default_output_filename.size() ) ) + set_signals(); + + Pretty_print pp( filenames, verbosity ); + if( program_mode == m_test ) + outfd = -1; + else if( program_mode != m_decompress ) + internal_error( "invalid decompressor operation" ); + + int retval = 0; + for( unsigned int i = 0; i < filenames.size(); ++i ) + { + struct stat in_stats; + output_filename.clear(); + + if( !filenames[i].size() || filenames[i] == "-" ) + { + input_filename.clear(); + infd = STDIN_FILENO; + if( program_mode != m_test ) + { + if( to_stdout || !default_output_filename.size() ) + outfd = STDOUT_FILENO; + else + { + output_filename = default_output_filename; + outfd_mode = all_rw; + if( !open_outstream( force ) ) + { + if( outfd == -1 && retval < 1 ) retval = 1; + close( infd ); infd = -1; + continue; + } + } + } + } + else + { + input_filename = filenames[i]; + const int eindex = extension_index( input_filename ); + infd = open_instream( input_filename, &in_stats, to_stdout ); + if( infd < 0 ) { if( retval < 1 ) retval = 1; continue; } + if( program_mode != m_test ) + { + if( to_stdout ) outfd = STDOUT_FILENO; + else + { + set_d_outname( input_filename, eindex ); + outfd_mode = usr_rw; + if( !open_outstream( force ) ) + { + if( outfd == -1 && retval < 1 ) retval = 1; + close( infd ); infd = -1; + continue; + } + } + } + } + + if( !check_tty( infd ) ) return 1; + + if( output_filename.size() && !to_stdout && program_mode != m_test ) + delete_output_on_interrupt = true; + const struct stat * const in_statsp = input_filename.size() ? &in_stats : 0; + pp.set_name( input_filename ); + const int tmp = decompress( infd, pp, program_mode == m_test ); + if( tmp > retval ) retval = tmp; + if( tmp && program_mode != m_test ) cleanup_and_fail( retval ); + + if( delete_output_on_interrupt ) + close_and_set_permissions( in_statsp ); + if( input_filename.size() ) + { + close( infd ); infd = -1; + if( !keep_input_files && !to_stdout && program_mode != m_test ) + std::remove( input_filename.c_str() ); + } + } + if( outfd >= 0 && close( outfd ) != 0 ) + { + show_error( "Can't close stdout", errno ); + if( retval < 1 ) retval = 1; + } + return retval; + } diff --git a/merge.cc b/merge.cc new file mode 100644 index 0000000..298d90b --- /dev/null +++ b/merge.cc @@ -0,0 +1,406 @@ +/* Lziprecover - Data recovery tool for lzipped files + Copyright (C) 2009, 2010, 2011 Antonio Diaz Diaz. + + This program 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 . +*/ + +#define _FILE_OFFSET_BITS 64 + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#include "lzip.h" +#include "decoder.h" + + +namespace { + +class Block + { + long long pos_, size_; // pos + size <= LLONG_MAX + +public: + Block( const long long p, const long long s ) throw() + : pos_( p ), size_( s ) {} + + long long pos() const throw() { return pos_; } + long long size() const throw() { return size_; } + long long end() const throw() { return pos_ + size_; } + + void pos( const long long p ) throw() { pos_ = p; } + void size( const long long s ) throw() { size_ = s; } + void shift( Block & b ) throw() { ++size_; ++b.pos_; --b.size_; } + }; + + +bool copy_and_diff_file( const std::vector< int > & infd_vector, + const int outfd, std::vector< Block > & block_vector ) + { + const int buffer_size = 65536; + std::vector< uint8_t * > buffer_vector( infd_vector.size() ); + for( unsigned int i = 0; i < infd_vector.size(); ++i ) + buffer_vector[i] = new uint8_t[buffer_size]; + Block b( 0, 0 ); + long long partial_pos = 0; + int equal_bytes = 0; + bool error = false; + + while( true ) + { + const int rd = readblock( infd_vector[0], buffer_vector[0], buffer_size ); + if( rd != buffer_size && errno ) + { show_error( "Error reading input file", errno ); error = true; break; } + if( rd > 0 ) + { + for( unsigned int i = 1; i < infd_vector.size(); ++i ) + if( readblock( infd_vector[i], buffer_vector[i], rd ) != rd ) + { show_error( "Error reading input file", errno ); + error = true; break; } + if( error ) break; + const int wr = writeblock( outfd, buffer_vector[0], rd ); + if( wr != rd ) + { show_error( "Error writing output file", errno ); + error = true; break; } + for( int i = 0; i < rd; ++i ) + { + while( i < rd && b.pos() == 0 ) + { + for( unsigned int j = 1; j < infd_vector.size(); ++j ) + if( buffer_vector[0][i] != buffer_vector[j][i] ) + { b.pos( partial_pos + i ); break; } // begin block + ++i; + } + while( i < rd && b.pos() > 0 ) + { + ++equal_bytes; + for( unsigned int j = 1; j < infd_vector.size(); ++j ) + if( buffer_vector[0][i] != buffer_vector[j][i] ) + { equal_bytes = 0; break; } + if( equal_bytes >= 2 ) // end block + { + b.size( partial_pos + i - ( equal_bytes - 1 ) - b.pos() ); + block_vector.push_back( b ); + b.pos( 0 ); + equal_bytes = 0; + } + ++i; + } + } + partial_pos += rd; + } + if( rd < buffer_size ) break; // EOF + } + if( b.pos() > 0 ) // finish last block + { + b.size( partial_pos - b.pos() ); + block_vector.push_back( b ); + } + for( unsigned int i = 0; i < infd_vector.size(); ++i ) + delete[] buffer_vector[i]; + return !error; + } + + +int ipow( const unsigned int base, const unsigned int exponent ) throw() + { + int result = 1; + for( unsigned int i = 0; i < exponent; ++i ) + { + if( INT_MAX / base >= (unsigned int)result ) result *= base; + else { result = INT_MAX; break; } + } + return result; + } + + +int open_input_files( const std::vector< std::string > & filenames, + std::vector< int > & infd_vector, long long & isize ) + { + bool identical = false; + for( unsigned int i = 1; i < filenames.size(); ++i ) + if( filenames[0] == filenames[i] ) + { identical = true; break; } + if( !identical ) + for( unsigned int i = 0; i < filenames.size(); ++i ) + { + struct stat in_stats; + ino_t st_ino0 = 0; + dev_t st_dev0 = 0; + infd_vector[i] = open_instream( filenames[i], &in_stats, true, true ); + if( infd_vector[i] < 0 ) return 1; + if( i == 0 ) { st_ino0 = in_stats.st_ino; st_dev0 = in_stats.st_dev; } + else if( st_ino0 == in_stats.st_ino && st_dev0 == in_stats.st_dev ) + { identical = true; break; } + } + if( identical ) { show_error( "Two input files are the same." ); return 1; } + + isize = 0; + for( unsigned int i = 0; i < filenames.size(); ++i ) + { + const long long tmp = lseek( infd_vector[i], 0, SEEK_END ); + if( tmp < 0 ) + { + if( verbosity >= 0 ) + std::fprintf( stderr, "File `%s' is not seekable.\n", filenames[i].c_str() ); + return 1; + } + if( i == 0 ) + { + isize = tmp; + if( isize < 36 ) { show_error( "Input file is too short." ); return 2; } + } + else if( isize != tmp ) + { show_error( "Sizes of input files are different." ); return 1; } + } + + for( unsigned int i = 0; i < filenames.size(); ++i ) + if( !verify_single_member( infd_vector[i], isize ) ) + return 2; + + for( unsigned int i = 0; i < filenames.size(); ++i ) + { + if( lseek( infd_vector[i], 0, SEEK_SET ) < 0 ) + { show_error( "Seek error in input file", errno ); return 1; } + if( try_decompress( infd_vector[i], isize ) ) + { + if( verbosity >= 1 ) + std::printf( "File `%s' has no errors. Recovery is not needed.\n", + filenames[i].c_str() ); + return 0; + } + if( lseek( infd_vector[i], 0, SEEK_SET ) < 0 ) + { show_error( "Seek error in input file", errno ); return 1; } + } + return -1; + } + +} // end namespace + + +void cleanup_and_fail( const std::string & output_filename, + const int outfd, const int retval ) throw() + { + if( outfd >= 0 ) close( outfd ); + if( std::remove( output_filename.c_str() ) != 0 && errno != ENOENT ) + show_error( "WARNING: deletion of output file (apparently) failed." ); + std::exit( retval ); + } + + +bool copy_file( const int infd, const int outfd, const long long size ) + { + long long rest = size; + const int buffer_size = 65536; + uint8_t * const buffer = new uint8_t[buffer_size]; + bool error = false; + + while( true ) + { + const int block_size = std::min( (long long)buffer_size, rest ); + if( block_size <= 0 ) break; + const int rd = readblock( infd, buffer, block_size ); + if( rd != block_size && errno ) + { show_error( "Error reading input file", errno ); error = true; break; } + if( rd > 0 ) + { + const int wr = writeblock( outfd, buffer, rd ); + if( wr != rd ) + { show_error( "Error writing output file", errno ); + error = true; break; } + rest -= rd; + } + if( rd < block_size ) break; // EOF + } + delete[] buffer; + return !error; + } + + +bool try_decompress( const int fd, const long long file_size, + long long * failure_posp ) + { + try { + Range_decoder rdec( fd ); + File_header header; + rdec.reset_member_position(); + for( int i = 0; i < File_header::size; ++i ) + header.data[i] = rdec.get_byte(); + if( !rdec.finished() && // End Of File + header.verify_magic() && + header.version() == 1 && + header.dictionary_size() >= min_dictionary_size && + header.dictionary_size() <= max_dictionary_size ) + { + LZ_decoder decoder( header, rdec, -1 ); + std::vector< std::string > dummy_filenames; + Pretty_print dummy( dummy_filenames, -1 ); + + if( decoder.decode_member( dummy ) == 0 && + rdec.member_position() == file_size ) return true; + if( failure_posp ) *failure_posp = rdec.member_position(); + } + } + catch( std::bad_alloc ) + { + show_error( "Not enough memory. Find a machine with more memory." ); + std::exit( 1 ); + } + catch( Error e ) {} + return false; + } + + +bool verify_header( const File_header & header ) + { + if( !header.verify_magic() ) + { + show_error( "Bad magic number (file not in lzip format)." ); + return false; + } + if( header.version() == 0 ) + { + show_error( "Version 0 member format can't be recovered." ); + return false; + } + if( header.version() != 1 ) + { + if( verbosity >= 0 ) + std::fprintf( stderr, "Version %d member format not supported.\n", + header.version() ); + return false; + } + return true; + } + + +bool verify_single_member( const int fd, const long long file_size ) + { + File_header header; + if( lseek( fd, 0, SEEK_SET ) < 0 || + readblock( fd, header.data, File_header::size ) != File_header::size ) + { show_error( "Error reading member header", errno ); return false; } + if( !verify_header( header ) ) return false; + + File_trailer trailer; + if( lseek( fd, -File_trailer::size(), SEEK_END ) < 0 || + readblock( fd, trailer.data, File_trailer::size() ) != File_trailer::size() ) + { show_error( "Error reading member trailer", errno ); return false; } + const long long member_size = trailer.member_size(); + if( member_size != file_size ) + { + if( member_size < file_size && + lseek( fd, -member_size, SEEK_END ) > 0 && + readblock( fd, header.data, File_header::size ) == File_header::size && + verify_header( header ) ) + show_error( "Input file has more than 1 member. Split it first." ); + else + show_error( "Member size in input file trailer is corrupt." ); + return false; + } + return true; + } + + +int merge_files( const std::vector< std::string > & filenames, + const std::string & output_filename, const bool force ) + { + std::vector< int > infd_vector( filenames.size() ); + long long isize = 0; + const int retval = open_input_files( filenames, infd_vector, isize ); + if( retval >= 0 ) return retval; + + const int outfd = open_outstream_rw( output_filename, force ); + if( outfd < 0 ) return 1; + + // vector of data blocks differing among the copies of the input file. + std::vector< Block > block_vector; + if( !copy_and_diff_file( infd_vector, outfd, block_vector ) ) + cleanup_and_fail( output_filename, outfd, 1 ); + + if( !block_vector.size() ) + { show_error( "Input files are identical. Recovery is not possible." ); + cleanup_and_fail( output_filename, outfd, 2 ); } + + const bool single_block = ( block_vector.size() == 1 ); + if( single_block && block_vector[0].size() < 2 ) + { show_error( "Input files have the same byte damaged." + " Try repairing one of them." ); + cleanup_and_fail( output_filename, outfd, 2 ); } + + if( ipow( filenames.size(), block_vector.size() ) >= INT_MAX || + ( single_block && + ipow( filenames.size(), 2 ) >= INT_MAX / block_vector[0].size() ) ) + { show_error( "Input files are too damaged. Recovery is not possible." ); + cleanup_and_fail( output_filename, outfd, 2 ); } + + const int shifts = ( single_block ? block_vector[0].size() - 1 : 1 ); + if( single_block ) + { + Block b( block_vector[0].pos() + 1, block_vector[0].size() - 1 ); + block_vector[0].size( 1 ); + block_vector.push_back( b ); + } + + const int base_variations = ipow( filenames.size(), block_vector.size() ); + const int variations = ( base_variations * shifts ) - 2; + bool done = false; + for( int var = 1; var <= variations; ++var ) + { + if( verbosity >= 1 ) + { + std::printf( "Trying variation %d of %d \r", var, variations ); + std::fflush( stdout ); + } + int tmp = var; + for( unsigned int i = 0; i < block_vector.size(); ++i ) + { + const int infd = infd_vector[tmp % filenames.size()]; + tmp /= filenames.size(); + if( lseek( infd, block_vector[i].pos(), SEEK_SET ) < 0 || + lseek( outfd, block_vector[i].pos(), SEEK_SET ) < 0 || + !copy_file( infd, outfd, block_vector[i].size() ) ) + { show_error( "Error reading output file", errno ); + cleanup_and_fail( output_filename, outfd, 1 ); } + } + if( lseek( outfd, 0, SEEK_SET ) < 0 ) + { show_error( "Seek error in output file", errno ); + cleanup_and_fail( output_filename, outfd, 1 ); } + if( try_decompress( outfd, isize ) ) + { done = true; break; } + if( var % base_variations == 0 ) block_vector[0].shift( block_vector[1] ); + } + if( verbosity >= 1 ) std::printf( "\n" ); + + if( close( outfd ) != 0 ) + { + show_error( "Error closing output file", errno ); + cleanup_and_fail( output_filename, -1, 1 ); + } + if( !done ) + { + show_error( "Some error areas overlap. Can't recover input file." ); + cleanup_and_fail( output_filename, -1, 2 ); + } + if( verbosity >= 1 ) + std::printf( "Input files merged successfully.\n" ); + return 0; + } diff --git a/repair.cc b/repair.cc new file mode 100644 index 0000000..8a92e59 --- /dev/null +++ b/repair.cc @@ -0,0 +1,114 @@ +/* Lziprecover - Data recovery tool for lzipped files + Copyright (C) 2009, 2010, 2011 Antonio Diaz Diaz. + + This program 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 . +*/ + +#define _FILE_OFFSET_BITS 64 + +#include +#include +#include +#include +#include +#include +#include +#include + +#include "lzip.h" + + +int repair_file( const std::string & input_filename, + const std::string & output_filename, const bool force ) + { + struct stat in_stats; + const int infd = open_instream( input_filename, &in_stats, true, true ); + if( infd < 0 ) return 1; + const long long isize = lseek( infd, 0, SEEK_END ); + if( isize < 0 ) + { show_error( "Input file is not seekable", errno ); return 1; } + if( isize < 36 ) + { show_error( "Input file is too short." ); return 2; } + if( !verify_single_member( infd, isize ) ) return 2; + if( lseek( infd, 0, SEEK_SET ) < 0 ) + { show_error( "Seek error in input file", errno ); return 1; } + + long long failure_pos = 0; + if( try_decompress( infd, isize, &failure_pos ) ) + { + if( verbosity >= 1 ) + std::printf( "Input file has no errors. Recovery is not needed.\n" ); + return 0; + } + if( failure_pos >= isize - 8 ) failure_pos = isize - 8 - 1; + if( failure_pos < File_header::size ) + { show_error( "Can't repair error in input file." ); return 2; } + + if( lseek( infd, 0, SEEK_SET ) < 0 ) + { show_error( "Seek error in input file", errno ); return 1; } + + const int outfd = open_outstream_rw( output_filename, force ); + if( outfd < 0 ) { close( infd ); return 1; } + if( !copy_file( infd, outfd ) ) + cleanup_and_fail( output_filename, outfd, 1 ); + + const long long min_pos = + std::max( (long long)File_header::size, failure_pos - 1000 ); + bool done = false; + for( long long pos = failure_pos; pos >= min_pos; --pos ) + { + if( verbosity >= 1 ) + { + std::printf( "Trying position %lld \r", pos ); + std::fflush( stdout ); + } + uint8_t byte; + if( lseek( outfd, pos, SEEK_SET ) < 0 || + readblock( outfd, &byte, 1 ) != 1 ) + { show_error( "Error reading output file", errno ); + cleanup_and_fail( output_filename, outfd, 1 ); } + for( int i = 0; i < 255; ++i ) + { + ++byte; + if( lseek( outfd, pos, SEEK_SET ) < 0 || + writeblock( outfd, &byte, 1 ) != 1 || + lseek( outfd, 0, SEEK_SET ) < 0 ) + { show_error( "Error writing output file", errno ); + cleanup_and_fail( output_filename, outfd, 1 ); } + if( try_decompress( outfd, isize ) ) + { done = true; break; } + } + if( done ) break; + ++byte; + if( lseek( outfd, pos, SEEK_SET ) < 0 || + writeblock( outfd, &byte, 1 ) != 1 ) + { show_error( "Error writing output file", errno ); + cleanup_and_fail( output_filename, outfd, 1 ); } + } + if( verbosity >= 1 ) std::printf( "\n" ); + + if( close( outfd ) != 0 ) + { + show_error( "Error closing output file", errno ); + cleanup_and_fail( output_filename, -1, 1 ); + } + if( !done ) + { + show_error( "Error is larger than 1 byte. Can't repair input file." ); + cleanup_and_fail( output_filename, -1, 2 ); + } + if( verbosity >= 1 ) + std::printf( "Copy of input file repaired successfully.\n" ); + return 0; + } diff --git a/split.cc b/split.cc new file mode 100644 index 0000000..d6538f8 --- /dev/null +++ b/split.cc @@ -0,0 +1,176 @@ +/* Lziprecover - Data recovery tool for lzipped files + Copyright (C) 2009, 2010, 2011 Antonio Diaz Diaz. + + This program 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 . +*/ + +#define _FILE_OFFSET_BITS 64 + +#include +#include +#include +#include +#include +#include +#include +#include + +#include "lzip.h" + + +namespace { + +void first_filename( const std::string & input_filename, + const std::string & default_output_filename, + std::string & output_filename ) + { + if( default_output_filename.size() ) + output_filename = default_output_filename; + else + output_filename = input_filename; + int b = output_filename.size(); + while( b > 0 && output_filename[b-1] != '/' ) --b; + output_filename.insert( b, "rec00001" ); + } + + +bool next_filename( std::string & output_filename ) + { + int b = output_filename.size(); + while( b > 0 && output_filename[b-1] != '/' ) --b; + for( int i = b + 7; i >= b + 3; --i ) // "rec00001" + { + if( output_filename[i] < '9' ) { ++output_filename[i]; return true; } + else output_filename[i] = '0'; + } + return false; + } + + +// Search forward from 'pos' for "LZIP" (Boyer-Moore algorithm) +// Return pos of found string or 'pos+size' if not found. +// +int find_magic( const uint8_t * const buffer, const int pos, const int size ) throw() + { + const unsigned char table[256] = { + 4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4, + 4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4, + 4,4,4,4,4,4,4,4,4,1,4,4,3,4,4,4,4,4,4,4,4,4,4,4,4,4,2,4,4,4,4,4, + 4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4, + 4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4, + 4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4, + 4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4, + 4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4 }; + + for( int i = pos; i <= pos + size - 4; i += table[buffer[i+3]] ) + if( buffer[i] == 'L' && buffer[i+1] == 'Z' && + buffer[i+2] == 'I' && buffer[i+3] == 'P' ) + return i; // magic string found + return pos + size; + } + + +int do_split_file( const std::string & input_filename, uint8_t * & base_buffer, + const std::string & default_output_filename, const bool force ) + { + const int hsize = File_header::size; + const int tsize = File_trailer::size(); + const int buffer_size = 65536; + const int base_buffer_size = tsize + buffer_size + hsize; + base_buffer = new uint8_t[base_buffer_size]; + uint8_t * const buffer = base_buffer + tsize; + + struct stat in_stats; + const int infd = open_instream( input_filename, &in_stats, true, true ); + if( infd < 0 ) return 1; + int size = readblock( infd, buffer, buffer_size + hsize ) - hsize; + bool at_stream_end = ( size < buffer_size ); + if( size != buffer_size && errno ) + { show_error( "Read error", errno ); return 1; } + if( size <= tsize ) + { show_error( "Input file is too short." ); return 2; } + if( !verify_header( *(File_header *)buffer ) ) return 2; + + std::string output_filename; + first_filename( input_filename, default_output_filename, output_filename ); + int outfd = open_outstream_rw( output_filename, force ); + if( outfd < 0 ) { close( infd ); return 1; } + + long long partial_member_size = 0; + while( true ) + { + int pos = 0; + for( int newpos = 1; newpos <= size; ++newpos ) + { + newpos = find_magic( buffer, newpos, size + 4 - newpos ); + if( newpos <= size ) + { + long long member_size = 0; + for( int i = 1; i <= 8; ++i ) + { member_size <<= 8; member_size += base_buffer[tsize+newpos-i]; } + if( partial_member_size + newpos - pos == member_size ) + { // header found + const int wr = writeblock( outfd, buffer + pos, newpos - pos ); + if( wr != newpos - pos ) + { show_error( "Write error", errno ); return 1; } + if( close( outfd ) != 0 ) + { show_error( "Error closing output file", errno ); return 1; } + if( !next_filename( output_filename ) ) + { show_error( "Too many members in file." ); close( infd ); return 1; } + outfd = open_outstream_rw( output_filename, force ); + if( outfd < 0 ) { close( infd ); return 1; } + partial_member_size = 0; + pos = newpos; + } + } + } + + if( at_stream_end ) + { + const int wr = writeblock( outfd, buffer + pos, size + hsize - pos ); + if( wr != size + hsize - pos ) + { show_error( "Write error", errno ); return 1; } + break; + } + if( pos < buffer_size ) + { + partial_member_size += buffer_size - pos; + const int wr = writeblock( outfd, buffer + pos, buffer_size - pos ); + if( wr != buffer_size - pos ) + { show_error( "Write error", errno ); return 1; } + } + std::memcpy( base_buffer, base_buffer + buffer_size, tsize + hsize ); + size = readblock( infd, buffer + hsize, buffer_size ); + at_stream_end = ( size < buffer_size ); + if( size != buffer_size && errno ) + { show_error( "Read error", errno ); return 1; } + } + close( infd ); + if( close( outfd ) != 0 ) + { show_error( "Error closing output file", errno ); return 1; } + return 0; + } + +} // end namespace + + +int split_file( const std::string & input_filename, + const std::string & default_output_filename, const bool force ) + { + uint8_t * base_buffer; + const int retval = do_split_file( input_filename, base_buffer, + default_output_filename, force ); + delete[] base_buffer; + return retval; + } diff --git a/testsuite/check.sh b/testsuite/check.sh new file mode 100755 index 0000000..5885ba2 --- /dev/null +++ b/testsuite/check.sh @@ -0,0 +1,103 @@ +#! /bin/sh +# check script for Lziprecover - Data recovery tool for lzipped files +# Copyright (C) 2009, 2010, 2011 Antonio Diaz Diaz. +# +# This script is free software: you have unlimited permission +# to copy, distribute and modify it. + +LC_ALL=C +export LC_ALL +objdir=`pwd` +testdir=`cd "$1" ; pwd` +LZIPRECOVER="${objdir}"/lziprecover +framework_failure() { echo "failure in testing framework" ; exit 1 ; } + +if [ ! -x "${LZIPRECOVER}" ] ; then + echo "${LZIPRECOVER}: cannot execute" + exit 1 +fi + +if [ -d tmp ] ; then rm -rf tmp ; fi +mkdir tmp +cd "${objdir}"/tmp + +ln "${testdir}"/test.txt in || framework_failure +ln "${testdir}"/test_v1.lz in.lz || framework_failure +cat in.lz in.lz in.lz > in3.lz || framework_failure +for i in 1 2 3 4 5 ; do + ln "${testdir}"/test_bad${i}.lz bad${i}.lz +done +fail=0 + +# Description of test files for lziprecover: +# test_bad1.lz: byte at offset 67 changed from 0xCC to 0x33 +# test_bad2.lz: [ 34- 66) --> copy of bytes [ 68- 100) +# test_bad3.lz: [ 512-1536) --> zeroed; [2560-3584) --> zeroed +# test_bad4.lz: [3072-4096) --> random data; [4608-5632) --> zeroed +# test_bad5.lz: [1024-2048) --> random data; [5120-6144) --> random data + +printf "testing lziprecover-%s..." "$2" + +"${LZIPRECOVER}" -m -o copy.lz bad1.lz bad2.lz bad1.lz -q +if [ $? != 1 ] ; then fail=1 ; printf - ; else printf . ; fi +"${LZIPRECOVER}" -m -o copy.lz bad1.lz bad2.lz || fail=1 +"${LZIPRECOVER}" -df copy.lz || fail=1 +cmp in copy || fail=1 +printf . +"${LZIPRECOVER}" -m -o copy.lz bad2.lz bad1.lz || fail=1 +"${LZIPRECOVER}" -df copy.lz || fail=1 +cmp in copy || fail=1 +printf . + +for i in 1 2 ; do + for j in 3 4 5 ; do + "${LZIPRECOVER}" -m -o copy.lz bad${i}.lz bad${j}.lz || fail=1 + "${LZIPRECOVER}" -df copy.lz || fail=1 + cmp in copy || fail=1 + printf . + "${LZIPRECOVER}" -m -o copy.lz bad${j}.lz bad${i}.lz || fail=1 + "${LZIPRECOVER}" -df copy.lz || fail=1 + cmp in copy || fail=1 + printf . + done +done + +"${LZIPRECOVER}" -m -o copy.lz bad3.lz bad4.lz bad5.lz || fail=1 +"${LZIPRECOVER}" -df copy.lz || fail=1 +cmp in copy || fail=1 +printf . +"${LZIPRECOVER}" -m -o copy.lz bad4.lz bad5.lz bad3.lz || fail=1 +"${LZIPRECOVER}" -df copy.lz || fail=1 +cmp in copy || fail=1 +printf . +"${LZIPRECOVER}" -m -o copy.lz bad5.lz bad3.lz bad4.lz || fail=1 +"${LZIPRECOVER}" -df copy.lz || fail=1 +cmp in copy || fail=1 +printf . + +"${LZIPRECOVER}" -R in.lz || fail=1 +printf . +"${LZIPRECOVER}" -R -o copy.lz bad2.lz -q +if [ $? != 2 ] ; then fail=1 ; printf - ; else printf . ; fi +"${LZIPRECOVER}" -R -o copy.lz bad1.lz || fail=1 +"${LZIPRECOVER}" -df copy.lz || fail=1 +cmp in copy || fail=1 +printf . + +cat in3.lz > out || framework_failure +printf "garbage" >> out || fail=1 +"${LZIPRECOVER}" -s out -o out.lz || fail=1 +for i in 1 2 3 ; do + "${LZIPRECOVER}" -cd rec0000${i}out.lz > copy || fail=1 + cmp in copy || fail=1 + printf . +done + +echo +if [ ${fail} = 0 ] ; then + echo "tests completed successfully." + cd "${objdir}" && rm -r tmp +else + echo "tests failed." +fi +exit ${fail} diff --git a/testsuite/test.txt b/testsuite/test.txt new file mode 100644 index 0000000..5b244d5 --- /dev/null +++ b/testsuite/test.txt @@ -0,0 +1,676 @@ + + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program 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 . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. + diff --git a/testsuite/test_bad1.lz b/testsuite/test_bad1.lz new file mode 100644 index 0000000000000000000000000000000000000000..0b84883f91edbcfb9e983e45c8d083d9f5b06a52 GIT binary patch literal 11548 zcmV+%E#uNmT1ij=@BjvazdsWr)e!g7zGJf?EFuAflw)XSw5cpSXA75}QX6A_Yv+(arWA$2;@Wpb!)L<~ zTTIlM-&XdqkN}@S{Q`Cq0w);%s+|(5Ao1_f2nUIFO;9rEMsR3U*{2^%QqFRlY3|P^ zelD-U=yL*J?)6WvS3Tla7w73FWgGR2RnVc79)-pQUnP2 zlt+cI2u(mzuN4i|CfCt$6yzfA<1qxN2_NqQmNxqL071(DVqp#LKwxm|C{L(P8%I+N}3J%^dRqF6su*q$5k*WI0V+ z^P;0RtlSPDxkAdTrTi`|^)m(oh!2($|(f=g*PW-*NgK)9@U@B`BOJXJC; z9G=-}Jfo5>u{Z=d^bw(*F`15wt5(`)b-RjRk9_ods%{BVfMz=|gSaSI&cnC0H{$s* zRZd#g8r(@@S;F)lvaR#h95WZNkn0X1O>O3ABrv9Ok^a=;|JT?aWM)hL>kPKFtorR) zRgZJxd-lnAP*>Syu|z=#_B@I>#D&v{zRS;BrTRVJ(JQ7OFfH`%#T$*-dg(R%GZDTk zDZuxwJ3GN$49ulLj9#1eT-~ywR>W^mMePkOG#Q85CK;h>bV*)el?uM2x!ue zH`;T&hZ@W@gG+xT7;cJbR7i!%tqPVO!4$VcH~_fSl3jvKOy0y4U~o!FeXRCnlUP#p z-3#4RYzl2silD*#%Wl`OUu^Mf8#8;=2--;ltP$Fzvl=#9$bG{ss4WKo##2x!VpF?FUDHcSKuf#ASe_bM7A-llx5qAK^CUBK z-gpQuw&C*Hv{B1mz$Iq=aIa3WzsH0b_zJ4>6=d4FhAs80RM943pu2QH`u+D5L=IHL z-1|&9?gF~=__;v1UJNEGYEBmO$dht(`I|gO_fYDe`z!YQS-=Jy&YccTW;vitwpsZr z*I(zV9;yEQ_9dxaeXSo`zz+SY%>l!o96HbR0ZLy;N^aabAVG?MOW?`eN$h&_6#DD; zPQUGy(oR>bdN57`JkK$_FY+fOh?8&ghMcK^9-bK)jc6^L#ZbTr|5VIcFb_IY$TdAW zX@FKi#RM;#+L@cYc;HM*EWN$tiZdS_A>f}%@aIe3+peelQy~qbC%-BUvbSR<2_6LW z1K~wcVuIP>R7&*^>C}by6?F86Efi#!wAJDo$h}ix&PfQSmGNKcE$3B)`<#9@3dNL` z{c%u*d0cT5T1DDGi1XSfZKY!4ysXFC(A97)BM?hTH~Et~i#uyRY&tXOE&uq2aqx1? z$dWIzD4@M86Xm=%&$o_g+hI82cT7r-PuNLG(Pq!D@!ggZYP6~5&|JuAX4a4Kq% z=(;Vl>M{tZj)O0Efw0HjF^>!PXWA_TvUm1vA=y7nDNITSU&1QNlYVrWE_Ox&$~%vh zu!u$v#1UGs-XBrwY^zm#xTtdq<@xjpW!+LO$UL|hsn%vetOMJUCF3Q1mB*v1*hc)% zR5^eVh&dE}6Rc7)W;sYG`6}kt{Gc1;TTWj&<+0x9|9To@hT#=rpFH&nQed; zzKL{~b70$`j`A!}yzBC3dFZV7ka|PdW_U~U7xNxtw)8xNtABKi;W~~}-b)zx1_$ZQ zVhYtLQyDYble=K@4~-#Th0s8o8wAPSk=vhQK)>(oZ?=(RyT>+q#*LM|Dj)@y_+5Ya z|14F5-rl+|gz@@*JE*p#I!?a@-Q#3!_3`hAGHMHyy@yY zR+L=~h{>8os>FKEK)Ctdsmku88|8Pf59De6=-VH393sAVbTD4jVx_%*GgFeH%gI0=XnY z?{~Y!rMzA)VTXN0P@Q;aA%2Kz{zbHlOULJ2!(B+4>y?MXFltbEKn_wLfY{k4uTuD( zqC9^67DNZPM@o0R{!Nd`^|2kd!G(*wKIVgx|0urk=#}P$e^GC~d*(#GfM~rEoNC(Z z$z+whjBz!dZcHSx*VG?$LH=u2-O8D#r>cQL@+x5WRD(kuOUL|NBv<9Ra=eI?8DWB< z^h++5H^LPM-@zP%gqaEz4{1y#05Hwc@Vd{HEic;aOPRK zz@wXmCKadKKu#LRpHj`cG4L#q1F++%XoHDAYD2jL3CfFQ{9ka{yrW(D;HK@SI54 zPQic0^{U{G=tuEAE5_&04pFmdo+x?)GnP+lCe7xOp;z+y1ZF_8!tD`PoaWP^(%o}a zB*5(VROPyBWrU(GqJNyTck}>ZFT10KZ1^p&IJtAWMf(K(U3<;j)VS4|S-uP8)#p5& z{+dW(6jMV~)MbF;?9oR3mTiQeE4%MGrD9Uy9Tbc!qmWE&kl>UA+V_Z&8hwnKc5QwL zyN8yyH|d8v`aflna|(Z|J&s3XXM%wrU++&+-gD_4k<;0htpyd;9=uL{pw$Ab$P*(a+(QMUhnsj@fSG1^2(iBZ`U3PHuPIy z`oqu+6gZfnih1os3nzc0{dlKUetVg|P}>AL9PzymIt27wjKVsoFUm;(({I@#Li=>aUyg_|B; zofslL>S5WX8w+ZamN;)` z{mdX3JE5DGP2s7jOCgCrZ=6>0-3eVxtjKy^Ko?Lcc(Z6#p8to-U>j!#Mz|jZwUQx% zmMic3(YgbUC>s$Y@Vx_hf3=N-S1n*6W029JM}fw?aRhAvBmZ0I!PD z5!F>i8YFM?%{0Cph1{KDKI||EzY>m0RT50S_vY*>h3q$Zdb)Y^j5qOa6W&H;Xeg_V zdJd29hePJqyL87nWZrjlhbJFY0UPxh?R|bq_6#O-H$0_`6__h$4#bWsa#Y?y0bl@VduVVlOblg?L*@k0vmeOn* zA^3g_fVAwc{K&HHt!eI2@t?0)3BS3UIZ0~hRm&5`|7@kL$#%Z41>yw4cidk4z~2tx z%dFht)G|;@z$z^dJBl-g6ZaW_B`1cAnAD67*BhJatHKPEV00ZGs%`Qz=-^G^itCbB zbm}6iJox%g=fwB6VgmM3YIBo|(Kf zUUD_`o%&w8(PX;gxbS0s<=a7fh=Pe_;|KAZjzc-(HGOfaow1Q>myVPdt)0va$^-o( zTk=yMFfBT`DV#oVTq%B%G%TCgp1E~za)>$c?0T8f7&d@fhHer6`gCY4g1qEjAAr|k zQY&F)3{rT{2fsJ^U|Cz}v>wt(Fz&M$8fQkM@)JV7%MqHsM|qj1*cz7eqNwN}-umgW zRqE&DtBhgf|C40($Kxcu|DoGEUm+S@7MP|cf2F`Q~7)5i=CgP+&hq+R@ zJ;mOYwH1k(7xhTU)RmM%tbS6@qtDQP1K-IOZ`O52o4+#xn@CO#mN`7pcP+}tO4`g! z$9IkM@4zexq_86DIMmE?##gY%O&0&dg0v=oYhIl5P{*89%82rs-1Hw~TJ<2)@3UZl zI{vEMKsXBDeFZ}t%tZPOQ7iG}2EtDSwYCgadL7hxq&otuzQlqH1xjP>QU5AUmL`UT z%EYoi)CK5qB1eys;`5SJi=RXbp}{9bkMxa7~!W~%Uz zUm$5kdMmyGh38bLqPvj;xPOrVMSvmQvkwfUs!nlHSH9str z8JB-wyZd(M)*O;AG4m(5oX>hgP0?^?*&@72`?pqcH$i$e8qq8t2S)HF5C{y;y|q4S z#1N1m>_K17`clOvF6=FP@v~6Ptee8o8;~||n72tyD986Qo zatnz^jUF+R%MsW@FmO5>-AQWyz-Uo6J{A>nuoxGM66_< zF>hGRO$-pJF;1In4*Q>!^r`EK28?i~d@=c6{hJs#Op{yTEo>4GKN5mIUGtWfY?NqR z&g@N4qMd9GYJ12{<$cg5-zxCMnYk1hJk3+5XMh$5&E9gb(yQ=qJle6K#3+-F9DgVT zPQ9KdBn#eMbb^&b+v11&FdOfdVe6kzS-8&fkg$Qbc6B1jL)-)(jPjh+(iOs(-NF8pPyz#{6Fz@z>b~dO z)&JF+hUXb6vG?cQRHFQcmFKx}Y9p)U*qJd7a#|e`u4y9n$(VB?HSv_@CoB2>M9j9# zhk&q&A8%2FJPdnF^p$q;{ATFmm4KbVuVdwpHHRjA*Pp+($CsbsUw-i7bY>0$ zgGQE#>|%QQ>|K`V-(*n$Ug=h%1*csg6o1P=685`ubXA~G(@S*_kkF}4*Z`#F>$rn)>q25m`+{OQ-lGT#TK+VHIS5h&h8ipjZ?*y1#K4!}AQ`HnQ2g^H z4V4i)6X^3-4`I0*b9d%2>g5{C@5_6-oyEUDD12bJXhVDGzu)Dv2$#$Iq!}4_X-A0F zr214D{VP^&Ij}-T*+@8Z84;8|@V;95h)LvI;~pDDBdugRuuT*_XMbOxX1tIAC3f>tu(f*6g@ndg!=nF6MmiVJ$&7-wTS8~59EkIJrGK5BFl#5g!>TITohh* zFALaj8QRpVWi)Rl>p^8O+}c)qu0*rLWp25~4Z8||o+e`7nhLwGA0;ex_zjMuK@`Pi z@pEH5I6|2HRf%6?SZFBk)~$rfG`dmNvkcBsP*o!@jLQu(@G8?gSDmfwR<*}J`VRC6 zW&tZHab4o3_`V2>LX3h%q$Elr>P?3nG8g#h z>U(c8Sn@Wh@WXTk<7bH)r>7E7zJej8uJ9j{AJ{fg2+djAsJWN(7X zlSKG#zR;KYi9JvC-g;y!F2gF#=W^*1Fzxn{nhzZn!34sJ9oLxxtflpQJ9O`ZP(4>a z+h{2#>4+XC^6UTVg^GGz!5MU-Q%*0K=)`IPDW_V{Z`zTunf9~I36pW^TXDs8iO|n_ zNlpbL4@@-Q$+m*&%_z1qc2Bq#)tx_v})ScCOQ_P$+p09n>a+`z0fEKyG)#8kahzN7P@q3 zW;v5--V&@n;_J4{7@JraU=kI>`jCr^+Gk}GAc~8Z>v#>F=X*NG!Uw1UoB^m%A9}Vj zSeuKrra0*C4xEG$eP8b-rn{X`rP7IyjM90$nllu{}(~}*_F>3 zMFcND8ca(%Kn~`##S^R+^jVjyquA}1|nfSsV*h7f4v@BB00_V$Mq=sa{ z9aA69uzUKlH>4(r$XY-G#yFxL;PbX+0YL1+Jy!^q(7lDR^u^EfeW!^b!m*M+9QJYN z-^j(cfg)!bD(@C%*>N3jRxO2@bN9F@l$=ieGQ9F8Z!%McqWSB(T3?gE?p27xw@-Ri z7s6#KQBGSj)dY>j^Jc5>l5(g7CKmqNli0?*14V3JT7CB}Gw?VZaDvAwH4kDS7uBd4 zZSUh4ANgH=K{SxEN}!>wCARnI^Lss1i{CZ}AQG@hfAj~`D%IV8wR|P(@u%iK;LNlf zg>kS7-g0P)%iP_PVXl#I`*wqOcZJYNIRJ^$24pK-(KspR3X@!3YIn$*BA8ctys5K2 zDuy{avFi2P56#m;NnLn@=Vyr_l@JYQC^U0O*IOmJ7CrjAhjXfR%S(XVv$Yl1m(Aja zW*85XoK%hzRj#BwWhg2up zv@HgZCTG9Vr%jRPJZWIWEc>r_(&h?A>yKZ&JA`z;fl?1&P{@4tQQPS&^w|XQd{tt^ zseI&d^-O)DDJC`+a6F~sNySHKhflD0ev+r{2}nY)hJ&=c6V9Fr6G;kem3$v;+%?f) zDqo>zRo0*kytg0|fBeq#&sIRWC*rj~UNI8=@UgomPMj^{??nR?ch7mj%w&+3b~Apq z|8uS~sXSE1_Iks~&kZ8zZg>m!I;xgPWt#CAIc#@;W=P`EGe=bQ9)w~4wZ z`v|Z0Hixen_xc(oB*Y75wT@M@a)9!ZO|-#pM=(a$u2O#GltISwGE_L5gCmNd{-=%T;U8aOkF`Q+n&u zlzP*Hyyft8jvtmxHlRkDZNo)n4t~Ek`x^d&mi`PvkADVot-U$`8(h0bOxyIfUK5>i zi+R8;k29}vn5Q^Zytq4TOM_1E5l$V1#^Y);z@hA`=`Lvqf$+dRaW}{n!OK75GVvyV zLYw7360LW7-&i-z5tLyGZhF@LC7aZGGrqxQWWE~)-i4Y%HW&zH3boJeF^5X7KS({} z%Th1ZDN*>hJgug;eow>s6nYzKw+eEF4+MHu81%ima5dnstB!dGU zigaP3FO2i6*~^{M99N6+iyKyCUWJmhLnsg!6{=+X1R`8-BK9)OIL+Pxf#CgORZxC} zqXf!k>r5rS_xxJRg~0dT+{*&V*;ExR%T8mcH5DtImy`F!iel!hDL?J>KsLG4^sgGz z9Zou6>D0h(SEHTi_F)k%NQT-m_Dfx8AX$P_gV*YXY|T%$ID z?^0(AxrX}@6JC?Ar`^TFcr0dE+tj>j`zBAj2yWk)!u)D$u0)mH)bkog=1cIJ{#1|m z9~&4lB+?b)^V$65s!yjBk_pv-m75G92cM0HwvnNPpXj+Tcr{(9X#Z{hOTlT`g9d(< zh!^$`1cdjljv|_#^7}cWN<}VbGa0VDIccyh`tn+)q{Knk)3Z*NIv40v|C{AoEu8c5 zvHSBG#m%IS+aEHG7tW<_LCh?!pEx>|Ld& zz+3{(gpaJQ8nh%>6+K%Hux3tkH}{9C9euy%SpQtZ0XqU zXD>dIQGC!u`hpq8CFv1T85RCq&eFH>mY9gDPNw08i>rj}9!W~F!@HOM(}&l7;zzlr z{Vbms57NhJlzLc}^OvNP6bOvo1GtU=P*Jv&)Dr>s-M6Sznt4>zICYxKS@VEA5W(Pd zVG-0@*heqoU;*LY-ZliLN4`V5Ygk36#l~JYm4U&@3~p4!Kq#WL?(fOjCgtm(>ok|^ zfHPTBRu{PwsgP?q5M^V#>dp@lM%Xtx7Kl#S{0+8G24hyBLgk>kK2XbE-Pv>Yx{c*F z7P-mW2}!`q>ki6r4pKY+%EW9#Nsh9@=b})_2;)RQ>g65|1m&peQc9~xP8o_>|4fh8 zOP=yWIAjgtlgLv5l#OS^qP|{(Jymg#ipQ)Y?AQ)Ap-&wZbPf(qOXD{Ny+G$Rq(1P% zuADZY*oYls^P*yS|8a9F*x{>%(9psYVyj8Ir^D}(lJRqhJmpR;jHu&4br62jQ(mz( z!!_3aiNi)Ie_u3~c>F1-`Mju!K8++y870!DY&MC*&BHZ<9jW^_2`m38#)2pIV}s#R zuiPigOa=u#1c|RBs%J$3!DO}Pl3uVZ1n~OSXYbBGX_IS_fpi+GH|TW((f{X#7_hck z;zSuBahR*F0~4w5JhT(KNKt{VIDK0~ZC7;oTA0ETO|cnz)5TB8nfSl^Y% zPq`7jvnoewaJ%}nnRlvv*9mXp5dx}tCGv82eji=F?_A4(#H(n(g1c@K`rwMJUW-3G zZ!--nIW4ugW=Kxz>`i3DZ%TLeX{ELZsVWp|d`fzEU~1F9m10_zqtMAMW_$`e7OF9s zo@sU)sI$f3B{o79;;Og{LRDqZbvGr6g7*mah+zmkykLn6qLit&8C+{9*I9xvb_|1Y zuSd_<4>qW72YmW1j)kDP+ zm|cdAoA>7yL_#KgLB?RX0A9^ss%s1rpfgnBI0fe3|JKk}h_@t1lhM}TRSMifk$f2n z&wE;qOCE&18LbxKQHPINVdT@gmvqt-Anp~Ta)UW-gIvQ1Nm#0~MiU5eNGyTg5;XiZ z-2Z@?<{GF$a1>_i9?Yzs%;&3$HV0RM*GL81f1_{*;fG)K?hHtwN3T z8m{)OS&zT$B#Y%B!l(2`2`Q&1WjqqMjvpD5oAhaUZn7?BdYUa_AvwVQs!ved{l)p? zPlCU#NYWKTe&~p*Wh3|4j&KcqL7qjH#u5@UlB<`{@kRxKJa|EUADeC&%NIAL{&z@b&g@GEa86deRmR2G^v_fC3o zeO_}1&}JYSQ@noVw1?&)NS0ii16{W!O$4q=3=(q?A-)yIad__Ind~}Hg;ZLOew*#n zh7tVCN@OW$=DPbCQ7t|q8^nU%DY|;Tuq*#$_4%__K3JWYNR<5)SdMLi7 zL?(C+YBY-dOsuVjA7(nYQ>K*8LDszvdWteLE&g}CXbU?cn9I|r)82h?Xe%UeGEWxbC01kZUt*_DP~ zo#|dni{UD$(PF0v`Qt0Ah-;(%=@h}zejQ&xfq>lww))kzZR=pehd^0i1paeI0xw93 zI_VnNXeNI`qz7jS>t4CK)bu_;_$Be%u2b%|<;H-`@}!@~JEgx+cz2mFmd1(|VW6y` zSvnI8mWjtl^MSdpC?JRLYf44z>ddPi&JbPApUIv$3LA7^KZ;?jbfv2U$l7T=%G)Ds9x1}{w<88Cu99>h%@Ejf5n&{aM%X-N0mSQAp*`b&lp#h| zrG;1re9|1UiO)MZRnAKpV;>CJ$Hc7 zLJ7^Pclr%%&L5nNw)Y_$%%m>bo?;GQ1J+9%#)7_RCF}b)gzqTtiAvI~4MT zX1(f79g-oMV&9u4-i@3)cp)z!!!@0wX;vD`F6-bQZ3iNx5jdfB%mmTcFW0K=C?w!C z1}+d-*?|#gvjh$ypyo%D%pscLPXJAuPU5R!gGq3!{9a9PNv5Pu$n)!IXzQNI21l~B zBmAROfM`MJK&2-bRqY# zS;Qhs=&=RKB*1CR;EJN~$*#eG0Jw+fSXR3r_0&OOJGa{&7#_ZPtBPGydTzP#5Oe&@B2%Edi%TZ#55~at&g= z?dsb9Vm$aB02n9mPU;dzH<>6;5bI1HtAAhcd&P4(2xQ>V_iHYy<{(9-j&K zbtuWUmPTdq#zA6%rx5n?k%2$;wv}|V7&AZQIm;AVm5l=GGs%Kj+1)<@y8Z!nvmQ}) zaCq-nvt=~5gpYSBNJ(6a9L^K-Eg^WtLNW{c!(uYHY?I{`vA)hgzKToWFtZS-teQXH zO>TQF-+zMIAVD_CSz6KQ4c+}M-hfn+M;KW!o)+G$O@!*bZIe%jptH;g*?kY6tS;Cae}Fexto$cHf{%j``>1 zuf6x#z1^GgTIQ$tw%`Wp-ORB1JzvdAnNWLEo99-7=>Yl6>uJ}DFq&BhtBfRr(T(dE ztFLu>UE-U?@nH?LfFx`_u5q^wNnme;IHsWNYye?1(YFL7@1}eGwF#*O@pY{|I ze;^Z?mD1M~n3S*|y^MaT6nwosIFT-kdep0bbYK1Q9$EhRUP|xXehBY^RWwN5ZioWR z4^azJRF%Uk1RM=kh8%GF&0n%w<+pg>2W>Ed-^_8msXHvRI1p~FTi2JD&iPrG$H)c< z`ox6f{sQ!(zYh*9O$df=KEIb=&gZBo1IF)9Q7TM{yZ$&<;?CLbQ-n=fCb)SOYEfkA zZU$u9dzNBX6;Ey8`OIC2kX$uwio}VcSwc(Fj~W!{U)eV5!+-aofeFLYa-@ zd1RJ~Ka|7vAd|x#6l5EAo4_60NY+}Qm2WOSSx9rv1Q$e|jaMI`5hvLv+EDBJci+G!iUA;dm6vbjN}ask6kI z#zlD$koqMdIsW!N7R*AAzUaHi2j$O?csl`HtVYQw!uT$i9W%EjUrWur_X(%`ucw@b z+{Xpf!h>d822b*#x?y@44p&R9wmQ}<^^OR~ z)-lv^Ltn5JvPm^OM}Dy-dEeIhy9Bh^Lrds@^88+5%PIHEFScO*=6vB1SmE5f=_4IO z=PvKF>g+oHJwXC5JIqK`T)3gTBZ-emZXb%5lt-|*liRUUJ@_<}NR`EI?}|HRD?%Zk zf}PcMiq1ud`f{($Rol-Ax4w#_-l7C4l#>hDxg_hHY)GhqB%~T5PYiXj5&wd-0EKrV zj(L4bCWG}9@7uS^ff+?30Gbq3A6~Ck8!;4Qt)-gkX`ZZLilJ#VCkjld{6#P>?E4ut zE;Sjj@GWT4_H!|Pv8PkVRa!SLMf{DnVSA1^|HWNtfRoO{r59UjLH90F1_;0#@5Tnl zS?-+5gd_iAq4LvBqiW;iY0pR- z@i*=bsCMg&{V2KkM96Alxf_o68rNV1V7rw1mc8mA8|bjOl#3>lCTrYooDy1V_FE6t zHj0q|70(&g{WBAoQW*!NC{DBv{cpaO87IZIr&#jx@mVN4KnSeYogGP+r{E(O><;*# z9QAcyGGGt4rvT+VNpm&YX}a0^Y}&;~?wEOas$>pScC_IjN19B(9yefr6dj@byo4N* z`N<{PYd59ocT1H?n`GSk`p4eINN=y0^L~e&LuQNbxKv74`>s5IV?*6>(r*lDm_qQr zRr-HrlGEZsY?S9A9vx#8ZxNa7ZQhUfelxP`)ypdqKRDGAgVcW}L3{iOLB zJiv#gcD;!Hu+i#)0C+PMS?x7aQU$i<{^FqVL-FO&4J*M{QEC75e>5C?X6A_Yv+(arWA$2;@Wpb!)L<~ zTTIlM-&XdqkN}@S{Q`Cq0w);%s+|(5Ao1_f2nUIFO;9rEMsR3U*{2^%QqFRlY3|P^ zelD-U=yL*J?)6WvS3Tla7w73FWgGR2RnVc79)-pQUnP2 zlt+cI2u(mzuN4i|CfCt$6yzfA<1qxN2_NqQmNxqL071(DVqp#LKwxm|C{L(P8%I+N}3J%^dRqF6su*q$5k*WI0V+ z^P;0RtlSPDxkAdTrTi`|^)m(oh!2($|(f=g*PW-*NgK)9@U@B`BOJXJC; z9G=-}Jfo5>u{Z=d^bw(*F`15wt5(`)b-RjRk9_ods%{BVfMz=|gSaSI&cnC0H{$s* zRZd#g8r(@@S;F)lvaR#h95WZNkn0X1O>O3ABrv9Ok^a=;|JT?aWM)hL>kPKFtorR) zRgZJxd-lnAP*>Syu|z=#_B@I>#D&v{zRS;BrTRVJ(JQ7OFfH`%#T$*-dg(R%GZDTk zDZuxwJ3GN$49ulLj9#1eT-~ywR>W^mMePkOG#Q85CK;h>bV*)el?uM2x!ue zH`;T&hZ@W@gG+xT7;cJbR7i!%tqPVO!4$VcH~_fSl3jvKOy0y4U~o!FeXRCnlUP#p z-3#4RYzl2silD*#%Wl`OUu^Mf8#8;=2--;ltP$Fzvl=#9$bG{ss4WKo##2x!VpF?FUDHcSKuf#ASe_bM7A-llx5qAK^CUBK z-gpQuw&C*Hv{B1mz$Iq=aIa3WzsH0b_zJ4>6=d4FhAs80RM943pu2QH`u+D5L=IHL z-1|&9?gF~=__;v1UJNEGYEBmO$dht(`I|gO_fYDe`z!YQS-=Jy&YccTW;vitwpsZr z*I(zV9;yEQ_9dxaeXSo`zz+SY%>l!o96HbR0ZLy;N^aabAVG?MOW?`eN$h&_6#DD; zPQUGy(oR>bdN57`JkK$_FY+fOh?8&ghMcK^9-bK)jc6^L#ZbTr|5VIcFb_IY$TdAW zX@FKi#RM;#+L@cYc;HM*EWN$tiZdS_A>f}%@aIe3+peelQy~qbC%-BUvbSR<2_6LW z1K~wcVuIP>R7&*^>C}by6?F86Efi#!wAJDo$h}ix&PfQSmGNKcE$3B)`<#9@3dNL` z{c%u*d0cT5T1DDGi1XSfZKY!4ysXFC(A97)BM?hTH~Et~i#uyRY&tXOE&uq2aqx1? z$dWIzD4@M86Xm=%&$o_g+hI82cT7r-PuNLG(Pq!D@!ggZYP6~5&|JuAX4a4Kq% z=(;Vl>M{tZj)O0Efw0HjF^>!PXWA_TvUm1vA=y7nDNITSU&1QNlYVrWE_Ox&$~%vh zu!u$v#1UGs-XBrwY^zm#xTtdq<@xjpW!+LO$UL|hsn%vetOMJUCF3Q1mB*v1*hc)% zR5^eVh&dE}6Rc7)W;sYG`6}kt{Gc1;TTWj&<+0x9|9To@hT#=rpFH&nQed; zzKL{~b70$`j`A!}yzBC3dFZV7ka|PdW_U~U7xNxtw)8xNtABKi;W~~}-b)zx1_$ZQ zVhYtLQyDYble=K@4~-#Th0s8o8wAPSk=vhQK)>(oZ?=(RyT>+q#*LM|Dj)@y_+5Ya z|14F5-rl+|gz@@*JE*p#I!?a@-Q#3!_3`hAGHMHyy@yY zR+L=~h{>8os>FKEK)Ctdsmku88|8Pf59De6=-VH393sAVbTD4jVx_%*GgFeH%gI0=XnY z?{~Y!rMzA)VTXN0P@Q;aA%2Kz{zbHlOULJ2!(B+4>y?MXFltbEKn_wLfY{k4uTuD( zqC9^67DNZPM@o0R{!Nd`^|2kd!G(*wKIVgx|0urk=#}P$e^GC~d*(#GfM~rEoNC(Z z$z+whjBz!dZcHSx*VG?$LH=u2-O8D#r>cQL@+x5WRD(kuOUL|NBv<9Ra=eI?8DWB< z^h++5H^LPM-@zP%gqaEz4{1y#05Hwc@Vd{HEic;aOPRK zz@wXmCKadKKu#LRpHj`cG4L#q1F++%XoHDAYD2jL3CfFQ{9ka{yrW(D;HK@SI54 zPQic0^{U{G=tuEAE5_&04pFmdo+x?)GnP+lCe7xOp;z+y1ZF_8!tD`PoaWP^(%o}a zB*5(VROPyBWrU(GqJNyTck}>ZFT10KZ1^p&IJtAWMf(K(U3<;j)VS4|S-uP8)#p5& z{+dW(6jMV~)MbF;?9oR3mTiQeE4%MGrD9Uy9Tbc!qmWE&kl>UA+V_Z&8hwnKc5QwL zyN8yyH|d8v`aflna|(Z|J&s3XXM%wrU++&+-gD_4k<;0htpyd;9=uL{pw$Ab$P*(a+(QMUhnsj@fSG1^2(iBZ`U3PHuPIy z`oqu+6gZfnih1os3nzc0{dlKUetVg|P}>AL9PzymIt27wjKVsoFUm;(({I@#Li=>aUyg_|B; zofslL>S5WX8w+ZamN;)` z{mdX3JE5DGP2s7jOCgCrZ=6>0-3eVxtjKy^Ko?Lcc(Z6#p8to-U>j!#Mz|jZwUQx% zmMic3(YgbUC>s$Y@Vx_hf3=N-S1n*6W029JM}fw?aRhAvBmZ0I!PD z5!F>i8YFM?%{0Cph1{KDKI||EzY>m0RT50S_vY*>h3q$Zdb)Y^j5qOa6W&H;Xeg_V zdJd29hePJqyL87nWZrjlhbJFY0UPxh?R|bq_6#O-H$0_`6__h$4#bWsa#Y?y0bl@VduVVlOblg?L*@k0vmeOn* zA^3g_fVAwc{K&HHt!eI2@t?0)3BS3UIZ0~hRm&5`|7@kL$#%Z41>yw4cidk4z~2tx z%dFht)G|;@z$z^dJBl-g6ZaW_B`1cAnAD67*BhJatHKPEV00ZGs%`Qz=-^G^itCbB zbm}6iJox%g=fwB6VgmM3YIBo|(Kf zUUD_`o%&w8(PX;gxbS0s<=a7fh=Pe_;|KAZjzc-(HGOfaow1Q>myVPdt)0va$^-o( zTk=yMFfBT`DV#oVTq%B%G%TCgp1E~za)>$c?0T8f7&d@fhHer6`gCY4g1qEjAAr|k zQY&F)3{rT{2fsJ^U|Cz}v>wt(Fz&M$8fQkM@)JV7%MqHsM|qj1*cz7eqNwN}-umgW zRqE&DtBhgf|C40($Kxcu|DoGEUm+S@7MP|cf2F`Q~7)5i=CgP+&hq+R@ zJ;mOYwH1k(7xhTU)RmM%tbS6@qtDQP1K-IOZ`O52o4+#xn@CO#mN`7pcP+}tO4`g! z$9IkM@4zexq_86DIMmE?##gY%O&0&dg0v=oYhIl5P{*89%82rs-1Hw~TJ<2)@3UZl zI{vEMKsXBDeFZ}t%tZPOQ7iG}2EtDSwYCgadL7hxq&otuzQlqH1xjP>QU5AUmL`UT z%EYoi)CK5qB1eys;`5SJi=RXbp}{9bkMxa7~!W~%Uz zUm$5kdMmyGh38bLqPvj;xPOrVMSvmQvkwfUs!nlHSH9str z8JB-wyZd(M)*O;AG4m(5oX>hgP0?^?*&@72`?pqcH$i$e8qq8t2S)HF5C{y;y|q4S z#1N1m>_K17`clOvF6=FP@v~6Ptee8o8;~||n72tyD986Qo zatnz^jUF+R%MsW@FmO5>-AQWyz-Uo6J{A>nuoxGM66_< zF>hGRO$-pJF;1In4*Q>!^r`EK28?i~d@=c6{hJs#Op{yTEo>4GKN5mIUGtWfY?NqR z&g@N4qMd9GYJ12{<$cg5-zxCMnYk1hJk3+5XMh$5&E9gb(yQ=qJle6K#3+-F9DgVT zPQ9KdBn#eMbb^&b+v11&FdOfdVe6kzS-8&fkg$Qbc6B1jL)-)(jPjh+(iOs(-NF8pPyz#{6Fz@z>b~dO z)&JF+hUXb6vG?cQRHFQcmFKx}Y9p)U*qJd7a#|e`u4y9n$(VB?HSv_@CoB2>M9j9# zhk&q&A8%2FJPdnF^p$q;{ATFmm4KbVuVdwpHHRjA*Pp+($CsbsUw-i7bY>0$ zgGQE#>|%QQ>|K`V-(*n$Ug=h%1*csg6o1P=685`ubXA~G(@S*_kkF}4*Z`#F>$rn)>q25m`+{OQ-lGT#TK+VHIS5h&h8ipjZ?*y1#K4!}AQ`HnQ2g^H z4V4i)6X^3-4`I0*b9d%2>g5{C@5_6-oyEUDD12bJXhVDGzu)Dv2$#$Iq!}4_X-A0F zr214D{VP^&Ij}-T*+@8Z84;8|@V;95h)LvI;~pDDBdugRuuT*_XMbOxX1tIAC3f>tu(f*6g@ndg!=nF6MmiVJ$&7-wTS8~59EkIJrGK5BFl#5g!>TITohh* zFALaj8QRpVWi)Rl>p^8O+}c)qu0*rLWp25~4Z8||o+e`7nhLwGA0;ex_zjMuK@`Pi z@pEH5I6|2HRf%6?SZFBk)~$rfG`dmNvkcBsP*o!@jLQu(@G8?gSDmfwR<*}J`VRC6 zW&tZHab4o3_`V2>LX3h%q$Elr>P?3nG8g#h z>U(c8Sn@Wh@WXTk<7bH)r>7E7zJej8uJ9j{AJ{fg2+djAsJWN(7X zlSKG#zR;KYi9JvC-g;y!F2gF#=W^*1Fzxn{nhzZn!34sJ9oLxxtflpQJ9O`ZP(4>a z+h{2#>4+XC^6UTVg^GGz!5MU-Q%*0K=)`IPDW_V{Z`zTunf9~I36pW^TXDs8iO|n_ zNlpbL4@@-Q$+m*&%_z1qc2Bq#)tx_v})ScCOQ_P$+p09n>a+`z0fEKyG)#8kahzN7P@q3 zW;v5--V&@n;_J4{7@JraU=kI>`jCr^+Gk}GAc~8Z>v#>F=X*NG!Uw1UoB^m%A9}Vj zSeuKrra0*C4xEG$eP8b-rn{X`rP7IyjM90$nllu{}(~}*_F>3 zMFcND8ca(%Kn~`##S^R+^jVjyquA}1|nfSsV*h7f4v@BB00_V$Mq=sa{ z9aA69uzUKlH>4(r$XY-G#yFxL;PbX+0YL1+Jy!^q(7lDR^u^EfeW!^b!m*M+9QJYN z-^j(cfg)!bD(@C%*>N3jRxO2@bN9F@l$=ieGQ9F8Z!%McqWSB(T3?gE?p27xw@-Ri z7s6#KQBGSj)dY>j^Jc5>l5(g7CKmqNli0?*14V3JT7CB}Gw?VZaDvAwH4kDS7uBd4 zZSUh4ANgH=K{SxEN}!>wCARnI^Lss1i{CZ}AQG@hfAj~`D%IV8wR|P(@u%iK;LNlf zg>kS7-g0P)%iP_PVXl#I`*wqOcZJYNIRJ^$24pK-(KspR3X@!3YIn$*BA8ctys5K2 zDuy{avFi2P56#m;NnLn@=Vyr_l@JYQC^U0O*IOmJ7CrjAhjXfR%S(XVv$Yl1m(Aja zW*85XoK%hzRj#BwWhg2up zv@HgZCTG9Vr%jRPJZWIWEc>r_(&h?A>yKZ&JA`z;fl?1&P{@4tQQPS&^w|XQd{tt^ zseI&d^-O)DDJC`+a6F~sNySHKhflD0ev+r{2}nY)hJ&=c6V9Fr6G;kem3$v;+%?f) zDqo>zRo0*kytg0|fBeq#&sIRWC*rj~UNI8=@UgomPMj^{??nR?ch7mj%w&+3b~Apq z|8uS~sXSE1_Iks~&kZ8zZg>m!I;xgPWt#CAIc#@;W=P`EGe=bQ9)w~4wZ z`v|Z0Hixen_xc(oB*Y75wT@M@a)9!ZO|-#pM=(a$u2O#GltISwGE_L5gCmNd{-=%T;U8aOkF`Q+n&u zlzP*Hyyft8jvtmxHlRkDZNo)n4t~Ek`x^d&mi`PvkADVot-U$`8(h0bOxyIfUK5>i zi+R8;k29}vn5Q^Zytq4TOM_1E5l$V1#^Y);z@hA`=`Lvqf$+dRaW}{n!OK75GVvyV zLYw7360LW7-&i-z5tLyGZhF@LC7aZGGrqxQWWE~)-i4Y%HW&zH3boJeF^5X7KS({} z%Th1ZDN*>hJgug;eow>s6nYzKw+eEF4+MHu81%ima5dnstB!dGU zigaP3FO2i6*~^{M99N6+iyKyCUWJmhLnsg!6{=+X1R`8-BK9)OIL+Pxf#CgORZxC} zqXf!k>r5rS_xxJRg~0dT+{*&V*;ExR%T8mcH5DtImy`F!iel!hDL?J>KsLG4^sgGz z9Zou6>D0h(SEHTi_F)k%NQT-m_Dfx8AX$P_gV*YXY|T%$ID z?^0(AxrX}@6JC?Ar`^TFcr0dE+tj>j`zBAj2yWk)!u)D$u0)mH)bkog=1cIJ{#1|m z9~&4lB+?b)^V$65s!yjBk_pv-m75G92cM0HwvnNPpXj+Tcr{(9X#Z{hOTlT`g9d(< zh!^$`1cdjljv|_#^7}cWN<}VbGa0VDIccyh`tn+)q{Knk)3Z*NIv40v|C{AoEu8c5 zvHSBG#m%IS+aEHG7tW<_LCh?!pEx>|Ld& zz+3{(gpaJQ8nh%>6+K%Hux3tkH}{9C9euy%SpQtZ0XqU zXD>dIQGC!u`hpq8CFv1T85RCq&eFH>mY9gDPNw08i>rj}9!W~F!@HOM(}&l7;zzlr z{Vbms57NhJlzLc}^OvNP6bOvo1GtU=P*Jv&)Dr>s-M6Sznt4>zICYxKS@VEA5W(Pd zVG-0@*heqoU;*LY-ZliLN4`V5Ygk36#l~JYm4U&@3~p4!Kq#WL?(fOjCgtm(>ok|^ zfHPTBRu{PwsgP?q5M^V#>dp@lM%Xtx7Kl#S{0+8G24hyBLgk>kK2XbE-Pv>Yx{c*F z7P-mW2}!`q>ki6r4pKY+%EW9#Nsh9@=b})_2;)RQ>g65|1m&peQc9~xP8o_>|4fh8 zOP=yWIAjgtlgLv5l#OS^qP|{(Jymg#ipQ)Y?AQ)Ap-&wZbPf(qOXD{Ny+G$Rq(1P% zuADZY*oYls^P*yS|8a9F*x{>%(9psYVyj8Ir^D}(lJRqhJmpR;jHu&4br62jQ(mz( z!!_3aiNi)Ie_u3~c>F1-`Mju!K8++y870!DY&MC*&BHZ<9jW^_2`m38#)2pIV}s#R zuiPigOa=u#1c|RBs%J$3!DO}Pl3uVZ1n~OSXYbBGX_IS_fpi+GH|TW((f{X#7_hck z;zSuBahR*F0~4w5JhT(KNKt{VIDK0~ZC7;oTA0ETO|cnz)5TB8nfSl^Y% zPq`7jvnoewaJ%}nnRlvv*9mXp5dx}tCGv82eji=F?_A4(#H(n(g1c@K`rwMJUW-3G zZ!--nIW4ugW=Kxz>`i3DZ%TLeX{ELZsVWp|d`fzEU~1F9m10_zqtMAMW_$`e7OF9s zo@sU)sI$f3B{o79;;Og{LRDqZbvGr6g7*mah+zmkykLn6qLit&8C+{9*I9xvb_|1Y zuSd_<4>qW72YmW1j)kDP+ zm|cdAoA>7yL_#KgLB?RX0A9^ss%s1rpfgnBI0fe3|JKk}h_@t1lhM}TRSMifk$f2n z&wE;qOCE&18LbxKQHPINVdT@gmvqt-Anp~Ta)UW-gIvQ1Nm#0~MiU5eNGyTg5;XiZ z-2Z@?<{GF$a1>_i9?Yzs%;&3$HV0RM*GL81f1_{*;fG)K?hHtwN3T z8m{)OS&zT$B#Y%B!l(2`2`Q&1WjqqMjvpD5oAhaUZn7?BdYUa_AvwVQs!ved{l)p? zPlCU#NYWKTe&~p*Wh3|4j&KcqL7qjH#u5@UlB<`{@kRxKJa|EUADeC&%NIAL{&z@b&g@GEa86deRmR2G^v_fC3o zeO_}1&}JYSQ@noVw1?&)NS0ii16{W!O$4q=3=(q?A-)yIad__Ind~}Hg;ZLOew*#n zh7tVCN@OW$=DPbCQ7t|q8^nU%DY|;Tuq*#$_4%__K3JWYNR<5)SdMLi7 zL?(C+YBY-dOsuVjA7(nYQ>K*8LDszvdWteLE&g}CXbU?cn9I|r)82h?Xe%UeGEWxbC01kZUt*_DP~ zo#|dni{UD$(PF0v`Qt0Ah-;(%=@h}zejQ&xfq>lww))kzZR=pehd^0i1paeI0xw93 zI_VnNXeNI`qz7jS>t4CK)bu_;_$Be%u2b%|<;H-`@}!@~JEgx+cz2mFmd1(|VW6y` zSvnI8mWjtl^MSdpC?JRLYf44z>ddPi&JbPApUIv$3LA7^KZ;?jbfv2U$l7T=%G)Ds9x1}{w<88Cu99>h%@Ejf5n&{aM%X-N0mSQAp*`b&lp#h| zrG;1re9|1UiO)MZRnAKpV;>CJ$Hc7 zLJ7^Pclr%%&L5nNw)Y_$%%m>bo?;GQ1J+9%#)7_RCF}b)gzqTtiAvI~4MT zX1(f79g-oMV&9u4-i@3)cp)z!!!@0wX;vD`F6-bQZ3iNx5jdfB%mmTcFW0K=C?w!C z1}+d-*?|#gvjh$ypyo%D%pscLPXJAuPU5R!gGq3!{9a9PNv5Pu$n)!IXzQNI21l~B zBmAROfM`MJK&2-bRqY# zS;Qhs=&=RKB*1CR;EJN~$*#eG0Jw+fSXR3r_0&OOJGa{&7#_ZPtBPGydTzP#5Oe&@B2%Edi%TZ#55~at&g= z?dsb9Vm$aB02n9mPU;dzH<>6;5bI1HtAAhcd&P4(2xQ>V_iHYy<{(9-j&K zbtuWUmPTdq#zA6%rx5n?k%2$;wv}|V7&AZQIm;AVm5l=GGs%Kj+1)<@y8Z!nvmQ}) zaCq-nvt=~5gpYSBNJ(6a9L^K-Eg^WtLNW{c!(uYHY?I{`vA)hgzKToWFtZS-teQXH zO>TQF-+zMIAVD_CSz6KQ4c+}M-hfn+M;KW!o)+G$O@!*bZIe%jptH;g*?kY6tS;Cae}Fexto$cHf{%j``>1 zuf6x#z1^GgTIQ$tw%`Wp-ORB1JzvdAnNWLEo99-7=>Yl6>uJ}DFq&BhtBfRr(T(dE ztFLu>UE-U?@nH?LfFx`_u5q^wNnme;IHsWNYye?1(YFL7@1}eGwF#*O@pY{|I ze;^Z?mD1M~n3S*|y^MaT6nwosIFT-kdep0bbYK1Q9$EhRUP|xXehBY^RWwN5ZioWR z4^azJRF%Uk1RM=kh8%GF&0n%w<+pg>2W>Ed-^_8msXHvRI1p~FTi2JD&iPrG$H)c< z`ox6f{sQ!(zYh*9O$df=KEIb=&gZBo1IF)9Q7TM{yZ$&<;?CLbQ-n=fCb)SOYEfkA zZU$u9dzNBX6;Ey8`OIC2kX$uwio}VcSwc(Fj~W!{U)eV5!+-aofeFLYa-@ zd1RJ~Ka|7vAd|x#6l5EAo4_60NY+}Qm2WOSSx9rv1Q$e|jaMI`5hvLv+EDBJci+G!iUA;dm6vbjN}ask6kI z#zlD$koqMdIsW!N7R*AAzUaHi2j$O?csl`HtVYQw!uT$i9W%EjUrWur_X(%`ucw@b z+{Xpf!h>d822b*#x?y@44p&R9wmQ}<^^OR~ z)-lv^Ltn5JvPm^OM}Dy-dEeIhy9Bh^Lrds@^88+5%PIHEFScO*=6vB1SmE5f=_4IO z=PvKF>g+oHJwXC5JIqK`T)3gTBZ-emZXb%5lt-|*liRUUJ@_<}NR`EI?}|HRD?%Zk zf}PcMiq1ud`f{($Rol-Ax4w#_-l7C4l#>hDxg_hHY)GhqB%~T5PYiXj5&wd-0EKrV zj(L4bCWG}9@7uS^ff+?30Gbq3A6~Ck8!;4Qt)-gkX`ZZLilJ#VCkjld{6#P>?E4ut zE;Sjj@GWT4_H!|Pv8PkVRa!SLMf{DnVSA1^|HWNtfRoO{r59UjLH90F1_;0#@5Tnl zS?-+5gd_iAq4LvBqiW;iY0pR- z@i*=bsCMg&{V2KkM96Alxf_o68rNV1V7rw1mc8mA8|bjOl#3>lCTrYooDy1V_FE6t zHj0q|70(&g{WBAoQW*!NC{DBv{cpaO87IZIr&#jx@mVN4KnSeYogGP+r{E(O><;*# z9QAcyGGGt4rvT+VNpm&YX}a0^Y}&;~?wEOas$>pScC_IjN19B(9yefr6dj@byo4N* z`N<{PYd59ocT1H?n`GSk`p4eINN=y0^L~e&LuQNbxKv74`>s5IV?*6>(r*lDm_qQr zRr-HrlGEZsY?S9A9vx#8ZxNa7ZQhUfelxP`)ypdqKRDGAgVcW}L3{iOLB zJiv#gcD;!Hu+i#)0C+PMS?x7aQU$i<{^FqVL-FO&4J*M{QEC75e>5C??ujckw>! z;#JU-Re`*PfDP^y#-dzCe_8A?ZzN}=fDBDGx3Ov}XB4nTO3P7Cu55n+W=}AdP^y>4 zw@(mFy({Ted$D8l$S%tvPEo5nv6s&~Z=0USj~m;c#EX<*hxPAocuNji52EWUEM@F! zJ=e!WvGw|V2~{r3!~>O-&0e@hEz1k%&h zn`0DOTqIM&DPwG)_!ZJ8OVxa_PKp^}`{|Udmb#rWDXIt&OoE)NqJFDE!@nj=htqI1%F_IFTPw5U06f>E>hwdTIT) zGR-I0udOo{sy-tMb#-kXIz}!Hn(gOJpHDWbUWBH{|Wpj z@c&jowCdYtBJ}~af68cK#hTRntOjo&Mg%XmKUS3*n-#AN?LYeCmG?ZNLwzM<-lO`R zlP@5l`LDk?X1M|{hK5MOnHi3OxIK{`Y3?SQd9nA5DqR=%);~|HUgCk`YgRt;4|oqG z<}Hr`p_Kt1zyI>Zs_)3-zrwDSC@#tC`R zLnb~Mfl4IGH#LH9?oTAT57ka3cH`YST-;^EY#Qz_q4LMah8z@O_bJ&FEkAl8Pz?Fb&m6r4F`c#Y?f2t>L?GKCY5;_h^{G#o- zJ54zb3s80L@jaI43AE|P%(mOO7`I62`t8b@1C zo`qT5Js8#1`gUW+wcrAZo5tCBFo##BTAp_I z4#_v@4@2MS&84>G4BZ~2!{rl!KcAU0rr7G@8cUXe`rjNR4ll)pp#^ zh!d6|^j0rTy!3>}7(&ZqwfMyg^o~o%&cxM%5(&oB;OKib)b&2{2QMj{jhlmi{maQ z=37(yw@=MBRAc`stQr20ri9=6bW=~xxR4oGyuR-cb`t72#$=$6|F^;S-{JoW{3ifG z%EH9gMwcz*Vn7E<y98z|;By7){c^(i0(;mn26r7Akp`}ssxg>a zBCGk#!u4{4O?357n@AR9SgsrK39Y3H@3F*sCNVO5qRUoz5!r8fiZ@c5T&MTf$S-tE~Su#o}sk{R7-b@ptavM_$quwzO zH+_r_nripfllHTR;MYWFYx=BN}p1g_5hP_V9i~E+z12Ql31mdFR{pS+hV5L0W)u z=bP8b%J;+{tPeD8*|R`##d#O&b&4+8w^l7zZc!j7;XETLoYXA<9Ugh6yIII?2tA(c zQq*_`tTqf_zGU*fYgC!8${Ls_is!Os*%BZE+PYL;W?HDqmexWhO+C0B;2fWx76qD` ztY5hmF77S}pgmiBl9A57+7ET37*Ao?T~Eg;bS>wt6jp5B_Z3bY=)J^~Pb4W?R!d^V(qG9*3*Idi6CURmp|o>;<2FS5TjHLyDA+ zAz@9L#8?w!ap5D{mbLrpvr**|!o_i`!^ew0ytihc0&W!zj8aLFJgU~6C2fndI_pd+ zBBPhHDrMQDzU3xAmS04|{&p$xWBq6Jk%iBrkfi^Y$pI5h7&BPN@F6wTA=$=Y=2B6m z;Ew~Uo$r|9k^dZEm;QD*qaB+-U|PM@IuI9bddID9q4L&QV52^7h&CzqdjKu8Qg;pw z71EBOM{tVx=6?7a3(-xg=|!%JZrjX#d|gnhmnX%z_!czj@B8ef1)PEOgIj}ETI60^PZE<<*((; zUnc}~^)Dye8U^p+DJSi&c9fNeYZfY92LsnMYAu-Wrfe)4<%J3@^pKypcV0!B}JYgf3q*L2mYEawm%N&w61gCuVh;o*-EF|HYA4$({#VG53 z=1ItItU;qllqArBWY4?4M;;Ko-7a_V=>BcE;S2}(t>*T&jHc!OH3r@8dsv}Dg-E4F zUYY^HmxigQyB4YtMrS60?%x<|Qtjq#DT7g91dH-(oDj}yI?YQf)o(NlNv=xJ(q5Bs zH)@7Qe?}qR`I_Gl!;~75VFyf#U_N)cduZmVEXsSL$Iq23tw9tWU$lj|ULyGD0vQL! zJ)=JA{*e~pHc*VYAtOXIvSo|cN#0JP84DnZUx=B>y#<@`9^BsA~fKMM7 zfPg}J)^k@iq=z`ypVe_Ig<(hGMP>Q*#gnPq*}G2lK^1y{O7m_uSBjb_?TZ6vZC4x^p)d z;1Nsz(2O)T*Ri3!S*Z@4;OJ0YX+)k;Q_-aS@p}@5{g!@_U;9t>rB?H(Fc|d_-U^a| z&ed?gu znGzt1}3#Z<3l~%M(@QDIS#gh82wr_B-4}f=NYn%qeq$vuc`^V#9kqJ)C4Z zpjT6zYM83Yza+*sJR+0SaP`1mjlqwQE@mQs<;3_$uZ8N-(+~1x4)K$R$I$kViV*@y zg=AuEE#V+`Mnpk7-wx%FTMxi8x{o01;mTLmfryNUh->9lKB5*xfM1xK7S6#FNfNJ4 zJ#%T`NI~VN9iRmR^C127iQ5?_%hhv2CK@qLKlDHp@oENCRq>M_zsF68ilDaerVSm< zSp*5-{^ILAEDC7YPvB9YuJj}QbjS{pu2gT%c_X1dY##UKklAIS!*3fo!gbdcmO!xqNF-B*#RkxUO-G6Wn^K zI9n=QXiHek-7uQ$hD0XOQ=)}pFWTTFnND3yVZ_46+Uj+lDk1D2VO@m!KLGP8ZH0dR zw-PP-gB);EBJX=YO~H$+hha{mlLwCxl+Gghlh<7Z<6f} zW|h$XMav|9mJYrNCe9!@KKl2DwIvo=RCL;f56YhtU%t@+xH8CW$TAgDU<;d0R&;X- z&*?Q9nN&l$3!VH5R4_Ej@K?}S=5Wc*&NCi(YhSxdn-_lUF6HD4PZYeKGD~nI6+AeV zIQWMJ(;mhj3GRctleZquLbI$)riqFN=O+b<&wS zUvL9=5g=krPXua&r+{Sdp~VtXkFmY359UqOxNT`o8>%sQEXN4O>WDs`q@HS|;_-IMl z8nIZKHEn&GHV4G-m$l!XW03?PM8`I2Jg(nt(F<8nr1`geuu74 z3jPIj04`h?f#L(%VQHIi->Slg-n-wjk?FR1Y z(hWSLTQq4&qpHkalWM*^a1IMA*xHVHckr<r6v8)bJdqvWGohjGSv zKUa~K{YEyxwnH*}gd5~$l3+BHyUL&|Je?#OWmY8%YkfMYX+P(3T2ibIyjV;IE{1d+ z-Fn25rYdmdNo6_?N?M|Vdb!^SKZ8?0k;UQyVBM;_`5=f4I;9mhA6tyD{|=^! zuXRl?<eLM6y9gM0|ba=9SLJr zdjofMxTi6aO%a@cD__)EOF;IXek+R}BG{d^!GlS)AIo&A zudM>rC9NRk!GG95BD+?AL;sfFi}4n9NLaoY1$N^o!}lYFIwb-PwDXv=Et2p)7?bBv z241^INKq)A4E|ydrZh|0)MO!cwIj8QQ>smg>gbJZb0(PJh#m~cUpZ7E-$~JNhn~NXx<~EU`(P79Ag_!r~p8!oZp0nQe+^dIvIS@54+}1r%BcJz;gB zK;855t~VLh_p-A!2{pd1fx|SZWM0OJ!;qbp^fDY}c3ed#eDx^8)xP*xOSnj^#AkB0 zHP#WlQxfKWhgpSZIh%HK2|Yh!-?z3Xa(EqQpQ)46#MyqRDvcKB0yQ=!fTWXd(C@tQ zC$Pd&^{*8N^}fEKPFVIaY)+KbdsHfeLav}2HEX2y zUvC&#MoG1$+rxuCj8;0EOI>zv0Od}2r`_~{cRTwUiInZ72SVv%`PggPQx;rFUK$We%tjBSWs#N-ZL6> z=u1s3MP|qws|`{Azs9d3Mh zv|qfAv_ZO2H|}QJ@hiM!-!VX8&vXnIUoD@-R$`Ww=NBSajgJ~pBQyBzBWcYA4lBL- z`S8{&09w={Vr7P6rKpe>?dLP6Z)(UfyqC-M04(#RVR306D60`X zuJoH}wox?PKOTZ_bZc}0<~2=~^LX(rbM=tx73V%~%<7T47SV80wiCnQZ0*|mhft!b z-<$+Em|%qZ3`30o=hI+jq4h2`J)%OX{a6y+y_lS4e>qwRkj~H>M1oe+2J82Aw&=xdZ-;A#VjxO>pIMOZx*>%;m z@Y=D;bq6yjFobMD1? zEKv57#?&E_W2}b?dW=E@HC^MQMyn_<*HF3gm5FgYP*IiS54d5wMNT-2gl-3Fvbpls zB8bf%3e0@IT;1u{{#J&~%?)6gRmygh4&Edt-nmBz94RsVE;|tMLne*BilI^KK1-I|8)|EU)Q3$FF`=& znqFD+4XgY{pb4u(Mm4C0$6sIEQQPBHFMR-0v7P|9IIKLL@!I?5@H4&~|F|+$xgDds zkzU%)r4!tg;a%asir~DD0afvn`rgeOL~7V`V=x&wRB6*2-06e~-ixX-iWU}dW=CP< zWomA-l2JOpRJ0g$mh*nLEpCA?r^mMQlLLC2*e&*^nCYby&W$r!`62S-RZSF|CCXISoTA&0ouO3$u} zvAocLE&f4^c;1?PE>;v^5h=|eGLM0RTZrIV) z*lmdI5eK_6KT3y_LMItliuoA0ZLNQ?|xHBBf$+MZ$wfDfu2 zN7RQxRrN1YE526slH?iDm2OmE6dOC!r+2pv5}#~F82Q}|R3xv6_jPGqWe!>#z}rVd zx!?Nt0&moTVXje`aA4tmbZo#SjnW%GT*WZlk~QC?zR-tdckC`&qKlwU@F&Wz-v z|I(Muo0Y=?u;+IA zm=JtCltAiMkVat*gddG;;E2RWv7t?|(g#G}F9=FvtL3qG=ix|AnT62_H7lvA%>?!y zG=em7!Kbxuc7lO0uovTf7cXMZ#aOfIjZ4NxP4417@oVCAo zjhB}<^VH9ll%j-@&<)(RQo=ISBzlldqp!JPm{P?^tqE8`4qfQv3mya{lS^rprmGoZ zE$aG49}A{x7x)G7|GZx5fBUE#3?i&8;Blg-+$&8C@0baIl0@a`gl9-Yu@7OO4v&M{ zd4*qCG_*k#mj9%x^> z4MuU8A9bIvq=Zl~G=t_N^ zUR$i8Bpvw+dM&;WuL9?7x}Eh4&Q8gM#n>0U|9gFt;h>)~FSA`r2y&JuKlXi?Rrk3f zaUyx9*=`nKCnlTUhx`ZGAm^V#TP?y#=8HX2M>vWi44!u*~Q> z>p>VcjnJs%dB@U8Q{sv$wee9nZas_JI7wMe z=Rfla_xuElttaJ|v%|X?;Q(~ab*~f!**0+TrJ3b-38c9^WTzqbH z8Z9|mL*u;ZWn>Mazt3PjFp>KVi?JcS4VtmFIV2t7)c4GY^hC+;u{5HWRb>kADmwWx z?FIyIkco1Q>*~#)p=^IJ?F1TFU18rk7R(YK(MWuuIeZ#Ip_R60dpI{tkkSIn{TbK= zYi&Bj#mE3(kRLexwFgBnpLvF--Ho4?WsDjpz*X^hKjFx)`?c|8N|P-3)|HwmP}o^%HLEW^D!6rm9?Hg z!~Lw`J5!XVKq?2J8rN17Srg|_o|2jxts#T2E@l;YJDuPLSo(G_E98hq?lU%K02x+B z%EBskdU73U_is=+wqLg(PXco^aOr;=9>yQ{B)XsfjO1>%LGU-hnjA9QP7zR3XsSqR z8YzPe(BDzCetma&n>KFHJ8JdWg>z&H-koyoD(7cx;z4(+)?ZCaoB5}kJ~{>q4;~6V z{DgWe=tVG{XQW&WigM!5(gC9S?XoT`_~71!ecZTy}WTKb42nd zdOVn#ocHrt5O+!}uIIFK4DM()&W9h;ph{|-cHoscjhMZa+E{+N>jk0oy|y&_*VZV^ z(m;r7Yc$pJXJK|~hdcSlv+c0A<}n+fiVancGxM1Gw}P$6DOHuQZM7ym$UPbfA{^fQCQ{s{0>tfKB~5Sbqn7L<5MjB=nCtS ztGIC;PJ=9`fHbI{`seNnxD&c*U0nV&@c!M%bdv66@<)rw=ds^k44uDQU1yZU;wQ{E zjpvtqpMs)LKlrC)G!5GFJ1HaMWS#yu50a(p+LAWw)dXKTl4Meboo=G|Eg8hfbA$gZ zdq&MjMu6RFr!_Zc5n6kq3U>;i>5`L>*4wErvK?f~f~blJDU^{t>oLB98zI8HDPn*6 z%K<{3ux~b7CxQqhDIqekHAszWwTM`;Evkz%&uw$6Orr8_IcN|S%HJhfm@nT5IGH&K z>Ta2A7M|T%{p(BBM>X}hnI+$2T15t(|)TF2s9Vpc3p5rwoMni?a>4W zSSBv+i#a5pkdqLbV>@GHTsrQ=y@1#oE|#a0$X&+B0*5dEJhqn`GK_z3s5sMNbf)S+ zOq+bIzta4rnXP%!AltA0*zBu2v|OkH6o|U(5PvX~@~@=c3$PN1{?1@Phm1IR>su>l zoP4C=fb|!4qBe5;Zi}ZviCNc?0&qA_gITtDaia@zsLvxWt*1j+!uNLRHvB01M^j2udQnP^%%hM-S3dHIWPME3IX4l H{%`*eu_uM( literal 0 HcmV?d00001 diff --git a/testsuite/test_bad4.lz b/testsuite/test_bad4.lz new file mode 100644 index 0000000000000000000000000000000000000000..a8f89a334b790947cc73f840b4ddbb03b3bc6d81 GIT binary patch literal 11548 zcmeI2Lvtm7qJ(2jY}>}fwr$(S#I|kQwr$(Cot!xDR^6ZRZf|=3ExNj@TSiM#0r(yW zBCwAig=7U0u+(eZL_|vr9Gq-yVb)wh%VYj0Emt|YssrGeJxNKT_FHnjaGH|%*COTw3gs3gEoUy0&+7J(vC-@EG ziULA``CFNTTuJzFw*Unh;VP@Zd@kl-p|Vj%Agwg(lx2B4NAAliXvBd4>uT$qeRL3~GAUDN%iBg>}NXBp2;f$yD+1H(J2);3n7U$3Kr>1H!Mk+G7N+yGp zN7{t*E}~8rtNmq~64FEU)+k*obGo3DRp7&#^0lvyj8+1JdP^1$sfUskP^v?NTOnUt za6mmKzCB_BD~Bey14-rZN5ZCirOIDMX_24_0#Cr-jx^^9&JAug4sclr8!U|L>zIFr z>KvYGe@KV6c?#s>G~JR+ZLB1n#*Wm$8}#Ux?sOMd1QT8M6c&HIWG*2V`lnSykCQfm zUQXO7A$cLu__RH^a%dG+rYZZH2(nxdg8NadS zX%&|Rqdxu$o=DdA)Pj_;)G6U-`S5pb9pA)E`sWI^wWa#wMpHG;`Oxci!d*dq!?Zy} z5bBjDl4CezDZF=TPP^oTcW;5Flz@@$`E~>+X5I6G^@|0mmxihzP{YkVpbI-)A{ecg z^{TVeSg1B^uORv;+xBd#RnEbu+avQxjYhjRC1h~l?~`5c#!yR;Bgx_*-#lM=KnC@1 zs=dJ@kw8(xHYF_)1^U3Tl~h_%3kwlg9rLmSo6(mwdj!g2F^+xHxjPJd`frf5A1S6? zq@{{P$V3fHD!~A1n=l7Z`%0p2pp4A!Fsgxrl%!Aft7(#k((}%r9TgiGTcybSfv+jM zwR(M<2WuP_uNA0GNj17RE54k>#O&6)e@&iV`a6^5Ulgh@wj*1fDjU^Eo5fAoY+B`Q1q<_kDJYkQ+oYm zX5S8Vat(cB!B}rFm5*p9o1LL_FI6fF!)Tv1nz7OysQ~#zD%p;JI$K@StWkO&-W`?g`Q6h zfp$OqcjXN5P#!MV+%vG0zJ!$BHW#5_q@VQu#J1$M=M(D36+o`hK^A!{=utJ{5F zMvAtl=Qxsu0FP)tPwM_mdUva~>`R#lu85+K8m_U;m>e1(>>2bxRM9AK<3L5~1>s^j z1c2u997cy~lHR;>h&|q;Y&a_kRhsgke?fPq8vL2<%LX%&ocisk5aOZZh@vIBDG>g& zNnu-JbktovwmHAzKu3ZoEy@0##1+MD&1b{Ka!&XA7V3EKG(Dck&`6ozLyL0K%{JE- zYq@2}ao{E+6)V3kDY;-acNJ1Mn)P#JbgHpPQQR6w5F<^J1l&}#m6H^j_?CytWAkAf zNriau+K2-~N;@|)&RfK)M40H1S3~jojL^saUj#;s4CRh!+l}L6(=94m3RJktpHK)Sqj}*>{>Vs0P#B9bX zLHSO7y84xmbF3|=&w0|Yd-m&zZ5(=lW|YSR(AE9JpP6CnkKP;MlICo%l^^>^tI&P* zXzp=d4T$#?UN>`>e!_UdH*S6A39j;Ui9X7gbBPkYn#d;6tT4cgu9WC(uv@Z~OV zE#{Kz1K&9^v3+^C3uCr#ZPXNd5g4N5zVn=r^a8rj)BQK=xu|90tB#BxE>(vOW=hok zPp8orxnzTNh`V$@2mwM^%USX_FK{Q_cX*garSPHroud2Vl3OiV7dCt%Q?zo}b5@}J zeYaxrwixFmtXi>V{KjeBwC2SynUT*zC4=Qv<~aO@?MK)Ql)rb}Ns+UlBDjXh1kZXDr)7S?`@DQYfROrsFYow%GkKQoMM?@jV z-GazB-0DZPIZAr$OlL?}BJ(OGY>?4P!Ce4eiNJq-gS<}ZEvJyj_ZwXVvQ1pdt@}qd zZsMf@uWcYCs+;dLDDjuF_u)L{G{jHQzSrwiq}Sh~2RYkn^J>B*r90Y@HP=ptv|(+T zz(w%KT5V@CqpYklK=6^;0H6{ij3+(zr9-NI(&5w{o{VJ}Snw=OpUOUn2DvwY8x))Y zgN9%!Lk7e+vv_hN-AZig*?yN~ILF2W@VRC0-L4EfKDt4WOCv`!F#TyPX4H+B+K4R0F*;Vq0|ZjhaQUF@#lGPQmWti4hTpnV6{F zW>|SwoxKv0^w?%XPorFBBaI&ar^isPUE&O6@H+n%hktK;Z!?iBq5`_}cE*;;O2$wCe|Wth z_MK`QoJZ4j$5~>ebbyB%O;Z#vV-vrh47LdfPr&wx&UCf)h3X1RZDYR(l)SK4*Hz)M&L(ptMVaMj`;rwOizl@bx!bf#m;!awI?>C7y5zgQwR zhWP~cmS*krZNU+=7}1QMplplvtb7yEO;jzsU1*CTz8zqXlj#hGLeA=8BT0vrNb)K* zSN7D9m;U79r5-U3Vzk|3MgDB=0R2&Ihu8O+Mw#UfYEFpOrkZ}SM+eS8;q>|fvJz3w z)hG1*{$7|nNEJ;`g^At%*7|n*KE2#!(0!cD(XwB|hh}@$HuxBthehQ`FNpNG5&1*m zSM<}oZ|lVWMTZ>hJKD?z!aB1Um}|_lel2bc)PTJoy$Uo+xsZ{-I--8D!rNvhpQ@=z zC)gjNqDpPs@>|IXdc(!|LL)cs#48)xyRb7hD_`y#OBuwu=Fi2f+fNnzX8Oi*zE0K6rUC@_`gb1+xss>51cq3BBc zx8A6v6%7_H&-jEs(m>YLr^jE%Ie!io%8a{-p)g!q12@XA&z$^XWhm*}LWsb0?A{>j zD1j(+$G_FPsNNMO$q=N zT~r#2h5=XG$rf*0s7LhTuDTRjwyQiM6`?!tcd}w}__E*KLSz#X|I~n3!_ra0QwZ|5 z;H@JA&q&s(ACV$r6&F2%3W5+wygy5F2+X{aUf;&*tDmLdlYg1I3*WNHBs#P+uDC6B zUc!rXcv+0R$B;$+X-~GUhZM<+eq|!<=d{moaGJ}pQbpG=w9?G$sifNceOy7FEX3fc z(8r#A^Q5u#y7zVf2ZsKc0|WGt9A(m=##+n}@$hlT7AKzX! z-Q1#1`?bRkNafIa@^7U|@l)G%V!(?YhtQJ4hg@hNtheFbrliD3i@J^ z?ktRLo*S+G+PY+!W6Fz+u5=*LQ<6rhOY_ZcAkh33sc+aXva9$p_A9^A zS=v)o1S9t&+sRKD#JT}DEqL=B+rUQuO(|4+Z>!Y$%C)qGxB*Y+L7W9P`5u+1>vm-fB;T@_B>J^h`Z zJMI^g@#r?4{I_Qv#2Kkr5+wdIpgX=Hg}jO2o%gVlW~h&@f~PvKuxI6R59v=>N4CXE zvg|iVZE)?7L&e1Y-R33tV@f+*JeDu;WiL_e2`!uH07dZ4!x9OSY%GIw`GJaaz3`!r zCo(A?r!fpYjMZKk^-s+9;Mq}Il2@l`2t|)VC<;Q%Q?*|LL{3Xb)1x8i?h&Pl?IuJ? zf5DgX%pxp=g7sURHaUdhKWS)WY})S(Pev=1P;8M(>)D_bH1$;va~;I8hz`XzdF$KS zo(uNgGxdV@;~FWF&_$2}l1l!-e?NNk=Wv0j4VlKR_Yud&DzmHDo4vpUQ7;8WoeW5x zOn9gJb|Vnk7I@5N8nEC?-JJ3A?8Dg)sn>&Ny-VY846x3_un^T)iYtS9^UKL&&ZWtG z5B5niUKAh~%6FylGy}*^T9&G*OdB?M8w;(L^6rn&eXg7vg1pg{AR0`PO7dqKSC2ZJz7h};8NYdyneUI+;qS1 zc+l+M+pa0Vgx|Yy*(TX7o+$Z;Z`w-0>Txf_;u`zFm8C}-b?8)7bYMwz=>zG`Oc=^%)hI1nc*%WAkkb*`>G^rFzoEg#jZ@Lm-Xage ztH}=`!Q7kma1WgRG?LZrOq@*jO8#n5<{0`Pp3do^7rCu4IOuVNo>z&URD^ zzrs?^IvlM?s*cw)nBbkX@Q`XPiC-tuorzcmvy46@z(Ty`-O0 zTpzy7&W}?3bNcJdQ&Uw>8eNSe$xQEc2*oMDAK*ro;{cz8FJHjCx=ZWD&;cz`?Lc5( zVEI}o&TucNu%+o_7S}3dmWL9@1dV|yKS2M}{|Nk#!2eqU<%3oUo(VA+4%~wD5M658 zzuG)eqnKK6+sjA*ho^L(#HxB_z-}teQ@MLy0m7NMAEdp1hjM7}2F(iLxM;NWZ z;Ke+ybrAeh9C&ocINC{etyHva1vZ3b6#5=;RTf^-RJS+agHGHD7VUuoWtjx~OKLW`~QdQ-ce*- zl=aPq5|5KWRB$^QzQW$KXb!afP#` zP~#6NXTKPN9~&uiSSMnEL(_>vIgH5G;BLvm^jQf`d757VL^0G`FSSKSxEXJQ1na`# z&CRq*(;#P42F0N!19-{=v-MsdjqJtb;p18YAfp_G`1?<-roaN%gS_fcY4bfH4bLNU zPd;T4M1u{9{J5`Rg6JXYDGD1<`uA*ktegNyF{mQFmm*tt)%tQZctGhJuM#qJ~qG4@4PIn_I}dBqvbBB7_Nz&H@M38BCIn zo|W5pCULsDXLm&tFLfv5?Hk;`n;>peX7RqE3&Uh>hhG{?R+!jw^#IEA>ySam1dIOXY^cBXv zUlq45Xr4E~9=uhJhAX^}9baU83aQB1&>eV6jwDCKEyCpM-F*|wZlEQE>O+H?yHRFy zVNfJtY*M@lY_?e!45;-B%vD$OVY}N1QT)DUpXSsAIw%fX`1P2OzwaBmDCDx~j_yQ3 zQQhV|2BuBoQ(aknTYsHvnJaiyMqfRLCg$LX&+Xj*ymD2hN|o74)>5QIc40qMt9{LD4!z5tKG5O6)f)7D#)}qo4$uThZ?gJ@*$71eBa4 z*ZY1r*zZ;PB(z0zQhY+yy|RVXVF5m{$wX@kdV31Dp&J^oH}+Xf*j}k_01-swE-J z&!<$a=N-;VOO!pYmXbY}g1S%cU1AARW!Un?GHr)MP2qj}*gvs<0#korh2s1moN9Ww zfN*rW#AUXgTlG+KoT5DX>Ec-G9Mj7pVeJohx%XONN&q3t|Zf620zJz07O%uIT5Aa+ACh1f8m zOkrB)ZkWQPYWXF2kEWCuR;U!;+IVV8+kEAR-cdbqtlG$J2DZHc`rBkdAq7Ijs7+%u zxF<68a#$(|moXRH_+kCv2Cu<1oL0}kf*=|h+$An_X{M5?$$TtICrVf6q+232QJdMu zbl`#Ey-2{Jxuij$_>nG#g$&V8RU1<|i@54h4^cR3CVC->&BBz3m}r$IUtq*K_QbEu z(;PFqzybT;Myd+F!9`$`W>+#~y?`&RsgQoa?)DVO#D)qQ-ISbhIV&1Xc3Ki(B+}@# znu`DCS%9r$>A4Pj2~Up8;9`5cGjO*w#Q6ca8pCuh?d}?EVb;2TeM#W>HqJUzBe$8g z<5*D~A`{br7TrK#e9BJ^53yGa^G3~;6%D(ic2{feaDyv{~{e?S)m z%Qz}4+}a~NsZJ4Fz@3u$pN`N^Bow`*y0V>-A$M9cjjiQwt50(IE-1Ub^uaGH>spbN zo#iKN@l)yh%pa9F009mrGwCAQ;nT*~aix42Y9jQCe@YfC5oBIWSZhK-aNceW^(< zl?&rs0?4Jnr^O1Fw7?&h-++nY!Un|O_B9<=^}IOnC%ViF>c)K znXC>*cS^Dg$>w7H)|`PaQPF!|QX%UVOUY-CiAJtbgZ0@hAtSb(yy z`SxyNgZ$(w|LSkrl|PH7vKmGQN=3XiC!(ow*X1k%lGr*s7kaqd#ur?xJcO}YzR*d2 zC!fNU-p+>eYiG;}8+ymY7PMsl)D`@s1H2OV@8qzJuw-oG;8~%<1k{lT|K$ljJlIM3 zrIJ*YgdA3+=C4fLs&ww7Foy};VbZuVP;!j&%j_4+|o$o%{uicythXW7tQV&a2yIM0b3 zU3B@8z&}LaC1t$^)*;r_pNJtbDnI?dsqSA?5Q!)_XykHS^B$ei(zyl^NXNh|Cv|#ritLAsJ{FX`92>~wH zmF(yLKo@?`LNM!FH4jCw2p!X_YC%yd?s%F}IwceXYB_wgg>BVc-n7yOk!2gOJeNk~ zCoXgTRx+RY^7F0W-xhU}%>UM)*np(?0Rt-Pf?-3+Xj`cjOv zQi|p$=*+xfxX~+_GIA|lamt%U_Q}|U&<`uy{|Kp?&i`X4iwFcjy@ne?@pKzRz!WA| zv|{O4Q?6+SGP=SBIo65KtqHXAFk>hTG3S8US+4XTHWATK(qjg5-&p$o(n~h1v;L5J zbzX@!xLC(NC9epNAgAkw#$*A`&_#sEeFR4h+JW?D^ee4lQSw<-4mrS2cYjys)xz6I z#gi6R_f=uGg%Z56VCKBEVx{qed$4NI4-~`VG!2iJI@4ShQ3!9*ikyNtZG&`%pd>Xa z8^utd93^N2c9H*nv2OqRr^a&mA%SSz++EYK+A=|U3InXPI{T(iXaCf(n5(RfO<_L5 zaQ!65r7f#tPS*&z|5VB=Y=4iuAIS&y)krL&3HhFfSDKOl)?*#ud<1hvQ;&6M;#sum;Nj;i27)k) zbv*ig2aW`UsOvzI@%lEcsOl|{bZ%5b@}SAb2qt4+PB~50-5t(shc_&@2sp98MhFwC z^0>jNhcM!4Jp)ooZrY`P7#t`F0+5Y^kWVqg71ijlnSLukTfDEMh&c@Zh4&Yzj@{GP zQ=sC3DX5@l{sqW+I{N52L(ZEKVk>w1o-~J@5=o@$WP$3ok;{VBO2HyKBNFwZjXApC z9%Wo}DTJtK#rkI5EFE+HTVNP)bFI3-ax);){+nCCIxM?3_RbeLv|(L`VnWRrLmrQv zI9PWhSB%g0_Z2kd5BJ`Su|Y5Y#SO-+OZUCI4FQ!Q_CJheB86w)?<|`|VA*1g1Z()M zuQixIv@~k9&2XNSy(J>#?(kNBBfn*;YeEUkxZ0FUlV=52d*D4InOW$5+{thCr( z84QI9Xc~b1IE#TWNJMa5V6R*JrzR9bnnPddb#yL2^9j6>J#5t~-?pBN`p-NT=Z$ff z^eMQzWiY0WMxq(!R~Kkdxd%^}qkyjK| zDW9b$A5Co9D1?fyMNUy^*1zv4PYR~I@C>9{U0GG`JCWRSzQ-%?r-k%zF)*vazQzE3 zFK=!cjjB=7;>cxNcf}meULCZ1qN1XOqhYSJ3@!wpYVe_r1cIhE(S>jZaoq{YkTgbY zoyQD#_)4RI_sB1qNKCCPT}c;ZNz*Ipls8qq&^v(J<92o6^Sgd10K2Y`!;YF{zbrAV zbJh<;6#j1)6iphObr20%SRBai8`R>Gt_3{5^bctjI~kcqv?>csgAUuO^2K$jzS)J| zYlgS&c|t(m`s)L)oBx6k^h~AO2b|3;L3VU2fCy*0n0_XSYA zj`A)->bRMTs-*rOz*~B3wV__CJyutgiU@#Mhw08K!+M`?Wez~wEuAzO|E2c%YG~FS z@|NeMw@L|u&HBfU`WRx?b193LNR(-`mqorClg;f;#6UR2np0${hCM}pwNGFRNnDJ? zQSfgXY+;>Yt@4JFbpI~|J)*`&0Fp%$7(7w_sd&;fQRaa>kZhLRVU=N!q(jx0o~(mp zX|de+)0L&gRqh0Ycw-C6SCNXph2XhB2?eI=4Ni)$b2XyFPI6dH#Rgra)x#A<8leCd z17$?J+FcoANw85eN35vkFtPM`1Na1Kzvc9PWa0fp?SMZ}d)T>#S{LEVvY;V%+ZH}1 zey>MWT>W%A7qRX3tFVQgnAuFhD;IyS$A{2HQb7d^l#@>WM^kPfL1Y@s&jFPJ#_7g9 z?S~{CaGAJ0D?+{#oKers<>s#u&l^4vCdIwnC9*hs2BkdWl?;BBpZ>kqh%+aY$^HVs zn!YV%t{U$uMQk2F4;t`~a-ua=%=BSY&?uk`@%1qwfd8d6#ia?8h5wjy3ROEL2IP`u zB2Z&vhab4}2iUaEXordk^6`c^PkTlBj$FSq!YA; z-dTa(Na=mXCdBgUO#VGtJ1@FDzramGLAD7^t%VD?oo~8be;u7M=PS&H=Y1v!rKE&nDbo~df{)|+Hf|qjEnOfil(EIe2 zo}9L%3#tQX9Tn$2K@g1N&f((%M?JVV&P@dIcye zjlf0->W&X4;8B&lS5#y_LX?b@#WmFQ;F$v}Fw3n|AE3;HGWn zK(wpTUQ0`xeb-DM8;5}U7!E%E0eLR$Lx881g$lLf>r2z0Ju9aK9leuRq?U>3`r%MJ zoZYxp4wls7xTPex0Hwn} zbeJG&P_bd`xHVELlo4~}VUiljpFH$Rm^6fkYJ%gM)sMF&v8t7yVo%SfDd9W|h9Qy@ zqfStOM6p4!sc_9CkFD*8aIx=7PA?ohX&o;Z=d-fxsSzeeU)4hr{;rVXw%1P{l|m9x z=Bmqi;Ep=!G8Twf(KMVnD(Zn4|3OB?`SZ$)J}ng2d)_q;c`_I0&JCW^JSB^k zu@pEbt>(9^QH25?hM~_#$7kXlK5&dj)MeyH7&QJEs2~7y8$GyPuXylrKD-!%kbf-b zH1x!TSC_77N=JdLJNZ9Bg-Akl+cQ(cd*)UUU8M3W6|jPfMukv=?-dM8rwj{U;BS#p~OXwi=Xp z-~J{^q>R|zMRJ?c2odE4=B)gSoD~iKaH^Y8-I{}L>y0ehEd--VPWrRaL3)*KBT*he zT8vFB5BskH={K+mD8!98*271NJm>}WZmVrF085kvC=*qMK(9^>hY8iBrX=&yGPl|w zvcU2$1&mC^mnb9s^(Pi9Ju6oIJ)Onkt22{NLz(iJsunxF=vPdup;s)&?})CYf70ww z35K?nAb?&80;(V9ZWLln^EP`jM8^Wd(^3bL&+26#ppiqgidS0tf={t2BdpfGd19G( zxq!`5@VF#fWOa0GIVXYhzK26VzB>CC!m*}3syvpFJuo9^LWX#%g}+I&DL zo+;CZ&u-v{idXQ}9gLg!K0&r=&0cchCY>UgWwQPGF}6D*VPBX2EcnY#C?lhRKU$_haa%Vx)ykS*R0&hL}Im~|$emGfxqZv?F YwETVc`-|&+Owy7c_1_r)m+rs*e_%0|Q2+n{ literal 0 HcmV?d00001 diff --git a/testsuite/test_bad5.lz b/testsuite/test_bad5.lz new file mode 100644 index 0000000000000000000000000000000000000000..73e0142cbb8c056fdac7fe13ff29590811c4e189 GIT binary patch literal 11548 zcmeI#({?3*f&|dmwrzE6+qP{xC$??dww-ir+qTo;+%@wVbL*x4pjK^JZ7D_IdmxCQ zegRa{6{NSNK9go*IuhWJ6cbDHmP$Ha3)u8Lm6YnvH$cuLT^XrLc|zwT?(~u(Zk&W6lA2koFenNxTB@&MmeF3@~m^V)$JUGADfUdCnB&Pyo|)E^UfPX z+9TCaf%Ey%R51F`nUbBSSxqIQA_GGPb1{9os2U?P8dfV$-V>a!3W_ zO?aPTniTQ6U#2NxeKa4;?G|m8I9Qs%4f@RcJN!noWM1t)o3*L~tkT#P**M;z*qWJ#K`DduE zk*SV{3~1Y@AZ{+REvdAoDza&uC{6q!uK}4ZPYES3v1NdW#OozoH zM6s5ZlCMQ!Y83r=nu^nr#H4PT|Sw(k}+O z7ZwPdR3{137uPv3s1{g?AQ>wTbEa5u!Hycwd(g#CUNz=FczGLEyv0cjjhtXy&&Y+j zOqp@f)#{rTZrxD^@jlPqRrb)z0p>i6!5vhZv%~GJ9Ebmy)a12Sakiz5wT7Mvnrfd` z@mMe$60Q)4LU({Vvlm|&t}>cocwydvX3hW7)$ISn3v>IieCSR55v=Bp0Kq1>iA z8oiPTl_c#_)00r451iV_WTdpQk$^R@E<14;{n&Cwp)42UIW}E-!f~cqgJt~5u~GVd~06Kk~Ni|cVKr^ZDH(`qY4JUrtH@m z3~V24a9O-ppf;t{>EEsSbCZ&C+V0$%0p12XlNDc-YA<%9TL9IK8syEAW*m0yao=IO z3VKMOzbcB<#wy*CdP_3Wf->Dhnt3?d81!6C?PCn)Ph>1EyPi-CZ3mB=ElN}R1LWr4 zj`i}5{bM26?=V%5=%$-pVe~K6stXiG1>LUg7VXmr-EbKjp&a_d;#+^1WmqS05%?WK z*oZ2pEl5A}f5SSK=Snj+;6zlS_82gN&hy~D{Y+Vm4Q565m zMmfysoZ;fORA8rxtzl}XTQpEhw+HyTgFIP^BT!?EJ^SU$VC(nn?Ytcr1!N5lGDLBf z%Yd3_GeaaG#G_OQqCg#_2Nszysn_yT|HMc8a@RCnw=FP*$D+p>Ng5V_o)L^yxWBg9 z8Q$fA$scRxl0ecfKyH6qE07NO^xrT~hCF_Jd)xN#h&k`qjW{A#KgJM5wz?x(Nht;sLyUAf#th7Iq`v0O=!`v$2CsT+2zoY=qHyySUI?SN0f z_5;4`BaScV547qt&B1M*q`{Pn^pz6{fa_9>{A>-#Vfnk8L-V3MsiQOJLJ8Dn% z?lKFd>{SdyMT~u_@lS-vZS8D+Gy>f{qB6DHgeV;-{8E`&go9ADd5_njfG~2Cfkwfh z`_2R~TC0ZPh*sIm2B)HHta@4KB9%vWDzz)v+}8D8aP*yN6m}ffN|S~yf)tWg2?V+Q z=rf$d2cb1)nY7(U9-FAnuHtO=0TV{Q6c%^=K?X44pYGd_LgZNDGn;F|fiLxNB`9!= z# z$;6ibxt;%Q`Z-#SXxZcfeNn;mkp~VXKKr^`FwBq1N4&qLGI%5=*`6hqP1<&$*%go* zU+NMtU$t^pbHDi!p2+RhUMc~X?g8fWzfIwx|NVy#&GEhMo(fF#y&Ionn$rqEEjWDF zQ3lqCe;JX`+y|~IJK`+uqs;|wdmCk%fZ<8WUI8RnqO3bTX1!g9O-089mBy4kknPNb zqkdNZrDKmMy-y7mdZaOYQw<6=|3aq@D5qFf|juodaLmI~vnc2fZ_9Uv%_~o<+1Zf>T~j#p&ja6_tRQn5fzQ zv+_@E_DWdFYnurpoobn#EN0wI|4)TZsSA+d>->8V{(X+*y8NL3=u6dp+_}U9AMM|> zc?6|qt2`q8ri`0o9aoIjaf($Ly><@ zv&S=#(Vy<(P}_IuoDOsziH%9kEO$FUsP6Ezc8-g1o(}=DL>CzU zD!w=g6N{igLW4U6rN_Hadiuoy12_|v%liw+T2v*^ zfXMIrdtvS%O)OCjCT{y%``hXJ^m6x)-s5Dhw!<0$H2brT;m7bi92#dvVU*X6C@iIa z@lVUXowL9fJxYk*-xh8VwwcACJQLpaYY7veMx6baRiM9A3z>;*qZ$`0eC_56X(v~Zj426XgRk$}c&n|%J=0dXx^mB1|x>(+J^tl>doIpYB zYXZrp%E|a{4!a{P@u;&8t(P(|u~n+%2rrE`N^xPWlhZgIEWW3Suy_iy)8!5-D`kiy z1srnJA9tYjWNXF&`hu8>)Sk_jYI(omQ--(}km4PL;H^o-L20y~LwTxKoi-YZ#aBAN z4aTKy=y34)CMOJ0hH~z{y#cx|1#@sv<~+@RiXwD0@uL0vEhsKlhLgW7g$d2Z?hUh# z5{bi>oJ`YNWQLUWTbOzm9agVG%gel`*4xdwQkojF4J8P z*KkTgRbbo~>>FP{=~p-k7Y^Ri81xKU3xx3y#6YPU<~ZG8Yw?yjR7au(AdF5QF-%sk z+V37?hjvrP>J=?ImJS2)U&_nnNrr3cBQEyZS%Mw-EX6!{8@o4^@#9|N74zox8{cyFU3+g%6Ck$9KQl>RBgH!gLgY4({Fx1jH zZy{KeWV~(0!m$u9enb`Sn?la&lkmzcTgORzDyldq-2J#{RJ*(slt%Xrt&TA|{!KQ0 z89O5D{Vm+$F(Ag#!^kM3@Gl);J>m5>!V+_tr8q1R2=7$x%a9DK{&+cad$(EFdPvhcU@SvX@lir+`9rK8Nx*MQ_E@>dSo}g9H?O)+Fd(uL1JL#Xhn}fc6m=(p zcK9a(i3JevG$X>5RLMIjX^b8=<&y$VreuiITX#WkFIsu)u+#kwxnu|xsq%W@)V-l*`Aex)#9qH$ARL>Bki{Yf;^Rl?alX=;PFT~3ucdalY{2892`<5lYF)f!e@TU zbLCYeM2usZ57R&W?`$ki*<_sqdRr7k0hAzqy{EJ^+Z0RP*=sq)qFh@9YwvNn6W@7? zJ(~N`%uY0H-Wip0ivSGBnO*0G#p-(p-p$5>5vt@kJbx-M`QAKAGT2=`*Pv99t;6t7 zM%=qJqpN&Ht&Z8pgoeO&cQ=v=k!>)-n8%#uMf9PJqki5Ts6JLCjOKM!8oue{N1+JJ z0;ygHhM#$FzjV)ejULNlCTe>QYjdi2MG(+3RDOTk%f7R%mEV=DurqAx#<#N_)uONP z)U!?}YtriD^-LxNXKj4sIxCXbi3}HFwuh8cO4@%vqSI~D;Qm|^EttOJrWr@^& zQkOk=kw@5{_bXkTS_e&cY~d6>Yx(_cW9j(^27dR4uI30J!QyF=*T#U4YrVAdJyRth z{R_hY7f`yoH0uQ`(ja(nzLLT^d+5u$ZjX!f}1kL^!F5u&AQPsuPB%YZ<9NG z@NzvOH2*0MKf)4>CX#Vy zIOvFG<{Xg*vHK}R1728>D`8{l&md#2v@B6erBBYLWjtFqYNNY`b8syOUEc^}ft+XwL4^pCVx1+^P2;;yqYgyZB(D-;W zLq0zFQT=l7_umAt+|Nr{`|F8dLRzZTm2u6Pc$FoMuc6VPfKei7wdNjD8 z#vfA8eldkUHd5!XPsD?Ur;~WYu>GT(;?*F_>) zTIiIgLC&TOOTtVC@l^_4@c0SjIa@o7M%&-aElK99~l z`Ibi#4>cwU;JrGX?TwGN2a;Ie(A;5|Z#dyQsMCjLy1aEzr{u_gGxt1FI54Y(75%&F z(l$sQxK)c7ZdU-PVGfzmD9P(EuYkplKABhFB{^4sQDFRRC9nVO0Tr{=*YHiG5OtZ4% z-|9nt^-zAwzdzlA7wXgiv+HabHMPByWK@^v_~{<(;SoA7#RU|(2w_UAyTD0(29vC- zZ|yOjMUtTb=&5YxqY2~UZoGWiLY!F=meTVKKC_4uD!K_5YfEno}3-q&#dD&}TyVzHjWNl+U3*x)TFM z^O*A*oHk8Jb7%2u`*o>fuH;qy`wAGIn1d%dxA%m7<*rJTG|PIx;{a*YLzvedS30-0|`B$;qZC#7HFE`fX zh#AK>y6lg!xKxmGQ*VGfpnqK|N=Shc4KeQ$jGkZwIvXbHkL0h>Y6;9F3q={%NI_Vf zPpR3=JD!)7ssOH*QUFWAJtz0BafE5I>;>XkcEe(32!8z>pEy53X+Lnn@%|9bwY}Ux zxVqgEvRlt>`lz|i(Ov`e@htUD8ReX6Jsmu@GQslq$ny9he~+wL1`4mMFBq(#0`CX- zoH)kO2d4xMnI9t|pg5Y0@UQdjzPGpV!`eir2u<*ReDEz#QO%^VYY z@Suo3WZSF+@NZ(rI|p#yKb+fyJD8>;B^Q}QMiZ0NK(>B(=SQO2h= z)B-opg6y43&-FM<`10I_7u(}qLAzz4E)OU*m}Yb7ch_JGvo-_kOM=I@@itkSc`a<6 z$4U~2@s1$lO@m_ zmY;AWPG#=1epKV%2ywBP$rjNMpEkaZs}#!7lAu=tQnTTRA@gIy+Y$>y^3OXNJ=yds zEPw5OWd^M_f+76UA~0VO!9w2Z;z+Xc9zVH?q{SF4Sg`AQxU3rJKOVKqN=Ag%mzw3% zxG~RFf3r_?=yRSP8owYXM#lz48VH*tnziEZcIi8LdR;m^i~= zK9sr1VN|n%KEIRK9U)OOYG04<-6Ie?|KPKd3=;xY+!hI8fxW~4~7Qx@smDo;~F0$5++27G0?m2CXkYD z8tzX2SqfkCJCx`w`=-msL|h!RN&#r5J*Af&f_B6KDJr$4ETaOy?X*{@W_hVD zbGl_sX*~t-A`R}l8X+(1tV{ekGz31_-DL+Wljsxaw$T(TAN{M(ks3HS0cWo|B1l!# za(g$iL2+_baK)N_6~LmUqK?^#TA5(Og=A*ZeL0JWEWXacjS(Tg@de+e0AZqDAbe8L z#jiM}zq8@;+7)}kj?p=>1uZo&b%ikLh@i~#J2_%2A{Ey(bXKG|0d*uQaCt(20CrMw zsVrSBDUThc^(z~{DwFpp!f6VBm^`imloD$(Qq-p(%%|p*5H(gqdcBUoUZ{YN?uvjQ zFLT5J(JOeyR>FTjRF}hEupWVL{8VJ@`Rn9Dvwlz=IzK;zYFsVVRX%)|l=R>d!FwW4 zA5(E8=!WFCq@v%*Hq5sA6FDqS?Qg)E=J`ck@vo;Ml0TMA7Mpyr%$7ZJcxIR_2*2`^ z1Df`i`fm{Bt4Z*Ia{V^tlq>`|A6R5PX_bW-@SthyS(1JO9oYTHs>R)`fK{?hVxTKd z700<7=)&(=C{{z8)}bgikyA!>9Vlw$9d8S2m!wi)9jC93h@FP(yLQG9id-W$U};og zBJ;if)7C4Y66>@&O`#LHx0y!5+OhkiCDWtIcMaO%5E-P(i~P~q!;es}?@o6rV5Hiz zKd9RtE39TV@5VtM8T1DA8es&*+hZ6BQYT`L^>j8peos}~|hfWk&k89_I+}E0iaecC1UAz@kHsfG}q{7>re- z>owpvcqAxHQxB4Y-@j>1-C&8Vd!rVb4^1&fI2reH%4MeE>3C*0vSGDF$b}6yN|acg z&jU^~jF~_O2uv-#>5%#P<48#uh+-0qa*7q9q)v~+^jitq>T?}U!fE6dF;J*Bc2Da- ziG~lRsEU!r`X&!>^3`{NoHr-JQR(qJX$e0imQ2&l2Gwh)kOQlehC^{dBJM*UbMm}B z%Dm=Q3{};R^UJVMwmSnpem+BDXg7k3VR5!=@h9l!h^uA^|69 zsQyO2gn*s(6*Lu=XYa+tuutIP26NW6=ibwnklF~x4Re`T@!9V?+jbFHu0%7@24U-K z4F;BuR=utT9zfMsDoWvrV9gr!En8C?Mrh96u2PmVE412+0El8{q5tvdwS?uC$_yob zxC4pg67;w&Z>Y{gjHmGMR8<(Xh*{){I?~J6uMh|*evFRuzowM`p} zHtUUh2b=Q}*hmf2&%Mx>i9VpISTHV!`gcTI9br@abAdLv=!b707#Oev-uAK5YIkKg z94@G32=?P54)RAblKTQ@-SR&-p#;(b`bxjEYx$X9@SXf&t4`&%?c{I3%wtLZ7*A=x zqNhhDW7^*+bfbcrLM?7oxU|SIiKoEMIx3>@I~!@S>&xkCf>|WJnf!@7P8eKQgQMVG zz3Isxzns%~aos6jSZo^(`|nA<=VMXWUReovrU0n1$R^fEEO<+*RC67Q=*LAqF*M}@ zmfiw%@oD2wYW`MvCFR+G{-b_&%LLyW!r zxn*?fCMnA!*KNHO3wQ?&(4L9P%2v+Cxw3NjPy*_qhjvm3+PWlHq8X%hXJjL?Sn+jU zbKsFH%|gB-{}f_z_3{j5J=7&F@90y$G>sykKpwB#)xpp2hT%Y*`XWwy8q)ppr0}j; ze-JSQ)@~@;baoNoL3;owj zAG`C!!2I>s2R@I01!3r!Dvu9%+gZY#n6@`!-02dA%{*fSL(o+jyuU$xmgHBT93gj9 zcahS^E!5Pd4Q_8fGGnWa4cZ-XdScYXZ%Fl6o?NnQ_Zij}Z|J*alcwXpG`?SrEqcQ~ z3S11=ggrWmgF3GEJ4}TQ-9s5EqE{8wE=_R)6WsIZBn4 z$d5l=Sy^7?O+ZLAwUT}ns|HvKoeP#yVyWHWruwvvDJRrQb4+rC8+i{xc44);es;VUwE@& zXiuH1!M{ospC`zNesiOmXiF0}d-yA499WL@`j{9f@Y0s*+Kj~_aLhG@rjr^Aa>+6g zq`9#p0NnKh?A}bEqUbWExQkR#`Q5m=+8VUOf!Y@pHzYN&BSTa}UyvF=%hvsi%^Mu7wlH zzE)=~J$?3{R>s&k1k}e!$ng)zb5TDc0-YRGm_2`gy20#O1r_MuI|U^g*~so6PW8jt zja!uvIW39~FLY}q(+hhD(@pO*V-0i#d*X(9JE2TnfCv-DX9P>QxhyN_b#3;?m=Fwm zQhjNXVp3f>6Bg$}&JRT%Mu2mo(y^Vyeg907Y~vX=J&( z9@l{<+NA4P5K?9HNY-C5FQkMIa$>HZS3Zns;rPDu?s3SIxp+?=VBH$=396xYhID+E zc5(xmnVvW3@~`^xoUrXN@a3Ukr}k*Fm7n6Av@RFo?^ml)54BTfiW+7FX|}9W@)%hw z!E>@20jpXyDBuwoh5`%%CccparvxNDMghbjlaIklLNJfN2e<2$556vk7h@0#kA+=E z04xLznc6n)Rl1irsIgV1WhW7X2J|K=HeLz8Mslyc)sJqlmJJb^^MJ=MeWNMrx2ZpE zhCio12gsTS+dUVg_#$Tvcg>gA+&_FmAb)tKCDn903cE=o4IRl_jmmuQ ztjUt8qxN@EJZ7}Q#Q8zFD{fJXsU$z_3F4xXr{HLS(jFMHHJ}z zR;-jTvXx(Aj11SG*lY}J*bVpemW!`0OumifDr0Ke91LP#v28})ah$)SdR76+v%{sB zI@UsO49XBt1Gsm8A;z?Bb0$M|EinOBx{&K&UWR!Nr& zI4p&aOLE25N5@uklDH2Xx9}D2S25pIo$sRK*2bNDIaOQmqfVd4IL@b z6v-4e+x9sq+BUB`h%4+-i9qOc*sI?xs2R%GkR?>|EePKZeQDT~qiyAykB<*pR6K%E zHEX%}Qt9RUq?p$T?*(`-ZU)STi0$P-C%jTFY@1eH8y~itqY}3nUY=E^2&(Qa2SgHC zvi$@chW=>ygNB4F!gEE;qwhLYr8Pe5 zcmqsCcAOR+;H)x)@B7p~{LPY<4ux$~&WH){P0$>WGq3G-X6A_Yv+(arWA$2;@Wpb!)L<~ zTTIlM-&XdqkN}@S{Q`Cq0w);%s+|(5Ao1_f2nUIFO;9rEMsR3U*{2^%QqFRlY3|P^ zelD-U=yL*J?)6WvS3Tla7w73FWgGR2RnVc79)-pQUnP2 zlt+cI2u(mzuN4i|CfCt$6yzfA<1qxN2_NqQmNxqL071(DVqp#LKwxm|C{L(P8%I+N}3J%^dRqF6su*q$5k*WI0V+ z^P;0RtlSPDxkAdTrTi`|^)m(oh!2($|(f=g*PW-*NgK)9@U@B`BOJXJC; z9G=-}Jfo5>u{Z=d^bw(*F`15wt5(`)b-RjRk9_ods%{BVfMz=|gSaSI&cnC0H{$s* zRZd#g8r(@@S;F)lvaR#h95WZNkn0X1O>O3ABrv9Ok^a=;|JT?aWM)hL>kPKFtorR) zRgZJxd-lnAP*>Syu|z=#_B@I>#D&v{zRS;BrTRVJ(JQ7OFfH`%#T$*-dg(R%GZDTk zDZuxwJ3GN$49ulLj9#1eT-~ywR>W^mMePkOG#Q85CK;h>bV*)el?uM2x!ue zH`;T&hZ@W@gG+xT7;cJbR7i!%tqPVO!4$VcH~_fSl3jvKOy0y4U~o!FeXRCnlUP#p z-3#4RYzl2silD*#%Wl`OUu^Mf8#8;=2--;ltP$Fzvl=#9$bG{ss4WKo##2x!VpF?FUDHcSKuf#ASe_bM7A-llx5qAK^CUBK z-gpQuw&C*Hv{B1mz$Iq=aIa3WzsH0b_zJ4>6=d4FhAs80RM943pu2QH`u+D5L=IHL z-1|&9?gF~=__;v1UJNEGYEBmO$dht(`I|gO_fYDe`z!YQS-=Jy&YccTW;vitwpsZr z*I(zV9;yEQ_9dxaeXSo`zz+SY%>l!o96HbR0ZLy;N^aabAVG?MOW?`eN$h&_6#DD; zPQUGy(oR>bdN57`JkK$_FY+fOh?8&ghMcK^9-bK)jc6^L#ZbTr|5VIcFb_IY$TdAW zX@FKi#RM;#+L@cYc;HM*EWN$tiZdS_A>f}%@aIe3+peelQy~qbC%-BUvbSR<2_6LW z1K~wcVuIP>R7&*^>C}by6?F86Efi#!wAJDo$h}ix&PfQSmGNKcE$3B)`<#9@3dNL` z{c%u*d0cT5T1DDGi1XSfZKY!4ysXFC(A97)BM?hTH~Et~i#uyRY&tXOE&uq2aqx1? z$dWIzD4@M86Xm=%&$o_g+hI82cT7r-PuNLG(Pq!D@!ggZYP6~5&|JuAX4a4Kq% z=(;Vl>M{tZj)O0Efw0HjF^>!PXWA_TvUm1vA=y7nDNITSU&1QNlYVrWE_Ox&$~%vh zu!u$v#1UGs-XBrwY^zm#xTtdq<@xjpW!+LO$UL|hsn%vetOMJUCF3Q1mB*v1*hc)% zR5^eVh&dE}6Rc7)W;sYG`6}kt{Gc1;TTWj&<+0x9|9To@hT#=rpFH&nQed; zzKL{~b70$`j`A!}yzBC3dFZV7ka|PdW_U~U7xNxtw)8xNtABKi;W~~}-b)zx1_$ZQ zVhYtLQyDYble=K@4~-#Th0s8o8wAPSk=vhQK)>(oZ?=(RyT>+q#*LM|Dj)@y_+5Ya z|14F5-rl+|gz@@*JE*p#I!?a@-Q#3!_3`hAGHMHyy@yY zR+L=~h{>8os>FKEK)Ctdsmku88|8Pf59De6=-VH393sAVbTD4jVx_%*GgFeH%gI0=XnY z?{~Y!rMzA)VTXN0P@Q;aA%2Kz{zbHlOULJ2!(B+4>y?MXFltbEKn_wLfY{k4uTuD( zqC9^67DNZPM@o0R{!Nd`^|2kd!G(*wKIVgx|0urk=#}P$e^GC~d*(#GfM~rEoNC(Z z$z+whjBz!dZcHSx*VG?$LH=u2-O8D#r>cQL@+x5WRD(kuOUL|NBv<9Ra=eI?8DWB< z^h++5H^LPM-@zP%gqaEz4{1y#05Hwc@Vd{HEic;aOPRK zz@wXmCKadKKu#LRpHj`cG4L#q1F++%XoHDAYD2jL3CfFQ{9ka{yrW(D;HK@SI54 zPQic0^{U{G=tuEAE5_&04pFmdo+x?)GnP+lCe7xOp;z+y1ZF_8!tD`PoaWP^(%o}a zB*5(VROPyBWrU(GqJNyTck}>ZFT10KZ1^p&IJtAWMf(K(U3<;j)VS4|S-uP8)#p5& z{+dW(6jMV~)MbF;?9oR3mTiQeE4%MGrD9Uy9Tbc!qmWE&kl>UA+V_Z&8hwnKc5QwL zyN8yyH|d8v`aflna|(Z|J&s3XXM%wrU++&+-gD_4k<;0htpyd;9=uL{pw$Ab$P*(a+(QMUhnsj@fSG1^2(iBZ`U3PHuPIy z`oqu+6gZfnih1os3nzc0{dlKUetVg|P}>AL9PzymIt27wjKVsoFUm;(({I@#Li=>aUyg_|B; zofslL>S5WX8w+ZamN;)` z{mdX3JE5DGP2s7jOCgCrZ=6>0-3eVxtjKy^Ko?Lcc(Z6#p8to-U>j!#Mz|jZwUQx% zmMic3(YgbUC>s$Y@Vx_hf3=N-S1n*6W029JM}fw?aRhAvBmZ0I!PD z5!F>i8YFM?%{0Cph1{KDKI||EzY>m0RT50S_vY*>h3q$Zdb)Y^j5qOa6W&H;Xeg_V zdJd29hePJqyL87nWZrjlhbJFY0UPxh?R|bq_6#O-H$0_`6__h$4#bWsa#Y?y0bl@VduVVlOblg?L*@k0vmeOn* zA^3g_fVAwc{K&HHt!eI2@t?0)3BS3UIZ0~hRm&5`|7@kL$#%Z41>yw4cidk4z~2tx z%dFht)G|;@z$z^dJBl-g6ZaW_B`1cAnAD67*BhJatHKPEV00ZGs%`Qz=-^G^itCbB zbm}6iJox%g=fwB6VgmM3YIBo|(Kf zUUD_`o%&w8(PX;gxbS0s<=a7fh=Pe_;|KAZjzc-(HGOfaow1Q>myVPdt)0va$^-o( zTk=yMFfBT`DV#oVTq%B%G%TCgp1E~za)>$c?0T8f7&d@fhHer6`gCY4g1qEjAAr|k zQY&F)3{rT{2fsJ^U|Cz}v>wt(Fz&M$8fQkM@)JV7%MqHsM|qj1*cz7eqNwN}-umgW zRqE&DtBhgf|C40($Kxcu|DoGEUm+S@7MP|cf2F`Q~7)5i=CgP+&hq+R@ zJ;mOYwH1k(7xhTU)RmM%tbS6@qtDQP1K-IOZ`O52o4+#xn@CO#mN`7pcP+}tO4`g! z$9IkM@4zexq_86DIMmE?##gY%O&0&dg0v=oYhIl5P{*89%82rs-1Hw~TJ<2)@3UZl zI{vEMKsXBDeFZ}t%tZPOQ7iG}2EtDSwYCgadL7hxq&otuzQlqH1xjP>QU5AUmL`UT z%EYoi)CK5qB1eys;`5SJi=RXbp}{9bkMxa7~!W~%Uz zUm$5kdMmyGh38bLqPvj;xPOrVMSvmQvkwfUs!nlHSH9str z8JB-wyZd(M)*O;AG4m(5oX>hgP0?^?*&@72`?pqcH$i$e8qq8t2S)HF5C{y;y|q4S z#1N1m>_K17`clOvF6=FP@v~6Ptee8o8;~||n72tyD986Qo zatnz^jUF+R%MsW@FmO5>-AQWyz-Uo6J{A>nuoxGM66_< zF>hGRO$-pJF;1In4*Q>!^r`EK28?i~d@=c6{hJs#Op{yTEo>4GKN5mIUGtWfY?NqR z&g@N4qMd9GYJ12{<$cg5-zxCMnYk1hJk3+5XMh$5&E9gb(yQ=qJle6K#3+-F9DgVT zPQ9KdBn#eMbb^&b+v11&FdOfdVe6kzS-8&fkg$Qbc6B1jL)-)(jPjh+(iOs(-NF8pPyz#{6Fz@z>b~dO z)&JF+hUXb6vG?cQRHFQcmFKx}Y9p)U*qJd7a#|e`u4y9n$(VB?HSv_@CoB2>M9j9# zhk&q&A8%2FJPdnF^p$q;{ATFmm4KbVuVdwpHHRjA*Pp+($CsbsUw-i7bY>0$ zgGQE#>|%QQ>|K`V-(*n$Ug=h%1*csg6o1P=685`ubXA~G(@S*_kkF}4*Z`#F>$rn)>q25m`+{OQ-lGT#TK+VHIS5h&h8ipjZ?*y1#K4!}AQ`HnQ2g^H z4V4i)6X^3-4`I0*b9d%2>g5{C@5_6-oyEUDD12bJXhVDGzu)Dv2$#$Iq!}4_X-A0F zr214D{VP^&Ij}-T*+@8Z84;8|@V;95h)LvI;~pDDBdugRuuT*_XMbOxX1tIAC3f>tu(f*6g@ndg!=nF6MmiVJ$&7-wTS8~59EkIJrGK5BFl#5g!>TITohh* zFALaj8QRpVWi)Rl>p^8O+}c)qu0*rLWp25~4Z8||o+e`7nhLwGA0;ex_zjMuK@`Pi z@pEH5I6|2HRf%6?SZFBk)~$rfG`dmNvkcBsP*o!@jLQu(@G8?gSDmfwR<*}J`VRC6 zW&tZHab4o3_`V2>LX3h%q$Elr>P?3nG8g#h z>U(c8Sn@Wh@WXTk<7bH)r>7E7zJej8uJ9j{AJ{fg2+djAsJWN(7X zlSKG#zR;KYi9JvC-g;y!F2gF#=W^*1Fzxn{nhzZn!34sJ9oLxxtflpQJ9O`ZP(4>a z+h{2#>4+XC^6UTVg^GGz!5MU-Q%*0K=)`IPDW_V{Z`zTunf9~I36pW^TXDs8iO|n_ zNlpbL4@@-Q$+m*&%_z1qc2Bq#)tx_v})ScCOQ_P$+p09n>a+`z0fEKyG)#8kahzN7P@q3 zW;v5--V&@n;_J4{7@JraU=kI>`jCr^+Gk}GAc~8Z>v#>F=X*NG!Uw1UoB^m%A9}Vj zSeuKrra0*C4xEG$eP8b-rn{X`rP7IyjM90$nllu{}(~}*_F>3 zMFcND8ca(%Kn~`##S^R+^jVjyquA}1|nfSsV*h7f4v@BB00_V$Mq=sa{ z9aA69uzUKlH>4(r$XY-G#yFxL;PbX+0YL1+Jy!^q(7lDR^u^EfeW!^b!m*M+9QJYN z-^j(cfg)!bD(@C%*>N3jRxO2@bN9F@l$=ieGQ9F8Z!%McqWSB(T3?gE?p27xw@-Ri z7s6#KQBGSj)dY>j^Jc5>l5(g7CKmqNli0?*14V3JT7CB}Gw?VZaDvAwH4kDS7uBd4 zZSUh4ANgH=K{SxEN}!>wCARnI^Lss1i{CZ}AQG@hfAj~`D%IV8wR|P(@u%iK;LNlf zg>kS7-g0P)%iP_PVXl#I`*wqOcZJYNIRJ^$24pK-(KspR3X@!3YIn$*BA8ctys5K2 zDuy{avFi2P56#m;NnLn@=Vyr_l@JYQC^U0O*IOmJ7CrjAhjXfR%S(XVv$Yl1m(Aja zW*85XoK%hzRj#BwWhg2up zv@HgZCTG9Vr%jRPJZWIWEc>r_(&h?A>yKZ&JA`z;fl?1&P{@4tQQPS&^w|XQd{tt^ zseI&d^-O)DDJC`+a6F~sNySHKhflD0ev+r{2}nY)hJ&=c6V9Fr6G;kem3$v;+%?f) zDqo>zRo0*kytg0|fBeq#&sIRWC*rj~UNI8=@UgomPMj^{??nR?ch7mj%w&+3b~Apq z|8uS~sXSE1_Iks~&kZ8zZg>m!I;xgPWt#CAIc#@;W=P`EGe=bQ9)w~4wZ z`v|Z0Hixen_xc(oB*Y75wT@M@a)9!ZO|-#pM=(a$u2O#GltISwGE_L5gCmNd{-=%T;U8aOkF`Q+n&u zlzP*Hyyft8jvtmxHlRkDZNo)n4t~Ek`x^d&mi`PvkADVot-U$`8(h0bOxyIfUK5>i zi+R8;k29}vn5Q^Zytq4TOM_1E5l$V1#^Y);z@hA`=`Lvqf$+dRaW}{n!OK75GVvyV zLYw7360LW7-&i-z5tLyGZhF@LC7aZGGrqxQWWE~)-i4Y%HW&zH3boJeF^5X7KS({} z%Th1ZDN*>hJgug;eow>s6nYzKw+eEF4+MHu81%ima5dnstB!dGU zigaP3FO2i6*~^{M99N6+iyKyCUWJmhLnsg!6{=+X1R`8-BK9)OIL+Pxf#CgORZxC} zqXf!k>r5rS_xxJRg~0dT+{*&V*;ExR%T8mcH5DtImy`F!iel!hDL?J>KsLG4^sgGz z9Zou6>D0h(SEHTi_F)k%NQT-m_Dfx8AX$P_gV*YXY|T%$ID z?^0(AxrX}@6JC?Ar`^TFcr0dE+tj>j`zBAj2yWk)!u)D$u0)mH)bkog=1cIJ{#1|m z9~&4lB+?b)^V$65s!yjBk_pv-m75G92cM0HwvnNPpXj+Tcr{(9X#Z{hOTlT`g9d(< zh!^$`1cdjljv|_#^7}cWN<}VbGa0VDIccyh`tn+)q{Knk)3Z*NIv40v|C{AoEu8c5 zvHSBG#m%IS+aEHG7tW<_LCh?!pEx>|Ld& zz+3{(gpaJQ8nh%>6+K%Hux3tkH}{9C9euy%SpQtZ0XqU zXD>dIQGC!u`hpq8CFv1T85RCq&eFH>mY9gDPNw08i>rj}9!W~F!@HOM(}&l7;zzlr z{Vbms57NhJlzLc}^OvNP6bOvo1GtU=P*Jv&)Dr>s-M6Sznt4>zICYxKS@VEA5W(Pd zVG-0@*heqoU;*LY-ZliLN4`V5Ygk36#l~JYm4U&@3~p4!Kq#WL?(fOjCgtm(>ok|^ zfHPTBRu{PwsgP?q5M^V#>dp@lM%Xtx7Kl#S{0+8G24hyBLgk>kK2XbE-Pv>Yx{c*F z7P-mW2}!`q>ki6r4pKY+%EW9#Nsh9@=b})_2;)RQ>g65|1m&peQc9~xP8o_>|4fh8 zOP=yWIAjgtlgLv5l#OS^qP|{(Jymg#ipQ)Y?AQ)Ap-&wZbPf(qOXD{Ny+G$Rq(1P% zuADZY*oYls^P*yS|8a9F*x{>%(9psYVyj8Ir^D}(lJRqhJmpR;jHu&4br62jQ(mz( z!!_3aiNi)Ie_u3~c>F1-`Mju!K8++y870!DY&MC*&BHZ<9jW^_2`m38#)2pIV}s#R zuiPigOa=u#1c|RBs%J$3!DO}Pl3uVZ1n~OSXYbBGX_IS_fpi+GH|TW((f{X#7_hck z;zSuBahR*F0~4w5JhT(KNKt{VIDK0~ZC7;oTA0ETO|cnz)5TB8nfSl^Y% zPq`7jvnoewaJ%}nnRlvv*9mXp5dx}tCGv82eji=F?_A4(#H(n(g1c@K`rwMJUW-3G zZ!--nIW4ugW=Kxz>`i3DZ%TLeX{ELZsVWp|d`fzEU~1F9m10_zqtMAMW_$`e7OF9s zo@sU)sI$f3B{o79;;Og{LRDqZbvGr6g7*mah+zmkykLn6qLit&8C+{9*I9xvb_|1Y zuSd_<4>qW72YmW1j)kDP+ zm|cdAoA>7yL_#KgLB?RX0A9^ss%s1rpfgnBI0fe3|JKk}h_@t1lhM}TRSMifk$f2n z&wE;qOCE&18LbxKQHPINVdT@gmvqt-Anp~Ta)UW-gIvQ1Nm#0~MiU5eNGyTg5;XiZ z-2Z@?<{GF$a1>_i9?Yzs%;&3$HV0RM*GL81f1_{*;fG)K?hHtwN3T z8m{)OS&zT$B#Y%B!l(2`2`Q&1WjqqMjvpD5oAhaUZn7?BdYUa_AvwVQs!ved{l)p? zPlCU#NYWKTe&~p*Wh3|4j&KcqL7qjH#u5@UlB<`{@kRxKJa|EUADeC&%NIAL{&z@b&g@GEa86deRmR2G^v_fC3o zeO_}1&}JYSQ@noVw1?&)NS0ii16{W!O$4q=3=(q?A-)yIad__Ind~}Hg;ZLOew*#n zh7tVCN@OW$=DPbCQ7t|q8^nU%DY|;Tuq*#$_4%__K3JWYNR<5)SdMLi7 zL?(C+YBY-dOsuVjA7(nYQ>K*8LDszvdWteLE&g}CXbU?cn9I|r)82h?Xe%UeGEWxbC01kZUt*_DP~ zo#|dni{UD$(PF0v`Qt0Ah-;(%=@h}zejQ&xfq>lww))kzZR=pehd^0i1paeI0xw93 zI_VnNXeNI`qz7jS>t4CK)bu_;_$Be%u2b%|<;H-`@}!@~JEgx+cz2mFmd1(|VW6y` zSvnI8mWjtl^MSdpC?JRLYf44z>ddPi&JbPApUIv$3LA7^KZ;?jbfv2U$l7T=%G)Ds9x1}{w<88Cu99>h%@Ejf5n&{aM%X-N0mSQAp*`b&lp#h| zrG;1re9|1UiO)MZRnAKpV;>CJ$Hc7 zLJ7^Pclr%%&L5nNw)Y_$%%m>bo?;GQ1J+9%#)7_RCF}b)gzqTtiAvI~4MT zX1(f79g-oMV&9u4-i@3)cp)z!!!@0wX;vD`F6-bQZ3iNx5jdfB%mmTcFW0K=C?w!C z1}+d-*?|#gvjh$ypyo%D%pscLPXJAuPU5R!gGq3!{9a9PNv5Pu$n)!IXzQNI21l~B zBmAROfM`MJK&2-bRqY# zS;Qhs=&=RKB*1CR;EJN~$*#eG0Jw+fSXR3r_0&OOJGa{&7#_ZPtBPGydTzP#5Oe&@B2%Edi%TZ#55~at&g= z?dsb9Vm$aB02n9mPU;dzH<>6;5bI1HtAAhcd&P4(2xQ>V_iHYy<{(9-j&K zbtuWUmPTdq#zA6%rx5n?k%2$;wv}|V7&AZQIm;AVm5l=GGs%Kj+1)<@y8Z!nvmQ}) zaCq-nvt=~5gpYSBNJ(6a9L^K-Eg^WtLNW{c!(uYHY?I{`vA)hgzKToWFtZS-teQXH zO>TQF-+zMIAVD_CSz6KQ4c+}M-hfn+M;KW!o)+G$O@!*bZIe%jptH;g*?kY6tS;Cae}Fexto$cHf{%j``>1 zuf6x#z1^GgTIQ$tw%`Wp-ORB1JzvdAnNWLEo99-7=>Yl6>uJ}DFq&BhtBfRr(T(dE ztFLu>UE-U?@nH?LfFx`_u5q^wNnme;IHsWNYye?1(YFL7@1}eGwF#*O@pY{|I ze;^Z?mD1M~n3S*|y^MaT6nwosIFT-kdep0bbYK1Q9$EhRUP|xXehBY^RWwN5ZioWR z4^azJRF%Uk1RM=kh8%GF&0n%w<+pg>2W>Ed-^_8msXHvRI1p~FTi2JD&iPrG$H)c< z`ox6f{sQ!(zYh*9O$df=KEIb=&gZBo1IF)9Q7TM{yZ$&<;?CLbQ-n=fCb)SOYEfkA zZU$u9dzNBX6;Ey8`OIC2kX$uwio}VcSwc(Fj~W!{U)eV5!+-aofeFLYa-@ zd1RJ~Ka|7vAd|x#6l5EAo4_60NY+}Qm2WOSSx9rv1Q$e|jaMI`5hvLv+EDBJci+G!iUA;dm6vbjN}ask6kI z#zlD$koqMdIsW!N7R*AAzUaHi2j$O?csl`HtVYQw!uT$i9W%EjUrWur_X(%`ucw@b z+{Xpf!h>d822b*#x?y@44p&R9wmQ}<^^OR~ z)-lv^Ltn5JvPm^OM}Dy-dEeIhy9Bh^Lrds@^88+5%PIHEFScO*=6vB1SmE5f=_4IO z=PvKF>g+oHJwXC5JIqK`T)3gTBZ-emZXb%5lt-|*liRUUJ@_<}NR`EI?}|HRD?%Zk zf}PcMiq1ud`f{($Rol-Ax4w#_-l7C4l#>hDxg_hHY)GhqB%~T5PYiXj5&wd-0EKrV zj(L4bCWG}9@7uS^ff+?30Gbq3A6~Ck8!;4Qt)-gkX`ZZLilJ#VCkjld{6#P>?E4ut zE;Sjj@GWT4_H!|Pv8PkVRa!SLMf{DnVSA1^|HWNtfRoO{r59UjLH90F1_;0#@5Tnl zS?-+5gd_iAq4LvBqiW;iY0pR- z@i*=bsCMg&{V2KkM96Alxf_o68rNV1V7rw1mc8mA8|bjOl#3>lCTrYooDy1V_FE6t zHj0q|70(&g{WBAoQW*!NC{DBv{cpaO87IZIr&#jx@mVN4KnSeYogGP+r{E(O><;*# z9QAcyGGGt4rvT+VNpm&YX}a0^Y}&;~?wEOas$>pScC_IjN19B(9yefr6dj@byo4N* z`N<{PYd59ocT1H?n`GSk`p4eINN=y0^L~e&LuQNbxKv74`>s5IV?*6>(r*lDm_qQr zRr-HrlGEZsY?S9A9vx#8ZxNa7ZQhUfelxP`)ypdqKRDGAgVcW}L3{iOLB zJiv#gcD;!Hu+i#)0C+PMS?x7aQU$i<{^FqVL-FO&4J*M{QEC75e>5C?X6A_Yv+(arWA$2;@Wpb!)L<~ zTTIlM-&XdqkN}@S{Q`Cq0w);%s+|(5Ao1_f2nUIFO;9rEMsR3U*{2^%QqFRlY3|P^ zelD-U=yL*J?)6WvS3Tla7w73FWgGR2RnVc79)-pQUnP2 zlt+cI2u(mzuN4i|CfCt$6yzfA<1qxN2_NqQmNxqL071(DVqp#LKwxm|C{L(P8%I+N}3J%^dRqF6su*q$5k*WI0V+ z^P;0RtlSPDxkAdTrTi`|^)m(oh!2($|(f=g*PW-*NgK)9@U@B`BOJXJC; z9G=-}Jfo5>u{Z=d^bw(*F`15wt5(`)b-RjRk9_ods%{BVfMz=|gSaSI&cnC0H{$s* zRZd#g8r(@@S;F)lvaR#h95WZNkn0X1O>O3ABrv9Ok^a=;|JT?aWM)hL>kPKFtorR) zRgZJxd-lnAP*>Syu|z=#_B@I>#D&v{zRS;BrTRVJ(JQ7OFfH`%#T$*-dg(R%GZDTk zDZuxwJ3GN$49ulLj9#1eT-~ywR>W^mMePkOG#Q85CK;h>bV*)el?uM2x!ue zH`;T&hZ@W@gG+xT7;cJbR7i!%tqPVO!4$VcH~_fSl3jvKOy0y4U~o!FeXRCnlUP#p z-3#4RYzl2silD*#%Wl`OUu^Mf8#8;=2--;ltP$Fzvl=#9$bG{ss4WKo##2x!VpF?FUDHcSKuf#ASe_bM7A-llx5qAK^CUBK z-gpQuw&C*Hv{B1mz$Iq=aIa3WzsH0b_zJ4>6=d4FhAs80RM943pu2QH`u+D5L=IHL z-1|&9?gF~=__;v1UJNEGYEBmO$dht(`I|gO_fYDe`z!YQS-=Jy&YccTW;vitwpsZr z*I(zV9;yEQ_9dxaeXSo`zz+SY%>l!o96HbR0ZLy;N^aabAVG?MOW?`eN$h&_6#DD; zPQUGy(oR>bdN57`JkK$_FY+fOh?8&ghMcK^9-bK)jc6^L#ZbTr|5VIcFb_IY$TdAW zX@FKi#RM;#+L@cYc;HM*EWN$tiZdS_A>f}%@aIe3+peelQy~qbC%-BUvbSR<2_6LW z1K~wcVuIP>R7&*^>C}by6?F86Efi#!wAJDo$h}ix&PfQSmGNKcE$3B)`<#9@3dNL` z{c%u*d0cT5T1DDGi1XSfZKY!4ysXFC(A97)BM?hTH~Et~i#uyRY&tXOE&uq2aqx1? z$dWIzD4@M86Xm=%&$o_g+hI82cT7r-PuNLG(Pq!D@!ggZYP6~5&|JuAX4a4Kq% z=(;Vl>M{tZj)O0Efw0HjF^>!PXWA_TvUm1vA=y7nDNITSU&1QNlYVrWE_Ox&$~%vh zu!u$v#1UGs-XBrwY^zm#xTtdq<@xjpW!+LO$UL|hsn%vetOMJUCF3Q1mB*v1*hc)% zR5^eVh&dE}6Rc7)W;sYG`6}kt{Gc1;TTWj&<+0x9|9To@hT#=rpFH&nQed; zzKL{~b70$`j`A!}yzBC3dFZV7ka|PdW_U~U7xNxtw)8xNtABKi;W~~}-b)zx1_$ZQ zVhYtLQyDYble=K@4~-#Th0s8o8wAPSk=vhQK)>(oZ?=(RyT>+q#*LM|Dj)@y_+5Ya z|14F5-rl+|gz@@*JE*p#I!?a@-Q#3!_3`hAGHMHyy@yY zR+L=~h{>8os>FKEK)Ctdsmku88|8Pf59De6=-VH393sAVbTD4jVx_%*GgFeH%gI0=XnY z?{~Y!rMzA)VTXN0P@Q;aA%2Kz{zbHlOULJ2!(B+4>y?MXFltbEKn_wLfY{k4uTuD( zqC9^67DNZPM@o0R{!Nd`^|2kd!G(*wKIVgx|0urk=#}P$e^GC~d*(#GfM~rEoNC(Z z$z+whjBz!dZcHSx*VG?$LH=u2-O8D#r>cQL@+x5WRD(kuOUL|NBv<9Ra=eI?8DWB< z^h++5H^LPM-@zP%gqaEz4{1y#05Hwc@Vd{HEic;aOPRK zz@wXmCKadKKu#LRpHj`cG4L#q1F++%XoHDAYD2jL3CfFQ{9ka{yrW(D;HK@SI54 zPQic0^{U{G=tuEAE5_&04pFmdo+x?)GnP+lCe7xOp;z+y1ZF_8!tD`PoaWP^(%o}a zB*5(VROPyBWrU(GqJNyTck}>ZFT10KZ1^p&IJtAWMf(K(U3<;j)VS4|S-uP8)#p5& z{+dW(6jMV~)MbF;?9oR3mTiQeE4%MGrD9Uy9Tbc!qmWE&kl>UA+V_Z&8hwnKc5QwL zyN8yyH|d8v`aflna|(Z|J&s3XXM%wrU++&+-gD_4k<;0htpyd;9=uL{pw$Ab$P*(a+(QMUhnsj@fSG1^2(iBZ`U3PHuPIy z`oqu+6gZfnih1os3nzc0{dlKUetVg|P}>AL9PzymIt27wjKVsoFUm;(({I@#Li=>aUyg_|B; zofslL>S5WX8w+ZamN;)` z{mdX3JE5DGP2s7jOCgCrZ=6>0-3eVxtjKy^Ko?Lcc(Z6#p8to-U>j!#Mz|jZwUQx% zmMic3(YgbUC>s$Y@Vx_hf3=N-S1n*6W029JM}fw?aRhAvBmZ0I!PD z5!F>i8YFM?%{0Cph1{KDKI||EzY>m0RT50S_vY*>h3q$Zdb)Y^j5qOa6W&H;Xeg_V zdJd29hePJqyL87nWZrjlhbJFY0UPxh?R|bq_6#O-H$0_`6__h$4#bWsa#Y?y0bl@VduVVlOblg?L*@k0vmeOn* zA^3g_fVAwc{K&HHt!eI2@t?0)3BS3UIZ0~hRm&5`|7@kL$#%Z41>yw4cidk4z~2tx z%dFht)G|;@z$z^dJBl-g6ZaW_B`1cAnAD67*BhJatHKPEV00ZGs%`Qz=-^G^itCbB zbm}6iJox%g=fwB6VgmM3YIBo|(Kf zUUD_`o%&w8(PX;gxbS0s<=a7fh=Pe_;|KAZjzc-(HGOfaow1Q>myVPdt)0va$^-o( zTk=yMFfBT`DV#oVTq%B%G%TCgp1E~za)>$c?0T8f7&d@fhHer6`gCY4g1qEjAAr|k zQY&F)3{rT{2fsJ^U|Cz}v>wt(Fz&M$8fQkM@)JV7%MqHsM|qj1*cz7eqNwN}-umgW zRqE&DtBhgf|C40($Kxcu|DoGEUm+S@7MP|cf2F`Q~7)5i=CgP+&hq+R@ zJ;mOYwH1k(7xhTU)RmM%tbS6@qtDQP1K-IOZ`O52o4+#xn@CO#mN`7pcP+}tO4`g! z$9IkM@4zexq_86DIMmE?##gY%O&0&dg0v=oYhIl5P{*89%82rs-1Hw~TJ<2)@3UZl zI{vEMKsXBDeFZ}t%tZPOQ7iG}2EtDSwYCgadL7hxq&otuzQlqH1xjP>QU5AUmL`UT z%EYoi)CK5qB1eys;`5SJi=RXbp}{9bkMxa7~!W~%Uz zUm$5kdMmyGh38bLqPvj;xPOrVMSvmQvkwfUs!nlHSH9str z8JB-wyZd(M)*O;AG4m(5oX>hgP0?^?*&@72`?pqcH$i$e8qq8t2S)HF5C{y;y|q4S z#1N1m>_K17`clOvF6=FP@v~6Ptee8o8;~||n72tyD986Qo zatnz^jUF+R%MsW@FmO5>-AQWyz-Uo6J{A>nuoxGM66_< zF>hGRO$-pJF;1In4*Q>!^r`EK28?i~d@=c6{hJs#Op{yTEo>4GKN5mIUGtWfY?NqR z&g@N4qMd9GYJ12{<$cg5-zxCMnYk1hJk3+5XMh$5&E9gb(yQ=qJle6K#3+-F9DgVT zPQ9KdBn#eMbb^&b+v11&FdOfdVe6kzS-8&fkg$Qbc6B1jL)-)(jPjh+(iOs(-NF8pPyz#{6Fz@z>b~dO z)&JF+hUXb6vG?cQRHFQcmFKx}Y9p)U*qJd7a#|e`u4y9n$(VB?HSv_@CoB2>M9j9# zhk&q&A8%2FJPdnF^p$q;{ATFmm4KbVuVdwpHHRjA*Pp+($CsbsUw-i7bY>0$ zgGQE#>|%QQ>|K`V-(*n$Ug=h%1*csg6o1P=685`ubXA~G(@S*_kkF}4*Z`#F>$rn)>q25m`+{OQ-lGT#TK+VHIS5h&h8ipjZ?*y1#K4!}AQ`HnQ2g^H z4V4i)6X^3-4`I0*b9d%2>g5{C@5_6-oyEUDD12bJXhVDGzu)Dv2$#$Iq!}4_X-A0F zr214D{VP^&Ij}-T*+@8Z84;8|@V;95h)LvI;~pDDBdugRuuT*_XMbOxX1tIAC3f>tu(f*6g@ndg!=nF6MmiVJ$&7-wTS8~59EkIJrGK5BFl#5g!>TITohh* zFALaj8QRpVWi)Rl>p^8O+}c)qu0*rLWp25~4Z8||o+e`7nhLwGA0;ex_zjMuK@`Pi z@pEH5I6|2HRf%6?SZFBk)~$rfG`dmNvkcBsP*o!@jLQu(@G8?gSDmfwR<*}J`VRC6 zW&tZHab4o3_`V2>LX3h%q$Elr>P?3nG8g#h z>U(c8Sn@Wh@WXTk<7bH)r>7E7zJej8uJ9j{AJ{fg2+djAsJWN(7X zlSKG#zR;KYi9JvC-g;y!F2gF#=W^*1Fzxn{nhzZn!34sJ9oLxxtflpQJ9O`ZP(4>a z+h{2#>4+XC^6UTVg^GGz!5MU-Q%*0K=)`IPDW_V{Z`zTunf9~I36pW^TXDs8iO|n_ zNlpbL4@@-Q$+m*&%_z1qc2Bq#)tx_v})ScCOQ_P$+p09n>a+`z0fEKyG)#8kahzN7P@q3 zW;v5--V&@n;_J4{7@JraU=kI>`jCr^+Gk}GAc~8Z>v#>F=X*NG!Uw1UoB^m%A9}Vj zSeuKrra0*C4xEG$eP8b-rn{X`rP7IyjM90$nllu{}(~}*_F>3 zMFcND8ca(%Kn~`##S^R+^jVjyquA}1|nfSsV*h7f4v@BB00_V$Mq=sa{ z9aA69uzUKlH>4(r$XY-G#yFxL;PbX+0YL1+Jy!^q(7lDR^u^EfeW!^b!m*M+9QJYN z-^j(cfg)!bD(@C%*>N3jRxO2@bN9F@l$=ieGQ9F8Z!%McqWSB(T3?gE?p27xw@-Ri z7s6#KQBGSj)dY>j^Jc5>l5(g7CKmqNli0?*14V3JT7CB}Gw?VZaDvAwH4kDS7uBd4 zZSUh4ANgH=K{SxEN}!>wCARnI^Lss1i{CZ}AQG@hfAj~`D%IV8wR|P(@u%iK;LNlf zg>kS7-g0P)%iP_PVXl#I`*wqOcZJYNIRJ^$24pK-(KspR3X@!3YIn$*BA8ctys5K2 zDuy{avFi2P56#m;NnLn@=Vyr_l@JYQC^U0O*IOmJ7CrjAhjXfR%S(XVv$Yl1m(Aja zW*85XoK%hzRj#BwWhg2up zv@HgZCTG9Vr%jRPJZWIWEc>r_(&h?A>yKZ&JA`z;fl?1&P{@4tQQPS&^w|XQd{tt^ zseI&d^-O)DDJC`+a6F~sNySHKhflD0ev+r{2}nY)hJ&=c6V9Fr6G;kem3$v;+%?f) zDqo>zRo0*kytg0|fBeq#&sIRWC*rj~UNI8=@UgomPMj^{??nR?ch7mj%w&+3b~Apq z|8uS~sXSE1_Iks~&kZ8zZg>m!I;xgPWt#CAIc#@;W=P`EGe=bQ9)w~4wZ z`v|Z0Hixen_xc(oB*Y75wT@M@a)9!ZO|-#pM=(a$u2O#GltISwGE_L5gCmNd{-=%T;U8aOkF`Q+n&u zlzP*Hyyft8jvtmxHlRkDZNo)n4t~Ek`x^d&mi`PvkADVot-U$`8(h0bOxyIfUK5>i zi+R8;k29}vn5Q^Zytq4TOM_1E5l$V1#^Y);z@hA`=`Lvqf$+dRaW}{n!OK75GVvyV zLYw7360LW7-&i-z5tLyGZhF@LC7aZGGrqxQWWE~)-i4Y%HW&zH3boJeF^5X7KS({} z%Th1ZDN*>hJgug;eow>s6nYzKw+eEF4+MHu81%ima5dnstB!dGU zigaP3FO2i6*~^{M99N6+iyKyCUWJmhLnsg!6{=+X1R`8-BK9)OIL+Pxf#CgORZxC} zqXf!k>r5rS_xxJRg~0dT+{*&V*;ExR%T8mcH5DtImy`F!iel!hDL?J>KsLG4^sgGz z9Zou6>D0h(SEHTi_F)k%NQT-m_Dfx8AX$P_gV*YXY|T%$ID z?^0(AxrX}@6JC?Ar`^TFcr0dE+tj>j`zBAj2yWk)!u)D$u0)mH)bkog=1cIJ{#1|m z9~&4lB+?b)^V$65s!yjBk_pv-m75G92cM0HwvnNPpXj+Tcr{(9X#Z{hOTlT`g9d(< zh!^$`1cdjljv|_#^7}cWN<}VbGa0VDIccyh`tn+)q{Knk)3Z*NIv40v|C{AoEu8c5 zvHSBG#m%IS+aEHG7tW<_LCh?!pEx>|Ld& zz+3{(gpaJQ8nh%>6+K%Hux3tkH}{9C9euy%SpQtZ0XqU zXD>dIQGC!u`hpq8CFv1T85RCq&eFH>mY9gDPNw08i>rj}9!W~F!@HOM(}&l7;zzlr z{Vbms57NhJlzLc}^OvNP6bOvo1GtU=P*Jv&)Dr>s-M6Sznt4>zICYxKS@VEA5W(Pd zVG-0@*heqoU;*LY-ZliLN4`V5Ygk36#l~JYm4U&@3~p4!Kq#WL?(fOjCgtm(>ok|^ zfHPTBRu{PwsgP?q5M^V#>dp@lM%Xtx7Kl#S{0+8G24hyBLgk>kK2XbE-Pv>Yx{c*F z7P-mW2}!`q>ki6r4pKY+%EW9#Nsh9@=b})_2;)RQ>g65|1m&peQc9~xP8o_>|4fh8 zOP=yWIAjgtlgLv5l#OS^qP|{(Jymg#ipQ)Y?AQ)Ap-&wZbPf(qOXD{Ny+G$Rq(1P% zuADZY*oYls^P*yS|8a9F*x{>%(9psYVyj8Ir^D}(lJRqhJmpR;jHu&4br62jQ(mz( z!!_3aiNi)Ie_u3~c>F1-`Mju!K8++y870!DY&MC*&BHZ<9jW^_2`m38#)2pIV}s#R zuiPigOa=u#1c|RBs%J$3!DO}Pl3uVZ1n~OSXYbBGX_IS_fpi+GH|TW((f{X#7_hck z;zSuBahR*F0~4w5JhT(KNKt{VIDK0~ZC7;oTA0ETO|cnz)5TB8nfSl^Y% zPq`7jvnoewaJ%}nnRlvv*9mXp5dx}tCGv82eji=F?_A4(#H(n(g1c@K`rwMJUW-3G zZ!--nIW4ugW=Kxz>`i3DZ%TLeX{ELZsVWp|d`fzEU~1F9m10_zqtMAMW_$`e7OF9s zo@sU)sI$f3B{o79;;Og{LRDqZbvGr6g7*mah+zmkykLn6qLit&8C+{9*I9xvb_|1Y zuSd_<4>qW72YmW1j)kDP+ zm|cdAoA>7yL_#KgLB?RX0A9^ss%s1rpfgnBI0fe3|JKk}h_@t1lhM}TRSMifk$f2n z&wE;qOCE&18LbxKQHPINVdT@gmvqt-Anp~Ta)UW-gIvQ1Nm#0~MiU5eNGyTg5;XiZ z-2Z@?<{GF$a1>_i9?Yzs%;&3$HV0RM*GL81f1_{*;fG)K?hHtwN3T z8m{)OS&zT$B#Y%B!l(2`2`Q&1WjqqMjvpD5oAhaUZn7?BdYUa_AvwVQs!ved{l)p? zPlCU#NYWKTe&~p*Wh3|4j&KcqL7qjH#u5@UlB<`{@kRxKJa|EUADeC&%NIAL{&z@b&g@GEa86deRmR2G^v_fC3o zeO_}1&}JYSQ@noVw1?&)NS0ii16{W!O$4q=3=(q?A-)yIad__Ind~}Hg;ZLOew*#n zh7tVCN@OW$=DPbCQ7t|q8^nU%DY|;Tuq*#$_4%__K3JWYNR<5)SdMLi7 zL?(C+YBY-dOsuVjA7(nYQ>K*8LDszvdWteLE&g}CXbU?cn9I|r)82h?Xe%UeGEWxbC01kZUt*_DP~ zo#|dni{UD$(PF0v`Qt0Ah-;(%=@h}zejQ&xfq>lww))kzZR=pehd^0i1paeI0xw93 zI_VnNXeNI`qz7jS>t4CK)bu_;_$Be%u2b%|<;H-`@}!@~JEgx+cz2mFmd1(|VW6y` zSvnI8mWjtl^MSdpC?JRLYf44z>ddPi&JbPApUIv$3LA7^KZ;?jbfv2U$l7T=%G)Ds9x1}{w<88Cu99>h%@Ejf5n&{aM%X-N0mSQAp*`b&lp#h| zrG;1re9|1UiO)MZRnAKpV;>CJ$Hc7 zLJ7^Pclr%%&L5nNw)Y_$%%m>bo?;GQ1J+9%#)7_RCF}b)gzqTtiAvI~4MT zX1(f79g-oMV&9u4-i@3)cp)z!!!@0wX;vD`F6-bQZ3iNx5jdfB%mmTcFW0K=C?w!C z1}+d-*?|#gvjh$ypyo%D%pscLPXJAuPU5R!gGq3!{9a9PNv5Pu$n)!IXzQNI21l~B zBmAROfM`MJK&2-bRqY# zS;Qhs=&=RKB*1CR;EJN~$*#eG0Jw+fSXR3r_0&OOJGa{&7#_ZPtBPGydTzP#5Oe&@B2%Edi%TZ#55~at&g= z?dsb9Vm$aB02n9mPU;dzH<>6;5bI1HtAAhcd&P4(2xQ>V_iHYy<{(9-j&K zbtuWUmPTdq#zA6%rx5n?k%2$;wv}|V7&AZQIm;AVm5l=GGs%Kj+1)<@y8Z!nvmQ}) zaCq-nvt=~5gpYSBNJ(6a9L^K-Eg^WtLNW{c!(uYHY?I{`vA)hgzKToWFtZS-teQXH zO>TQF-+zMIAVD_CSz6KQ4c+}M-hfn+M;KW!o)+G$O@!*bZIe%jptH;g*?kY6tS;Cae}Fexto$cHf{%j``>1 zuf6x#z1^GgTIQ$tw%`Wp-ORB1JzvdAnNWLEo99-7=>Yl6>uJ}DFq&BhtBfRr(T(dE ztFLu>UE-U?@nH?LfFx`_u5q^wNnme;IHsWNYye?1(YFL7@1}eGwF#*O@pY{|I ze;^Z?mD1M~n3S*|y^MaT6nwosIFT-kdep0bbYK1Q9$EhRUP|xXehBY^RWwN5ZioWR z4^azJRF%Uk1RM=kh8%GF&0n%w<+pg>2W>Ed-^_8msXHvRI1p~FTi2JD&iPrG$H)c< z`ox6f{sQ!(zYh*9O$df=KEIb=&gZBo1IF)9Q7TM{yZ$&<;?CLbQ-n=fCb)SOYEfkA zZU$u9dzNBX6;Ey8`OIC2kX$uwio}VcSwc(Fj~W!{U)eV5!+-aofeFLYa-@ zd1RJ~Ka|7vAd|x#6l5EAo4_60NY+}Qm2WOSSx9rv1Q$e|jaMI`5hvLv+EDBJci+G!iUA;dm6vbjN}ask6kI z#zlD$koqMdIsW!N7R*AAzUaHi2j$O?csl`HtVYQw!uT$i9W%EjUrWur_X(%`ucw@b z+{Xpf!h>d822b*#x?y@44p&R9wmQ}<^^OR~ z)-lv^Ltn5JvPm^OM}Dy-dEeIhy9Bh^Lrds@^88+5%PIHEFScO*=6vB1SmE5f=_4IO z=PvKF>g+oHJwXC5JIqK`T)3gTBZ-emZXb%5lt-|*liRUUJ@_<}NR`EI?}|HRD?%Zk zf}PcMiq1ud`f{($Rol-Ax4w#_-l7C4l#>hDxg_hHY)GhqB%~T5PYiXj5&wd-0EKrV zj(L4bCWG}9@7uS^ff+?30Gbq3A6~Ck8!;4Qt)-gkX`ZZLilJ#VCkjld{6#P>?E4ut zE;Sjj@GWT4_H!|Pv8PkVRa!SLMf{DnVSA1^|HWNtfRoO{r59UjLH90F1_;0#@5Tnl zS?-+5gd_iAq4LvBqiW;iY0pR- z@i*=bsCMg&{V2KkM96Alxf_o68rNV1V7rw1mc8mA8|bjOl#3>lCTrYooDy1V_FE6t zHj0q|70(&g{WBAoQW*!NC{DBv{cpaO87IZIr&#jx@mVN4KnSeYogGP+r{E(O><;*# z9QAcyGGGt4rvT+VNpm&YX}a0^Y}&;~?wEOas$>pScC_IjN19B(9yefr6dj@byo4N* z`N<{PYd59ocT1H?n`GSk`p4eINN=y0^L~e&LuQNbxKv74`>s5IV?*6>(r*lDm_qQr zRr-HrlGEZsY?S9A9vx#8ZxNa7ZQhUfelxP`)ypdqKRDGAgVcW}L3{iOLB zJiv#gcD;!Hu+i#)0C+PMS?x7aQU$i<{^FqVL-FO&4J*M{QEC75e>5C?