Hashing.h

Go to the documentation of this file.

//===-- llvm/ADT/Hashing.h - Utilities for hashing --------------*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//
// This file implements the newly proposed standard C++ interfaces for hashing
// arbitrary data and building hash functions for user-defined types. This
// interface was originally proposed in N3333[1] and is currently under review
// for inclusion in a future TR and/or standard.
//
// The primary interfaces provide are comprised of one type and three functions:
//
//  -- 'hash_code' class is an opaque type representing the hash code for some
//     data. It is the intended product of hashing, and can be used to implement
//     hash tables, checksumming, and other common uses of hashes. It is not an
//     integer type (although it can be converted to one) because it is risky
//     to assume much about the internals of a hash_code. In particular, each
//     execution of the program has a high probability of producing a different
//     hash_code for a given input. Thus their values are not stable to save or
//     persist, and should only be used during the execution for the
//     construction of hashing datastructures.
//
//  -- 'hash_value' is a function designed to be overloaded for each
//     user-defined type which wishes to be used within a hashing context. It
//     should be overloaded within the user-defined type's namespace and found
//     via ADL. Overloads for primitive types are provided by this library.
//
//  -- 'hash_combine' and 'hash_combine_range' are functions designed to aid
//      programmers in easily and intuitively combining a set of data into
//      a single hash_code for their object. They should only logically be used
//      within the implementation of a 'hash_value' routine or similar context.
//
// 'hash_combine_range' hashes the byte stream of the range via xxh3. The
// contiguous-array overload hashes the range in place; the iterator overload
// materializes the byte stream into a 256-byte on-stack buffer, falling back
// to the heap for ranges that exceed it.
//
//===----------------------------------------------------------------------===//
 
#ifndef LLVM_ADT_HASHING_H
#define LLVM_ADT_HASHING_H
 
#include "llvm/ADT/ADL.h"
#include "llvm/Config/abi-breaking.h"
#include "llvm/Support/DataTypes.h"
#include "llvm/Support/ErrorHandling.h"
#include "llvm/Support/type_traits.h"
#include "llvm/Support/xxhash.h"
#include <algorithm>
#include <array>
#include <cassert>
#include <cstring>
#include <memory>
#include <optional>
#include <string>
#include <tuple>
#include <utility>
 
namespace llvm {
template <typename T, typename Enable> struct DenseMapInfo;
 
/// An opaque object representing a hash code.
///
/// This object represents the result of hashing some entity. It is intended to
/// be used to implement hashtables or other hashing-based data structures.
/// While it wraps and exposes a numeric value, this value should not be
/// trusted to be stable or predictable across processes or executions.
///
/// In order to obtain the hash_code for an object 'x':
/// \code
///   using llvm::hash_value;
///   llvm::hash_code code = hash_value(x);
/// \endcode
class hash_code {
  size_t value;
 
public:
  /// Default construct a hash_code.
  /// Note that this leaves the value uninitialized.
  hash_code() = default;
 
  /// Form a hash code directly from a numerical value.
  constexpr hash_code(size_t value) : value(value) {}
 
  /// Convert the hash code to its numerical value for use.
  /*explicit*/ constexpr operator size_t() const { return value; }
 
  friend constexpr bool operator==(const hash_code &lhs, const hash_code &rhs) {
    return lhs.value == rhs.value;
  }
  friend constexpr bool operator!=(const hash_code &lhs, const hash_code &rhs) {
    return lhs.value != rhs.value;
  }
 
