OLD | NEW |
1 // Copyright 2016 The Chromium Authors. All rights reserved. | 1 // Copyright 2016 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "net/cert/merkle_audit_proof.h" | 5 #include "net/cert/merkle_audit_proof.h" |
6 | 6 |
7 #include "base/logging.h" | 7 #include "base/logging.h" |
8 | 8 |
9 namespace net { | 9 namespace net { |
10 namespace ct { | 10 namespace ct { |
(...skipping 13 matching lines...) Expand all Loading... |
24 index /= 2; | 24 index /= 2; |
25 last_node /= 2; | 25 last_node /= 2; |
26 } | 26 } |
27 | 27 |
28 return length; | 28 return length; |
29 } | 29 } |
30 | 30 |
31 MerkleAuditProof::MerkleAuditProof() {} | 31 MerkleAuditProof::MerkleAuditProof() {} |
32 | 32 |
33 MerkleAuditProof::MerkleAuditProof(uint64_t leaf_index, | 33 MerkleAuditProof::MerkleAuditProof(uint64_t leaf_index, |
| 34 uint64_t tree_size, |
34 const std::vector<std::string>& audit_path) | 35 const std::vector<std::string>& audit_path) |
35 : leaf_index(leaf_index), nodes(audit_path) {} | 36 : leaf_index(leaf_index), tree_size(tree_size), nodes(audit_path) {} |
36 | 37 |
37 MerkleAuditProof::~MerkleAuditProof() {} | 38 MerkleAuditProof::~MerkleAuditProof() {} |
38 | 39 |
39 } // namespace ct | 40 } // namespace ct |
40 } // namespace net | 41 } // namespace net |
OLD | NEW |