pax_global_header00006660000000000000000000000064133107600360014511gustar00rootroot0000000000000052 comment=64cec79ec6afbca1d8d6c83b97d8f4878b650595 zimwriterfs-1.2/000077500000000000000000000000001331076003600137405ustar00rootroot00000000000000zimwriterfs-1.2/.clang-format000066400000000000000000000005101331076003600163070ustar00rootroot00000000000000BasedOnStyle: Google BinPackArguments: false BinPackParameters: false BreakBeforeBinaryOperators: All BreakBeforeBraces: Linux DerivePointerAlignment: false SpacesInContainerLiterals: false Standard: Cpp11 AllowShortFunctionsOnASingleLine: Inline AllowShortIfStatementsOnASingleLine: false AllowShortLoopsOnASingleLine: false zimwriterfs-1.2/.gitignore000066400000000000000000000001711331076003600157270ustar00rootroot00000000000000*~ *#* compile depcomp .deps .dirstamp INSTALL install-sh *.kate-swp .libs libtool *.o stamp-h1 .*.swp *.zim zimwriterfs zimwriterfs-1.2/.travis.yml000066400000000000000000000006561331076003600160600ustar00rootroot00000000000000language: cpp dist: trusty sudo: false cache: ccache before_install: - PATH=$PATH:$HOME/bin install: travis/install_deps.sh script: travis/compile.sh env: matrix: - PLATFORM="native_static" - PLATFORM="native_dyn" addons: apt: packages: - python3-pip - libbz2-dev - ccache - zlib1g-dev - uuid-dev - libmagic-dev matrix: include: - env: PLATFORM="native_dyn" os: osx zimwriterfs-1.2/AUTHORS000066400000000000000000000000461331076003600150100ustar00rootroot00000000000000Emmanuel Engelhart zimwriterfs-1.2/ChangeLog000066400000000000000000000005021331076003600155070ustar00rootroot00000000000000zimwriterfs 1.2 =============== * Revert "Add leading '/' at indexer url. * Move to meson build system. * Addapt to new libzim's writer's API. * Add travic CI. * Add redirect articles after "normal" articles. * Explicitly use icu namespace to allow use of packaged icu lib. * Fix help/log typos. * Better README. zimwriterfs-1.2/LICENSE000066400000000000000000001045051331076003600147520ustar00rootroot00000000000000 GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The GNU General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things. To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. The precise terms and conditions for copying, distribution and modification follow. TERMS AND CONDITIONS 0. Definitions. "This License" refers to version 3 of the GNU General Public License. "Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. "The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations. To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work. A "covered work" means either the unmodified Program or a work based on the Program. To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays "Appropriate Legal Notices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. 1. Source Code. The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work. A "Standard Interface" means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The "System Libraries" of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. 2. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 3. Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. 4. Conveying Verbatim Copies. You may convey verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. 5. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: a) The work must carry prominent notices stating that you modified it, and giving a relevant date. b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to "keep intact all notices". c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. 6. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. b) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. "Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. 7. Additional Terms. "Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or d) Limiting the use for publicity purposes of names of licensors or authors of the material; or e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. All other non-permissive additional terms are considered "further restrictions" within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. 8. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. 9. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An "entity transaction" is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. 11. Patents. A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version". A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. 12. No Surrender of Others' Freedom. If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. 13. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively state the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. {one line to give the program's name and a brief idea of what it does.} Copyright (C) {year} {name of author} This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . Also add information on how to contact you by electronic and paper mail. If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode: {project} Copyright (C) {year} {fullname} This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, your program's commands might be different; for a GUI interface, you would use an "about box". You should also get your employer (if you work as a programmer) or school, if any, to sign a "copyright disclaimer" for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see . The GNU General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. But first, please read . zimwriterfs-1.2/README.md000066400000000000000000000113201331076003600152140ustar00rootroot00000000000000zimwriterfs =========== `zimwriterfs` is a console tool to create [ZIM](http://www.openzim.org) files from a locally-stored directory containing "self-sufficient" HTML content (with pictures, javascript, and stylesheets). The result will contain all the files of the local directory compressed and merged in the ZIM file. Nothing more, nothing less. The generated file can be opened with a ZIM reader; [Kiwix](http://www.kiwix.org) is one example, but there are [others](http://openzim.org/wiki/ZIM_Readers). `zimwriterfs` works - for now - only on POSIX-compatible systems, you simply need to compile it and run it. The software does not need a lot of resources, but if you create a pretty big ZIM files, then it could take a while to complete. Disclaimer ---------- This document assumes you have a little knowledge about software compilation. If you experience difficulties with the dependencies or with the `zimwriterfs` compilation itself, we recommend to have a look to [kiwix-build](https://github.com/kiwix/kiwix-build). Preamble -------- Although `zimwriterfs` can be compiled/cross-compiled on/for many systems, the following documentation explains how to do it on POSIX ones. It is primarily though for GNU/Linux systems and has been tested on recent releases of Ubuntu and Fedora. Dependencies ------------ `zimwriterfs` relies on many third parts software libraries. They are prerequisites to the Kiwix library compilation. Following libraries need to be available: * liblzma (http://tukaani.org/xz/, most of the time packaged), resp. for the LZMA comp. * libzim (http://openzim.org/download/, probably not packaged), resp. for the ZIM compilation * libmagic (http://www.darwinsys.com/file/, most of the time packaged), resp. for the mimeType detection * libz (http://www.zlib.net/), resp. for unpack compressed HTML files * gumbo (https://github.com/google/gumbo-parser), a pure-C DOM parser * libicu (http://site.icu-project.org/), for unicode string manipulation. It'always packaged * libxapian (http://xapian.org), which provide fulltext search indexing features. On (recent) Debian/Ubuntu, you can ensure these are installed with: ``` sudo apt-get install liblzma-dev libmagic-dev zlib1g-dev libgumbo-dev libzim-dev libxapian-dev libicu-dev ``` These dependencies may or may not be packaged by your operating system. They may also be packaged but only in an older version. The compilation script will tell you if one of them is missing or too old. In the worse case, you will have to download and compile a more recent version by hand. If you want to install these dependencies locally, then ensure that meson (through pkg-config) will properly find them. Environment ------------- `zimwriterfs` builds using [Meson](http://mesonbuild.com/) version 0.39 or higher. Meson relies itself on Ninja, pkg-config and few other compilation tools. Install first the few common compilation tools: * Meson * Ninja * Pkg-config These tools should be packaged if you use a cutting edge operating system. If not, have a look to the "Troubleshooting" section. Compilation ----------- Once all dependencies are installed, you can compile `zimwriterfs` with: ``` meson . build ninja -C build ``` By default, it will compile dynamic linked libraries. All binary files will be created in the "build" directory created automatically by Meson. If you want statically linked libraries, you can add `--default-library=static` option to the Meson command. Depending of you system, `ninja` may be called `ninja-build`. Installation ------------ If you want to install `zimwriterfs` and the headers you just have compiled on your system, here we go: ``` ninja -C build install ``` You might need to run the command as root (or using 'sudo'), depending where you want to install the libraries. After the installation succeeded, you may need to run ldconfig (as root). Uninstallation ------------ If you want to uninstall `zimwriterfs`: ``` ninja -C build uninstall ``` Like for the installation, you might need to run the command as root (or using 'sudo'). Troubleshooting --------------- If you need to install Meson "manually": ``` virtualenv -p python3 ./ # Create virtualenv source bin/activate # Activate the virtualenv pip3 install meson # Install Meson hash -r # Refresh bash paths ``` If you need to install Ninja "manually": ``` git clone git://github.com/ninja-build/ninja.git cd ninja git checkout release ./configure.py --bootstrap mkdir ../bin cp ninja ../bin cd .. ``` If the compilation still fails, you might need to get a more recent version of a dependency than the one packaged by your Linux distribution. Try then with a source tarball distributed by the problematic upstream project or even directly from the source code repository. zimwriterfs-1.2/docker/000077500000000000000000000000001331076003600152075ustar00rootroot00000000000000zimwriterfs-1.2/docker/Dockerfile000066400000000000000000000046441331076003600172110ustar00rootroot00000000000000FROM ubuntu:latest # Increase standards system limits RUN echo "* - nofile unlimited" > /etc/security/limits.conf RUN echo "* - stack unlimited" >> /etc/security/limits.conf # Update system RUN echo 'debconf debconf/frontend select Noninteractive' | debconf-set-selections RUN apt-get update -y RUN apt-get install -y apt-utils RUN apt-get dist-upgrade -y # Configure locales RUN apt-get install locales ENV LANG en_US.UTF-8 ENV LANGUAGE en_US:en ENV LC_ALL en_US.UTF-8 RUN locale-gen en_US.UTF-8 # Install necessary packages RUN apt-get install -y git RUN apt-get install -y pkg-config RUN apt-get install -y libtool RUN apt-get install -y automake RUN apt-get install -y autoconf RUN apt-get install -y make RUN apt-get install -y g++ RUN apt-get install -y liblzma-dev RUN apt-get install -y coreutils # Install Xapian RUN apt-get install -y wget RUN apt-get install -y zlib1g-dev RUN wget https://oligarchy.co.uk/xapian/1.4.3/xapian-core-1.4.3.tar.xz RUN tar xvf xapian-core-1.4.3.tar.xz RUN cd xapian-core-1.4.3 && ./configure RUN cd xapian-core-1.4.3 && make all install RUN rm -rf xapian # Install zimlib RUN apt-get install -y libicu-dev RUN apt-get install -y python3-pip RUN ln -s /usr/bin/python3 /usr/bin/python RUN git clone https://github.com/openzim/libzim.git RUN cd libzim && git checkout 3.0.0 RUN pip3 install meson RUN cd libzim && git clone git://github.com/ninja-build/ninja.git RUN cd libzim/ninja && git checkout release RUN cd libzim/ninja && ./configure.py --bootstrap RUN cp libzim/ninja/ninja /usr/local/bin/ RUN cd libzim && meson . build RUN cd libzim/build && ninja RUN cd libzim/build && ninja install RUN rm -rf libzim # Install zimwriterfs RUN apt-get install -y libgumbo-dev RUN apt-get install -y libmagic-dev RUN git clone https://github.com/openzim/zimwriterfs.git RUN cd zimwriterfs && meson . build RUN cd zimwriterfs/build && ninja install RUN rm -rf zimwriterfs RUN ldconfig ENV LD_LIBRARY_PATH /usr/local/lib/x86_64-linux-gnu/ # Cleaning RUN apt-get remove --purge --assume-yes git RUN apt-get remove --purge --assume-yes pkg-config RUN apt-get remove --purge --assume-yes libtool RUN apt-get remove --purge --assume-yes automake RUN apt-get remove --purge --assume-yes autoconf RUN apt-get remove --purge --assume-yes make RUN apt-get remove --purge --assume-yes g++ RUN apt-get remove --purge --assume-yes liblzma-dev RUN rm -rf /var/lib/apt/lists/* /var/tmp/* /tmp/* # Boot commands CMD zimwriterfs ; /bin/bash zimwriterfs-1.2/docker/zimwriterfs-macOS000077500000000000000000000062101331076003600205210ustar00rootroot00000000000000#!/usr/bin/env python # -*- coding: utf-8 -*- # vim: ai ts=4 sts=4 et sw=4 nu """ zimwriterfs drop-in replacement for macOS (or Linux) using Docker """ import os import sys import subprocess DATA_VOLUME_DST = "/data" ZIM_VOLUME_DST = "/zim" DEBUG = False CONTAINER_NAME = 'zimwriterfs' IMAGE_NAME = 'openzim/zimwriterfs' def run(arguments): if str is not bytes: # python3 return subprocess.run(arguments).returncode else: return subprocess.call(arguments) def volumes_from(html_folder, zim_file): # make sure targets are expanded html_folder = os.path.expanduser(html_folder) zim_file = os.path.expanduser(zim_file) # docker command line parameters format for volume attachment vol = lambda src, dst: ['-v', "{src}:{dst}".format(src=src, dst=dst)] # outputing a list of volume-attach-params # and actual zimwriterfs params for html_folder and zim_file d = {'volumes': [], 'html_folder_path': None, 'zim_file_path': None} # html folder volume should be parent of target hvolume, hfolder = os.path.split(html_folder) \ if os.path.isabs(html_folder) \ else (os.getcwd(), html_folder) d['volumes'].append(vol(hvolume, DATA_VOLUME_DST)) d['html_folder_path'] = os.path.join(DATA_VOLUME_DST, hfolder) # zim-file volume should be parent of target if os.path.isabs(zim_file): zvolume, zfile = os.path.split(zim_file) else: zparts = [p for p in os.path.split(zim_file)[:-1] if p.strip()] # target parent might be CWD if len(zparts): zvolume = os.path.join(os.getcwd(), os.path.join(*zparts)) else: zvolume = os.getcwd() zfile = zim_file # either mount a single volume as /data or another one as /zim if hvolume != zvolume: d['volumes'].append(vol(zvolume, ZIM_VOLUME_DST)) d['zim_file_path'] = os.path.join(ZIM_VOLUME_DST, zfile) else: d['zim_file_path'] = os.path.join(DATA_VOLUME_DST, zfile) return d def stop_container(): run(['docker', 'stop', CONTAINER_NAME]) def remove_container(): run(['docker', 'rm', '-f', CONTAINER_NAME]) def stop_and_remove_container(): stop_container() remove_container() def start_container(volumes, parameters): command = ['docker', 'run', '--name', CONTAINER_NAME] \ + [vol_param for volume in volumes for vol_param in volume] \ + [IMAGE_NAME, 'zimwriterfs'] + parameters if DEBUG: print(" ".join(command)) return run(command) def main(arguments): if len(arguments) >= 7: main_arguments = arguments[:len(arguments) - 2] html_folder = arguments[len(arguments) - 2] zim_file = arguments[len(arguments) - 1] voldata = volumes_from(html_folder, zim_file) volumes = voldata['volumes'] arguments = main_arguments + [voldata['html_folder_path'], voldata['zim_file_path']] else: volumes = [] stop_and_remove_container() retcode = start_container(volumes, arguments) stop_and_remove_container() sys.exit(retcode) if __name__ == '__main__': main(sys.argv[1:]) zimwriterfs-1.2/format_code.sh000077500000000000000000000007571331076003600165720ustar00rootroot00000000000000#!/usr/bin/bash files=( "article.cpp" "article.h" "articlesource.cpp" "articlesource.h" "indexer.cpp" "indexer.h" "mimetypecounter.cpp" "mimetypecounter.h" "pathTools.cpp" "pathTools.h" "resourceTools.cpp" "resourceTools.h" "tools.cpp" "tools.h" "xapianIndexer.cpp" "xapianIndexer.h" "zimwriterfs.cpp" "xapian/htmlparse.cc" "xapian/htmlparse.h" "xapian/myhtmlparse.cc" "xapian/myhtmlparse.h" "xapian/namedentities.h" ) for i in "${files[@]}" do echo $i clang-format -i -style=file $i done zimwriterfs-1.2/macosx-build.sh000077500000000000000000000044271331076003600166750ustar00rootroot00000000000000#!/bin/bash if [ "x$KIWIX_ROOT" = "x" ]; then echo "You must define envvironment variable KIWIX_ROOT to the root of Kiwix git repository. Exiting." exit 1 fi ZIM_DIR="${KIWIX_ROOT}/src/dependencies/zimlib-1.2" LIBZIM_DIR="${ZIM_DIR}/build/lib" LZMA_DIR="${KIWIX_ROOT}/src/dependencies/xz/build" LIBLZMA_DIR="${LZMA_DIR}/lib" MAGIC_DIR="/usr/local/Cellar/libmagic/5.22_1" LIBMAGIC_DIR="${MAGIC_DIR}/lib" STATIC_LDFLAGS="${LIBZIM_DIR}/libzim.a ${LIBLZMA_DIR}/liblzma.a ${LIBMAGIC_DIR}/libmagic.a -lz" CC="clang -O3" CXX="clang++ -O3" CXXFLAGS="-Igumbo -I${ZIM_DIR}/include -I${MAGIC_DIR}/include/ -I${LZMA_DIR}/include" CFLAGS="$CXXFLAGS" LDFLAGS="-L. -lzim -llzma -lmagic -lz" SHARED_OUTPUT="zimwriterfs-shared" STATIC_OUTPUT="zimwriterfs-static" function compile { $CXX $CXXFLAGS -c zimwriterfs.cpp $CC $CFLAGS -c gumbo/utf8.c $CC $CFLAGS -c gumbo/string_buffer.c $CC $CFLAGS -c gumbo/parser.c $CC $CFLAGS -c gumbo/error.c $CC $CFLAGS -c gumbo/string_piece.c $CC $CFLAGS -c gumbo/tag.c $CC $CFLAGS -c gumbo/vector.c $CC $CFLAGS -c gumbo/tokenizer.c $CC $CFLAGS -c gumbo/util.c $CC $CFLAGS -c gumbo/char_ref.c $CC $CFLAGS -c gumbo/attribute.c } echo "Compiling zimwriterfs for OSX as static then shared." # remove object files echo "Clean-up repository (*.o, zimwriterfs-*, *.dylib)" rm *.o ${STATIC_OUTPUT} ${SHARED_OUTPUT} *.dylib # compile source code echo "Compile source code file objects" compile # link statically echo "Link statically into ${STATIC_OUTPUT}" $CXX $CXXFLAGS $STATIC_LDFLAGS -o ${STATIC_OUTPUT} *.o # copy dylib to current folder echo "Copy dylibs into the current folder" cp -v ${KIWIX_ROOT}/src/dependencies/zimlib-1.2/build/lib/libzim.dylib . cp -v ${KIWIX_ROOT}/src/dependencies/xz/build/lib/liblzma.dylib . cp -v ${LIBMAGIC_DIR}/libmagic.dylib . chmod 644 ./libmagic.dylib # link dynamicaly echo "Link dynamically into ${SHARED_OUTPUT}" $CXX $CXXFLAGS $LDFLAGS -o zimwriterfs-shared *.o echo "Fix install name tool on ${SHARED_OUTPUT}" install_name_tool -change ${LIBZIM_DIR}/libzim.0.dylib libzim.dylib ${SHARED_OUTPUT} install_name_tool -change ${LIBLZMA_DIR}/liblzma.5.dylib liblzma.dylib ${SHARED_OUTPUT} install_name_tool -change ${LIBMAGIC_DIR}/libmagic.1.dylib libmagic.dylib ${SHARED_OUTPUT} otool -L ${SHARED_OUTPUT} ls -lh ${STATIC_OUTPUT} ls -lh ${SHARED_OUTPUT} zimwriterfs-1.2/meson.build000066400000000000000000000037001331076003600161020ustar00rootroot00000000000000project('zimwriterfs', ['c', 'cpp'], version : '1.2', license : 'GPL-3.0-or-later', default_options : ['c_std=c11', 'cpp_std=c++11', 'werror=true']) compiler = meson.get_compiler('cpp') find_library_in_compiler = meson.version().version_compare('>=0.31.0') static_linkage = get_option('static-linkage') if static_linkage add_global_link_arguments('-static-libstdc++', '--static', language:'cpp') endif conf = configuration_data() thread_dep = dependency('threads') libzim_dep = dependency('libzim', version : '>=4.0.0', static:static_linkage) zlib_dep = dependency('zlib', static:static_linkage) gumbo_dep = dependency('gumbo', static:static_linkage) magic_include_path = '' magic_prefix_install = get_option('magic-install-prefix') if magic_prefix_install == '' if compiler.has_header('magic.h') if find_library_in_compiler magic_lib = compiler.find_library('magic') else magic_lib = find_library('magic') endif magic_dep = declare_dependency(link_args:['-lmagic']) else error('magic.h not found') endif else if not find_library_in_compiler error('For custom magic_prefix_install you need a meson version >=0.31.0') endif magic_include_path = magic_prefix_install + '/include' magic_include_args = ['-I'+magic_include_path] if compiler.has_header('magic.h', args:magic_include_args) magic_include_dir = include_directories(magic_include_path, is_system:true) magic_lib_path = join_paths(magic_prefix_install, get_option('libdir')) magic_lib = compiler.find_library('magic', dirs:magic_lib_path, required:false) if not magic_lib.found() magic_lib_path = join_paths(magic_prefix_install, 'lib') magic_lib = compiler.find_library('magic', dirs:magic_lib_path) endif magic_link_args = ['-L'+magic_lib_path, '-lmagic'] magic_dep = declare_dependency(include_directories:magic_include_dir, link_args:magic_link_args) else error('magic.h not found') endif endif subdir('src') zimwriterfs-1.2/meson_options.txt000066400000000000000000000003501331076003600173730ustar00rootroot00000000000000option('static-linkage', type : 'boolean', value : false, description : 'Create statically linked binaries.') option('magic-install-prefix', type : 'string', value : '', description : 'Prefix where libmagic has been installed') zimwriterfs-1.2/src/000077500000000000000000000000001331076003600145275ustar00rootroot00000000000000zimwriterfs-1.2/src/article.cpp000066400000000000000000000226221331076003600166620ustar00rootroot00000000000000/* * Copyright 2013-2016 Emmanuel Engelhart * Copyright 2016 Matthieu Gautier * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 3 of the License, or * 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., 51 Franklin Street, Fifth Floor, Boston, * MA 02110-1301, USA. */ #include "article.h" #include "tools.h" #include #include #include extern std::string directoryPath; std::string Article::getAid() const { return aid; } char Article::getNamespace() const { return ns; } std::string Article::getUrl() const { return url; } std::string Article::getTitle() const { return title; } bool Article::isRedirect() const { return !redirectAid.empty(); } std::string Article::getMimeType() const { return mimeType; } std::string Article::getRedirectAid() const { return redirectAid; } bool Article::shouldCompress() const { return getMimeType().find("text") == 0 || getMimeType() == "application/javascript" || getMimeType() == "application/json" || getMimeType() == "image/svg+xml"; } bool FileArticle::shouldIndex() const { return getMimeType().find("text/html") == 0; } void FileArticle::readData() const { data = getFileContent(_getFilename()); dataRead = true; } FileArticle::FileArticle(const std::string& path, const bool detectRedirects) : dataRead(false) { invalid = false; /* aid */ aid = path.substr(directoryPath.size() + 1); /* url */ url = aid; /* mime-type */ mimeType = getMimeTypeForFile(aid); /* namespace */ ns = getNamespaceForMimeType(mimeType)[0]; /* HTML specific code */ if ( mimeType.find("text/html") != std::string::npos || mimeType.find("text/css") != std::string::npos ) { readData(); } if ( mimeType.find("text/html") != std::string::npos ) { parseAndAdaptHtml(detectRedirects); } else if (mimeType.find("text/css") != std::string::npos) { adaptCss(); } } bool FileArticle::isInvalid() const { return invalid; } void FileArticle::parseAndAdaptHtml(bool detectRedirects) { GumboOutput* output = gumbo_parse(data.c_str()); GumboNode* root = output->root; /* Search the content of the tag in the HTML */ if (root->type == GUMBO_NODE_ELEMENT && root->v.element.children.length >= 2) { const GumboVector* root_children = &root->v.element.children; GumboNode* head = NULL; for (unsigned int i = 0; i < root_children->length; ++i) { GumboNode* child = (GumboNode*)(root_children->data[i]); if (child->type == GUMBO_NODE_ELEMENT && child->v.element.tag == GUMBO_TAG_HEAD) { head = child; break; } } if (head != NULL) { GumboVector* head_children = &head->v.element.children; for (unsigned int i = 0; i < head_children->length; ++i) { GumboNode* child = (GumboNode*)(head_children->data[i]); if (child->type == GUMBO_NODE_ELEMENT && child->v.element.tag == GUMBO_TAG_TITLE) { if (child->v.element.children.length == 1) { GumboNode* title_text = (GumboNode*)(child->v.element.children.data[0]); if (title_text->type == GUMBO_NODE_TEXT) { title = title_text->v.text.text; stripTitleInvalidChars(title); } } } } /* Detect if this is a redirection (if no redirects TSV file specified) */ std::string targetUrl; try { targetUrl = detectRedirects ? extractRedirectUrlFromHtml(head_children) : ""; } catch (std::string& error) { std::cerr << error << std::endl; } if (!targetUrl.empty()) { redirectAid = computeAbsolutePath(aid, decodeUrl(targetUrl)); if (!fileExists(directoryPath + "/" + redirectAid)) { redirectAid.clear(); invalid = true; } } /* If no title, then compute one from the filename */ if (title.empty()) { auto path = _getFilename(); auto found = path.rfind("/"); if (found != std::string::npos) { title = path.substr(found + 1); found = title.rfind("."); if (found != std::string::npos) { title = title.substr(0, found); } } else { title = path; } std::replace(title.begin(), title.end(), '_', ' '); } } } /* Update links in the html to let them still be valid */ std::map<std::string, bool> links; getLinks(root, links); std::string longUrl = std::string("/") + ns + "/" + url; /* If a link appearch to be duplicated in the HTML, it will occurs only one time in the links variable */ for (auto& linkPair: links) { auto target = linkPair.first; if (!target.empty() && target[0] != '#' && target[0] != '?' && target.substr(0, 5) != "data:") { replaceStringInPlace(data, "\"" + target + "\"", "\"" + computeNewUrl(aid, longUrl, target) + "\""); } } gumbo_destroy_output(&kGumboDefaultOptions, output); } void FileArticle::adaptCss() { /* Rewrite url() values in the CSS */ size_t startPos = 0; size_t endPos = 0; std::string url; std::string longUrl = std::string("/") + ns + "/" + this->url; while ((startPos = data.find("url(", endPos)) && startPos != std::string::npos) { /* URL delimiters */ endPos = data.find(")", startPos); startPos = startPos + (data[startPos + 4] == '\'' || data[startPos + 4] == '"' ? 5 : 4); endPos = endPos - (data[endPos - 1] == '\'' || data[endPos - 1] == '"' ? 1 : 0); url = data.substr(startPos, endPos - startPos); std::string startDelimiter = data.substr(startPos - 1, 1); std::string endDelimiter = data.substr(endPos, 1); if (url.substr(0, 5) != "data:") { /* Deal with URL with arguments (using '? ') */ std::string path = url; size_t markPos = url.find("?"); if (markPos != std::string::npos) { path = url.substr(0, markPos); } /* Embeded fonts need to be inline because Kiwix is otherwise not able to load same because of the same-origin security */ std::string mimeType = getMimeTypeForFile(path); if (mimeType == "application/font-ttf" || mimeType == "application/font-woff" || mimeType == "application/vnd.ms-opentype" || mimeType == "application/vnd.ms-fontobject") { try { std::string fontContent = getFileContent( directoryPath + "/" + computeAbsolutePath(aid, path)); replaceStringInPlaceOnce( data, startDelimiter + url + endDelimiter, startDelimiter + "data:" + mimeType + ";base64," + base64_encode(reinterpret_cast<const unsigned char*>( fontContent.c_str()), fontContent.length()) + endDelimiter); } catch (...) { } } else { /* Deal with URL with arguments (using '? ') */ if (markPos != std::string::npos) { endDelimiter = url.substr(markPos, 1); } replaceStringInPlaceOnce( data, startDelimiter + url + endDelimiter, startDelimiter + computeNewUrl(aid, longUrl, path) + endDelimiter); } } } } zim::Blob FileArticle::getData() const { if (!dataRead) readData(); return zim::Blob(data.data(), data.size()); } std::string FileArticle::_getFilename() const { return directoryPath + "/" + aid; } std::string FileArticle::getFilename() const { // If data is read (because we changed the content), use the content // not the content of the filename. if (dataRead) return ""; return _getFilename(); } zim::size_type FileArticle::getSize() const { if (dataRead) { return data.size(); } std::ifstream in(_getFilename(), std::ios::binary|std::ios::ate); return in.tellg(); } SimpleMetadataArticle::SimpleMetadataArticle(const std::string& id, const std::string& value) : MetadataArticle(id), value(value) { } MetadataDateArticle::MetadataDateArticle() : MetadataArticle("Date") { } void MetadataDateArticle::genDate() const { time_t t = time(0); struct tm* now = localtime(&t); std::stringstream stream; stream << (now->tm_year + 1900) << '-' << std::setw(2) << std::setfill('0') << (now->tm_mon + 1) << '-' << std::setw(2) << std::setfill('0') << now->tm_mday; data = stream.str(); } zim::Blob MetadataDateArticle::getData() const { if (data.empty()) { genDate(); } return zim::Blob(data.data(), data.size()); } zim::size_type MetadataDateArticle::getSize() const { if(data.empty()) { genDate(); } return data.size(); } ��������������������������������������������������������������������������������������������������������������zimwriterfs-1.2/src/article.h�����������������������������������������������������������������������0000664�0000000�0000000�00000012645�13310760036�0016333�0����������������������������������������������������������������������������������������������������ustar�00root����������������������������root����������������������������0000000�0000000������������������������������������������������������������������������������������������������������������������������������������������������������������������������/* * Copyright 2013-2016 Emmanuel Engelhart <kelson@kiwix.org> * Copyright 2016 Matthieu Gautier <mgautier@kymeria.fr> * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 3 of the License, or * 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., 51 Franklin Street, Fifth Floor, Boston, * MA 02110-1301, USA. */ #ifndef OPENZIM_ZIMWRITERFS_ARTICLE_H #define OPENZIM_ZIMWRITERFS_ARTICLE_H #include <zim/blob.h> #include <zim/writer/zimcreator.h> #include <string> extern std::string favicon; class Article : public zim::writer::Article { protected: char ns; std::string aid; std::string url; std::string title; std::string mimeType; std::string redirectAid; public: virtual std::string getAid() const; virtual char getNamespace() const; virtual std::string getUrl() const; virtual std::string getTitle() const; virtual bool isRedirect() const; virtual std::string getMimeType() const; virtual std::string getRedirectAid() const; virtual bool shouldCompress() const; virtual ~Article(){}; }; class MetadataArticle : public zim::writer::Article { protected: std::string id; public: explicit MetadataArticle(const std::string& id) : id(id) {}; virtual std::string getAid() const { return "/M/" + id; } virtual char getNamespace() const { return 'M'; } virtual std::string getUrl() const { return id; } virtual bool isInvalid() const { return false; } virtual std::string getTitle() const { return ""; } virtual bool isRedirect() const { return false; } virtual bool isLinktarget() const { return false; } virtual bool isDeleted() const { return false; } virtual std::string getMimeType() const { return "text/plain"; } virtual std::string getRedirectAid() const { return ""; } virtual bool shouldIndex() const { return false; } virtual bool shouldCompress() const { return true; } virtual std::string getFilename() const { return ""; } }; class SimpleMetadataArticle : public MetadataArticle { private: std::string value; public: explicit SimpleMetadataArticle(const std::string& id, const std::string& value); virtual zim::Blob getData() const { return zim::Blob(value.c_str(), value.size()); } virtual zim::size_type getSize() const { return value.size(); } }; class MetadataFaviconArticle : public MetadataArticle { private: std::string redirectAid; public: explicit MetadataFaviconArticle(std::string value) : MetadataArticle(""), redirectAid(value) {} virtual std::string getAid() const { return "/-/Favicon"; } virtual char getNamespace() const { return '-'; } virtual std::string getUrl() const { return "favicon"; } virtual bool isInvalid() const { return false; } virtual std::string getTitle() const { return ""; } virtual bool isRedirect() const { return true; } virtual std::string getMimeType() const { return "image/png"; } virtual std::string getRedirectAid() const { return redirectAid; } virtual bool shouldIndex() const { return false; } virtual bool shouldCompress() const { return false; } virtual std::string getFilename() const { return ""; } virtual zim::Blob getData() const { return zim::Blob(); } virtual zim::size_type getSize() const { return 0; } }; class MetadataDateArticle : public MetadataArticle { private: mutable std::string data; void genDate() const; public: MetadataDateArticle(); virtual zim::Blob getData() const; virtual zim::size_type getSize() const; }; class FileArticle : public Article { private: mutable std::string data; mutable bool dataRead; bool invalid; std::string _getFilename() const; void readData() const; void parseAndAdaptHtml(bool detectRedirects); void adaptCss(); public: explicit FileArticle(const std::string& path, const bool detectRedirects = true); virtual zim::Blob getData() const; virtual bool isLinktarget() const { return false; } virtual bool isDeleted() const { return false; } virtual bool shouldIndex() const; virtual zim::size_type getSize() const; virtual std::string getFilename() const; virtual bool isInvalid() const; }; class RedirectArticle : public Article { public: RedirectArticle(const std::string& line) { size_t start; size_t end; ns = line[0]; end = line.find_first_of("\t", 2); url = line.substr(2, end - 2); start = end + 1; end = line.find_first_of("\t", start); title = line.substr(start, end - start); redirectAid = line.substr(end + 1); aid = "/" + line.substr(0, 1) + "/" + url; mimeType = "text/plain"; } virtual zim::Blob getData() const { return zim::Blob(); } virtual bool isRedirect() const { return true; } virtual bool isLinktarget() const { return false; } virtual bool isDeleted() const { return false; } virtual bool shouldIndex() const { return false; } virtual zim::size_type getSize() const { return 0; } virtual std::string getFilename() const { return ""; } }; #endif // OPENZIM_ZIMWRITERFS_ARTICLE_H �������������������������������������������������������������������������������������������zimwriterfs-1.2/src/config.h.in���������������������������������������������������������������������0000664�0000000�0000000�00000000032�13310760036�0016545�0����������������������������������������������������������������������������������������������������ustar�00root����������������������������root����������������������������0000000�0000000������������������������������������������������������������������������������������������������������������������������������������������������������������������������ #mesondefine HAVE_XAPIAN ������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������zimwriterfs-1.2/src/meson.build���������������������������������������������������������������������0000664�0000000�0000000�00000001045�13310760036�0016671�0����������������������������������������������������������������������������������������������������ustar�00root����������������������������root����������������������������0000000�0000000������������������������������������������������������������������������������������������������������������������������������������������������������������������������configure_file(output : 'config.h', configuration : conf, input : 'config.h.in') sources = [ 'zimwriterfs.cpp', 'tools.cpp', 'article.cpp', 'zimcreatorfs.cpp', 'mimetypecounter.cpp' ] deps = [thread_dep, libzim_dep, zlib_dep, gumbo_dep, magic_dep] zimwriterfs = executable('zimwriterfs', sources, dependencies : deps, install : true, install_rpath : join_paths(get_option('prefix'), get_option('libdir'))) �������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������zimwriterfs-1.2/src/mimetypecounter.cpp�������������������������������������������������������������0000664�0000000�0000000�00000003502�13310760036�0020464�0����������������������������������������������������������������������������������������������������ustar�00root����������������������������root����������������������������0000000�0000000������������������������������������������������������������������������������������������������������������������������������������������������������������������������/* * Copyright 2013-2016 Emmanuel Engelhart <kelson@kiwix.org> * Copyright 2016 Matthieu Gautier <mgautier@kymeria.fr> * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 3 of the License, or * 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., 51 Franklin Street, Fifth Floor, Boston, * MA 02110-1301, USA. */ #include "mimetypecounter.h" #include <sstream> MetadataCounterArticle::MetadataCounterArticle(MimetypeCounter* counter) : MetadataArticle("Counter"), counter(counter) { } void MetadataCounterArticle::genData() const{ std::stringstream stream; for (std::map<std::string, unsigned int>::iterator it = counter->counters.begin(); it != counter->counters.end(); ++it) { stream << it->first << "=" << it->second << ";"; } data = stream.str(); } zim::Blob MetadataCounterArticle::getData() const { if (data.empty()) genData(); return zim::Blob(data.data(), data.size()); } zim::size_type MetadataCounterArticle::getSize() const { if (data.empty()) genData(); return data.size(); } void MimetypeCounter::handleArticle(const zim::writer::Article& article) { if (article.isRedirect()) { return; } std::string mimeType = article.getMimeType(); if (counters.find(mimeType) == counters.end()) { counters[mimeType] = 1; } else { counters[mimeType]++; } } ����������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������zimwriterfs-1.2/src/mimetypecounter.h���������������������������������������������������������������0000664�0000000�0000000�00000003174�13310760036�0020136�0����������������������������������������������������������������������������������������������������ustar�00root����������������������������root����������������������������0000000�0000000������������������������������������������������������������������������������������������������������������������������������������������������������������������������/* * Copyright 2013-2016 Emmanuel Engelhart <kelson@kiwix.org> * Copyright 2016 Matthieu Gautier <mgautier@kymeria.fr> * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 3 of the License, or * 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., 51 Franklin Street, Fifth Floor, Boston, * MA 02110-1301, USA. */ #ifndef OPENZIM_ZIMWRITERFS_MIMETYPECOUNTER_H #define OPENZIM_ZIMWRITERFS_MIMETYPECOUNTER_H #include "article.h" #include "zimcreatorfs.h" #include <map> class MimetypeCounter; class MetadataCounterArticle : public MetadataArticle { private: MimetypeCounter* counter; mutable std::string data; void genData() const; public: MetadataCounterArticle(MimetypeCounter* counter); virtual zim::Blob getData() const; virtual zim::size_type getSize() const; }; class MimetypeCounter : public IHandler { public: void handleArticle(const zim::writer::Article& article); zim::writer::Article* getMetaArticle() { return new MetadataCounterArticle(this); } private: std::map<std::string, unsigned int> counters; friend class MetadataCounterArticle; }; #endif // OPENZIM_ZIMWRITERFS_MIMETYPECOUNTER_H ����������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������zimwriterfs-1.2/src/queue.h�������������������������������������������������������������������������0000664�0000000�0000000�00000004624�13310760036�0016032�0����������������������������������������������������������������������������������������������������ustar�00root����������������������������root����������������������������0000000�0000000������������������������������������������������������������������������������������������������������������������������������������������������������������������������/* * Copyright 2016 Matthieu Gautier <mgautier@kymeria.fr> * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 3 of the License, or * 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., 51 Franklin Street, Fifth Floor, Boston, * MA 02110-1301, USA. */ #ifndef OPENZIM_ZIMWRITERFS_QUEUE_H #define OPENZIM_ZIMWRITERFS_QUEUE_H #define MAX_QUEUE_SIZE 100 #include <pthread.h> #include <unistd.h> template<typename T> class Queue { public: Queue() {pthread_mutex_init(&m_queueMutex,NULL);}; virtual ~Queue() {pthread_mutex_destroy(&m_queueMutex);}; virtual bool isEmpty(); virtual void pushToQueue(const T& element); virtual bool popFromQueue(T &filename); protected: std::queue<T> m_realQueue; pthread_mutex_t m_queueMutex; private: // Make this queue non copyable Queue(const Queue&); Queue& operator=(const Queue&); }; template<typename T> bool Queue<T>::isEmpty() { pthread_mutex_lock(&m_queueMutex); bool retVal = m_realQueue.empty(); pthread_mutex_unlock(&m_queueMutex); return retVal; } template<typename T> void Queue<T>::pushToQueue(const T &element) { unsigned int wait = 0; unsigned int queueSize = 0; do { usleep(wait); pthread_mutex_lock(&m_queueMutex); queueSize = m_realQueue.size(); pthread_mutex_unlock(&m_queueMutex); wait += 10; } while (queueSize > MAX_QUEUE_SIZE); pthread_mutex_lock(&m_queueMutex); m_realQueue.push(element); pthread_mutex_unlock(&m_queueMutex); } template<typename T> bool Queue<T>::popFromQueue(T &element) { pthread_mutex_lock(&m_queueMutex); if (m_realQueue.empty()) { pthread_mutex_unlock(&m_queueMutex); return false; } element = m_realQueue.front(); m_realQueue.pop(); pthread_mutex_unlock(&m_queueMutex); return true; } #endif // OPENZIM_ZIMWRITERFS_QUEUE_H������������������������������������������������������������������������������������������������������������zimwriterfs-1.2/src/tools.cpp�����������������������������������������������������������������������0000664�0000000�0000000�00000042524�13310760036�0016402�0����������������������������������������������������������������������������������������������������ustar�00root����������������������������root����������������������������0000000�0000000������������������������������������������������������������������������������������������������������������������������������������������������������������������������/* * Copyright 2013-2016 Emmanuel Engelhart <kelson@kiwix.org> * Copyright 2016 Matthieu Gautier <mgautier@kymeria.fr> * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 3 of the License, or * 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., 51 Franklin Street, Fifth Floor, Boston, * MA 02110-1301, USA. */ #include "tools.h" #include <dirent.h> #include <magic.h> #include <string.h> #include <sys/stat.h> #include <zlib.h> #include <cerrno> #include <fstream> #include <iostream> #include <sstream> #include <stdexcept> #include <vector> #include <memory> #include <unicode/translit.h> #include <unicode/ucnv.h> #ifdef _WIN32 #define SEPARATOR "\\" #else #define SEPARATOR "/" #endif /* Init file extensions hash */ static std::map<std::string, std::string> _create_extMimeTypes() { std::map<std::string, std::string> extMimeTypes; extMimeTypes["HTML"] = "text/html"; extMimeTypes["html"] = "text/html"; extMimeTypes["HTM"] = "text/html"; extMimeTypes["htm"] = "text/html"; extMimeTypes["PNG"] = "image/png"; extMimeTypes["png"] = "image/png"; extMimeTypes["TIFF"] = "image/tiff"; extMimeTypes["tiff"] = "image/tiff"; extMimeTypes["TIF"] = "image/tiff"; extMimeTypes["tif"] = "image/tiff"; extMimeTypes["JPEG"] = "image/jpeg"; extMimeTypes["jpeg"] = "image/jpeg"; extMimeTypes["JPG"] = "image/jpeg"; extMimeTypes["jpg"] = "image/jpeg"; extMimeTypes["GIF"] = "image/gif"; extMimeTypes["gif"] = "image/gif"; extMimeTypes["SVG"] = "image/svg+xml"; extMimeTypes["svg"] = "image/svg+xml"; extMimeTypes["TXT"] = "text/plain"; extMimeTypes["txt"] = "text/plain"; extMimeTypes["XML"] = "text/xml"; extMimeTypes["xml"] = "text/xml"; extMimeTypes["EPUB"] = "application/epub+zip"; extMimeTypes["epub"] = "application/epub+zip"; extMimeTypes["PDF"] = "application/pdf"; extMimeTypes["pdf"] = "application/pdf"; extMimeTypes["OGG"] = "application/ogg"; extMimeTypes["ogg"] = "application/ogg"; extMimeTypes["JS"] = "application/javascript"; extMimeTypes["js"] = "application/javascript"; extMimeTypes["JSON"] = "application/json"; extMimeTypes["json"] = "application/json"; extMimeTypes["CSS"] = "text/css"; extMimeTypes["css"] = "text/css"; extMimeTypes["otf"] = "application/vnd.ms-opentype"; extMimeTypes["OTF"] = "application/vnd.ms-opentype"; extMimeTypes["eot"] = "application/vnd.ms-fontobject"; extMimeTypes["EOT"] = "application/vnd.ms-fontobject"; extMimeTypes["ttf"] = "application/font-ttf"; extMimeTypes["TTF"] = "application/font-ttf"; extMimeTypes["woff"] = "application/font-woff"; extMimeTypes["WOFF"] = "application/font-woff"; extMimeTypes["vtt"] = "text/vtt"; extMimeTypes["VTT"] = "text/vtt"; return extMimeTypes; } static std::map<std::string, std::string> extMimeTypes = _create_extMimeTypes(); static std::map<std::string, std::string> fileMimeTypes; extern std::string directoryPath; extern bool inflateHtmlFlag; extern bool uniqueNamespace; extern magic_t magic; /* Decompress an STL string using zlib and return the original data. */ inline std::string inflateString(const std::string& str) { z_stream zs; // z_stream is zlib's control structure memset(&zs, 0, sizeof(zs)); if (inflateInit(&zs) != Z_OK) throw(std::runtime_error("inflateInit failed while decompressing.")); zs.next_in = (Bytef*)str.data(); zs.avail_in = str.size(); int ret; char outbuffer[32768]; std::string outstring; // get the decompressed bytes blockwise using repeated calls to inflate do { zs.next_out = reinterpret_cast<Bytef*>(outbuffer); zs.avail_out = sizeof(outbuffer); ret = inflate(&zs, 0); if (outstring.size() < zs.total_out) { outstring.append(outbuffer, zs.total_out - outstring.size()); } } while (ret == Z_OK); inflateEnd(&zs); if (ret != Z_STREAM_END) { // an error occurred that was not EOF std::ostringstream oss; oss << "Exception during zlib decompression: (" << ret << ") " << zs.msg; throw(std::runtime_error(oss.str())); } return outstring; } inline bool seemsToBeHtml(const std::string& path) { if (path.find_last_of(".") != std::string::npos) { std::string mimeType = path.substr(path.find_last_of(".") + 1); if (extMimeTypes.find(mimeType) != extMimeTypes.end()) { return "text/html" == extMimeTypes[mimeType]; } } return false; } std::string getFileContent(const std::string& path) { std::ifstream in(path, std::ios::binary| std::ios::ate); if (in) { std::string contents; contents.resize(in.tellg()); in.seekg(0, std::ios::beg); in.read(&contents[0], contents.size()); in.close(); /* Inflate if necessary */ if (inflateHtmlFlag && seemsToBeHtml(path)) { try { contents = inflateString(contents); } catch (...) { std::cerr << "Can not initialize inflate stream for: " << path << std::endl; } } return (contents); } std::cerr << "zimwriterfs: unable to open file at path: " << path << std::endl; throw(errno); } unsigned int getFileSize(const std::string& path) { struct stat filestatus; stat(path.c_str(), &filestatus); return filestatus.st_size; } bool fileExists(const std::string& path) { bool flag = false; std::fstream fin; fin.open(path.c_str(), std::ios::in); if (fin.is_open()) { flag = true; } fin.close(); return flag; } /* base64 */ static const std::string base64_chars = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" "abcdefghijklmnopqrstuvwxyz" "0123456789+/"; std::string base64_encode(unsigned char const* bytes_to_encode, unsigned int in_len) { std::string ret; int i = 0; int j = 0; unsigned char char_array_3[3]; unsigned char char_array_4[4]; while (in_len--) { char_array_3[i++] = *(bytes_to_encode++); if (i == 3) { char_array_4[0] = (char_array_3[0] & 0xfc) >> 2; char_array_4[1] = ((char_array_3[0] & 0x03) << 4) + ((char_array_3[1] & 0xf0) >> 4); char_array_4[2] = ((char_array_3[1] & 0x0f) << 2) + ((char_array_3[2] & 0xc0) >> 6); char_array_4[3] = char_array_3[2] & 0x3f; for (i = 0; (i < 4); i++) ret += base64_chars[char_array_4[i]]; i = 0; } } if (i) { for (j = i; j < 3; j++) char_array_3[j] = '\0'; char_array_4[0] = (char_array_3[0] & 0xfc) >> 2; char_array_4[1] = ((char_array_3[0] & 0x03) << 4) + ((char_array_3[1] & 0xf0) >> 4); char_array_4[2] = ((char_array_3[1] & 0x0f) << 2) + ((char_array_3[2] & 0xc0) >> 6); char_array_4[3] = char_array_3[2] & 0x3f; for (j = 0; (j < i + 1); j++) ret += base64_chars[char_array_4[j]]; while ((i++ < 3)) ret += '='; } return ret; } static char charFromHex(std::string a) { std::istringstream Blat(a); int Z; Blat >> std::hex >> Z; return char(Z); } std::string decodeUrl(const std::string& originalUrl) { std::string url = originalUrl; std::string::size_type pos = 0; while ((pos = url.find('%', pos)) != std::string::npos && pos + 2 < url.length()) { url.replace(pos, 3, 1, charFromHex(url.substr(pos + 1, 2))); ++pos; } return url; } std::string removeLastPathElement(const std::string& path, const bool removePreSeparator, const bool removePostSeparator) { std::string newPath = path; size_t offset = newPath.find_last_of(SEPARATOR); if (removePreSeparator && offset == newPath.length() - 1) { newPath = newPath.substr(0, offset); offset = newPath.find_last_of(SEPARATOR); } newPath = removePostSeparator ? newPath.substr(0, offset) : newPath.substr(0, offset + 1); return newPath; } /* Split string in a token array */ std::vector<std::string> split(const std::string& str, const std::string& delims = " *-") { std::string::size_type lastPos = str.find_first_not_of(delims, 0); std::string::size_type pos = str.find_first_of(delims, lastPos); std::vector<std::string> tokens; while (std::string::npos != pos || std::string::npos != lastPos) { tokens.push_back(str.substr(lastPos, pos - lastPos)); lastPos = str.find_first_not_of(delims, pos); pos = str.find_first_of(delims, lastPos); } return tokens; } std::vector<std::string> split(const char* lhs, const char* rhs) { const std::string m1(lhs), m2(rhs); return split(m1, m2); } std::vector<std::string> split(const char* lhs, const std::string& rhs) { return split(lhs, rhs.c_str()); } std::vector<std::string> split(const std::string& lhs, const char* rhs) { return split(lhs.c_str(), rhs); } /* Warning: the relative path must be with slashes */ std::string computeAbsolutePath(const std::string& path, const std::string& relativePath) { /* Add a trailing / to the path if necessary */ std::string absolutePath = path[path.length() - 1] == '/' ? path : removeLastPathElement(path, false, false); /* Go through relative path */ std::vector<std::string> relativePathElements; std::stringstream relativePathStream(relativePath); std::string relativePathItem; while (std::getline(relativePathStream, relativePathItem, '/')) { if (relativePathItem == "..") { absolutePath = removeLastPathElement(absolutePath, true, false); } else if (!relativePathItem.empty() && relativePathItem != ".") { absolutePath += relativePathItem; absolutePath += "/"; } } /* Remove wront trailing / */ return absolutePath.substr(0, absolutePath.length() - 1); } /* Warning: the relative path must be with slashes */ std::string computeRelativePath(const std::string path, const std::string absolutePath) { std::vector<std::string> pathParts = split(path, "/"); std::vector<std::string> absolutePathParts = split(absolutePath, "/"); unsigned int commonCount = 0; while (commonCount < pathParts.size() && commonCount < absolutePathParts.size() && pathParts[commonCount] == absolutePathParts[commonCount]) { if (!pathParts[commonCount].empty()) { commonCount++; } } std::string relativePath; for (unsigned int i = commonCount; i < pathParts.size() - 1; i++) { relativePath += "../"; } for (unsigned int i = commonCount; i < absolutePathParts.size(); i++) { relativePath += absolutePathParts[i]; relativePath += i + 1 < absolutePathParts.size() ? "/" : ""; } return relativePath; } static bool isLocalUrl(const std::string url) { if (url.find(":") != std::string::npos) { return (!(url.find("://") != std::string::npos || url.find("//") == 0 || url.find("tel:") == 0 || url.find("geo:") == 0 || url.find("javascript:") == 0 || url.find("mailto:") == 0)); } return true; } std::string extractRedirectUrlFromHtml(const GumboVector* head_children) { std::string url; for (unsigned int i = 0; i < head_children->length; ++i) { GumboNode* child = (GumboNode*)(head_children->data[i]); if (child->type == GUMBO_NODE_ELEMENT && child->v.element.tag == GUMBO_TAG_META) { GumboAttribute* attribute; if ((attribute = gumbo_get_attribute(&child->v.element.attributes, "http-equiv")) != NULL) { if (!strcmp(attribute->value, "refresh")) { if ((attribute = gumbo_get_attribute(&child->v.element.attributes, "content")) != NULL) { std::string targetUrl = attribute->value; std::size_t found = targetUrl.find("URL=") != std::string::npos ? targetUrl.find("URL=") : targetUrl.find("url="); if (found != std::string::npos) { url = targetUrl.substr(found + 4); } else { throw std::string( "Unable to find the redirect/refresh target url from the " "HTML DOM"); } } } } } } return url; } void getLinks(GumboNode* node, std::map<std::string, bool>& links) { if (node->type != GUMBO_NODE_ELEMENT) { return; } GumboAttribute* attribute = NULL; attribute = gumbo_get_attribute(&node->v.element.attributes, "href"); if (attribute == NULL) { attribute = gumbo_get_attribute(&node->v.element.attributes, "src"); } if (attribute == NULL) { attribute = gumbo_get_attribute(&node->v.element.attributes, "poster"); } if (attribute != NULL && isLocalUrl(attribute->value)) { links[attribute->value] = true; } GumboVector* children = &node->v.element.children; for (unsigned int i = 0; i < children->length; ++i) { getLinks(static_cast<GumboNode*>(children->data[i]), links); } } void replaceStringInPlaceOnce(std::string& subject, const std::string& search, const std::string& replace) { size_t pos = subject.find(search, 0); if (pos != std::string::npos) { subject.replace(pos, search.length(), replace); } } void replaceStringInPlace(std::string& subject, const std::string& search, const std::string& replace) { size_t pos = 0; while ((pos = subject.find(search, pos)) != std::string::npos) { subject.replace(pos, search.length(), replace); pos += replace.length(); } return; } void stripTitleInvalidChars(std::string& str) { /* Remove unicode orientation invisible characters */ replaceStringInPlace(str, "\u202A", ""); replaceStringInPlace(str, "\u202C", ""); } std::string getMimeTypeForFile(const std::string& filename) { std::string mimeType; /* Try to get the mimeType from the file extension */ auto index_of_last_dot = filename.find_last_of("."); if (index_of_last_dot != std::string::npos) { mimeType = filename.substr(index_of_last_dot + 1); try { return extMimeTypes.at(mimeType); } catch (std::out_of_range) {} } /* Try to get the mimeType from the cache */ try { return fileMimeTypes.at(filename); } catch (std::out_of_range) {} /* Try to get the mimeType with libmagic */ try { std::string path = directoryPath + "/" + filename; mimeType = std::string(magic_file(magic, path.c_str())); if (mimeType.find(";") != std::string::npos) { mimeType = mimeType.substr(0, mimeType.find(";")); } fileMimeTypes[filename] = mimeType; } catch (...) { } if (mimeType.empty()) { return "application/octet-stream"; } else { return mimeType; } } std::string getNamespaceForMimeType(const std::string& mimeType) { if (uniqueNamespace || mimeType.find("text") == 0 || mimeType.empty()) { if (uniqueNamespace || mimeType.find("text/html") == 0 || mimeType.empty()) { return "A"; } else { return "-"; } } else { if (mimeType == "application/font-ttf" || mimeType == "application/font-woff" || mimeType == "application/vnd.ms-opentype" || mimeType == "application/vnd.ms-fontobject" || mimeType == "application/javascript" || mimeType == "application/json") { return "-"; } else { return "I"; } } } inline std::string removeLocalTagAndParameters(const std::string& url) { std::string retVal = url; std::size_t found; /* Remove URL arguments */ found = retVal.find("?"); if (found != std::string::npos) { retVal = retVal.substr(0, found); } /* Remove local tag */ found = retVal.find("#"); if (found != std::string::npos) { retVal = retVal.substr(0, found); } return retVal; } std::string computeNewUrl(const std::string& aid, const std::string& baseUrl, const std::string& targetUrl) { std::string filename = computeAbsolutePath(aid, targetUrl); std::string targetMimeType = getMimeTypeForFile(removeLocalTagAndParameters(decodeUrl(filename))); std::string newUrl = "/" + getNamespaceForMimeType(targetMimeType) + "/" + filename; return computeRelativePath(baseUrl, newUrl); } std::string removeAccents(const std::string& text) { ucnv_setDefaultName("UTF-8"); static UErrorCode status = U_ZERO_ERROR; static std::unique_ptr<icu::Transliterator> removeAccentsTrans(icu::Transliterator::createInstance( "Lower; NFD; [:M:] remove; NFC", UTRANS_FORWARD, status)); icu::UnicodeString ustring(text.c_str()); removeAccentsTrans->transliterate(ustring); std::string unaccentedText; ustring.toUTF8String(unaccentedText); return unaccentedText; } void remove_all(const std::string& path) { DIR* dir; /* It's a directory, remove all its entries first */ if ((dir = opendir(path.c_str())) != NULL) { struct dirent* ent; while ((ent = readdir(dir)) != NULL) { if (strcmp(ent->d_name, ".") and strcmp(ent->d_name, "..")) { std::string childPath = path + SEPARATOR + ent->d_name; remove_all(childPath); } } closedir(dir); rmdir(path.c_str()); } /* It's a file */ else { remove(path.c_str()); } } ����������������������������������������������������������������������������������������������������������������������������������������������������������������������������zimwriterfs-1.2/src/tools.h�������������������������������������������������������������������������0000664�0000000�0000000�00000004652�13310760036�0016047�0����������������������������������������������������������������������������������������������������ustar�00root����������������������������root����������������������������0000000�0000000������������������������������������������������������������������������������������������������������������������������������������������������������������������������/* * Copyright 2013-2016 Emmanuel Engelhart <kelson@kiwix.org> * Copyright 2016 Matthieu Gautier <mgautier@kymeria.fr> * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 3 of the License, or * 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., 51 Franklin Street, Fifth Floor, Boston, * MA 02110-1301, USA. */ #ifndef OPENZIM_ZIMWRITERFS_TOOLS_H #define OPENZIM_ZIMWRITERFS_TOOLS_H #include <gumbo.h> #include <map> #include <string> std::string getMimeTypeForFile(const std::string& filename); std::string getNamespaceForMimeType(const std::string& mimeType); std::string getFileContent(const std::string& path); unsigned int getFileSize(const std::string& path); std::string decodeUrl(const std::string& encodedUrl); std::string computeAbsolutePath(const std::string& path, const std::string& relativePath); bool fileExists(const std::string& path); std::string removeLastPathElement(const std::string& path, const bool removePreSeparator, const bool removePostSeparator); std::string computeNewUrl(const std::string& aid, const std::string& baseUrl, const std::string& targetUrl); std::string base64_encode(unsigned char const* bytes_to_encode, unsigned int in_len); void replaceStringInPlaceOnce(std::string& subject, const std::string& search, const std::string& replace); void replaceStringInPlace(std::string& subject, const std::string& search, const std::string& replace); void stripTitleInvalidChars(std::string& str); std::string extractRedirectUrlFromHtml(const GumboVector* head_children); void getLinks(GumboNode* node, std::map<std::string, bool>& links); std::string removeAccents(const std::string& text); void remove_all(const std::string& path); #endif // OPENZIM_ZIMWRITERFS_TOOLS_H ��������������������������������������������������������������������������������������zimwriterfs-1.2/src/zimcreatorfs.cpp����������������������������������������������������������������0000664�0000000�0000000�00000010231�13310760036�0017740�0����������������������������������������������������������������������������������������������������ustar�00root����������������������������root����������������������������0000000�0000000������������������������������������������������������������������������������������������������������������������������������������������������������������������������/* * Copyright 2013-2016 Emmanuel Engelhart <kelson@kiwix.org> * Copyright 2016 Matthieu Gautier <mgautier@kymeria.fr> * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 3 of the License, or * 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., 51 Franklin Street, Fifth Floor, Boston, * MA 02110-1301, USA. */ #include "zimcreatorfs.h" #include "article.h" #include "tools.h" #include <fstream> #include <dirent.h> #include <sys/stat.h> bool isVerbose(); std::string ZimCreatorFS::getMainPage() { return mainPage; } void ZimCreatorFS::add_redirectArticles_from_file(const std::string& path) { std::ifstream in_stream; std::string line; in_stream.open(path.c_str()); while (std::getline(in_stream, line)) { addArticle(RedirectArticle(line)); } in_stream.close(); } void ZimCreatorFS::visitDirectory(const std::string& path) { if (isVerbose()) std::cout << "Visiting directory " << path << std::endl; DIR* directory; /* Open directory */ directory = opendir(path.c_str()); if (directory == NULL) { std::cerr << "zimwriterfs: unable to open directory " << path << std::endl; exit(1); } /* Read directory content */ struct dirent* entry; while ((entry = readdir(directory)) != NULL) { std::string entryName = entry->d_name; /* Ignore this system navigation virtual directories */ if (entryName == "." || entryName == "..") continue; std::string fullEntryName = path + '/' + entryName; switch (entry->d_type) { case DT_REG: case DT_LNK: { addArticle(fullEntryName); } break; case DT_DIR: visitDirectory(fullEntryName); break; case DT_BLK: std::cerr << "Unable to deal with " << fullEntryName << " (this is a block device)" << std::endl; break; case DT_CHR: std::cerr << "Unable to deal with " << fullEntryName << " (this is a character device)" << std::endl; break; case DT_FIFO: std::cerr << "Unable to deal with " << fullEntryName << " (this is a named pipe)" << std::endl; break; case DT_SOCK: std::cerr << "Unable to deal with " << fullEntryName << " (this is a UNIX domain socket)" << std::endl; break; case DT_UNKNOWN: struct stat s; if (stat(fullEntryName.c_str(), &s) == 0) { if (S_ISREG(s.st_mode)) { addArticle(fullEntryName); } else if (S_ISDIR(s.st_mode)) { visitDirectory(fullEntryName); } else { std::cerr << "Unable to deal with " << fullEntryName << " (no clue what kind of file it is - from stat())" << std::endl; } } else { std::cerr << "Unable to stat " << fullEntryName << std::endl; } break; default: std::cerr << "Unable to deal with " << fullEntryName << " (no clue what kind of file it is)" << std::endl; break; } } closedir(directory); } void ZimCreatorFS::addArticle(const std::string& path) { FileArticle farticle(path); if (farticle.isInvalid()) { return; } addArticle(farticle); } void ZimCreatorFS::addArticle(const zim::writer::Article& article) { ZimCreator::addArticle(article); for (auto& handler: articleHandlers) { handler->handleArticle(article); } } void ZimCreatorFS::finishZimCreation() { for(auto& handler: articleHandlers) { ZimCreator::addArticle(*handler->getMetaArticle()); } ZimCreator::finishZimCreation(); } void ZimCreatorFS::add_customHandler(IHandler* handler) { articleHandlers.push_back(handler); } �����������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������zimwriterfs-1.2/src/zimcreatorfs.h������������������������������������������������������������������0000664�0000000�0000000�00000003564�13310760036�0017420�0����������������������������������������������������������������������������������������������������ustar�00root����������������������������root����������������������������0000000�0000000������������������������������������������������������������������������������������������������������������������������������������������������������������������������/* * Copyright 2013-2016 Emmanuel Engelhart <kelson@kiwix.org> * Copyright 2016 Matthieu Gautier <mgautier@kymeria.fr> * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 3 of the License, or * 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., 51 Franklin Street, Fifth Floor, Boston, * MA 02110-1301, USA. */ #ifndef OPENZIM_ZIMWRITERFS_ZIMCREATORFS_H #define OPENZIM_ZIMWRITERFS_ZIMCREATORFS_H #include <queue> #include <string> #include "article.h" #include <zim/writer/zimcreator.h> class IHandler { public: virtual void handleArticle(const zim::writer::Article& article) = 0; virtual zim::writer::Article* getMetaArticle() = 0; virtual ~IHandler() = default; }; class ZimCreatorFS : public zim::writer::ZimCreator { public: ZimCreatorFS(std::string mainPage) : zim::writer::ZimCreator(true), mainPage(mainPage) {} virtual ~ZimCreatorFS() = default; virtual std::string getMainPage(); virtual void add_customHandler(IHandler* handler); virtual void add_redirectArticles_from_file(const std::string& path); virtual void visitDirectory(const std::string& path); virtual void addArticle(const std::string& path); virtual void addArticle(const zim::writer::Article& article); virtual void finishZimCreation(); private: std::vector<IHandler*> articleHandlers; std::string mainPage; }; #endif // OPENZIM_ZIMWRITERFS_ARTICLESOURCE_H ��������������������������������������������������������������������������������������������������������������������������������������������zimwriterfs-1.2/src/zimwriterfs.cpp�����������������������������������������������������������������0000664�0000000�0000000�00000024102�13310760036�0017617�0����������������������������������������������������������������������������������������������������ustar�00root����������������������������root����������������������������0000000�0000000������������������������������������������������������������������������������������������������������������������������������������������������������������������������/* * Copyright 2013-2016 Emmanuel Engelhart <kelson@kiwix.org> * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 3 of the License, or * 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., 51 Franklin Street, Fifth Floor, Boston, * MA 02110-1301, USA. */ #include <getopt.h> #include <pthread.h> #include <stdio.h> #include <sys/types.h> #include <unistd.h> #include <ctime> #include <magic.h> #include <cstdio> #include <queue> #include "article.h" #include "zimcreatorfs.h" #include "mimetypecounter.h" #include "queue.h" #include "tools.h" #include "config.h" std::string language; std::string creator; std::string publisher; std::string title; std::string tags; std::string name; std::string description; std::string welcome; std::string favicon; std::string directoryPath; std::string redirectsPath; std::string zimPath; bool verboseFlag = false; pthread_mutex_t verboseMutex; bool inflateHtmlFlag = false; bool uniqueNamespace = false; bool withFullTextIndex = false; magic_t magic; bool isVerbose() { pthread_mutex_lock(&verboseMutex); bool retVal = verboseFlag; pthread_mutex_unlock(&verboseMutex); return retVal; } /* Non ZIM related code */ void usage() { std::cout << "Usage: zimwriterfs [mandatory arguments] [optional arguments] " "HTML_DIRECTORY ZIM_FILE" << std::endl; std::cout << std::endl; std::cout << "Purpose:" << std::endl; std::cout << "\tPacking all files (HTML/JS/CSS/JPEG/WEBM/...) belonging to a " "directory in a ZIM file." << std::endl; std::cout << std::endl; std::cout << "Mandatory arguments:" << std::endl; std::cout << "\t-w, --welcome\t\tpath of default/main HTML page. The path " "must be relative to HTML_DIRECTORY." << std::endl; std::cout << "\t-f, --favicon\t\tpath of ZIM file favicon. The path must be " "relative to HTML_DIRECTORY and the image a 48x48 PNG." << std::endl; std::cout << "\t-l, --language\t\tlanguage code of the content in ISO639-3" << std::endl; std::cout << "\t-t, --title\t\ttitle of the ZIM file" << std::endl; std::cout << "\t-d, --description\tshort description of the content" << std::endl; std::cout << "\t-c, --creator\t\tcreator(s) of the content" << std::endl; std::cout << "\t-p, --publisher\t\tcreator of the ZIM file itself" << std::endl; std::cout << std::endl; std::cout << "\tHTML_DIRECTORY\t\tis the path of the directory containing " "the HTML pages you want to put in the ZIM file," << std::endl; std::cout << "\tZIM_FILE\t\tis the path of the ZIM file you want to obtain." << std::endl; std::cout << std::endl; std::cout << "Optional arguments:" << std::endl; std::cout << "\t-v, --verbose\t\tprint processing details on STDOUT" << std::endl; std::cout << "\t-h, --help\t\tprint this help" << std::endl; std::cout << "\t-m, --minChunkSize\tnumber of bytes per ZIM cluster (defaul: 2048)" << std::endl; std::cout << "\t-x, --inflateHtml\ttry to inflate HTML files before packing " "(*.html, *.htm, ...)" << std::endl; std::cout << "\t-u, --uniqueNamespace\tput everything in the same namespace " "'A'. Might be necessary to avoid problems with " "dynamic/javascript data loading." << std::endl; std::cout << "\t-r, --redirects\t\tpath to the TSV file with the list of " "redirects (namespace, url, title, target_url tab separated)." << std::endl; std::cout << "\t-i, --withFullTextIndex\tindex the content and add it to the ZIM." << std::endl; std::cout << "\t-a, --tags\t\ttags - semicolon separated" << std::endl; std::cout << "\t-n, --name\t\tcustom (version independent) identifier for " "the content" << std::endl; std::cout << std::endl; std::cout << "Example:" << std::endl; std::cout << "\tzimwriterfs --welcome=index.html --favicon=m/favicon.png --language=fra --title=foobar --description=mydescription \\\n\t\t\ --creator=Wikipedia --publisher=Kiwix ./my_project_html_directory my_project.zim" << std::endl; std::cout << std::endl; std::cout << "Documentation:" << std::endl; std::cout << "\tzimwriterfs source code: http://www.openzim.org/wiki/Git" << std::endl; std::cout << "\tZIM format: http://www.openzim.org/" << std::endl; std::cout << std::endl; } int main(int argc, char** argv) { int minChunkSize = 2048; /* Argument parsing */ static struct option long_options[] = {{"help", no_argument, 0, 'h'}, {"verbose", no_argument, 0, 'v'}, {"welcome", required_argument, 0, 'w'}, {"minchunksize", required_argument, 0, 'm'}, {"name", required_argument, 0, 'n'}, {"redirects", required_argument, 0, 'r'}, {"inflateHtml", no_argument, 0, 'x'}, {"uniqueNamespace", no_argument, 0, 'u'}, {"favicon", required_argument, 0, 'f'}, {"language", required_argument, 0, 'l'}, {"title", required_argument, 0, 't'}, {"tags", required_argument, 0, 'a'}, {"description", required_argument, 0, 'd'}, {"creator", required_argument, 0, 'c'}, {"publisher", required_argument, 0, 'p'}, {"withFullTextIndex", no_argument, 0, 'i'}, {0, 0, 0, 0}}; int option_index = 0; int c; do { c = getopt_long( argc, argv, "hvixuw:m:f:t:d:c:l:p:r:", long_options, &option_index); if (c != -1) { switch (c) { case 'a': tags = optarg; break; case 'h': usage(); exit(0); break; case 'v': verboseFlag = true; break; case 'x': inflateHtmlFlag = true; break; case 'c': creator = optarg; break; case 'd': description = optarg; break; case 'f': favicon = optarg; break; case 'i': withFullTextIndex = true; break; case 'l': language = optarg; break; case 'm': minChunkSize = atoi(optarg); break; case 'n': name = optarg; break; case 'p': publisher = optarg; break; case 'r': redirectsPath = optarg; break; case 't': title = optarg; break; case 'u': uniqueNamespace = true; break; case 'w': welcome = optarg; break; } } } while (c != -1); while (optind < argc) { if (directoryPath.empty()) { directoryPath = argv[optind++]; } else if (zimPath.empty()) { zimPath = argv[optind++]; } else { break; } } if (directoryPath.empty() || zimPath.empty() || creator.empty() || publisher.empty() || description.empty() || language.empty() || welcome.empty() || favicon.empty()) { if (argc > 1) std::cerr << "zimwriterfs: too few arguments!" << std::endl; usage(); exit(1); } /* Check arguments */ if (directoryPath[directoryPath.length() - 1] == '/') { directoryPath = directoryPath.substr(0, directoryPath.length() - 1); } /* Check metadata */ if (!fileExists(directoryPath + "/" + welcome)) { std::cerr << "zimwriterfs: unable to find welcome page at '" << directoryPath << "/" << welcome << "'. --welcome path/value must be relative to HTML_DIRECTORY." << std::endl; exit(1); } if (!fileExists(directoryPath + "/" + favicon)) { std::cerr << "zimwriterfs: unable to find favicon at " << directoryPath << "/" << favicon << "'. --favicon path/value must be relative to HTML_DIRECTORY." << std::endl; exit(1); } /* System tags */ if (withFullTextIndex) { tags += tags.empty() ? "" : ";"; tags += "_ftindex"; } setenv("ZIM_LZMA_LEVEL", "9e", 1); ZimCreatorFS zimCreator(welcome); zimCreator.setMinChunkSize(minChunkSize); zimCreator.setIndexing(withFullTextIndex, language); zimCreator.startZimCreation(zimPath); zimCreator.addArticle(SimpleMetadataArticle("Language", language)); zimCreator.addArticle(SimpleMetadataArticle("Publisher", publisher)); zimCreator.addArticle(SimpleMetadataArticle("Creator", creator)); zimCreator.addArticle(SimpleMetadataArticle("Title", title)); zimCreator.addArticle(SimpleMetadataArticle("Description", description)); zimCreator.addArticle(SimpleMetadataArticle("Name", name)); zimCreator.addArticle(SimpleMetadataArticle("Tags", tags)); zimCreator.addArticle(MetadataDateArticle()); zimCreator.addArticle(MetadataFaviconArticle(favicon)); /* Init */ magic = magic_open(MAGIC_MIME); magic_load(magic, NULL); pthread_mutex_init(&verboseMutex, NULL); /* Directory visitor */ MimetypeCounter mimetypeCounter; zimCreator.add_customHandler(&mimetypeCounter); zimCreator.visitDirectory(directoryPath); /* Check redirects file and read it if necessary*/ if (!redirectsPath.empty() && !fileExists(redirectsPath)) { std::cerr << "zimwriterfs: unable to find redirects TSV file at '" << redirectsPath << "'. Verify --redirects path/value." << std::endl; exit(1); } else { if (isVerbose()) std::cout << "Reading redirects TSV file " << redirectsPath << "..." << std::endl; zimCreator.add_redirectArticles_from_file(redirectsPath); } zimCreator.finishZimCreation(); magic_close(magic); /* Destroy mutex */ pthread_mutex_destroy(&verboseMutex); } ��������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������zimwriterfs-1.2/travis/�����������������������������������������������������������������������������0000775�0000000�0000000�00000000000�13310760036�0015250�5����������������������������������������������������������������������������������������������������ustar�00root����������������������������root����������������������������0000000�0000000������������������������������������������������������������������������������������������������������������������������������������������������������������������������zimwriterfs-1.2/travis/compile.sh�������������������������������������������������������������������0000775�0000000�0000000�00000000740�13310760036�0017240�0����������������������������������������������������������������������������������������������������ustar�00root����������������������������root����������������������������0000000�0000000������������������������������������������������������������������������������������������������������������������������������������������������������������������������#!/usr/bin/env bash set -e BUILD_DIR=${HOME}/BUILD_${PLATFORM} INSTALL_DIR=${BUILD_DIR}/INSTALL case ${PLATFORM} in "native_static") MESON_OPTION="-Dstatic-linkage=true" ;; "native_dyn") MESON_OPTION="" ;; esac cd ${TRAVIS_BUILD_DIR} if [[ "${TRAVIS_OS_NAME}" == "osx" ]] then export PKG_CONFIG_PATH=${INSTALL_DIR}/lib/pkgconfig else export PKG_CONFIG_PATH=${INSTALL_DIR}/lib/x86_64-linux-gnu/pkgconfig fi meson . build ${MESON_OPTION} cd build ninja ��������������������������������zimwriterfs-1.2/travis/install_deps.sh��������������������������������������������������������������0000775�0000000�0000000�00000001400�13310760036�0020263�0����������������������������������������������������������������������������������������������������ustar�00root����������������������������root����������������������������0000000�0000000������������������������������������������������������������������������������������������������������������������������������������������������������������������������#!/usr/bin/env bash set -e REPO_NAME=${TRAVIS_REPO_SLUG#*/} ARCHIVE_NAME=deps_${TRAVIS_OS_NAME}_${PLATFORM}_${REPO_NAME}.tar.gz # Ninja cd $HOME if [[ "$TRAVIS_OS_NAME" == "osx" ]] then brew update brew upgrade python3 pip3 install meson==0.43.0 brew install libmagic wget https://github.com/ninja-build/ninja/releases/download/v1.8.2/ninja-mac.zip unzip ninja-mac.zip ninja else pip3 install --user meson==0.43.0 wget https://github.com/ninja-build/ninja/releases/download/v1.8.2/ninja-linux.zip unzip ninja-linux.zip ninja fi mkdir -p $HOME/bin cp ninja $HOME/bin # Dependencies comming from kiwix-build. cd ${HOME} wget http://tmp.kiwix.org/ci/${ARCHIVE_NAME} mkdir -p BUILD_${PLATFORM} cd BUILD_${PLATFORM} tar xf ${HOME}/${ARCHIVE_NAME} ��������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������