pax_global_header00006660000000000000000000000064146744435540014532gustar00rootroot0000000000000052 comment=91b229330946536701f2d1f15bee22e6e1517cd8 ICRAR-crc32c-6d3a422/000077500000000000000000000000001467444355400137765ustar00rootroot00000000000000ICRAR-crc32c-6d3a422/.github/000077500000000000000000000000001467444355400153365ustar00rootroot00000000000000ICRAR-crc32c-6d3a422/.github/dependabot.yml000066400000000000000000000001661467444355400201710ustar00rootroot00000000000000version: 2 updates: - package-ecosystem: "github-actions" directory: "/" schedule: interval: "weekly" ICRAR-crc32c-6d3a422/.github/workflows/000077500000000000000000000000001467444355400173735ustar00rootroot00000000000000ICRAR-crc32c-6d3a422/.github/workflows/benchmark.yml000066400000000000000000000013551467444355400220540ustar00rootroot00000000000000name: Run benchmarking tool # Build on every branch push, tag push, and pull request change: on: push: pull_request: jobs: run_benchmark: name: Benchmark os=${{ matrix.os }}/sw_mode=${{ matrix.sw_mode}} runs-on: ${{ matrix.os }} strategy: matrix: os: [ubuntu-22.04, windows-2019, macos-12] sw_mode: [force, auto] steps: - uses: actions/checkout@v4 - uses: actions/setup-python@v5 name: Install Python with: python-version: '3.7' - name: Install crc32c run: python setup.py develop - name: Benchmark with 1 [GB] 10 times env: CRC32C_SW_MODE: ${{ matrix.sw_mode }} run: python -m crc32c.benchmark -i 10 -s 1073741824 ICRAR-crc32c-6d3a422/.github/workflows/build_and_release.yml000066400000000000000000000056531467444355400235500ustar00rootroot00000000000000name: Build and release to PyPI # Build on every branch push, tag push, and pull request change: on: push: pull_request: schedule: # 00:00 UTC every Saturday, don't bother anyone - cron: '0 0 * * 6' jobs: build_wheels: name: Build wheels on ${{matrix.arch}} for ${{ matrix.os }} runs-on: ${{ matrix.os }} strategy: matrix: os: [ubuntu-22.04, windows-2019, macos-12] arch: [auto] include: - os: ubuntu-20.04 arch: aarch64 steps: - uses: actions/checkout@v4 - uses: docker/setup-qemu-action@v3 if: ${{ matrix.arch == 'aarch64' }} name: Set up QEMU - name: Run cibuildwheel uses: pypa/cibuildwheel@v2.21.1 env: CIBW_ARCHS_LINUX: ${{matrix.arch}} CIBW_TEST_REQUIRES: pytest CIBW_TEST_COMMAND: "python -u {project}/run-tests.py" CIBW_ARCHS_MACOS: "x86_64 arm64 universal2" CIBW_TEST_SKIP: '*macosx_arm64 *universal2:arm64' CIBW_BUILD_VERBOSITY: 1 CIBW_FREE_THREADED_SUPPORT: 1 - uses: actions/upload-artifact@v4 with: name: wheels-${{ matrix.os }}-${{ matrix.arch }} path: ./wheelhouse/*.whl build_sdist: name: Build source distribution runs-on: ubuntu-22.04 steps: - uses: actions/checkout@v4 - uses: actions/setup-python@v5 name: Install Python with: python-version: '3.7' - name: Build sdist run: python setup.py sdist - uses: actions/upload-artifact@v4 with: name: source-dist path: dist/*.tar.gz test_sdist: name: Check source distribution is usable needs: [build_sdist] runs-on: ubuntu-22.04 steps: - uses: actions/setup-python@v5 name: Install Python with: python-version: "3.12" - uses: actions/download-artifact@v4 with: name: source-dist - name: Extract source distribution run: tar xvf crc32c*.tar.gz && rm crc32c*.tar.gz - name: Install source distribution run: pip install ./crc32c* - name: Install test dependencies run: pip install pytest - name: Run source distribution tests run: cd crc32c* && python run-tests.py merge_artifacts: needs: [build_wheels, build_sdist] runs-on: ubuntu-latest steps: - name: Merge Artifacts uses: actions/upload-artifact/merge@v4 with: name: all-artifacts upload_pypi: needs: [merge_artifacts] runs-on: ubuntu-22.04 # upload to PyPI on every tag starting with 'v' if: github.event_name == 'push' && startsWith(github.event.ref, 'refs/tags/v') steps: - uses: actions/download-artifact@v4 with: name: all-artifacts path: dist - uses: pypa/gh-action-pypi-publish@master with: user: __token__ password: ${{ secrets.pypi_password }} ICRAR-crc32c-6d3a422/.github/workflows/lint.yml000066400000000000000000000013641467444355400210700ustar00rootroot00000000000000name: Lint on: push: pull_request: schedule: # 00:00 UTC every Saturday, don't bother anyone - cron: '0 0 * * 6' jobs: Linting: runs-on: ubuntu-latest steps: - name: Setup Python uses: actions/setup-python@v4 with: python-version: 3.11.8 architecture: x64 - name: Checkout uses: actions/checkout@v3 - name: Install dev requirements run: pip install -r requirements-dev.txt - name: Install package run: python setup.py bdist_wheel && pip install dist/crc32c*.whl - name: Run mypy run: mypy --strict src test - name: Run black run: black --check . - name: Run isort run: isort --profile black --check --diff . ICRAR-crc32c-6d3a422/.gitignore000066400000000000000000000001021467444355400157570ustar00rootroot00000000000000*.so build dist *.egg-info .project .pydevproject .settings *.pyc ICRAR-crc32c-6d3a422/AUTHORS.google-crc32c000066400000000000000000000006361467444355400174030ustar00rootroot00000000000000# This is the list of Google's CRC32C authors for copyright purposes. # # This does not necessarily list everyone who has contributed code, since in # some cases, their employer may be the copyright holder. To see the full list # of contributors, see the revision history in source control. Google Inc. Fangming Fang Vadim Skipin Rodrigo Tobar ICRAR-crc32c-6d3a422/CHANGELOG.md000066400000000000000000000165501467444355400156160ustar00rootroot00000000000000# Changelog ## Development ## [2.7.1] * Actually advertise that our C extension supports sub-interpreters, and per-GIL ones for that matter. ## [2.7.post1] * Added missing test files to source distribution (#59). ## [2.7.post0] * Fixed generation of source distribution (#58). ## [2.7] * Added a `gil_relese_mode` parameter to the `CRC32CHash` constructor used by all underlying `crc32c` function calls (#51). * Added support for free-threaded Python builds, declaring that our C extension doesn't need the GIL. In free-threaded builds the `gil_release_mode` parameter doesn't have any effect. * Added `CRC32CHash.checksum` auxiliary property. * Added new ``crc32c.benchmark`` utility for simple benchmarking. * The ``crc32c`` module doesn't fail to import when ``CRC32C_SW_MODE`` is ``none`` and no hardware acceleration is found, making the act of importing the module less ackward. Now a ``RuntimeWarning`` is issued at import time instead, and a``RuntimeError`` is raised any time a checksum calculation is attempted. * Improved support in the C extension for Python sub-interpreters by keeping all global state on a per-module basis, and performing multi-phase initialisation as per PEP-489. * Skip hardware probing if the `CRC32C_SKIP_HW_PROBE` environment variable is set to `1`. * Cleaned up wheel generation so it doesn't include C extension sources after changes introduced in 2.5. ## [2.6] * Added new `crc32c.CRC32CHash` class modelled after the stdlib `hashlib` hash objects. * Drop support for Python < 3.7. ## [2.5] * Made this package PEP 561 compliant (#49). * Release GIL during the computation of the CRC32C hash. A new `gil_release_mode` argument lets users choose between always/never/automatically releasing it (#47). * Add keyword support to `crc32c` function (`crc32c(data, value=0, gil_release_mode=-1)`). * Turned ``crc32c`` from a module-only distribution into a package, and moves all sources under `src`. * Adding explicit fallthrough annotations in several ``switch`` C statements for clarity, and to avoid potential warnings (#46). * Run test against different memory alignments. * Mention explicit support for Python 3.13. * Drop support for Python 2.7. ## [2.4.1] * Fixed failure on big-endian, signed ``char`` platforms (found in SPARC, but there might be more) due to an incorrect (and unnecessary) cast from ``unsigned char *`` to ``char *`` (#43). ## [2.4] * Changed package compilation under gcc/clang to use compiler extensions to build hardware-specific functions instead of command-line options for improved portability (#31). ## [2.3.post0] * Mention explicit support for Python 3.11. * Re-generating wheels to get 3.11 versions. ## [2.3] * Improved macro definition logic and platform detection to enable building ``universal2`` binary wheels for macOS, alongside ``arm64`` and ``x86_64`` ones; added step to GitHub Actions to generate and publish them (#28). * Mention explicit support for Python 3.10. * Fixed minor compilation warning in ARM64 builds. ## [2.2.post0] * Updated GitHub Actions to produce ARM64 Linux binary wheels and publish them to PyPI. * Removed Windows python 2.7 binary wheels. There are two reasons: cibuildwheels has removed such support, our Windows user base is < %5, and our Python 2.7 user base is also < %5. ## [2.2] * Fixed software algorithm implementation to work on big endian machines (#22). Now the algorithm works correctly, with numerical (uint32_t) values still representing the correct checksum. * Added a new ``big_endian`` attribute that indicates if the currently platform is big endian or not. * Fixed compilation issues in some ARM Linux boxes (#21). ## [2.1] * Initial hardware-based implementation on ARMv8 machines (#11). * Add hardware-based implementation on x86 32bit machines. The C code was already there, but we did not include it for this architecture. As a result, 32-bit x86 wheels should run faster now. * Deprecated the ``crc32`` function in favour of the new ``crc32c`` function, which apart from the new, better name has no other changes. * Fixed minor warning. ## [2.0.1] * Changed binary distribution generation strategy, moving from a local+Travis+AppVeyor setup to a unified script using GitHub Actions. * Fixed generation of source distribution (two C source code files were missing from the tarball). This bug was introduced in 1.6, but the source code distributions found in PyPI were not affected because the environment where they were created predates the bug, and already contained references to the two missing files. ## [2.0] * Changed package import logic (#12). Instead of failing to import if hardware support is not found, the package now automatically falls back to using the software implementation, and thus can always be imported. Old behavior can still be obtained by setting ``CRC32C_SW_MODE`` to ``none``. * Fixed cross-compilation support (#10). ## [1.7] * Fixes wrong uploads to PyPI (#8). ## [1.6] * Added new ``auto`` software mode to allow automatic selection of hardware or software backend (#5). * Fixed compilation in non-Intel platforms (#6). * Added support to compile with ``icc``. ## [1.5] * Adding software implementation of ``crc32c`` algorithm, original developed by Mark Adler (#4). Software implementation is not accessible by default in order to maintain current importing logic, and is switched on by setting ``CRC32C_SW_MODE`` to ``1``. * Changed Intel's hardware-based implementation of ``crc32c`` from our own home-brewed code to Mark Adler's. ## [1.4] * Added support to compile in Windows using MSVC. * Removing experimental read/crc/write C method. * First version with binary wheels uploaded to PyPI (#2). ## [1.3] * Added support to compile in Windows using the MinGW compiler (#1). ## [1.2] * First version of ``crc32c`` doing pre- and post-masking against ``0xffffffff``. This is thus the first version of the package that is easily usable. ## [1.1] * Correct license reference. ## [1.0] * Initial release. [1.0]: https://github.com/ICRAR/crc32c/releases/tag/v1.0 [1.1]: https://github.com/ICRAR/crc32c/releases/tag/v1.1 [1.2]: https://github.com/ICRAR/crc32c/releases/tag/v1.2 [1.3]: https://github.com/ICRAR/crc32c/releases/tag/v1.3 [1.4]: https://github.com/ICRAR/crc32c/releases/tag/v1.4 [1.5]: https://github.com/ICRAR/crc32c/releases/tag/v1.5 [1.6]: https://github.com/ICRAR/crc32c/releases/tag/v1.6 [1.7]: https://github.com/ICRAR/crc32c/releases/tag/v1.7 [2.0]: https://github.com/ICRAR/crc32c/releases/tag/v2.0 [2.0.1]: https://github.com/ICRAR/crc32c/releases/tag/v2.0.1 [2.1]: https://github.com/ICRAR/crc32c/releases/tag/v2.1 [2.2]: https://github.com/ICRAR/crc32c/releases/tag/v2.2 [2.2.post0]: https://github.com/ICRAR/crc32c/releases/tag/v2.2.post0 [2.3]: https://github.com/ICRAR/crc32c/releases/tag/v2.3 [2.3.post0]: https://github.com/ICRAR/crc32c/releases/tag/v2.3.post0 [2.4]: https://github.com/ICRAR/crc32c/releases/tag/v2.4 [2.4.1]: https://github.com/ICRAR/crc32c/releases/tag/v2.4.1 [2.5]: https://github.com/ICRAR/crc32c/releases/tag/v2.5 [2.6]: https://github.com/ICRAR/crc32c/releases/tag/v2.6 [2.7]: https://github.com/ICRAR/crc32c/releases/tag/v2.7 [2.7.post0]: https://github.com/ICRAR/crc32c/releases/tag/v2.7.post0 [2.7.post1]: https://github.com/ICRAR/crc32c/releases/tag/v2.7.post1 [2.7.1]: https://github.com/ICRAR/crc32c/releases/tag/v2.7.1 ICRAR-crc32c-6d3a422/LICENSE000066400000000000000000000636421467444355400150160ustar00rootroot00000000000000 GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange. If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License. 11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser 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 Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "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 LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY 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 LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! ICRAR-crc32c-6d3a422/LICENSE.google-crc32c000066400000000000000000000026641467444355400173430ustar00rootroot00000000000000Copyright 2017, The CRC32C Authors. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google Inc. nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ICRAR-crc32c-6d3a422/LICENSE.slice-by-8000066400000000000000000000035561467444355400166670ustar00rootroot00000000000000Copyright (c) 2008,2009,2010 Massachusetts Institute of Technology. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of the Massachusetts Institute of Technology nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. Other portions are under the same license from Intel: http://sourceforge.net/projects/slicing-by-8/ /*++ * * Copyright (c) 2004-2006 Intel Corporation - All Rights Reserved * * This software program is licensed subject to the BSD License, * available at http://www.opensource.org/licenses/bsd-license.html * * Abstract: The main routine * --*/ ICRAR-crc32c-6d3a422/MANIFEST.in000066400000000000000000000001431467444355400155320ustar00rootroot00000000000000include LICENSE* include AUTHORS* include test/conftest.py include run-tests.py include pytest.ini ICRAR-crc32c-6d3a422/README.rst000066400000000000000000000142051467444355400154670ustar00rootroot00000000000000crc32c ====== .. image:: https://github.com/ICRAR/crc32c/workflows/Build%20and%20release%20to%20PyPI/badge.svg?branch=master .. image:: https://badge.fury.io/py/crc32c.svg :target: https://badge.fury.io/py/crc32c This package implements the crc32c checksum algorithm. It automatically chooses between a hardware-based implementation (using the CRC32C SSE 4.2 instruction of Intel CPUs, and the crc32* instructions on ARMv8 CPUs), or a software-based one when no hardware support can be found. Because ``crc32c`` is in PyPI, you can install it with:: pip install crc32c Supported platforms are Linux and OSX using the gcc and clang compilers, and Windows using the Visual Studio compiler. Other compilers in Windows (MinGW for instance) might work. Binary wheels are also provided in PyPI for major platforms/architectures. The project is using certain gcc/clang compiler extensions to support building hardware-specific functions that might not be supported by older compiler versions. Usage ----- The core function exposed by this module is ``crc32c(data, value=0, gil_release_mode=-1)``. It computes the CRC32C checksum of ``data`` starting with an initial ``value`` checksum, similarly to how the built-in ``binascii.crc32`` works. It can thus be used like this: .. code-block:: python print(crc32c.crc32c(b'hello world')) # 3381945770 crc = crc32c.crc32c(b'hello') print(crc32c.crc32c(b' world', value=crc)) # 3381945770 In older versions, the function exposed by this module was called ``crc32``. That name is still present but deprecated, and will be removed in new versions of the library. The ``gil_release_mode`` keyword argument specifies whether a call of this library shall release or keep the Global Interpreter Lock. It can be set to the following values: * Negative: Only release the GIL when ``data`` >= 32KiB * 0: Never release the GIL * Positive: Always release the GIL The ``gil_release_mode`` parameter doesn't have any effect on free-threaded Python builds. On top of the ``crc32c`` function, a ``CRC32CHash(data=b"", gil_release_mode=-1)`` class is also offered. It is modelled after the "hash objects" of the ``hashlib`` module of the standard library. It also offers a ``checksum`` property: .. code-block:: python crc32c_hash = crc32c.CRC32CHash() crc32c_hash.update(b'hello') crc32c_hash.update(b' world') print(crc32c_hash.checksum == crc32c.crc32c(b'hello world')) # True print(crc32c_hash.digest()) # b'\xc9\x94e\xaa' digest_as_int = int.from_bytes(crc32c_hash.digest(), "big") print(digest_as_int == crc32c.crc32c(b'hello world')) # True For more details see the documentation on `hash objects `_. Additionally one can consult the following module-level values: * ``hardware_based`` indicates if the algorithm in use is software- or hardware-based. * ``big_endian`` indicates whether the platform is big endian or not. A benchmarking utility can be found when executing the ``crc32c.benchmark`` module. Consult its help with the ``-h`` flag for options. Implementation details ---------------------- By default, if your CPU doesn't have CRC32C hardware support, the package will fallback to use a software implementation of the crc32c checksum algorithm. This behavior can be changed by setting the ``CRC32C_SW_MODE`` environment variable to one of the following values: * ``auto``: same as if unset, will eventually be discontinued. * ``force``: use software implementation regardless of hardware support. * ``none``: issue a ``RuntimeWarning`` when importing the module, and a ``RuntimeError`` when executing the ``crc32c`` function, if no hardware support is found. In versions of this package up to 2.6 an ``ImportError`` was raised when importing the module instead. In 1.x versions this was the default behaviour. Setting the ``CRC32C_SKIP_HW_PROBE`` to ``1`` simulates platforms without hardware support. This is available mostly for internal testing purposes. The software algorithm is based on Intel's `slice-by-8 package `_, with some adaptations done by `Evan Jones `_ and packaging provided by `Ferry Toth `_. Further adaptations were required to make the code more portable and fit for inclusion within this python package. The Intel SSE 4.2 algorithm is based on `Mark Adler's code `_, with some modifications required to make the code more portable and fit for inclusion within this python package. The ARMv8 hardware implementation is based on Google's `crc32c `_ C++ library. Copyright --------- This package is copyrighted:: ICRAR - International Centre for Radio Astronomy Research (c) UWA - The University of Western Australia, 2017 Copyright by UWA (in the framework of the ICRAR) The original slice-by-8 software algorithm is copyrighted by:: Copyright (c) 2004-2006 Intel Corporation - All Rights Reserved Further adaptations to the slice-by-8 algorithm previous to the inclusion in this package are copyrighted by:: Copyright 2008,2009,2010 Massachusetts Institute of Technology. The original Intel SSE 4.2 crc32c algorithm is copyrighted by:: Copyright (C) 2013 Mark Adler The crc32c ARMv8 hardware code is copyrighted by:: Copyright 2017 The CRC32C Authors A copy of the `AUTHORS `_ file from Google's crc32c project as it was at the time of copying the code is included in this repository. License ------- This package is licensed under `the LGPL-2.1 license `_. The original slice-by-8 software algorithm is licensed under `the 2-clause BSD licence `_. Further modifications to the slice-by-8 software algorithm are licensed under `a 3-clause BSD licence `_ The original Intel SSE 4.2 crc32c algorithm's code is licensed under a custom license embedded in the ``crc32c_adler.c`` file. The original crc32c ARMv8 hardware code is licensed under `a 3-clause BSD license `_. ICRAR-crc32c-6d3a422/pytest.ini000066400000000000000000000001161467444355400160250ustar00rootroot00000000000000[pytest] markers = calculates_crc32c: Mark a test as needing crc32c working ICRAR-crc32c-6d3a422/requirements-dev.txt000066400000000000000000000000611467444355400200330ustar00rootroot00000000000000# Keep alphasorted black isort mypy pytest wheel ICRAR-crc32c-6d3a422/run-tests.py000066400000000000000000000012711467444355400163150ustar00rootroot00000000000000import os import subprocess as sp import sys SCRIPT_DIR = os.path.dirname(os.path.abspath(__file__)) def run(cmd): print(" ".join(cmd)) sp.check_call(cmd) def run_tests(crc32c_sw_mode): os.environ["CRC32C_SW_MODE"] = crc32c_sw_mode os.environ["CRC32C_SKIP_HW_PROBE"] = ["0", "1"][crc32c_sw_mode == "none"] message = "# Tests for CRC32C_SW_MODE: %s #" % crc32c_sw_mode hashes = "#" * len(message) print("\n" + hashes) print(message) print(hashes + "\n") run([sys.executable, "-m", "pytest", "-v", os.path.join(SCRIPT_DIR, "test")]) def main(): run_tests("auto") run_tests("force") run_tests("none") if __name__ == "__main__": main() ICRAR-crc32c-6d3a422/setup.py000066400000000000000000000047071467444355400155200ustar00rootroot00000000000000# # ICRAR - International Centre for Radio Astronomy Research # (c) UWA - The University of Western Australia, 2014 # Copyright by UWA (in the framework of the ICRAR) # All rights reserved # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public # License along with this library; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, # MA 02111-1307 USA # import glob from setuptools import Extension, setup crcmod_ext = Extension( "crc32c._crc32c", define_macros=[("NDEBUG", None)], depends=glob.glob("src/crc32c/ext/*.h"), language="c", sources=glob.glob("src/crc32c/ext/*.c"), include_dirs=["src/cc32c/ext/"], ) classifiers = [ # There's no more specific classifier for LGPLv2.1+ "License :: OSI Approved :: GNU Lesser General Public License v2 or later (LGPLv2+)", "Operating System :: OS Independent", "Programming Language :: C", "Programming Language :: Python :: 3.7", "Programming Language :: Python :: 3.8", "Programming Language :: Python :: 3.9", "Programming Language :: Python :: 3.10", "Programming Language :: Python :: 3.11", "Programming Language :: Python :: 3.12", "Programming Language :: Python :: 3.13", ] with open("README.rst", "rt") as f: long_description = f.read() setup( name="crc32c", author="The ICRAR DIA Team", url="https://github.com/ICRAR/crc32c", author_email="rtobar@icrar.org", version="2.7.1", license="LGPL-2.1-or-later", description=( "A python package implementing the crc32c algorithm" " in hardware and software" ), long_description=long_description, long_description_content_type="text/x-rst", classifiers=classifiers, packages=["crc32c"], package_dir={"": "src"}, package_data={"crc32c": ["*.pyi", "py.typed", "ext/*.h"]}, python_requires=">=3.7", ext_modules=[crcmod_ext], test_suite="test", ) ICRAR-crc32c-6d3a422/src/000077500000000000000000000000001467444355400145655ustar00rootroot00000000000000ICRAR-crc32c-6d3a422/src/crc32c/000077500000000000000000000000001467444355400156445ustar00rootroot00000000000000ICRAR-crc32c-6d3a422/src/crc32c/__init__.py000066400000000000000000000004301467444355400177520ustar00rootroot00000000000000# Explicitly "import ... as" to make mypy --strict happy from ._crc32c import big_endian as big_endian from ._crc32c import crc32 as crc32 from ._crc32c import crc32c as crc32c from ._crc32c import hardware_based as hardware_based from ._crc32hash import CRC32CHash as CRC32CHash ICRAR-crc32c-6d3a422/src/crc32c/_crc32c.pyi000066400000000000000000000003551467444355400176100ustar00rootroot00000000000000from typing_extensions import Buffer big_endian: int hardware_based: bool def crc32(data: Buffer, value: int = 0, gil_release_mode: int = -1) -> int: ... def crc32c(data: Buffer, value: int = 0, gil_release_mode: int = -1) -> int: ... ICRAR-crc32c-6d3a422/src/crc32c/_crc32hash.py000066400000000000000000000050721467444355400201410ustar00rootroot00000000000000from __future__ import annotations from typing import TYPE_CHECKING from ._crc32c import crc32c if TYPE_CHECKING: from typing_extensions import Buffer, Self class CRC32CHash: """Wrapper class for crc32c. Tries to conform to the interface of `hashlib` classes.""" @property def digest_size(self) -> int: """ The size of the resulting hash in bytes. """ return 4 @property def block_size(self) -> int: """ The internal block size of the hash algorithm in bytes. """ return 1 @property def name(self) -> str: """ The canonical name of this hash, """ return "crc32c" @property def checksum(self) -> int: """ The checksum calculated so far. Not part of the hashlib interface. """ return self._checksum def __init__(self, data: Buffer = b"", gil_release_mode: int = -1) -> None: """ Initialise the hash object with an optional bytes-like object. Uses the given GIL release mode on each checksum calculation. """ self._checksum = crc32c(data, gil_release_mode=gil_release_mode) self._gil_release_mode = gil_release_mode def update(self, data: Buffer) -> None: """ Update the hash object with the bytes-like object. Repeated calls are equivalent to a single call with the concatenation of all the arguments: m.update(a); m.update(b) is equivalent to m.update(a+b). """ self._checksum = crc32c( data, self._checksum, gil_release_mode=self._gil_release_mode ) def digest(self) -> bytes: """ Return the digest of the data passed to the update() method so far. This is a bytes object of size digest_size which may contain bytes in the whole range from 0 to 255. """ return self._checksum.to_bytes(4, "big") def hexdigest(self) -> str: """ Like digest() except the digest is returned as a string object of double length, containing only hexadecimal digits. This may be used to exchange the value safely in email or other non-binary environments. """ return self.digest().hex() def copy(self) -> Self: """ Return a copy (“clone”) of the hash object. This can be used to efficiently compute the digests of data sharing a common initial substring. """ res = type(self)() res._checksum = self._checksum res._gil_release_mode = self._gil_release_mode return res ICRAR-crc32c-6d3a422/src/crc32c/benchmark.py000066400000000000000000000024641467444355400201560ustar00rootroot00000000000000import argparse import time import typing from ._crc32c import crc32c DEFAULT_SIZE = 100 * 1024 * 1024 DEFAULT_ITERATIONS = 10 def run(size: int, iterations: int) -> typing.Tuple[float, int]: data = b" " * size start = time.monotonic() evaluations = 0 while True: evaluations += iterations [crc32c(data) for _ in range(iterations)] duration = time.monotonic() - start if duration > 0: break return duration, evaluations def main() -> None: parser = argparse.ArgumentParser() parser.add_argument( "-s", "--size", type=int, help=f"Amount of bytes to checksum, defaults to {DEFAULT_SIZE}", default=DEFAULT_SIZE, ) parser.add_argument( "-i", "--iterations", type=int, help=f"Number of times the checksum should we run over the data, defaults to {DEFAULT_ITERATIONS}", default=DEFAULT_ITERATIONS, ) options = parser.parse_args() duration, evaluations = run(options.size, options.iterations) size_mb = options.size / 1024 / 1024 avg_speed_gbs = size_mb / 1024 * evaluations / duration print( f"crc32c ran at {avg_speed_gbs:.3f} [GB/s] when checksuming {size_mb:.3f} [MB] {evaluations} times" ) if __name__ == "__main__": main() ICRAR-crc32c-6d3a422/src/crc32c/ext/000077500000000000000000000000001467444355400164445ustar00rootroot00000000000000ICRAR-crc32c-6d3a422/src/crc32c/ext/_crc32c.c000066400000000000000000000162671467444355400200420ustar00rootroot00000000000000/* * This module provides crc32c checksum (http://www.rfc-editor.org/rfc/rfc3385.txt) * based on the Intel CRC32 instruction * provided in the Intel SSE4.2 instruction set * * ICRAR - International Centre for Radio Astronomy Research * (c) UWA - The University of Western Australia, 2014 * Copyright by UWA (in the framework of the ICRAR) * All rights reserved * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, * MA 02111-1307 USA * */ #include #include "checkarm.h" #include "checksse42.h" #include "common.h" #include "crc32c.h" #define MIN_BUFSIZE_FOR_AUTOMATIC_RELEASE 32 * 1024 /* threshold for GIL release is 32KiB */ /* Used in other files so needs global visibility */ int is_big_endian; typedef struct _CRC32CState { crc_function crc_fn; } CRC32CState; CRC32CState *get_state(PyObject *module) { return (CRC32CState *)PyModule_GetState(module); } static inline int crc32c_inline(crc_function crc_fn, uint32_t crc, unsigned char *bin_data, Py_ssize_t len) { int result; crc ^= 0xffffffff; result = crc_fn(crc, bin_data, len); result ^= 0xffffffff; return result; } static PyObject* crc32c_crc32c(PyObject *module, PyObject *args, PyObject *kwargs) { Py_buffer pbin; unsigned char *bin_data = NULL; uint32_t crc = 0U, result; int gil_release_mode = -1; static char *kwlist[] = {"data", "value", "gil_release_mode", NULL}; /* In python 3 we accept only bytes-like objects */ const char *format ="y*|Ii:crc32"; crc_function crc_fn = get_state(module)->crc_fn; if (!crc_fn) { PyErr_SetString( PyExc_RuntimeError, "crc32c: software mode disabled and no hardware acceleration found, can't calculate checksum" ); return NULL; } if (!PyArg_ParseTupleAndKeywords(args, kwargs, format, kwlist, &pbin, &crc, &gil_release_mode) ) return NULL; bin_data = pbin.buf; #ifndef Py_GIL_DISABLED if ((gil_release_mode < 0 && pbin.len >= MIN_BUFSIZE_FOR_AUTOMATIC_RELEASE) || gil_release_mode >= 1) { Py_BEGIN_ALLOW_THREADS result = crc32c_inline(crc_fn, crc, bin_data, pbin.len); Py_END_ALLOW_THREADS } else #endif { result = crc32c_inline(crc_fn, crc, bin_data, pbin.len); } PyBuffer_Release(&pbin); return PyLong_FromUnsignedLong(result); } static PyObject *crc32c_crc32(PyObject *self, PyObject *args, PyObject *kwargs) { if (PyErr_WarnEx(PyExc_DeprecationWarning, "crc32c.crc32 will be eventually removed, use crc32c.crc32c instead", 1) == -1) { return NULL; } return crc32c_crc32c(self, args, kwargs); } /* The different values the SW mode preference can take */ enum crc32c_sw_mode { UNSPECIFIED, AUTO, FORCE, NONE }; static enum crc32c_sw_mode get_sw_mode(void) { char *sw_mode = getenv("CRC32C_SW_MODE"); if (sw_mode == NULL) { return UNSPECIFIED; } else if (!strcmp(sw_mode, "auto")) { return AUTO; } else if (!strcmp(sw_mode, "force")) { return FORCE; } else if (!strcmp(sw_mode, "none")) { return NONE; } return UNSPECIFIED; } #ifdef CRC32C_CAN_PROBE_HW static int get_skip_hw_probe(void) { char *skip_hw_probe = getenv("CRC32C_SKIP_HW_PROBE"); if (skip_hw_probe == NULL) { return 0; } return !strcmp(skip_hw_probe, "1"); } #endif static PyMethodDef CRC32CMethods[] = { {"crc32", (PyCFunction)crc32c_crc32, METH_VARARGS | METH_KEYWORDS, "Calculate crc32c incrementally (deprecated)"}, {"crc32c", (PyCFunction)crc32c_crc32c, METH_VARARGS | METH_KEYWORDS, "Calculate crc32c incrementally"}, {NULL, NULL, 0, NULL} /* Sentinel */ }; static int crc32c_mod_exec(PyObject *module); static PyModuleDef_Slot CRC32CSlots[] = { {Py_mod_exec, crc32c_mod_exec}, #if PY_VERSION_HEX >= 0x030C0000 {Py_mod_multiple_interpreters, Py_MOD_PER_INTERPRETER_GIL_SUPPORTED}, #endif #ifdef Py_GIL_DISABLED {Py_mod_gil, Py_MOD_GIL_NOT_USED}, #endif {0, NULL} }; static const char *no_hw_or_sw_error_msg = "\n\n" "Hardware extensions providing a crc32c hardware instruction are not available in\n" "your processor. This package comes with a software implementation, but this\n" "support has been opted out because the CRC32C_SW_MODE environment variable is\n" "set to \"none\", and therefore any checksum calculation will result in a\n" "RuntimeError. CRC32C_SW_MODE can take one of the following values:\n" " * If unset: use the software implementation if no hardware support is found\n" " * 'auto': as above, but will eventually be discontinued\n" " * 'force': use software implementation regardless of hardware support.\n" " * 'none': fail if no hardware support is found.\n"; static struct PyModuleDef crc32c_def = { PyModuleDef_HEAD_INIT, /* m_base */ "_crc32c", /* m_name */ "crc32c implementation in hardware and software", /* m_doc */ sizeof(CRC32CState), /* m_size */ CRC32CMethods, /* m_methods */ CRC32CSlots, /* m_slots */ NULL, /* m_traverse */ NULL, /* m_clear */ NULL, /* m_free */ }; PyMODINIT_FUNC PyInit__crc32c(void) { return PyModuleDef_Init(&crc32c_def); } static int crc32c_mod_exec(PyObject *module) { PyObject *hardware_based; enum crc32c_sw_mode sw_mode; const uint32_t n = 1; #ifdef CRC32C_CAN_PROBE_HW int skip_hw_probe; #endif sw_mode = get_sw_mode(); #ifdef CRC32C_CAN_PROBE_HW skip_hw_probe = get_skip_hw_probe(); #endif crc_function crc_fn = NULL; if (sw_mode == FORCE) { crc_fn = _crc32c_sw_slicing_by_8; hardware_based = Py_False; } #if defined(IS_INTEL) else if (!skip_hw_probe && _crc32c_intel_probe()) { crc_fn = _crc32c_hw_adler; crc32c_init_hw_adler(); hardware_based = Py_True; } #elif defined(IS_ARM) && (defined(__linux__) || defined(linux)) else if (!skip_hw_probe && _crc32c_arm64_probe()) { crc_fn = _crc32c_hw_arm64; hardware_based = Py_True; } #endif else if (sw_mode == UNSPECIFIED || sw_mode == AUTO) { crc_fn = _crc32c_sw_slicing_by_8; hardware_based = Py_False; } else if (sw_mode == NONE) { if (PyErr_WarnEx(PyExc_RuntimeWarning, no_hw_or_sw_error_msg, 1) == -1) { return -1; } hardware_based = Py_False; } is_big_endian = (*(const char *)(&n) == 0); Py_INCREF(hardware_based); get_state(module)->crc_fn = crc_fn; if (PyModule_AddObject(module, "hardware_based", hardware_based) < 0) { return -1; } if (PyModule_AddIntConstant(module, "big_endian", is_big_endian) < 0) { return -1; } return 0; } ICRAR-crc32c-6d3a422/src/crc32c/ext/checkarm.c000066400000000000000000000025141467444355400203670ustar00rootroot00000000000000/* * Linux-specific AArch64 CRC32 instruction probing implementation * * ICRAR - International Centre for Radio Astronomy Research * (c) UWA - The University of Western Australia, 2020 * Copyright by UWA (in the framework of the ICRAR) * All rights reserved * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, * MA 02111-1307 USA * */ #include "common.h" #if defined(IS_ARM) && (defined(__linux__) || defined(linux)) #include #ifndef HWCAP_CRC32 /* see arch/arm64/include/uapi/asm/hwcap.h */ #define HWCAP_CRC32 (1 << 7) #endif int _crc32c_arm64_probe(void) { unsigned long auxval; auxval = getauxval(AT_HWCAP); return (auxval & HWCAP_CRC32) != 0; } #endif ICRAR-crc32c-6d3a422/src/crc32c/ext/checkarm.h000066400000000000000000000021271467444355400203740ustar00rootroot00000000000000/* * Header file for the Linux-specific AArch64 CRC32 instruction probing implementation * * ICRAR - International Centre for Radio Astronomy Research * (c) UWA - The University of Western Australia, 2022 * Copyright by UWA (in the framework of the ICRAR) * All rights reserved * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, * MA 02111-1307 USA */ #ifndef _CHECKARM_H_ #define _CHECKARM_H_ int _crc32c_arm64_probe(void); #endifICRAR-crc32c-6d3a422/src/crc32c/ext/checksse42.c000066400000000000000000000032111467444355400205430ustar00rootroot00000000000000/* * Intel SSE 4.2 instruction probing implementation * * ICRAR - International Centre for Radio Astronomy Research * (c) UWA - The University of Western Australia, 2014 * Copyright by UWA (in the framework of the ICRAR) * All rights reserved * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, * MA 02111-1307 USA * */ #include "common.h" #if defined(IS_INTEL) #if defined(_MSC_VER) #include int _crc32c_intel_probe(void) { int info[4]; __cpuid(info, 1); return (info[2] & (1 << 20)) != 0; } #elif defined(__GNUC__) #include int _crc32c_intel_probe(void) { unsigned int eax, ebx, ecx = 0, edx; __get_cpuid(1, &eax, &ebx, &ecx, &edx); return (ecx & (1 << 20)) != 0; } #else int _crc32c_intel_probe(void) { unsigned int ecx; asm ("movl $1, %%eax;" "cpuid;" "movl %%ecx, %0;" : "=r"(ecx) // outputs : // inputs : "eax", "ebx", "ecx", "edx"); // clobber return (ecx & (1 << 20)) != 0; } #endif // defined(_MSC_VER) #endif // defined(IS_INTEL)ICRAR-crc32c-6d3a422/src/crc32c/ext/checksse42.h000066400000000000000000000020731467444355400205550ustar00rootroot00000000000000/* * Header file for the SSE 4.2 probing implementation * * ICRAR - International Centre for Radio Astronomy Research * (c) UWA - The University of Western Australia, 2014 * Copyright by UWA (in the framework of the ICRAR) * All rights reserved * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, * MA 02111-1307 USA */ #ifndef _CHECKSSE42_H_ #define _CHECKSSE42_H_ int _crc32c_intel_probe(void); #endif ICRAR-crc32c-6d3a422/src/crc32c/ext/common.h000066400000000000000000000057651467444355400201220ustar00rootroot00000000000000/* * Common macro definitions * * ICRAR - International Centre for Radio Astronomy Research * (c) UWA - The University of Western Australia, 2014 * Copyright by UWA (in the framework of the ICRAR) * All rights reserved * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, * MA 02111-1307 USA * */ #ifndef _COMMON_H_ #define _COMMON_H_ #if defined(__x86_64__) || defined(_M_X64) || defined(i386) || defined(__i386__) || defined(__i386) || defined(_M_IX86) # define IS_INTEL #elif defined(__aarch64__) || defined(_M_ARM64) # define IS_ARM #endif #if defined(IS_INTEL) || (defined(IS_ARM) && (defined(__linux__) || defined(linux))) # define CRC32C_CAN_PROBE_HW #endif /* inline support (it's not a keyword in MSVC for C code) */ #if defined(_MSC_VER) # define CRC32C_INLINE __inline #else # define CRC32C_INLINE inline #endif /* switch case fallthrough annotation support */ #if defined(__STDC_VERSION__) && defined(__has_c_attribute) # if __has_c_attribute(fallthrough) && __STDC_VERSION__ >= __has_c_attribute(fallthrough) # define CRC32C_FALLTHROUGH [[fallthrough]] # endif #endif #if !defined(CRC32C_FALLTHROUGH) && defined(__has_attribute) # if __has_attribute(__fallthrough__) # define CRC32C_FALLTHROUGH __attribute__((__fallthrough__)) # endif #endif #if !defined(CRC32C_FALLTHROUGH) # define CRC32C_FALLTHROUGH (void)0 #endif /* 32/64 bit detection */ #if defined(__amd64__) || defined(__amd64) || defined(__x86_64__) || defined(__x86_64) ||\ (defined(_MSC_VER) && defined(_M_AMD64)) # define CRC32C_IS_64_BITS #else # undef CRC32C_IS_64_BITS #endif /* uint64_t / uint32_t / uint16_t definitions */ #if !defined(_MSC_VER) || (MSC_VER >= 1800) # include #else # include typedef unsigned __int64 uint64_t; # if ULONG_MAX == (0xffffffffUL) typedef unsigned long uint32_t; # elif UINT_MAX == (0xffffffffUL) typedef unsigned int uint32_t; # else # error "Unsupported platform" # endif # if UINT_MAX == (0xffffUL) typedef unsigned int uint16_t; # elif USHRT_MAX == (0xffffUL) typedef unsigned short uint16_t; # else # error "Unsupported platform" # endif #endif /* size_t definition */ #include /* crc32c function signature */ typedef uint32_t (* crc_function)(uint32_t crc, unsigned const char *data, unsigned long length); /* Are we big endian? */ extern int is_big_endian; #endif // _COMMON_H_ ICRAR-crc32c-6d3a422/src/crc32c/ext/crc32c.h000066400000000000000000000025341467444355400177000ustar00rootroot00000000000000/* * Definition of crc32c checksum implementation * * ICRAR - International Centre for Radio Astronomy Research * (c) UWA - The University of Western Australia, 2014 * Copyright by UWA (in the framework of the ICRAR) * All rights reserved * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, * MA 02111-1307 USA * */ #ifndef _CRC32C_H_ #define _CRC32C_H_ #include "common.h" void crc32c_init_hw_adler(void); uint32_t _crc32c_hw_arm64(uint32_t crc, const unsigned char* data, unsigned long length); uint32_t _crc32c_hw_adler(uint32_t crc, const unsigned char* data, unsigned long length); uint32_t _crc32c_sw_slicing_by_8(uint32_t crc, const unsigned char *data, unsigned long length); #endif ICRAR-crc32c-6d3a422/src/crc32c/ext/crc32c_adler.c000066400000000000000000000347311467444355400210460ustar00rootroot00000000000000/* crc32c.c -- compute CRC-32C using the Intel crc32 instruction * Copyright (C) 2013 Mark Adler * Version 1.1 1 Aug 2013 Mark Adler * * Adapted by Rodrigo Tobar for inclusion in the crc32c python package */ /* This software is provided 'as-is', without any express or implied warranty. In no event will the author be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. Mark Adler madler@alumni.caltech.edu */ /* Use hardware CRC instruction on Intel SSE 4.2 processors. This computes a CRC-32C, *not* the CRC-32 used by Ethernet and zip, gzip, etc. A software version is provided as a fall-back, as well as for speed comparisons. */ /* Version history: 1.0 10 Feb 2013 First version 1.1 1 Aug 2013 Correct comments on why three crc instructions in parallel */ /* Altered version * This version modified to fit into the benchmarking code retrieved from * http://www.evanjones.ca/crc32c.html * 1.2 20 Mar 2016 Ferry Toth - Fit into benchmarking * 1.3 07 May 2016 Ferry Toth - Applied some speed ups by putting more CRC32 in the short and long loop * - Moved crc32q into macro's and put alternative code there for 32bit operation */ #include "common.h" #if defined(IS_INTEL) #if defined(__GNUC__) # define ATTR_CRC32 __attribute__ ((target("sse4.2"))) #else # define ATTR_CRC32 #endif /* * MSVC/icc don't have __builtin_ia32_crc32_* functions. Instead they have * the _mm_crc32_* intrinsics, which accomplish the same at the end of the day */ #if defined(_MSC_VER) || defined(__ICC) # include # define __builtin_ia32_crc32qi _mm_crc32_u8 # define __builtin_ia32_crc32hi _mm_crc32_u16 # define __builtin_ia32_crc32si _mm_crc32_u32 # define __builtin_ia32_crc32di _mm_crc32_u64 #endif /* defined(_MSC_VER) || defined(__ICC) */ /* CRC-32C (iSCSI) polynomial in reversed bit order. */ #define POLY 0x82f63b78 /* Multiply a matrix times a vector over the Galois field of two elements, GF(2). Each element is a bit in an unsigned integer. mat must have at least as many entries as the power of two for most significant one bit in vec. */ static CRC32C_INLINE uint32_t gf2_matrix_times ( uint32_t *mat, uint32_t vec ) { uint32_t sum; sum = 0; while ( vec ) { if ( vec & 1 ) sum ^= *mat; vec >>= 1; mat++; } return sum; } /* Multiply a matrix by itself over GF(2). Both mat and square must have 32 rows. */ static CRC32C_INLINE void gf2_matrix_square ( uint32_t *square, uint32_t *mat ) { int n; for ( n = 0; n < 32; n++ ) square[n] = gf2_matrix_times ( mat, mat[n] ); } /* Construct an operator to apply len zeros to a crc. len must be a power of two. If len is not a power of two, then the result is the same as for the largest power of two less than len. The result for len == 0 is the same as for len == 1. A version of this routine could be easily written for any len, but that is not needed for this application. */ static void crc32c_zeros_op ( uint32_t *even, size_t len ) { int n; uint32_t row; uint32_t odd[32]; /* odd-power-of-two zeros operator */ /* put operator for one zero bit in odd */ odd[0] = POLY; /* CRC-32C polynomial */ row = 1; for ( n = 1; n < 32; n++ ) { odd[n] = row; row <<= 1; } /* put operator for two zero bits in even */ gf2_matrix_square ( even, odd ); /* put operator for four zero bits in odd */ gf2_matrix_square ( odd, even ); /* first square will put the operator for one zero byte (eight zero bits), in even -- next square puts operator for two zero bytes in odd, and so on, until len has been rotated down to zero */ do { gf2_matrix_square ( even, odd ); len >>= 1; if ( len == 0 ) return; gf2_matrix_square ( odd, even ); len >>= 1; } while ( len ); /* answer ended up in odd -- copy to even */ for ( n = 0; n < 32; n++ ) even[n] = odd[n]; } /* Take a length and build four lookup tables for applying the zeros operator for that length, byte-by-byte on the operand. */ static void crc32c_zeros ( uint32_t zeros[][256], size_t len ) { uint32_t n; uint32_t op[32]; crc32c_zeros_op ( op, len ); for ( n = 0; n < 256; n++ ) { zeros[0][n] = gf2_matrix_times ( op, n ); zeros[1][n] = gf2_matrix_times ( op, n << 8 ); zeros[2][n] = gf2_matrix_times ( op, n << 16 ); zeros[3][n] = gf2_matrix_times ( op, n << 24 ); } } /* Apply the zeros operator table to crc. */ static CRC32C_INLINE uint32_t crc32c_shift ( uint32_t zeros[][256], uint32_t crc ) { return zeros[0][crc & 0xff] ^ zeros[1][ ( crc >> 8 ) & 0xff] ^ zeros[2][ ( crc >> 16 ) & 0xff] ^ zeros[3][crc >> 24]; } /* Block sizes for three-way parallel crc computation. LONG and SHORT must both be powers of two. The associated string constants must be set accordingly, for use in constructing the assembler instructions. */ #define LONG 8192 #define LONGx1 "8192" #define LONGx2 "16384" #define SHORT 256 #define SHORTx1 "256" #define SHORTx2 "512" /* Tables for hardware crc that shift a crc by LONG and SHORT zeros. */ static uint32_t crc32c_long[4][256]; static uint32_t crc32c_short[4][256]; /* Initialize tables for shifting crcs. */ void crc32c_init_hw_adler( void ) { crc32c_zeros ( crc32c_long, LONG ); crc32c_zeros ( crc32c_short, SHORT ); } #ifndef CRC32C_IS_64_BITS #define CRCtriplet(crc, buf, size, i) \ crc ## 0 = __builtin_ia32_crc32si(crc ## 0, *(uint32_t*) (buf + i)); \ crc ## 1 = __builtin_ia32_crc32si(crc ## 1, *(uint32_t*) (buf + i + size)); \ crc ## 2 = __builtin_ia32_crc32si(crc ## 2, *(uint32_t*) (buf + i + 2 * size)); \ crc ## 0 = __builtin_ia32_crc32si(crc ## 0, *(uint32_t*) (buf + sizeof(uint32_t) + i)); \ crc ## 1 = __builtin_ia32_crc32si(crc ## 1, *(uint32_t*) (buf + sizeof(uint32_t) + i + size)); \ crc ## 2 = __builtin_ia32_crc32si(crc ## 2, *(uint32_t*) (buf + sizeof(uint32_t) + i + 2 * size)); #else #define CRCtriplet(crc, buf, size, i) \ crc ## 0 = __builtin_ia32_crc32di(crc ## 0, *(uint64_t*) (buf + i)); \ crc ## 1 = __builtin_ia32_crc32di(crc ## 1, *(uint64_t*) (buf + i + size)); \ crc ## 2 = __builtin_ia32_crc32di(crc ## 2, *(uint64_t*) (buf + i + 2 * size)); #endif #ifndef CRC32C_IS_64_BITS #define CRCsinglet(crc, buf) \ crc = __builtin_ia32_crc32si(crc, *(uint32_t*)buf); \ crc = __builtin_ia32_crc32si(crc, *(uint32_t*)(buf + sizeof(uint32_t))); \ buf+= 2 *sizeof(uint32_t); #else #define CRCsinglet(crc, buf) crc = __builtin_ia32_crc32di(crc, *(uint64_t*)buf); buf+= sizeof(uint64_t); #endif /* Compute CRC-32C using the Intel hardware instruction. */ ATTR_CRC32 uint32_t _crc32c_hw_adler(uint32_t crc, const unsigned char *buf, unsigned long len) { const unsigned char *next = buf; const unsigned char *end; unsigned short count; #ifndef CRC32C_IS_64_BITS uint32_t crc0, crc1, crc2; #else uint64_t crc0, crc1, crc2; /* need to be 64 bits for crc32q */ #endif uint32_t crc32bit; crc32bit = crc; // in len > 256 compute the crc for up to seven leading bytes to bring the data pointer to an eight-byte boundary if ( len > 128 ) { unsigned char align = ( 8 - ( uintptr_t ) next ) % 8; // byte to boundary len -= align; if ( ( align % 2 ) != 0 ) crc32bit = __builtin_ia32_crc32qi ( crc32bit, *next ); next += align; switch ( align / 2 ) { case 3: crc32bit = __builtin_ia32_crc32hi ( crc32bit, * ( uint16_t* ) ( next - 6 ) ); // 6 char, remain 4 CRC32C_FALLTHROUGH; case 2: crc32bit = __builtin_ia32_crc32si ( crc32bit, * ( uint32_t* ) ( next - 4 ) ); // 4 char, remain 0 break; case 1: crc32bit = __builtin_ia32_crc32hi ( crc32bit, * ( uint16_t* ) ( next - 2 ) ); // 2 char, remain 0 break; case 0: break; } }; /* compute the crc on sets of LONG*3 bytes, executing three independent crc instructions, each on LONG bytes -- this is optimized for the Nehalem, Westmere, Sandy Bridge, and Ivy Bridge architectures, which have a throughput of one crc per cycle, but a latency of three cycles */ crc0 = crc32bit; while ( len >= LONG*3 ) { crc1 = 0; crc2 = 0; end = next + LONG; do { CRCtriplet ( crc, next, LONG, 0 ); CRCtriplet ( crc, next, LONG, 8 ); CRCtriplet ( crc, next, LONG, 16 ); CRCtriplet ( crc, next, LONG, 24 ); next += 32; } while ( next < end ); crc0 = crc32c_shift ( crc32c_long, (uint32_t)crc0 ) ^ crc1; crc0 = crc32c_shift ( crc32c_long, (uint32_t)crc0 ) ^ crc2; next += LONG*2; len -= LONG*3; } /* do the same thing, but now on SHORT*3 blocks for the remaining data less than a LONG*3 block */ while ( len >= SHORT*3 ) { crc1 = 0; crc2 = 0; end = next + SHORT; do { CRCtriplet ( crc, next, SHORT, 0 ); CRCtriplet ( crc, next, SHORT, 8 ); CRCtriplet ( crc, next, SHORT, 16 ); CRCtriplet ( crc, next, SHORT, 24 ); next += 32; } while ( next < end ); crc0 = crc32c_shift ( crc32c_short, (uint32_t)crc0 ) ^ crc1; crc0 = crc32c_shift ( crc32c_short, (uint32_t)crc0 ) ^ crc2; next += SHORT*2; len -= SHORT*3; } /* compute the crc on the remaining eight-byte units less than a SHORT*3 block */ // use Duff's device, a for() loop inside a switch() statement. This is Legal if ( ( count = ( len - ( len & 7 ) ) ) >= 8 ) { // needs to execute crc at least once unsigned short n; len -= count; count /= 8; // count number of crc32di n = ( count + 15 ) / 16; switch ( count % 16 ) { case 0: do { CRCsinglet ( crc0, next ); CRC32C_FALLTHROUGH; case 15: CRCsinglet ( crc0, next ); CRC32C_FALLTHROUGH; case 14: CRCsinglet ( crc0, next ); CRC32C_FALLTHROUGH; case 13: CRCsinglet ( crc0, next ); CRC32C_FALLTHROUGH; case 12: CRCsinglet ( crc0, next ); CRC32C_FALLTHROUGH; case 11: CRCsinglet ( crc0, next ); CRC32C_FALLTHROUGH; case 10: CRCsinglet ( crc0, next ); CRC32C_FALLTHROUGH; case 9: CRCsinglet ( crc0, next ); CRC32C_FALLTHROUGH; case 8: CRCsinglet ( crc0, next ); CRC32C_FALLTHROUGH; case 7: CRCsinglet ( crc0, next ); CRC32C_FALLTHROUGH; case 6: CRCsinglet ( crc0, next ); CRC32C_FALLTHROUGH; case 5: CRCsinglet ( crc0, next ); CRC32C_FALLTHROUGH; case 4: CRCsinglet ( crc0, next ); CRC32C_FALLTHROUGH; case 3: CRCsinglet ( crc0, next ); CRC32C_FALLTHROUGH; case 2: CRCsinglet ( crc0, next ); CRC32C_FALLTHROUGH; case 1: CRCsinglet ( crc0, next ); } while ( --n > 0 ); } }; /* compute the crc for up to seven trailing bytes */ crc32bit = (uint32_t)crc0; if ( ( len % 2 ) != 0 ) crc32bit = __builtin_ia32_crc32qi ( crc32bit, * ( next ) ); // 1 char, remain even next += len; switch ( len / 2 ) { case 3: crc32bit = __builtin_ia32_crc32hi ( crc32bit, * ( uint16_t* ) ( next - 6 ) ); // 2 char, remain 4 CRC32C_FALLTHROUGH; case 2: crc32bit = __builtin_ia32_crc32si ( crc32bit, * ( uint32_t* ) ( next - 4 ) ); // 4 char, remain 0 break; case 1: crc32bit = __builtin_ia32_crc32hi ( crc32bit, * ( uint16_t* ) ( next - 2 ) ); // 2 char, remain 0 break; case 0: break; } return ( uint32_t ) crc32bit; } #endif // defined(IS_INTEL) ICRAR-crc32c-6d3a422/src/crc32c/ext/crc32c_arm64.c000066400000000000000000000070461467444355400207070ustar00rootroot00000000000000// Copyright 2017 The CRC32C Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE.google-crc32c file. See the AUTHORS.google-crc32c file // for names of contributors. // In a separate source file to allow this accelerated CRC32C function to be // compiled with the appropriate compiler flags to enable ARM NEON CRC32C // instructions. // This implementation is based on https://github.com/google/leveldb/pull/490. // // Adjusted from https://github.com/google/crc32c to be fit for inclusion // into this python package #include "common.h" #if defined(IS_ARM) && (defined(__linux__) || defined(linux)) #if defined(__GNUC__) # pragma GCC target ("+crc+crypto") #endif #include #include #include #include #define KBYTES 1032 #define SEGMENTBYTES 256 // compute 8bytes for each segment parallelly #define CRC32C32BYTES(P, IND) \ do { \ crc1 = __crc32cd( \ crc1, *((const uint64_t *)(P) + (SEGMENTBYTES / 8) * 1 + (IND))); \ crc2 = __crc32cd( \ crc2, *((const uint64_t *)(P) + (SEGMENTBYTES / 8) * 2 + (IND))); \ crc3 = __crc32cd( \ crc3, *((const uint64_t *)(P) + (SEGMENTBYTES / 8) * 3 + (IND))); \ crc0 = __crc32cd( \ crc0, *((const uint64_t *)(P) + (SEGMENTBYTES / 8) * 0 + (IND))); \ } while (0); // compute 8*8 bytes for each segment parallelly #define CRC32C256BYTES(P, IND) \ do { \ CRC32C32BYTES((P), (IND)*8 + 0) \ CRC32C32BYTES((P), (IND)*8 + 1) \ CRC32C32BYTES((P), (IND)*8 + 2) \ CRC32C32BYTES((P), (IND)*8 + 3) \ CRC32C32BYTES((P), (IND)*8 + 4) \ CRC32C32BYTES((P), (IND)*8 + 5) \ CRC32C32BYTES((P), (IND)*8 + 6) \ CRC32C32BYTES((P), (IND)*8 + 7) \ } while (0); // compute 4*8*8 bytes for each segment parallelly #define CRC32C1024BYTES(P) \ do { \ CRC32C256BYTES((P), 0) \ CRC32C256BYTES((P), 1) \ CRC32C256BYTES((P), 2) \ CRC32C256BYTES((P), 3) \ (P) += 4 * SEGMENTBYTES; \ } while (0) uint32_t _crc32c_hw_arm64(uint32_t crc, const uint8_t *data, size_t size) { int64_t length = size; uint32_t crc0, crc1, crc2, crc3; uint64_t t0, t1, t2; // k0=CRC(x^(3*SEGMENTBYTES*8)), k1=CRC(x^(2*SEGMENTBYTES*8)), // k2=CRC(x^(SEGMENTBYTES*8)) const poly64_t k0 = 0x8d96551c, k1 = 0xbd6f81f8, k2 = 0xdcb17aa4; while (length >= KBYTES) { crc0 = crc; crc1 = 0; crc2 = 0; crc3 = 0; // Process 1024 bytes in parallel. CRC32C1024BYTES(data); // Merge the 4 partial CRC32C values. t2 = (uint64_t)vmull_p64(crc2, k2); t1 = (uint64_t)vmull_p64(crc1, k1); t0 = (uint64_t)vmull_p64(crc0, k0); crc = __crc32cd(crc3, *(uint64_t *)data); data += sizeof(uint64_t); crc ^= __crc32cd(0, t2); crc ^= __crc32cd(0, t1); crc ^= __crc32cd(0, t0); length -= KBYTES; } while (length >= 8) { crc = __crc32cd(crc, *(uint64_t *)data); data += 8; length -= 8; } if (length & 4) { crc = __crc32cw(crc, *(uint32_t *)data); data += 4; } if (length & 2) { crc = __crc32ch(crc, *(uint16_t *)data); data += 2; } if (length & 1) { crc = __crc32cb(crc, *data); } return crc; } #endif ICRAR-crc32c-6d3a422/src/crc32c/ext/crc32c_sw.c000066400000000000000000001005401467444355400204000ustar00rootroot00000000000000// Copyright 2008,2009,2010 Massachusetts Institute of Technology. // All rights reserved. Use of this source code is governed by a // BSD-style license that can be found in the LICENSE.slice-by-8 file. // Implementations adapted from Intel's Slicing By 8 Sourceforge Project // http://sourceforge.net/projects/slicing-by-8/ /* * Copyright (c) 2004-2006 Intel Corporation - All Rights Reserved * * * This software program is licensed subject to the BSD License, * available at http://www.opensource.org/licenses/bsd-license.html. * * Abstract: * * Tables for software CRC generation */ /* Tables generated with code like the following: #define CRCPOLY 0x82f63b78 // reversed 0x1EDC6F41 #define CRCINIT 0xFFFFFFFF void init() { for (uint32_t i = 0; i <= 0xFF; i++) { uint32_t x = i; for (uint32_t j = 0; j < 8; j++) x = (x>>1) ^ (CRCPOLY & (-(int32_t)(x & 1))); g_crc_slicing[0][i] = x; } for (uint32_t i = 0; i <= 0xFF; i++) { uint32_t c = g_crc_slicing[0][i]; for (uint32_t j = 1; j < 8; j++) { c = g_crc_slicing[0][c & 0xFF] ^ (c >> 8); g_crc_slicing[j][i] = c; } } } */ #include "crc32c.h" /* * The following CRC lookup table was generated automagically * using the following model parameters: * * Generator Polynomial = ................. 0x1EDC6F41 * Generator Polynomial Length = .......... 32 bits * Reflected Bits = ....................... TRUE * Table Generation Offset = .............. 32 bits * Number of Slices = ..................... 8 slices * Slice Lengths = ........................ 8 8 8 8 8 8 8 8 * Directory Name = ....................... .\ * File Name = ............................ 8x256_tables.c */ const uint32_t crc_tableil8_o32[256] = { 0x00000000, 0xF26B8303, 0xE13B70F7, 0x1350F3F4, 0xC79A971F, 0x35F1141C, 0x26A1E7E8, 0xD4CA64EB, 0x8AD958CF, 0x78B2DBCC, 0x6BE22838, 0x9989AB3B, 0x4D43CFD0, 0xBF284CD3, 0xAC78BF27, 0x5E133C24, 0x105EC76F, 0xE235446C, 0xF165B798, 0x030E349B, 0xD7C45070, 0x25AFD373, 0x36FF2087, 0xC494A384, 0x9A879FA0, 0x68EC1CA3, 0x7BBCEF57, 0x89D76C54, 0x5D1D08BF, 0xAF768BBC, 0xBC267848, 0x4E4DFB4B, 0x20BD8EDE, 0xD2D60DDD, 0xC186FE29, 0x33ED7D2A, 0xE72719C1, 0x154C9AC2, 0x061C6936, 0xF477EA35, 0xAA64D611, 0x580F5512, 0x4B5FA6E6, 0xB93425E5, 0x6DFE410E, 0x9F95C20D, 0x8CC531F9, 0x7EAEB2FA, 0x30E349B1, 0xC288CAB2, 0xD1D83946, 0x23B3BA45, 0xF779DEAE, 0x05125DAD, 0x1642AE59, 0xE4292D5A, 0xBA3A117E, 0x4851927D, 0x5B016189, 0xA96AE28A, 0x7DA08661, 0x8FCB0562, 0x9C9BF696, 0x6EF07595, 0x417B1DBC, 0xB3109EBF, 0xA0406D4B, 0x522BEE48, 0x86E18AA3, 0x748A09A0, 0x67DAFA54, 0x95B17957, 0xCBA24573, 0x39C9C670, 0x2A993584, 0xD8F2B687, 0x0C38D26C, 0xFE53516F, 0xED03A29B, 0x1F682198, 0x5125DAD3, 0xA34E59D0, 0xB01EAA24, 0x42752927, 0x96BF4DCC, 0x64D4CECF, 0x77843D3B, 0x85EFBE38, 0xDBFC821C, 0x2997011F, 0x3AC7F2EB, 0xC8AC71E8, 0x1C661503, 0xEE0D9600, 0xFD5D65F4, 0x0F36E6F7, 0x61C69362, 0x93AD1061, 0x80FDE395, 0x72966096, 0xA65C047D, 0x5437877E, 0x4767748A, 0xB50CF789, 0xEB1FCBAD, 0x197448AE, 0x0A24BB5A, 0xF84F3859, 0x2C855CB2, 0xDEEEDFB1, 0xCDBE2C45, 0x3FD5AF46, 0x7198540D, 0x83F3D70E, 0x90A324FA, 0x62C8A7F9, 0xB602C312, 0x44694011, 0x5739B3E5, 0xA55230E6, 0xFB410CC2, 0x092A8FC1, 0x1A7A7C35, 0xE811FF36, 0x3CDB9BDD, 0xCEB018DE, 0xDDE0EB2A, 0x2F8B6829, 0x82F63B78, 0x709DB87B, 0x63CD4B8F, 0x91A6C88C, 0x456CAC67, 0xB7072F64, 0xA457DC90, 0x563C5F93, 0x082F63B7, 0xFA44E0B4, 0xE9141340, 0x1B7F9043, 0xCFB5F4A8, 0x3DDE77AB, 0x2E8E845F, 0xDCE5075C, 0x92A8FC17, 0x60C37F14, 0x73938CE0, 0x81F80FE3, 0x55326B08, 0xA759E80B, 0xB4091BFF, 0x466298FC, 0x1871A4D8, 0xEA1A27DB, 0xF94AD42F, 0x0B21572C, 0xDFEB33C7, 0x2D80B0C4, 0x3ED04330, 0xCCBBC033, 0xA24BB5A6, 0x502036A5, 0x4370C551, 0xB11B4652, 0x65D122B9, 0x97BAA1BA, 0x84EA524E, 0x7681D14D, 0x2892ED69, 0xDAF96E6A, 0xC9A99D9E, 0x3BC21E9D, 0xEF087A76, 0x1D63F975, 0x0E330A81, 0xFC588982, 0xB21572C9, 0x407EF1CA, 0x532E023E, 0xA145813D, 0x758FE5D6, 0x87E466D5, 0x94B49521, 0x66DF1622, 0x38CC2A06, 0xCAA7A905, 0xD9F75AF1, 0x2B9CD9F2, 0xFF56BD19, 0x0D3D3E1A, 0x1E6DCDEE, 0xEC064EED, 0xC38D26C4, 0x31E6A5C7, 0x22B65633, 0xD0DDD530, 0x0417B1DB, 0xF67C32D8, 0xE52CC12C, 0x1747422F, 0x49547E0B, 0xBB3FFD08, 0xA86F0EFC, 0x5A048DFF, 0x8ECEE914, 0x7CA56A17, 0x6FF599E3, 0x9D9E1AE0, 0xD3D3E1AB, 0x21B862A8, 0x32E8915C, 0xC083125F, 0x144976B4, 0xE622F5B7, 0xF5720643, 0x07198540, 0x590AB964, 0xAB613A67, 0xB831C993, 0x4A5A4A90, 0x9E902E7B, 0x6CFBAD78, 0x7FAB5E8C, 0x8DC0DD8F, 0xE330A81A, 0x115B2B19, 0x020BD8ED, 0xF0605BEE, 0x24AA3F05, 0xD6C1BC06, 0xC5914FF2, 0x37FACCF1, 0x69E9F0D5, 0x9B8273D6, 0x88D28022, 0x7AB90321, 0xAE7367CA, 0x5C18E4C9, 0x4F48173D, 0xBD23943E, 0xF36E6F75, 0x0105EC76, 0x12551F82, 0xE03E9C81, 0x34F4F86A, 0xC69F7B69, 0xD5CF889D, 0x27A40B9E, 0x79B737BA, 0x8BDCB4B9, 0x988C474D, 0x6AE7C44E, 0xBE2DA0A5, 0x4C4623A6, 0x5F16D052, 0xAD7D5351 }; /* * end of the CRC lookup table crc_tableil8_o32 */ /* * The following CRC lookup table was generated automagically * using the following model parameters: * * Generator Polynomial = ................. 0x1EDC6F41 * Generator Polynomial Length = .......... 32 bits * Reflected Bits = ....................... TRUE * Table Generation Offset = .............. 32 bits * Number of Slices = ..................... 8 slices * Slice Lengths = ........................ 8 8 8 8 8 8 8 8 * Directory Name = ....................... .\ * File Name = ............................ 8x256_tables.c */ const uint32_t crc_tableil8_o40[256] = { 0x00000000, 0x13A29877, 0x274530EE, 0x34E7A899, 0x4E8A61DC, 0x5D28F9AB, 0x69CF5132, 0x7A6DC945, 0x9D14C3B8, 0x8EB65BCF, 0xBA51F356, 0xA9F36B21, 0xD39EA264, 0xC03C3A13, 0xF4DB928A, 0xE7790AFD, 0x3FC5F181, 0x2C6769F6, 0x1880C16F, 0x0B225918, 0x714F905D, 0x62ED082A, 0x560AA0B3, 0x45A838C4, 0xA2D13239, 0xB173AA4E, 0x859402D7, 0x96369AA0, 0xEC5B53E5, 0xFFF9CB92, 0xCB1E630B, 0xD8BCFB7C, 0x7F8BE302, 0x6C297B75, 0x58CED3EC, 0x4B6C4B9B, 0x310182DE, 0x22A31AA9, 0x1644B230, 0x05E62A47, 0xE29F20BA, 0xF13DB8CD, 0xC5DA1054, 0xD6788823, 0xAC154166, 0xBFB7D911, 0x8B507188, 0x98F2E9FF, 0x404E1283, 0x53EC8AF4, 0x670B226D, 0x74A9BA1A, 0x0EC4735F, 0x1D66EB28, 0x298143B1, 0x3A23DBC6, 0xDD5AD13B, 0xCEF8494C, 0xFA1FE1D5, 0xE9BD79A2, 0x93D0B0E7, 0x80722890, 0xB4958009, 0xA737187E, 0xFF17C604, 0xECB55E73, 0xD852F6EA, 0xCBF06E9D, 0xB19DA7D8, 0xA23F3FAF, 0x96D89736, 0x857A0F41, 0x620305BC, 0x71A19DCB, 0x45463552, 0x56E4AD25, 0x2C896460, 0x3F2BFC17, 0x0BCC548E, 0x186ECCF9, 0xC0D23785, 0xD370AFF2, 0xE797076B, 0xF4359F1C, 0x8E585659, 0x9DFACE2E, 0xA91D66B7, 0xBABFFEC0, 0x5DC6F43D, 0x4E646C4A, 0x7A83C4D3, 0x69215CA4, 0x134C95E1, 0x00EE0D96, 0x3409A50F, 0x27AB3D78, 0x809C2506, 0x933EBD71, 0xA7D915E8, 0xB47B8D9F, 0xCE1644DA, 0xDDB4DCAD, 0xE9537434, 0xFAF1EC43, 0x1D88E6BE, 0x0E2A7EC9, 0x3ACDD650, 0x296F4E27, 0x53028762, 0x40A01F15, 0x7447B78C, 0x67E52FFB, 0xBF59D487, 0xACFB4CF0, 0x981CE469, 0x8BBE7C1E, 0xF1D3B55B, 0xE2712D2C, 0xD69685B5, 0xC5341DC2, 0x224D173F, 0x31EF8F48, 0x050827D1, 0x16AABFA6, 0x6CC776E3, 0x7F65EE94, 0x4B82460D, 0x5820DE7A, 0xFBC3FAF9, 0xE861628E, 0xDC86CA17, 0xCF245260, 0xB5499B25, 0xA6EB0352, 0x920CABCB, 0x81AE33BC, 0x66D73941, 0x7575A136, 0x419209AF, 0x523091D8, 0x285D589D, 0x3BFFC0EA, 0x0F186873, 0x1CBAF004, 0xC4060B78, 0xD7A4930F, 0xE3433B96, 0xF0E1A3E1, 0x8A8C6AA4, 0x992EF2D3, 0xADC95A4A, 0xBE6BC23D, 0x5912C8C0, 0x4AB050B7, 0x7E57F82E, 0x6DF56059, 0x1798A91C, 0x043A316B, 0x30DD99F2, 0x237F0185, 0x844819FB, 0x97EA818C, 0xA30D2915, 0xB0AFB162, 0xCAC27827, 0xD960E050, 0xED8748C9, 0xFE25D0BE, 0x195CDA43, 0x0AFE4234, 0x3E19EAAD, 0x2DBB72DA, 0x57D6BB9F, 0x447423E8, 0x70938B71, 0x63311306, 0xBB8DE87A, 0xA82F700D, 0x9CC8D894, 0x8F6A40E3, 0xF50789A6, 0xE6A511D1, 0xD242B948, 0xC1E0213F, 0x26992BC2, 0x353BB3B5, 0x01DC1B2C, 0x127E835B, 0x68134A1E, 0x7BB1D269, 0x4F567AF0, 0x5CF4E287, 0x04D43CFD, 0x1776A48A, 0x23910C13, 0x30339464, 0x4A5E5D21, 0x59FCC556, 0x6D1B6DCF, 0x7EB9F5B8, 0x99C0FF45, 0x8A626732, 0xBE85CFAB, 0xAD2757DC, 0xD74A9E99, 0xC4E806EE, 0xF00FAE77, 0xE3AD3600, 0x3B11CD7C, 0x28B3550B, 0x1C54FD92, 0x0FF665E5, 0x759BACA0, 0x663934D7, 0x52DE9C4E, 0x417C0439, 0xA6050EC4, 0xB5A796B3, 0x81403E2A, 0x92E2A65D, 0xE88F6F18, 0xFB2DF76F, 0xCFCA5FF6, 0xDC68C781, 0x7B5FDFFF, 0x68FD4788, 0x5C1AEF11, 0x4FB87766, 0x35D5BE23, 0x26772654, 0x12908ECD, 0x013216BA, 0xE64B1C47, 0xF5E98430, 0xC10E2CA9, 0xD2ACB4DE, 0xA8C17D9B, 0xBB63E5EC, 0x8F844D75, 0x9C26D502, 0x449A2E7E, 0x5738B609, 0x63DF1E90, 0x707D86E7, 0x0A104FA2, 0x19B2D7D5, 0x2D557F4C, 0x3EF7E73B, 0xD98EEDC6, 0xCA2C75B1, 0xFECBDD28, 0xED69455F, 0x97048C1A, 0x84A6146D, 0xB041BCF4, 0xA3E32483 }; /* * end of the CRC lookup table crc_tableil8_o40 */ /* * The following CRC lookup table was generated automagically * using the following model parameters: * * Generator Polynomial = ................. 0x1EDC6F41 * Generator Polynomial Length = .......... 32 bits * Reflected Bits = ....................... TRUE * Table Generation Offset = .............. 32 bits * Number of Slices = ..................... 8 slices * Slice Lengths = ........................ 8 8 8 8 8 8 8 8 * Directory Name = ....................... .\ * File Name = ............................ 8x256_tables.c */ const uint32_t crc_tableil8_o48[256] = { 0x00000000, 0xA541927E, 0x4F6F520D, 0xEA2EC073, 0x9EDEA41A, 0x3B9F3664, 0xD1B1F617, 0x74F06469, 0x38513EC5, 0x9D10ACBB, 0x773E6CC8, 0xD27FFEB6, 0xA68F9ADF, 0x03CE08A1, 0xE9E0C8D2, 0x4CA15AAC, 0x70A27D8A, 0xD5E3EFF4, 0x3FCD2F87, 0x9A8CBDF9, 0xEE7CD990, 0x4B3D4BEE, 0xA1138B9D, 0x045219E3, 0x48F3434F, 0xEDB2D131, 0x079C1142, 0xA2DD833C, 0xD62DE755, 0x736C752B, 0x9942B558, 0x3C032726, 0xE144FB14, 0x4405696A, 0xAE2BA919, 0x0B6A3B67, 0x7F9A5F0E, 0xDADBCD70, 0x30F50D03, 0x95B49F7D, 0xD915C5D1, 0x7C5457AF, 0x967A97DC, 0x333B05A2, 0x47CB61CB, 0xE28AF3B5, 0x08A433C6, 0xADE5A1B8, 0x91E6869E, 0x34A714E0, 0xDE89D493, 0x7BC846ED, 0x0F382284, 0xAA79B0FA, 0x40577089, 0xE516E2F7, 0xA9B7B85B, 0x0CF62A25, 0xE6D8EA56, 0x43997828, 0x37691C41, 0x92288E3F, 0x78064E4C, 0xDD47DC32, 0xC76580D9, 0x622412A7, 0x880AD2D4, 0x2D4B40AA, 0x59BB24C3, 0xFCFAB6BD, 0x16D476CE, 0xB395E4B0, 0xFF34BE1C, 0x5A752C62, 0xB05BEC11, 0x151A7E6F, 0x61EA1A06, 0xC4AB8878, 0x2E85480B, 0x8BC4DA75, 0xB7C7FD53, 0x12866F2D, 0xF8A8AF5E, 0x5DE93D20, 0x29195949, 0x8C58CB37, 0x66760B44, 0xC337993A, 0x8F96C396, 0x2AD751E8, 0xC0F9919B, 0x65B803E5, 0x1148678C, 0xB409F5F2, 0x5E273581, 0xFB66A7FF, 0x26217BCD, 0x8360E9B3, 0x694E29C0, 0xCC0FBBBE, 0xB8FFDFD7, 0x1DBE4DA9, 0xF7908DDA, 0x52D11FA4, 0x1E704508, 0xBB31D776, 0x511F1705, 0xF45E857B, 0x80AEE112, 0x25EF736C, 0xCFC1B31F, 0x6A802161, 0x56830647, 0xF3C29439, 0x19EC544A, 0xBCADC634, 0xC85DA25D, 0x6D1C3023, 0x8732F050, 0x2273622E, 0x6ED23882, 0xCB93AAFC, 0x21BD6A8F, 0x84FCF8F1, 0xF00C9C98, 0x554D0EE6, 0xBF63CE95, 0x1A225CEB, 0x8B277743, 0x2E66E53D, 0xC448254E, 0x6109B730, 0x15F9D359, 0xB0B84127, 0x5A968154, 0xFFD7132A, 0xB3764986, 0x1637DBF8, 0xFC191B8B, 0x595889F5, 0x2DA8ED9C, 0x88E97FE2, 0x62C7BF91, 0xC7862DEF, 0xFB850AC9, 0x5EC498B7, 0xB4EA58C4, 0x11ABCABA, 0x655BAED3, 0xC01A3CAD, 0x2A34FCDE, 0x8F756EA0, 0xC3D4340C, 0x6695A672, 0x8CBB6601, 0x29FAF47F, 0x5D0A9016, 0xF84B0268, 0x1265C21B, 0xB7245065, 0x6A638C57, 0xCF221E29, 0x250CDE5A, 0x804D4C24, 0xF4BD284D, 0x51FCBA33, 0xBBD27A40, 0x1E93E83E, 0x5232B292, 0xF77320EC, 0x1D5DE09F, 0xB81C72E1, 0xCCEC1688, 0x69AD84F6, 0x83834485, 0x26C2D6FB, 0x1AC1F1DD, 0xBF8063A3, 0x55AEA3D0, 0xF0EF31AE, 0x841F55C7, 0x215EC7B9, 0xCB7007CA, 0x6E3195B4, 0x2290CF18, 0x87D15D66, 0x6DFF9D15, 0xC8BE0F6B, 0xBC4E6B02, 0x190FF97C, 0xF321390F, 0x5660AB71, 0x4C42F79A, 0xE90365E4, 0x032DA597, 0xA66C37E9, 0xD29C5380, 0x77DDC1FE, 0x9DF3018D, 0x38B293F3, 0x7413C95F, 0xD1525B21, 0x3B7C9B52, 0x9E3D092C, 0xEACD6D45, 0x4F8CFF3B, 0xA5A23F48, 0x00E3AD36, 0x3CE08A10, 0x99A1186E, 0x738FD81D, 0xD6CE4A63, 0xA23E2E0A, 0x077FBC74, 0xED517C07, 0x4810EE79, 0x04B1B4D5, 0xA1F026AB, 0x4BDEE6D8, 0xEE9F74A6, 0x9A6F10CF, 0x3F2E82B1, 0xD50042C2, 0x7041D0BC, 0xAD060C8E, 0x08479EF0, 0xE2695E83, 0x4728CCFD, 0x33D8A894, 0x96993AEA, 0x7CB7FA99, 0xD9F668E7, 0x9557324B, 0x3016A035, 0xDA386046, 0x7F79F238, 0x0B899651, 0xAEC8042F, 0x44E6C45C, 0xE1A75622, 0xDDA47104, 0x78E5E37A, 0x92CB2309, 0x378AB177, 0x437AD51E, 0xE63B4760, 0x0C158713, 0xA954156D, 0xE5F54FC1, 0x40B4DDBF, 0xAA9A1DCC, 0x0FDB8FB2, 0x7B2BEBDB, 0xDE6A79A5, 0x3444B9D6, 0x91052BA8 }; /* * end of the CRC lookup table crc_tableil8_o48 */ /* * The following CRC lookup table was generated automagically * using the following model parameters: * * Generator Polynomial = ................. 0x1EDC6F41 * Generator Polynomial Length = .......... 32 bits * Reflected Bits = ....................... TRUE * Table Generation Offset = .............. 32 bits * Number of Slices = ..................... 8 slices * Slice Lengths = ........................ 8 8 8 8 8 8 8 8 * Directory Name = ....................... .\ * File Name = ............................ 8x256_tables.c */ const uint32_t crc_tableil8_o56[256] = { 0x00000000, 0xDD45AAB8, 0xBF672381, 0x62228939, 0x7B2231F3, 0xA6679B4B, 0xC4451272, 0x1900B8CA, 0xF64463E6, 0x2B01C95E, 0x49234067, 0x9466EADF, 0x8D665215, 0x5023F8AD, 0x32017194, 0xEF44DB2C, 0xE964B13D, 0x34211B85, 0x560392BC, 0x8B463804, 0x924680CE, 0x4F032A76, 0x2D21A34F, 0xF06409F7, 0x1F20D2DB, 0xC2657863, 0xA047F15A, 0x7D025BE2, 0x6402E328, 0xB9474990, 0xDB65C0A9, 0x06206A11, 0xD725148B, 0x0A60BE33, 0x6842370A, 0xB5079DB2, 0xAC072578, 0x71428FC0, 0x136006F9, 0xCE25AC41, 0x2161776D, 0xFC24DDD5, 0x9E0654EC, 0x4343FE54, 0x5A43469E, 0x8706EC26, 0xE524651F, 0x3861CFA7, 0x3E41A5B6, 0xE3040F0E, 0x81268637, 0x5C632C8F, 0x45639445, 0x98263EFD, 0xFA04B7C4, 0x27411D7C, 0xC805C650, 0x15406CE8, 0x7762E5D1, 0xAA274F69, 0xB327F7A3, 0x6E625D1B, 0x0C40D422, 0xD1057E9A, 0xABA65FE7, 0x76E3F55F, 0x14C17C66, 0xC984D6DE, 0xD0846E14, 0x0DC1C4AC, 0x6FE34D95, 0xB2A6E72D, 0x5DE23C01, 0x80A796B9, 0xE2851F80, 0x3FC0B538, 0x26C00DF2, 0xFB85A74A, 0x99A72E73, 0x44E284CB, 0x42C2EEDA, 0x9F874462, 0xFDA5CD5B, 0x20E067E3, 0x39E0DF29, 0xE4A57591, 0x8687FCA8, 0x5BC25610, 0xB4868D3C, 0x69C32784, 0x0BE1AEBD, 0xD6A40405, 0xCFA4BCCF, 0x12E11677, 0x70C39F4E, 0xAD8635F6, 0x7C834B6C, 0xA1C6E1D4, 0xC3E468ED, 0x1EA1C255, 0x07A17A9F, 0xDAE4D027, 0xB8C6591E, 0x6583F3A6, 0x8AC7288A, 0x57828232, 0x35A00B0B, 0xE8E5A1B3, 0xF1E51979, 0x2CA0B3C1, 0x4E823AF8, 0x93C79040, 0x95E7FA51, 0x48A250E9, 0x2A80D9D0, 0xF7C57368, 0xEEC5CBA2, 0x3380611A, 0x51A2E823, 0x8CE7429B, 0x63A399B7, 0xBEE6330F, 0xDCC4BA36, 0x0181108E, 0x1881A844, 0xC5C402FC, 0xA7E68BC5, 0x7AA3217D, 0x52A0C93F, 0x8FE56387, 0xEDC7EABE, 0x30824006, 0x2982F8CC, 0xF4C75274, 0x96E5DB4D, 0x4BA071F5, 0xA4E4AAD9, 0x79A10061, 0x1B838958, 0xC6C623E0, 0xDFC69B2A, 0x02833192, 0x60A1B8AB, 0xBDE41213, 0xBBC47802, 0x6681D2BA, 0x04A35B83, 0xD9E6F13B, 0xC0E649F1, 0x1DA3E349, 0x7F816A70, 0xA2C4C0C8, 0x4D801BE4, 0x90C5B15C, 0xF2E73865, 0x2FA292DD, 0x36A22A17, 0xEBE780AF, 0x89C50996, 0x5480A32E, 0x8585DDB4, 0x58C0770C, 0x3AE2FE35, 0xE7A7548D, 0xFEA7EC47, 0x23E246FF, 0x41C0CFC6, 0x9C85657E, 0x73C1BE52, 0xAE8414EA, 0xCCA69DD3, 0x11E3376B, 0x08E38FA1, 0xD5A62519, 0xB784AC20, 0x6AC10698, 0x6CE16C89, 0xB1A4C631, 0xD3864F08, 0x0EC3E5B0, 0x17C35D7A, 0xCA86F7C2, 0xA8A47EFB, 0x75E1D443, 0x9AA50F6F, 0x47E0A5D7, 0x25C22CEE, 0xF8878656, 0xE1873E9C, 0x3CC29424, 0x5EE01D1D, 0x83A5B7A5, 0xF90696D8, 0x24433C60, 0x4661B559, 0x9B241FE1, 0x8224A72B, 0x5F610D93, 0x3D4384AA, 0xE0062E12, 0x0F42F53E, 0xD2075F86, 0xB025D6BF, 0x6D607C07, 0x7460C4CD, 0xA9256E75, 0xCB07E74C, 0x16424DF4, 0x106227E5, 0xCD278D5D, 0xAF050464, 0x7240AEDC, 0x6B401616, 0xB605BCAE, 0xD4273597, 0x09629F2F, 0xE6264403, 0x3B63EEBB, 0x59416782, 0x8404CD3A, 0x9D0475F0, 0x4041DF48, 0x22635671, 0xFF26FCC9, 0x2E238253, 0xF36628EB, 0x9144A1D2, 0x4C010B6A, 0x5501B3A0, 0x88441918, 0xEA669021, 0x37233A99, 0xD867E1B5, 0x05224B0D, 0x6700C234, 0xBA45688C, 0xA345D046, 0x7E007AFE, 0x1C22F3C7, 0xC167597F, 0xC747336E, 0x1A0299D6, 0x782010EF, 0xA565BA57, 0xBC65029D, 0x6120A825, 0x0302211C, 0xDE478BA4, 0x31035088, 0xEC46FA30, 0x8E647309, 0x5321D9B1, 0x4A21617B, 0x9764CBC3, 0xF54642FA, 0x2803E842 }; /* * end of the CRC lookup table crc_tableil8_o56 */ /* * The following CRC lookup table was generated automagically * using the following model parameters: * * Generator Polynomial = ................. 0x1EDC6F41 * Generator Polynomial Length = .......... 32 bits * Reflected Bits = ....................... TRUE * Table Generation Offset = .............. 32 bits * Number of Slices = ..................... 8 slices * Slice Lengths = ........................ 8 8 8 8 8 8 8 8 * Directory Name = ....................... .\ * File Name = ............................ 8x256_tables.c */ const uint32_t crc_tableil8_o64[256] = { 0x00000000, 0x38116FAC, 0x7022DF58, 0x4833B0F4, 0xE045BEB0, 0xD854D11C, 0x906761E8, 0xA8760E44, 0xC5670B91, 0xFD76643D, 0xB545D4C9, 0x8D54BB65, 0x2522B521, 0x1D33DA8D, 0x55006A79, 0x6D1105D5, 0x8F2261D3, 0xB7330E7F, 0xFF00BE8B, 0xC711D127, 0x6F67DF63, 0x5776B0CF, 0x1F45003B, 0x27546F97, 0x4A456A42, 0x725405EE, 0x3A67B51A, 0x0276DAB6, 0xAA00D4F2, 0x9211BB5E, 0xDA220BAA, 0xE2336406, 0x1BA8B557, 0x23B9DAFB, 0x6B8A6A0F, 0x539B05A3, 0xFBED0BE7, 0xC3FC644B, 0x8BCFD4BF, 0xB3DEBB13, 0xDECFBEC6, 0xE6DED16A, 0xAEED619E, 0x96FC0E32, 0x3E8A0076, 0x069B6FDA, 0x4EA8DF2E, 0x76B9B082, 0x948AD484, 0xAC9BBB28, 0xE4A80BDC, 0xDCB96470, 0x74CF6A34, 0x4CDE0598, 0x04EDB56C, 0x3CFCDAC0, 0x51EDDF15, 0x69FCB0B9, 0x21CF004D, 0x19DE6FE1, 0xB1A861A5, 0x89B90E09, 0xC18ABEFD, 0xF99BD151, 0x37516AAE, 0x0F400502, 0x4773B5F6, 0x7F62DA5A, 0xD714D41E, 0xEF05BBB2, 0xA7360B46, 0x9F2764EA, 0xF236613F, 0xCA270E93, 0x8214BE67, 0xBA05D1CB, 0x1273DF8F, 0x2A62B023, 0x625100D7, 0x5A406F7B, 0xB8730B7D, 0x806264D1, 0xC851D425, 0xF040BB89, 0x5836B5CD, 0x6027DA61, 0x28146A95, 0x10050539, 0x7D1400EC, 0x45056F40, 0x0D36DFB4, 0x3527B018, 0x9D51BE5C, 0xA540D1F0, 0xED736104, 0xD5620EA8, 0x2CF9DFF9, 0x14E8B055, 0x5CDB00A1, 0x64CA6F0D, 0xCCBC6149, 0xF4AD0EE5, 0xBC9EBE11, 0x848FD1BD, 0xE99ED468, 0xD18FBBC4, 0x99BC0B30, 0xA1AD649C, 0x09DB6AD8, 0x31CA0574, 0x79F9B580, 0x41E8DA2C, 0xA3DBBE2A, 0x9BCAD186, 0xD3F96172, 0xEBE80EDE, 0x439E009A, 0x7B8F6F36, 0x33BCDFC2, 0x0BADB06E, 0x66BCB5BB, 0x5EADDA17, 0x169E6AE3, 0x2E8F054F, 0x86F90B0B, 0xBEE864A7, 0xF6DBD453, 0xCECABBFF, 0x6EA2D55C, 0x56B3BAF0, 0x1E800A04, 0x269165A8, 0x8EE76BEC, 0xB6F60440, 0xFEC5B4B4, 0xC6D4DB18, 0xABC5DECD, 0x93D4B161, 0xDBE70195, 0xE3F66E39, 0x4B80607D, 0x73910FD1, 0x3BA2BF25, 0x03B3D089, 0xE180B48F, 0xD991DB23, 0x91A26BD7, 0xA9B3047B, 0x01C50A3F, 0x39D46593, 0x71E7D567, 0x49F6BACB, 0x24E7BF1E, 0x1CF6D0B2, 0x54C56046, 0x6CD40FEA, 0xC4A201AE, 0xFCB36E02, 0xB480DEF6, 0x8C91B15A, 0x750A600B, 0x4D1B0FA7, 0x0528BF53, 0x3D39D0FF, 0x954FDEBB, 0xAD5EB117, 0xE56D01E3, 0xDD7C6E4F, 0xB06D6B9A, 0x887C0436, 0xC04FB4C2, 0xF85EDB6E, 0x5028D52A, 0x6839BA86, 0x200A0A72, 0x181B65DE, 0xFA2801D8, 0xC2396E74, 0x8A0ADE80, 0xB21BB12C, 0x1A6DBF68, 0x227CD0C4, 0x6A4F6030, 0x525E0F9C, 0x3F4F0A49, 0x075E65E5, 0x4F6DD511, 0x777CBABD, 0xDF0AB4F9, 0xE71BDB55, 0xAF286BA1, 0x9739040D, 0x59F3BFF2, 0x61E2D05E, 0x29D160AA, 0x11C00F06, 0xB9B60142, 0x81A76EEE, 0xC994DE1A, 0xF185B1B6, 0x9C94B463, 0xA485DBCF, 0xECB66B3B, 0xD4A70497, 0x7CD10AD3, 0x44C0657F, 0x0CF3D58B, 0x34E2BA27, 0xD6D1DE21, 0xEEC0B18D, 0xA6F30179, 0x9EE26ED5, 0x36946091, 0x0E850F3D, 0x46B6BFC9, 0x7EA7D065, 0x13B6D5B0, 0x2BA7BA1C, 0x63940AE8, 0x5B856544, 0xF3F36B00, 0xCBE204AC, 0x83D1B458, 0xBBC0DBF4, 0x425B0AA5, 0x7A4A6509, 0x3279D5FD, 0x0A68BA51, 0xA21EB415, 0x9A0FDBB9, 0xD23C6B4D, 0xEA2D04E1, 0x873C0134, 0xBF2D6E98, 0xF71EDE6C, 0xCF0FB1C0, 0x6779BF84, 0x5F68D028, 0x175B60DC, 0x2F4A0F70, 0xCD796B76, 0xF56804DA, 0xBD5BB42E, 0x854ADB82, 0x2D3CD5C6, 0x152DBA6A, 0x5D1E0A9E, 0x650F6532, 0x081E60E7, 0x300F0F4B, 0x783CBFBF, 0x402DD013, 0xE85BDE57, 0xD04AB1FB, 0x9879010F, 0xA0686EA3 }; /* * end of the CRC lookup table crc_tableil8_o64 */ /* * The following CRC lookup table was generated automagically * using the following model parameters: * * Generator Polynomial = ................. 0x1EDC6F41 * Generator Polynomial Length = .......... 32 bits * Reflected Bits = ....................... TRUE * Table Generation Offset = .............. 32 bits * Number of Slices = ..................... 8 slices * Slice Lengths = ........................ 8 8 8 8 8 8 8 8 * Directory Name = ....................... .\ * File Name = ............................ 8x256_tables.c */ const uint32_t crc_tableil8_o72[256] = { 0x00000000, 0xEF306B19, 0xDB8CA0C3, 0x34BCCBDA, 0xB2F53777, 0x5DC55C6E, 0x697997B4, 0x8649FCAD, 0x6006181F, 0x8F367306, 0xBB8AB8DC, 0x54BAD3C5, 0xD2F32F68, 0x3DC34471, 0x097F8FAB, 0xE64FE4B2, 0xC00C303E, 0x2F3C5B27, 0x1B8090FD, 0xF4B0FBE4, 0x72F90749, 0x9DC96C50, 0xA975A78A, 0x4645CC93, 0xA00A2821, 0x4F3A4338, 0x7B8688E2, 0x94B6E3FB, 0x12FF1F56, 0xFDCF744F, 0xC973BF95, 0x2643D48C, 0x85F4168D, 0x6AC47D94, 0x5E78B64E, 0xB148DD57, 0x370121FA, 0xD8314AE3, 0xEC8D8139, 0x03BDEA20, 0xE5F20E92, 0x0AC2658B, 0x3E7EAE51, 0xD14EC548, 0x570739E5, 0xB83752FC, 0x8C8B9926, 0x63BBF23F, 0x45F826B3, 0xAAC84DAA, 0x9E748670, 0x7144ED69, 0xF70D11C4, 0x183D7ADD, 0x2C81B107, 0xC3B1DA1E, 0x25FE3EAC, 0xCACE55B5, 0xFE729E6F, 0x1142F576, 0x970B09DB, 0x783B62C2, 0x4C87A918, 0xA3B7C201, 0x0E045BEB, 0xE13430F2, 0xD588FB28, 0x3AB89031, 0xBCF16C9C, 0x53C10785, 0x677DCC5F, 0x884DA746, 0x6E0243F4, 0x813228ED, 0xB58EE337, 0x5ABE882E, 0xDCF77483, 0x33C71F9A, 0x077BD440, 0xE84BBF59, 0xCE086BD5, 0x213800CC, 0x1584CB16, 0xFAB4A00F, 0x7CFD5CA2, 0x93CD37BB, 0xA771FC61, 0x48419778, 0xAE0E73CA, 0x413E18D3, 0x7582D309, 0x9AB2B810, 0x1CFB44BD, 0xF3CB2FA4, 0xC777E47E, 0x28478F67, 0x8BF04D66, 0x64C0267F, 0x507CEDA5, 0xBF4C86BC, 0x39057A11, 0xD6351108, 0xE289DAD2, 0x0DB9B1CB, 0xEBF65579, 0x04C63E60, 0x307AF5BA, 0xDF4A9EA3, 0x5903620E, 0xB6330917, 0x828FC2CD, 0x6DBFA9D4, 0x4BFC7D58, 0xA4CC1641, 0x9070DD9B, 0x7F40B682, 0xF9094A2F, 0x16392136, 0x2285EAEC, 0xCDB581F5, 0x2BFA6547, 0xC4CA0E5E, 0xF076C584, 0x1F46AE9D, 0x990F5230, 0x763F3929, 0x4283F2F3, 0xADB399EA, 0x1C08B7D6, 0xF338DCCF, 0xC7841715, 0x28B47C0C, 0xAEFD80A1, 0x41CDEBB8, 0x75712062, 0x9A414B7B, 0x7C0EAFC9, 0x933EC4D0, 0xA7820F0A, 0x48B26413, 0xCEFB98BE, 0x21CBF3A7, 0x1577387D, 0xFA475364, 0xDC0487E8, 0x3334ECF1, 0x0788272B, 0xE8B84C32, 0x6EF1B09F, 0x81C1DB86, 0xB57D105C, 0x5A4D7B45, 0xBC029FF7, 0x5332F4EE, 0x678E3F34, 0x88BE542D, 0x0EF7A880, 0xE1C7C399, 0xD57B0843, 0x3A4B635A, 0x99FCA15B, 0x76CCCA42, 0x42700198, 0xAD406A81, 0x2B09962C, 0xC439FD35, 0xF08536EF, 0x1FB55DF6, 0xF9FAB944, 0x16CAD25D, 0x22761987, 0xCD46729E, 0x4B0F8E33, 0xA43FE52A, 0x90832EF0, 0x7FB345E9, 0x59F09165, 0xB6C0FA7C, 0x827C31A6, 0x6D4C5ABF, 0xEB05A612, 0x0435CD0B, 0x308906D1, 0xDFB96DC8, 0x39F6897A, 0xD6C6E263, 0xE27A29B9, 0x0D4A42A0, 0x8B03BE0D, 0x6433D514, 0x508F1ECE, 0xBFBF75D7, 0x120CEC3D, 0xFD3C8724, 0xC9804CFE, 0x26B027E7, 0xA0F9DB4A, 0x4FC9B053, 0x7B757B89, 0x94451090, 0x720AF422, 0x9D3A9F3B, 0xA98654E1, 0x46B63FF8, 0xC0FFC355, 0x2FCFA84C, 0x1B736396, 0xF443088F, 0xD200DC03, 0x3D30B71A, 0x098C7CC0, 0xE6BC17D9, 0x60F5EB74, 0x8FC5806D, 0xBB794BB7, 0x544920AE, 0xB206C41C, 0x5D36AF05, 0x698A64DF, 0x86BA0FC6, 0x00F3F36B, 0xEFC39872, 0xDB7F53A8, 0x344F38B1, 0x97F8FAB0, 0x78C891A9, 0x4C745A73, 0xA344316A, 0x250DCDC7, 0xCA3DA6DE, 0xFE816D04, 0x11B1061D, 0xF7FEE2AF, 0x18CE89B6, 0x2C72426C, 0xC3422975, 0x450BD5D8, 0xAA3BBEC1, 0x9E87751B, 0x71B71E02, 0x57F4CA8E, 0xB8C4A197, 0x8C786A4D, 0x63480154, 0xE501FDF9, 0x0A3196E0, 0x3E8D5D3A, 0xD1BD3623, 0x37F2D291, 0xD8C2B988, 0xEC7E7252, 0x034E194B, 0x8507E5E6, 0x6A378EFF, 0x5E8B4525, 0xB1BB2E3C }; /* * end of the CRC lookup table crc_tableil8_o72 */ /* * The following CRC lookup table was generated automagically * using the following model parameters: * * Generator Polynomial = ................. 0x1EDC6F41 * Generator Polynomial Length = .......... 32 bits * Reflected Bits = ....................... TRUE * Table Generation Offset = .............. 32 bits * Number of Slices = ..................... 8 slices * Slice Lengths = ........................ 8 8 8 8 8 8 8 8 * Directory Name = ....................... .\ * File Name = ............................ 8x256_tables.c */ const uint32_t crc_tableil8_o80[256] = { 0x00000000, 0x68032CC8, 0xD0065990, 0xB8057558, 0xA5E0C5D1, 0xCDE3E919, 0x75E69C41, 0x1DE5B089, 0x4E2DFD53, 0x262ED19B, 0x9E2BA4C3, 0xF628880B, 0xEBCD3882, 0x83CE144A, 0x3BCB6112, 0x53C84DDA, 0x9C5BFAA6, 0xF458D66E, 0x4C5DA336, 0x245E8FFE, 0x39BB3F77, 0x51B813BF, 0xE9BD66E7, 0x81BE4A2F, 0xD27607F5, 0xBA752B3D, 0x02705E65, 0x6A7372AD, 0x7796C224, 0x1F95EEEC, 0xA7909BB4, 0xCF93B77C, 0x3D5B83BD, 0x5558AF75, 0xED5DDA2D, 0x855EF6E5, 0x98BB466C, 0xF0B86AA4, 0x48BD1FFC, 0x20BE3334, 0x73767EEE, 0x1B755226, 0xA370277E, 0xCB730BB6, 0xD696BB3F, 0xBE9597F7, 0x0690E2AF, 0x6E93CE67, 0xA100791B, 0xC90355D3, 0x7106208B, 0x19050C43, 0x04E0BCCA, 0x6CE39002, 0xD4E6E55A, 0xBCE5C992, 0xEF2D8448, 0x872EA880, 0x3F2BDDD8, 0x5728F110, 0x4ACD4199, 0x22CE6D51, 0x9ACB1809, 0xF2C834C1, 0x7AB7077A, 0x12B42BB2, 0xAAB15EEA, 0xC2B27222, 0xDF57C2AB, 0xB754EE63, 0x0F519B3B, 0x6752B7F3, 0x349AFA29, 0x5C99D6E1, 0xE49CA3B9, 0x8C9F8F71, 0x917A3FF8, 0xF9791330, 0x417C6668, 0x297F4AA0, 0xE6ECFDDC, 0x8EEFD114, 0x36EAA44C, 0x5EE98884, 0x430C380D, 0x2B0F14C5, 0x930A619D, 0xFB094D55, 0xA8C1008F, 0xC0C22C47, 0x78C7591F, 0x10C475D7, 0x0D21C55E, 0x6522E996, 0xDD279CCE, 0xB524B006, 0x47EC84C7, 0x2FEFA80F, 0x97EADD57, 0xFFE9F19F, 0xE20C4116, 0x8A0F6DDE, 0x320A1886, 0x5A09344E, 0x09C17994, 0x61C2555C, 0xD9C72004, 0xB1C40CCC, 0xAC21BC45, 0xC422908D, 0x7C27E5D5, 0x1424C91D, 0xDBB77E61, 0xB3B452A9, 0x0BB127F1, 0x63B20B39, 0x7E57BBB0, 0x16549778, 0xAE51E220, 0xC652CEE8, 0x959A8332, 0xFD99AFFA, 0x459CDAA2, 0x2D9FF66A, 0x307A46E3, 0x58796A2B, 0xE07C1F73, 0x887F33BB, 0xF56E0EF4, 0x9D6D223C, 0x25685764, 0x4D6B7BAC, 0x508ECB25, 0x388DE7ED, 0x808892B5, 0xE88BBE7D, 0xBB43F3A7, 0xD340DF6F, 0x6B45AA37, 0x034686FF, 0x1EA33676, 0x76A01ABE, 0xCEA56FE6, 0xA6A6432E, 0x6935F452, 0x0136D89A, 0xB933ADC2, 0xD130810A, 0xCCD53183, 0xA4D61D4B, 0x1CD36813, 0x74D044DB, 0x27180901, 0x4F1B25C9, 0xF71E5091, 0x9F1D7C59, 0x82F8CCD0, 0xEAFBE018, 0x52FE9540, 0x3AFDB988, 0xC8358D49, 0xA036A181, 0x1833D4D9, 0x7030F811, 0x6DD54898, 0x05D66450, 0xBDD31108, 0xD5D03DC0, 0x8618701A, 0xEE1B5CD2, 0x561E298A, 0x3E1D0542, 0x23F8B5CB, 0x4BFB9903, 0xF3FEEC5B, 0x9BFDC093, 0x546E77EF, 0x3C6D5B27, 0x84682E7F, 0xEC6B02B7, 0xF18EB23E, 0x998D9EF6, 0x2188EBAE, 0x498BC766, 0x1A438ABC, 0x7240A674, 0xCA45D32C, 0xA246FFE4, 0xBFA34F6D, 0xD7A063A5, 0x6FA516FD, 0x07A63A35, 0x8FD9098E, 0xE7DA2546, 0x5FDF501E, 0x37DC7CD6, 0x2A39CC5F, 0x423AE097, 0xFA3F95CF, 0x923CB907, 0xC1F4F4DD, 0xA9F7D815, 0x11F2AD4D, 0x79F18185, 0x6414310C, 0x0C171DC4, 0xB412689C, 0xDC114454, 0x1382F328, 0x7B81DFE0, 0xC384AAB8, 0xAB878670, 0xB66236F9, 0xDE611A31, 0x66646F69, 0x0E6743A1, 0x5DAF0E7B, 0x35AC22B3, 0x8DA957EB, 0xE5AA7B23, 0xF84FCBAA, 0x904CE762, 0x2849923A, 0x404ABEF2, 0xB2828A33, 0xDA81A6FB, 0x6284D3A3, 0x0A87FF6B, 0x17624FE2, 0x7F61632A, 0xC7641672, 0xAF673ABA, 0xFCAF7760, 0x94AC5BA8, 0x2CA92EF0, 0x44AA0238, 0x594FB2B1, 0x314C9E79, 0x8949EB21, 0xE14AC7E9, 0x2ED97095, 0x46DA5C5D, 0xFEDF2905, 0x96DC05CD, 0x8B39B544, 0xE33A998C, 0x5B3FECD4, 0x333CC01C, 0x60F48DC6, 0x08F7A10E, 0xB0F2D456, 0xD8F1F89E, 0xC5144817, 0xAD1764DF, 0x15121187, 0x7D113D4F }; /* * end of the CRC lookup table crc_tableil8_o80 */ /* * The following CRC lookup table was generated automagically * using the following model parameters: * * Generator Polynomial = ................. 0x1EDC6F41 * Generator Polynomial Length = .......... 32 bits * Reflected Bits = ....................... TRUE * Table Generation Offset = .............. 32 bits * Number of Slices = ..................... 8 slices * Slice Lengths = ........................ 8 8 8 8 8 8 8 8 * Directory Name = ....................... .\ * File Name = ............................ 8x256_tables.c */ const uint32_t crc_tableil8_o88[256] = { 0x00000000, 0x493C7D27, 0x9278FA4E, 0xDB448769, 0x211D826D, 0x6821FF4A, 0xB3657823, 0xFA590504, 0x423B04DA, 0x0B0779FD, 0xD043FE94, 0x997F83B3, 0x632686B7, 0x2A1AFB90, 0xF15E7CF9, 0xB86201DE, 0x847609B4, 0xCD4A7493, 0x160EF3FA, 0x5F328EDD, 0xA56B8BD9, 0xEC57F6FE, 0x37137197, 0x7E2F0CB0, 0xC64D0D6E, 0x8F717049, 0x5435F720, 0x1D098A07, 0xE7508F03, 0xAE6CF224, 0x7528754D, 0x3C14086A, 0x0D006599, 0x443C18BE, 0x9F789FD7, 0xD644E2F0, 0x2C1DE7F4, 0x65219AD3, 0xBE651DBA, 0xF759609D, 0x4F3B6143, 0x06071C64, 0xDD439B0D, 0x947FE62A, 0x6E26E32E, 0x271A9E09, 0xFC5E1960, 0xB5626447, 0x89766C2D, 0xC04A110A, 0x1B0E9663, 0x5232EB44, 0xA86BEE40, 0xE1579367, 0x3A13140E, 0x732F6929, 0xCB4D68F7, 0x827115D0, 0x593592B9, 0x1009EF9E, 0xEA50EA9A, 0xA36C97BD, 0x782810D4, 0x31146DF3, 0x1A00CB32, 0x533CB615, 0x8878317C, 0xC1444C5B, 0x3B1D495F, 0x72213478, 0xA965B311, 0xE059CE36, 0x583BCFE8, 0x1107B2CF, 0xCA4335A6, 0x837F4881, 0x79264D85, 0x301A30A2, 0xEB5EB7CB, 0xA262CAEC, 0x9E76C286, 0xD74ABFA1, 0x0C0E38C8, 0x453245EF, 0xBF6B40EB, 0xF6573DCC, 0x2D13BAA5, 0x642FC782, 0xDC4DC65C, 0x9571BB7B, 0x4E353C12, 0x07094135, 0xFD504431, 0xB46C3916, 0x6F28BE7F, 0x2614C358, 0x1700AEAB, 0x5E3CD38C, 0x857854E5, 0xCC4429C2, 0x361D2CC6, 0x7F2151E1, 0xA465D688, 0xED59ABAF, 0x553BAA71, 0x1C07D756, 0xC743503F, 0x8E7F2D18, 0x7426281C, 0x3D1A553B, 0xE65ED252, 0xAF62AF75, 0x9376A71F, 0xDA4ADA38, 0x010E5D51, 0x48322076, 0xB26B2572, 0xFB575855, 0x2013DF3C, 0x692FA21B, 0xD14DA3C5, 0x9871DEE2, 0x4335598B, 0x0A0924AC, 0xF05021A8, 0xB96C5C8F, 0x6228DBE6, 0x2B14A6C1, 0x34019664, 0x7D3DEB43, 0xA6796C2A, 0xEF45110D, 0x151C1409, 0x5C20692E, 0x8764EE47, 0xCE589360, 0x763A92BE, 0x3F06EF99, 0xE44268F0, 0xAD7E15D7, 0x572710D3, 0x1E1B6DF4, 0xC55FEA9D, 0x8C6397BA, 0xB0779FD0, 0xF94BE2F7, 0x220F659E, 0x6B3318B9, 0x916A1DBD, 0xD856609A, 0x0312E7F3, 0x4A2E9AD4, 0xF24C9B0A, 0xBB70E62D, 0x60346144, 0x29081C63, 0xD3511967, 0x9A6D6440, 0x4129E329, 0x08159E0E, 0x3901F3FD, 0x703D8EDA, 0xAB7909B3, 0xE2457494, 0x181C7190, 0x51200CB7, 0x8A648BDE, 0xC358F6F9, 0x7B3AF727, 0x32068A00, 0xE9420D69, 0xA07E704E, 0x5A27754A, 0x131B086D, 0xC85F8F04, 0x8163F223, 0xBD77FA49, 0xF44B876E, 0x2F0F0007, 0x66337D20, 0x9C6A7824, 0xD5560503, 0x0E12826A, 0x472EFF4D, 0xFF4CFE93, 0xB67083B4, 0x6D3404DD, 0x240879FA, 0xDE517CFE, 0x976D01D9, 0x4C2986B0, 0x0515FB97, 0x2E015D56, 0x673D2071, 0xBC79A718, 0xF545DA3F, 0x0F1CDF3B, 0x4620A21C, 0x9D642575, 0xD4585852, 0x6C3A598C, 0x250624AB, 0xFE42A3C2, 0xB77EDEE5, 0x4D27DBE1, 0x041BA6C6, 0xDF5F21AF, 0x96635C88, 0xAA7754E2, 0xE34B29C5, 0x380FAEAC, 0x7133D38B, 0x8B6AD68F, 0xC256ABA8, 0x19122CC1, 0x502E51E6, 0xE84C5038, 0xA1702D1F, 0x7A34AA76, 0x3308D751, 0xC951D255, 0x806DAF72, 0x5B29281B, 0x1215553C, 0x230138CF, 0x6A3D45E8, 0xB179C281, 0xF845BFA6, 0x021CBAA2, 0x4B20C785, 0x906440EC, 0xD9583DCB, 0x613A3C15, 0x28064132, 0xF342C65B, 0xBA7EBB7C, 0x4027BE78, 0x091BC35F, 0xD25F4436, 0x9B633911, 0xA777317B, 0xEE4B4C5C, 0x350FCB35, 0x7C33B612, 0x866AB316, 0xCF56CE31, 0x14124958, 0x5D2E347F, 0xE54C35A1, 0xAC704886, 0x7734CFEF, 0x3E08B2C8, 0xC451B7CC, 0x8D6DCAEB, 0x56294D82, 0x1F1530A5 }; /* * end of the CRC lookup table crc_tableil8_o88 */ uint32_t _crc32c_sw_slicing_by_8(uint32_t crc, unsigned const char* data, unsigned long length) { unsigned const char* p_buf = data; size_t initial_bytes = (sizeof(uint32_t) - (intptr_t)p_buf) & (sizeof(uint32_t) - 1); size_t li; size_t running_length; size_t end_bytes; uint32_t term1; uint32_t term2; // Handle leading misaligned bytes if (length < initial_bytes) { initial_bytes = length; } for (li = 0; li < initial_bytes; li++) { crc = crc_tableil8_o32[(crc ^ *p_buf++) & 0x000000FF] ^ (crc >> 8); } length -= initial_bytes; running_length = length & ~(sizeof(uint64_t) - 1); end_bytes = length - running_length; if (is_big_endian) { for (li = 0; li < running_length/8; li++) { crc ^= (*p_buf++); crc ^= (*p_buf++) << 8; crc ^= (*p_buf++) << 16; crc ^= (*p_buf++) << 24; term1 = crc_tableil8_o88[crc & 0x000000FF] ^ crc_tableil8_o80[(crc >> 8) & 0x000000FF]; term2 = crc >> 16; crc = term1 ^ crc_tableil8_o72[term2 & 0x000000FF] ^ crc_tableil8_o64[(term2 >> 8) & 0x000000FF]; crc ^= crc_tableil8_o56[*p_buf++]; crc ^= crc_tableil8_o48[*p_buf++]; crc ^= crc_tableil8_o40[*p_buf++]; crc ^= crc_tableil8_o32[*p_buf++]; } } else { for (li = 0; li < running_length/8; li++) { crc ^= *(uint32_t*) p_buf; p_buf += 4; term1 = crc_tableil8_o88[crc & 0x000000FF] ^ crc_tableil8_o80[(crc >> 8) & 0x000000FF]; term2 = crc >> 16; crc = term1 ^ crc_tableil8_o72[term2 & 0x000000FF] ^ crc_tableil8_o64[(term2 >> 8) & 0x000000FF]; term1 = crc_tableil8_o56[(*(uint32_t *)p_buf) & 0x000000FF] ^ crc_tableil8_o48[((*(uint32_t *)p_buf) >> 8) & 0x000000FF]; term2 = (*(uint32_t *)p_buf) >> 16; crc = crc ^ term1 ^ crc_tableil8_o40[term2 & 0x000000FF] ^ crc_tableil8_o32[(term2 >> 8) & 0x000000FF]; p_buf += 4; } } for (li = 0; li < end_bytes; li++) { crc = crc_tableil8_o32[(crc ^ *p_buf++) & 0x000000FF] ^ (crc >> 8); } return crc; } ICRAR-crc32c-6d3a422/src/crc32c/py.typed000066400000000000000000000000001467444355400173310ustar00rootroot00000000000000ICRAR-crc32c-6d3a422/test/000077500000000000000000000000001467444355400147555ustar00rootroot00000000000000ICRAR-crc32c-6d3a422/test/conftest.py000066400000000000000000000032541467444355400171600ustar00rootroot00000000000000# # ICRAR - International Centre for Radio Astronomy Research # (c) UWA - The University of Western Australia, 2024 # Copyright by UWA (in the framework of the ICRAR) # All rights reserved # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public # License along with this library; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, # MA 02111-1307 USA # import time import pytest import crc32c def _crc32c_is_available() -> bool: try: crc32c.crc32c(b"dummy") return True except RuntimeError: return False @pytest.fixture def crc32c_is_available() -> bool: return _crc32c_is_available() @pytest.fixture(autouse=True) def skip_if_crc32c_unavailable( request: pytest.FixtureRequest, crc32c_is_available: bool ) -> None: if request.node.get_closest_marker("calculates_crc32c") and not crc32c_is_available: pytest.skip("crc32c is not available on this platform") def pytest_sessionstart(session: pytest.Session) -> None: print("crc32c is big endian? ", crc32c.big_endian) print("crc32c is hardware based? ", crc32c.hardware_based) ICRAR-crc32c-6d3a422/test/test_benchmark.py000066400000000000000000000003341467444355400203200ustar00rootroot00000000000000import subprocess import sys import pytest @pytest.mark.calculates_crc32c def test_benchmark() -> None: out = subprocess.check_output([sys.executable, "-m", "crc32c.benchmark"]) assert b"crc32c ran at" in out ICRAR-crc32c-6d3a422/test/test_crc32c.py000066400000000000000000000203001467444355400174400ustar00rootroot00000000000000# # ICRAR - International Centre for Radio Astronomy Research # (c) UWA - The University of Western Australia, 2018 # Copyright by UWA (in the framework of the ICRAR) # All rights reserved # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public # License along with this library; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, # MA 02111-1307 USA # from __future__ import annotations import os import struct import warnings from typing import Generator, List, NamedTuple import pytest import crc32c def test_software_mode(crc32c_is_available: bool) -> None: """Check that the CRC32C_SW_MODE has intended consequences""" sw_mode = os.environ.get("CRC32C_SW_MODE") if sw_mode == "force": assert not crc32c.hardware_based if sw_mode == "none" and crc32c_is_available: assert crc32c.hardware_based def ulonglong_as_bytes(x: int) -> bytes: return struct.pack(" bytes: return struct.pack(" bytes: return struct.pack(" bytes: return struct.pack(" Generator[bytes, None, None]: length = len(x) for i in range(0, length, size): yield x[i : min(i + size, length)] def as_individual_bytes(x: bytes) -> Generator[bytes, None, None]: for b in x: yield bytes([b]) @pytest.mark.calculates_crc32c class TestMisc: def test_zero(self) -> None: assert 0 == crc32c.crc32c(b"") def test_keyword(self) -> None: assert 10 == crc32c.crc32c(b"", value=10) def test_gil_behaviour(self) -> None: def _test(data: bytes) -> None: expected = crc32c.crc32c(data) assert expected == crc32c.crc32c(data, gil_release_mode=-1) assert expected == crc32c.crc32c(data, gil_release_mode=0) assert expected == crc32c.crc32c(data, gil_release_mode=1) _test(b"this_doesnt_release_the_gil_by_default") _test(b"this_releases_the_gil_by_default" * 1024 * 1024) def test_crc32_deprecated(self) -> None: with warnings.catch_warnings(record=True) as warns: crc32c.crc32(b"") assert 1 == len(warns) with warnings.catch_warnings(record=True) as warns: crc32c.crc32c(b"") assert 0 == len(warns) def test_msvc_examples(self) -> None: # Examples taken from MSVC's online examples. # Values are not xor'd in the examples though, so we do it here max32 = 0xFFFFFFFF def assert_msvc_vals(b: bytes, crc: int, expected_crc: int) -> None: assert expected_crc ^ max32 == crc32c.crc32c(b, crc ^ max32) assert_msvc_vals(uchar_as_bytes(100), 1, 1412925310) assert_msvc_vals(ushort_as_bytes(1000), 1, 3870914500) assert_msvc_vals(uint_as_bytes(50000), 1, 971731851) assert_msvc_vals(ulonglong_as_bytes(0x88889999EEEE3333), 0x5555AAAA, 0x16F57621) class CRCTestValue(NamedTuple): name: str data: bytes crc: int test_values: List[CRCTestValue] = [ CRCTestValue("Numbers1", b"123456789", 0xE3069283), CRCTestValue("Numbers2", b"23456789", 0xBFE92A83), CRCTestValue("Phrase", b"The quick brown fox jumps over the lazy dog", 0x22620404), CRCTestValue( "LongPhrase", b"Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nunc omni virtuti vitium contrario nomine opponitur. " b"Conferam tecum, quam cuique verso rem subicias; Te ipsum, dignissimum maioribus tuis, voluptasne induxit, ut adolescentulus eriperes " b"P. Conclusum est enim contra Cyrenaicos satis acute, nihil ad Epicurum. Duo Reges: constructio interrete. Tum Torquatus: Prorsus, inquit, assentior;\n" b"Quando enim Socrates, qui parens philosophiae iure dici potest, quicquam tale fecit? Sed quid sentiat, non videtis. Haec quo modo conveniant, non " b"sane intellego. Sed ille, ut dixi, vitiose. Dic in quovis conventu te omnia facere, ne doleas. Quod si ita se habeat, non possit beatam praestare " b"vitam sapientia. Quis suae urbis conservatorem Codrum, quis Erechthei filias non maxime laudat? Primum divisit ineleganter; Huic mori optimum esse " b"propter desperationem sapientiae, illi propter spem vivere.", 0xFCB7575A, ), CRCTestValue("Empty", b"", 0x0), ] @pytest.mark.calculates_crc32c class TestCRC32CHash: def test_misc(self) -> None: crc32c_hash = crc32c.CRC32CHash() assert crc32c_hash.digest_size == 4 assert crc32c_hash.name == "crc32c" assert len(crc32c_hash.digest()) == crc32c_hash.digest_size assert len(crc32c_hash.hexdigest()) == crc32c_hash.digest_size * 2 def test_initial_value(self) -> None: crc32c_hash = crc32c.CRC32CHash() crc32c_hash.update(b"hello world") expected = crc32c_hash.digest() crc32c_hash = crc32c.CRC32CHash(b"hello") crc32c_hash.update(b" world") assert expected == crc32c_hash.digest() def test_copy(self) -> None: crc32c_hash = crc32c.CRC32CHash() crc32c_hash_copy = crc32c_hash.copy() assert crc32c_hash.digest() == crc32c_hash_copy.digest() assert crc32c_hash.hexdigest() == crc32c_hash_copy.hexdigest() assert id(crc32c_hash) != id(crc32c_hash_copy) crc32c_hash.update(b"1") assert crc32c_hash.digest() != crc32c_hash_copy.digest() assert crc32c_hash.hexdigest() != crc32c_hash_copy.hexdigest() crc32c_hash_copy.update(b"2") assert crc32c_hash.digest() != crc32c_hash_copy.digest() assert crc32c_hash.hexdigest() != crc32c_hash_copy.hexdigest() @pytest.mark.parametrize( "data,crc", [pytest.param(value.data, value.crc, id=value.name) for value in test_values], ) class TestSpecificValues: @staticmethod def _check_values(crc32c_hash: crc32c.CRC32CHash, crc: int) -> None: assert crc32c_hash.checksum == crc assert int.from_bytes(crc32c_hash.digest(), "big") == crc assert len(crc32c_hash.digest()) == 4 assert int(crc32c_hash.hexdigest(), 16) == crc assert len(crc32c_hash.hexdigest()) == 8 def test_piece_by_piece(self, data: bytes, crc: int) -> None: crc32c_hash = crc32c.CRC32CHash() for x in as_individual_bytes(data): crc32c_hash.update(x) self._check_values(crc32c_hash, crc) def test_all(self, data: bytes, crc: int) -> None: self._check_values(crc32c.CRC32CHash(data), crc) @pytest.mark.calculates_crc32c @pytest.mark.parametrize( "data,checksum", [pytest.param(value.data, value.crc, id=value.name) for value in test_values], ) class TestCRC32CValues: def test_all(self, data: bytes, checksum: int) -> None: assert checksum == crc32c.crc32c(data) def test_piece_by_piece(self, data: bytes, checksum: int) -> None: c = 0 for x in as_individual_bytes(data): c = crc32c.crc32c(x, c) assert checksum == c def test_by_different_chunk_lenghts(self, data: bytes, checksum: int) -> None: for chunk_size in range(1, 33): c = 0 for chunk in batched(data, chunk_size): c = crc32c.crc32c(bytes(chunk), c) assert checksum == c def test_by_different_memory_offsets(self, data: bytes, checksum: int) -> None: for offset in range(16): view = memoryview(data) c = crc32c.crc32c(view[0:offset]) c = crc32c.crc32c(view[offset:], c) assert checksum == c, ( "Invalid checksum when splitting at offset %d" % offset ) ICRAR-crc32c-6d3a422/test/test_subinterpreter.py000066400000000000000000000024021467444355400214410ustar00rootroot00000000000000import contextlib from typing import Iterable, Tuple, no_type_check import pytest import crc32c try: from test.support.interpreters import Interpreter # type: ignore from test.support.interpreters import create, queues except ImportError: pytest.skip("No sub-interpreter support", allow_module_level=True) @pytest.fixture(name="interpreter") def interpreter_fixture() -> Iterable[Interpreter]: interpreter = create() with contextlib.closing(interpreter): yield interpreter def test_crc32c_can_be_loaded(interpreter: Interpreter) -> None: interpreter.exec("import crc32c") # all good, no exception raised @pytest.mark.calculates_crc32c def test_crc32c_can_run(interpreter: Interpreter) -> None: queue = queues.create() VALUE = b"test" interpreter.prepare_main(queue_id=queue.id, value_in=VALUE) @no_type_check def crc32c_in_subinterpreter() -> None: from test.support.interpreters.queues import Queue # type: ignore import crc32c queue = Queue(queue_id) value_out = crc32c.crc32c(value_in) queue.put(value_out) thread = interpreter.call_in_thread(crc32c_in_subinterpreter) result = queue.get(timeout=5) thread.join() assert result == crc32c.crc32c(VALUE)