Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 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 | |
| 3 // found in the LICENSE file. | |
| 4 | |
| 5 #include "net/cert/merkle_audit_proof.h" | |
| 6 | |
| 7 #include "base/logging.h" | |
| 8 #include "testing/gmock/include/gmock/gmock.h" | |
| 9 #include "testing/gtest/include/gtest/gtest.h" | |
| 10 | |
| 11 namespace net { | |
| 12 namespace ct { | |
| 13 namespace { | |
| 14 | |
| 15 TEST(MerkleAuditProofTest, CalculatesAuditPathLengthCorrectly) { | |
| 16 // Test all leaves up to a tree size of 4: | |
| 17 EXPECT_EQ(0u, CalculateAuditPathLength(0, 1)); | |
| 18 EXPECT_EQ(1u, CalculateAuditPathLength(0, 2)); | |
| 19 EXPECT_EQ(1u, CalculateAuditPathLength(1, 2)); | |
| 20 EXPECT_EQ(2u, CalculateAuditPathLength(0, 3)); | |
| 21 EXPECT_EQ(2u, CalculateAuditPathLength(1, 3)); | |
| 22 EXPECT_EQ(1u, CalculateAuditPathLength(2, 3)); | |
| 23 EXPECT_EQ(2u, CalculateAuditPathLength(0, 4)); | |
| 24 EXPECT_EQ(2u, CalculateAuditPathLength(1, 4)); | |
| 25 EXPECT_EQ(2u, CalculateAuditPathLength(2, 4)); | |
| 26 EXPECT_EQ(2u, CalculateAuditPathLength(3, 4)); | |
| 27 // Boundary cases for a larger tree size: | |
| 28 EXPECT_EQ(9u, CalculateAuditPathLength(0, 257)); | |
| 29 EXPECT_EQ(9u, CalculateAuditPathLength(255, 257)); | |
| 30 EXPECT_EQ(1u, CalculateAuditPathLength(256, 257)); | |
| 31 // Example from CT over DNS draft RFC: | |
| 32 EXPECT_EQ(20u, CalculateAuditPathLength(123456, 999999)); | |
| 33 // Test data from | |
| 34 // https://github.com/google/certificate-transparency/blob/af98904302724c29aa6 659ca372d41c9687de2b7/python/ct/crypto/merkle_test.py: | |
| 35 EXPECT_EQ(22u, CalculateAuditPathLength(848049, 3630887)); | |
| 36 } | |
| 37 | |
| 38 #if DCHECK_IS_ON() | |
| 39 | |
| 40 TEST(MerkleAuditProofDeathTest, DiesIfLeafIndexIsGreaterThanOrEqualToTreeSize) { | |
|
eroman
2016/05/26 00:39:43
This test sounds fishy.
(a) if it is reachable co
Rob Percival
2016/05/26 03:17:13
The tree size will come from a signed, verified da
Rob Percival
2016/05/26 16:00:57
Done.
| |
| 41 EXPECT_DEATH_IF_SUPPORTED(CalculateAuditPathLength(0, 0), | |
| 42 "leaf_index < tree_size"); | |
| 43 EXPECT_DEATH_IF_SUPPORTED(CalculateAuditPathLength(10, 10), | |
| 44 "leaf_index < tree_size"); | |
| 45 EXPECT_DEATH_IF_SUPPORTED(CalculateAuditPathLength(11, 10), | |
| 46 "leaf_index < tree_size"); | |
| 47 } | |
| 48 | |
| 49 #endif | |
| 50 | |
| 51 } // namespace | |
| 52 } // namespace ct | |
| 53 } // namespace net | |
| OLD | NEW |