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
|
#ifndef CERT_TRANS_MERKLETREE_TREE_HASHER_H_
#define CERT_TRANS_MERKLETREE_TREE_HASHER_H_
#include <stddef.h>
#include <memory>
#include <mutex>
#include <string>
#include "base/macros.h"
#include "merkletree/serial_hasher.h"
class TreeHasher {
public:
TreeHasher(std::unique_ptr<SerialHasher> hasher);
size_t DigestSize() const {
return hasher_->DigestSize();
}
const std::string& HashEmpty() const {
return empty_hash_;
}
std::string HashLeaf(const std::string& data) const;
// Accepts arbitrary strings as children. When hashing digests, it
// is the responsibility of the caller to ensure the inputs are of
// correct size.
std::string HashChildren(const std::string& left_child,
const std::string& right_child) const;
private:
mutable std::mutex lock_;
const std::unique_ptr<SerialHasher> hasher_;
// The pre-computed hash of an empty tree.
const std::string empty_hash_;
DISALLOW_COPY_AND_ASSIGN(TreeHasher);
};
#endif // CERT_TRANS_MERKLETREE_TREE_HASHER_H_
|
