Adds domain names for all qualified CT logs

net/cert/ct_log_verifier_unittest.cc

 // Copyright 2013 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 "net/cert/ct_log_verifier.h"
 
 #include <stdint.h>
 
 #include <memory>
 #include <string>
@@ skipping 122 matching lines @@
                                  new_tree_size),
       old_tree_root, new_tree_root);
 }
 
 class CTLogVerifierTest : public ::testing::Test {
  public:
   CTLogVerifierTest() {}
 
   void SetUp() override {
     log_ = CTLogVerifier::Create(ct::GetTestPublicKey(), "testlog",
-                                 "https://ct.example.com");
+                                 "https://ct.example.com", "ct.example.com");
 
     ASSERT_TRUE(log_);
-    ASSERT_EQ(log_->key_id(), ct::GetTestPublicKeyId());
+    ASSERT_EQ(ct::GetTestPublicKeyId(), log_->key_id());
+    ASSERT_EQ("ct.example.com", log_->dns_domain());
   }
 
   // Given a consistency proof between two snapshots of the tree, asserts that
   // it verifies and no other combination of snapshots and proof nodes verifies.
   void VerifierConsistencyCheck(int snapshot1,
                                 int snapshot2,
                                 const std::string& root1,
                                 const std::string& root2,
                                 const std::vector<std::string>& proof) {
     // Verify the original consistency proof.
@@ skipping 153 matching lines @@
   ct::SignedTreeHead sth;
   ASSERT_TRUE(ct::GetBadEmptySignedTreeHead(&sth));
   EXPECT_FALSE(log_->VerifySignedTreeHead(sth));
 }
 
 // Test that excess data after the public key is rejected.
 TEST_F(CTLogVerifierTest, ExcessDataInPublicKey) {
   std::string key = ct::GetTestPublicKey();
   key += "extra";
 
-  scoped_refptr<const CTLogVerifier> log =
-      CTLogVerifier::Create(key, "testlog", "https://ct.example.com");
+  scoped_refptr<const CTLogVerifier> log = CTLogVerifier::Create(
+      key, "testlog", "https://ct.example.com", "ct.example.com");
   EXPECT_FALSE(log);
 }
 
 TEST_F(CTLogVerifierTest, VerifiesConsistencyProofEdgeCases_EmptyProof) {
   std::vector<std::string> empty_proof;
   std::string root1(GetEmptyTreeHash()), root2(GetEmptyTreeHash());
 
   // Snapshots that are always consistent, because they are either
   // from an empty tree to a non-empty one or for trees of the same
   // size.
@@ skipping 177 matching lines @@
           ReferenceSnapshotConsistency(data.data(), tree_size, snapshot, true);
       root1 = ReferenceMerkleTreeHash(data.data(), snapshot);
       VerifierConsistencyCheck(snapshot, tree_size, root1, root2, proof);
     }
   }
 }
 
 }  // namespace
 
 }  // namespace net