blob: 7320afee3a9a4795b1f967e2f1cd29a4c779b117 (
plain)
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
72
73
74
|
/*
* Parallel Hash
* (C) 1999-2009 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include <botan/par_hash.h>
#include <botan/parsing.h>
namespace Botan {
void Parallel::add_data(const byte input[], size_t length)
{
for(auto&& hash : m_hashes)
hash->update(input, length);
}
void Parallel::final_result(byte out[])
{
u32bit offset = 0;
for(auto&& hash : m_hashes)
{
hash->final(out + offset);
offset += hash->output_length();
}
}
size_t Parallel::output_length() const
{
size_t sum = 0;
for(auto&& hash : m_hashes)
sum += hash->output_length();
return sum;
}
std::string Parallel::name() const
{
std::vector<std::string> names;
for(auto&& hash : m_hashes)
names.push_back(hash->name());
return "Parallel(" + string_join(names, ',') + ")";
}
HashFunction* Parallel::clone() const
{
std::vector<std::unique_ptr<HashFunction>> hash_copies;
for(auto&& hash : m_hashes)
hash_copies.push_back(std::unique_ptr<HashFunction>(hash->clone()));
return new Parallel(hash_copies);
}
void Parallel::clear()
{
for(auto&& hash : m_hashes)
hash->clear();
}
Parallel::Parallel(std::vector<std::unique_ptr<HashFunction>>& h)
{
for(size_t i = 0; i != h.size(); ++i)
{
m_hashes.push_back(std::unique_ptr<HashFunction>(h[i].release()));
}
}
}
|
