ladybird/Libraries/LibCrypto/Hash/HashManager.h

242 lines
6.1 KiB
C
Raw Normal View History

/*
* Copyright (c) 2020, Ali Mohammad Pur <mpfard@serenityos.org>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#pragma once
#include <AK/Optional.h>
#include <AK/OwnPtr.h>
#include <AK/Variant.h>
2023-09-16 17:01:54 +04:00
#include <LibCrypto/Hash/BLAKE2b.h>
#include <LibCrypto/Hash/HashFunction.h>
#include <LibCrypto/Hash/MD5.h>
#include <LibCrypto/Hash/SHA1.h>
#include <LibCrypto/Hash/SHA2.h>
namespace Crypto::Hash {
enum class HashKind {
Unknown,
None,
2023-09-16 17:01:54 +04:00
BLAKE2b,
MD5,
SHA1,
SHA256,
SHA384,
SHA512,
};
struct MultiHashDigestVariant {
constexpr static size_t Size = 0;
MultiHashDigestVariant(Empty digest)
: m_digest(move(digest))
{
}
MultiHashDigestVariant(MD5::DigestType digest)
: m_digest(move(digest))
{
}
MultiHashDigestVariant(SHA1::DigestType digest)
: m_digest(move(digest))
{
}
MultiHashDigestVariant(SHA256::DigestType digest)
: m_digest(move(digest))
{
}
MultiHashDigestVariant(SHA384::DigestType digest)
: m_digest(move(digest))
{
}
MultiHashDigestVariant(SHA512::DigestType digest)
: m_digest(move(digest))
{
}
2022-04-01 20:58:27 +03:00
[[nodiscard]] u8 const* immutable_data() const
{
return m_digest.visit(
2022-04-01 20:58:27 +03:00
[&](Empty const&) -> u8 const* { VERIFY_NOT_REACHED(); },
[&](auto const& value) { return value.immutable_data(); });
}
[[nodiscard]] size_t data_length() const
{
return m_digest.visit(
2022-04-01 20:58:27 +03:00
[&](Empty const&) -> size_t { VERIFY_NOT_REACHED(); },
[&](auto const& value) { return value.data_length(); });
}
[[nodiscard]] ReadonlyBytes bytes() const
{
return m_digest.visit(
2022-04-01 20:58:27 +03:00
[&](Empty const&) -> ReadonlyBytes { VERIFY_NOT_REACHED(); },
[&](auto const& value) { return value.bytes(); });
}
using DigestVariant = Variant<Empty, MD5::DigestType, SHA1::DigestType, SHA256::DigestType, SHA384::DigestType, SHA512::DigestType>;
DigestVariant m_digest {};
};
2022-01-03 22:28:19 +01:00
class Manager final : public HashFunction<0, 0, MultiHashDigestVariant> {
public:
using HashFunction::update;
static NonnullOwnPtr<Manager> create(HashKind kind)
{
return make<Manager>(kind);
}
Manager()
{
m_pre_init_buffer = ByteBuffer();
}
2022-04-01 20:58:27 +03:00
Manager(Manager const& other) // NOT a copy constructor!
{
m_pre_init_buffer = ByteBuffer(); // will not be used
initialize(other.m_kind);
}
Manager(HashKind kind)
{
m_pre_init_buffer = ByteBuffer();
initialize(kind);
}
~Manager()
{
m_algorithm = Empty {};
}
inline size_t digest_size() const
{
return m_algorithm.visit(
2022-04-01 20:58:27 +03:00
[&](Empty const&) -> size_t { return 0; },
[&](auto const& hash) { return hash->digest_size(); });
}
inline size_t block_size() const
{
return m_algorithm.visit(
2022-04-01 20:58:27 +03:00
[&](Empty const&) -> size_t { return 0; },
[&](auto const& hash) { return hash->block_size(); });
}
inline void initialize(HashKind kind)
{
if (!m_algorithm.has<Empty>()) {
VERIFY_NOT_REACHED();
}
m_kind = kind;
switch (kind) {
2023-09-16 17:01:54 +04:00
case HashKind::BLAKE2b:
m_algorithm = BLAKE2b::create();
2023-09-16 17:01:54 +04:00
break;
case HashKind::MD5:
m_algorithm = MD5::create();
break;
case HashKind::SHA1:
m_algorithm = SHA1::create();
break;
case HashKind::SHA256:
m_algorithm = SHA256::create();
break;
case HashKind::SHA384:
m_algorithm = SHA384::create();
break;
case HashKind::SHA512:
m_algorithm = SHA512::create();
break;
default:
case HashKind::None:
m_algorithm = Empty {};
break;
}
}
2022-04-01 20:58:27 +03:00
virtual void update(u8 const* data, size_t length) override
{
auto size = m_pre_init_buffer.size();
if (size) {
m_algorithm.visit(
[&](Empty&) {},
[&](auto& hash) { hash->update(m_pre_init_buffer); });
}
m_algorithm.visit(
[&](Empty&) { m_pre_init_buffer.append(data, length); },
[&](auto& hash) { hash->update(data, length); });
if (size && m_kind != HashKind::None)
m_pre_init_buffer.clear();
}
virtual DigestType peek() override
{
return m_algorithm.visit(
[&](Empty&) -> DigestType { VERIFY_NOT_REACHED(); },
[&](auto& hash) -> DigestType { return hash->peek(); });
}
virtual DigestType digest() override
{
return m_algorithm.visit(
[&](Empty&) -> DigestType { VERIFY_NOT_REACHED(); },
[&](auto& hash) -> DigestType { return hash->digest(); });
}
virtual void reset() override
{
m_pre_init_buffer.clear();
m_algorithm.visit(
[&](Empty&) {},
[&](auto& hash) { hash->reset(); });
}
virtual ByteString class_name() const override
{
return m_algorithm.visit(
[&](Empty const&) -> ByteString { return "UninitializedHashManager"; },
[&](auto const& hash) { return hash->class_name(); });
}
inline HashKind kind() const
{
return m_kind;
}
inline bool is(HashKind kind) const
{
return m_kind == kind;
}
inline Manager copy() const
{
auto algorithm = m_algorithm.visit(
[&](Empty const&) -> AlgorithmVariant { VERIFY_NOT_REACHED(); },
[&](auto const& hash) -> AlgorithmVariant { return hash->copy(); });
Manager result;
result.m_algorithm = move(algorithm);
result.m_kind = m_kind;
result.m_pre_init_buffer = m_pre_init_buffer;
return result;
}
private:
using AlgorithmVariant = Variant<Empty, NonnullOwnPtr<BLAKE2b>, NonnullOwnPtr<MD5>, NonnullOwnPtr<SHA1>, NonnullOwnPtr<SHA256>, NonnullOwnPtr<SHA384>, NonnullOwnPtr<SHA512>>;
AlgorithmVariant m_algorithm {};
HashKind m_kind { HashKind::None };
ByteBuffer m_pre_init_buffer;
};
}