mirror of
https://github.com/Lime3DS/Lime3DS.git
synced 2026-04-11 20:01:32 -06:00
Some checks failed
citra-build / source (push) Has been cancelled
citra-build / linux (appimage) (push) Has been cancelled
citra-build / linux (appimage-wayland) (push) Has been cancelled
citra-build / linux (fresh) (push) Has been cancelled
citra-build / macos (arm64) (push) Has been cancelled
citra-build / macos (x86_64) (push) Has been cancelled
citra-build / windows (msvc) (push) Has been cancelled
citra-build / windows (msys2) (push) Has been cancelled
citra-build / android (googleplay) (push) Has been cancelled
citra-build / android (vanilla) (push) Has been cancelled
citra-build / docker (push) Has been cancelled
citra-format / clang-format (push) Has been cancelled
citra-transifex / transifex (push) Has been cancelled
citra-build / macos-universal (push) Has been cancelled
144 lines
4.4 KiB
C++
144 lines
4.4 KiB
C++
// Copyright Citra Emulator Project / Azahar Emulator Project
|
|
// Licensed under GPLv2 or any later version
|
|
// Refer to the license.txt file included.
|
|
|
|
#pragma once
|
|
|
|
#include <cstddef>
|
|
#include <cstring>
|
|
#include <string>
|
|
#include <xxhash.h>
|
|
#include "cityhash.h"
|
|
#include "common/common_types.h"
|
|
|
|
namespace Common {
|
|
|
|
namespace HashAlgo64 {
|
|
struct XXH3 {
|
|
static inline u64 hash(const void* data, std::size_t len) noexcept {
|
|
return XXH3_64bits(data, len);
|
|
}
|
|
};
|
|
|
|
struct CityHash {
|
|
static inline u64 hash(const void* data, std::size_t len) noexcept {
|
|
return CityHash64(reinterpret_cast<const char*>(data), len);
|
|
}
|
|
};
|
|
} // namespace HashAlgo64
|
|
|
|
/**
|
|
* Computes a 64-bit hash over the specified block of data
|
|
* @param data Block of data to compute hash over
|
|
* @param len Length of data (in bytes) to compute hash over
|
|
* @returns 64-bit hash value that was computed over the data block
|
|
*/
|
|
template <typename Hasher = HashAlgo64::XXH3>
|
|
static inline u64 ComputeHash64(const void* data, std::size_t len) noexcept {
|
|
return Hasher::hash(data, len);
|
|
}
|
|
|
|
/**
|
|
* Computes a 64-bit hash of a struct. In addition to being trivially copyable, it is also critical
|
|
* that either the struct includes no padding, or that any padding is initialized to a known value
|
|
* by memsetting the struct to 0 before filling it in.
|
|
*/
|
|
template <typename T, typename Hasher = HashAlgo64::XXH3>
|
|
static inline u64 ComputeStructHash64(const T& data) noexcept {
|
|
static_assert(std::is_trivially_copyable_v<T>,
|
|
"Type passed to ComputeStructHash64 must be trivially copyable");
|
|
return ComputeHash64<Hasher>(&data, sizeof(data));
|
|
}
|
|
|
|
/**
|
|
* Combines the seed parameter with the provided hash, producing a new unique hash
|
|
* Implementation from: http://boost.sourceforge.net/doc/html/boost/hash_combine.html
|
|
*/
|
|
[[nodiscard]] constexpr u64 HashCombine(u64 seed) {
|
|
return seed;
|
|
}
|
|
|
|
template <typename... Ts>
|
|
[[nodiscard]] constexpr u64 HashCombine(u64 seed, u64 hash, Ts... rest) {
|
|
seed ^= hash + 0x9e3779b9 + (seed << 6) + (seed >> 2);
|
|
return HashCombine(seed, rest...);
|
|
}
|
|
|
|
template <typename T>
|
|
struct IdentityHash {
|
|
std::size_t operator()(const T& value) const {
|
|
return value;
|
|
}
|
|
};
|
|
|
|
/// A helper template that ensures the padding in a struct is initialized by memsetting to 0.
|
|
template <typename T, typename Hasher = HashAlgo64::XXH3>
|
|
struct HashableStruct {
|
|
// In addition to being trivially copyable, T must also have a trivial default constructor,
|
|
// because any member initialization would be overridden by memset
|
|
static_assert(std::is_trivial_v<T>, "Type passed to HashableStruct must be trivial");
|
|
/*
|
|
* We use a union because "implicitly-defined copy/move constructor for a union X copies the
|
|
* object representation of X." and "implicitly-defined copy assignment operator for a union X
|
|
* copies the object representation (3.9) of X." = Bytewise copy instead of memberwise copy.
|
|
* This is important because the padding bytes are included in the hash and comparison between
|
|
* objects.
|
|
*/
|
|
union {
|
|
T state;
|
|
};
|
|
|
|
HashableStruct() noexcept {
|
|
// Memset structure to zero padding bits, so that they will be deterministic when hashing
|
|
std::memset(&state, 0, sizeof(T));
|
|
}
|
|
|
|
bool operator==(const HashableStruct<T>& o) const noexcept {
|
|
return std::memcmp(&state, &o.state, sizeof(T)) == 0;
|
|
};
|
|
|
|
bool operator!=(const HashableStruct<T>& o) const noexcept {
|
|
return !(*this == o);
|
|
};
|
|
|
|
u64 Hash() const noexcept {
|
|
return Common::ComputeStructHash64<T, Hasher>(state);
|
|
}
|
|
};
|
|
|
|
/// Helper struct that provides a hashable string with basic string API
|
|
template <typename Hasher = HashAlgo64::XXH3>
|
|
struct HashableString {
|
|
std::string value;
|
|
|
|
HashableString() = default;
|
|
HashableString(const std::string& s) : value(s) {}
|
|
HashableString(std::string&& s) noexcept : value(std::move(s)) {}
|
|
|
|
u64 Hash() const noexcept {
|
|
return ComputeHash64<Hasher>(value.data(), value.size());
|
|
}
|
|
|
|
bool empty() const noexcept {
|
|
return value.empty();
|
|
}
|
|
|
|
std::size_t size() const noexcept {
|
|
return value.size();
|
|
}
|
|
|
|
const char* data() const noexcept {
|
|
return value.data();
|
|
}
|
|
|
|
operator std::string_view() const noexcept {
|
|
return value;
|
|
}
|
|
|
|
operator std::string&&() && noexcept {
|
|
return std::move(value);
|
|
}
|
|
};
|
|
|
|
} // namespace Common
|