  /// Allow a hash_code to be directly run through hash_value.
  friend constexpr size_t hash_value(const hash_code &code) {
    return code.value;
  }
};
 
/// Compute a hash_code for any integer value.
///
/// Note that this function is intended to compute the same hash_code for
/// a particular value without regard to the pre-promotion type. This is in
/// contrast to hash_combine which may produce different hash_codes for
/// differing argument types even if they would implicit promote to a common
/// type without changing the value.
template <typename T>
std::enable_if_t<is_integral_or_enum<T>::value, hash_code> hash_value(T value);
 
/// Compute a hash_code for a pointer's address.
///
/// N.B.: This hashes the *address*. Not the value and not the type.
template <typename T> hash_code hash_value(const T *ptr);
 
/// Compute a hash_code for a pair of objects.
template <typename T, typename U>
hash_code hash_value(const std::pair<T, U> &arg);
 
/// Compute a hash_code for a tuple.
template <typename... Ts>
hash_code hash_value(const std::tuple<Ts...> &arg);
 
/// Compute a hash_code for a standard string.
template <typename T>
hash_code hash_value(const std::basic_string<T> &arg);
 
/// Compute a hash_code for a standard string.
template <typename T> hash_code hash_value(const std::optional<T> &arg);
 
// All of the implementation details of actually computing the various hash
// code values are held within this namespace. These routines are included in
// the header file mainly to allow inlining and constant propagation.
namespace hashing {
namespace detail {
 
/// In LLVM_ENABLE_ABI_BREAKING_CHECKS builds, the seed is non-deterministic
/// per process (address of a function in LLVMSupport) to prevent having users
/// depend on the particular hash values. On platforms without ASLR, this is
/// still likely non-deterministic per build.
inline uint64_t get_execution_seed() {
#if LLVM_ENABLE_ABI_BREAKING_CHECKS
  return static_cast<uint64_t>(
      reinterpret_cast<uintptr_t>(&install_fatal_error_handler));
#else
  return 0xff51afd7ed558ccdULL;
#endif
}
 
/// Hash a contiguous byte buffer to a hash_code. The execution seed is XORed
/// into the result (not propagated through the avalanche), so a given byte
/// stream produces the same xxh3 output modulo the per-process seed.
//
// TODO: post-XOR allows `hash_combine(x) ^ hash_combine(y)` to cancel the
// process seed. Follow-up: add a seeded xxh3 entry in
// llvm/lib/Support/xxhash.cpp.
inline hash_code combine_bytes(const char *data, size_t len) {
  return xxh3_64bits(reinterpret_cast<const uint8_t *>(data), len) ^
         get_execution_seed();
}
 
/// Trait to indicate whether a type's bits can be hashed directly.
///
/// A type trait which is true if we want to combine values for hashing by
/// reading the underlying data. It is false if values of this type must
/// first be passed to hash_value, and the resulting hash_codes combined.
//
// FIXME: We want to replace is_integral_or_enum and is_pointer here with
// a predicate which asserts that comparing the underlying storage of two
// values of the type for equality is equivalent to comparing the two values
// for equality. For all the platforms we care about, this holds for integers
// and pointers, but there are platforms where it doesn't and we would like to
// support user-defined types which happen to satisfy this property.
template <typename T>
struct is_hashable_data : std::bool_constant<((is_integral_or_enum<T>::value ||
                                               std::is_pointer<T>::value) &&
                                              64 % sizeof(T) == 0)> {};
 
template <typename T> struct is_hashable_data<const T> : is_hashable_data<T> {};
 
// Special case std::pair to detect when both types are viable and when there
// is no alignment-derived padding in the pair. This is a bit of a lie because
// std::pair isn't truly POD, but it's close enough in all reasonable
// implementations for our use case of hashing the underlying data.
template <typename T, typename U>
struct is_hashable_data<std::pair<T, U>>
    : std::bool_constant<(is_hashable_data<T>::value &&
                          is_hashable_data<U>::value &&
                          (sizeof(T) + sizeof(U)) == sizeof(std::pair<T, U>))> {
};
 
/// Helper to get the hashable data representation for a type.
template <typename T> auto get_hashable_data(const T &value) {
  if constexpr (is_hashable_data<T>::value) {
    // This variant is enabled when the type itself can be used.
    return value;
  } else {
    // This variant is enabled when we must first call hash_value and use the
    // result as our data.
    using ::llvm::hash_value;
    return static_cast<size_t>(hash_value(value));
  }
}
 
/// Implement the combining of integral values into a hash_code.
///
/// This overload is selected when the value type of the iterator is
/// integral. Rather than computing a hash_code for each object and then
/// combining them, this (as an optimization) directly combines the integers.
///
/// xxh3 has no streaming entry point in libLLVMSupport, so the byte stream is
/// flattened to a buffer and hashed in one shot. The 256-byte on-stack buffer
/// holds 32 pointer-sized values, which covers virtually all in-tree
/// non-contiguous callers. The prior chunked CityHash impl streamed and never
/// allocated.
template <typename InputIteratorT>
hash_code hash_combine_range_impl(InputIteratorT first, InputIteratorT last) {
  alignas(uint64_t) char stack_buf[256];
  std::unique_ptr<char[]> heap_buf;
  char *buf = stack_buf;
  size_t cap = sizeof(stack_buf);
  size_t len = 0;
  for (; first != last; ++first) {
    auto data = get_hashable_data(*first);
    if (len + sizeof(data) > cap) {
      size_t new_cap = cap * 2;
      while (new_cap < len + sizeof(data))
        new_cap *= 2;
      // `new char[]` default-initializes (no zero-fill); make_unique would
      // value-initialize, which is wasted work for a buffer about to be
      // overwritten.
      std::unique_ptr<char[]> new_buf(new char[new_cap]);
      std::memcpy(new_buf.get(), buf, len);
      heap_buf = std::move(new_buf);
      buf = heap_buf.get();
      cap = new_cap;
    }
    std::memcpy(buf + len, &data, sizeof(data));
    len += sizeof(data);
  }
  return combine_bytes(buf, len);
}
 
/// Implement the combining of integral values into a hash_code.
///
/// This overload is selected when the value type of the iterator is integral
/// and when the input iterator is actually a pointer. Rather than computing
/// a hash_code for each object and then combining them, this (as an
/// optimization) directly combines the integers. Also, because the integers
/// are stored in contiguous memory, this routine avoids copying each value
/// and directly reads from the underlying memory.
template <typename ValueT>
std::enable_if_t<is_hashable_data<ValueT>::value, hash_code>
hash_combine_range_impl(ValueT *first, ValueT *last) {
  return combine_bytes(reinterpret_cast<const char *>(first),
                       size_t(last - first) * sizeof(ValueT));
}
 
/// Sum of `sizeof(get_hashable_data(arg))` across a parameter pack.
template <typename... Ts> constexpr size_t total_hashable_size() {
  return (size_t(0) + ... +
          sizeof(decltype(get_hashable_data(std::declval<Ts>()))));
}
 
/// Copy `get_hashable_data(arg)` into `buf` at offset `off`, advancing `off`.
template <typename T>
inline void store_hashable_data(char *buf, size_t &off, const T &arg) {
  auto data = get_hashable_data(arg);
  std::memcpy(buf + off, &data, sizeof(data));
  off += sizeof(data);
}
 
} // namespace detail
} // namespace hashing
 
 
/// Compute a hash_code for a sequence of values.
///
/// This hashes a sequence of values. It produces the same hash_code as
/// 'hash_combine(a, b, c, ...)', but can run over arbitrary sized sequences
/// and is significantly faster given pointers and types which can be hashed as
/// a sequence of bytes.
template <typename InputIteratorT>
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) {
  return ::llvm::hashing::detail::hash_combine_range_impl(first, last);
}
 
