0
0
Fork 0
mirror of https://github.com/matrix-construct/construct synced 2024-11-15 22:41:12 +01:00
construct/include/ircd/hash.h

185 lines
4.6 KiB
C
Raw Normal View History

2018-02-04 03:22:01 +01:00
// Matrix Construct
//
// Copyright (C) Matrix Construct Developers, Authors & Contributors
// Copyright (C) 2016-2018 Jason Volk <jason@zemos.net>
//
// Permission to use, copy, modify, and/or distribute this software for any
// purpose with or without fee is hereby granted, provided that the above
// copyright notice and this permission notice is present in all copies. The
// full license for this software is available in the LICENSE file.
#pragma once
#define HAVE_IRCD_HASH_H
2017-09-30 08:09:34 +02:00
namespace ircd
{
// constexpr bernstein string hasher suite; these functions will hash the
// string at compile time leaving an integer residue at runtime. Decent
// primes are at least 7681 and 5381.
template<size_t PRIME = 7681> constexpr size_t hash(const char16_t *const str, const size_t i = 0);
template<size_t PRIME = 7681> constexpr size_t hash(const string_view str, const size_t i = 0);
// Note that at runtime this hash uses multiplication on every character
// which can consume many cycles...
template<size_t PRIME = 7681> size_t hash(const std::u16string &str, const size_t i = 0);
}
/// Collision-Resistant Hashing
///
/// ircd::crh contains support for collision-resistant hash functions including
/// cryptographic hash functions.
2017-09-23 01:29:06 +02:00
namespace ircd::crh
{
2017-09-23 01:29:06 +02:00
IRCD_EXCEPTION(ircd::error, error)
struct hash;
struct sha256;
2018-04-08 18:27:10 +02:00
struct ripemd160;
2017-09-23 01:29:06 +02:00
}
// Export aliases down to ircd::
2017-09-23 01:29:06 +02:00
namespace ircd
{
using crh::hash;
using crh::sha256;
2018-04-08 18:27:10 +02:00
using crh::ripemd160;
2017-09-23 01:29:06 +02:00
}
/// Abstract interface to a hashing context for any algorithm in ircd::crh
///
/// Use this type when dealing with algorithm-agnostic hashing.
2017-09-23 01:29:06 +02:00
struct ircd::crh::hash
{
/// Returns the byte length of the mutable_buffer for digests
2017-09-23 01:29:06 +02:00
virtual size_t length() const = 0;
/// Samples the digest at the current state (without modifying)
virtual void digest(const mutable_buffer &) const = 0;
/// Samples the digest and modifies the state (depending on impl)
virtual void finalize(const mutable_buffer &b);
/// Appends to the message
virtual void update(const const_buffer &) = 0;
2017-09-23 01:29:06 +02:00
// conveniences for output
template<size_t SIZE> fixed_const_buffer<SIZE> digest() const;
template<size_t SIZE> operator fixed_const_buffer<SIZE>() const;
// conveniences for input
void operator()(const mutable_buffer &out, const const_buffer &in);
hash &operator+=(const const_buffer &);
2017-09-23 01:29:06 +02:00
virtual ~hash() noexcept;
};
/// SHA-256 hashing device.
2017-09-23 01:29:06 +02:00
struct ircd::crh::sha256
final
2017-09-23 01:29:06 +02:00
:hash
{
struct ctx;
static constexpr const size_t &digest_size
2017-09-23 01:29:06 +02:00
{
256 / 8
};
using buf = fixed_const_buffer<digest_size>;
2017-09-23 01:29:06 +02:00
protected:
std::unique_ptr<ctx> ctx;
public:
size_t length() const override;
void digest(const mutable_buffer &) const override;
void finalize(const mutable_buffer &) override;
void update(const const_buffer &) override;
2017-09-23 01:29:06 +02:00
sha256(const mutable_buffer &, const const_buffer &); // note: finalizes
sha256(const const_buffer &); // note: finalizes
2017-09-23 01:29:06 +02:00
sha256();
~sha256() noexcept;
};
2018-04-08 18:27:10 +02:00
/// RIPEMD160 hashing device.
struct ircd::crh::ripemd160
final
:hash
{
struct ctx;
static constexpr const size_t &digest_size
2018-04-08 18:27:10 +02:00
{
160 / 8
};
using buf = fixed_const_buffer<digest_size>;
protected:
std::unique_ptr<ctx> ctx;
public:
size_t length() const override;
void digest(const mutable_buffer &) const override;
void finalize(const mutable_buffer &) override;
void update(const const_buffer &) override;
ripemd160(const mutable_buffer &, const const_buffer &); // note: finalizes
ripemd160(const const_buffer &); // note: finalizes
2018-04-08 18:27:10 +02:00
ripemd160();
~ripemd160() noexcept;
};
/// Automatic gratification from hash::digest()
template<size_t SIZE>
ircd::crh::hash::operator
fixed_const_buffer<SIZE>()
const
{
return digest<SIZE>();
}
/// Digests the hash into the buffer of the specified SIZE and returns it
template<size_t SIZE>
ircd::fixed_const_buffer<SIZE>
ircd::crh::hash::digest()
const
{
assert(SIZE >= length());
return fixed_const_buffer<SIZE>
{
[this](const auto &buffer)
{
this->digest(buffer);
}
};
}
/// Runtime hashing of a std::u16string (for js). Non-cryptographic.
template<size_t PRIME>
size_t
ircd::hash(const std::u16string &str,
2017-09-30 08:09:34 +02:00
const size_t i)
2017-09-23 01:29:06 +02:00
{
return i >= str.size()? PRIME : (hash(str, i+1) * 33ULL) ^ str.at(i);
}
/// Runtime hashing of a string_view. Non-cryptographic.
template<size_t PRIME>
constexpr size_t
ircd::hash(const string_view str,
2017-09-30 08:09:34 +02:00
const size_t i)
{
return i >= str.size()? PRIME : (hash(str, i+1) * 33ULL) ^ str.at(i);
}
/// Compile-time hashing of a wider string literal (for js). Non-cryptographic.
template<size_t PRIME>
constexpr size_t
ircd::hash(const char16_t *const str,
2017-09-30 08:09:34 +02:00
const size_t i)
{
return !str[i]? PRIME : (hash(str, i+1) * 33ULL) ^ str[i];
}