disable CTLogVerifierTest.VerifiesValidConsistencyProofsFromReferenceGenerator

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 <string>
 
@@ skipping 465 matching lines @@
     // doesn't contain the root of snapshot1, so set have_root1 = false.
     subproof = ReferenceSnapshotConsistency(&inputs[split], snapshot2 - split,
                                             snapshot1 - split, false);
     proof.insert(proof.end(), subproof.begin(), subproof.end());
     // Record the hash of the left subtree (equal in both trees).
     proof.push_back(ReferenceMerkleTreeHash(&inputs[0], split));
   }
   return proof;
 }
 
-// "brute-force" test generating a tree of 256 entries, generating
-// a consistency proof for each snapshot of each sub-tree up to that
-// size and making sure it verifies.
+// Times out on Win7 test bot.  http://crbug.com/598406
+#if defined(OS_WIN)
+#define MAYBE_VerifiesValidConsistencyProofsFromReferenceGenerator \
+  DISABLED_VerifiesValidConsistencyProofsFromReferenceGenerator
+#else
+#define MAYBE_VerifiesValidConsistencyProofsFromReferenceGenerator \
+  VerifiesValidConsistencyProofsFromReferenceGenerator
+#endif
 TEST_F(CTLogVerifierTest,
-       VerifiesValidConsistencyProofsFromReferenceGenerator) {
+       MAYBE_VerifiesValidConsistencyProofsFromReferenceGenerator) {
   std::vector<std::string> data;
   for (int i = 0; i < 256; ++i)
     data.push_back(std::string(1, i));
 
   std::vector<std::string> proof;
   std::string root1, root2;
   // More tests with reference proof generator.
   for (size_t tree_size = 1; tree_size <= data.size() / 2; ++tree_size) {
     root2 = ReferenceMerkleTreeHash(data.data(), tree_size);
     // Repeat for each snapshot in range.
     for (size_t snapshot = 1; snapshot <= tree_size; ++snapshot) {
       proof =
           ReferenceSnapshotConsistency(data.data(), tree_size, snapshot, true);
       root1 = ReferenceMerkleTreeHash(data.data(), snapshot);
       VerifierConsistencyCheck(snapshot, tree_size, root1, root2, proof);
     }
   }
 }
 
 }  // namespace
 
 }  // namespace net