diff --git a/FNV.md b/FNV.md new file mode 100644 index 0000000..870525e --- /dev/null +++ b/FNV.md @@ -0,0 +1,294 @@ +# SMHasher result for MurmurHash3A # + +This is the dump of SMHasher test set +run on a Core i5 560M +using FNV hash function (32-bits version). + +The function proves overall pretty bad, +with some serious bias flaws. +It also fails a few collisions test, +most notably Keyset 'Combination 0x8000000', and the cyclic tests. +Overall, it performs "reasonably poorly", +which makes it less than ideal, but still usable as a hash function. + +# Result Log # +``` +------------------------------------------------------------------------------- +--- Testing FNV (Fowler-Noll-Vo hash, 32-bit) + +[[[ Speed Tests ]]] + +Bulk speed test - 262144-byte keys +Alignment 0 - 0.228 bytes/cycle - 653.38 MiB/sec @ 3 ghz +Alignment 1 - 0.232 bytes/cycle - 663.15 MiB/sec @ 3 ghz +Alignment 2 - 0.232 bytes/cycle - 662.48 MiB/sec @ 3 ghz +Alignment 3 - 0.229 bytes/cycle - 655.20 MiB/sec @ 3 ghz +Alignment 4 - 0.232 bytes/cycle - 663.35 MiB/sec @ 3 ghz +Alignment 5 - 0.232 bytes/cycle - 663.18 MiB/sec @ 3 ghz +Alignment 6 - 0.240 bytes/cycle - 686.60 MiB/sec @ 3 ghz +Alignment 7 - 0.232 bytes/cycle - 662.63 MiB/sec @ 3 ghz + +Small key speed test - 1-byte keys - 39.11 cycles/hash +Small key speed test - 2-byte keys - 32.14 cycles/hash +Small key speed test - 3-byte keys - 31.75 cycles/hash +Small key speed test - 4-byte keys - 37.21 cycles/hash +Small key speed test - 5-byte keys - 30.18 cycles/hash +Small key speed test - 6-byte keys - 34.23 cycles/hash +Small key speed test - 7-byte keys - 33.68 cycles/hash +Small key speed test - 8-byte keys - 42.47 cycles/hash +Small key speed test - 9-byte keys - 39.64 cycles/hash +Small key speed test - 10-byte keys - 37.60 cycles/hash +Small key speed test - 11-byte keys - 43.16 cycles/hash +Small key speed test - 12-byte keys - 46.11 cycles/hash +Small key speed test - 13-byte keys - 48.32 cycles/hash +Small key speed test - 14-byte keys - 50.08 cycles/hash +Small key speed test - 15-byte keys - 54.56 cycles/hash +Small key speed test - 16-byte keys - 59.82 cycles/hash +Small key speed test - 17-byte keys - 61.01 cycles/hash +Small key speed test - 18-byte keys - 66.88 cycles/hash +Small key speed test - 19-byte keys - 69.79 cycles/hash +Small key speed test - 20-byte keys - 74.82 cycles/hash +Small key speed test - 21-byte keys - 78.84 cycles/hash +Small key speed test - 22-byte keys - 84.18 cycles/hash +Small key speed test - 23-byte keys - 89.56 cycles/hash +Small key speed test - 24-byte keys - 92.28 cycles/hash +Small key speed test - 25-byte keys - 97.48 cycles/hash +Small key speed test - 26-byte keys - 106.96 cycles/hash +Small key speed test - 27-byte keys - 109.14 cycles/hash +Small key speed test - 28-byte keys - 114.58 cycles/hash +Small key speed test - 29-byte keys - 118.45 cycles/hash +Small key speed test - 30-byte keys - 126.43 cycles/hash +Small key speed test - 31-byte keys - 130.57 cycles/hash +Small key speed test - 32-byte keys - 133.71 cycles/hash + +[[[ Avalanche Tests ]]] + +Testing 32-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 100.00% !!!!! +Testing 40-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 100.00% !!!!! +Testing 48-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 100.00% !!!!! +Testing 56-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 100.00% !!!!! +Testing 64-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 100.00% !!!!! +Testing 72-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 100.00% !!!!! +Testing 80-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 100.00% !!!!! +Testing 88-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 100.00% !!!!! +Testing 96-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 100.00% !!!!! +Testing 104-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 100.00% !!!!! +Testing 112-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 100.00% !!!!! +Testing 120-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 100.00% !!!!! +Testing 128-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 100.00% !!!!! +Testing 136-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 100.00% !!!!! +Testing 144-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 100.00% !!!!! +Testing 152-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 100.00% !!!!! +*********FAIL********* + +[[[ Keyset 'Cyclic' Tests ]]] + +Keyset 'Cyclic' - 8 cycles of 4 bytes - 10000000 keys +Testing collisions - Expected 11641.53, actual 217246.00 (18.66x) !!!!! +Testing distribution - Worst bias is the 20-bit window at bit 0 - 94.729% !!!!! + +Keyset 'Cyclic' - 8 cycles of 5 bytes - 10000000 keys +Testing collisions - Expected 11641.53, actual 115440.00 ( 9.92x) !!!!! +Testing distribution - Worst bias is the 20-bit window at bit 0 - 89.985% !!!!! + +Keyset 'Cyclic' - 8 cycles of 6 bytes - 10000000 keys +Testing collisions - Expected 11641.53, actual 205386.00 (17.64x) !!!!! +Testing distribution - Worst bias is the 19-bit window at bit 30 - 94.453% !!!!! + +Keyset 'Cyclic' - 8 cycles of 7 bytes - 10000000 keys +Testing collisions - Expected 11641.53, actual 115011.00 ( 9.88x) !!!!! +Testing distribution - Worst bias is the 20-bit window at bit 26 - 90.010% !!!!! + +Keyset 'Cyclic' - 8 cycles of 8 bytes - 10000000 keys +Testing collisions - Expected 11641.53, actual 206223.00 (17.71x) !!!!! +Testing distribution - Worst bias is the 20-bit window at bit 31 - 94.451% !!!!! + +*********FAIL********* + +[[[ Keyset 'TwoBytes' Tests ]]] + +Keyset 'TwoBytes' - up-to-4-byte keys, 652545 total keys +Testing collisions - Expected 49.57, actual 13.00 ( 0.26x) +Testing distribution - Worst bias is the 16-bit window at bit 24 - 10.260% !!!!! + +Keyset 'TwoBytes' - up-to-8-byte keys, 5471025 total keys +Testing collisions - Expected 3484.56, actual 7125.00 ( 2.04x) !!!!! +Testing distribution - Worst bias is the 20-bit window at bit 22 - 1.714% !!!!! + +Keyset 'TwoBytes' - up-to-12-byte keys, 18616785 total keys +Testing collisions - Expected 40347.77, actual 53215.00 ( 1.32x) +Testing distribution - Worst bias is the 20-bit window at bit 20 - 0.211% + +Keyset 'TwoBytes' - up-to-16-byte keys, 44251425 total keys +Testing collisions - Expected 227963.15, actual 255728.00 ( 1.12x) +Testing distribution - Worst bias is the 20-bit window at bit 19 - 0.148% + +Keyset 'TwoBytes' - up-to-20-byte keys, 86536545 total keys +Testing collisions - Expected 871784.70, actual 917142.00 ( 1.05x) +Testing distribution - Worst bias is the 20-bit window at bit 19 - 0.075% + +*********FAIL********* + +[[[ Keyset 'Sparse' Tests ]]] + +Keyset 'Sparse' - 32-bit keys with up to 6 bits set - 1149017 keys +Testing collisions - Expected 153.70, actual 190.00 ( 1.24x) +Testing distribution - Worst bias is the 14-bit window at bit 29 - 2.443% !!!!! + +Keyset 'Sparse' - 40-bit keys with up to 6 bits set - 4598479 keys +Testing collisions - Expected 2461.72, actual 3619.00 ( 1.47x) +Testing distribution - Worst bias is the 19-bit window at bit 21 - 4.080% !!!!! + +Keyset 'Sparse' - 48-bit keys with up to 5 bits set - 1925357 keys +Testing collisions - Expected 431.55, actual 481.00 ( 1.11x) +Testing distribution - Worst bias is the 17-bit window at bit 22 - 7.099% !!!!! + +Keyset 'Sparse' - 56-bit keys with up to 5 bits set - 4216423 keys +Testing collisions - Expected 2069.66, actual 2527.00 ( 1.22x) +Testing distribution - Worst bias is the 16-bit window at bit 21 - 7.348% !!!!! + +Keyset 'Sparse' - 64-bit keys with up to 5 bits set - 8303633 keys +Testing collisions - Expected 8026.87, actual 8745.00 ( 1.09x) +Testing distribution - Worst bias is the 20-bit window at bit 0 - 8.374% !!!!! + +Keyset 'Sparse' - 96-bit keys with up to 4 bits set - 3469497 keys +Testing collisions - Expected 1401.34, actual 1370.00 ( 0.98x) +Testing distribution - Worst bias is the 16-bit window at bit 22 - 16.655% !!!!! + +Keyset 'Sparse' - 256-bit keys with up to 3 bits set - 2796417 keys +Testing collisions - Expected 910.36, actual 1088.00 ( 1.20x) +Testing distribution - Worst bias is the 16-bit window at bit 22 - 32.556% !!!!! + +Keyset 'Sparse' - 2048-bit keys with up to 2 bits set - 2098177 keys +Testing collisions - Expected 512.50, actual 1135.00 ( 2.21x) !!!!! +Testing distribution - Worst bias is the 13-bit window at bit 0 - 56.979% !!!!! + +*********FAIL********* + +[[[ Keyset 'Combination Lowbits' Tests ]]] + +Keyset 'Combination' - up to 8 blocks from a set of 8 - 19173960 keys +Testing collisions - Expected 42799.01, actual 0.00 ( 0.00x) +Testing distribution - Worst bias is the 20-bit window at bit 20 - 50.342% !!!!! + + +[[[ Keyset 'Combination Highbits' Tests ]]] + +Keyset 'Combination' - up to 8 blocks from a set of 8 - 19173960 keys +Testing collisions - Expected 42799.01, actual 550392.00 (12.86x) !!!!! +Testing distribution - Worst bias is the 19-bit window at bit 29 - 96.143% !!!!! + +*********FAIL********* + +[[[ Keyset 'Combination 0x8000000' Tests ]]] + +Keyset 'Combination' - up to 20 blocks from a set of 2 - 2097150 keys +Testing collisions - Expected 512.00, actual 25340.00 (49.49x) !!!!! +Testing distribution - Worst bias is the 18-bit window at bit 0 - 97.974% !!!!! + +*********FAIL********* + +[[[ Keyset 'Combination 0x0000001' Tests ]]] + +Keyset 'Combination' - up to 20 blocks from a set of 2 - 2097150 keys +Testing collisions - Expected 512.00, actual 2768.00 ( 5.41x) !!!!! +Testing distribution - Worst bias is the 18-bit window at bit 26 - 89.488% !!!!! + +*********FAIL********* + +[[[ Keyset 'Combination Hi-Lo' Tests ]]] + +Keyset 'Combination' - up to 6 blocks from a set of 15 - 12204240 keys +Testing collisions - Expected 17339.30, actual 38790.00 ( 2.24x) !!!!! +Testing distribution - Worst bias is the 20-bit window at bit 18 - 51.163% !!!!! + +*********FAIL********* + +[[[ Keyset 'Window' Tests ]]] + +Keyset 'Windowed' - 64-bit key, 20-bit window - 64 tests, 1048576 keys per test +Window at 0 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 1 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 2 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 3 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 4 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 5 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 6 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 7 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 8 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 9 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 10 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 11 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 12 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 13 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 14 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 15 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 16 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 17 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 18 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 19 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 20 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 21 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 22 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 23 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 24 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 25 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 26 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 27 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 28 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 29 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 30 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 31 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 32 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 33 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 34 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 35 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 36 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 37 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 38 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 39 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 40 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 41 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 42 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 43 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 44 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 45 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 46 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 47 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 48 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 49 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 50 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 51 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 52 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 53 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 54 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 55 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 56 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 57 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 58 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 59 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 60 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 61 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 62 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 63 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 64 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) + +[[[ Keyset 'Zeroes' Tests ]]] + +Keyset 'Zeroes' - 65536 keys +Testing collisions - Expected 0.50, actual 0.00 ( 0.00x) +Testing distribution - Worst bias is the 10-bit window at bit 25 - 74.999% !!!!! + + +[[[ Keyset 'Seed' Tests ]]] + +Keyset 'Seed' - 1000000 keys +Testing collisions - Expected 116.42, actual 0.00 ( 0.00x) +Testing distribution - Worst bias is the 17-bit window at bit 7 - 6.747% !!!!! + + + +Input vcode 0x385455b6, Output vcode 0x3f3f2ad4, Result vcode 0x00000001 +Verification value is 0x00000001 - Testing took 465.320000 seconds +------------------------------------------------------------------------------- +``` \ No newline at end of file diff --git a/LICENSE b/LICENSE deleted file mode 100644 index 7de801e..0000000 --- a/LICENSE +++ /dev/null @@ -1,24 +0,0 @@ -xxHash Library -Copyright (c) 2012-2014, Yann Collet -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. - -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. diff --git a/MM3A_32.md b/MM3A_32.md new file mode 100644 index 0000000..8e13853 --- /dev/null +++ b/MM3A_32.md @@ -0,0 +1,281 @@ +# SMHasher result for MurmurHash3A # + +This is the dump of SMHasher test set +run on a Core i5 560M +using MurmurHash3A (32-bits version). + + +# Result Log # +``` +(No test hash given on command line, testing Murmur3_x86_32.) +------------------------------------------------------------------------------- +--- Testing Murmur3A (MurmurHash3 for x86, 32-bit) + +[[[ Speed Tests ]]] + +Bulk speed test - 262144-byte keys +Alignment 0 - 0.931 bytes/cycle - 2664.79 MiB/sec @ 3 ghz +Alignment 1 - 0.991 bytes/cycle - 2835.75 MiB/sec @ 3 ghz +Alignment 2 - 1.041 bytes/cycle - 2978.01 MiB/sec @ 3 ghz +Alignment 3 - 0.991 bytes/cycle - 2834.06 MiB/sec @ 3 ghz +Alignment 4 - 0.938 bytes/cycle - 2683.45 MiB/sec @ 3 ghz +Alignment 5 - 0.996 bytes/cycle - 2849.92 MiB/sec @ 3 ghz +Alignment 6 - 1.017 bytes/cycle - 2908.92 MiB/sec @ 3 ghz +Alignment 7 - 1.000 bytes/cycle - 2860.11 MiB/sec @ 3 ghz + +Small key speed test - 1-byte keys - 35.80 cycles/hash +Small key speed test - 2-byte keys - 37.75 cycles/hash +Small key speed test - 3-byte keys - 35.53 cycles/hash +Small key speed test - 4-byte keys - 38.78 cycles/hash +Small key speed test - 5-byte keys - 39.90 cycles/hash +Small key speed test - 6-byte keys - 37.31 cycles/hash +Small key speed test - 7-byte keys - 34.71 cycles/hash +Small key speed test - 8-byte keys - 39.96 cycles/hash +Small key speed test - 9-byte keys - 39.81 cycles/hash +Small key speed test - 10-byte keys - 42.24 cycles/hash +Small key speed test - 11-byte keys - 40.93 cycles/hash +Small key speed test - 12-byte keys - 44.55 cycles/hash +Small key speed test - 13-byte keys - 40.51 cycles/hash +Small key speed test - 14-byte keys - 40.77 cycles/hash +Small key speed test - 15-byte keys - 44.18 cycles/hash +Small key speed test - 16-byte keys - 42.21 cycles/hash +Small key speed test - 17-byte keys - 42.24 cycles/hash +Small key speed test - 18-byte keys - 45.66 cycles/hash +Small key speed test - 19-byte keys - 45.22 cycles/hash +Small key speed test - 20-byte keys - 49.43 cycles/hash +Small key speed test - 21-byte keys - 47.06 cycles/hash +Small key speed test - 22-byte keys - 49.60 cycles/hash +Small key speed test - 23-byte keys - 53.96 cycles/hash +Small key speed test - 24-byte keys - 51.40 cycles/hash +Small key speed test - 25-byte keys - 51.49 cycles/hash +Small key speed test - 26-byte keys - 53.03 cycles/hash +Small key speed test - 27-byte keys - 55.57 cycles/hash +Small key speed test - 28-byte keys - 58.13 cycles/hash +Small key speed test - 29-byte keys - 53.76 cycles/hash +Small key speed test - 30-byte keys - 58.29 cycles/hash +Small key speed test - 31-byte keys - 57.73 cycles/hash +Small key speed test - 32-byte keys - 57.16 cycles/hash + +[[[ Avalanche Tests ]]] + +Testing 32-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.65% +Testing 40-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.67% +Testing 48-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.54% +Testing 56-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.66% +Testing 64-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.68% +Testing 72-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.59% +Testing 80-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.63% +Testing 88-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.64% +Testing 96-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.65% +Testing 104-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.67% +Testing 112-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.70% +Testing 120-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.66% +Testing 128-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.60% +Testing 136-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.68% +Testing 144-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.70% +Testing 152-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.66% + +[[[ Keyset 'Cyclic' Tests ]]] + +Keyset 'Cyclic' - 8 cycles of 4 bytes - 10000000 keys +Testing collisions - Expected 11641.53, actual 11794.00 ( 1.01x) +Testing distribution - Worst bias is the 20-bit window at bit 17 - 0.039% + +Keyset 'Cyclic' - 8 cycles of 5 bytes - 10000000 keys +Testing collisions - Expected 11641.53, actual 11784.00 ( 1.01x) +Testing distribution - Worst bias is the 20-bit window at bit 31 - 0.040% + +Keyset 'Cyclic' - 8 cycles of 6 bytes - 10000000 keys +Testing collisions - Expected 11641.53, actual 11671.00 ( 1.00x) +Testing distribution - Worst bias is the 20-bit window at bit 15 - 0.021% + +Keyset 'Cyclic' - 8 cycles of 7 bytes - 10000000 keys +Testing collisions - Expected 11641.53, actual 11672.00 ( 1.00x) +Testing distribution - Worst bias is the 20-bit window at bit 12 - 0.022% + +Keyset 'Cyclic' - 8 cycles of 8 bytes - 10000000 keys +Testing collisions - Expected 11641.53, actual 11509.00 ( 0.99x) +Testing distribution - Worst bias is the 20-bit window at bit 17 - 0.023% + + +[[[ Keyset 'TwoBytes' Tests ]]] + +Keyset 'TwoBytes' - up-to-4-byte keys, 652545 total keys +Testing collisions - Expected 49.57, actual 20.00 ( 0.40x) +Testing distribution - Worst bias is the 16-bit window at bit 23 - 0.201% + +Keyset 'TwoBytes' - up-to-8-byte keys, 5471025 total keys +Testing collisions - Expected 3484.56, actual 3089.00 ( 0.89x) +Testing distribution - Worst bias is the 20-bit window at bit 16 - 0.061% + +Keyset 'TwoBytes' - up-to-12-byte keys, 18616785 total keys +Testing collisions - Expected 40347.77, actual 39454.00 ( 0.98x) +Testing distribution - Worst bias is the 20-bit window at bit 1 - 0.015% + +Keyset 'TwoBytes' - up-to-16-byte keys, 44251425 total keys +Testing collisions - Expected 227963.15, actual 225188.00 ( 0.99x) +Testing distribution - Worst bias is the 20-bit window at bit 23 - 0.005% + +Keyset 'TwoBytes' - up-to-20-byte keys, 86536545 total keys +Testing collisions - Expected 871784.70, actual 864247.00 ( 0.99x) +Testing distribution - Worst bias is the 20-bit window at bit 25 - 0.003% + + +[[[ Keyset 'Sparse' Tests ]]] + +Keyset 'Sparse' - 32-bit keys with up to 6 bits set - 1149017 keys +Testing collisions - Expected 153.70, actual 0.00 ( 0.00x) +Testing distribution - Worst bias is the 17-bit window at bit 8 - 0.055% + +Keyset 'Sparse' - 40-bit keys with up to 6 bits set - 4598479 keys +Testing collisions - Expected 2461.72, actual 2318.00 ( 0.94x) +Testing distribution - Worst bias is the 19-bit window at bit 14 - 0.060% + +Keyset 'Sparse' - 48-bit keys with up to 5 bits set - 1925357 keys +Testing collisions - Expected 431.55, actual 392.00 ( 0.91x) +Testing distribution - Worst bias is the 17-bit window at bit 3 - 0.050% + +Keyset 'Sparse' - 56-bit keys with up to 5 bits set - 4216423 keys +Testing collisions - Expected 2069.66, actual 2033.00 ( 0.98x) +Testing distribution - Worst bias is the 19-bit window at bit 20 - 0.032% + +Keyset 'Sparse' - 64-bit keys with up to 5 bits set - 8303633 keys +Testing collisions - Expected 8026.87, actual 7964.00 ( 0.99x) +Testing distribution - Worst bias is the 20-bit window at bit 8 - 0.047% + +Keyset 'Sparse' - 96-bit keys with up to 4 bits set - 3469497 keys +Testing collisions - Expected 1401.34, actual 1454.00 ( 1.04x) +Testing distribution - Worst bias is the 19-bit window at bit 26 - 0.062% + +Keyset 'Sparse' - 256-bit keys with up to 3 bits set - 2796417 keys +Testing collisions - Expected 910.36, actual 925.00 ( 1.02x) +Testing distribution - Worst bias is the 19-bit window at bit 27 - 0.059% + +Keyset 'Sparse' - 2048-bit keys with up to 2 bits set - 2098177 keys +Testing collisions - Expected 512.50, actual 505.00 ( 0.99x) +Testing distribution - Worst bias is the 18-bit window at bit 26 - 0.063% + + +[[[ Keyset 'Combination Lowbits' Tests ]]] + +Keyset 'Combination' - up to 8 blocks from a set of 8 - 19173960 keys +Testing collisions - Expected 42799.01, actual 43708.00 ( 1.02x) +Testing distribution - Worst bias is the 20-bit window at bit 18 - 0.010% + + +[[[ Keyset 'Combination Highbits' Tests ]]] + +Keyset 'Combination' - up to 8 blocks from a set of 8 - 19173960 keys +Testing collisions - Expected 42799.01, actual 42696.00 ( 1.00x) +Testing distribution - Worst bias is the 20-bit window at bit 28 - 0.013% + + +[[[ Keyset 'Combination 0x8000000' Tests ]]] + +Keyset 'Combination' - up to 20 blocks from a set of 2 - 2097150 keys +Testing collisions - Expected 512.00, actual 478.00 ( 0.93x) +Testing distribution - Worst bias is the 18-bit window at bit 0 - 0.085% + + +[[[ Keyset 'Combination 0x0000001' Tests ]]] + +Keyset 'Combination' - up to 20 blocks from a set of 2 - 2097150 keys +Testing collisions - Expected 512.00, actual 466.00 ( 0.91x) +Testing distribution - Worst bias is the 18-bit window at bit 8 - 0.060% + + +[[[ Keyset 'Combination Hi-Lo' Tests ]]] + +Keyset 'Combination' - up to 6 blocks from a set of 15 - 12204240 keys +Testing collisions - Expected 17339.30, actual 17632.00 ( 1.02x) +Testing distribution - Worst bias is the 20-bit window at bit 13 - 0.021% + + +[[[ Keyset 'Window' Tests ]]] + +Keyset 'Windowed' - 64-bit key, 20-bit window - 64 tests, 1048576 keys per test +Window at 0 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 1 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 2 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 3 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 4 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 5 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 6 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 7 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 8 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 9 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 10 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 11 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 12 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 13 - Testing collisions - Expected 128.00, actual 60.00 ( 0.47x) +Window at 14 - Testing collisions - Expected 128.00, actual 118.00 ( 0.92x) +Window at 15 - Testing collisions - Expected 128.00, actual 70.00 ( 0.55x) +Window at 16 - Testing collisions - Expected 128.00, actual 94.00 ( 0.73x) +Window at 17 - Testing collisions - Expected 128.00, actual 170.00 ( 1.33x) +Window at 18 - Testing collisions - Expected 128.00, actual 146.00 ( 1.14x) +Window at 19 - Testing collisions - Expected 128.00, actual 142.00 ( 1.11x) +Window at 20 - Testing collisions - Expected 128.00, actual 168.00 ( 1.31x) +Window at 21 - Testing collisions - Expected 128.00, actual 128.00 ( 1.00x) +Window at 22 - Testing collisions - Expected 128.00, actual 112.00 ( 0.88x) +Window at 23 - Testing collisions - Expected 128.00, actual 132.00 ( 1.03x) +Window at 24 - Testing collisions - Expected 128.00, actual 126.00 ( 0.98x) +Window at 25 - Testing collisions - Expected 128.00, actual 108.00 ( 0.84x) +Window at 26 - Testing collisions - Expected 128.00, actual 104.00 ( 0.81x) +Window at 27 - Testing collisions - Expected 128.00, actual 92.00 ( 0.72x) +Window at 28 - Testing collisions - Expected 128.00, actual 52.00 ( 0.41x) +Window at 29 - Testing collisions - Expected 128.00, actual 48.00 ( 0.38x) +Window at 30 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 31 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 32 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 33 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 34 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 35 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 36 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 37 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 38 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 39 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 40 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 41 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 42 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 43 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 44 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 45 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 46 - Testing collisions - Expected 128.00, actual 96.00 ( 0.75x) +Window at 47 - Testing collisions - Expected 128.00, actual 56.00 ( 0.44x) +Window at 48 - Testing collisions - Expected 128.00, actual 108.00 ( 0.84x) +Window at 49 - Testing collisions - Expected 128.00, actual 126.00 ( 0.98x) +Window at 50 - Testing collisions - Expected 128.00, actual 128.00 ( 1.00x) +Window at 51 - Testing collisions - Expected 128.00, actual 218.00 ( 1.70x) +Window at 52 - Testing collisions - Expected 128.00, actual 116.00 ( 0.91x) +Window at 53 - Testing collisions - Expected 128.00, actual 98.00 ( 0.77x) +Window at 54 - Testing collisions - Expected 128.00, actual 108.00 ( 0.84x) +Window at 55 - Testing collisions - Expected 128.00, actual 80.00 ( 0.63x) +Window at 56 - Testing collisions - Expected 128.00, actual 86.00 ( 0.67x) +Window at 57 - Testing collisions - Expected 128.00, actual 74.00 ( 0.58x) +Window at 58 - Testing collisions - Expected 128.00, actual 72.00 ( 0.56x) +Window at 59 - Testing collisions - Expected 128.00, actual 102.00 ( 0.80x) +Window at 60 - Testing collisions - Expected 128.00, actual 144.00 ( 1.13x) +Window at 61 - Testing collisions - Expected 128.00, actual 116.00 ( 0.91x) +Window at 62 - Testing collisions - Expected 128.00, actual 68.00 ( 0.53x) +Window at 63 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 64 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) + +[[[ Keyset 'Zeroes' Tests ]]] + +Keyset 'Zeroes' - 65536 keys +Testing collisions - Expected 0.50, actual 0.00 ( 0.00x) +Testing distribution - Worst bias is the 13-bit window at bit 6 - 0.288% + + +[[[ Keyset 'Seed' Tests ]]] + +Keyset 'Seed' - 1000000 keys +Testing collisions - Expected 116.42, actual 0.00 ( 0.00x) +Testing distribution - Worst bias is the 17-bit window at bit 26 - 0.069% + + + +Input vcode 0x385455b6, Output vcode 0x706797a6, Result vcode 0x00000001 +Verification value is 0x00000001 - Testing took 468.169000 seconds +------------------------------------------------------------------------------- +``` \ No newline at end of file diff --git a/Makefile b/Makefile deleted file mode 100644 index 94cf4a9..0000000 --- a/Makefile +++ /dev/null @@ -1,67 +0,0 @@ -# ################################################################ -# xxHash Makefile -# Copyright (C) Yann Collet 2012-2014 -# GPL v2 License -# -# This program is free software; you can redistribute it and/or modify -# it under the terms of the GNU General Public License as published by -# the Free Software Foundation; either version 2 of the License, or -# (at your option) any later version. -# -# This program is distributed in the hope that it will be useful, -# but WITHOUT ANY WARRANTY; without even the implied warranty of -# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -# GNU General Public License for more details. -# -# You should have received a copy of the GNU General Public License along -# with this program; if not, write to the Free Software Foundation, Inc., -# 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. -# -# You can contact the author at : -# - xxHash source repository : http://code.google.com/p/xxhash/ -# ################################################################ -# xxHash.exe : benchmark program, to demonstrate xxHash speed -# ################################################################ - -CC := $(CC) -CFLAGS ?= -O3 -CFLAGS += -I. -std=c99 -Wall -Wextra -Wundef -Wshadow -Wcast-align -Wstrict-prototypes - - -# Define *.exe as extension for Windows systems -ifneq (,$(filter Windows%,$(OS))) -EXT =.exe -else -EXT = -endif - - -default: xxhsum - -all: xxhsum xxhsum32 - -xxhsum: xxhash.c xxhsum.c - $(CC) $(CFLAGS) $^ -o $@$(EXT) - ln -sf $@ xxh32sum - ln -sf $@ xxh64sum - -xxhsum32: xxhash.c xxhsum.c - $(CC) -m32 $(CFLAGS) $^ -o $@$(EXT) - -test: $(TEST_TARGETS) - -test: xxhsum - ./xxhsum < xxhash.c - ./xxhsum -b xxhash.c - valgrind --leak-check=yes ./xxhsum -bi1 xxhash.c - valgrind --leak-check=yes ./xxhsum -H0 xxhash.c - valgrind --leak-check=yes ./xxhsum -H1 xxhash.c - -test-all: test xxhsum32 - ./xxhsum32 -b xxhash.c - -clean: - @rm -f core *.o xxhsum$(EXT) xxhsum32$(EXT) xxh32sum xxh64sum - @echo cleaning completed - - diff --git a/ProjectHome.md b/ProjectHome.md new file mode 100644 index 0000000..f6367c5 --- /dev/null +++ b/ProjectHome.md @@ -0,0 +1,113 @@ +**Note : as Google Code is closing, the new official xxHash repository is now on Github** => https://github.com/Cyan4973/xxHash + +xxHash is an extremely fast non-cryptographic Hash algorithm, working at speeds close to RAM limits. + +32-bits hash comparison (single thread, Windows Seven 32 bits, using [Open Source's SMHasher](http://code.google.com/p/smhasher/wiki/SMHasher) on a Core 2 Duo @3GHz) + +``` +Name Speed Q.Score Author +xxHash 5.4 GB/s 10 +MumurHash 3a 2.7 GB/s 10 Austin Appleby +SpookyHash 2.0 GB/s 10 Bob Jenkins +SBox 1.4 GB/s 9 Bret Mulvey +Lookup3 1.2 GB/s 9 Bob Jenkins +CityHash64 1.05 GB/s 10 Pike & Alakuijala +FNV 0.55 GB/s 5 Fowler, Noll, Vo +CRC32 0.43 GB/s 9 +MD5-32 0.33 GB/s 10 Ronald L. Rivest +SHA1-32 0.28 GB/s 10 +``` + +Q.Score is a measure of quality of the hash function. +It depends on successfully passing [SMHasher test set](http://code.google.com/p/smhasher/wiki/SMHasher). +10 is a perfect score. +Hash functions with a Q.score < 5 are not listed in this table. + +A new 64-bits version, named XXH64, is available since [r35](https://code.google.com/p/xxhash/source/detail?r=35). It offers better speed for 64-bits applications. + +Hash comparison (single thread, Linux Mint 64 bits, using [Open Source's SMHasher](http://code.google.com/p/smhasher/wiki/SMHasher) on a Core i5 3340M @2.7GHs) +``` +Name Speed on 64 bits Speed on 32 bits +XXH64 13.8 GB/s 1.9 GB/s +XXH32 6.8 GB/s 6.0 GB/s +``` + +**[Download latest xxHash source code here](https://github.com/Cyan4973/xxHash/releases/latest)** + + +--- + + +### Other versions : ### + + * **Java** : by Adrien Grand, at https://github.com/jpountz/lz4-java + + * **Javascript** (pure) : by Pierre Curto, at https://npmjs.org/package/xxhashjs + + * **Javascript** (NodeJS binding) : by Brian White, at https://npmjs.org/package/xxhash + + * **JSX** (static Javascript) : by Yoshiki Shibukawa, at https://www.npmjs.org/package/xxhash.jsx + + * **Ruby** (pure) : by Justin W Smith, at http://rubygems.org/gems/ruby-xxHash + + * **Ruby** wrapper : by Vasiliy Ermolovich, at https://rubygems.org/gems/xxhash + + * **C#** (XXH32) : by Seok-ju Yun, at https://github.com/noricube/xxHashSharp + + * **C#** (XXH64) : by Brandon Dahler, at http://www.nuget.org/packages/System.Data.HashFunction.xxHash/ + + * **PHP** : by Stuart Herbert, at https://github.com/stuartherbert/php-xxhash + + * **Python** (XXH32) : by Ewen Cheslack-Postava, at https://pypi.python.org/pypi/pyhashxx/ + + * **Python** (XXH64) : by Yue Du, at https://pypi.python.org/pypi/xxhash/ + + * **Perl** : by Sanko Robinson, at https://metacpan.org/module/Digest::xxHash + + * **Pascal** : by Vojtěch Čihák, at http://sourceforge.net/projects/xxhashfpc + + * **Lua** (binding) : by Masatoshi Teruya, at https://github.com/mah0x211/lua-xxhash + + * **Lua-jit** : by szensk, at https://github.com/szensk/luaxxhash + + * **D** : by Masahiro Nakagawa, at https://github.com/repeatedly/xxhash-d + + * **Go** (XXH32) : by Stéphane Bunel, at https://bitbucket.org/StephaneBunel/xxhash-go + + * **Go** (XXH64) : by Ahmed Waheed, at https://github.com/OneOfOne/xxhash + + * **Haskell** : by Christian Marie, at http://hackage.haskell.org/package/xxhash + + * **Rust** : by György Andrasek, at https://github.com/Jurily/rust-xxhash + + * **Rust** : by Jake Goulding, at https://libraries.io/cargo/twox-hash + + * **Erlang** : by Pierre Matri, at https://github.com/pierresforge/erlang-xxhash + + + +--- + + +### What's new : ### + +[r39](https://code.google.com/p/xxhash/source/detail?r=39) : minor alignment adjustments + +[r38](https://code.google.com/p/xxhash/source/detail?r=38) : xxhsum can use stdin as input (default) + + + +--- + + +### xxHash is used by ### + + * **Databases** : PrestoDB [PrestoDB](http://prestodb.io/) [(\*)](https://github.com/facebook/presto/commit/87cb4f2ba8a57a3edb6e4d5a89658b6a3191b3e7), RocksDB [RocksDB](http://rocksdb.org/) [(\*)](https://github.com/facebook/rocksdb/pull/87), [ArangoDB](https://www.arangodb.org/) [(\*)](http://fossies.org/dox/ArangoDB-2.1.2/xxhash_8h.html) + + * **Games** : cocos2D [cocos2D](http://www.cocos2d.org/), PPSSPP [PPSSPP](http://ppsspp.org/) [(\*)](https://github.com/hrydgard/ppsspp/blob/master/ext/xxhash.h), dolphin [dolphin](https://dolphin-emu.org) [(\*)](https://github.com/dolphin-emu/dolphin/tree/master/Externals/xxhash) + + * **Security** : pfSense [pfSense](https://www.pfsense.org/) [(\*)](https://doc.pfsense.org/index.php/2.2_New_Features_and_Changes#OS_Changes), [Rspamd](https://rspamd.com/) [(\*)](https://github.com/vstakhov/rspamd/tree/master/contrib/xxhash), + + * **Filters** : [LZ4](https://code.google.com/p/lz4/) [(\*)](https://code.google.com/p/lz4/source/browse/#svn%2Ftrunk), [Flexible I/O Tester](http://freecode.com/projects/fio), [Bloomxx](https://npmjs.org/package/bloomxx), [C & Python Bloom Filter](http://devisedbydavid.com/open_source/bloom_filter), mozilla [Mozilla's LUA bloom filter](https://github.com/mozilla-services/lua_bloom_filter) + + * **Other** : [PKG](https://wiki.freebsd.org/pkgng) [(\*)](https://github.com/freebsd/pkg/blob/master/external/libucl/src/xxhash.c), Factor [Factor](http://factorcode.org/) [(\*)](http://re-factor.blogspot.fr/2014/04/checksum-improvements.html), Sliverstack [Silverstack](http://pomfort.com/silverstack/) [(\*)](http://dorkinatent.com/2014/10/10/silverstack-v4-0/), [TeamViewer](http://www.teamviewer.com/) [(\*)](http://fr.scribd.com/doc/252185217/CopyRights-FOR-TEAM-VIEWER#scribd), [simplebayes](https://pypi.python.org/pypi/simplebayes/1.0.1), NVBio [NVBio](http://nvlabs.github.io/nvbio/index.html) [(\*)](http://nvlabs.github.io/nvbio/xxhash_8h_source.html), RapidCopy [RapidCopy](http://www.lespace.co.jp/file_bl/rapidcopy/rapidcopy.html) \ No newline at end of file diff --git a/README.md b/README.md deleted file mode 100644 index 06f6376..0000000 --- a/README.md +++ /dev/null @@ -1,74 +0,0 @@ -xxHash - Extremely fast hash algorithm -====================================== - -xxHash is an Extremely fast Hash algorithm, running at RAM speed limits. -It successfully passes the [SMHasher](http://code.google.com/p/smhasher/wiki/SMHasher) Test suite evaluating Hash quality. - -|Branch |Status | -|------------|---------| -|master | [![Build Status](https://travis-ci.org/Cyan4973/xxHash.svg?branch=master)](https://travis-ci.org/Cyan4973/xxHash?branch=master) | -|dev | [![Build Status](https://travis-ci.org/Cyan4973/xxHash.svg?branch=dev)](https://travis-ci.org/Cyan4973/xxHash?branch=dev) | - - -Benchmarks -------------------------- - -The benchmark uses SMHasher speed test, compiled with Visual on a Windows Seven 32 bits system. -The reference system uses a Core 2 Duo @3GHz - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
NameSpeedQ.ScoreAuthor
xxHash5.4 GB/s10Y.C.
MumurHash 3a2.7 GB/s10Austin Appleby
SBox1.4 GB/s9Bret Mulvey
Lookup31.2 GB/s9Bob Jenkins
CityHash641.05 GB/s10Pike & Alakuijala
FNV0.55 GB/s5Fowler, Noll, Vo
CRC320.43 GB/s9
SipHash0.34 GB/s10Jean-Philippe Aumasson
MD5-320.33 GB/s10Ronald L. Rivest
SHA1-320.28 GB/s10
- - -Q.Score is a measure of quality of the hash function. -It depends on successfully passing SMHasher test set. -10 is a perfect score. - -A new version, XXH64, has been created thanks to Mathias Westerdahl contribution, which offers superior speed and dispersion for 64-bits systems. Note however that 32-bits applications will still run faster using the 32-bits version. - -SMHasher speed test, compiled using GCC 4.8.2, a Linux Mint 64-bits. -The reference system uses a Core i5-3340M @2.7GHz - -| Version | Speed on 64-bits | Speed on 32-bits | -|------------|------------------|------------------| -| XXH64 | 13.8 GB/s | 1.9 GB/s | -| XXH32 | 6.8 GB/s | 6.0 GB/s | - - -This is an official mirror of xxHash project, [hosted on Google Code](http://code.google.com/p/xxhash/). -The intention is to offer github's capabilities to xxhash users, such as cloning, branch, pull requests or source download. - -The "master" branch will reflect, the status of xxhash at its official homepage. The "dev" branch is the one where all contributions will be merged. If you plan to propose a patch, please commit into the "dev" branch. Direct commit to "master" are not permitted. Feature branches will also exist, typically to introduce new requirements, and be temporarily available for testing before merge into "dev" branch. diff --git a/xxh32.md b/xxh32.md new file mode 100644 index 0000000..e5cc3e6 --- /dev/null +++ b/xxh32.md @@ -0,0 +1,280 @@ +# SMHasher result for XXH32 # + +This is the dump of SMHasher test set +run on a Core i5 560M +using XXH32() function. + + +# Result Log # +``` +------------------------------------------------------------------------------- +--- Testing xxh32 (xxHash32 -- 32-bits output) + +[[[ Speed Tests ]]] + +Bulk speed test - 262144-byte keys +Alignment 0 - 2.137 bytes/cycle - 6113.02 MiB/sec @ 3 ghz +Alignment 1 - 2.050 bytes/cycle - 5863.99 MiB/sec @ 3 ghz +Alignment 2 - 2.197 bytes/cycle - 6286.80 MiB/sec @ 3 ghz +Alignment 3 - 2.096 bytes/cycle - 5996.60 MiB/sec @ 3 ghz +Alignment 4 - 2.183 bytes/cycle - 6245.49 MiB/sec @ 3 ghz +Alignment 5 - 2.180 bytes/cycle - 6237.00 MiB/sec @ 3 ghz +Alignment 6 - 2.183 bytes/cycle - 6245.11 MiB/sec @ 3 ghz +Alignment 7 - 2.285 bytes/cycle - 6538.21 MiB/sec @ 3 ghz + +Small key speed test - 1-byte keys - 38.69 cycles/hash +Small key speed test - 2-byte keys - 42.32 cycles/hash +Small key speed test - 3-byte keys - 37.71 cycles/hash +Small key speed test - 4-byte keys - 37.27 cycles/hash +Small key speed test - 5-byte keys - 34.15 cycles/hash +Small key speed test - 6-byte keys - 38.04 cycles/hash +Small key speed test - 7-byte keys - 36.42 cycles/hash +Small key speed test - 8-byte keys - 31.55 cycles/hash +Small key speed test - 9-byte keys - 38.67 cycles/hash +Small key speed test - 10-byte keys - 38.71 cycles/hash +Small key speed test - 11-byte keys - 39.84 cycles/hash +Small key speed test - 12-byte keys - 36.29 cycles/hash +Small key speed test - 13-byte keys - 36.56 cycles/hash +Small key speed test - 14-byte keys - 37.11 cycles/hash +Small key speed test - 15-byte keys - 41.97 cycles/hash +Small key speed test - 16-byte keys - 44.25 cycles/hash +Small key speed test - 17-byte keys - 44.52 cycles/hash +Small key speed test - 18-byte keys - 48.30 cycles/hash +Small key speed test - 19-byte keys - 48.03 cycles/hash +Small key speed test - 20-byte keys - 42.72 cycles/hash +Small key speed test - 21-byte keys - 44.93 cycles/hash +Small key speed test - 22-byte keys - 48.88 cycles/hash +Small key speed test - 23-byte keys - 54.23 cycles/hash +Small key speed test - 24-byte keys - 46.28 cycles/hash +Small key speed test - 25-byte keys - 49.70 cycles/hash +Small key speed test - 26-byte keys - 51.01 cycles/hash +Small key speed test - 27-byte keys - 56.20 cycles/hash +Small key speed test - 28-byte keys - 50.54 cycles/hash +Small key speed test - 29-byte keys - 53.46 cycles/hash +Small key speed test - 30-byte keys - 53.54 cycles/hash +Small key speed test - 31-byte keys - 57.09 cycles/hash +Small key speed test - 32-byte keys - 50.02 cycles/hash + +[[[ Avalanche Tests ]]] + +Testing 32-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.61% +Testing 40-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.63% +Testing 48-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.56% +Testing 56-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.65% +Testing 64-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.72% +Testing 72-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.67% +Testing 80-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.71% +Testing 88-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.65% +Testing 96-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.70% +Testing 104-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.66% +Testing 112-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.80% +Testing 120-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.62% +Testing 128-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.73% +Testing 136-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.64% +Testing 144-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.73% +Testing 152-bit keys -> 32-bit hashes, 300000 reps.......... worst bias is 0.67% + +[[[ Keyset 'Cyclic' Tests ]]] + +Keyset 'Cyclic' - 8 cycles of 4 bytes - 10000000 keys +Testing collisions - Expected 11641.53, actual 13288.00 ( 1.14x) +Testing distribution - Worst bias is the 20-bit window at bit 15 - 0.027% + +Keyset 'Cyclic' - 8 cycles of 5 bytes - 10000000 keys +Testing collisions - Expected 11641.53, actual 11648.00 ( 1.00x) +Testing distribution - Worst bias is the 20-bit window at bit 27 - 0.024% + +Keyset 'Cyclic' - 8 cycles of 6 bytes - 10000000 keys +Testing collisions - Expected 11641.53, actual 11818.00 ( 1.02x) +Testing distribution - Worst bias is the 20-bit window at bit 0 - 0.047% + +Keyset 'Cyclic' - 8 cycles of 7 bytes - 10000000 keys +Testing collisions - Expected 11641.53, actual 11775.00 ( 1.01x) +Testing distribution - Worst bias is the 20-bit window at bit 19 - 0.042% + +Keyset 'Cyclic' - 8 cycles of 8 bytes - 10000000 keys +Testing collisions - Expected 11641.53, actual 11698.00 ( 1.00x) +Testing distribution - Worst bias is the 20-bit window at bit 2 - 0.029% + + +[[[ Keyset 'TwoBytes' Tests ]]] + +Keyset 'TwoBytes' - up-to-4-byte keys, 652545 total keys +Testing collisions - Expected 49.57, actual 21.00 ( 0.42x) +Testing distribution - Worst bias is the 16-bit window at bit 4 - 0.120% + +Keyset 'TwoBytes' - up-to-8-byte keys, 5471025 total keys +Testing collisions - Expected 3484.56, actual 5704.00 ( 1.64x) +Testing distribution - Worst bias is the 20-bit window at bit 15 - 0.080% + +Keyset 'TwoBytes' - up-to-12-byte keys, 18616785 total keys +Testing collisions - Expected 40347.77, actual 54791.00 ( 1.36x) +Testing distribution - Worst bias is the 20-bit window at bit 9 - 0.031% + +Keyset 'TwoBytes' - up-to-16-byte keys, 44251425 total keys +Testing collisions - Expected 227963.15, actual 303277.00 ( 1.33x) +Testing distribution - Worst bias is the 20-bit window at bit 30 - 0.017% + +Keyset 'TwoBytes' - up-to-20-byte keys, 86536545 total keys +Testing collisions - Expected 871784.70, actual 1120225.00 ( 1.28x) +Testing distribution - Worst bias is the 20-bit window at bit 1 - 0.012% + + +[[[ Keyset 'Sparse' Tests ]]] + +Keyset 'Sparse' - 32-bit keys with up to 6 bits set - 1149017 keys +Testing collisions - Expected 153.70, actual 0.00 ( 0.00x) +Testing distribution - Worst bias is the 17-bit window at bit 18 - 0.136% + +Keyset 'Sparse' - 40-bit keys with up to 6 bits set - 4598479 keys +Testing collisions - Expected 2461.72, actual 1569.00 ( 0.64x) +Testing distribution - Worst bias is the 18-bit window at bit 5 - 0.026% + +Keyset 'Sparse' - 48-bit keys with up to 5 bits set - 1925357 keys +Testing collisions - Expected 431.55, actual 415.00 ( 0.96x) +Testing distribution - Worst bias is the 18-bit window at bit 2 - 0.055% + +Keyset 'Sparse' - 56-bit keys with up to 5 bits set - 4216423 keys +Testing collisions - Expected 2069.66, actual 1904.00 ( 0.92x) +Testing distribution - Worst bias is the 19-bit window at bit 2 - 0.045% + +Keyset 'Sparse' - 64-bit keys with up to 5 bits set - 8303633 keys +Testing collisions - Expected 8026.87, actual 12402.00 ( 1.55x) +Testing distribution - Worst bias is the 20-bit window at bit 1 - 0.035% + +Keyset 'Sparse' - 96-bit keys with up to 4 bits set - 3469497 keys +Testing collisions - Expected 1401.34, actual 1882.00 ( 1.34x) +Testing distribution - Worst bias is the 19-bit window at bit 13 - 0.053% + +Keyset 'Sparse' - 256-bit keys with up to 3 bits set - 2796417 keys +Testing collisions - Expected 910.36, actual 934.00 ( 1.03x) +Testing distribution - Worst bias is the 19-bit window at bit 16 - 0.069% + +Keyset 'Sparse' - 2048-bit keys with up to 2 bits set - 2098177 keys +Testing collisions - Expected 512.50, actual 499.00 ( 0.97x) +Testing distribution - Worst bias is the 18-bit window at bit 20 - 0.093% + + +[[[ Keyset 'Combination Lowbits' Tests ]]] + +Keyset 'Combination' - up to 8 blocks from a set of 8 - 19173960 keys +Testing collisions - Expected 42799.01, actual 39339.00 ( 0.92x) +Testing distribution - Worst bias is the 20-bit window at bit 2 - 0.027% + + +[[[ Keyset 'Combination Highbits' Tests ]]] + +Keyset 'Combination' - up to 8 blocks from a set of 8 - 19173960 keys +Testing collisions - Expected 42799.01, actual 52120.00 ( 1.22x) +Testing distribution - Worst bias is the 20-bit window at bit 12 - 0.027% + + +[[[ Keyset 'Combination 0x8000000' Tests ]]] + +Keyset 'Combination' - up to 20 blocks from a set of 2 - 2097150 keys +Testing collisions - Expected 512.00, actual 527.00 ( 1.03x) +Testing distribution - Worst bias is the 17-bit window at bit 10 - 0.041% + + +[[[ Keyset 'Combination 0x0000001' Tests ]]] + +Keyset 'Combination' - up to 20 blocks from a set of 2 - 2097150 keys +Testing collisions - Expected 512.00, actual 501.00 ( 0.98x) +Testing distribution - Worst bias is the 18-bit window at bit 19 - 0.064% + + +[[[ Keyset 'Combination Hi-Lo' Tests ]]] + +Keyset 'Combination' - up to 6 blocks from a set of 15 - 12204240 keys +Testing collisions - Expected 17339.30, actual 18655.00 ( 1.08x) +Testing distribution - Worst bias is the 20-bit window at bit 15 - 0.025% + + +[[[ Keyset 'Window' Tests ]]] + +Keyset 'Windowed' - 64-bit key, 20-bit window - 64 tests, 1048576 keys per test +Window at 0 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 1 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 2 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 3 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 4 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 5 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 6 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 7 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 8 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 9 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 10 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 11 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 12 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 13 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 14 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 15 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 16 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 17 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 18 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 19 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 20 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 21 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 22 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 23 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 24 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 25 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 26 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 27 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 28 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 29 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 30 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 31 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 32 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 33 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 34 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 35 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 36 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 37 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 38 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 39 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 40 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 41 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 42 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 43 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 44 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 45 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 46 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 47 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 48 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 49 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 50 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 51 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 52 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 53 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 54 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 55 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 56 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 57 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 58 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 59 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 60 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 61 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 62 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 63 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) +Window at 64 - Testing collisions - Expected 128.00, actual 0.00 ( 0.00x) + +[[[ Keyset 'Zeroes' Tests ]]] + +Keyset 'Zeroes' - 65536 keys +Testing collisions - Expected 0.50, actual 0.00 ( 0.00x) +Testing distribution - Worst bias is the 13-bit window at bit 27 - 0.269% + + +[[[ Keyset 'Seed' Tests ]]] + +Keyset 'Seed' - 1000000 keys +Testing collisions - Expected 116.42, actual 40.00 ( 0.34x) +Testing distribution - Worst bias is the 17-bit window at bit 11 - 0.080% + + + +Input vcode 0x385455b6, Output vcode 0x0ceacd33, Result vcode 0x00000001 +Verification value is 0x00000001 - Testing took 465.779000 seconds +------------------------------------------------------------------------------- +``` \ No newline at end of file diff --git a/xxhash.c b/xxhash.c deleted file mode 100644 index 24a64b5..0000000 --- a/xxhash.c +++ /dev/null @@ -1,928 +0,0 @@ -/* -xxHash - Fast Hash algorithm -Copyright (C) 2012-2014, Yann Collet. -BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php) - -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. - -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. - -You can contact the author at : -- xxHash source repository : http://code.google.com/p/xxhash/ -- public discussion board : https://groups.google.com/forum/#!forum/lz4c -*/ - - -//************************************** -// Tuning parameters -//************************************** -// Unaligned memory access is automatically enabled for "common" CPU, such as x86. -// For others CPU, the compiler will be more cautious, and insert extra code to ensure aligned access is respected. -// If you know your target CPU supports unaligned memory access, you want to force this option manually to improve performance. -// You can also enable this parameter if you know your input data will always be aligned (boundaries of 4, for U32). -#if defined(__ARM_FEATURE_UNALIGNED) || defined(__i386) || defined(_M_IX86) || defined(__x86_64__) || defined(_M_X64) -# define XXH_USE_UNALIGNED_ACCESS 1 -#endif - -// XXH_ACCEPT_NULL_INPUT_POINTER : -// If the input pointer is a null pointer, xxHash default behavior is to trigger a memory access error, since it is a bad pointer. -// When this option is enabled, xxHash output for null input pointers will be the same as a null-length input. -// This option has a very small performance cost (only measurable on small inputs). -// By default, this option is disabled. To enable it, uncomment below define : -// #define XXH_ACCEPT_NULL_INPUT_POINTER 1 - -// XXH_FORCE_NATIVE_FORMAT : -// By default, xxHash library provides endian-independant Hash values, based on little-endian convention. -// Results are therefore identical for little-endian and big-endian CPU. -// This comes at a performance cost for big-endian CPU, since some swapping is required to emulate little-endian format. -// Should endian-independance be of no importance for your application, you may set the #define below to 1. -// It will improve speed for Big-endian CPU. -// This option has no impact on Little_Endian CPU. -#define XXH_FORCE_NATIVE_FORMAT 0 - -//************************************** -// Compiler Specific Options -//************************************** -// Disable some Visual warning messages -#ifdef _MSC_VER // Visual Studio -# pragma warning(disable : 4127) // disable: C4127: conditional expression is constant -#endif - -#ifdef _MSC_VER // Visual Studio -# define FORCE_INLINE static __forceinline -#else -# ifdef __GNUC__ -# define FORCE_INLINE static inline __attribute__((always_inline)) -# else -# define FORCE_INLINE static inline -# endif -#endif - -//************************************** -// Includes & Memory related functions -//************************************** -#include "xxhash.h" -// Modify the local functions below should you wish to use some other memory routines -// for malloc(), free() -#include -static void* XXH_malloc(size_t s) { return malloc(s); } -static void XXH_free (void* p) { free(p); } -// for memcpy() -#include -static void* XXH_memcpy(void* dest, const void* src, size_t size) -{ - return memcpy(dest,src,size); -} - - -//************************************** -// Basic Types -//************************************** -#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L // C99 -# include -typedef uint8_t BYTE; -typedef uint16_t U16; -typedef uint32_t U32; -typedef int32_t S32; -typedef uint64_t U64; -#else -typedef unsigned char BYTE; -typedef unsigned short U16; -typedef unsigned int U32; -typedef signed int S32; -typedef unsigned long long U64; -#endif - -#if defined(__GNUC__) && !defined(XXH_USE_UNALIGNED_ACCESS) -# define _PACKED __attribute__ ((packed)) -#else -# define _PACKED -#endif - -#if !defined(XXH_USE_UNALIGNED_ACCESS) && !defined(__GNUC__) -# ifdef __IBMC__ -# pragma pack(1) -# else -# pragma pack(push, 1) -# endif -#endif - -typedef struct _U32_S -{ - U32 v; -} _PACKED U32_S; -typedef struct _U64_S -{ - U64 v; -} _PACKED U64_S; - -#if !defined(XXH_USE_UNALIGNED_ACCESS) && !defined(__GNUC__) -# pragma pack(pop) -#endif - -#define A32(x) (((U32_S *)(x))->v) -#define A64(x) (((U64_S *)(x))->v) - - -//*************************************** -// Compiler-specific Functions and Macros -//*************************************** -#define GCC_VERSION (__GNUC__ * 100 + __GNUC_MINOR__) - -// Note : although _rotl exists for minGW (GCC under windows), performance seems poor -#if defined(_MSC_VER) -# define XXH_rotl32(x,r) _rotl(x,r) -# define XXH_rotl64(x,r) _rotl64(x,r) -#else -# define XXH_rotl32(x,r) ((x << r) | (x >> (32 - r))) -# define XXH_rotl64(x,r) ((x << r) | (x >> (64 - r))) -#endif - -#if defined(_MSC_VER) // Visual Studio -# define XXH_swap32 _byteswap_ulong -# define XXH_swap64 _byteswap_uint64 -#elif GCC_VERSION >= 403 -# define XXH_swap32 __builtin_bswap32 -# define XXH_swap64 __builtin_bswap64 -#else -static inline U32 XXH_swap32 (U32 x) -{ - return ((x << 24) & 0xff000000 ) | - ((x << 8) & 0x00ff0000 ) | - ((x >> 8) & 0x0000ff00 ) | - ((x >> 24) & 0x000000ff ); -} -static inline U64 XXH_swap64 (U64 x) -{ - return ((x << 56) & 0xff00000000000000ULL) | - ((x << 40) & 0x00ff000000000000ULL) | - ((x << 24) & 0x0000ff0000000000ULL) | - ((x << 8) & 0x000000ff00000000ULL) | - ((x >> 8) & 0x00000000ff000000ULL) | - ((x >> 24) & 0x0000000000ff0000ULL) | - ((x >> 40) & 0x000000000000ff00ULL) | - ((x >> 56) & 0x00000000000000ffULL); -} -#endif - - -//************************************** -// Constants -//************************************** -#define PRIME32_1 2654435761U -#define PRIME32_2 2246822519U -#define PRIME32_3 3266489917U -#define PRIME32_4 668265263U -#define PRIME32_5 374761393U - -#define PRIME64_1 11400714785074694791ULL -#define PRIME64_2 14029467366897019727ULL -#define PRIME64_3 1609587929392839161ULL -#define PRIME64_4 9650029242287828579ULL -#define PRIME64_5 2870177450012600261ULL - -//************************************** -// Architecture Macros -//************************************** -typedef enum { XXH_bigEndian=0, XXH_littleEndian=1 } XXH_endianess; -#ifndef XXH_CPU_LITTLE_ENDIAN // It is possible to define XXH_CPU_LITTLE_ENDIAN externally, for example using a compiler switch -static const int one = 1; -# define XXH_CPU_LITTLE_ENDIAN (*(char*)(&one)) -#endif - - -//************************************** -// Macros -//************************************** -#define XXH_STATIC_ASSERT(c) { enum { XXH_static_assert = 1/(!!(c)) }; } // use only *after* variable declarations - - -//**************************** -// Memory reads -//**************************** -typedef enum { XXH_aligned, XXH_unaligned } XXH_alignment; - -FORCE_INLINE U32 XXH_readLE32_align(const void* ptr, XXH_endianess endian, XXH_alignment align) -{ - if (align==XXH_unaligned) - return endian==XXH_littleEndian ? A32(ptr) : XXH_swap32(A32(ptr)); - else - return endian==XXH_littleEndian ? *(U32*)ptr : XXH_swap32(*(U32*)ptr); -} - -FORCE_INLINE U32 XXH_readLE32(const void* ptr, XXH_endianess endian) -{ - return XXH_readLE32_align(ptr, endian, XXH_unaligned); -} - -FORCE_INLINE U64 XXH_readLE64_align(const void* ptr, XXH_endianess endian, XXH_alignment align) -{ - if (align==XXH_unaligned) - return endian==XXH_littleEndian ? A64(ptr) : XXH_swap64(A64(ptr)); - else - return endian==XXH_littleEndian ? *(U64*)ptr : XXH_swap64(*(U64*)ptr); -} - -FORCE_INLINE U64 XXH_readLE64(const void* ptr, XXH_endianess endian) -{ - return XXH_readLE64_align(ptr, endian, XXH_unaligned); -} - - -//**************************** -// Simple Hash Functions -//**************************** -FORCE_INLINE U32 XXH32_endian_align(const void* input, size_t len, U32 seed, XXH_endianess endian, XXH_alignment align) -{ - const BYTE* p = (const BYTE*)input; - const BYTE* bEnd = p + len; - U32 h32; -#define XXH_get32bits(p) XXH_readLE32_align(p, endian, align) - -#ifdef XXH_ACCEPT_NULL_INPUT_POINTER - if (p==NULL) - { - len=0; - bEnd=p=(const BYTE*)(size_t)16; - } -#endif - - if (len>=16) - { - const BYTE* const limit = bEnd - 16; - U32 v1 = seed + PRIME32_1 + PRIME32_2; - U32 v2 = seed + PRIME32_2; - U32 v3 = seed + 0; - U32 v4 = seed - PRIME32_1; - - do - { - v1 += XXH_get32bits(p) * PRIME32_2; - v1 = XXH_rotl32(v1, 13); - v1 *= PRIME32_1; - p+=4; - v2 += XXH_get32bits(p) * PRIME32_2; - v2 = XXH_rotl32(v2, 13); - v2 *= PRIME32_1; - p+=4; - v3 += XXH_get32bits(p) * PRIME32_2; - v3 = XXH_rotl32(v3, 13); - v3 *= PRIME32_1; - p+=4; - v4 += XXH_get32bits(p) * PRIME32_2; - v4 = XXH_rotl32(v4, 13); - v4 *= PRIME32_1; - p+=4; - } - while (p<=limit); - - h32 = XXH_rotl32(v1, 1) + XXH_rotl32(v2, 7) + XXH_rotl32(v3, 12) + XXH_rotl32(v4, 18); - } - else - { - h32 = seed + PRIME32_5; - } - - h32 += (U32) len; - - while (p+4<=bEnd) - { - h32 += XXH_get32bits(p) * PRIME32_3; - h32 = XXH_rotl32(h32, 17) * PRIME32_4 ; - p+=4; - } - - while (p> 15; - h32 *= PRIME32_2; - h32 ^= h32 >> 13; - h32 *= PRIME32_3; - h32 ^= h32 >> 16; - - return h32; -} - - -unsigned int XXH32 (const void* input, size_t len, unsigned seed) -{ -#if 0 - // Simple version, good for code maintenance, but unfortunately slow for small inputs - XXH32_state_t state; - XXH32_reset(&state, seed); - XXH32_update(&state, input, len); - return XXH32_digest(&state); -#else - XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN; - -# if !defined(XXH_USE_UNALIGNED_ACCESS) - if ((((size_t)input) & 3) == 0) // Input is aligned, let's leverage the speed advantage - { - if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT) - return XXH32_endian_align(input, len, seed, XXH_littleEndian, XXH_aligned); - else - return XXH32_endian_align(input, len, seed, XXH_bigEndian, XXH_aligned); - } -# endif - - if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT) - return XXH32_endian_align(input, len, seed, XXH_littleEndian, XXH_unaligned); - else - return XXH32_endian_align(input, len, seed, XXH_bigEndian, XXH_unaligned); -#endif -} - -FORCE_INLINE U64 XXH64_endian_align(const void* input, size_t len, U64 seed, XXH_endianess endian, XXH_alignment align) -{ - const BYTE* p = (const BYTE*)input; - const BYTE* bEnd = p + len; - U64 h64; -#define XXH_get64bits(p) XXH_readLE64_align(p, endian, align) - -#ifdef XXH_ACCEPT_NULL_INPUT_POINTER - if (p==NULL) - { - len=0; - bEnd=p=(const BYTE*)(size_t)32; - } -#endif - - if (len>=32) - { - const BYTE* const limit = bEnd - 32; - U64 v1 = seed + PRIME64_1 + PRIME64_2; - U64 v2 = seed + PRIME64_2; - U64 v3 = seed + 0; - U64 v4 = seed - PRIME64_1; - - do - { - v1 += XXH_get64bits(p) * PRIME64_2; - p+=8; - v1 = XXH_rotl64(v1, 31); - v1 *= PRIME64_1; - v2 += XXH_get64bits(p) * PRIME64_2; - p+=8; - v2 = XXH_rotl64(v2, 31); - v2 *= PRIME64_1; - v3 += XXH_get64bits(p) * PRIME64_2; - p+=8; - v3 = XXH_rotl64(v3, 31); - v3 *= PRIME64_1; - v4 += XXH_get64bits(p) * PRIME64_2; - p+=8; - v4 = XXH_rotl64(v4, 31); - v4 *= PRIME64_1; - } - while (p<=limit); - - h64 = XXH_rotl64(v1, 1) + XXH_rotl64(v2, 7) + XXH_rotl64(v3, 12) + XXH_rotl64(v4, 18); - - v1 *= PRIME64_2; - v1 = XXH_rotl64(v1, 31); - v1 *= PRIME64_1; - h64 ^= v1; - h64 = h64 * PRIME64_1 + PRIME64_4; - - v2 *= PRIME64_2; - v2 = XXH_rotl64(v2, 31); - v2 *= PRIME64_1; - h64 ^= v2; - h64 = h64 * PRIME64_1 + PRIME64_4; - - v3 *= PRIME64_2; - v3 = XXH_rotl64(v3, 31); - v3 *= PRIME64_1; - h64 ^= v3; - h64 = h64 * PRIME64_1 + PRIME64_4; - - v4 *= PRIME64_2; - v4 = XXH_rotl64(v4, 31); - v4 *= PRIME64_1; - h64 ^= v4; - h64 = h64 * PRIME64_1 + PRIME64_4; - } - else - { - h64 = seed + PRIME64_5; - } - - h64 += (U64) len; - - while (p+8<=bEnd) - { - U64 k1 = XXH_get64bits(p); - k1 *= PRIME64_2; - k1 = XXH_rotl64(k1,31); - k1 *= PRIME64_1; - h64 ^= k1; - h64 = XXH_rotl64(h64,27) * PRIME64_1 + PRIME64_4; - p+=8; - } - - if (p+4<=bEnd) - { - h64 ^= (U64)(XXH_get32bits(p)) * PRIME64_1; - h64 = XXH_rotl64(h64, 23) * PRIME64_2 + PRIME64_3; - p+=4; - } - - while (p> 33; - h64 *= PRIME64_2; - h64 ^= h64 >> 29; - h64 *= PRIME64_3; - h64 ^= h64 >> 32; - - return h64; -} - - -unsigned long long XXH64 (const void* input, size_t len, unsigned long long seed) -{ -#if 0 - // Simple version, good for code maintenance, but unfortunately slow for small inputs - XXH64_state_t state; - XXH64_reset(&state, seed); - XXH64_update(&state, input, len); - return XXH64_digest(&state); -#else - XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN; - -# if !defined(XXH_USE_UNALIGNED_ACCESS) - if ((((size_t)input) & 7)==0) // Input is aligned, let's leverage the speed advantage - { - if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT) - return XXH64_endian_align(input, len, seed, XXH_littleEndian, XXH_aligned); - else - return XXH64_endian_align(input, len, seed, XXH_bigEndian, XXH_aligned); - } -# endif - - if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT) - return XXH64_endian_align(input, len, seed, XXH_littleEndian, XXH_unaligned); - else - return XXH64_endian_align(input, len, seed, XXH_bigEndian, XXH_unaligned); -#endif -} - -/**************************************************** - * Advanced Hash Functions -****************************************************/ - -/*** Allocation ***/ -typedef struct -{ - U64 total_len; - U32 seed; - U32 v1; - U32 v2; - U32 v3; - U32 v4; - U32 mem32[4]; /* defined as U32 for alignment */ - U32 memsize; -} XXH_istate32_t; - -typedef struct -{ - U64 total_len; - U64 seed; - U64 v1; - U64 v2; - U64 v3; - U64 v4; - U64 mem64[4]; /* defined as U64 for alignment */ - U32 memsize; -} XXH_istate64_t; - - -XXH32_state_t* XXH32_createState(void) -{ - XXH_STATIC_ASSERT(sizeof(XXH32_state_t) >= sizeof(XXH_istate32_t)); // A compilation error here means XXH32_state_t is not large enough - return (XXH32_state_t*)XXH_malloc(sizeof(XXH32_state_t)); -} -XXH_errorcode XXH32_freeState(XXH32_state_t* statePtr) -{ - XXH_free(statePtr); - return XXH_OK; -}; - -XXH64_state_t* XXH64_createState(void) -{ - XXH_STATIC_ASSERT(sizeof(XXH64_state_t) >= sizeof(XXH_istate64_t)); // A compilation error here means XXH64_state_t is not large enough - return (XXH64_state_t*)XXH_malloc(sizeof(XXH64_state_t)); -} -XXH_errorcode XXH64_freeState(XXH64_state_t* statePtr) -{ - XXH_free(statePtr); - return XXH_OK; -}; - - -/*** Hash feed ***/ - -XXH_errorcode XXH32_reset(XXH32_state_t* state_in, U32 seed) -{ - XXH_istate32_t* state = (XXH_istate32_t*) state_in; - state->seed = seed; - state->v1 = seed + PRIME32_1 + PRIME32_2; - state->v2 = seed + PRIME32_2; - state->v3 = seed + 0; - state->v4 = seed - PRIME32_1; - state->total_len = 0; - state->memsize = 0; - return XXH_OK; -} - -XXH_errorcode XXH64_reset(XXH64_state_t* state_in, unsigned long long seed) -{ - XXH_istate64_t* state = (XXH_istate64_t*) state_in; - state->seed = seed; - state->v1 = seed + PRIME64_1 + PRIME64_2; - state->v2 = seed + PRIME64_2; - state->v3 = seed + 0; - state->v4 = seed - PRIME64_1; - state->total_len = 0; - state->memsize = 0; - return XXH_OK; -} - - -FORCE_INLINE XXH_errorcode XXH32_update_endian (XXH32_state_t* state_in, const void* input, size_t len, XXH_endianess endian) -{ - XXH_istate32_t* state = (XXH_istate32_t *) state_in; - const BYTE* p = (const BYTE*)input; - const BYTE* const bEnd = p + len; - -#ifdef XXH_ACCEPT_NULL_INPUT_POINTER - if (input==NULL) return XXH_ERROR; -#endif - - state->total_len += len; - - if (state->memsize + len < 16) // fill in tmp buffer - { - XXH_memcpy((BYTE*)(state->mem32) + state->memsize, input, len); - state->memsize += (U32)len; - return XXH_OK; - } - - if (state->memsize) // some data left from previous update - { - XXH_memcpy((BYTE*)(state->mem32) + state->memsize, input, 16-state->memsize); - { - const U32* p32 = state->mem32; - state->v1 += XXH_readLE32(p32, endian) * PRIME32_2; - state->v1 = XXH_rotl32(state->v1, 13); - state->v1 *= PRIME32_1; - p32++; - state->v2 += XXH_readLE32(p32, endian) * PRIME32_2; - state->v2 = XXH_rotl32(state->v2, 13); - state->v2 *= PRIME32_1; - p32++; - state->v3 += XXH_readLE32(p32, endian) * PRIME32_2; - state->v3 = XXH_rotl32(state->v3, 13); - state->v3 *= PRIME32_1; - p32++; - state->v4 += XXH_readLE32(p32, endian) * PRIME32_2; - state->v4 = XXH_rotl32(state->v4, 13); - state->v4 *= PRIME32_1; - p32++; - } - p += 16-state->memsize; - state->memsize = 0; - } - - if (p <= bEnd-16) - { - const BYTE* const limit = bEnd - 16; - U32 v1 = state->v1; - U32 v2 = state->v2; - U32 v3 = state->v3; - U32 v4 = state->v4; - - do - { - v1 += XXH_readLE32(p, endian) * PRIME32_2; - v1 = XXH_rotl32(v1, 13); - v1 *= PRIME32_1; - p+=4; - v2 += XXH_readLE32(p, endian) * PRIME32_2; - v2 = XXH_rotl32(v2, 13); - v2 *= PRIME32_1; - p+=4; - v3 += XXH_readLE32(p, endian) * PRIME32_2; - v3 = XXH_rotl32(v3, 13); - v3 *= PRIME32_1; - p+=4; - v4 += XXH_readLE32(p, endian) * PRIME32_2; - v4 = XXH_rotl32(v4, 13); - v4 *= PRIME32_1; - p+=4; - } - while (p<=limit); - - state->v1 = v1; - state->v2 = v2; - state->v3 = v3; - state->v4 = v4; - } - - if (p < bEnd) - { - XXH_memcpy(state->mem32, p, bEnd-p); - state->memsize = (int)(bEnd-p); - } - - return XXH_OK; -} - -XXH_errorcode XXH32_update (XXH32_state_t* state_in, const void* input, size_t len) -{ - XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN; - - if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT) - return XXH32_update_endian(state_in, input, len, XXH_littleEndian); - else - return XXH32_update_endian(state_in, input, len, XXH_bigEndian); -} - - - -FORCE_INLINE U32 XXH32_digest_endian (const XXH32_state_t* state_in, XXH_endianess endian) -{ - XXH_istate32_t* state = (XXH_istate32_t*) state_in; - const BYTE * p = (const BYTE*)state->mem32; - BYTE* bEnd = (BYTE*)(state->mem32) + state->memsize; - U32 h32; - - if (state->total_len >= 16) - { - h32 = XXH_rotl32(state->v1, 1) + XXH_rotl32(state->v2, 7) + XXH_rotl32(state->v3, 12) + XXH_rotl32(state->v4, 18); - } - else - { - h32 = state->seed + PRIME32_5; - } - - h32 += (U32) state->total_len; - - while (p+4<=bEnd) - { - h32 += XXH_readLE32(p, endian) * PRIME32_3; - h32 = XXH_rotl32(h32, 17) * PRIME32_4; - p+=4; - } - - while (p> 15; - h32 *= PRIME32_2; - h32 ^= h32 >> 13; - h32 *= PRIME32_3; - h32 ^= h32 >> 16; - - return h32; -} - - -U32 XXH32_digest (const XXH32_state_t* state_in) -{ - XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN; - - if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT) - return XXH32_digest_endian(state_in, XXH_littleEndian); - else - return XXH32_digest_endian(state_in, XXH_bigEndian); -} - - -FORCE_INLINE XXH_errorcode XXH64_update_endian (XXH64_state_t* state_in, const void* input, size_t len, XXH_endianess endian) -{ - XXH_istate64_t * state = (XXH_istate64_t *) state_in; - const BYTE* p = (const BYTE*)input; - const BYTE* const bEnd = p + len; - -#ifdef XXH_ACCEPT_NULL_INPUT_POINTER - if (input==NULL) return XXH_ERROR; -#endif - - state->total_len += len; - - if (state->memsize + len < 32) // fill in tmp buffer - { - XXH_memcpy(((BYTE*)state->mem64) + state->memsize, input, len); - state->memsize += (U32)len; - return XXH_OK; - } - - if (state->memsize) // some data left from previous update - { - XXH_memcpy(((BYTE*)state->mem64) + state->memsize, input, 32-state->memsize); - { - const U64* p64 = state->mem64; - state->v1 += XXH_readLE64(p64, endian) * PRIME64_2; - state->v1 = XXH_rotl64(state->v1, 31); - state->v1 *= PRIME64_1; - p64++; - state->v2 += XXH_readLE64(p64, endian) * PRIME64_2; - state->v2 = XXH_rotl64(state->v2, 31); - state->v2 *= PRIME64_1; - p64++; - state->v3 += XXH_readLE64(p64, endian) * PRIME64_2; - state->v3 = XXH_rotl64(state->v3, 31); - state->v3 *= PRIME64_1; - p64++; - state->v4 += XXH_readLE64(p64, endian) * PRIME64_2; - state->v4 = XXH_rotl64(state->v4, 31); - state->v4 *= PRIME64_1; - p64++; - } - p += 32-state->memsize; - state->memsize = 0; - } - - if (p+32 <= bEnd) - { - const BYTE* const limit = bEnd - 32; - U64 v1 = state->v1; - U64 v2 = state->v2; - U64 v3 = state->v3; - U64 v4 = state->v4; - - do - { - v1 += XXH_readLE64(p, endian) * PRIME64_2; - v1 = XXH_rotl64(v1, 31); - v1 *= PRIME64_1; - p+=8; - v2 += XXH_readLE64(p, endian) * PRIME64_2; - v2 = XXH_rotl64(v2, 31); - v2 *= PRIME64_1; - p+=8; - v3 += XXH_readLE64(p, endian) * PRIME64_2; - v3 = XXH_rotl64(v3, 31); - v3 *= PRIME64_1; - p+=8; - v4 += XXH_readLE64(p, endian) * PRIME64_2; - v4 = XXH_rotl64(v4, 31); - v4 *= PRIME64_1; - p+=8; - } - while (p<=limit); - - state->v1 = v1; - state->v2 = v2; - state->v3 = v3; - state->v4 = v4; - } - - if (p < bEnd) - { - XXH_memcpy(state->mem64, p, bEnd-p); - state->memsize = (int)(bEnd-p); - } - - return XXH_OK; -} - -XXH_errorcode XXH64_update (XXH64_state_t* state_in, const void* input, size_t len) -{ - XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN; - - if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT) - return XXH64_update_endian(state_in, input, len, XXH_littleEndian); - else - return XXH64_update_endian(state_in, input, len, XXH_bigEndian); -} - - - -FORCE_INLINE U64 XXH64_digest_endian (const XXH64_state_t* state_in, XXH_endianess endian) -{ - XXH_istate64_t * state = (XXH_istate64_t *) state_in; - const BYTE * p = (const BYTE*)state->mem64; - BYTE* bEnd = (BYTE*)state->mem64 + state->memsize; - U64 h64; - - if (state->total_len >= 32) - { - U64 v1 = state->v1; - U64 v2 = state->v2; - U64 v3 = state->v3; - U64 v4 = state->v4; - - h64 = XXH_rotl64(v1, 1) + XXH_rotl64(v2, 7) + XXH_rotl64(v3, 12) + XXH_rotl64(v4, 18); - - v1 *= PRIME64_2; - v1 = XXH_rotl64(v1, 31); - v1 *= PRIME64_1; - h64 ^= v1; - h64 = h64*PRIME64_1 + PRIME64_4; - - v2 *= PRIME64_2; - v2 = XXH_rotl64(v2, 31); - v2 *= PRIME64_1; - h64 ^= v2; - h64 = h64*PRIME64_1 + PRIME64_4; - - v3 *= PRIME64_2; - v3 = XXH_rotl64(v3, 31); - v3 *= PRIME64_1; - h64 ^= v3; - h64 = h64*PRIME64_1 + PRIME64_4; - - v4 *= PRIME64_2; - v4 = XXH_rotl64(v4, 31); - v4 *= PRIME64_1; - h64 ^= v4; - h64 = h64*PRIME64_1 + PRIME64_4; - } - else - { - h64 = state->seed + PRIME64_5; - } - - h64 += (U64) state->total_len; - - while (p+8<=bEnd) - { - U64 k1 = XXH_readLE64(p, endian); - k1 *= PRIME64_2; - k1 = XXH_rotl64(k1,31); - k1 *= PRIME64_1; - h64 ^= k1; - h64 = XXH_rotl64(h64,27) * PRIME64_1 + PRIME64_4; - p+=8; - } - - if (p+4<=bEnd) - { - h64 ^= (U64)(XXH_readLE32(p, endian)) * PRIME64_1; - h64 = XXH_rotl64(h64, 23) * PRIME64_2 + PRIME64_3; - p+=4; - } - - while (p> 33; - h64 *= PRIME64_2; - h64 ^= h64 >> 29; - h64 *= PRIME64_3; - h64 ^= h64 >> 32; - - return h64; -} - - -unsigned long long XXH64_digest (const XXH64_state_t* state_in) -{ - XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN; - - if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT) - return XXH64_digest_endian(state_in, XXH_littleEndian); - else - return XXH64_digest_endian(state_in, XXH_bigEndian); -} - - diff --git a/xxhash.h b/xxhash.h deleted file mode 100644 index 55b4501..0000000 --- a/xxhash.h +++ /dev/null @@ -1,156 +0,0 @@ -/* - xxHash - Extremely Fast Hash algorithm - Header File - Copyright (C) 2012-2014, Yann Collet. - BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php) - - 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. - - 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. - - You can contact the author at : - - xxHash source repository : http://code.google.com/p/xxhash/ -*/ - -/* Notice extracted from xxHash homepage : - -xxHash is an extremely fast Hash algorithm, running at RAM speed limits. -It also successfully passes all tests from the SMHasher suite. - -Comparison (single thread, Windows Seven 32 bits, using SMHasher on a Core 2 Duo @3GHz) - -Name Speed Q.Score Author -xxHash 5.4 GB/s 10 -CrapWow 3.2 GB/s 2 Andrew -MumurHash 3a 2.7 GB/s 10 Austin Appleby -SpookyHash 2.0 GB/s 10 Bob Jenkins -SBox 1.4 GB/s 9 Bret Mulvey -Lookup3 1.2 GB/s 9 Bob Jenkins -SuperFastHash 1.2 GB/s 1 Paul Hsieh -CityHash64 1.05 GB/s 10 Pike & Alakuijala -FNV 0.55 GB/s 5 Fowler, Noll, Vo -CRC32 0.43 GB/s 9 -MD5-32 0.33 GB/s 10 Ronald L. Rivest -SHA1-32 0.28 GB/s 10 - -Q.Score is a measure of quality of the hash function. -It depends on successfully passing SMHasher test set. -10 is a perfect score. -*/ - -#pragma once - -#if defined (__cplusplus) -extern "C" { -#endif - - -/***************************** - Includes -*****************************/ -#include /* size_t */ - - -/***************************** - Type -*****************************/ -typedef enum { XXH_OK=0, XXH_ERROR } XXH_errorcode; - - - -/***************************** - Simple Hash Functions -*****************************/ - -unsigned int XXH32 (const void* input, size_t length, unsigned seed); -unsigned long long XXH64 (const void* input, size_t length, unsigned long long seed); - -/* -XXH32() : - Calculate the 32-bits hash of sequence "length" bytes stored at memory address "input". - The memory between input & input+length must be valid (allocated and read-accessible). - "seed" can be used to alter the result predictably. - This function successfully passes all SMHasher tests. - Speed on Core 2 Duo @ 3 GHz (single thread, SMHasher benchmark) : 5.4 GB/s -XXH64() : - Calculate the 64-bits hash of sequence of length "len" stored at memory address "input". -*/ - - - -/***************************** - Advanced Hash Functions -*****************************/ -typedef struct { long long ll[ 6]; } XXH32_state_t; -typedef struct { long long ll[11]; } XXH64_state_t; - -/* -These structures allow static allocation of XXH states. -States must then be initialized using XXHnn_reset() before first use. - -If you prefer dynamic allocation, please refer to functions below. -*/ - -XXH32_state_t* XXH32_createState(void); -XXH_errorcode XXH32_freeState(XXH32_state_t* statePtr); - -XXH64_state_t* XXH64_createState(void); -XXH_errorcode XXH64_freeState(XXH64_state_t* statePtr); - -/* -These functions create and release memory for XXH state. -States must then be initialized using XXHnn_reset() before first use. -*/ - - -XXH_errorcode XXH32_reset (XXH32_state_t* statePtr, unsigned seed); -XXH_errorcode XXH32_update (XXH32_state_t* statePtr, const void* input, size_t length); -unsigned int XXH32_digest (const XXH32_state_t* statePtr); - -XXH_errorcode XXH64_reset (XXH64_state_t* statePtr, unsigned long long seed); -XXH_errorcode XXH64_update (XXH64_state_t* statePtr, const void* input, size_t length); -unsigned long long XXH64_digest (const XXH64_state_t* statePtr); - -/* -These functions calculate the xxHash of an input provided in multiple smaller packets, -as opposed to an input provided as a single block. - -XXH state space must first be allocated, using either static or dynamic method provided above. - -Start a new hash by initializing state with a seed, using XXHnn_reset(). - -Then, feed the hash state by calling XXHnn_update() as many times as necessary. -Obviously, input must be valid, meaning allocated and read accessible. -The function returns an error code, with 0 meaning OK, and any other value meaning there is an error. - -Finally, you can produce a hash anytime, by using XXHnn_digest(). -This function returns the final nn-bits hash. -You can nonetheless continue feeding the hash state with more input, -and therefore get some new hashes, by calling again XXHnn_digest(). - -When you are done, don't forget to free XXH state space, using typically XXHnn_freeState(). -*/ - - -#if defined (__cplusplus) -} -#endif diff --git a/xxhsum.c b/xxhsum.c deleted file mode 100644 index e090e51..0000000 --- a/xxhsum.c +++ /dev/null @@ -1,689 +0,0 @@ -/* -bench.c - Demo program to benchmark open-source algorithm -Copyright (C) Yann Collet 2012-2014 - -This program is free software; you can redistribute it and/or modify -it under the terms of the GNU General Public License as published by -the Free Software Foundation; either version 2 of the License, or -(at your option) any later version. - -This program is distributed in the hope that it will be useful, -but WITHOUT ANY WARRANTY; without even the implied warranty of -MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -GNU General Public License for more details. - -You should have received a copy of the GNU General Public License along -with this program; if not, write to the Free Software Foundation, Inc., -51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. - -You can contact the author at : -- Blog homepage : http://fastcompression.blogspot.com/ -- Discussion group : https://groups.google.com/forum/?fromgroups#!forum/lz4c -*/ - -/************************************** - * Compiler Options - *************************************/ -/* MS Visual */ -#if defined(_MSC_VER) || defined(_WIN32) -# define _CRT_SECURE_NO_WARNINGS /* removes visual warnings */ -# define BMK_LEGACY_TIMER 1 /* gettimeofday() not supported by MSVC */ -#endif - -/* Under Linux at least, pull in the *64 commands */ -#define _LARGEFILE64_SOURCE - - -/************************************** - * Includes - *************************************/ -#include // malloc -#include // fprintf, fopen, ftello64, fread, stdin, stdout; when present : _fileno -#include // strcmp -#include // stat64 -#include // stat64 - -#include "xxhash.h" - - -/************************************** - * OS-Specific Includes - *************************************/ -// Use ftime() if gettimeofday() is not available on your target -#if defined(BMK_LEGACY_TIMER) -# include // timeb, ftime -#else -# include // gettimeofday -#endif - -#if defined(MSDOS) || defined(OS2) || defined(WIN32) || defined(_WIN32) || defined(__CYGWIN__) -# include // _O_BINARY -# include // _setmode, _isatty -# ifdef __MINGW32__ - int _fileno(FILE *stream); // MINGW somehow forgets to include this windows declaration into -# endif -# define SET_BINARY_MODE(file) _setmode(_fileno(file), _O_BINARY) -# define IS_CONSOLE(stdStream) _isatty(_fileno(stdStream)) -#else -# include // isatty, STDIN_FILENO -# define SET_BINARY_MODE(file) -# define IS_CONSOLE(stdStream) isatty(STDIN_FILENO) -#endif - -#if !defined(S_ISREG) -# define S_ISREG(x) (((x) & S_IFMT) == S_IFREG) -#endif - - -/************************************** - * Basic Types - *************************************/ -#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L // C99 -# include - typedef uint8_t BYTE; - typedef uint16_t U16; - typedef uint32_t U32; - typedef int32_t S32; - typedef uint64_t U64; -#else - typedef unsigned char BYTE; - typedef unsigned short U16; - typedef unsigned int U32; - typedef signed int S32; - typedef unsigned long long U64; -#endif - - -/************************************** - * Constants - *************************************/ -#define PROGRAM_NAME exename -#define PROGRAM_VERSION "" -#define COMPILED __DATE__ -#define AUTHOR "Yann Collet" -#define WELCOME_MESSAGE "*** %s %i-bits %s, by %s (%s) ***\n", PROGRAM_NAME, (int)(sizeof(void*)*8), PROGRAM_VERSION, AUTHOR, COMPILED - -#define NBLOOPS 3 // Default number of benchmark iterations -#define TIMELOOP 2500 // Minimum timing per iteration -#define PRIME 2654435761U - -#define KB *(1<<10) -#define MB *(1<<20) -#define GB *(1U<<30) - -#define MAX_MEM (2 GB - 64 MB) - -static const char stdinName[] = "-"; - - -//************************************** -// Display macros -//************************************** -#define DISPLAY(...) fprintf(stderr, __VA_ARGS__) -#define DISPLAYRESULT(...) fprintf(stdout, __VA_ARGS__) -#define DISPLAYLEVEL(l, ...) if (g_displayLevel>=l) DISPLAY(__VA_ARGS__); -static unsigned g_displayLevel = 1; - - -//************************************** -// Unit variables -//************************************** -static int g_nbIterations = NBLOOPS; -static int g_fn_selection = 1; // required within main() & usage() - - -//********************************************************* -// Benchmark Functions -//********************************************************* - -#if defined(BMK_LEGACY_TIMER) - -static int BMK_GetMilliStart(void) -{ - // Based on Legacy ftime() - // Rolls over every ~ 12.1 days (0x100000/24/60/60) - // Use GetMilliSpan to correct for rollover - struct timeb tb; - int nCount; - ftime( &tb ); - nCount = (int) (tb.millitm + (tb.time & 0xfffff) * 1000); - return nCount; -} - -#else - -static int BMK_GetMilliStart(void) -{ - // Based on newer gettimeofday() - // Use GetMilliSpan to correct for rollover - struct timeval tv; - int nCount; - gettimeofday(&tv, NULL); - nCount = (int) (tv.tv_usec/1000 + (tv.tv_sec & 0xfffff) * 1000); - return nCount; -} - -#endif - -static int BMK_GetMilliSpan( int nTimeStart ) -{ - int nSpan = BMK_GetMilliStart() - nTimeStart; - if ( nSpan < 0 ) - nSpan += 0x100000 * 1000; - return nSpan; -} - - -static size_t BMK_findMaxMem(U64 requestedMem) -{ - size_t step = (64 MB); - size_t allocatedMemory; - BYTE* testmem=NULL; - - requestedMem += 3*step; - requestedMem -= (size_t)requestedMem & (step-1); - if (requestedMem > MAX_MEM) requestedMem = MAX_MEM; - allocatedMemory = (size_t)requestedMem; - - while (!testmem) - { - allocatedMemory -= step; - testmem = (BYTE*) malloc((size_t)allocatedMemory); - } - free (testmem); - - return (size_t) (allocatedMemory - step); -} - - -static U64 BMK_GetFileSize(char* infilename) -{ - int r; -#if defined(_MSC_VER) - struct _stat64 statbuf; - r = _stat64(infilename, &statbuf); -#else - struct stat statbuf; - r = stat(infilename, &statbuf); -#endif - if (r || !S_ISREG(statbuf.st_mode)) return 0; // No good... - return (U64)statbuf.st_size; -} - - -static int BMK_benchFile(char** fileNamesTable, int nbFiles) -{ - int fileIdx=0; - U32 hashResult=0; - - U64 totals = 0; - double totalc = 0.; - - - // Loop for each file - while (fileIdx inFileSize) benchedSize = (size_t)inFileSize; - if (benchedSize < inFileSize) - { - DISPLAY("Not enough memory for '%s' full size; testing %i MB only...\n", inFileName, (int)(benchedSize>>20)); - } - - buffer = (char*)malloc((size_t )benchedSize+16); - if(!buffer) - { - DISPLAY("\nError: not enough memory!\n"); - fclose(inFile); - return 12; - } - alignedBuffer = (buffer+15) - (((size_t)(buffer+15)) & 0xF); // align on next 16 bytes boundaries - - // Fill input buffer - DISPLAY("\rLoading %s... \n", inFileName); - readSize = fread(alignedBuffer, 1, benchedSize, inFile); - fclose(inFile); - - if(readSize != benchedSize) - { - DISPLAY("\nError: problem reading file '%s' !! \n", inFileName); - free(buffer); - return 13; - } - - - // Bench XXH32 - { - int interationNb; - double fastestC = 100000000.; - - DISPLAY("\r%79s\r", ""); // Clean display line - for (interationNb = 1; interationNb <= g_nbIterations; interationNb++) - { - int nbHashes = 0; - int milliTime; - - DISPLAY("%1i-%-14.14s : %10i ->\r", interationNb, "XXH32", (int)benchedSize); - - // Hash loop - milliTime = BMK_GetMilliStart(); - while(BMK_GetMilliStart() == milliTime); - milliTime = BMK_GetMilliStart(); - while(BMK_GetMilliSpan(milliTime) < TIMELOOP) - { - int i; - for (i=0; i<100; i++) - { - hashResult = XXH32(alignedBuffer, benchedSize, 0); - nbHashes++; - } - } - milliTime = BMK_GetMilliSpan(milliTime); - if ((double)milliTime < fastestC*nbHashes) fastestC = (double)milliTime/nbHashes; - DISPLAY("%1i-%-14.14s : %10i -> %7.1f MB/s\r", interationNb, "XXH32", (int)benchedSize, (double)benchedSize / fastestC / 1000.); - } - DISPLAY("%-16.16s : %10i -> %7.1f MB/s 0x%08X\n", "XXH32", (int)benchedSize, (double)benchedSize / fastestC / 1000., hashResult); - - totals += benchedSize; - totalc += fastestC; - } - - // Bench Unaligned XXH32 - { - int interationNb; - double fastestC = 100000000.; - - DISPLAY("\r%79s\r", ""); // Clean display line - for (interationNb = 1; (interationNb <= g_nbIterations) && ((benchedSize>1)); interationNb++) - { - int nbHashes = 0; - int milliTime; - - DISPLAY("%1i-%-14.14s : %10i ->\r", interationNb, "(unaligned)", (int)benchedSize); - // Hash loop - milliTime = BMK_GetMilliStart(); - while(BMK_GetMilliStart() == milliTime); - milliTime = BMK_GetMilliStart(); - while(BMK_GetMilliSpan(milliTime) < TIMELOOP) - { - int i; - for (i=0; i<100; i++) - { - hashResult = XXH32(alignedBuffer+1, benchedSize-1, 0); - nbHashes++; - } - } - milliTime = BMK_GetMilliSpan(milliTime); - if ((double)milliTime < fastestC*nbHashes) fastestC = (double)milliTime/nbHashes; - DISPLAY("%1i-%-14.14s : %10i -> %7.1f MB/s\r", interationNb, "XXH32 (unaligned)", (int)(benchedSize-1), (double)(benchedSize-1) / fastestC / 1000.); - } - DISPLAY("%-16.16s : %10i -> %7.1f MB/s \n", "XXH32 (unaligned)", (int)benchedSize-1, (double)(benchedSize-1) / fastestC / 1000.); - } - - // Bench XXH64 - { - int interationNb; - double fastestC = 100000000.; - unsigned long long h64 = 0; - - DISPLAY("\r%79s\r", ""); // Clean display line - for (interationNb = 1; interationNb <= g_nbIterations; interationNb++) - { - int nbHashes = 0; - int milliTime; - - DISPLAY("%1i-%-14.14s : %10i ->\r", interationNb, "XXH64", (int)benchedSize); - - // Hash loop - milliTime = BMK_GetMilliStart(); - while(BMK_GetMilliStart() == milliTime); - milliTime = BMK_GetMilliStart(); - while(BMK_GetMilliSpan(milliTime) < TIMELOOP) - { - int i; - for (i=0; i<100; i++) - { - h64 = XXH64(alignedBuffer, benchedSize, 0); - nbHashes++; - } - } - milliTime = BMK_GetMilliSpan(milliTime); - if ((double)milliTime < fastestC*nbHashes) fastestC = (double)milliTime/nbHashes; - DISPLAY("%1i-%-14.14s : %10i -> %7.1f MB/s\r", interationNb, "XXH64", (int)benchedSize, (double)benchedSize / fastestC / 1000.); - } - DISPLAY("%-16.16s : %10i -> %7.1f MB/s 0x%08X%08X\n", "XXH64", (int)benchedSize, (double)benchedSize / fastestC / 1000., (U32)(h64>>32), (U32)(h64)); - - totals += benchedSize; - totalc += fastestC; - } - - free(buffer); - } - - if (nbFiles > 1) - printf("%-16.16s :%11llu -> %7.1f MB/s\n", " TOTAL", (long long unsigned int)totals, (double)totals/totalc/1000.); - - return 0; -} - - - -static void BMK_checkResult(U32 r1, U32 r2) -{ - static int nbTests = 1; - - if (r1==r2) DISPLAY("\rTest%3i : %08X == %08X ok ", nbTests, r1, r2); - else - { - DISPLAY("\rERROR : Test%3i : %08X <> %08X !!!!! \n", nbTests, r1, r2); - exit(1); - } - nbTests++; -} - - -static void BMK_checkResult64(U64 r1, U64 r2) -{ - static int nbTests = 1; - - if (r1!=r2) - { - DISPLAY("\rERROR : Test%3i : 64-bits values non equals !!!!! \n", nbTests); - DISPLAY("\r %08X%08X != %08X%08X \n", (U32)(r1>>32), (U32)r1, (U32)(r2<<32), (U32)r2); - exit(1); - } - nbTests++; -} - - -static void BMK_testSequence64(void* sentence, int len, U64 seed, U64 Nresult) -{ - U64 Dresult; - XXH64_state_t state; - int index; - - Dresult = XXH64(sentence, len, seed); - BMK_checkResult64(Dresult, Nresult); - - XXH64_reset(&state, seed); - XXH64_update(&state, sentence, len); - Dresult = XXH64_digest(&state); - BMK_checkResult64(Dresult, Nresult); - - XXH64_reset(&state, seed); - for (index=0; index>24); - prime *= prime; - } - - BMK_testSequence(NULL, 0, 0, 0x02CC5D05); - BMK_testSequence(NULL, 0, PRIME, 0x36B78AE7); - BMK_testSequence(sanityBuffer, 1, 0, 0xB85CBEE5); - BMK_testSequence(sanityBuffer, 1, PRIME, 0xD5845D64); - BMK_testSequence(sanityBuffer, 14, 0, 0xE5AA0AB4); - BMK_testSequence(sanityBuffer, 14, PRIME, 0x4481951D); - BMK_testSequence(sanityBuffer, SANITY_BUFFER_SIZE, 0, 0x1F1AA412); - BMK_testSequence(sanityBuffer, SANITY_BUFFER_SIZE, PRIME, 0x498EC8E2); - - BMK_testSequence64(NULL , 0, 0, 0xEF46DB3751D8E999ULL); - BMK_testSequence64(NULL , 0, PRIME, 0xAC75FDA2929B17EFULL); - BMK_testSequence64(sanityBuffer, 1, 0, 0x4FCE394CC88952D8ULL); - BMK_testSequence64(sanityBuffer, 1, PRIME, 0x739840CB819FA723ULL); - BMK_testSequence64(sanityBuffer, 14, 0, 0xCFFA8DB881BC3A3DULL); - BMK_testSequence64(sanityBuffer, 14, PRIME, 0x5B9611585EFCC9CBULL); - BMK_testSequence64(sanityBuffer, SANITY_BUFFER_SIZE, 0, 0x0EAB543384F878ADULL); - BMK_testSequence64(sanityBuffer, SANITY_BUFFER_SIZE, PRIME, 0xCAA65939306F1E21ULL); - - DISPLAY("\r%79s\r", ""); // Clean display line - DISPLAYLEVEL(2, "Sanity check -- all tests ok\n"); -} - - -static int BMK_hash(const char* fileName, U32 hashNb) -{ - FILE* inFile; - size_t const blockSize = 64 KB; - size_t readSize; - char* buffer; - XXH64_state_t state; - - // Check file existence - if (fileName == stdinName) - { - inFile = stdin; - SET_BINARY_MODE(stdin); - } - else - inFile = fopen( fileName, "rb" ); - if (inFile==NULL) - { - DISPLAY( "Pb opening %s\n", fileName); - return 11; - } - - // Memory allocation & restrictions - buffer = (char*)malloc(blockSize); - if(!buffer) - { - DISPLAY("\nError: not enough memory!\n"); - fclose(inFile); - return 12; - } - - // Init - switch(hashNb) - { - case 0: - XXH32_reset((XXH32_state_t*)&state, 0); - break; - case 1: - XXH64_reset(&state, 0); - break; - default: - DISPLAY("Error : bad hash algorithm ID\n"); - fclose(inFile); - free(buffer); - return -1; - } - - - // Load file & update hash - DISPLAY("\rLoading %s... \r", fileName); - readSize = 1; - while (readSize) - { - readSize = fread(buffer, 1, blockSize, inFile); - switch(hashNb) - { - case 0: - XXH32_update((XXH32_state_t*)&state, buffer, readSize); - break; - case 1: - XXH64_update(&state, buffer, readSize); - break; - default: - break; - } - } - fclose(inFile); - free(buffer); - - // display Hash - switch(hashNb) - { - case 0: - { - U32 h32 = XXH32_digest((XXH32_state_t*)&state); - DISPLAYRESULT("%08x %s \n", h32, fileName); - break; - } - case 1: - { - U64 h64 = XXH64_digest(&state); - DISPLAYRESULT("%08x%08x %s \n", (U32)(h64>>32), (U32)(h64), fileName); - break; - } - default: - break; - } - - return 0; -} - - -//********************************************************* -// Main -//********************************************************* - -static int usage(const char* exename) -{ - DISPLAY( WELCOME_MESSAGE ); - DISPLAY( "Usage :\n"); - DISPLAY( " %s [arg] [filename]\n", exename); - DISPLAY( "When no filename provided, or - provided : use stdin as input\n"); - DISPLAY( "Arguments :\n"); - DISPLAY( " -H# : hash selection : 0=32bits, 1=64bits (default %i)\n", g_fn_selection); - DISPLAY( " -b : benchmark mode \n"); - DISPLAY( " -i# : number of iterations (benchmark mode; default %i)\n", g_nbIterations); - DISPLAY( " -h : help (this text)\n"); - return 0; -} - - -static int badusage(const char* exename) -{ - DISPLAY("Wrong parameters\n"); - usage(exename); - return 1; -} - - -int main(int argc, char** argv) -{ - int i, filenamesStart=0; - const char* input_filename = (char*)stdinName; - const char* exename = argv[0]; - U32 benchmarkMode = 0; - - // xxh32sum default to 32 bits checksum - if (strstr(exename, "xxh32sum")!=NULL) g_fn_selection=0; - - for(i=1; i< 0 || g_fn_selection > 1) return badusage(exename); - - return BMK_hash(input_filename, g_fn_selection); -}