xxhash.h 5.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157
  1. /*
  2. xxHash - Extremely Fast Hash algorithm
  3. Header File
  4. Copyright (C) 2012-2014, Yann Collet.
  5. BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
  6. Redistribution and use in source and binary forms, with or without
  7. modification, are permitted provided that the following conditions are
  8. met:
  9. * Redistributions of source code must retain the above copyright
  10. notice, this list of conditions and the following disclaimer.
  11. * Redistributions in binary form must reproduce the above
  12. copyright notice, this list of conditions and the following disclaimer
  13. in the documentation and/or other materials provided with the
  14. distribution.
  15. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  16. "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  17. LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  18. A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  19. OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  20. SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  21. LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  22. DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  23. THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  24. (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  25. OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  26. You can contact the author at :
  27. - xxHash source repository : http://code.google.com/p/xxhash/
  28. */
  29. /* Notice extracted from xxHash homepage :
  30. xxHash is an extremely fast Hash algorithm, running at RAM speed limits.
  31. It also successfully passes all tests from the SMHasher suite.
  32. Comparison (single thread, Windows Seven 32 bits, using SMHasher on a Core 2 Duo @3GHz)
  33. Name Speed Q.Score Author
  34. xxHash 5.4 GB/s 10
  35. CrapWow 3.2 GB/s 2 Andrew
  36. MumurHash 3a 2.7 GB/s 10 Austin Appleby
  37. SpookyHash 2.0 GB/s 10 Bob Jenkins
  38. SBox 1.4 GB/s 9 Bret Mulvey
  39. Lookup3 1.2 GB/s 9 Bob Jenkins
  40. SuperFastHash 1.2 GB/s 1 Paul Hsieh
  41. CityHash64 1.05 GB/s 10 Pike & Alakuijala
  42. FNV 0.55 GB/s 5 Fowler, Noll, Vo
  43. CRC32 0.43 GB/s 9
  44. MD5-32 0.33 GB/s 10 Ronald L. Rivest
  45. SHA1-32 0.28 GB/s 10
  46. Q.Score is a measure of quality of the hash function.
  47. It depends on successfully passing SMHasher test set.
  48. 10 is a perfect score.
  49. */
  50. #pragma once
  51. #if defined (__cplusplus)
  52. extern "C" {
  53. #endif
  54. /*****************************
  55. Includes
  56. *****************************/
  57. #include <stddef.h> /* size_t */
  58. /*****************************
  59. Type
  60. *****************************/
  61. typedef enum { XXH_OK=0, XXH_ERROR } XXH_errorcode;
  62. /*****************************
  63. Simple Hash Functions
  64. *****************************/
  65. unsigned int XXH32 (const void* input, size_t length, unsigned seed);
  66. unsigned long long XXH64 (const void* input, size_t length, unsigned long long seed);
  67. /*
  68. XXH32() :
  69. Calculate the 32-bits hash of sequence "length" bytes stored at memory address "input".
  70. The memory between input & input+length must be valid (allocated and read-accessible).
  71. "seed" can be used to alter the result predictably.
  72. This function successfully passes all SMHasher tests.
  73. Speed on Core 2 Duo @ 3 GHz (single thread, SMHasher benchmark) : 5.4 GB/s
  74. XXH64() :
  75. Calculate the 64-bits hash of sequence of length "len" stored at memory address "input".
  76. */
  77. /*****************************
  78. Advanced Hash Functions
  79. *****************************/
  80. typedef struct { long long ll[ 6]; } XXH32_state_t;
  81. typedef struct { long long ll[11]; } XXH64_state_t;
  82. /*
  83. These structures allow static allocation of XXH states.
  84. States must then be initialized using XXHnn_reset() before first use.
  85. If you prefer dynamic allocation, please refer to functions below.
  86. */
  87. XXH32_state_t* XXH32_createState(void);
  88. XXH_errorcode XXH32_freeState(XXH32_state_t* statePtr);
  89. XXH64_state_t* XXH64_createState(void);
  90. XXH_errorcode XXH64_freeState(XXH64_state_t* statePtr);
  91. /*
  92. These functions create and release memory for XXH state.
  93. States must then be initialized using XXHnn_reset() before first use.
  94. */
  95. XXH_errorcode XXH32_reset (XXH32_state_t* statePtr, unsigned seed);
  96. XXH_errorcode XXH32_update (XXH32_state_t* statePtr, const void* input, size_t length);
  97. unsigned int XXH32_digest (const XXH32_state_t* statePtr);
  98. XXH_errorcode XXH64_reset (XXH64_state_t* statePtr, unsigned long long seed);
  99. XXH_errorcode XXH64_update (XXH64_state_t* statePtr, const void* input, size_t length);
  100. unsigned long long XXH64_digest (const XXH64_state_t* statePtr);
  101. /*
  102. These functions calculate the xxHash of an input provided in multiple smaller packets,
  103. as opposed to an input provided as a single block.
  104. XXH state space must first be allocated, using either static or dynamic method provided above.
  105. Start a new hash by initializing state with a seed, using XXHnn_reset().
  106. Then, feed the hash state by calling XXHnn_update() as many times as necessary.
  107. Obviously, input must be valid, meaning allocated and read accessible.
  108. The function returns an error code, with 0 meaning OK, and any other value meaning there is an error.
  109. Finally, you can produce a hash anytime, by using XXHnn_digest().
  110. This function returns the final nn-bits hash.
  111. You can nonetheless continue feeding the hash state with more input,
  112. and therefore get some new hashes, by calling again XXHnn_digest().
  113. When you are done, don't forget to free XXH state space, using typically XXHnn_freeState().
  114. */
  115. #if defined (__cplusplus)
  116. }
  117. #endif