blob: 18a7b3a0edd3a96e237b332d1f764599f239f9e9 (
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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
|
/*************************************************
* Parallel Source File *
* (C) 1999-2006 The Botan Project *
*************************************************/
#include <botan/par_hash.h>
#include <botan/lookup.h>
namespace Botan {
namespace {
/*************************************************
* Return the sum of the hash sizes *
*************************************************/
u32bit sum_of_hash_lengths(const std::vector<std::string>& names)
{
u32bit sum = 0;
for(u32bit j = 0; j != names.size(); ++j)
sum += output_length_of(names[j]);
return sum;
}
}
/*************************************************
* Update the hash *
*************************************************/
void Parallel::add_data(const byte input[], u32bit length)
{
for(u32bit j = 0; j != hashes.size(); ++j)
hashes[j]->update(input, length);
}
/*************************************************
* Finalize the hash *
*************************************************/
void Parallel::final_result(byte hash[])
{
u32bit offset = 0;
for(u32bit j = 0; j != hashes.size(); ++j)
{
hashes[j]->final(hash + offset);
offset += hashes[j]->OUTPUT_LENGTH;
}
}
/*************************************************
* Return the name of this type *
*************************************************/
std::string Parallel::name() const
{
std::string hash_names;
for(u32bit j = 0; j != hashes.size(); ++j)
{
if(j)
hash_names += ',';
hash_names += hashes[j]->name();
}
return "Parallel(" + hash_names + ")";
}
/*************************************************
* Return a clone of this object *
*************************************************/
HashFunction* Parallel::clone() const
{
std::vector<std::string> names;
for(u32bit j = 0; j != hashes.size(); ++j)
names.push_back(hashes[j]->name());
return new Parallel(names);
}
/*************************************************
* Clear memory of sensitive data *
*************************************************/
void Parallel::clear() throw()
{
for(u32bit j = 0; j != hashes.size(); ++j)
hashes[j]->clear();
}
/*************************************************
* Parallel Constructor *
*************************************************/
Parallel::Parallel(const std::vector<std::string>& names) :
HashFunction(sum_of_hash_lengths(names))
{
for(u32bit j = 0; j != names.size(); ++j)
hashes.push_back(get_hash(names[j]));
}
/*************************************************
* Parallel Destructor *
*************************************************/
Parallel::~Parallel()
{
for(u32bit j = 0; j != hashes.size(); ++j)
delete hashes[j];
}
}
|
