Pickle (serialize and deserialize) MultiThreadedCertVerifier's |cache_|

net/base/hash_value.cc

 // Copyright (c) 2012 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/base/hash_value.h"
 
 #include <stdlib.h>
 
 #include "base/base64.h"
 #include "base/logging.h"
@@ skipping 12 matching lines @@
   return memcmp(a, b, base::kSHA1Length);
 }
 
 }  // namespace
 
 
 bool SHA1HashValue::Equals(const SHA1HashValue& other) const {
   return memcmp(data, other.data, sizeof(data)) == 0;
 }
 
+bool SHA1HashValue::Persist(base::Pickle* pickle) const {
+  return pickle->WriteBytes(data, sizeof(data));
+}
+
+bool SHA1HashValue::CreateFromPickle(base::PickleIterator* iter,
+                                     SHA1HashValue* hash) {
+  const char* outdata_char = NULL;
+  if (!iter->ReadBytes(&outdata_char, sizeof(hash->data)))
+    return false;
+  memcpy(&hash->data, outdata_char, sizeof(hash->data));
+  return true;
+}
+
 bool SHA256HashValue::Equals(const SHA256HashValue& other) const {
   return memcmp(data, other.data, sizeof(data)) == 0;
 }
 
 HashValue::HashValue(const SHA1HashValue& hash) : HashValue(HASH_VALUE_SHA1) {
   fingerprint.sha1 = hash;
 }
 
 HashValue::HashValue(const SHA256HashValue& hash)
     : HashValue(HASH_VALUE_SHA256) {
@@ skipping 83 matching lines @@
 bool IsSHA256HashInSortedArray(const SHA256HashValue& hash,
                                const uint8_t* array,
                                size_t array_byte_len) {
   DCHECK_EQ(0u, array_byte_len % crypto::kSHA256Length);
   const size_t arraylen = array_byte_len / crypto::kSHA256Length;
   return NULL != bsearch(hash.data, array, arraylen, crypto::kSHA256Length,
                          CompareSHA1Hashes);
 }
 
 }  // namespace net