123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282 |
- //===- sanitizer_dense_map_info.h - Type traits for DenseMap ----*- 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
- //
- //===----------------------------------------------------------------------===//
- #ifndef SANITIZER_DENSE_MAP_INFO_H
- #define SANITIZER_DENSE_MAP_INFO_H
- #include "sanitizer_common.h"
- #include "sanitizer_internal_defs.h"
- #include "sanitizer_type_traits.h"
- namespace __sanitizer {
- namespace detail {
- /// Simplistic combination of 32-bit hash values into 32-bit hash values.
- static constexpr unsigned combineHashValue(unsigned a, unsigned b) {
- u64 key = (u64)a << 32 | (u64)b;
- key += ~(key << 32);
- key ^= (key >> 22);
- key += ~(key << 13);
- key ^= (key >> 8);
- key += (key << 3);
- key ^= (key >> 15);
- key += ~(key << 27);
- key ^= (key >> 31);
- return (unsigned)key;
- }
- // We extend a pair to allow users to override the bucket type with their own
- // implementation without requiring two members.
- template <typename KeyT, typename ValueT>
- struct DenseMapPair {
- KeyT first = {};
- ValueT second = {};
- constexpr DenseMapPair() = default;
- constexpr DenseMapPair(const KeyT &f, const ValueT &s)
- : first(f), second(s) {}
- template <typename KeyT2, typename ValueT2>
- constexpr DenseMapPair(KeyT2 &&f, ValueT2 &&s)
- : first(__sanitizer::forward<KeyT2>(f)),
- second(__sanitizer::forward<ValueT2>(s)) {}
- constexpr DenseMapPair(const DenseMapPair &other) = default;
- constexpr DenseMapPair &operator=(const DenseMapPair &other) = default;
- constexpr DenseMapPair(DenseMapPair &&other) = default;
- constexpr DenseMapPair &operator=(DenseMapPair &&other) = default;
- KeyT &getFirst() { return first; }
- const KeyT &getFirst() const { return first; }
- ValueT &getSecond() { return second; }
- const ValueT &getSecond() const { return second; }
- };
- } // end namespace detail
- template <typename T>
- struct DenseMapInfo {
- // static T getEmptyKey();
- // static T getTombstoneKey();
- // static unsigned getHashValue(const T &Val);
- // static bool isEqual(const T &LHS, const T &RHS);
- };
- // Provide DenseMapInfo for all pointers. Come up with sentinel pointer values
- // that are aligned to alignof(T) bytes, but try to avoid requiring T to be
- // complete. This allows clients to instantiate DenseMap<T*, ...> with forward
- // declared key types. Assume that no pointer key type requires more than 4096
- // bytes of alignment.
- template <typename T>
- struct DenseMapInfo<T *> {
- // The following should hold, but it would require T to be complete:
- // static_assert(alignof(T) <= (1 << Log2MaxAlign),
- // "DenseMap does not support pointer keys requiring more than "
- // "Log2MaxAlign bits of alignment");
- static constexpr uptr Log2MaxAlign = 12;
- static constexpr T *getEmptyKey() {
- uptr Val = static_cast<uptr>(-1);
- Val <<= Log2MaxAlign;
- return reinterpret_cast<T *>(Val);
- }
- static constexpr T *getTombstoneKey() {
- uptr Val = static_cast<uptr>(-2);
- Val <<= Log2MaxAlign;
- return reinterpret_cast<T *>(Val);
- }
- static constexpr unsigned getHashValue(const T *PtrVal) {
- return (unsigned((uptr)PtrVal) >> 4) ^ (unsigned((uptr)PtrVal) >> 9);
- }
- static constexpr bool isEqual(const T *LHS, const T *RHS) {
- return LHS == RHS;
- }
- };
- // Provide DenseMapInfo for chars.
- template <>
- struct DenseMapInfo<char> {
- static constexpr char getEmptyKey() { return ~0; }
- static constexpr char getTombstoneKey() { return ~0 - 1; }
- static constexpr unsigned getHashValue(const char &Val) { return Val * 37U; }
- static constexpr bool isEqual(const char &LHS, const char &RHS) {
- return LHS == RHS;
- }
- };
- // Provide DenseMapInfo for unsigned chars.
- template <>
- struct DenseMapInfo<unsigned char> {
- static constexpr unsigned char getEmptyKey() { return ~0; }
- static constexpr unsigned char getTombstoneKey() { return ~0 - 1; }
- static constexpr unsigned getHashValue(const unsigned char &Val) {
- return Val * 37U;
- }
- static constexpr bool isEqual(const unsigned char &LHS,
- const unsigned char &RHS) {
- return LHS == RHS;
- }
- };
- // Provide DenseMapInfo for unsigned shorts.
- template <>
- struct DenseMapInfo<unsigned short> {
- static constexpr unsigned short getEmptyKey() { return 0xFFFF; }
- static constexpr unsigned short getTombstoneKey() { return 0xFFFF - 1; }
- static constexpr unsigned getHashValue(const unsigned short &Val) {
- return Val * 37U;
- }
- static constexpr bool isEqual(const unsigned short &LHS,
- const unsigned short &RHS) {
- return LHS == RHS;
- }
- };
- // Provide DenseMapInfo for unsigned ints.
- template <>
- struct DenseMapInfo<unsigned> {
- static constexpr unsigned getEmptyKey() { return ~0U; }
- static constexpr unsigned getTombstoneKey() { return ~0U - 1; }
- static constexpr unsigned getHashValue(const unsigned &Val) {
- return Val * 37U;
- }
- static constexpr bool isEqual(const unsigned &LHS, const unsigned &RHS) {
- return LHS == RHS;
- }
- };
- // Provide DenseMapInfo for unsigned longs.
- template <>
- struct DenseMapInfo<unsigned long> {
- static constexpr unsigned long getEmptyKey() { return ~0UL; }
- static constexpr unsigned long getTombstoneKey() { return ~0UL - 1L; }
- static constexpr unsigned getHashValue(const unsigned long &Val) {
- return (unsigned)(Val * 37UL);
- }
- static constexpr bool isEqual(const unsigned long &LHS,
- const unsigned long &RHS) {
- return LHS == RHS;
- }
- };
- // Provide DenseMapInfo for unsigned long longs.
- template <>
- struct DenseMapInfo<unsigned long long> {
- static constexpr unsigned long long getEmptyKey() { return ~0ULL; }
- static constexpr unsigned long long getTombstoneKey() { return ~0ULL - 1ULL; }
- static constexpr unsigned getHashValue(const unsigned long long &Val) {
- return (unsigned)(Val * 37ULL);
- }
- static constexpr bool isEqual(const unsigned long long &LHS,
- const unsigned long long &RHS) {
- return LHS == RHS;
- }
- };
- // Provide DenseMapInfo for shorts.
- template <>
- struct DenseMapInfo<short> {
- static constexpr short getEmptyKey() { return 0x7FFF; }
- static constexpr short getTombstoneKey() { return -0x7FFF - 1; }
- static constexpr unsigned getHashValue(const short &Val) { return Val * 37U; }
- static constexpr bool isEqual(const short &LHS, const short &RHS) {
- return LHS == RHS;
- }
- };
- // Provide DenseMapInfo for ints.
- template <>
- struct DenseMapInfo<int> {
- static constexpr int getEmptyKey() { return 0x7fffffff; }
- static constexpr int getTombstoneKey() { return -0x7fffffff - 1; }
- static constexpr unsigned getHashValue(const int &Val) {
- return (unsigned)(Val * 37U);
- }
- static constexpr bool isEqual(const int &LHS, const int &RHS) {
- return LHS == RHS;
- }
- };
- // Provide DenseMapInfo for longs.
- template <>
- struct DenseMapInfo<long> {
- static constexpr long getEmptyKey() {
- return (1UL << (sizeof(long) * 8 - 1)) - 1UL;
- }
- static constexpr long getTombstoneKey() { return getEmptyKey() - 1L; }
- static constexpr unsigned getHashValue(const long &Val) {
- return (unsigned)(Val * 37UL);
- }
- static constexpr bool isEqual(const long &LHS, const long &RHS) {
- return LHS == RHS;
- }
- };
- // Provide DenseMapInfo for long longs.
- template <>
- struct DenseMapInfo<long long> {
- static constexpr long long getEmptyKey() { return 0x7fffffffffffffffLL; }
- static constexpr long long getTombstoneKey() {
- return -0x7fffffffffffffffLL - 1;
- }
- static constexpr unsigned getHashValue(const long long &Val) {
- return (unsigned)(Val * 37ULL);
- }
- static constexpr bool isEqual(const long long &LHS, const long long &RHS) {
- return LHS == RHS;
- }
- };
- // Provide DenseMapInfo for all pairs whose members have info.
- template <typename T, typename U>
- struct DenseMapInfo<detail::DenseMapPair<T, U>> {
- using Pair = detail::DenseMapPair<T, U>;
- using FirstInfo = DenseMapInfo<T>;
- using SecondInfo = DenseMapInfo<U>;
- static constexpr Pair getEmptyKey() {
- return detail::DenseMapPair<T, U>(FirstInfo::getEmptyKey(),
- SecondInfo::getEmptyKey());
- }
- static constexpr Pair getTombstoneKey() {
- return detail::DenseMapPair<T, U>(FirstInfo::getTombstoneKey(),
- SecondInfo::getTombstoneKey());
- }
- static constexpr unsigned getHashValue(const Pair &PairVal) {
- return detail::combineHashValue(FirstInfo::getHashValue(PairVal.first),
- SecondInfo::getHashValue(PairVal.second));
- }
- static constexpr bool isEqual(const Pair &LHS, const Pair &RHS) {
- return FirstInfo::isEqual(LHS.first, RHS.first) &&
- SecondInfo::isEqual(LHS.second, RHS.second);
- }
- };
- } // namespace __sanitizer
- #endif // SANITIZER_DENSE_MAP_INFO_H
|