pax_global_header00006660000000000000000000000064146045163510014517gustar00rootroot0000000000000052 comment=95237f2ebf60d6060754760550b2edd2f18ca81c base16384-2.3.1/000077500000000000000000000000001460451635100130425ustar00rootroot00000000000000base16384-2.3.1/.github/000077500000000000000000000000001460451635100144025ustar00rootroot00000000000000base16384-2.3.1/.github/workflows/000077500000000000000000000000001460451635100164375ustar00rootroot00000000000000base16384-2.3.1/.github/workflows/release.yml000066400000000000000000000024621460451635100206060ustar00rootroot00000000000000name: release on: push: tags: - v* env: GITHUB_TOKEN: ${{ github.token }} jobs: release: name: Build on Push Tag 🚀 runs-on: ubuntu-latest steps: - name: Checkout Code id: checkout uses: actions/checkout@v2 - name: Setup Build Tools run: | sudo apt-get update sudo apt-get install -y gcc git wget https://justine.lol/cosmopolitan/cosmopolitan-amalgamation-1.0.zip unzip cosmopolitan-amalgamation-1.0.zip - name: Build Cosmopolitan run: | gcc -g -Os -static -nostdlib -nostdinc -fno-pie -no-pie -mno-red-zone \ -fno-omit-frame-pointer -pg -mnop-mcount -D__cosmopolitan \ -DBASE16384_VERSION=\"`git describe --tags --abbrev=0`\" -DBASE16384_VERSION_DATE=\"`date +"%Y%b/%d"`\"\ -o base16384.com.dbg base16384.c file.c wrap.c base1432.c -fuse-ld=bfd -Wl,-T,ape.lds \ -include cosmopolitan.h crt.o ape.o cosmopolitan.a objcopy -S -O binary base16384.com.dbg base16384.com - name: Upload Binaries to Release uses: svenstaro/upload-release-action@v2 with: repo_token: ${{ secrets.GITHUB_TOKEN }} file: base16384.com tag: ${{ github.ref }} overwrite: true file_glob: true base16384-2.3.1/.github/workflows/test.yml000066400000000000000000000033451460451635100201460ustar00rootroot00000000000000name: test on: [ push, pull_request ] jobs: test_ubuntu: name: Run CMake Test on Ubuntu (GCC) 🧪 runs-on: ubuntu-latest steps: - name: Checkout Code uses: actions/checkout@v2 - name: Setup Build Tools run: | sudo apt-get update sudo apt-get install -y gcc cmake - name: Build and Run 64bit Tests run: | mkdir build cd build cmake -DBUILD=test .. make make test || ctest --rerun-failed --output-on-failure - name: Build and Run 32bit Tests run: | rm -rf build mkdir build cd build cmake -DBUILD=test -DFORCE_32BIT=1 .. make make test || ctest --rerun-failed --output-on-failure test_windows: name: Run CMake Test on Windows (MSVC) 🧪 runs-on: windows-latest steps: - name: Checkout Code uses: actions/checkout@v2 - name: Build and Run 64bit Tests run: | cmake -E make_directory build cmake -S . -B build -G "Visual Studio 17 2022" -A x64 "-DBUILD=test" cmake --build build --config Release --target ALL_BUILD -- ctest -C Release -T test --test-dir build || ctest -C Release -T test --test-dir build --rerun-failed --output-on-failure - name: Build and Run 32bit Tests run: | Remove-Item build -Force -Recurse cmake -E make_directory build cmake -S . -B build -G "Visual Studio 17 2022" -A x64 "-DBUILD=test" "-DFORCE_32BIT=1" cmake --build build --config Release --target ALL_BUILD -- ctest -C Release -T test --test-dir build || ctest -C Release -T test --test-dir build --rerun-failed --output-on-failure base16384-2.3.1/.gitignore000066400000000000000000000000371460451635100150320ustar00rootroot00000000000000build .vscode .DS_Store obj-* base16384-2.3.1/CMakeLists.txt000066400000000000000000000033531460451635100156060ustar00rootroot00000000000000cmake_minimum_required(VERSION 2.8.12) if (POLICY CMP0048) cmake_policy(SET CMP0048 NEW) endif (POLICY CMP0048) project(base16384 VERSION 2.3.1) add_definitions(-DBASE16384_VERSION="${PROJECT_VERSION}") add_definitions(-DBASE16384_VERSION_DATE="April 7th 2024") message(STATUS "Testing endian...") include(TestBigEndian) test_big_endian(isBigEndian) message(STATUS "Is big endian: ${isBigEndian}.") if (${isBigEndian}) add_definitions(-DWORDS_BIGENDIAN) endif () if (BUILD STREQUAL "test") add_definitions(-DBASE16384_BUFSZ_FACTOR=1) endif () add_executable(base16384_b base16384.c) IF ((NOT FORCE_32BIT) AND CMAKE_SIZEOF_VOID_P EQUAL 8) message(STATUS "Adding 64bit libraries...") add_definitions(-DIS_64BIT_PROCESSOR) add_library(base16384 SHARED wrap.c file.c base1464.c) add_library(base16384_s STATIC wrap.c file.c base1464.c) ELSE () message(STATUS "Adding 32bit libraries...") add_library(base16384 SHARED wrap.c file.c base1432.c) add_library(base16384_s STATIC wrap.c file.c base1432.c) ENDIF () set_target_properties(base16384_b PROPERTIES OUTPUT_NAME base16384) set_target_properties(base16384_s PROPERTIES OUTPUT_NAME base16384) set_target_properties(base16384 PROPERTIES VERSION ${PROJECT_VERSION} SOVERSION ${PROJECT_VERSION_MAJOR}) message(STATUS "Linking libraries...") target_link_libraries(base16384_b base16384_s) if (BUILD STREQUAL "test") message(STATUS "Building test...") enable_testing() add_subdirectory(test) endif () INSTALL(TARGETS base16384_b RUNTIME DESTINATION bin) INSTALL(TARGETS base16384 LIBRARY DESTINATION lib) INSTALL(TARGETS base16384_s ARCHIVE DESTINATION lib) INSTALL(FILES base16384.h DESTINATION include) INSTALL(FILES base16384.1 DESTINATION share/man/man1) base16384-2.3.1/LICENSE000066400000000000000000001045151460451635100140550ustar00rootroot00000000000000 GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The GNU General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things. To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. The precise terms and conditions for copying, distribution and modification follow. TERMS AND CONDITIONS 0. Definitions. "This License" refers to version 3 of the GNU General Public License. "Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. "The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations. To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work. A "covered work" means either the unmodified Program or a work based on the Program. To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays "Appropriate Legal Notices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. 1. Source Code. The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work. A "Standard Interface" means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The "System Libraries" of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. 2. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 3. Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. 4. Conveying Verbatim Copies. You may convey verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. 5. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: a) The work must carry prominent notices stating that you modified it, and giving a relevant date. b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to "keep intact all notices". c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. 6. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. b) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. "Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. 7. Additional Terms. "Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or d) Limiting the use for publicity purposes of names of licensors or authors of the material; or e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. All other non-permissive additional terms are considered "further restrictions" within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. 8. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. 9. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An "entity transaction" is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. 11. Patents. A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version". A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. 12. No Surrender of Others' Freedom. If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. 13. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively state the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . Also add information on how to contact you by electronic and paper mail. If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode: Copyright (C) This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, your program's commands might be different; for a GUI interface, you would use an "about box". You should also get your employer (if you work as a programmer) or school, if any, to sign a "copyright disclaimer" for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see . The GNU General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. But first, please read . base16384-2.3.1/README.md000066400000000000000000000654001460451635100143260ustar00rootroot00000000000000# base16384 > **Note**: This project used the awesome cross-platform binary compiling tool [cosmopolitan](https://github.com/jart/cosmopolitan) > Alternatives: [Go](https://github.com/fumiama/go-base16384), [Python](https://github.com/synodriver/pybase16384), [Android](https://github.com/fumiama/android-base16384), [TypeScript](https://github.com/shigma/base16384.js), [Lua(binding)](https://github.com/synodriver/lua-base16384), [Lua(pure)](https://github.com/Yiwen-Chan/base16384), [C#](https://github.com/lc6464/Base16384.Net), [Rust](https://github.com/Wybxc/base16384-rs), [Swift](https://github.com/oboard/swift-ui-base16384) Encode binary file to printable utf16be, and vice versa. ## Description > 说明 Use 16384 Chinene characters (from \u4E00 to \u8DFF) as the "alphabet", just like what base64 did. 使用16384个汉字(从`\u4E00`到`\u8DFF`)作为字符表，就像base64用64个字符作为字符表一样。 If length of the data has a remainder after moduled by 7, we will use \u3Dxx to log it with xx ranging from 01 to 06. 使用`\u3Dxx`附加在末尾以表示编码时数据不满7位的个数，其范围在01~06。 ## Benefits > 优点 Save more space and since the code 0x0000 is encoded to "一", finding zero space seems to be easier. 相较base64节省更多空间，更容易发现二进制文件的规律。 ## Usage > 用法 ### Install from Debian Bookworm or higher > 从 Debian Bookworm 或更高版本安装 ```bash sudo apt install base16384 ``` ### Install from Homebrew > 从 Homebrew 安装 ```bash brew install base16384 ``` ### Install from my PPA in Ubuntu > 乌班图下从我的 PPA 安装 ```bash sudo add-apt-repository ppa:fumiama/ppa sudo apt-get update sudo apt-get install base16384 ``` ### Build from source code > 编译 Clone this repo first. 首先克隆该仓库。 ```bash git clone https://github.com/fumiama/base16384.git cd base16384 ``` Then use `cmake` to build. 然后使用`cmake`进行构建。 ```bash mkdir build cd build cmake -DCMAKE_BUILD_TYPE:STRING=Release -G Ninja .. cmake --build . --config Release --target all -- cmake --install . ``` Now you can encode/decode a file by commands below. 现在可以使用命令对文件进行编码/解码。 ```kotlin base16384 -[ed][t][n][cC] [inputfile] [outputfile] -e encode (default) -d decode -t show spend time -n donot write utf16be file header (0xFEFF) -c embed or validate checksum in remainder -C do -c forcely inputfile pass - to read from stdin outputfile pass - to write to stdout ``` ## Examples > 用例 1. Encode simple text > 简单文本编码 ```bash echo -n "1234567" | base16384 -e - - | iconv -f utf-16be -t utf-8 婌焳廔萷 ``` 3. Decode simple text > 简单文本解码 ```bash echo -n "婌焳廔萷" | iconv -f utf-8 -t utf-16be | base16384 -d - - 1234567 ``` 3. Encode file > 编码文件 The text below is the encoding of the base16384 itself (v2.2.0) on MacOS 12.6 arm64. It is clear to see the strucutre of the binary file. 下面的文本是使用base16384程序在 MacOS Mojave 版本下编码自身(v2.2.0)的结果。可见文件结构十分清晰。 臾糟蘜一乀縀倀倀一仰一习佀丈戀渀一一乤一丒一丁浟成扴捩卒懀一一一一一一一一一一伀一一一一一一一一一一一一一一一一一一一丙一不渄一旗荄捡戀一一一一一一一丁一一亀一一一一一一一一丠一一一丅一一戀一佀一一一丗菷徕虴一一一一一丅譽扅搕一一一一一丂爋一丐一仈刀一一一眂縀丈一一一一一一一市一一一一一一一佽浳欝搧娀一一一一也旕剕潐一一一一一丛俀一伀一唠一一一丆繰一乀一一一一一一嘄丠一一丆一一一一旗蔷忕灟栙擇侕耀一叵譑単挀一一一一一冀樀一帀七尀一一一仠唀一嘀一一一一一一乀倀一一一一一一丅譽煳欜璖螜一一一丁浟挑掅帀一一一一一禇帀丄一丸帐一一一壡舀一一一一一一一丈一一一一一一一一也旝擧殥籤旚擦枼一丗菵引晔一一一一一三乼一乀一俀一一一丂帟一丠一一一一一一一一一一一一一一一侐一予乀丅譽剁挐帀一一一一一丠一丐一一刈一一一丈一一一一伀一一一丰一七一一帀一一一佽浮椗蔷玵灯椗蔇忈也旑刕弄一一一一一一倀一伀一亀一一一一亀一什一一一一一一吀一估一一一一一一旗葶诐一一一一一一叵謑佔幀一一一一一丠渀一帀一昀一一一丈嘀一娀一一一一一丁渀一戀一一一一一丅譽穡旜薖莉絬旜啇嘁浟弐捄刀一一一一一嘈一丄一並一一一一倂一七一一一一一一东一丅縀一一一一一也旘蓶莵絮一一一一丗菴弅扁一一一一一丌亀一乀一丰丠一一一一一乀一一一一一一乀一一一一一一一一侐一么一丅譽婉憒艔弥戀一一一丰嘀丐一一刀一一一丌一一一丼习一一一丐一丁一一一一一一予一渌一一丰一亀一丈娀七一一一一一一与儀一币一劃刀付一一嘀一吀一你耀三一丁丵一夀刀下一丅一一一一丄一一帀一嬀一仠一世一一一一一一一一一一一一一一一亘嬀丂瘀一一一一一一一一一一仠一丠一一縀一姝攷嚽穩暋葇玱爀一一一丛一丁渀一斪罒跻舷圪讫惙硗垚愠一丠一一刀一七溠一崊一帀一儀一一么倪一丁一一一一一一上一倀昀一峀稀一一一一一一一丰一与一一昀一丠一一一幐一伀姝攷嚽穩暋蓆玉慹櫝呖芹倮朞擆玈一一一亘一丄一一渲一侀一丩一丁一一尌渀亀一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一丁捈灹挴瀏稘怣揞烼吀一劈畻皮刀丄澤姨什丄烣椴箵蘭虭先诚纄瀧幈繺凴焇蠒怣幀圠俈怠詁潭毃捒嚞挅敁掐捅嬢凬删跰忔蝉災劈筸嚀峋敒茢域蠮伀丂埁滸淨巤偵媑嚧稅侀距啓怏蘂歟粇蘈一簿淿跿礊蠜渠丂蛿跿跴瀏刐擐揄卹佟数貅稈一簿緿跿秧滾丰谖夀一嘇稉舏潞縐丁嚍整姰昀一怢毮熰崀丒咐綠儀丒妍竒蓗溷澴嬣蕫倒暝朢埐怰沃謧俾劒帜朤俎裒劈荷庿侀一伢埞蠬仰丁嚸蓍奭氋氛廒嵶稡垉莒咐嶠儀丒嚝匣俩巒樟虉圁膒帜朦奄圂剈矠僫仑感朄嶾翠趆忐皃谙廸敘一丒暷纐幉烝偁漢嬕粄缀伢嬍盄縀冣码一岱茦奼圄劘篐爘怣彙穌帀怣廘幌一蠼繐丁侉翓晟柑晅潿蕕嬦奄圆周嫠筴怒囕蕂贆一丄瀧注亃縀伡眳蠀縀伢蛛嬭筸奸楃怽蒰漢埐怰沃謣俺劒东地矶怀此瀴謔刀七唃瘓净七唁厅跃虉添跿幣承谏蘆毑劈舷昀一劆娒佈乲巾伢嬽譃縀冣欎一妀刀一衚巯跿盐一下燯跿跺掟觿跨繀一僣諿跿貔移跿怣懘湀一蠪廠丁劉谺慯觿赈煏檐言仨獃渀僠倀一岒击跿怣懝娼一蠟绠丂蘃一与爫賿跒囓蕰崀为咐蘀亸伀一冧苽跿芈苷洏一岅娸一簁帀七矞赿跴瀴诧净与滴尀丮习一仩耿淿謢嬽覃縀冠甎一妀樀一衬緟跼崟丌淿跽蟿跿蛿跿趥跿跻緿跿艿跿趟跿跕抈疕嚍嵵绰七盺兀丄瀴謘刀与熸嬀丒囓苘帀为尠舀么煏慱一仨莃帀伢嬽射一冣堍一劈苵倐一岋蘴一怣懕繀一敺椐舀亐爤協瀧獁提捤单佔拒嘞肠一丒暜茦埖怢涶栌购怢敜濔捈灼犈獷幈烁橱一乌烈儜疬荈煭意跿赈灷貆訴一幯縐一亅縃虖済一怢苙伢叉凢厰嘀么灗欄拇版烕檆栌蠭歃劈稖吐一勈竣礘怢檴瀴菭净丄瀧旨蛃一伢埙恢橴萗贏漪帀丁嚅聃虊稀一怠涐刀帀凣柠一么灓樄瀭诐婽焜冣弌一噜举嘹乀丈甌翿愢葜伲埦粀帀丂蜂一丄吧久婲沉舰一怠趏訾刚乀丈獷幉曳劆畆愤恤犌喨湄乸皝唇真繾渠唪嬜荀一一矚幣捁懾出佃虰娄一怣廙訄一怘罉匠俊跸犘甚凋侺涰一乁緀渀七睩乀丄萗牵唒囓扤崀丒嚷蕃瘋儀丄琧剈潰仸悤一丯跠一乌灿粏測一緿縀丁媉趺岰稀亾乀一僫諿净勈痝媉虺寀稀么潰啂謲執灱狈疪蜸恄渎濤唀丒吿僨伀一勈疽媉豺妀稀么潰啛膧洀一劈笗噦滎僗帡媉跺嗠稀久婿芈笗幦滎僐谓倀一勈疟癥僀与瓔一丐槰戀一衪渀丁便侀一冦洀一创訌一为杀一义灱瘼娣礓恢橮稹垉羠誰憬呉灱瘼娪凃启跠一乌灿粂昬一緿縀丁媉趺侐稀乌災苈算乄灹狈疪埙蠯繠丁噣訮渐一乌灻苈痧盾傀丄瀗乴墓嚟欲埦蠾溠丁嚋彲周嫠筴倓嚟趢谊一嚷蕃皰傀丄拇跫侐槰帀一弢涄瀇动一丅笅橁敐揤卽毃枤启跿赪趿跶移跿捿跿譗跿跚緿跽捈灹戕欅摁挔芈旽艶恢浴瀗葴歒暜蜢埓恢淋跸一专嚟覡渊一姿言一愢淮潌堀丯渐一人贿绰伢域愢氞漐堀丒噜俐赈灷蚜朲埲籎劑嘃盡佀丄澏纺乀一伲執愢涞満堀丒噜俖誸伀一冬庸什一冬垸亀一冬倱縖舕缅汁旗樵挢埥幕舕朅捁挔茈旽虨幢浸旙虨恢櫤琧捁灿劈苗嘌一妠嘀一弢淾渜堀丮総証乄灹苈疻盟偀丄瀗乴嵓嚞谧呌灼禓漤怀蠓乐丁噣萑嚟謲埶怢殮焼圀丒冝濷冸伀一冬庸什一冬垸亀一冬倱縒嘼帡楁攐揔卹佟数荔瀧獁提捤单佔拒嘞肠一丒暜缢坕縒暟挢埻枠臲菔恈灗欄瀬厢儀丄耬縱蓺腴瀶茰跿跴瀧淨悂帀伆贁一丈攀嶅搀渀伢奍爒噜爾噋亀丄瀧噈灗欄拇葈灲葤名謀奓嚖蔡茌怢繕爰一愢膎穉嚍孰纰丁媉觺妐渀义灱苈箷乍潿绸慈一丒噝稾勔一丄瀇褁丄一谷唀一劈篷帱讌樎炨嘀両樀谣吁一刘甘翿怢毫瘄一丮帠一乁灰剓唧癹倀丄瀏蛿凡塰刀义灱嚝甇蜟繺忐啦埈繾丸嶇蘩繠訑勇乁渏偏蘾拀恣懄张俀灷炜朲埪蠁习丁噣訮渐一乌灻苈痧瘟倀丄瀗丏漆縐丁媉蟒嚝覠攈一劈笗噦滎僗帡媉跺宰樀乄災貌舜一彌淾狔伀丐槰嘀一衊渐丁宅讝忄瀴菅傀丄瀭诐蠭繰丁垉羒噜举刃乀丄耧藨畁縀价谀一啐眲執蠣湰七礊灱苈痛盖俀下蘄一丮渀乀乌灹苈症癿俀丄瀧内蓃蛨樀一愢浾潨唀丠趏译劃谏敓挲執蠒买丂叀欌芈略囁虈劋瘀一一帀丁嘁艒吽嬇各匏曕稉囁豈刘渐嫫傢橴耧蓨杁縀伲埧灷狈疪蜑七渎熤刀丒吿僨伀一勈疽媉豺乀樀么潰仸掇跿跐槰帀一裏芈笗噦滎僗帡媉跺娰昀久婿芈笗幦滎僗庁媉诺壠昀仫厐槰戀一裃爛記一为繤哼儀一剈痡嚁缪一丁楁攐揔卹佟数荔瀧獁提捤单佔拔劈旽舧恢浴瀗葴塒暜缦埖恢淞潸吀丏淠一乵喓嚞趡崆一岱裠儀一岛縀一簀渀七瞲一丈甝媉覺嘰昀亾乀一僨一刀勈疝媉衺僀昀么灰虝稾岆一丄耧編俁渀倏蛿欑嘿滵茵愢泾燔匀両樇廍嚉葒娞劁嚺一一丄一丒丝匡燓幱湁延孛互娟犁侈伃岰砧啌灻粁嘘一愢汸畹媉誮弐丸仨玀縀伡燰粀帀丁媉诓嚟疢缅一劈攀嶅晿跿賠刀一岰囇么滱亅笅橁敐揤卽毃捒嚞挅敁掐捔卑慈滻侄瀥揀灟欈旼嶈赀一倧膅讃蚏瘀一恢櫬昄人亀一倭诐怢櫮濨匀丒嚜哠唀一劈巤倏然縀丂坝脑愞茆举趐廹攕匁襒搽茦嬴單渀乀么塶皷蕃癀佀丄琧喅蓟纔搗贏熨帀丁匱蜑晟诹廆彵縋瘄一丢藝伢孵菺估戀亊彵臃菔抺乀一倭诐怣敝涣褄一嚤敝匁赡娇幍坣腐橠常譄煚帤吡刎乺繤哰伀一勈痝劉覒嚵蔁嚉蒮弐丸仨桀渀伱燸烟櫄瀧汌灾粌渐一形汔继蘏煓淿跾蘄一与穂蘃一与稦蘂一与稈翀怠詁潭作幗戕蜅浝绤圅挢埥幕舕朅打怘詤羧亓園朤甇瘠幀洄性仁蠇舜嗠偁买刨舓匀一丄劧乂煓乯谏蜅毈犈艷唁一劆娲奈乶淾吏嘆裃昼丣礈滲乎税净傐帟倏哹氞拆崹匱蜒榠一一一巳謦褀一丏諼一息渄蘁尀憀勤拇赊烇側渿奈灷犌喸偌噵犈略囁衁勂啥嘉詒嚝蜣修侠池七贿怂櫬喬嚁蛿臰丁嘉諓丟嬠巋悢忏眧跇恠詀欴蟌涬岰朔翿彌汄搗丏漄帐丁吏箃側耧坈繺帤琏漃恰氐蜤埉幠趀刾勒一丄瘾豌埀抈甹囁螁瘞昀贀专亜蜢凡仒娞剑垉聒废匆凸亃虊帀一悃觤纜偈灳犌喘媁螀一訁娉膒嘾刽囁虇劘甥圉詐昿渍艺悃觤纜先灳犌喘抁螀一丽娉膒嘾刽囁虈犘甥圉詐昿渑艐悃觤纜剈灳犈喛一一劌喘桌偳犈嶄赈繸悤琧坉偼战巠却坒滻蜰甅怢櫤瀇瓀一丄焇琢愂櫤瀏漿怰氓传埱恢檔烥尀憀勠伸乌乲抨爳衈曲婤師谽弢剀秽楁攐揤卽毃枤勏觿赂趿跴姻跿忿緿謟賿跔淯跽噣羑愜倁訇趏敓茐嶾弁跴吵仿滾乗檹嚍兲帐丁噣传技唣跠滱綮穦准谺罈崛詁簀帀七礉滱絤哠吀一協瀧獁提捤单佔拢洌嗠淁蠇帟倧俁豀蘾几矈庣拀処叉氞苆崥匱蜒榠儣資趱跬欦褀一一七諿息渀一仼跀丄瓼一縿绰一久婻抨穳絈凲芘苒案灼拂啥嚉諓借嬢嬌瑒嚟嬣俣伓借笠埋怰池标琀跏縄渧汈凳犨狐灉跱折崐啍屳嗫熬呅婻打喑刁縑晜举勠一丄砬諯煓褬喤岃虀蛘胧图跿舨渰灁滾丐谒谀一劈萾胿穿蚜複簆湹緀一争胰沱怏焃偼舨潰瀁幠趀嘾劓一丈画修儠汯一一繺忀病傈愈渤吏蘃欞劋糋趱跬淿跽嘁賢毬喸抁螼一丁嚉葒娞犊凡凂洔堡娢仐昿渑艉怢殔焇眚湸樀一么繺肨嶌贉胐皅纈剁滾乗庡嚹窿褟資趱跒东謢培怰沒堇激一丄焇細滹臰甽傈洈湕笅橁敐揤卽毃悿緿謃賿跐巯跽叾跿艟觿赕趿跿誖簃一已擀儀丿聛嘌一跉楀娀仿坭渰七败簀縀凼玺什丏誖訃一已擸儀丿聜丌一跉樠娀仿坱丰七败羀縀凼珈什丏誗堃一已攰儀丿聜蘌一跉欀娀仿坴渰一一愣忑爌一幔跲护儀两咀一一衹緿跽瘕一与畳跿跚倠一仩芿跿讠縀一岜燿跿栏帀七瞾跿跶漨一为楏跿赨揀一冦磿跿蒆帀一表巿跽癲一与瑛跿跚嗠一仩焿跿订娀一岘姿跿栦一七睸跿跶炘一为擯跿赨筀一冥狿跿蒌嘀一衖緿跽盏一与獃跿跚局一仩徿跿讣脀一岓臿跿栀渐七眲跿跷寁獮月商玵猺嘉擇掵脊丘琗宔缶嫎充讕聲旙著彽瑩椙揷宥补丘琗宔缶嫎充讕聲旙瓷侕籟槝敇俕艟枚擆戁灡櫙愓曌蘴旙攧坽瑯標擥讥籰歝叶枥穥丘琗宔缶嫎充讕聲旝蔦珑獟枚擆戁灡櫙愓曌蘴旙攧坽絰杛珶玹繵欗葦玱猀暘收拄萳對叶揉聟楘攅讥籰歝叶枥穥丘琗宔缶嫎充讕聲旜瑖厑浦桛呐侉潳杌慣嫠舀廛蔇珉睧栝倂澌眠媌儣嚁呵楚搖莄湍桛琖莽良如爦反猱完膃庀耮媋焢亡剥曈儓忑瘠媌儣嚤簠捜萖殔蠀暘收拄萳對倅窵獤欗怅箥籰歝呦玱獝嘖蓷揑繵欙璖羕欀嘈僖戤坥榘蓶徔丠嘋摀爥牥曛葆戀渠奝亐珍癯毈唷侕籤嘝咖莔丠嘚擧俕艦桛呐珁潳櫈僒俑素檙搖庁瑲槛怇寑物榀倂侽荴樝敆枥穥停吗富渭嘝哲保聩欙怇徼湳欙哷提乷暀唦嘃賿一丐一东一一嘀一圀一一一三一一倀一伐稐俑搁帚帬一崀一仰一丛忀一一一净一七一一縀嘀夀丠一一仒一一娃一璀娀佘侀丏樘丁瘃一儐尀乀一丄伀乀帀一一一一一一一一一一一一一一一一一仰唀一刀一貇一丄一丁俐一伀一仡舀丁一丁湴一乀一予欀一帀一稝一丐一丶啀一刀一帇帀丄一丒濐一伀一十舀丁一丅虴一乀一侠欀一帀丁耝一丐一乼啀一刀一澇帀丄一两俐一伀一垡舀丁一上年一乀一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一一丁劈湠勀一久也旗蔷徑睮樀北嘢幀旗菷寑牯歝唀偁乤汛呅词艵暗萦玹牥檀圇嚀彀旘蓆讍祟柙敇徥筥两万嚠彀旘蓆词猀爀唣久也枘蓆词猀爀唣湅也枙著後亐东爁匁浦槜呖蘂帀檒伔佽瑰歝吰偀乲戄戅讙聥晙三丁聘剐叶柝聩欙帉丁聠剐叶莵潰两万垠彀旛敖螵潰两万埀彀旛蔆掸亐东疁匁浰杜甦诈亐东瘀剅也樜璖蟑琀爀唨渄彀旜啗忌亐东眀剅也檙搖市帀檦丑匁浳欘敂弥屏弑慣市帀檨丑匁浳欜瓆掸亐东碀剅也歛瑶揑焀爀唫丄彀旝蔦珑猀爀一卼丅丁珶莡浥氙搷揑獟栙搖徕耀慙著彽腴晜畅讵脀扛搖玸乖暘收拄萳對台佭牥曘畖昃圁杛琶埕琀膀帠一七丩佰丌们叀一垕籣槙呐侹牥曛葆戂搁一珶昁蔀緀帀宥穥両縗丂威最圐刌二喀丰凰焀什垲戀丂旙渊丄仄乀丶玱猀稀攀僔佤丮渐娂舦一縏檬七両烠丌仄娀丰冠舀什娄刀刀舰戀一一丩佴焐卜訁柰呤促佣縫蘊爄一一偐尀万一布爑一侀丐乐咀丁渀刀指一习丄丧帐一封一夀蘀丁一一嘀一净开一一一帀一搀一仰刀乨咀一刀一堀一丼伀丁潰一伀一凐一丏乀七幌一乀一佐一七縐七蔕一丐一乩一一訄一弆一丄一丞縀一崁一垱嘀丁一三一一净帀丰崀一帀丂甀一仰刀仼剀一刀一紀一丼圀丰倀一伀一婀一丏偀不亀帀乀一儰一七縐丂爋一丐一仚一一訄一褂縀丄一丸一一伀一帀一一一与瘀一乀一刀一一一七茀一丐一伀一一一一伀帀丄一乀一一一一亰刀丁一丐一一一一乌伀一帀丄一一一一业乀一刀丁一一一一丈帐一伀一帀一一一丂渄一乀一刀一一一一紁一丐一伀一一一一寀帀丄一乀一一一一凐刀丁一丐一一一一伔伀一帀丄一一一一之乀一刀丁一一一一且縐一伀一帀一一一丅稄一乀一刀一一一丁漁一丐一伀一一一一柀帀丄一乀一一一一啐刀丁一丐一一一一俴伀一帀丄一一一一亅乀一刀丁一一一一丣丐一伀一帀一一一丁一一剀一么一丄縀一戀一佐一世一丁樀一吀一乤一丆渀一椀一俀一丝一丁蘀一嗀一亀一丈帀一瀀一一丁与一一言一囀一乀一丄帀一怀一估一且一丁戀一厀一乜一丆一一最一侠一丛一丁縀一啀一乸一万縀一渀一倐一丢一丂丁浟楚叶握獣歝呕计獡朙攠佽灡櫙愓曌蘴旙呖宽牥丗萦反猱完膃彽牥曛葆捽瑤丗萦反猱完膃彽牥曛葆捽瑩椙帅讉潳杌慣嫠艟朙搶讑獟果丅讉潳杌慣嫠艟杛琶讑猀旘琗宔缶嫎充讕籣槙呕讙爀旘琗宔缶嫎充讕籣槙呕讙睬杀叶垅腥婍焳滑浥榘蓶徕浦樀叶徕煢歙清讕籣暝摠佽略欗蔷待聴旛攰佽筡桛清譽浳欙咖蟀也旗蔷徑絵欜丅讍穯曚菶殕艴桛摐佽煬槜葐佽瑣椛蔶戁浦柙敆威浦槜呖蘁浦樝敆威浦檙搖币浦毜璗徔也楛搗丁浭歛瓖叀也槜呖蘁浰杜甦诈也樜璖蟑琀旜啗忌也檙搖币浳欘敂弥屏弑慣币浳欜瓆掸也歛瑶揑焀旝蔦珑猀朞擆彽腴歘珶垥籤杜清证聩榝号揍潧杀一一一一㴁 base16384-2.3.1/base1432.c000066400000000000000000000314671460451635100144450ustar00rootroot00000000000000/* base1432.c * This file is part of the base16384 distribution (https://github.com/fumiama/base16384). * Copyright (c) 2022-2024 Fumiama Minamoto. * * 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 . */ #ifndef __cosmopolitan #include #endif #include "binary.h" typedef union { uint8_t buf[4]; uint32_t val; } base16384_union_remainder; int base16384_encode_safe(const char* data, int dlen, char* buf) { int outlen = dlen / 7 * 8; int offset = dlen % 7; switch(offset) { // also count 0x3dxx case 0: break; case 1: outlen += 4; break; case 2: case 3: outlen += 6; break; case 4: case 5: outlen += 8; break; case 6: outlen += 10; break; default: break; } uint32_t* vals = (uint32_t*)buf; uint32_t n = 0; int32_t i = 0; for(; i < dlen - 7; i += 7) { register uint32_t sum = 0; register uint32_t shift = htobe32(*(uint32_t*)(data+i)); sum |= (shift>>2) & 0x3fff0000; sum |= (shift>>4) & 0x00003fff; sum += 0x4e004e00; vals[n++] = be32toh(sum); shift <<= 26; shift &= 0x3c000000; sum = 0; shift |= (htobe32(*(uint32_t*)(data+i+4))>>6)&0x03fffffc; sum |= shift & 0x3fff0000; shift >>= 2; sum |= shift & 0x00003fff; sum += 0x4e004e00; vals[n++] = be32toh(sum); } base16384_union_remainder valbuf; if(dlen - i == 7) { register uint32_t sum = 0; register uint32_t shift = htobe32(*(uint32_t*)(data+i)); sum |= (shift>>2) & 0x3fff0000; sum |= (shift>>4) & 0x00003fff; sum += 0x4e004e00; vals[n++] = be32toh(sum); shift <<= 26; shift &= 0x3c000000; sum = 0; memcpy(valbuf.buf, data+i+4, 3); shift |= (htobe32(valbuf.val)>>6)&0x03fffffc; sum |= shift & 0x3fff0000; shift >>= 2; sum |= shift & 0x00003fff; sum += 0x4e004e00; vals[n++] = be32toh(sum); return outlen; } uint8_t o = offset; if(o--) { register uint32_t sum = 0x0000003f & (data[i] >> 2); sum |= ((uint32_t)data[i] << 14) & 0x0000c000; if(o--) { sum |= ((uint32_t)data[i + 1] << 6) & 0x00003f00; sum |= ((uint32_t)data[i + 1] << 20) & 0x00300000; if(o--) { sum |= ((uint32_t)data[i + 2] << 12) & 0x000f0000; sum |= ((uint32_t)data[i + 2] << 28) & 0xf0000000; if(o--) { sum |= ((uint32_t)data[i + 3] << 20) & 0x0f000000; sum += 0x004e004e; // safe, because it will never go over 0x3dxx #ifdef WORDS_BIGENDIAN vals[n++] = __builtin_bswap32(sum); #else vals[n++] = sum; #endif sum = (((uint32_t)data[i + 3] << 2)) & 0x0000003c; if(o--) { sum |= (((uint32_t)data[i + 4] >> 6)) & 0x00000003; sum |= ((uint32_t)data[i + 4] << 10) & 0x0000fc00; if(o--) { sum |= ((uint32_t)data[i + 5] << 2) & 0x00000300; sum |= ((uint32_t)data[i + 5] << 16) & 0x003f0000; } } } } } sum += 0x004e004e; // safe, because it will never go over 0x3dxx #ifdef WORDS_BIGENDIAN vals[n] = __builtin_bswap32(sum); #else vals[n] = sum; #endif buf[outlen - 2] = '='; buf[outlen - 1] = offset; } return outlen; } int base16384_encode(const char* data, int dlen, char* buf) { int outlen = dlen / 7 * 8; int offset = dlen % 7; switch(offset) { // also count 0x3dxx case 0: break; case 1: outlen += 4; break; case 2: case 3: outlen += 6; break; case 4: case 5: outlen += 8; break; case 6: outlen += 10; break; default: break; } uint32_t* vals = (uint32_t*)buf; uint32_t n = 0; int32_t i = 0; for(; i <= dlen - 7; i += 7) { register uint32_t sum = 0; register uint32_t shift = htobe32(*(uint32_t*)(data+i)); sum |= (shift>>2) & 0x3fff0000; sum |= (shift>>4) & 0x00003fff; sum += 0x4e004e00; vals[n++] = be32toh(sum); shift <<= 26; shift &= 0x3c000000; sum = 0; shift |= (htobe32(*(uint32_t*)(data+i+4))>>6)&0x03fffffc; sum |= shift & 0x3fff0000; shift >>= 2; sum |= shift & 0x00003fff; sum += 0x4e004e00; vals[n++] = be32toh(sum); } uint8_t o = offset; if(o--) { register uint32_t sum = 0x0000003f & (data[i] >> 2); sum |= ((uint32_t)data[i] << 14) & 0x0000c000; if(o--) { sum |= ((uint32_t)data[i + 1] << 6) & 0x00003f00; sum |= ((uint32_t)data[i + 1] << 20) & 0x00300000; if(o--) { sum |= ((uint32_t)data[i + 2] << 12) & 0x000f0000; sum |= ((uint32_t)data[i + 2] << 28) & 0xf0000000; if(o--) { sum |= ((uint32_t)data[i + 3] << 20) & 0x0f000000; sum += 0x004e004e; #ifdef WORDS_BIGENDIAN vals[n++] = __builtin_bswap32(sum); #else vals[n++] = sum; #endif sum = (((uint32_t)data[i + 3] << 2)) & 0x0000003c; if(o--) { sum |= (((uint32_t)data[i + 4] >> 6)) & 0x00000003; sum |= ((uint32_t)data[i + 4] << 10) & 0x0000fc00; if(o--) { sum |= ((uint32_t)data[i + 5] << 2) & 0x00000300; sum |= ((uint32_t)data[i + 5] << 16) & 0x003f0000; } } } } } sum += 0x004e004e; #ifdef WORDS_BIGENDIAN vals[n] = __builtin_bswap32(sum); #else vals[n] = sum; #endif buf[outlen - 2] = '='; buf[outlen - 1] = offset; } return outlen; } int base16384_encode_unsafe(const char* data, int dlen, char* buf) { int outlen = dlen / 7 * 8; int offset = dlen % 7; switch(offset) { // also count 0x3dxx case 0: break; case 1: outlen += 4; break; case 2: case 3: outlen += 6; break; case 4: case 5: outlen += 8; break; case 6: outlen += 10; break; default: break; } uint32_t* vals = (uint32_t*)buf; uint32_t n = 0; int32_t i = 0; for(; i < dlen; i += 7) { register uint32_t sum = 0; register uint32_t shift = htobe32(*(uint32_t*)(data+i)); sum |= (shift>>2) & 0x3fff0000; sum |= (shift>>4) & 0x00003fff; sum += 0x4e004e00; vals[n++] = be32toh(sum); shift <<= 26; shift &= 0x3c000000; sum = 0; shift |= (htobe32(*(uint32_t*)(data+i+4))>>6)&0x03fffffc; sum |= shift & 0x3fff0000; shift >>= 2; sum |= shift & 0x00003fff; sum += 0x4e004e00; vals[n++] = be32toh(sum); } if(offset) { buf[outlen - 2] = '='; buf[outlen - 1] = offset; } return outlen; } int base16384_decode_safe(const char* data, int dlen, char* buf) { int outlen = dlen; int offset = 0; if(data[dlen-2] == '=') { offset = data[dlen-1]; switch(offset) { // also count 0x3dxx case 0: break; case 1: outlen -= 4; break; case 2: case 3: outlen -= 6; break; case 4: case 5: outlen -= 8; break; case 6: outlen -= 10; break; default: break; } } outlen = outlen / 8 * 7 + offset; const uint32_t* vals = (const uint32_t*)data; uint32_t n = 0; int32_t i = 0; for(; i < outlen - 7; i+=7) { // n += 2 in one loop register uint32_t sum = 0; register uint32_t shift = htobe32(vals[n++]) - 0x4e004e00; shift <<= 2; sum |= shift & 0xfffc0000; shift <<= 2; sum |= shift & 0x0003fff0; shift = htobe32(vals[n++]) - 0x4e004e00; sum |= shift >> 26; *(uint32_t*)(buf+i) = be32toh(sum); sum = 0; shift <<= 6; sum |= shift & 0xffc00000; shift <<= 2; sum |= shift & 0x003fff00; *(uint32_t*)(buf+i+4) = be32toh(sum); } base16384_union_remainder valbuf; if(outlen - i == 7) { register uint32_t sum = 0; register uint32_t shift = htobe32(vals[n++]) - 0x4e004e00; shift <<= 2; sum |= shift & 0xfffc0000; shift <<= 2; sum |= shift & 0x0003fff0; shift = htobe32(vals[n]) - 0x4e004e00; sum |= shift >> 26; *(uint32_t*)(buf+i) = be32toh(sum); sum = 0; shift <<= 6; sum |= shift & 0xffc00000; shift <<= 2; sum |= shift & 0x003fff00; valbuf.val = be32toh(sum); memcpy(buf+i+4, valbuf.buf, 3); } else if((*(uint8_t*)(&vals[n]) != '=') && offset--) { int cnt = dlen-2-(int)n*(int)sizeof(uint32_t); if (cnt > 4) cnt = 4; memcpy(valbuf.buf, &vals[n], cnt); n++; #ifdef WORDS_BIGENDIAN register uint32_t sum = __builtin_bswap32(valbuf.val); #else register uint32_t sum = valbuf.val; #endif sum -= 0x0000004e; buf[i++] = ((sum & 0x0000003f) << 2) | ((sum & 0x0000c000) >> 14); if(offset--) { sum -= 0x004e0000; buf[i++] = ((sum & 0x00003f00) >> 6) | ((sum & 0x00300000) >> 20); if(offset--) { buf[i++] = ((sum & 0x000f0000) >> 12) | ((sum & 0xf0000000) >> 28); if(offset--) { buf[i] = (sum & 0x0f000000) >> 20; if(*(uint8_t*)(&vals[n]) == '=') return outlen; memcpy(valbuf.buf, &vals[n], dlen-2-(int)n*(int)sizeof(uint32_t)); #ifdef WORDS_BIGENDIAN sum = __builtin_bswap32(valbuf.val); #else sum = valbuf.val; #endif sum -= 0x0000004e; buf[i++] |= (sum & 0x0000003c) >> 2; if(offset--) { buf[i++] = ((sum & 0x00000003) << 6) | ((sum & 0x0000fc00) >> 10); if(offset--) { sum -= 0x004e0000; buf[i] = ((sum & 0x00000300) >> 2) | ((sum & 0x003f0000) >> 16); } } } } } } return outlen; } int base16384_decode(const char* data, int dlen, char* buf) { int outlen = dlen; int offset = 0; if(data[dlen-2] == '=') { offset = data[dlen-1]; switch(offset) { // also count 0x3dxx case 0: break; case 1: outlen -= 4; break; case 2: case 3: outlen -= 6; break; case 4: case 5: outlen -= 8; break; case 6: outlen -= 10; break; default: break; } } outlen = outlen / 8 * 7 + offset; const uint32_t* vals = (const uint32_t*)data; uint32_t n = 0; int32_t i = 0; for(; i <= outlen - 7; i+=7) { // n += 2 in one loop register uint32_t sum = 0; register uint32_t shift = htobe32(vals[n++]) - 0x4e004e00; shift <<= 2; sum |= shift & 0xfffc0000; shift <<= 2; sum |= shift & 0x0003fff0; shift = htobe32(vals[n++]) - 0x4e004e00; sum |= shift >> 26; *(uint32_t*)(buf+i) = be32toh(sum); sum = 0; shift <<= 6; sum |= shift & 0xffc00000; shift <<= 2; sum |= shift & 0x003fff00; *(uint32_t*)(buf+i+4) = be32toh(sum); } if(*(uint8_t*)(&vals[n]) == '=') return outlen; if(offset--) { // here comes a read overlap #ifdef WORDS_BIGENDIAN register uint32_t sum = __builtin_bswap32(vals[n++]); #else register uint32_t sum = vals[n++]; #endif sum -= 0x0000004e; buf[i++] = ((sum & 0x0000003f) << 2) | ((sum & 0x0000c000) >> 14); if(offset--) { sum -= 0x004e0000; buf[i++] = ((sum & 0x00003f00) >> 6) | ((sum & 0x00300000) >> 20); if(offset--) { buf[i++] = ((sum & 0x000f0000) >> 12) | ((sum & 0xf0000000) >> 28); if(offset--) { buf[i] = (sum & 0x0f000000) >> 20; if(*(uint8_t*)(&vals[n]) == '=') return outlen; // here comes a read overlap #ifdef WORDS_BIGENDIAN sum = __builtin_bswap32(vals[n]); #else sum = vals[n]; #endif sum -= 0x0000004e; buf[i++] |= (sum & 0x0000003c) >> 2; if(offset--) { buf[i++] = ((sum & 0x00000003) << 6) | ((sum & 0x0000fc00) >> 10); if(offset--) { sum -= 0x004e0000; buf[i] = ((sum & 0x00000300) >> 2) | ((sum & 0x003f0000) >> 16); } } } } } } return outlen; } int base16384_decode_unsafe(const char* data, int dlen, char* buf) { int outlen = dlen; int offset = 0; if(data[dlen-2] == '=') { offset = data[dlen-1]; switch(offset) { // also count 0x3dxx case 0: break; case 1: outlen -= 4; break; case 2: case 3: outlen -= 6; break; case 4: case 5: outlen -= 8; break; case 6: outlen -= 10; break; default: break; } } outlen = outlen / 8 * 7 + offset; const uint32_t* vals = (const uint32_t*)data; uint32_t n = 0; int32_t i = 0; for(; i < outlen-7; i+=7) { // n += 2 in one loop register uint32_t sum = 0; register uint32_t shift = htobe32(vals[n++]) - 0x4e004e00; shift <<= 2; sum |= shift & 0xfffc0000; shift <<= 2; sum |= shift & 0x0003fff0; shift = htobe32(vals[n++]) - 0x4e004e00; sum |= shift >> 26; *(uint32_t*)(buf+i) = be32toh(sum); sum = 0; shift <<= 6; sum |= shift & 0xffc00000; shift <<= 2; sum |= shift & 0x003fff00; *(uint32_t*)(buf+i+4) = be32toh(sum); } register uint32_t sum = 0; register uint32_t shift = htobe32(vals[n++]); if(((shift>>24)&0xff) == 0x3d) return outlen; if(((shift>>24)&0xff) < 0x4e) shift |= 0xff000000; if(((shift>> 8)&0xff) < 0x4e) shift |= 0x0000ff00; shift -= 0x4e004e00; shift <<= 2; sum |= shift & 0xfffc0000; shift <<= 2; sum |= shift & 0x0003fff0; shift = htobe32(vals[n]); if(((shift>>24)&0xff) == 0x3d) { *(uint32_t*)(buf+i) = be32toh(sum); return outlen; } if(((shift>>24)&0xff) < 0x4e) shift |= 0xff000000; if(((shift>> 8)&0xff) < 0x4e) shift |= 0x0000ff00; shift -= 0x4e004e00; sum |= shift >> 26; *(uint32_t*)(buf+i) = be32toh(sum); sum = 0; shift <<= 6; sum |= shift & 0xffc00000; shift <<= 2; sum |= shift & 0x003fff00; *(uint32_t*)(buf+i+4) = be32toh(sum); return outlen; } base16384-2.3.1/base1464.c000066400000000000000000000274231460451635100144470ustar00rootroot00000000000000/* base1464.c * This file is part of the base16384 distribution (https://github.com/fumiama/base16384). * Copyright (c) 2022-2024 Fumiama Minamoto. * * 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 . */ #ifndef __cosmopolitan #include #endif #include "binary.h" typedef union { uint8_t buf[8]; uint64_t val; } base16384_union_remainder; int base16384_encode_safe(const char* data, int dlen, char* buf) { int outlen = dlen / 7 * 8; int offset = dlen % 7; switch(offset) { // also count 0x3dxx case 0: break; case 1: outlen += 4; break; case 2: case 3: outlen += 6; break; case 4: case 5: outlen += 8; break; case 6: outlen += 10; break; default: break; } uint64_t* vals = (uint64_t*)buf; uint64_t n = 0; int64_t i = 0; for(; i < dlen - 7; i += 7) { register uint64_t sum = 0; register uint64_t shift = htobe64(*(uint64_t*)(data+i))>>2; sum |= shift & 0x3fff000000000000; shift >>= 2; sum |= shift & 0x00003fff00000000; shift >>= 2; sum |= shift & 0x000000003fff0000; shift >>= 2; sum |= shift & 0x0000000000003fff; sum += 0x4e004e004e004e00; vals[n++] = be64toh(sum); } base16384_union_remainder valbuf; if(dlen - i == 7) { memcpy(valbuf.buf, data+i, 7); register uint64_t sum = 0; register uint64_t shift = htobe64(valbuf.val)>>2; sum |= shift & 0x3fff000000000000; shift >>= 2; sum |= shift & 0x00003fff00000000; shift >>= 2; sum |= shift & 0x000000003fff0000; shift >>= 2; sum |= shift & 0x0000000000003fff; sum += 0x4e004e004e004e00; vals[n++] = be64toh(sum); return outlen; } int o = offset; if(o--) { register uint64_t sum = 0x000000000000003f & (data[i] >> 2); sum |= ((uint64_t)data[i] << 14) & 0x000000000000c000; if(o--) { sum |= ((uint64_t)data[i + 1] << 6) & 0x0000000000003f00; sum |= ((uint64_t)data[i + 1] << 20) & 0x0000000000300000; if(o--) { sum |= ((uint64_t)data[i + 2] << 12) & 0x00000000000f0000; sum |= ((uint64_t)data[i + 2] << 28) & 0x00000000f0000000; if(o--) { sum |= ((uint64_t)data[i + 3] << 20) & 0x000000000f000000; sum |= ((uint64_t)data[i + 3] << 34) & 0x0000003c00000000; if(o--) { sum |= ((uint64_t)data[i + 4] << 26) & 0x0000000300000000; sum |= ((uint64_t)data[i + 4] << 42) & 0x0000fc0000000000; if(o--) { sum |= ((uint64_t)data[i + 5] << 34) & 0x0000030000000000; sum |= ((uint64_t)data[i + 5] << 48) & 0x003f000000000000; } } } } } sum += 0x004e004e004e004e; #ifdef WORDS_BIGENDIAN valbuf.val = __builtin_bswap64(sum); #else valbuf.val = sum; #endif memcpy(&vals[n], valbuf.buf, outlen-2-(int)n*(int)sizeof(uint64_t)); buf[outlen - 2] = '='; buf[outlen - 1] = offset; } return outlen; } int base16384_encode(const char* data, int dlen, char* buf) { int outlen = dlen / 7 * 8; int offset = dlen % 7; switch(offset) { // also count 0x3dxx case 0: break; case 1: outlen += 4; break; case 2: case 3: outlen += 6; break; case 4: case 5: outlen += 8; break; case 6: outlen += 10; break; default: break; } uint64_t* vals = (uint64_t*)buf; uint64_t n = 0; int64_t i = 0; for(; i <= dlen - 7; i += 7) { register uint64_t sum = 0; register uint64_t shift = htobe64(*(uint64_t*)(data+i))>>2; // here comes a read overlap sum |= shift & 0x3fff000000000000; shift >>= 2; sum |= shift & 0x00003fff00000000; shift >>= 2; sum |= shift & 0x000000003fff0000; shift >>= 2; sum |= shift & 0x0000000000003fff; sum += 0x4e004e004e004e00; vals[n++] = be64toh(sum); } int o = offset; if(o--) { register uint64_t sum = 0x000000000000003f & (data[i] >> 2); sum |= ((uint64_t)data[i] << 14) & 0x000000000000c000; if(o--) { sum |= ((uint64_t)data[i + 1] << 6) & 0x0000000000003f00; sum |= ((uint64_t)data[i + 1] << 20) & 0x0000000000300000; if(o--) { sum |= ((uint64_t)data[i + 2] << 12) & 0x00000000000f0000; sum |= ((uint64_t)data[i + 2] << 28) & 0x00000000f0000000; if(o--) { sum |= ((uint64_t)data[i + 3] << 20) & 0x000000000f000000; sum |= ((uint64_t)data[i + 3] << 34) & 0x0000003c00000000; if(o--) { sum |= ((uint64_t)data[i + 4] << 26) & 0x0000000300000000; sum |= ((uint64_t)data[i + 4] << 42) & 0x0000fc0000000000; if(o--) { sum |= ((uint64_t)data[i + 5] << 34) & 0x0000030000000000; sum |= ((uint64_t)data[i + 5] << 48) & 0x003f000000000000; } } } } } sum += 0x004e004e004e004e; #ifdef WORDS_BIGENDIAN vals[n] = __builtin_bswap64(sum); #else vals[n] = sum; #endif buf[outlen - 2] = '='; buf[outlen - 1] = offset; } return outlen; } int base16384_encode_unsafe(const char* data, int dlen, char* buf) { int outlen = dlen / 7 * 8; int offset = dlen % 7; switch(offset) { // also count 0x3dxx case 0: break; case 1: outlen += 4; break; case 2: case 3: outlen += 6; break; case 4: case 5: outlen += 8; break; case 6: outlen += 10; break; default: break; } uint64_t* vals = (uint64_t*)buf; uint64_t n = 0; int64_t i = 0; for(; i < dlen; i += 7) { register uint64_t sum = 0; register uint64_t shift = htobe64(*(uint64_t*)(data+i))>>2; // here comes a read overlap sum |= shift & 0x3fff000000000000; shift >>= 2; sum |= shift & 0x00003fff00000000; shift >>= 2; sum |= shift & 0x000000003fff0000; shift >>= 2; sum |= shift & 0x0000000000003fff; sum += 0x4e004e004e004e00; vals[n++] = be64toh(sum); } if(offset) { buf[outlen - 2] = '='; buf[outlen - 1] = offset; } return outlen; } int base16384_decode_safe(const char* data, int dlen, char* buf) { int outlen = dlen; int offset = 0; if(data[dlen-2] == '=') { offset = data[dlen-1]; switch(offset) { // also count 0x3dxx case 0: break; case 1: outlen -= 4; break; case 2: case 3: outlen -= 6; break; case 4: case 5: outlen -= 8; break; case 6: outlen -= 10; break; default: break; } } outlen = outlen / 8 * 7 + offset; const uint64_t* vals = (const uint64_t*)data; uint64_t n = 0; int64_t i = 0; for(; i < outlen - 7; n++, i+=7) { register uint64_t sum = 0; register uint64_t shift = htobe64(vals[n]) - 0x4e004e004e004e00; shift <<= 2; sum |= shift & 0xfffc000000000000; shift <<= 2; sum |= shift & 0x0003fff000000000; shift <<= 2; sum |= shift & 0x0000000fffc00000; shift <<= 2; sum |= shift & 0x00000000003fff00; *(uint64_t*)(buf+i) = be64toh(sum); } base16384_union_remainder valbuf; if(outlen - i == 7) { register uint64_t sum = 0; register uint64_t shift = htobe64(vals[n]) - 0x4e004e004e004e00; shift <<= 2; sum |= shift & 0xfffc000000000000; shift <<= 2; sum |= shift & 0x0003fff000000000; shift <<= 2; sum |= shift & 0x0000000fffc00000; shift <<= 2; sum |= shift & 0x00000000003fff00; valbuf.val = be64toh(sum); memcpy(buf+i, valbuf.buf, 7); } else if((*(uint8_t*)(&vals[n]) != '=') && offset--) { memcpy(valbuf.buf, &vals[n], dlen-2-(int)n*(int)sizeof(uint64_t)); #ifdef WORDS_BIGENDIAN register uint64_t sum = __builtin_bswap64(valbuf.val) - 0x000000000000004e; #else register uint64_t sum = valbuf.val - 0x000000000000004e; #endif buf[i++] = (char)(((sum & 0x000000000000003f) << 2) | ((sum & 0x000000000000c000) >> 14)); if(offset--) { sum -= 0x00000000004e0000; buf[i++] = (char)(((sum & 0x0000000000003f00) >> 6) | ((sum & 0x0000000000300000) >> 20)); if(offset--) { buf[i++] = (char)(((sum & 0x00000000000f0000) >> 12) | ((sum & 0x00000000f0000000) >> 28)); if(offset--) { sum -= 0x0000004e00000000; buf[i++] = (char)(((sum & 0x000000000f000000) >> 20) | ((sum & 0x0000003c00000000) >> 34)); if(offset--) { buf[i++] = (char)(((sum & 0x0000000300000000) >> 26) | ((sum & 0x0000fc0000000000) >> 42)); if(offset--) { sum -= 0x004e000000000000; buf[i] = (char)(((sum & 0x0000030000000000) >> 34) | ((sum & 0x003f000000000000) >> 48)); } } } } } } return outlen; } int base16384_decode(const char* data, int dlen, char* buf) { int outlen = dlen; int offset = 0; if(data[dlen-2] == '=') { offset = data[dlen-1]; switch(offset) { // also count 0x3dxx case 0: break; case 1: outlen -= 4; break; case 2: case 3: outlen -= 6; break; case 4: case 5: outlen -= 8; break; case 6: outlen -= 10; break; default: break; } } outlen = outlen / 8 * 7 + offset; const uint64_t* vals = (const uint64_t*)data; uint64_t n = 0; int64_t i = 0; for(; i <= outlen - 7; n++, i+=7) { register uint64_t sum = 0; register uint64_t shift = htobe64(vals[n]) - 0x4e004e004e004e00; shift <<= 2; sum |= shift & 0xfffc000000000000; shift <<= 2; sum |= shift & 0x0003fff000000000; shift <<= 2; sum |= shift & 0x0000000fffc00000; shift <<= 2; sum |= shift & 0x00000000003fff00; *(uint64_t*)(buf+i) = be64toh(sum); } if(*(uint8_t*)(&vals[n]) == '=') return outlen; if(offset--) { // here comes a read overlap #ifdef WORDS_BIGENDIAN register uint64_t sum = __builtin_bswap64(vals[n]) - 0x000000000000004e; #else register uint64_t sum = vals[n] - 0x000000000000004e; #endif buf[i++] = (char)(((sum & 0x000000000000003f) << 2) | ((sum & 0x000000000000c000) >> 14)); if(offset--) { sum -= 0x00000000004e0000; buf[i++] = (char)(((sum & 0x0000000000003f00) >> 6) | ((sum & 0x0000000000300000) >> 20)); if(offset--) { buf[i++] = (char)(((sum & 0x00000000000f0000) >> 12) | ((sum & 0x00000000f0000000) >> 28)); if(offset--) { sum -= 0x0000004e00000000; buf[i++] = (char)(((sum & 0x000000000f000000) >> 20) | ((sum & 0x0000003c00000000) >> 34)); if(offset--) { buf[i++] = (char)(((sum & 0x0000000300000000) >> 26) | ((sum & 0x0000fc0000000000) >> 42)); if(offset--) { sum -= 0x004e000000000000; buf[i] = (char)(((sum & 0x0000030000000000) >> 34) | ((sum & 0x003f000000000000) >> 48)); } } } } } } return outlen; } int base16384_decode_unsafe(const char* data, int dlen, char* buf) { int outlen = dlen; int offset = 0; if(data[dlen-2] == '=') { offset = data[dlen-1]; switch(offset) { // also count 0x3dxx case 0: break; case 1: outlen -= 4; break; case 2: case 3: outlen -= 6; break; case 4: case 5: outlen -= 8; break; case 6: outlen -= 10; break; default: break; } } outlen = outlen / 8 * 7 + offset; const uint64_t* vals = (const uint64_t*)data; uint64_t n = 0; int64_t i = 0; for(; i < outlen-7; n++, i+=7) { register uint64_t sum = 0; register uint64_t shift = htobe64(vals[n]) - 0x4e004e004e004e00; shift <<= 2; sum |= shift & 0xfffc000000000000; shift <<= 2; sum |= shift & 0x0003fff000000000; shift <<= 2; sum |= shift & 0x0000000fffc00000; shift <<= 2; sum |= shift & 0x00000000003fff00; *(uint64_t*)(buf+i) = be64toh(sum); } register uint64_t sum = 0; register uint64_t shift = htobe64(vals[n]); if(((shift>>56)&0xff) == 0x3d) return outlen; if(((shift>>56)&0xff) < 0x4e) shift |= 0xff00000000000000; if(((shift>>40)&0xff) < 0x4e) shift |= 0x0000ff0000000000; if(((shift>>24)&0xff) < 0x4e) shift |= 0x00000000ff000000; if(((shift>> 8)&0xff) < 0x4e) shift |= 0x000000000000ff00; shift -= 0x4e004e004e004e00; shift <<= 2; sum |= shift & 0xfffc000000000000; shift <<= 2; sum |= shift & 0x0003fff000000000; shift <<= 2; sum |= shift & 0x0000000fffc00000; shift <<= 2; sum |= shift & 0x00000000003fff00; *(uint64_t*)(buf+i) = be64toh(sum); return outlen; } base16384-2.3.1/base16384.1000066400000000000000000000051721460451635100144510ustar00rootroot00000000000000.TH BASE16384 1 "7 April 2024" "GNU" "User Commands" .SH NAME base16384 \- Encode binary files to printable utf16be .SH SYNOPSIS .B base16384 -[ed][t][n][cC] <\fIinputfile\fR> <\fIoutputfile\fR> .SH DESCRIPTION .LP There are .B 16384 Chinese characters ( from .B 4E00 to .B 8DFF ) as the .I "alphabet" , just like what base64 did. If length of the data has a remainder after mod 7, an unicode Chinese character .B 3Dxx will be appended to present it with .I xx ranging from .I 01 to .I 06 . .SH OPTIONS .sp 1 .TP 0.5i \fB\-e\fR Read data from \fIinputfile\fR and encode them into \fIoutputfile\fR. It's the default option when neither .B -e nor .B -d is specified. .TP 0.5i \fB\-d\fR Read data from \fIinputfile\fR and decode them into \fIoutputfile\fR. .TP 0.5i \fB\-t\fR Show spend time. .TP 0.5i \fB\-n\fR Do not write utf16be file header .B 0xFEFF to the output. .TP 0.5i \fB\-c\fR Embed or validate checksum in remainder when using \fIstdin\fR or \fIstdout\fR or inputsize > _BASE16384_ENCBUFSZ. .TP 0.5i \fB\-C\fR Do .B -c forcely. .TP 0.5i \fBinputfile\fR An absolute or relative file path. Specially, pass .B - to read from \fIstdin\fR. .TP 0.5i \fBoutputfile\fR An absolute or relative file path. Specially, pass .B - to write to \fIstdout\fR. .SH "EXIT STATUS" .TP 0.5i \fB0\fR Exit on success. .TP 0.5i \fB1\fR Get file size error. .TP 0.5i \fB2\fR Fopen output file error. .TP 0.5i \fB3\fR Fopen input file error. .TP 0.5i \fB4\fR Write file error. .TP 0.5i \fB5\fR Open input file error. .TP 0.5i \fB6\fR Map input file error. .TP 0.5i \fB7\fR Write file error in mmap. .TP 0.5i \fB8\fR Invalid input/output filename. .TP 0.5i \fB9\fR Invalid commandline parameter. .TP 0.5i \fB10\fR Invalid decoding checksum. .SH "SEE ALSO" https://github.com/fumiama/base16384 .SH BUGS There are currently no known bugs in this application. If you have found them, please contact the .B author on github. .SH AUTHOR This manual page contributed by Fumiama Minamoto. .SH "COPYRIGHT" Copyright \(co 2022-2024, Fumiama Minamoto This file is part of .IR "base16384" . .LP Base16384 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. .LP Base16384 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. .LP You should have received a copy of the GNU General Public License along with this program. If not, see .IR http://www.gnu.org/licenses/ . base16384-2.3.1/base16384.c000066400000000000000000000100541460451635100145260ustar00rootroot00000000000000/* base16384.c * This file is part of the base16384 distribution (https://github.com/fumiama/base16384). * Copyright (c) 2022-2024 Fumiama Minamoto. * * 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 . */ #ifndef __cosmopolitan #include #include #include #include #ifdef _WIN32 #include #endif #endif #include "base16384.h" static char encbuf[BASE16384_ENCBUFSZ]; static char decbuf[BASE16384_DECBUFSZ]; #ifndef _WIN32 static unsigned long get_start_ms() { struct timespec ts; clock_gettime(CLOCK_MONOTONIC, &ts); return (ts.tv_sec * 1000 + ts.tv_nsec / 1000000); } #endif static base16384_err_t print_usage() { #ifndef BASE16384_VERSION #define BASE16384_VERSION "dev" #endif #ifndef BASE16384_VERSION_DATE #define BASE16384_VERSION_DATE "unknown date" #endif fputs( "Copyright (c) 2022-2024 Fumiama Minamoto.\nBase16384 " BASE16384_VERSION " (" BASE16384_VERSION_DATE "). Usage:\n", stderr ); fputs("base16384 -[ed][t][n][cC] [inputfile] [outputfile]\n", stderr); fputs(" -e\t\tencode (default)\n", stderr); fputs(" -d\t\tdecode\n", stderr); fputs(" -t\t\tshow spend time\n", stderr); fputs(" -n\t\tdonot write utf16be file header (0xFEFF)\n", stderr); fputs(" -c\t\tembed or validate checksum in remainder\n", stderr); fputs(" -C\t\tdo -c forcely\n", stderr); fputs(" inputfile\tpass - to read from stdin\n", stderr); fputs(" outputfile\tpass - to write to stdout\n", stderr); return base16384_err_invalid_commandline_parameter; } int main(int argc, char** argv) { const char* cmd = argv[1]; if(argc != 4 || cmd[0] != '-') return print_usage(); int flaglen = strlen(cmd); if(flaglen <= 1 || flaglen > 5) return print_usage(); #ifdef _WIN32 clock_t t = 0; #else unsigned long t = 0; #endif uint16_t is_encode = 1, use_timer = 0, no_header = 0, use_checksum = 0; #define set_flag(f, v) ((f) = (((((f)>>8)+1) << 8)&0xff00) | (v&0x00ff)) #define flag_has_been_set(f) ((f)>>8) #define set_or_test_flag(f, v) (flag_has_been_set(f)?1:(set_flag(f, v), 0)) while(--flaglen) switch(cmd[flaglen]) { // skip cmd[0] = '-' case 'e': if(set_or_test_flag(is_encode, 1)) return print_usage(); break; case 'd': if(set_or_test_flag(is_encode, 0)) return print_usage(); break; case 't': if(set_or_test_flag(use_timer, 1)) return print_usage(); break; case 'n': if(set_or_test_flag(no_header, 1)) return print_usage(); break; case 'c': if(set_or_test_flag(use_checksum, 1)) return print_usage(); break; case 'C': if(set_or_test_flag(use_checksum, 2)) return print_usage(); break; default: return print_usage(); break; } #define clear_high_byte(x) ((x) &= 0x00ff) clear_high_byte(is_encode); clear_high_byte(use_timer); clear_high_byte(no_header); clear_high_byte(use_checksum); if(use_timer) { #ifdef _WIN32 t = clock(); #else t = get_start_ms(); #endif } base16384_err_t exitstat = base16384_err_ok; #define do_coding(method) base16384_##method##_file_detailed( \ argv[2], argv[3], encbuf, decbuf, \ (no_header?BASE16384_FLAG_NOHEADER:0) \ | ((use_checksum&1)?BASE16384_FLAG_SUM_CHECK_ON_REMAIN:0) \ | ((use_checksum&2)?BASE16384_FLAG_DO_SUM_CHECK_FORCELY:0) \ ) exitstat = is_encode?do_coding(encode):do_coding(decode); #undef do_coding if(t) { #ifdef _WIN32 fprintf(stderr, "spend time: %lums\n", clock() - t); #else fprintf(stderr, "spend time: %lums\n", get_start_ms() - t); #endif } return base16384_perror(exitstat); } base16384-2.3.1/base16384.h000066400000000000000000000271451460451635100145440ustar00rootroot00000000000000#ifndef _BASE16384_H_ #define _BASE16384_H_ /* base16384.h * This file is part of the base16384 distribution (https://github.com/fumiama/base16384). * Copyright (c) 2022-2024 Fumiama Minamoto. * * 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 . */ #ifndef __cosmopolitan #include #include #endif #ifdef _MSC_VER #include #ifndef ssize_t typedef SSIZE_T ssize_t; #endif #endif enum base16384_err_t { base16384_err_ok, base16384_err_get_file_size, base16384_err_fopen_output_file, base16384_err_fopen_input_file, base16384_err_write_file, base16384_err_open_input_file, base16384_err_map_input_file, base16384_err_read_file, base16384_err_invalid_file_name, base16384_err_invalid_commandline_parameter, base16384_err_invalid_decoding_checksum, }; /** * @brief return value of base16384_en/decode_file */ typedef enum base16384_err_t base16384_err_t; #ifndef BASE16384_BUFSZ_FACTOR #define BASE16384_BUFSZ_FACTOR (8) #endif #define _BASE16384_ENCBUFSZ ((BUFSIZ*BASE16384_BUFSZ_FACTOR)/7*7) #define _BASE16384_DECBUFSZ ((BUFSIZ*BASE16384_BUFSZ_FACTOR)/8*8) #define BASE16384_ENCBUFSZ (_BASE16384_ENCBUFSZ+16) #define BASE16384_DECBUFSZ (_BASE16384_DECBUFSZ+16) // disable 0xFEFF file header in encode #define BASE16384_FLAG_NOHEADER (1<<0) // enable sum check when using stdin or stdout or inputsize > _BASE16384_ENCBUFSZ #define BASE16384_FLAG_SUM_CHECK_ON_REMAIN (1<<1) // forcely do sumcheck without checking data length #define BASE16384_FLAG_DO_SUM_CHECK_FORCELY (1<<2) /** * @brief custom reader function interface * @param client_data the data pointer defined by the client * @param buffer to where put data * @param count read bytes count * @return the size read */ typedef ssize_t (*base16384_reader_t)(const void *client_data, void *buffer, size_t count); /** * @brief custom writer function interface * @param client_data the data pointer defined by the client * @param buffer from where read data * @param count write bytes count * @return the size written */ typedef ssize_t (*base16384_writer_t)(const void *client_data, const void *buffer, size_t count); union base16384_io_function_t { base16384_reader_t reader; base16384_writer_t writer; }; typedef union base16384_io_function_t base16384_io_function_t; struct base16384_stream_t { base16384_io_function_t f; void *client_data; }; /** * @brief for stream encode/decode */ typedef struct base16384_stream_t base16384_stream_t; /** * @brief calculate the exact encoded size * @param dlen the data length to encode * @return the size */ static inline int _base16384_encode_len(int dlen) { int outlen = dlen / 7 * 8; int offset = dlen % 7; switch(offset) { // also count 0x3dxx case 0: break; case 1: outlen += 4; break; case 2: case 3: outlen += 6; break; case 4: case 5: outlen += 8; break; case 6: outlen += 10; break; default: break; } return outlen; } /** * @brief calculate minimum encoding buffer size (16 bits larger than the real encoded size) * @param dlen the data length to encode * @return the minimum encoding buffer size */ static inline int base16384_encode_len(int dlen) { return _base16384_encode_len(dlen) + 16; // 冗余的 16 字节用于可能的结尾的 unsafe 覆盖 } /** * @brief calculate the exact decoded size * @param dlen the data length to decode * @param offset the last char `xx` of the underfilled coding (0x3Dxx) or 0 for the full coding * @return the size */ static inline int _base16384_decode_len(int dlen, int offset) { int outlen = dlen; switch(offset) { // also count 0x3dxx case 0: break; case 1: outlen -= 4; break; case 2: case 3: outlen -= 6; break; case 4: case 5: outlen -= 8; break; case 6: outlen -= 10; break; default: break; } return outlen / 8 * 7 + offset; } /** * @brief calculate minimum decoding buffer size (16 bits larger than the real decoded size) * @param dlen the data length to decode * @param offset the last char `xx` of the underfilled coding (0x3Dxx) or 0 for the full coding * @return the minimum decoding buffer size */ static inline int base16384_decode_len(int dlen, int offset) { return _base16384_decode_len(dlen, offset) + 16; // 多出 16 字节用于 unsafe 循环覆盖 } /** * @brief safely encode data and write result into buf * @param data data to encode, no data overread * @param dlen the data length * @param buf the output buffer, whose size can be exactly `_base16384_encode_len` * @return the total length written */ int base16384_encode_safe(const char* data, int dlen, char* buf); /** * @brief encode data and write result into buf * @param data data to encode * @param dlen the data length * @param buf the output buffer, whose size must greater than `base16384_encode_len` * @return the total length written */ int base16384_encode(const char* data, int dlen, char* buf); /** * @brief encode data and write result into buf without considering border condition * @param data data to encode * @param dlen the data length * @param buf the output buffer, whose size must greater than `base16384_encode_len` * @return the total length written */ int base16384_encode_unsafe(const char* data, int dlen, char* buf); /** * @brief safely decode data and write result into buf * @param data data to decode, no data overread * @param dlen the data length * @param buf the output buffer, whose size can be exactly `_base16384_decode_len` * @return the total length written */ int base16384_decode_safe(const char* data, int dlen, char* buf); /** * @brief decode data and write result into buf * @param data data to decode * @param dlen the data length * @param buf the output buffer, whose size must greater than `base16384_decode_len` * @return the total length written */ int base16384_decode(const char* data, int dlen, char* buf); /** * @brief decode data and write result into buf without considering border condition * @param data data to decode * @param dlen the data length * @param buf the output buffer, whose size must greater than `base16384_decode_len` * @return the total length written */ int base16384_decode_unsafe(const char* data, int dlen, char* buf); #define base16384_typed_params(type) type input, type output, char* encbuf, char* decbuf #define base16384_typed_flag_params(type) base16384_typed_params(type), int flag /** * @brief encode input file to output file * @param input filename or `-` to specify stdin * @param output filename or `-` to specify stdout * @param encbuf must be no less than BASE16384_ENCBUFSZ * @param decbuf must be no less than BASE16384_DECBUFSZ * @param flag BASE16384_FLAG_xxx value, add multiple flags by `|` * @return the error code */ base16384_err_t base16384_encode_file_detailed(base16384_typed_flag_params(const char*)); /** * @brief encode input `FILE*` to output `FILE*` * @param input `FILE*` pointer * @param output `FILE*` pointer * @param encbuf must be no less than BASE16384_ENCBUFSZ * @param decbuf must be no less than BASE16384_DECBUFSZ * @param flag BASE16384_FLAG_xxx value, add multiple flags by `|` * @return the error code */ base16384_err_t base16384_encode_fp_detailed(base16384_typed_flag_params(FILE*)); /** * @brief encode input stream to output stream * @param input file descripter * @param output file descripter * @param encbuf must be no less than BASE16384_ENCBUFSZ * @param decbuf must be no less than BASE16384_DECBUFSZ * @param flag BASE16384_FLAG_xxx value, add multiple flags by `|` * @return the error code */ base16384_err_t base16384_encode_fd_detailed(base16384_typed_flag_params(int)); /** * @brief encode custom input reader to custom output writer * @param input custom input reader * @param output custom output writer * @param encbuf must be no less than BASE16384_ENCBUFSZ * @param decbuf must be no less than BASE16384_DECBUFSZ * @param flag BASE16384_FLAG_xxx value, add multiple flags by `|` * @return the error code */ base16384_err_t base16384_encode_stream_detailed(base16384_typed_flag_params(base16384_stream_t*)); /** * @brief decode input file to output file * @param input filename or `-` to specify stdin * @param output filename or `-` to specify stdout * @param encbuf must be no less than BASE16384_ENCBUFSZ * @param decbuf must be no less than BASE16384_DECBUFSZ * @param flag BASE16384_FLAG_xxx value, add multiple flags by `|` * @return the error code */ base16384_err_t base16384_decode_file_detailed(base16384_typed_flag_params(const char*)); /** * @brief decode input `FILE*` to output `FILE*` * @param input `FILE*` pointer * @param output `FILE*` pointer * @param encbuf must be no less than BASE16384_ENCBUFSZ * @param decbuf must be no less than BASE16384_DECBUFSZ * @param flag BASE16384_FLAG_xxx value, add multiple flags by `|` * @return the error code */ base16384_err_t base16384_decode_fp_detailed(base16384_typed_flag_params(FILE*)); /** * @brief decode input stream to output stream * @param input file descripter * @param output file descripter * @param encbuf must be no less than BASE16384_ENCBUFSZ * @param decbuf must be no less than BASE16384_DECBUFSZ * @param flag BASE16384_FLAG_xxx value, add multiple flags by `|` * @return the error code */ base16384_err_t base16384_decode_fd_detailed(base16384_typed_flag_params(int)); /** * @brief decode custom input reader to custom output writer * @param input custom input reader * @param output custom output writer * @param encbuf must be no less than BASE16384_ENCBUFSZ * @param decbuf must be no less than BASE16384_DECBUFSZ * @param flag BASE16384_FLAG_xxx value, add multiple flags by `|` * @return the error code */ base16384_err_t base16384_decode_stream_detailed(base16384_typed_flag_params(base16384_stream_t*)); #define BASE16384_WRAP_DECL(method, name, type) \ base16384_err_t base16384_##method##_##name(base16384_typed_params(type)); BASE16384_WRAP_DECL(encode, file, const char*); BASE16384_WRAP_DECL(encode, fp, FILE*); BASE16384_WRAP_DECL(encode, fd, int); BASE16384_WRAP_DECL(encode, stream, base16384_stream_t*); BASE16384_WRAP_DECL(decode, file, const char*); BASE16384_WRAP_DECL(decode, fp, FILE*); BASE16384_WRAP_DECL(decode, fd, int); BASE16384_WRAP_DECL(decode, stream, base16384_stream_t*); #undef BASE16384_WRAP_DECL #undef base16384_typed_flag_params #undef base16384_typed_params /** * @brief call perror on error * @param err the error * @return the input parameter `err` */ static inline base16384_err_t base16384_perror(base16384_err_t err) { #define base16384_perror_case(n) case base16384_err_##n: perror("base16384_err_"#n) if(err) switch(err) { base16384_perror_case(get_file_size); break; base16384_perror_case(fopen_output_file); break; base16384_perror_case(fopen_input_file); break; base16384_perror_case(write_file); break; base16384_perror_case(open_input_file); break; base16384_perror_case(map_input_file); break; base16384_perror_case(read_file); break; base16384_perror_case(invalid_file_name); break; base16384_perror_case(invalid_commandline_parameter); break; base16384_perror_case(invalid_decoding_checksum); break; default: perror("base16384"); break; } #undef base16384_perror_case return err; } #endif base16384-2.3.1/binary.h000066400000000000000000000074551460451635100145120ustar00rootroot00000000000000#ifndef _BINARY_H_ #define _BINARY_H_ /* binary.h * This file is part of the base16384 distribution (https://github.com/fumiama/base16384). * Copyright (c) 2022-2024 Fumiama Minamoto. * * 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 . */ #ifdef __cosmopolitan // always le #define be16toh(x) bswap_16(x) #define be32toh(x) bswap_32(x) #define htobe16(x) bswap_16(x) #define htobe32(x) bswap_32(x) #else #include #include #include #ifdef __linux__ #include #endif #ifdef __FreeBSD__ #include #endif #ifdef __NetBSD__ #include #endif #ifdef __OpenBSD__ #include #define be16toh(x) betoh16(x) #define be32toh(x) betoh32(x) #ifdef IS_64BIT_PROCESSOR #define be64toh(x) betoh64(x) #endif #endif #ifdef __APPLE__ #define be16toh(x) ntohs(x) #define be32toh(x) ntohl(x) #ifdef IS_64BIT_PROCESSOR #define be64toh(x) ntohll(x) #endif #define htobe16(x) htons(x) #define htobe32(x) htonl(x) #ifdef IS_64BIT_PROCESSOR #define htobe64(x) htonll(x) #endif #endif #ifdef _WIN32 #ifdef WORDS_BIGENDIAN #define be16toh(x) (x) #define be32toh(x) (x) #ifdef IS_64BIT_PROCESSOR #define be64toh(x) (x) #endif #define htobe16(x) (x) #define htobe32(x) (x) #ifdef IS_64BIT_PROCESSOR #define htobe64(x) (x) #endif #else #define be16toh(x) _byteswap_ushort(x) #define be32toh(x) _byteswap_ulong(x) #ifdef IS_64BIT_PROCESSOR #define be64toh(x) _byteswap_uint64(x) #endif #define htobe16(x) _byteswap_ushort(x) #define htobe32(x) _byteswap_ulong(x) #ifdef IS_64BIT_PROCESSOR #define htobe64(x) _byteswap_uint64(x) #endif #endif #endif #endif // leftrotate function definition #define LEFTROTATE(x, c) (((x) << (c)) | ((x) >> (sizeof(x)*8 - (c)))) // initial sum value used in BASE16384_FLAG_SUM_CHECK_ON_REMAIN #define BASE16384_SIMPLE_SUM_INIT_VALUE (0x8e29c213) #ifdef _MSC_VER static inline uint32_t calc_sum(uint32_t sum, int cnt, const char* encbuf) { #else static inline uint32_t calc_sum(uint32_t sum, size_t cnt, const char* encbuf) { #endif size_t i; uint32_t buf; for(i = 0; i < cnt; i++) { buf = (uint32_t)(encbuf[i])&0xff; buf = ((buf<<(24-6))&0x03000000) | ((buf<<(16-4))&0x00030000) | ((buf<<(8-2))&0x00000300) | (buf&0x03); sum += buf; sum = ~LEFTROTATE(sum, 3); } return sum; } static inline int check_sum(uint32_t sum, uint32_t sum_read_raw, int offset) { offset = offset%7; if(!offset--) return 0; // no remain bits, pass // offset 1: 0011 1111 1100 0000 remain: 3*2 bits // offset 2: 0011 1111 1111 1111 0011 0000 0000 0000 remain: 6*2 bits // offset 3: 0011 1111 1111 0000 remain: 2*2 bits // offset 4: 0011 1111 1111 1111 0011 1100 0000 0000 remain: 5*2 bits // offset 5: 0011 1111 1111 1100 remain: 1*2 bits // offset 6: 0011 1111 1111 1111 0011 1111 0000 0000 remain: 4*2 bits // encode: 0415263 (6-1) per 3bits, thus 0x021ab3 int shift = sizeof(uint32_t)*8 - ((0x021ab3>>(offset*3))&0x07)*2; uint32_t sum_read = be32toh(sum_read_raw) >> shift; sum >>= shift; #ifdef DEBUG fprintf(stderr, "shift: %d, offset: %d, mysum: %08x, sumrd: %08x\n", shift, offset+1, sum, sum_read); #endif return sum != sum_read; } #endif base16384-2.3.1/file.c000066400000000000000000000424201460451635100141270ustar00rootroot00000000000000/* file.c * This file is part of the base16384 distribution (https://github.com/fumiama/base16384). * Copyright (c) 2022-2024 Fumiama Minamoto. * * 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 . */ #ifdef _MSC_VER #ifndef _CRT_SECURE_NO_WARNINGS #define _CRT_SECURE_NO_WARNINGS #endif #endif #ifndef __cosmopolitan #include #include #include #include #include #include #include #ifdef _WIN32 #include #include #include #else #include #include #endif #endif #include "base16384.h" #include "binary.h" #ifdef __cosmopolitan #define get_file_size(filepath) ((off_t)GetFileSize(filepath)) #else static inline off_t get_file_size(const char* filepath) { struct stat statbuf; return stat(filepath, &statbuf)?-1:statbuf.st_size; } #endif #define is_standard_io(filename) (*(uint16_t*)(filename) == *(uint16_t*)"-") #define goto_base16384_file_detailed_cleanup(method, reason, dobeforereturn) { \ errnobak = errno; \ retval = reason; \ dobeforereturn; \ goto base16384_##method##_file_detailed_cleanup; \ } #define do_sum_check(flag) ((flag)&(BASE16384_FLAG_DO_SUM_CHECK_FORCELY|BASE16384_FLAG_SUM_CHECK_ON_REMAIN)) base16384_err_t base16384_encode_file_detailed(const char* input, const char* output, char* encbuf, char* decbuf, int flag) { if(!input || !output || strlen(input) <= 0 || strlen(output) <= 0) { errno = EINVAL; return base16384_err_invalid_file_name; } base16384_err_t retval = base16384_err_ok; off_t inputsize; FILE *fp = NULL, *fpo; int errnobak = 0, is_stdin = is_standard_io(input); if(is_stdin) { // read from stdin inputsize = _BASE16384_ENCBUFSZ; fp = stdin; } else inputsize = get_file_size(input); if(inputsize <= 0) { if(!inputsize) errno = EINVAL; return base16384_err_get_file_size; } fpo = is_standard_io(output)?stdout:fopen(output, "wb"); if(!fpo) { return base16384_err_fopen_output_file; } if(flag&BASE16384_FLAG_DO_SUM_CHECK_FORCELY || inputsize >= _BASE16384_ENCBUFSZ) { // stdin or big file, use encbuf & fread inputsize = _BASE16384_ENCBUFSZ; #if defined _WIN32 || defined __cosmopolitan } #endif if(!fp) fp = fopen(input, "rb"); if(!fp) { goto_base16384_file_detailed_cleanup(encode, base16384_err_fopen_input_file, {}); } if(!(flag&BASE16384_FLAG_NOHEADER)) { fputc(0xFE, fpo); fputc(0xFF, fpo); } #ifdef _MSC_VER int cnt; #else size_t cnt; #endif uint32_t sum = BASE16384_SIMPLE_SUM_INIT_VALUE; while((cnt = fread(encbuf, sizeof(char), inputsize, fp)) > 0) { int n; while(cnt%7) { n = fread(encbuf+cnt, sizeof(char), 1, fp); if(n > 0) cnt++; else break; } if(do_sum_check(flag)) { sum = calc_sum(sum, cnt, encbuf); if(cnt%7) { // last encode *(uint32_t*)(&encbuf[cnt]) = htobe32(sum); #ifdef DEBUG fprintf(stderr, "writesum: %08x\n", sum); #endif } } n = base16384_encode_unsafe(encbuf, cnt, decbuf); if(n && fwrite(decbuf, n, 1, fpo) <= 0) { goto_base16384_file_detailed_cleanup(encode, base16384_err_write_file, {}); } } #if !defined _WIN32 && !defined __cosmopolitan } else { // small file, use mmap & fwrite int fd = open(input, O_RDONLY); if(fd < 0) { goto_base16384_file_detailed_cleanup(encode, base16384_err_open_input_file, {}); } char *input_file = mmap(NULL, (size_t)inputsize, PROT_READ, MAP_PRIVATE, fd, 0); if(input_file == MAP_FAILED) { goto_base16384_file_detailed_cleanup(encode, base16384_err_map_input_file, close(fd)); } if(!(flag&BASE16384_FLAG_NOHEADER)) { fputc(0xFE, fpo); fputc(0xFF, fpo); } int n = base16384_encode_safe(input_file, (int)inputsize, decbuf); if(n && fwrite(decbuf, n, 1, fpo) <= 0) { goto_base16384_file_detailed_cleanup(encode, base16384_err_write_file, { munmap(input_file, (size_t)inputsize); close(fd); }); } munmap(input_file, (size_t)inputsize); close(fd); } #endif base16384_encode_file_detailed_cleanup: if(fpo && !is_standard_io(output)) fclose(fpo); if(fp && !is_stdin) fclose(fp); if(errnobak) errno = errnobak; return retval; } base16384_err_t base16384_encode_fp_detailed(FILE* input, FILE* output, char* encbuf, char* decbuf, int flag) { if(!input) { return base16384_err_fopen_input_file; } if(!output) { return base16384_err_fopen_output_file; } if(!(flag&BASE16384_FLAG_NOHEADER)) { fputc(0xFE, output); fputc(0xFF, output); } off_t inputsize = _BASE16384_ENCBUFSZ; uint32_t sum = BASE16384_SIMPLE_SUM_INIT_VALUE; #ifdef _MSC_VER int cnt; #else size_t cnt; #endif while((cnt = fread(encbuf, sizeof(char), inputsize, input)) > 0) { int n; while(cnt%7) { n = fread(encbuf+cnt, sizeof(char), 1, input); if(n > 0) cnt++; else break; } if(do_sum_check(flag)) { sum = calc_sum(sum, cnt, encbuf); if(cnt%7) { // last encode *(uint32_t*)(&encbuf[cnt]) = htobe32(sum); } } n = base16384_encode_unsafe(encbuf, cnt, decbuf); if(n && fwrite(decbuf, n, 1, output) <= 0) { return base16384_err_write_file; } } return base16384_err_ok; } base16384_err_t base16384_encode_fd_detailed(int input, int output, char* encbuf, char* decbuf, int flag) { if(input < 0) { return base16384_err_fopen_input_file; } if(output < 0) { return base16384_err_fopen_output_file; } off_t inputsize = _BASE16384_ENCBUFSZ; size_t cnt = 0; uint32_t sum = BASE16384_SIMPLE_SUM_INIT_VALUE; if(!(flag&BASE16384_FLAG_NOHEADER)) write(output, "\xfe\xff", 2); while((cnt = read(input, encbuf, inputsize)) > 0) { int n; while(cnt%7) { n = read(input, encbuf+cnt, sizeof(char)); if(n > 0) cnt++; else break; } if(do_sum_check(flag)) { sum = calc_sum(sum, cnt, encbuf); if(cnt%7) { // last encode *(uint32_t*)(&encbuf[cnt]) = htobe32(sum); } } n = base16384_encode_unsafe(encbuf, cnt, decbuf); if(n && write(output, decbuf, n) < n) { return base16384_err_write_file; } } return base16384_err_ok; } #define call_reader(cd, buf, n) (input->f.reader((cd)->client_data, (buf), (n))) #define call_writer(cd, buf, n) (output->f.writer((cd)->client_data, (buf), (n))) base16384_err_t base16384_encode_stream_detailed(base16384_stream_t* input, base16384_stream_t* output, char* encbuf, char* decbuf, int flag) { if(!input || !input->f.reader) { return base16384_err_fopen_input_file; } if(!output || !output->f.writer) { return base16384_err_fopen_output_file; } off_t inputsize = _BASE16384_ENCBUFSZ; size_t cnt = 0; uint32_t sum = BASE16384_SIMPLE_SUM_INIT_VALUE; if(!(flag&BASE16384_FLAG_NOHEADER)) call_writer(output, "\xfe\xff", 2); while((cnt = call_reader(input, encbuf, inputsize)) > 0) { ssize_t n; while(cnt%7) { n = call_reader(input, encbuf+cnt, sizeof(char)); if(n > 0) cnt++; else break; } if(do_sum_check(flag)) { sum = calc_sum(sum, cnt, encbuf); if(cnt%7) { // last encode *(uint32_t*)(&encbuf[cnt]) = htobe32(sum); } } n = base16384_encode_unsafe(encbuf, cnt, decbuf); if(n && call_writer(output, decbuf, n) < n) { return base16384_err_write_file; } } return base16384_err_ok; } static inline void rm_head(FILE* fp) { int ch = fgetc(fp); if(ch == 0xFE) fgetc(fp); else ungetc(ch, fp); } #define skip_offset(input_file) ((input_file[0]==(char)0xFE)?2:0) static inline int is_next_end(FILE* fp) { int ch = fgetc(fp); if(ch == EOF) return 0; if(ch == '=') return fgetc(fp); ungetc(ch, fp); return 0; } base16384_err_t base16384_decode_file_detailed(const char* input, const char* output, char* encbuf, char* decbuf, int flag) { if(!input || !output || strlen(input) <= 0 || strlen(output) <= 0) { errno = EINVAL; return base16384_err_invalid_file_name; } off_t inputsize; FILE* fp = NULL; FILE* fpo; uint32_t sum = BASE16384_SIMPLE_SUM_INIT_VALUE; base16384_err_t retval = base16384_err_ok; int errnobak = 0, is_stdin = is_standard_io(input); if(is_stdin) { // read from stdin inputsize = _BASE16384_DECBUFSZ; fp = stdin; } else inputsize = get_file_size(input); if(inputsize <= 0) { if(!inputsize) errno = EINVAL; return base16384_err_get_file_size; } fpo = is_standard_io(output)?stdout:fopen(output, "wb"); if(!fpo) { return base16384_err_fopen_output_file; } int loop_count = 0; if(inputsize >= _BASE16384_DECBUFSZ) { // stdin or big file, use decbuf & fread if(!is_stdin) loop_count = inputsize/_BASE16384_DECBUFSZ; inputsize = _BASE16384_DECBUFSZ; #if defined _WIN32 || defined __cosmopolitan } #endif if(!fp) fp = fopen(input, "rb"); if(!fp) { goto_base16384_file_detailed_cleanup(decode, base16384_err_fopen_input_file, {}); } rm_head(fp); #ifndef _WIN32 // windows is crazy and always throws EINVAL if(errno) { goto_base16384_file_detailed_cleanup(decode, base16384_err_read_file, {}); } #endif int cnt, last_encbuf_cnt = 0, last_decbuf_cnt = 0, offset = 0; size_t total_decoded_len = 0; while((cnt = fread(decbuf, sizeof(char), inputsize, fp)) > 0) { int n; while(cnt%8) { n = fread(decbuf+cnt, sizeof(char), 1, fp); if(n > 0) cnt++; else break; } int end; if((end = is_next_end(fp))) { decbuf[cnt++] = '='; decbuf[cnt++] = end; } #ifndef _WIN32 // windows is crazy and always throws EINVAL if(errno) goto_base16384_file_detailed_cleanup(decode, base16384_err_read_file, {}); #endif offset = decbuf[cnt-1]; last_decbuf_cnt = cnt; cnt = base16384_decode_unsafe(decbuf, cnt, encbuf); if(cnt && fwrite(encbuf, cnt, 1, fpo) <= 0) { goto_base16384_file_detailed_cleanup(decode, base16384_err_write_file, {}); } total_decoded_len += cnt; if(do_sum_check(flag)) sum = calc_sum(sum, cnt, encbuf); last_encbuf_cnt = cnt; } if(do_sum_check(flag) && (flag&BASE16384_FLAG_DO_SUM_CHECK_FORCELY || total_decoded_len >= _BASE16384_ENCBUFSZ) && last_decbuf_cnt > 2 && decbuf[last_decbuf_cnt-2] == '=' && check_sum(sum, *(uint32_t*)(&encbuf[last_encbuf_cnt]), offset)) { errno = EINVAL; goto_base16384_file_detailed_cleanup(decode, base16384_err_invalid_decoding_checksum, {}); } #if !defined _WIN32 && !defined __cosmopolitan } else { // small file, use mmap & fwrite int fd = open(input, O_RDONLY); if(fd < 0) { goto_base16384_file_detailed_cleanup(decode, base16384_err_open_input_file, {}); } char *input_file = mmap(NULL, (size_t)inputsize, PROT_READ, MAP_PRIVATE, fd, 0); if(input_file == MAP_FAILED) { goto_base16384_file_detailed_cleanup(decode, base16384_err_map_input_file, close(fd)); } int n = skip_offset(input_file); n = base16384_decode_safe(input_file+n, inputsize-n, encbuf); if(n && fwrite(encbuf, n, 1, fpo) <= 0) { goto_base16384_file_detailed_cleanup(decode, base16384_err_write_file, { munmap(input_file, (size_t)inputsize); close(fd); }); } munmap(input_file, (size_t)inputsize); close(fd); } #endif base16384_decode_file_detailed_cleanup: if(fpo && !is_standard_io(output)) fclose(fpo); if(fp && !is_stdin) fclose(fp); if(errnobak) errno = errnobak; return retval; } base16384_err_t base16384_decode_fp_detailed(FILE* input, FILE* output, char* encbuf, char* decbuf, int flag) { if(!input) { errno = EINVAL; return base16384_err_fopen_input_file; } if(!output) { errno = EINVAL; return base16384_err_fopen_output_file; } off_t inputsize = _BASE16384_DECBUFSZ; uint32_t sum = BASE16384_SIMPLE_SUM_INIT_VALUE; rm_head(input); #ifndef _WIN32 // windows is crazy and always throws EINVAL if(errno) { return base16384_err_read_file; } #endif int cnt, last_encbuf_cnt = 0, last_decbuf_cnt = 0, offset = 0; size_t total_decoded_len = 0; while((cnt = fread(decbuf, sizeof(char), inputsize, input)) > 0) { int n; while(cnt%8) { n = fread(decbuf+cnt, sizeof(char), 1, input); if(n > 0) cnt++; else break; } int end; if((end = is_next_end(input))) { decbuf[cnt++] = '='; decbuf[cnt++] = end; } #ifndef _WIN32 // windows is crazy and always throws EINVAL if(errno) return base16384_err_read_file; #endif offset = decbuf[cnt-1]; last_decbuf_cnt = cnt; cnt = base16384_decode_unsafe(decbuf, cnt, encbuf); if(cnt && fwrite(encbuf, cnt, 1, output) <= 0) { return base16384_err_write_file; } total_decoded_len += cnt; if(do_sum_check(flag)) sum = calc_sum(sum, cnt, encbuf); last_encbuf_cnt = cnt; } if(do_sum_check(flag) && (flag&BASE16384_FLAG_DO_SUM_CHECK_FORCELY || total_decoded_len >= _BASE16384_ENCBUFSZ) && last_decbuf_cnt > 2 && decbuf[last_decbuf_cnt-2] == '=' && check_sum(sum, *(uint32_t*)(&encbuf[last_encbuf_cnt]), offset)) { errno = EINVAL; return base16384_err_invalid_decoding_checksum; } return base16384_err_ok; } static inline uint16_t is_next_end_fd(int fd) { uint8_t ch = 0; if(read(fd, &ch, 1) != 1) return (uint16_t)EOF; uint16_t ret = (uint16_t)ch & 0x00ff; if(ch == '=') { if(read(fd, &ch, 1) != 1) return (uint16_t)EOF; ret <<= 8; ret |= (uint16_t)ch & 0x00ff; } return ret; } base16384_err_t base16384_decode_fd_detailed(int input, int output, char* encbuf, char* decbuf, int flag) { if(input < 0) { errno = EINVAL; return base16384_err_fopen_input_file; } if(output < 0) { errno = EINVAL; return base16384_err_fopen_output_file; } off_t inputsize = _BASE16384_DECBUFSZ; uint32_t sum = BASE16384_SIMPLE_SUM_INIT_VALUE; uint8_t remains[8]; decbuf[0] = 0; if(read(input, remains, 2) != 2) { return base16384_err_read_file; } int p = 0; if(remains[0] != (uint8_t)(0xfe)) p = 2; int n, last_encbuf_cnt = 0, last_decbuf_cnt = 0, offset = 0; size_t total_decoded_len = 0; while((n = read(input, decbuf+p, inputsize-p)) > 0) { if(p) { memcpy(decbuf, remains, p); n += p; p = 0; } int x; while(n%8) { x = read(input, decbuf+n, sizeof(char)); if(x > 0) n++; else break; } uint16_t next = is_next_end_fd(input); #ifndef _WIN32 // windows is crazy and always throws EINVAL if(errno) { return base16384_err_read_file; } #endif if((uint16_t)(~next)) { if(next&0xff00) { decbuf[n++] = '='; decbuf[n++] = (char)(next&0x00ff); } else remains[p++] = (char)(next&0x00ff); } offset = decbuf[n-1]; last_decbuf_cnt = n; n = base16384_decode_unsafe(decbuf, n, encbuf); if(n && write(output, encbuf, n) != n) { return base16384_err_write_file; } total_decoded_len += n; if(do_sum_check(flag)) sum = calc_sum(sum, n, encbuf); last_encbuf_cnt = n; } if(do_sum_check(flag) && (flag&BASE16384_FLAG_DO_SUM_CHECK_FORCELY || total_decoded_len >= _BASE16384_ENCBUFSZ) && last_decbuf_cnt > 2 && decbuf[last_decbuf_cnt-2] == '=' && check_sum(sum, *(uint32_t*)(&encbuf[last_encbuf_cnt]), offset)) { errno = EINVAL; return base16384_err_invalid_decoding_checksum; } return base16384_err_ok; } static inline uint16_t is_next_end_stream(base16384_stream_t* input) { uint8_t ch = 0; if(call_reader(input, &ch, 1) != 1) return (uint16_t)EOF; uint16_t ret = (uint16_t)ch & 0x00ff; if(ch == '=') { if(call_reader(input, &ch, 1) != 1) return (uint16_t)EOF; ret <<= 8; ret |= (uint16_t)ch & 0x00ff; } return ret; } base16384_err_t base16384_decode_stream_detailed(base16384_stream_t* input, base16384_stream_t* output, char* encbuf, char* decbuf, int flag) { if(!input || !input->f.reader) { errno = EINVAL; return base16384_err_fopen_input_file; } if(!output || !output->f.writer) { errno = EINVAL; return base16384_err_fopen_output_file; } off_t inputsize = _BASE16384_DECBUFSZ; uint32_t sum = BASE16384_SIMPLE_SUM_INIT_VALUE; uint8_t remains[8]; decbuf[0] = 0; if(call_reader(input, remains, 2) != 2) { return base16384_err_read_file; } int p = 0; if(remains[0] != (uint8_t)(0xfe)) p = 2; int n, last_encbuf_cnt = 0, last_decbuf_cnt = 0, offset = 0; size_t total_decoded_len = 0; while((n = call_reader(input, decbuf+p, inputsize-p)) > 0) { if(p) { memcpy(decbuf, remains, p); n += p; p = 0; } int x; while(n%8) { x = call_reader(input, decbuf+n, sizeof(char)); if(x > 0) n++; else break; } uint16_t next = is_next_end_stream(input); #ifndef _WIN32 // windows is crazy and always throws EINVAL if(errno) { return base16384_err_read_file; } #endif if((uint16_t)(~next)) { if(next&0xff00) { decbuf[n++] = '='; decbuf[n++] = (char)(next&0x00ff); } else remains[p++] = (char)(next&0x00ff); } offset = decbuf[n-1]; last_decbuf_cnt = n; n = base16384_decode_unsafe(decbuf, n, encbuf); if(n && call_writer(output, encbuf, n) != n) { return base16384_err_write_file; } total_decoded_len += n; if(do_sum_check(flag)) sum = calc_sum(sum, n, encbuf); last_encbuf_cnt = n; } if(do_sum_check(flag) && (flag&BASE16384_FLAG_DO_SUM_CHECK_FORCELY || total_decoded_len >= _BASE16384_ENCBUFSZ) && last_decbuf_cnt > 2 && decbuf[last_decbuf_cnt-2] == '=' && check_sum(sum, *(uint32_t*)(&encbuf[last_encbuf_cnt]), offset)) { errno = EINVAL; return base16384_err_invalid_decoding_checksum; } return base16384_err_ok; } base16384-2.3.1/test/000077500000000000000000000000001460451635100140215ustar00rootroot00000000000000base16384-2.3.1/test/CMakeLists.txt000066400000000000000000000010271460451635100165610ustar00rootroot00000000000000cmake_minimum_required(VERSION 2.8.12) if (POLICY CMP0048) cmake_policy(SET CMP0048 NEW) endif (POLICY CMP0048) project(base16384_test VERSION 1.0.0) include_directories(${CMAKE_CURRENT_SOURCE_DIR}/..) file (GLOB_RECURSE C_FILES "*.c") foreach (C_FILE ${C_FILES}) get_filename_component(FILE_NAME ${C_FILE} NAME_WE) message(STATUS "Add test ${FILE_NAME}") add_executable(${FILE_NAME} ${C_FILE}) target_link_libraries(${FILE_NAME} base16384_s) add_test(NAME do_${FILE_NAME} COMMAND ${FILE_NAME}) endforeach () base16384-2.3.1/test/coder_test.c000066400000000000000000000053031460451635100163210ustar00rootroot00000000000000/* test/coder_test.c * This file is part of the base16384 distribution (https://github.com/fumiama/base16384). * Copyright (c) 2022-2024 Fumiama Minamoto. * * 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 . */ #include #include #include #include #include #include "base16384.h" #define TEST_SIZE (4096) static char encbuf[TEST_SIZE+16]; static char decbuf[TEST_SIZE/7*8+16]; static char tstbuf[TEST_SIZE+16]; #define loop_diff(target) \ for(i = start; i < end; i++) { \ if (encbuf[i] != tstbuf[i]) { \ if(n) { \ fprintf(stderr, " @%d", i); \ n = 0; \ } \ fprintf(stderr, " %02x", (uint8_t)(target[i])); \ } else if(!n) { \ n = 1; \ fprintf(stderr, " ..."); \ } \ } #define return_error(i, n) { \ int end = i; \ int start; \ for(start = 0; start < end; start++) { \ if(encbuf[start] != tstbuf[start]) break; \ } \ fprintf(stderr, "result mismatch @ loop %d, decsz: %d, first diff @ %d\n", i, n, start); \ fprintf(stderr, "expect"); \ n = 1; \ loop_diff(encbuf); \ fprintf(stderr, "\ngot "); \ n = 1; \ loop_diff(tstbuf); \ fputc('\n', stderr); \ return 1; \ } #define test_batch(encode, decode) \ fputs("testing base16384_"#encode"/base16384_"#decode"...\n", stderr); \ for(i = 0; i <= TEST_SIZE; i++) { \ n = base16384_##encode(encbuf, i, decbuf); \ n = base16384_##decode(decbuf, n, tstbuf); \ if (memcmp(encbuf, tstbuf, n)) return_error(i, n); \ } int main() { srand(time(NULL)); int i, n; for(i = 0; i <= TEST_SIZE; i += sizeof(int)) { *(int*)(&encbuf[i]) = rand(); } test_batch(encode, decode); test_batch(encode, decode_unsafe); test_batch(encode, decode_safe); test_batch(encode_unsafe, decode); test_batch(encode_unsafe, decode_unsafe); test_batch(encode_unsafe, decode_safe); test_batch(encode_safe, decode); test_batch(encode_safe, decode_unsafe); test_batch(encode_safe, decode_safe); return 0; } base16384-2.3.1/test/file_test.c000066400000000000000000000143741460451635100161540ustar00rootroot00000000000000/* test/file_test.c * This file is part of the base16384 distribution (https://github.com/fumiama/base16384). * Copyright (c) 2022-2024 Fumiama Minamoto. * * 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 . */ #ifdef _WIN32 #include #define ftruncate _chsize_s #else #define _POSIX1_SOURCE 2 #include #endif #include #include #include #include #include #include #include "base16384.h" #include "binary.h" #include "file_test.h" #define TEST_SIZE (4096) #define TEST_INPUT_FILENAME "file_test_input.bin" #define TEST_OUTPUT_FILENAME "file_test_output.bin" #define TEST_VALIDATE_FILENAME "file_test_validate.bin" static char encbuf[BASE16384_ENCBUFSZ]; static char decbuf[BASE16384_DECBUFSZ]; static char tstbuf[BASE16384_ENCBUFSZ]; #define test_file_detailed(flag) \ fputs("testing base16384_en/decode_file with flag "#flag"...\n", stderr); \ init_input_file(); \ for(i = TEST_SIZE; i > 0; i--) { \ reset_and_truncate(fd, i); \ loop_ok(close(fd), i, "close"); \ \ err = base16384_encode_file_detailed(TEST_INPUT_FILENAME, TEST_OUTPUT_FILENAME, encbuf, decbuf, flag); \ base16384_loop_ok(err); \ \ err = base16384_decode_file_detailed(TEST_OUTPUT_FILENAME, TEST_VALIDATE_FILENAME, encbuf, decbuf, flag); \ base16384_loop_ok(err); \ \ validate_result(); \ } #define test_fp_detailed(flag) \ fputs("testing base16384_en/decode_fp with flag "#flag"...\n", stderr); \ init_input_file(); \ for(i = TEST_SIZE; i > 0; i--) { \ reset_and_truncate(fd, i); \ loop_ok(close(fd), i, "close"); \ \ FILE* fpin = fopen(TEST_INPUT_FILENAME, "rb"); \ loop_ok(!fpin, i, "fopen"); \ \ FILE* fpout = fopen(TEST_OUTPUT_FILENAME, "wb+"); \ loop_ok(!fpout, i, "fopen"); \ \ err = base16384_encode_fp_detailed(fpin, fpout, encbuf, decbuf, flag); \ base16384_loop_ok(err); \ \ loop_ok(fclose(fpin), i, "fclose"); \ \ FILE* fpval = fopen(TEST_VALIDATE_FILENAME, "wb"); \ loop_ok(!fpval, i, "fopen"); \ \ rewind(fpout); \ \ err = base16384_decode_fp_detailed(fpout, fpval, encbuf, decbuf, flag); \ base16384_loop_ok(err); \ \ loop_ok(fclose(fpout), i, "fclose"); \ loop_ok(fclose(fpval), i, "fclose"); \ \ validate_result(); \ } #define test_fd_detailed(flag) \ fputs("testing base16384_en/decode_fd with flag "#flag"...\n", stderr); \ init_input_file(); \ for(i = TEST_SIZE; i > 0; i--) { \ reset_and_truncate(fd, i); \ \ int fdout = open(TEST_OUTPUT_FILENAME, O_RDWR|O_TRUNC|O_CREAT|O_APPEND, 0644); \ loop_ok(!fdout, i, "open"); \ \ err = base16384_encode_fd_detailed(fd, fdout, encbuf, decbuf, flag); \ base16384_loop_ok(err); \ loop_ok(close(fd), i, "close"); \ \ int fdval = open(TEST_VALIDATE_FILENAME, O_WRONLY|O_TRUNC|O_CREAT, 0644); \ loop_ok(!fdval, i, "open"); \ \ loop_ok(lseek(fdout, 0, SEEK_SET), i, "lseek"); \ \ err = base16384_decode_fd_detailed(fdout, fdval, encbuf, decbuf, flag); \ base16384_loop_ok(err); \ \ loop_ok(close(fdout), i, "close"); \ loop_ok(close(fdval), i, "close"); \ \ validate_result(); \ } #define test_stream_detailed(flag) \ fputs("testing base16384_en/decode_stream with flag "#flag"...\n", stderr); \ init_input_file(); \ for(i = TEST_SIZE; i > 0; i--) { \ reset_and_truncate(fd, i); \ \ int fdout = open(TEST_OUTPUT_FILENAME, O_RDWR|O_TRUNC|O_CREAT|O_APPEND, 0644); \ loop_ok(!fdout, i, "open"); \ \ err = base16384_encode_stream_detailed(&(base16384_stream_t){ \ .client_data = (void*)(uintptr_t)fd, \ .f.reader = base16384_test_file_reader, \ }, &(base16384_stream_t){ \ .client_data = (void*)(uintptr_t)fdout, \ .f.writer = base16384_test_file_writer, \ }, encbuf, decbuf, flag); \ base16384_loop_ok(err); \ loop_ok(close(fd), i, "close"); \ \ int fdval = open(TEST_VALIDATE_FILENAME, O_WRONLY|O_TRUNC|O_CREAT, 0644); \ loop_ok(!fdval, i, "open"); \ \ loop_ok(lseek(fdout, 0, SEEK_SET), i, "lseek"); \ \ err = base16384_decode_stream_detailed(&(base16384_stream_t){ \ .client_data = (void*)(uintptr_t)fdout, \ .f.reader = base16384_test_file_reader, \ }, &(base16384_stream_t){ \ .client_data = (void*)(uintptr_t)fdval, \ .f.writer = base16384_test_file_writer, \ }, encbuf, decbuf, flag); \ base16384_loop_ok(err); \ \ loop_ok(close(fdout), i, "close"); \ loop_ok(close(fdval), i, "close"); \ \ validate_result(); \ } #define test_detailed(name) \ test_##name##_detailed(0); \ \ test_##name##_detailed(BASE16384_FLAG_NOHEADER); \ test_##name##_detailed(BASE16384_FLAG_SUM_CHECK_ON_REMAIN); \ test_##name##_detailed(BASE16384_FLAG_DO_SUM_CHECK_FORCELY); \ \ test_##name##_detailed(BASE16384_FLAG_NOHEADER|BASE16384_FLAG_SUM_CHECK_ON_REMAIN); \ test_##name##_detailed(BASE16384_FLAG_NOHEADER|BASE16384_FLAG_DO_SUM_CHECK_FORCELY); \ \ test_##name##_detailed(BASE16384_FLAG_SUM_CHECK_ON_REMAIN|BASE16384_FLAG_DO_SUM_CHECK_FORCELY); \ \ test_##name##_detailed(BASE16384_FLAG_NOHEADER|BASE16384_FLAG_SUM_CHECK_ON_REMAIN|BASE16384_FLAG_DO_SUM_CHECK_FORCELY); int main() { srand(time(NULL)); FILE* fp; int fd, i; base16384_err_t err; init_test_files(); test_detailed(file); test_detailed(fp); test_detailed(fd); test_detailed(stream); remove_test_files(); return 0; } base16384-2.3.1/test/file_test.h000066400000000000000000000113311460451635100161470ustar00rootroot00000000000000#ifndef _FILE_TEST_H_ #define _FILE_TEST_H_ /* test/file_test.h * This file is part of the base16384 distribution (https://github.com/fumiama/base16384). * Copyright (c) 2022-2024 Fumiama Minamoto. * * 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 . */ #ifdef _MSC_VER #ifndef _CRT_SECURE_NO_WARNINGS #define _CRT_SECURE_NO_WARNINGS #endif #endif #include #define ok(has_failed, reason) \ if (has_failed) { \ perror(reason); \ return 1; \ } #define loop_ok(has_failed, i, reason) \ if (has_failed) { \ fprintf(stderr, "loop @%d: ", i); \ perror(reason); \ return 1; \ } #define reset_and_truncate(fd, i) { \ fd = open(TEST_INPUT_FILENAME, O_RDWR); \ ok(!fd, "open"); \ loop_ok(lseek(fd, 0, SEEK_SET), i, "lseek"); \ loop_ok(ftruncate(fd, i), i, "ftruncate"); \ } #define base16384_loop_ok(err) \ if (err) { \ fprintf(stderr, "loop @%d: ", i); \ base16384_perror(err); \ return 1; \ } #define validate_result() \ uint64_t buf, sum_input = 0, sum_validate = 0; \ fp = fopen(TEST_INPUT_FILENAME, "rb"); { \ loop_ok(!fp, i, "fopen"); \ int cnt; \ while ((cnt = fread(&buf, 1, sizeof(sum_input), fp)) > 0) { \ int n; \ buf = 0; \ while(cnt < sizeof(sum_input)) { \ n = fread((uint8_t*)(&buf)+cnt, 1, 1, fp); \ if (n) cnt++; \ else break; \ } \ sum_input += buf; \ } \ } fclose(fp); \ fp = fopen(TEST_VALIDATE_FILENAME, "rb"); { \ loop_ok(!fp, i, "fopen"); \ int cnt; \ while ((cnt = fread(&buf, 1, sizeof(sum_validate), fp)) > 0) { \ int n; \ buf = 0; \ while(cnt < sizeof(sum_validate)) { \ n = fread((uint8_t*)(&buf)+cnt, 1, 1, fp); \ if (n) cnt++; \ else break; \ } \ sum_validate += buf; \ } \ } fclose(fp); \ if (sum_input != sum_validate) { \ fprintf(stderr, "loop @%d, expect: %016llx, got: %016llx: ", i, (unsigned long long)sum_input, (unsigned long long)sum_validate); \ fputs(TEST_INPUT_FILENAME " and " TEST_VALIDATE_FILENAME " mismatch.", stderr); \ return 1; \ } #define init_input_file() \ fprintf(stderr, "fill encbufsz: %d\n", BASE16384_ENCBUFSZ);\ for(i = 0; i < BASE16384_ENCBUFSZ/sizeof(uint16_t); i++) { \ ((uint16_t*)encbuf)[i] = (uint16_t)rand(); \ } \ fp = fopen(TEST_INPUT_FILENAME, "wb"); \ ok(!fp, "fopen"); \ ok(fwrite(encbuf, BASE16384_ENCBUFSZ, 1, fp) != 1, "fwrite"); \ ok(fclose(fp), "fclose"); \ fputs("input file created.\n", stderr); #define init_test_files() {\ fd = open(TEST_INPUT_FILENAME, O_RDWR|O_TRUNC|O_CREAT, 0644); \ ok(fd<0, "open"); \ ok(close(fd), "close"); \ fd = open(TEST_OUTPUT_FILENAME, O_RDWR|O_TRUNC|O_CREAT, 0644); \ ok(fd<0, "open"); \ ok(close(fd), "close"); \ fd = open(TEST_VALIDATE_FILENAME, O_RDWR|O_TRUNC|O_CREAT, 0644); \ ok(fd<0, "open"); \ ok(close(fd), "close"); #define remove_test_files() \ remove(TEST_INPUT_FILENAME); \ remove(TEST_OUTPUT_FILENAME); \ remove(TEST_VALIDATE_FILENAME); \ } #include #include #include static ssize_t base16384_test_file_reader(const void *client_data, void *buffer, size_t count) { int fd = (int)((uintptr_t)client_data); ssize_t ret = read(fd, buffer, count); if(ret < 0) return ret; ssize_t i; for(i = 0; i < ret; i++) { ((uint8_t*)(buffer))[i] = ~((uint8_t*)(buffer))[i]; } return ret; } static ssize_t base16384_test_file_writer(const void *client_data, const void *buffer, size_t count) { int fd = (int)((uintptr_t)client_data); if(count <= 0) { errno = EINVAL; return -100; } uint8_t* wbuf = (uint8_t*)malloc(count); if(!wbuf) return -200; ssize_t i; for(i = 0; i < count; i++) { wbuf[i] = ~((uint8_t*)(buffer))[i]; } ssize_t ret = write(fd, buffer, count); int errnobak = errno; free(wbuf); errno = errnobak; return ret; } #endifbase16384-2.3.1/test/wrap_test.c000066400000000000000000000117501460451635100162010ustar00rootroot00000000000000/* test/wrap_test.c * This file is part of the base16384 distribution (https://github.com/fumiama/base16384). * Copyright (c) 2022-2024 Fumiama Minamoto. * * 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 . */ #ifdef _WIN32 #include #define ftruncate _chsize_s #else #define _POSIX1_SOURCE 2 #include #endif #include #include #include #include #include #include #include "base16384.h" #include "binary.h" #include "file_test.h" #define TEST_SIZE (4096) #define TEST_INPUT_FILENAME "wrap_test_input.bin" #define TEST_OUTPUT_FILENAME "wrap_test_output.bin" #define TEST_VALIDATE_FILENAME "wrap_test_validate.bin" static char encbuf[BASE16384_ENCBUFSZ]; static char decbuf[BASE16384_DECBUFSZ]; static char tstbuf[BASE16384_ENCBUFSZ]; int main() { srand(time(NULL)); FILE* fp; int fd, i; base16384_err_t err; init_test_files(); fputs("testing base16384_en/decode_file...\n", stderr); init_input_file(); for(i = TEST_SIZE; i > 0; i--) { reset_and_truncate(fd, i); loop_ok(close(fd), i, "close"); err = base16384_encode_file(TEST_INPUT_FILENAME, TEST_OUTPUT_FILENAME, encbuf, decbuf); base16384_loop_ok(err); err = base16384_decode_file(TEST_OUTPUT_FILENAME, TEST_VALIDATE_FILENAME, encbuf, decbuf); base16384_loop_ok(err); validate_result(); } fputs("testing base16384_en/decode_fp...\n", stderr); init_input_file(); for(i = TEST_SIZE; i > 0; i--) { reset_and_truncate(fd, i); loop_ok(close(fd), i, "close"); FILE* fpin = fopen(TEST_INPUT_FILENAME, "rb"); loop_ok(!fpin, i, "fopen"); FILE* fpout = fopen(TEST_OUTPUT_FILENAME, "wb+"); loop_ok(!fpout, i, "fopen"); err = base16384_encode_fp(fpin, fpout, encbuf, decbuf); base16384_loop_ok(err); loop_ok(fclose(fpin), i, "fclose"); FILE* fpval = fopen(TEST_VALIDATE_FILENAME, "wb"); loop_ok(!fpval, i, "fopen"); rewind(fpout); err = base16384_decode_fp(fpout, fpval, encbuf, decbuf); base16384_loop_ok(err); loop_ok(fclose(fpout), i, "fclose"); loop_ok(fclose(fpval), i, "fclose"); validate_result(); } fputs("testing base16384_en/decode_fd...\n", stderr); init_input_file(); for(i = TEST_SIZE; i > 0; i--) { reset_and_truncate(fd, i); int fdout = open(TEST_OUTPUT_FILENAME, O_RDWR|O_TRUNC|O_CREAT|O_APPEND, 0644); loop_ok(!fdout, i, "open"); err = base16384_encode_fd(fd, fdout, encbuf, decbuf); base16384_loop_ok(err); loop_ok(close(fd), i, "close"); int fdval = open(TEST_VALIDATE_FILENAME, O_WRONLY|O_TRUNC|O_CREAT, 0644); loop_ok(!fdval, i, "open"); loop_ok(lseek(fdout, 0, SEEK_SET), i, "lseek"); err = base16384_decode_fd(fdout, fdval, encbuf, decbuf); base16384_loop_ok(err); loop_ok(close(fdout), i, "close"); loop_ok(close(fdval), i, "close"); validate_result(); } fputs("testing base16384_en/decode_stream...\n", stderr); init_input_file(); for(i = TEST_SIZE; i > 0; i--) { reset_and_truncate(fd, i); int fdout = open(TEST_OUTPUT_FILENAME, O_RDWR|O_TRUNC|O_CREAT|O_APPEND, 0644); loop_ok(!fdout, i, "open"); err = base16384_encode_stream(&(base16384_stream_t){ .client_data = (void*)(uintptr_t)fd, .f.reader = base16384_test_file_reader, }, &(base16384_stream_t){ .client_data = (void*)(uintptr_t)fdout, .f.writer = base16384_test_file_writer, }, encbuf, decbuf); base16384_loop_ok(err); loop_ok(close(fd), i, "close"); int fdval = open(TEST_VALIDATE_FILENAME, O_WRONLY|O_TRUNC|O_CREAT, 0644); loop_ok(!fdval, i, "open"); loop_ok(lseek(fdout, 0, SEEK_SET), i, "lseek"); err = base16384_decode_stream(&(base16384_stream_t){ .client_data = (void*)(uintptr_t)fdout, .f.reader = base16384_test_file_reader, }, &(base16384_stream_t){ .client_data = (void*)(uintptr_t)fdval, .f.writer = base16384_test_file_writer, }, encbuf, decbuf); base16384_loop_ok(err); loop_ok(close(fdout), i, "close"); loop_ok(close(fdval), i, "close"); validate_result(); } remove_test_files(); return 0; } base16384-2.3.1/wrap.c000066400000000000000000000030371460451635100141620ustar00rootroot00000000000000/* wrap.c * This file is part of the base16384 distribution (https://github.com/fumiama/base16384). * Copyright (c) 2022-2024 Fumiama Minamoto. * * 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 . */ #include "base16384.h" #define base16384_typed_params(type) type input, type output, char* encbuf, char* decbuf #define BASE16384_WRAP_DECL(method, name, type) \ base16384_err_t base16384_##method##_##name(base16384_typed_params(type)) { \ return base16384_##method##_##name##_detailed(input, output, encbuf, decbuf, 0); \ } BASE16384_WRAP_DECL(encode, file, const char*); BASE16384_WRAP_DECL(encode, fp, FILE*); BASE16384_WRAP_DECL(encode, fd, int); BASE16384_WRAP_DECL(encode, stream, base16384_stream_t*); BASE16384_WRAP_DECL(decode, file, const char*); BASE16384_WRAP_DECL(decode, fp, FILE*); BASE16384_WRAP_DECL(decode, fd, int); BASE16384_WRAP_DECL(decode, stream, base16384_stream_t*); #undef BASE16384_WRAP_DECL #undef base16384_typed_params