forked from rurban/smhasher
-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
needs HAVE_INT128. should be 2x faster, but is not
- Loading branch information
Showing
8 changed files
with
3,287 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Large diffs are not rendered by default.
Oops, something went wrong.
Large diffs are not rendered by default.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,131 @@ | ||
| /** | ||
| * @file prvhash82.h | ||
| * | ||
| * @brief The inclusion file for the "prvhash82" hash function. Hash length | ||
| * increment = 8. | ||
| * | ||
| * @mainpage | ||
| * | ||
| * @section intro_sec Introduction | ||
| * | ||
| * Description is available at https://github.com/avaneev/prvhash | ||
| * | ||
| * @section license License | ||
| * | ||
| * Copyright (c) 2020 Aleksey Vaneev | ||
| * | ||
| * Permission is hereby granted, free of charge, to any person obtaining a | ||
| * copy of this software and associated documentation files (the "Software"), | ||
| * to deal in the Software without restriction, including without limitation | ||
| * the rights to use, copy, modify, merge, publish, distribute, sublicense, | ||
| * and/or sell copies of the Software, and to permit persons to whom the | ||
| * Software is furnished to do so, subject to the following conditions: | ||
| * | ||
| * The above copyright notice and this permission notice shall be included in | ||
| * all copies or substantial portions of the Software. | ||
| * | ||
| * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | ||
| * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | ||
| * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE | ||
| * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | ||
| * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING | ||
| * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER | ||
| * DEALINGS IN THE SOFTWARE. | ||
| * | ||
| * @version 2.5 | ||
| */ | ||
|
|
||
| //$ nocpp | ||
|
|
||
| #ifndef PRVHASH82_INCLUDED | ||
| #define PRVHASH82_INCLUDED | ||
|
|
||
| #include <stdint.h> | ||
| #include <string.h> | ||
|
|
||
| /** | ||
| * PRVHASH hash function (128-bit variables with 64-bit hash word). Produces | ||
| * hash of the specified Message. | ||
| * | ||
| * @param Message Message to produce hash from. | ||
| * @param MessageLen Message length, in bytes. | ||
| * @param[out] Hash The resulting hash. If both InitLCG and InitSeed are | ||
| * non-zero, the hash will not be initially reset to 0, otherwise the hash | ||
| * should be pre-initialized with random bytes. | ||
| * @param HashLen The required hash length, in bytes, should be >= 8, in | ||
| * increments of 8. | ||
| * @param SeedXOR Optional value, to XOR the default seed with. To use the | ||
| * default seed, set to 0. If both InitLCG and InitSeed are non-zero, this | ||
| * SeedXOR is ignored and should be set to 0. Otherwise, the SeedXOR value | ||
| * can have any bit length, and is used only as an additional entropy source. | ||
| * @param InitLCG If both InitLCG and InitSeed are non-zero, both values | ||
| * will be used as initial state of the hash function. Full 128-bit random | ||
| * value should be supplied in this case. See the considerations below. | ||
| * @param InitSeed If both InitLCG and InitSeed are non-zero, both values | ||
| * will be used as initial state of the hash function. Full 128-bit random | ||
| * value should be supplied in this case. | ||
| */ | ||
|
|
||
| inline void prvhash82( const uint8_t* const Message, const int MessageLen, | ||
| uint8_t* const Hash, const int HashLen, const __uint128_t SeedXOR, | ||
| const __uint128_t InitLCG, const __uint128_t InitSeed ) | ||
| { | ||
| __uint128_t lcg; // Multiplier inspired by LCG. This is not a prime | ||
| // number. It is a random sequence of bits. This value can be | ||
| // regenerated at will, possibly using various statistical search | ||
| // methods. The best strategies: 1) Compose this number from 16-bit | ||
| // random values that have 6 to 10 random bits set; 2) Use a 128-bit | ||
| // random value that has 60-68 random bits set. An important | ||
| // consideration here is to pass the 16-bit Sparse test by default. | ||
| __uint128_t Seed; // Generated similarly to "lcg". | ||
|
|
||
| if( InitLCG == 0 && InitSeed == 0 ) | ||
| { | ||
| lcg = 15267459991392010589ULL; | ||
| lcg <<= 64; | ||
| lcg |= 14473286605592752231ULL; | ||
| Seed = 7928988912013905173ULL; | ||
| Seed <<= 64; | ||
| Seed |= 1846177453121048234ULL; | ||
| Seed ^= SeedXOR; | ||
|
|
||
| memset( Hash, 0, HashLen ); | ||
| } | ||
| else | ||
| { | ||
| lcg = InitLCG; | ||
| Seed = InitSeed; | ||
| } | ||
|
|
||
| const int hl8 = ( HashLen >> 3 ); | ||
| const uint64_t lmsg = ( MessageLen == 0 ? 0 : ~Message[ MessageLen - 1 ]); | ||
| const int ml2 = MessageLen + ( MessageLen & 1 ) + | ||
| ( MessageLen < 4 && MessageLen > 0 ? 2 : 0 ); | ||
|
|
||
| int c = ml2 + hl8 + hl8 - ml2 % hl8; | ||
| int hpos = 0; | ||
| int k; | ||
|
|
||
| for( k = 0; k < c; k += 2 ) | ||
| { | ||
| const uint64_t msg = ( (uint64_t) ( k < MessageLen - 1 ? | ||
| Message[ k + 1 ] : lmsg ) << 8 ) | | ||
| ( k < MessageLen ? (uint64_t) Message[ k ] : lmsg ); | ||
|
|
||
| Seed *= lcg; | ||
| uint64_t* const hc = (uint64_t*) &Hash[ hpos ]; | ||
| const uint64_t ph = *hc; | ||
| *hc ^= (uint64_t) ( Seed >> 64 ); | ||
| Seed ^= ph ^ msg; | ||
| lcg += Seed; | ||
|
|
||
| hpos += 8; | ||
|
|
||
| if( hpos == HashLen ) | ||
| { | ||
| hpos = 0; | ||
| } | ||
| } | ||
| } | ||
|
|
||
| #endif // PRVHASH82_INCLUDED |