Add code to compute the root hash for a hash tree

extensions/browser/content_hash_tree_unittest.cc

Index: extensions/browser/content_hash_tree_unittest.cc
diff --git a/extensions/browser/content_hash_tree_unittest.cc b/extensions/browser/content_hash_tree_unittest.cc
new file mode 100644
index 0000000000000000000000000000000000000000..7298c0820ac6c83b6c200106d3414ee086a243b3
--- /dev/null
+++ b/extensions/browser/content_hash_tree_unittest.cc
@@ -0,0 +1,79 @@
+// Copyright 2014 The Chromium Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "base/memory/scoped_ptr.h"
+#include "base/stl_util.h"
+#include "crypto/secure_hash.h"
+#include "crypto/sha2.h"
+#include "extensions/browser/content_hash_tree.h"
+#include "testing/gtest/include/gtest/gtest.h"
+
+using crypto::kSHA256Length;
+using crypto::SecureHash;
+
+namespace extensions {
+
+class ContentHashTreeTest : public ::testing::Test {
+ public:
+  ContentHashTreeTest() : block_size_(1024) {}
+
+ protected:
+  int block_size_;
+  std::vector<std::string> nodes_;
+};
+
+TEST_F(ContentHashTreeTest, HashTreeBasics) {
+  // Empty array.
+  EXPECT_EQ(std::string(), ComputeTreeHashRoot(nodes_, 1024));
+
+  // One node.
+  std::string node1;
+  node1.append('1', kSHA256Length);
+  nodes_.push_back(node1);
+  EXPECT_EQ(node1, ComputeTreeHashRoot(nodes_, 1024));
+
+  // Two nodes.
+  std::string node2;
+  node2.append('2', kSHA256Length);
+  nodes_.push_back(node2);
+
+  std::string expected(kSHA256Length, 0);
+  scoped_ptr<SecureHash> hash(SecureHash::Create(SecureHash::SHA256));
+  hash->Update(node1.data(), node1.size());
+  hash->Update(node2.data(), node2.size());
+  hash->Finish(string_as_array(&expected), expected.size());
+  EXPECT_EQ(expected, ComputeTreeHashRoot(nodes_, 1024));
+}
+
+TEST_F(ContentHashTreeTest, HashTreeMultipleLevels) {
+  for (int i = 0; i < 3; i++) {
+    std::string node;
+    for (size_t j = 0; j < kSHA256Length; j++)
+      node.append(static_cast<char>((j + i) % 256), 1);
+    nodes_.push_back(node);
+  }
+
+  // First try a test where our children per parent is > 3, so we expect
+  // the result to be the hash of all 3 concatenated together. E.g the
+  // expected top hash should be 4 in the following diagram:
+  //   4
+  // 1 2 3
+  std::string expected =
+      crypto::SHA256HashString(nodes_[0] + nodes_[1] + nodes_[2]);
+  EXPECT_EQ(expected, ComputeTreeHashRoot(nodes_, 1024));
+
+  // Now try making the children per element amount be 2, so that we
+  // should get the following:
+  //   6
+  //  4 5
+  // 1 2 3
+  // where 4 is the hash of 1 and 2, 5 is the hash of 3, and 6 is the
+  // hash of 4 and 5.
+  std::string hash_of_first_2 = crypto::SHA256HashString(nodes_[0] + nodes_[1]);
+  std::string hash_of_third = crypto::SHA256HashString(nodes_[2]);
+  expected = crypto::SHA256HashString(hash_of_first_2 + hash_of_third);
+  EXPECT_EQ(expected, ComputeTreeHashRoot(nodes_, kSHA256Length * 2));
+}
+
+}  // namespace extensions