Mark the Izenpe log as Disqualified

net/cert/ct_known_logs.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_known_logs.h"
 
 #include <stddef.h>
 #include <string.h>
 
 #include <algorithm>
@@ skipping 51 matching lines @@
   CHECK_EQ(log_id.size(), crypto::kSHA256Length);
 
   return std::binary_search(std::begin(kGoogleLogIDs), std::end(kGoogleLogIDs),
                             log_id.data(), [](const char* a, const char* b) {
                               return memcmp(a, b, crypto::kSHA256Length) < 0;
                             });
 }
 
 bool IsLogDisqualified(base::StringPiece log_id,
                        base::Time* disqualification_date) {
   CHECK_EQ(log_id.size(), arraysize(kDisqualifiedCTLogList[0].log_id) - 1);

[eroman, 2016/05/26 00:47:40]

If we don't already have it somewhere, would be prudent to have an assertion
that the input data is sorted.
A DCHECK() should be fine.

(If something were to be added out of order it would break searching)

 
   auto p = std::lower_bound(
       std::begin(kDisqualifiedCTLogList), std::end(kDisqualifiedCTLogList),
       log_id.data(),
       [](const DisqualifiedCTLogInfo& disqualified_log, const char* log_id) {
         return memcmp(disqualified_log.log_id, log_id, crypto::kSHA256Length) <
                0;
       });
   if (p == std::end(kDisqualifiedCTLogList) ||
       memcmp(p->log_id, log_id.data(), crypto::kSHA256Length) != 0) {
     return false;
   }
 
-  *disqualification_date =
-      base::Time::FromInternalValue(p->disqualification_date);
+  *disqualification_date = base::Time::UnixEpoch() + p->disqualification_date;
   return true;
 }
 
 }  // namespace ct
 
 }  // namespace net