Skip to content

Commit

Permalink
add blosc2 code tree
Browse files Browse the repository at this point in the history
  • Loading branch information
fangq committed Sep 10, 2022
1 parent a471522 commit 65ae09f
Show file tree
Hide file tree
Showing 278 changed files with 90,255 additions and 0 deletions.
31 changes: 31 additions & 0 deletions src/blosc2/LICENSE.txt
@@ -0,0 +1,31 @@
BSD License

For Blosc - A blocking, shuffling and lossless compression library

Copyright (C) 2009-2018 Francesc Alted <francesc@blosc.org>
Copyright (C) 2019- The Blosc Development Team <blosc@blosc.org>

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 Francesc Alted 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 HOLDER 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.
253 changes: 253 additions & 0 deletions src/blosc2/README.rst

Large diffs are not rendered by default.

33 changes: 33 additions & 0 deletions src/blosc2/THANKS.rst
@@ -0,0 +1,33 @@
Thanks
======

* Valentin Haenel did a terrific work implementing the support for the Snappy compression, fixing typos and improving docs and the plotting script.

* Thibault North, with ideas from Oscar Villellas, contributed a way to call Blosc from different threads in a safe way. Christopher
Speller introduced contexts so that a global lock is not necessary anymore.

* The CMake support was initially contributed by Thibault North, and Antonio Valentino and Mark Wiebe made great enhancements to it.

* Christopher Speller also introduced the two new '_ctx' calls to avoid the use of the blosc_init() and blosc_destroy().

* Jack Pappas contributed important portability enhancements, specially runtime and cross-platform detection of SSE2/AVX2 as well as high precision timers (HPET) for the benchmark program.

* @littlezhou implemented the AVX2 version of shuffle routines.

* Julian Taylor contributed a way to detect AVX2 in runtime and calling the appropriate routines only if the underlying hardware supports it.

* Lucian Marc provided the support for ARM/NEON for the shuffle filter.

* Jerome Kieffer contributed support for PowerPC/ALTIVEC for the shuffle/bitshuffle filter.

* Alberto Sabater, for his great efforts on producing really nice Blosc2 docs, among other aspects.

* Kiyo Masui for relicensing his bitshuffle project for allowing the inclusion of part of his code in Blosc.

* Aleix Alcacer for his implementation of mutable super-chunks, multiple variable length metalayers and many other things.

* Oscar Guiñón for the optimization of reading a (sparse) set of blocks of a chunk in parallel.

* Nathan Moinvaziri for his outstanding work on the security side of the things via `fuzzer testing <https://google.github.io/oss-fuzz/>`_.

* Marta Iborra for her implementation of sparse storage for persistent super-chunks.

0 comments on commit 65ae09f

Please sign in to comment.