// A wrapper for hash_combine_range above.
template <typename RangeT> hash_code hash_combine_range(RangeT &&R) {
  return hash_combine_range(adl_begin(R), adl_end(R));
}
 
/// Combine values into a single hash_code.
///
/// This routine accepts a varying number of arguments of any type. It will
/// attempt to combine them into a single hash_code. For user-defined types it
/// attempts to call a \see hash_value overload (via ADL) for the type. For
/// integer and pointer types it directly combines their data into the
/// resulting hash_code.
///
/// The result is suitable for returning from a user's hash_value
/// *implementation* for their user-defined type. Consumers of a type should
/// *not* call this routine, they should instead call 'hash_value'.
template <typename... Ts> hash_code hash_combine(const Ts &...args) {
  constexpr size_t Total = hashing::detail::total_hashable_size<Ts...>();
  // Round up so `data()` is non-null when Total == 0; combine_bytes won't
  // read the buffer in that case (len=0 short-circuits in xxh3_64bits).
  std::array<char, std::max<size_t>(1, Total)> buf{};
  [[maybe_unused]] size_t off = 0;
  (hashing::detail::store_hashable_data(buf.data(), off, args), ...);
  return hashing::detail::combine_bytes(buf.data(), Total);
}
 
// Implementation details for implementations of hash_value overloads provided
// here.
namespace hashing {
namespace detail {
 
/// Helper to hash the value of a single integer.
///
/// Overloads for smaller integer types are not provided to ensure consistent
/// behavior in the presence of integral promotions. Essentially,
/// "hash_value('4')" and "hash_value('0' + 4)" should be the same.
inline hash_code hash_integer_value(uint64_t value) {
  // splitmix64 finalizer (xmxmx).
  uint64_t x = value ^ get_execution_seed();
  x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9ULL;
  x = (x ^ (x >> 27)) * 0x94d049bb133111ebULL;
  return x ^ (x >> 31);
}
 
} // namespace detail
} // namespace hashing
 
// Declared and documented above, but defined here so that any of the hashing
// infrastructure is available.
template <typename T>
std::enable_if_t<is_integral_or_enum<T>::value, hash_code> hash_value(T value) {
  return ::llvm::hashing::detail::hash_integer_value(
      static_cast<uint64_t>(value));
}
 
// Declared and documented above, but defined here so that any of the hashing
// infrastructure is available.
template <typename T> hash_code hash_value(const T *ptr) {
  return ::llvm::hashing::detail::hash_integer_value(
    reinterpret_cast<uintptr_t>(ptr));
}
 
// Declared and documented above, but defined here so that any of the hashing
// infrastructure is available.
template <typename T, typename U>
hash_code hash_value(const std::pair<T, U> &arg) {
  return hash_combine(arg.first, arg.second);
}
 
template <typename... Ts> hash_code hash_value(const std::tuple<Ts...> &arg) {
  return std::apply([](const auto &...xs) { return hash_combine(xs...); }, arg);
}
 
// Declared and documented above, but defined here so that any of the hashing
// infrastructure is available.
template <typename T>
hash_code hash_value(const std::basic_string<T> &arg) {
  return hash_combine_range(arg);
}
 
template <typename T> hash_code hash_value(const std::optional<T> &arg) {
  return arg ? hash_combine(true, *arg) : hash_value(false);
}
 
template <> struct DenseMapInfo<hash_code, void> {
  static constexpr unsigned getHashValue(hash_code val) {
    return static_cast<unsigned>(size_t(val));
  }
  static constexpr bool isEqual(hash_code LHS, hash_code RHS) {
    return LHS == RHS;
  }
};
 
} // namespace llvm
 
/// Implement std::hash so that hash_code can be used in STL containers.
namespace std {
 
template<>
struct hash<llvm::hash_code> {
  constexpr size_t operator()(llvm::hash_code const &Val) const { return Val; }
};
 
} // namespace std;
 
#endif