X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=folly%2FHash.h;h=5253975a4a8f70998a88dc604bdf8fae8c1e7058;hb=bfa61031d36f41aaa907d40371c28ac0e84c8e0d;hp=566bad05afed814ec77e4698711d250ff518f643;hpb=5cc2f9945c169d3946963c6ee485e32eea407fac;p=folly.git diff --git a/folly/Hash.h b/folly/Hash.h index 566bad05..5253975a 100644 --- a/folly/Hash.h +++ b/folly/Hash.h @@ -1,5 +1,5 @@ /* - * Copyright 2015 Facebook, Inc. + * Copyright 2017 Facebook, Inc. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. @@ -14,17 +14,20 @@ * limitations under the License. */ -#ifndef FOLLY_BASE_HASH_H_ -#define FOLLY_BASE_HASH_H_ +#pragma once +#include #include -#include +#include #include -#include #include +#include +#include -#include -#include +#include +#include +#include +#include /* * Various hashing functions. @@ -72,6 +75,8 @@ uint64_t hash_range(Iter begin, return hash; } +inline uint32_t twang_32from64(uint64_t key); + template size_t hash_combine_generic(const T& t, const Ts&... ts) { size_t seed = Hasher::hash(t); @@ -79,7 +84,11 @@ size_t hash_combine_generic(const T& t, const Ts&... ts) { return seed; } size_t remainder = hash_combine_generic(ts...); - return hash_128_to_64(seed, remainder); + /* static */ if (sizeof(size_t) == sizeof(uint32_t)) { + return twang_32from64((uint64_t(seed) << 32) | remainder); + } else { + return static_cast(hash_128_to_64(seed, remainder)); + } } // Simply uses std::hash to hash. Note that std::hash is not guaranteed @@ -205,9 +214,12 @@ inline uint32_t jenkins_rev_unmix32(uint32_t key) { const uint32_t FNV_32_HASH_START = 2166136261UL; const uint64_t FNV_64_HASH_START = 14695981039346656037ULL; +const uint64_t FNVA_64_HASH_START = 14695981039346656037ULL; + +inline uint32_t fnv32(const char* buf, uint32_t hash = FNV_32_HASH_START) { + // forcing signed char, since other platforms can use unsigned + const signed char* s = reinterpret_cast(buf); -inline uint32_t fnv32(const char* s, - uint32_t hash = FNV_32_HASH_START) { for (; *s; ++s) { hash += (hash << 1) + (hash << 4) + (hash << 7) + (hash << 8) + (hash << 24); @@ -219,7 +231,8 @@ inline uint32_t fnv32(const char* s, inline uint32_t fnv32_buf(const void* buf, size_t n, uint32_t hash = FNV_32_HASH_START) { - const char* char_buf = reinterpret_cast(buf); + // forcing signed char, since other platforms can use unsigned + const signed char* char_buf = reinterpret_cast(buf); for (size_t i = 0; i < n; ++i) { hash += (hash << 1) + (hash << 4) + (hash << 7) + @@ -235,8 +248,10 @@ inline uint32_t fnv32(const std::string& str, return fnv32_buf(str.data(), str.size(), hash); } -inline uint64_t fnv64(const char* s, - uint64_t hash = FNV_64_HASH_START) { +inline uint64_t fnv64(const char* buf, uint64_t hash = FNV_64_HASH_START) { + // forcing signed char, since other platforms can use unsigned + const signed char* s = reinterpret_cast(buf); + for (; *s; ++s) { hash += (hash << 1) + (hash << 4) + (hash << 5) + (hash << 7) + (hash << 8) + (hash << 40); @@ -248,7 +263,8 @@ inline uint64_t fnv64(const char* s, inline uint64_t fnv64_buf(const void* buf, size_t n, uint64_t hash = FNV_64_HASH_START) { - const char* char_buf = reinterpret_cast(buf); + // forcing signed char, since other platforms can use unsigned + const signed char* char_buf = reinterpret_cast(buf); for (size_t i = 0; i < n; ++i) { hash += (hash << 1) + (hash << 4) + (hash << 5) + (hash << 7) + @@ -263,19 +279,38 @@ inline uint64_t fnv64(const std::string& str, return fnv64_buf(str.data(), str.size(), hash); } +inline uint64_t fnva64_buf(const void* buf, + size_t n, + uint64_t hash = FNVA_64_HASH_START) { + const uint8_t* char_buf = reinterpret_cast(buf); + + for (size_t i = 0; i < n; ++i) { + hash ^= char_buf[i]; + hash += (hash << 1) + (hash << 4) + (hash << 5) + (hash << 7) + + (hash << 8) + (hash << 40); + } + return hash; +} + +inline uint64_t fnva64(const std::string& str, + uint64_t hash = FNVA_64_HASH_START) { + return fnva64_buf(str.data(), str.size(), hash); +} + /* * Paul Hsieh: http://www.azillionmonkeys.com/qed/hash.html */ -#define get16bits(d) (*((const uint16_t*) (d))) +#define get16bits(d) folly::loadUnaligned(d) inline uint32_t hsieh_hash32_buf(const void* buf, size_t len) { - const char* s = reinterpret_cast(buf); + // forcing signed char, since other platforms can use unsigned + const unsigned char* s = reinterpret_cast(buf); uint32_t hash = static_cast(len); uint32_t tmp; size_t rem; - if (len <= 0 || buf == 0) { + if (len <= 0 || buf == nullptr) { return 0; } @@ -335,7 +370,24 @@ inline uint32_t hsieh_hash32_str(const std::string& str) { } // namespace hash -template +namespace detail { +struct integral_hasher { + template + size_t operator()(I const& i) const { + static_assert(sizeof(I) <= 8, "input type is too wide"); + if (sizeof(I) <= 4) { // the branch taken is known at compile time + auto const i32 = static_cast(i); // impl accident: sign-extends + auto const u32 = static_cast(i32); + return static_cast(hash::jenkins_rev_mix32(u32)); + } else { + auto const u64 = static_cast(i); + return static_cast(hash::twang_mix64(u64)); + } + } +}; +} // namespace detail + +template struct hasher; struct Hash { @@ -343,29 +395,79 @@ struct Hash { size_t operator()(const T& v) const { return hasher()(v); } + + template + size_t operator()(const T& t, const Ts&... ts) const { + return hash::hash_128_to_64((*this)(t), (*this)(ts...)); + } +}; + +template <> +struct hasher { + size_t operator()(bool key) const { + // Make sure that all the output bits depend on the input. + return key ? std::numeric_limits::max() : 0; + } }; -template<> struct hasher { - size_t operator()(int32_t key) const { - return hash::jenkins_rev_mix32(uint32_t(key)); +template <> +struct hasher : detail::integral_hasher {}; + +template <> +struct hasher : detail::integral_hasher {}; + +template <> +struct hasher : detail::integral_hasher {}; + +template <> +struct hasher : detail::integral_hasher {}; + +template <> +struct hasher : detail::integral_hasher {}; + +template <> +struct hasher : detail::integral_hasher {}; + +template <> +struct hasher : detail::integral_hasher {}; + +template <> +struct hasher : detail::integral_hasher {}; + +template <> +struct hasher : detail::integral_hasher {}; + +template <> +struct hasher : detail::integral_hasher {}; + +template <> // char is a different type from both signed char and unsigned char +struct hasher : detail::integral_hasher {}; + +template <> struct hasher { + size_t operator()(const std::string& key) const { + return static_cast( + hash::SpookyHashV2::Hash64(key.data(), key.size(), 0)); } }; -template<> struct hasher { - size_t operator()(uint32_t key) const { - return hash::jenkins_rev_mix32(key); +template +struct hasher::value, void>::type> { + size_t operator()(T key) const { + return Hash()(static_cast::type>(key)); } }; -template<> struct hasher { - size_t operator()(int64_t key) const { - return hash::twang_mix64(uint64_t(key)); +template +struct hasher> { + size_t operator()(const std::pair& key) const { + return Hash()(key.first, key.second); } }; -template<> struct hasher { - size_t operator()(uint64_t key) const { - return hash::twang_mix64(key); +template +struct hasher> { + size_t operator() (const std::tuple& key) const { + return applyTuple(Hash(), key); } }; @@ -397,7 +499,7 @@ namespace std { // items in the pair. template struct hash > { - public: + public: size_t operator()(const std::pair& x) const { return folly::hash::hash_combine(x.first, x.second); } @@ -415,5 +517,3 @@ namespace std { } }; } // namespace std - -#endif