jbigkit-2.1/0000775000307500030750000000000012315071063011437 5ustar mgk25mgk25jbigkit-2.1/ANNOUNCE0000664000307500030750000001606712315071063012602 0ustar mgk25mgk25 JBIG-KIT lossless image compression library ------------------------------------------- by Markus Kuhn The latest release of JBIG-KIT can be downloaded from http://www.cl.cam.ac.uk/~mgk25/jbigkit/ JBIG-KIT implements a highly effective data compression algorithm for bi-level high-resolution images such as fax pages or scanned documents. JBIG-KIT provides two variants of a portable library of compression and decompression functions with a documented interface. You can very easily include into your image or document processing software. In addition, JBIG-KIT provides ready-to-use compression and decompression programs with a simple command line interface (similar to the converters found in Jef Poskanzer's PBM graphics file conversion package). JBIG-KIT implements the specification International Standard ISO/IEC 11544:1993 and ITU-T Recommendation T.82(1993), "Information technology - Coded representation of picture and audio information - progressive bi-level image compression", , which is commonly referred to as the "JBIG1 standard". JBIG (Joint Bi-level Image experts Group) is the committee which developed this international standard for the lossless compression of images using arithmetic coding. Like the well-known compression algorithms JPEG and MPEG, JBIG has also been developed and published by the International Organization for Standardization (ISO) and the International Telecommunication Union (ITU). See also http://www.jpeg.org/jbig/ http://www.iso.ch/ http://www.itu.int/ The JBIG compression algorithm offers the following features: - Close to state-of-the-art lossless compression ratio for high resolution bi-level images. - About 1.1 to 1.5 times better compression ratio on typical scanned documents compared to G4 fax compression (ITU-T T.6), which has been the best compression algorithm for scanned documents available prior to JBIG. - Up to 30 times better compression of scanned images with dithered images compared to G4 fax compression. - About 2 times better compression on typical 300 dpi documents compared to 'gzip -9' on raw bitmaps. - About 3-4 times better compression than GIF on typical 300 dpi documents. - Even much better competitive compression results on computer generated images which are free of scanning distortions. - JBIG supports hierarchical "progressive" encoding, that means it is possible to encode a low resolution image first, followed by resolution enhancement data. This allows, for instance, a document browser to display already a good 75 dpi low resolution version of an image, while the data necessary to reconstruct the full 300 dpi version for laser printer reproduction is still arriving (say over a slow network link or mass storage medium). - The various resolution layers of a JBIG image in progressive encoding mode together require not much more space than a normal non-progressive mode encoded image (which JBIG also supports). - The progressive encoding mode utilizes a quite sophisticated resolution reduction algorithm which offers high quality low resolution versions that preserve the shape of characters as well as the integrity of thin lines and dithered images. - JBIG supports multiple bit planes and can this way also be used for grayscale and color images, although the main field of application is compression of bi-level images, i.e. images with only two different pixel values. For grayscale images with up to 6 bit per pixel, JBIG performs superior to JPEG's lossless mode. JBIG-KIT can be used as free software under the GNU General Public License. Other license arrangements more suitable for commercial applications are available as well, please contact the author for details. JBIG-KIT provides two portable libraries implemented in ANSI/ISO C for encoding and decoding JBIG data streams, along with documentation. The first library, jbig.c, implements nearly all of the options that the JBIG standard provides, but keeps the entire uncompressed image in memory. The second library, jbig85.c, implements only the ITU-R T.85 subset of the standard that black/white fax machines use (single bit per pixel, no "progressive" encoding), and keeps only three lines of the uncompressed image in memory, making it particularly attractive for low-memory embedded applications. The libraries are not intended for 8-bit or 16-bit machine architectures (e.g., old MS-DOS C compilers). For maximum performance, a 32-bit processor is required (64-bit systems work too, of course). On architectures with 16-bit pointer arithmetic, the full-featured jbig.c library can process only very small images. Special features of the full-featured jbig.c variant: - Fully reentrant multithread-capable design (no global or static variables, isolated malloc()/free() calls, etc.) - Capable of handling incomplete and growing JBIG data streams in order to allow earliest display of low resolution versions - Capable of handling several incoming data streams simultaneously in one single process and thread - Especially designed with applications in mind that want to display incoming data as early as possible (e.g., similar to the way in which Netscape Navigator handles incoming GIF images) - Implements all JBIG features and options including progressive and sequential encoding, multiple bit planes, user specified resolution reduction and deterministic prediction tables, adaptive template changes for optimal performance on half-tone images, deterministic prediction, typical prediction in lowest and differential layers, various stripe orderings, etc; only the SEQ and HITOLO options are currently not supported by the decoder (they are normally never required, but could be added later in case of user requirements) - Suitable for fax applications, satisfies ITU-T T.85 profile - Efficient code, optimized utilization of 32-bit processor registers - Very easy to use documented C library interface - Included Gray code conversion routines for efficient encoding of grayscale images - Ready-to-use pbmtojbg and jbgtopbm converters. Special features of the light-weight jbig85.c variant: - Suitable for low-memory embedded applications - Implements only the JBIG1 subset defined in the ITU-T T.85 profile (single bit plane, no differential layers) - Requires only three pixel rows of the uncompressed image to be kept in memory - Handles all NEWLEN modes of operation required by ITU-T T.85 with just a single pass over the data, automatically performing the necessary lookahead after the last stripe - Codec buffers only a few bytes of arithmetic-codec data and outputs resulting bytes or lines as soon as they are available. I will try to provide free support and maintenance for this software for the foreseeable future, depending on my available time. Happy compressing ... Markus Kuhn -- Markus Kuhn, Computer Laboratory, University of Cambridge http://www.cl.cam.ac.uk/~mgk25/ || CB3 0FD, Great Britain jbigkit-2.1/CHANGES0000664000307500030750000002167312315071063012443 0ustar mgk25mgk25 JBIG-KIT revision history ------------------------- Changes in version 2.1 (2014-04-08) This is a security-critical bug-fix release that remains API and ABI backwards compatible to version 2.0. Users who process BIE data from untrusted sources should upgrade. - fixed a buffer-overflow vulnerability in the jbig.c decoder, reported by Florian Weimer (Red Hat): CVE-2013-6369 - fixed ability of corrupted input data to force jbig85.c decoder into an end-less loop - fixed a bug in the processing of private deterministic-prediction tables (DPPRIV=1) in jbig.c decoder - fixed integer-type mismatches in printf arguments on 64-bit systems - fuzz-testing script added Changes in version 2.0 (2008-08-30) Main new features of release 2.0: - This release adds a separate lightweight "T.85" version of the encoder and decoder library (jbig85.c, jbig85.h). This new T.85 library is optimized for embedded low-memory applications, such as printers and fax machines. It implements only the subset of the JBIG standard that is required by the ITU-T T.85 fax profile, namely only a single bit plane (P = 1) and no differential layers (DL = D = HITOLO = SEQ = ILEAVE = SMID = TPDON = DPON = DPON = DPLAST = 0) and some other restrictions (MY = 0, MX < 128). The T.85 library requires only three pixel rows of the uncompressed image to reside in memory at any time. This 3-line buffer has to be allocated by the calling application, therefore the T.85 library will not call any heap management functions such as malloc() or free() itself. - There are also two new example applications pbmtojbg85 and jbgtopbm85 included that provide command-line access to the new T.85 library. (Note to distribution maintainers: there is probably little point in adding pbmtojbg85 and jbgtopbm85 to precompiled JBIG-KIT packages for workstation operating systems, as these two programs do not really provide the end user much additional functionality beyond what pbmtojbg and jbgtopbm already do, which use the full library instead.) Changes to the original full jbig.c library from version 1.6: - the arithmetic codec routines are now located in a separate source file (they are now used by both the full library jbig.c and the new T.85 library jbig85.c, and might also be of use to other applications) - arithmetic decoder behaviour slightly changed to enable the lookahead needed to handle T.85-style NEWLEN after the final stripe - added encoder support for adding comment marker segment - added encoder option for using SDRST marker instead of SDNORM (only useful to make encoder able to generate a wider range of test data) - added pbmtojbg options -C and -r, which provide command-line access to the previous two extensions - slightly improved diagnostic output of jbgtopbm option -d - non-English translations of error messages are now provided in a separate PO file (e.g., for use with GNU gettext), jbg_strerror() no longer has a language attribute and the JBG_EN, JBG_DE_8859_1, JBG_DE_UTF_8 constants no longer exist - jbg_dec_in() return values changed; the least significant bits of the error codes now provide more information about what caused the error, beyond what the more general error text messages returned by jbg_strerror() reveal - pbmtojbg has a new option -f as a shortcut for all the options needed to make the output comply to the basic ITU-T T.85 fax profile - jbg_dec_getwidth(), jbg_dec_getheight(), jbg_dec_getsize(), and jbg_dec_getsize_merged() return now an unsigned long value (was: long), and return 0 (was: -1) if no image is available yet - jbgtopbm now outputs image dimensions in header padded to 10 digits fixed width, for consistency with jbgtopbm85 to allow for later in-place update of height due to NEWLEN - macro JBG_LICENCE can be changed from the default value "GPL" to a licence agreement reference code to if the library is used under a commercial licence, to clarify under which exact licence the library is used in a particular application Changes in version 1.6 (2004-06-11) - various small changes to reduce the risk of 32-bit unsigned integer overflows when dealing with extremely large images - robuster treatment of L0 = 0xffffffff - minor API modification in jbg_enc_options(): parameter l0 changed from type long to unsigned long; previous value now remains unchanged when l0 == 0 (was: l0 < 0) - lots of type casts added such that the C source code is now also compilable as C++ Changes in version 1.5 (2003-06-11) - fixed two minor memory leaks (special thanks to Davide Pizzolato for locating one of these) - jbgtopbm does not attempt any more to parse multiple concatenated BIEs (options -m must be used now to enable this feature explicitly), in order to handle BIEs with data after the last expected SDE gracefully - various extensions to improve support of JBIG fax applications (ITU-T T.85 profile): o support for maximum adaptive template pixel offset increased to MX=127 in both encoder and decoder o encoder now has a hook for producing BIEs with a NEWLEN marker segment and VLENGTH=1, in order to assist in testing decoders for T.85 conformance (see also new pbmtojbg option -Y) o a new function jbg_newlen() can be used to scan an entire in-memory BIE for NEWLEN marker segments and update the YD value in the BIE header, which can be applied to BIE data before passing it to the decoder for T.85 compliance (Background: the incremental design of the JBIG-KIT decoder makes it infeasible to look ahead for NEWLEN marker segments that occur after the SDE with the last image line, therefore this second pass is necessary to handle the old-style fax applications permitted by T.85 in which the low-RAM encoder doesn't know the height of the image at the start of transmission) Changes in version 1.4 (2002-04-09) - typo fixed in stripe number calculation, which caused encoder and decoder to fail on certain image sizes (special thanks to Koen Denecker for locating this one) Changes in version 1.3 (2002-03-23): - bugs fixed in jbg_split_planes(), jbg_dec_merge_planes() that caused a failure for more than eight planes per pixel - example converters now can handle PGM files with up to 32 bits per pixel Changes in version 1.2 (2000-04-08): - bug in the decoder fixed, which caused the rest of the input file to be skipped whenever a comment marker was encountered (special thanks to Ben Rudiak-Gould for reporting this one) Changes in version 1.1 (1999-11-16): - serious bug in the encoder fixed, which for a very small percentage of images has caused an unterminated linked list to be created internally that could have been responsible for segmentation violations or non-terminating encoders (special thanks to Hisashi Saiga for tracking that one down) - minor bug in the "jbgtopbm -d" diagnostic output fixed Changes in version 1.0 (1998-04-11): - two bugs fixed that caused the encoder and decoder to fail under certain modes of operation with several bit planes - added new functions jbg_split_planes(), jbg_dec_merge_planes(), and jbg_dec_getsize_merged() for easy handling of grayscale images - added support for compressing grayscale PGM files to pbmtojbg and jbgtopbm - more changes to avoid paranoid compiler warnings Changes in version 0.9 (1996-01-09): - encoder won't break any more on input bitmap data with incorrect zero padding - pbmtojbg displays a warning if input file has incorrect zero padding - various minor improvements suggested by Stefan Willer - many minor changes in order to avoid warnings from paranoid compilers Changes in version 0.8 (1995-09-20): - namespace cleared up, all names externally visible from the library start now with jbg_ or JBG_ - minor non-critical bug fixed which caused library to fail compatibility test and showed up especially on DEC Alpha systems - jbg_dec_gethight() is now called jbg_dec_getheight() - filenames conform now to MS-DOS limits - Bug in pbmtojbg fixed (handling of ASCII PBM files) Changes in version 0.7 (1995-06-10): - more problems on 16-bit int systems and on Macintosh systems fixed (special thanks to Jean-Pierre Gachen ) - global Makefile Changes in version 0.6 (1995-06-08): - memory leak fixed - should now also work on systems where int is only 16-bit large - changes of the JBIG "Technical Corrigendum 1" included (special thanks to Dr. Sebestyen from Siemens AG for sending me a copy of the draft) First release: version 0.5 (1995-05-28) jbigkit-2.1/COPYING0000664000307500030750000004307612315071063012504 0ustar mgk25mgk25 GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 675 Mass Ave, Cambridge, MA 02139, USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Library General Public License instead.) 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 this service 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 make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. 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. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute 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 and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), 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 distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the 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 a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, 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. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE 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. END OF TERMS AND CONDITIONS Appendix: 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 convey 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) 19yy 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 2 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, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) 19yy name of author Gnomovision 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, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This 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 Library General Public License instead of this License. jbigkit-2.1/INSTALL0000664000307500030750000001425512315071063012477 0ustar mgk25mgk25 Getting started with JBIG-KIT ----------------------------- Markus Kuhn -- 2014-03-27 JBIG-KIT is a portable C library that should work on any platform with an ANSI/ISO C compiler, such as GNU gcc. To get started, compile the demonstration software in pbmtools/ and test it with some of the provided example files. On a Unix system, check Makefile to suit your compiler, then start "make". If libjbig.a and/or libjbig85.a have been produced correctly, then activate the automatic library test suite with "make test", or just start libjbig/tstcodec and libjbig/tstcodec85. If these tests fail, please do let me know. On other operating systems, just link libjbig/jbig.c and libjbig/jbig_ar.c together with any application in which you want to use the full JBIG-KIT library. Likewise, just link libjbig/jbig85.c and libjbig/jbig_ar.c together with any application in which you want to use the simpler variant optimized for fax applications. In subdirectory pbmtools/, you will find the programs pbmtojbg and jbgtopbm. These are two file converters, serving as examples for applications that use the full JBIG-KIT library (jbig.c). After testing them on some of the example JBIG files, you can move these executable files together with their respective man pages (in a UNIX style environment) to the appropriate directories. Options -h and --help will give you short command-line usage summaries. The programs pbmtojbg85 and jbgtopbm85 are very similar, but demonstrate use of the simpler jbig85.c library instead. The subdirectory examples/ contains a few files as raw JBIG data streams (called bi-level image entities (BIE) in the standard). Try jbgtopbm ccitt1.jbg ccitt1.pbm to decompress CCITT test letter #1 into a portable bitmap file, which you can then further convert using Jef Poskanzer's PBM tools , or view with many popular image file viewers, such as the "display" command from ImageMagick. The ccitt1.jbg image is 1728 x 2376 pixels large and may not fit onto your display screen. However, fortunately, I have stored it in JBIG's "progressive mode" with the following resolution layers: layer 0: 216 x 297 pixel layer 1: 432 x 594 pixel layer 2: 864 x 1188 pixel layer 3: 1728 x 2376 pixel In progressive mode, each layer has twice the resolution of the previous one. Resolution layer 0 encodes all its pixels independent from any other data; all other resolution layers encode only the difference between the previous and the new resolution layer, which requires much less space than encoding resolution layers without referring to the lower layer. By default, the BIE files produced by pbmtojbg will all start with a lowest resolution layer 0 that fits onto a 640 x 480 screen. In order to tell jbgtopbm that you do not want to decode higher resolution layers if they will not fit onto your (say) 1024 x 768 pixel display, simply use jbgtopbm -x 1024 -y 768 ccitt1.jbg ccitt1.pbm You will get a 4 times smaller image, the highest resolution layer that still fits onto your screen. You can also directly pipe the image to another application using standard output, by removing the second file name, e.g. jbgtopbm -x 1024 -y 768 ccitt1.jbg | display In fact, the data in the first quarter of the input file is sufficient to decode the requested resolution: head --bytes=4000 ccitt1.jbg | ../pbmtools/jbgtopbm -x 1024 -y 768 | display Now let's do some compression. With jbgtopbm ccitt1.jbg ccitt1.pbm followed by pbmtojbg ccitt1.pbm test.jbg you produce again the same data stream as ccitt1.jbg. However if you want that the lowest resolution layer is not larger than 70 x 100 pixels ("thumb nail" image), then use pbmtojbg -v -x 100 -y 150 ccitt1.pbm test.jbg Option -v will output some technical data, and will tell you that five incremental resolution layers have been created, in addition to the lowest 54 x 75 pixel large layer 0. Look at the lowest resolution layer in test.jbg with jbgtopbm -x 100 test.jbg | display and you will still be able to clearly recognize the layout and line structure of the page, which the implemented bi-level resolution-reduction algorithm tried to preserve. With pbmtojbg -q ccitt1.pbm test.jbg you can enforce a single resolution layer, which usually requires a slightly less space than progressive encoding. OK, another small exercise. Assume you want to build a document database in which you want to store scanned images in two resolution layers, one for screen previewing and one for laser-printer output. However, you do not want your decision to store images in two resolutions to cause too much additional storage requirement. You decide that 3 resolution layers in JBIG fit your requirement and you want to store layer 0: 432 x 594 pixels in the first file test-low.jbg and the two layers layer 1: 864 x 1188 pixels layer 2: 1728 x 2376 pixels in the second file test-high.jbg. No problem, just call pbmtojbg -d 2 -l 0 -h 0 ccitt1.pbm test-low.jbg pbmtojbg -d 2 -l 1 -h 2 ccitt1.pbm test-high.jbg where option -d specifies the total number of layers and -l/-h select the range of layers written to the output file. You will see that the low and high resolution file together are only 1.6 kB larger than if you had stored only the high-res version directly without progressive mode (option -q). Progressive mode has reduced the additional storage requirement by 50% compared to storing the 3.2 kB low-resolution version independently of the high resolution image. In order to view only the screen version, use jbgtopbm test-low.jbg | display and in order to send the full version to the printer, just concatenate both BIE files like in cat test-low.jbg test-high.jbg | jbgtopbm -m | .... All this functionality, and more, are available as functions in the libjbig C library, which you can link into your application. Just copy the relevant files from libjbig/ into your own source-code directory and adapt your Makefile. In libjbig/jbig.txt, you will find documentation about how to use the full library, while libjbig/jbig85.txt documents the fax variant of the library. The latter lacks progressive encoding, but can instead deal better with images where the height is not yet known at the start of a transmission. Markus jbigkit-2.1/Makefile0000664000307500030750000000200712315071063013076 0ustar mgk25mgk25# Unix makefile for JBIG-KIT # Select an ANSI/ISO C compiler here, GNU gcc is recommended CC = gcc # Options for the compiler: A high optimization level is suggested CFLAGS = -O2 -W -Wno-unused-result # CFLAGS = -O -g -W -Wall -Wno-unused-result -ansi -pedantic # -DDEBUG export CC CFLAGS VERSION=2.1 all: lib pbm @echo "Enter 'make test' in order to start some automatic tests." lib: cd libjbig && $(MAKE) -e pbm: lib cd pbmtools && $(MAKE) -e test: lib pbm cd libjbig && $(MAKE) test cd pbmtools && $(MAKE) test analyze: cd libjbig && $(MAKE) analyze cd pbmtools && $(MAKE) analyze clean: rm -f *~ core cd libjbig && $(MAKE) clean cd pbmtools && $(MAKE) clean distribution: rm -rf jbigkit-$(VERSION) git archive v$(VERSION) --prefix jbigkit-$(VERSION)/ | tar xvf - make -C jbigkit-$(VERSION)/pbmtools txt tar cvaf jbigkit-$(VERSION).tar.gz jbigkit-$(VERSION) release: rsync -t jbigkit-$(VERSION).tar.gz $(HOME)/public_html/download/ rsync -t jbigkit-$(VERSION)/CHANGES $(HOME)/public_html/jbigkit/ jbigkit-2.1/TODO0000664000307500030750000000413512315071063012132 0ustar mgk25mgk25Features that may appear in some future release regarding jbig.c: - function to prepare incompletely decoded images for display by Xlib - use a more efficient resolution-reduction method suggested by Dr. Klaus Bartz - investigate whether there is a standard way of embedding JBIG into TIFF and implement it (see also RFC 2301) - test for and eliminate warning messages from compilers other than GCC - multichannel (e.g., RGB) support, PPM support - add dynamic library target to Makefile (patch by David Woodhouse), for the benefit of Linux packagers The NEWLEN handling in jbig.c remains less than ideal. There is no easy fix as NEWLEN is inherently incompatible with many of the other options that jbig.c supports. The whole point of the VLENGTH bit may have been to allow recipients to choose between a jbig.c (VLENGTH=0) and jbig85.c (VLENGTH=1) style of decoder implementation. The cleanest option would really be to remove NEWLEN support entirely from jbig.c and to urge users who need it to use jbig85.c instead. Short of that, the new NEWLEN look-ahead architecture from jbig85.c could be backported to jbig.c, but this would only only slightly increase the number of cases where the jbig.c decoder could deal with a NEWLEN marker without a prior invocation of the jbg_newlen() pre-processing pass. The following past feature requests for jbig.c probably have become less important since the release of jbig85.c: - compile-time option to remove progressive encoding and resolution-reduction support (in the interest of reducing code size) - investigate how to best deal with broken BIEs that contain multiple NEWLEN marker segments, which are not permitted by ITU-T T.85, but which have been observed coming from some fax machines; possible options for jbg_newlen(): use first, last, or minimum value - version of jbg_newlen() for dealing with BIEs that are split into several blocks - call-back function for progress meter Features that may appear in some future release regarding jbig85.c: - man pages for pbmtojbg85 and jbgtopbm85 jbigkit-2.1/contrib/0000775000307500030750000000000012315071063013077 5ustar mgk25mgk25jbigkit-2.1/contrib/INDEX0000664000307500030750000000120712315071063013671 0ustar mgk25mgk25Here are some files which users of JBIG-KIT have contributed and which I have included into the package in the hope that you might find them useful. If you have questions with regard to these files, better contact the respective contributors directly. --------------------------------------------------------------------------- atariprj.tar From: Stefan Willer These are four hierarchical project files for use with the Atari ST Pure-C development environment. With these files, installing JBIG-KIT should be child's play for Atari ST users (except the necessary line end changes in all text files). jbigkit-2.1/contrib/atariprj.tar0000664000307500030750000002400012315071063015417 0ustar mgk25mgk25libjbig/ 755 1 1 0 6073366414 5422 5libjbig/libjbig.prj600644 1 1 755 6073366704 7620 ; Atari/Pure C project file ; (used automatically by other project files) libjbig.lib .L[-J] ; link new Obj-format (so we get a library) .C[-w-cln] ; no "constant is long" warnings .C[-w-sig] ; no "conversion may lose significant digits" warnings .C[-w-amb] ; no "ambiguous operators need parentheses" warnings .C[-w-pia] ; no "possibly incorrect assignment" warnings .C[-DTEST_CODEC]; (export some internal functions for testing) = jbig.c (jbig.h) jbig_tab.c (jbig.h) libjbig/tstcodec.prj600644 1 1 575 6073367006 10022 ; Atari/Pure C project file ; (uses libjbig.prj) tstcodec.tos .C[-w-cln] ; no "constant is long" warnings .C[-w-sig] ; no "conversion may lose significant digits" warnings .C[-w-par] ; no "parameter xxxx unused" warnings .C[-DTEST_CODEC]; (import some internal functions for testing) = pcvstart.o tstcodec.c (jbig.h) libjbig.prj libjbig.lib pcstdlib.lib pbmtools/ 755 1 1 0 6073366442 5660 5pbmtools/jbgtopbm.prj600644 1 1 373 6073367026 10251 ; Atari/Pure C project file ; (uses libjbig.prj) jbgtopbm.ttp .C[-w-cln] ; no "constant is long" warnings = pcvstart.o jbgtopbm.c (..\libjbig\jbig.h) [-I..\libjbig\] ..\libjbig\libjbig.prj ..\libjbig\libjbig.lib pcstdlib.lib pbmtools/pbmtojbg.prj600644 1 1 415 6073367070 10245 ; Atari/Pure C project file ; (uses libjbig.prj) pbmtojbg.ttp .C[-w-amb] ; no "ambiguous operators need parentheses" warnings = pcvstart.o pbmtojbg.c (..\libjbig\jbig.h) [-I..\libjbig\] ..\libjbig\libjbig.prj ..\libjbig\libjbig.lib pcstdlib.lib jbigkit-2.1/examples/0000775000307500030750000000000012315071063013255 5ustar mgk25mgk25jbigkit-2.1/examples/README0000664000307500030750000000044312315071063014136 0ustar mgk25mgk25The files in this directory are a few sample images and documents stored as raw bi-level image entities (BIE) (the data stream specified by the JBIG standard). The source data for the test examples ccitt* and lena.bie is available from ftp://ftp.funet.fi/pub/graphics/misc/test-images/ jbigkit-2.1/examples/ccitt1.jbg0000664000307500030750000004067612315071063015145 0ustar mgk25mgk25 H6ZlngOh$V[saPB@=BlʢP%?A׭]@?R1o"&7z4s q2B J*/_#w٢䙠X [bB6<)V321Aۧ.&^nʻEi =@4&1Y]7yyE5* kgîȞYiEJu=.{椨Ouո Vf~zuzlZ f~1)(EiJ19Q}m;Pdv [UsT(U;rXkd[L,VAaS\BuW ReCmQtN١Yke#; F12 X| Ls_!t`|a .-^ ,j}!&N9)^g ^7PUxcm<9˛4rYhYhF<Wt ।1R;Q٣ghSD0Ѥ&󠩹ﰫ lsdbPm(7[Ģiep~M$jԵH\t<ÃRD,O9l  '_4RFxZI|?(,mdw&?5Lr+,O$ŧDqK`DwR$B#c:, w*%Q_*`-ƢO";#8۪x}+z+s0}WRغ|ݩ9q k2]~: !%K,YKfx'_ _:cgFp~pڌB2}z낯<N9aGE#Mspu`7= ڤeEj!dIr&< CP~6ܰͽD"X-pE |5 9&`n{(ZMgŠs@˔gs.U:qJj-{#G~j4n84X"Q%GwPoRy#GyhdIM-/`F~XYeV S3d}1gj4<4B+ fis63MuŠh"TO֊$oFtmvQV E֔P!rUI7ax2Dd9!(iJ6w8 n=?rQ-ۥ[o\Z4]ZoPxC'>t/o?{;$1.2+:2^$"p>RrW`c{ADawY #P>=5!x*N ^l;QP.s_ibs5]v"9Ө4Tݵ ̣Igz2,u89Og>5YЀ}Sw:1h:*-. hL {罨Y+m4d3HO"H_D3x45b0m+-ko(wc>oEl|;V.x}q EȬVYf$SMn# j@LkGʐVڒ`ya<ᇂXQ*;&,TL]ZN1wTWݼ7O|>C}ߴ?K';lj(H]ґ̑yhvG*(a yo gO%W; zP9PϴֹqWZZ2m1ܨ ;%jqc%HvQ|3W+;[ k<#;y9sF J_ v}VtOVrpX|{ϥZUJrRt@'up9%8a qRT46XI埏Y&Ev7lĶU8VU4uD"99UdUGyK.2 i騟(5;~ ?츠';0Q~3oRYwYN[чEL-ܬV CÂv7-3{YCz `ne4a44 aU`9&ht d?(^ 0BZnDujx>sէIwl^ |>Ȝt%}S]qV7|*^8ϰڴ2e(H@[8z_6p~ fp,rGLP9uBz:^ RX9N/İDpȏn\PAd[ ρU.-UZ"~#RwQ$EJqE%K\J qы9$)Qځb*К_;\3IMn{q4^/;.kJhd}:-L랛zHhNwu:'/M^2b⺁Pwޢ|W0uAû|~gV[86 1OOqĘ"b!$ !8_|4aO!뙤 <(e71y 0V+.4tZd7vc@U]Jc%V_E9a !U1_@%=b.СẂ &z6v5%ӘQyڿjOz)&̯.FԝscCu仹W:ZOJinrfFR_:YhҊDU,(vO q1jms{ήЗ#kG9BWC:xFWj TĂK5f.3#cq Sz_jQ/n3(B*(H+Rޫ@(]n)Ї?kQ._k8 Ծv\L",3:D1QT3Ws{Lԯ^'49tktFoxYdRFAV$ߐ6};½E8UqgYP+s(Ԣ_,9c>6ڈRՈ{^,k%΀iҗk3} ys4^[PH$gӖ^? ^?adjg !ixK{%-eplkgs)pg*$[6o?BlM醲}VC3{6CfEsg?*8!#0' -l*^ZMubIO;mK"WM'VLqT~z[~uirX,T|v8@Ngo8nrU tbH4` p?6Pr;_:~q9P's}SU-Ԕf4&-^g_py/\ё*+S=v#K?l7MQ<TcЇQ:'KC ,[4)"n]eAEǯUn3EW|1'xr0| Ǽ#}=J:ՊC~ı }X@># |F][UTWZZI yP;[o-'q'?1`!ޔu1#S/SJݻs+% m(1ciB3BBHx4u7w^s :lCE:x0!ͤa[;!_3Hh g:ϿNg)#rpӴ!W k |*CThAs7)YMU.ӃwKaN~-y9; ѭKaFKQâz< u]dӸ—{#}~s|4RVnmECxf8Zit49 r!mobnT9m/P~|y1豤S$ J6sďeX&2{L3;&,Gtɨ-sxX(=a{0t9G̋kb&\`TnJk_dcorS'N{ gr9l=WCFh+֟XZSq-i9lyigAt83yyn9ۤ-Rc73?N,<V &fcݝ=\nm"f0jԬh"X=9z?*v{څl cKz Чyzٵ7 pJKp:%;V;FWg}!&RU}>Cߧ VSKF>]SK1) Gt|F>E0AެÒ}-ƣz:H zo{I?4|iKo.q S$\Xl6k y@<(r`xz~Ыkc4z$rLzfG^z}Ov˿$*o\uiUV>W/q&>R ۣpIZYGF#sXiĖ@vـ p{|/CDRlAȇf'O$}1z'pdJijfm8?rz/a|5g쀀|ZXc *b?Q1 E` {LִE_U|~0SRǢ$h;}TpMcQs\{InݘtTu72^w9͐GM<ŀ`<-ar!{I0ӛ>\;NyFs>?àa$ڃwJ n Df}3iPDhf\24]mxu!>=[dcռB"]L08"6Zg|h.^ohaZbM|9S  D KgsTX+I ݽ{ڏ3K8VN:${b?vx9goj=$YRԪ<TIfʔccC(v7p. cOj"7'eڏX_NmSph7%W,;jE rC2H^0/W'sk0ݘBx*NL=*7?lS"74Ev;EGd&%8lȅ4 FRw:+)mCb@.a0re=?YB/,ž-YޝbM/^\M-\~'\M/n0֤XA1*|e0GzlyYy(jQpC7G9 'fr9vctv{{C3P 0x c"r 2mXs=)OR F&Ѧ͊8٘3%fHa`7A""İʹ0 Ňaa9TVq"e'_m %2ţGv><4k摄la Lcy 3C$ȥ_zzujx 004tIruPgۙL'C0xUr82'90hdQoD'FroQ\*0Jent&#e@<~~;L3^XBܒ@ZmZ`~=d|xuL  6gOԜ.,Bx$xrZb3S7Tf=+kÞ:@f]Xb'.J@:B4^Nॎ41WڐqTp=62C0rSܳ(хRq'5 &yOhi6eZC(8KoItEE gMRtc$THe%BOxCg_YYUG W~L:V:,w( %H>j:P-0mԀIɫlz/߅KFk۞l{3\4|#%2`YЊ8-*X9FC1΢L2i1yZ+3_ }I%;Q<,6N6AM,C 8"{ tn`wku3Kכ;ʆo/^j'Kk K< urd c~඗ 1`N  t_:AHk[_MnۤtkEIxSƒ+Z5cz^^f-"x lHb0wfx;p@o^pWK4H:)`BzVܒ&nZ[|fpEEJBT}M&4Aտ5-v*ФiL#$8WBHHR5hnqI T^5d<ax_^Jh[+ hjx@> Z=i,l̢I!/ژnxA㶄}uVwz  /T][4#5"aLTM-1E EgG@dEw9T8dQ^GP/)޻Ty5x4 {]&cڬeڋ >b_YY]H va( QE MujQ+Kp'p}T*OZ U'Xzɓ LJRM]?I G*-Yp(M)15S8$/E:xJ6D|Ŕ% KPA mq, jFMؗX3V=3uyD`Q9D!Yd=AI4 w{\D$/.21j9e),U_<(  0TעIDI):2U%KdT÷!0r弬OŹ$*m1>]5l%rZנ`j߽mrߑtyO-GY`%]r89L5VW DAX5g/((xʸ6,NwP\#O7Hs8{@e AZ"b"E?fzIתa $ BBez-CEEgS @@dtaLaIb8oHO#ՠ 7c`fVЮNK"LL,r_" 7F~`KAX;!Մ=Yzq+ZoD+c^Te‚Vjs#YJ ОFYI[^gnOWZUfq  zѓ~3t/\$%N+k&g\)[),[EhAlT@ɐ[%hA4Ofj4c|[s)+3#`ݏ oX焾դ3+}m#YrH[U{]މO >i$U>~)>,7:37]I`VG)s!JUa<ȇBr,?q(VS?}p7JG,eI`?̡!cC<ڠu ϱQ8u NRQ{|_ƴ |K02.r c:ss d  o8M6\ی55S0 /.sMEȐWur۸SJ$1a4Z̅R;J >|`R4<ֆwiRx=k3.!58CCJHPx嫱>KS|/ߊ 6±TS;\}DzVDD D)Ҹop%DֽEl23 3C W= tX[x2o OWͼ6'⥗fnvGIvo S6~}r7! oB?Jj-8΋˫S*/7S*};qnDHepWmofa=_'onz=xÑ/ygHҡ ̵"ۿ7XJZw S[ AkiޏŧZٽ uag|VC}d3&F*!n-}^wF{*@ KuyFt%tУ<5m}!tuX oQq&$jv{00u` b's{g?8EE|XX5y0QI9D VٙϘi?Ćǥf6p˰P;٢9>H,;_4cێH+*]KD\_QHhbDNV>.T Tѯ[ļJk~=:6i~ Sy0hW4'c3zVю!HXm20 XC2m8{?ЮL9]rL|*s%U(=Ք<<>V+ؐ+HUkΡ3еO Cͨrc`|qk g@%`'N!#%&pP)H%jrڑmBq61+א.\{i x~ #Jޤ](b,yd5gp 'k=zjyLy_q8ʄ674WZtvbX$y"*~ipܜ| Lԙ7i Zr4C#t6Y޽ZoǿO\R 쎤ٻ *I}nX5S~DfɾK7Z Hyݲf0^-ފ$l)jGieRlTxa^>M`L$?|pXzfoԎ`1#fzhxFѡvI3taeNc0a֍j5\'ʟ{} kT%m+)4ܲʈ\+<%(Q,ߢ?Ahy-b(jQUQ\׿ H܈]V {S3})_iH&!Μ8Zxx&(;]a '6(R .:H9RRKzQ롫H<?C;#L?"]x@ RJlϩ~  AH{,չl]7{حtR]Ü*\ ,o3$׋|UsnCUh vL<){A>};5$t6 wa Q;t^Vw2K-szp&(4^l2 J0Ct5*FDets1"ۆɹ3z}qxί|m!d'SYI}4K_I:0Kuܾ"AHK^Xb-Xs}6A%Υ5 h^9>UF"Vu% ׋2@u#1T/BLIVVlgU=˝lW0zF]HlP_?ϨKƘ~)T|~CRShE 7z:N-Jp#xHǎ@"S<нQ^a@`T=') )vjS~Ce@Kvf\=oySͺ7{7Ό3L /P>̹>z(} iD|ۡ]dU )1꫱g5bkPSɘլ_&%43 VWQmR"Ƚ\ N#o(zW6?1~FPq_8'}!lMk*Q\,%_Q`"(]B*gaNR,(JZ=ƧU(ҍDxYH[#?WA0i֏J^7vDrZm5.} M]hXbj!Ww 0]3Ϯ(x49ڦ"DW'tףB02y vXΠd J#-HA7n=cDS a&;.Ss1ܳIal )*s2ހ/kxצ؎Dq!mLH?ߣA쑧]`\z)GL.֣*KQ1U^^^ Q,#Se 5-<2/ lr'pJo"zfCҲ%?I0F!+~( ݢ5@SZ&SE4uwyO!XftI^s%h/W=E͊҃i.J`81k-M 1MPQ|*kƠ μs/\BQP㱮\PCJAh{"MNఔ'N/]+L$X+t:Gh%p^\>}+CKD~fFoЕ[Kn+N]@&*Ί.Ol~}#,t*2WHP`mqſ*H6Xm y0'c%O(BK RxD5TLEQ.N47#;DM$ S$D WO[ R sj ~g 5Ҁp$v7pag:c&$ܱn$'IDvzr,sR  m dj,U7:wMJ ,B?kʈ\DhaPy(߫^'Spb#2ΎCGaHPAKfXU2 zϢ;4,踧=<-h ~]ђwsXn~ZM r0!SL:g؞LKOtxzh*pΈ~CFK PgXRگ n A&n4~YjLG)E`ղ?&V?Ȩhȭ*ܟCI7,MIz"sq J)? m\`?UbJ 7P6"y c6G'|Vo!4\6^SǙ2 9^g:gLH,B@RO"%A?9W42kPp[øڝ:݅N{&(D|x.L .轪ȵN k)G4(8hߧ`Aun}IbE!&RS5ŮѐF_LEwyu {knUy> S:x0K#^`Ts*v܉AHjW{d]N.`o6Z/DZt]ŕhMeu߾1ŲG O4"8jdm鉠q,%plbsQNY}O10ZVʙT-3I~’{J:2=G\G{0]pRHbakt%֝U_ŧ.y&UNIhb5fSЂjaYXo]w> *IW=z":vIP *ӔFnas7gf@T%=P§U|%@_l:3Zƹ$}VE~luuKBZ&4u #"c$v_Urfi_|jQ* PoIE}2\Nu5>Ұۚ {c #./nӐS`Rs=Ie%Զh$]?+>~I;ڡ D3 آfdOᚶ!jp%.햇q@GU.9|EpLB Z.(NgG4ÂZ#꛰=eL0E``ph` bWqQD^ެCBʴfLUVvx^<6oZE=*)Nvo[ȧ9cR̮d@>a 22)~?aȡo02mtҁZIgqa<9M<-3 e fۗdMƅw\L ;#<R|j*4;v>]$o @f_f1Ah{gttP+>?M l#p(eŇj9 u0-t+prդI<,`cKYO#>*F;L`V5Rb1?%/ԩD@ eA;][{IWtf$/ōh1{%a+wDmrct;xs:q%eqÒ!y[ȥ1"Ϙ?5dL~Fp#o>‘ TQ{TUfI)~Bx4ǙFR)J<лaš8`*U[Pd]7Jn7ݶK}4oŒpŊ8ooLفSsR>{}μQ")tFiYqM^nKӱn砕5D:m#}S$ W6Ӄ(}(zh$;݋s~qW3~PK݀6:V}闰C(gY1t+g!+SԿ7#D,2,wc'{&'N:W "UR>,F%񯻻M*0A{=-+op!?^ 5g`v6y+ַwd6u>U!p'Cj`sfuSS1c-G>j904pMts#l6^}1zmQ )TOtB8&Uˀ}imRכzb)$<{3zGo`&"#'=:'EYE p7T-ϪwQrTsn`YRֻYO:"e f*M/XKj SAF?}(*$,6f^0]_ A4YPh!S*2:UǺ%8*?~x׉tJD%cW!jq=VG $fЌ>X˞VgwPelSUXNJ2a6lg5@4(I:jK,?ȩRu)^Oo z%Law(e Hii(=t^DQ\zӘ su?ALE^(':= }[fjǟ2=i @ܶ]9dgs)S}T5"l=nC~U,]0E-yד#:ܙ=r(PF&W,Im(-C*x:Aqi2ئ9ǯ%n%wWG8ib%`OL/;.B^$wJ8 Uf( dIyIg~*r·12*Ko" ,H`ӿ@0Uν m E? -X ypѴq8wPC! UHЇ ԕXK xI:[$帥CrA/Jk_1Dl}u=yk 9>ɤt\]UIsw Rff@]{q6n:k+1qi9NN0U_1JjuhMfֿO,|S7~f;E*%݊28HR2˦ %p`, JEYif|:QYRMS &hӺTm20 fS:rZ9uU=ߡ}2P ])ܼ F$ Zfٮ:kG2/خ.*2r,@"<${NFzm)Ot~rZ&sOӯz| .k`,O][4W#֣T 7zD"0SʦʙZ1{4GFƌtSz>p"{ɀƍYe}f* )dk^f ի>ۄNca̿ʃ [:yV8HlVײl 20,M_[vş-X>>Oz?8@>&p/t1pŮ݁@C-,_]>L@Yoez(TyPNL$Ĕ$n xO5 ]|u!:W$eGfi6'1cls]pjԇyW5pHev/! ,J<-;SJzQ=88otJ:ZE aQj!ˁ|,*cNy f,и'%;0Ъ`[ L^x#pm@0:M#sEb]g$ӿ*<< /R;gMi9Օ!;̽)69>O}C@[J XY=kY ˊ0Jj]ch&vHB:dռYٟ 0ANnVצq_0wJW!`We* Sּ59VyعC#B+81 6?}IN R}'8 #| w |d{IGz" =<]&NN@ 4"e:z&|G^Z碭LI}^beԋ?JXS ;`I0?x5sH:@jAѥ>'| 2.^=WPeՈhdн#oG ‹'`-sW<=l _ȞZ3{nC0G͇Iz^*Gп KX]e>Yv" YS5o1?^`Q(M &61ָX)ܱm5r.vګrî_=O 7h jfŏj*mgZ}/ :SpNH;& ٥"H!ȔfɏmruԪ=:;[M ѠFP.'Sy 3?&zrXluڠ {~OҢ'I'+Cx?.'۬t囀> &܃8Q~'OE`qzkeoMk:D:ՈRkꀑ`xźo0 .q]lUN{-_N^)M $*:ڒCW׷4"!mrq^o= 7_a='k_& ߡ%l&w͎kfк@2?n+œޱSDĎxO'SuγLh?_ VZ,rQQPۿ`gSZ;(صsK ln?-Ԯjy*ըZ7دqtx*1TL7 =-W@$Қ mk >E1AzxNmjҕmARnu+q>9_TϊЛU7 nǬ ˟Iq5faT~tArΫEU k:8]er"m$N.!YAmO%&ݒe5U~@VOQ:OꙠ+Q1S[{Gp3oiv)h;B ~!5"s~Zz[2|K;`" VDUthv)-߫h(c8tL^wܝ`jd͑g?n-2nq"b ur==@WKŠ)h:F <os鎳9/_}0 Z-.u<)/f!׌Q $֪CL_.0̌L 4qŢRck ~ +-{8qOϠC5#Ԩ.I RڦKp Sq+@d;0՝9CJ^@drh>'9Xb1%$Z NSj* R* .'|ƎmA!2+kWb 3:[/VXZ~ql0 IhQIٳלo 8>)=^$y1`šdXnt;1JتoWsph_[3 zuj՜I@Ȑ7g=ʷfnLAFfn|F'#=Fbv LӟvT/Ry_8ހp Zٹa6Cdk0B A]"މީw^pXv`J8N(̵Z;d`T{Ziw A*r:P8^:*tD><+'V(!ԡ.@S7r!xUQ#GFn80Ymo6A|*Vm u#K?1-MV1x, C(zaH+&\LJ9K=Qt;gN0j"WQ N{޳?8\UakkRx+; ˗Dbw} 쐸8_v4 7r~_6NNdK .nJI\݉zf.RE\5~{%X]ʠD|PzS0%1g&QT%]~L,dYF&fjt~ID6 j:jq~< SuXU1VK ƋD7Ʊ1!Fv7EqBM=c)nߺTR߶) P]jS"jB?i ކ?c%F*jӌ q5*R%&.:B&-G~柼S¾T>ݫgI_Ҵl]^5P ]J%?ZҰ)+Ҟ1b$QcoM)]Qo+uXw܋?2G)k%}A& 䎴\8;.4Uqpoz\"=R>H۴ɸPᶣmuxZ$'.󠠚1bɑ_~#ǯS^Ez_^Sm }Jt>CoM#hQ#"QCNb*!bܼ#\c'qc@ f+טhB~LykʠcIi/]CX+Fkp]"X1@MNCPg=oBaqy{t& Yr$jrlҳlD=Ap&1A߹lƎ+f([*{l=Z&ev<8,$&t y/H^1p#ػCX<A@@L}- ++ITkcj]y^ Va4DH(Ľ,\UDBGv:f|to9~sF9M%UM"jnE953r*6M*_OMReq~:PhYIaŭ]W%||"ko>y FU|7$wf*,Wl?;_*GDR@Y!\uYHDC.ɌyùDDRj@RɓN=#f.5w ڼ&'ҥ }6tq%g}qUKWC) evcYIJa~9`/[@( m"}!܅;_ib]Oh@o™2;]U9O~Qȏ1 zV;ɵsO[b U^9ꏌHm]=գXr׹[?=v8Xeʿ}CP\w.M+ f)ԜOi`&q RgIyP04Q.pn_n4i~w q`2PB_`Kγ~y.Y#cPToO} )D8 dŽfGHΈMMg 'wŽتj>c&!sU4fά7v !rw7)@#С3$a(,iN){^ ծx/0d %6fBAj빚ynce4agğ7> !S*Q5ŋYjPNjU|JT& OWתiq*wxj'Vg$+,lMcljs%~ԑrێhZE*Q{G7\tkI#53vYHUe ~#ȕU] > p,'pB:,{B5@T}NPEGsp}vOPa('#K g&]{eS i6ԋeA<(U <[syasK Uy #gc|VpbaH=b2Du}L]`$7/ͭ=P~DaLlmu1@ex+o=9Z LQe(cF2ЅI$ysEm>I=8h_\ 8yp hr;kjRr{E ='ީ1"蜤 K~Xx& NY ՛u5mYAwe /E%s_Dy虑R =[oa!Te#xh}FsRbƠm|p igz[üܲ8uZPu##4P2u%n7oNFi*gfvEm 7Y'^ $)1Jjnїg $i7IJm;.%GG1撷Y84ft&n^rM^ry:/R]+OjmX:d7"p&|qY'cϡd7$)xDP y`U"fteRK2',@=z9bT :ڑ-W3|Nu戒ꃎ>iU9\uWWK&]uQۄ=ئL9pA/ Ycp-9LY {=$ ?;1ʘlsf1+ :+9|*{-F1ݤB]E/8]Dc܃FB3@rceaύw27ߧ>8p/ȓJ8I}^~^T=)^dLLpbSAEy NzzzTs=+>Nx2\5uHqo]c I~b~|̇1.]3~rCs <#-xx;mIvԆ$2d[~(4pAH]1H;o> xw)N!C+Cxs]]GH6_A1G1naT۶'֧38爺~*) OuQFCYzBboS}zJ/@PG. !>ӂ7EEVsB'iYnj5%j) oIH}T\v."sE'c}`]`/Նy6Ds(\3oX(-'CPݹjO-`kib nS(ف۔fŠcV[X}454_)Jy#@>E}~=SˏhE|r!6ǽ7ΘʒsPW;Yz՚N#;!v4\v8:{ wc1z,*OkP2w&<[I|@F }h Ê I@Z$kX?d#]f|y1aȊWD"mhmaᏺ#|$탾@ĥ|Г0E)ODeO$Wp&4 EVk9A'Q61Y/ѭK鍠*DjpoXSnd-r$0tܭ151ז`~JLJL d:_tZ38Y`[Ms8`IɃk"ݙ` i"@g[v&&Sv|$+:Ou/痀9߀Rx4pdLll04N;LL0jnyVھ*h,WBo G"⥞rez % 1]3Pj 9Lٗ {y.eD嗢ah76zWis>ADĨ5=,v&h&^z[O&G)d_/-2mS*1"t/'A,Uf W.A߈uBSx;Fl_a`7+e $_3>I}hp%6|#xPMx&4W&e k8XO.k>Op;Ή <Ԍ 'yϓ8t~Ps-%Kg9RdҐdi14ř=whwPVq/AT Z&b-FGj.zHv|̚frcSO<L.ucPVn;dSV<|-AmkƱRskȎZP`p 7I.tu""<]Mr@qC d-Rܵ8ngʼeDR-X|4LRR5XOT$9/s2/`xO|ʘXFʉ8 wZU@t IEz"MPuEƒgXBbgLϦXJI{bϧ^TF|gΠ_5)K"V|Ǧ\6c&nBe]ws1DV6s!{}EƟJWyYXf.XXj\8{v{,d-M$]v!LCYo#뮅";y9|dI#u1gEcvBꃪ$O6U>(`֜ GtL2Kľ ԠMy_-DܟPDoJNåwOeK 7}Ͱx$. =W\%tc Qr.4_aS h}?X `:59l0}j 20MfqDoPp%LWqϣ 2-ÂeΒ+!%"nw0r1EtyL^ДN/Ĕ$  gx,lm]/Mr2Hl/DZ 8mh4]x!iJzi%!`Ap nmZЪrZ׀x0~tM!0#7f.鏎ɜ>PǢ/$B9fX:=>PH}cv^VӴ+h Jx$tѥ[^n?%KFI <`zsZg ,տ*ECЧ7Wp-濶Ex#+?+H\ &^#rxNvȆ8Zbv@@^ Rw⽞~Zڊ[(bJvKdẂNrl)V傩W sU]574w] /^`ӏHaq4N~9S%7&܃6ڇtޱVDobE?V J 7$>4M5_vPGB< Ө)~ix.cZ.FvjH 7z{J;#rYZ}C@7n$g^D& Y+W uœ)^>?~{J)짧Ax}9a丢]Ix\KqQGP 5ӄS[P/Kz=g zondWIYG  IAVǒs4tKPmɐ<7|-4?Ꮲ.v'?|T H jiqq[ 7篓 Ƙ"ގpnY!#Ǔ9#˶EG,WkiR&V}qY(T#4iފ]vN O>ʹcZ.GvxƳ5ұy8M=/>e('H>x~kjU~"xDv/e(6ȉ/_N ;H1wZ0_<1;M}x J*C`Iks1& FDոyj(}- n#}eQ]uߔA . F__oj/^X"q8fz׈Գm0/u.^&w#)Pj]q0aSCmyֹ*I*bv}2nJ A4@ G)ss^*cUuY襱e"-ix+ {N$>j-AG)7*H3n^W>k2Lc%ѾS#Q<fuwm%2U6_C\ܠ!,"HN#m?H+"nQ@ ̽Uεxv*|[*SRazaY P5&YoΦd9/R=+_:&} ԌK>谵g[Gw]VX30Ŗr˔h:؛IJ|ΝYbw:KݺZ_H8s#WpXKzl=8wZE`ͩhK=nVэbjyź;?Ii9.HlfpPh-H  +p!uAa35!k%OT U;˜VCu(B9L|އw3|^ e0 Yt&m/4kgWPPa[8LGUxeC(H!j;atl!3;-;˝EjJ!"`b🀜r?l?PօĈ^ eg^7N π;=1򆵳9ibBKZp}*g"%w"|W1Zv0PkRd|~lg4Hi]%=`m l ͚?6*9;@yiW#ݞYq*eXr0oR2}[!,|yK,&}0yn^9*]V=ѫWLFtQx|&A]Ӏ`eI'Gn3Tיg{SVE_i!ְˀ!ZtjٟKK{|fK9̆(Ygϗmm|uZi%PVrf4UjDIs}%rt,~R|6``;nH9PixP4B Uu3'"uh CQԝ.YIj3Wn a`Q-.7FO,p:a]bjXdS׌R |"d /xÈmThhoi><Ѕ  $G[6h8 Kg6@O7nvQ`43wr3T\챡ЗQ/X <>YaAѺ,QOdS' 4UVi[Հc{џ,n27a^nᘟ(4G,t4 iRc,H^,5PuEjAJx!Qa0wJSi[nC}l Lo~"Ve R`'1l$#&yДDozJM<>K|;. >Owi3={OHXj'&we_Tntew C}6Ֆ++^H&W?: EX bOJJYf3:C2I# #F"HhqB 7~LPGL$;5AڐXyQSk*n<\mM;(~9H|z TdWrJsvUUA9baVff{R pOB;w0/^CC[rVnkIn/$_E? 0ZgIw, ]U!jlB' ԇh-vCrC@ۚ H`3$u?H0 5~3I6ZDH]b68H 3N3 6\.i]ѦX怐ȳ~x Hn[@7ߔ^@vj'BP*P3S-SPRM/@>~iJdb1'V'X΅F"rT)w( v@fcjpYzZQ:O> 6/"~p2/b:*d;QN~{ =Qs6U`!ȤkzVt6bTbx㪴 5~ү2. m$q{\Pn]B14T)C4a299,T~UP%N4rjd;zN3J$~BOB@`[2!()MN-}@hH.gAnd!"hMUD)m8=)6Aݞq\t}],V]KB2Xl$/l +(9#/QGc6Vl9-y17nΛ=YiF-e)x>q@nh.XD|bPx)WpX@. <3_ؐ/$drϟKoU-wE.Y&U" W@x6)p%#ُ :H@ "|lwG 2aMIon65=އ;@zw PTPem@mwmn'0OLb~v1QˈxЌ͵oC;~ Qq?XtZ[ѡ };YERd,\Y =:􅳞CMa:[4h? d'^sR<Ͻ,HufpԖ88xɏﺻOa,L|CJs"\QI_);q3vޫ3i\"}~Un R Rx /}զ: ڏvO{w#[@+[MI8qjmPd@ο8% i$;q?&S'?0ūdmMneASFr͟Myۅ^DPZ筋O`*^ 0Js hSetf&YXxx kMd$ 77W w~w ,$ ճ M&ķ7ZAK>E DZW?ſTˏ~I̕V.gҬfׁ֢Z*BW;p߄M}EҲ8ZۊEHzؘ. ;?0"J:w*kr՝cQoXw|aкvۼ#;z1?ĥ-PF ̔ިD5:a wOz>%0٘XY/g/s&a} ]g lm~rҒBMZ3](u$~'kg<dh8ϕS@9!f8Ipa!7\Z&"0@l@+UKq4v3m.ۺn˰)[CpLM}' }Ba~ +E7nP,aVgFKQYYZFt87gIAaݵh|R=zm %Fth.z,j3޶uOFj&IA(WZfɒKQ^mW |d:3ѲCՋs˹MьhaBYq Gt*hzuʗf2HfskDu\dzH|i5إKEBD@[&fJֵ퓁P#1{c~Nj_p@bX!@m'*ٰ-)N!z9ZFMg>D1NtY+R='a䈘jO=d 6@j]"AcAPQ_cQ*9e>YeN'H#getI')*&Cth0m@%2Gr_VP,*:<>q0~JIqL.xf.d?@㍡N8=(^Bp'm9gpy2d{%6`g8UUrݧ_Id}J3 78Tc5VJLK*S_{^j ~ǐ )\2兜QG|u84%&RCQ ܾU'V֣eߦmuX   ŕg߳BpG qs E k {5HgVyȞ`|`4Cv=ծrQlpe:o\ѮXvwK[p`ٮ8RLfk Q ~bP7T{V2כ nԖsAp;d-=z=~r@nւ(kv}ᒌ<Ԙ]C\Xl92~:.zUC Ĥ2+]R(A(RO;. M^8dPKN<Kui& BB1 IBC͗ȄѦ7SʇT|`>LA>ܢ1H\@-ꀤ#E>_IKNd-NbdcJj?$eoIc.*)J_ȒԻ1d~$#ORXPc;VX[ {vq~=HJ&'Ob(c.ۆd.$l%7 .}bx] 5Fve;$Ƥ i`HxVbw@7_DGt.7QKȝB/ >faOß{SV@ a몴t:ePcNEIY"Y=[cFLgx̰Too)о*=5_f! 7pgO .} еU97O( |w{R*fxƞhHD| ޓzLMa.d6ecАX"5aǏ]PM~zlYT8 ?,eOۤR7&+2SJiC< | 9ZajSw[}>3L:ze[T=%eC-' ȃoIb =a a+6]IjO/" \ZvmT.r[ /FZB'_LP8EC̴Fki#q_3xchvL>6DuLJN5h7 .B/ uoyAצ|:w{3EɂdҡyCrwpMce8w մ>0+Z+8}x>姾mWPD`ɚw:6ɎS'ݰ[yz8Jc.[|thZTK"9I*ZW:2m*TAuY09X/}hr2'Z^_zrKQw})N я`s_T!PUŽ:ExJl.EP"i6N9%Pknq<4{uƎG˨Lm ,JKb ` yQf)u2Q_R"ቴ)r x8ujܺFr6u|ZLvlD*2U)φèv <{x0c,&'`-h=+ooCF>4P~VG?<\3ED/8H,:׋:2Z  MY՗Jp->EcF܀z/; q$a$aqyH ֿ$+`,Zg:Va*nDE``UE- &*%l >?N*:Y{^Ʉ@nY*bzLRxNR1Vϧc@Wt =>$I$$[Ҵ<@zgxYĽJسKj e.ޏYug:rk"t<_t,|"X/[M!!!MQDĻDnh.~Ş@r{,$&oW x8?K9)B~%q}5oO?43%gw`mg O_z`WA朘f%!ǿ=5[jP-GHVj}Q-vYpd^ne:73 bBeQAV {V8ZG5\CVmbm$t#eg"4,vu {5%opX"@ _HGƼANK~gP{y%Ȁ}%7gUz{D05DB拮".Zr`#; N̡fv8F:;(a\/}v%hf4p$e5 K]QUN.ѝ\Äab DZ䊛He)4$]9l٪4Z[E4Zʈ":l.!PpKXf]=J\_'@R FA(Avif_&sT}?5d<cJcF%l /U`9-i6u+D_!ܞCl «Ӂ\Os-ލkM}wm]S>?wgfm3l<3mt1D ׊ lbP1<[.8ͻ ex2l2e;*#]U>&5{MA?2v:䆌CY/C_dZT,\&7nw4Vn\0l- h_ٰ8/*%"ơ6P6Yr#VM; ^ɀmQpEV>|s#tJQ灀K ؖGnn?R 9FQAmZ hc\}fCKjs?p/c @K&'% 8؎N#u:L kɄsk=.!QGpRE*Hı$~2\|˯Z)p\аLWXA:0Z׷=5Ϊ8uP9{T({@r5Lmx(3]57!v/=,8J·Иiiҟ\MH^'oH(Xw?flȗsJsj @O[|V[]߆|Ů|p-cxM" ֳۘ7[%}ET$-1igLt-ֺQ(ta\ՕPZ"6ԜS4fzE{&J Y.}gj:Omdէ+*AbU/ϖ ~5˜.p~rdo7wz/2t s.>'>oP(pet<ʅ~L+F ݂;!qxVv@RfrahF{h+:_JrvxKO#A8` WFQ&QJt@W}Y}| ΍ScS-G*ڠbK/:;\ MӳA  u޽1&Y-}p+SIHq$A%eƕ=IВ8_CWڮnWE&,-,XDq^[CoAwIj `z+#B9~`;K-\C =^ Rr!{idEV%km `(G +F$ ࠫ9Ȏ]]8EЛaWX҇A9PּG`~/zLF' BY(%O#h ,cñ0<5MF ' f0^q0|o=IPƯ-= o vAzqۂXuzT[n!vM[t؀a;eZ Nvg+$NyZ3V.ק4:] $T'c tGr(sn+#1 }+BLm? 쁴&Siʼ{FpHIx}O|F@.-Һ .M[Fg{;dM(ٴi ^!GO4H@Ca?PiON,j 8 R!;0'|]{޸GiYox$` ZxɅU0ބKM~ FEYy{P:cq[f^]v(zTP׃6䜬׬j%A1<< R]W^w5&@5L9-@} +;:KO`,L`P4#]BEAVa?٣&J 2pF8池R^$,ѧ*OWEY@Bi j)r:L?Q׏zl1þ?|1%}$L!F >P#2ItL3ICFv*% ™y kWm4|ʹ?v<:8VݙrT?! ۛiF.@*7r8ǻ4)W]\-|&D#U3xS= (%L,nU|LCEǓ܇2ؓ .,ڻao<Il}q|c',%/] e=jU'- `5R6,=Fn:VxZ%^)tX3 SSŸ6V.Tm%<^XBuxLkwGp -!q p?XʽQTybҶ{MOS-ũ-x^.̺7-}o΀^á p `z5Lf#`v5, r|Q3"bѧY#)˼[)pqDe֊XU~}=!RI&x#<:ЊJ`f@/=zTn:yvh%ГGJcEPHG@FעyGG%wLZk#4Y6 5}$Z jnzu,_@MHnn&x0'44:0}K~Rr5F].eFsY{D tUӦ^}wH hbus̑*-?<*Cr_eO?!ŰڳDr D[󯍘D v4ra!W ؼI!agzF' E)?V((ytvSdj =' UMm ffg0kFdQbItI j*̙8{$S@rb/ a]^u, yT0aYW5fĂrp1Y"2' u708 ϋ!}uǮB [ǃm0>+Ԕdt#8K/:e9@c CAO_ s[JWS$[%hY~W<"`0;ô!db9ƖsPĩʑ/hqSÑh-fQd(` 3.N[ Ee!NK'y-H/N5&62bU &~\@etEF9C890""!p`a$C׼KvBpi"$jb`jH.Zq5wb77lpmz E2 Ii~M:J QH÷mK8NE7\=Ieεٞt`C 2!hx coIoHMԲe,%TM e疿[/~MA)};^d|F}V Zvt&Id>&Tj~!te[j |pv{; NEc3HC8zlPEAӖ L< ZہFz!`N#9sYk1?/)e ^B&+:'xj)Ѵ HnY,qK'DvQU& Qn"zB<̲4 JIIx4kXycݳv緸bo;Lزώ_ٻ Hn'FI щJ ^vmʉRM=#e!L2ѷg(7yX! BX!1Bk/ 97.,w[3`\t#$z $-N7b/eWTsxA]epMugިQ?qC=Vg?!M29Lk`ܲg?#J'-MQ$C E7gɖ`4ؘj{Icu>]F"?0LQs8M(xWwOro0n/$@UcA2Ð&a{XBI1V(-CDZe40*"Foפ]c DPKQX̉_.ѿjNVUS;']@fLJZ"*n~--&$;z .,r[ecJc)2} AnϬ\XzJ F6IFGo.3gy^T9v%F K)K!K,d`.q W_gd6RZ9C~&rf D Y-:pBA Qe='5RS0mvH@z+W&ocSn f2CmXm57P2-犽b:o,h0}7HrIO!eK& N%#=)t P -,A ^os0ϣ7/M۴*L=Q1dBҋ;@pC?BZ֠uy2;&g=+vᄰ3>%U $q-.sM|ܑs +yi,+М~3ӵsW<D;@Bat _YI7IsL7,w_1@G[5zqSZ/l D<@Q 3 A0s4|o<CfT_v jM7/SyF%<}dD#(Kmɾkb`RWG+L<7R6wŲJ}xhFtVs@6X=n߆4lu!Cqiaau/u1'rS4YttlD?9GlvIXWt *E-G@uẹ$H"CI1Ky?5^$2)]$#ve|6d@%*cw˂G-bӧ"I[ʉ")Fz"[J]19mYAa*,_NX(fd[^FA2Z-U6hc _h#Zm_/p@۠DZݘcrGq73;y(Ee!g!?W kaJ:%r90 BiܪkMpY if^X91W61d1POI7D'ј-PT#=]]o$XΔS˥!(SEb|Hk٢#&6rxNS44^zO{NrW8I{ħiOE G!yNqiKRpfEW{wo }hTv|s8묟:R?Ϣ(;,<{6ų7+vf3PɑfX<{wvbY+aN'2ɚ oY-hw[obǂ ]WCmiol_59lXpm MϨkWumӳ(䌘BS^mҦ}0>AyPO`0;iqp R+ې1m A]G*VȟŇ|v9+gif<<ߝ=M/CDWhWnC!:wTfͶy],5i ( AlLI}e{5XA1*IV)u!@{{- U>rpPE=$Yt)@,С.Ⓩ_eLy5+ -;Q]:+IW7s-ë/zQh]E=-ѓ;=t_eٙv0ZÖp#TCkڌ䍨(J!Jo4=Lc{L4OPu ּ է85(@)G|iH[*ܕ ?JUt?4/1zh)N/"3`SFy*$a EO4ZC< jr@xjbCV3X H@0=\3;lĀ3VdAD5ޖILR!xeZiӃU&}Iyu#ѕkPReDJ\4+)mEj'w+ ߡ9^08m)pti׾!2>ϻhLZj7Dx(u81h`I"W^84f3X(rhhv*󓴷߯Qjbigkit-2.1/examples/ccitt4.jbg0000664000307500030750000016257412315071063015152 0ustar mgk25mgk25 H_P陼ZvflJڤ1Z{l[xt|*qϕ#4>9Vq_,V/M997 c,L^k ˛nYiƅT')ȳkd7 d%$Lk0R-I*F[f@HYFӺDa 6DRA(%E| [z.Z3ϾMuWKL3RG^ZWLCFN; ii|&2E[IA\KjNj{*hT^-ȗX9/y'oe*z)]tThB/ ' MJ(hN8>H?Hr!=OAP@@kUmRgβy>~Y^$[f̺$"wJ@<5Ԍ|͒U"1nTWq:HKjUSL{ɭZ,8"~7ٹ%iU]/ K> ( 򠬍>~Oը-⋫ pl_qG6谻њO?L1ֳvG+Sˣz'rawazs||7:4]TzK~RK'/[胺Q 辳ܗN"@]6@a@`C+Ȅ7 p'Nz{=LJ 6"YX.n1?UyGN:= .&$\<ؓ$ؾkѰ^'Ì(%Yew 1L7)"V^o8[T"bC]̺g6~J r3LfG%yrƦr9zI'aiվKZ[WI)0+2a6$7J5b!zC)e5%9"ĘaKm8: *t]WsRgFa Ѥ {Ȳ @/A`w>TsvkAx} bw#J-}̻PTV0\he^Vsx1Lw:P|FGlL& l*G,|kU:t`ٔLX9>$X] rZ?nt˭b q:(՝5)9b,gZ[N}y~]ԣLPy)8oO\ @e:/5Pf)2/ c|HZ0R'LhV T Uk`<L02'Ro0r@3Gc&z͜ˀb_?HZʨH7ʒDfLR%x%ebk~m<͸@hЇGf滺Vs@8;~Z!n8^{ 6{{{(/dz FVz ~:_TJӥ =sğ߷DGolj$(ZPe)>o>30,&A H9W^V$$2 %VPTM-‹ӯiKl2{&X07hUIeY X3:; / 5XQ(!ZW bI kTt>7۪Ȉ14m_AN%&yj ]C/ PTpp(@TJNjAmJRa]3,,,IOeȥ7u?[GH !LI5r\IdcncM=QҜz/ [0OeP;B爝q/;h'\ sa8;4HZSGN\č K'iܧ$3o>qh i]w]Ad1CvS"h) k*Xf%b=Z,( P/ǓѯO̅x0P#rcZ̰k^G 32ȿ;n2dPuJPF9N՟#݋[ -ŅlY njs\o#;*" @|0T~f r!R=cj%- "6G4K%b_Y{܀h2-ҨM9+A,QV!C OݔJl&+ѣ[PCbX}h`Oõ߅޹M &Ⲙ|Qv]]Z. KҺ y!o8ΰz2_*vpH7N }) m7I@lZD %oc(IJ_eG<鬚a ]"42}][$TU a1X?0_ko Eַ.N odDӦ7e E"WkUd׉Њ`6.vX½"bi{]%RccrZ&mM6VR<4Uܧոنܥ4+ AyhpC%6zkz.0MP\`D>``D8.k,lSiF4|tQiI@"a>3DaXąDJU חDc"K\Ʃz#orN2|̨yrk>{@# q+g|񠊊d܈аf?x3,24h>$uw~>V$Tsze6kT8fu-YÞ,\|%,%p':S&WzhElx9+I V)z;䜢l(E¡ZNWotV00SI rPUeC;/֊o>?VdH(@H!y p8vӀ:8!}$ĉX~3.EJjRڢ6\`Hn4ґqhSB+GX׷Ф#33> |%S>p:?/ۺwIB1r}9@j?˸rAS|I5!e9Gx`Rm~g;*y W7^jl P3DƖ[C7'v1J9Yb{7q+Y%}d'1kmܦEhnBJ^Z'9ӓa%)ru/rk-mxD=3sdX'"M{(d{@VI`֒\KC2QmԠl:ߡ*v!` +j [' ضbCsi> x ul^UWXx§5LI1Y]fd<lU~)59-Rإ9B }C|{OΉ<)aF[zs`NS^kL}UǙ}:^\$9`(?s . w4?g5v-;Ag.-⵭7Wv W+`(W,SAq,,sSSRҕ~RD,BowŴ7Ӟ"wKJDyg:Q &ku5CT.tUSw@PPYdTBnd%J}wVKYA}8u$\+Z!E5u_jys^Fqj#WQ[ﾀ2{?]RjNB9⛀lt_ū7G?CBBfNhBX4(@3^ E.GƤcO)It.6URKmr( nL>VieAuAҪ[FЬB"CJ~jkw-&"+ dz.⏀oHNJν\,+Xu+u3̧Zd9ER9Y(76,Abә^ ]hOK`'ASX&vp-( D"DPIW"Gڤ NVoIZ{;#tk+-4 )ۃgga#|<9*4|9!5H@QMWg-s ;ҋ ^sMV^s9Jʼn^NS+wSq^`uYܪXS)DF]g{GBBHM$xIU~Ku-.ㅗMr HN#"ѽԙ4Fc\և9):A' ٢AZ:WNsߘ:̧URe`5/M&fkn{h2GU/xL61 9 qr"(a9qii.fK urVt& Qˍ~& kjh`~j8W&w\mDsG&rxۗqYuu cV#UqL(PʼU:KE})@K 6ɘXy€\: 1]?De;=O|Zĥ{!FoaθL~Oi;+zV՜Y$OZVV K RSDjKVW͍.UX+6Y@gN \AO=pyM=I0 `,_+X[> J *I1Jdߺ,hbr :ҷ$GaDQ*]5- :L~nZ󏡞='N]4~HDm6in'2WC>aJ{m/{+Y]\fȥ(=fR)[dž WTI,Cz l_+w>u§J О~ŏ檙_"ZQro7-RGUjw-i a%gBћR+N"_\jBe]jY2E=wi8k_,h2*|Ll)a`xy0GN i@4hP|`{0s A9phM6[a=ϩ3wb/ZSDҦ(mv۟1}X=b>H3QBxbt_ ҪJ;Y4Bj3}I3Ume6fyKl+GGw6@]3R~˞rO;'HQ⡋Ҍ}s.4?l$|Hf:?/qJCxpq + Kc"9M_zv3Rܑ̅$L ſ ,ѯ/C!j訨~Q̑9z `_1S*$eLdVPTKS˞pu @Z <,6_a~{z~:<-YeI/;s*89s28Gox^,#7, SF!EYV ^ `ngy*xط:rI;\+a#߽?ZȄ#]4L0]hM07IDkj|.FD3n3TJˇߚߞl Cw;Cd&gM8OVG LƥFN%à#KS6 -͏wg0CfHFpiWԚ;NhP- %FP أmIQZf$lBΡ}N|:F<8lbVZ4U4mסyN䮵_@,QKJ,Kv(M1oz%KLϩ yw;[8= =_)5zy,5$jr"П:U4c1t q 2f ݞQ{DcUYhV ;<% 'o4ҙdgXx t| mYDjn7jb),&E FL5&E.sN IjS O TpCUIzrףYDi +@)p"~8wZ˴*0V)ѶtT(nGno-TT.1m|A9y?oy3wAb)4n}B8+B,=K$~lX-\[Wk|I/.4D3= v1(ݼo%XNL͏dX}~ǹtdiS/lVY2J8rM6Y&0[ #i,^8ƈ"2?9OZpy7yfNH# Qq%=wn Em'["2J>8b ' WJe/l:Z@/EHa>a*;i+u?'MEӷuQil@$Cu\oeUGrGlʫV-<>?ϺVы-=dSP0b5P71q#ұ֞.nK-~\@VUUϋ\D?}Cg\7Ulݣc耛|~KDV}c -h(Qnߨɉ%+o2J]a7v/h <BV##KCCGcfQ+#4 :sYSŏ+ c|t/>,GCm"-lTX.¤fC=9F `>IzNzA %݇h Fxl{#Ot=i6,{/CLThHyg(Nt<[>ٍ хK}յ0 o]Hɭdw- _{= 0ܳ_Ɤǐ!GFh RT)Cc:$!IEw9A,JZY.0Z&ybk\4z˾}kfƮȟd 'h)u^%z{˅}3d'Miu[X~<ϲZo;@7Sڌx1dט *!.8]] s]=Ak+#/iƫ1V+-;dCV 7Z+o'9)]-g]6KK*¢Ŧ8oMR#6:("7' .Ɠ5é0-:[OD!5{rVZ܎ GrZ7+;e|džC. +3T¢a3I]z,F?jer̤~^- `:aF <$FX8x2&k#~k3h/lu_p[,4qJkAoTT#,y B5)"hBȲ^"ɰ Z=>[ h Wqq|ed$fǸ/)4:ڽ6y90 ^chh 1\"ƜDh)O̔ lAQJ9=s? D r-5l*Ȟb9M VXT,`)Kllͨ/5tv D q 1#e&SG3\@ODT>!>grQPrFg߁؇W˜>*y~wWSk =g-}L/KR:Of$4tBJa[Ckܫ_{ 字$64 Q3*b%37&Ȱ%R|bcaJ,uro>5|dń(%3ld'Dl{w`\Rǩ`Ve]-<7[/ϊ8%|#v_L9*D4==W1Uxt-SUr8TA-A2+bom(υ;*y+ fJӱz/bt%;}.f$&Yϱ6 ٮT%x_ܯ?XH Fי:iD'11E1!e8 gc\}b8>BحY.- 9_ Ҥ@O}EDDƍ?r&cjY 3& BaUfk^M ;f^1S44))pf7l_qfUH} n' /qM^"!k2k_ހ&ZTW7sQo 'Tz'甞fډ'p7k[{i3pW{ Z@S(R6'CWgl3EuRaBƎr+ M8_vչgʹzgv %hqc}.Dd*d#,&`#T$N˃f:ԍ&\/Ac (W ԇh5^NSpx<8Z }CO%bʀ7OBQH V|kB 5Ns&{"* &ߏh6ne}׎n݄~2s:EiKk˽&84 rm`@" ]\ aү-BgaL#' Mwu\[W1'di&B ӗxH*Y7Gw}x(CvYn%6gsL !:y2~xh~!KY|:|QoeÓn4#܄']°W< JckaY$m@+K̒hPe>n/pLǩ`dd?p,O#ZjNWώ2E=y]JJh@{~7ij5mn%^VrNݍ)2K 꿑m_v'h1e$n0;I7Ք|Pr.$b6ٻFm=)A'W2ҎANTOU*2B|:>3p} gS-q#ETe +\f)Aw SǙv;i,)iγCFCՁVzB%Η"s 3\-0IICGQET(Õ0(L2rw A>J//08X&$ -l]`%ϏFDIwȤA07;u&Z|yYE ܁ AǹW:|:AsVoQpAyͻi*8!@=HK_ Iͷ2VWPOBč͞^QTr3;Q gX[u~m)^gk^ hSxU]LϜ)ib1#gcrHx>קp6qޱt6ܲQ;=W@ E[tR2~ܰϵՠјXLK4Gpإtڗ*ϡ:88!Fo %H**N_ÝB˞b~ˇ\܁rz!L/m`83qhz[TǬ]|)|5bV"j0Ś ]%6MVVb`83J5'AAwt:LVFj=>Xu]P65uMVVx~0hRAh T1ⱹ$+")Ԡ[7vDmQnZ8{_$Y}WnƺOhS#ǝRA]W9I'th11N+ u TɒD(O+@IjböO;pFZV`ne5Ɛah/ wA[~쌛s!F0bE,3]L7:N#sCЋבD)٢f7%؁q6Ud/ /c5M=כŗ;T74P+/kff۔xQۈh]A81~sAgAX t1M:.- 4-;&'n=ƀ m׷ Nװ 24]Ci+7l_]rs75{!T\Lu ?)ގD@[ ƣ%a1d $*KM}̉Ra1P, p'/a4b`P+7fӓPJx9^tt8JA<;z9k$P ^{rk:Rd?~k[m>H'`>eW)RD'~egNTTVczu~ tHX!xYttJ_cϝeQQx̴TO=柿"G Betjm;mgꏃ86~H-4::) |GKCSicR.6^euQ?^BmL^dQk@bZBܸbk"FVõ9ػ"7M{6m-(`YSd #OH.L9v}ibT< AYO̅{SC5uIďK_q=?^FFѸp->"?zPo* nGџ~^_'cv li3^bY8.hot ߕ#^Gv˺!ōn|TeOL|>'dGLjR)[lĬxDn)A6!jY!vt<\wk$uvmeAk$^i BBT/mAerF%X"MCk{zPtQ8, IQ 'Ї!B2>eiL #Ʊ`_V3yLO5xF8 )CSHmG6Nˠɋ^p T!礩vH.DpYMRZ뮺hXI"& Dh1G..ez -bt$Z?FxBy©+<e;XE Lz X-Q!R0 /[_zu*`Z htQaV^enm1N{{ܷ:'k $RX We1u-KE 6 b\8pi7^JOئ&ŠAe ,隔unAmUOQA.bu$Ơ6!Uk6BM +(ώymO-A{Up>*kC OE#0Kk;X ŏ vA&XwDoTbxɚX ~p|f!^GpQ~5k˼D$ȨϳS盝i@Fy V!¤."4oqs;2گ xkQRS:rX7TjEkPyR9-\KTZ kʸtH!0GPFrmQ:8ݡ)]VvE7S;/uuMdnj<\A]WQ[HfV׭bEQ08J4$)B!vg룛4BEs.L{[kԕzqo:XOfDf!d"i8i^QB{[B^ZaWFj5@|"v֪lF@y!=s ⁈FAW8 ٦ Iqh6qMqO/=α"_#\7iT @SY(\ܴlK S[[(9aQ1hcFLS6q-P*zgA2yfNI0 EG{H,NH0Phygq O)Y/7] Y !3G ZFȰOR: 䬣&Hx>|l1vp ZwK32>N0VN NG84qhfYqS`y{|w݋ٗcj2ahIٓyVA# 3TRͫO--oi0m6MS1]&K/[̀H]÷`pBjOJfnctɷa߂ (Ny&5agt^H or{5ԍOFFaBg>,]w܍_ M ]¼Ծ1Wn:1}M"4bx_:ݩfft!ed<) ZRUb c6h n"{R0"5Mg)i)z+UP?$\+pZ ;(ҽob {4<"&QEzJn>"T>8 ,C㜡vyz*OqzĖS.5P+p\I{ nI8wHL}cEBcOlji,:37y6"$3Esf54Z :_xC1X#mA ) 8C'+hJ]2s,s57u& QmcD/Xv>FX3Gbd޳nR868Sp>w>H>|}Ǒ.~x\ +gǾٖC0v?|( \s>^}eRs<}3ѯ6*kױ#dŤȋd[W/%פ 8wie^̈qU0pǧL-$ rd6m_ڼHɪmU6dArnfCM+fnkT|H^V%2{"'\@Nԅ(Z~c5}E} MB$<$8рwF & s%Q6g2d \ؚ3q'ҹ% w~z/ks _챓QeV .TMtZ K囨_R_bTEԘhig6ژʶldH5G-ޚtB5T0iV7JcJx @yekV51؃>`?a%WpC 4 W}%jebS9&@Pp ïŽOo~SnYXBmSv˫a>y_ˋ\1P$z4Xt6;|}_c_.A:Rbj]+d@gꪒ>GlH.KX <ؒ< Tύ֛)uQt5.fpk5q=W_*4F&%k:^p ݽowKšzEy!L4*9hbG\#J'gi#d/)JmNCX|W9RFϥ*k~pfpOT2z/* 2N^H`3GȢpBS[gԆp _{\ݵ4 ǣ`]`Z-hf c,ȐcSu{rB\U k/`=dvr@,#uxK@}RGaXR͟ItɿzKdB3.yj@|$HL},BE5Ė|mbٓ.P(1AY;2G0,q&fǚ=V__ʮnFá=7p#_ lD-Gn+.1n+kE[lG-͑} "ȠyM.<ًY|4[m?j&Z{1 !rsA(iI0MRPC`7+ 3\G6Gn|0Cvmֈu V̲~53jk| nȫ Y`^zPCilP*kEs[j\<v4:f½i?*>Dx# T~#*Q̈́*5rsH8+Z}Ï- ]: qV`fAgމ4XBr?B6Qzdlԇ%Xas^E']PSqY2Xwb e\uJ, "LFòRKzaRq\=; tZW!sC(A~JzUg2ֱ t:qgfݾf>44 FT] [ɆP0ޠս_%tՁ`OyZ7:X$7pnnIU d~gk^{ ʥnIdymPtxޣ*xQU@>[[F)Ƕ*ְ璀3*@r5|?0 v`}`ćoLs >c+tmN.V XS~DB,cʜ+bV5c %N) :H]ZG83:B}mwm`dӆ:qQR;'=\22A\=̣y9S oaUY x[~'H$"F%uDHه_s@ذ-8A@`x[V$J?h88"/f.1O 029V?w 24WIaA'r~:zq( E~M.#)]A|×_+IJL@,Ŷ" 0"ݡCWb oo;-;VW9ϮI \oamHd϶gIu:m@ȼ^NQ\}:BSj_gW%D YVpm|bDKrfy }Absg\sUǵ/VcuZ`\UV3~w /DhUIJ1?qm:\kIB-[noGtz5MhZ L ױZI2RFf}=bq2z^Ilt0W%-@OMwPA;7k;=/L DgQ9ǜ\~Сļ+w⪒;1x^dzwu"`9̗}^z{5&4yPuR_kf @VQNQ~~YIH @f9/Q.JReT? 5s qMتPc}X_7_d"$ES6M­k 6e |JE`5jl4X ʣC+s>Vf )(`k3Dž1 4|H~e.+S4z J/2T2S-X 1 ^=ןj=myx >}&bLߺ${=h=hULF'F'{2r/O6,tTuߎcqKC*`3(B`pL:94=GN5Leit-РmQ3C1Fg[g>~ +WQmN_e>.llbk<6Ejp_ekH  o5,KRҠU])pm {>לqF *? }łNCrQ>0w*)LF4]97 MqD5\P*Q:EV4?\IhulU []ڂʋV҃pPDv/pmxw?F8Ʋo WJ#f'XADu |=YqT5wEGԱQ14?XZ #$*|ͫ&=; bq#.GqW6ڕRp'~s_5{! !_m-~϶Jy!Inw2 XBPs+0v]]fj/W+Է+EXuZrIl!pbt| Bu2}ŬG ËPooF$2'aP}fҿZG-q1 a D+"~ʃk.Jiy#WT8p w0CߓX_ӟ82,!d74f\oʹly`=UŮLz7C*}87‚m [,9Wx9]"kKhSc_bz9(F9y5~_y: J'iȃgX(uabMOsʨ/J暆Z,dƩm{Qc Fԉ'F6h]vx9͐S^ e+'AL5BGy: g""0ͻ*8}ja89;GxN߈Xaz vϯ`ٜ{c7R8 E1r47PiX+*F/G7knP~!TAog*`ir7sr܆ sb~u@0&M7y3 \Lۀr pZۧ,U_Z)ڿ ͕?cMa5!|m߯ MS3 5Føk,*w*[X<wT^]z݄A02'+jtf+VG${]A>]n~+`=pGX8;u=:D: {{.Kl&}V*U)sn*O6+kÓj}>MW<<,Pվ+ÐvyOU!䒾U HͪU^L!1ow{C$`P1GPr6è-r"47 }rC9]oZuSC6Ԭ+'5i;*&.?Et1U2Պ.@c•v_Ut\|_Ev ]윥6M(6sop 6 q|=}¿0Ⱦ'!<$.6 6UkhF Tż2ALsZcm6H1^Awͱ@Fo f2$=ɧca'_$lYYM{ntlX 'u# ޺\EЃ:yE) N)YMOz_MacV\qHA_ЌeY"CS뫡"C4*a6pJ#RJD|碁IYC6ȮtcKU֌R sGA$~46_JJLJsu2ȁɛ+6yNv3"x1+ פT-^,<ɻ~-R~ml0q z#vjژq^@9\/ݴWnџ.׻0eBI ̣ N&d_~L {hSs+gIgmh4!f,RMBH45ڞU7҄7*>$l'56OmK+ClޣcjG. /UL$׎z80F=߷ uGzmJ0[| Mh3ƛ%S?by j^zB%Ǝ(C]Lz㛝g+gFRj ~sUv dJ@j:!?_b+x(7GG=[] k˱?2PPra4u[u5FŽ5Ϊ-۾e'*f!ƜDHbR\&#F= Kb=IDz>;pNihv. *'W%`U±"ɔ!QCLKݠӆbNn4݀KQ=&ǡh2/j2vC&Hv,b?AѮk8gB/7h68Z㟁]%?_[АBI#YEU?$ILٺY|wڼo=ȑtn d{9_U?m."N3zn&Δs.`5P&([ Qysݙ)[oɀ{8Vj6B4Ĺ) @MZg<;@L|AW$[y;۠JweLzz0>=ٍ)0mT$#ʁ/X^X)N楗8AjP+IR =oʗ\ 堸]ykj"OkAj*ظ}y߂gA<`O*n-p p`ٙCiR6|# _.`sa#somTcD_ID_α<w-v$7Wr*ZtRD.yD~`p b?ކf-8b*KB]N6o֝x_/l**߈3[=S,*A'x^5:"i1XĖk #ltXyL.Glo!q4._ȸV@s$u9Yl)+뼺d ۸UCF$oлK6 a)˨Eyt86u\.O 9gT^Zz `A܀J4>M6a: skVޫ@ H&H1)?q~fVgE0칽ɯ &QH*W˶{_:i&Qi6TY  leI|}3^"{9>R22tMp XU@>aÅ֑7aiڝ%7I3˃4PNFoW]dzjm!z-rk5qDWfYM~WӧDzK0gbo1G=GM($3L9uh`nWaR )EuZ4ҢVFda1HY0K|ē66z $&]fԮ x6s G;qb[oQCۏFT8"VUaFydxJ% ƇlInEmQAmB4 ''EpRhX 0X I/L ~Nx" Wӥ>ţDC>$gq<=bzRnuvb_)֖ԉaKtK5NfΊ34!547+yQѿ?CH qG&j<9gYLg;_U2Q E`Z[lHjf4N*a`` |?Sw(wQ q2眪#T{̗NpgHwĺYI2Z+լQ x* Q>r9Q\;6FL@,}W^`~`Ws"_)lF 94_H;޳VMW+l{}dEm;fcM2q'{ngVTܐioO@ Ch%hw{(~E*:Lur2DbM|UUfa N U/8dK>vE&n^\zI':?d\@ / yJ{$B4~uf(@vG><;MQ/V !F%4[sFXsdda25ySD}K6cBK#Kac-^6`PRRG* ;c.A,~گzI=gunDi+XIuY>R"'e&"[JVLJ mНe;6茏7DŸϑτeu')o0$(bUVe(Ny QYtMq"IS=NOҘOoJ]tfD]wDd/> &8~8;ŋbVGEG^Ŵ'?@PT^MJmc->2ҝp:Yt6@JoE41l8R4 @X}Ym0;br|w^;}.j@[tHZJ&XEwfQ2 Fu}7Kһ#*mw}8N(BK\) 0+os-3l]Zl=ԅG+ϴ I62"˔q-x1f>O\:$ۍI5ss| NZO7d|}C;^)2JBx̔9-̛%{[ pyl Αc* /Ae@(>v nz_mƜ_p-``vKa5x`Q_n[DOqA\Vx5iSϱnes;dш=ju-D0o-ܜpscz,#PqZ6=HfAE$6=Q戥-\)E` K߸ZJՌuIz70fy~CH?B.sߟD `nٔ{{.Eֲ;k\]f8 IoW8X6"=ZO|UzĐݫ7mP ,0ZDzifE,Jdmq?Q|cL`4Bqy蒵umc&ę j[԰~NE`aV$fl|MÑjI\!;JV1DLMភCo1q!m'w6K}59+ܧU~1@9dC6r :U9w-3댶#^Tke'Rx f @8_圩Pl/ Yʓ~,vNuP֋لv\`]P('IC筺l"p/!)l`)~ROcΰ'dヰƮ7~%ʚ}$3{v!7o*{xg1g /$łPL3ĜbgQy[m{{Q^0R,)W}EZRi I2N7)9'cy. ):AvV:jg#Uv:ؠɛU@3H:4I,}W4J0,n ZhGHUI@0-PQqު A~h U՝|:+]s4D5OC8PۚYHXgYJɫAD8^_)pG:"IdY\7<6,7g9h82I< w*/ :TSnG@1axS>d&$)%є˳.'Ɂ~7gʁmEȜk{Ws ; #+j93FA7@uF3<\abEAkT.jGtw  L־ DׁUd6k"{ 8f#R[޽#d \f"N6Y?o+{Dv7}iAl4jJo(u-־TC ogw)=8 lA|\uo|5'9V.B̮G3 uW\28ozOm&4&V@'3"2iE#F5<ЖaC=KQ\W3gEb\ȩ˘Ꮁ/m"? Os9Q5 }+m\of3 G-'.\0yXΊ3aa<+Ӛz@FBkhSjc/[mυ>JE{ Xx.g)n'H/jiF]QSU': +J0P3H#@MEj!4lcʗ^—\9bPQǻ11@ZXBs\Yw/dUHuO@I 28/N`?(n 6I'__xEqMaNfe]9<J> P cZ {fH=+>LᡫXb w*9ͩY= CVec3*nI"ٲ0/=$Ro:mRrLͅ뤲O- ? näˋ`ԱK|x1sطKFpSxӔ8SA,&I$J#chWa]e9)0!K;Pra_ $ dZއ4\'6N@Ĭy3Z+Mˮz^Ye(AT䄝#$բlB%;HK9mQC^mDDI H~o_Ž53uйzxBNu VKzbeqruĔA'xmfqٛ>(M:wQ1E̓ۑp2[.}I4WV~=ZT#Ⱦ= | > ME.YUtޑMBр8KE2yc~ΧƦMى-S ׏[ [eEH\O#W^JYo`<Ӵa첖2AL4JGVTqzXQ [kZsbH ^E\k>=40-O2 "7 _Y돱rxt uЄZ.oKd]9o}]KФۙQx$ oCx~EY˗h 0gKq e nlAI:sSŢrKM ,v+h$w I#Ok80ͧ>Īw*= #~K=8`˼{KL@ rzf΋5ĝ-\]8ljd9>;CQކn:- jT~.M=Վ$h8kiW,ع-b"Oڸ2Cp:_:Ev}g&sɘs |(Y86Ә#@lpGaҦirY=[;]\*=xd@NH lx6Od0%\0"YaY6M-̔í11_w\NMOpT q9n,}49h:̤=mJܩ ()Pn*)u]Y#5PzM呙^q|4GhsU&QȮ+). 2F)bruj&GNL+ܘMc(oI/1^(ԙ8Iź}ɍ!E0TYh9bI$!n|Ȍ_HL@bi{&l3m`wzC_ J.g1ȭ:9vfH|gT.V&aDwhg<_S} ?֯#f8AL. 9`Ʉa([&0|psbn5}ȉn%/O,Lza#lO&SZqtkm¬l3i%0"N: &huMu`:.|l8JFLFJm<h vMAo ƴؽyZ7Nr\vpñ_󔱐0+(#}Yĩx ubSJam>2s07OW\I,֏_ZYs,G.Ѧ( V"$V ĔD*F#T3}55+Q+"~RmfU]4 h`t3P9"+$'ˊ δ|Ozg6@j*?R]6B K62k5ыcVm166F0Rgz!$>/dd ̈́ pC4O s%T@V {\3LӎTY(p2R/q;'4 j,x^T^EШkB³ozI ?_vAh+Ԍ[ԃB*Kj^lQ$X.!']BIS1+{$5t[ GzWus9p$V4:+4 75 P4 D5jmeX烃m=UD5J. `ktn'MvVH'AطWIiVL'UNIC@#ݿ@]$\Q†ivОp K}/5)Pyx12"C=h"(Yl2myFN%6(Š+b2|'d/P5=H~mYAYy D:(0Wox1ڕlo~Yj첢׫`y㪪vxnέwESh| NQy*ן-*՝_SAQ#b(̻|C!BT\Y ߜ \:{'qᎯ&mά ay\M8sOuEPT6gT O|JS1j091kګw*2aa!\Y]Q%1>\TlfA~gFNS$'l׬ zx .~4bhm9C FFbjeCFC7ڋ6G5c$a K ,/̉q{Z=PQEJQUq#jzM>? j"TA?2Ҹ&8`lm&-AA{(@S8jOkL]a':| (1jx!ND]0޸JqHhפH[NC=DKps 놅t*${ͅ ZD۟br`BtV-ތ tГ]Y~pd%+RgNYK-̊>hPoKb2W⒍ޓ. 7uTc'ـJ%G rlmԮ ux5G:{݆Q4[̓#A[e?-DlF45 ɜ+@3 . ҭlbh̫'a \]KfB99q۱YZ^ŅD噢pfE+7Ȼ+ U`?fO$|_,rs݉csga}6e:$%_oFb_Y4ofQ-,pP> 7lrhG1\ i]e&K"O Iqz)H;Is2viŬ%Ѽ$-ZK1.?RG+fn׳53z,E=9b0r&GXa[EiyKn1;e,RcCo~?Wbe}y-!ykt1loT9cޑQ^uSn=cI_U?{pd96{Fb9[`tY %ljC萓')C(msWVK^ ot2 0,-v4wyl(HeL|ڐGp'.*T^Ky) rP3WpA`q/BArzf x[?լBTlƒD k )0(%izAfl}g=s-9zM_do s6`nѴzF E YK^ӷU:e5Qi\ަ⬹tFbU⏡/z֔ /)5v'9nYy5L];8O65+.1}0RhIo\6H gsE8,^qqپ *$E8?'/OJVR 49$+)IWbLoM{ saP `Lߞ֚{޿JN ܊Y"=d[I]Y=nY&x?Kf26=ƨ ji8~*?n+SMl9~̓ MlB5ÈNM['Ҧ1*RSLWA*kxdG{ '$55ҙz۱3@snXo#5i"sY  k:_[OYRUGM:_TluP ǩ8܏KP8Wf"-s]N~a죯F n@jYЅѢ䏒Uz?X 2'B$#pذ|B5jXQ،/@t\e?֔e~ьd }!ؑbrJ ( Kz)k,@_| &(ɣg{֥H/EZB+zoѬ1EۑL>sGڹ}x|"c p ztfa]E{a[]ykljnS6.{+ ;gTuj X_MQƍ!#\JFuyыKظ5) t cE0TSh0*=t}x`e&Vaϟ&_?5Q#2>>ae"W!z,^K5ƹ&TֳWM@ LFWqvTK8#O꿋gu¬wʰ;h?(Q̨N+¶MG5x!|i*WxV*Pl9' ":`N*&.漀&Vdy'. 3} DeP<^\=ؕdd&Bo#k-@$zmj8hQLA8_0 (fxqn:7?aanܬ~Bm+W q"V {Z (-k|\^$ZZ ~ {B;3~IU >zo;)рͤi+"F@EtTS症p):mUW&oUPLhv(%_ [i: deT Ou/!fӝ8TFZ+g@!#3.< uKP,5Qx`3CQ r+dCjLyV޳C荆4AbLz+9wǘ?Gl7_2Y?pdLf;Dµ{=J#zw  ֩1CTO#a0q|(<3 xX(Lu08&zϟnbWĖ8'_d;ۑT¦ҿG'}-K\U#nQ%RN֢dJߥLiѭsNC')&YMxz];Ov?W#-Y tbbE#>C&G!IqG rDث[%Y9)ds@fQqʿ2/-z s~-ٗMSO|# ~z:E3!"|A k都o :`цgme^M8.-pv\[^Cáȅ)igy*}cTK,$ ZȈl5I%gbH-U}q\CDԁ ,`qP#WbUY'{$g0HKO9}ިsj"!ڹx Ln M](}+E-rR΂k)a# ─93arʷj`ʶ22"I5iى 5lngJ<4; 3Sռ1 Kj˒s#$*s|qDʽ88)Gd}Pc?Aih~oߥm{Dba1c%aWXsiN`F*^@`;/6N^@{>!Fcfָ()?Q뾥;YB'?{Q͡M~&(Q5*ktOὬG\n LaUuaOclR>v#U!`5ɿ&G1^#P)ɯ3~Ptv@l 5z-o1L=F͐c(ˎG5yNʑZC!є)lN<),hzj&]Vz6fِc+06u`]4u !%qYMhxn۶zg3q5I1]4mqi^H}/G=wW'1"P;N&{߭j$GGӈJߌd`DVIt%t0^uAJf2)<)S offQ&uULFÇ1 EW%p B55hȞ(^;,ĺY±:י*v`GoW;۫8i9H fߚT׼bsͬ&vĹdNӾd696X 85tL5xSO39 x{ruVS[дECA?)oҨd%}7& &Vm.U m~bF2˗HZ yk̚N یr0ڍѕ{$N/[4PˡA>jefR(o}HGOtf \$`-AK۷ղ 7f׌ ՅC!lv exJL5r:B=BYlYؘ*Wz{(?ڎz.iJiͭVh<99.Q2?)rxnmieODɲS4EBzl(eI+q}6 q|3 F?66_9=+ҹ@oam "SeS$ԎpL] {EYWb\562Y6 "-]lH*`]7--Z6%/<]6 aBCG=B˨E4jL _p]?4$+Kj}CkV迍r [,>H@[A1,o) |GO4dEXH[Lg%ʭ)X(}Xgs?:ۈ1@KJ|X$ݝ:Txe#r42/1R M]Є ;}EV VY8VXߜW˽=o<3M#*G:}fj%Wqt#4Q,1 GǣilHX\u#Ց-:kU+kY(m_'1$W9#>$ cưşbDt5)B^{+-,5۸A34bcͩKc߲VbViiF*# ܉U/EnqLFo*[.B3c%\Zfs鉫5!s MZľ&ABk=s+m5zo6]86PAM &0{TlYj?ٰx o;1?kI>E\َqdiw6NmSϢ^ 5Mx}aKv 89T1sRzMiv:Q8Ph8?}*H` -k|CO  |d4۹ q;Vч*):z Y|$h:mkQ(N98#t RHtdGEت rLI.`q6%4s%y dV:yRLk;h[жHس9|]`蔗SPIhb NWt7_˲Js½,ǿw/̊Q ݏ6!quxZ9xI{8Phbyzח,bo'lP$U,Ir)=G2rUg]p23t`OvH" &t{E[v42'GgIGs0?[lK+ZkZYOU)jjWx#{|zsKL+,eKP)XWυZ?FC@ <SdnX (AR!u$D;C. kȎ7J *cx N-I9|C95rZXC]z 31&PJ]LW歮qn&|jŌw65.2 wYI@:oЃm0!үrb|| kY%mĢn+E>ΰ͍H\v|14ij:P``6{3\^E#uamslә((Q^n48J=KJ5)FMYDEங3U4NJJ{SU:`F5rAx#j݆r{vv{IYW༎X;>v|yP),ߺ)2p?%CU֨;G^,XF "8`6ೣ4uY{ PzʍǧF&-TXq߮fEp"&2Qqǁݥ(GT5h&dE.*5Nh¡Ox*|oFL  #* eb]I ƉȏnbT KSO~  ׇ;*]ۢQVkž3 ǘ:rv뼯<<&ս@eef*W:O's2jaÑ'&IZܫ$f/h$@z?DY{OМ=3j)V.qF=t۹Ɲ_(+z۹HbƴF7Q3|yqGRW4>Q¡kP8>TB pKcY#-e K#Ux_%_=w )bد/gEdOo9t٩+`1Cǣr\Kv&8X;2wpH&پm8V~@\Ad3ѿW sg0 a87cP뮐'1t$,݅4*z'v^{M*13dܕ) J35H 0FҦxZO %v /ԩ(ji|!'_=mŦ]нG Cm&Nʩlp}'O7 \0@>{V[>Iϵ(7VX{]1OT4hg. Ni ml9]~µṭ>$*0dN{h@à{8 9LӰ ueT(__:?eJv a5EVo%<+{~leo 덒Ih|5\y#٠{-xKF@(?L4/@ez|i6ńųs~pH?x i!zov7A1Omu8HxA,ì߻{TI 7Vȧ3OI ےhTK\j1p>׎׳`Eu&GfOdcsC4PA0:Яqc@FT:6`0ߪugNN/&jZkT._rdv m&V@G^#j-F4m^p[&RA( kS.Rb] {bz<91&i 4+VS0^o>| r >JPA3U(/:qo^jŵgwbQXF'Yenr $W hꏅɐEÞD9%Iv,=UUgxedt,!c3)P:0 lU`"4!f</6t"sm]z~qV ][TWtll׮yul~֓vD&I ^4 '\JN__pGٚ'eY"Ee-J;YӇEA:!P}Mb#]> |,~]V@!ƿЏ h^k E}N%L`:nEFf=t3*9_ 2"2}rZ uMZ9f2Ale^Z_) 0B\زf-ᨺ%Uރ(,i?YN:}Y?߱KNI;\^\7<WT("m };2w&p#7ܪSZ,Ր FOcVCq`%nQmk9QjǁSEs@j6"U‘f|NkKѳ%yD VQ O;x"e$U҆=%]RrYXsk9ByYjSg9Ѳ~lH&VYFNƇ/LPmZzOD|"ϧ)r9F΋B8Q| 8'A^OAۆ.\QРjո\f;-r`liת>kn¸^zMS 6kysOxϧjHӈӺ>UZqRO4@T#iX܎a>r1H%TSeC~BQπx*%v2,aqRmïqϗ)1R+v\?o%׹,#0ׄbBScSbR>ڶ<"i&JkNAعQkxCPaLd5rdօEVp[Z-¾$x ,Y[F HhDE6֝" ]71mİxԔlrZNwKX":*Gh2-J Yp:NM?C} C|3iΥ&frlY]~TҶ.;EUKA2z E_=4^N6\?L笖S`+olX %>WxwCnWɒ[ ]c6ԤAbݦ.NBFA(e%6Jr]Vt.#&f 6]Aoo; Ah-"2*;]E+ vbl\jVI37 ƃHQ^. 鶒vHBոwJ)c*T|#}/Jvek'óbj!SϵK&}KS; 9r| ppFxޒa[f(5׭Y(2)vL*?ފDώשum)(ޫvz-]ծɨi>ZVr4K*Kح>ⓏDf6&{!#[6rX)S5BߚL±6 U@]B[ HƞkI'~8Ϸ d",AGB㜑*+QŞܵ#bAUڄZcx4*i&l \C'a

ʍ7Lm3hVar$F1%N94&CȘ&n/uPK(W\Z! ]+|Kяn6~GwxM %}2$@NF"F)׃o5q{t*iNo<ʮϳݤ3-@c j("ȅta/X~4 j&FoUe?+%?в]Ppg*#{| ՙ8$DɫXÿsˑєMo oa圭\b5Kt3- 4=,oD/ wQ~)~*#¡{,dݿKq"ϢΡy].H,;O ;^Uza%pM Y@w0f#sPE]מ5nA;3Z.25e&Y:Z6ڻEh3>?$xe 8B}w Li X"EݐUk3tK{DJye&9>2<'D#xG)YWCU+!+GZELW,}hSm(=šdP0ԳJ='aL)zu|Xr&!\#=%Q@c 6i2GADhsf4Y vs7 #Gr0f#a旅rK*z皳g&>=c lypXmtc(Bˆ#_.&'r9Lr\qvgINFk-ZT )%2!Gu?VT3?wP*uNЧ%Am@yM!;:Md}جl"RIۏ&_^?M e7Y0Fv"ckxe)~$aMdrޕzw}@R7 o/`&K~TZor$+\vo`[)f?[uvc!KY,_gnxI?v`?;ֿ睴0xiyEXj85x g1h0NKC|)CQ|xJryhpXQ +rE8dԤSx_#a) _9:Si*dm :젺.@>RїHV |ߧ(Ջ+0u3 7)]r͆vi?fA.1Gmd [#0]1^} ~Na"gW8f@$32phv..n@ JIe(4Clo.)_w`!ਨe3Bա&tfaa o\n4-`;Ax(&.[%JY5Rvq3ˢ'˩Ll,|l? B%=&"eYE꣨ˣbgɧ2j"4-p hˣ"3KaO>ӧ4P\Ŷx%¾Z#U13a+u8YKFmNO@1(W2A5g/22ȑS/ȲI0GrfŻ"ƒU`8ZpVQS{"8{-g$:\ ʯ}dR;:r5: d,aoψDь;=S{'䟭h9eNx%Qkh}q5T'J)zVhxʱ ?9@@_؊6U=M pz'(F{jbxi &bߛ%l"/Z J~}窥ڭiAf &mg(IptKPH6'%W2HM[}H_|T@>+T@\y,R 2G' ey⇁ّ3 n6.i_:OQUC"t<!D\ksH`U=)L۝lD"Nu&@J~Ҿ "^R~ qn#sعEأBD;!|Ϊ. GQ\ #ؔZ)pw7@U]8δ7*iVa'D 6xOs'-l^`Y~l?ohգ?~YP4˦7}ky>,C l̬"o*ߍ]Zf+{C7Z6G?[Dc^j((~RlUGgEI fq0MjrXk@vs@045,ᝊTGP.@pml,lR+i k.IGCв~_\|/]h!Ճ"d9r:?+_;$!4p^{s)7_e/ig4Mj%@E^BKW .4W ;:L1F#_^jׇt=au[l0ssP 6jYt᜝&i6"ɀeQKdm玌y](OZoR>O? Dho.UTAҼ~gQ{3NX C"Rd>>kY!YkLnVLMU˞aOл`Y=QZ4 ҼTQ*KMVitz!Ԩl?7l]Fw8nV#k]@naČ/f? ̀ZukIL%+T HeivA2#hZN# BGW0XJHY-K$~r!cf}p'0xH/qɠ=>@¾h`=~,`suR[#E*0|nR!d0$= $x"3H7gv>aB: R-a7z /K{q57,yg=5K-2.`tvQN}-ogyoQ,nۡ _2oGF#t!WX}QGl߳kEbH;G-uiF)*O!bUgLee*Bi2~rbKus*lj:O!n?x#IOMPE?*||ì%) d);ʜ B{( VfzOeWvfL*Yݽ\ ͂zyf2 qSԵ(gB68<l#rl8_{a$sgd^M$J6/2E/f$U V$g&7yi"8dziաȜdP_kQ3'g0I ~"sJmyYZǵ7&b-Sm1%:i ˆ5$PӔC2/1Z}!^H8AK9 ur# ú ;J!l|#= sTኹ/3HR}5d "9ld7ʚA+*e)qS0Dg*}Fbc"w`_ "]ţ$nJJ{}:nW>I!uDFtq' `Y?~b~j.vsx}G\7q7 ѕ u0k>rAtyS#c;F?Ab=KަM8'<|_2} 2d-&h܆H[}dO¹w ڧ^ ×=^p8%Dv%#Fv V11 Of?N;yM[˩0ԐC˘dkxQߌ v꩜S9fc"[rS&¡)Esk-xDSd^/ϘIBB#=o=W[bXu E1]@~ӈHKtS+iin\PGrƓ.fj*K{1u6KAOP$RC QDԼ[/WQ2TDKNB.!srPh> 8W%ح3H8Cߵj IZPSۤ읛L T,?aMd αl څN/IKoz\k@ezR(@6Ơf))0|,dm{>Iq>8$|oPuBZOԅ\c0\d"04ɗ Tlt͘zpu'O82dښ/[+A BS2W}u7p0WEi,>CtJޣƂb=>` t)PD@Iº04SOɎk7}x1t94B58~ ?T7 dd/DSVDP$+ }S1 Gr 3C`}SqaOwY-6s` >^OPѝA-+:^[h2ĵ 1֊4x/%咣hٷX6O2ŜS`#:W7xSȩÚԱ) אtSZ5wZuBFW?(YM|6\p?96ACU' @5Lk[|DaE'yǞ<ӏIMK?˴tI-4R7f*1!-FĖ_6fo W1NGr_bd^‰rw$'56i;+9Itw]{.5k 3vKSU''Τ#:$nj؟zfJ?mcL(a`1]SQn,Np*vhf?ڿ^}iRwSgR.5׈"5ukS&ACT ljR?r(k>Y؉Rm4ki> 4`Ql r ]χ3aBC|Qo[ːej*mLm836vxڇHrfNTO*h@uB JqSOVO9extTc5)f#!:9%cU|+J-AbHA[Crj C<̉Tpa7t>@38s>6ZqQbߙ]AzrqDzL'#'d7Hh%hIݏmrZ6^-^.Gx4wUC<*.[QqkM\ RyWqc+(cХ~s$-/~A"`}x!H= g`r0Z wr}N=&p ߔ+siHo ;S9-d]Lv1%z,Lyc!l|*a#$x`#&XB\4 8TGB[?+74j8z<.p^ڀj&j19ncba @c)g31$RXE[xy]rNnz[2 pl=A.Q ~4i#[g<|H3)9i]s( yf,(L' u1DGXXeҟ}/VoG1,WcWkI{':Xb>|Z 5>`\܀{K-ך.HQxIުl~Ȱ'ՂyXׁIs\ |f("o rdFZc57yڛ%%G>bn`l5H|ƁnW#F_^T4R"Nq  'P̖ YiN@`SAC[X]׀VO*lQ%Xx"Nm{}Xq%EEȄW7ޜ=R iio=:nExۅYWHp_E> @gr< Ƒj@urB8} !+y6S)X;nN6*׸:&);:xϙ s0GSk,:;omhs=*۱U)7V.*1g}' oRd'v9a)3yJݸ"*Z q3X];sdoe~Ӽ.oӒIm"/ەsS{7^NދZЏ6u]"Ǿ6;\Fvc1T`PWh44Bfu۟2g,59fXwK#q%ւѽIM3N!h2iLd怾#2ڣ}T摨`[DKK@nE꜐3uˁQ1)UW^W5'η >o7(VOkΥ2а||kD;m, XE}/ET Ҷq5z`VٴSD֘[N$lj5 pd>Op1{ړhz~=S@V~Uu mm]2%g{4׾EuW~?C&*s!c$MH*]A`j aoWX4vh!?@>gg#ԩ$+} R͕ķ>ۣ2 =ޕc# y9 5L16AϦiN5knkP\Éߕ{MVCHsb {s:AHtӟÚ1OUƳkBh>018!9mSP M"ZBU&GNN5a&Г/?;4C!04wH^{`Fb17tE|`oRM%4zUO]TGyQ n ZM.m  "`):J1 g u3SS8b)Z^ܵ1K{SxF?)Ck\v\ cU3^T2RR٤B nCQ眛TQu䓭+M41:Q '_y=ea`K+YfNnn[WUBpuy<"o^}n,aORtn`)AzP6o_5ϾkX^n.S\aF~qOUU pr<''QkwjNxV)9DFYg벳%\;1rC+0WU[ ~Ƨ@] rDo#w>i"ZWw+a'KycR=&ɭO`N~alԀ%n4Ԝ$ZUn*+3zJP{\9C 9vaG\\*\E}ueh_ ·\&j}b{BQ^LȊ5~y'oHMk"MFY|%hnBVkǺ9fmZNʜ "77Y>+XEnp`o&J_6_shbɐ[PQ_" ?A&yKJY?$JʜA6OwE&u PI6yJcclG)2aB&^ُai^DuF~\rGi/<|<;m9q Sgmk0 oE:^tQ(U{Y$l4b?00di|.2ʀ%HdB{&ѢJuPTrY@=MkwaEfM%,P'U2V]e nQݾfGq a&7@ӆ47@ֶ]r۩~+A0=GjO',SȬ~-1P1X8ą|iy}~B*kBhþ uPjA6'tS%j9I;B#[D{/.(Rm֠Z{;N'>R <+(K$jJqg93r%q$8WHA˞(ER,4¸Cuk̹C"=}0<*)%5Ź;p4hAzjq^Yk;;i֔`kAv 6>}ĆA7QO>B&{5>8ay,eaViwl[8eh)I !d <֐#Iط Z SM)G-}fgmIk6%-(3|K޾K뭤 3]އeXACȶ{)Y՘#A; ?5 WccH~",ga!^Dw&:9 (auJ? si.V0@%MΒ޹Py|){LY&bT 9 >iƐu1N|yZi7FW);L03Ep8cr?Te\!X3JIz$6!H0{طYPs:L \lwz.xd see 5)$b޸Tȹpdd~WLU~' b!0mŅ_KLDN6jqpk# @<?8es6OX ;k_ce s0q*hV} is<[AՐ b5t$*N]oȲXXz/c-w>|B09U1p)7UE]&E˖k WQڛiF]XHǔ$c&;d]PB-h/*wgFɽEi~J3_(-[*AxoJB_lC%`)x^w= fv;nr!>ńe`t-Һ+3Vxl f+zwC(_>C39- ]m![q\J c BB& l+D#q%:A-הOSSbVx0NSH-,ȱ .}T}wF*gP $I;70uWWgXM" dEoNo2TDw+^nT$+770fk&5B=GѦʋ|༫.9cMޫP0tCj-;538Knybj3AǞhZ׬ZN5q"Z nc'[NQ707V^VO#[6{zLX^l6P* -!&}fB3ez.3LY{[amu{3>Bz;<R6^t ^Q2AM6ͥsdStw1+9W3u">M4^*CR Ӆi%H`\l J<#EI/f9,6B-nM綢ځL(nL&W9"k^y2^{ȕń5UT*0;SB2t^Dk nX =jp3YC6GoS{' 8FK6ÐOɗø# ~HըQˇ6xo iVH@F!pWG4s # Gc0;ohkZto}w93$2}oD7;@+iG յn@I4S{0MӦ,~:NO2턆uNb+᫂-6CԒ!Bw D2WW0̫}䞷UpSC'G'\x?aݏkD^u~l#M:h #˶NO2,=K*#m 4+dn@FH(l]TĮB3qN.m9gQ'&hr'=XvIDUl[LJ.IR5]atoU8ܫohȯT%:̗/c1Uڨ@ 'N 2V_X1&`ncZD]{!,+b(%_wT^Ms|6.ȗ9%:J2UP.r<ӿ{66(qbp;迠>o(: 5";(h¾q5؀2Ϫ7'.\P݅J#'+M&ii=vM+C"/C Ra΅Bm%~覓yЛ4*$Z}&/~tWz5G+wRF,mvOt}sK#~D>pAν[1'.j/8g٤Ŗ1N!dI Ξv?Po'TEFǖt{7XB"bBrI˝S5<*'cKiU3]veV];&U5]HUt^6_U"ncc ;\l21lJo|!k'*h!dȸ Ck*il*H4[抦p8WQ[2]= /%Rxc bL^4RN"SC\y%W#op{ ?d` !-B ~?Q1fqq [$;+g5<0ō"鯖kN)w,[)+"6Ck>oTd y$8PrۭuDDiQ} 7bo,BSNBsnlvREz^"I!Nj<5@Kl cU2!W E zf zS6]r4_b@55iR|MLE/2{jV!&l"_hǗrްY ]4FlU$cj7_ݴ 갊zp"g26AwYO1( J(P d?uu(nC ;%I(Gxk407ru搈 kFBoV!toӚл<,UL6N7,UFz "l$LYg&!zͫf(iӫZQHCGo0n^Vr+> `sn|L@w#R/o%6W+=b}w@Ib-^4qc.s G y`HgS$D!˂׈-˾ܜY" S^--A& ܓ"֍{^ QB#D?|5];Xj e/.HFkԒ仱 )66XC%㒈XBդYQ+Wn F3q\ mD*>Z&҆7d,)gv>$|B}lxpoGe6E@"L)ĔFS\sj0ўw hٴPryz*JjJ? 0 &_%@l@ ͞%׀F\,KJ߂u| [ \/Tk3#V9}&\njRp!u7#H$ 2tw+:F&t0!{mYy]=?ށϽVGl vXn^SH3.7ddG19zzeSaqEZl] Mt!BZ $` :Kp)[Gz)$ }Ib^ץ$T0$j {>F>CrT4f<6'5rrE\%J #Z]#i><߽-}ai4$1VI:4j]5-|9ŭ[L8"9viEyznpnZ7OL~F'چyÞN]TgI5bqZgy>vAM=ep@kVٳ[!vTĦJma'?oP'lD1G,T/lGn/0$Bi3o'*뚼VSSɠ|2{#a)%-a90x իgM#@X 6>NN@0c]z" lt@ HEsA^uvPUEM}LYn:xJb$ Ik-pku6MyąuUpPF=["R/V8W0X8M麍Qz-vZ,!z+HS1r}aE)}!08DgSc~8exǩMr.ǩ‡ (_!SzG>Kr_#6J2\!@Ҁ;U8]WF7'#L1 _DB2; a6xiÝj5F48j 55|^8ħXooJ4JJ~( k5 dCO4:!9H2Kԁ/j~8ӭ!ir UO"|?=%k0.1N(#|EEu+s2ƳXnS<)x^Q1iJ#&h\cA/i*\5-:蜋T\hObh܄IWlr=PJ[)'+޵h1 3]jnt8Kb21.sBr (כ>kY%ĝo2, n *ГiֱGpx ]0pmwsH{ yGAjx(^y}\s\>/_]pn d./cp.U_*I~< e$[n\@HUݫz\ޤRe %EVVG"PmDcl,JRE T5 'Fsl~E<jGQ*)@ԑ@gSQb Ypb¥H3ƅ'E>}"uY,sH5cоOlRXGc ӢaN>dղiUrLzZ$jTO C{7+s@9WIIsWp VX~n VGK(詯/NUժ"[hOnk}[hRkS.ҕXjM2gw7i̝p3'3P)` ͵)x7\TGEVwply4_X#H/CCqQc]tP@ۂ#ZYn8`i^WPe_,'sG:,Y{;|G**T{O'JQ胩yrUIbzRncnNN{tjPy\C59Q ]S`< ;o{WJQ\̀5h=scz~ȵ#=i7b&&IIzN8z]o^>l *PY;DDA+wz]EN7%eĊԒa2@ g{yB~S(UaX3I3uuZIEC'$΢ L z'cTA}*.8DVeSSj 슸pٙԑ|73DQcPUڄ#@V84hSaN ĎB_RdX]Hd2Ti\Ǟ( #)[9yhy}F>xӸxW=i>3Isi?ב71JmlHQԅ D;f +\_k^P=M2$f%t }4?Tθ;2m ޯW*{dY4@ߔS,k0Y}K:yÞtzjj(΄~T\ê[tlU8U8d;K΂C/7*0#op [0dhw;m9!42S$5I"D1@Z˜D`^88ˑ"BlvzKx0bMy'4!w$yt'|{Ly3w}Sb3+yF~^w /xf_lI/'*S41'GGf;1Zrm0ezM< bP.IZ!;^p}cv G쫐(R/B^슨G8As":3鴧1uw*sv# !o#z~Or Bf;MEx`7^Dh@lҟeS|JH՞5 ãӌHWbT^ɚodJE J/1W5Cy~FEl^Hf͞p& ?^`Cc`±5߻.6xxA6xSڷBK#J mטwugЯ}$su//(UEJh"٦[0 "%AG> % uO=~[I\T<|JX3Vp~Y|kDؽƐGҠ}%Z h"dA ´ʖ!PXAf8uՋbݿܠDGС4 Bd_Qb_T5O  (U4T~7FvVI۝=WL^/qjBDxALmȬҳŵŮ$Ë?&i#EЕۨ fՓ0 9;iY)Nw *뛟qq):)+] MIPQ AP^ik[Ms6 E0NfyO̔ahcp[!*s(y7UL W3Ev0ҾՈj?PH99d6!YX=eӆ2췖+a$\;^,Jک!f Eˈ'hsVpTRF`|(;i g5/ˎaֆHo"`LraxYA?dZM6PT/ͯ}J ld"5r8"D.jRX}x*hH,/Xh"|VHlD/HU+F.V Ȱ80#,_)JWR 9 MJF4YAr[;rHW8 >˽frVЋxgU~u1#Y:WNLS0+S%>ǨʥOrU]d/՝0!Ԗ(к:L&z<9t]<a9洧i2N_)d{H罕mmj_jB(qb2aiò-f`]ǮKjE .82ɶnޢR܎:g)غp,Z/7`1ZR,*$垈kUG'Wf3oydi8RMD̥Ss?`L6_·S֜>ER&~Z~pȑ|<٩?g"k]Cmx}rpVH¤{;ӆNksHQZWˇ'5$aS 751c֠ s8J5j; ԩ208v_]кNI@Vv{gyxA?Aaո{T: pSO{J]J̹V`SU$MFd0,Og3'-VnDf-lzi]f{RF " j}Bz$>-J@s"fQ]Ҹ̃F$͇L/Dk-]pxp{ ß-+\fZ1tVHAg"hՉb)Nug6'g d\29>_+lOLL_B+\h]@| C~3g/nCksQevN_&b=A$˞|*&b/i2'2,W\w\YL!p vy"@AEE\ PHR5u~J\MF?s_Ne1T>m2[Bmi)ן:uA#qOUE '^xh0y !jӔ7' GNPɩ`>vH4y* ~TE$$z5ワDŽ h`ǂBF;&̼?|'r7 K^XZտ̵D_όbB1* .!\ËҞ*J~\.%0ܮ%.7Iw [粒x#^>9usZ]Yy>f=f8I7% WO)yN'87̗2{; &IDKˊ@T~f񂡺,#ʶPm ^!^m1TƊqvUxYڷ}2$ y)BU[eNEu)Yfb $L[72-usm}hb;>(~9#yMUp4. nF8?k>/}jcl G_8oyԜX h?!D ϑpaC$Du*lABM0bwE+[/^^c6U4e$M$El^~ctl.j'ɠrQmqB[]<#73c;Xq%h4tat蘻T\Op_E)ݠZ"XULkDJ[-tA2).AVA:ZBK_ӘF4GҰK3$Vpl\sE8xL#OL3FBϭ|G{]>DcJƠ볧.>AߑgbO֐v_i`x<ϓu+;fIBJN4A#`os]t*5uV(<ږ'N}E(M(i,jg5s2҇4W bDBiTPqɢ$HCOb 0dOTB.iuR:|/"jو4cYQP~2iHlK{Ea7vΩ+ Tv@r9Q@ mǔu 2 bd lNF4PJVzaPO3$SB0N.d hmn|C=(&.Q#a. T iw6QKN*}S90oM3DaM|;#֗I[fw J y| •0" YƧN'h Q ]k a÷< ZmV!fFƇ![jmSp1S f u  *|M=Ǎ;(xEaT2.̺bp5eۈt[-x6m]~w5YBZ^׾C?9s .kߖ&J zB-߬rb;uè 5]ޛƌr`RESg<04xyT;ܲp= *+3vCcY$ iQDv FR+^ć;z=3!NѐWrF{xW2ΓS+䚘e hjT2%<`yӀ!7Qv49^I ?u%pbIi:S~ h;9Dj |65't $9fӬOfx t! 0|3 J'K/́ݞHC$㼽X^zbY!5e'I/ #Mdnv {MlFtTۃdf)5y89M̸|ѭ=_ٟ lWzsH뒱:,2KgBD1o..~ 6İm[ {mcۄJğ#ؕ(tV{d!Xu GwHH$ ǖPqgAa>8RT_y>mwxi=A5x9wi;U…d}Q'* Ȩ(x)Yp;nhr`/ 9Zkwc,>və$~ .+QD >*э0-NM {HX&U*fŞ |P\gT%/iRls Ѳ`/s`x?n0Z $ԀH.@ڰIȦg6/|2HfrsR`h?_ BSHVbYIQgl?*}=s>*?@mr`-?*wk bs]xNcP5ObRl Z P0iԆԞu.wi}HF \ 9umO9ESj/k`ue&T2{-*$,k;,B͸KuoxV#3a` l1^ZBTTwi ˣ̚4SHLq{щX`:iwPa:uKyOCu.ʆ^1OSS W6%YS*8I&f\D31މ:U (<{D[ Q6MwLSTM`|T5aN ||[ $2)Ȭ:gdl!֥ [MQ! @nӴǿq1J3,He)1z=@3?CdWVJf7Ȅ#e#p7)m4є@Sqح˖_Ne"R4ZpKm ,K?:F*EeOl+eK1sPK}WRLSi})VAW$E#[an%-ͥR`2$:;\MGG$]\LXaBbM |Z ;TZ#¬@%{hYiO/G&~-XvQh#N7Ib/qBzoE.mԢ_wt.Ao! M.%ܺEd:kQGGtS227|qe,FuO8k@q3,J9tlwJ*zkx{::(X\6T1*&cOgDM`k=dmmW>'IkVCoyMYa-muX n9;hhTq)*;I4d-N(,r[bbj7vd%w2ؤf%ڊT~wMBM"M`朇ْX$xfNsh6.E_4eП%Pvܣݐ|d~U!w~xeo294c|Sr)]n! 9f|<8>DFfAģn= @cYEL>;-R&'2 <]>"zS^F߉qgi+~ ԅJ|F;7,n#i}AȅU"ZN2o.[t\W=+S 턋;3&$T#n^V_Vn^<0nLz-x7DPS0yćr^iء =^2Z,ץ ٨C֔j.y}謢HMRr&Zjt[X00fNp\"B49WhQ/AM.Qr\ ^"!XUkJ@B+:kNK@V`'&v˯էZFboxCȨ~.Վb9zv"? !OFΊ>c1 O(gk=6lxǷ|A- Kݛ@,#il;\E7V={#3L!v/s7^^Rb?x$H3g/ 6!+,ИQG?]Cp1Ïܿд;w]ʪq73zd9v֎=+(-In-X*N%him<Ng B^Q\~9O|:_^4wEV.4r*J3rw hEFY}v&)s *uN*%b.xzL͸ɞ0>ԂIܾxN'ԬzHsFr\x}pnHP6r*(cMhƇj} מS^V=Rg"RοzBv侪]X!9p!7^r]z+u-rEsTwP%XRRg)2kƼת+͠Ձo2 ZԺJ &Df0/=kV4@-κKhATQ1=ј.;tsti!%tyL :u8ĕk:\H ̈́Y: n3oxN{Ww=Pb"|#jA9"p ZST)M!zcl-CE)&s+~MPM pne@:d AmZ{/GEF 94a%Q89ne+M@Ma"kR -qjGğT4v]l)Q;$-}?ΘJ 0\↨ VTJ9ٕRH!I?,an{6s+x^wDr6| kȦ2p & 05 aqpLFRl֥ A yh6[ YR&q%wviXIW*"td%EXnd)Kzĺqš3xI1Ë27c|aq܃VTԄuڪuA4 Go/#D>Qp/Pc%e@p5Fq$=l9M-0p@AӠN@})^Ӧ;F_Q&)zFt9Q?+gVr2ļbfL 8 [&Y;@jIWDegtJI;}/alf'k / Զ%%f]ħgÙ&1a|.mxvT|H7~݀geGygK\CNABvpОS @X/ 7t֯^- li@b~&`ұR7O_0,#I/U:E?aVW?ɽWYW|@@An('yJeqsO@zT@=5x}axt#DMO^ݢFvu MT!n.5[*6ZlnX€$&HCvVm`,amD+O>dД\Fg]u Fڲ_Fq mʣQ(f'tbP% aA* L{PH\dprm <wtuz^b?8 m+!qvD-uf(r哔ynlRF=G%N C!*7< GU]ɷI17,>.Zڻ &8/.O*o7J^]b:g)aCj~4ق^ꉗ?oLv\_ /0՚>\ ogj!yAL_~яN72%B!gI! ,!m;aG̘z71S#" v\Y)qOK;̣xٙ5nUUq5Xm{'F[~G"ox÷  )_lu6;2'D'JVZ֬ůK3Jܠ!g .UP PNεW*:&y6ܙ"7#T!&`[ޗ1i]G#Qn9k2z n}Q5-Ex/CxC6ob+Nav ?*wd늺tQ;5 )tdnaT&fdx(fKރA cOZQIFn+@!66EqT$A# N+q2l7rhU[ŕўTr'Z43i#N2lIPz;3UɏK? E]90\m^ )pfp^rҁHj3x / KOJI+/BUr:X3)CU|C>tNr{. ζYe "A0,-8$z^3FiJ?]oܷm}Y]#kiLW0, Phs4@Dve.C] 5n{Q d4ѩd!L9l0i!!$-KPN`qh\kLyo9Fy:jediZr5qbsr%Aqx,zXZx@<4p4 氯B1^Ger]Vb䖄2c]""0cw$8IAGXHde!WuC%Ξs(d& ve`w#,Z5>X]NЄ  wJ+Q3R%4 U6\GxZM(*O۽ nZ`+*Zw%b))6SBYʼn,c+/l!)!w,ײHIAxH_i3~mD0Td~o:ZV3Iɯp`#& 1nCT =EF]W^bIQBoMiL\9UHx99\nb d1\?=<aG&JL C<1%B:9`!Bry⋚@ 繐P; F qДw_X!l[֢x4T#OܺAE,\a/*I!Y:U%|8 .-}>]uleQyg|ݍȠ?_&:M[ނ3c96~r\syP߆NkcswgֻrxZNicA#P֌AXPQdM;b,>4]s5 xw?wG멶rJ.D9@ ;ۼEyϵ7_|lhAdz{e0nkE%ϩjY59.I2ǔ 3,MND'voxj%]w͊it VTDM­65V @-ͺ &#o 8|:9H )L8Kae:[&io ZHMH=xGN04| #U(< :R[~TUa-̊ѓJ2AD㢿*'΄q(}Ϊְy]$&xDRJ,藛ulx,E Hph:W8lCdn~-0G[orR*vr osbXۑx6yו^١if`xz;'FVaU_4Ӣ[ITS&x39)i޷F/)Z?B^(ulE#+Jg&Q58_+>) 27S{T׉,`b>@ HMBWS$^¥7a|-Liiہ ʍ/Ly uJ۲,)¤ÔX+_ !cF6@" ymp,bK>d#.KV[YmiѰƴ@&l[*hYK͆sDX9_3av T{+X}PYm:-$bѨZX!14ipSPIu]l`txdؼGc,>F˼8dd!4uXC b!EM\[, "/G_*j bYH.eU}2=Tc'c؃-GiP^J@!/A>pѽ'r,:0M|YimS)n}}М&Y6C\eyF{JEmi4'}T*ܘ!y9G 2U1QB )uÙҘɬܴbդ} v"GkEqj}ɦpSBlPf WH#Cû/_j$[? ]sX _^kvbZoX>+fs|/@P1ܜ4f#Z(su]ׯŚQAv̗0 ;MߗSBc2MRM$QslL)Ԉ!=fe)7 := Sn~s<c#M!Imy<.4{B~\ I^FLms:My[=Yռm&_M 1C9(sp)cB.٭K(%{)')D*Ȑh}5X;5: č{]G;jl鹴4a;rIz{ʭÛF1AFH;kxֆ9>[oW8ovى8XG )6YJ"cBϲ jd<°+5Z z]:hA|'r\OP:]8!SE#/(-)uȠ~tM&Y9uT22z CNjU[o*-Bi,Ɲ8|9!H}|| W9@&~[Ŧ/j@cX\?|:d9F357ƲO7;CN2UP ?̶%-X$k&sg+ʺ9`(Kd!rO'(zW{uXP@ =Ʀ SFC0"]aHB MRY}7ʝB<0>y${ 8%dA~N@'2(=>Nc# |g[dwdw=-bJnWi*#W1﫝~N[(4N1 դ`ږ!]ALe[Z>0n's@[ﲃ=3@vYHiJD(D5o)Wh P'y4glYee@"iDb2ˣ\03e*AGxՄB&cJ S'W^CzmRyME5ߔ-Opˠ):Q 06!;~]9Db́&h*kA#^9[;Cs jHxf~z!s AW1+L5dNV;yhEOm*P:>w ^zW#j7޵|{{,2$T̤Z#astf1#Hv5=6УJ+iKeZȖ2_94D#>ncG*g8.BRHʗ׿İ]浕U:PO3@";6cx/>&'yުIR\hoݦ 艪tFvj-I,Poߟ  4N)S!~[Jypq܂rĬ Vpșa0)pLfZ'Ks OS;hZ;'boXc4Cʾ>PQi7u`+!\SHll~ SP.mTjSe$'7 a.kl[M, ƶ(a U\Sv5];)jCҫ=l^ ||e4VN޼'wpy<0Eq>Zmcχ3%F*3GG^?EByR8 :qXwoAέQ)fzoX`9w3WHM6BhUL,߽NJ9z[?H!!( v.+[hw^Iҳ=ȑ>$j.`?d2::zx6zaUTBů\)ӁDGV2a@5; A@g^18Ⱦ|}x![9*1c}oϽKKY qG4o{Qz,",CUjIoCK7ڧ,U09R {b!s^6Ml,CW}7Ftv:֛^׊g;"A*gi\,u=,k&Fv%;,,-Ԃj '!q|cx$#&R`jUwRmDNy ?`mCj"}s Ϫ$#,=rІcߺTvWM \XP!$ߕٔxkHzyݏlXDxD{sv丁Jld(Ӧcݰh]D!A I X, {gGcRb 9^kV}8CJ*氇f6{?<Y܂ q␂0aX'0nzN F!%B7iqCBF2hэrbz_ړ_L3BQ︝?_ Sx N썴.CMTD3.Y1/J䝫Ð93*HgmBMQ*^K"GE+c4SRw>nuL5|,+8mS9F%#IC#h֨MȁAl10=.iMrbPDwl~ $%ȃ7mÔ zeMz3ꃗ=SS'fB /ƒ%b;wκ}wyӏ$_lADAVSA2#?zվH`KpB #-G {f^wj#:⁎Z]N^AÓB(ٛ J;+S8O1'zMqH=K@Wځ@됺?"_.ݔ҄U䞋;qŴ/Oϯ2f]uD(d`8r#t8B\*ЎH8~P $qZad; :AW1_fʑ-.c"V/k7WA&.j.esW3ltE:lS20j=:ߡ0#*S&/r-6^G _Em^7٤z!Q!PX!؈ 8Ц,ѼQ,mUbkG.M9 3ZEEZo/焪\97cZ7fRM÷{:A6kEgIըCVtҼRoCVGw/" zi <( QSCp;tEfM0( wXd+.ZVg%[{rL :cܺ@-ȔSKny5tLU=SsqRTXތ$I}n*B*e o谮n2ømNJ mڑo!a;^ܤ± :жҊڍsu<ɶi]iD엠tsi #N+@{WYath*NY;d2h&--}bg<A;̯=ܒoЯ@h$g *`5L*?j0ѶH^S!־NEWn<%0C>{)5Q2jDk@ygXt}%L HcXWU΋^&NHuuZiWr1=/'l]9YVH7WFzhGX2.*C/ƐAgmui'Kb}M C*Ltvkvl٥+e=%5fAymn26Yێu%qL@iQpȭt\ #\ﺒU3&gb՜݊c5ͯafqƤXl*9z RҥOAߣUΜ58IVPpּMU??^, !ނOДK&[DO.5"Vboрٍcd;PU[ 5ͅ&q愓>ꢅyWkz؜jxU?hXL=QG8oָ@LBuu>w9пȧ2:69VHZ")<-H&m^PeR&53Gn k5*0X_4L'^}iU2:lZ_s;.ϔY^t`XajjlԷ̀cfpvfYdP/)CI4"VTCYz1c+gM|:Z\\?l$H8>L{x &mԵЊHax mܞ3.)!^Xԝչhq  &D UiS&Nj9 [,l?$.Cc`ܷwIR1dc=z]P)}n] 9\$Mx9n _t^m`}2G;.a^9z%+~ᇈZ>>|s"XRܵ%2+ ;-JK0υojyx ~[LQPn߂^J#n;9BȘh-`ZklƖr_W=&Z-K ,璵/x˾ncƣ2X*E@Ӽ,s#XϾEu- -c[; +7Y T[G'D[.> o2'QD P!m/,M Xp߰hGnUT5JJz8 6}ԃX*O`#II/>?oLD/u)d`8&mZ0{ItiZwҲCVA<6PCZF~95foi6C'%Rŏ~7Nb0XF3EGF4B"$] $b4k b() @#ry{y:$;8K eĜKDSv8ƜsU:'oEp?k.\LWcw쿼tF6b L%Mt0g; DDr@+u?Q"|0a'B!+"5Q0l'^V6tr -ޓ*Y zU,M]+7ۂ}D?S،J3Q@')eԯi0M1 J݉ LVzbiUeÇff!a:%E}(T.BX Q="oF8˜^"ot1T4/[;jTȫV;JU`(便M2v8dV'|riWz*ͪJ ыPWH jM`}v+wti}AIҟF؎FTŤ'C(Ka+cSoG5M1Ewy5wi9U _sjC@ʫ];!OnXffxC#h*^ yiN.@Z&CVgi]yNTa<4h\GmqҰ qkUfzqkB_74Υ[CT/pT+xw8O&p&w8ƆZh}F..%CZ+kcbet'{zA⇢6929,H-cd⚆*4=wz]򌿳I$@+C|LþX0+Z>2/>JA_5bHn!ՅˋI }MziWP_@+Xg>t0Qj)JIt'jyc4yq(Ph̜J!5VQ0E͸/bӄ?c~yսZMSe49N:[ jbigkit-2.1/examples/ccitt8.jbg0000664000307500030750000003543712315071063015153 0ustar mgk25mgk25 Hs 쉮R.";?nf}.iMH`֠Qy 'X8 ޙXNƱb8qpM6h#zEz2} /I=s_yȿslEߨ4Ϋ#Оzśh@q ٲ`СJB6{.FdHfǟoATpjFc^jNoj@lFԝӆ53tڰNSo ˪~mHAd<h0<~=Q^##) a؎OZێgy7P0}x3/s)Uβ1PLbtM"懻_(ݘ)M7j˖B^E@`a|V]>u_Xh&%֒ѿY]TK| kub"/m\NкE 8<ӑL gJj03~)PZ>_ p1xb9;k3?׬Z- (8#vcS/.Y,&E(:%otMk`vm]ObOJUYJm٪~N %A*Y$oCWߡ y\"X ??  ?&.BR(ԭ!8.; o2kW և&`-~7Pr8QW)V"#SSA/>o\a*g-3'e"<h'b@M`KQȹDZ<\!Uٛn$^{U`lA\guț[&˓ ;VrXqG-V貧/daOoƄGYv`! `oI# Bc@-"'b&BWVCǾ`=6PVL%TX.\R9 vXxgkkf3ӀQQNߌgU_<5\MFD˗ԇSg/K6F5&GVѵMZ6nT%)1sߖ+a\ڤXFǾfn@[+Ep~UEÖ n0lkPoi>L5Wۃ8q¾|{== %{(x_9',ݳ{S:3w _QQOtЏ Ǎ0 mt ٗsYSX{â"K8BPݧɺugү Z8EϞv(`ڧQ)v(;=h I=|Ia*BDC"kI/>{З:ޅIi95Ow? vj25!#?smjos11 yK1=naD0GLP:fgÈR888;~Rߛr!mbڐ0H6`=@:$RTgJ݌f8."k }M2M&$jp}PC!t:=ݜھEL7NGOoI%;%íj &)JoX\tS,ԿG=2 eծcdHOjܜJ,C jBvO޼h4O .k>`QiTvU3{k[?x4B~P!mѼiӔ!I =ciy8|؂g˵ʭV` $tzwQG]❋uD|UGm mJLirhʲ%=.1|M oiS>1ݡ}7naccaK(ZȺomI M(ά:eH(/V*[ ^)*o o')pUWY8#܎8d_G/J ЌdeR.q^pGji']tRkgl ̈6q). ;'%8 B,7uEyt )2o'~DZYE׵)wIn9ХGjE<: (@Xo<)VhmdnՀ*$wTe υ8DĒ;yr[FC\#+Aه :<5qm;F,WwZOtL]:~74 ޾קh+sZdMvnUnpwu#z-#i-ފOE4 gehhNi|̢B;/cyp !Q#8f|CU,9:fk!rD5̥ ;&K޿4g@7v;ٍRZ!>ɟWi[g};V\s# s"լ6Q2jײdHMT>BB֎ۊ6,6Av2F|ۛ=ÿ|+6[4.;=;!&o[u2l|\iGkDkwf$Aii$u*Sa"/( N/oQޮ ODA'j"TF # J{A --#V`b)9L촂"/tCV]Oq ^T: z9FSB7g:=$㫹 Jzr&ZJNKyqpnP[;DgDd`ܛѓP k) CPp */idr_&VX9r3/E kX^g<`ё '-*q\8k{F$sJ9͕XO v) ogWJ`Fp2yi0vSZ)5!>h@| :<~oU%n51X(Wȅe U`N0*}Ǻj.*K@`XWy}_d:@8w\$xhaæf 8~I` ,Eģd0#n!V8۠zs/:Hooxaϱ`s J=׵Vnt=#~DoFE 3%jduQ>Yy黴9Ѐ{ E@/61؀[:=4}uTkl>Bf;FӯksdС2v+1PPJ6+QM z`*a܁:0S!FnZ_Z޳zg8YUI:Β_eOᑝ3M 3-cܳ2G>?(Rp#BxryжZmΌ" s֖)|sG+3 `0}Γd9%_H!ش13h$npDs|g*Dtqr[c|i2;vY)欄6zm@B{g#{ld]gZŞx D,r˩v,3-<1.yP]h̤5@x0$1 n;Ke.1P|*,)rqo87,'[yݳ_$ خM9^6rH )K|Rh~2E̟ 'nUpJXMP8VT|U s*ߧ5^#@TmPAQz(v.>RSJs`0c/<Ӫ.:RTu+iOCQ?3S,\ `Ժf2{ybW[r:gkL֬AhQŜ T%TE*܈7CVYlKţY7X4,l91^LmB8X^%3uӑ0yM}0|!(遀~RG-;Ԩd8IL|8" 5fVL` VOL/iE>[©jmLxDLbQA^f/C.Կ,/_X*v岃i jfҍbӦ>w 1a*CB(BGo1smJuCWcH.b>X5l'O0S_bG[+*qe6ꅟSCOV0o; I%yfeRƦ /&^b6 cf鍨U k7~Cv%Gyz" j> %Jp[B}LAx@8 NAH\gwb.dzѲ t=yPihXOٝp?a[^qD@_*ȒTݽ\;zY(R@od5ӐGd=G3;?O4>v#v؝ a(Rw$M,nItSbQ8o3 e,A3$YEcXuL[˼pw 2?NaPQL4gd^xOianr1w*Gn.lM:%L &*icJQgEIc0ow_$2ĵ6!ā3Vf=N95˺6.,XHbt,Q澑f.(7I{D7>ꙨM 2x@VJL`Ѯk9*P`laQMՏ޿38#2~\{S_\ čt+1!{Wɲ0:#6a!>ޅ5})SKX@J^>|noiHan™@wo:kId?2+bVaĈc +U:PVӡ {*]L! "*QCDn E`#u2"عLz~[̿bOhȚ7ΤloB53u 85b#Ωdwo'2rQRLt[LL4ΔcV?ؕӴqB9*q*Œ>F29y9:~2Q?r7IχD j;&"̯.j >LXcܤeWwߒ,hDc5XŢ/Me2Zu{K\ZZqz#>&uL4bEwMYQB4LŮEna3u[Rx{.;OBzB=ݩN,[[Y`o6renyW1/?hL6P`V/&-RjVad8};!ru@g(nmLN~rrr]er FuB Y24UYBwZ.ׯ WӭKև־jHlr>e@`\;A' ~;ȹ5^w3X3Y<RCr{m5*ۄ+tYцѯnIViLMA (Ȑ/iԉq٨^K[TUP zGp&HtΈ!ʊ:ܝ]o̦!UϘ-܄=Z^0Os?wiy_^ٔ|4fkr l㟛 G,SԼ8zid r w  *c!b  TpUD 8'&¤|rf#\B֥O*]&9@d3θIrErJqw.ڶg\T{ J/xϣ5vlȍi1r%.qNR9kh 눽>M1bxNTP@dr3([hgje^=8s{]P,&!:X0lyEE<{ӂE ziu]s9&| oiZL|?ɨi&Th&B5TKwzPL-B%å oU<#S:<-bzwBj85J u`1k|U|m f̎3l@IjJҮ^Ow^YsӍ=]FHԱC`a[q\rk 6ZOHfNVċuxF(-6dt?u}o^kUxSdkW0k݊2"|M&;!>N,{Bמdȇm+aa5Y_@P]QRPD~hPO@RKjv[~4z#ZRUs#&^n /nY`<*K'r)>tYY(mLL2[;wf2P.O5~*),:9YoIIkc"@Hg"#s0lȀ5Apx6 ;Jk8_Ѝ !90;#D64˥jӨv<8Ǎra5U<(jkܭx8u q0]uξ y¥GYP@ad>$ LALF9> _pɌuH 9V/ l ==6tmTZQH1 0UynG'kmlj(C[Փu2F2y*釽89?jvPH;U 뾺a I?P8|:^qADFoVjexWd;],>PrT,LVE,Bpi/Wk_@Bg@3'^(P^{/QȻ&,i%oHkʾ:^pH 4㒪,}nsht5ݵL(W${D_:}uOBbQm@Ea v a &-q)hu]~A5Y,n~*.e: LciR''n7Ð@.ںcU21jjXB1ԛL,*A%H1{U@ZUQhkI!}S:YѦ6Q "tR,6AYZ*N -B+>Y̪͒F)vK*8=h˃%%==Iڡnel:`Ht 1-֙hRݵzboq%eJ_?eȷISDYWMfGAdlp`xIr6j,*֨3cX{G&MSsώ)VtVݒApk%+LZUr7j=t C·F(7jRL/a~0(š\^V\/-7OdƁC:F\9 1t75B6ϭ63fM 𾏄[gCt -{.ᇽIvEꛂ3Q{h!bNNTc!*ahW2#;f:v?$@(ф@tCQ澛E9ܼAC׃owUҹ~2x>UGФXp|6uHUG~5Ss*>ZXU2OI5@ £EtS$j.ACK,ZTؽč@gahj6y)1xŹSY8]vȅ^u ?EK2dYXFvGGi4G% I&lj3 Q 59TGeu2>@S<yyWNyY2\Gg]?*I=E8]MYǨAaaq+Zq#LT/tHSQh( sىID[)UA^ѿZ;QVviCT޽M)&l`諐V?½O^wZ.w9LR0lC =RN[=#3}d/fBS%fNS4x E2E $WsG?XO5*/d,rv~|[4yBH8___IԜ9 Ed`$$+UY6/s\WnA`XtcD?ޤsi.c<5us _k;#w5՘uUPW~^_f&%}f)-_ޡvlzk1nQZ{UɵFᾎ$&W 0CsMc!m| 'ȑcD˘˓xYV*R U~%Ct eo6Q|vCkv~`+?T1p4bn˚E-'#s}")K}6oabxѾHUdWDsRĵW6 u'W.+ɼG ||D"c6ӭZ>Y*Uf__9D|:7aPmbFRDJ9ӬazQ='|>>Fc~ܒϷu1AL>(Hryy'&o8T_j?o2ų^50;'nP{DPFE`:]GZSKr"CqkTngkj]bI_UIu66"yGmϝ#f,Cvl,b{Nc(l̑%'FJh]!|p`7J-JQ:FJa/KTwͫWO1!c}um5j2$[8$`_XN%_UiEɜǴܱтC :ML${TWPx# \7F u{ ]I0Ot9% )/?ܠcXW&]M+Y\4AKE0G7 ;fEzl-/PqQoWZz*'T"lTp}uT7} שpXMM8':h+T(,NXF#IIPĭhZ!Bƽ d?q ``8nG.KkWLyTaZw4V LodAY.AHHll4;-gAy% @en[wnZKAmO׍ /_{z0LeA,b`bw]lMn"•~!VRjYktAg!XnXu=)9[@On *@kgjj- ~]S?+,y&E;*tC*c9)*:}Sݍ[(:3#}*tM{~ _c>dwY>`7&cA΍[޴p*=1}h.]wvdŁ||iV.VgE$DU˗2)SY*v-udS@ *uvĵY;Pwݲzr~ZC^ȺìƖ)=|Y]b3Ze|8CXv!{3Z'*DlD9R[Th?[T]$: @ Iݷ_?Bv9U"|$cײm׀;b/ţ{~9jyEG*WG*m1|!䷨q+/ދs.oUn1SNa}G"JԠj 2`CNࠈDR󡣡JϜ&,v#]B>$Ui|L4@ɳ+\) Z+0f~ooԅ\ }ٚC;B7BՔ ƬʩÆjbigkit-2.1/examples/jbgtests.m0000664000307500030750000000040312315071063015255 0ustar mgk25mgk25% MATLAB code to generate test files that exercise a JBIG codec width = 1200; img = []; for y=1:650; mx = ceil(y / 5); line = uint8(repmat(round(rand(1,mx)),1,ceil(width/mx))) == 1; img = [img ; line(1:width)]; end imwrite(img, 'mx.png', 'PNG'); jbigkit-2.1/examples/multi.pgm0000664000307500030750000000006412315071063015114 0ustar mgk25mgk25P5 2 2 4294967295 abcdABCD9876WXYZjbigkit-2.1/examples/mx.jbg0000664000307500030750000022213712315071063014374 0ustar mgk25mgk25 x1>QpbaaUmya/cJ!blQ*<6hNAHPi.րCVS70ݬe3)_e$< b}xv™>{&Pv=&ƗYpQX(,Cs!9rr9G9bQX(,Cs!9-ڡ6Mu~%h46׳JD18$ ۨ兇yO!+bˇ$C^4V=Kq@]f*Rߤ:_xT- 1@件<{G *l|h9xC'( -P;#[~'}J}QɖFyv)Vz?K =utª۲4`F1_~ ;ɖ)ZpQP;q%i`K:GuQ QQ!TDT/cGzQeDh~^TGz֨@fRdqW7 Рќ< V/of0;XsxQ_ِG|60<HpO4ZQgsC2aKQ[/=t(^\ve? (KjY~P W}N A4sOEC?|A7  XxWsp>~P\4W*5Ѳ5{G()3TڴbܑwB14sdx#_P؂kuqNR{=h?-NΧī}u\|:<~*P kr\VRoQ .H~Tĵe֐l\(Cj #-O _ [њ0,H(~)*♌LQVL?Q/eXoJI Йsm ~45ԡh~_p;h|8:,QL/ mjLWGAe8쥁P:^q&۳%s]7]*K0{ėxBN[] u5*Y5\eijqC! X'93]և~c4 $>gA$G0& )[A uRBޙcF֩oDTj>`So}"& y6WǍ7:Ƅj `ol;%u9Bʾo} Mf/ ,/xz,b( NQ֣ Ug+I:,! YDi>/4G8a=>OH k7ڭԠF@~> ALK+BH'4B6ަGp)!:\nc2K1*77Swb=³jZI88D^;bDySvoFkeFۍޞz~wzU{-?a2)x}R˵&߅PrD`sOFOqW"$)} bkW%( Y̭/zI%+[5z &ߵmR ㊨N\e꾛F'^@8?zoL_y6okU Cw_o$_n" Dh2V`Kf3*'Z"DzU(=3OH](2G+-쟝BROx@yL5JvI"e<˖H8T7^t|-SH&-d#YoT(D*((1fT'&$dgm <7c/xLGc1r'MBF2'o$[Z3P^Fj;aT_n>c ˛S'KYV8CpQTp۪:<#.`8J_k\ %O$?B.G z_$Y%v[+ sD@m(蝮)ӂ h!jPC7#|8oEI,f5b? }nM|Pjo_ոqUIH`,8'ׇ M[ NE*D;&@8U9&ze*^{}ƚkG! Sh<ƾJْQuvVyw ܱW6.XGsIBeuIxܓ39$4"Yo r t8wo*+pd+ė$>)4]z07KZ3LCH9@6$e=*@)s xZfBnh%8Оf :rg' 0UBV)@ԦG8]oQd~l,2KM`Dy2rj\^}@Io )CEK>/ FsckwBp  r9?I>#6k)`DKFE,mj YM/eMҵ}_'% QG靯 )k 3U'*ncg}0.h!ҧx~[[bx;+76ki^w6aR,gIjuq=(G6:lHf9dGm򌈣k{ämA~8u*&_ dُ} "7꓈ {0 (Yu1qQG)C9h0Gn 2.t4LTj{jsP}[GrE'Rw`dr̸~S2?^,7U!NR JT[)F}s@_gUBց$;ekĸn%"7|gz*םO"% ֩,{ x)0s أEp- Gn*/Lj l HOC 34<@+ ['I w-sFp 'X 4MSսgt`zɪ)kʼbZ =4{mi1S".g97cBT [nG.'˅췚䇂x](4bq:XYEn%xH:B;cL ohc$}XPmQgcq< s¹uk=hG}b^֓>GW }2!U;Z)j7X{;恈(Z)z?=n eDR)קiiuPE{<o1 nxLx ?e .ӆƖLce_{5wĽ(BM4&gnMF!-#M$brHmTMPm4X dQ(݋j[/*\~>j) 76ǽMh<Ϛ,0pT"Dc9koxq%b[`HmJvϘ0'?J:4tD rg3cV)q4Sa7Z"r-ޮ`B/ꛃ$^{qȔc^9%[r0SV>^p;eoc/SS ڜz 7Mm㓴 ˉ韦[pſ=y[D4I^cx?uP0!MpjN@uA|$"`{X.q\U!61wױWģAu?l"R R> 0#=KgBN0aw[u 7lk !Z: /=)D!8['㫤i׆PW`VDةiC["vx!v Nf[PÝ$ t˵,j0j ES:nn-qj| |N'VZ%/Z[83XJMOj틗OјDRFtx_ʅ\;G@H$xWlPߓN aDQנA!٧s0#95p 2I{/tGd+"FA;B!ˎ.\9 %Sr+lᝡ֌^4$rڌ{=E{rٝT_ p#X{;[NhxZ/yaY>> X{q& sv9W/):Ɯueˑ GՍ"KHa؄Dwfm!T'9͋8K33x~U )tfӼA D ia-/9k>R[D?m9qQo'î1븗z N@Bu:T΄F 'y!gCmgOӨkD m%T;~,y1(pbg6TCa -c}mz%ki@tKES|Hl1̅]D("" {c[cC^!PjY ԏ3+M &ʱc:赁4@ǝή ֥T[NLÉ "P>pk!_">P.ˆΈyjzAk|J9$- v UK|'E&Ϛ"t^ =k\n/8)1>h ~f5bF J{EBbbtə^ z)xCᑦT6VON=|sHJ]vd7Z3 :ʎQ sV~^1pP/"Ƹ|~LEE% 9c0_X4A^@XY׬j2ܘ6I_ǔYԱŏi)C駬'")O(&3=xr켴:Ϛ P2=/fXhD0O,"r V$|]pE(t~FD4\CC(O(8SwPMq}rn?ڪ)+Nf0ǬEK[G\ioYO>)]ך7M?@Z؞ɓW6]8xXĤ[yIߒ<0L4r5"oZqz lYfK7Z4|}вZ_: jN'F{Q,/܎$EȀH)&' G@:@o~DʵŇ{0bW==j5i2o(ZReB_)߫{ R'bR^krTUoDFs{Mt@pi6@LRu>6r)zgϯ9dO"uU=OTJG)`F*i8. fqwi mі:]>OKVe(wAA%_*•1EE0n3MZk7.%#_7dJGMv`^k~l #%TNi^a`Y*\ 83,ۖ9 Wv{;@q itdY*vAetI'{bnxniCi@+SK6b9Kë=4џRѴhQ$~m# h?wFqn㊩kĈW", ~BHNM n*PFd-;-5֤(:@K>DA%h'Lơо7ne)I cX(9RqჳVw*FW+ˌ( çUK+]|ut?_F U[,J.;@z}=bRDP K8= v%P$?^ll3@ ҏDZ8ڎPfUS;%0)>unW$: efU|ୣHS,,Y0K=Ewk]NDC·<KJ7AN,^0Wt,f炭e 5؊:*qv"Q _545:qU7k{;7|/ :=F=](P5PACo}-R$0rlf~;e= j<`wjb6_%(Bv8F} ؑq۵F0_FV#|^ (8ha`@d3PVzMOT[K@axʜhDD>YJ߲.<&% JoOzl K2%ϙ#Jژ*58='WTJh1Q\D}l@h:/cci$-+1C0TJJA@B`?nnP҉;μR_ H3w^NccCZpQPu١j w)v.M2FK*XzR tVr𬼁JݧP͜$^n;ّ}oeqr{m;iDw[pB7$ !nKd#Q\.)A?`wyji\ǩr!O qAZ`HiyHF"Ow2c-Be]^e 'ͩo-G68Ĩ@{VQ  \%Ζ^ Lb;($89[>*qԘnP/Hv)1jF([)t+ .<@cW3gdt^ӓk_5YgF&1r BhqXR'6.fHn/!T7$ ߣCETɇh (b b7BƢF:ZpQ)p֘ʚn}?9 \dtb-H}^gHjI37=Ȣ /rz˗F)*ht;6"z2 jG=uqĀ>|aSB ~:`-"-dozc2tIԥ)=(s2Z9QMCNph˛3~~HBy*3EHz;…ɩPX /L2<p_u1%]n;btd#0$:,7y*v`IFݳ3h~^#͊Ɖ. 妠K-sLn Z`11(E&<:8cmr^8R"t]QR !=!}z!8;`e*mK3 aLMpd;kV\N5&ٺwՠ_WIuΖ#ƪRzl7Y2t2Պ&~5>gIoO5J} vW@z 7w\ԋ{ ?ݟpgU(QNXv bg$#:VHtk|G}Tq(d@ u%=ݘ|3+xsݤ=VZZ>sZfYr/fjbJSAjL³K!si_ޝv4bw9yDs8-WDZ> `8:(}v5^)|E#@+4 _&[7A<^6lDž5$Lr-z".;yg5MTqۧ(5䫲^dM)"ۊv$q/bXOfI3bE7e8Gڌõ: eѠ*[ YcϑexQ}O Xqҽt`cK=i< <'C:,JVGneӳi=3o>PJyӜF)TZw< 1G=.]vD$dO^\-7I'䃩9=װ _(!03ޔ8D$@_.P1-vv?Iִ´!@72EoD#621%Խy 9ht(Sx@T X?ɔb$ ԀpRVQAp%z h߱9eK2w7@`yI> -NcݘO;~ͷKP 7}r6`*^;O΄wG!,  T2U aX7:Ѐp]Zf@_0?I5 mBBegW/{7/).k FH̒M! Mo_tǧhp9~LH^04HHJClqoxH0fKcsJ*7țjY/8Na[FpukN=FmlvhUR&nT(, K-, =r2qKR:#U\[= 3[=R,L@f5&)P7i/Yči/ȧW>yHoPmNhUR ?⠎<I $0eF[Ul 5Ht evˠV:-8׃NP9#Q[T.,pz>?{ug ec]bG3w>8x(f<3YLT@;s`Kc 6Ҵs9W1X3zkv>v:G^E^= (jFH12)8ʽ.J EvR{R\_,dސn1[nIhm2DwAtN[b8~-uOgH]ij* as΁,Xq,ns'9oˆu!owC6P7kB{j9?/hDӹE:zϲW;#7<^!m-ɧ*A{~pGִ1)usq33q(DK/DҒeP N %VT\gৃC3JY! !n>*p#A-||dxo=-Bcѧ=<$G]lWLǡi('At6-5,>fK*@O\Si 8BvNJ|^1XI`۴-IX-j٧Y쑻*I,]zk[fvr f|#cF&IiCnBh)6vtFJ܋Nl4 ('p(E] "g[c^n)-$I̅hf6gN̟ǘ}~7+(Nekx6yA( <66R6Il KQɭ-2_.QVčdkrcO9#iu)`LS[Fe =cox( 'o՝$>uSe;+B(`Ȗ*,kWD:pKV<6Cڥ5M@pbl*=oe/us䁜\4,[{~ }f>w:G '#-^V"ȋO/3ؼD"ۗGs[BtM&0]׃BgJ ڝ_6'LO'dP.K@nOw/gd RRk:xd >Qv!h˰9h)d/Il$r7. `&`f$ zEc#&á!<6_X,+ 1YcxT,b g۝GLo+K1XTOW^V 9倐8 C*&L?<ݠ h'q#:doz$(6ւ<]CGzXKT܊d Y^n<)??O^zqm ā^}SG+HhyPVsЅD3 Qi_C0 Jyk!:K8R!%=<4'~tov8mgƊvGO5o\t[ܶ0ͼ[V{>~Pt,Tm kAPmea$6Gۘp˸?52d o+l'O2Kbe#Egk9Oz圗N<1=04h[YG]`EaW17ZɱD _2.pF9d$U_q8M wu:^ FߎpsANkT:ht,BHGK`:K*} ,yfddCK&xOj1ɒ;2}fXwJw1@c+&wmO>8H <>+Bm)u7RB2*ٔEwZjB_`siʺ;٧eF6ȘiEj2Lyhy9/X-J}]V%@hY бVywɂ`dw.cXݲP+ba4 Wثc fX߱;wXu3uq S3mG-;w_$G5e[&O (v[vh'naEbRR&tTULSL|$V##w퉀kZUJcHU\p뿲 ՒЂb18&qU0I5GK% u'Җb,M ~a qOwJHÖIa$E~G;mg~-{hI;ص`Wti* +(#fyPoTcq"< t!SO]Q~5:wNqIwNHU?p{0 !ǜ f%Zf\N \j ˶5 j_E#D+we" :7Wm+۠,Rv`#@Am|z+@VH!_*msXWiA"W<{el 'p|yNjƺNn:'p@#{5 ίQH`%Text^3:%)Ϲ6d"SV3ǩ?FZٞHcs[#M۳0p+ Nr>'OO+x Fy8 t! mٴ~.鱫31B6bjt3IYY0=ƛ$>g߸FHt܀ieK07ࡀ}D},s"-w_Oވ[5mZ)EݢIFxh" g ݕğRA͊k⸞-HAXjfBB>ϣ'x0.@o~- /oY&B. eHL tίC;6mr>+ᷱa'HrPQCuW40 o20Irq0 }!&vxgX*;ktS.9 .΋.˜WwF=1\l`NqW(1e!}5O9O!ST(Osvt6NҾXz{+dՓ~44Ӣ}m?-wN&_)OxU.Ɖz;QQQډ ;ƕWMg3PsQ,ade_i7`dj 96#X7/dxm]{ U|PSjI_^V*JtgWw3b]2$O|P}IbM;yBV5}3p":a:Q@ zC;(f?HrCX9\R0;13UǂnF)"pa}[R5@iVk8REY^-a%N9T=}]嘖^JN"wcEq}c@Dtcɒ]veǠfp!<ʭ㈊ADs1asWGJQh[ϵ v}*eIɭA-vNQ ;?@=iI|CNde81)s|`2?[ʮ Á3:Щ(OR9c)nn}1bJh8TO& Ad$TP ڒ;t.aD4U֗H + 4(WɾB)"I{[_=1h0LpSZf8;4񀅬ofUFGv#*% X|z3=;kX?lJV}pvDX1-  fʚGQ}70l:w45==h٥K=_ϹH~+ex}e'_\Ȣ]X#2iP ёKyuBٱHVc!jU -wPǏJ]ՏLStˆУA6.Fٸ(% 4\djpl vI{dHveȯLKE(( ͢ }l[IO6ܨudMpgmsgs+!D1PWn_bZJSLpnFZ$rCi:2:S~2zNKM?{WE˺hǭg_ͻMPZŏc|~xVD,47PAB`nfCюd0r$uR5$> ו: {^sBÈu!|3^z)++N85AY+xmЮ͵BK >k=7򰟬3߿@Opg Cr0qˢW~c)eY5>~ϋ2DTS; PBR{9^X QX <|1 >f +!Lӽ k&ܩL\ѫJF=/۰ٌ硖淎p8  ڛwV:W~VH O4H`FSe-붝oLP>{i*{?07cuؾۍ.cVi߯UDb22$:m|%{-N$^.k&#`Ek4]%[C;nGǗs,񜵢qL)Bǹ?;hazb}jyzLwaV F J2a[Ip5+~\$G.Ek݂kMRJ /Ѣ'xCגcZl; hƈ.u.  uZ)畊U1.g*S.|_Z/NsW u&+e.@t@a`N./`Q_`g#_K+ V jv@DdQ%UG] r/yp/6q<郳?',-/X8$NNH6m r3㳵JeKFf*N쟷 SB: &(=_n0P͝oW^֛h2jdc$8@c&PW8 v B?r tN[u;TndB+3I]G #5O,@eu>+3ނBQ ":_d/B=KN8gÄl3.vt=!@ܗx?ʕYQQT+8D$Lm4禜d{9 =s jiѲEY%'!W8XzG_(!†U4վHňv\?8 ^5͓Enn3QKUHv jdw_ho֣1rFb)̤ 4G8ӱlH&h$R|^@=Ҿ15^J gN0ȋ \/ DF1hbOvMb/s72d3M2]LR5-9ƾ}5c*EXs12{ n%JU~ʔiD'Pfg3&FOw[}*[ 5]#+"]9 "\ xBvvU]O5;4a$klou]cA# `y? Wta,N *A.7'U-)q-N@ԟԨ?!Y~._!ɤ7􌬐҅Fq@u=w/`Q"Ϩ2Lꨐ 1ݽ3SmHNm XX"Z1:{;Ź#~ϗ?u}Lsr2OFu6hP@ek>\FȨ2:bDKCL2cUA{FD'dX 4q3K!t215uQ+xQvެg!RP 0WǢ5r>φT1la,rĴgC0rMyrs[)Y31956`>@9ڋ\4zwd7_BFN ڂFyRhe"tN^dYrť3P_HB_7< ;V.dHCzT@LUU58;'s6 9w {z&’ 7K&O~8P|63; `B%uZAX(|8Œ ^Ր0*%v6*$ =m+Z'l$%)YwՒu\eT7Va{MKYJ~$Ycoiʅ-oNҦQI?ڗdmЕlޗ{,ou5ǕdDQKP^Y[^k=/z^S2u#,pFfJ =8QV!,?i̓X&|Qu@ױoϨ đSP:%a!x&belsL'6޺M+K??$R/,S*X_\}?$,YT+ڲͽ$ snh)nHo{ FV2[Bp.h$ѓFNE9UiW|'*R/Rf]h[MكJ| E%,6^{MaeP:SZ@G%"!NHg!Ogpg$rK.R9B={x_fnP Qp Y4KKIbq+FbÄwCMtu|HVHjeci2MmYQhU')KmQdAf0`րen 'l,(<p=[}=œ-)o3,qڕ[ҁ mEp~e>4( ;$ǀ7sumqJb8eޤq(JCO4|/B/$>%_(CV@f^ĴZRWV[JH:Î w . i Nj44i9|DIj zf̎\4+%PsaGvL:TݶRMk8[R[b#&?pUZz=8AE]*3VVSy,D;qXen`#`'c)tOt JPQ)h=a 7h|X/oqcL3`JЗex`康EYb *{{1A_mc U9+C9kz 7ƹap NF1#m{8!C`Wȱ ?DzOX;j[nFYճ$#UrKi?GDˈ617v'/v73T 6j(x6mlMu]`doQ2Y0:ݟJ]uM'+D/t1Ȥ+c:Ev=Z)NPa!-cơDXY#]+q‹uU gkOW-ꏾk9mx)=7 U1[nV)EcރJpTkz,XzzE?8,OP>KdfR}Rag*Ncu.!]Nl z>@ c֋D >s'yEMb@Uڱ1P ny/o?RNFBY߶VI؈7k-ymbIʴru .U4U`{2A~"Zk^I$s5YRo] F֑-˽VVH'۷ۆ0ۉO)ꢁa϶fn 8dw:41);{-i싟 \_nfCL 8#>5҃k|Q=6Gr 6Nikӆ:{Ϸ W]oHB&I ~.1/ m[0^IdTxH(*Ҫs1h=7hܽ%Pׅ0rt,ybc_ٯ@ m}hgЉhHSm1*HuvIv/iS2ObPbt_,vJL 8:`FI >, _Q)~ g8a5XM?1InΌ՟[?6  j0NbpB\ɓɮ r>g\0t}ja(fg<ߤ ~kqv626%a h(^S*M&f`<0}ǧ ~?c9;.L 5= @2 /Yˬl37c%f[4m(G){Kk; ^qо3lkuqq樂0 2rrd/}_3$9nJ:)Eϕ~[6ޅq.TCRͿ;?'^XCp˼%+[Z.dQ_y eq峮I݌~H &ק'> 2 kC߇\i!@@څyz uDn΄]mr(Ed7 .Da">ER@[7"NS׀XbEJ/u|0uR*UVK|zPҖ:PQ{ tl"* )TsVBF1ӻ7Hd 43̀.ө#s+.<sGz}^+o/\\udܠr2Mߡ$*䎓;%JC̓.3>eBz{<)E>hHvTMaPcbbk nQ1_,3ɠ'&͒Mb]C,{bm,*pbx M ZF;q'GE}?짂 3B#`C\`TLA[r2;٨`{E{\Oz(cqJgkpmOxCpU4-%iXͲT M[N̂<(fŠw8mM/wu[;euOSvހlbjl,l$(,4b7>[SOc&u EN"=/JAa@4vݚYm/{[өa;ϸmmJcЧ1>̹,RaI4|L$Tcժt [$K%BЌ%$t)"{EE3=d .7ձ,↼z}I }TOpR<)=X?ڛͫ91 F|o[ ?V[FQAX0Tb\LrÜAwoC=DZ B!nx]yVã*SÔ (Apk )t)wn6%% fPV6Bw(Q@@Uέ0ݥ0ߎ%2( nGJYMv#~,\wCp*('p႖qlv`#/F@nJ5@PμH"3!ƺQs]ӈ 86R> pXG:a] SP59=Dg)4f' r^@a]mJ sh=7@b)b@ϳX0ƖJ'"nϞRbmFk 'v;?F`LL L|3bn=bӝnՌzwҌqB;rS'u-Go*@ F/w.{gl&d] BL:.}x L:"@Um0(Ydž~HiM4@-k҆G\щ(X!x>j|ܺkYa|hLoB4#L>e,Cyu#UI#^a|cIW!  !_),450~0Y,ťIq WԎ"lyNG}~BZG" >\|kGe.tJaov,o k?1GnduqVDJ{0ZG'-?Spl=S8^z-Ϝs-H!~š".R7P'~ug{uƗ2^kSiJIwbYqǎ$.!lE":Stl)DٿP%bC]F@Ku+ zSbo=2pZɆBgU-( wV\ݥ{龪ˣVu~AnsaiP}":8VlV`۞㊬ "v bam_"RΉ:(~.BO}^y=JyEkdk]/g7ͷ_uVYe^40%k=Ώ 9M{/ kX0 aJ+ KedܩmXǴ:ȋoWP%lg><VJAzs8~  BX5uDzxzN4X)m?̧`?}CW5caY%Z3}{ơfy+u`l;#; _@wԴ6|ٔZ-3٫{nd?>I5+'~GdV!%Oʟ|ׁ8-R(5A(AĤ=.(iywjo9nn%fթcƊe\٤/OnSf[+\ VH.WVvf $ԯ@Hk, CBKu͖}{3Fz:{lVy A%@"4 Vtэ3ܲ/f7Gp[v/Wά*NQƎIK<A=ᾅ[/3ZZAyĢ 2J[JM-qcά*i,+mW Ak;3]MÓ%1U2Ni1_෍n-fkvpSIAES܆=(!yn>V8ee磡ܢ4' $]M: E8 Hš҄87?؄l0w3O|F,/5]ъ`( ؘ} UAr<܊=5x|ӹޟ=<o{ьY\!\gZ挟̫"ՃV#'y,KU9ڎv?5..,:yl_ߗ "@E#a2!bVZyjf] S)q,yP!܍/ONтDq9[ȡg!y5v;| 箉 b+V/ ҨNN)~Qi'!u2+F8:'RZVLwӢ3f޶.O*UqkAsBci.GpW;Es*a\J(A߄%9.6+#^qv):Iu@-_B]W\(;MKL3 8,ǖ]E|5i*kDceIt0\S)EtOW8xc0Ce_ޘVi{f*E4K'X-6PqY9+QxDll#]E0!sh(Q×QYC`l/S~Z ̞޴ ̰K~/- f,\hO]q Uz& %۬ʸ8$}XlOeR_` ݀Ex2?{76Vs6Q#l|ٷ6ƙ 8H gIϊ??Ϣ2u?2Pe&+OFR>;kN' -@1ZOAQ)J?khi!a SO7gGhSjstwW J ).#%nAguiyE$Ú )t깹'R{mr`TO7 &0Ω[н!T!W e Ëtq?yo{>l'_mO5}`H?; rjB5үVݦ?b~9}6~,/Xr<{sW'T ,3{OZ"dG`Bf.!r;Qoxئ%t_4_1QBZ`H,D2S )?&'`4aMgF`PZ `Ul8iq6{*@}pڴ.,ZPhԠ$!H<Qf'C:Ef.:`9-/'t[Rd;"&4szrIEj[DŽq5?'to|1´5'6MzgvYl CC\j 3g>Y rn 'P&t9*&=ʂyGk>q'͒r+鲼M&};/}E ĜUkp#6 1!tpTr-4yoRPcC$ t3 6]ۣDUZ5q?}MMkYSLbn69S| ׽WZFrfqCVB&X62y}B>uΈi)z/(^ZCU ?396[ܵaLiϣt3͝9(~CfX'*!0zӦWHRbH<lu_iC;&IѹTdkΥf`3e#0އH7 Ü%Âfa`䍉Ba(~ܧdSG' ]@*+yuT^2}pq/PfrmI1!KN9Ѻ8OYx=\VCuZ,5ߒSlO:̿pNr[7`c&ӱGQr Q@}^4+ZxFMt"9v4* `'8Lz!O Nk#iG^ vfr3oAԩ|A74-tTwm@i(3VJLۿ— Yx7,8$TfyQz.F}9hlְDWpsnHuKJ6 !"idO@H͇v`1jL_nB(LC@xYs&%v*ߐlpYI Tc/DVe=A 8TyP_D9lp8&/,e$YX=:}~z1ap9k*@Hk.p)J:X i;pvU'XeF4`v4 r`4> .҉}r}.@eNj"6N:g3a=|(1z\GE@_ jeE7(6!y$9e1P^.t9DZfDknyGlN}-ۤrLO.`}m5D9J1  }ߞ@K+_M9NDF"0#R~oM;;~"[mDZ NgiIdŠ/;kPr]C31F=)8̀," 0)H4 JE@/[ebbXחܒxUC>${˔o|Jm`04(8T$ 3AMKllJN`ß\nJ;݃@q楔\"Q H4XqPZ@>auրEԁ&ӥE?x~~GɱYN6^>̑bZtmĚp4< \I2T;˺Wm}ѭ1sI1ۤǻ5{PpҎrJ@X ߜ"wB~q,Ma)mXYHor`y@Q}вҧB C5K1EnӚPtI MB~UI{- zS] ,v?O{ö8kNθ 7fR᠈IB!sJS,nS5mswFjNe4aWJZxf|o}s ÔV&/6Iwk@{!7r^BuR$pпݝms2"J!0VS]V9'QeC vkdѠ AR_{q.0Pcu/#$c~g!Jg >$rX,@%0GȒMY,Icԁ#V cӭ _Rm?,Pm^gtI0sZK@/` >`Z^JM".wcGB_5g4[>x @Ecv}&npE5CjSthTؐhP$gA%sM?wvU8X67C8թad!O͘`>/e[.(p(Zz&=Ct"M'.^~d`16W'܈f>U/sk`\Yh:4I/@I:0tn,yD=]W (8>[or`H(qpnM@p/2[b c=: Dn2߯ĴP :+x͙x.Z ]pb#Pʲlmlŏ+Q]I\ TDM޲CwѰ#p"] i %F)IpAk#T>WJKRo  4Ö ^ cQ;:< mwUj-w\D)avR {3̺SHW8[:JR߸zoYaK!|^Z{fF1.; |f,OAs*{D]֑{"WaVPCX>J7ëT!HJL?TFbr]|YWbgC\`o`=zPpeOns7rm-OjCo+C̻FDkYW0[f=1Xi`Q`⫩WŃژ|;=31ԫs)Sb+$9M7eT*y\vb@;>tigK.He֪W&~2p7>vkeY7[3:8wFkZBp'7!RYܘ$0kU781ۻ9*:"s[MW2\ 9&桼H y-~"-d,h@FPw}0ogv:3+ wp$wB1t WJŋ8J_ZM53C'-SsX-^3` BM=V IȸF>ɱ_Xe$q3fL C< *&"&H]\N7j ܁YۿBxcn)J0H6x޶ƺހ238\Pk _GC}/p,m]qVG7gպ<_ǜ?̂UY XId0+mYHN8yfatP⿰ )Ltkǹ]y3pO|0OJX,̨0jF5y?.Zt6XjҊJPءuɡ+J1-XIBKXh^EYAm0;'z!.OISJ<>]fohe T]?hVŞ'K4#a;4,pVPHJM!.P#,Q::L [DF%*>j[p2̶P,8t%HY;!/ īw [@ mh$X6ĐJE]yam`XfHj<)lݑ' bJۦZ@ \B 5=q\ F*Gb 6մ*ԑ<>75'2h|OI<4vDׯ?EFR,Jˡ(dEy1ʵ|X5ݭ2B&h3*Y(iCoX+ &6!X':T8Nx;A7G9-XΊweۂEd) CPg5= rZm*2.qadjZ~>I =>CK6fCkI9[kiK~ @j6<dNIui5Q<|S]JR-[279~۩3}O!?n{yvODITC& ]k2åOD6.ɍ8@ZNa֍Ry{1Z5dn'&QUb1Gff\>o,n@Yd6et!=XѨz @+_[`ڗmC?ͩ-<,lnW1voc}o)4':)t+ -`*}"J]<>zT^gjoHzL %T N>wM1)C k``R|YY"f 5!TZgkQ)& ߧ-"hj)OL<&Ni!SPdw1pde̅3 E$*_TR%H$1׬a &MEBQml=E}p([iYu GEUBIJəŅ)ii,MQs! ["xsy83H.{h$JcC%$ {׭H2R'\:ڌ{Ez/>! PegR_)*k%){I@OjL ²ŽA۠oŨPILkqr7@P6PA\jNu$i,G z3&|Zh#\z#xJ1 [Qpozh+ioVʻ`SkjDInz5/t VffSJ(Fe%7lz~? dȑA (8lřtnMe/!lK!dGvyj,e W$ %Ћ_@CKG+!CdŎJ%Uw73(!}gP96{qou{a=OZB5nI3/FoHpnϱnzH5_p"jݳvbw}|DqsHpmܨ0UW_Qx(\<,R˫ʀ'z\FURw+AɄT+}9bL-9b&ز&]q.`-7J4el97^ jȭᢠ$ › FmԞrM ss z r7i?6&{y:J n߀e[9lD%`g:AǷ%}LIZnߡ(!5_g.䛴-Z 1TG ,ٷuxvi}7o1Tgq:5lex:٘g?z \UM y&@1R ۲wN3Mzr3ڞ"q:t@;rҨ*Td`ȹɞ9‹¦`Ơ ]3_lJꞬ!cu]v3gx]!bWj3}]8<)> Z 4W;`vWM8)_ šlWB]a޽+{;w߈91ac}*%g c.'IF ^ͷ$dz?M"~V:ӳzBA#JS`h'o\Qu+ l&OfR)fZB@w',bkxڍEXb$q%0ͷ?]$ߝ d/<ө/ؚ9 (Da3`U"dunZiB@{%YZާԯxq K7mSc^ۏ=atF&/$(U1"EeZL=`BRyf"{[Bf^CF-420g0]jVCىX{N5t*yVi>`S+ #Oqk%Y۷E/6S:_O㱞R(-@dnh,V[,6CJ-6`욭&,XuTiUӽQ)@rُoc%*8@Z*YƌB+ (\-$5sSr/"hx s3)C/ꎫ=@utS+i29TG!cŞdEVe`;ŀ˹`g U8n oezNA7QԛeUL: XLNcJ!B{H!w<3e'5E[-l)=(gek DpYl>zXt>RpV`X]uX7ڕu Uo'aPoH{F8c*Gn"L:9N g 0ԘԷ8imȶyګFcDuS(Z&!_}vM6X2e3Kw%P̵U u%'|䢫&͓zGĨJ h&3plLCr &KP4ܘp rz *:HCc(*P<kRhTeqঞc]XW=E[3G G36n3/^BmofzUy.= +Dk>ޅ>ZWP5r@E0U1~"vB_qZ6KHIdDH{#1] Xd1 a&,U@ϒ))_|zz *+V)]6TL3<HС)H1y?+ZxqYDZ΂^(ȐAa71aEAmd %ġ+VlLvCg=;\Ò&TS +}^XU|rVʁ-5:f= ݰl&uyrDr~2&y-U Kwd,;s%x;gCh<*jSB}gb.)6JϿrcE0N*O5"%K\1F#4pQaZ/<yC'VH("lK_nK}Iӂ#uNvNOg+Bʻ–{3̏,ak͉ S+K~<(pt~Φ.U$թv B4_'Q@mxGpURh`w"j<5u_ O2፩?=2 "OLIn5cRna6< '̑ [D-bvr0܄M07Q/;c r9W:C)nU^c'ؒǕʟ2hB .1w +|v5)yi:38f;/ΛYt5Xv|(59 sWl0A* [`eܤ[,A_4Vv noj7kjWI ((C![!{f\btz HזMM<!ͮ }SB3:'கPXN%-iNCTF2>xڗ*i5:3,T-rIҳj.uL#gCGPR뛸s$Foί[tTVAD4 oB^܀2eA <\r D)gT D~֪ ^g|P7}"b$(WmL V­U|ß9zD12qp[E?*%=mJJH"j64g"> XBFb>E^FWvabRkC\`0k|(jnQt'R (E"d)قwRt>6\5y&DҔ ^UNYazGѬ0޿;ŠXh~Io;}IY_QY j$UF6d 6-wpsxhc<`Ľ5, D ݹ jөxzcLqnIӵACź ROUV€Tܠ^Ppr#l&ҵacT3"#Ҿ (1%@;O ǦVTBhJ]XIx߿,gD`Ⴐ!V'Mv뀚_r|pmKZ~Z8D43mYۮEߺ˄mYg{x ֹMQY8WIВJ K̀‡LJ]lnt#q#eyOv[yIFWElÅP'%1)j xzGkaH>fEDV\Y02RN)nP48Y4f|P:J r 蚉 |uխϑJ>kk;E:\ :ę87tF)}K+MV!)#(KNwH=i@r q)x}A8nX0l\tv)#mNnTf3(& p5|jޣ|MpyASsnXt(3E PPN0rV)BTL9 V6vob#0G당!e9RJ 广H`$8wug(`.|[ #iUVSޏ.nkjO}KqPJhSv]W頖,$as?#X )11|2v<qfjWQ,A0\|#[(C>;*{B>V Iv2hL !GZ$HHI!5jz־QYO{2Fɴ}BAa NN^ b5[:%_ú]ImAϨ5+̵T7rz Z75ց}'`'sa@2]' \)1ˁ@9b`g [ւ2,࿋KhPnfb7/րEMrS3`wod=^5ѭ#KW2g̭C VUFw̹r Y[j1E8}[8ɪNNjppީ7j_y^P!F rA{{ Z1?=6 #Sj^tyvVw-EvvNTv BsT;G.h4ZԞ?'On66{ӥ4i'd#Ts’$~i+ ?iUچjH{/]]S,b8 U#X=l"`ǁ>5z2M_^'F[`Ii>3n31œڲÛjX<\ػDlJPjlkh籬v +,_`~|`E -|;QMm*!a'y+BrUq5x(q*&H@[Nwg5W>{Iqvror"R;{,IzoB[^ dtGmL navAuD y|EIбqNw M` N538 )޿PV٥?+,Rj"N\\>lcAɌ#Rz|*-@d3Oh5,x"/fvM1ūM֞ٷȟP BLbHLtoV%Z"S*a)bs2_z̪HAֆi 0?QM;uAYAns?sgZM3 Éй'U%ZS<<#-Iwf01jb6|h6/ =XJz>bʼE"S\+SG mZH ɓ]a5N6,bectWA<1^q,"RA;aE3WAs^xg,Um,oL ~aRkge35D4?k1͍pb.!ha1I8([ ="KYpRCIe؊_sI +*qW w_eJ~* 1CM^!iӁ&0n0=z˞ q h- HT#C' KmP˲к@ wf%/SxA @LxT?PXzW߾iiAwg ́{n] [/>u^ -&O_F:N&P8fW5 c2|!KE0m~Wa?)3Zn):uzBp<7_J2Hkk;9=WefHeǰ#h-tغAX<\jVv#1M3F>z#2%vV5kW/N!⟎xSIYH8;\l}&&I8~CqE#EEd,}c]l._f 9pC7X^O*bo?\1di+٫B]Jw{*1`xabFFs;x_p_P5~ ॻ"ȁgc~b> Jf,)Jg6NV@oc ~&rcNKK fQw&4f\ AM𿿗fa4r'r1$oo۴$0ki{xS_xߊ)m4B.2*Ghn_-JRKlo\'Vkr*I,w*kMʖh:?ŵ( a-T5 t! tI7d!kN";C|/BWbuUBpSy ЯN'G܅-)| auSVsm^a[GqsQ w}i; tg>~;1 3$*7+C稭Ω Etb}2Y0j <us[I aLa[nc,c ~fpvLב(Cqcb?wjh?o[UK;r=H@ cK+ 8!MjE+%g%_!~?Z <`mt]EK}D3T>ZI|`<\T|* b!"AZȀr؈yE#Bt|BtGDs5?}*X=#!N=dHwuA2Jy-T8^U=Lۄr5q:+ ]`, _f=oG ifALPYAmz>x[y,i-y.ɍceD : $Gk/p޹,s]犥3eZ_>|E@z`3}7%Z)qN"HB4bUcaoQ㈦PAƙlr@g0T?$-huK7cz  ;I"nPbu;ED|͒`}4&Gll. H-R郜X,v1eT sIxݫUQDL|=7t8y,":"Yoq‰†+3K3Y;j|S(Ƶ!׺8bz!`.IޢW2K.['ec~F63ߵ6j׺bn#1_N'j̯,s (B1-:\lڣƷ5IЧbVK\\wޤ>خK}j~^&@X^@0f"JORċY8PI=hJX@ֽB/I@+udp<3*vHO4 (P Ä/,:)`e8݀t k~?qϕQ$2}x-͜! 7U}%mYu n¹$x Ȭ+a[׆J |LЉ\G^J֘D]1ԜX$8 <0Ơ-å@߯ 9sw$dkK V//wyO!ڷ_/z{LQjnVbԥL RMi$wy$ ױA W& %vI%}pm2k/owbĢwD  e o"[Ɏ:J[V@QEܯ:{-\ z*z!-_ mvJDIvGhjOKyWM\v*!I_?Bh|pwQ9Y;Xӓ.q]1+g{l9"/ aK FEҴ%zZֻh*O97wc iVc.I( Y[n,{g7'| ?RV8\Eԙh ҺKwgJ+v=.hL^;-r8 #TNDE*':uAfAS f(@i]ZS{iاCh{WEQ-3X"~_0ş*?J􅱒l ݓe7H^PG-c'XRgIw ]a )%Yv 2gTT3ǂmw3a<-srAЃ$Ҵcd4pFrRL:2/X"aQNcbPª{ oV]RZY{#H*]AS{(J)T7)>мa<[-45>!=˩(ʠNH]I5{3<5:wQquz8]PPcC6ayzS)t6t )'S`<٥ZLeli)ALP0xbbb9b2|CWգxil3pѷElJ2Ϸi5OQQZńWc -{>1Nfy}B>|aV5ĩO"K[:QFNzffHu z]qR.S\s(t ѩ .G@AB#sѭݿZME\񄹷`y[V@5]vEI9Yq^@dnY mq9:}(E;zٹ:/W\EmY zD'&Krd8Z6yï]AÍGL0M26`nͿ|EaѰĦVRW\ <S[Փ-ZZjqD{_î)~,vYF1֞UPz{@W fF ]I)'" 톏x5tW%C~  W4bx*csa|+~:*T;)䜩xnlk$7D U>tCmJz =Wa;aÑ42+\n 1oe 8Uy fQ֋5^Λ[Wƒ^ɱ46 ߸.pDmX=] 7oG/pU"QJ264`U 񇯃]{Ve'{qv)`#xH+] {5۩H!}Q8*ݒ6HQP(a(P"Go.ͤwЖ8kMwwnp8\=tsN=zlMe3Y] ^x (J؅"`{2Ǘk=$zZejD>91dthJP9ӷDF\|5ji6Lm[@cO8%Vh;<>LנLA:y&׺:bR]8]I{#B ]:wL)poCW(^F2zЕԁ۰xX,TD;b]o|l. lٱ<hSJH35ͪH٩Im%VIEG <ȳuޱ*4[]Kd!`  ε}c8mXH[)>mR8O[\ jeMg\0Gm㐦SɄRÆ~ºvmU&asQN&6 Hl DDf#od"OJ^ub8qUI#WY2ajs{0LRD,hq)"1lgǟQ_)wGv CiT%%2ieM%qt%9"d_^FSNB4yUbd:t(#R!}i~$$csОM5hw[A?UVʒdD\`"X;vuNw_&dFwٽ% ]Ɓ)piÜ!fH |0)֓WHbJ@ȕ$kw 3g&@gP7iR#rJVٮV۩t&˛ᐒwľO-j\Ui/&Ʀ@UGƝcehȔں-l(%X12|*|Qy/:Y=^Y^: @+Dx g^*KARt{V˻HSΌUF##r.s[A+aJaP[y 4OO@{=2 F,'J $Y$COf!yG{>y?- (}F6Oa瀍L\{b#`W|\{q+$k;E9@ 7𔿍xDe@ID"ֻ>[hcơm64y O C K#?1pA xgdn ^OL!~!$1{ROڦ8#ۡ]#S{gچxQ/B[1]("B_p 獍E`-6x 3"{2aEqoRmi唑 /g&b.\ *n^bX6}Rv@aKSpyˠ#q!MM' |x6%P)m}Àhբjhψ3[[FǃvZ° Xh2QXZWaY9 uNHHksk |Ѕx;6; `u~$գ?\iK&5u ہ3v PS)tquƬʑqL6Ձ✖SYhVP c׌% Q~dsU@VHte ӫG)w*> jRz9i3l\6ϜJEj$X쮌 n|)v\`x)<` `}_J0hpcP`z*X>I5m?$w 6pmd-g5/To9"h{ Ŝ6َů)8Hلں4-jb=Ѣ8r bltTIgAɪ"2T>Š0)ԊݟRbtO=| rQ!fLG9rpHs⊹g4pXҎō,-ZG$2@.$!odHu}Q~3_bokj<~? * >2`L[YѷcόA,9OYm_?)OHAd/ke߹R0;'>]Ak (F{(baP"x LPQ(oWV'CPޚB{Kr^ۅ-1B]%=HRwV{U:hˏdD<(3hg c:&i5Dn#,xvy ݚ6: EK&qt\->ԈnlЀqC537TVdWNA Dp'Mi\_N #Ѿ?mE_Wwylr.?=ESc5ki 8P2cpv]?~?UT jV5YԎX[ȣ ;_Mn "!N*v<5c,tDІRM%<&L& rk6n1oyN־]c[ƋP.7TB4p X6s-7SCZ |]WGW ݨm:覙 3As#f.'l1EWM.t))]~ ub%h"@e,[Yl++2S$)l0 XN*v}+`w#z=3&`Ѫ}x&h-+i'{՗с9u~neMNo(w 9 ;ޕiFs"HPnjҌhsB2D`FFɐk-d8 _5}P~faĊd iHED͛e˯<ռRo>num! ^(!uᦰ4&C>8G0&>v[-iFafM,o3'Xh(u| &X\_,rKʨrE'&'/|1<EhOjŊ}-P/iQD :@$ G` _%>5|qiYϔPrs0m",@[;qJ*PÊy׭=OWLju(n>wf09RŲЉI;!c=-l4(W7r GmW5k aOuշ6mt=QXXt6dxB b0,l" N@Ó 0W9LvDsbdn߈JPeY) ޶ [ۗ` +qUh+ٽX^e/ˣYCuPdle|t!ȔI1r}bnui4̜j9ᤡK̯fu2a\^/^(8d4׭ \WFD;szݚMN+`1QtQHZ._t㹜{: 6*T`2>>!J5"dTVadhURv/A.uZPPBO)X/040C/YƢ;H5ƦLHM`L]v4o^Cc(9cNrk8_utCDw= <Zmʨ|7] Gqt;tȍuꩫkGB%m\u0<}\ǼP๝ <Λ\2d2$D.0QD+h] jF*0}T~Fu-ʅG7g*` DKv1Pb(ҹq74+ڄhZ6QKGm* 'P8 n], ~woB}feFe )9Тav HX@No(4z'kPG ž\I_؊kNdDor8 6KmRW/]qsẹ)E΅tܴ~+ב5lFXБ45ژxǻ,XycChtzڿcRJ Mwѷ\=],,RA~iy* pj'%6RSӡ!=RJh8+#:+:ND-oݙX_B6@Y,5o0g.B#J!_Ta*e1 [_w"!%±?S*vzdsW‡ش :mT7]TM{]m*rC =r8ܠ=ch8ol!ۈ_+ьnE z`:PU;` 3!ٱ2Dns*Gw̽-]JF_ fXRa0:;}TNם1{6.9g7ʡQi9 XZtTnx̰Qdx^rxM2Tu۴C[X`>Cy4ףurqD (;wCxj`T-H0x@D~BL&ˋJMo]sG@6r o r\qOR/I47fiN«߰']+JSs, , @n+rȑrj=V 4?¨*C7w2eH]™B>)Mn?-W' z31'2e.V9Iмr[~Tŋ:owHBdb{}>8q5dRIS$q'u=RJTTޢ Wqf'+I%5@3ZpɈho%)ܛ˺6CF?5vb Ƹ~IX#aPgvfFҜIh8\}Qnyjy7U<4.yI'u#.gZ^C$#Y!5pO0Q+"FI4}2#63 Nx6-> _P;#Gg_"OކޚpQwbb2+(+RY+g IhaWAP>ECL#\CiY<U~Ri8uwCq#(eS%hӌn4傀LԼ8~@7-?͝EIWR}6.=1+C,9{  6n=xre9 Hq-*6 OL .׭Pzp%0RygHCk 7{eҗ)NMe?{131CRdF#(TPDfҚJi,T_FFL7Xa.M )-Lˏ|9 Pw~i=peqo?$̀|>as$0W-1лZ!0aY?tNd:͎L~r Lh Plߡ?u:*yQIZ1;oK 2m6$4}m7WF':P],71f~,I^D{9.ػtOmajW~=3[ّ1QòfT tΌ |!B\~e6(q.re3Bi۳01莫'% Qw0|L;SyጹiӸ_# 7]NxV =#!2q@H-ppnȐz6oi¤1`Ky]ܘH#sP߮-!F)ƙ¯&;!z}LgylRlFkT#;L6]x.c]mFc=^NqL~lUla6uK/y0rJN)>18]"ҳC#fo1HslWjy *JrqMȚvB~V\PA$7XlNnz7!NX TQ9$cce/ŞEXLrxB:0r6t)$pw1sjڏgR杴ψاxzHA3hyMzٝ">.~[5wqT) ÿ/z,Y}qt#`qkIdƝx߈ElUxyNm*lh2\Oɸο,ЬNUP=ף3/:BC]z2kܽ,Kܲ>܃%} O$.9/0c> E*LJ;piD[y]Ǧ0'ޑ0PJ70_2濆Jߐ+$mL <@37+n7W W7|<텭 gB5c^꟩(M#őPI+ Xf 4]EY[ѻ9HVԏ']kِF/J = )IVo`|Ԉ _OO?Y3<$KaX`gܼͤO.9ejV-k䏟sMm eÏpRA+ Kouf,GghcKad=9=q@W"Bb9_% Qp%IE3x4҉ro,ъ&+GZU(5F"!^q!x(!D'tj#h@Dw.L7ϒOc0cMĒk$(.-k-:-XB bv vY~~_[| }feci[NRX$8RtC̤\A"s douOC*uӆ( _iɊoY+:46Nq4 *FȬĵK}[&]>1i7Y Ԉ3NU{:i_{U Y ȆBonGt u0J7D3K; f(LJ2ߵ}$7+  Ehxlp'qI\ dj)>"g Iه =Ķ777<_G)QJ !E)iBU׵ERm$@i­𨎻Pdb -\'G@ @17 A@7GCWgmDE`9P+{B` j$ &`R.EF2@n%DZgkl[1 7L{jֱ[|O:=v\LGGw4u 3M[MzO7U4?&'d[NJۧע>jnx[j?kG?xVio).'*mL,w{/)-wbs|Y~30rH|5PwNE/mzHF2lGKTW*QU0$KoZ)E%ٻ᷵4+ٲt7B1 [e|V;a7aYrE7~j,aȟ$bm _T]lq["B2מ#5@<*ϐn1n2- '6\dz>G*#X'GӼqy߂CR wŸ?6rAi0V#zYErZ,51^S \D!J5z;*](NtL։u-WVow#q5M<ưhѩ,8Svi<ʯMw+Jոpژ#H<6#?(U@Ac yiv=_WLB/U V=QĆ 9_a!0G"+އ"4h}#W.=AR>9).M>SŮG\)\}ZyauR,Dv?ͿB ;dBZYԚ )f/pQ{} J)-]~ytzkGi$h tL2h Ũ2s@/~*lwA])Aڲ/|~usae>#}s'B cx|G<^*L#)8rR|) ɡ4|߲96Uk_E`Y?A0pz:Pg0 FN|bsƘAV+=fzxMx*N.+/}s$xllpVە'9,#}6qv8OcOu)bl{we-)(?~R^FC\ wR ǹNC/H(ڶv]N-ô'M7x\c&=_|j M\-~2<~B:q_܌R2b@&,>ۭڮui%ia@&*#`"2U o1d #_,{$N|UHkZj(y/b_ />'T5:;.rL7BL@3XU`joug$@5Ё𐌡S50y;|X"D5x })ˋ 9k?M(xpq}ekJm?U!HQT8ΰ,1Ÿ %Ћ,װ QԕW_BnZH; Z-t Zb4 Y*g,+5['QGXoDR4dnxSVZ]$)7񪭍P'zՑRq^P;s:ֽWYʛtdX$M6.zUP#hwsX63#@~~7iPH!Ip &48='%G [ab+TWi/9Ը1hlhzBؗ&y8P5K[1+f&3 f|a5hH,ɸ*V1aI<|q"P/11[ڳ^"ŵIYi+bfM_&ͫRL^H x~%8Yn7'{2!bvbZTs]cTW/ nB}{R$$㱞 ?qQ(WY@Tz:O 4q/#2"77YJewnUՂ>I [jW|ʋZOK≑]$"')]!,]zS3/_.k9fE!,OC ݲS"P\†&' X6RC@q:R¯[{;S|ŲXH4k*HR>ri~Ld)I՟ Bڳ7WZyqCD$ǒdap.K006އFm;!9qCuTx _ۺtb}i OG6qtZ%sKwG ^5t^9,g=e:LUef gO>M@V޼@ZBMNgC>J3uokKSoeO:`urP<}Rlg]'[r ) |aίCDY(9GyҞ=;ҍVAW3?{?$ǫb9|9^IX6K-)WKLR[ʳެ<" tЉah,8UOh"s fLrMJ5$jkR8Dsk<p<=`EQ &ƖF[cz5ȹ8-nȣ)F >CH4р_{x+ID09rt! NHnK:XGT  rw٬еY6F~S{ E Z{q- έ|Sx](0O~QrgZu\X$rD|ޭʽG$<0z _Ky ؃u_dZl\& 0u'' Mq:,Z|U"j҄(Ex<7F[>ѩdGl ns ?0m«dmKF*Df+νQn! Ȗ6lr  f2;i탰Y>E(o$rgS2t>P;g>ޔ0FxSy|}0Ab)*!Fd b3Z*-vTJΙ>gQa6UD' A t<[uܿ7N:A}gb_ uq1|7u!^eDb{sD=Y(!)&M0He𘦰Il=bO&2tmθIO"C *> +'jQ Z$!ʬtq$Yh}KBZ!@o1eD|Amu S|Tk3c*MuvL G?v{0[e~AmSGsh!zaB/pj>\bʺ/<O8__Eu8&mI&˿VJ.|=t%Aԋ\L|.w6Lm˸~ډ&ѷ` bbE{|)e@h?,rtE;ԳRDɧ{$9v}@ՓyZ7x8d*'ku?[#.zZ|1"gxՒn=38a ͖MnʎS F.W_B77nba M(Dd:/@üE* ysՆ0q}9:m N6ȇ˹pi<onHf; '*{Dp@TC)+r:CN/Nշ,S~{lB,|=ܩ(WgHgFϘ`Kf2,R<1؄АG `N}S+nX.Ş)7.ȨޢA=3Kp lOäi7IHSn+F L4_{9t7M1`M+[Tw\,CR#}8w{S ȉ -t3o;AŃ~I)s|9MBqGYaZrF<8s^3 A{ Wq J`]!-^0n0+ ~1}4+z%44\>"+YS eHPMIܷexْI9?zPuc~׀+\c5{r7T]4o䮼A׌|np;P{n?{b!3 SҕՍ9aEϸ4x:pG;CWewe"2u;㱲@}D8 g E`CNr3/NVBiJ#SЈjEй ~g  u(OjPB9T>TkrC&Ixٌ΋ϸ=4|4ˇpӻ)>"sI4F ]]=Qp)MwǛF#VSm6h2΄mq)D[Ց@KM8B'/y(FGojK=/fIu` bkU!Af,u/ ;Dţd푠fM)ZIo9CP{\wO{ų+ĺo9&!.Lq 6!'t p&dTwm`u BJ [q' U=tkHX ϜR??K V|Y%h?|q?~:.gt N&zXՈ\eI=EMV|&=DD_!xz\'(ߚuv9E|ϕ1 Gv+'clR}[QWXJF?3yJ<$EGk(EM>}JHf^f,n3Z[u!f.Kinw0XB-i|SPh? -WR˩NvR}_'kn#?Woy &E,^WV(QL'i\3&(6N7+PTzɳ߷H 92>`H#m󉎿Dp (0+?s"7OFř79tbtј.\5a 0g%<$-߾0e,n]nn{7P }EqF=woT7x;Dp,EB6ݬt `b9~H1Q JD5TK_ec\:IHRh-Q> vXVF-Y)r:&Q@"V(ԤZ^(Ղp2gM}0\NC@VL7WE}Xr'e5տ?>ߞ6ȵbporOfMLL"-3"y?@\IGSWpB&% 70cXi(JP9 B $8XT/6Ǔ$Y\s>,woh #q' L)H>?9MԜm9z ):;Aqlj ڪYJ ?W>d)~ږƠ\>JyMBC1[/gw CvpOis볓5 a܎b˼GB(~og1=BGC}?hf(~fd6uv ]`9~)9=՜C`ΤAv#VFjCm@8fc=掱$u=2Z2kl}-ݵ} 3bR,qqJmaql>{LʹV25ڿ1+%4e&YV10o rhn_8 7bc+>ޝ3EfGL{Ԅ/jrEmiExda">:$|n7̃jԼS^&h3\lv8!>+Dy^fcC<נrnRl;%un&J_ ׬[RH{}P.0jr^X=Z,R~r0u3iZL+ɨjw47͖hNa%\K$E0 UV w̗{aٌ8yB?(j2Q]$J? *!Ӧe[! cK r0qU#LeV|h-↞uNw:SOq#wϏ_㧝!:$AVY &CXPdYJq@0ѯֳ NNPIA[%$ȐkKĖ% .9* * ~ND0 mͼ;x8ml!NX>snoi=\FRz.mL?.5DrBM62|RCfսf`xƈ+H<[VlFFWLOÃdې17Hƻ~ $g rI^2MĀZ-о8 ##mc&8MwA֩i$t ak2 h\ˣD9*CYrs 5 Wh:%I9Js Sf,RXHɶDvjw tT"bbHxR(}ʛ*?Á7ƿTqm+dXйyu4bRfxKz{>W$[ۜ>W"nD8o=ap4YO_SZ3Pą X`w߹4p6^;=2Qr݂') zE=0Kl_nݝ昪> uCj!^b6ADԻEe-$jn|G6ßΪXpKV1oi֮ ,7#ȬK-[iR߻Ι5ieͭ&k%YmuGeI;kxW]b3Y#͐No$VnB*1u \v!GQ. յ,W?$jbigkit-2.1/examples/sandra.pgm0000664000307500030750000006437612315071063015252 0ustar mgk25mgk25P5 150 179 63 ???????>>?>?????>???????????>???>?????????==????>??>?>>>?>>?>==?><>>=;=>;<>>=::8759>?=:>>?>>>??>>>>>????>>>>>>???>???>?????????>?>???>??????>?>>?>>???<=><;;><<====<<;<=>>;;=>>=<=;=>==<;=>?>===8;<==<<<====<<==<==<<;><68+#%23*"'))<>9:;=<;<=>>=<<<<<<<<=<=>==<><<<<;<<====<====<==<<===<<<<====<====78==;:=<<>><<<>==;=><;=>>>=<==>;=;;=>>=<;;:>===<<<==<:;==<<<;85512& & $8<7:==<<==<<<<;===<<<<=<;:<<<<<;;<<;<<;<===<<<<<<<==<=<<======<;=;;<<==<;<>=<<=><====<==;=<;=;;;=;:98<<<;;=<<==<<<<;;<;::77863*    !;7:==;<=<;<;;;<<;<;;<;<<<;<;<<<<<;;;;<<;<<<<<<;;<<;<;;<<;<;;<;=<;=<<;<;:>=<<<=:;=;<=;;<==;<;;;=<<;9;;;:9;::<;;:;;;:<999<>90#  &4<<:;;;<<;<;;<;;;;<;<<<;;;;<;;;;;<;=<;<<;<=;;;<;;<<;;;:<;:<<;<<<<;<;;9<=<=<==<=;<<;:;<<;<;;:==<;<<;<::<;;<<;:;<;<:;==0     3<;:;::::::;<<;;;;::;<<<<;<<;;<;;:<<;;;;<<;<;;;:<;:;;9;;:<<;<=;;<><<<=;:======<=<=======<<<>?>=<;<;::;<<<<;=;;<<>6% -=>==<;;;;<<=;;;<;:<==<<<<;;<<;<;;;=<<;=<;<<<<;<<;<<<<<<=<<;==<;==<==<<<:<<<><<;<<<>=><<=<=>=<<<<;><;<;<=;<===0  6>?=<;;;;<=<<<<::;;;<<<;:;=<<;<<;<;=<=<<;==<;<<<;<<;;;;<>====:;=<<<<=<;;;=><===;9==>===::===<==;<<;;<;=<>>7      2>=<;9<<;;;<<:;<<=<;;;<;;;<<<<<;9<<=<<;<<<:<<;::<<=<;;;<===<;<<<<9;<<<:<=;<===;<:====<<=;=<;<<<;<<<:<>>*        "9>=;=<;;;<<;;;<<;<;<<<<<<<<<<<<<=<<=;;;<;;<;<;<;<==<;<<;<>=<=<=;<<<<;<=<==<=<;9:<:==<==<<:9<<9;<;==;"    3<>=<;;::<<;;<;;<;;;<<<<<;<<<<<<<;<<<;;;<<;;:;<;:;<<<=;:=<9===<<=:<;<<;=<<<<==<<:<=<=<<<=<;;:;<>?2     +<=;<;;;;<;<;;<<<;;;;<<;;<;<;<;<:<<<;;;;<;::;<;;;<::==:;<;=<<;;<;<;<>;===:;=<=<<=;;==;<=<=<<==?,         "=><::;;<;<<;;;<;;;:<;;==:<<<<;;;<;9:;;;:;:;<<<;=9:<==<=;<>>=;<==<9<==:;<<=====;8:==<=<<<<=><       <==;:;;::;:;:<<;;;<;;;<<<;;<;=<;;:::;;:;9:<<;:;<<<;=><:::<<<>=><:<<=<::;<;<:<>;:==;<<:;<><    8==;;::::;;:;;;;;::;9:<<;:;;=<;:::::;;<9:<<<;;;;<9;=;<=;=:;55:=<<:=>=<<<;<9:==;<=:;;;<<=;387:;<;;<<=<==<<;<=;;<;;=<<<          :=:::9:;:99;<<::;:;9:;<=<;:;=<;;:;;:;97<<;::<<<;9;<<<;<<=;><;<<<><:;<<=<=<<=<<;;9;><           6<9:<;;::9;;<:9<;<::<;;:=;=;;<;::<::::<<:;<<=<<:;;<<;;;=;;<<<;;;:98<;:;<;:;<<:;:==    9<::;;:::;;;;:<;;:8;;<:=<<9;;;::=<:;;:<:<;9<<<<<<<;<;<;;<;<:;<;:99<:9:;;;:;<;<<=#          ;<:::::;;:::99;;:7::::;<;:;:;::<;:9::;9<<;;;=<;==<<;=;<=<<;<;<<<<<=<<<<<;:;<>>(         !><:;;;;;;;;;;:;;:;:::;<;9;;;;:<;:;;;;:<;=<;<;<==<<:<=<<=<:<;<<;;<<<;<;<;;99=9       .><;;;;;;;:;;:;;;;;:;9:;9;<;<;<<;;<<<;<<8:<<;;:::<;9<;;;=<<;<<<:;<;;<;<<:;==       ;><;;<;;;:::8::;;;:<::;;<;:<;;<<<=<<;<<:9:;=<;;<<<;<:99<<;:;;;:;<;<<;;;;=>+          #>=<:<;;;::;:<::;;:;;:<;;;8;<<=;;<<<;<;=<;;;;<=<;<<<==<;;;<<;<<;;=;;;;9;>9        /><8<<;;:;;;<:;<;;;;::;;<:;;<<;<=<<<<;;<;<;9;<;;<:<==;:;;<;<<;;;;;;;:9<>        >=:<<:;::;;;<;;<;;;;;<;;;<<<<:;<<<<<<=;;:<<;;;;<79;=<;<;<<<=;<;<:;;:9=6      1=;<;;<;:;;:<;:;;;;;<<:;<=:;=;;<<<;<<:8<:;<;:;<;989<<;<;=;;<<;9:;<;<=="      ==:;;;9:;<;;<;;;;;;;;;;;<:;<<;<<<;<<=;;;<;:;==;;;;<;;;9=;;:;;;;;;9;>2        3>::<;;;;;;;;;;;;;;;:;<;<:;<<<<<<;:;;<<;<<::<<<;<;;<;:9;<;:;;;;<:9=>      ><<;;;;;:;;:<;;<;:;:<<;;9:;<=<;<;;:;;<;<<;::<<;<;:<;;;:;::;;99;9;>-        8><:;:;<:<;:;<;<<<;:;;;;:;:<=;<;;<;<;<:;;;;:<;:<<;;;9:;;::;98::;==          $><:;:::7;<:9:99<=<;;;;:;;;;<<<<<<;;;;::9:;;<;:;;;;;<::<;:;;;;9;>.           :>;<:;948<;:;9:<<;:;;<;;<;;<<<=<<<;;:;;:;<;;;;;;<;:<;79<9::;:;:>        ,>;<;<;:9;;<<::<<<<;;<:;;;<<;:;<;<;;;<;;;;;<<;;;<<:<<:9;<;:<<<=4         :=<;<;<;<<<<;;;;<<<<<:;;<<<<;:=;<;::<::;;:;;:;9:;;<:;;;;;::<;=#        +=<;<;;<<<<;;;;;;<<;<;;<<<<<;:=<<;:9:;:9;;;;;<98::<;<<<8;<861"           =<;:;;<;;=;;;;<;;<:<<<;;<=;;<==<::;9;<9::::;;:;<;;<<8651("        7=:;:;:;:;<<:;;:;<;<;<;9;=<<<==<99;9:<;::<<;;;;;<:60( !          &>:9;:;;;;;<;;<;:;;;:;;;;<;;;;<;:9::8:<;89:;::;;:4)" !!!       ><:::<;;;:;;:<;::;;::;<;;;;==<;;::;7:;99:;;96896+""!!           ;<;9;<:;;<;:8:;;;;;;;;<;::;;;;;<;:;::;6:=<;4134,#!! !! "       /=;67=;<;;;;;;<<<<<;<;<;;::;<<;:;;:::::972+,.*&"!           >=::<;<;;:;;:<;;<<;<;;<<<<<<<<;::::::90,*$%$! !          ;>;;;=;;::<=;<;:;<;<;;<<=<<<;=::;::;:0()%"" !"          .><;9<<;;;;<<=<;<<;<<;<<<;<<<<9:;::<1#! !!! !            >=;::;;:;<;;<;:;<;;<;;;;9;;<:79<<<4%! !! !              7=<;::;:;::<<<;;;99;:;;;:<<<9<<;7,!  "     !!!   ,<<;;9::;99<;;;;;;;;:<<::;<;:;:.%!      #$$#$(&!    %8<;;9:;;:;;;:;;;<<;<=<;;:<<;6, !! !       $),+)(%%$%  ;<;:;::;9:<<;<<;<<<<;<<;;;=;$ "  '---/,*++)%""  9:<:<<;;::<<<<;<<;<<;<=<<=<;!"      "&)+.---,..+)&"  5:<9:;;<;:<<<;;<;;;<;<;;:;;:!!    !!####$$$""#$%$')((+-.-,,,,*)'$  .<::;;;;;9<<<<<<:<<;;;<;;<:;!!      "#$#%%&%%%&&&'(*)*++,+,,*)))(#    ,;:;;::::8;;::;;:;<;;;;;;=<< !     ""#$$%&&&&'('')))**+,,++*(('$!  ":9:::99:<;;::<;;9;;<<<;<;<< !  !""##$%&%%''%')*(***)+*)*)''%&# !#999;:;;;;;<<;;;::::;:;;<:;;      "$##%%$%$%%&&'(())**()**%&'%&$" " 4:8<::;::98;<<;<<;;<::;<;;<      ""##$%$$%&&%''()*)(()'**(&&&%%$"!!   /=8<::;;:;:;=;9<=;;=;;;;=<;     !"!$$$$$%&%&%'''&'&'&((&#&&%%%%%"!     ';7;;::::<;<<<9<=:<=;==<=<:   !""!"#"$%#$%%#&'&$%&&&''%%('&'&&%$"     ::;:;<;<<<;:<<;;:<=;==<=;;  !#"""$#"$$##%$%%%%&&(&'(&''%%$'%#"     9;<;;<;<<<;;;=<;<=;:=<;;:<   !##$$%##&%%#%%%%&%%&(''))('&'%&%$"     /=;;:<;;<<;:9==:<=;;;<<<<<   !!""$##$%$$$%&''&&&%%((()*)'&'%%%#"     +:9=;:;<<=<<:<<;<<;<;<<<==   "#""$##$&$$%%$%%%%&'&&')('(&&&&#$$#     ):9;;:;<;<<<;<<;<=;;<;;<==      !"#$#$$%$%&&%%$&%%%%&'''(()(&&&&$%""      ;:::;:;<:9:9<<:9<;:=<<<<< "!#"$#%%&&'&%%&&%%&&&((())*)'&&$%$""    4=:::;:<;<;8;<;:;;8:<<<<<  "$#$$$%&&%'&%&%'%%'((()**))('&%&$#!      /:;::;9<;;<;;::;:<;;::<<<   """"%%%&&&'&%$%&%$'((()))()('((&&&#     (8<;:::;<;::<:;<;;:<:8=;<   !""#$&&%%%'&'%$&%&%&'())((()(())('($    9;;::;:;;;::<<<<;:<<9=<<   ! ##$$%&%$(%&%&%$&%%%()''))(((('*)'"     2;:;;:;;;::9:<;=<:<;9<<<   !"#$$$$$%$$$%%$%$$%&''')(&())'%#!    /<:9:;::;;:;9;<=<;<<9;<;   !"#"$$$$#$#$$#$$%%&&&&(&%%&%     $<<;;;::;:8::9<;;;<<;;;;   " "###$##"$##"####$$%%%     7:89;99;:;:;:;:<;;;<<;;   !#" "##""!"!##"#      4;9:<:7:;;;:::9;;<<;<;<     " !"!! ! !        .=;:;;8:;:;;:::9;;<<;:<    "#"! !         ";;::;;;;:;<:8;:;;;:;;<    !""$#!  (       9<;:;;<<:;;<:;:;;;;:;;    "$%$"        8;<:;;<;9:<:;=;;;<;9<<       #&&'&%  $       9:<;:;<:::<:8<;:<;;:;<   %- !$(*)($#""#        1:;;;;=;<<;;9;;;;<;;<<   "!"&*,,(&%"!!!     +;;<;;;;<<;:<<;;;;:;;=  "$!$&,,*(&$#$%%!     -;<<;<<;;<<:;;;;<<;;:=    ! $'+++('&%&&$"      )8<<;;<<:<;;;;;;;;<;;< !  "!" ! !$(),+'&)'''&##$&"!"$    $7<<::;<;<;;;;;;<;<;<< !##"""!!!"##$##"#'*+)(''(()(&&%&'&&($       4=<<<;<:;;::<;;<;;<<< !#$&%%##"#$%%&$""&+*)'''())))**()''("       2<<<<;;::<;;;<;;;;<<;  #%&%%$%%%&'%%%!"&*++'%''((())**)))(#       #3<<;<<;;;;;;:;<<<<<<<  ##$'%%$&%&&'%#!$'(++(&('(()))*+)++*%      $4;;9;;;:::;;;;<<:<;<<  !"$&%&%%%(('$#!  %'(+)'%&&))(**+++,-,*      #4:;:;;;;;:<;;;;:;;;=<   #$&&&%&)*&$"$%(*+(&&())))*+*+,,+)     $0:;;:::;::;;<<<;<;;<;  "#%&''''(#"!"$(*+)(&('((()*)*,,,*     $-9;;;;;;;:;;;<<<;<:::  "$%%'('&%!"&(+*)'(((())**)),.+'     ,0;=;;;;;<;;;<<;:9=;;; !###&''&%"!&)+)(&''((*))*()*,+)     $1:<::;;;;<;;;:;:8;;;;    !!""%&%%#!!%)+)(%$%$%%(((%)(('(     #1:<;:;;:;<;;<;;;;;;;;   "#$%$#!! %)*)'&%$#%$%&'$'''''   )&3::;:;;;:;;;<<==;9;;;   """$$##!"%(**(&&$$%%""#$%%&&$     &*7:::::;;:::;<<<<;9:<;   !"!%#""#! #'&,,*&'$$#%$ #!!$'$       "+899;:::;<;<<<=<<<::<;  !!#"#!  #'),.+'&$$$#$!"""#%    089:;;::9<<<::;;:<<;;; !"!"" $(*,.+)%$$%$&"! "     28:9<;;;:;:;;;::;<<;;;   !!$'')**($#%$$&%"!   !179:::;<<<;;;<;:;;;;;;    ##!&''"!"!#(&&$!    $1:::;:;<<;::;;<;::;;;;   ""!('''&#      5::;<<;<<:::;;<;:;:<<;    &)$'(%$!     !:89;;;<<;;;:;;<;;;8;<:   "%%%%&%%&%%#"        &989:;;<;;;;:::;;;;::;:      ##&$$%''$%&"$"     .:89;;;;;;;:::<;;:::;;<      !%&%&$$&''&%#"#!     /98::;;;;;:;;;;;;;::;;;   #!"&%$%$&&&%%"""    489:;;;;;;:;;;;<;;;;;;;  !""!!#%%%'&('&%!      39999;;;<;;;;<:;;:;;;;;  !! #%#"""#(+)(&''#      28;99::;;<;;;;;;;;;<<;;     !&&'%%''"     3:;99;;;;;:::;;;;:;;<<;     ! ""      7;:::;;;;<;;;;;;;;;;;<;       #"$!    3;99:;:::;<<;;;;;;;;;<;  #  """!"%#!   1:89:;;::;;;:;;::;;;;;;    "! %*(%""!$"    6989;::;::;;:;<;:;;;:;;   #   $$"'**)"!!!""  /;87::;:;;;;;;<;:;<;;;;    !""  !"""!   %898:;;;;;;;;:;:;;<;<<<    !###!   #28:;;<;;<<<<;;;;<=<<<;  !#$%$"  *.5:;<;;<;<<<<<;;<=<<<<    "#$#&$!   (466;<:;=;<=<;<<;<====;   !$$%$%&$  )3847;;<<:;<;:;<;<=<<=<   !#$#$$'&%&&&'&&'%%%#  !(777588:<<<;;<<<<<==<<<   "$%&('))***)((''&$#  %&299998:<<<<<<<==<<<<<<    !#%'()**+,-**+)%&%!    **:9999;;:;=<<<<<;<<<==   "$%&'&(+,,+**)&$" ),2=99;;;;<===<<<<=<;<=    !#$%%%()))*(('#%    !#'6;::<;;:<;<<<===<<;;   !""""$%&''&&$"!   &.&'299:;;::;;<=<<=<<===    !%&$%$"  '$43149:::<=<<;<<;;<==<<=  !"!"!  %37:7789;:;;<<<<;<<=<<<<=     (09;999:;;:<<;<<<===<<<=<    ""$.18::;:;;;;<<<<;<=<==<<<=      $'627;99;::<<;<=<:<<====<<=     .34<;8:;:<<;;<<;<;=<<===;         65====;<<<=<<<<<<<<<<<<<       !   $#"0;><=<;<<<<<<<;<<<<<           !1#1:<<;<;;<<<<<;<<<;<            %(#"$(<<;<;;<;;<<;;;<<<              $!':<;<::;::<<;<<<<        %"&$"#0;==;<<;:;<<=<<<        3 )! '&&+:>><<<=<<<===<;             (#- )"#+06:<>>>>>>>>>=          ! # &%,-  3"*$%&(''*+-/00/..11            "$&(-" #4#("%'('(&&###""###"         $$   !%! $4 #&%'('''%%%$###"""!           "!"&#"%!#"##*01-#&'((&''%$%%"""           !# !#$$$% #" #&%*! #&&%&&&&%&$%#"!          '%!&'&"##!&   " $#$3 $!*$#"#%#%&%&%&%$"!       "%'%%%'$""!!%  +"&-)(! !! ##%%&%%$$"        $$&''$$"$""$# "!",$%,!! $##$&$#%$!       # &((&$'$!! &#$$ &'%"!!#"""$#$$#!       ###((%"$#!   #''&& "-  ##" !"""#$$"""!          !# ('%%&&$#$# !! ! % ('%( %, ' #.'!)!!"####"! !           #(('&#""#" ! !!""!"#"$''&' 1 )( ) ! !"$#"" !"       $'*&%!""!! "!#""###$#%"(((" - & ( * "#"##! "$         #&&$#%#"#" !"! "##"#$%#&&)%&&.!' $( ( """"" !! "#         "  #$#$$#"" !"#!""#$$$%%$%-. #&(### &* *!!"""! !  !"$        #$$$"&(%"$%%!#! !!"#"""#%&%$%&!)&'#"/& $)&! + !!"#! !! ! "#%          !#$&%().*#!$&$!""! """"##%&%%'&'  !&##%'*-!,!& ,!! #" "  ##$    # !"!"! !!#"#%&%%&'(&$##!"###$###"!###"%&'%&&&& %!&$!,-* + !!!!!" !! ""##     +!"!""! ! "#$#%&&%&&'&&%$"!"##$""#$$%$%%''&%'%%'$&/ "('-+ !!"!! ##$%   ,! !""! !" !!!##$%%&%('%%'$&$" !######$$&%&&'&'&&%%&'%  $3 $#. , """  !##&  $-#! ##"!! !""!!"""#$##&%$$(''&&%%$#  "#""###$'%''%&&(&%%&#/"!#/"%"$"- !$#"  "!#$$     !!%,!"$$#$$""#"!"""#$$$$%&%'('&&'%&%$" !!!!!###%%%&'&$&'&$&''&-.( &!%7('+"&)!#!"# !""#$%!  ""* !""""##""#"!!""#%$%&%$%&''(&%&%#$#! !"! !#$%%%&'&&&'&&&''%+,*, $"*")#! !!!!  !##$$%!!   %& &$!##"!##""#"!###$%&&'%&&&&()''&&##!"  !"#$%$'&&$&'%&&&%#,(%+ !'!%" ,,)(' !!!  !##$$%""    //-%#"#"""""#$#####$&$%%%%%%$%'&&&&$$##!  !!!#$%$'%%$&&&&%&",,)"* &%&%"%% !!! !"##%%%%"     "&)'!$ !$#!"#!"#"!"#$$$$$$%$$&%%&&'%$%##"   !""$#$%%$%$%$$%##&$-,& * $&+  &!%  !!"$$&%%"     &!!#!"##!!"!"#"!#$#$%#$%$$%&&'''&$$$$#!! !""$#%%%$%%$%%$$'"**)$(" !"$# % "$&!# !#$$&%!$#!  !) %#!"#"!""###"####"##$$%%%%&&'%&&%$#  "##%%$#$&%%%$$&&#*((%)& #%# ,"*2-% !"#"#%%!&$$#!  ($+ ).%(,$""$$"#$"!!"""####"####$%%%&&'%&&&%$##"#  !!"#%&&%$%%&%$%&' ('&("(-  '$$+* 0," !""##%%&%$%&$$#" #$' /'-*%,,%##&#$#""""""#"#$#"#$#%&%&'(('&'%$$#""!! !###$%#"$%&&&%$%(!*&%&)'&  "&'##%"+(*'# !#$$$&&%&%&%&&%%&$ &!)#1 * (+'&.&($ '#!"#!!!!"#""#$##$%&&&'((((&%&%%%#"!  !#$$###$%$&%$#$%%#'%&''%3 (!#' #((" '%"$!##$%%&&%%%&&((&&'(% !'!*0- , ,'$*0*"'#!"" !"""!#""#%$$&'&&(('()(&('%%#"! ! !!"#$%#$%%%%(%$#$$&#"&&#%$ # $ ' ('$"## !###$$%&&'(%&('&'''$$+'!"*1( ) %*#%--")#$%##"!!!!!"""$%&%%%&'''(('(()('&$""!!!!"""$%%$&'&'%%$%%&!#$"!&&#!  " "(%#&'&!"! !!#%%&&%''%%'('&''(&'0-(#)% (.%')# %##"!!"#$%$#%%$$%%&''('(((()'&%#""" !""#%$$%&&%&&%$$&$!#""")'"# """#'(#!#"! !#$%'&%&''))(((())##)" 1*$ %* !*/(("&###""#"#%%%&%&''&(('((*)((''&%#$""! !""#%$$%&&&&%%$%' $" #(&$%" "#'%$%$"(#'%!"#$$%%&&'((((('())%'&(( %6)%*)#,-!'(""##$""#$$%&&%&'&&'(((**)**(''&%#%""!"###$$$&'&''&$$&'$#! !&'$"$/-#$# !$%,!(& !#%$#%&'')&'(*'((*%"$%& *2#%!(%%-&%'(! !$$#!"$$#&&%%'('&'''**))))(''%$#$#"""#$%%%$%&&'&%$%%&$"!&(##"0! $+$ '%%$")#!*#!""$$$%&)'(')()((()"$%)-$#'("(.')'!!%%##$$#$&$%&&&(('())))))(''&$%#"#$""$%%%&%$%%%%%%$&"!&#%))##/' !0 ! +&##$) * "#"#$%$%((('((()(((#!.)#"% **$"+( *, ')%!!$%##%%$%%$&&&&''&()'('())''&&&$#$$###$$$%%%&&'&$%$$%## !%))%#-.0 #'!##&,  !!"$$$$%jbigkit-2.1/examples/xvlogo.jbg0000664000307500030750000002066412315071063015267 0ustar mgk25mgk25XxW`|CT^PmζN2&S_@?g0'$gMأz,r6T0^ ̒, 8,i`ruNt)+q]PnTwKX\8@pld>$pnH'Wܨĺ|濰 Pw8^{4{0)͞O뙺1K;ݦ?k.UXA P.Pz]˻둱y~\ŁgP88%s:xaܳ?6`EûrꎲlT˽zozhn ,Aѣ/]Q'80Q͡9M;7~4PF4%f`g+xBūE/ں#e#š-.m2R I *}_uNhmC3p~P85'!ܜ.>^PR> _YP:Vb6FL%%ʡ! _/eς;oy^9C]ZVqpk^65N >%d'AˇCLT'<D F1r& ڣl9"NI ЈMCƎ9ۈǎsZu'\e|-zϙ >TϤS |[rgH%W۵m6[mŔ2%OsI>ـ h f[O »rGҼ#d,x!.)ŝ]OJ!zN٥1ge- VOAo:7ߗo)j'\#_ɺpd?gND[0AP>TN[µ(o;{#N-[b,EBW4v7 uπJؕo Ո# ՜1>?P<CVqF_IH@FZeLjvH+P& a {Qn%Lb6E 5"${8-B FZ㘣غ wK˦ſ=WvٯyqX-ti/ăuA 1엩X>w۵$>ڄʊ]\GJE8Je eM)pǵ0m;㯾wg n(q`Bz pIT9 <~'؜T>)kx=J*{aȭgOvR0iR?]&n<%reѼvS1}5l7Bl+`xqc6{ͩ d2N wT)ѧy@uTyأ 1Zǐ0/]&Odj+._pW2O5E}u Fţt[ 1!Y(+w}MQ.{7gem!,&|Lzʄq$ީ;zVϭXQNŒks~D 4POnu?+OPh +K3:OjD3㋯Zʍ}?@PJMTekֱ'"cK(вP8S2bQVg0Wgy O }W Eh/8V\{OZVb0Jlif~{4t =S#P !M7ԧICt0s=&iLϣIvd`_re2'Y&H-mp۱\oOТ:bXN94a(:c9i6D9yIt\ȂCV6'!'bA?ilˑhtپ@(K1 ހx "͜)$q䒻-,|ah8d*0p&hh e_[yNa44HvF+,,;b V.Gn(*pp+\c/-Si U-ؼO-o '0O7v i5ie?u:μ&rhࠀ{,'`WHD˵rDpn\$/5 596v$fLYDjGݝN1vū8pJ~@.rԛ~B*R~@%LKI <<ÄEuk{&1XGl-UJ0j+[H1[}Q֠1uSf2fD,NgN$'hjbT%'@k? +cưnd2k*r0B_:[{viݣ6V 'g|#NU s`>Bd5nYmб ۣ/CkK(#=.H:5}r<^q[ryCv0Ħ1cB5TsiiZ[XK^aotx:N{r=؃E3k8ę ZgH#pk)}MA-;2a88]?/0Q3,;]oljՉ>&lhNx^ܮ~+mAV-=QVY5_P :q8 o9Wó*)'+_W1(iETL46RKV2Q8J؇Xo5*c*ݵmU`P<LN9 {C?c*mSbyhiԄ tr7 |GH7{1*jJ@4/"O\F̋X> .K~E)XWR/[Yq%C8S" (1y04$vR UYޅ/sV` v?>v`&QOUg^I>MdF_=J׬hLv)r5YL2]^DHlܔn ҹr6wZ^%x!jdجDzO4T"GDJHÂo84ޑv*!fǧI;ߵ'nMAɲGHڃh,y _d/~N+|bj>{4&+cIb'٪Wۂ=qy௮ED<(c ?R8h|2*ݡ_9ʜ|\fEM‘w= " 7`Eg5b㞄Z5, HL8PC*Z9Y;ϷV}#ڧ0/ze>ChX ɧtjبp/NǞitUؾ8vgOH1 g3%OB(M>\px H*a8"݀8R +M+0\cjrt}:0{euIIKb/~kNH&1($1eK G,$nvXyrqve fe:H_ @fiwl/~;YuB/m2zqcӒd3/nVD f z=oFҦ#]I<"ZT題bT3m$ܸ#܃t01Sodݍ KcӯTIVLmJUx[0$KvAYRQ"YXF|k;O@Z2w*@]kDp6>MQ[C3֢YEN- oսh1k1gUtviMρ6h$Y kjkVj`dFYeY;$ud̵`<'_}AP2\22OUɲ NեƻcF ^M1:|Ic Ά)u8QtSK/0~.^*-NX{* %()zurO*> s_G*ސ|Juq ~$Nx0yGMŌ1MLkGZGeZxN[A9:]%iaE59a]U 5 q&g^u'G;x(l8'ٶGdS;;D*JSJڒ/1]9>*<djj^s*?`X3h"Q]Gr 5Ϡ|5;NXikE!x \X+_{%Ö%I!1懟JwioݡIwOnT Df8D'͑ Lmh0ktclk{0&A:9?*+N mE VZDz?ȿK0LdO=VBY#T%ր?xGϫl-Xs%w^d\#;z_I"xΟh{VO K: ncN! ff!~=p=pjFԸ^5:9\= )@<" `5Tԍ(h[y'VK_O>f dvo]dfK!^o|zu/ E.yScvR^Q~hvx۾W;psqdg~ D^w2;i*Un YDfC@A%fnaZ4V&l:) 9(= G*%Bg HftVb(5_  pFmv +ﭞ=߭ lqX63X)vL]uyVc @{(sMk"zI%Aa 2F#ڿO7fzj+^TH|`*Sm މ?5_MeBbZ( >d {Z#RXC(PO2bv,q.y|uD#%Ie.j ǖLa\oq_cd^UU/_:{aZq{C7ըȼ1!7+SxV^cxԝh1Mγ [|^`I@aV%-(j*$sﱩ?֤qRM bSILξ!/هU3jh[7sIrZQÎ;|m RbwW]dP}[Ek6@{aWN} 9oanFF+|Wg}8>V, `,=AbqZpjG7!e2 8Eb931mKT6go~LYuXL88ZO}%2GIE{u76p ե>Ζɏ>.BbZnݩ945v.`]]DӔEs\v{.3 ַ,Vy4S&1!1c>MJOOF;MEEewhYd9m.YQ'a uӱPN1uCDB]Qu-;DK! l䗘Gh 1ȆiHa8O&'w5_Gm0 jp o= -c C.91ʑ!N{?:*mv7;l{+|C0ԝvpe3"bfm`glx}b$[VsdCZo X&KMr]ݍzXv/C|uֲ:SW?.OPslZRL#^~X~#ƓlX~E ͪ egE)%{jER&{T~Ԅ\Wqs0.74g+cfCiP tVlna7C$㺉ǘ Rz1nf->:vL(ɐ% XӵK=j@(M 3ϛRMڲa ˰n_$s4"xw.U+-itrbTjPPyK$}FvD|܏f,PN3 ToU/䉣fAGE{F 8OW\~ш]}p[K{P^]1`A,|(&ҔB-^cLU@FY.[>eIGJx>mVz7YhɖZ6e BRʞ Iit6[i4ZPWcX"6E,QVemn(C]RW8]5?nU-tvN5E$MM|k jA7stu.uK|zg8 [ؿ.IvcvY/hZk)K_ӟla6,|K,_7,dGhnCA4e,"Iӳ" ynJ2yLܪ#!j0Bf7uf͸I}V`erP8 Y~\DeƴO` V'YҹI%LXΌ6_4d-1_:ٝ;p9pe4yuc1rBBD ̃'S|[olKO#r-MUesjkY pEܳWyzgmUŌA+bd6 bPNH].t k3^+iy2KW+@S‰T.$ʞ}@P7ʬ~lةIrkTi%)} Qwl}7QG=M9u[R'lhX ID"/tI{jueZ-8/^YwƗĴm"P:w^P]B^jbigkit-2.1/libjbig/0000775000307500030750000000000012315071063013041 5ustar mgk25mgk25jbigkit-2.1/libjbig/Makefile0000664000307500030750000000257212315071063014507 0ustar mgk25mgk25# Unix makefile for the JBIG-KIT library # Select an ANSI/ISO C compiler here, GNU gcc is recommended CC = gcc # Options for the compiler: A high optimization level is suggested CFLAGS = -g -O -W -Wall -ansi -pedantic # --coverage all: libjbig.a libjbig85.a tstcodec tstcodec85 tstcodec: tstcodec.o jbig.o jbig_ar.o $(CC) $(CFLAGS) -o tstcodec tstcodec.o jbig.o jbig_ar.o tstcodec85: tstcodec85.o jbig85.o jbig_ar.o $(CC) $(CFLAGS) -o tstcodec85 tstcodec85.o jbig85.o jbig_ar.o libjbig.a: jbig.o jbig_ar.o rm -f libjbig.a ar rc libjbig.a jbig.o jbig_ar.o -ranlib libjbig.a libjbig85.a: jbig85.o jbig_ar.o rm -f libjbig85.a ar rc libjbig85.a jbig85.o jbig_ar.o -ranlib libjbig85.a jbig.o: jbig.c jbig.h jbig_ar.h jbig85.o: jbig85.c jbig85.h jbig_ar.h jbig_ar.o: jbig_ar.c jbig_ar.h tstcodec.o: tstcodec.c jbig.h tstcodec85.o: tstcodec85.c jbig85.h update-po: jbig.c jbig85.c Makefile xgettext -ojbig.pot -k_ \ --copyright-holder='Markus Kuhn' \ --msgid-bugs-address='http://www.cl.cam.ac.uk/~mgk25/jbigkit/' \ --package-name jbigkit \ jbig.c jbig85.c cd po && for po in *.po ; do \ msgmerge --update $$po ../jbig.pot ; done analyze: clang --analyze *.c test: tstcodec tstcodec85 ./tstcodec ./tstcodec85 t82test.pbm: tstcodec ./tstcodec $@ clean: rm -f *.o *.gcda *.gcno *.gcov *.plist *~ core gmon.out dbg_d\=??.pbm rm -f t82test.pbm rm -f tstcodec tstcodec85 jbigkit-2.1/libjbig/jbig.c0000664000307500030750000033236012315071063014127 0ustar mgk25mgk25/* * Portable JBIG image compression library * * Copyright 1995-2014 -- Markus Kuhn -- http://www.cl.cam.ac.uk/~mgk25/ * * This module implements a portable standard C encoder and decoder * using the JBIG1 lossless bi-level image compression algorithm * specified in International Standard ISO 11544:1993 and * ITU-T Recommendation T.82. See the file jbig.txt for usage * instructions and application examples. * * 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 2 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, write to the Free Software * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. * * If you want to use this program under different license conditions, * then contact the author for an arrangement. */ #ifdef DEBUG #include #else #define NDEBUG #endif #include #include #include #include "jbig.h" #define MX_MAX 127 /* maximal supported mx offset for * adaptive template in the encoder */ #define TPB2CX 0x195 /* contexts for TP special pixels */ #define TPB3CX 0x0e5 #define TPDCX 0xc3f /* marker codes */ #define MARKER_STUFF 0x00 #define MARKER_RESERVE 0x01 #define MARKER_SDNORM 0x02 #define MARKER_SDRST 0x03 #define MARKER_ABORT 0x04 #define MARKER_NEWLEN 0x05 #define MARKER_ATMOVE 0x06 #define MARKER_COMMENT 0x07 #define MARKER_ESC 0xff /* loop array indices */ #define STRIPE 0 #define LAYER 1 #define PLANE 2 /* special jbg_buf pointers (instead of NULL) */ #define SDE_DONE ((struct jbg_buf *) -1) #define SDE_TODO ((struct jbg_buf *) 0) /* object code version id */ const char jbg_version[] = "JBIG-KIT " JBG_VERSION " -- (c) 1995-2014 Markus Kuhn -- " "Licence: " JBG_LICENCE "\n"; /* * The following array specifies for each combination of the 3 * ordering bits, which ii[] variable represents which dimension * of s->sde. */ static const int iindex[8][3] = { { 2, 1, 0 }, /* no ordering bit set */ { -1, -1, -1}, /* SMID -> illegal combination */ { 2, 0, 1 }, /* ILEAVE */ { 1, 0, 2 }, /* SMID + ILEAVE */ { 0, 2, 1 }, /* SEQ */ { 1, 2, 0 }, /* SEQ + SMID */ { 0, 1, 2 }, /* SEQ + ILEAVE */ { -1, -1, -1 } /* SEQ + SMID + ILEAVE -> illegal combination */ }; #define _(String) String /* to mark translatable string for GNU gettext */ /* * Array with English ASCII error messages that correspond * to return values from public functions in this library. */ static const char *errmsg[] = { _("All OK"), /* JBG_EOK */ _("Reached specified image size"), /* JBG_EOK_INTR */ _("Unexpected end of input data stream"), /* JBG_EAGAIN */ _("Not enough memory available"), /* JBG_ENOMEM */ _("ABORT marker segment encountered"), /* JBG_EABORT */ _("Unknown marker segment encountered"), /* JBG_EMARKER */ _("Input data stream contains invalid data"), /* JBG_EINVAL */ _("Input data stream uses unimplemented JBIG features"), /* JBG_EIMPL */ _("Incremental BIE does not continue previous one") /* JBG_ENOCONT */ }; /* * The following three functions are the only places in this code, were * C library memory management functions are called. The whole JBIG * library has been designed in order to allow multi-threaded * execution. No static or global variables are used, so all fuctions * are fully reentrant. However if you want to use this multi-thread * capability and your malloc, realloc and free are not reentrant, * then simply add the necessary semaphores or mutex primitives below. * In contrast to C's malloc() and realloc(), but like C's calloc(), * these functions take two parameters nmemb and size that are multiplied * before being passed on to the corresponding C function. * This we can catch all overflows during a size_t multiplication a * a single place. */ #ifndef SIZE_MAX #define SIZE_MAX ((size_t) -1) /* largest value of size_t */ #endif static void *checked_malloc(size_t nmemb, size_t size) { void *p; /* Full manual exception handling is ugly here for performance * reasons. If an adequate handling of lack of memory is required, * then use C++ and throw a C++ exception instead of abort(). */ /* assert that nmemb * size <= SIZE_MAX */ if (size > SIZE_MAX / nmemb) abort(); p = malloc(nmemb * size); if (!p) abort(); #if 0 fprintf(stderr, "%p = malloc(%lu * %lu)\n", p, (unsigned long) nmemb, (unsigned long) size); #endif return p; } static void *checked_realloc(void *ptr, size_t nmemb, size_t size) { void *p; /* Full manual exception handling is ugly here for performance * reasons. If an adequate handling of lack of memory is required, * then use C++ and throw a C++ exception here instead of abort(). */ /* assert that nmemb * size <= SIZE_MAX */ if (size > SIZE_MAX / nmemb) abort(); p = realloc(ptr, nmemb * size); if (!p) abort(); #if 0 fprintf(stderr, "%p = realloc(%p, %lu * %lu)\n", p, ptr, (unsigned long) nmemb, (unsigned long) size); #endif return p; } static void checked_free(void *ptr) { free(ptr); #if 0 fprintf(stderr, "free(%p)\n", ptr); #endif } /* * Memory management for buffers which are used for temporarily * storing SDEs by the encoder. * * The following functions manage a set of struct jbg_buf storage * containers were each can keep JBG_BUFSIZE bytes. The jbg_buf * containers can be linked to form linear double-chained lists for * which a number of operations are provided. Blocks which are * tempoarily not used any more are returned to a freelist which each * encoder keeps. Only the destructor of the encoder actually returns * the block via checked_free() to the stdlib memory management. */ /* * Allocate a new buffer block and initialize it. Try to get it from * the free_list, and if it is empty, call checked_malloc(). */ static struct jbg_buf *jbg_buf_init(struct jbg_buf **free_list) { struct jbg_buf *new_block; /* Test whether a block from the free list is available */ if (*free_list) { new_block = *free_list; *free_list = new_block->next; } else { /* request a new memory block */ new_block = (struct jbg_buf *) checked_malloc(1, sizeof(struct jbg_buf)); } new_block->len = 0; new_block->next = NULL; new_block->previous = NULL; new_block->last = new_block; new_block->free_list = free_list; return new_block; } /* * Return an entire free_list to the memory management of stdlib. * This is only done by jbg_enc_free(). */ static void jbg_buf_free(struct jbg_buf **free_list) { struct jbg_buf *tmp; while (*free_list) { tmp = (*free_list)->next; checked_free(*free_list); *free_list = tmp; } return; } /* * Append a single byte to a single list that starts with the block * *(struct jbg_buf *) head. The type of *head is void here in order to * keep the interface of the arithmetic encoder gereric, which uses this * function as a call-back function in order to deliver single bytes * for a PSCD. */ static void jbg_buf_write(int b, void *head) { struct jbg_buf *now; now = ((struct jbg_buf *) head)->last; if (now->len < JBG_BUFSIZE - 1) { now->d[now->len++] = b; return; } now->next = jbg_buf_init(((struct jbg_buf *) head)->free_list); now->next->previous = now; now->next->d[now->next->len++] = b; ((struct jbg_buf *) head)->last = now->next; return; } /* * Remove any trailing zero bytes from the end of a linked jbg_buf list, * however make sure that no zero byte is removed which directly * follows a 0xff byte (i.e., keep MARKER_ESC MARKER_STUFF sequences * intact). This function is used to remove any redundant final zero * bytes from a PSCD. */ static void jbg_buf_remove_zeros(struct jbg_buf *head) { struct jbg_buf *last; while (1) { /* remove trailing 0x00 in last block of list until this block is empty */ last = head->last; while (last->len && last->d[last->len - 1] == 0) last->len--; /* if block became really empty, remove it in case it is not the * only remaining block and then loop to next block */ if (last->previous && !last->len) { head->last->next = *head->free_list; *head->free_list = head->last; head->last = last->previous; head->last->next = NULL; } else break; } /* * If the final non-zero byte is 0xff (MARKER_ESC), then we just have * removed a MARKER_STUFF and we will append it again now in order * to preserve PSCD status of byte stream. */ if (head->last->len && head->last->d[head->last->len - 1] == MARKER_ESC) jbg_buf_write(MARKER_STUFF, head); return; } /* * The jbg_buf list which starts with block *new_prefix is concatenated * with the list which starts with block **start and *start will then point * to the first block of the new list. */ static void jbg_buf_prefix(struct jbg_buf *new_prefix, struct jbg_buf **start) { new_prefix->last->next = *start; new_prefix->last->next->previous = new_prefix->last; new_prefix->last = new_prefix->last->next->last; *start = new_prefix; return; } /* * Send the contents of a jbg_buf list that starts with block **head to * the call back function data_out and return the blocks of the jbg_buf * list to the freelist from which these jbg_buf blocks have been taken. * After the call, *head == NULL. */ static void jbg_buf_output(struct jbg_buf **head, void (*data_out)(unsigned char *start, size_t len, void *file), void *file) { struct jbg_buf *tmp; while (*head) { data_out((*head)->d, (*head)->len, file); tmp = (*head)->next; (*head)->next = *(*head)->free_list; *(*head)->free_list = *head; *head = tmp; } return; } /* * Calculate y = ceil(x/2) applied n times, which is equivalent to * y = ceil(x/(2^n)). This function is used to * determine the number of pixels per row or column after n resolution * reductions. E.g. X[d-1] = jbg_ceil_half(X[d], 1) and X[0] = * jbg_ceil_half(X[d], d) as defined in clause 6.2.3 of T.82. */ unsigned long jbg_ceil_half(unsigned long x, int n) { unsigned long mask; assert(n >= 0 && n < 32); mask = (1UL << n) - 1; /* the lowest n bits are 1 here */ return (x >> n) + ((mask & x) != 0); } /* * Set L0 (the number of lines in a stripe at lowest resolution) * to a default value, such that there are about 35 stripes, as * suggested in Annex C of ITU-T T.82, without exceeding the * limit 128/2^D suggested in Annex A. */ static void jbg_set_default_l0(struct jbg_enc_state *s) { s->l0 = jbg_ceil_half(s->yd, s->d) / 35; /* 35 stripes/image */ while ((s->l0 << s->d) > 128) /* but <= 128 lines/stripe */ --s->l0; if (s->l0 < 2) s->l0 = 2; } /* * Calculate the number of stripes, as defined in clause 6.2.3 of T.82. */ unsigned long jbg_stripes(unsigned long l0, unsigned long yd, unsigned long d) { unsigned long y0 = jbg_ceil_half(yd, d); return y0 / l0 + (y0 % l0 != 0); } /* * Resolution reduction table given by ITU-T T.82 Table 17 */ static char jbg_resred[4096] = { 0,0,0,1,0,0,0,1,0,1,1,1,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,1,1,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 1,1,1,1,1,1,1,1,0,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,0,1,1,0,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1, 0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,1,1,0,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1, 0,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,1,1,0,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1, 1,1,0,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,0,1,0,0,0,1,1,0,0,0,0,0,1,0,1,0,0,1,1,1,0,1,1, 0,0,0,1,0,0,0,1,0,0,1,0,0,0,1,1,0,1,1,1,0,0,0,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,1,1,1,0,1,0,1,0,0,1,1,1,0,1,1,0,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,0,1,0,1,0,0,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,1,0,0,1,1,0,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,0,1,0,1,0,0,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1, 1,0,0,1,0,0,1,1,0,1,1,1,1,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,1,1,0,0,1,1,1,1,1,1,1,1,1,1, 0,0,1,1,0,0,0,1,0,0,0,1,0,0,1,1,0,1,1,1,0,1,0,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,1,0,1,1,0,1,1,1,1,1,1,0,1,1,1,0, 0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,1,1,1,1,1,1,1,0,0,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,1,0,0,1,0,0,1,1,0,1,1,1,0,1,0,1,1,1,1,1,1,1,1,1, 0,0,0,1,0,0,0,1,0,1,1,0,1,0,1,1,1,1,1,1,0,1,0,1,1,1,1,1,1,1,1,1, 1,1,1,0,1,0,0,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1, 1,0,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,0,1,0,0,0,1,1,0,0,0,0,0,0,0,1,0,0,1,1,1,1,1,1, 0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,1,0,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,1,1,1,0,1,0,1,0,1,1,0,1,0,1,1,0,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,0,1,0,1,0,0,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,1,1,0,0,0,0,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,1,0,1,0,0,1,0,0,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,0,1,1,1,0,0,1,1,0,0,1,1,1,1,1,1,0,1,1,1,1,0,1,1, 1,0,0,1,0,0,1,0,0,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,1,1,1,0,1,1,1,1,1,1,1,1,1,0, 0,0,1,0,1,1,1,1,0,0,0,1,1,0,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,1,1,0,1,1,1,1,1,1,1,1,1,1,0, 0,0,0,0,1,0,0,1,0,0,1,1,0,1,1,1,0,1,1,1,1,1,1,0,0,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,1,1,0,1,0,0,1,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,1,1,0,1,1,0,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,0,1,1,1,0,1,0,1,0,1,1,1,1,1,1,1,0,1,1,1,0,1,1,1, 0,0,1,0,0,1,1,1,0,1,1,1,1,1,1,1,0,1,1,1,1,0,1,1,0,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,1, 0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,1,1,0,0,1,0,0,1,1, 0,0,0,0,0,0,0,1,0,1,1,1,0,1,0,1,0,0,1,0,0,0,0,1,0,1,0,1,0,1,0,1, 0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,1,0,0,0,0,0,0,0,1,1,1,1,0,1,1,1, 0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,1,1,0,1,0,1,1,0,0,0,1,0,0,1,1, 0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,0,0,1,0,1,1,1,0,0,1,1, 0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,1,0,1,1,0,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,0,0,1, 0,0,1,0,0,1,1,1,0,0,0,0,1,0,0,1,0,0,0,1,1,1,1,0,1,0,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,1,0,1,1,0, 0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,1,0,1,1,1,0,1,1,1, 0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,1,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,1,1,0,1,0,0,0,1,1,0,1,0,0,0,0,1,1,1,1,0,0,1,1,1,0,1,1,0,0,1,1, 0,0,0,0,0,0,0,0,1,1,0,1,0,0,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,1,0,0,1,1,0,1,1,1,1,1,1,1,1,1,1,1, 0,0,1,1,0,0,1,1,0,0,1,1,0,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,1,1,1,0,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,1,0,0,0,1,0,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,1,1,1,1,0,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1, 0,0,0,1,0,0,1,0,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,0,0,1,0,0,1,0,0,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1, 0,0,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,0,1,1,0,0,0,1,0,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1, 0,0,1,1,1,1,1,1,0,0,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,1,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1, 0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,0,1,0,0,0,1,1,0,0,0,0,0,0,0,1,0,0,0,1,1,0,1,1, 0,0,0,1,0,0,0,1,0,0,1,0,0,0,1,1,0,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,1,1,1,0,1,0,1,0,0,1,0,1,0,1,1,0,1,1,1,0,1,1,1, 0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,1,0,1,1,1,1,1,0,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,1,1,0,0,0,0,0,1,0,1,0,1,1,0,1,1,0,1,1,1,1,1,1,1, 0,0,0,0,1,0,0,1,0,0,1,1,0,0,1,1,0,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,0,0,1,1,0,1,1,1,1,1,1,1,1,0,1,1, 1,0,1,0,1,0,0,1,1,0,1,1,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,1,1,0,0,0,1,1,0,1,1,0,1,1,1, 0,0,1,0,0,0,0,1,0,0,0,0,0,0,1,1,0,1,1,1,0,1,0,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,1,1,1,0,1,1,0,1,1,1,1, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,1,0,1,1,1,0,1,0,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,1,0,1,0,1,0,1,1,0,1,0,1,0,0,0,1,1,1,1,1,1,1,1,1, 1,1,1,0,1,0,0,0,1,1,0,1,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1, 1,0,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,0,1,0,0,0,1,1,0,0,0,0,0,0,0,1,0,0,0,1,1,0,1,1, 0,0,1,1,0,0,0,1,0,0,0,0,0,0,0,1,0,1,0,1,0,0,1,1,0,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,1,1,1,0,1,0,1,0,0,1,0,1,0,0,1,0,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,1,0,1,1,0,1,1,0,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,1,1,1,0,0,0,0,0,0,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,1,0,1,0,0,0,1,1,1,0,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,0,1,1,1,0,0,0,1,0,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1, 1,0,0,0,1,0,0,0,0,1,1,1,0,1,0,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,1,1,1,1,1,0,1,1,0, 0,0,1,1,1,1,1,1,0,0,0,0,1,0,0,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,1,1,1,0,1,1,1,1,1,1,1, 0,0,0,0,1,0,0,0,0,0,0,1,0,0,1,1,0,1,1,1,1,1,1,0,0,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1, 0,0,1,0,1,0,1,1,0,0,1,0,1,1,1,1,0,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,0,1,1,1,0,0,0,1,0,1,1,1,1,1,1,1,0,1,1,1,0,1,1,1, 0,0,1,0,1,0,1,1,0,1,1,1,1,1,1,1,0,0,1,1,1,0,1,1,0,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,1, 0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,1, 0,0,0,0,0,0,0,1,0,1,1,1,0,1,0,1,0,0,1,0,0,0,0,1,0,1,0,1,0,1,0,1, 0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,1,0,0,0,0,0,0,0,0,1,0,1,0,0,1,1, 0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,1,0,0,1,0,0,1,0,0,0,0,0,0,0,1, 0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,1,1, 0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,1,0,0,1,1, 1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,1,0,0,1,1,0,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,0,0,0, 0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,1,0,0,1,1, 0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,1, 0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,1, 0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,1,0,1,0,0,0,1,0,1,1,1,1,1,1,1, 0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,0,0,1,1, 0,0,0,0,0,0,0,1,0,1,0,1,0,1,0,0,0,0,1,1,0,0,0,1,0,1,1,1,0,1,1,1 }; /* * Deterministic prediction tables given by ITU-T T.82 tables * 19 to 22. The table below is organized differently, the * index bits are permutated for higher efficiency. */ static char jbg_dptable[256 + 512 + 2048 + 4096] = { /* phase 0: offset=0 */ 0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2, 0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,0,2,2,2,2,2,2,0,2,2,2,2,2,2,2, 0,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,0,0,2,2,2,2,2,2,0,2,0,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, /* phase 1: offset=256 */ 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2, 0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,0,2,2,2,2,2,0,2,0,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2, 0,2,2,2,2,1,2,1,2,2,2,2,1,1,1,1,2,0,2,0,2,2,2,2,0,2,0,2,2,2,2,2, 0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,0,0,2,2,2,2,0,2,2,2,2,2,2,2, 0,2,0,2,2,2,2,2,2,2,2,2,2,0,2,0,2,2,0,0,2,2,2,2,2,0,0,2,2,2,2,2, 0,2,2,2,2,1,2,1,2,2,2,2,1,1,1,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1, 1,2,1,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,1,1,2,2,2,2,2,0,2,2,2,2,2,2, 2,2,2,2,2,0,2,0,2,2,2,2,0,0,0,0,0,2,0,2,2,2,2,2,0,2,2,2,2,2,2,2, 0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,0,2,2,2,2,0,2,0,2,2,2,2,2, 2,2,2,2,2,1,1,1,2,2,2,2,1,1,1,1,1,2,1,2,2,2,2,2,2,2,2,2,2,2,2,1, 2,2,2,2,2,2,2,2,2,2,2,2,2,0,1,2,0,2,0,2,2,2,2,2,0,2,0,2,2,2,2,1, 0,2,0,2,2,1,2,1,2,2,2,2,1,1,1,1,0,0,0,0,2,2,2,2,0,2,0,2,2,2,2,1, 2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,0,0,0,2,2,2,2,2, 2,2,2,2,2,1,2,1,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,1,2,1,2,2,2,2,1, 2,2,2,2,2,2,2,2,0,2,0,2,2,1,2,2,2,2,2,2,2,2,2,2,0,0,0,2,2,2,2,2, /* phase 2: offset=768 */ 2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,1,1,1,2,2,2,2,1,1,1,1, 0,2,2,2,2,1,2,1,2,2,2,2,1,2,1,2,0,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1, 2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,0,2,2,1,2,1,2,2,2,2,2,1,1,1, 2,0,2,2,2,1,2,1,0,2,2,2,1,2,1,2,2,2,2,0,2,2,2,2,0,2,0,2,2,2,2,2, 0,2,0,0,1,1,1,1,2,2,2,2,1,1,1,1,0,2,0,2,1,1,1,1,2,2,2,2,1,1,1,1, 2,2,0,2,2,2,1,2,2,2,2,2,1,2,1,2,2,2,0,2,2,1,2,1,0,2,0,2,1,1,1,1, 2,0,0,2,2,2,2,2,0,2,0,2,2,0,2,0,2,0,2,0,2,2,2,1,2,2,0,2,1,1,2,1, 2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,1, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,1,1,1,2,2,2,2,1,1,1,1, 0,0,0,0,2,2,2,2,0,0,0,0,2,2,2,2,0,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,0,2,2,2,2,1,0,2,2,2,1,1,1,1,2,0,2,2,2,2,2,2,0,2,0,2,2,1,2,1, 2,0,2,0,2,2,2,2,0,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2, 0,2,2,2,1,2,1,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2, 2,2,0,2,2,2,2,2,2,2,2,2,2,2,0,2,2,0,0,2,2,1,2,1,0,2,2,2,1,1,1,1, 2,2,2,0,2,2,2,2,2,2,0,2,2,0,2,0,2,1,2,2,2,2,2,2,1,2,1,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,0,2,2,2,1, 0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,1,1,1,2,2,2,2,1,1,1,1, 2,2,2,1,2,2,2,2,2,2,1,2,0,0,0,0,2,2,0,2,2,1,2,2,2,2,2,2,1,1,1,1, 2,0,0,0,2,2,2,2,0,2,2,2,2,2,2,0,2,2,2,0,2,2,2,2,2,0,0,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,0,2,2,1,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,1, 0,2,0,2,2,1,1,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2, 2,0,2,0,2,1,2,1,0,2,0,2,2,2,1,2,2,0,2,0,2,2,2,2,0,2,0,2,2,2,1,2, 2,2,2,0,2,2,2,2,2,2,0,2,2,2,2,2,2,2,1,2,2,2,2,2,2,0,1,2,2,2,2,1, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1, 0,2,2,2,1,2,1,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2, 2,0,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,0,0,2,2,1,2,1,0,2,2,2,1,1,1,1, 2,0,2,0,2,1,2,2,0,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,0,2,2,1,2,2, 2,0,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,0,2,0,2,2,2,2,0,0,0,0,2,1,2,1, 2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,0,2,2,2,2,2,1,2,0,0,2,2,2,1,2,2,2, 0,0,2,0,2,2,2,2,0,2,0,2,2,0,2,0,1,1,1,2,2,2,2,2,2,2,2,2,2,1,1,1, 2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,0,2,0,2,2,2,1, 2,2,0,0,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,1,1,1,2,2,2,2,1,1,1,1, 0,2,2,2,1,2,1,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2, 2,0,0,2,2,2,2,2,0,2,0,2,2,2,2,2,1,0,1,2,2,2,2,1,0,2,2,2,1,1,1,1, 2,2,2,2,2,2,2,2,2,2,0,2,2,0,2,0,2,1,2,2,2,2,2,2,2,2,0,2,2,1,2,2, 0,2,0,0,1,1,1,1,0,2,2,2,1,1,1,1,2,2,2,2,2,2,2,2,2,0,2,2,1,2,1,1, 2,2,0,2,2,1,2,2,2,2,2,2,1,2,2,2,2,0,2,2,2,2,2,2,0,2,0,2,1,2,1,1, 2,0,2,0,2,2,2,2,0,2,0,2,2,1,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,1, 2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1, 0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 0,2,2,2,2,0,2,0,2,2,2,2,0,0,0,0,2,2,2,2,2,1,1,2,2,2,2,2,1,2,2,2, 2,0,2,2,2,1,2,1,0,2,2,2,2,2,1,2,2,0,2,0,2,2,2,2,0,2,0,2,2,1,2,2, 0,2,0,0,2,2,2,2,1,2,2,2,2,2,2,0,2,1,2,2,2,2,2,2,1,2,2,2,2,2,2,2, 0,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,1,0,2,2, 0,0,0,2,2,1,1,1,2,2,2,2,1,2,2,2,2,0,2,0,2,2,2,1,2,2,2,2,1,2,1,2, 0,0,0,0,2,2,2,2,2,2,0,2,2,1,2,2,2,1,2,1,2,2,2,2,1,2,1,2,0,2,2,2, 2,0,2,0,2,2,2,2,2,0,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1, 0,2,2,2,1,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,1,2,2,2,2,2,0,2,2,1,2,2,0,0,0,2,2,2,2,2,1,2,2,0,2,2,2,1,2,1,2, 2,0,2,0,2,2,2,2,0,2,0,2,2,1,2,2,0,2,0,0,2,2,2,2,2,2,2,2,2,1,2,2, 2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,0,2,0,2,2,2,1, 1,2,0,2,2,1,2,1,2,2,2,2,1,2,2,2,2,0,2,0,2,2,2,2,2,0,2,2,1,1,1,1, 0,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,0,2,2,1,2,1, 2,2,0,0,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,1, 2,2,2,0,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,1,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,0,2, 2,0,2,0,2,2,2,2,2,1,1,2,2,2,2,2,2,2,2,2,2,2,2,1,0,2,0,2,2,2,1,2, 2,0,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2, 2,0,2,0,2,2,2,2,2,0,2,0,2,2,2,2,2,0,2,0,2,2,2,2,0,0,0,0,2,1,2,1, 2,2,2,2,2,1,2,1,0,2,0,2,2,2,2,2,2,0,2,0,2,2,2,2,0,2,0,2,2,2,2,1, 2,0,2,0,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,0, 2,0,2,0,2,2,2,1,2,2,2,0,2,2,2,1,2,0,2,0,2,2,2,2,0,0,0,2,2,2,2,1, 2,0,2,0,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2, /* phase 3: offset=2816 */ 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1, 0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,1,2,1,2,0,2,0,1,2,1,2,0,2,0,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,0,2,2,2,1,2,0,2,2,2,1,2,2,2,2,0,2,0,2,1,2,1,0,0,0,0,1,1,1,1, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,0,2,2,2,1,2, 2,2,2,1,2,2,2,0,1,1,1,1,0,0,0,0,2,2,2,2,2,2,2,2,2,0,2,0,2,1,2,1, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,0,0,0,0,1,1,1,1, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,0,2,1,2,1,0,0,0,0,1,1,1,1, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,1,2,0,2,0,2, 2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,0,2,0,2,1,2,1,2,0,2,0,2,1,2,1, 2,0,0,0,2,1,1,1,0,0,0,0,1,1,1,1,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2, 2,0,2,2,2,1,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,0,0,2,0,1,1,2,1, 2,2,2,0,2,2,2,1,2,1,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1, 0,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 0,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1,2,0,2,0,2,1,2,1,0,0,0,0,1,1,1,1, 2,0,0,2,2,1,1,2,2,2,2,2,2,2,2,2,2,1,2,1,2,0,2,0,2,1,1,1,2,0,0,0, 2,1,2,1,2,0,2,0,1,2,1,2,0,2,0,2,2,2,2,0,2,2,2,1,2,0,2,0,2,1,2,1, 2,0,2,0,2,1,2,1,0,0,0,0,1,1,1,1,2,2,2,2,2,2,2,2,2,0,2,0,2,1,2,1, 2,2,2,2,2,2,2,2,2,0,0,0,2,1,1,1,2,2,2,2,2,2,2,2,2,0,2,0,2,1,2,1, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2, 0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2, 2,0,0,0,2,1,1,1,0,0,0,0,1,1,1,1,2,0,2,0,2,1,2,1,0,0,2,0,1,1,2,1, 2,2,1,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,0,0,0,2,1,1,1, 2,2,2,1,2,2,2,0,2,1,1,1,2,0,0,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,1,2,1,2,0,2,0,1,2,1,2,0,2,0,2, 2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1, 2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,0,0,0,2,1,1,1,0,0,0,0,1,1,1,1, 2,0,2,2,2,1,2,2,0,0,2,0,1,1,2,1,2,1,2,1,2,0,2,0,2,2,2,2,2,2,2,2, 2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,0,0,0,0,1,1,1,1, 2,0,0,0,2,1,1,1,0,0,0,0,1,1,1,1,2,2,2,2,2,2,2,2,2,1,0,2,2,0,1,2, 2,2,2,1,2,2,2,0,2,1,1,1,2,0,0,0,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1, 2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1, 0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,0,2,2,2,2,2,2,2,2,2,2, 2,1,2,1,2,0,2,0,1,2,1,1,0,2,0,0,0,0,2,1,1,1,2,0,0,0,0,0,1,1,1,1, 2,2,2,2,2,2,2,2,1,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,0,2,1,2,1,2,0,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,0,2,2,2,1,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,1,2,2,2,0,2,2,2,2,0,2,2,2,1,2,2,2,0,0,2,2,1,1, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2, 0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,0,2,2,2,2,2,2,2,2,2, 2,0,2,0,2,1,2,1,0,0,0,0,1,1,1,1,2,2,2,2,2,2,2,2,0,0,0,0,1,1,1,1, 2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,0,0,0,2,1,1,1, 2,2,2,0,2,2,2,1,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2, 2,0,2,2,2,1,2,2,2,0,2,0,2,1,2,1,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1, 2,1,2,1,2,0,2,0,1,2,1,2,0,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,1,2,1,2,0,2,0,1,2,1,1,0,2,0,0,2,0,2,2,2,1,2,2,0,2,1,2,1,2,0,2, 2,2,2,1,2,2,2,0,2,2,1,2,2,2,0,2,2,1,2,2,2,0,2,2,2,2,0,2,2,2,1,2, 0,0,2,0,1,1,2,1,0,0,1,0,1,1,0,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,0,2,2,2,1,1,2,2,2,0,2,2,2,0,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1, 2,2,2,2,2,2,2,2,2,1,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1, 2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,0,0,2,2,1,1,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2, 0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,0,2,2,2,2,2,2,2,2,2, 2,0,0,0,2,1,1,1,0,0,0,0,1,1,1,1,2,2,2,1,2,2,2,0,2,1,2,1,2,0,2,0, 2,1,2,2,2,0,2,2,2,2,2,2,2,2,2,2,0,2,0,0,1,2,1,1,2,0,0,0,2,1,1,1, 2,2,2,2,2,2,2,2,2,1,1,1,2,0,0,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,0,2,2,2,1,2,2,0,2,2,2,1,2,2,1,2,1,2,0,2,0,2,0,2,2,2,1,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,0,2,2,2,1,1,1,2,0,0,0, 2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,0,2,0,0,1,2,1,1, 2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,0,2,2,2,1,2,2,2, 2,1,2,1,2,0,2,0,2,1,2,2,2,0,2,2,2,2,2,0,2,2,2,1,2,0,2,0,2,1,2,1, 2,0,2,0,2,1,2,1,0,2,0,2,1,2,1,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2, 2,2,2,2,2,2,2,2,0,2,0,2,1,2,1,2,2,2,2,2,2,2,2,2,0,1,0,0,1,0,1,1, 2,2,2,2,2,2,2,2,2,1,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 0,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1,2,2,1,2,2,2,0,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,1,2,2,1,0,2,0,2,2,2,1,2,2,2, 2,2,2,2,2,2,2,2,1,2,2,2,0,2,2,2,2,2,2,0,2,2,2,1,2,2,0,2,2,2,1,2, 2,0,2,0,2,1,2,1,0,2,0,2,1,2,1,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2, 0,2,0,0,1,2,1,1,2,0,0,0,2,1,1,1,2,2,2,2,2,2,2,2,1,0,1,2,0,1,0,2, 2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,1,2,2,2,0,2,2,1,1,2,2,0,0,2,2, 0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,1,2,1,2,0,2,0,2,1,2,2,2,0,2,2,2,0,2,2,2,1,2,2,0,2,2,2,1,2,2,2, 0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,1,2,2,2,0,2,2,2, 2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,0,2,1,2,1,2, 0,0,0,0,1,1,1,1,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,1,2,0,2,0,2,2,0,2,2,2,1,2, 2,0,2,0,2,1,2,1,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2, 0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,1,2,2,2,0,1,1,2,1,0,0,2,0,2,0,2,2,2,1,2,2,0,2,2,2,1,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,0,2,2,2,2,0,2,2,2,1,2, 2,0,2,0,2,1,2,1,0,2,0,2,1,2,1,2,2,2,2,2,2,2,2,2,2,1,2,2,2,0,2,2, 0,2,0,0,1,2,1,1,0,2,0,2,1,2,1,2,2,2,2,2,2,2,2,2,0,0,0,2,1,1,1,2, 2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1, 2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,0,0,2,1,1,1,2,0,0,2,2,2,1,2,2,2, 2,1,2,1,2,0,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,0,0,1,2,1,1, 0,0,2,2,1,1,2,2,0,2,1,2,1,2,0,2,2,1,2,1,2,0,2,0,1,2,1,2,0,2,0,2, 2,2,2,2,2,2,2,2,1,2,1,2,0,2,0,2,2,2,2,2,2,2,2,2,2,0,2,0,2,1,2,1, 2,2,0,0,2,2,1,1,2,2,0,0,2,2,1,1,2,2,2,2,2,2,2,2,2,2,0,0,2,2,1,1, 2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,0,2,0,0,1,2,1,1, 2,2,2,0,2,2,2,1,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,1,1,1,2,0,0,0,2, 2,2,2,2,2,2,2,2,1,1,1,2,0,0,0,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2, 2,0,2,0,2,1,2,1,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,0,0,0,2,1,1,1, 2,0,2,2,2,1,2,2,0,2,2,2,1,2,2,2,2,0,2,0,2,1,2,1,2,2,2,2,2,2,2,2, 2,0,2,0,2,1,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,0,2,0,2,1,2,1,2,1,2,0,2,0,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,0,2,0,2,1,2,1,1,2,1,2,0,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,1,2,1,2,0,2,0,2,2,1,2,1,2,0,2,0,2,2,2,2,2,2,2,2, 2,0,2,1,2,1,2,0,0,2,1,2,1,2,0,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1, 2,0,2,0,2,1,2,1,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,0,2,0,2,1,2,1, 2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,1,2,1,2,0,2,0,1,1,1,2,0,0,0,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1, 2,0,2,0,2,1,2,1,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, }; /* * Initialize the status struct for the encoder. */ void jbg_enc_init(struct jbg_enc_state *s, unsigned long x, unsigned long y, int planes, unsigned char **p, void (*data_out)(unsigned char *start, size_t len, void *file), void *file) { unsigned long l, lx; int i; assert(x > 0 && y > 0 && planes > 0 && planes < 256); s->xd = x; s->yd = y; s->yd1 = y; /* This is the hight initially announced in BIH. To provoke generation of NEWLEN for T.85 compatibility tests, overwrite with new value s->yd1 > s->yd */ s->planes = planes; s->data_out = data_out; s->file = file; s->d = 0; s->dl = 0; s->dh = s->d; jbg_set_default_l0(s); s->mx = 8; s->my = 0; s->order = JBG_ILEAVE | JBG_SMID; s->options = JBG_TPBON | JBG_TPDON | JBG_DPON; s->comment = NULL; s->dppriv = jbg_dptable; s->res_tab = jbg_resred; s->highres = (int *) checked_malloc(planes, sizeof(int)); s->lhp[0] = p; s->lhp[1] = (unsigned char **) checked_malloc(planes, sizeof(unsigned char *)); for (i = 0; i < planes; i++) { s->highres[i] = 0; s->lhp[1][i] = (unsigned char *) checked_malloc(jbg_ceil_half(y, 1), jbg_ceil_half(x, 1+3)); } s->free_list = NULL; s->s = (struct jbg_arenc_state *) checked_malloc(s->planes, sizeof(struct jbg_arenc_state)); s->tx = (int *) checked_malloc(s->planes, sizeof(int)); lx = jbg_ceil_half(x, 1); s->tp = (char *) checked_malloc(lx, sizeof(char)); for (l = 0; l < lx; s->tp[l++] = 2) ; s->sde = NULL; return; } /* * This function selects the number of differential layers based on * the maximum size requested for the lowest resolution layer. If * possible, a number of differential layers is selected, which will * keep the size of the lowest resolution layer below or equal to the * given width x and height y. However not more than 6 differential * resolution layers will be used. In addition, a reasonable value for * l0 (height of one stripe in the lowest resolution layer) is * selected, which obeys the recommended limitations for l0 in annex A * and C of the JBIG standard. The selected number of resolution layers * is returned. */ int jbg_enc_lrlmax(struct jbg_enc_state *s, unsigned long x, unsigned long y) { for (s->d = 0; s->d < 6; s->d++) if (jbg_ceil_half(s->xd, s->d) <= x && jbg_ceil_half(s->yd, s->d) <= y) break; s->dl = 0; s->dh = s->d; jbg_set_default_l0(s); return s->d; } /* * As an alternative to jbg_enc_lrlmax(), the following function allows * to specify the number of layers directly. The stripe height and layer * range is also adjusted automatically here. */ void jbg_enc_layers(struct jbg_enc_state *s, int d) { if (d < 0 || d > 31) return; s->d = d; s->dl = 0; s->dh = s->d; jbg_set_default_l0(s); return; } /* * Specify the highest and lowest resolution layers which will be * written to the output file. Call this function not before * jbg_enc_layers() or jbg_enc_lrlmax(), because these two functions * reset the lowest and highest resolution layer to default values. * Negative values are ignored. The total number of layers is returned. */ int jbg_enc_lrange(struct jbg_enc_state *s, int dl, int dh) { if (dl >= 0 && dl <= s->d) s->dl = dl; if (dh >= s->dl && dh <= s->d) s->dh = dh; return s->d; } /* * The following function allows to specify the bits describing the * options of the format as well as the maximum AT movement window and * the number of layer 0 lines per stripes. */ void jbg_enc_options(struct jbg_enc_state *s, int order, int options, unsigned long l0, int mx, int my) { if (order >= 0 && order <= 0x0f) s->order = order; if (options >= 0) s->options = options; if (l0 > 0) s->l0 = l0; if (mx >= 0 && my < 128) s->mx = mx; if (my >= 0 && my < 256) s->my = my; return; } /* * This function actually does all the tricky work involved in producing * a SDE, which is stored in the appropriate s->sde[][][] element * for later output in the correct order. */ static void encode_sde(struct jbg_enc_state *s, long stripe, int layer, int plane) { unsigned char *hp, *lp1, *lp2, *p0, *p1, *q1, *q2; unsigned long hl, ll, hx, hy, lx, ly, hbpl, lbpl; unsigned long line_h0 = 0, line_h1 = 0; unsigned long line_h2, line_h3, line_l1, line_l2, line_l3; struct jbg_arenc_state *se; unsigned long y; /* current line number in highres image */ unsigned long i; /* current line number within highres stripe */ unsigned long j; /* current column number in highres image */ long o; unsigned a, p, t; int ltp, ltp_old, cx; unsigned long c_all, c[MX_MAX + 1], cmin, cmax, clmin, clmax; int tmax, at_determined; int new_tx; long new_tx_line = -1; int reset; struct jbg_buf *new_jbg_buf; #ifdef DEBUG static long tp_lines, tp_exceptions, tp_pixels, dp_pixels; static long encoded_pixels; #endif /* return immediately if this stripe has already been encoded */ if (s->sde[stripe][layer][plane] != SDE_TODO) return; #ifdef DEBUG if (stripe == 0) tp_lines = tp_exceptions = tp_pixels = dp_pixels = encoded_pixels = 0; fprintf(stderr, "encode_sde: s/d/p = %2ld/%2d/%2d\n", stripe, layer, plane); #endif /* number of lines per stripe in highres image */ hl = s->l0 << layer; /* number of lines per stripe in lowres image */ ll = hl >> 1; /* current line number in highres image */ y = stripe * hl; /* number of pixels in highres image */ hx = jbg_ceil_half(s->xd, s->d - layer); hy = jbg_ceil_half(s->yd, s->d - layer); /* number of pixels in lowres image */ lx = jbg_ceil_half(hx, 1); ly = jbg_ceil_half(hy, 1); /* bytes per line in highres and lowres image */ hbpl = jbg_ceil_half(hx, 3); lbpl = jbg_ceil_half(lx, 3); /* pointer to first image byte of highres stripe */ hp = s->lhp[s->highres[plane]][plane] + stripe * hl * hbpl; lp2 = s->lhp[1 - s->highres[plane]][plane] + stripe * ll * lbpl; lp1 = lp2 + lbpl; /* check whether we can refer to any state of a previous stripe */ reset = (stripe == 0) || (s->options & JBG_SDRST); /* initialize arithmetic encoder */ se = s->s + plane; arith_encode_init(se, !reset); s->sde[stripe][layer][plane] = jbg_buf_init(&s->free_list); se->byte_out = jbg_buf_write; se->file = s->sde[stripe][layer][plane]; /* initialize adaptive template movement algorithm */ c_all = 0; for (t = 0; t <= s->mx; t++) c[t] = 0; if (stripe == 0) /* the SDRST case is handled at the end */ s->tx[plane] = 0; new_tx = -1; at_determined = 0; /* we haven't yet decided the template move */ if (s->mx == 0) at_determined = 1; /* initialize typical prediction */ ltp = 0; if (reset) ltp_old = 0; else { ltp_old = 1; p1 = hp - hbpl; if (y > 1) { q1 = p1 - hbpl; while (p1 < hp && (ltp_old = (*p1++ == *q1++)) != 0) ; } else while (p1 < hp && (ltp_old = (*p1++ == 0)) != 0) ; } if (layer == 0) { /* * Encode lowest resolution layer */ for (i = 0; i < hl && y < hy; i++, y++) { /* check whether it is worth to perform an ATMOVE */ if (!at_determined && c_all > 2048) { cmin = clmin = 0xffffffffL; cmax = clmax = 0; tmax = 0; for (t = (s->options & JBG_LRLTWO) ? 5 : 3; t <= s->mx; t++) { if (c[t] > cmax) cmax = c[t]; if (c[t] < cmin) cmin = c[t]; if (c[t] > c[tmax]) tmax = t; } clmin = (c[0] < cmin) ? c[0] : cmin; clmax = (c[0] > cmax) ? c[0] : cmax; if (c_all - cmax < (c_all >> 3) && cmax - c[s->tx[plane]] > c_all - cmax && cmax - c[s->tx[plane]] > (c_all >> 4) && /* ^ T.82 said < here, fixed in Cor.1/25 */ cmax - (c_all - c[s->tx[plane]]) > c_all - cmax && cmax - (c_all - c[s->tx[plane]]) > (c_all >> 4) && cmax - cmin > (c_all >> 2) && (s->tx[plane] || clmax - clmin > (c_all >> 3))) { /* we have decided to perform an ATMOVE */ new_tx = tmax; if (!(s->options & JBG_DELAY_AT)) { new_tx_line = i; s->tx[plane] = new_tx; } #ifdef DEBUG fprintf(stderr, "ATMOVE: line=%ld, tx=%d, c_all=%ld\n", i, new_tx, c_all); #endif } at_determined = 1; } assert(s->tx[plane] >= 0); /* i.e., tx can safely be cast to unsigned */ /* typical prediction */ if (s->options & JBG_TPBON) { ltp = 1; p1 = hp; if (i > 0 || !reset) { q1 = hp - hbpl; while (q1 < hp && (ltp = (*p1++ == *q1++)) != 0) ; } else while (p1 < hp + hbpl && (ltp = (*p1++ == 0)) != 0) ; arith_encode(se, (s->options & JBG_LRLTWO) ? TPB2CX : TPB3CX, ltp == ltp_old); #ifdef DEBUG tp_lines += ltp; #endif ltp_old = ltp; if (ltp) { /* skip next line */ hp += hbpl; continue; } } /* * Layout of the variables line_h1, line_h2, line_h3, which contain * as bits the neighbour pixels of the currently coded pixel X: * * 76543210765432107654321076543210 line_h3 * 76543210765432107654321076543210 line_h2 * 76543210765432107654321X76543210 line_h1 */ line_h1 = line_h2 = line_h3 = 0; if (i > 0 || !reset) line_h2 = (long)*(hp - hbpl) << 8; if (i > 1 || !reset) line_h3 = (long)*(hp - hbpl - hbpl) << 8; /* encode line */ for (j = 0; j < hx; hp++) { line_h1 |= *hp; if (j < hbpl * 8 - 8 && (i > 0 || !reset)) { line_h2 |= *(hp - hbpl + 1); if (i > 1 || !reset) line_h3 |= *(hp - hbpl - hbpl + 1); } if (s->options & JBG_LRLTWO) { /* two line template */ do { line_h1 <<= 1; line_h2 <<= 1; line_h3 <<= 1; if (s->tx[plane]) { if ((unsigned) s->tx[plane] > j) a = 0; else { o = (j - s->tx[plane]) - (j & ~7L); a = (hp[o >> 3] >> (7 - (o & 7))) & 1; a <<= 4; } assert(s->tx[plane] > 23 || a == ((line_h1 >> (4 + s->tx[plane])) & 0x010)); arith_encode(se, (((line_h2 >> 10) & 0x3e0) | a | ((line_h1 >> 9) & 0x00f)), (line_h1 >> 8) & 1); } else arith_encode(se, (((line_h2 >> 10) & 0x3f0) | ((line_h1 >> 9) & 0x00f)), (line_h1 >> 8) & 1); #ifdef DEBUG encoded_pixels++; #endif /* statistics for adaptive template changes */ if (!at_determined && j >= s->mx && j < hx-2) { p = (line_h1 & 0x100) != 0; /* current pixel value */ c[0] += ((line_h2 & 0x4000) != 0) == p; /* default position */ assert(!(((line_h2 >> 6) ^ line_h1) & 0x100) == (((line_h2 & 0x4000) != 0) == p)); for (t = 5; t <= s->mx && t <= j; t++) { o = (j - t) - (j & ~7L); a = (hp[o >> 3] >> (7 - (o & 7))) & 1; assert(t > 23 || (a == p) == !(((line_h1 >> t) ^ line_h1) & 0x100)); c[t] += a == p; } for (; t <= s->mx; t++) { c[t] += 0 == p; } ++c_all; } } while (++j & 7 && j < hx); } else { /* three line template */ do { line_h1 <<= 1; line_h2 <<= 1; line_h3 <<= 1; if (s->tx[plane]) { if ((unsigned) s->tx[plane] > j) a = 0; else { o = (j - s->tx[plane]) - (j & ~7L); a = (hp[o >> 3] >> (7 - (o & 7))) & 1; a <<= 2; } assert(s->tx[plane] > 23 || a == ((line_h1 >> (6 + s->tx[plane])) & 0x004)); arith_encode(se, (((line_h3 >> 8) & 0x380) | ((line_h2 >> 12) & 0x078) | a | ((line_h1 >> 9) & 0x003)), (line_h1 >> 8) & 1); } else arith_encode(se, (((line_h3 >> 8) & 0x380) | ((line_h2 >> 12) & 0x07c) | ((line_h1 >> 9) & 0x003)), (line_h1 >> 8) & 1); #ifdef DEBUG encoded_pixels++; #endif /* statistics for adaptive template changes */ if (!at_determined && j >= s->mx && j < hx-2) { p = (line_h1 & 0x100) != 0; /* current pixel value */ c[0] += ((line_h2 & 0x4000) != 0) == p; /* default position */ assert(!(((line_h2 >> 6) ^ line_h1) & 0x100) == (((line_h2 & 0x4000) != 0) == p)); for (t = 3; t <= s->mx && t <= j; t++) { o = (j - t) - (j & ~7L); a = (hp[o >> 3] >> (7 - (o & 7))) & 1; assert(t > 23 || (a == p) == !(((line_h1 >> t) ^ line_h1) & 0x100)); c[t] += a == p; } for (; t <= s->mx; t++) { c[t] += 0 == p; } ++c_all; } } while (++j & 7 && j < hx); } /* if (s->options & JBG_LRLTWO) */ } /* for (j = ...) */ } /* for (i = ...) */ } else { /* * Encode differential layer */ for (i = 0; i < hl && y < hy; i++, y++) { /* check whether it is worth to perform an ATMOVE */ if (!at_determined && c_all > 2048) { cmin = clmin = 0xffffffffL; cmax = clmax = 0; tmax = 0; for (t = 3; t <= s->mx; t++) { if (c[t] > cmax) cmax = c[t]; if (c[t] < cmin) cmin = c[t]; if (c[t] > c[tmax]) tmax = t; } clmin = (c[0] < cmin) ? c[0] : cmin; clmax = (c[0] > cmax) ? c[0] : cmax; if (c_all - cmax < (c_all >> 3) && cmax - c[s->tx[plane]] > c_all - cmax && cmax - c[s->tx[plane]] > (c_all >> 4) && /* ^ T.82 said < here, fixed in Cor.1/25 */ cmax - (c_all - c[s->tx[plane]]) > c_all - cmax && cmax - (c_all - c[s->tx[plane]]) > (c_all >> 4) && cmax - cmin > (c_all >> 2) && (s->tx[plane] || clmax - clmin > (c_all >> 3))) { /* we have decided to perform an ATMOVE */ new_tx = tmax; if (!(s->options & JBG_DELAY_AT)) { new_tx_line = i; s->tx[plane] = new_tx; } #ifdef DEBUG fprintf(stderr, "ATMOVE: line=%ld, tx=%d, c_all=%ld\n", i, new_tx, c_all); #endif } at_determined = 1; } if ((i >> 1) >= ll - 1 || (y >> 1) >= ly - 1) lp1 = lp2; /* typical prediction */ if (s->options & JBG_TPDON && (i & 1) == 0) { q1 = lp1; q2 = lp2; p0 = p1 = hp; if (i < hl - 1 && y < hy - 1) p0 = hp + hbpl; if (i > 1 || !reset) line_l3 = (long)*(q2 - lbpl) << 8; else line_l3 = 0; line_l2 = (long)*q2 << 8; line_l1 = (long)*q1 << 8; ltp = 1; for (j = 0; j < lx && ltp; q1++, q2++) { if (j < lbpl * 8 - 8) { if (i > 1 || !reset) line_l3 |= *(q2 - lbpl + 1); line_l2 |= *(q2 + 1); line_l1 |= *(q1 + 1); } do { if ((j >> 2) < hbpl) { line_h1 = *(p1++); line_h0 = *(p0++); } do { line_l3 <<= 1; line_l2 <<= 1; line_l1 <<= 1; line_h1 <<= 2; line_h0 <<= 2; cx = (((line_l3 >> 15) & 0x007) | ((line_l2 >> 12) & 0x038) | ((line_l1 >> 9) & 0x1c0)); if (cx == 0x000) if ((line_h1 & 0x300) == 0 && (line_h0 & 0x300) == 0) s->tp[j] = 0; else { ltp = 0; #ifdef DEBUG tp_exceptions++; #endif } else if (cx == 0x1ff) if ((line_h1 & 0x300) == 0x300 && (line_h0 & 0x300) == 0x300) s->tp[j] = 1; else { ltp = 0; #ifdef DEBUG tp_exceptions++; #endif } else s->tp[j] = 2; } while (++j & 3 && j < lx); } while (j & 7 && j < lx); } /* for (j = ...) */ arith_encode(se, TPDCX, !ltp); #ifdef DEBUG tp_lines += ltp; #endif } /* * Layout of the variables line_h1, line_h2, line_h3, which contain * as bits the high resolution neighbour pixels of the currently coded * highres pixel X: * * 76543210 76543210 76543210 76543210 line_h3 * 76543210 76543210 76543210 76543210 line_h2 * 76543210 76543210 7654321X 76543210 line_h1 * * Layout of the variables line_l1, line_l2, line_l3, which contain * the low resolution pixels near the currently coded pixel as bits. * The lowres pixel in which the currently coded highres pixel is * located is marked as Y: * * 76543210 76543210 76543210 76543210 line_l3 * 76543210 7654321Y 76543210 76543210 line_l2 * 76543210 76543210 76543210 76543210 line_l1 */ line_h1 = line_h2 = line_h3 = line_l1 = line_l2 = line_l3 = 0; if (i > 0 || !reset) line_h2 = (long)*(hp - hbpl) << 8; if (i > 1 || !reset) { line_h3 = (long)*(hp - hbpl - hbpl) << 8; line_l3 = (long)*(lp2 - lbpl) << 8; } line_l2 = (long)*lp2 << 8; line_l1 = (long)*lp1 << 8; /* encode line */ for (j = 0; j < hx; lp1++, lp2++) { if ((j >> 1) < lbpl * 8 - 8) { if (i > 1 || !reset) line_l3 |= *(lp2 - lbpl + 1); line_l2 |= *(lp2 + 1); line_l1 |= *(lp1 + 1); } do { /* ... while (j & 15 && j < hx) */ assert(hp - (s->lhp[s->highres[plane]][plane] + (stripe * hl + i) * hbpl) == (ptrdiff_t) j >> 3); assert(lp2 - (s->lhp[1-s->highres[plane]][plane] + (stripe * ll + (i>>1)) * lbpl) == (ptrdiff_t) j >> 4); line_h1 |= *hp; if (j < hbpl * 8 - 8) { if (i > 0 || !reset) { line_h2 |= *(hp - hbpl + 1); if (i > 1 || !reset) line_h3 |= *(hp - hbpl - hbpl + 1); } } do { /* ... while (j & 7 && j < hx) */ line_l1 <<= 1; line_l2 <<= 1; line_l3 <<= 1; if (ltp && s->tp[j >> 1] < 2) { /* pixel are typical and have not to be encoded */ line_h1 <<= 2; line_h2 <<= 2; line_h3 <<= 2; #ifdef DEBUG do { ++tp_pixels; } while (++j & 1 && j < hx); #else j += 2; #endif } else do { /* ... while (++j & 1 && j < hx) */ line_h1 <<= 1; line_h2 <<= 1; line_h3 <<= 1; /* deterministic prediction */ if (s->options & JBG_DPON) { if ((y & 1) == 0) { if ((j & 1) == 0) { /* phase 0 */ if (s->dppriv[((line_l3 >> 16) & 0x003) | ((line_l2 >> 14) & 0x00c) | ((line_h1 >> 5) & 0x010) | ((line_h2 >> 10) & 0x0e0)] < 2) { #ifdef DEBUG ++dp_pixels; #endif continue; } } else { /* phase 1 */ if (s->dppriv[(((line_l3 >> 16) & 0x003) | ((line_l2 >> 14) & 0x00c) | ((line_h1 >> 5) & 0x030) | ((line_h2 >> 10) & 0x1c0)) + 256] < 2) { #ifdef DEBUG ++dp_pixels; #endif continue; } } } else { if ((j & 1) == 0) { /* phase 2 */ if (s->dppriv[(((line_l3 >> 16) & 0x003) | ((line_l2 >> 14) & 0x00c) | ((line_h1 >> 5) & 0x010) | ((line_h2 >> 10) & 0x0e0) | ((line_h3 >> 7) & 0x700)) + 768] < 2) { #ifdef DEBUG ++dp_pixels; #endif continue; } } else { /* phase 3 */ if (s->dppriv[(((line_l3 >> 16) & 0x003) | ((line_l2 >> 14) & 0x00c) | ((line_h1 >> 5) & 0x030) | ((line_h2 >> 10) & 0x1c0) | ((line_h3 >> 7) & 0xe00)) + 2816] < 2) { #ifdef DEBUG ++dp_pixels; #endif continue; } } } } /* determine context */ if (s->tx[plane]) { if ((unsigned) s->tx[plane] > j) a = 0; else { o = (j - s->tx[plane]) - (j & ~7L); a = (hp[o >> 3] >> (7 - (o & 7))) & 1; a <<= 4; } assert(s->tx[plane] > 23 || a == ((line_h1 >> (4 + s->tx[plane])) & 0x010)); cx = (((line_h1 >> 9) & 0x003) | a | ((line_h2 >> 13) & 0x00c) | ((line_h3 >> 11) & 0x020)); } else cx = (((line_h1 >> 9) & 0x003) | ((line_h2 >> 13) & 0x01c) | ((line_h3 >> 11) & 0x020)); if (j & 1) cx |= (((line_l2 >> 9) & 0x0c0) | ((line_l1 >> 7) & 0x300)) | (1UL << 10); else cx |= (((line_l2 >> 10) & 0x0c0) | ((line_l1 >> 8) & 0x300)); cx |= (y & 1) << 11; arith_encode(se, cx, (line_h1 >> 8) & 1); #ifdef DEBUG encoded_pixels++; #endif /* statistics for adaptive template changes */ if (!at_determined && j >= s->mx) { c[0] += !(((line_h2 >> 6) ^ line_h1) & 0x100); for (t = 3; t <= s->mx; t++) c[t] += !(((line_h1 >> t) ^ line_h1) & 0x100); ++c_all; } } while (++j & 1 && j < hx); } while (j & 7 && j < hx); hp++; } while (j & 15 && j < hx); } /* for (j = ...) */ /* low resolution pixels are used twice */ if ((i & 1) == 0) { lp1 -= lbpl; lp2 -= lbpl; } } /* for (i = ...) */ } arith_encode_flush(se); jbg_buf_remove_zeros(s->sde[stripe][layer][plane]); jbg_buf_write(MARKER_ESC, s->sde[stripe][layer][plane]); jbg_buf_write((s->options & JBG_SDRST) ? MARKER_SDRST : MARKER_SDNORM, s->sde[stripe][layer][plane]); if (s->options & JBG_SDRST) s->tx[plane] = 0; /* add ATMOVE */ if (new_tx != -1) { if (s->options & JBG_DELAY_AT) { /* ATMOVE will become active at the first line of the next stripe */ s->tx[plane] = new_tx; jbg_buf_write(MARKER_ESC, s->sde[stripe][layer][plane]); jbg_buf_write(MARKER_ATMOVE, s->sde[stripe][layer][plane]); jbg_buf_write(0, s->sde[stripe][layer][plane]); jbg_buf_write(0, s->sde[stripe][layer][plane]); jbg_buf_write(0, s->sde[stripe][layer][plane]); jbg_buf_write(0, s->sde[stripe][layer][plane]); jbg_buf_write(s->tx[plane], s->sde[stripe][layer][plane]); jbg_buf_write(0, s->sde[stripe][layer][plane]); } else { /* ATMOVE has already become active during this stripe * => we have to prefix the SDE data with an ATMOVE marker */ new_jbg_buf = jbg_buf_init(&s->free_list); jbg_buf_write(MARKER_ESC, new_jbg_buf); jbg_buf_write(MARKER_ATMOVE, new_jbg_buf); jbg_buf_write((new_tx_line >> 24) & 0xff, new_jbg_buf); jbg_buf_write((new_tx_line >> 16) & 0xff, new_jbg_buf); jbg_buf_write((new_tx_line >> 8) & 0xff, new_jbg_buf); jbg_buf_write(new_tx_line & 0xff, new_jbg_buf); jbg_buf_write(new_tx, new_jbg_buf); jbg_buf_write(0, new_jbg_buf); jbg_buf_prefix(new_jbg_buf, &s->sde[stripe][layer][plane]); } } #if 0 if (stripe == s->stripes - 1) fprintf(stderr, "tp_lines = %ld, tp_exceptions = %ld, tp_pixels = %ld, " "dp_pixels = %ld, encoded_pixels = %ld\n", tp_lines, tp_exceptions, tp_pixels, dp_pixels, encoded_pixels); #endif return; } /* * Create the next lower resolution version of an image */ static void resolution_reduction(struct jbg_enc_state *s, int plane, int higher_layer) { unsigned long hl, ll, hx, hy, lx, ly, hbpl, lbpl; unsigned char *hp1, *hp2, *hp3, *lp; unsigned long line_h1, line_h2, line_h3, line_l2; unsigned long y; /* current line number in lowres image */ unsigned long i; /* current line number within lowres stripe */ unsigned long j; /* current column number in lowres image */ int pix, k, l; /* number of lines per stripe in highres image */ hl = s->l0 << higher_layer; /* number of lines per stripe in lowres image */ ll = hl >> 1; /* number of pixels in highres image */ hx = jbg_ceil_half(s->xd, s->d - higher_layer); hy = jbg_ceil_half(s->yd, s->d - higher_layer); /* number of pixels in lowres image */ lx = jbg_ceil_half(hx, 1); ly = jbg_ceil_half(hy, 1); /* bytes per line in highres and lowres image */ hbpl = jbg_ceil_half(hx, 3); lbpl = jbg_ceil_half(lx, 3); /* pointers to first image bytes */ hp2 = s->lhp[s->highres[plane]][plane]; hp1 = hp2 + hbpl; hp3 = hp2 - hbpl; lp = s->lhp[1 - s->highres[plane]][plane]; #ifdef DEBUG fprintf(stderr, "resolution_reduction: plane = %d, higher_layer = %d\n", plane, higher_layer); #endif /* * Layout of the variables line_h1, line_h2, line_h3, which contain * as bits the high resolution neighbour pixels of the currently coded * lowres pixel /\: * \/ * * 76543210 76543210 76543210 76543210 line_h3 * 76543210 76543210 765432/\ 76543210 line_h2 * 76543210 76543210 765432\/ 76543210 line_h1 * * Layout of the variable line_l2, which contains the low resolution * pixels near the currently coded pixel as bits. The lowres pixel * which is currently coded is marked as X: * * 76543210 76543210 76543210 76543210 line_l2 * X */ for (y = 0; y < ly;) { for (i = 0; i < ll && y < ly; i++, y++) { if (2*y + 1 >= hy) hp1 = hp2; pix = 0; line_h1 = line_h2 = line_h3 = line_l2 = 0; for (j = 0; j < lbpl * 8; j += 8) { *lp = 0; if (i > 0 || (y > 0 && !(s->options & JBG_SDRST))) line_l2 |= *(lp-lbpl); for (k = 0; k < 8 && j + k < lx; k += 4) { if (((j + k) >> 2) < hbpl) { if (i > 0 || (y > 0 && !(s->options & JBG_SDRST))) line_h3 |= *hp3; ++hp3; line_h2 |= *(hp2++); line_h1 |= *(hp1++); } for (l = 0; l < 4 && j + k + l < lx; l++) { line_h3 <<= 2; line_h2 <<= 2; line_h1 <<= 2; line_l2 <<= 1; pix = s->res_tab[((line_h1 >> 8) & 0x007) | ((line_h2 >> 5) & 0x038) | ((line_h3 >> 2) & 0x1c0) | (pix << 9) | ((line_l2 << 2) & 0xc00)]; *lp = (*lp << 1) | pix; } } ++lp; } *(lp - 1) <<= lbpl * 8 - lx; hp1 += hbpl; hp2 += hbpl; hp3 += hbpl; } } #ifdef DEBUG { FILE *f; char fn[50]; sprintf(fn, "dbg_d=%02d.pbm", higher_layer - 1); f = fopen(fn, "wb"); fprintf(f, "P4\n%lu %lu\n", lx, ly); fwrite(s->lhp[1 - s->highres[plane]][plane], 1, lbpl * ly, f); fclose(f); } #endif return; } /* * This function is called inside the three loops of jbg_enc_out() in * order to write the next SDE. It has first to generate the required * SDE and all SDEs which have to be encoded before this SDE can be * created. The problem here is that if we want to output a lower * resolution layer, we have to apply the resolution reduction * algorithm first to get it. As we try to safe as much memory as * possible, the resolution reduction will overwrite previous higher * resolution bitmaps. Consequently, we have to encode and buffer SDEs * which depend on higher resolution layers before we can start the * resolution reduction. All the logic about which SDE has to be * encoded before resolution reduction is allowed is handled * here. This approach may be a bit more complex than alternative ways * of doing it, but it minimizes the amount of temporary memory used. */ static void output_sde(struct jbg_enc_state *s, unsigned long stripe, int layer, int plane) { int lfcl; /* lowest fully coded layer */ long i; unsigned long u; assert(s->sde[stripe][layer][plane] != SDE_DONE); if (s->sde[stripe][layer][plane] != SDE_TODO) { #ifdef DEBUG fprintf(stderr, "writing SDE: s/d/p = %2lu/%2d/%2d\n", stripe, layer, plane); #endif jbg_buf_output(&s->sde[stripe][layer][plane], s->data_out, s->file); s->sde[stripe][layer][plane] = SDE_DONE; return; } /* Determine the smallest resolution layer in this plane for which * not yet all stripes have been encoded into SDEs. This layer will * have to be completely coded, before we can apply the next * resolution reduction step. */ lfcl = 0; for (i = s->d; i >= 0; i--) if (s->sde[s->stripes - 1][i][plane] == SDE_TODO) { lfcl = i + 1; break; } if (lfcl > s->d && s->d > 0 && stripe == 0) { /* perform the first resolution reduction */ resolution_reduction(s, plane, s->d); } /* In case HITOLO is not used, we have to encode and store the higher * resolution layers first, although we do not need them right now. */ while (lfcl - 1 > layer) { for (u = 0; u < s->stripes; u++) encode_sde(s, u, lfcl - 1, plane); --lfcl; s->highres[plane] ^= 1; if (lfcl > 1) resolution_reduction(s, plane, lfcl - 1); } encode_sde(s, stripe, layer, plane); #ifdef DEBUG fprintf(stderr, "writing SDE: s/d/p = %2lu/%2d/%2d\n", stripe, layer, plane); #endif jbg_buf_output(&s->sde[stripe][layer][plane], s->data_out, s->file); s->sde[stripe][layer][plane] = SDE_DONE; if (stripe == s->stripes - 1 && layer > 0 && s->sde[0][layer-1][plane] == SDE_TODO) { s->highres[plane] ^= 1; if (layer > 1) resolution_reduction(s, plane, layer - 1); } return; } /* * Convert the table which controls the deterministic prediction * process from the internal format into the representation required * for the 1728 byte long DPTABLE element of a BIH. * * The bit order of the DPTABLE format (see also ITU-T T.82 figure 13) is * * high res: 4 5 6 low res: 0 1 * 7 8 9 2 3 * 10 11 12 * * were 4 table entries are packed into one byte, while we here use * internally an unpacked 6912 byte long table indexed by the following * bit order: * * high res: 7 6 5 high res: 8 7 6 low res: 1 0 * (phase 0) 4 . . (phase 1) 5 4 . 3 2 * . . . . . . * * high res: 10 9 8 high res: 11 10 9 * (phase 2) 7 6 5 (phase 3) 8 7 6 * 4 . . 5 4 . */ void jbg_int2dppriv(unsigned char *dptable, const char *internal) { int i, j, k; int trans0[ 8] = { 1, 0, 3, 2, 7, 6, 5, 4 }; int trans1[ 9] = { 1, 0, 3, 2, 8, 7, 6, 5, 4 }; int trans2[11] = { 1, 0, 3, 2, 10, 9, 8, 7, 6, 5, 4 }; int trans3[12] = { 1, 0, 3, 2, 11, 10, 9, 8, 7, 6, 5, 4 }; for (i = 0; i < 1728; dptable[i++] = 0) ; #define FILL_TABLE1(offset, len, trans) \ for (i = 0; i < len; i++) { \ k = 0; \ for (j = 0; i >> j; j++) \ k |= ((i >> j) & 1) << trans[j]; \ dptable[(i + offset) >> 2] |= \ (internal[k + offset] & 3) << ((3 - (i&3)) << 1); \ } FILL_TABLE1( 0, 256, trans0); FILL_TABLE1( 256, 512, trans1); FILL_TABLE1( 768, 2048, trans2); FILL_TABLE1(2816, 4096, trans3); return; } /* * Convert the table which controls the deterministic prediction * process from the 1728 byte long DPTABLE format into the 6912 byte long * internal format. */ void jbg_dppriv2int(char *internal, const unsigned char *dptable) { int i, j, k; int trans0[ 8] = { 1, 0, 3, 2, 7, 6, 5, 4 }; int trans1[ 9] = { 1, 0, 3, 2, 8, 7, 6, 5, 4 }; int trans2[11] = { 1, 0, 3, 2, 10, 9, 8, 7, 6, 5, 4 }; int trans3[12] = { 1, 0, 3, 2, 11, 10, 9, 8, 7, 6, 5, 4 }; #define FILL_TABLE2(offset, len, trans) \ for (i = 0; i < len; i++) { \ k = 0; \ for (j = 0; i >> j; j++) \ k |= ((i >> j) & 1) << trans[j]; \ internal[k + offset] = \ (dptable[(i + offset) >> 2] >> ((3 - (i & 3)) << 1)) & 3; \ } FILL_TABLE2( 0, 256, trans0); FILL_TABLE2( 256, 512, trans1); FILL_TABLE2( 768, 2048, trans2); FILL_TABLE2(2816, 4096, trans3); return; } /* * Encode one full BIE and pass the generated data to the specified * call-back function */ void jbg_enc_out(struct jbg_enc_state *s) { unsigned long bpl; unsigned char buf[20]; unsigned long xd, yd, y; long ii[3], is[3], ie[3]; /* generic variables for the 3 nested loops */ unsigned long stripe; int layer, plane; int order; unsigned char dpbuf[1728]; /* some sanity checks */ s->order &= JBG_HITOLO | JBG_SEQ | JBG_ILEAVE | JBG_SMID; order = s->order & (JBG_SEQ | JBG_ILEAVE | JBG_SMID); if (iindex[order][0] < 0) s->order = order = JBG_SMID | JBG_ILEAVE; if (s->options & JBG_DPON && s->dppriv != jbg_dptable) s->options |= JBG_DPPRIV; if (s->mx > MX_MAX) s->mx = MX_MAX; s->my = 0; if (s->mx && s->mx < ((s->options & JBG_LRLTWO) ? 5U : 3U)) s->mx = 0; if (s->d > 255 || s->d < 0 || s->dh > s->d || s->dh < 0 || s->dl < 0 || s->dl > s->dh || s->planes < 0 || s->planes > 255) return; /* prevent uint32 overflow: s->l0 * 2 ^ s->d < 2 ^ 32 */ if (s->d > 31 || (s->d != 0 && s->l0 >= (1UL << (32 - s->d)))) return; if (s->yd1 < s->yd) s->yd1 = s->yd; if (s->yd1 > s->yd) s->options |= JBG_VLENGTH; /* ensure correct zero padding of bitmap at the final byte of each line */ if (s->xd & 7) { bpl = jbg_ceil_half(s->xd, 3); /* bytes per line */ for (plane = 0; plane < s->planes; plane++) for (y = 0; y < s->yd; y++) s->lhp[0][plane][y * bpl + bpl - 1] &= ~((1 << (8 - (s->xd & 7))) - 1); } /* prepare BIH */ buf[0] = s->dl; buf[1] = s->dh; buf[2] = s->planes; buf[3] = 0; xd = jbg_ceil_half(s->xd, s->d - s->dh); yd = jbg_ceil_half(s->yd1, s->d - s->dh); buf[4] = xd >> 24; buf[5] = (xd >> 16) & 0xff; buf[6] = (xd >> 8) & 0xff; buf[7] = xd & 0xff; buf[8] = yd >> 24; buf[9] = (yd >> 16) & 0xff; buf[10] = (yd >> 8) & 0xff; buf[11] = yd & 0xff; buf[12] = s->l0 >> 24; buf[13] = (s->l0 >> 16) & 0xff; buf[14] = (s->l0 >> 8) & 0xff; buf[15] = s->l0 & 0xff; buf[16] = s->mx; buf[17] = s->my; buf[18] = s->order; buf[19] = s->options & 0x7f; #if 0 /* sanitize L0 (if it was set to 0xffffffff for T.85-style NEWLEN tests) */ if (s->l0 > (s->yd >> s->d)) s->l0 = s->yd >> s->d; #endif /* calculate number of stripes that will be required */ s->stripes = jbg_stripes(s->l0, s->yd, s->d); /* allocate buffers for SDE pointers */ if (s->sde == NULL) { s->sde = (struct jbg_buf ****) checked_malloc(s->stripes, sizeof(struct jbg_buf ***)); for (stripe = 0; stripe < s->stripes; stripe++) { s->sde[stripe] = (struct jbg_buf ***) checked_malloc(s->d + 1, sizeof(struct jbg_buf **)); for (layer = 0; layer < s->d + 1; layer++) { s->sde[stripe][layer] = (struct jbg_buf **) checked_malloc(s->planes, sizeof(struct jbg_buf *)); for (plane = 0; plane < s->planes; plane++) s->sde[stripe][layer][plane] = SDE_TODO; } } } /* output BIH */ s->data_out(buf, 20, s->file); if ((s->options & (JBG_DPON | JBG_DPPRIV | JBG_DPLAST)) == (JBG_DPON | JBG_DPPRIV)) { /* write private table */ jbg_int2dppriv(dpbuf, s->dppriv); s->data_out(dpbuf, 1728, s->file); } #if 0 /* * Encode everything first. This is a simple-minded alternative to * all the tricky on-demand encoding logic in output_sde() for * debugging purposes. */ for (layer = s->dh; layer >= s->dl; layer--) { for (plane = 0; plane < s->planes; plane++) { if (layer > 0) resolution_reduction(s, plane, layer); for (stripe = 0; stripe < s->stripes; stripe++) encode_sde(s, stripe, layer, plane); s->highres[plane] ^= 1; } } #endif /* * Generic loops over all SDEs. Which loop represents layer, plane and * stripe depends on the option flags. */ /* start and end value for each loop */ is[iindex[order][STRIPE]] = 0; ie[iindex[order][STRIPE]] = s->stripes - 1; is[iindex[order][LAYER]] = s->dl; ie[iindex[order][LAYER]] = s->dh; is[iindex[order][PLANE]] = 0; ie[iindex[order][PLANE]] = s->planes - 1; for (ii[0] = is[0]; ii[0] <= ie[0]; ii[0]++) for (ii[1] = is[1]; ii[1] <= ie[1]; ii[1]++) for (ii[2] = is[2]; ii[2] <= ie[2]; ii[2]++) { stripe = ii[iindex[order][STRIPE]]; if (s->order & JBG_HITOLO) layer = s->dh - (ii[iindex[order][LAYER]] - s->dl); else layer = ii[iindex[order][LAYER]]; plane = ii[iindex[order][PLANE]]; /* output comment marker segment if there is any pending */ if (s->comment) { buf[0] = MARKER_ESC; buf[1] = MARKER_COMMENT; buf[2] = s->comment_len >> 24; buf[3] = (s->comment_len >> 16) & 0xff; buf[4] = (s->comment_len >> 8) & 0xff; buf[5] = s->comment_len & 0xff; s->data_out(buf, 6, s->file); s->data_out(s->comment, s->comment_len, s->file); s->comment = NULL; } output_sde(s, stripe, layer, plane); /* * When we generate a NEWLEN test case (s->yd1 > s->yd), output * NEWLEN after last stripe if we have only a single * resolution layer or plane (see ITU-T T.85 profile), otherwise * output NEWLEN before last stripe. */ if (s->yd1 > s->yd && (stripe == s->stripes - 1 || (stripe == s->stripes - 2 && (s->dl != s->dh || s->planes > 1)))) { s->yd1 = s->yd; yd = jbg_ceil_half(s->yd, s->d - s->dh); buf[0] = MARKER_ESC; buf[1] = MARKER_NEWLEN; buf[2] = yd >> 24; buf[3] = (yd >> 16) & 0xff; buf[4] = (yd >> 8) & 0xff; buf[5] = yd & 0xff; s->data_out(buf, 6, s->file); #ifdef DEBUG fprintf(stderr, "NEWLEN: yd=%lu\n", yd); #endif if (stripe == s->stripes - 1) { buf[1] = MARKER_SDNORM; s->data_out(buf, 2, s->file); } } } return; } void jbg_enc_free(struct jbg_enc_state *s) { unsigned long stripe; int layer, plane; #ifdef DEBUG fprintf(stderr, "jbg_enc_free(%p)\n", (void *) s); #endif /* clear buffers for SDEs */ if (s->sde) { for (stripe = 0; stripe < s->stripes; stripe++) { for (layer = 0; layer < s->d + 1; layer++) { for (plane = 0; plane < s->planes; plane++) if (s->sde[stripe][layer][plane] != SDE_DONE && s->sde[stripe][layer][plane] != SDE_TODO) jbg_buf_free(&s->sde[stripe][layer][plane]); checked_free(s->sde[stripe][layer]); } checked_free(s->sde[stripe]); } checked_free(s->sde); } /* clear free_list */ jbg_buf_free(&s->free_list); /* clear memory for arithmetic encoder states */ checked_free(s->s); /* clear memory for differential-layer typical prediction buffer */ checked_free(s->tp); /* clear memory for adaptive template pixel offsets */ checked_free(s->tx); /* clear lowres image buffers */ if (s->lhp[1]) { for (plane = 0; plane < s->planes; plane++) checked_free(s->lhp[1][plane]); checked_free(s->lhp[1]); } /* clear buffer for index of highres image in lhp */ checked_free(s->highres); return; } /* * Convert the error codes used by jbg_dec_in() into an English ASCII string */ const char *jbg_strerror(int errnum) { errnum >>= 4; if (errnum < 0 || (unsigned) errnum >= sizeof(errmsg)/sizeof(errmsg[0])) return "Unknown error code passed to jbg_strerror()"; return errmsg[errnum]; } /* * The constructor for a decoder */ void jbg_dec_init(struct jbg_dec_state *s) { s->order = 0; s->d = -1; s->bie_len = 0; s->buf_len = 0; s->dppriv = NULL; s->xmax = 4294967295UL; s->ymax = 4294967295UL; s->dmax = 256; s->s = NULL; return; } /* * Specify a maximum image size for the decoder. If the JBIG file has * the order bit ILEAVE, but not the bit SEQ set, then the decoder * will abort to decode after the image has reached the maximal * resolution layer which is still not wider than xmax or higher than * ymax. */ void jbg_dec_maxsize(struct jbg_dec_state *s, unsigned long xmax, unsigned long ymax) { if (xmax > 0) s->xmax = xmax; if (ymax > 0) s->ymax = ymax; return; } /* * Decode the new len PSDC bytes to which data points and add them to * the current stripe. Return the number of bytes which have actually * been read (this will be less than len if a marker segment was * part of the data or if the final byte was 0xff, in which case * this code cannot determine whether we have a marker segment). */ static size_t decode_pscd(struct jbg_dec_state *s, unsigned char *data, size_t len) { unsigned long stripe; unsigned int layer, plane; unsigned long hl, ll, y, hx, hy, lx, ly, hbpl, lbpl; unsigned char *hp, *lp1, *lp2, *p1, *q1; register unsigned long line_h1, line_h2, line_h3; register unsigned long line_l1, line_l2, line_l3; struct jbg_ardec_state *se; unsigned long x; long o; unsigned a; int n; int pix, cx = 0, slntp, tx; /* SDE loop variables */ stripe = s->ii[iindex[s->order & 7][STRIPE]]; layer = s->ii[iindex[s->order & 7][LAYER]]; plane = s->ii[iindex[s->order & 7][PLANE]]; /* forward data to arithmetic decoder */ se = s->s[plane] + layer - s->dl; se->pscd_ptr = data; se->pscd_end = data + len; /* number of lines per stripe in highres image */ hl = s->l0 << layer; /* number of lines per stripe in lowres image */ ll = hl >> 1; /* current line number in highres image */ y = stripe * hl + s->i; /* number of pixels in highres image */ hx = jbg_ceil_half(s->xd, s->d - layer); hy = jbg_ceil_half(s->yd, s->d - layer); /* number of pixels in lowres image */ lx = jbg_ceil_half(hx, 1); ly = jbg_ceil_half(hy, 1); /* bytes per line in highres and lowres image */ hbpl = jbg_ceil_half(hx, 3); lbpl = jbg_ceil_half(lx, 3); /* pointer to highres and lowres image bytes */ hp = s->lhp[ layer & 1][plane] + (stripe * hl + s->i) * hbpl + (s->x >> 3); lp2 = s->lhp[(layer-1) & 1][plane] + (stripe * ll + (s->i >> 1)) * lbpl + (s->x >> 4); lp1 = lp2 + lbpl; /* restore a few local variables */ line_h1 = s->line_h1; line_h2 = s->line_h2; line_h3 = s->line_h3; line_l1 = s->line_l1; line_l2 = s->line_l2; line_l3 = s->line_l3; x = s->x; #ifdef DEBUG if (s->x == 0 && s->i == 0 && s->pseudo) fprintf(stderr, "decode_pscd(%p, %p, %ld): s/d/p = %2lu/%2u/%2u\n", (void *) s, (void *) data, (long) len, stripe, layer, plane); #endif if (s->x == 0 && s->i == 0 && (stripe == 0 || s->reset[plane][layer - s->dl]) && s->pseudo) { s->tx[plane][layer - s->dl] = s->ty[plane][layer - s->dl] = 0; s->lntp[plane][layer - s->dl] = 1; } if (layer == 0) { /* * Decode lowest resolution layer */ for (; s->i < hl && y < hy; s->i++, y++) { /* adaptive template changes */ if (x == 0 && s->pseudo) for (n = 0; n < s->at_moves; n++) if (s->at_line[n] == s->i) { s->tx[plane][layer - s->dl] = s->at_tx[n]; s->ty[plane][layer - s->dl] = s->at_ty[n]; #ifdef DEBUG fprintf(stderr, "ATMOVE: line=%lu, tx=%d, ty=%d.\n", s->i, s->tx[plane][layer - s->dl], s->ty[plane][layer - s->dl]); #endif } tx = s->tx[plane][layer - s->dl]; assert(tx >= 0); /* i.e., tx can safely be cast to unsigned */ /* typical prediction */ if (s->options & JBG_TPBON && s->pseudo) { slntp = arith_decode(se, (s->options & JBG_LRLTWO) ? TPB2CX : TPB3CX); if (slntp < 0) goto leave; s->lntp[plane][layer - s->dl] = !(slntp ^ s->lntp[plane][layer - s->dl]); if (!s->lntp[plane][layer - s->dl]) { /* this line is 'typical' (i.e. identical to the previous one) */ p1 = hp; if (s->i == 0 && (stripe == 0 || s->reset[plane][layer - s->dl])) while (p1 < hp + hbpl) *p1++ = 0; else { q1 = hp - hbpl; while (q1 < hp) *p1++ = *q1++; } hp += hbpl; continue; } /* this line is 'not typical' and has to be coded completely */ } s->pseudo = 0; /* * Layout of the variables line_h1, line_h2, line_h3, which contain * as bits the neighbour pixels of the currently decoded pixel X: * * 76543210 76543210 76543210 76543210 line_h3 * 76543210 76543210 76543210 76543210 line_h2 * 76543210 76543210 76543210 76543210 X line_h1 */ if (x == 0) { line_h1 = line_h2 = line_h3 = 0; if (s->i > 0 || (y > 0 && !s->reset[plane][layer - s->dl])) line_h2 = (long)*(hp - hbpl) << 8; if (s->i > 1 || (y > 1 && !s->reset[plane][layer - s->dl])) line_h3 = (long)*(hp - hbpl - hbpl) << 8; } /* * Another tiny JBIG standard bug: * * While implementing the line_h3 handling here, I discovered * another problem with the ITU-T T.82(1993 E) specification. * This might be a somewhat pathological case, however. The * standard is unclear about how a decoder should behave in the * following situation: * * Assume we are in layer 0 and all stripes are single lines * (L0=1 allowed by table 9). We are now decoding the first (and * only) line of the third stripe. Assume, the first stripe was * terminated by SDRST and the second stripe was terminated by * SDNORM. While decoding the only line of the third stripe with * the three-line template, we need access to pixels from the * previous two stripes. We know that the previous stripe * terminated with SDNROM, so we access the pixel from the * second stripe. But do we have to replace the pixels from the * first stripe by background pixels, because this stripe ended * with SDRST? The standard, especially clause 6.2.5 does never * mention this case, so the behaviour is undefined here. My * current implementation remembers only the marker used to * terminate the previous stripe. In the above example, the * pixels of the first stripe are accessed despite the fact that * this stripe ended with SDRST. An alternative (only slightly * more complicated) implementation would be to remember the end * marker (SDNORM or SDRST) of the previous two stripes in a * plane/layer and to act accordingly when accessing the two * previous lines. What am I supposed to do here? * * As the standard is unclear about the correct behaviour in the * situation of the above example, I strongly suggest to avoid * the following situation while encoding data with JBIG: * * LRLTWO = 0, L0=1 and both SDNORM and SDRST appear in layer 0. * * I guess that only a very few if any encoders will switch * between SDNORM and SDRST, so let us hope that this ambiguity * in the standard will never cause any interoperability * problems. * * Markus Kuhn -- 1995-04-30 */ /* decode line */ while (x < hx) { if ((x & 7) == 0) { if (x < hbpl * 8 - 8 && (s->i > 0 || (y > 0 && !s->reset[plane][layer - s->dl]))) { line_h2 |= *(hp - hbpl + 1); if (s->i > 1 || (y > 1 && !s->reset[plane][layer - s->dl])) line_h3 |= *(hp - hbpl - hbpl + 1); } } if (s->options & JBG_LRLTWO) { /* two line template */ do { if (tx) { if ((unsigned) tx > x) a = 0; else if (tx < 8) a = ((line_h1 >> (tx - 5)) & 0x010); else { o = (x - tx) - (x & ~7L); a = (hp[o >> 3] >> (7 - (o & 7))) & 1; a <<= 4; } assert(tx > 31 || a == ((line_h1 >> (tx - 5)) & 0x010)); pix = arith_decode(se, (((line_h2 >> 9) & 0x3e0) | a | (line_h1 & 0x00f))); } else pix = arith_decode(se, (((line_h2 >> 9) & 0x3f0) | (line_h1 & 0x00f))); if (pix < 0) goto leave; line_h1 = (line_h1 << 1) | pix; line_h2 <<= 1; } while ((++x & 7) && x < hx); } else { /* three line template */ do { if (tx) { if ((unsigned) tx > x) a = 0; else if (tx < 8) a = ((line_h1 >> (tx - 3)) & 0x004); else { o = (x - tx) - (x & ~7L); a = (hp[o >> 3] >> (7 - (o & 7))) & 1; a <<= 2; } assert(tx > 31 || a == ((line_h1 >> (tx - 3)) & 0x004)); pix = arith_decode(se, (((line_h3 >> 7) & 0x380) | ((line_h2 >> 11) & 0x078) | a | (line_h1 & 0x003))); } else pix = arith_decode(se, (((line_h3 >> 7) & 0x380) | ((line_h2 >> 11) & 0x07c) | (line_h1 & 0x003))); if (pix < 0) goto leave; line_h1 = (line_h1 << 1) | pix; line_h2 <<= 1; line_h3 <<= 1; } while ((++x & 7) && x < hx); } /* if (s->options & JBG_LRLTWO) */ *hp++ = line_h1; } /* while */ *(hp - 1) <<= hbpl * 8 - hx; x = 0; s->pseudo = 1; } /* for (i = ...) */ } else { /* * Decode differential layer */ for (; s->i < hl && y < hy; s->i++, y++) { /* adaptive template changes */ if (x == 0) for (n = 0; n < s->at_moves; n++) if (s->at_line[n] == s->i) { s->tx[plane][layer - s->dl] = s->at_tx[n]; s->ty[plane][layer - s->dl] = s->at_ty[n]; #ifdef DEBUG fprintf(stderr, "ATMOVE: line=%lu, tx=%d, ty=%d.\n", s->i, s->tx[plane][layer - s->dl], s->ty[plane][layer - s->dl]); #endif } tx = s->tx[plane][layer - s->dl]; /* handle lower border of low-resolution image */ if ((s->i >> 1) >= ll - 1 || (y >> 1) >= ly - 1) lp1 = lp2; /* typical prediction */ if ((s->options & JBG_TPDON) && s->pseudo) { if ((s->lntp[plane][layer - s->dl] = arith_decode(se, TPDCX)) < 0) goto leave; } s->pseudo = 0; /* * Layout of the variables line_h1, line_h2, line_h3, which contain * as bits the high resolution neighbour pixels of the currently * decoded highres pixel X: * * 76543210 76543210 76543210 76543210 line_h3 * 76543210 76543210 76543210 76543210 line_h2 * 76543210 76543210 76543210 76543210 X line_h1 * * Layout of the variables line_l1, line_l2, line_l3, which contain * the low resolution pixels near the currently decoded pixel as bits. * The lowres pixel in which the currently coded highres pixel is * located is marked as Y: * * 76543210 76543210 76543210 76543210 line_l3 * 76543210 76543210 Y6543210 76543210 line_l2 * 76543210 76543210 76543210 76543210 line_l1 */ if (x == 0) { line_h1 = line_h2 = line_h3 = line_l1 = line_l2 = line_l3 = 0; if (s->i > 0 || (y > 0 && !s->reset[plane][layer - s->dl])) { line_h2 = (long)*(hp - hbpl) << 8; if (s->i > 1 || (y > 1 && !s->reset[plane][layer - s->dl])) line_h3 = (long)*(hp - hbpl - hbpl) << 8; } if (s->i > 1 || (y > 1 && !s->reset[plane][layer-s->dl])) line_l3 = (long)*(lp2 - lbpl) << 8; line_l2 = (long)*lp2 << 8; line_l1 = (long)*lp1 << 8; } /* decode line */ while (x < hx) { if ((x & 15) == 0) if ((x >> 1) < lbpl * 8 - 8) { line_l1 |= *(lp1 + 1); line_l2 |= *(lp2 + 1); if (s->i > 1 || (y > 1 && !s->reset[plane][layer - s->dl])) line_l3 |= *(lp2 - lbpl + 1); } do { assert(hp - (s->lhp[ layer &1][plane] + (stripe * hl + s->i) * hbpl) == (ptrdiff_t) x >> 3); assert(lp2 - (s->lhp[(layer-1) &1][plane] + (stripe * ll + (s->i>>1)) * lbpl) == (ptrdiff_t) x >> 4); if ((x & 7) == 0) if (x < hbpl * 8 - 8) { if (s->i > 0 || (y > 0 && !s->reset[plane][layer - s->dl])) { line_h2 |= *(hp + 1 - hbpl); if (s->i > 1 || (y > 1 && !s->reset[plane][layer - s->dl])) line_h3 |= *(hp + 1 - hbpl - hbpl); } } do { if (!s->lntp[plane][layer - s->dl]) cx = (((line_l3 >> 14) & 0x007) | ((line_l2 >> 11) & 0x038) | ((line_l1 >> 8) & 0x1c0)); if (!s->lntp[plane][layer - s->dl] && (cx == 0x000 || cx == 0x1ff)) { /* pixels are typical and have not to be decoded */ do { line_h1 = (line_h1 << 1) | (cx & 1); } while ((++x & 1) && x < hx); line_h2 <<= 2; line_h3 <<= 2; } else do { /* deterministic prediction */ if (s->options & JBG_DPON) if ((y & 1) == 0) if ((x & 1) == 0) /* phase 0 */ pix = s->dppriv[((line_l3 >> 15) & 0x003) | ((line_l2 >> 13) & 0x00c) | ((line_h1 << 4) & 0x010) | ((line_h2 >> 9) & 0x0e0)]; else /* phase 1 */ pix = s->dppriv[(((line_l3 >> 15) & 0x003) | ((line_l2 >> 13) & 0x00c) | ((line_h1 << 4) & 0x030) | ((line_h2 >> 9) & 0x1c0)) + 256]; else if ((x & 1) == 0) /* phase 2 */ pix = s->dppriv[(((line_l3 >> 15) & 0x003) | ((line_l2 >> 13) & 0x00c) | ((line_h1 << 4) & 0x010) | ((line_h2 >> 9) & 0x0e0) | ((line_h3 >> 6) & 0x700)) + 768]; else /* phase 3 */ pix = s->dppriv[(((line_l3 >> 15) & 0x003) | ((line_l2 >> 13) & 0x00c) | ((line_h1 << 4) & 0x030) | ((line_h2 >> 9) & 0x1c0) | ((line_h3 >> 6) & 0xe00)) + 2816]; else pix = 2; if (pix & 2) { if (tx) cx = ((line_h1 & 0x003) | (((line_h1 << 2) >> (tx - 3)) & 0x010) | ((line_h2 >> 12) & 0x00c) | ((line_h3 >> 10) & 0x020)); else cx = ((line_h1 & 0x003) | ((line_h2 >> 12) & 0x01c) | ((line_h3 >> 10) & 0x020)); if (x & 1) cx |= (((line_l2 >> 8) & 0x0c0) | ((line_l1 >> 6) & 0x300)) | (1UL << 10); else cx |= (((line_l2 >> 9) & 0x0c0) | ((line_l1 >> 7) & 0x300)); cx |= (y & 1) << 11; pix = arith_decode(se, cx); if (pix < 0) goto leave; } line_h1 = (line_h1 << 1) | pix; line_h2 <<= 1; line_h3 <<= 1; } while ((++x & 1) && x < hx); line_l1 <<= 1; line_l2 <<= 1; line_l3 <<= 1; } while ((x & 7) && x < hx); *hp++ = line_h1; } while ((x & 15) && x < hx); ++lp1; ++lp2; } /* while */ x = 0; *(hp - 1) <<= hbpl * 8 - hx; if ((s->i & 1) == 0) { /* low resolution pixels are used twice */ lp1 -= lbpl; lp2 -= lbpl; } else s->pseudo = 1; } /* for (i = ...) */ } leave: /* save a few local variables */ s->line_h1 = line_h1; s->line_h2 = line_h2; s->line_h3 = line_h3; s->line_l1 = line_l1; s->line_l2 = line_l2; s->line_l3 = line_l3; s->x = x; return se->pscd_ptr - data; } /* * Provide to the decoder a new BIE fragment of len bytes starting at data. * * Unless cnt is NULL, *cnt will contain the number of actually read bytes * on return. * * Normal return values: * * JBG_EAGAIN All data bytes provided so far have been processed * (*cnt == len) but the end of the data stream has * not yet been recognized. Call the function again * with additional BIE bytes. * JBG_EOK The function has reached the end of a and * a full image has been decoded. The function can * be called again with data from the next BIE, if * there exists one, in order to get to a higher * resolution layer. The remaining len - *cnt bytes * of the previous data block will then have to passed * to this function again if len > *cnt. * JBG_EOK_INTR Parsing the BIE has been interrupted as had been * requested by a jbg_dec_maxsize() specification. * This function can be called again with the * rest of the BIE to continue the decoding process. * The remaining len - *cnt bytes of the previous * data block will then have to be passed to this * function again if len > *cnt. * * Any other return value indicates that the decoding process was * aborted by a serious problem and the only function you can then * still call is jbg_dec_free() in order to remove the mess, and * jbg85_strerror() to find out what to tell the user. (Looking at the * least significant bits of the return value will provide additional * information by identifying which test exactly has failed.) */ int jbg_dec_in(struct jbg_dec_state *s, unsigned char *data, size_t len, size_t *cnt) { int i, j, required_length; unsigned long x, y; unsigned long is[3], ie[3]; size_t dummy_cnt; unsigned char *dppriv; if (!cnt) cnt = &dummy_cnt; *cnt = 0; if (len < 1) return JBG_EAGAIN; /* read in 20-byte BIH */ if (s->bie_len < 20) { while (s->bie_len < 20 && *cnt < len) s->buffer[s->bie_len++] = data[(*cnt)++]; if (s->bie_len < 20) return JBG_EAGAIN; /* test whether this looks like a valid JBIG header at all */ if (s->buffer[1] < s->buffer[0]) return JBG_EINVAL | 1; if (s->buffer[3] != 0) return JBG_EINVAL | 2; /* padding != 0 */ if ((s->buffer[18] & 0xf0) != 0) return JBG_EINVAL | 3; /* padding != 0 */ if ((s->buffer[19] & 0x80) != 0) return JBG_EINVAL | 4; /* padding != 0 */ if (s->buffer[0] != s->d + 1) return JBG_ENOCONT | 1; s->dl = s->buffer[0]; s->d = s->buffer[1]; if (s->dl == 0) s->planes = s->buffer[2]; else if (s->planes != s->buffer[2]) return JBG_ENOCONT | 2; x = (((long) s->buffer[ 4] << 24) | ((long) s->buffer[ 5] << 16) | ((long) s->buffer[ 6] << 8) | (long) s->buffer[ 7]); y = (((long) s->buffer[ 8] << 24) | ((long) s->buffer[ 9] << 16) | ((long) s->buffer[10] << 8) | (long) s->buffer[11]); if (s->dl != 0 && ((s->xd << (s->d - s->dl + 1)) != x && (s->yd << (s->d - s->dl + 1)) != y)) return JBG_ENOCONT | 3; s->xd = x; s->yd = y; s->l0 = (((long) s->buffer[12] << 24) | ((long) s->buffer[13] << 16) | ((long) s->buffer[14] << 8) | (long) s->buffer[15]); /* ITU-T T.85 trick not directly supported by decoder; for full * T.85 compatibility with respect to all NEWLEN marker scenarios, * preprocess BIE with jbg_newlen() before passing it to the decoder, * or consider using the decoder found in jbig85.c instead. */ if (s->yd == 0xffffffff) return JBG_EIMPL | 1; if (!s->planes) return JBG_EINVAL | 5; if (!s->xd) return JBG_EINVAL | 6; if (!s->yd) return JBG_EINVAL | 7; if (!s->l0) return JBG_EINVAL | 8; /* prevent uint32 overflow: s->l0 * 2 ^ s->d < 2 ^ 32 */ if (s->d > 31) return JBG_EIMPL | 2; if ((s->d != 0 && s->l0 >= (1UL << (32 - s->d)))) return JBG_EIMPL | 3; s->mx = s->buffer[16]; if (s->mx > 127) return JBG_EINVAL | 9; s->my = s->buffer[17]; #if 0 if (s->my > 0) return JBG_EIMPL | 4; #endif s->order = s->buffer[18]; if (iindex[s->order & 7][0] < 0) return JBG_EINVAL | 10; /* HITOLO and SEQ currently not yet implemented */ if (s->dl != s->d && (s->order & JBG_HITOLO || s->order & JBG_SEQ)) return JBG_EIMPL | 5; s->options = s->buffer[19]; /* calculate number of stripes that will be required */ s->stripes = jbg_stripes(s->l0, s->yd, s->d); /* some initialization */ s->ii[iindex[s->order & 7][STRIPE]] = 0; s->ii[iindex[s->order & 7][LAYER]] = s->dl; s->ii[iindex[s->order & 7][PLANE]] = 0; if (s->dl == 0) { s->s = (struct jbg_ardec_state **) checked_malloc(s->planes, sizeof(struct jbg_ardec_state *)); s->tx = (int **) checked_malloc(s->planes, sizeof(int *)); s->ty = (int **) checked_malloc(s->planes, sizeof(int *)); s->reset = (int **) checked_malloc(s->planes, sizeof(int *)); s->lntp = (int **) checked_malloc(s->planes, sizeof(int *)); s->lhp[0] = (unsigned char **) checked_malloc(s->planes, sizeof(unsigned char *)); s->lhp[1] = (unsigned char **) checked_malloc(s->planes, sizeof(unsigned char *)); for (i = 0; i < s->planes; i++) { s->s[i] = (struct jbg_ardec_state *) checked_malloc(s->d - s->dl + 1, sizeof(struct jbg_ardec_state)); s->tx[i] = (int *) checked_malloc(s->d - s->dl + 1, sizeof(int)); s->ty[i] = (int *) checked_malloc(s->d - s->dl + 1, sizeof(int)); s->reset[i] = (int *) checked_malloc(s->d - s->dl + 1, sizeof(int)); s->lntp[i] = (int *) checked_malloc(s->d - s->dl + 1, sizeof(int)); s->lhp[ s->d & 1][i] = (unsigned char *) checked_malloc(s->yd, jbg_ceil_half(s->xd, 3)); s->lhp[(s->d-1) & 1][i] = (unsigned char *) checked_malloc(jbg_ceil_half(s->yd, 1), jbg_ceil_half(s->xd, 1+3)); } } else { for (i = 0; i < s->planes; i++) { s->s[i] = (struct jbg_ardec_state *) checked_realloc(s->s[i], s->d - s->dl + 1, sizeof(struct jbg_ardec_state)); s->tx[i] = (int *) checked_realloc(s->tx[i], s->d - s->dl + 1, sizeof(int)); s->ty[i] = (int *) checked_realloc(s->ty[i], s->d - s->dl + 1, sizeof(int)); s->reset[i] = (int *) checked_realloc(s->reset[i], s->d - s->dl + 1, sizeof(int)); s->lntp[i] = (int *) checked_realloc(s->lntp[i], s->d - s->dl + 1, sizeof(int)); s->lhp[ s->d & 1][i] = (unsigned char *) checked_realloc(s->lhp[ s->d & 1][i], s->yd, jbg_ceil_half(s->xd, 3)); s->lhp[(s->d-1) & 1][i] = (unsigned char *) checked_realloc(s->lhp[(s->d-1) & 1][i], jbg_ceil_half(s->yd, 1), jbg_ceil_half(s->xd, 1+3)); } } for (i = 0; i < s->planes; i++) for (j = 0; j <= s->d - s->dl; j++) arith_decode_init(s->s[i] + j, 0); if (s->dl == 0 || (s->options & JBG_DPON && !(s->options & JBG_DPPRIV))) s->dppriv = jbg_dptable; s->comment_skip = 0; s->buf_len = 0; s->x = 0; s->i = 0; s->pseudo = 1; s->at_moves = 0; } /* read in DPTABLE */ if (s->bie_len < 20 + 1728 && (s->options & (JBG_DPON | JBG_DPPRIV | JBG_DPLAST)) == (JBG_DPON | JBG_DPPRIV)) { assert(s->bie_len >= 20); if (!s->dppriv || s->dppriv == jbg_dptable) s->dppriv = (char *) checked_malloc(1728, sizeof(char)); while (s->bie_len < 20 + 1728 && *cnt < len) s->dppriv[s->bie_len++ - 20] = data[(*cnt)++]; if (s->bie_len < 20 + 1728) return JBG_EAGAIN; dppriv = (unsigned char *) s->dppriv; s->dppriv = (char *) checked_malloc(6912, sizeof(char)); jbg_dppriv2int(s->dppriv, dppriv); checked_free(dppriv); } /* * BID processing loop */ while (*cnt < len) { /* process floating marker segments */ /* skip COMMENT contents */ if (s->comment_skip) { if (s->comment_skip <= len - *cnt) { *cnt += s->comment_skip; s->comment_skip = 0; } else { s->comment_skip -= len - *cnt; *cnt = len; } continue; } /* load complete marker segments into s->buffer for processing */ if (s->buf_len > 0) { assert(s->buffer[0] == MARKER_ESC); while (s->buf_len < 2 && *cnt < len) s->buffer[s->buf_len++] = data[(*cnt)++]; if (s->buf_len < 2) continue; switch (s->buffer[1]) { case MARKER_COMMENT: required_length = 6; break; case MARKER_ATMOVE: required_length = 8; break; case MARKER_NEWLEN: required_length = 6; break; case MARKER_ABORT: case MARKER_SDNORM: case MARKER_SDRST: required_length = 2; break; case MARKER_STUFF: /* forward stuffed 0xff to arithmetic decoder */ s->buf_len = 0; decode_pscd(s, s->buffer, 2); continue; default: return JBG_EMARKER; } while (s->buf_len < required_length && *cnt < len) s->buffer[s->buf_len++] = data[(*cnt)++]; if (s->buf_len < required_length) continue; /* now the buffer is filled with exactly one marker segment */ switch (s->buffer[1]) { case MARKER_COMMENT: s->comment_skip = (((long) s->buffer[2] << 24) | ((long) s->buffer[3] << 16) | ((long) s->buffer[4] << 8) | (long) s->buffer[5]); break; case MARKER_ATMOVE: if (s->at_moves < JBG_ATMOVES_MAX) { s->at_line[s->at_moves] = (((long) s->buffer[2] << 24) | ((long) s->buffer[3] << 16) | ((long) s->buffer[4] << 8) | (long) s->buffer[5]); s->at_tx[s->at_moves] = (signed char) s->buffer[6]; s->at_ty[s->at_moves] = s->buffer[7]; if (s->at_tx[s->at_moves] < - (int) s->mx || s->at_tx[s->at_moves] > (int) s->mx || s->at_ty[s->at_moves] > (int) s->my || (s->at_ty[s->at_moves] == 0 && s->at_tx[s->at_moves] < 0)) return JBG_EINVAL | 11; if (s->at_ty[s->at_moves] != 0) return JBG_EIMPL | 6; s->at_moves++; } else return JBG_EIMPL | 7; /* more than JBG_ATMOVES_MAX ATMOVES */ break; case MARKER_NEWLEN: y = (((long) s->buffer[2] << 24) | ((long) s->buffer[3] << 16) | ((long) s->buffer[4] << 8) | (long) s->buffer[5]); if (y > s->yd) return JBG_EINVAL | 12; if (!(s->options & JBG_VLENGTH)) return JBG_EINVAL | 13; s->yd = y; /* calculate again number of stripes that will be required */ s->stripes = jbg_stripes(s->l0, s->yd, s->d); break; case MARKER_ABORT: return JBG_EABORT; case MARKER_SDNORM: case MARKER_SDRST: /* decode final pixels based on trailing zero bytes */ decode_pscd(s, s->buffer, 2); arith_decode_init(s->s[s->ii[iindex[s->order & 7][PLANE]]] + s->ii[iindex[s->order & 7][LAYER]] - s->dl, s->ii[iindex[s->order & 7][STRIPE]] != s->stripes - 1 && s->buffer[1] != MARKER_SDRST); s->reset[s->ii[iindex[s->order & 7][PLANE]]] [s->ii[iindex[s->order & 7][LAYER]] - s->dl] = (s->buffer[1] == MARKER_SDRST); /* prepare for next SDE */ s->x = 0; s->i = 0; s->pseudo = 1; s->at_moves = 0; /* increment layer/stripe/plane loop variables */ /* start and end value for each loop: */ is[iindex[s->order & 7][STRIPE]] = 0; ie[iindex[s->order & 7][STRIPE]] = s->stripes - 1; is[iindex[s->order & 7][LAYER]] = s->dl; ie[iindex[s->order & 7][LAYER]] = s->d; is[iindex[s->order & 7][PLANE]] = 0; ie[iindex[s->order & 7][PLANE]] = s->planes - 1; i = 2; /* index to innermost loop */ do { j = 0; /* carry flag */ if (++s->ii[i] > ie[i]) { /* handling overflow of loop variable */ j = 1; if (i > 0) s->ii[i] = is[i]; } } while (--i >= 0 && j); s->buf_len = 0; /* check whether this have been all SDEs */ if (j) { #ifdef DEBUG fprintf(stderr, "This was the final SDE in this BIE, " "%ld bytes left.\n", (long) (len - *cnt)); #endif s->bie_len = 0; return JBG_EOK; } /* check whether we have to abort because of xmax/ymax */ if (iindex[s->order & 7][LAYER] == 0 && i < 0) { /* LAYER is the outermost loop and we have just gone to next layer */ if (jbg_ceil_half(s->xd, s->d - s->ii[0]) > s->xmax || jbg_ceil_half(s->yd, s->d - s->ii[0]) > s->ymax) { s->xmax = 4294967295UL; s->ymax = 4294967295UL; return JBG_EOK_INTR; } if (s->ii[0] > (unsigned long) s->dmax) { s->dmax = 256; return JBG_EOK_INTR; } } break; } s->buf_len = 0; } else if (data[*cnt] == MARKER_ESC) s->buffer[s->buf_len++] = data[(*cnt)++]; else { /* we have found PSCD bytes */ *cnt += decode_pscd(s, data + *cnt, len - *cnt); if (*cnt < len && data[*cnt] != 0xff) { #ifdef DEBUG fprintf(stderr, "PSCD was longer than expected, unread bytes " "%02x %02x %02x %02x ...\n", data[*cnt], data[*cnt+1], data[*cnt+2], data[*cnt+3]); #endif return JBG_EINVAL | 14; } } } /* of BID processing loop 'while (*cnt < len) ...' */ return JBG_EAGAIN; } /* * After jbg_dec_in() returned JBG_EOK or JBG_EOK_INTR, you can call this * function in order to find out the width of the image. Returns 0 if * there is no image available yet. */ unsigned long jbg_dec_getwidth(const struct jbg_dec_state *s) { if (s->d < 0) return 0; if (iindex[s->order & 7][LAYER] == 0) { if (s->ii[0] < 1) return 0; else return jbg_ceil_half(s->xd, s->d - (s->ii[0] - 1)); } return s->xd; } /* * After jbg_dec_in() returned JBG_EOK or JBG_EOK_INTR, you can call this * function in order to find out the height of the image. Returns 0 if * there is no image available yet. */ unsigned long jbg_dec_getheight(const struct jbg_dec_state *s) { if (s->d < 0) return 0; if (iindex[s->order & 7][LAYER] == 0) { if (s->ii[0] < 1) return 0; else return jbg_ceil_half(s->yd, s->d - (s->ii[0] - 1)); } return s->yd; } /* * After jbg_dec_in() returned JBG_EOK or JBG_EOK_INTR, you can call this * function in order to get a pointer to the image. Returns NULL if * there is no image available yet. */ unsigned char *jbg_dec_getimage(const struct jbg_dec_state *s, int plane) { if (s->d < 0) return NULL; if (iindex[s->order & 7][LAYER] == 0) { if (s->ii[0] < 1) return NULL; else return s->lhp[(s->ii[0] - 1) & 1][plane]; } return s->lhp[s->d & 1][plane]; } /* * After jbg_dec_in() returned JBG_EOK or JBG_EOK_INTR, you can call * this function in order to find out the size in bytes of one * bitplane of the image. */ unsigned long jbg_dec_getsize(const struct jbg_dec_state *s) { if (s->d < 0) return 0; if (iindex[s->order & 7][LAYER] == 0) { if (s->ii[0] < 1) return 0; else return jbg_ceil_half(s->xd, s->d - (s->ii[0] - 1) + 3) * /* overflow risk? */ jbg_ceil_half(s->yd, s->d - (s->ii[0] - 1)); } return jbg_ceil_half(s->xd, 3) * s->yd; } /* * After jbg_dec_in() returned JBG_EOK or JBG_EOK_INTR, you can call * this function in order to find out the size of the image that you * can retrieve with jbg_merge_planes(). */ unsigned long jbg_dec_getsize_merged(const struct jbg_dec_state *s) { if (s->d < 0) return 0; if (iindex[s->order & 7][LAYER] == 0) { if (s->ii[0] < 1) return 0; else return jbg_ceil_half(s->xd, s->d - (s->ii[0] - 1)) * /* overflow risk? */ jbg_ceil_half(s->yd, s->d - (s->ii[0] - 1)) * ((s->planes + 7) / 8); } return s->xd * s->yd * ((s->planes + 7) / 8); } /* * The destructor function which releases any resources obtained by the * other decoder functions. */ void jbg_dec_free(struct jbg_dec_state *s) { int i; if (s->d < 0 || s->s == NULL) return; s->d = -2; for (i = 0; i < s->planes; i++) { checked_free(s->s[i]); checked_free(s->tx[i]); checked_free(s->ty[i]); checked_free(s->reset[i]); checked_free(s->lntp[i]); checked_free(s->lhp[0][i]); checked_free(s->lhp[1][i]); } checked_free(s->s); checked_free(s->tx); checked_free(s->ty); checked_free(s->reset); checked_free(s->lntp); checked_free(s->lhp[0]); checked_free(s->lhp[1]); if (s->dppriv && s->dppriv != jbg_dptable) checked_free(s->dppriv); s->s = NULL; return; } /* * Split bigendian integer pixel field into separate bit planes. In the * src array, every pixel is represented by a ((has_planes + 7) / 8) byte * long word, most significant byte first. While has_planes describes * the number of used bits per pixel in the source image, encode_plane * is the number of most significant bits among those that we * actually transfer to dest. */ void jbg_split_planes(unsigned long x, unsigned long y, int has_planes, int encode_planes, const unsigned char *src, unsigned char **dest, int use_graycode) { unsigned long bpl = jbg_ceil_half(x, 3); /* bytes per line in dest plane */ unsigned long line, i; unsigned k = 8; int p; unsigned prev; /* previous *src byte shifted by 8 bit to the left */ register int bits, msb = has_planes - 1; int bitno; /* sanity checks */ if (encode_planes > has_planes) encode_planes = has_planes; use_graycode = use_graycode != 0 && encode_planes > 1; for (p = 0; p < encode_planes; p++) memset(dest[p], 0, bpl * y); for (line = 0; line < y; line++) { /* lines loop */ for (i = 0; i * 8 < x; i++) { /* dest bytes loop */ for (k = 0; k < 8 && i * 8 + k < x; k++) { /* pixel loop */ prev = 0; for (p = 0; p < encode_planes; p++) { /* bit planes loop */ /* calculate which bit in *src do we want */ bitno = (msb - p) & 7; /* put this bit with its left neighbor right adjusted into bits */ bits = (prev | *src) >> bitno; /* go to next *src byte, but keep old */ if (bitno == 0) prev = *src++ << 8; /* make space for inserting new bit */ dest[p][bpl * line + i] <<= 1; /* insert bit, if requested apply Gray encoding */ dest[p][bpl * line + i] |= (bits ^ (use_graycode & (bits>>1))) & 1; /* * Theorem: Let b(n),...,b(1),b(0) be the digits of a * binary word and let g(n),...,g(1),g(0) be the digits of the * corresponding Gray code word, then g(i) = b(i) xor b(i+1). */ } /* skip unused *src bytes */ for (;p < has_planes; p++) if (((msb - p) & 7) == 0) src++; } } for (p = 0; p < encode_planes; p++) /* right padding loop */ dest[p][bpl * (line + 1) - 1] <<= 8 - k; } return; } /* * Merge the separate bit planes decoded by the JBIG decoder into an * integer pixel field. This is essentially the counterpart to * jbg_split_planes(). */ void jbg_dec_merge_planes(const struct jbg_dec_state *s, int use_graycode, void (*data_out)(unsigned char *start, size_t len, void *file), void *file) { #define BUFLEN 4096 unsigned long bpl, line, i; unsigned k = 8; int p; unsigned char buf[BUFLEN]; unsigned char *bp = buf; unsigned char **src; unsigned long x, y; unsigned v; /* sanity check */ use_graycode = use_graycode != 0; x = jbg_dec_getwidth(s); y = jbg_dec_getheight(s); if (x == 0 || y == 0) return; bpl = jbg_ceil_half(x, 3); /* bytes per line in src plane */ if (iindex[s->order & 7][LAYER] == 0) if (s->ii[0] < 1) return; else src = s->lhp[(s->ii[0] - 1) & 1]; else src = s->lhp[s->d & 1]; for (line = 0; line < y; line++) { /* lines loop */ for (i = 0; i * 8 < x; i++) { /* src bytes loop */ for (k = 0; k < 8 && i * 8 + k < x; k++) { /* pixel loop */ v = 0; for (p = 0; p < s->planes;) { /* dest bytes loop */ do { v = (v << 1) | (((src[p][bpl * line + i] >> (7 - k)) & 1) ^ (use_graycode & v)); } while ((s->planes - ++p) & 7); *bp++ = v; if (bp - buf == BUFLEN) { data_out(buf, BUFLEN, file); bp = buf; } } } } } if (bp - buf > 0) data_out(buf, bp - buf, file); return; } /* * Given a pointer p to the first byte of either a marker segment or a * PSCD, as well as the length len of the remaining data, return * either the pointer to the first byte of the next marker segment or * PSCD, or p+len if this was the last one, or NULL if some error was * encountered. Possible errors are: * * - not enough bytes left for complete marker segment * - no marker segment terminates the PSCD * - unknown marker code encountered * */ unsigned char *jbg_next_pscdms(unsigned char *p, size_t len) { unsigned char *pp; unsigned long l; if (len < 2) return NULL; /* not enough bytes left for complete marker segment */ if (p[0] != MARKER_ESC || p[1] == MARKER_STUFF) { do { while (p[0] == MARKER_ESC && p[1] == MARKER_STUFF) { p += 2; len -= 2; if (len < 2) return NULL; /* not enough bytes left for complete marker segment */ } assert(len >= 2); pp = (unsigned char *) memchr(p, MARKER_ESC, len - 1); if (!pp) return NULL; /* no marker segment terminates the PSCD */ l = pp - p; assert(l < len); p += l; len -= l; } while (p[1] == MARKER_STUFF); } else { switch (p[1]) { case MARKER_SDNORM: case MARKER_SDRST: case MARKER_ABORT: return p + 2; case MARKER_NEWLEN: if (len < 6) return NULL; /* not enough bytes left for complete marker segment */ return p + 6; case MARKER_ATMOVE: if (len < 8) return NULL; /* not enough bytes left for complete marker segment */ return p + 8; case MARKER_COMMENT: if (len < 6) return NULL; /* not enough bytes left for complete marker segment */ l = (((long) p[2] << 24) | ((long) p[3] << 16) | ((long) p[4] << 8) | (long) p[5]); if (len - 6 < l) return NULL; /* not enough bytes left for complete marker segment */ return p + 6 + l; default: /* unknown marker sequence encountered */ return NULL; } } return p; } /* * Scan a complete BIE for a NEWLEN marker segment, then read the new * YD value found in it and use it to overwrite the one in the BIE * header. Use this procedure if a BIE initially declares an * unreasonably high provisional YD value (e.g., 0xffffffff) or * depends on the fact that section 6.2.6.2 of ITU-T T.82 says that a * NEWLEN marker segment "could refer to a line in the immediately * preceding stripe due to an unexpected termination of the image or * the use of only such stripe". ITU-T.85 explicitely suggests the * use of this for fax machines that start transmission before having * encountered the end of the page. None of this is necessary for * BIEs produced by JBIG-KIT, which normally does not use NEWLEN. */ int jbg_newlen(unsigned char *bie, size_t len) { unsigned char *p = bie + 20; int i; unsigned long y, yn; if (len < 20) return JBG_EAGAIN; if ((bie[19] & (JBG_DPON | JBG_DPPRIV | JBG_DPLAST)) == (JBG_DPON | JBG_DPPRIV)) p += 1728; /* skip DPTABLE */ if (p >= bie + len) return JBG_EAGAIN; while ((p = jbg_next_pscdms(p, len - (p - bie)))) { if (p == bie + len) return JBG_EOK; else if (p[0] == MARKER_ESC) switch (p[1]) { case MARKER_NEWLEN: y = (((long) bie[ 8] << 24) | ((long) bie[ 9] << 16) | ((long) bie[10] << 8) | (long) bie[11]); yn = (((long) p[2] << 24) | ((long) p[3] << 16) | ((long) p[4] << 8) | (long) p[5]); if (yn > y) return JBG_EINVAL | 12; /* overwrite YD in BIH with YD from NEWLEN */ for (i = 0; i < 4; i++) { bie[8+i] = p[2+i]; } return JBG_EOK; case MARKER_ABORT: return JBG_EABORT; } } return JBG_EINVAL | 0; } jbigkit-2.1/libjbig/jbig.h0000664000307500030750000002262712315071063014136 0ustar mgk25mgk25/* * Header file for the portable JBIG compression library * * Copyright 1995-2014 -- Markus Kuhn -- http://www.cl.cam.ac.uk/~mgk25/ */ #ifndef JBG_H #define JBG_H #include #include "jbig_ar.h" /* * JBIG-KIT version number */ #define JBG_VERSION "2.1" #define JBG_VERSION_MAJOR 2 #define JBG_VERSION_MINOR 1 /* * JBIG-KIT licence agreement reference code: * If you use JBIG-KIT under a commercial licence, please replace * below the letters GPL with the reference code that you received * with your licence agreement. (This code is typically a letter "A" * followed by four decimal digits, e.g. "A1234".) */ #define JBG_LICENCE "GPL" /* * Buffer block for SDEs which are temporarily stored by encoder */ #define JBG_BUFSIZE 4000 struct jbg_buf { unsigned char d[JBG_BUFSIZE]; /* one block of a buffer list */ int len; /* length of the data in this block */ struct jbg_buf *next; /* pointer to next block */ struct jbg_buf *previous; /* pointer to previous block * * (unused in freelist) */ struct jbg_buf *last; /* only used in list head: final block of list */ struct jbg_buf **free_list; /* pointer to pointer to head of free list */ }; /* * Maximum number of ATMOVEs per stripe that decoder can handle */ #define JBG_ATMOVES_MAX 64 /* * Option and order flags */ #define JBG_HITOLO 0x08 #define JBG_SEQ 0x04 #define JBG_ILEAVE 0x02 #define JBG_SMID 0x01 #define JBG_LRLTWO 0x40 #define JBG_VLENGTH 0x20 #define JBG_TPDON 0x10 #define JBG_TPBON 0x08 #define JBG_DPON 0x04 #define JBG_DPPRIV 0x02 #define JBG_DPLAST 0x01 /* encoding options that will not be indicated in the header */ #define JBG_DELAY_AT 0x100 /* Delay ATMOVE until the first line of the next * stripe. Option available for compatibility * with conformance test example in clause 7.2. */ #define JBG_SDRST 0x200 /* Use SDRST instead of SDNORM. This option is * there for anyone who needs to generate * test data that covers the SDRST cases. */ /* * Possible error code return values */ #define JBG_EOK (0 << 4) #define JBG_EOK_INTR (1 << 4) #define JBG_EAGAIN (2 << 4) #define JBG_ENOMEM (3 << 4) #define JBG_EABORT (4 << 4) #define JBG_EMARKER (5 << 4) #define JBG_EINVAL (6 << 4) #define JBG_EIMPL (7 << 4) #define JBG_ENOCONT (8 << 4) /* * Status of a JBIG encoder */ struct jbg_enc_state { int d; /* resolution layer of the input image */ unsigned long xd, yd; /* size of the input image (resolution layer d) */ unsigned long yd1; /* BIH announced height of image, use yd1 != yd to emulate T.85-style NEWLEN height updates for tests */ int planes; /* number of different bitmap planes */ int dl; /* lowest resolution layer in the next BIE */ int dh; /* highest resolution layer in the next BIE */ unsigned long l0; /* number of lines per stripe at lowest * * resolution layer 0 */ unsigned long stripes; /* number of stripes required (determ. by l0) */ unsigned char **lhp[2]; /* pointers to lower/higher resolution images */ int *highres; /* index [plane] of highres image in lhp[] */ int order; /* SDE ordering parameters */ int options; /* encoding parameters */ unsigned mx, my; /* maximum ATMOVE window size */ int *tx; /* array [plane] with x-offset of adaptive template pixel */ char *dppriv; /* optional private deterministic prediction table */ char *res_tab; /* table for the resolution reduction algorithm */ struct jbg_buf ****sde; /* array [stripe][layer][plane] pointers to * * buffers for stored SDEs */ struct jbg_arenc_state *s; /* array [planes] for arithm. encoder status */ struct jbg_buf *free_list; /* list of currently unused SDE block buffers */ void (*data_out)(unsigned char *start, size_t len, void *file); /* data write callback */ void *file; /* parameter passed to data_out() */ char *tp; /* buffer for temp. values used by diff. typical prediction */ unsigned char *comment; /* content of comment marker segment to be added at next opportunity (will be reset to NULL as soon as comment has been written) */ unsigned long comment_len; /* length of data pointed to by comment */ }; /* * Status of a JBIG decoder */ struct jbg_dec_state { /* data from BIH */ int d; /* resolution layer of the full image */ int dl; /* first resolution layer in this BIE */ unsigned long xd, yd; /* size of the full image (resolution layer d) */ int planes; /* number of different bitmap planes */ unsigned long l0; /* number of lines per stripe at lowest * * resolution layer 0 */ unsigned long stripes; /* number of stripes required (determ. by l0) */ int order; /* SDE ordering parameters */ int options; /* encoding parameters */ int mx, my; /* maximum ATMOVE window size */ char *dppriv; /* optional private deterministic prediction table */ /* loop variables */ unsigned long ii[3]; /* current stripe, layer, plane (outer loop first) */ /* * Pointers to array [planes] of lower/higher resolution images. * lhp[d & 1] contains image of layer d. */ unsigned char **lhp[2]; /* status information */ int **tx, **ty; /* array [plane][layer-dl] with x,y-offset of AT pixel */ struct jbg_ardec_state **s; /* array [plane][layer-dl] for arithmetic * * decoder status */ int **reset; /* array [plane][layer-dl] remembers if previous stripe * * in that plane/resolution ended with SDRST. */ unsigned long bie_len; /* number of bytes read so far */ unsigned char buffer[20]; /* used to store BIH or marker segments fragm. */ int buf_len; /* number of bytes in buffer */ unsigned long comment_skip; /* remaining bytes of a COMMENT segment */ unsigned long x; /* x position of next pixel in current SDE */ unsigned long i; /* line in current SDE (first line of each stripe is 0) */ int at_moves; /* number of AT moves in the current stripe */ unsigned long at_line[JBG_ATMOVES_MAX]; /* lines at which an * * AT move will happen */ int at_tx[JBG_ATMOVES_MAX], at_ty[JBG_ATMOVES_MAX]; /* ATMOVE offsets in * * current stripe */ unsigned long line_h1, line_h2, line_h3; /* variables of decode_pscd */ unsigned long line_l1, line_l2, line_l3; int pseudo; /* flag for TPBON/TPDON: next pixel is pseudo pixel */ int **lntp; /* flag [plane][layer-dl] for TP: line is not typical */ unsigned long xmax, ymax; /* if possible abort before image gets * * larger than this size */ int dmax; /* abort after this layer */ }; /* some macros (too trivial for a function) */ #define jbg_dec_getplanes(s) ((s)->planes) /* function prototypes */ void jbg_enc_init(struct jbg_enc_state *s, unsigned long x, unsigned long y, int planes, unsigned char **p, void (*data_out)(unsigned char *start, size_t len, void *file), void *file); int jbg_enc_lrlmax(struct jbg_enc_state *s, unsigned long mwidth, unsigned long mheight); void jbg_enc_layers(struct jbg_enc_state *s, int d); int jbg_enc_lrange(struct jbg_enc_state *s, int dl, int dh); void jbg_enc_options(struct jbg_enc_state *s, int order, int options, unsigned long l0, int mx, int my); void jbg_enc_out(struct jbg_enc_state *s); void jbg_enc_free(struct jbg_enc_state *s); void jbg_dec_init(struct jbg_dec_state *s); void jbg_dec_maxsize(struct jbg_dec_state *s, unsigned long xmax, unsigned long ymax); int jbg_dec_in(struct jbg_dec_state *s, unsigned char *data, size_t len, size_t *cnt); unsigned long jbg_dec_getwidth(const struct jbg_dec_state *s); unsigned long jbg_dec_getheight(const struct jbg_dec_state *s); unsigned char *jbg_dec_getimage(const struct jbg_dec_state *s, int plane); unsigned long jbg_dec_getsize(const struct jbg_dec_state *s); void jbg_dec_merge_planes(const struct jbg_dec_state *s, int use_graycode, void (*data_out)(unsigned char *start, size_t len, void *file), void *file); unsigned long jbg_dec_getsize_merged(const struct jbg_dec_state *s); void jbg_dec_free(struct jbg_dec_state *s); const char *jbg_strerror(int errnum); void jbg_int2dppriv(unsigned char *dptable, const char *internal); void jbg_dppriv2int(char *internal, const unsigned char *dptable); unsigned long jbg_ceil_half(unsigned long x, int n); void jbg_split_planes(unsigned long x, unsigned long y, int has_planes, int encode_planes, const unsigned char *src, unsigned char **dest, int use_graycode); int jbg_newlen(unsigned char *bie, size_t len); #endif /* JBG_H */ jbigkit-2.1/libjbig/jbig.txt0000664000307500030750000011023412315071063014516 0ustar mgk25mgk25 Using the JBIG-KIT library -------------------------- Markus Kuhn -- 2013-09-10 This text explains how to use the functions provided by the JBIG-KIT portable image compression library jbig.c in your application software. The jbig.c library is a full-featured implementation of the JBIG1 standard aimed at applications that can hold the entire uncompressed and compressed image in RAM. [For applications that require only the single-bit-per-pixel "fax subset" of the JBIG1 standard defined in ITU-T Recommendation T.85 , the alternative implementation found in jbig85.c may be preferable. It keeps not more than three lines of the uncompressed image in RAM, which makes it particularly suitable for embedded applications. For information on how to use jbig85.c, please refer to the separate documentation file jbig85.txt.] 1 Introduction to JBIG We start with a short introduction to JBIG1. More detailed information is provided in the "Introduction and overview" section of the JBIG1 standard. Information on how to obtain a copy of the standard is available from or . Image data encoded with the JBIG algorithm is separated into planes, layers, and stripes. Each plane contains one bit per pixel. The number of planes stored in a JBIG data stream is the number of bits per pixel. Resolution layers are numbered from 0 to D with 0 being the layer with the lowest resolution and D the one with the highest. Each next higher resolution layer has twice the number of rows and columns. Layer 0 is encoded independently of any other data, all other resolution layers are encoded as only the difference between the next lower and the current layer. For applications that require very quick access to parts of an image, it is possible to divide an image into several horizontal stripes. All stripes of one resolution layer have equal size, except perhaps the final one. The number of stripes of an image is equal in all resolution layers and in all bit planes. The compressed data stream specified by the JBIG standard is called a bi-level image entity (BIE). A BIE consists of a 20-byte header, followed by an optional 1728-byte table (usually not present, except in special applications) followed by a sequence of stripe data entities (SDE). Each SDE encodes the content of one single stripe in one plane of one resolution layer. Between the SDEs, other information blocks (called floating marker segments) can also be present. They are used to change certain parameters of the algorithm in the middle of an image or contain additional application specific information. A BIE looks like this: +------------------------------------------------+ | | | 20-byte header (with image size, #planes, | | #layers, stripe size, first layer, options, | | SDE ordering, ...) | | | +------------------------------------------------+ | | | optional 1728-byte table | | | +------------------------------------------------+ | | | optional floating marker segments | | | +------------------------------------------------+ | | | stripe data entity | | | +------------------------------------------------+ | | | optional floating marker segments | | | +------------------------------------------------+ | | | stripe data entity | | | +------------------------------------------------+ ... +------------------------------------------------+ | | | stripe data entity | | | +------------------------------------------------+ One BIE can contain all resolution layers of an image, but it is also possible to store various resolution layers in several BIEs. The BIE header contains the number of the first and the last resolution layer stored in this BIE, as well as the size of the highest resolution layer stored in this BIE. Progressive coding is deactivated by simply storing the image in one single resolution layer. Different applications might have different requirements for the order in which the SDEs for stripes of various planes and layers are stored in the BIE, so all possible sensible orderings are allowed by the standard and indicated by four bits in the header. It is possible to use the raw BIE data stream as specified by the JBIG standard directly as the format of a file used for storing images. This is what the pbmtojbg, jbgtopbm, pbmtojbg85, and jbgtopbm85 conversion tools do that are provided in this package as demonstration applications. However, as the BIE format has been designed for a large number of very different applications, and to allow efficient direct processing by special JBIG hardware chip implementations, the BIE header contains only the minimum amount of information absolutely required by the decompression algorithm. Many features expected from a good file format are missing in the BIE data stream: - no "magic code" in the first few bytes to allow identification of the file format on a typeless file system and to allow automatic distinction from other compression algorithms - no standardized way to encode additional information such as a textual description, information about the meaning of various bit planes, the physical size and resolution of the document, etc. - a checksum to ensure image integrity - encryption and signature mechanisms - many things more Raw BIE data streams alone may therefore not be a suitable format for document archiving and exchange. A standard format for this purpose would typically combine a BIE representing the image data with an additional header providing auxiliary information into one file. Existing established multi-purpose file formats with a rich set of auxiliary information attributes like TIFF could be extended easily to also hold JBIG compressed data. On the other hand, in e.g. database applications, a BIE might be stored directly in a binary variable-length field. Auxiliary information would then be stored in other fields of the same record, to simplify search operations. 2 Compressing an image 2.1 Format of the source image To be processed by the jbig.c encoder, the image has to be present in memory as separate bitmap planes. Each byte of a bitmap contains eight pixels, where the most significant bit represents the leftmost of these. Each line of a bitmap has to be stored in an integral number of bytes. If the image width is not an integral multiple of eight, then the final byte has to be padded with zero bits. For example the 23x5 pixels large single plane image: .XXXXX..XXX...X...XXX.. .....X..X..X..X..X..... .....X..XXX...X..X.XXX. .X...X..X..X..X..X...X. ..XXX...XXX...X...XXX.. is represented by the 15 bytes 01111100 11100010 00111000 00000100 10010010 01000000 00000100 11100010 01011100 01000100 10010010 01000100 00111000 11100010 00111000 or in hexadecimal notation 7c e2 38 04 92 40 04 e2 5c 44 92 44 38 e2 38 This is the format used in binary PBM files and it can also be handled directly by the Xlib library of the X Window System. As JBIG can also handle images with multiple bit planes, the jbig.c library functions accept and return always arrays of pointers to bitmaps with one pointer per plane. For single-plane images, the standard recommends that a 0 pixel represents the background and a 1 pixel represents the foreground colour of an image, in other words, 0 is white and 1 is black for scanned paper documents. For images with several bits per pixel, the JBIG standard makes no recommendations about how various colours should be encoded. For grey-scale images, by using a Gray code instead of a simple binary weighted representation of the pixel intensity, some increase in coding efficiency can be reached. A Gray code is also a binary representation of integer numbers, but it has the property that the representations of the integer numbers i and (i+1) always differ in exactly one bit. For example, the numbers 0 to 7 can be represented in normal binary code and Gray code as in the following table: normal number binary code Gray code --------------------------------------- 0 000 000 1 001 001 2 010 011 3 011 010 4 100 110 5 101 111 6 110 101 7 111 100 The form of Gray code shown above has the property that the second half of the code (numbers 4 - 7) is simply the mirrored first half (numbers 3 - 0) with the first bit set to one. This way, arbitrarily large Gray codes can be generated quickly by mirroring the above example and prefixing the first half with zeros and the second half with ones as often as required. In grey-scale images, it is common practise to use the all-0 code for black and the all-1 code for white. No matter whether a Gray code or a binary code is used for encoding a pixel intensity in several bit planes, it always makes sense to store the most significant (leftmost) bit in plane 0, which is transmitted first. This way, a decoder could increase the precision of the displayed pixel intensities while data is still being received and the basic structure of the image will become visible as early as possible during the transmission. 2.2 A simple compression application In order to use jbig.c in your application, just link libjbig.a to your executable (on Unix systems just add -ljbig and -L. to the command line options of your compiler, on other systems you will have to write a new Makefile anyway), copy the file jbig.h into your source directory and put the line #include "jbig.h" into your source code. The library interface follows object-oriented programming principles. You have to declare a variable (object) struct jbg_enc_state s; which contains the current status of an encoder. Then you initialize the encoder by calling the constructor function void jbg_enc_init(struct jbg_enc_state *s, unsigned long x, unsigned long y, int pl, unsigned char **p, void (*data_out)(unsigned char *start, size_t len, void *file), void *file); The parameters have the following meaning: s A pointer to the jbg_enc_state structure that you want to initialize. x The width of your image in pixels. y The height of your image in pixels (lines). pl the number of bitmap planes you want to encode. p A pointer to an array of pl pointers, where each is again pointing to the first byte of a bitmap as described in section 2.1. data_out This is a call-back function that the encoder will call during the compression process by in order to deliver the BIE data to your application. The parameters of the function data_out are a pointer start to the new block of data being delivered, as well as the number len of delivered bytes. The pointer file is transparently delivered to data_out, as specified in jbg_enc_init(). Typically, data_out will write the BIE portion to a file, send it to a network connection, or append it to some memory buffer. file A pointer parameter that is passed on to data_out() and can be used, for instance, to allow data_out() to distinguish by which compression task it has been called in multi-threaded applications. In the simplest case, the compression is then started by calling the function void jbg_enc_out(struct jbg_enc_state *s); which will deliver the complete BIE to data_out() in several calls. After jbg_enc_out has returned, a call to the destructor function void jbg_enc_free(struct jbg_enc_state *s); will release any heap memory allocated by the previous functions. A minimal example application, which sends the BIE of the above bitmap to stdout, looks like this: --------------------------------------------------------------------------- /* A sample JBIG encoding application */ #include #include "jbig.h" void output_bie(unsigned char *start, size_t len, void *file) { fwrite(start, 1, len, (FILE *) file); return; } int main() { unsigned char bitmap[15] = { /* 23 x 5 pixels, "JBIG" */ 0x7c, 0xe2, 0x38, 0x04, 0x92, 0x40, 0x04, 0xe2, 0x5c, 0x44, 0x92, 0x44, 0x38, 0xe2, 0x38 }; unsigned char *bitmaps[1] = { bitmap }; struct jbg_enc_state se; jbg_enc_init(&se, 23, 5, 1, bitmaps, output_bie, stdout); /* initialize encoder */ jbg_enc_out(&se); /* encode image */ jbg_enc_free(&se); /* release allocated resources */ return 0; } --------------------------------------------------------------------------- This software produces a 42 byte long BIE. (JBIG is not very good at compressing extremely small images like in this example, because the arithmetic encoder requires some startup data in order to generate reasonable statistics which influence the compression process and because there is some header overhead.) 2.3 More about compression If jbg_enc_out() is called directly after jbg_enc_init(), the following default values are used for various compression parameters: - Only one single resolution layer is used, i.e. no progressive mode. - The number of lines per stripe is selected so that approximately 35 stripes per image are used (as recommended in annex C of the standard together with the suggested adaptive template change algorithm). However, not less than 2 and not more than 128 lines are used in order to stay within the suggested minimum parameter support range specified in annex A of the standard). - All optional parts of the JBIG algorithm are activated (TPBON, TPDON and DPON). - The default resolution reduction table and the default deterministic prediction table are used - The maximal vertical offset of the adaptive template pixel is 0 and the maximal horizontal offset is 8 (mx = 8, my = 0). In order to change any of these default parameters, additional functions have to be called between jbg_enc_init() and jbg_enc_out(). In order to activate progressive encoding, it is possible to specify with void jbg_enc_layers(struct jbg_enc_state *s, int d); the number d of differential resolution layers which shall be encoded in addition to the lowest resolution layer 0. For example, if a document with 60-micrometer pixels has to be stored, and the lowest resolution layer shall have 240-micrometer pixels, so that a screen previewer can directly decompress only the required resolution, then a call jbg_enc_layers(&se, 2); will cause three layers with 240, 120 and 60 micrometers resolution to be generated. If the application does not know what typical resolutions are used and simply wants to ensure that the lowest resolution layer will fit into a given maximal window size, then as an alternative, a call to int jbg_enc_lrlmax(struct jbg_enc_state *s, unsigned long mwidth, unsigned long mheight); will cause the library to automatically determine the suitable number of resolutions so that the lowest resolution layer 0 will not be larger than mwidth x mheight pixels. E.g. if one wants to ensure that systems with a 640 x 480 pixel large screen can decode the required resolution directly, then call jbg_enc_lrlmax(&se, 640, 480); The return value is the number of differential layers selected. After the number of resolution layers has been specified by calls to jbg_enc_layers() or jbg_enc_lrlmax(), by default, all these layers will be written into the BIE. This can be changed with a call to int jbg_enc_lrange(struct jbg_enc_state *s, int dl, int dh); Parameter dl specifies the lowest resolution layer and dh the highest resolution layer that will appear in the BIE. For instance, if layer 0 shall be written to the first BIE and layer 1 and 2 shall be written to a second one, then before writing the first BIE, call jbg_enc_lrange(&se, 0, 0); and before writing the second BIE with jbg_enc_out(), call jbg_enc_lrange(&se, 1, 2); If any of the parameters is negative, it will be ignored. The return value is the total number of differential layers that will represent the input image. This way, jbg_enc_lrange(&se, -1, -1) can be used to query the layer of the full image resolution. A number of other more exotic options of the JBIG algorithm can be modified by calling void jbg_enc_options(struct jbg_enc_state *s, int order, int options, long l0, int mx, int my); before calling jbg_enc_out(). The order parameter can be a combination of the bits JBG_HITOLO, JBG_SEQ, JBG_ILEAVE and JBG_SMID and it determines in which order the SDEs are stored in the BIE. The bits have the following meaning: JBG_HITOLO Usually, the lower resolution layers are stored before the higher resolution layers, so that a decoder can already start to display a low resolution version of the full image once a prefix of the BIE has been received. When this bit is set, however, the BIE will contain the higher layers before the lower layers. This avoids additional buffer memory in the encoder and is intended for applications where the encoder is connected to a database which can easily reorder the SDEs before sending them to a decoder. Warning: JBIG decoders are not expected to support the HITOLO option (e.g. the jbig.c decoder currently does not) so you should normally not use it. JBG_SEQ Usually, at first all stripes of one resolution layer are written to the BIE and then all stripes of the next layer, and so on. When the SEQ bit is set however, then all layers of the first stripe will be written, followed by all layers of the second stripe, etc. This option also should normally never be required and is not supported by the current jbig.c decoder. JBG_SMID In case there exist several bit planes, then the order of the stripes is determined by three loops over all stripes, all planes and all layers. When SMID is set, the loop over all stripes is the middle loop. JBG_ILEAVE If this bit is set, then at first all layers of one plane are written before the encoder starts with the next plane. The above description may be somewhat confusing, but the following table (see also Table 11 in ITU-T T.82) clarifies how the three bits JBG_SEQ, JBIG_ILEAVE and JBG_SMID influence the ordering of the loops over all stripes, planes and layers: Loops: JBG_SEQ JBG_ILEAVE JBG_SMID | Outer Middle Inner ------------------------------------+--------------------------- 0 0 0 | p d s 0 1 0 | d p s 0 1 1 | d s p 1 0 0 | s p d 1 0 1 | p s d 1 1 0 | s d p p: plane, s: stripe, d: layer By default, the order combination JBG_ILEAVE | JBG_SMID is used. The options value can contain the following bits, which activate some of the optional algorithms defined by JBIG: JBG_LRLTWO Normally, in the lowest resolution layer, pixels from three lines around the next pixel are used in order to determine the context in which the next pixel is encoded. Some people in the JBIG committee seem to have argued that using only 2 lines will make software implementations a little bit faster, however others have argued that using only two lines will decrease compression efficiency by around 5%. As you might expect from a committee, now both alternatives are allowed and if JBG_LRLTWO is set, the slightly faster but 5% less well compressing two line alternative is selected. God bless the committees. Although probably nobody will ever need this option, it has been implemented in jbig.c and is off by default. JBG_TPDON This activates the "typical prediction" algorithm for differential layers which avoids that large areas of equal colour have to be encoded at all. This is on by default and there is no good reason to switch it off except for debugging or preparing data for cheap JBIG hardware that might not support this option. JBG_TPBON Like JBG_TPDON this activates the "typical prediction" algorithm in the lowest resolution layer. Also activated by default. JBG_DPON This bit activates for the differential resolution layers the "deterministic prediction" algorithm, which avoids that higher resolution layer pixels are encoded when their value can already be determined with the knowledge of the neighbour pixels, the corresponding lower resolution pixels and the resolution reduction algorithm. This is also activated by default and one reason for deactivating it would be if the default resolution reduction algorithm were replaced by another one. JBG_DELAY_AT Use a slightly less efficient algorithm to determine when an adaptive template change is necessary. With this bit set, the encoder output is compatible to the conformance test examples in cause 7.2 of ITU-T T.82. Then all adaptive template changes are delayed until the first line of the next stripe. This option is by default deactivated and is only required for passing a special compatibility test suite. In addition, parameter l0 in jbg_enc_options() allows you to specify the number of lines per stripe in resolution layer 0. The parameters mx and my change the maximal offset allowed for the adaptive template pixel. JBIG-KIT now supports the full range of possible mx values up to 127 in the encoder and decoder, but my is at the moment ignored and always set to 0. As the standard requires of all decoder implementations only to support maximum values mx = 16 and my = 0, higher values should normally be avoided in order to guarantee interoperability. The ITU-T T.85 profile for JBIG in fax machines requires support for mx = 127 and my = 0. Default is mx = 8 and my = 0. If any of the parameters order, options, mx or my is negative, or l0 is zero, then the corresponding current value remains unmodified. The resolution reduction and deterministic prediction tables can also be replaced. However as these options are anyway only for experts, please have a look at the source code of jbg_enc_out() and the struct members dppriv and res_tab of struct jbg_enc_state for the details of how to do this, in case you really need it. The functions jbg_int2dppriv and jbg_dppriv2int are provided in order to convert the DPTABLE data from the format used in the standard into the more efficient format used internally by JBIG-KIT. If you want to encode a grey-scale image, you can use the library function void jbg_split_planes(unsigned long x, unsigned long y, int has_planes, int encode_planes, const unsigned char *src, unsigned char **dest, int use_graycode); It separates an image in which each pixel is represented by one or more bytes into separate bit planes. The dest array of pointers to these bit planes can then be handed over to jbg_enc_init(). The variables x and y specify the width and height of the image in pixels, and has_planes specifies how many bits per pixel are used. As each pixel is represented by an integral number of consecutive bytes, of which each contains up to eight bits, the total length of the input image array src[] will therefore be x * y * ((has_planes + 7) / 8) bytes. The pixels are stored as usually in English reading order, and for each pixel the integer value is stored with the most significant byte coming first (Bigendian). This is exactly the format used in raw PGM files. In encode_planes, the number of bit planes that shall be extracted can be specified. This allows for instance to extract only the most significant 8 bits of a 12-bit image, where each pixel is represented by two bytes, by specifying has_planes = 12 and encode_planes = 8. If use_graycode is zero, then the binary code of the pixel integer values will be used instead of the Gray code. Plane 0 contains always the most significant bit. 3 Decompressing an image Like with the compression functions, if you want to use the jbig.c library, you have to put the line #include "jbig.h" into your source code and link your executable with libjbig.a. The state of a JBIG decoder is stored completely in a struct and you will have to define a variable like struct jbg_dec_state sd; which is initialized by a call to void jbg_dec_init(struct jbg_dec_state *s); After this, you can directly start to pass data from the BIE to the decoder by calling the function int jbg_dec_in(struct jbg_dec_state *s, unsigned char *data, size_t len, size_t *cnt); The pointer data points to the first byte of a data block with length len, which contains bytes from a BIE. It is not necessary to pass a whole BIE at once to jbg_dec_in(), it can arrive fragmented in any way by calling jbg_dec_in() several times. It is also possible to send several BIEs concatenated to jbg_dec_in(), however these then have to fit together. If you send several BIEs to the decoder, the lowest resolution layer in each following BIE has to be the highest resolution layer in the previous BIE plus one and the image sizes and number of planes also have to fit together, otherwise jbg_dec_in() will return the error JBG_ENOCONT after the header of the new BIE has been received completely. If pointer cnt is not NULL, then the number of bytes actually read from the data block will be stored there. In case the data block did not contain the end of the BIE, then the value JBG_EAGAIN will be returned and *cnt equals len. Once the end of a BIE has been reached, the return value of jbg_dec_in() will be JBG_EOK. After this has happened, the functions and macros unsigned long jbg_dec_getwidth(struct jbg_dec_state *s); unsigned long jbg_dec_getheight(struct jbg_dec_state *s); int jbg_dec_getplanes(struct jbg_dec_state *s); unsigned char *jbg_dec_getimage(struct jbg_dec_state *s, int plane); unsigned long jbg_dec_getsize(struct jbg_dec_state *s); can be used to query the dimensions of the now completely decoded image and to get a pointer to all bitmap planes. The bitmaps are stored as described in section 2.1. The function jbg_dec_getsize() calculates the number of bytes which one bitmap requires. The function void jbg_dec_merge_planes(const struct jbg_dec_state *s, int use_graycode, void (*data_out)(unsigned char *start, size_t len, void *file), void *file); allows you to merge the bit planes that can be accessed individually with jbg_dec_getimage() into an array with one or more bytes per pixel (i.e., the format provided to jbg_split_planes()). If use_graycode is zero, then a binary encoding will be used. The output array will be delivered via the callback function data_out, exactly in the same way in which the encoder provides the BIE. The function unsigned long jbg_dec_getsize_merged(const struct jbg_dec_state *s); determines how long the data array delivered by jbg_dec_merge_planes() is going to be. Before calling jbg_dec_in() the first time, it is possible to specify with a call to void jbg_dec_maxsize(struct jbg_dec_state *s, unsigned long xmax, unsigned long ymax); an abort criterion for progressively encoded images. For instance if an application will display a whole document on a screen which is 1024 x 768 pixels large, then this application should call jbg_dec_maxsize(&sd, 1024, 768); before the decoding process starts. If the image has been encoded in progressive mode (i.e. with several resolution layers), then the decoder will stop with a return value JBG_EOK_INTR after the largest resolution layer that is still smaller than 1024 x 768. However this is no guarantee that the image which can then be read out using jbg_dec_getimage(), etc. is really not larger than the specified maximal size. The application will have to check the size of the image, because the decoder does not automatically apply a resolution reduction if no suitable resolution layer is available in the BIE. If jbg_dec_in() returned JBG_EOK_INTR or JBG_EOK, then it is possible to continue calling jbg_dec_in() with the remaining data in order to either decode the remaining resolution layers of the current BIE or in order to add another BIE with additional resolution layers. In both cases, after jbg_dec_in() returned JBG_EOK_INTR or JBG_EOK, *cnt is probably not equal to len and the remainder of the data block which has not yet been processed by the decoder has to be delivered to jbg_dec_in() again. If any other return value than JBG_EOK, JBG_EOK_INTR or JBG_EAGAIN has been returned by jbg_dec_in(), then an error has occurred and void jbg_dec_free(struct jbg_dec_state *s); should be called in order to release any allocated memory. The destructor jbg_dec_free() should of course also be called, once the decoded bitmap returned by jbg_dec_getimage() is no longer required and the memory can be released. The function const char *jbg_strerror(int errnum); returns a pointer to a short single line test message that explains the return value of jbg_dec_in(). This message can be used in order to provide the user a brief informative message about what when wrong while decompressing a JBIG image. The po/ subdirectory contains *.po files that translate the English ASCII strings returned by jbg_strerror() into other languages (e.g., for use with GNU gettext). The four least-significant bits of the return value of jbg_dec_in() may contain additional detailed technical information about the exact test that spotted the error condition (see source code for details), i.e. more than the text message returned by jbg_strerror() reveals. Therefore it may be useful to display the return value itself as a hexadecimal number, in addition to the string returned by jbg_strerror(). The current implementation of the jbig.c decoder has the following limitations: - The maximal vertical offset MY of the adaptive template pixel must be zero. - HITOLO and SEQ bits must not be set in the order value. - Not more than JBG_ATMOVES_MAX (currently set to 64) ATMOVE marker segments can be handled per stripe. - the number D of differential layers must be less than 32 None of the above limitations can be exceeded by a JBIG data stream that conforms to the ITU-T T.85 application profile for the use of JBIG1 in fax machines. The current implementation of the jbig.c decoder does not impose any limits on the image size that it will process, as long as malloc() is able to allocate enough heap space for the resulting bitmaps. The only exception is that jbg_dec_in() will return "Input data stream uses unimplemented JBIG features" (JBG_EIMPL | 1) if Y_D equals 0xffffffff, which is an extreme value commonly used to encode images according to ITU-T T.85 where the height was unknown when the BIH was emitted. After jbg_dec_in() received the 20-byte long BIH at the start of the BIE, it will malloc() to allocate enough memory to hold the requested image planes and layers. If you want to defend your application against excessive image-size parameters in a received BIH, then do make sure that you check X_D, Y_D, and P against appropriate safety limits before handing over the BIH to jbg_dec_in(). There are two more limitations of the current implementation of the jbig.c decoder that might cause problems with processing JBIG data stream that conform to ITU-T T.85: - The jbig.c decoder was designed to operate incrementally. Each received byte is processed immediately as soon as it arrives. As a result, it does not look beyond the SDRST/SDNORM at the end of all stripes for any immediately following NEWLEN marker that might reduce the number of lines encoded by the current stripe. However section 6.2.6.2 of ITU-T T.82 says that a NEWLEN marker segment "could refer to a line in the immediately preceding stripe due to an unexpected termination of the image or the use of only such stripe", and ITU-T.85 explicitly suggests the use of this for fax machines that start transmission before having encountered the end of the page. - The image size initially indicated in the BIE header is used to allocate memory for a bitmap of this size. This means that BIEs that set initially Y_D = 0xffffffff (as suggested in ITU-T T.85 for fax machines that do not know the height of the page at the start of the transmission) cannot be decoded directly by this version. For both issues, there is a workaround available: If you encounter a BIE that has in the header the VLENGTH=1 option bit set, then first wait until you have received the entire BIE and stored it in memory. Then call the function int jbg_newlen(unsigned char *bie, size_t len); where bie is a pointer to the first byte of the BIE and len its length in bytes. This function will scan the entire BIE for the first NEWLEN marker segment. It will then take the updated image-height value YD from it and use it to overwrite the YD value in the BIE header. The jbg_newlen() can return some of the same error codes as jbg_dec_in(), namely JBG_EOK if everything went fine, JBG_EAGAIN is the data provided is too short to be a valid BIE, JBG_EINVAL if a format error was encountered, and JBG_EABORT if an ABORT marker segment was found. After having patched the image-height value in the BIE using jbg_newlen(), simply hand over the BIE as usual to jbg_dec_in(). In general, for applications where NEWLEN markers can appear, in particular fax reception, you should consider using the jbig85.c decoder instead, as it can process BIEs with NEWLEN markers in a single pass. A more detailed description of the JBIG-KIT implementation is Markus Kuhn: Effiziente Kompression von bi-level Bilddaten durch kontextsensitive arithmetische Codierung. Studienarbeit, Lehrstuhl für Betriebssysteme, IMMD IV, Universität Erlangen-Nürnberg, Erlangen, July 1995. (German, 62 pages) Please quote the above if you use JBIG-KIT in your research project. *** Happy compressing *** [end] jbigkit-2.1/libjbig/jbig85.c0000664000307500030750000010061412315071063014277 0ustar mgk25mgk25/* * T.85 "light" version of the portable JBIG image compression library * * Copyright 1995-2014 -- Markus Kuhn -- http://www.cl.cam.ac.uk/~mgk25/ * * This module implements a portable standard C encoder and decoder * using the JBIG1 lossless bi-level image compression algorithm * specified in International Standard ISO 11544:1993 and * ITU-T Recommendation T.82. See the file jbig.txt for usage * instructions and application examples. * * 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 2 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, write to the Free Software * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. * * If you want to use this program under different license conditions, * then contact the author for an arrangement. */ #ifdef DEBUG #include #else #define NDEBUG #endif #include #include #include #include "jbig85.h" #define TPB2CX 0x195 /* contexts for TP special pixels */ #define TPB3CX 0x0e5 /* marker codes */ #define MARKER_STUFF 0x00 #define MARKER_RESERVE 0x01 #define MARKER_SDNORM 0x02 #define MARKER_SDRST 0x03 #define MARKER_ABORT 0x04 #define MARKER_NEWLEN 0x05 #define MARKER_ATMOVE 0x06 #define MARKER_COMMENT 0x07 #define MARKER_ESC 0xff /* object code version id */ const char jbg85_version[] = "JBIG-KIT " JBG85_VERSION " (T.85 version) -- (c) 1995-2014 Markus Kuhn -- " "Licence: " JBG85_LICENCE "\n"; #define _(String) String /* to mark translatable string for GNU gettext */ /* * Array with English ASCII error messages that correspond * to return values from public functions in this library. */ static const char *errmsg[] = { _("All OK"), /* JBG_EOK */ _("Reached specified image size"), /* JBG_EOK_INTR */ _("Unexpected end of input data stream"), /* JBG_EAGAIN */ _("Not enough memory available"), /* JBG_ENOMEM */ _("ABORT marker segment encountered"), /* JBG_EABORT */ _("Unknown marker segment encountered"), /* JBG_EMARKER */ _("Input data stream contains invalid data"), /* JBG_EINVAL */ _("Input data stream uses unimplemented JBIG features") /* JBG_EIMPL */ }; /* * Callback adapter function for arithmetic encoder */ static void enc_byte_out(int byte, void *s) { unsigned char c = byte; ((struct jbg85_enc_state *)s)->data_out(&c, sizeof(unsigned char), ((struct jbg85_enc_state *)s)->file); } /* * Initialize the status struct for the encoder. */ void jbg85_enc_init(struct jbg85_enc_state *s, unsigned long x0, unsigned long y0, void (*data_out)(unsigned char *start, size_t len, void *file), void *file) { assert(x0 > 0 && y0 > 0); s->x0 = x0; s->y0 = y0; s->newlen = 0; /* no NEWLEN pending or output */ s->data_out = data_out; s->file = file; s->l0 = s->y0 / 35; /* 35 stripes/image suggested default */ if (s->l0 > 128) s->l0 = 128; else if (s->l0 < 2) s->l0 = 2; #if 1 s->l0 = 128; /* T.85 BASIC setting */ #endif s->mx = 127; s->new_tx = -1; /* no ATMOVE pending */ s->tx = 0; s->options = JBG_TPBON | JBG_VLENGTH; s->comment = NULL; /* no COMMENT pending */ s->y = 0; s->i = 0; s->ltp_old = 0; /* initialize arithmetic encoder */ arith_encode_init(&s->s, 0); s->s.byte_out = &enc_byte_out; s->s.file = s; return; } /* * The following function allows to specify the bits describing the * options of the format as well as the maximum AT movement window and * the number of layer 0 lines per stripes. */ void jbg85_enc_options(struct jbg85_enc_state *s, int options, unsigned long l0, int mx) { if (s->y > 0) return; /* too late to change anything now */ if (options >= 0) s->options = options; if (l0 > 0) s->l0 = l0; if (mx >= 0 && mx < 128) s->mx = mx; return; } /* auxiliary routine to write out NEWLEN */ static void output_newlen(struct jbg85_enc_state *s) { unsigned char buf[6]; assert(s->i == 0); if (s->newlen != 1) return; buf[0] = MARKER_ESC; buf[1] = MARKER_NEWLEN; buf[2] = s->y0 >> 24; buf[3] = (s->y0 >> 16) & 0xff; buf[4] = (s->y0 >> 8) & 0xff; buf[5] = s->y0 & 0xff; s->data_out(buf, 6, s->file); s->newlen = 2; if (s->y == s->y0) { /* if newlen refers to a line in the preceeding stripe, ITU-T T.82 * section 6.2.6.2 requires us to append another SDNORM */ buf[1] = MARKER_SDNORM; s->data_out(buf, 2, s->file); } } /* * Encode one full BIE and pass the generated data to the specified * call-back function */ void jbg85_enc_lineout(struct jbg85_enc_state *s, unsigned char *line, unsigned char *prevline, unsigned char *prevprevline) { unsigned char buf[20]; unsigned long bpl; unsigned char *hp1, *hp2, *hp3, *p1, *q1; unsigned long line_h1 = 0, line_h2, line_h3; unsigned long j; /* loop variable for pixel column */ long o; unsigned a, p, t; int ltp; unsigned long cmin, cmax, clmin, clmax; int tmax; #ifdef DEBUG static long tp_lines; static long encoded_pixels; #endif if (s->y >= s->y0) { /* we have already output the full image, go away */ return; } /* line 0 has no previous line */ if (s->y < 1) prevline = NULL; if (s->y < 2) prevprevline = NULL; /* things that need to be done before the first line is encoded */ if (s->y == 0) { /* prepare BIH */ buf[0] = 0; /* DL = initial layer to be transmitted */ buf[1] = 0; /* D = number of differential layers */ buf[2] = 1; /* P = number of bit planes */ buf[3] = 0; buf[4] = s->x0 >> 24; buf[5] = (s->x0 >> 16) & 0xff; buf[6] = (s->x0 >> 8) & 0xff; buf[7] = s->x0 & 0xff; buf[8] = s->y0 >> 24; buf[9] = (s->y0 >> 16) & 0xff; buf[10] = (s->y0 >> 8) & 0xff; buf[11] = s->y0 & 0xff; buf[12] = s->l0 >> 24; buf[13] = (s->l0 >> 16) & 0xff; buf[14] = (s->l0 >> 8) & 0xff; buf[15] = s->l0 & 0xff; buf[16] = s->mx; buf[17] = 0; /* MY = maximum vertical offset allowed for AT pixel */ buf[18] = 0; /* order: HITOLO = SEQ = ILEAVE = SMID = 0 */ buf[19] = s->options & (JBG_LRLTWO | JBG_VLENGTH | JBG_TPBON); /* output BIH */ s->data_out(buf, 20, s->file); } /* things that need to be done before the next SDE is encoded */ if (s->i == 0) { /* output NEWLEN if there is any pending */ output_newlen(s); /* output comment marker segment if there is any pending */ if (s->comment) { buf[0] = MARKER_ESC; buf[1] = MARKER_COMMENT; buf[2] = s->comment_len >> 24; buf[3] = (s->comment_len >> 16) & 0xff; buf[4] = (s->comment_len >> 8) & 0xff; buf[5] = s->comment_len & 0xff; s->data_out(buf, 6, s->file); s->data_out(s->comment, s->comment_len, s->file); s->comment = NULL; } /* output ATMOVE if there is any pending */ if (s->new_tx != -1 && s->new_tx != s->tx) { s->tx = s->new_tx; buf[0] = MARKER_ESC; buf[1] = MARKER_ATMOVE; buf[2] = 0; buf[3] = 0; buf[4] = 0; buf[5] = 0; buf[6] = s->tx; buf[7] = 0; s->data_out(buf, 8, s->file); } /* initialize adaptive template movement algorithm */ if (s->mx == 0) { s->new_tx = 0; /* ATMOVE has been disabled */ } else { s->c_all = 0; for (t = 0; t <= s->mx; t++) s->c[t] = 0; s->new_tx = -1; /* we have yet to determine ATMOVE ... */ } /* restart arithmetic encoder */ arith_encode_init(&s->s, 1); } #ifdef DEBUG if (s->y == 0) tp_lines = encoded_pixels = 0; fprintf(stderr, "encode line %lu (%2lu of stripe)\n", s->y, s->i); #endif /* bytes per line */ bpl = (s->x0 >> 3) + !!(s->x0 & 7); /* ensure correct zero padding of bitmap at the final byte of each line */ if (s->x0 & 7) { line[bpl - 1] &= ~((1 << (8 - (s->x0 & 7))) - 1); } /* typical prediction */ ltp = 0; if (s->options & JBG_TPBON) { p1 = line; q1 = prevline; ltp = 1; if (q1) while (p1 < line + bpl && (ltp = (*p1++ == *q1++)) != 0) ; else while (p1 < line + bpl && (ltp = (*p1++ == 0 )) != 0) ; arith_encode(&s->s, (s->options & JBG_LRLTWO) ? TPB2CX : TPB3CX, ltp == s->ltp_old); #ifdef DEBUG tp_lines += ltp; #endif s->ltp_old = ltp; } if (!ltp) { /* * Layout of the variables line_h1, line_h2, line_h3, which contain * as bits the neighbour pixels of the currently coded pixel X: * * 76543210765432107654321076543210 line_h3 * 76543210765432107654321076543210 line_h2 * 76543210765432107654321X76543210 line_h1 */ /* pointer to first image byte of the three lines of interest */ hp3 = prevprevline; hp2 = prevline; hp1 = line; line_h1 = line_h2 = line_h3 = 0; if (hp2) line_h2 = (long)*hp2 << 8; if (hp3) line_h3 = (long)*hp3 << 8; /* encode line */ for (j = 0; j < s->x0;) { line_h1 |= *hp1; if (j < bpl * 8 - 8 && hp2) { line_h2 |= *(hp2 + 1); if (hp3) line_h3 |= *(hp3 + 1); } if (s->options & JBG_LRLTWO) { /* two line template */ do { line_h1 <<= 1; line_h2 <<= 1; line_h3 <<= 1; if (s->tx) { if ((unsigned) s->tx > j) a = 0; else { o = (j - s->tx) - (j & ~7L); a = (hp1[o >> 3] >> (7 - (o & 7))) & 1; a <<= 4; } assert(s->tx > 23 || a == ((line_h1 >> (4 + s->tx)) & 0x010)); arith_encode(&s->s, (((line_h2 >> 10) & 0x3e0) | a | ((line_h1 >> 9) & 0x00f)), (line_h1 >> 8) & 1); } else arith_encode(&s->s, (((line_h2 >> 10) & 0x3f0) | ((line_h1 >> 9) & 0x00f)), (line_h1 >> 8) & 1); #ifdef DEBUG encoded_pixels++; #endif /* statistics for adaptive template changes */ if (s->new_tx == -1 && j >= s->mx && j < s->x0 - 2) { p = (line_h1 & 0x100) != 0; /* current pixel value */ s->c[0] += ((line_h2 & 0x4000) != 0) == p; /* default position */ assert(!(((line_h2 >> 6) ^ line_h1) & 0x100) == (((line_h2 & 0x4000) != 0) == p)); for (t = 5; t <= s->mx && t <= j; t++) { o = (j - t) - (j & ~7L); a = (hp1[o >> 3] >> (7 - (o & 7))) & 1; assert(t > 23 || (a == p) == !(((line_h1 >> t) ^ line_h1) & 0x100)); s->c[t] += a == p; } for (; t <= s->mx; t++) { s->c[t] += 0 == p; } ++s->c_all; } } while (++j & 7 && j < s->x0); } else { /* three line template */ do { line_h1 <<= 1; line_h2 <<= 1; line_h3 <<= 1; if (s->tx) { if ((unsigned) s->tx > j) a = 0; else { o = (j - s->tx) - (j & ~7L); a = (hp1[o >> 3] >> (7 - (o & 7))) & 1; a <<= 2; } assert(s->tx > 23 || a == ((line_h1 >> (6 + s->tx)) & 0x004)); arith_encode(&s->s, (((line_h3 >> 8) & 0x380) | ((line_h2 >> 12) & 0x078) | a | ((line_h1 >> 9) & 0x003)), (line_h1 >> 8) & 1); } else arith_encode(&s->s, (((line_h3 >> 8) & 0x380) | ((line_h2 >> 12) & 0x07c) | ((line_h1 >> 9) & 0x003)), (line_h1 >> 8) & 1); #ifdef DEBUG encoded_pixels++; #endif /* statistics for adaptive template changes */ if (s->new_tx == -1 && j >= s->mx && j < s->x0 - 2) { p = (line_h1 & 0x100) != 0; /* current pixel value */ s->c[0] += ((line_h2 & 0x4000) != 0) == p; /* default position */ assert(!(((line_h2 >> 6) ^ line_h1) & 0x100) == (((line_h2 & 0x4000) != 0) == p)); for (t = 3; t <= s->mx && t <= j; t++) { o = (j - t) - (j & ~7L); a = (hp1[o >> 3] >> (7 - (o & 7))) & 1; assert(t > 23 || (a == p) == !(((line_h1 >> t) ^ line_h1) & 0x100)); s->c[t] += a == p; } for (; t <= s->mx; t++) { s->c[t] += 0 == p; } ++s->c_all; } } while (++j & 7 && j < s->x0); } /* if (s->options & JBG_LRLTWO) */ hp1++; if (hp2) hp2++; if (hp3) hp3++; } /* for (j = ...) */ } /* if (!ltp) */ /* line is complete now, deal with end of stripe */ s->i++; s->y++; if (s->i == s->l0 || s->y == s->y0) { /* end of stripe reached */ arith_encode_flush(&s->s); buf[0] = MARKER_ESC; buf[1] = MARKER_SDNORM; s->data_out(buf, 2, s->file); s->i = 0; /* output NEWLEN if there is any pending */ output_newlen(s); } /* check whether it is worth to perform an ATMOVE */ if (s->new_tx == -1 && s->c_all > 2048) { cmin = clmin = 0xffffffffL; cmax = clmax = 0; tmax = 0; for (t = (s->options & JBG_LRLTWO) ? 5 : 3; t <= s->mx; t++) { if (s->c[t] > cmax) cmax = s->c[t]; if (s->c[t] < cmin) cmin = s->c[t]; if (s->c[t] > s->c[tmax]) tmax = t; } clmin = (s->c[0] < cmin) ? s->c[0] : cmin; clmax = (s->c[0] > cmax) ? s->c[0] : cmax; if (s->c_all - cmax < (s->c_all >> 3) && cmax - s->c[s->tx] > s->c_all - cmax && cmax - s->c[s->tx] > (s->c_all >> 4) && /* ^ T.82 said < here, fixed in Cor.1/25 */ cmax - (s->c_all - s->c[s->tx]) > s->c_all - cmax && cmax - (s->c_all - s->c[s->tx]) > (s->c_all >> 4) && cmax - cmin > (s->c_all >> 2) && (s->tx || clmax - clmin > (s->c_all >> 3))) { /* we have decided to perform an ATMOVE */ s->new_tx = tmax; #ifdef DEBUG fprintf(stderr, "ATMOVE: tx=%d, c_all=%lu\n", s->new_tx, s->c_all); #endif } else { s->new_tx = s->tx; /* we have decided not to perform an ATMOVE */ } } assert(s->tx >= 0); /* i.e., tx can safely be cast to unsigned */ #ifdef DEBUG if (s->y == s->y0) fprintf(stderr, "tp_lines = %ld, encoded_pixels = %ld\n", tp_lines, encoded_pixels); #endif return; } /* * Inform encoder about new (reduced) height of image */ void jbg85_enc_newlen(struct jbg85_enc_state *s, unsigned long newlen) { unsigned char buf[6]; if (s->newlen == 2 || newlen >= s->y0 || newlen < 1 || !(s->options & JBG_VLENGTH)) { /* invalid invocation or parameter */ return; } if (newlen < s->y) { /* we are already beyond the new end, therefore move the new end */ newlen = s->y; } if (s->y > 0 && s->y0 != newlen) s->newlen = 1; s->y0 = newlen; if (s->y == s->y0) { /* we are already at the end; finish the current stripe if necessary */ if (s->i > 0) { arith_encode_flush(&s->s); buf[0] = MARKER_ESC; buf[1] = MARKER_SDNORM; s->data_out(buf, 2, s->file); s->i = 0; } /* output NEWLEN if there is any pending */ output_newlen(s); } } /* * Abort encoding process immediately by outputting an ABORT marker segment */ void jbg85_enc_abort(struct jbg85_enc_state *s) { unsigned char buf[2]; buf[0] = MARKER_ESC; buf[1] = MARKER_ABORT; s->data_out(buf, 2, s->file); s->y = s->y0; /* just to prevent further calls to jbg85_enc_lineout() */ } /* * Convert the error codes used by jbg85_dec_in() into an English ASCII string */ const char *jbg85_strerror(int errnum) { errnum >>= 4; if (errnum < 0 || (unsigned) errnum >= sizeof(errmsg)/sizeof(errmsg[0])) return "Unknown error code passed to jbg85_strerror()"; return errmsg[errnum]; } /* * The constructor for a decoder */ void jbg85_dec_init(struct jbg85_dec_state *s, unsigned char *buf, size_t buflen, int (*line_out)(const struct jbg85_dec_state *s, unsigned char *start, size_t len, unsigned long y, void *file), void *file) { s->x0 = 0; s->y0 = 0; s->linebuf = buf; s->linebuf_len = buflen; s->line_out = line_out; s->file = file; s->bie_len = 0; s->end_of_bie = 0; s->x = 0; s->y = 0; s->i = 0; s->comment_skip = 0; s->buf_len = 0; s->pseudo = 1; s->at_moves = 0; s->tx = 0; s->lntp = 1; s->p[0] = 0; s->p[1] = -1; s->p[2] = -1; arith_decode_init(&s->s, 0); return; } /* * Decode the new len PSCD bytes to which data points and output * decoded lines as they are completed. Return the number of bytes * which have actually been read. This will be less than len if a * marker segment was part of the data or if the final byte was * 0xff, meaning that this code can not determine whether we have a * marker segment. */ static size_t decode_pscd(struct jbg85_dec_state *s, unsigned char *data, size_t len) { unsigned char *hp1, *hp2, *hp3, *p1; register unsigned long line_h1, line_h2, line_h3; unsigned long x; long o; unsigned a; int n; int pix, slntp; int buflines = 3 - !!(s->options & JBG_LRLTWO); /* forward data to arithmetic decoder */ s->s.pscd_ptr = data; s->s.pscd_end = data + len; /* restore a few local variables */ line_h1 = s->line_h1; line_h2 = s->line_h2; line_h3 = s->line_h3; x = s->x; #ifdef DEBUG if (x == 0 && s->i == 0 && s->pseudo) fprintf(stderr, "decode_pscd(%p, %p, %ld)\n", (void *) s, (void *) data, (long) len); #endif s->intr = 0; for (; s->i < s->l0 && s->y < s->y0 && !s->intr; s->i++, s->y++) { /* pointer to image byte */ hp1 = s->linebuf + s->p[0] * s->bpl + (x >> 3); hp2 = s->linebuf + s->p[1] * s->bpl + (x >> 3); hp3 = s->linebuf + s->p[2] * s->bpl + (x >> 3); /* adaptive template changes */ if (x == 0 && s->pseudo) for (n = 0; n < s->at_moves; n++) if (s->at_line[n] == s->i) { s->tx = s->at_tx[n]; #ifdef DEBUG fprintf(stderr, "ATMOVE: line=%lu, tx=%d.\n", s->i, s->tx); #endif } assert(s->tx >= 0); /* i.e., tx can safely be cast to unsigned */ /* typical prediction */ if (s->options & JBG_TPBON && s->pseudo) { slntp = arith_decode(&s->s, (s->options & JBG_LRLTWO) ? TPB2CX : TPB3CX); if (slntp < 0) goto leave; s->lntp = !(slntp ^ s->lntp); if (!s->lntp) { /* this line is 'typical' (i.e. identical to the previous one) */ if (s->p[1] < 0) { /* first line of page or (following SDRST) of stripe */ for (p1 = hp1; p1 < hp1 + s->bpl; *p1++ = 0) ; s->intr = s->line_out(s, hp1, s->bpl, s->y, s->file); /* rotate the ring buffer that holds the last three lines */ s->p[2] = s->p[1]; s->p[1] = s->p[0]; if (++(s->p[0]) >= buflines) s->p[0] = 0; } else { s->intr = s->line_out(s, hp2, s->bpl, s->y, s->file); /* duplicate the last line in the ring buffer */ s->p[2] = s->p[1]; } continue; } /* this line is 'not typical' and has to be coded completely */ } s->pseudo = 0; /* * Layout of the variables line_h1, line_h2, line_h3, which contain * as bits the neighbour pixels of the currently decoded pixel X: * * 76543210 76543210 76543210 76543210 line_h3 * 76543210 76543210 76543210 76543210 line_h2 * 76543210 76543210 76543210 76543210 X line_h1 */ if (x == 0) { line_h1 = line_h2 = line_h3 = 0; if (s->p[1] >= 0) line_h2 = (long)*hp2 << 8; if (s->p[2] >= 0) line_h3 = (long)*hp3 << 8; } /* decode line */ while (x < s->x0) { if ((x & 7) == 0) { if (x < (s->bpl - 1) * 8 && s->p[1] >= 0) { line_h2 |= *(hp2 + 1); if (s->p[2] >= 0) line_h3 |= *(hp3 + 1); } } if (s->options & JBG_LRLTWO) { /* two line template */ do { if (s->tx) { if ((unsigned) s->tx > x) a = 0; else if (s->tx < 8) a = ((line_h1 >> (s->tx - 5)) & 0x010); else { o = (x - s->tx) - (x & ~7L); a = (hp1[o >> 3] >> (7 - (o & 7))) & 1; a <<= 4; } assert(s->tx > 31 || a == ((line_h1 >> (s->tx - 5)) & 0x010)); pix = arith_decode(&s->s, (((line_h2 >> 9) & 0x3e0) | a | (line_h1 & 0x00f))); } else pix = arith_decode(&s->s, (((line_h2 >> 9) & 0x3f0) | (line_h1 & 0x00f))); if (pix < 0) goto leave; line_h1 = (line_h1 << 1) | pix; line_h2 <<= 1; } while ((++x & 7) && x < s->x0); } else { /* three line template */ do { if (s->tx) { if ((unsigned) s->tx > x) a = 0; else if (s->tx < 8) a = ((line_h1 >> (s->tx - 3)) & 0x004); else { o = (x - s->tx) - (x & ~7L); a = (hp1[o >> 3] >> (7 - (o & 7))) & 1; a <<= 2; } assert(s->tx > 31 || a == ((line_h1 >> (s->tx - 3)) & 0x004)); pix = arith_decode(&s->s, (((line_h3 >> 7) & 0x380) | ((line_h2 >> 11) & 0x078) | a | (line_h1 & 0x003))); } else pix = arith_decode(&s->s, (((line_h3 >> 7) & 0x380) | ((line_h2 >> 11) & 0x07c) | (line_h1 & 0x003))); if (pix < 0) goto leave; line_h1 = (line_h1 << 1) | pix; line_h2 <<= 1; line_h3 <<= 1; } while ((++x & 7) && x < s->x0); } /* if (s->options & JBG_LRLTWO) */ *hp1++ = line_h1; hp2++; hp3++; } /* while (x < s->x0) */ *(hp1 - 1) <<= s->bpl * 8 - s->x0; s->intr = s->line_out(s, s->linebuf + s->p[0] * s->bpl, s->bpl, s->y, s->file); x = 0; s->pseudo = 1; /* rotate the ring buffer that holds the last three lines */ s->p[2] = s->p[1]; s->p[1] = s->p[0]; if (++(s->p[0]) >= buflines) s->p[0] = 0; } /* for (i = ...) */ leave: /* save a few local variables */ s->line_h1 = line_h1; s->line_h2 = line_h2; s->line_h3 = line_h3; s->x = x; return s->s.pscd_ptr - data; } /* * Helper routine for processing SDNORM/SDRST marker segment * (which is found in s->buffer[0..1]) */ static int finish_sde(struct jbg85_dec_state *s) { /* decode final pixels based on trailing zero bytes */ s->s.nopadding = 0; if (decode_pscd(s, s->buffer, 2) != 2 && s->intr) return 1; /* prepare decoder for next SDE */ arith_decode_init(&s->s, s->buffer[1] == MARKER_SDNORM); s->s.nopadding = s->options & JBG_VLENGTH; s->x = 0; s->i = 0; s->pseudo = 1; s->at_moves = 0; if (s->buffer[1] == MARKER_SDRST) { s->tx = 0; s->lntp = 1; s->p[0] = 0; s->p[1] = -1; s->p[2] = -1; } return 0; } /* * Provide to the decoder a new BIE fragment of len bytes starting at data. * * Unless cnt is NULL, *cnt will contain the number of actually read bytes * on return. * * Normal return values: * * JBG_EAGAIN All data bytes provided so far have been processed * (*cnt == len) but the end of the data stream has * not yet been recognized. Call the function again * with additional BIE bytes. * JBG_EOK The function has reached the end of the BIE and * the full image has been decoded. * JBG_EOK_INTR Parsing the BIE has been interrupted as had been * requested by a non-zero return value of line_out(). * This function can be called again with the * rest of the BIE to continue the decoding process. * The remaining len - *cnt bytes of the previous * data block will then have to be passed to this * function again (only if len > *cnt). * * Any other return value indicates that the decoding process was * aborted by a serious problem and the only function you can then * still call is jbg85_strerror() to find out what to tell the user. * (Looking at the least significant bits of the return value will * provide additional information by identifying which test exactly * has failed.) */ int jbg85_dec_in(struct jbg85_dec_state *s, unsigned char *data, size_t len, size_t *cnt) { int required_length; unsigned long y; size_t dummy_cnt; if (!cnt) cnt = &dummy_cnt; *cnt = 0; /* read in 20-byte BIH */ if (s->bie_len < 20) { while (s->bie_len < 20 && *cnt < len) s->buffer[s->bie_len++] = data[(*cnt)++]; if (s->bie_len < 20) return JBG_EAGAIN; /* parse header parameters */ s->x0 = (((long) s->buffer[ 4] << 24) | ((long) s->buffer[ 5] << 16) | ((long) s->buffer[ 6] << 8) | (long) s->buffer[ 7]); s->y0 = (((long) s->buffer[ 8] << 24) | ((long) s->buffer[ 9] << 16) | ((long) s->buffer[10] << 8) | (long) s->buffer[11]); s->l0 = (((long) s->buffer[12] << 24) | ((long) s->buffer[13] << 16) | ((long) s->buffer[14] << 8) | (long) s->buffer[15]); s->bpl = (s->x0 >> 3) + !!(s->x0 & 7); /* bytes per line */ s->mx = s->buffer[16]; s->options = s->buffer[19]; s->s.nopadding = s->options & JBG_VLENGTH; /* test whether this looks like a valid JBIG header at all */ if (s->buffer[1] < s->buffer[0]) return JBG_EINVAL | 1; /* are padding bits zero as required? */ if (s->buffer[3] != 0) return JBG_EINVAL | 2; /* padding != 0 */ if ((s->buffer[18] & 0xf0) != 0) return JBG_EINVAL | 3; /* padding != 0 */ if ((s->buffer[19] & 0x80) != 0) return JBG_EINVAL | 4; /* padding != 0 */ if (!s->buffer[2]) return JBG_EINVAL | 5; if (!s->x0) return JBG_EINVAL | 6; if (!s->y0) return JBG_EINVAL | 7; if (!s->l0) return JBG_EINVAL | 8; if (s->mx > 127) return JBG_EINVAL | 9; if (s->buffer[ 0] != 0) return JBG_EIMPL | 8; /* parameter outside T.85 */ if (s->buffer[ 1] != 0) return JBG_EIMPL | 9; /* parameter outside T.85 */ if (s->buffer[ 2] != 1) return JBG_EIMPL |10; /* parameter outside T.85 */ if (s->buffer[17] != 0) return JBG_EIMPL |11; /* parameter outside T.85 */ #if JBG85_STRICT_ORDER_BITS if (s->buffer[18] != 0) return JBG_EIMPL |12; /* parameter outside T.85 */ #endif if (s->options & 0x17) return JBG_EIMPL |13; /* parameter outside T.85 */ if (s->x0 > (s->linebuf_len / ((s->options & JBG_LRLTWO) ? 2 : 3)) * 8) return JBG_ENOMEM; /* provided line buffer is too short */ } /* * BID processing loop */ while (*cnt < len || s->end_of_bie == 1) { if (s->end_of_bie == 1) s->end_of_bie = 2; /* process floating marker segments */ /* skip COMMENT contents */ if (s->comment_skip) { if (s->comment_skip <= len - *cnt) { *cnt += s->comment_skip; s->comment_skip = 0; } else { s->comment_skip -= len - *cnt; *cnt = len; } continue; } /* load marker segments into s->buffer for processing */ if (s->buf_len > 0) { assert(s->buffer[0] == MARKER_ESC); /* load enough bytes to determine length of marker segment */ while (s->buf_len < 2 && *cnt < len) s->buffer[s->buf_len++] = data[(*cnt)++]; if (s->buf_len < 2) continue; switch (s->buffer[1]) { case MARKER_COMMENT: required_length = 6; break; case MARKER_ATMOVE: required_length = 8; break; case MARKER_NEWLEN: required_length = 6; break; case MARKER_SDNORM: case MARKER_SDRST: if ((s->options & JBG_VLENGTH) && !s->end_of_bie) { /* peek ahead whether a NEWLEN marker segment follows */ required_length = 2 + 1; if (s->buf_len == 2 + 1 && s->buffer[2] == MARKER_ESC) required_length = 2 + 2; /* SDNORM + 2 marker sequence bytes */ else if (s->buf_len >= 2 + 2 && s->buffer[3] == MARKER_NEWLEN) required_length = 2 + 6; /* SDNORM + NEWLEN */ } else { /* no further NEWLEN allowed or end of BIE reached */ required_length = 2; } break; case MARKER_ABORT: s->buf_len = 0; return JBG_EABORT; case MARKER_STUFF: /* forward stuffed 0xff to arithmetic decoder */ if (decode_pscd(s, s->buffer, 2) == 2 || !s->intr) s->buf_len = 0; if (s->intr) return JBG_EOK_INTR; /* line_out() requested interrupt */ continue; default: return JBG_EMARKER; } /* load minimal number of additional bytes required for processing */ while (s->buf_len < required_length && *cnt < len) s->buffer[s->buf_len++] = data[(*cnt)++]; if (s->buf_len < required_length) continue; /* now the buffer is filled with exactly one marker segment * (or in the case of SDNORM/SDRST sometimes also with * two additional peek-ahead bytes) */ switch (s->buffer[1]) { case MARKER_COMMENT: s->comment_skip = (((long) s->buffer[2] << 24) | ((long) s->buffer[3] << 16) | ((long) s->buffer[4] << 8) | (long) s->buffer[5]); break; case MARKER_ATMOVE: if (s->at_moves < JBG85_ATMOVES_MAX) { s->at_line[s->at_moves] = (((long) s->buffer[2] << 24) | ((long) s->buffer[3] << 16) | ((long) s->buffer[4] << 8) | (long) s->buffer[5]); s->at_tx[s->at_moves] = (signed char) s->buffer[6]; if (s->at_tx[s->at_moves] > (int) s->mx || (s->at_tx[s->at_moves] < ((s->options & JBG_LRLTWO) ? 5 : 3) && s->at_tx[s->at_moves] != 0) || s->buffer[7] != 0) return JBG_EINVAL | 11; s->at_moves++; } else return JBG_EIMPL | 14; /* more than JBG85_ATMOVES_MAX ATMOVES */ break; case MARKER_NEWLEN: y = (((long) s->buffer[2] << 24) | ((long) s->buffer[3] << 16) | ((long) s->buffer[4] << 8) | (long) s->buffer[5]); if (y > s->y0) return JBG_EINVAL | 12; #ifndef JBG85_TOLERATE_MULTIPLE_NEWLEN if (!(s->options & JBG_VLENGTH)) return JBG_EINVAL | 13; s->options &= ~JBG_VLENGTH; #endif s->y0 = y; break; case MARKER_SDNORM: case MARKER_SDRST: switch (s->buf_len) { case 2: /* process regular SDNORM/SDRST without peek-ahead bytes */ if (finish_sde(s)) return JBG_EOK_INTR; /* line_out() requested interrupt */ /* check whether this was the last SDE */ if (s->y >= s->y0) return JBG_EOK; break; case 2+1: /* process single peek-ahead byte */ if (s->buffer[2] == MARKER_ESC) continue; /* next time we'll have s->buf_len == 2 + 2 */ else { /* push back the single peek-ahead PCSD byte */ assert(*cnt > 0); (*cnt)--; s->buf_len--; if (finish_sde(s)) { return JBG_EOK_INTR; /* line_out() requested interrupt */ } } break; case 2+2: /* process 2-byte peek-ahead marker sequence */ if (s->buffer[2] == MARKER_ESC && s->buffer[3] == MARKER_NEWLEN) continue; /* next time we'll have s->buf_len == 2 + 6 */ else { if (finish_sde(s)) return JBG_EOK_INTR; /* line_out() requested interrupt */ /* recycle the two peek-ahead marker sequence bytes */ s->buffer[0] = s->buffer[2]; s->buffer[1] = s->buffer[3]; s->buf_len = 2; if (s->intr) return JBG_EOK_INTR; /* line_out() requested interrupt */ continue; } case 2+6: /* process peek-ahead NEWLEN marker sequence */ y = (((long) s->buffer[4] << 24) | ((long) s->buffer[5] << 16) | ((long) s->buffer[6] << 8) | (long) s->buffer[7]); if (y > s->y0) return JBG_EINVAL | 12; if (!(s->options & JBG_VLENGTH)) return JBG_EINVAL | 13; s->y0 = y; if (finish_sde(s)) return JBG_EOK_INTR; /* line_out() requested interrupt */ s->buf_len = 0; s->options &= ~JBG_VLENGTH; /* we leave returning JBG_EOK to the following SDNORM/RST */ break; } if (s->intr) { s->buf_len = 0; return JBG_EOK_INTR; /* line_out() requested interrupt */ } } /* switch (s->buffer[1]) */ s->buf_len = 0; } else if (*cnt < len && data[*cnt] == MARKER_ESC) s->buffer[s->buf_len++] = data[(*cnt)++]; else { /* we have found PSCD bytes */ *cnt += decode_pscd(s, data + *cnt, len - *cnt); if (s->intr) return JBG_EOK_INTR; /* line_out() requested interrupt */ if (*cnt < len && data[*cnt] != MARKER_ESC) { #ifdef DEBUG fprintf(stderr, "PSCD was longer than expected, unread bytes " "%02x %02x %02x %02x ...\n", data[*cnt], data[*cnt+1], data[*cnt+2], data[*cnt+3]); #endif return JBG_EINVAL | 14; /* PSCD was longer than expected */ } } } /* of BID processing loop 'while (*cnt < len) ...' */ return JBG_EAGAIN; } /* * After the final BIE byte has been delivered to jbg85_dec_in(), it * may still return with JBG_EAGAIN in case the VLENGTH=1 option was * used and no NEWLEN marker section has appeared yet. This is because * such a BIE is not self-terminating (i.e., there could still be a * NEWLEN followed by an SDNORM or SDRST lurk after the final stripe, * which needs to be processed before the final line is output, see * ITU-T Recommendation T.85, Appendix I). Therefore, after the last * byte has been delivered, call this routine to signal the end of the * BIE. This is necessary to allow the routine to finish processing * BIEs with option VLENGTH=1 that do not actually contain any NEWLEN * marker section. */ int jbg85_dec_end(struct jbg85_dec_state *s) { s->end_of_bie = 1; return jbg85_dec_in(s, NULL, 0, NULL); } jbigkit-2.1/libjbig/jbig85.h0000664000307500030750000001543612315071063014313 0ustar mgk25mgk25/* * Header file for the T.85 "light" version of the portable * JBIG image compression library * * Copyright 1995-2014 -- Markus Kuhn -- http://www.cl.cam.ac.uk/~mgk25/ */ #ifndef JBG85_H #define JBG85_H #include #include "jbig_ar.h" /* * JBIG-KIT version number */ #define JBG85_VERSION "2.1" #define JBG85_VERSION_MAJOR 2 #define JBG85_VERSION_MINOR 1 /* * JBIG-KIT licence agreement reference code: * If you use JBIG-KIT under a commercial licence, please replace * below the letters GPL with the reference code that you received * with your licence agreement. (This code is typically a letter "A" * followed by four decimal digits, e.g. "A1234".) */ #define JBG85_LICENCE "GPL" /* * Maximum number of ATMOVEs per stripe that decoder can handle */ #define JBG85_ATMOVES_MAX 1 #ifndef JBG_LRLTWO /* * Option and order flags */ #define JBG_LRLTWO 0x40 #define JBG_VLENGTH 0x20 #define JBG_TPBON 0x08 /* * Possible error code return values */ #define JBG_EOK (0 << 4) #define JBG_EOK_INTR (1 << 4) #define JBG_EAGAIN (2 << 4) #define JBG_ENOMEM (3 << 4) #define JBG_EABORT (4 << 4) #define JBG_EMARKER (5 << 4) #define JBG_EINVAL (6 << 4) #define JBG_EIMPL (7 << 4) #endif /* * Status of a JBIG encoder */ struct jbg85_enc_state { unsigned long x0, y0; /* size of the input image */ unsigned long l0; /* number of lines per stripe */ int options; /* encoding parameters */ int newlen; /* 0 = jbg85_enc_newlen() has not yet been called 1 = jbg85_enc_newlen() has updated y0, NEWLEN pending 2 = NEWLEN has already been output */ unsigned mx; /* maximum ATMOVE window size */ unsigned long y; /* next line number to be encoded */ unsigned long i; /* next per-stripe line number to be encoded */ int tx; /* x-offset of adaptive template pixel */ unsigned long c_all, c[128]; /* adaptive template algorithm variables */ int new_tx; /* -1 = no ATMOVE pending, otherwise new TX value */ int ltp_old; /* true if line y-1 was "typical" */ struct jbg_arenc_state s; /* arithmetic encoder status */ void (*data_out)(unsigned char *start, size_t len, void *file); /* data write callback */ void *file; /* parameter passed to data_out() */ unsigned char *comment; /* content of comment marker segment to be added at next opportunity (will be reset to NULL as soon as comment has been written) */ unsigned long comment_len; /* length of data pointed to by comment */ }; /* * Status of a JBIG decoder */ struct jbg85_dec_state { /* data from BIH */ unsigned long x0, y0; /* size of the full image */ unsigned long l0; /* number of lines per stripe */ int options; /* encoding parameters */ int mx; /* maximum ATMOVE window size */ /* image data */ int p[3]; /* curr. line starts at linebuf+bpl*p[0], prev. line starts * at linebuf+bpl*p[1], its predecessor at linebuf+bpl*p[2] */ unsigned char *linebuf; /* buffer region provided by caller */ size_t linebuf_len; size_t bpl; /* bytes per line */ /* status information */ int tx; /* x-offset of AT pixel */ struct jbg_ardec_state s; /* arithmetic decoder status */ unsigned long bie_len; /* number of bytes read so far */ unsigned char buffer[20]; /* used to store BIH or marker segments fragm. */ int buf_len; /* number of bytes in buffer */ unsigned long comment_skip; /* remaining bytes of a COMMENT segment */ unsigned long x; /* x position of next pixel */ unsigned long stripe; /* current stripe */ unsigned long y; /* line in image (first line is 0) */ unsigned long i; /* line in current stripe (first line of stripe is 0) */ int at_moves; /* number of AT moves in the current stripe */ unsigned long at_line[JBG85_ATMOVES_MAX]; /* lines at which an * * AT move will happen */ int at_tx[JBG85_ATMOVES_MAX]; /* ATMOVE x-offsets in current stripe */ unsigned long line_h1, line_h2, line_h3; /* variables of decode_pscd */ int pseudo; /* flag for TPBON/TPDON: next pixel is pseudo pixel */ int lntp; /* flag for TP: line is not typical */ int (*line_out)(const struct jbg85_dec_state *s, unsigned char *start, size_t len, unsigned long y, void *file); /* data write callback */ void *file; /* parameter passed to data_out() */ int intr; /* flag that line_out requested interrupt */ int end_of_bie; /* flag that the end of the BIE has been signalled */ }; /* function prototypes */ void jbg85_enc_init(struct jbg85_enc_state *s, unsigned long x0, unsigned long y0, void (*data_out)(unsigned char *start, size_t len, void *file), void *file); void jbg85_enc_options(struct jbg85_enc_state *s, int options, unsigned long l0, int mx); void jbg85_enc_lineout(struct jbg85_enc_state *s, unsigned char *line, unsigned char *prevline, unsigned char *prevprevline); void jbg85_enc_newlen(struct jbg85_enc_state *s, unsigned long y0); void jbg85_enc_abort(struct jbg85_enc_state *s); void jbg85_dec_init(struct jbg85_dec_state *s, unsigned char *buf, size_t buflen, int (*line_out)(const struct jbg85_dec_state *s, unsigned char *start, size_t len, unsigned long y, void *file), void *file); int jbg85_dec_in(struct jbg85_dec_state *s, unsigned char *data, size_t len, size_t *cnt); int jbg85_dec_end(struct jbg85_dec_state *s); const char *jbg85_strerror(int errnum); /* some macros for examining decoder state */ #define jbg85_dec_finished(s) ((s)->bie_len == 20 && (s)->y >= (s)->y0) /* enquire about image size */ #define jbg85_dec_getwidth(s) ((s)->x0) #define jbg85_dec_getheight(s) ((s)->y0) /* enquire about validity of image-size results */ #define jbg85_dec_validwidth(s) ((s)->bie_len == 20) #define jbg85_dec_finalheight(s) ((s)->bie_len == 20 && \ ((((s)->options & JBG_VLENGHT) == 0) || \ ((s)->y >= (s)->y0))) #endif /* JBG85_H */ jbigkit-2.1/libjbig/jbig85.txt0000664000307500030750000006517512315071063014710 0ustar mgk25mgk25 Using the T.85 "light" version of the JBIG-KIT library ------------------------------------------------------ Markus Kuhn -- 2008-08-30 This text explains how to use the functions provided by the JBIG-KIT portable image compression library jbig85.c in your application software. 1 Distinguishing features The jbig85.c library implements only the "single-progression sequential coding" subset of the JBIG1 standard, which is defined in ITU-T Recommendation T.85 , also known as the "facsimile application profile". This means that the JBIG1 data streams that the jbig85.c library can process can have - no progressive encoding, i.e. the image is always encoded in a single resolution layer (and not as a sequence of layers of a resolution pyramid); - only a single plane, i.e. the raw data are black/white images with only one bit per pixel information. The jbig85.c library is not suitable for continuous-tone (colour or grey-scale) image applications, including the fax method described in ITU-R Recommendation T.43. For these applications, use the full jbig.c library instead. The T.85 restrictions are sufficient for black/white fax transmission and several other common bi-level image applications (printer drivers, document archiving, etc.). They simplify the design of the encoder and decoder and allow the jbig85.c library to provide several advantages over the full-featured jbig.c: - Only the last three lines of the uncompressed image need to be kept in RAM at any time. - All memory allocation is done outside the jbig85.c library, which performs no calls to malloc(), free(), etc. - The implementation can handle images whose height (number of pixel rows) is not yet known before the last line has been encoded or decoded. - All usage modes of the NEWLEN marker segment are supported, including a NEWLEN occurring after the final stripe, as required by ITU-T Recommendation T.85, using only a single pass over the data. - The code is smaller and there is no need to store tables related to the resolution-reduction algorithms. This makes the jbig85.c library particularly suited for very small embedded applications, e.g. low-end fax machines, along with the fact that the library is non-recursive and requires only a very small stack (typically just a bit over 100 bytes on a 32-bit system). The jbig85.c library may also be a good choice where very large black/white images are processed. The jbig85.c and jbig.c libraries both can be linked simultaneously with the same application if you #include jbig85.h after jbig.h into your source code. 2 Introduction to JBIG (T.85 subset) We start with a short introduction to the T.85 subset of JBIG1. More detailed information is provided in the "Introduction and overview" section of the JBIG1 standard. Information on how to obtain a copy of the standard is available from or . The JBIG1 standard allows the encoder to divide an image into several horizontal stripes. All stripes have equal size, except perhaps the final one. The compressed data stream specified by the JBIG standard is called a bi-level image entity (BIE). A BIE consists of a 20-byte header, followed by a sequence of stripe data entities (SDE). Each SDE encodes the content of one single stripe in one plane of one resolution layer. Between the SDEs, other information blocks (called floating marker segments) can also be present. They are used to change certain parameters of the algorithm in the middle of an image or contain additional application specific information. A BIE looks like this: +------------------------------------------------+ | | | 20-byte header (specifying image size, stripe | | size, and options) | | | +------------------------------------------------+ | | | optional floating marker segments | | | +------------------------------------------------+ | | | stripe data entity | | | +------------------------------------------------+ | | | optional floating marker segments | | | +------------------------------------------------+ | | | stripe data entity | | | +------------------------------------------------+ ... +------------------------------------------------+ | | | stripe data entity | | | +------------------------------------------------+ It is possible to use the raw BIE data stream as specified by the JBIG standard directly as the format of a file used for storing images. This is what the pbmtojbg, jbgtopbm, pbmtojbg85, and jbgtopbm85 conversion tools do that are provided in this package as demonstration applications. However, as the BIE format has been designed for a large number of very different applications, and to allow efficient direct processing by special JBIG hardware chip implementations, the BIE header contains only the minimum amount of information absolutely required by the decompression algorithm. Many features expected from a good file format are missing in the BIE data stream: - no "magic code" in the first few bytes to allow identification of the file format on a typeless file system and to allow automatic distinction from other compression algorithms - no standardized way to encode additional information such as a textual description, the physical size and resolution of the document, etc. - a checksum to ensure image integrity - encryption and signature mechanisms - many things more Raw BIE data streams alone may therefore not be a suitable format for document archiving and exchange. A standard format for this purpose would typically combine a BIE representing the image data with an additional header providing auxiliary information into one file. Existing established multi-purpose file formats with a rich set of auxiliary information attributes like TIFF could be extended easily to also hold JBIG compressed data. On the other hand, in e.g. database applications, a BIE might be stored directly in a binary variable-length field. Auxiliary information would then be stored in other fields of the same record, to simplify search operations. 2 Compressing an image 2.1 Format of the source image To be processed by the jbig85.c encoder, the image has to be present in memory a bitmap. Each byte of a bitmap contains eight pixels, where the most significant bit represents the leftmost of these. Each line of a bitmap has to be stored in an integral number of bytes. If the image width is not an integral multiple of eight, then the final byte has to be padded with zero bits. For example the 23x5 pixels large single plane image: .XXXXX..XXX...X...XXX.. .....X..X..X..X..X..... .....X..XXX...X..X.XXX. .X...X..X..X..X..X...X. ..XXX...XXX...X...XXX.. is represented by the 15 bytes 01111100 11100010 00111000 00000100 10010010 01000000 00000100 11100010 01011100 01000100 10010010 01000100 00111000 11100010 00111000 or in hexadecimal notation 7c e2 38 04 92 40 04 e2 5c 44 92 44 38 e2 38 This is the format used in binary PBM files and it can also be handled directly by the Xlib library of the X Window System. The standard recommends that a 0 pixel represents the background and a 1 pixel represents the foreground colour of an image, in other words, 0 is white and 1 is black for scanned paper documents. 2.2 A simple compression application In order to use the library in your application, just link libjbig85.a to your executable (on Unix systems just add -ljbig85 and -L. to the command line options of your compiler, on other systems you will have to write a new Makefile anyway), copy the file jbig85.h into your source directory and put the line #include "jbig85.h" into your source code. The library interface follows object-oriented programming principles. You have to declare a variable (object) struct jbg85_enc_state s; which contains the current status of an encoder. Then you initialize the encoder by calling void jbg85_enc_init(struct jbg85_enc_state *s, unsigned long x, unsigned long y, void (*data_out)(unsigned char *start, size_t len, void *file), void *file); The parameters have the following meaning: s A pointer to the jbg85_enc_state structure that you want to initialize. x The width of your image in pixels. y The height of your image in pixels (lines). This can be a larger value than the actual height of the image, or even 2^32-1 (or equally -1), if the height of the image is not yet known. In that case, leave the JBG_VLENGTH option set (see below) and call jbg85_enc_newlen() as soon as the actual image height is known. data_out This is a call-back function that the encoder will call during the compression process in order to deliver the BIE data to your application. The parameters of the function data_out are a pointer start to the new block of data being delivered, as well as the number len of delivered bytes. The pointer file is transparently delivered to data_out, as specified in jbg85_enc_init(). Typically, data_out will write the BIE portion to a file, send it to a network connection, or append it to some memory buffer. file A pointer parameter that is passed on to data_out() and can be used, for instance, to allow data_out() to distinguish by which compression task it has been called in multi-threaded applications. The compression can then be started by calling the function void jbg85_enc_lineout(struct jbg85_enc_state *s, unsigned char *line, unsigned char *prevline, unsigned char *prevprevline); successively for each line of the image, top to bottom. The parameters are: line A pointer to the first byte of the line to be encoded. prevline A pointer to the data that the line parameter pointed to in the previous call. The value will be ignored if this is the first call. prevprevline A pointer to the data that the prevline parameter pointed to in the previous call. The value will be ignored if this is the first or second call. After jbg85_enc_lineout() has been called for all lines of the image, the complete BIE will have been delivered via several callbacks to data_out(). These BIE bytes are delivered as soon as possible, as the encoder cannot buffer more than a few bytes internally. A minimal example application, which sends the BIE of the above bitmap to stdout, looks like this: --------------------------------------------------------------------------- /* A sample JBIG T.85 encoding application */ #include #include "jbig85.h" void output_bie(unsigned char *start, size_t len, void *file) { fwrite(start, 1, len, (FILE *) file); return; } int main() { unsigned char bitmap[15] = { /* 23 x 5 pixels, "JBIG" */ 0x7c, 0xe2, 0x38, 0x04, 0x92, 0x40, 0x04, 0xe2, 0x5c, 0x44, 0x92, 0x44, 0x38, 0xe2, 0x38 }; struct jbg85_enc_state se; int i; jbg85_enc_init(&se, 23, 5, output_bie, stdout); /* initialize encoder */ jbg85_enc_options(&se, JBG_TPBON, 0, -1); /* clear JBG_VLENGTH option */ for (i = 0; i < 5; i++) { /* encode line */ jbg85_enc_lineout(&se, bitmap+i*3, bitmap+(i-1)*3, bitmap+(i-2)*3); } return 0; } --------------------------------------------------------------------------- This software produces a 37 byte long BIE. (JBIG is not very good at compressing extremely small images like in this example, because the arithmetic encoder requires some startup data in order to generate reasonable statistics which influence the compression process and because there is some header overhead.) 2.3 More about compression If jbg85_enc_lineout() is called directly after jbg85_enc_init(), the following default values are used for various compression parameters: - The number of lines per stripe (l0) is set to 128, which is the T.85 BASIC setting. - The typical-prediction (TPBON) and variable-length (VLENGTH) options are activated, but the two-line template (LRLTWO) option is not. - The maximal horizontal offset of the adaptive template pixel is 127 (mx = 127, my = 0). In order to change any of these default parameters, an additional function has to be called between jbg85_enc_init() and the first jbg85_enc_lineout(): void jbg85_enc_options(struct jbg85_enc_state *s, int options, unsigned long l0, int mx) The options value can contain the following bits, which activate some of the optional algorithms defined by JBIG: JBG_LRLTWO This option bit changes the JBIG algorithm such that the context in which the probability of a pixel is estimated includes only the previous line (two-line template), rather than the previous two lines (three-line template). This option is off by default and the author cannot think of a good reason to set it. [Some people in the JBIG committee seem to have argued that using a two-line template will make software implementations a little bit faster, while others have argued that using only two lines will decrease compression efficiency by around 5%. As you might expect from a committee, now both alternatives are allowed (and add to the implementation and testing complexity of every decoder).] JBG_TPBON This bit activates the "typical prediction" algorithm. It is set by default. Typical prediction means that JBIG prefixes each line to be encoded with a "pseudopixel" that indicates if the line is identical to the previous line, and skips encoding the line if it is. This helps to encode empty parts of a page very efficiently in just a few bytes, therefore this option should be left on. (The only reason the author could think of for ever deactivating this option is if you know in advance that there will never be two identical lines follow each other in the image to be encoded, in which case deactivating this option might provide a tiny performance improvement.) JBG_VLENGTH This bit indicates that the image height y provided to jbg85_enc_init() was only an estimate and may be lowered sometimes during the encoding process using a call to jbg85_enc_newlen(). This feature is intended for fax machines that start transmitting a page while still scanning it and without knowing how long the page is going to be. Value -1 for options keeps the current setting, the default is JBG_TPBON | JBG_VLENGTH. The other parameters are: l0 Sets the number of lines per stripe (valid range: 1 to 2^32-1, default 128, value 0 keeps the current setting). mx Changes the maximal offset allowed for the adaptive template pixel (valid range: 0 to 127, default 127, value -1 keeps the current setting). If the JBG_VLENGTH option was set, then you can call at any time the function void jbg85_enc_newlen(struct jbg85_enc_state *s, unsigned long newlen) in order to announce the actual height of the image. You can call this function only once per image, and the provided new height value newlen must not be larger than the estimate y originally provided. It is good practice to call jbg85_enc_newlen() as soon as the height of the image is known. However, it is even possible to call it after the last line has already been encoded using jbg85_enc_lineout(). The latter case will result in a somewhat odd BIE, where an additional empty stripe has to be appended just to announce the new length. This is not pretty and was not described in great detail in the original JBIG1 standard, but decoders are required by ITU-T T.85 to understand even this extremely late announcement of the end of the image. If the image height y initially given to jbg85_enc_init() is already the correct final value and you will therefore never call jbg85_enc_newlen(), then it is good practice to clear the JBG_VLENGTH option bit, which is set by default, e.g. by calling jbg85_enc_options(&s, JBG_TPBON, 0, -1); between jbg85_enc_init() and jbg85_enc_lineout(). The JBIG standard also has a provision for aborting a BIE with a special abort marker segment, and calling void jbg85_enc_abort(struct jbg85_enc_state *s); does that. This is probably only needed if there is no other way (e.g., end-of-file) of telling the decoder that no further data bytes will be coming. 3 Decompressing an image Like with the compression functions, if you want to use the jbig85.c library, you have to put the line #include "jbig85.h" into your source code and link your executable with libjbig85.a. The state of a JBIG decoder is stored completely in a struct and you will have to define a variable like struct jbg85_dec_state s; which is initialized by a call to void jbg85_dec_init(struct jbg85_dec_state *s, unsigned char *buf, size_t buflen, int (*line_out)(const struct jbg85_dec_state *s, unsigned char *start, size_t len, unsigned long y, void *file), void *file); The parameters are: buf A memory buffer that is long enough to store up to three lines of the image. This buffer will be used by the decoder to temporarily store decoded lines. If the decoded image uses the LRLTWO option, the buffer has to be only sufficient for two uncompressed image lines. buflen The length in bytes of the buffer area to which buf points. Knowing this value prevents accidental buffer overflows and allows the decoder to abort with JBG_ENOMEM if the provided buffer was too small, once it knows the width of the image to be decoded from parsing its 20-byte header. If xmax is the expected maximum width of the image in pixels, then buflen should be at least ((xmax >> 3) + !!(xmax & 7)) * 3 bytes. [If only BIEs with option LRLTWO set will be received, then ((xmax >> 3) + !!(xmax & 7)) * 2 bytes will be sufficient.] line_out This call-back function will be used whenever the decoder has completed another line. The start parameter will point to the location in buf where the len bytes of the just decoded line reside. The line_out() function has to read (and copy or output) this line, but it is not allowed to modify it in-place, as the decoder will also need to access it while decoding the following two lines. The parameter y is just the line number (starting from 0) and file is the jbg85_dec_init() parameter of the same name passed on. The normal return value of line_out is zero; a non-zero value can be returned to request an interrupt of the decoding process (see discussion of JBG_EOK_INTR below). file A pointer parameter that is passed on to line_out() and can be used, for instance, to allow line_out() to distinguish by which compression task it has been called in multi-threaded applications. After this, you can directly start to pass data from the BIE to the decoder by calling the function int jbg85_dec_in(struct jbg85_dec_state *s, unsigned char *data, size_t len, size_t *cnt); The pointer data points to the first byte of a data block with length len, which contains bytes from a BIE. It is not necessary to pass a whole BIE at once to jbg85_dec_in(), it can arrive fragmented in any way by calling jbg85_dec_in() several times. Only a single BIE can be delivered via jbg85_dec_in() calls and the decoder has to be reinitialized with jbg85_dec_init() before it is ready to accept another BIE. If pointer cnt is not NULL, then the number of bytes actually read from the data block will be stored there. In case the decoder did not recognize the end of the BIE in the data block, then the value JBG_EAGAIN will be returned and *cnt equals len. Once the end of a BIE has been reached, the return value of jbg85_dec_in() will be JBG_EOK. The decoder can recognize the end of a BIE only if either the VLENGTH option is not set, or if there has been a NEWLEN marker segment before the start of the last stripe. Otherwise, the decoder cannot know whether there is or is not a NEWLEN marker segment following the last stripe. For this reason, jbg85_dec_in() can return JBG_EAGAIN even though you have already given it the last byte of the BIE. In this case, call int jbg85_dec_end(struct jbg85_dec_state *s); to explicitely signal to the decoder that it has already received all bytes of the BIE. This function will then output any remaining lines and return JBG_EOK if no problem has occurred. The macros unsigned long jbg85_dec_getwidth(struct jbg85_dec_state *s); unsigned long jbg85_dec_getheight(struct jbg85_dec_state *s); can be used to query the dimensions of the image. The width will be known already after the first 20 bytes of the BIE have been provided, and also during the first callback to line_out(). But the height might not have reached its final value before jbg85_dec_in() has returned JBG_EOK. The additional boolean macros int jbg85_dec_validwidth(struct jbg85_dec_state *s); int jbg85_dec_finalheight(struct jbg85_dec_state *s); int jbg85_dec_finished(struct jbg85_dec_state *s); tell, whether the width and final height are already known, and whether the decoder has finished outputting all lines. If one of the callbacks to line_out() provides a non-zero return value, then the decoder will interrupt the decoding process and jbg85_dec_in() or jbg85_dec_end() will return JBG_EOK_INTR. This feature might be useful to stop the decoding process temporarily, e.g. to load a new sheet of paper, where performing this task is inconvenient to complete inside line_out(). It is then possible to continue calling jbg85_dec_in() with the remaining data (or jbg85_dec_end() if there isn't any left) in order to decode the remaining lines of the BIE. After jbg85_dec_in() returned JBG_EOK_INTR, *cnt is probably not equal to len and the remainder of the data block which has not yet been processed by the decoder has to be delivered to jbg85_dec_in() again. Any line that has already been delivered to line_out() will not be delivered again. If any other return value than JBG_EOK, JBG_EOK_INTR or JBG_EAGAIN has been returned by jbg85_dec_in() or jbg85_dec_end(), then an error has occurred and the decoding process has been aborted. The function const char *jbg85_strerror(int errnum); returns a pointer to a short single-line test message that explains the return value of jbg85_dec_in() or jbg85_dec_end(). This message can be used in order to provide the user a brief informative message about what when wrong while decompressing a JBIG image. The po/ subdirectory contains *.po files that translate the English ASCII strings returned by jbg85_strerror() into other languages (e.g., for use with GNU gettext). The four least-significant bits of the return value of jbg85_dec_in() or jbg85_dec_end() may contain additional detailed technical information about the exact test that spotted the error condition (see source code for details), i.e. more than the text message returned by jbg85_strerror() reveals. Therefore it may be useful to display the return value itself as a hexadecimal number, in addition to the string returned by jbg85_strerror(). 4 Additional notes The following remarks will not affect the normal user of the library but might be of interest to some users who have to deal with exotic cases, in particular dealing with broken non-JBIG-KIT encoders out there: - There has been one report about malformed BIEs produced by another JBIG implementation that violates the standard by containing several NEWLEN marker segments in the same BIE. The jbig85.c decoder will normally abort with JBG_EINVALID when it encounters such an illegal BIE. The compile-time option JBG85_TOLERATE_MULTIPLE_NEWLEN can be used to make the decoder more tolerant to this type of syntax error. - Even though the T.85 standard prescribes all-zero values for the order bits HITOLO, SEQ, ILEAVE, SMID, the jbig85.c decoder will not complain about any other values of these bits, as they do not affect the decoding process when there is only a single plane and resolution layer (the only case supported by this decoder). The compile-time option JBG85_STRICT_ORDER_BITS will make the decoder less tolerant and abort with JBG_EIMPL if the received order bits do not comply with the T.85 "single-progression sequential coding" requirements. - The T.85 standard allows only a single ATMOVE marker segment per SDE, and the jbig85.c decoder enforces this limit by default. This limit can be increased by setting JBG85_ATMOVES_MAX in jbig85.h to the desired value. The encoder will never output more than a single ATMOVE marker segment per stripe. *** Happy decompressing *** [end] jbigkit-2.1/libjbig/jbig_ar.c0000664000307500030750000003146712315071063014615 0ustar mgk25mgk25/* * Arithmetic encoder and decoder of the portable JBIG * compression library * * Markus Kuhn -- http://www.cl.cam.ac.uk/~mgk25/jbigkit/ * * This module implements a portable standard C arithmetic encoder * and decoder used by the JBIG lossless bi-level image compression * algorithm as specified in International Standard ISO 11544:1993 * and ITU-T Recommendation T.82. * * 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 2 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, write to the Free Software * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. * * If you want to use this program under different license conditions, * then contact the author for an arrangement. */ #include #include "jbig_ar.h" /* * Probability estimation tables for the arithmetic encoder/decoder * given by ITU T.82 Table 24. */ static short lsztab[113] = { 0x5a1d, 0x2586, 0x1114, 0x080b, 0x03d8, 0x01da, 0x00e5, 0x006f, 0x0036, 0x001a, 0x000d, 0x0006, 0x0003, 0x0001, 0x5a7f, 0x3f25, 0x2cf2, 0x207c, 0x17b9, 0x1182, 0x0cef, 0x09a1, 0x072f, 0x055c, 0x0406, 0x0303, 0x0240, 0x01b1, 0x0144, 0x00f5, 0x00b7, 0x008a, 0x0068, 0x004e, 0x003b, 0x002c, 0x5ae1, 0x484c, 0x3a0d, 0x2ef1, 0x261f, 0x1f33, 0x19a8, 0x1518, 0x1177, 0x0e74, 0x0bfb, 0x09f8, 0x0861, 0x0706, 0x05cd, 0x04de, 0x040f, 0x0363, 0x02d4, 0x025c, 0x01f8, 0x01a4, 0x0160, 0x0125, 0x00f6, 0x00cb, 0x00ab, 0x008f, 0x5b12, 0x4d04, 0x412c, 0x37d8, 0x2fe8, 0x293c, 0x2379, 0x1edf, 0x1aa9, 0x174e, 0x1424, 0x119c, 0x0f6b, 0x0d51, 0x0bb6, 0x0a40, 0x5832, 0x4d1c, 0x438e, 0x3bdd, 0x34ee, 0x2eae, 0x299a, 0x2516, 0x5570, 0x4ca9, 0x44d9, 0x3e22, 0x3824, 0x32b4, 0x2e17, 0x56a8, 0x4f46, 0x47e5, 0x41cf, 0x3c3d, 0x375e, 0x5231, 0x4c0f, 0x4639, 0x415e, 0x5627, 0x50e7, 0x4b85, 0x5597, 0x504f, 0x5a10, 0x5522, 0x59eb }; static unsigned char nmpstab[113] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 13, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 9, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 32, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 48, 81, 82, 83, 84, 85, 86, 87, 71, 89, 90, 91, 92, 93, 94, 86, 96, 97, 98, 99, 100, 93, 102, 103, 104, 99, 106, 107, 103, 109, 107, 111, 109, 111 }; /* * least significant 7 bits (mask 0x7f) of nlpstab[] contain NLPS value, * most significant bit (mask 0x80) contains SWTCH bit */ static unsigned char nlpstab[113] = { 129, 14, 16, 18, 20, 23, 25, 28, 30, 33, 35, 9, 10, 12, 143, 36, 38, 39, 40, 42, 43, 45, 46, 48, 49, 51, 52, 54, 56, 57, 59, 60, 62, 63, 32, 33, 165, 64, 65, 67, 68, 69, 70, 72, 73, 74, 75, 77, 78, 79, 48, 50, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 61, 61, 193, 80, 81, 82, 83, 84, 86, 87, 87, 72, 72, 74, 74, 75, 77, 77, 208, 88, 89, 90, 91, 92, 93, 86, 216, 95, 96, 97, 99, 99, 93, 223, 101, 102, 103, 104, 99, 105, 106, 107, 103, 233, 108, 109, 110, 111, 238, 112, 240 }; /* * The next functions implement the arithmedic encoder and decoder * required for JBIG. The same algorithm is also used in the arithmetic * variant of JPEG. */ /* marker codes */ #define MARKER_STUFF 0x00 #define MARKER_ESC 0xff void arith_encode_init(struct jbg_arenc_state *s, int reuse_st) { int i; if (!reuse_st) for (i = 0; i < 4096; s->st[i++] = 0) ; s->c = 0; s->a = 0x10000L; s->sc = 0; s->ct = 11; s->buffer = -1; /* empty */ return; } void arith_encode_flush(struct jbg_arenc_state *s) { unsigned long temp; /* find the s->c in the coding interval with the largest * number of trailing zero bits */ if ((temp = (s->a - 1 + s->c) & 0xffff0000L) < s->c) s->c = temp + 0x8000; else s->c = temp; /* send remaining bytes to output */ s->c <<= s->ct; if (s->c & 0xf8000000L) { /* one final overflow has to be handled */ if (s->buffer >= 0) { s->byte_out(s->buffer + 1, s->file); if (s->buffer + 1 == MARKER_ESC) s->byte_out(MARKER_STUFF, s->file); } /* output 0x00 bytes only when more non-0x00 will follow */ if (s->c & 0x7fff800L) for (; s->sc; --s->sc) s->byte_out(0x00, s->file); } else { if (s->buffer >= 0) s->byte_out(s->buffer, s->file); /* T.82 figure 30 says buffer+1 for the above line! Typo? */ for (; s->sc; --s->sc) { s->byte_out(0xff, s->file); s->byte_out(MARKER_STUFF, s->file); } } /* output final bytes only if they are not 0x00 */ if (s->c & 0x7fff800L) { s->byte_out((s->c >> 19) & 0xff, s->file); if (((s->c >> 19) & 0xff) == MARKER_ESC) s->byte_out(MARKER_STUFF, s->file); if (s->c & 0x7f800L) { s->byte_out((s->c >> 11) & 0xff, s->file); if (((s->c >> 11) & 0xff) == MARKER_ESC) s->byte_out(MARKER_STUFF, s->file); } } return; } void arith_encode(struct jbg_arenc_state *s, int cx, int pix) { register unsigned lsz, ss; register unsigned char *st; long temp; assert(cx >= 0 && cx < 4096); st = s->st + cx; ss = *st & 0x7f; assert(ss < 113); lsz = lsztab[ss]; #if 0 fprintf(stderr, "pix = %d, cx = %d, mps = %d, st = %3d, lsz = 0x%04x, " "a = 0x%05lx, c = 0x%08lx, ct = %2d, buf = 0x%02x\n", pix, cx, !!(s->st[cx] & 0x80), ss, lsz, s->a, s->c, s->ct, s->buffer); #endif if (((pix << 7) ^ s->st[cx]) & 0x80) { /* encode the less probable symbol */ if ((s->a -= lsz) >= lsz) { /* If the interval size (lsz) for the less probable symbol (LPS) * is larger than the interval size for the MPS, then exchange * the two symbols for coding efficiency, otherwise code the LPS * as usual: */ s->c += s->a; s->a = lsz; } /* Check whether MPS/LPS exchange is necessary * and chose next probability estimator status */ *st &= 0x80; *st ^= nlpstab[ss]; } else { /* encode the more probable symbol */ if ((s->a -= lsz) & 0xffff8000L) return; /* A >= 0x8000 -> ready, no renormalization required */ if (s->a < lsz) { /* If the interval size (lsz) for the less probable symbol (LPS) * is larger than the interval size for the MPS, then exchange * the two symbols for coding efficiency: */ s->c += s->a; s->a = lsz; } /* chose next probability estimator status */ *st &= 0x80; *st |= nmpstab[ss]; } /* renormalization of coding interval */ do { s->a <<= 1; s->c <<= 1; --s->ct; if (s->ct == 0) { /* another byte is ready for output */ temp = s->c >> 19; if (temp & 0xffffff00L) { /* handle overflow over all buffered 0xff bytes */ if (s->buffer >= 0) { ++s->buffer; s->byte_out(s->buffer, s->file); if (s->buffer == MARKER_ESC) s->byte_out(MARKER_STUFF, s->file); } for (; s->sc; --s->sc) s->byte_out(0x00, s->file); s->buffer = temp & 0xff; /* new output byte, might overflow later */ assert(s->buffer != 0xff); /* can s->buffer really never become 0xff here? */ } else if (temp == 0xff) { /* buffer 0xff byte (which might overflow later) */ ++s->sc; } else { /* output all buffered 0xff bytes, they will not overflow any more */ if (s->buffer >= 0) s->byte_out(s->buffer, s->file); for (; s->sc; --s->sc) { s->byte_out(0xff, s->file); s->byte_out(MARKER_STUFF, s->file); } s->buffer = temp; /* buffer new output byte (can still overflow) */ } s->c &= 0x7ffffL; s->ct = 8; } } while (s->a < 0x8000); return; } void arith_decode_init(struct jbg_ardec_state *s, int reuse_st) { int i; if (!reuse_st) for (i = 0; i < 4096; s->st[i++] = 0) ; s->c = 0; s->a = 1; s->ct = 0; s->startup = 1; s->nopadding = 0; return; } /* * Decode and return one symbol from the provided PSCD byte stream * that starts in s->pscd_ptr and ends in the byte before s->pscd_end. * The context cx is a 12-bit integer in the range 0..4095. This * function will advance s->pscd_ptr each time it has consumed all * information from that PSCD byte. * * If a symbol has been decoded successfully, the return value will be * 0 or 1 (depending on the symbol). * * If the decoder was not able to decode a symbol from the provided * PSCD, then the return value will be -1, and two cases can be * distinguished: * * s->pscd_ptr == s->pscd_end: * * The decoder has used up all information in the provided PSCD * bytes. Further PSCD bytes have to be provided (via new values of * s->pscd_ptr and/or s->pscd_end) before another symbol can be * decoded. * * s->pscd_ptr == s->pscd_end - 1: * * The decoder has used up all provided PSCD bytes except for the * very last byte, because that has the value 0xff. The decoder can * at this point not yet tell whether this 0xff belongs to a * MARKER_STUFF sequence or marks the end of the PSCD. Further PSCD * bytes have to be provided (via new values of s->pscd_ptr and/or * s->pscd_end), including the not yet processed 0xff byte, before * another symbol can be decoded successfully. * * If s->nopadding != 0, the decoder will return -2 when it reaches * the first two bytes of the marker segment that follows (and * terminates) the PSCD, but before decoding the first symbol that * depends on a bit in the input data that could have been the result * of zero padding, and might, therefore, never have been encoded. * This gives the caller the opportunity to lookahead early enough * beyond a terminating SDNORM/SDRST for a trailing NEWLEN (as * required by T.85) before decoding remaining symbols. Call the * decoder again afterwards as often as necessary (leaving s->pscd_ptr * pointing to the start of the marker segment) to retrieve any * required remaining symbols that might depend on padding. * * [Note that each PSCD can be decoded into an infinitely long * sequence of symbols, because the encoder might have truncated away * an arbitrarily long sequence of trailing 0x00 bytes, which the * decoder will append automatically as needed when it reaches the end * of the PSCD. Therefore, the decoder cannot report any end of the * symbol sequence and other means (external to the PSCD and * arithmetic decoding process) are needed to determine that.] */ int arith_decode(struct jbg_ardec_state *s, int cx) { register unsigned lsz, ss; register unsigned char *st; int pix; /* renormalization */ while (s->a < 0x8000 || s->startup) { while (s->ct <= 8 && s->ct >= 0) { /* first we can move a new byte into s->c */ if (s->pscd_ptr >= s->pscd_end) { return -1; /* more bytes needed */ } if (*s->pscd_ptr == 0xff) if (s->pscd_ptr + 1 >= s->pscd_end) { return -1; /* final 0xff byte not processed */ } else { if (*(s->pscd_ptr + 1) == MARKER_STUFF) { s->c |= 0xffL << (8 - s->ct); s->ct += 8; s->pscd_ptr += 2; } else { s->ct = -1; /* start padding with zero bytes */ if (s->nopadding) { s->nopadding = 0; return -2; /* subsequent symbols might depend on zero padding */ } } } else { s->c |= (long)*(s->pscd_ptr++) << (8 - s->ct); s->ct += 8; } } s->c <<= 1; s->a <<= 1; if (s->ct >= 0) s->ct--; if (s->a == 0x10000L) s->startup = 0; } st = s->st + cx; ss = *st & 0x7f; assert(ss < 113); lsz = lsztab[ss]; #if 0 fprintf(stderr, "cx = %d, mps = %d, st = %3d, lsz = 0x%04x, a = 0x%05lx, " "c = 0x%08lx, ct = %2d\n", cx, !!(s->st[cx] & 0x80), ss, lsz, s->a, s->c, s->ct); #endif if ((s->c >> 16) < (s->a -= lsz)) if (s->a & 0xffff8000L) return *st >> 7; else { /* MPS_EXCHANGE */ if (s->a < lsz) { pix = 1 - (*st >> 7); /* Check whether MPS/LPS exchange is necessary * and chose next probability estimator status */ *st &= 0x80; *st ^= nlpstab[ss]; } else { pix = *st >> 7; *st &= 0x80; *st |= nmpstab[ss]; } } else { /* LPS_EXCHANGE */ if (s->a < lsz) { s->c -= s->a << 16; s->a = lsz; pix = *st >> 7; *st &= 0x80; *st |= nmpstab[ss]; } else { s->c -= s->a << 16; s->a = lsz; pix = 1 - (*st >> 7); /* Check whether MPS/LPS exchange is necessary * and chose next probability estimator status */ *st &= 0x80; *st ^= nlpstab[ss]; } } return pix; } jbigkit-2.1/libjbig/jbig_ar.h0000664000307500030750000000432312315071063014611 0ustar mgk25mgk25/* * Header file for the arithmetic encoder and decoder of * the portable JBIG compression library * * Markus Kuhn -- http://www.cl.cam.ac.uk/~mgk25/jbigkit/ */ #ifndef JBG_AR_H #define JBG_AR_H /* * Status of arithmetic encoder */ struct jbg_arenc_state { unsigned char st[4096]; /* probability status for contexts, MSB = MPS */ unsigned long c; /* register C: base of coding intervall, * * layout as in Table 23 */ unsigned long a; /* register A: normalized size of coding interval */ long sc; /* number of buffered 0xff values that might still overflow */ int ct; /* bit shift counter, determines when next byte will be written */ int buffer; /* buffer for most recent output byte != 0xff */ void (*byte_out)(int, void *); /* function that receives all PSCD bytes */ void *file; /* parameter passed to byte_out */ }; /* * Status of arithmetic decoder */ struct jbg_ardec_state { unsigned char st[4096]; /* probability status for contexts, MSB = MPS */ unsigned long c; /* register C: base of coding intervall, * * layout as in Table 25 */ unsigned long a; /* register A: normalized size of coding interval */ unsigned char *pscd_ptr; /* pointer to next PSCD data byte */ unsigned char *pscd_end; /* pointer to byte after PSCD */ int ct; /* bit-shift counter, determines when next byte will be read; * special value -1 signals that zero-padding has started */ int startup; /* boolean flag that controls initial fill of s->c */ int nopadding; /* boolean flag that triggers return -2 between * reaching PSCD end and decoding the first symbol * that might never have been encoded in the first * place */ }; void arith_encode_init(struct jbg_arenc_state *s, int reuse_st); void arith_encode_flush(struct jbg_arenc_state *s); void arith_encode(struct jbg_arenc_state *s, int cx, int pix); void arith_decode_init(struct jbg_ardec_state *s, int reuse_st); int arith_decode(struct jbg_ardec_state *s, int cx); #endif /* JBG_AR_H */ jbigkit-2.1/libjbig/po/0000775000307500030750000000000012315071063013457 5ustar mgk25mgk25jbigkit-2.1/libjbig/po/README.txt0000664000307500030750000000164112315071063015157 0ustar mgk25mgk25Older versions of jbig.c contained a list of human-readable result/error messages in both English and German. These messages are highly technical and unlikely to be of much use to end users who are not familiar with the JBIG1 standard (which has only been published in English, Spanish and French). Therefore, in the interest of simplicity, since release 2.0 the source code contains in errmsg[] now only the English version of these messages. The German version is preserved here in the form of a PO translation file, as used by the GNU gettext package, just in case anyone still finds it of use. See http://www.gnu.org/software/gettext/manual/gettext.html for information on the PO file format and tools for creating and using them. JBIG-KIT itself does not use gettext, but the included po files might help users of the library to translate the strings returned by jbg_strerror() or jbg85_strerror() into other languages. jbigkit-2.1/libjbig/po/de.po0000664000307500030750000000320712315071063014411 0ustar mgk25mgk25# German translations for jbigkit package # Copyright (C) 2008 Markus Kuhn # This file is distributed under the same license as the jbigkit package. # msgid "" msgstr "" "Project-Id-Version: jbigkit 2.0\n" "Report-Msgid-Bugs-To: http://www.cl.cam.ac.uk/~mgk25/jbigkit/\n" "POT-Creation-Date: 2014-03-24 15:35+0000\n" "PO-Revision-Date: 2008-08-27 20:16+0100\n" "Last-Translator: Markus Kuhn \n" "Language: de\n" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=UTF-8\n" "Content-Transfer-Encoding: 8bit\n" "Plural-Forms: nplurals=2; plural=(n != 1);\n" #: jbig.c:98 jbig85.c:69 msgid "All OK" msgstr "Kein Problem" #: jbig.c:99 jbig85.c:70 msgid "Reached specified image size" msgstr "Angeforderte Bildgröße erreicht" #: jbig.c:100 jbig85.c:71 msgid "Unexpected end of input data stream" msgstr "Unerwartetes Ende des Eingabedatenstroms" #: jbig.c:101 jbig85.c:72 msgid "Not enough memory available" msgstr "Nicht genügend Speicher vorhanden" #: jbig.c:102 jbig85.c:73 msgid "ABORT marker segment encountered" msgstr "Es wurde eine Abbruch-Sequenz gefunden" #: jbig.c:103 jbig85.c:74 msgid "Unknown marker segment encountered" msgstr "Es wurde eine unbekannte Marker-Sequenz gefunden" #: jbig.c:104 jbig85.c:75 msgid "Input data stream contains invalid data" msgstr "Es wurden ungültige Daten gefunden" #: jbig.c:105 jbig85.c:76 msgid "Input data stream uses unimplemented JBIG features" msgstr "Eingabedatenstrom benutzt nicht implementierte JBIG Optionen" #: jbig.c:106 msgid "Incremental BIE does not continue previous one" msgstr "Neue Bilddaten passen nicht zu vorangegangenen" jbigkit-2.1/libjbig/po/ru.po0000664000307500030750000000356612315071063014457 0ustar mgk25mgk25# Russian translations for jbigkit package. # This file is distributed under the same license as the jbigkit package. # Russian translation by ghostmansd@gmil.com, # with some changes by Sergei Skorobogatov. # msgid "" msgstr "" "Project-Id-Version: jbigkit 2.1\n" "Report-Msgid-Bugs-To: http://www.cl.cam.ac.uk/~mgk25/jbigkit/\n" "POT-Creation-Date: 2014-03-24 15:35+0000\n" "PO-Revision-Date: 2014-03-21 18:06+0000\n" "Language: ru\n" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=UTF-8\n" "Content-Transfer-Encoding: 8bit\n" "Plural-Forms: nplurals=3; plural=(n%10==1 && n%100!=11 ? 0 : n%10>=2 && n" "%10<=4 && (n%100<10 || n%100>=20) ? 1 : 2);\n" #: jbig.c:98 jbig85.c:69 msgid "All OK" msgstr "Успешное завершение" #: jbig.c:99 jbig85.c:70 msgid "Reached specified image size" msgstr "Указанный размер достигнут" #: jbig.c:100 jbig85.c:71 msgid "Unexpected end of input data stream" msgstr "Неожиданный конец входного потока" #: jbig.c:101 jbig85.c:72 msgid "Not enough memory available" msgstr "Недостаточно памяти" #: jbig.c:102 jbig85.c:73 msgid "ABORT marker segment encountered" msgstr "Обнаружен сегмент прерывания" #: jbig.c:103 jbig85.c:74 msgid "Unknown marker segment encountered" msgstr "Обнаружен неизвестный сегмент" #: jbig.c:104 jbig85.c:75 msgid "Input data stream contains invalid data" msgstr "Входной поток содержит неверные данные" #: jbig.c:105 jbig85.c:76 msgid "Input data stream uses unimplemented JBIG features" msgstr "Входной поток использует нереализованные функции" #: jbig.c:106 msgid "Incremental BIE does not continue previous one" msgstr "Следующий тип данных BIE не продолжает предыдущий" jbigkit-2.1/libjbig/tstcodec.c0000664000307500030750000004067112315071063015025 0ustar mgk25mgk25/* * A sequence of test procedures for this JBIG implementation * * Run this test sequence after each modification on the JBIG library. * * Markus Kuhn -- http://www.cl.cam.ac.uk/~mgk25/ */ #include #include #include #include #include "jbig.h" #define TESTBUF_SIZE 400000L #define TESTPIC_SIZE 477995L #define FAILED "F\bFA\bAI\bIL\bLE\bED\bD" #define PASSED "PASSED" unsigned char *testbuf; unsigned char *testpic; long testbuf_len; static void *checkedmalloc(size_t n) { void *p; if ((p = malloc(n)) == NULL) { fprintf(stderr, "Sorry, not enough memory available!\n"); exit(1); } return p; } static void testbuf_write(int v, void *dummy) { if (testbuf_len < TESTBUF_SIZE) testbuf[testbuf_len++] = v; (void) dummy; return; } static void testbuf_writel(unsigned char *start, size_t len, void *dummy) { if (testbuf_len < TESTBUF_SIZE) { if (testbuf_len + len < TESTBUF_SIZE) memcpy(testbuf + testbuf_len, start, len); else memcpy(testbuf + testbuf_len, start, TESTBUF_SIZE - testbuf_len); } testbuf_len += len; #ifdef DEBUG { unsigned char *p; unsigned sum = 0; for (p = start; p - start < (ptrdiff_t) len; sum = (sum ^ *p++) << 1); printf(" testbuf_writel: %4lu bytes, checksum %04x\n", (unsigned long) len, sum & 0xffff); } #endif (void) dummy; return; } /* * Store the artificial test image defined in T.82, clause 7.2.1 at * pic. The image requires 477995 bytes of memory, is 1960 x 1951 pixels * large and has one plane. */ static void testimage(unsigned char *pic) { unsigned long i, j, sum; unsigned int prsg, repeat[8]; unsigned char *p; memset(pic, 0, TESTPIC_SIZE); p = pic; prsg = 1; for (j = 0; j < 1951; j++) for (i = 0; i < 1960; i++) { if (j >= 192) { if (j < 1023 || ((i >> 3) & 3) == 0) { sum = (prsg & 1) + ((prsg >> 2) & 1) + ((prsg >> 11) & 1) + ((prsg >> 15) & 1); prsg = (prsg << 1) + (sum & 1); if ((prsg & 3) == 0) { *p |= 1 << (7 - (i & 7)); repeat[i & 7] = 1; } else { repeat[i & 7] = 0; } } else { if (repeat[i & 7]) *p |= 1 << (7 - (i & 7)); } } if ((i & 7) == 7) ++p; } /* verify test image */ sum = 0; for (i = 0; i < TESTPIC_SIZE; i++) for (j = 0; j < 8; j++) sum += (pic[i] >> j) & 1; if (sum != 861965L) printf("WARNING: Artificial test image has %lu (not 861965) " "foreground pixels!\n", sum); return; } /* * Perform a full test cycle with one set of parameters. Encode an image * and compare the length of the result with correct_length. Then decode * the image again both in one single chunk or byte by byte and compare * the results with the original input image. */ static int test_cycle(unsigned char **orig_image, int width, int height, int options, int order, int layers, int planes, unsigned long l0, int mx, long correct_length, const char *test_id) { struct jbg_enc_state sje; struct jbg_dec_state sjd; int trouble = 0; long l; size_t plane_size; int i, result; unsigned char **image; plane_size = ((width + 7) / 8) * height; image = (unsigned char **) checkedmalloc(planes * sizeof(unsigned char *)); for (i = 0; i < planes; i++) { image[i] = (unsigned char *) checkedmalloc(plane_size); memcpy(image[i], orig_image[i], plane_size); } printf("\nTest %s.1: Encoding ...\n", test_id); testbuf_len = 0; jbg_enc_init(&sje, width, height, planes, image, testbuf_writel, NULL); jbg_enc_layers(&sje, layers); jbg_enc_options(&sje, order, options, l0, mx, 0); jbg_enc_out(&sje); jbg_enc_free(&sje); for (i = 0; i < planes; i++) free(image[i]); free(image); printf("Encoded BIE has %6ld bytes: ", testbuf_len); if (correct_length >= 0) if (testbuf_len == correct_length) puts(PASSED); else { trouble++; printf(FAILED ", correct would have been %ld\n", correct_length); } else puts(""); printf("Test %s.2: Decoding whole chunk ...\n", test_id); jbg_dec_init(&sjd); result = jbg_dec_in(&sjd, testbuf, testbuf_len, NULL); if (result != JBG_EOK) { printf("Decoder complained with return value %d: " FAILED "\n" "Cause: '%s'\n", result, jbg_strerror(result)); trouble++; } else { printf("Image comparison: "); result = 1; for (i = 0; i < planes; i++) { if (memcmp(orig_image[i], sjd.lhp[layers & 1][i], ((width + 7) / 8) * height)) { result = 0; trouble++; printf(FAILED " for plane %d\n", i); } } if (result) puts(PASSED); } jbg_dec_free(&sjd); printf("Test %s.3: Decoding with single-byte feed ...\n", test_id); jbg_dec_init(&sjd); result = JBG_EAGAIN; for (l = 0; l < testbuf_len; l++) { result = jbg_dec_in(&sjd, testbuf + l, 1, NULL); if (l < testbuf_len - 1 && result != JBG_EAGAIN) { printf("Decoder complained with return value %d at byte %ld: " FAILED "\nCause: '%s'\n", result, l, jbg_strerror(result)); trouble++; break; } } if (l == testbuf_len) { if (result != JBG_EOK) { printf("Decoder complained with return value %d at final byte: " FAILED "\nCause: '%s'\n", result, jbg_strerror(result)); trouble++; } else { printf("Image comparison: "); result = 1; for (i = 0; i < planes; i++) { if (memcmp(orig_image[i], sjd.lhp[layers & 1][i], ((width + 7) / 8) * height)) { result = 0; trouble++; printf(FAILED " for plane %d\n", i); } } if (result) puts(PASSED); } } jbg_dec_free(&sjd); puts(""); return trouble != 0; } int main(int argc, char **argv) { int trouble, problems = 0; struct jbg_arenc_state *se; struct jbg_ardec_state *sd; long i; int pix, order, layers; char test[10]; size_t st; unsigned char *pp; unsigned char *ppp[4]; int t82pix[16] = { 0x05e0, 0x0000, 0x8b00, 0x01c4, 0x1700, 0x0034, 0x7fff, 0x1a3f, 0x951b, 0x05d8, 0x1d17, 0xe770, 0x0000, 0x0000, 0x0656, 0x0e6a }; int t82cx[16] = { 0x0fe0, 0x0000, 0x0f00, 0x00f0, 0xff00, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000 }; unsigned char t82sde[32] = { 0x69, 0x89, 0x99, 0x5c, 0x32, 0xea, 0xfa, 0xa0, 0xd5, 0xff, 0x00, 0x52, 0x7f, 0xff, 0x00, 0xff, 0x00, 0xff, 0x00, 0xc0, 0x00, 0x00, 0x00, 0x3f, 0xff, 0x00, 0x2d, 0x20, 0x82, 0x91, 0xff, 0x02 }; /* three 23x5 pixel test images with the letters JBIG */ unsigned char jbig_normal[15*4] = { 0x7c, 0xe2, 0x38, 0x04, 0x92, 0x40, 0x04, 0xe2, 0x5c, 0x44, 0x92, 0x44, 0x38, 0xe2, 0x38, 0x7c, 0xe2, 0x38, 0x04, 0x92, 0x40, 0x04, 0xe2, 0x5c, 0x44, 0x92, 0x44, 0x38, 0xe2, 0x38, 0x7c, 0xe2, 0x38, 0x04, 0x92, 0x40, 0x04, 0xe2, 0x5c, 0x44, 0x92, 0x44, 0x38, 0xe2, 0x38, 0x7c, 0xe2, 0x38, 0x04, 0x92, 0x40, 0x04, 0xe2, 0x5c, 0x44, 0x92, 0x44, 0x38, 0xe2, 0x38 }; unsigned char jbig_upsidedown[15*4] = { 0x38, 0xe2, 0x38, 0x44, 0x92, 0x44, 0x04, 0xe2, 0x5c, 0x04, 0x92, 0x40, 0x7c, 0xe2, 0x38, 0x38, 0xe2, 0x38, 0x44, 0x92, 0x44, 0x04, 0xe2, 0x5c, 0x04, 0x92, 0x40, 0x7c, 0xe2, 0x38, 0x38, 0xe2, 0x38, 0x44, 0x92, 0x44, 0x04, 0xe2, 0x5c, 0x04, 0x92, 0x40, 0x7c, 0xe2, 0x38, 0x38, 0xe2, 0x38, 0x44, 0x92, 0x44, 0x04, 0xe2, 0x5c, 0x04, 0x92, 0x40, 0x7c, 0xe2, 0x38 }; unsigned char jbig_inverse[15*4] = { 0xff^0x7c, 0xff^0xe2, 0xfe^0x38, 0xff^0x04, 0xff^0x92, 0xfe^0x40, 0xff^0x04, 0xff^0xe2, 0xfe^0x5c, 0xff^0x44, 0xff^0x92, 0xfe^0x44, 0xff^0x38, 0xff^0xe2, 0xfe^0x38, 0xff^0x7c, 0xff^0xe2, 0xfe^0x38, 0xff^0x04, 0xff^0x92, 0xfe^0x40, 0xff^0x04, 0xff^0xe2, 0xfe^0x5c, 0xff^0x44, 0xff^0x92, 0xfe^0x44, 0xff^0x38, 0xff^0xe2, 0xfe^0x38, 0xff^0x7c, 0xff^0xe2, 0xfe^0x38, 0xff^0x04, 0xff^0x92, 0xfe^0x40, 0xff^0x04, 0xff^0xe2, 0xfe^0x5c, 0xff^0x44, 0xff^0x92, 0xfe^0x44, 0xff^0x38, 0xff^0xe2, 0xfe^0x38, 0xff^0x7c, 0xff^0xe2, 0xfe^0x38, 0xff^0x04, 0xff^0x92, 0xfe^0x40, 0xff^0x04, 0xff^0xe2, 0xfe^0x5c, 0xff^0x44, 0xff^0x92, 0xfe^0x44, 0xff^0x38, 0xff^0xe2, 0xfe^0x38 }; int orders[] = { 0, JBG_ILEAVE, JBG_ILEAVE | JBG_SMID, #if 0 JBG_SEQ, JBG_SEQ | JBG_SMID, JBG_SEQ | JBG_ILEAVE, JBG_HITOLO, JBG_HITOLO | JBG_ILEAVE, JBG_HITOLO | JBG_ILEAVE | JBG_SMID, JBG_HITOLO | JBG_SEQ, JBG_HITOLO | JBG_SEQ | JBG_SMID, JBG_HITOLO | JBG_SEQ | JBG_ILEAVE #endif }; printf("\nAutomatic JBIG Compatibility Test Suite\n" "---------------------------------------\n\n" "JBIG-KIT Version " JBG_VERSION " -- This test may take a few minutes.\n\n\n"); /* allocate test buffer memory */ testbuf = (unsigned char *) checkedmalloc(TESTBUF_SIZE); testpic = (unsigned char *) checkedmalloc(TESTPIC_SIZE); se = (struct jbg_arenc_state *) checkedmalloc(sizeof(struct jbg_arenc_state)); sd = (struct jbg_ardec_state *) checkedmalloc(sizeof(struct jbg_ardec_state)); /* test a few properties of the machine architecture */ testbuf[0] = 42; testbuf[0x10000L] = 0x42; st = 1 << 16; testbuf[st]++; pp = testbuf + 0x4000; pp += 0x4000; pp += 0x4000; pp += 0x4000; if (testbuf[0] != 42 || *pp != 0x43) { printf("Porting error detected:\n\n" "Pointer arithmetic with this compiler has not at least 32 bits!\n" "Are you sure, you have not compiled this program on an 8-bit\n" "or 16-bit architecture? This compiler mode can obviously not\n" "handle arrays with a size of more than 65536 bytes. With this\n" "memory model, JBIG-KIT can only handle very small images and\n" "not even this compatibility test suite will run. :-(\n\n"); exit(1); } /* only supported command line option: * output file name for exporting test image */ if (argc > 1) { FILE *f; puts("Generating test image ..."); testimage(testpic); printf("Storing in '%s' ...\n", argv[1]); /* write out test image as PBM file */ f = fopen(argv[1], "wb"); if (!f) abort(); fprintf(f, "P4\n"); #if 0 fprintf(f, "# Test image as defined in ITU-T T.82, clause 7.2.1\n"); #endif fprintf(f, "%10lu\n%10lu\n", 1960LU, 1951LU); fwrite(testpic, 1, TESTPIC_SIZE, f); fclose(f); exit(0); } #if 1 puts("1) Arithmetic encoder test sequence from ITU-T T.82, clause 7.1\n" "---------------------------------------------------------------\n"); arith_encode_init(se, 0); testbuf_len = 0; se->byte_out = testbuf_write; for (i = 0; i < 16 * 16; i++) arith_encode(se, (t82cx[i >> 4] >> ((15 - i) & 15)) & 1, (t82pix[i >> 4] >> ((15 - i) & 15)) & 1); arith_encode_flush(se); printf("result of encoder:\n "); for (i = 0; i < testbuf_len && i < TESTBUF_SIZE; i++) printf("%02x", testbuf[i]); printf("\nexpected result:\n "); for (i = 0; i < 30; i++) printf("%02x", t82sde[i]); printf("\n\nTest 1: "); if (testbuf_len != 30 || memcmp(testbuf, t82sde, 30)) { problems++; printf(FAILED); } else printf(PASSED); printf("\n\n"); puts("2) Arithmetic decoder test sequence from ITU-T T.82, clause 7.1\n" "---------------------------------------------------------------\n"); printf("Test 2.1: Decoding whole chunk ...\n"); arith_decode_init(sd, 0); sd->pscd_ptr = t82sde; sd->pscd_end = t82sde + 32; trouble = 0; for (i = 0; i < 16 * 16 && !trouble; i++) { pix = arith_decode(sd, (t82cx[i >> 4] >> ((15 - i) & 15)) & 1); if (pix < 0) { printf("Problem at pixel %ld, byte %ld.\n\n", i+1, (long) (sd->pscd_ptr - sd->pscd_end)); trouble++; break; } if (pix != ((t82pix[i >> 4] >> ((15 - i) & 15)) & 1)) { printf("Wrong PIX answer (%d) at pixel %ld.\n\n", pix, i+1); trouble++; break; } } if (!trouble && sd->pscd_ptr != sd->pscd_end - 2) { printf("%ld bytes left after decoder finished.\n\n", (long) (sd->pscd_end - sd->pscd_ptr - 2)); trouble++; } printf("Test result: "); if (trouble) { problems++; puts(FAILED); } else puts(PASSED); printf("\n"); printf("Test 2.2: Decoding with single byte feed ...\n"); arith_decode_init(sd, 0); pp = t82sde; sd->pscd_ptr = pp; sd->pscd_end = pp + 1; trouble = 0; for (i = 0; i < 16 * 16 && !trouble; i++) { pix = arith_decode(sd, (t82cx[i >> 4] >> ((15 - i) & 15)) & 1); while (pix < 0 && sd->pscd_end < t82sde + 32) { pp++; if (sd->pscd_ptr != pp - 1) sd->pscd_ptr = pp; sd->pscd_end = pp + 1; pix = arith_decode(sd, (t82cx[i >> 4] >> ((15 - i) & 15)) & 1); } if (pix < 0) { printf("Problem at pixel %ld, byte %ld.\n\n", i+1, (long) (sd->pscd_ptr - sd->pscd_end)); trouble++; break; } if (pix != ((t82pix[i >> 4] >> ((15 - i) & 15)) & 1)) { printf("Wrong PIX answer (%d) at pixel %ld.\n\n", pix, i+1); trouble++; break; } } if (!trouble && sd->pscd_ptr != sd->pscd_end - 2) { printf("%ld bytes left after decoder finished.\n\n", (long) (sd->pscd_end - sd->pscd_ptr - 2)); trouble++; } printf("Test result: "); if (trouble) { problems++; puts(FAILED); } else puts(PASSED); printf("\n"); puts("3) Parametric algorithm test sequence from ITU-T T.82, clause 7.2\n" "-----------------------------------------------------------------\n"); puts("Generating test image ..."); testimage(testpic); putchar('\n'); pp = testpic; puts("Test 3.1: TPBON=0, Mx=0, LRLTWO=0, L0=1951, 0 layers"); problems += test_cycle(&pp, 1960, 1951, JBG_DELAY_AT, 0, 0, 1, 1951, 0, 317384L, "3.1"); puts("Test 3.2: TPBON=0, Mx=0, LRLTWO=1, L0=1951, 0 layers"); problems += test_cycle(&pp, 1960, 1951, JBG_DELAY_AT | JBG_LRLTWO, 0, 0, 1, 1951, 0, 317132L, "3.2"); puts("Test 3.3: TPBON=1, Mx=8, LRLTWO=0, L0=128, 0 layers"); problems += test_cycle(&pp, 1960, 1951, JBG_DELAY_AT | JBG_TPBON, 0, 0, 1, 128, 8, 253653L, "3.3"); puts("Test 3.4: TPBON=1, DPON=1, TPDON=1, Mx=8, LRLTWO=0, L0=2, 6 layers"); problems += test_cycle(&pp, 1960, 1951, JBG_DELAY_AT | JBG_TPBON | JBG_TPDON | JBG_DPON, 0, 6, 1, 2, 8, 279314L, "3.4"); puts("Test 3.5: as Test 3.4 but with DPPRIV=1"); problems += test_cycle(&pp, 1960, 1951, JBG_DELAY_AT | JBG_TPBON | JBG_TPDON | JBG_DPON | JBG_DPPRIV, 0, 6, 1, 2, 8, 279314L + 1728, "3.5"); #if 0 /* Note: option SEQ is currently not supported by the decoder */ puts("Test 3.6: as Test 3.4 but with order bit SEQ set"); problems += test_cycle(&pp, 1960, 1951, JBG_DELAY_AT | JBG_TPBON | JBG_TPDON | JBG_DPON, JBG_SEQ, 6, 1, 2, 8, 279314L, "3.6"); #endif #endif puts("4) Same T.82 tests with SDRST instead of SDNORM\n" "-----------------------------------------------\n"); puts("Test 4.0: TPBON=1, Mx=8, LRLTWO=0, L0=128, 0 layers"); problems += test_cycle(&pp, 1960, 1951, JBG_SDRST | JBG_TPBON, 0, 0, 1, 128, 8, -1, "4.0"); puts("Test 4.1: TPBON=0, Mx=0, LRLTWO=0, L0=1951, 0 layers"); problems += test_cycle(&pp, 1960, 1951, JBG_SDRST, 0, 0, 1, 1951, 0, -1, "4.1"); puts("Test 4.2: TPBON=0, Mx=0, LRLTWO=1, L0=1951, 0 layers"); problems += test_cycle(&pp, 1960, 1951, JBG_LRLTWO | JBG_SDRST, 0, 0, 1, 1951, 0, -1, "4.2"); puts("Test 4.3: TPBON=1, Mx=8, LRLTWO=0, L0=128, 0 layers"); problems += test_cycle(&pp, 1960, 1951, JBG_TPBON | JBG_SDRST, 0, 0, 1, 128, 8, -1, "4.3"); puts("Test 4.4: TPBON=1, DPON=1, TPDON=1, Mx=8, LRLTWO=0, L0=2, 6 layers"); problems += test_cycle(&pp, 1960, 1951, JBG_TPBON | JBG_TPDON | JBG_DPON | JBG_SDRST, 0, 6, 1, 2, 8, -1, "4.4"); puts("5) Small test image, 0-3 layers, 4 planes, different orders\n" "-----------------------------------------------------------\n"); /* test a simple multi-plane image */ ppp[0] = jbig_normal; ppp[1] = jbig_upsidedown; ppp[2] = jbig_inverse; ppp[3] = jbig_inverse; i = 0; for (layers = 0; layers <= 3; layers++) for (order = 0; order < (int) (sizeof(orders)/sizeof(int)); order++) { sprintf(test, "5.%ld", ++i); printf("Test %s: order=%d, %d layers, 4 planes", test, orders[order], layers); problems += test_cycle(ppp, 23, 5*4, JBG_TPBON | JBG_TPDON | JBG_DPON, orders[order], layers, 4, 2, 8, -1, test); } printf("\nTest result summary: the library has %s the test suite.\n\n", problems ? FAILED : PASSED); if (problems) puts("This is bad. If you cannot identify the problem yourself, please " "send\nthis output plus a detailed description of your " "compile environment\n(OS, compiler, version, options, etc.) to " "Markus Kuhn\n."); else puts("Congratulations, everything is fine.\n"); return problems != 0; } jbigkit-2.1/libjbig/tstcodec85.c0000664000307500030750000003104412315071063015174 0ustar mgk25mgk25/* * A sequence of test procedures for this JBIG implementation * * Run this test sequence after each modification on the JBIG library. * * Markus Kuhn -- http://www.cl.cam.ac.uk/~mgk25/ */ #include #include #include #include #include #include "jbig85.h" #define TESTBUF_SIZE 400000L #define TESTPIC_SIZE 477995L #define FAILED "F\bFA\bAI\bIL\bLE\bED\bD" #define PASSED "PASSED" unsigned char *testbuf; unsigned char *testpic; long testbuf_len; static void *checkedmalloc(size_t n) { void *p; if ((p = calloc(1, n)) == NULL) { fprintf(stderr, "Sorry, not enough memory available!\n"); exit(1); } return p; } static void testbuf_write(int v, void *dummy) { if (testbuf_len < TESTBUF_SIZE) testbuf[testbuf_len++] = v; (void) dummy; return; } static void testbuf_writel(unsigned char *start, size_t len, void *dummy) { if (testbuf_len < TESTBUF_SIZE) { if (testbuf_len + len < TESTBUF_SIZE) memcpy(testbuf + testbuf_len, start, len); else memcpy(testbuf + testbuf_len, start, TESTBUF_SIZE - testbuf_len); } testbuf_len += len; #ifdef DEBUG { unsigned char *p; unsigned sum = 0; for (p = start; p - start < (ptrdiff_t) len; sum = (sum ^ *p++) << 1); printf(" testbuf_writel: %4lu bytes, checksum %04x\n", (unsigned long) len, sum & 0xffff); } #endif (void) dummy; return; } static int line_out(const struct jbg85_dec_state *s, unsigned char *start, size_t len, unsigned long y, void *bitmap) { assert(jbg85_dec_validwidth(s)); assert(len == (jbg85_dec_getwidth(s) >> 3) + !!(jbg85_dec_getwidth(s) & 7)); assert(y < jbg85_dec_getheight(s)); memcpy((unsigned char *) bitmap + len * y, start, len); return 0; } /* * Store the artificial test image defined in T.82, clause 7.2.1 at * pic. The image requires 477995 bytes of memory, is 1960 x 1951 pixels * large and has one plane. */ static void testimage(unsigned char *pic) { unsigned long i, j, sum; unsigned int prsg, repeat[8]; unsigned char *p; memset(pic, 0, TESTPIC_SIZE); p = pic; prsg = 1; for (j = 0; j < 1951; j++) for (i = 0; i < 1960; i++) { if (j >= 192) { if (j < 1023 || ((i >> 3) & 3) == 0) { sum = (prsg & 1) + ((prsg >> 2) & 1) + ((prsg >> 11) & 1) + ((prsg >> 15) & 1); prsg = (prsg << 1) + (sum & 1); if ((prsg & 3) == 0) { *p |= 1 << (7 - (i & 7)); repeat[i & 7] = 1; } else { repeat[i & 7] = 0; } } else { if (repeat[i & 7]) *p |= 1 << (7 - (i & 7)); } } if ((i & 7) == 7) ++p; } /* verify test image */ sum = 0; for (i = 0; i < TESTPIC_SIZE; i++) for (j = 0; j < 8; j++) sum += (pic[i] >> j) & 1; if (sum != 861965L) printf("WARNING: Artificial test image has %lu (not 861965) " "foreground pixels!\n", sum); return; } /* * Perform a full test cycle with one set of parameters. Encode an image * and compare the length of the result with correct_length. Then decode * the image again both in one single chunk or byte by byte and compare * the results with the original input image. */ static int test_cycle(unsigned char *orig_image, int width, int height, int options, unsigned long l0, int mx, long correct_length, const char *test_id) { struct jbg85_enc_state sje; struct jbg85_dec_state sjd; int trouble = 0; long l; size_t plane_size, buffer_len; int i, result; unsigned char *image, *buffer; size_t bpl; size_t cnt; bpl = (width + 7) / 8; plane_size = bpl * height; image = (unsigned char *) checkedmalloc(plane_size); memcpy(image, orig_image, plane_size); printf("\nTest-85 %s.1: Encoding ...\n", test_id); testbuf_len = 0; jbg85_enc_init(&sje, width, height, testbuf_writel, NULL); jbg85_enc_options(&sje, options, l0, mx); for (i = 0; i < height; i++) jbg85_enc_lineout(&sje, image + i * bpl, image + (i-1) * bpl, image + (i-2) * bpl); free(image); printf("Encoded BIE has %6ld bytes: ", testbuf_len); if (correct_length >= 0) if (testbuf_len == correct_length) puts(PASSED); else { trouble++; printf(FAILED ", correct would have been %ld\n", correct_length); } else puts(""); #if 1 buffer_len = ((width >> 3) + !!(width & 7)) * 3; buffer = (unsigned char *) checkedmalloc(buffer_len); image = (unsigned char *) checkedmalloc(plane_size); printf("Test-85 %s.2: Decoding whole chunk ...\n", test_id); jbg85_dec_init(&sjd, buffer, buffer_len, line_out, image); result = jbg85_dec_in(&sjd, testbuf, testbuf_len, &cnt); if (result != JBG_EOK) { printf("Decoder complained with return value 0x%02x: " FAILED "\nCause: '%s'\n", result, jbg85_strerror(result)); printf("%ld bytes of BIE read, %lu lines decoded.\n", (long) cnt, sjd.y); trouble++; } else { printf("Image comparison: "); result = 1; if (memcmp(orig_image, image, plane_size)) { result = 0; trouble++; printf(FAILED); } if (result) puts(PASSED); } free(image); image = (unsigned char *) checkedmalloc(plane_size); printf("Test-85 %s.3: Decoding with single-byte feed ...\n", test_id); jbg85_dec_init(&sjd, buffer, buffer_len, line_out, image); result = JBG_EAGAIN; for (l = 0; l < testbuf_len; l++) { result = jbg85_dec_in(&sjd, testbuf + l, 1, NULL); if (l < testbuf_len - 1 && result != JBG_EAGAIN) { printf("Decoder complained with return value 0x%02x at byte %ld: " FAILED "\nCause: '%s'\n", result, l, jbg85_strerror(result)); trouble++; break; } } if (l == testbuf_len) { if (result != JBG_EOK) { printf("Decoder complained with return value 0x%02x at final byte: " FAILED "\nCause: '%s'\n", result, jbg85_strerror(result)); trouble++; } else { printf("Image comparison: "); result = 1; if (memcmp(orig_image, image, plane_size)) { result = 0; trouble++; printf(FAILED); } if (result) puts(PASSED); } } free(image); #endif puts(""); return trouble != 0; } int main(int argc, char **argv) { int trouble, problems = 0; struct jbg_arenc_state *se; struct jbg_ardec_state *sd; long i; int pix; unsigned char *pp; int t82pix[16] = { 0x05e0, 0x0000, 0x8b00, 0x01c4, 0x1700, 0x0034, 0x7fff, 0x1a3f, 0x951b, 0x05d8, 0x1d17, 0xe770, 0x0000, 0x0000, 0x0656, 0x0e6a }; int t82cx[16] = { 0x0fe0, 0x0000, 0x0f00, 0x00f0, 0xff00, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000 }; unsigned char t82sde[32] = { 0x69, 0x89, 0x99, 0x5c, 0x32, 0xea, 0xfa, 0xa0, 0xd5, 0xff, 0x00, 0x52, 0x7f, 0xff, 0x00, 0xff, 0x00, 0xff, 0x00, 0xc0, 0x00, 0x00, 0x00, 0x3f, 0xff, 0x00, 0x2d, 0x20, 0x82, 0x91, 0xff, 0x02 }; printf("\nAutomatic JBIG Compatibility Test Suite\n" "---------------------------------------\n\n" "JBIG-KIT Version " JBG85_VERSION " (T.85 version)" " -- This test may take a few minutes.\n\n\n"); /* allocate test buffer memory */ testbuf = (unsigned char *) checkedmalloc(TESTBUF_SIZE); testpic = (unsigned char *) checkedmalloc(TESTPIC_SIZE); se = (struct jbg_arenc_state *) checkedmalloc(sizeof(struct jbg_arenc_state)); sd = (struct jbg_ardec_state *) checkedmalloc(sizeof(struct jbg_ardec_state)); /* only supported command line option: * output file name for exporting test image */ if (argc > 1) { FILE *f; puts("Generating test image ..."); testimage(testpic); printf("Storing in '%s' ...\n", argv[1]); /* write out test image as PBM file */ f = fopen(argv[1], "wb"); if (!f) abort(); fprintf(f, "P4\n"); #if 0 fprintf(f, "# Test image as defined in ITU-T T.82, clause 7.2.1\n"); #endif fprintf(f, "1960 1951\n"); fwrite(testpic, 1, TESTPIC_SIZE, f); fclose(f); exit(0); } #if 1 puts("1) Arithmetic encoder test sequence from ITU-T T.82, clause 7.1\n" "---------------------------------------------------------------\n"); arith_encode_init(se, 0); testbuf_len = 0; se->byte_out = testbuf_write; for (i = 0; i < 16 * 16; i++) arith_encode(se, (t82cx[i >> 4] >> ((15 - i) & 15)) & 1, (t82pix[i >> 4] >> ((15 - i) & 15)) & 1); arith_encode_flush(se); printf("result of encoder:\n "); for (i = 0; i < testbuf_len && i < TESTBUF_SIZE; i++) printf("%02x", testbuf[i]); printf("\nexpected result:\n "); for (i = 0; i < 30; i++) printf("%02x", t82sde[i]); printf("\n\nTest 1: "); if (testbuf_len != 30 || memcmp(testbuf, t82sde, 30)) { problems++; printf(FAILED); } else printf(PASSED); printf("\n\n"); puts("2) Arithmetic decoder test sequence from ITU-T T.82, clause 7.1\n" "---------------------------------------------------------------\n"); printf("Test 2.1: Decoding whole chunk ...\n"); arith_decode_init(sd, 0); sd->pscd_ptr = t82sde; sd->pscd_end = t82sde + 32; trouble = 0; for (i = 0; i < 16 * 16 && !trouble; i++) { pix = arith_decode(sd, (t82cx[i >> 4] >> ((15 - i) & 15)) & 1); if (pix < 0) { printf("Problem at pixel %ld, byte %ld.\n\n", i+1, (long) (sd->pscd_ptr - sd->pscd_end)); trouble++; break; } if (pix != ((t82pix[i >> 4] >> ((15 - i) & 15)) & 1)) { printf("Wrong PIX answer (%d) at pixel %ld.\n\n", pix, i+1); trouble++; break; } } if (!trouble && sd->pscd_ptr != sd->pscd_end - 2) { printf("%ld bytes left after decoder finished.\n\n", (long) (sd->pscd_end - sd->pscd_ptr - 2)); trouble++; } printf("Test result: "); if (trouble) { problems++; puts(FAILED); } else puts(PASSED); printf("\n"); printf("Test 2.2: Decoding with single byte feed ...\n"); arith_decode_init(sd, 0); pp = t82sde; sd->pscd_ptr = pp; sd->pscd_end = pp + 1; trouble = 0; for (i = 0; i < 16 * 16 && !trouble; i++) { pix = arith_decode(sd, (t82cx[i >> 4] >> ((15 - i) & 15)) & 1); while (pix < 0 && sd->pscd_end < t82sde + 32) { pp++; if (sd->pscd_ptr != pp - 1) sd->pscd_ptr = pp; sd->pscd_end = pp + 1; pix = arith_decode(sd, (t82cx[i >> 4] >> ((15 - i) & 15)) & 1); } if (pix < 0) { printf("Problem at pixel %ld, byte %ld.\n\n", i+1, (long) (sd->pscd_ptr - sd->pscd_end)); trouble++; break; } if (pix != ((t82pix[i >> 4] >> ((15 - i) & 15)) & 1)) { printf("Wrong PIX answer (%d) at pixel %ld.\n\n", pix, i+1); trouble++; break; } } if (!trouble && sd->pscd_ptr != sd->pscd_end - 2) { printf("%ld bytes left after decoder finished.\n\n", (long) (sd->pscd_end - sd->pscd_ptr - 2)); trouble++; } printf("Test result: "); if (trouble) { problems++; puts(FAILED); } else puts(PASSED); printf("\n"); puts("3) Parametric algorithm test sequence from ITU-T T.82, clause 7.2\n" "-----------------------------------------------------------------\n"); puts("Generating test image ..."); testimage(testpic); putchar('\n'); puts("Test-85 3.1: TPBON=0, Mx=0, LRLTWO=0, L0=1951, 0 layers"); problems += test_cycle(testpic, 1960, 1951, 0, 1951, 0, 317384L, "3.1"); puts("Test-85 3.2: TPBON=0, Mx=0, LRLTWO=1, L0=1951, 0 layers"); problems += test_cycle(testpic, 1960, 1951, JBG_LRLTWO, 1951, 0, 317132L, "3.2"); puts("Test-85 3.3: TPBON=1, Mx=8, LRLTWO=0, L0=128, 0 layers"); problems += test_cycle(testpic, 1960, 1951, JBG_TPBON, 128, 8, 253653L, "3.3"); #endif #if 0 puts("4) Same T.82 tests with SDRST instead of SDNORM\n" "-----------------------------------------------\n"); puts("Test-85 4.0: TPBON=1, Mx=8, LRLTWO=0, L0=128, 0 layers"); problems += test_cycle(&pp, 1960, 1951, JBG_SDRST | JBG_TPBON, 128, 8, -1, "4.0"); puts("Test-85 4.1: TPBON=0, Mx=0, LRLTWO=0, L0=1951, 0 layers"); problems += test_cycle(&pp, 1960, 1951, JBG_SDRST, 1951, 0, -1, "4.1"); puts("Test-85 4.2: TPBON=0, Mx=0, LRLTWO=1, L0=1951, 0 layers"); problems += test_cycle(&pp, 1960, 1951, JBG_LRLTWO | JBG_SDRST, 1951, 0, -1, "4.2"); puts("Test-85 4.3: TPBON=1, Mx=8, LRLTWO=0, L0=128, 0 layers"); problems += test_cycle(&pp, 1960, 1951, JBG_TPBON | JBG_SDRST, 128, 8, -1, "4.3"); #endif printf("\nTest result summary: the T.85 library has %s the test suite.\n\n", problems ? FAILED : PASSED); if (problems) puts("This is bad. If you cannot identify the problem yourself, please " "send\nthis output plus a detailed description of your " "compile environment\n(OS, compiler, version, options, etc.) to " "Markus Kuhn\n."); else puts("Congratulations, everything is fine.\n"); return problems != 0; } jbigkit-2.1/pbmtools/0000775000307500030750000000000012315071210013270 5ustar mgk25mgk25jbigkit-2.1/pbmtools/Makefile0000664000307500030750000001353012315071063014740 0ustar mgk25mgk25# Unix makefile for the JBIG-KIT PBM tools # Select an ANSI/ISO C compiler here, e.g. GNU gcc is recommended CC = gcc # Options for the compiler CFLAGS = -g -O -W -Wall -Wno-unused-result -ansi -pedantic # --coverage CPPFLAGS = -I../libjbig .SUFFIXES: .1 .5 .txt $(SUFFIXES) .PHONY: txt test test82 test85 clean all: pbmtojbg jbgtopbm pbmtojbg85 jbgtopbm85 txt txt: pbmtojbg.txt jbgtopbm.txt pbm.txt pgm.txt pbmtojbg: pbmtojbg.o ../libjbig/libjbig.a $(CC) $(CFLAGS) -o pbmtojbg pbmtojbg.o -L../libjbig -ljbig jbgtopbm: jbgtopbm.o ../libjbig/libjbig.a $(CC) $(CFLAGS) -o jbgtopbm jbgtopbm.o -L../libjbig -ljbig pbmtojbg85: pbmtojbg85.o ../libjbig/libjbig85.a $(CC) $(CFLAGS) -o pbmtojbg85 pbmtojbg85.o -L../libjbig -ljbig85 jbgtopbm85: jbgtopbm85.o ../libjbig/libjbig85.a $(CC) $(CFLAGS) -o jbgtopbm85 jbgtopbm85.o -L../libjbig -ljbig85 jbgtopbm.o: jbgtopbm.c ../libjbig/jbig.h pbmtojbg.o: pbmtojbg.c ../libjbig/jbig.h jbgtopbm85.o: jbgtopbm85.c ../libjbig/jbig85.h pbmtojbg85.o: pbmtojbg85.c ../libjbig/jbig85.h ../libjbig/libjbig.a: ../libjbig/jbig.c ../libjbig/jbig.h \ ../libjbig/jbig_ar.c ../libjbig/jbig_ar.h make -C ../libjbig libjbig.a ../libjbig/libjbig85.a: ../libjbig/jbig85.c ../libjbig/jbig85.h \ ../libjbig/jbig_ar.c ../libjbig/jbig_ar.h make -C ../libjbig libjbig85.a analyze: clang $(CPPFLAGS) --analyze *.c test: test82 test85 test82: pbmtojbg jbgtopbm make IMG=ccitt1 OPTIONSP= dotest1 make IMG=ccitt2 OPTIONSP= dotest1 make IMG=ccitt3 OPTIONSP= dotest1 make IMG=xvlogo "OPTIONSP=-d 3" dotest1 make IMG=sandra OPTIONSP= OPTIONSJ= dotest2g make IMG=sandra OPTIONSP=-b OPTIONSJ=-b dotest2g make IMG=sandra OPTIONSP=-q OPTIONSJ= dotest2g make IMG=sandra "OPTIONSP=-o 0" OPTIONSJ= dotest2g make IMG=sandra "OPTIONSP=-o 2" OPTIONSJ= dotest2g make IMG=multi OPTIONSP= OPTIONSJ= dotest2g make IMG=multi OPTIONSP=-b OPTIONSJ=-b dotest2g make IMG=mx "OPTIONSP=-q -s 3 -m 128" dotest1 make IMG=mx "OPTIONSP=-q -s 3 -m 128" dotest2b make IMG=mx "OPTIONSP=-q -s 3 -m 128 -p 92" dotest2b make IMG=mx "OPTIONSP=-q -Y -1" dotest2b make IMG=mx "OPTIONSP=-Y -1" dotest2b rm -f test-*.jbg test-*.pbm test-*.pgm ./jbgtopbm ../examples/ccitt1.jbg | ./pbmtojbg > test-ccitt1.jbg cmp ../examples/ccitt1.jbg test-ccitt1.jbg rm -f test-*.jbg test-*.pbm test-*.pgm ./jbgtopbm < ../examples/ccitt1.jbg | ./pbmtojbg - test-ccitt1.jbg cmp ../examples/ccitt1.jbg test-ccitt1.jbg rm -f test-*.jbg test-*.pbm test-*.pgm ./jbgtopbm < ../examples/ccitt1.jbg - test-ccitt1.pbm ; \ ./pbmtojbg test-ccitt1.pbm test-ccitt1.jbg cmp ../examples/ccitt1.jbg test-ccitt1.jbg rm -f test-*.jbg test-*.pbm test-*.pgm ./jbgtopbm ../examples/ccitt1.jbg test-ccitt1.pbm ; \ ./pbmtojbg test-ccitt1.pbm >test-ccitt1.jbg cmp ../examples/ccitt1.jbg test-ccitt1.jbg rm -f test-*.jbg test-*.pbm test-*.pgm @echo @echo "The pbmtools have PASSED the functional tests. Good!" @echo dotest1: ./jbgtopbm ../examples/$(IMG).jbg test-$(IMG).pbm ./pbmtojbg $(OPTIONSP) test-$(IMG).pbm test-$(IMG).jbg cmp test-$(IMG).jbg ../examples/$(IMG).jbg dotest2b: ./pbmtojbg $(OPTIONSP) test-$(IMG).pbm test-$(IMG).jbg ./jbgtopbm $(OPTIONSJ) test-$(IMG).jbg test-$(IMG)-2.pbm cmp test-$(IMG).pbm test-$(IMG)-2.pbm dotest2g: ./pbmtojbg $(OPTIONSP) ../examples/$(IMG).pgm test-$(IMG).jbg ./jbgtopbm $(OPTIONSJ) test-$(IMG).jbg test-$(IMG).pgm cmp test-$(IMG).pgm ../examples/$(IMG).pgm test85: pbmtojbg jbgtopbm pbmtojbg85 jbgtopbm85 test-t82.pbm make IMG=t82 "OPTIONSP=-p 0" dotest85 make IMG=t82 "OPTIONSP=-p 8" dotest85 make IMG=t82 "OPTIONSP=-p 8 -r" dotest85b make IMG=t82 "OPTIONSP=-p 64" dotest85 make IMG=t82 "OPTIONSP=-p 72" dotest85 make IMG=t82 "OPTIONSP=-s 2 -C c" dotest85 make IMG=t82 "OPTIONSP=-s 99999" dotest85 make IMG=t82 "OPTIONSP=-Y 9999 0" dotest85 make IMG=t82 "OPTIONSP=-Y 1951 0" dotest85 make IMG=t82 "OPTIONSP=-Y -1 127" dotest85 make IMG=t82 "OPTIONSP=-Y -1 128" dotest85 make IMG=t82 "OPTIONSP=-Y -1 1919" dotest85 make IMG=t82 "OPTIONSP=-Y -1 1920" dotest85 make IMG=t82 "OPTIONSP=-Y -1 1949" dotest85 make IMG=t82 "OPTIONSP=-Y -1 1950" dotest85 make IMG=ccitt1 dotest85 make IMG=ccitt2 dotest85 make IMG=ccitt3 dotest85 rm -f test-*.jbg test-*.jbg85 test-*.pbm @echo @echo "The T.85 pbmtools have PASSED the functional tests. Good!" @echo dotest85: test-$(IMG).pbm ./pbmtojbg85 $(OPTIONSP) test-$(IMG).pbm test-$(IMG).jbg85 ls -l test-$(IMG).jbg85 ./jbgtopbm test-$(IMG).jbg85 test-$(IMG).pbm85 cmp test-$(IMG).pbm test-$(IMG).pbm85 rm test-$(IMG).pbm85 ./jbgtopbm85 test-$(IMG).jbg85 test-$(IMG).pbm85 cmp test-$(IMG).pbm test-$(IMG).pbm85 rm test-$(IMG).pbm85 ./jbgtopbm85 -B 1 test-$(IMG).jbg85 test-$(IMG).pbm85 cmp test-$(IMG).pbm test-$(IMG).pbm85 dotest85b: test-$(IMG).pbm ./pbmtojbg -f $(OPTIONSP) test-$(IMG).pbm test-$(IMG).jbg85 ls -l test-$(IMG).jbg85 ./jbgtopbm test-$(IMG).jbg85 test-$(IMG).pbm85 cmp test-$(IMG).pbm test-$(IMG).pbm85 rm test-$(IMG).pbm85 ./jbgtopbm85 test-$(IMG).jbg85 test-$(IMG).pbm85 cmp test-$(IMG).pbm test-$(IMG).pbm85 rm test-$(IMG).pbm85 ./jbgtopbm85 -B 1 test-$(IMG).jbg85 test-$(IMG).pbm85 cmp test-$(IMG).pbm test-$(IMG).pbm85 test-%.pbm: ../examples/%.jbg ./jbgtopbm $< $@ test-t82.pbm: make -C ../libjbig tstcodec ../libjbig/tstcodec $@ FOPT=-c 1000 -p 300000 -m 3 fuzz: test-t82.pbm while \ ./pbmtojbg -f test-t82.pbm | ./jbgfuzz.pl $(FOPT) && \ ./pbmtojbg test-t82.pbm | ./jbgfuzz.pl $(FOPT) -d jbgtopbm ; \ do true; done .1.txt .5.txt: groff -man -Tascii -P -c -P -b -P -u $< >$@ clean: rm -f *.o *~ core pbmtojbg jbgtopbm pbmtojbg85 jbgtopbm85 rm -f test-*.jbg test-*.pbm test-*.pgm test-*.jbg85 test-*.pbm85 rm -f *.gcda *.gcno *.plist jbigkit-2.1/pbmtools/jbgfuzz.pl0000775000307500030750000000570512315071063015326 0ustar mgk25mgk25#!/usr/bin/perl # Simple fuzz tester for JBIG-KIT decoder -- Markus Kuhn # # Usage example: # # $ ../libjbig/tstcodec t.pbm # $ ./pbmtojbg -f t.pbm | ./jbgfuzz.pl use strict; my $fntst = '/tmp/test.jbg'; # fuzz testing file to be generated my $fntmp = $fntst . '~'; # temporary file (for atomic update) my $fnvalid = '-'; # valid example BIE file my $pbmtools = '.'; # location of jbgtopbm and jbgtopbm85 my $count = "inf"; # how many times shall we try? my @decoders; my $prefix_len = 2000; my $rnd_suffix_len = 2000; my $mutation_rate = 10; # percentage of bytes substituted in prefix while ($_ = shift @ARGV) { if ($_ eq '-c') { $count = shift @ARGV; } elsif ($_ eq '-m') { $mutation_rate = shift @ARGV; } elsif ($_ eq '-p') { $prefix_len = shift @ARGV; } elsif ($_ eq '-r') { $rnd_suffix_len = shift @ARGV; } elsif ($_ eq '-d') { push @decoders, shift @ARGV; } elsif ($_ eq '-t') { $pbmtools = shift @ARGV; } else { $fnvalid = $_; } } @decoders = ('jbgtopbm', 'jbgtopbm85') unless @decoders; # read some bytes from a valid BIE my $valid_prefix; my $in; open($in, "<$fnvalid") || die("$fnvalid: $!\n"); read $in, $valid_prefix, $prefix_len; close $in || die("$fnvalid: $!\n"); # open a source of random bytes my $fn_rnd = '/dev/urandom'; my $rnd; open($rnd, '<', $fn_rnd) || die; for (my $i = 0; $i < $count; $i++) { my $out; open($out, '>', $fntmp) || die("$fntmp: $!\n"); my $prefix; # randomly substitute some prefix bytes with random bytes $prefix = $valid_prefix; if (length($prefix) != $prefix_len) { warn("Truncating requested $prefix_len byte prefix to available ". length($prefix)." bytes.\n"); $prefix_len = length($prefix); } #print "\nB: ".join(',', unpack('C4N3C4', substr($prefix, 0, 20)))."\n"; for (my $p = 0; $p < $prefix_len; $p++) { if (rand(100) < $mutation_rate) { substr($prefix, $p, 1) = chr(int(rand(256))); } } #print "A: ".join(',', unpack('C4N3C4', substr($prefix, 0, 20)))."\n"; # constrain header my ($dl,$d,$p,$res,$xd,$yd,$l0,$mx,$my,$order,$options,$rest) = unpack('C4N3C4a*', $prefix); redo if $xd * $yd > 1e9; # eliminate excessive image sizes $prefix = pack('C4N3C4a*', $dl,$d,$p,$res,$xd,$yd,$l0,$mx,$my, $order,$options,$rest); print $out $prefix; # append random suffix my $data; read $rnd, $data, $rnd_suffix_len; print $out $data; close($out) || die("$fntmp: $!\n"); rename($fntmp, $fntst) || die("mv $fntmp $fntst: $!\n"); # now feed fuzz input into decoder(s) for my $jbgtopbm (@decoders) { printf "%5d: ", $i; $_ = `$pbmtools/$jbgtopbm $fntst /dev/null 2>&1`; my $r = $?; if ($r == 0) { print "no error encountered\n"; next; } elsif ($r == 256) { my $err; if (/(\(error code.*\))/) { $err = $1; print $err, "\n"; } else { die("$_\nno error code found\n"); } } else { die("$_\nreturn value: $r\n"); } } } jbigkit-2.1/pbmtools/jbgtopbm.10000664000307500030750000000676012315071063015175 0ustar mgk25mgk25.TH JBGTOPBM 1 "2003-06-04" .SH NAME jbgtopbm \- JBIG1 to portable bitmap file converter .SH SYNOPSIS .B jbgtopbm [ .I options ] [ .I input-file | \- [ .I output-file ]] .br .SH DESCRIPTION Reads in a .I JBIG1 bi-level image entity (BIE) from a file or standard input, decompresses it, and outputs a portable bitmap (PBM) file. .I JBIG1 is a highly effective lossless compression algorithm for bi-level images (one bit per pixel), which is particularly suitable for scanned document pages. A .I JBIG1 encoded image can be stored in several resolutions in one or several BIEs. All resolution layers except the lowest one are stored efficiently as differences to the next lower resolution layer. Options .BI -x and .BI -y can be used to stop the decompression at a specified maximal output image size. With option .BI -m the input file can consist of multiple concatenated BIEs which contain different increasing resolution layers of the same image. If more than one bit per pixel is stored in the JBIG1 file, then a PGM file will be produced. .SH OPTIONS .TP 14 .BI \- A single hyphen instead of an input file name will cause .I jbgtopbm to read the data from standard input instead from a file. .TP .BI \-x " number" Decode only up to the largest resolution layer which is still not more than .I number pixels wide. If no such resolution layer exists, then use the smallest one available. .TP .BI \-y " number" Decode only up to the largest resolution layer which is still not more than .I number pixels high. If no such resolution layer exists, then use the smallest one available. Options .BI \-x and .BI \-y can also be used together in which case the largest layer that satisfies both limits will be selected. .TP .BI \-m Process multiple concatenated BIEs. If there are bytes left after the final SDE in the first BIE, then with this option .I jbgtopbm will attempt to decode these as the start of another BIE that may contain higher resolution data. Normally, any remaining bytes will generate a warning message. .TP .BI \-b Use binary values instead of Gray code words in order to decode pixel values from multiple bitplanes. This option has only an effect if the input has more than one bitplane and a PGM output file is produced. Note that the decoder has to be used in the same mode as the encoder and cannot determine from the BIE, whether Gray or binary code words were used by the encoder. .TP .BI \-d Diagnose a single BIE. With this option, .I jbgtopbm will print a summary of the header information found in the input file, followed by a list of all PSCD and ESC marker sequences encountered until the end of the file is reached. .TP .BI \-p " number" If the input contains multiple bitplanes, then extract only the specified single plane as a PBM file. The first plane has number 0. .SH BUGS Using standard input and standard output for binary data works only on systems where there is no difference between binary and text streams (e.g., Unix). On other systems (e.g., MS-DOS), using standard input or standard output may cause control characters like CR or LF to be inserted or deleted and this will damage the binary data. .SH STANDARDS This program implements the .I JBIG1 image coding algorithm as specified in ISO/IEC 11544:1993 and ITU-T T.82(1993). .SH AUTHOR The .I jbgtopbm program is part of the .I JBIG-KIT package, which has been developed by Markus Kuhn. The most recent version of this portable .I JBIG1 library and tools set is available from . .SH SEE ALSO pbm(5), pgm(5), pbmtojbg(1) jbigkit-2.1/pbmtools/jbgtopbm.c0000664000307500030750000003206112315071063015250 0ustar mgk25mgk25/* * jbgtopbm - JBIG to Portable Bitmap converter * * Markus Kuhn - http://www.cl.cam.ac.uk/~mgk25/jbigkit/ */ #include #include #include #include #include "jbig.h" char *progname; /* global pointer to argv[0] */ /* * Print usage message and abort */ static void usage(void) { fprintf(stderr, "JBIGtoPBM converter " JBG_VERSION " -- " "reads a bi-level image entity (BIE) as input file\n\n" "usage: %s [] [ | - []]\n\n" "options:\n\n", progname); fprintf(stderr, " -x number\tif possible decode only up to a resolution layer not\n" "\t\twider than the given number of pixels\n" " -y number\tif possible decode only up to a resolution layer not\n" "\t\thigher than the given number of pixels\n" " -m\t\tdecode a progressive sequence of multiple concatenated BIEs\n" " -b\t\tuse binary code for multiple bit planes (default: Gray code)\n" " -d\t\tdiagnose single BIE, print header, list marker sequences\n" " -p number\tdecode only one single bit plane (0 = first plane)\n\n"); exit(1); } /* * Call-back routine for merged image output */ void write_it(unsigned char *data, size_t len, void *file) { fwrite(data, len, 1, (FILE *) file); } /* * Remalloc a buffer and append a file f into its content. * If *buflen == 0, then malloc a buffer first. */ void read_file(unsigned char **buf, size_t *buflen, size_t *len, FILE *f) { if (*buflen == 0) { *buflen = 4000; *len = 0; *buf = (unsigned char *) malloc(*buflen); if (!*buf) { fprintf(stderr, "Sorry, not enough memory available!\n"); exit(1); } } do { *len += fread(*buf + *len, 1, *buflen - *len, f); if (*len == *buflen) { *buflen *= 2; *buf = (unsigned char *) realloc(*buf, *buflen); if (!*buf) { fprintf(stderr, "Sorry, not enough memory available!\n"); exit(1); } } if (ferror(f)) { perror("Problem while reading input file"); exit(1); } } while (!feof(f)); *buflen = *len; *buf = (unsigned char *) realloc(*buf, *buflen); if (!*buf) { fprintf(stderr, "Oops, realloc failed when shrinking buffer!\n"); exit(1); } return; } /* marker codes */ #define MARKER_STUFF 0x00 #define MARKER_SDNORM 0x02 #define MARKER_SDRST 0x03 #define MARKER_ABORT 0x04 #define MARKER_NEWLEN 0x05 #define MARKER_ATMOVE 0x06 #define MARKER_COMMENT 0x07 #define MARKER_ESC 0xff /* * Output (prefix of) a short byte sequence in hexadecimal * for diagnostic purposes */ void fprint_bytes(FILE *f, unsigned char *p, size_t len, int width) { size_t i; size_t max = width / 3; if (len > max) max -= 7; for (i = 0; i < len && i < max; i++) fprintf(f, "%02x ", p[i]); if (len > i) fprintf(f, "... %lu bytes total", (unsigned long) len); fprintf(f, "\n"); } /* * Read BIE and output human readable description of content */ void diagnose_bie(FILE *fin) { unsigned char *bie, *p, *pnext; size_t buflen = 0, len; unsigned long xd, yd, l0; int dl, d; FILE *f = stdout; extern unsigned char *jbg_next_pscdms(unsigned char *p, size_t len); extern unsigned long jbg_stripes(unsigned long l0, unsigned long yd, unsigned long d); unsigned long stripes; int layers, planes; unsigned long sdes, sde = 0; /* read BIH */ read_file(&bie, &buflen, &len, fin); if (len < 20) { fprintf(f, "Error: Input file is %lu < 20 bytes long and therefore " "does not contain an intact BIE header!\n", (unsigned long) len); return; } /* parse BIH */ fprintf(f, "BIH:\n\n DL = %d\n D = %d\n P = %d\n" " - = %d\n XD = %lu\n YD = %lu\n L0 = %lu\n MX = %d\n" " MY = %d\n", dl = bie[0], d = bie[1], planes = bie[2], bie[3], xd = ((unsigned long)bie[ 4] << 24) | ((unsigned long)bie[ 5] << 16)| ((unsigned long) bie[ 6] << 8) | ((unsigned long) bie[ 7]), yd = ((unsigned long)bie[ 8] << 24) | ((unsigned long)bie[ 9] << 16)| ((unsigned long) bie[10] << 8) | ((unsigned long) bie[11]), l0 = ((unsigned long)bie[12] << 24) | ((unsigned long)bie[13] << 16)| ((unsigned long) bie[14] << 8) | ((unsigned long) bie[15]), bie[16], bie[17]); fprintf(f, " order = %d %s%s%s%s%s\n", bie[18], bie[18] & JBG_HITOLO ? " HITOLO" : "", bie[18] & JBG_SEQ ? " SEQ" : "", bie[18] & JBG_ILEAVE ? " ILEAVE" : "", bie[18] & JBG_SMID ? " SMID" : "", bie[18] & 0xf0 ? " other" : ""); fprintf(f, " options = %d %s%s%s%s%s%s%s%s\n", bie[19], bie[19] & JBG_LRLTWO ? " LRLTWO" : "", bie[19] & JBG_VLENGTH ? " VLENGTH" : "", bie[19] & JBG_TPDON ? " TPDON" : "", bie[19] & JBG_TPBON ? " TPBON" : "", bie[19] & JBG_DPON ? " DPON" : "", bie[19] & JBG_DPPRIV ? " DPPRIV" : "", bie[19] & JBG_DPLAST ? " DPLAST" : "", bie[19] & 0x80 ? " other" : ""); stripes = jbg_stripes(l0, yd, d); layers = d - dl + 1; fprintf(f, "\n %lu stripes, %d layers, %d planes => ", stripes, layers, planes); if ((ULONG_MAX / layers) / planes >= stripes) { sdes = stripes * layers * planes; fprintf(f, "%lu SDEs\n\n", sdes); } else { /* handle integer overflow */ fprintf(f, ">%lu SDEs!\n", ULONG_MAX); return; } /* parse BID */ fprintf(f, "BID:\n\n"); p = bie + 20; /* skip BIH */ if ((bie[19] & (JBG_DPON | JBG_DPPRIV | JBG_DPLAST)) == (JBG_DPON | JBG_DPPRIV)) p += 1728; /* skip DPTABLE */ if (p > bie + len) { fprintf(f, "Error: Input file is %lu < 20+1728 bytes long and therefore " "does not contain an intact BIE header with DPTABLE!\n", (unsigned long) len); return; } while (p != bie + len) { if (p > bie + len - 2) { fprintf(f, "%06lx: Error: single byte 0x%02x left\n", (long) (p - bie), *p); return; } pnext = jbg_next_pscdms(p, len - (p - bie)); if (p[0] != MARKER_ESC || p[1] == MARKER_STUFF) { fprintf(f, "%06lx: PSCD: ", (long) (p - bie)); fprint_bytes(f, p, pnext ? (size_t) (pnext - p) : len - (p - bie), 60); if (!pnext) { fprintf(f, "Error: PSCD not terminated by SDNORM or SDRST marker\n"); return; } } else switch (p[1]) { case MARKER_SDNORM: case MARKER_SDRST: fprintf(f, "%06lx: ESC %s, ending SDE #%lu", (long) (p - bie), (p[1] == MARKER_SDNORM) ? "SDNORM" : "SDRST", ++sde); if (sde == sdes) fprintf(f, " (final SDE)"); else if (sde == sdes + 1) fprintf(f, " (first surplus SDE, VLENGTH = %d)", (bie[19] & JBG_VLENGTH) > 0); fprintf(f, "\n"); break; case MARKER_ABORT: fprintf(f, "%06lx: ESC ABORT\n", (long) (p - bie)); break; case MARKER_NEWLEN: fprintf(f, "%06lx: ESC NEWLEN ", (long) (p - bie)); if (p + 5 < bie + len) { fprintf(f, "YD = %lu\n", yd = (((long) p[2] << 24) | ((long) p[3] << 16) | ((long) p[4] << 8) | (long) p[5])); stripes = jbg_stripes(l0, yd, d); fprintf(f, " %lu stripes, %d layers, %d planes => ", stripes, layers, planes); if ((ULONG_MAX / layers) / planes >= stripes) { sdes = stripes * layers * planes; fprintf(f, "%lu SDEs\n", sdes); } else { /* handle integer overflow */ fprintf(f, ">%lu SDEs!\n", ULONG_MAX); return; } } else fprintf(f, "unexpected EOF\n"); break; case MARKER_ATMOVE: fprintf(f, "%06lx: ESC ATMOVE ", (long) (p - bie)); if (p + 7 < bie + len) fprintf(f, "YAT = %lu, tX = %d, tY = %d\n", (((long) p[2] << 24) | ((long) p[3] << 16) | ((long) p[4] << 8) | (long) p[5]), p[6], p[7]); else fprintf(f, "unexpected EOF\n"); break; case MARKER_COMMENT: fprintf(f, "%06lx: ESC COMMENT ", (long) (p - bie)); if (p + 5 < bie + len) fprintf(f, "LC = %lu\n", (((long) p[2] << 24) | ((long) p[3] << 16) | ((long) p[4] << 8) | (long) p[5])); else fprintf(f, "unexpected EOF\n"); break; default: fprintf(f, "%06lx: ESC 0x%02x\n", (long) (p - bie), p[1]); } if (!pnext) { fprintf(f, "Error encountered!\n"); return; } p = pnext; } free(bie); return; } int main (int argc, char **argv) { FILE *fin = stdin, *fout = stdout; const char *fnin = NULL, *fnout = NULL; int i, j, result; int all_args = 0, files = 0; struct jbg_dec_state s; unsigned char *buffer, *p; size_t buflen, len, cnt; size_t bytes_read = 0; unsigned long xmax = 4294967295UL, ymax = 4294967295UL, max; int plane = -1, use_graycode = 1, diagnose = 0, multi = 0; buflen = 8000; buffer = (unsigned char *) malloc(buflen); if (!buffer) { printf("Sorry, not enough memory available!\n"); exit(1); } /* parse command line arguments */ progname = argv[0]; for (i = 1; i < argc; i++) { if (!all_args && argv[i][0] == '-') if (argv[i][1] == 0) { if (files++) usage(); } else for (j = 1; j > 0 && argv[i][j]; j++) switch(argv[i][j]) { case '-' : all_args = 1; break; case 'b': use_graycode = 0; break; case 'm': multi = 1; break; case 'd': diagnose = 1; break; case 'x': if (++i >= argc) usage(); xmax = atol(argv[i]); j = -1; break; case 'y': if (++i >= argc) usage(); ymax = atol(argv[i]); j = -1; break; case 'p': if (++i >= argc) usage(); plane = atoi(argv[i]); j = -1; break; default: usage(); } else switch (files++) { case 0: fnin = argv[i]; break; case 1: fnout = argv[i]; break; default: usage(); } } if (fnin) { fin = fopen(fnin, "rb"); if (!fin) { fprintf(stderr, "Can't open input file '%s", fnin); perror("'"); exit(1); } } else fnin = ""; if (diagnose) { diagnose_bie(fin); exit(0); } if (fnout) { fout = fopen(fnout, "wb"); if (!fout) { fprintf(stderr, "Can't open input file '%s", fnout); perror("'"); exit(1); } } else fnout = ""; /* send input file to decoder */ jbg_dec_init(&s); jbg_dec_maxsize(&s, xmax, ymax); /* read BIH first to check VLENGTH */ len = fread(buffer, 1, 20, fin); if (len < 20) { fprintf(stderr, "Input file '%s' (%lu bytes) must be at least " "20 bytes long\n", fnin, (unsigned long) len); if (fout != stdout) { fclose(fout); remove(fnout); } exit(1); } if (buffer[19] & JBG_VLENGTH) { /* VLENGTH = 1 => we might encounter a NEWLEN, therefore read entire * input file into memory and run two passes over it */ read_file(&buffer, &buflen, &len, fin); /* scan for NEWLEN marker segments and update BIE header accordingly */ result = jbg_newlen(buffer, len); /* feed data to decoder */ if (result == JBG_EOK) { p = (unsigned char *) buffer; result = JBG_EAGAIN; while (len > 0 && (result == JBG_EAGAIN || (result == JBG_EOK && multi))) { result = jbg_dec_in(&s, p, len, &cnt); p += cnt; len -= cnt; bytes_read += cnt; } } } else { /* VLENGTH = 0 => we can simply pass the input file directly to decoder */ result = JBG_EAGAIN; do { cnt = 0; p = (unsigned char *) buffer; while (len > 0 && (result == JBG_EAGAIN || (result == JBG_EOK && multi))) { result = jbg_dec_in(&s, p, len, &cnt); p += cnt; len -= cnt; bytes_read += cnt; } if (!(result == JBG_EAGAIN || (result == JBG_EOK && multi))) break; len = fread(buffer, 1, buflen, fin); } while (len > 0); if (ferror(fin)) { fprintf(stderr, "Problem while reading input file '%s", fnin); perror("'"); if (fout != stdout) { fclose(fout); remove(fnout); } exit(1); } } if (result != JBG_EOK && result != JBG_EOK_INTR) { fprintf(stderr, "Problem with input file '%s': %s\n" "(error code 0x%02x, %lu = 0x%04lx BIE bytes processed)\n", fnin, jbg_strerror(result), result, (unsigned long) bytes_read, (unsigned long) bytes_read); if (fout != stdout) { fclose(fout); remove(fnout); } exit(1); } if (plane >= 0 && jbg_dec_getplanes(&s) <= plane) { fprintf(stderr, "Image has only %d planes!\n", jbg_dec_getplanes(&s)); if (fout != stdout) { fclose(fout); remove(fnout); } exit(1); } if (jbg_dec_getplanes(&s) == 1 || plane >= 0) { /* write PBM output file */ fprintf(fout, "P4\n%10lu\n%10lu\n", jbg_dec_getwidth(&s), jbg_dec_getheight(&s)); fwrite(jbg_dec_getimage(&s, plane < 0 ? 0 : plane), 1, jbg_dec_getsize(&s), fout); } else { /* write PGM output file */ if ((size_t) jbg_dec_getplanes(&s) > sizeof(unsigned long) * 8) { fprintf(stderr, "Image has too many planes (%d)!\n", jbg_dec_getplanes(&s)); if (fout != stdout) { fclose(fout); remove(fnout); } exit(1); } max = 0; for (i = jbg_dec_getplanes(&s); i > 0; i--) max = (max << 1) | 1; fprintf(fout, "P5\n%10lu\n%10lu\n%lu\n", jbg_dec_getwidth(&s), jbg_dec_getheight(&s), max); jbg_dec_merge_planes(&s, use_graycode, write_it, fout); } /* check for file errors and close fout */ if (ferror(fout) || fclose(fout)) { fprintf(stderr, "Problem while writing output file '%s", fnout); perror("'"); exit(1); } jbg_dec_free(&s); return 0; } jbigkit-2.1/pbmtools/jbgtopbm85.c0000664000307500030750000001303612315071063015426 0ustar mgk25mgk25/* * jbgtopbm85 - JBIG to Portable Bitmap converter (T.85 version) * * Markus Kuhn - http://www.cl.cam.ac.uk/~mgk25/jbigkit/ */ #include #include #include #include #include "jbig85.h" char *progname; /* global pointer to argv[0] */ unsigned long y_0; fpos_t ypos; int ypos_error = 1; unsigned long ymax = 0; /* * Print usage message and abort */ static void usage(void) { fprintf(stderr, "JBIGtoPBM converter " JBG85_VERSION " (T.85 version) --\n" "reads a bi-level image entity (BIE) as input file\n\n" "usage: %s [ | - []]\n\n", progname); fprintf(stderr, "options:\n\n" " -x number\tmaximum number of pixels per line for which memory\n" "\t\tis allocated (default: 8192)\n" " -y number\tinterrupt decoder after this number of lines\n" " -B number\tinput buffer size\n\n"); exit(1); } /* * Call-back routine for merged image output */ int line_out(const struct jbg85_dec_state *s, unsigned char *start, size_t len, unsigned long y, void *file) { if (y == 0) { /* prefix first line with PBM header */ fprintf((FILE *) file, "P4\n"); fprintf((FILE *) file, "%10lu\n", jbg85_dec_getwidth(s)); /* store file position of height, so we can update it after NEWLEN */ y_0 = jbg85_dec_getheight(s); ypos_error = fgetpos((FILE *) file, &ypos); fprintf((FILE *) file, "%10lu\n", y_0); /* pad number to 10 bytes */ } fwrite(start, len, 1, (FILE *) file); return y == ymax - 1; } int main (int argc, char **argv) { FILE *fin = stdin, *fout = stdout; const char *fnin = NULL, *fnout = NULL; int i, j, result; int all_args = 0, files = 0; struct jbg85_dec_state s; unsigned char *inbuf, *outbuf; size_t inbuflen = 8192, outbuflen, len, cnt, cnt2; unsigned long xmax = 8192; size_t bytes_read = 0; /* parse command line arguments */ progname = argv[0]; for (i = 1; i < argc; i++) { if (!all_args && argv[i][0] == '-') if (argv[i][1] == 0) { if (files++) usage(); } else for (j = 1; j > 0 && argv[i][j]; j++) switch(argv[i][j]) { case '-' : all_args = 1; break; case 'x': if (++i >= argc) usage(); j = -1; xmax = atol(argv[i]); break; case 'y': if (++i >= argc) usage(); j = -1; ymax = atol(argv[i]); break; case 'B': if (++i >= argc) usage(); j = -1; inbuflen = atol(argv[i]); if (inbuflen < 1) usage(); break; default: usage(); } else switch (files++) { case 0: fnin = argv[i]; break; case 1: fnout = argv[i]; break; default: usage(); } } inbuf = (unsigned char *) malloc(inbuflen); outbuflen = ((xmax >> 3) + !!(xmax & 7)) * 3; outbuf = (unsigned char *) malloc(outbuflen); if (!inbuf || !outbuf) { printf("Sorry, not enough memory available!\n"); exit(1); } if (fnin) { fin = fopen(fnin, "rb"); if (!fin) { fprintf(stderr, "Can't open input file '%s", fnin); perror("'"); exit(1); } } else fnin = ""; if (fnout) { fout = fopen(fnout, "wb"); if (!fout) { fprintf(stderr, "Can't open input file '%s", fnout); perror("'"); exit(1); } } else fnout = ""; /* send input file to decoder */ jbg85_dec_init(&s, outbuf, outbuflen, line_out, fout); result = JBG_EAGAIN; while ((len = fread(inbuf, 1, inbuflen, fin))) { result = jbg85_dec_in(&s, inbuf, len, &cnt); bytes_read += cnt; while (result == JBG_EOK_INTR) { /* demonstrate decoder interrupt at given line number */ printf("Decoding interrupted after %lu lines and %lu BIE bytes " "... continuing ...\n", s.y, (unsigned long) bytes_read); /* and now continue decoding */ result = jbg85_dec_in(&s, inbuf + cnt, len - cnt, &cnt2); bytes_read += cnt2; cnt += cnt2; } if (result != JBG_EAGAIN) break; } if (ferror(fin)) { fprintf(stderr, "Problem while reading input file '%s", fnin); perror("'"); if (fout != stdout) { fclose(fout); remove(fnout); } exit(1); } if (result == JBG_EAGAIN || result == JBG_EOK_INTR) { /* signal end-of-BIE explicitely */ result = jbg85_dec_end(&s); while (result == JBG_EOK_INTR) { /* demonstrate decoder interrupt at given line number */ printf("Decoding interrupted after %lu lines and %lu BIE bytes " "... continuing ...\n", s.y, (unsigned long) bytes_read); result = jbg85_dec_end(&s); } } if (result != JBG_EOK) { fprintf(stderr, "Problem with input file '%s': %s\n" "(error code 0x%02x, %lu = 0x%04lx BIE bytes " "and %lu pixel rows processed)\n", fnin, jbg85_strerror(result), result, (unsigned long) bytes_read, (unsigned long) bytes_read, s.y); if (fout != stdout) { fclose(fout); /*remove(fnout);*/ } exit(1); } /* do we have to update the image height in the PBM header? */ if (!ypos_error && y_0 != jbg85_dec_getheight(&s)) { if (fsetpos(fout, &ypos) == 0) { fprintf(fout, "%10lu", jbg85_dec_getheight(&s)); /* pad to 10 bytes */ } else { fprintf(stderr, "Problem while updating height in output file '%s", fnout); perror("'"); exit(1); } } /* check for file errors and close fout */ if (ferror(fout) || fclose(fout)) { fprintf(stderr, "Problem while writing output file '%s", fnout); perror("'"); exit(1); } return 0; } jbigkit-2.1/pbmtools/pbm.50000664000307500030750000000617712315071063014155 0ustar mgk25mgk25.TH pbm 5 "27 September 1991" .SH NAME pbm - portable bitmap file format .SH DESCRIPTION The portable bitmap format is a lowest common denominator monochrome file format. .IX "PBM file format" It was originally designed to make it reasonable to mail bitmaps between different types of machines using the typical stupid network mailers we have today. Now it serves as the common language of a large family of bitmap conversion filters. The definition is as follows: .IP - 2 A "magic number" for identifying the file type. A pbm file's magic number is the two characters "P1". .IX "magic numbers" .IP - 2 Whitespace (blanks, TABs, CRs, LFs). .IP - 2 A width, formatted as ASCII characters in decimal. .IP - 2 Whitespace. .IP - 2 A height, again in ASCII decimal. .IP - 2 Whitespace. .IP - 2 Width * height bits, each either '1' or '0', starting at the top-left corner of the bitmap, proceeding in normal English reading order. .IP - 2 The character '1' means black, '0' means white. .IP - 2 Whitespace in the bits section is ignored. .IP - 2 Characters from a "#" to the next end-of-line are ignored (comments). .IP - 2 No line should be longer than 70 characters. .PP Here is an example of a small bitmap in this format: .nf P1 # feep.pbm 24 7 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 1 1 1 1 0 0 1 1 1 1 0 0 1 1 1 1 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 0 1 1 1 0 0 0 1 1 1 0 0 0 1 1 1 0 0 0 1 1 1 1 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 1 1 1 0 0 1 1 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 .fi .PP Programs that read this format should be as lenient as possible, accepting anything that looks remotely like a bitmap. .PP There is also a variant on the format, available by setting the RAWBITS option at compile time. This variant is .IX RAWBITS different in the following ways: .IP - 2 The "magic number" is "P4" instead of "P1". .IP - 2 The bits are stored eight per byte, high bit first low bit last. .IP - 2 No whitespace is allowed in the bits section, and only a single character of whitespace (typically a newline) is allowed after the height. .IP - 2 The files are eight times smaller and many times faster to read and write. .SH "SEE ALSO" atktopbm(1), brushtopbm(1), cmuwmtopbm(1), g3topbm(1), gemtopbm(1), icontopbm(1), macptopbm(1), mgrtopbm(1), pi3topbm(1), xbmtopbm(1), ybmtopbm(1), pbmto10x(1), pnmtoascii(1), pbmtoatk(1), pbmtobbnbg(1), pbmtocmuwm(1), pbmtoepson(1), pbmtog3(1), pbmtogem(1), pbmtogo(1), pbmtoicon(1), pbmtolj(1), pbmtomacp(1), pbmtomgr(1), pbmtopi3(1), pbmtoplot(1), pbmtoptx(1), pbmtox10bm(1), pbmtoxbm(1), pbmtoybm(1), pbmtozinc(1), pbmlife(1), pbmmake(1), pbmmask(1), pbmreduce(1), pbmtext(1), pbmupc(1), pnm(5), pgm(5), ppm(5) .SH AUTHOR Copyright (C) 1989, 1991 by Jef Poskanzer. .\" Permission to use, copy, modify, and distribute this software and its .\" documentation for any purpose and without fee is hereby granted, provided .\" that the above copyright notice appear in all copies and that both that .\" copyright notice and this permission notice appear in supporting .\" documentation. This software is provided "as is" without express or .\" implied warranty. jbigkit-2.1/pbmtools/pbmtojbg.10000664000307500030750000002322712315071063015172 0ustar mgk25mgk25.TH PBMTOJBG 1 "2003-06-04" .SH NAME pbmtojbg \- portable bitmap to JBIG1 file converter .SH SYNOPSIS .B pbmtojbg [ .I options ] [ .I input-file | \- [ .I output-file ]] .br .SH DESCRIPTION Reads in a portable bitmap (PBM) from a file or standard input, compresses it, and outputs the image as a .I JBIG1 bi-level image entity (BIE) file. .I JBIG1 is a highly effective lossless compression algorithm for bi-level images (one bit per pixel), which is particularly suitable for scanned document pages. A .I JBIG1 encoded image can be stored in several resolutions (progressive mode). These resolution layers can be stored all in one single BIE or they can be stored in several separate BIE files. All resolution layers except the lowest one are stored merely as differences to the next lower resolution layer, because this requires less space than encoding the full image completely every time. Each resolution layer has twice the number of horizontal and vertical pixels than the next lower layer. .I JBIG1 files can also store several bits per pixel as separate bitmap planes, and .I pbmtojbg can read a PGM file and transform it into a multi-bitplane BIE. .SH OPTIONS .TP 14 .BI \- A single hyphen instead of an input file name will cause .I pbmtojbg to read the data from standard input instead from a file. .TP .BI \-q Encode the image in one single resolution layer (sequential mode). This is usually the most efficient compression method. By default, the number of resolution layers is chosen automatically such that the lowest layer image is not larger than 640 \(mu 480 pixels. This is a shortcut for .BR "-d 0" . .TP .BI \-x " number" Specify the maximal horizontal size of the lowest resolution layer. The default is 640 pixels. .TP .BI \-y " number" Specify the maximal vertical size of the lowest resolution layer. The default is 480 pixels. .TP .BI \-l " number" Select the lowest resolution layer that will be written to the BIE. It is possible to store the various resolution layers of a .I JBIG1 image in progressive mode into different BIEs. Options .B \-l and .B \-h allow to select the resolution-layer interval that will appear in the created BIE. The lowest resolution layer has number 0 and this is also the default value. By default all layers will be written. .TP .BI \-h " number" Select the highest resolution layer that will be written to the BIE. By default all layers will be written. See also option .BR \-l . .TP .BI \-b Use binary values instead of Gray code words in order to encode pixel values in multiple bitplanes. This option has only an effect if the input is a PGM file and if more than one bitplane is produced. Note that the decoder has to make the same selection but cannot determine from the BIE, whether Gray or binary code words were used by the encoder. .TP .BI \-d " number" Specify the total number of differential resolution layers into which the input image will be split in addition to the lowest layer. Each additional layer reduces the size of layer 0 by 50 %. This option overrides options .BI \-x and .BI \-y which are usually a more comfortable way of selecting the number of resolution layers. .TP .BI \-s " number" The .I JBIG1 algorithm splits each image into a number of horizontal stripes. This option specifies that each stripe shall have .I number lines in layer 0. The default value is selected so that approximately 35 stripes will be used for the whole image. .TP .BI \-m " number" Select the maximum horizontal offset of the adaptive template pixel. The .I JBIG1 encoder uses ten neighbour pixels to estimate the probability of the next pixel being black or white. It can move one out of these ten pixels. This is especially useful for dithered images, as long as the distance of this adaptive pixel can be adjusted to the period of the dither pattern. By default, the adaptive template pixel is allowed to move up to 8 pixels away horizontally. This encoder supports distances up to 127 pixels. Annex A of the standard suggests that decoders should support at least a horizontal distance of 16 pixels, so using values not higher than 16 for .I number might increase the chances of interoperability with other .I JBIG1 implementations. On the other hand, the T.85 fax application profile requires decoders to support horizontal offsets up to 127 pixels, which the maximum value permitted by the standard. (The maximal vertical offset of the adaptive template pixel is always zero for this encoder.) .TP .BI \-t " number" Encode only the specified number of most significant bit planes. This option allows to reduce the depth of an input PGM file if not all bits per pixel are needed in the output. .TP .BI \-o " number" .I JBIG1 separates an image into several horizontal stripes, resolution layers and planes, were each plane contains one bit per pixel. One single stripe in one plane and layer is encoded as a data unit called stripe data entity (SDE) inside the BIE. There are 12 different possible orders in which the SDEs can be stored inside the BIE and .I number selects which one shall be used. The order of the SDEs is only relevant for applications that want to decode a .I JBIG1 file which has not yet completely arrived from e.g. a slow network connection. For instance some applications prefer that the outermost of the three loops (stripes, layers, planes) is over all layers so that all data of the lowest resolution layer is transmitted first. .br The following values for .I number select these loop arrangements for writing the SDEs (outermost loop first): 0 planes, layers, stripes .br 2 layers, planes, stripes .br 3 layers, stripes, planes .br 4 stripes, planes, layers .br 5 planes, stripes, layers .br 6 stripes, layers, planes All loops count starting with zero, however by adding 8 to the above order code, the layer loop can be reversed so that it counts down to zero and then higher resolution layers will be stored before lower layers. Default order is 3 which writes at first all planes of the first stripe and then completes layer 0 before continuing with the next layer and so on. .TP .BI \-p " number" This option allows to activate or deactivate various optional algorithms defined in the .I JBIG1 standard. Just add the numbers of the following options which you want to activate in order to get the .I number value: 4 deterministic prediction (DPON) .br 8 layer 0 typical prediction (TPBON) .br 16 diff. layer typ. pred. (TPDON) .br 64 layer 0 two-line template (LRLTWO) Except for special applications (like communication with .I JBIG1 subset implementations) and for debugging purposes you will normally not want to change anything here. The default is 28, which provides the best compression result. .TP .BI \-C " string" Add the .I string in a comment marker segment to the produced data stream. (There is no support at present for adding comments that contain the zero byte.) .TP .BI \-c Determine the adaptive template pixel movement as suggested in annex C of the standard. By default the template change takes place directly in the next line, which is most effective. However, a few conformance test examples in the standard require the adaptive template change to be delayed until the first line of the next stripe. This option selects this special behavior, which is normally not required except in order to pass some conformance tests. .TP .BI \-r Use the SDRST marker instead of the normal SDNORM marker. The probably only useful application of this option is to generate test data for checking whether a .I JBIG1 decoder has implemented SDRST correctly. In a normal .I JBIG1 data stream, each stripe data entity (SDE) is terminated by an SDNORM marker, which preserves the state of the arithmetic encoder (and more) for the next stripe in the same layer. The alternative SDRST marker resets this state at the end of the stripe. .TP .BI \-Y " number" A long time ago, there were fax machines that couldn't even hold a single page in memory. They had to start transmitting data before the page was scanned in completely and the length of the image was known. The authors of the standard added a rather ugly hack to the otherwise beautiful JBIG1 format to support this. The NEWLEN marker segment can override the image height stated in the BIE header anywhere later in the data stream. Normally .I pbmtojbg never generates NEWLEN marker segments, as it knows the correct image height when it outputs the header. This option is solely intended for the purpose of generating test files with NEWLEN marker segments. It can be used to specify a higher initial image height for use in the BIE header, and .I pbmtojbg will then add a NEWLEN marker segment at the latest possible opportunity to the data stream to signal the correct final height. .TP .BI \-f This option makes the output file comply to the "facsimile application profile" defined in ITU-T Recommendation T.85. It is a shortcut for .BR "-q -o 0 -p 8 -s 128 -t 1 -m 127" . .TP .BI \-v After the BIE has been created, a few technical details of the created file will be listed (verbose mode). .SH BUGS Using standard input and standard output for binary data works only on systems where there is no difference between binary and text streams (e.g., Unix). On other systems (e.g., MS-DOS), using standard input or standard output may cause control characters like CR or LF to be inserted or deleted and this will damage the binary data. .SH STANDARDS This program implements the .I JBIG1 image coding algorithm as specified in ISO/IEC 11544:1993 and ITU-T T.82(1993). .SH AUTHOR The .I pbmtojbg program is part of the .I JBIG-KIT package, which has been developed by Markus Kuhn. The most recent version of this portable .I JBIG1 library and tools set is available from . .SH SEE ALSO pbm(5), pgm(5), jbgtopbm(1) jbigkit-2.1/pbmtools/pbmtojbg.c0000664000307500030750000002745612315071063015264 0ustar mgk25mgk25/* * pbmtojbg - Portable Bitmap to JBIG converter * * Markus Kuhn - http://www.cl.cam.ac.uk/~mgk25/jbigkit/ */ #include #include #include #include #include "jbig.h" char *progname; /* global pointer to argv[0] */ unsigned long total_length = 0; /* used for determining output file length */ /* * Print usage message and abort */ static void usage(void) { fprintf(stderr, "PBMtoJBIG converter " JBG_VERSION " -- " "creates bi-level image entity (BIE) as output file\n\n" "usage: %s [] [ | - []]\n\n" "options:\n\n", progname); fprintf(stderr, " -q\t\tsequential coding, no differential layers (like -d 0)\n" " -x number\tmaximum width of lowest resolution layer (default 640)\n" " -y number\tmaximum height of lowest resolution layer (default 480)\n" " -l number\tlowest layer written to output file (default 0)\n" " -h number\thighest layer written to output file (default max)\n" " -b\t\tuse binary code for multiple bitplanes (default: Gray code)\n" " -d number\ttotal number of differential layers (overrides -x and -y)\n" " -s number\theight of a stripe in layer 0\n"); fprintf(stderr, " -m number\tmaximum adaptive template pixel horizontal offset (default 8)\n" " -t number\tencode only that many most significant planes\n" " -o number\torder byte value: add 1=SMID, 2=ILEAVE, 4=SEQ, 8=HITOLO\n" "\t\t(default 3 = ILEAVE+SMID)\n" " -p number\toptions byte value: add DPON=4, TPBON=8, TPDON=16, LRLTWO=64\n" "\t\t(default 28 = DPON+TPBON+TPDON)\n"); fprintf(stderr, " -C string\tadd the provided string as a comment marker segment\n" " -c\t\tdelay adaptive template changes to first line of next stripe\n" "\t\t(only provided for a conformance test)\n" " -r\t\tterminate each stripe with SDRST marker\n" "\t\t(only intended for decoder testing)\n" ); fprintf(stderr, " -Y number\tannounce in header initially this larger image height\n" "\t\t(only for generating test files with NEWLEN and VLENGTH=1)\n" " -f\t\tchose encoding options for T.85 fax profile complianance\n" " -v\t\tverbose output\n\n"); exit(1); } /* * malloc() with exception handler */ void *checkedmalloc(size_t n) { void *p; if ((p = malloc(n)) == NULL) { fprintf(stderr, "Sorry, not enough memory available!\n"); exit(1); } return p; } /* * Read an ASCII integer number from file f and skip any PBM * comments which are encountered. */ static unsigned long getint(FILE *f) { int c; unsigned long i; while ((c = getc(f)) != EOF && !isdigit(c)) if (c == '#') while ((c = getc(f)) != EOF && !(c == 13 || c == 10)) ; if (c != EOF) { ungetc(c, f); fscanf(f, "%lu", &i); } return i; } /* * Callback procedure which is used by JBIG encoder to deliver the * encoded data. It simply sends the bytes to the output file. */ static void data_out(unsigned char *start, size_t len, void *file) { fwrite(start, len, 1, (FILE *) file); total_length += len; return; } int main (int argc, char **argv) { FILE *fin = stdin, *fout = stdout; const char *fnin = NULL, *fnout = NULL; int i, j, c; int all_args = 0, files = 0; unsigned long x, y; unsigned long width, height, max, v; unsigned long bpl; int bpp, planes, encode_planes = -1; size_t bitmap_size; char type; unsigned char **bitmap, *p, *image; struct jbg_enc_state s; int verbose = 0, delay_at = 0, reset = 0, use_graycode = 1; long mwidth = 640, mheight = 480; int dl = -1, dh = -1, d = -1, mx = -1; unsigned long l0 = 0, y1 = 0; char *comment = NULL; int options = JBG_TPDON | JBG_TPBON | JBG_DPON; int order = JBG_ILEAVE | JBG_SMID; /* parse command line arguments */ progname = argv[0]; for (i = 1; i < argc; i++) { if (!all_args && argv[i][0] == '-') if (argv[i][1] == 0) { if (files++) usage(); } else for (j = 1; j > 0 && argv[i][j]; j++) switch(argv[i][j]) { case '-' : all_args = 1; break; case 0 : if (files++) usage(); break; case 'v': verbose = 1; break; case 'b': use_graycode = 0; break; case 'c': delay_at = 1; break; case 'r': reset = 1; break; case 'f': d = 0; order = 0; options = 8; l0 = 128; encode_planes = 1; mx = 127; break; case 'x': if (++i >= argc) usage(); j = -1; mwidth = atol(argv[i]); break; case 'y': if (++i >= argc) usage(); j = -1; mheight = atol(argv[i]); break; case 'Y': if (++i >= argc) usage(); j = -1; y1 = atol(argv[i]); break; case 'o': if (++i >= argc) usage(); j = -1; order = atoi(argv[i]); break; case 'p': if (++i >= argc) usage(); j = -1; options = atoi(argv[i]); break; case 'l': if (++i >= argc) usage(); j = -1; dl = atoi(argv[i]); break; case 'h': if (++i >= argc) usage(); j = -1; dh = atoi(argv[i]); break; case 'q': d = 0; break; case 'd': if (++i >= argc) usage(); j = -1; d = atoi(argv[i]); break; case 's': if (++i >= argc) usage(); j = -1; l0 = atol(argv[i]); break; case 't': if (++i >= argc) usage(); j = -1; encode_planes = atoi(argv[i]); break; case 'm': if (++i >= argc) usage(); j = -1; mx = atoi(argv[i]); break; case 'C': if (++i >= argc) usage(); j = -1; comment = argv[i]; break; default: usage(); } else switch (files++) { case 0: fnin = argv[i]; break; case 1: fnout = argv[i]; break; default: usage(); } } if (fnin) { fin = fopen(fnin, "rb"); if (!fin) { fprintf(stderr, "Can't open input file '%s", fnin); perror("'"); exit(1); } } else fnin = ""; if (fnout) { fout = fopen(fnout, "wb"); if (!fout) { fprintf(stderr, "Can't open input file '%s", fnout); perror("'"); exit(1); } } else fnout = ""; /* read PBM header */ while ((c = getc(fin)) != EOF && (isspace(c) || c == '#')) if (c == '#') while ((c = getc(fin)) != EOF && !(c == 13 || c == 10)) ; if (c != 'P') { fprintf(stderr, "Input file '%s' does not look like a PBM file!\n", fnin); exit(1); } type = getc(fin); width = getint(fin); height = getint(fin); if (type == '2' || type == '5' || type == '3' || type == '6') max = getint(fin); else max = 1; for (planes = 0, v = max; v; planes++, v >>= 1) ; bpp = (planes + 7) / 8; if (encode_planes < 0 || encode_planes > planes) encode_planes = planes; fgetc(fin); /* skip line feed */ /* read PBM image data */ bpl = (width + 7) / 8; /* bytes per line */ bitmap_size = bpl * (size_t) height; bitmap = (unsigned char **) checkedmalloc(sizeof(unsigned char *) * encode_planes); for (i = 0; i < encode_planes; i++) bitmap[i] = (unsigned char *) checkedmalloc(bitmap_size); switch (type) { case '1': /* PBM text format */ p = bitmap[0]; for (y = 0; y < height; y++) for (x = 0; x <= ((width-1) | 7); x++) { *p <<= 1; if (x < width) *p |= getint(fin) & 1; if ((x & 7) == 7) ++p; } break; case '4': /* PBM raw binary format */ fread(bitmap[0], bitmap_size, 1, fin); break; case '2': case '5': /* PGM */ image = (unsigned char *) checkedmalloc(width * height * bpp); if (type == '2') { for (x = 0; x < width * height; x++) { v = getint(fin); for (j = 0; j < bpp; j++) image[x * bpp + (bpp - 1) - j] = v >> (j * 8); } } else fread(image, width * height, bpp, fin); jbg_split_planes(width, height, planes, encode_planes, image, bitmap, use_graycode); free(image); break; default: fprintf(stderr, "Unsupported PBM type P%c!\n", type); exit(1); } if (ferror(fin)) { fprintf(stderr, "Problem while reading input file '%s", fnin); perror("'"); exit(1); } if (feof(fin)) { fprintf(stderr, "Unexpected end of input file '%s'!\n", fnin); exit(1); } /* Test for valid parameters */ if (width < 1 || height < 1) { fprintf(stderr, "Image dimensions must be positive!\n"); exit(1); } if (encode_planes < 1 || encode_planes > 255) { fprintf(stderr, "Number of planes must be in range 1-255!\n"); exit(1); } /* Test the final byte in each image line for correct zero padding */ if ((width & 7) && type == '4') { for (y = 0; y < height; y++) if (bitmap[0][y * bpl + bpl - 1] & ((1 << (8 - (width & 7))) - 1)) { fprintf(stderr, "Warning: No zero padding in last byte (0x%02x) of " "line %lu!\n", bitmap[0][y * bpl + bpl - 1], y + 1); break; } } /* Apply JBIG algorithm and write BIE to output file */ /* initialize parameter struct for JBIG encoder*/ jbg_enc_init(&s, width, height, encode_planes, bitmap, data_out, fout); /* Select number of resolution layers either directly or based * on a given maximum size for the lowest resolution layer */ if (d >= 0) jbg_enc_layers(&s, d); else jbg_enc_lrlmax(&s, mwidth, mheight); /* Specify a few other options (each is ignored if negative) */ if (delay_at) options |= JBG_DELAY_AT; if (reset) options |= JBG_SDRST; if (comment) { s.comment_len = strlen(comment); s.comment = (unsigned char *) comment; } if (y1) s.yd1 = y1; jbg_enc_lrange(&s, dl, dh); jbg_enc_options(&s, order, options, l0, mx, -1); /* now encode everything and send it to data_out() */ jbg_enc_out(&s); /* give encoder a chance to free its temporary data structures */ jbg_enc_free(&s); /* check for file errors and close fout */ if (ferror(fout) || fclose(fout)) { fprintf(stderr, "Problem while writing output file '%s", fnout); perror("'"); exit(1); } /* In case the user wants to know all the gory details ... */ if (verbose) { fprintf(stderr, "Information about the created JBIG bi-level image entity " "(BIE):\n\n"); fprintf(stderr, " input image size: %lu x %lu pixel\n", s.xd, s.yd); fprintf(stderr, " bit planes: %d\n", s.planes); if (s.planes > 1) fprintf(stderr, " encoding: %s code, MSB first\n", use_graycode ? "Gray" : "binary"); fprintf(stderr, " stripes: %lu\n", s.stripes); fprintf(stderr, " lines per stripe in layer 0: %lu\n", s.l0); fprintf(stderr, " total number of diff. layers: %d\n", s.d); fprintf(stderr, " lowest layer in BIE: %d\n", s.dl); fprintf(stderr, " highest layer in BIE: %d\n", s.dh); fprintf(stderr, " lowest layer size: %lu x %lu pixel\n", jbg_ceil_half(s.xd, s.d - s.dl), jbg_ceil_half(s.yd, s.d - s.dl)); fprintf(stderr, " highest layer size: %lu x %lu pixel\n", jbg_ceil_half(s.xd, s.d - s.dh), jbg_ceil_half(s.yd, s.d - s.dh)); fprintf(stderr, " option bits:%s%s%s%s%s%s%s\n", s.options & JBG_LRLTWO ? " LRLTWO" : "", s.options & JBG_VLENGTH ? " VLENGTH" : "", s.options & JBG_TPDON ? " TPDON" : "", s.options & JBG_TPBON ? " TPBON" : "", s.options & JBG_DPON ? " DPON" : "", s.options & JBG_DPPRIV ? " DPPRIV" : "", s.options & JBG_DPLAST ? " DPLAST" : ""); fprintf(stderr, " order bits:%s%s%s%s\n", s.order & JBG_HITOLO ? " HITOLO" : "", s.order & JBG_SEQ ? " SEQ" : "", s.order & JBG_ILEAVE ? " ILEAVE" : "", s.order & JBG_SMID ? " SMID" : ""); fprintf(stderr, " AT maximum x-offset: %d\n" " AT maximum y-offset: %d\n", s.mx, s.my); fprintf(stderr, " length of output file: %lu byte\n\n", total_length); } return 0; } jbigkit-2.1/pbmtools/pbmtojbg85.c0000664000307500030750000001463312315071063015432 0ustar mgk25mgk25/* * pbmtojbg85 - Portable Bitmap to JBIG converter (T.85 version) * * Markus Kuhn - http://www.cl.cam.ac.uk/~mgk25/jbigkit/ */ #include #include #include #include #include "jbig85.h" char *progname; /* global pointer to argv[0] */ /* * Print usage message and abort */ static void usage(void) { fprintf(stderr, "PBMtoJBIG converter " JBG85_VERSION " (T.85 version) --\n" "creates bi-level image entity (BIE) as output file\n\n" "usage: %s [] [ | - []]\n\n" "options:\n\n", progname); fprintf(stderr, " -s number\theight of a stripe\n"); fprintf(stderr, " -m number\tmaximum adaptive template pixel horizontal offset (default 8)\n" " -p number\toptions byte value: add TPBON=8, LRLTWO=64\n" "\t\t(default 8 = TPBON)\n"); fprintf(stderr, " -C string\tadd the provided string as a comment marker segment\n"); fprintf(stderr, " -Y yi yr\tannounce in header initially the larger image height yi\n" "\t\tand then announce after line yr has been encoded the real height\n" "\t\tusing NEWLEN marker (for testing NEWLEN and VLENGTH=1 function)\n\n"); exit(1); } /* * malloc() with exception handler */ void *checkedmalloc(size_t n) { void *p; if ((p = malloc(n)) == NULL) { fprintf(stderr, "Sorry, not enough memory available!\n"); exit(1); } return p; } /* * Read an ASCII integer number from file f and skip any PBM * comments which are encountered. */ static unsigned long getint(FILE *f) { int c; unsigned long i; while ((c = getc(f)) != EOF && !isdigit(c)) if (c == '#') while ((c = getc(f)) != EOF && !(c == 13 || c == 10)) ; if (c != EOF) { ungetc(c, f); fscanf(f, "%lu", &i); } return i; } /* * Callback procedure which is used by JBIG encoder to deliver the * encoded data. It simply sends the bytes to the output file. */ static void data_out(unsigned char *start, size_t len, void *file) { fwrite(start, len, 1, (FILE *) file); return; } int main (int argc, char **argv) { FILE *fin = stdin, *fout = stdout; const char *fnin = NULL, *fnout = NULL; int i, j, c; int all_args = 0, files = 0; unsigned long x, y; unsigned long width, height; size_t bpl; char type; unsigned char *p, *lines, *next_line; unsigned char *prev_line = NULL, *prevprev_line = NULL; struct jbg85_enc_state s; int mx = -1; unsigned long l0 = 0, yi = 0, yr = 0; char *comment = NULL; int options = JBG_TPBON; /* parse command line arguments */ progname = argv[0]; for (i = 1; i < argc; i++) { if (!all_args && argv[i][0] == '-') if (argv[i][1] == 0) { if (files++) usage(); } else for (j = 1; j > 0 && argv[i][j]; j++) switch(argv[i][j]) { case '-' : all_args = 1; break; case 0 : if (files++) usage(); break; case 'Y': if (i+2 >= argc) usage(); j = -1; yi = atol(argv[++i]); yr = atol(argv[++i]); break; case 'p': if (++i >= argc) usage(); j = -1; options = atoi(argv[i]); break; case 's': if (++i >= argc) usage(); j = -1; l0 = atol(argv[i]); break; case 'm': if (++i >= argc) usage(); j = -1; mx = atoi(argv[i]); break; case 'C': if (++i >= argc) usage(); j = -1; comment = argv[i]; break; default: usage(); } else switch (files++) { case 0: fnin = argv[i]; break; case 1: fnout = argv[i]; break; default: usage(); } } /* open input file */ if (fnin) { fin = fopen(fnin, "rb"); if (!fin) { fprintf(stderr, "Can't open input file '%s", fnin); perror("'"); exit(1); } } else fnin = ""; /* read PBM header */ while ((c = getc(fin)) != EOF && (isspace(c) || c == '#')) if (c == '#') while ((c = getc(fin)) != EOF && !(c == 13 || c == 10)) ; type = getc(fin); if (c != 'P' || (type != '1' && type != '4')) { fprintf(stderr, "Input file '%s' does not look like a PBM file!\n", fnin); exit(1); } width = getint(fin); height = getint(fin); fgetc(fin); /* skip line feed */ /* Test for valid parameters */ if (width < 1 || height < 1) { fprintf(stderr, "Image dimensions must be positive!\n"); exit(1); } /* allocate buffer for a single image line */ bpl = (width >> 3) + !!(width & 7); /* bytes per line */ lines = (unsigned char *) checkedmalloc(bpl * 3); /* open output file */ if (fnout) { fout = fopen(fnout, "wb"); if (!fout) { fprintf(stderr, "Can't open input file '%s", fnout); perror("'"); exit(1); } } else fnout = ""; /* initialize parameter struct for JBIG encoder*/ jbg85_enc_init(&s, width, yi ? yi : height, data_out, fout); /* Specify a few other options (each is ignored if negative) */ if (yi) options |= JBG_VLENGTH; if (comment) { s.comment_len = strlen(comment); s.comment = (unsigned char *) comment; } jbg85_enc_options(&s, options, l0, mx); for (y = 0; y < height; y++) { /* Use a 3-line ring buffer, because the encoder requires that the two * previously supplied lines are still in memory when the next line is * processed. */ next_line = lines + (y%3)*bpl; switch (type) { case '1': /* PBM text format */ p = next_line; for (x = 0; x <= ((width-1) | 7); x++) { *p <<= 1; if (x < width) *p |= getint(fin) & 1; if ((x & 7) == 7) ++p; } break; case '4': /* PBM raw binary format */ fread(next_line, bpl, 1, fin); break; default: fprintf(stderr, "Unsupported PBM type P%c!\n", type); exit(1); } if (ferror(fin)) { fprintf(stderr, "Problem while reading input file '%s", fnin); perror("'"); exit(1); } if (feof(fin)) { fprintf(stderr, "Unexpected end of input file '%s'!\n", fnin); exit(1); } /* JBIG compress another line and write out result via callback */ jbg85_enc_lineout(&s, next_line, prev_line, prevprev_line); prevprev_line = prev_line; prev_line = next_line; /* adjust final image height via NEWLEN */ if (yi && y == yr) jbg85_enc_newlen(&s, height); } /* check for file errors and close fout */ if (ferror(fout) || fclose(fout)) { fprintf(stderr, "Problem while writing output file '%s", fnout); perror("'"); exit(1); } return 0; } jbigkit-2.1/pbmtools/pgm.50000664000307500030750000000622612315071063014155 0ustar mgk25mgk25.TH pgm 5 "12 November 1991" .SH NAME pgm - portable graymap file format .SH DESCRIPTION The portable graymap format is a lowest common denominator grayscale file format. .IX "PGM file format" The definition is as follows: .IP - 2 A "magic number" for identifying the file type. A pgm file's magic number is the two characters "P2". .IX "magic numbers" .IP - 2 Whitespace (blanks, TABs, CRs, LFs). .IP - 2 A width, formatted as ASCII characters in decimal. .IP - 2 Whitespace. .IP - 2 A height, again in ASCII decimal. .IP - 2 Whitespace. .IP - 2 The maximum gray value, again in ASCII decimal. .IP - 2 Whitespace. .IP - 2 Width * height gray values, each in ASCII decimal, between 0 and the specified maximum value, separated by whitespace, starting at the top-left corner of the graymap, proceeding in normal English reading order. A value of 0 means black, and the maximum value means white. .IP - 2 Characters from a "#" to the next end-of-line are ignored (comments). .IP - 2 No line should be longer than 70 characters. .PP Here is an example of a small graymap in this format: .nf P2 # feep.pgm 24 7 15 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 3 3 3 0 0 7 7 7 7 0 0 11 11 11 11 0 0 15 15 15 15 0 0 3 0 0 0 0 0 7 0 0 0 0 0 11 0 0 0 0 0 15 0 0 15 0 0 3 3 3 0 0 0 7 7 7 0 0 0 11 11 11 0 0 0 15 15 15 15 0 0 3 0 0 0 0 0 7 0 0 0 0 0 11 0 0 0 0 0 15 0 0 0 0 0 3 0 0 0 0 0 7 7 7 7 0 0 11 11 11 11 0 0 15 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 .fi .PP Programs that read this format should be as lenient as possible, accepting anything that looks remotely like a graymap. .PP There is also a variant on the format, available by setting the RAWBITS option at compile time. This variant is different in the following ways: .IX RAWBITS .IP - 2 The "magic number" is "P5" instead of "P2". .IP - 2 The gray values are stored as plain bytes, instead of ASCII decimal. .IP - 2 No whitespace is allowed in the grays section, and only a single character of whitespace (typically a newline) is allowed after the maxval. .IP - 2 The files are smaller and many times faster to read and write. .PP Note that this raw format can only be used for maxvals less than or equal to 255. If you use the .I pgm library and try to write a file with a larger maxval, it will automatically fall back on the slower but more general plain format. .SH "SEE ALSO" fitstopgm(1), fstopgm(1), hipstopgm(1), lispmtopgm(1), psidtopgm(1), rawtopgm(1), pgmbentley(1), pgmcrater(1), pgmedge(1), pgmenhance(1), pgmhist(1), pgmnorm(1), pgmoil(1), pgmramp(1), pgmtexture(1), pgmtofits(1), pgmtofs(1), pgmtolispm(1), pgmtopbm(1), pnm(5), pbm(5), ppm(5) .SH AUTHOR Copyright (C) 1989, 1991 by Jef Poskanzer. .\" Permission to use, copy, modify, and distribute this software and its .\" documentation for any purpose and without fee is hereby granted, provided .\" that the above copyright notice appear in all copies and that both that .\" copyright notice and this permission notice appear in supporting .\" documentation. This software is provided "as is" without express or .\" implied warranty. jbigkit-2.1/pbmtools/pbmtojbg.txt0000664000307500030750000003164312315071210015644 0ustar mgk25mgk25PBMTOJBG(1) PBMTOJBG(1) NAME pbmtojbg - portable bitmap to JBIG1 file converter SYNOPSIS pbmtojbg [ options ] [ input-file | - [ output-file ]] DESCRIPTION Reads in a portable bitmap (PBM) from a file or standard input, com- presses it, and outputs the image as a JBIG1 bi-level image entity (BIE) file. JBIG1 is a highly effective lossless compression algorithm for bi-level images (one bit per pixel), which is particularly suitable for scanned document pages. A JBIG1 encoded image can be stored in several resolutions (progressive mode). These resolution layers can be stored all in one single BIE or they can be stored in several separate BIE files. All resolution lay- ers except the lowest one are stored merely as differences to the next lower resolution layer, because this requires less space than encoding the full image completely every time. Each resolution layer has twice the number of horizontal and vertical pixels than the next lower layer. JBIG1 files can also store several bits per pixel as separate bitmap planes, and pbmtojbg can read a PGM file and transform it into a multi- bitplane BIE. OPTIONS - A single hyphen instead of an input file name will cause pbmtojbg to read the data from standard input instead from a file. -q Encode the image in one single resolution layer (sequen- tial mode). This is usually the most efficient compres- sion method. By default, the number of resolution layers is chosen automatically such that the lowest layer image is not larger than 640 x 480 pixels. This is a shortcut for -d 0. -x number Specify the maximal horizontal size of the lowest resolu- tion layer. The default is 640 pixels. -y number Specify the maximal vertical size of the lowest resolu- tion layer. The default is 480 pixels. -l number Select the lowest resolution layer that will be written to the BIE. It is possible to store the various resolu- tion layers of a JBIG1 image in progressive mode into different BIEs. Options -l and -h allow to select the resolution-layer interval that will appear in the created BIE. The lowest resolution layer has number 0 and this is also the default value. By default all layers will be written. -h number Select the highest resolution layer that will be written to the BIE. By default all layers will be written. See also option -l. -b Use binary values instead of Gray code words in order to encode pixel values in multiple bitplanes. This option has only an effect if the input is a PGM file and if more than one bitplane is produced. Note that the decoder has to make the same selection but cannot determine from the BIE, whether Gray or binary code words were used by the encoder. -d number Specify the total number of differential resolution lay- ers into which the input image will be split in addition to the lowest layer. Each additional layer reduces the size of layer 0 by 50 %. This option overrides options -x and -y which are usually a more comfortable way of selecting the number of resolution layers. -s number The JBIG1 algorithm splits each image into a number of horizontal stripes. This option specifies that each stripe shall have number lines in layer 0. The default value is selected so that approximately 35 stripes will be used for the whole image. -m number Select the maximum horizontal offset of the adaptive tem- plate pixel. The JBIG1 encoder uses ten neighbour pixels to estimate the probability of the next pixel being black or white. It can move one out of these ten pixels. This is especially useful for dithered images, as long as the distance of this adaptive pixel can be adjusted to the period of the dither pattern. By default, the adaptive template pixel is allowed to move up to 8 pixels away horizontally. This encoder supports distances up to 127 pixels. Annex A of the standard suggests that decoders should support at least a horizontal distance of 16 pix- els, so using values not higher than 16 for number might increase the chances of interoperability with other JBIG1 implementations. On the other hand, the T.85 fax applica- tion profile requires decoders to support horizontal off- sets up to 127 pixels, which the maximum value permitted by the standard. (The maximal vertical offset of the adaptive template pixel is always zero for this encoder.) -t number Encode only the specified number of most significant bit planes. This option allows to reduce the depth of an input PGM file if not all bits per pixel are needed in the output. -o number JBIG1 separates an image into several horizontal stripes, resolution layers and planes, were each plane contains one bit per pixel. One single stripe in one plane and layer is encoded as a data unit called stripe data entity (SDE) inside the BIE. There are 12 different possible orders in which the SDEs can be stored inside the BIE and number selects which one shall be used. The order of the SDEs is only relevant for applications that want to decode a JBIG1 file which has not yet completely arrived from e.g. a slow network connection. For instance some applications prefer that the outermost of the three loops (stripes, layers, planes) is over all layers so that all data of the lowest resolution layer is transmitted first. The following values for number select these loop arrangements for writing the SDEs (outermost loop first): 0 planes, layers, stripes 2 layers, planes, stripes 3 layers, stripes, planes 4 stripes, planes, layers 5 planes, stripes, layers 6 stripes, layers, planes All loops count starting with zero, however by adding 8 to the above order code, the layer loop can be reversed so that it counts down to zero and then higher resolution layers will be stored before lower layers. Default order is 3 which writes at first all planes of the first stripe and then completes layer 0 before continuing with the next layer and so on. -p number This option allows to activate or deactivate various optional algorithms defined in the JBIG1 standard. Just add the numbers of the following options which you want to activate in order to get the number value: 4 deterministic prediction (DPON) 8 layer 0 typical prediction (TPBON) 16 diff. layer typ. pred. (TPDON) 64 layer 0 two-line template (LRLTWO) Except for special applications (like communication with JBIG1 subset implementations) and for debugging purposes you will normally not want to change anything here. The default is 28, which provides the best compression result. -C string Add the string in a comment marker segment to the pro- duced data stream. (There is no support at present for adding comments that contain the zero byte.) -c Determine the adaptive template pixel movement as sug- gested in annex C of the standard. By default the tem- plate change takes place directly in the next line, which is most effective. However, a few conformance test exam- ples in the standard require the adaptive template change to be delayed until the first line of the next stripe. This option selects this special behavior, which is nor- mally not required except in order to pass some confor- mance tests. -r Use the SDRST marker instead of the normal SDNORM marker. The probably only useful application of this option is to generate test data for checking whether a JBIG1 decoder has implemented SDRST correctly. In a normal JBIG1 data stream, each stripe data entity (SDE) is terminated by an SDNORM marker, which preserves the state of the arith- metic encoder (and more) for the next stripe in the same layer. The alternative SDRST marker resets this state at the end of the stripe. -Y number A long time ago, there were fax machines that couldn't even hold a single page in memory. They had to start transmitting data before the page was scanned in com- pletely and the length of the image was known. The authors of the standard added a rather ugly hack to the otherwise beautiful JBIG1 format to support this. The NEWLEN marker segment can override the image height stated in the BIE header anywhere later in the data stream. Normally pbmtojbg never generates NEWLEN marker segments, as it knows the correct image height when it outputs the header. This option is solely intended for the purpose of generating test files with NEWLEN marker segments. It can be used to specify a higher initial image height for use in the BIE header, and pbmtojbg will then add a NEWLEN marker segment at the latest possible opportunity to the data stream to signal the correct final height. -f This option makes the output file comply to the "facsim- ile application profile" defined in ITU-T Recommendation T.85. It is a shortcut for -q -o 0 -p 8 -s 128 -t 1 -m 127. -v After the BIE has been created, a few technical details of the created file will be listed (verbose mode). BUGS Using standard input and standard output for binary data works only on systems where there is no difference between binary and text streams (e.g., Unix). On other systems (e.g., MS-DOS), using standard input or standard output may cause control characters like CR or LF to be inserted or deleted and this will damage the binary data. STANDARDS This program implements the JBIG1 image coding algorithm as specified in ISO/IEC 11544:1993 and ITU-T T.82(1993). AUTHOR The pbmtojbg program is part of the JBIG-KIT package, which has been developed by Markus Kuhn. The most recent version of this portable JBIG1 library and tools set is available from . SEE ALSO pbm(5), pgm(5), jbgtopbm(1) 2003-06-04 PBMTOJBG(1) jbigkit-2.1/pbmtools/jbgtopbm.txt0000664000307500030750000001063112315071210015636 0ustar mgk25mgk25JBGTOPBM(1) JBGTOPBM(1) NAME jbgtopbm - JBIG1 to portable bitmap file converter SYNOPSIS jbgtopbm [ options ] [ input-file | - [ output-file ]] DESCRIPTION Reads in a JBIG1 bi-level image entity (BIE) from a file or standard input, decompresses it, and outputs a portable bitmap (PBM) file. JBIG1 is a highly effective lossless compression algorithm for bi-level images (one bit per pixel), which is particularly suitable for scanned document pages. A JBIG1 encoded image can be stored in several resolutions in one or several BIEs. All resolution layers except the lowest one are stored efficiently as differences to the next lower resolution layer. Options -x and -y can be used to stop the decompression at a specified maximal output image size. With option -m the input file can consist of multi- ple concatenated BIEs which contain different increasing resolution layers of the same image. If more than one bit per pixel is stored in the JBIG1 file, then a PGM file will be produced. OPTIONS - A single hyphen instead of an input file name will cause jbgtopbm to read the data from standard input instead from a file. -x number Decode only up to the largest resolution layer which is still not more than number pixels wide. If no such reso- lution layer exists, then use the smallest one available. -y number Decode only up to the largest resolution layer which is still not more than number pixels high. If no such reso- lution layer exists, then use the smallest one available. Options -x and -y can also be used together in which case the largest layer that satisfies both limits will be selected. -m Process multiple concatenated BIEs. If there are bytes left after the final SDE in the first BIE, then with this option jbgtopbm will attempt to decode these as the start of another BIE that may contain higher resolution data. Normally, any remaining bytes will generate a warning message. -b Use binary values instead of Gray code words in order to decode pixel values from multiple bitplanes. This option has only an effect if the input has more than one bit- plane and a PGM output file is produced. Note that the decoder has to be used in the same mode as the encoder and cannot determine from the BIE, whether Gray or binary code words were used by the encoder. -d Diagnose a single BIE. With this option, jbgtopbm will print a summary of the header information found in the input file, followed by a list of all PSCD and ESC marker sequences encountered until the end of the file is reached. -p number If the input contains multiple bitplanes, then extract only the specified single plane as a PBM file. The first plane has number 0. BUGS Using standard input and standard output for binary data works only on systems where there is no difference between binary and text streams (e.g., Unix). On other systems (e.g., MS-DOS), using standard input or standard output may cause control characters like CR or LF to be inserted or deleted and this will damage the binary data. STANDARDS This program implements the JBIG1 image coding algorithm as specified in ISO/IEC 11544:1993 and ITU-T T.82(1993). AUTHOR The jbgtopbm program is part of the JBIG-KIT package, which has been developed by Markus Kuhn. The most recent version of this portable JBIG1 library and tools set is available from . SEE ALSO pbm(5), pgm(5), pbmtojbg(1) 2003-06-04 JBGTOPBM(1) jbigkit-2.1/pbmtools/pbm.txt0000664000307500030750000000621612315071210014614 0ustar mgk25mgk25pbm(5) pbm(5) NAME pbm - portable bitmap file format DESCRIPTION The portable bitmap format is a lowest common denominator monochrome file format. It was originally designed to make it reasonable to mail bitmaps between different types of machines using the typical stupid network mailers we have today. Now it serves as the common language of a large family of bitmap conversion filters. The definition is as fol- lows: - A "magic number" for identifying the file type. A pbm file's magic number is the two characters "P1". - Whitespace (blanks, TABs, CRs, LFs). - A width, formatted as ASCII characters in decimal. - Whitespace. - A height, again in ASCII decimal. - Whitespace. - Width * height bits, each either '1' or '0', starting at the top-left corner of the bitmap, proceeding in normal English reading order. - The character '1' means black, '0' means white. - Whitespace in the bits section is ignored. - Characters from a "#" to the next end-of-line are ignored (comments). - No line should be longer than 70 characters. Here is an example of a small bitmap in this format: P1 # feep.pbm 24 7 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 1 1 1 1 0 0 1 1 1 1 0 0 1 1 1 1 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 0 1 1 1 0 0 0 1 1 1 0 0 0 1 1 1 0 0 0 1 1 1 1 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 1 1 1 0 0 1 1 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Programs that read this format should be as lenient as possible, accepting anything that looks remotely like a bitmap. There is also a variant on the format, available by setting the RAWBITS option at compile time. This variant is different in the following ways: - The "magic number" is "P4" instead of "P1". - The bits are stored eight per byte, high bit first low bit last. - No whitespace is allowed in the bits section, and only a single char- acter of whitespace (typically a newline) is allowed after the height. - The files are eight times smaller and many times faster to read and write. SEE ALSO atktopbm(1), brushtopbm(1), cmuwmtopbm(1), g3topbm(1), gemtopbm(1), icontopbm(1), macptopbm(1), mgrtopbm(1), pi3topbm(1), xbmtopbm(1), ybm- topbm(1), pbmto10x(1), pnmtoascii(1), pbmtoatk(1), pbmtobbnbg(1), pbm- tocmuwm(1), pbmtoepson(1), pbmtog3(1), pbmtogem(1), pbmtogo(1), pbmto- icon(1), pbmtolj(1), pbmtomacp(1), pbmtomgr(1), pbmtopi3(1), pbmto- plot(1), pbmtoptx(1), pbmtox10bm(1), pbmtoxbm(1), pbmtoybm(1), pbmtoz- inc(1), pbmlife(1), pbmmake(1), pbmmask(1), pbmreduce(1), pbmtext(1), pbmupc(1), pnm(5), pgm(5), ppm(5) AUTHOR Copyright (C) 1989, 1991 by Jef Poskanzer. 27 September 1991 pbm(5) jbigkit-2.1/pbmtools/pgm.txt0000664000307500030750000000623012315071210014615 0ustar mgk25mgk25pgm(5) pgm(5) NAME pgm - portable graymap file format DESCRIPTION The portable graymap format is a lowest common denominator grayscale file format. The definition is as follows: - A "magic number" for identifying the file type. A pgm file's magic number is the two characters "P2". - Whitespace (blanks, TABs, CRs, LFs). - A width, formatted as ASCII characters in decimal. - Whitespace. - A height, again in ASCII decimal. - Whitespace. - The maximum gray value, again in ASCII decimal. - Whitespace. - Width * height gray values, each in ASCII decimal, between 0 and the specified maximum value, separated by whitespace, starting at the top-left corner of the graymap, proceeding in normal English reading order. A value of 0 means black, and the maximum value means white. - Characters from a "#" to the next end-of-line are ignored (comments). - No line should be longer than 70 characters. Here is an example of a small graymap in this format: P2 # feep.pgm 24 7 15 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 3 3 3 0 0 7 7 7 7 0 0 11 11 11 11 0 0 15 15 15 15 0 0 3 0 0 0 0 0 7 0 0 0 0 0 11 0 0 0 0 0 15 0 0 15 0 0 3 3 3 0 0 0 7 7 7 0 0 0 11 11 11 0 0 0 15 15 15 15 0 0 3 0 0 0 0 0 7 0 0 0 0 0 11 0 0 0 0 0 15 0 0 0 0 0 3 0 0 0 0 0 7 7 7 7 0 0 11 11 11 11 0 0 15 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Programs that read this format should be as lenient as possible, accepting anything that looks remotely like a graymap. There is also a variant on the format, available by setting the RAWBITS option at compile time. This variant is different in the following ways: - The "magic number" is "P5" instead of "P2". - The gray values are stored as plain bytes, instead of ASCII decimal. - No whitespace is allowed in the grays section, and only a single character of whitespace (typically a newline) is allowed after the maxval. - The files are smaller and many times faster to read and write. Note that this raw format can only be used for maxvals less than or equal to 255. If you use the pgm library and try to write a file with a larger maxval, it will automatically fall back on the slower but more general plain format. SEE ALSO fitstopgm(1), fstopgm(1), hipstopgm(1), lispmtopgm(1), psidtopgm(1), rawtopgm(1), pgmbentley(1), pgmcrater(1), pgmedge(1), pgmenhance(1), pgmhist(1), pgmnorm(1), pgmoil(1), pgmramp(1), pgmtexture(1), pgmtofits(1), pgmtofs(1), pgmtolispm(1), pgmtopbm(1), pnm(5), pbm(5), ppm(5) AUTHOR Copyright (C) 1989, 1991 by Jef Poskanzer. 12 November 1991 pgm(5)

700Qr:suű'Z~qGsڒT3⊄g5#n*QgB˛<]6'RJ߷wܸna-Tx9e9q1{ /؀RV9̿*o\xQ'*W^_]BRX~j,:wҦRJLNJ%xY<e1~IN9|}B@r|$q{40 ş=G)E/GBYus'87\>Bz+WT(8:lQ$xAV⎮U[5Kb,6hzA%bZ1|gIQ5 ac&9ZϵL^*ezCsՏ\g :/$2W7F4xA^r|1c惈CBއhKbftӥթ\1o5tm=;t?Bf!YP/?͛0/Kw5&jH!9-t'<@65g;h v_PBmĆB;SVDP uiH:ZSSM! 0լץWyk5*_SƗ; ZNӪ풀>cӏB9x?8lE_@zBqF54X5ݏ< {I(Uwū:7Mg*:ߕa74:&>SE6^謕+Fyž8yRxaObCoF΋(N@l#BH/żNA _6y.|/'4tߟ` &nߵnR'ҞCX3Mq;(:Q'au\W%BqgnnC4a C*K&Z9HA7Sգ\1,iu'{}xȓIGB<F3F+sWO-@o!iRu(kodu‏R[bʊL);>ʊZR"$Nu?6u> Xp46Zb{Ԛ{Y#+%0MZHt-!4Jsg'=YȂ,%e~ nґ1A$+y-FUEWzK (,@^iʍY m=/*B\S9ǨV֪i%$F'Ķ4qs*x4S"ۅO]@XpUws@SKZĪ6 ?PRy^ݧ|2j=Tekx@]L҈#6 8u8 k,zMCIqJ[nJVr{,.d30" o^_Or) g镫A^ZcQ?УkԬ` gN&W,;uW/M*3X-!=w4SXGyLˁִ2Hܝ7(a R﬌T^!64&. d6[ ~¡*$25%ɴ[dPu:q3MK&5@}>%Ue-. d窰5yJr@We-ozx0v. > 9:f|'Cvtuċ4{1҅j-FaBh`'kCu1O:="ttn8h](uTGWl\)HTgKų̨6\!aC4ƴY1 Y> U */W_ЌTBBR#3cL7N?PBBb-LVTfuW$<>e*{'زA&hދzxKu*Dm-&HT%gRhj5vj3mD| p%p0 :sM@ß+3#-8]xZZsfxO1@3{+T[C'#?Sw8qR,u{ YJָ&$#9=: 읍ғj~u{23spu*ÂAE󒛃PCBS7AjN w#uqWW^wK }/[cO4WܼhltMQCx`09{/6LP[ ݳ;D27źa9r{_D#,8< "oK%jqLz}#D5yʑMu^bM$\`KF*V@lIcM%>_&a9"2J!S^ s?<`~]]c3Gq@QR4jL>}r/ 5y T jQj#^dQ|P4*i+>yЦ8$GgB brN " 7Lz(|ToHU@YL:<+/V/E-fi3ㅗ9cVS`wKmq<10<$(AvD[&(Ԁδ+кK,tjlsB{wgaWmF4).9Yi%kl\(s4s5*bHRXgh/2;ҴhP"u ww9l sr2fDHQO!=81>$y|9|FnRykΧ^hp{<sl=,2lL"9Jfe@?Շ R{w-/+K4ShHIb_f~g(3po|!/'inu 5\[>$aY&FnVP~lvr"Z_K:k- *Ӧg j4" شu7vAF)tC~>E [!ƕq dht1 [XzCGJ֋ځ0B-oZes"H)LEX@[EK^%YkGt `vtYc%.CD¹s:gvw_d9 KjjHfSpcQ)Mj[54GxD+&rV ^1Шt.٦7x=;Iwm,{ZS]ը̂q<0 קj~]zc'0EU $2,,`㉜/j~F}MEdH/ Eg|zdePְ:Le-U7ČyT;O)Tim Ieiv4Ӡt"+J;WGJVvY9g=6N@ѡAj8 S,Ϗ,D,Fz2J]n땢>sX!2nL3K8@fU藞O. xnFSxS9 U$\A4eLnOC[ _6iҵWaOZZz7QX7}H7plKzTD7AP XޕSJ4Q?<58'[reJB*c:Ѩn jϚV%%/C8UWeç~Ε=V풿 ~-rFG=`{(t@cYqrX+-Tu2}We!w Q c $ZTE ϶G16M*XqUFCվdȾ-Zi㟒 xK8&,IuᮕN%Z|I\[]L/P|wdf3=8t:C h*^:o6 K"fg>ŵwzS\KDۚP%CU䤁.auhw6CK@XeM01KԺrQ%K }"79>4g ҃R%>avw%vɔ&'S W01xecR\.rKHX$QD*fC !ި_݇b2~7Oۗw-TO$D8^k!;W885vɜ9+RPJQo@"Y*QKl2EaVi ZbʥErk> ę gFH_vS-N2R4TIb*jd ?Mm9]*sCS(8j ]ƑǘqhVkj͞U5Aޞˉ" A"OӉAR&t-4 ʼn> xL^dg 2m6@Ld[T:.{x)/;g%b(0\z򍡯9\:yeѣPifMVvWVrU Ok[?|ZW%7|/\mi0Lh|AWѧb@.nQg(WIQ>mnKHHvxn"W);b6y3M.: aL}|׉Y|ph훼}9m)iUr Ҧ EI65c #U]^<2_8}I/YY\!lW,3K]?^%R>y3&cU2%aa"w к.yu|s4~٭r%ڣBoH yI `fgT6+D&Rl؛GBq=xҪ Bz7P!F:ja>ԓY^X?$c߰ {Nܔ4u1jDGS|{3bl/Z4'*4ٷoOF{ rc <+פq(KC$CI]Eg]vF쩄d !ouLߵ X25u]ਧmhG y?Ѣ#Gj,0'c`hE8=پu]xpkk,܃ ?FX>6X %@ 8p@ԓڻ Hu z!bEx %DP{ /}9{uFD53N16 ա2M2.BnIX4S`u=ȮOdx^9(: eU,/C5ߔ A2#cqasʭ{"-_ ԖֺJ<C2 C )5}$`ExBp=rkn,zJҧ0w7'w{ <lƋ{Mۃ$elO:'OurE P Etqs]֦x;O޵p,?x';$S=%n앹KG+VZn/{n3tcD|9cE(neRvDJȉ|Ć3iq5*-\k1~qY{r{?ǯ{m.KHdvC".JLrP.$`rПcȑ,,d.OY$0~KZfA-bh d̟jW)d5pET i1e `>dߞ-XAVDW8\3G}IEi4w0!r 0y t'PL|>6Ӊ{0 Þ,êvLʣ{(!ȀqϵoYz>xsm![ԅET;DRKVYVePFBe%=1ZUk#è%Ύio"v\OO7fy /!bI nfm=9Rў!|FVHb u/aceal%启A3ˀR&)ӶS5(KY!f+f6Qlu6Nd]KC߄ kHw '[|QTAV"T:{oy+Ԝ!y{'޻,LI7~=t3<رUPH<+V:'\skdhiALU]o/aJ22h0_(ꏠi2w*H=^|n<ّy9Y'ljbU';rIQD- DzԘmw%S[M*Vۑ\_ Mi&=.i;ܤQС2GdQsv(eSعVNZ(qeKX,aB\`GYueE/O-Yc-}'RBوVdԙ)9{Hv"7l5Hh.%tkE_0VKI$J JTFXWMD g:<0K6ED?2ߓ `Geij_P3݀+!e!cdŐʪMѭ6_Z bO݈o.067Q7`]Sdx{@u%l2OTW?LF1k<?QRʳ x6@ tW],a_ H-* xk_s?Zn(пO&@˻-0chZ8^f+yj{Z݁y+]}>lEArm仱.]lMm`m_VTά"B1gs0zE~lz]Trfd0zE$M-\g]S+9ЦRCa"xGF\>`Wqoʑ-9+.) <S ,jt_QХӂ&>l L?w߃Y=w.4Mdd"$:;38~T2Pl,0&ZZGߊ[n$"iyQW~L W8#^LO|#!'g%ӹAn4=ercE[]B$Di2OW/^]ɽ/>涕7YBv,y2NeH5] V(f(kK>Qwu@|JgcW%)!c^sU}L-:fJcR^߻1M$g`N+'#̛B^$`YqsѠLI:53?g]|4 T_hm[HdʡdeսW=yD|]0pg.nn OOf^JѴz$F{&'w]|4F!Fԛ^ 7qВ'8,0 q'F?C{^^~ Ɗ{@6~z޸>QCytf!G\\`B3O@ 7d|F3.xKCtB~Nj}=.A伓Y*BWPaSRЧ܂5X77,׿$BF583 yr82ߋX`θ㳌`ߞ!";,s_D1[g7|<%X掤M GIa _nb\"NFg;6~8ԂWkU ^`4%Wrys3LqjM=XҬ4e Y&g=,l s~E~DK9I53LYU@#Ҿ]ЩY0heRm |qaɁ7ֱctҿbs9y[/ޜ wwUj#rn꺗)U)iɛ='E~x\E%Lhëz~t5=?l1E>$DXo©;D"Wpzq#s!f'g7(S-{#|4SX)3b  ~&%ً?z2GA^l^ Ff۝pp!,D ibBkjH^,DKVg02^;(i;& tkhPE{z_U.u˵2J`x-7ol]p; r&tL!4,K{Աiۃ-暨Joˆ8U"QuXlyHcmK))ƍ#m^pħċeD,rX#3.J?/彜 q-&dO\fx[}fɲ >jWݫg%yj$v;x7sk)c$2ƪGfÕ:=+ޫ H聯-g mE=[`9TJq#Zb杨 :m3n  U#%|.j@"^k+> K6zk7ie8OftmwJ[z:5n"nO j"K O4{q3[I%Xv3[Fa^wIpgV*Y]K&y&Hr&jVamntSS5o ?L((?j_2`e:vۼɍ/#SJ_' +Z/+,Sp Z$8eΎw73rӵ!Jc ٧=;`qȹ1kS\` &rEO ?%پ"x{fN5 S \NG,{P=f)9l1-ޖ/.];Cַ#w{NT6:3ĺ؃2d  ]~SWӉ4!N;;f۹/͹(0i4&[i"9םXhwYSSy]h\ktjİ| QaDX#`A@[ 4zT8 ßz`Х+%&lo47Ȅޔ`cR(L7x%!qlƫ]RS$߆bg0FO$x+dݗ9l`ΆUBV0.8ՇQ&<=2*mF"8;%9-G i~&S`prU=skAQ 2Z[Qn[giݏњV޴'c/.A3'ݝ/a[LN}/@#~hWve%rj5zDzxb2(\{Cp֗ 761# j7C厔Ow!.{*+϶G>kĻs\OTŠi\:6mhU&WVus\z7[C[dֈT EֻA$4aKR$*sm$mpcH{@{%F7l_ym?4_e\ %"%/$]'L ,JJ@nn}y%ԨN7`[ &^axpN!a ZPjbigkit-2.1/examples/ccitt5.jbg0000664000307500030750000006667412315071063015157 0ustar mgk25mgk25 HX Ċ2A-fBܕhg1Q~1y=ҔxѤyտ</X="`/+_b /` VC-wc'x͈#/vlAr8KPJZ*+ڬJ# C>K./(PrKو3ZKwJdZ]Fnl0nYE7UzSTcTꌓK|nt-.p ӽP옽)*B.' ,L#Ϸ C $Z,E[%-1kTP7 . aA!q٩jp&N  :# Eh2kJ ƣL1˿q '9O .Hy,Odrku=$u{@t:Ea=wȬn /N=J 0{/|!V~l9u"|n 4+6԰HD ]mQJ޲ўVnC!M%b@c :/Zu1 %h\9Fl o,ػh,l?|q6CA 4"(C/# %xy(7Zl QӨJ#j ֍(sBL@ ٦ܜIH*ylVd!rrXPԭW{"%s vpW+Rd=sxʛ mc0}LVLT\A~ඝQV"(& X.OW}ݣ$ߠN ,X 7=zJ`Jwv*^lp/3^D&,2p,rL"묱3F׶]:> xk}7=~osA|, vac$聢CLVg𛯹C`JnV (,R=%Os#% vΎWӁM{nD.qC~/02) =]mx`PRvȆ&d[א#U/؉wV\l:E0X@4m`W: j0a _`7 &BOh{M+'ʌ#0f{~1bIj]/|pUrɪ`X!|<z iF&gl8j]$-UFKnjؐM3ҕ0I3cƞ257CEa7}Q~vA܇7mTss41wn:1sBd@bN-I dFF쾠޴SrF8:F {\ h=WQ8W߫6N+Pg'oBXX2I lCRD E9|ur̃Bt{**:(=]JЈu^q|Լ8|&qY#TtW;_Y۝MouxE|_4m/J~TE B}MUv}<O@:3yp2nGs@}u UZ`ﵘxD. ÞʧZ H_@{7WQSX)x5P_Aά'<1L9q XCNsnYu@$Nkr址7B?XCqGȌ33[Ler6yN޶ySX;Dc1Ij>69ޟĽs,+8"֍aP7Ϩ~/M7igW=E"9oFa:i? vm;B],4yrӰ3~\C 7/È974@0w9+O^'gE1HixQsV*f,k0 AM;IH2W9Īk9а>aٿ%{'i)lUdn^-KM"VN=]~)"G?CD g7̋6h41>-ݚHO wH\> qbӔ8cʙłA6tfJ)ܲHFռ@HZ5$k`g53b<3+YСFQ9,b CB =[\,3ju7^~N_GW?{ۻ[m #ppMQ { fMtjcB Xt!Cl0} .u7]a>^i0I]& "T]p+$]G;^ywΩnW#ػ,#] YAק9R ܞZzQ LL3HΎ쭜K6sO&]p h؛nA".kerЎ œF!!å;N+lt5 "5?J[f 0G;|$ŹYMoAt)ƮpH6_EѭlG`fXgg 4_Y 6# a@)0$w✻g?%{Q^ KPU~Ӵ>oGOx|46|RB-ks.N iJrK'u~GOȚaaY& ꢛrp#iYyJ;2$+lHgYX]]>Nǔ0i9,RORw學aX]w)M1!9K%I eG7o1uQ sKdyBź[4i7V̸J+ >y^e/b?YMBԌL."ե=施3CI_X}t9aS yx /Wjsɰ`emxp& X4LEuVwyNfeLƚ "fȸ=Lsfs)}O-)z1{.m ď"c$+GLQ {L)%5M]ʎ́hU\74^}h yS~j[Pp;Q &!AN'&[B7qc"6_ LJY3\+4ΉYp}}i4%KR8Yuͧ<*;C'D=WB&P1­bBe? =^NY V|O`_L:GAqvTlDUlC59N|jߴj S^L:^W?VOQfVrsJaH{]mXBKA_Fg`}*m*#"X* y==#AZuNz 4Mΰp?wjA,m+ck CYc`Ӕ\c @ <HupFsTchTptZAkGɤa؆(jFwx8 w{)ڂ/n<$yPY`J([>INT0T͚G1f3ypjބ&NZ:v{e0lwq(*J1 T},˖Lafu妱'm&s2\">I0',s`>6{eqCL٦\! t8A6 ra9=s1[6n)P]L浥DCOG}<_X6[X_08(S^fdM$Wί\@9Kwe' IP@`)8t.X>$k$7ͅ :]ȠE,I ,&kcWp:MBoƎ,Vc΄{g- /jj#/xKh 1tTfhV6\- af! bw,Qy; 5.B<6keۂ,ߍCZo֯R1Gч@rmй$w㗑W7N ``G`(pTPqbZr;vM7 ]%=/> A"s#哳ISכ,Mޠ:E;bGx.گ"X>tRFm.pC\Ӛ|#'YKQRĘP^9KY]oI7-T|T$΃ w₳|{~m-CC4v٬B:paڹ~ݿO{G]j{籜_λ4wm>N1LLjE'ө +Wf8N[Yr?\UŒX\wD+RCkSr'.˦%XX~Zfk4Dbm ^>"l9ycW}uZf#h gf`RDኤ[)$נy,*[M-^  KO5@7W7a.&X&I}l=q*x:.g?eA* 6oe#},+6 b$\RkJyfFz(ZcF8M!D/T.Bxrs\+SMJ02NřX=ÒR8Ra('fk͍.-{dy$!عA){قb{Ap۫i ІqtŒΛ²e@)yn>z@|-3(Nqc6z#7#зr|ozXсh$oxj{ax>JFXIn6c[܈D5!+/~T%BstZ6?3gZ&àk(P>׫83j־XMViKonήB省CZ2. 9'99ITo#Z MszZTPu\Ce]7)AD?UJr Y’WcAV-'!Uq>&u ɍ131|kS?fnY~YcBd]MG%muFPkj?uybһw:-[5F`u_u ,l9G4#6ɩ=Aþݩ*'LNʵAޥ|ǥ5ھ'i[3MG௹o.=H6opLBOsj S L;uZl_c Ͷ}iϝ9̧bNˏ4>:4_Oթ5N01DBjЏ^IG:rWNark4A Y_3WZtXQ1dՌ>U:NHrG><< IӠAT:OL;6J"<؊cl:! Z*i$ 0{qAzZgkcV(=(K]?)O-=[’&U:cQSP~5qDɺ8"!`Q2j`dLZ{!ֿ: 1n9Qpŷ qê[n ǕJ#ܛ󀇌^˱PTS-'¥ZPHR$ȟ͢#ޙS$XBSta+*dHcq¶1f)1䍰Z+_؞U0GqBҡ i#&3Սe0 PS<*`:F<ۨE"4g%7Dr75ַ:>ܗg=41Ku/^t7 {t\=䡁Ly kI;mu!(zʃؽ>]wgb,˚ gĔごv3~;ƪNvlS1hRp r`s/r ZA5M?©91 /$a.E_2<Ny/K0dˮ&#!l_@u؄P(:s#^(vvL4eD[ tx/nSy,dܴZVF~o0TieÈ9ZD500[R멵WիO^46(k!|"l4nMri4_2I@xX r \q1stk;AQЭR Ww 'ZC^|RgX mz̒@kǡ; @;ߠ_Sr0,۩9L"#AKfe٫ʢtQI0!F] [4WY=dO~?n4nd2(5C+N$=g}01[oCVMtZVc x-eװ κ`f[nB Nxm%$ I&B2׆s bk#b:A 96vJO=:Q> 4i܉mPiq*#E=V"ϬR8vW<ԕw-`H8> 8`« LUx<`>X Io) *wODޗ<ӞZa7̑!ÒzS~f/:$ۈL'굟z׾סp`dfMҜ 2;|$0x™/BO+nE/+.7PA⯔uR^>clda6^B(w`ԡf(,ݨ\Z-k݃ > leK|ޡ(~";uf=%.V.E{iՒC!ba[LVE再o^uzIgtԗJ&L !Ϩg#H˾ҧq%2@m'a~seg:y L_۬lˆq͘-9 9M&poz!8aE=>3=X*0` &qiɆv.&iNqUEmiޝIF K]3d)e3t@Y8ħ\e5,"_r,κL8ncQ<'&'|й-cb|w.cƇiDZm>>pa}( T%GQ@@M3yom\!jn,aJdz/v$g"pz̺c>wuް *[Jmrb.E /叫eњ\%b֊+ @ut7)ׇPjB9Q)갰ܠ:Q.UvԐ%G-e U$YREa^'d~ {o0d1iq'ܘ(%D?#3pL!,0lV?A+W@r XVLo >+nǦP/GHH ?8x́~{Ehd@ À1J!BD$p|֘e:Nĩym+@}Akzl%0h@qƀp8|g62t52D GH*6R䬗~ .T6Fʙ"=ޑ6E# ǁȍ)Ȗ׉A2N ۉ&Zڑ0Swn)o*AkaEf.[ *ga`f0>"0/m˜Bt)׵E^K-VF(ݪ^;bY_PcWu*QO]w(ZxjL7n]WK}ՙSɦA. ¬!b۫F'|5vRw3͟w6twGY(LzܮP8DmȂm1k*/tR)\F2آ~jT2bYNI}-rYrZ֯ VXE:ֳ=\ll*s]sDҼcK` NpXנ=@r ]S  ? [/6:dZ@#5c'<x]yZ(|\Bk6 Eu`]?c+Ʋ"kiCveQ}i]էWɦy#5Z!88+BB&57+u sYe~fjc̎/1k}oCƚHݮH@v XY/1hN trzU vCkp)[\W /J)H8[a|b5{bD "}E2u%4/r;Oiӄ 8n9 G[˘T>e_>_=G#c \c>w 4a0s=;4Mc;ropOI*tЕMK3~P cDde5E#.aaQLo|ҊƋpGJ]+́ *g|*1*@|!VHy.,(~0L֬3̘䞻l(^^($C^8y׺:CB W}cd%x&w|Ϊ7 Eqc%3Vpȼ$5 i.F| #r ?J)E"HDN1Ic~t<ƚPjG;ˑz}8vIۏXfG[zq] [ʹʜi{WfݥFe.JӽL^rd9o &L`} N1fLT3ճL" 7aX ;c?AY矰Es8M/K2TJ ||kX ~"i#+ZA7 ;rIA@4RIpFͳF&.эk~}2cW:%j!ڷ풋@RG[O_B؅hU-UBO!фZ5o D;͟=ȡ:{#̡EUKƉ"gyVR25%ZJ ތp@/7YT]SR.u^wR&HS|ݩP'Iąv%?/}P4\L=Vz4H PjOlq` -yM:v&H11o1*Ӻ%_KRmsi"$/N a"3Y1kH{*aA6EDUnfv{{%8NOpVI 7}|Gq:ZL0?\P~q(ԉ _o=!cЄx(.CY*_*v$ ek-E&:.m.JaD "9zRʈÉ&q7ԓh2qc6 *3BI;uRJ^RS? ̈́1KHOvsD,@wJ%\WyQi 2ڝ }OYcjҌ«zSa!W&/jn`HxUVCȫNB0oUd;jma,N]e*.Yx6`aFN j/qj&5dIf؋ЂHEe=a&Jz Gص>`)+yE Hamc2`Y[3فfû9G}C["-f}'<`%epDXIaU8uD!oN u0{yO₢$MU@'ޜge"ȋLF.nmA(ϸ,}lJM@~^GWAAf8w ko9kLڒ)G͊Wg I& BtPlPp(ɣjd!uBђtC܍voq<}EІ$ɓ9Rr; c//8F'1WooQ.FY^/! ֊m -K4SSs M*[t~$E]j: ϮRg)}=eqB+᯹ ];FKbMVGps8VY2*3XOW-j9nRg4iIgXb9jONu GHQm”JVZ Mk}Ӂq8HNa 9mN#= kYC䥈 ޠ{Ǝ^@ØU#.F=v^Ǭwt|؍Մ}S}qF[1w#J ]2b`o#Akn\KlsF>fp*U{y{kHOħ+ &DVZ/@sT\IΨeTz^m2Qk#Z#帼Aa?8rR筯4J_TV(S#t,yG9h}qqeu8zOo^G\霩04O@#?2P*sA@qtv\07pq/5,7B|ӭяT~H\#N\b+&`ם,sk:~y |mji+l1eҹy)t8\!<Dɯ8: zЛs&.kyJ{JjHQJFrK>};!fI5WKpksSLCYӬqj:l]h;d[CfǤr.1ےsTҗ =F %= (_]utU3ab)QRRث{Ϯ ihYD]!}c͠U! Զ[ t4qUYE{{X$_xC3q6{;? )Q @l"S#vY3x[{b.HD.$Zi%ЪۄiIaiT+Vo*Oag?g=𣪜=n8#z.jp-17S85nӶytteʞ* R+`C+a"o{Ŵ ;hëcǭZQ~'>C1T oXƏGI}JAnnoX$RMþұ5kPꗈw/t6wOCmAՇ9f~#^?%'.+8LV݊R=BN@),ؾ=dǚM>y]N胹sw\I#r1TX{*`G@BkVQanNQuԠx Dz\|^7sRɯ,Lة={f G2 r@8Qp/Mo0[Sq*s;G!.+q[KȲl4(aN3 > a6; )FutG$ m:)Gʘ 0mʖ9`/+եj!ED<~)Ʌivjݬ"+sn%{~uT:(P"wZ pkGtgY7B1f LgP+s>S{fǫ3c5}xj̀2QG XO \Dp\oe{c/İ@~=V\NkF d XE,#<4ך@ͩ#i9 g?˪\aD]Nυoֶ9l~B#oin;6( x2$?w10q ִ[i`Ppzn夬Wt+Ѕ]y$IGy/ȽO ](gf3nˍ)_$ 36CBZKmt8_=s-*4L!%MJwkb/h͎?oc<.*suLE Cd%\x"2.z۬t׮DEXLM=Y =_(F=A z5oK*ʍN^؀}ɀ@RӥezKOM5I}AN:`7*>b9P]{/]YYI6`Ȼ R!P Txp)jaΆ.E g"zt Vag!@'45WryWNM76nu@vΣl)`\y X-7sU;na]p7RI vq:rj{y $X)TQJ^lrHr^;n)ӊmSPng$1ɺ7MQgsOq jJfDQ&C$uڟFy5+\10ŗ岈8w3vfٳpLPUCkHfWsˡRL\&l~70%P 'AG5>C³u4Z97`8D;"٬0uɁtA*6p*hK16=:L0w~3(hn|K? BŤ[{qST_BȾ*uTⅵ z&Fi5OOVj P[(7Xa2n_(ݞ_s:Y^*1ycs Tv0W$Q;ed3tF˾8^:GgQQ dez#.r0vwA~dvC@,L44M5dQ9uUY%5BE{^o}wUW-בX Y V^lCqy%$9nAwd1 |Z!S1# / ]R4UNm7Z:虅 pj!Kd glRl MuQPyq&NRkpSi|v^y )AMcEU@YѫB&ȰN]qdv|#:u[Z:Ni{7>FI *w#ui f0"5P\ ݬ2$S.Vi,i(  <BC$˗)O wEwP,U")xkہVdN|"yyDjL$f[3/@I bَԧkO4uAW3[a#~^nm%TPށt: 'ЦaeoR6Z.0 IhEUi` #tAxta=/=ee$%QpEj#\ʔ`sspkh;FgJiBE(*9puyAp@9\`NF /ꉒl(\Vے|op S@3CP,)NfC%1|>5[V-(/+,?WpWUA'C;SmQ>S :R*VEZ{<:g4OZ}C/s7\t2: E"fS)caXn6٪~:8fB괉mn*6vƥ#K!P2;b"=5_95!ֺJ Np##;Fa"MwZ膓#G^alk;$ `hTI6 C>1:reåXGxh`׏k)nk^>.cSbV՚oabnHRÊlX+3| =ue]\y54~):"4?}s E+ЪEe4U,̆NY(ew$z[ngLuڽdDe'DwA5L( l^m}`qtKX<$?LL fX7H3Q}1"߸ov cۈEeqEjtZO6: ,g,&Ëز\Ewtb<"Iʹ:վpN{Yfw|yaẻ9M}k.l$%ȈٜHoK~TK%Ե} XkEyK-}}Q]p}]U+:YYh 7@Zzz} v!ã"3#a(ZG_w(Eh}JI_TC]xp>R.計DV 3OS9٧vE:25dJC`ˍeQ 8,j'oH2 Kunw?'x+Hςg&A(ۈ "KDVY5YB ƍWoE\#[ﾨA[ڟ:3n@P>FmT컨,4ψqc1X{oY@%17nx M!˅@<~@m(/48 ce®X&sO<(إ \"bnS!AZpSVxo(x2F=rsW5yUVPinyhƫYxdVa␃W~t{%YWW\HM~7Kt4GhTpNZ-fڥnc MiojՃ}댗O՟jrkuRxⲝ+lCdb bT}T@&sg~>de@eMVJoY"Rfh\ aIjFkmE PNW%2~x+kvǹϱ 'lGȃkp`}.G 9Y"aqf-H~957cK-KFwjWYTyT>M"Eb Jy?*Gb11^~tU7Tz$kl&+bsc;;a a¿{B Go3g t5(g~_qC5N4uOAƽ%8<!*րa4ÈD$!eqvv4蛛GQ"YQ6RϣݾYɌ6S/=1@:=$ }fD% h$&#1 %hT<* $)@6*QlA\r\ HŻIp"*:\F0t80j}2*i݈wyQ/a2рvvaᚹٞ?4(<ފB4 |P<탑vb5{Vcq&[S6aN C+Rb벆r=и'V%6PF)^ -kDy1)$={~-X(i˨2 !)vlIG<;SMg E^w0-qk:2VPȔy!YNS7 HcloX'0p\wtou///%r]k2ٽ^#$Ȉy .ۙYii@4䵬8mӼ?%6~#b_%D= -qH7`:;9w|P?/@&7{!4}M83Yx!hBX5[2p|ĀYΉgúYrʤhk3{eZp3(O/V푈=YJVr4\τAK HDFze ,ܤ"6yt,Q*TM1T* :qV8y+DXDu4FmN ,>D"}t0!ಛG$5˛P8 BSEͽ9"/=n (\@7F +(1T^S<h;&h\fpB)\ԡ0p }ݩ ''tc=k65!8  <?F{B5KhDp'/i~53ՠӓN{a-4Ξ`f'^D5) cR"זy i+te+:hNnRv) foP+]l5:U],2HD@cQibc$yIy1 O4>Ð$)8uv>_ΣRP雡q8SUeFm7n/r}/> Yh^#iDy2H#@D+NcvM/e&'®sjқ᳌_cVTr-pzId"᳴?G@YhS%*x l"i:(eIw.TĎbMH&Ba0I( o4 tv ς+ o%}yK3ɷҪ7ayaK P e+(cAoRR0( %u#KE(3q!tw{usZ~"t9}+[ߍ3hǰSбNɐ؏{nuPPȏx/{ƞ:Y+%({{AhW80|Nus$&Mre_5H|Mop;Xٕ üuHJtW?WCdȒAdMNe~+C35zezKٲ^;BI%φ)Vgk$JE`Fu;b:*=u8Rj+ѝya@a؆C¥?ͷm0iݞU(; 5.h5@tPb/j;w5U 1R|S ,xfLP_#sZMDpMpO8NX>c` @iq]`BWFct5b ]NA/ܤX6zhtgH. Vl Z.]ӓdB34?5{av =CAj|eJ$g~mܽ 7 46}iH'WNl!zȜݦ2lndw2d=5:B]e[*߀[z\$ӕ(}.H֛stwaaEe20z*L&ipO[ePOdCp,.W:+TOl-+Ӹ.1E_-vdlqgם0BۘiO\$aHCK\_ b?M/ WQsrgd)&Uh|*gejìj810@8YP`/V@Cua>zF_o, gx4k1Ӏ|U7`9QƋ>.3(V.3S Ʒ_?Y)3$8Z^cB7ՙx/}pDy=x#&#jLbMU PRWՉO~%{e~9_Ml`,BGRؙn!C;Jd% \Z'ױfl>K 2#Ef2[l!Ja~u*"Ƶ#*H_9&ߕ]FJQ<8y*ÑV.SG~1cŰt5|W-)sQ$!v.l6pyÍ\,qR2atT*4Y(NcrT>i~;rǛP- ֭JWBxMGbJ__/c: k3 c_?Wd':$!j`CN4K/ym nvՖu4Rƫ\S&ÈU}uk|+j?w"*8 coUY)n}Va/%Tv_L*zBIY7r90ۧ81|3@$<}upųxdw`[K-WHFt wRAsjpC‘wzlwU.ʪלLq#W&h2`Iy\_I/:Ve;'\p~06YWtJ{x6@},?`o+[89ef9h0{WD?p bRpZKVQ񥸛`F8hG5 u uS/Ty㷻+$Nt8O| D(kL{FY. _U$R[/t`J = α< RV1wg㱎]ALiMVgq1Fm4V{ l.x2L!`Qdu/24'j3+nVFM"[Tvr˪Ю7yIrdjPA! ?3nn9Cm6ǘ3?dZ0H34{b/|IXU'4vd|ބ*ErG!le^x"}—k|HzPaQR*K>٬ơm{/?_qh'5k:$:QHpMXނ$X25daWDZ\VoGx(I^ 2jv]\ny[%C#g ]_L-%2 P+뜴oq29"C{_%+g)T`IiREl{߽U,R8, L*X=b+A7ȋ&pHt~53/Kv䪬Ὠl IXӤ }JmIwU<aLCj+F7Z~l*AS0nob[?2)P Þ`ec,:Tk;v1S"=+T#Qcl}yk#?mlȡ!XLarE?~6${2Z1r`  g7\zf8~d/ъ\< [|&T8k; ~~[,ߌ76Ndezɣ0딑¤/Moe/@3@iC͊CfmM2wAF*E#D6BР0̪Q Wb09; /*DG⥮ >3HI[,,C&He [|PO=kSm42 IB^RD[d7+j^W#4T3=U΅P) l)yY ~0w!H2Mo/0ԒW}9xo 3j9}\Xkމ 7_S:~t골<|>I$#M`vgx2m3s_/70/\ ŘZ,Hn?N-{u@lLB*{PK9W9R$0CbNݠeGP^K52`Dk0/i蚇e68$Gr: 66; 7‹&f:Rh?/MT%O>#a *ȡ̬p7dL<*PX+<0ݽohMŚo#J?D AiH6SZ rc9V6dnJ8+# BGjYD}ս*i"X Ŀ?@]m )d%!<65Ś%ՐʞR ٳ<n\v 0uHay&lhír$"c(7 G@PL4{<@$Yi X!iPSBL3y4PWQΔhCo5cO~/abKtcfI9`S7 84b+&";6'_@4G*UQkf<"Jﾓ8څDE}\n?.g}M3z,pG*JXYę!7l?lUU 3a  7q^wh0#~fN;vÓ7ܻa&c]ZXȤdCBU^XmFjxp=Łd?{OMEJ7 ">^qIrhwGeocϟJ5`Y <ȁ2lHeG>NVP$+Y,jh|(>+7ww <\߅~ Pťļ*(:5zI]L8lJ*( N361D31:'革c׏M .q?t!k1h>ڟH,P+C`xַԆ.:NZRQ~Mna 9PO >i*:XGbB!JBYU~dyFO!P+omJb<" "רA oZ^WDJT`Ǫ lu$4%؄*DQ= wU RsfK21}|=1 OX`\ 6Ig];% ceAW1^7Zb{f$&Z0}oՁ4wCH|ή'bL6_Fn'##Ǜ {řa :ZQgi՚VW;hp;6e: Ȧۃ\z;`Ix'2vDƧ/Ä-㡢ȔLDSTEQָ Vr?=z5Z̈;5LeƬe%X <`ƭcěQr C`lr=sBYV@XpȔAr4'b;,J_~LJ(\SJg̟&[;sT*Tl9'Ig<& Ɣ*_K3t1K-qCВ@!AAxCAcCT-21 0`B;Lܩ^wlvi TѪ!{15;e1~27&ɦ}[^8z;/<j\|n?D@S/|.8$x q!s@5XwW{pXwt+?H(QM>? ;rQl)M% WWݡ|rǨc}9KT~Jv%ȱ hlKNp-xDx4$OGj 5C_ xͳA5,'p:msEߗ1ZmNOYĞwӌ9-xVƁ_$e'P #G~%u{eTnI.l!.Rgb6C8>%Ag?Q3"^  &.Q| : S25"m;(G W͆ m\OS} R).AMS9\i07BA6E@hcR}τ Q&_F_+jΘK.v{R =>2fC]4-"0.I6JOjkbo^ (*6L$&'`^wy/q+F. lU86K/"BU ,7hxO)ùΌ#Ho4s:}U9.MZ]K{ 16aLtK@RS Eq.0g\S | \Kᯁ3izǺn:tGo) FW}A>†_Pey?t ;p&iIVPd \`+:S9zk!qnyig@Ue)pS~!d2VrҜnR咘KcIy 7sW^/srS.t C^74%\  ͭ ]^{14:k `>1yS-7FA+8hvo2DvXwVYsC:hGCU:V8a- GPk-5f}7͇,=jW~ TjW[Ra`*J=Ymg2M r'Z˕n.OrV00mmEB|G8DXJ |hjOHjYoj<~T]-mkﭪ'./FC$1f~yL,sg8@CkAv@J>ΜU|IFcո7v_B\92p}MIzcdK=/CeU?CvySTF=4`O"`̕h).J5}4}p^&ŝ$SNTЄGQynf;/ S(tbgj,(.!z Q>,(Zr!BbYc7edT3EAp4U MiƬxScۿqXE\OY iYʌNr[2M`? '+jC$gD0q| \IFD-߀#"}%&k8%SnUl4+*f'0-!h1zgvHȘg3>d\o TY6^*Z1a9O-/EV .U'H&+IsiLX|I="K,[Y|z%Y[>x \v;Ď5Ӎh_Ny51bSNB#̀ 0N+cqƨ ݚcl`zDġ珀,[Hc#6l%ՌVX m#}GRxA$S9K+#Ͳ|^Kk][ZOfCޢn[VFSNH>߱+mUc㮎Q=%_D49:GHa(n³J;<2= 58ȸ&H*@Bh#I?>*%H+2hC(?5gDnja*lGxm[HODI|,Տ, ,Eu+{ -Hrs|G trDL‹NavX`6&c ~x@" !q,ȋ5\_c9@!GŔP D҃p-a=~u @iTk:~yव+WC͏AN;BPC]C$P]85Ԟ J3#.8lA=hqe4혣vh< 65b<\51%/hy$Etu*KNBB+o (yndqtŤYʶPѯ2],i>/ Tc*g*SKjɵ.l*Oy=,#ni#ُX':Y)ιW(L>? E4"l2 3 :}*3˞=wOӪ'Lܾ n?s5@~HU:BbLEa SVimb"Hu_&@W)'sjTbk=#qKH5>UһU47W=KN8:p} #e=HyԧʶsH:V5OVBe 4uyFDm?2 [Bv׳'Ḥa^.&QUnJ9~S*/2{PgyP)uN-J-NGgNsKQ$Z",=Ac`P1e0#H 6E(X>̈́3n )# $}8 A"R'0Gs=y]2ަ\YTH{7 U4 mt#pd +y5? 3"`$"pIְO,BN&E?IRHoz*;$CI,se%Rƭvf-3|'JU? ʅ6V >,3͵h݄22,^ <9%@h%TDKpw\"d:{mr`2uih vi\\Oa@fX0S B zgwWnqƸU~gn[K"g;HN鹦U{I!\@j; @RvV|\B7J$upD^9_&7s\ƴr"u3&p O1C<Օ5tx3 zߘ~BoPw|vp63<$)mE^h;?`.ua X^Y,5xiMjh<K6bq#ן U ﱶ=6-o_JZ'*#sDQ0v+/D)ҳWmv VI;h5:@|_^LeAS<(ObfʗpqC[rK9A 0 @Jϲi*tY8z1L"aKfV HM'B tfP}浳ؘ_b- Dx@#.pgF}מ AfQ%8HݯJ5ك 8n*׏x푃78ɠ9=a9dĮ Ґ~*]g*(8aS:5)IEVp@ZTXO 73bH`p2GɣeLϛ& IB=iBhDŽ_bۙɴy3t^O]LtL4†(#Agpvp+g<{&6_AVD>NWBc#k9Q+!{t8'%f_,iYWLM3r!: <%m'HPq%F-^puC$̚CDאB9S (<ܤ+/Q9qˊC&ـ^\Ѕwac!{ zI4wW"M2X(õ-~&!uyD2[F;\ r\OqX^f'5y&vm7?mh]w,'ij,R0S|?b}} 1!HCX`8%0Ϩׂ#*ڤ;"ԀX_M^J>T35etYT hrj S"RNΖLM-Lhx3Rhz{mz3p%|[o'jP_rʃ#£cz0S:S!1r"W*r6u@Sz#A!,@rRs,+C6 KH oY(FMN*|oҗ&T0ňGͣMݝaL>g+[OI*y)nZ/[5c'Hs ]LOPFUZB\ ) ܽG$Sv22ַ1DKDvU)$Rs4׳Y()Kۚ\qn$VMsoOoOaHjz牭}jkOrhY5S%ٟBrW9]i@4b3oi/'"y|3Cdh! Å/bBS?K:?+ XR=h9}U D{JxyQd{Ӝ9G\mR"WIc()YH{sgɢVs=NI ˧'29Cs EDBv+?]gO]_m=2!f;^ Hlp. 7!Kyv/?c)@/Ch"6E.'R y!NNiQ3IH^' ]=zBLd1*8dQAӄ%dN挚}yA)4/:Txdntݶjgg(uh82dOŬtP f\(6$|"Y1okS 쇜88 YsQ-S}_(n4c{[1 ֠ R{^)\ExHZS 顪7m|W|+c͢S6t@|!:j6k@cd " !:H>g}WuѨy0D kf;WvF-bfS`qDhfBw.K2P݈9hYk DH-lɃ__!֨?iɂwZ6^#-4*. S}ʮE`:-EA;8&8*XMSzb]R̤0}p6ˎA4Jའ[gOkAڜXtxi!<2[d)q42\c=?+S$4zAZcilԳ(6_8byG-Q.Y0(A"O9lKiڞ솝r65>5slN^߃2_ QNULCqTypMZAWCe6}a+6/jlUFtE :jn0oAib#򒵢AS ΁WIssd+L;_Rî-9j=T~OmEW5=WVk3O?_J_chR'_UR;wZˇb(,Q3F˟d  7Djde"'sA!f`}'V=zyĂ>Zh$ GitDpO_P\ ((2v3$ӕfx8!%i(]&/䐭fH?.)pퟧ61O j2|߉8.VN>|o4.ނe8}rjĸˋj6b|"H<}USn;OB/+ZS~ZRLO`ܽrs)ˇy3ADGzcexI:Qw @1"hh6l}Lgd˺BdL멊@D4NlK j8N~S&9dbs�5#Oet(rT87 fYz='8 ;:Z#,aj^krD-gL9 ЋX mSJU(\Az15~]xgCՐ8*u ${u Bi= DK?1u&R\NQͿ1wDwns x QCp:3cgԈ~3V~/7T *DŤ,~m@&1+S'-^#h+'PNjP,.##1!?:263a֥K~%ZY 6Z\W$cR-6}hvJpL@^`Ҿbpί4-Mc} @xӣG2b3dݢ<=`߬@PGb iq 쇃t8ӽq mGN*& 1N}_?ũ~}*GOrCa\)Y CjQ?Eؗo|q4G"|!%C*0By`imN[yg*dNvkU E{g?zFi5NT;3O$*{O@4ÐްDκy)V;LCr,F1i 6L|qOY6jDN˼<:^V< aj:y> KOg/KHooUTL,"P&T~, bL6dGr\H)`^O>l t+]82<BgkLAq{OUF/73p D-DxaHƴ9WZ2ph3as=("Ƌ\`BKwgI1$:]}11I6R /`OXeg5Ӗn&p1= o j_?&?TRc fxYo8@{7sM55i/ecPi/q_iM.ŖUmN.=bUvrmT[%%Qg >?3S1Fӆᛱ土/q[: 5z _E-%fk}ݬH`:9RӄEfA݉jRoZڒOoŅ|d⅃ti<%M^`E}T&-.^]c7`Pw/k+cѤP ˕%eұ 3^gO[ (tD&[wq 2}0_˪_[{-p{yI[75S}OMJW  53TL!ERRECVEH5>/6 B}ޜ/hM}pM(ւ~jwQ~PI3Aݥx NrH޿$ZwU L6ÿ¨;l޺~NU%ݹLTo=_3#$@HmV jVoC#e6Ćg4$ H[b0b"p ͭT)_14 UƬgu|v=p=EO&_-֙(=NFDZOM)*w;4oe2Kn[c\Ca-@:˵%[ (?9S)ޮĵ |cCϣ՟oB@% 搃3a9]>;-G%OsW5݁|Kr^FEpJaCѿ3*31w eQnezZy? 3ح }s>$ʻksT ϵS6 W.a"JՀmyl$ZR-GcvErֳN!7 OCra%1|2Y`PsF-Y|SVVcq!j*\:/K>eloż.@vGP]'+:TͿtJT~G_I@9S+|E)7U$n9}<$е`їQdAi<m䍊C}'MRޟ ;Vdox YPV۹lC>l"rXWƛ_΢ bq+PIl@dU<h)6/kt aP7J2<+\=9@8vl3iݽq ,Ilh2~^84dJWoe?lwCqIM/OZ3xwm=T|)T 0lBaa듄[[錤.vA믒ʸ lF40fwmȂ2RQ)wWS-AOcckD4rТnȴelos"?m;g^?uk}!iiT{ M@ =v n: ͏pݺ" wa5T+sMcTU !@h?žlc}`O|)͇bED!lewQ;.A)פ-1K:#D4\CX@fgXR6]o_@n?f{k8JAP,<'YM->}-;q:IZ.u nڹSs4%FsGX*d$隟Y5Y \W&Kq+Qy!9e9~q'%({!KL0LdfZ>^|?l eD)jȀ^4ݨM[}c] }3Fv n~t:1 1)h3ryfCS #f &Ft8L- JK!+?R?HWgon0g;UOŏ˅E8Jv$8\ fq麸`1Vc L/BUP5iSg{~xQ%(3;f+5|U/֗r(DƼUԢw vY42qԛIÒpH7m,sn,!T̶ ,A kLejA逑>YCgHxnԛxY泷蕠LcrsD!"))u$Y;"-^){7ysmdW%CA40J+dɎ^CARZ*+me_tvZ9 P6owuhĊht>brT)KR >*Vv]P]7IDD&K,/8LSi =E1dzc/ޢX8ʱ;dʹjb -z m:@͒EjXh$ $ӟ}Vi8~@ʜyۭo0&@qK _PC#i"k(̻#1d*JPq4$xPo ЗKbɛڣ ^;cbsRch=26sP5#?W/,֏z>>@"E;zZbz+.Uk)  V:=tΔK`E"ai=xpi,ahb+" 3.zIC;V7QXZhc (r2uxYNƁ`[FE|6W'+"-e0<Ƣ?׎Þl22q p,?5xo8wq3E(wR5=yy= ySI1)<OCev*i~l:R'dOR8nS [Yg SŽ4Vnr|WӢs %e اOYAݘ? V9k5_ѤLQա?jU$i "yGn'zKOtE1H.,>J3Q=e*3ᘽ\GmYc A0 ȶ629»khG2L!@E\WK8sꠡT?e=ߟWMrAm=Mn3i [b.9p`6xk֭L+ni V+[8;: % b:vZ"M̒r3HP& ) N|4kN/9<=y~`1m70<,Fr1Xuf^γ`8 GcGrҘBmyWSL|<ٛpObQᖭ )>,,:Lێ%LWGT6d|=%t$v*IۤU/C;֟y ?}"Žɡpe|n3YVZ˂Vd&Dzշ6KѰsilLR5Vfil詅CO-΢%\sBAOȏT?@ y#U~Ti&GMƣVQN/#6Ңn[ )DANs(|bI\~ 6tzc+O0ZVpI?}rUyCڞpRQF&{̼xjC⨌6L8ncBQ{&9-#7݄t*`KUE7@kB d ;~1E* sY,HӠ|H YL3f,u:4)~B9E0thȟ *z۳#Ez?q@Mp:Ih$5ݰ\UX.W1[TZD`-[oDuWޗz6Ʋp$m[\[FĮ+!LfyAR#C$/-kOk'!fި+TIi|ccַȭ <]̔Eo@8ۊ3E\3IH#[ϖsLQ# ]5#i|?M 3+S$å&qve?|"CbŻa1<2KN~TҗS#aMf.nB~%Q FS X@_@3URFBWU{B#|ܶh!S[hwoloY^se$s]fkUa]ͅkEQ-4šY$LW됔)sQ 0r6-=zNϊV&Ǯ gAP+rQ1Ж_vhu3$ٕ Зy#Vܒww``ɗ 4IlذPڅW̝uW8kaDojd ۳,b{V`g~3Du Xf 6BhRRS~ŦkEu(q6BXVR r*w3ExBIkxl%| QN rAE#vmxQZʵ#2"G(#WAkNd aF}VdbgsBn@Hrz _lvb]'A`G| )UW HoJk~C"w9zty.$x`rkppXгlY{qVB ۰)43lb$_W,CBVzKOP,| e]xOȵ/-F7":qj" W6t @鈭>7 bO7ei$6e$F(m rB@T-V[Gv!DarklŬ/`:㝦SĐ'R*8k\XmIl"J`"Er-%VL)[wE)>˹jAӾT*4i~( :"z7?KqM/Qhvgčg1ՙ>5q9D_0o5lwY1~wnT= caQg/kB#)l3h*9RhЎ_8 T ~SY)d{bj4ڽ! _e% W!Sgyޡ_hI@.Y(Y;|)BGM|*A9\CjЂmZBv!`n]dgJ/P4uň?Tg^~1*@{i)^׬ʁl(>Lkw3H@B>A;X̍Xа2|ՃYw6pé97MfB[ݗ<2&2Qge&c9C|&m BE$n/렊YMImjlju>˙;X3Gߦ@Na ' rEtE-vcG״Yb. 2)M5 S3%Z ʢ'b11pW J#^(9 oZ,v} XxOpev^`TVE\ PRh=5~_CPݤŢ[JDHp^t{I i;1^x$;PyxXǫF~Ȁ88]V\to(B-f@Bs?l1P}LmE]%$ Y&{=wq3YC4~8~Y5njv5THn?/LNGMh>Fv&A6 =*,5m9e]S GB} vS15mB VPۡꉣ%`9@gjz5xhG@ڴ"FyYQ9l"+}$O/ 'ek6wL9Zd^B=`vGnܦ9@p_TD5K/'ڥׂ0&}zSOReKw`0@}_A, ]AE);r LF 7vƱ %u_.鍠avGBwǗ5UP%jhT3KQi DxA* gyl5EHءEi+S`3 җhKٖiQRCȫ[LQ] [mS4 }a%Me \͛11g.-'vy/4nTd.|Z 9sbf|URص[) {z`5c4!O^D˸(d2&O3N7dQ;؞ho>DmoF4]\uu-]^v 3JieZf6>0{qy&n^Ae΁_Д6tEȈ5As5PJΛEWwtfQq-8T뫦=yo3Ot z7T3bVX&ح !l2 FP –y? +:cI ԽܡsD+DG; eS(sExe~ʿ_*+*qUe՟*0,S.۞?84)f(+ߕsbBdzc/tB1ÿ׀r~>Y SU ǻuVG +v}GSQ4^{KJnqʙI=cRuő A03AՎ1ͯG˄R\̸P:G׸ !-G)$7pO<ıGK%ҧJe-^|y^w0 E@+P{hx0 (ò˦nnQFH !b7ʬzY!f4 G0qR+vsaB?ʒ5ͷ[ t l:FF.v5$;M2!}ؤ}R[k] 9ʫEp;%ySnc{^TNgY3U ݘ2J.ɡlZ|~\EyIrl ]@_^LO̺ ̫^_l6-U:W](Oat>|B?ܲ'8w]Q$NSryTpT2eIn 2Jd*Y$D'g({gv4|LoY'9uy9~#"!ac U3gh mNzbx̢qF 9|sM FQޕ;i}BN۞M87lTdx\r%Gi! Y/zAo!~GIYϫ+Z|96+O/8cvw)|z^ (S+љ\+:Q˝IdpMQzxeT%+@םmjdx@+<i0N쪳5uR%ۆA >=ZFMAM$դi%WkB2xqppzRW?yrt+m,{w7l춾+4@ٰLؕ^B_! p&jc)0K 5*Z z/4Z4%U^4mʢœBX *8Q(MrArPIC=vRE?X®O TxkϔO|?yo!UQB@ nL%xoӀcQL[gp̧4V>388ON˺ х{+&jOɚZ}:ִPQ>"ۯ]AD7gS(WgL((Ǟ +1ukڼbV '|Ơ+Dʤu-Kw|hЃs ̸?wS JЅ9g좕 RʼnCUa ]m3֚^fbzJs#Z#msH+U-丅Lhw~8Ha] #9y:+[i\@$4eu>56iK3[)sᬀrK_.}hݏ$Kcqw϶,bxOVis߄e>Ԏ9樈3k%LI92#;Bx:2@<7%z|+'-:|vWS@FmOu :Cjߦ^]};p;W>bs̙+wY=flsmg֘~baze]S(Z9~v<ьb07U_{N͛؋0|“:$H]cWD))K+ IAKvK5q%5,L68jH|0Ug*bI q2R>R,~rnۍNwj)g[$1Qӡ4PК^ʥ !5!ˍv֘/V:bbAͷ 1$җ3KC_3.\.wQ7)a;=Do|f6Ef4M?ʡ:PG*ÕhMyܐBjTQ8g|3F>j|"/+KiNt䍨).DW ATf\iٍ-$r J57!ƲseFHs>x?g؊&1xofYW;4@>yo}260S4s75OX- =( p*\Eua9h0Xpt 3gc1ݟ"?3-? 1&W!Ҿ_l]4xQnK$f%)neDO!c5jCAY eVk3jh!˦W+3NBe]};VˣzR= 2qA^x"C)ۘILeZ'y^lߥRʝ8=lWL`.Cr^yT Cz\+%v8EѺ?D5o9 ؙ{(>&_R$huYR hf (RCk2z! { k\ϸyJJAl3KE"vԤpQb``8"`e)۬isL-dZqqVK:qoM<9M1 !;`pJ^ cg0b (¹l5Y^C~9m4EHN2e;8`; [i:s\rQd B,-zh{4 )e rvV|u)X\t;zo_L`^ Yđ\3hlI<}xJ C]%[9^<.M8Ya'/gNc'P@=^HAB+$@G~=bhJn4LۓC743ljx1KOXˢ4TGN8F6ѥTDzE#vE[ƑYtq0R>H%kUՆi.}ޅxF1b-qs=M CHr[H VʵO*cSdnIVȽGB}!hIl"#)Xt©{u/a'8A)p3uI%%V\F&6̆Guq7w/f3~MƂ<:u$$yTت@䦮Q>Ij8Vh`[yl1p׿՛7HIql58mK.aǥPƔދ9جL I[lw  0rge8 @!`vE<%៱ܥ1Rr `ҫd3H#t4R_jNQ}4LtjHTG%d&g A2dY)f,/-R=w?qh6 tpՑP>dl3(y:  p4yE{Pde 2ˀ:pKPI+qO.WH[){!$ʖ_Q$Kw.خzJHmfLnzESP _k==jq*7-}\=F`'Ę)yX$^3MTJ^-TkHKi/+Dc'P]<#j [˸)F'['$k5@ߦKZ,?/zBh zĺ#%ls]9DX /S i'nNʌ V=|L/+ttz40<̻9/hMK?yaixu?C'mvЁC{:<57u'횙i)L+л{l/v'I̕$ҫ4૴cN!]U8odtUA [5%Q-F#d6Y[ Xgg8sseC1lO N :'5I`e%2.=ʨHI f%TaE\+R=$f?Xx'Gਐsa_.qn:quPbE̹ޝcН̧M_ 7vŹt!{;'B-Cw&A~IqT<ʳ׉Dn)2풹 {.Ĝ@i5»M$WO2Y?hpHjT)lwK/zuhd>b:D3W+ิqgE8S2.ypЖH7= }a>Ku[(KPNd)&LDYH>?*HY,{[Aꬰn=9$;gڳcKh=3 SƁF3 vqD ]VcQgL_qB4 wl '*R m&{3hfĈOˆyvclZ yZjIH@(j3tG1 rV<N^qr?D@yPO9ܮ8(wuoߝXyCFD2W(p̔VܯDpԌ$:E5z:8R,P4.\?7DRxq98nޭ.HUti݄W[Uְ>YhU<[W یSXċEͽ)MKo%Rc+WVנ9YxMJMakn܄|/Q? $3CiueMa g@muSHW~_@筿׫.R;}xFB+1(B bGvX<"Qv%wF2FP K]W [E~u9GAF[ߗG4&Lu Ke=)j;g=~JG(Y\ig(S{.UYަ= HNdIe=o,/'W"sL\sAë́r}ߝ8O8#@rk<),zៈSs >A< :fF6܉:菉sd;鬔KKWpOȡ+T,jڗ1?^]va6J3 bxTD 4^\[6v\ť?2Ll1b