LLVM 20.0.0git
xxhash.h
Go to the documentation of this file.
1/*
2 xxHash - Extremely Fast Hash algorithm
3 Header File
4 Copyright (C) 2012-2016, Yann Collet.
5
6 BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
7
8 Redistribution and use in source and binary forms, with or without
9 modification, are permitted provided that the following conditions are
10 met:
11
12 * Redistributions of source code must retain the above copyright
13 notice, this list of conditions and the following disclaimer.
14 * Redistributions in binary form must reproduce the above
15 copyright notice, this list of conditions and the following disclaimer
16 in the documentation and/or other materials provided with the
17 distribution.
18
19 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21 LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
22 A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
23 OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
25 LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
29 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30
31 You can contact the author at :
32 - xxHash source repository : https://github.com/Cyan4973/xxHash
33*/
34
35/* based on revision d2df04efcbef7d7f6886d345861e5dfda4edacc1 Removed
36 * everything but a simple interface for computing XXh64. */
37
38#ifndef LLVM_SUPPORT_XXHASH_H
39#define LLVM_SUPPORT_XXHASH_H
40
41#include "llvm/ADT/ArrayRef.h"
42#include "llvm/ADT/StringRef.h"
43
44namespace llvm {
45
48
49uint64_t xxh3_64bits(ArrayRef<uint8_t> data);
51 return xxh3_64bits(ArrayRef(data.bytes_begin(), data.size()));
52}
53
54/*-**********************************************************************
55 * XXH3 128-bit variant
56 ************************************************************************/
57
58/*!
59 * @brief The return value from 128-bit hashes.
60 *
61 * Stored in little endian order, although the fields themselves are in native
62 * endianness.
63 */
65 uint64_t low64; /*!< `value & 0xFFFFFFFFFFFFFFFF` */
66 uint64_t high64; /*!< `value >> 64` */
67
68 /// Convenience equality check operator.
69 bool operator==(const XXH128_hash_t rhs) const {
70 return low64 == rhs.low64 && high64 == rhs.high64;
71 }
72};
73
74/// XXH3's 128-bit variant.
75XXH128_hash_t xxh3_128bits(ArrayRef<uint8_t> data);
76
77} // namespace llvm
78
79#endif
ArrayRef - Represent a constant reference to an array (0 or more elements consecutively in memory),...
Definition: ArrayRef.h:41
StringRef - Represent a constant reference to a string, i.e.
Definition: StringRef.h:50
constexpr size_t size() const
size - Get the string size.
Definition: StringRef.h:137
const unsigned char * bytes_begin() const
Definition: StringRef.h:115
This is an optimization pass for GlobalISel generic memory operations.
Definition: AddressRanges.h:18
uint64_t xxh3_64bits(ArrayRef< uint8_t > data)
Definition: xxhash.cpp:553
XXH128_hash_t xxh3_128bits(ArrayRef< uint8_t > data)
XXH3's 128-bit variant.
Definition: xxhash.cpp:1023
uint64_t xxHash64(llvm::StringRef Data)
Definition: xxhash.cpp:103
The return value from 128-bit hashes.
Definition: xxhash.h:64
bool operator==(const XXH128_hash_t rhs) const
Convenience equality check operator.
Definition: xxhash.h:69
uint64_t low64
value & 0xFFFFFFFFFFFFFFFF
Definition: xxhash.h:65
uint64_t high64
value >> 64
Definition: xxhash.h:66