blob: aa8566b2ac305e3d1623cb035c24802a9e0850bb (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
// SPDX-FileCopyrightText: 2022 Linus Jahn <lnj@kaidan.im>
//
// SPDX-License-Identifier: LGPL-2.1-or-later
#ifndef QXMPPHASHING_H
#define QXMPPHASHING_H
#include "QXmppError.h"
#include "QXmppGlobal.h"
#include "QXmppHash.h"
#include <memory>
#include <variant>
#include <vector>
#include <QCryptographicHash>
template<typename T>
class QFuture;
class QXmppHash;
namespace QXmpp::Private {
struct HashingResult
{
using Result = std::variant<std::vector<QXmppHash>, Cancelled, QXmppError>;
HashingResult(Result result, std::unique_ptr<QIODevice> data)
: result(std::move(result)), data(std::move(data))
{
}
Result result;
std::unique_ptr<QIODevice> data;
};
struct HashVerificationResult
{
struct NoStrongHashes
{
};
struct NotMatching
{
};
struct Verified
{
};
using Result = std::variant<NoStrongHashes, NotMatching, Verified, Cancelled, QXmppError>;
HashVerificationResult(Result result, std::unique_ptr<QIODevice> data)
: result(std::move(result)), data(std::move(data))
{
}
Result result;
std::unique_ptr<QIODevice> data;
};
using HashingResultPtr = std::shared_ptr<HashingResult>;
using HashVerificationResultPtr = std::shared_ptr<HashVerificationResult>;
bool isHashingAlgorithmSecure(HashAlgorithm algorithm);
uint16_t hashPriority(HashAlgorithm algorithm);
// QXMPP_EXPORT for unit tests
QXMPP_EXPORT QFuture<HashingResultPtr> calculateHashes(std::unique_ptr<QIODevice> data, std::vector<HashAlgorithm> hashes);
QFuture<HashVerificationResultPtr> verifyHashes(std::unique_ptr<QIODevice> data, std::vector<QXmppHash> hashes);
} // namespace QXmpp::Private
#endif // QXMPPHASHING_H
|
