Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(82)

Side by Side Diff: extensions/browser/content_hash_tree_unittest.cc

Issue 274243004: Add code to compute the root hash for a hash tree (Closed) Base URL: svn://svn.chromium.org/chrome/trunk/src
Patch Set: fixed bugs and added tests Created 6 years, 7 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
OLDNEW
(Empty)
1 // Copyright 2014 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 "base/memory/scoped_ptr.h"
6 #include "base/stl_util.h"
7 #include "crypto/secure_hash.h"
8 #include "crypto/sha2.h"
9 #include "extensions/browser/content_hash_tree.h"
10 #include "testing/gtest/include/gtest/gtest.h"
11
12 using crypto::kSHA256Length;
13 using crypto::SecureHash;
14
15 namespace extensions {
16
17 class ContentHashTreeTest : public ::testing::Test {
18 public:
19 ContentHashTreeTest() : block_size_(1024) {}
20
21 protected:
22 int block_size_;
23 std::vector<std::string> nodes_;
24 };
25
26 TEST_F(ContentHashTreeTest, HashTreeBasics) {
27 // Empty array.
28 EXPECT_EQ(std::string(), ComputeTreeHashRoot(nodes_, 1024));
29
30 // One node.
31 std::string node1;
32 node1.append('1', kSHA256Length);
33 nodes_.push_back(node1);
34 EXPECT_EQ(node1, ComputeTreeHashRoot(nodes_, 1024));
35
36 // Two nodes.
37 std::string node2;
38 node2.append('2', kSHA256Length);
39 nodes_.push_back(node2);
40
41 std::string expected(kSHA256Length, 0);
42 scoped_ptr<SecureHash> hash(SecureHash::Create(SecureHash::SHA256));
43 hash->Update(node1.data(), node1.size());
44 hash->Update(node2.data(), node2.size());
45 hash->Finish(string_as_array(&expected), expected.size());
46 EXPECT_EQ(expected, ComputeTreeHashRoot(nodes_, 1024));
47 }
48
49 TEST_F(ContentHashTreeTest, HashTreeMultipleLevels) {
50 for (int i = 0; i < 3; i++) {
51 std::string node;
52 for (size_t j = 0; j < kSHA256Length; j++)
53 node.append(static_cast<char>((j + i) % 256), 1);
54 nodes_.push_back(node);
55 }
56
57 // First try a test where our children per parent is > 3, so we expect
58 // the result to be the hash of all 3 concatenated together. E.g the
59 // expected top hash should be 4 in the following diagram:
60 // 4
61 // 1 2 3
62 std::string expected =
63 crypto::SHA256HashString(nodes_[0] + nodes_[1] + nodes_[2]);
64 EXPECT_EQ(expected, ComputeTreeHashRoot(nodes_, 1024));
65
66 // Now try making the children per element amount be 2, so that we
67 // should get the following:
68 // 6
69 // 4 5
70 // 1 2 3
71 // where 4 is the hash of 1 and 2, 5 is the hash of 3, and 6 is the
72 // hash of 4 and 5.
73 std::string hash_of_first_2 = crypto::SHA256HashString(nodes_[0] + nodes_[1]);
74 std::string hash_of_third = crypto::SHA256HashString(nodes_[2]);
75 expected = crypto::SHA256HashString(hash_of_first_2 + hash_of_third);
76 EXPECT_EQ(expected, ComputeTreeHashRoot(nodes_, kSHA256Length * 2));
77 }
78
79 } // namespace extensions
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698