Measure how often downloaded executables match the download whitelist.

chrome/browser/safe_browsing/protocol_parser.cc

 // Copyright (c) 2010 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.
 //
 // Parse the data returned from the SafeBrowsing v2.1 protocol response.
 
 #include <stdlib.h>
 
 #include "base/format_macros.h"
 #include "base/logging.h"
@@ skipping 317 matching lines @@
                                                const char* data,
                                                int data_len,
                                                int hash_len,
                                                std::deque<SBChunkHost>* hosts) {
   const char* chunk_data = data;
   int remaining = data_len;
   int prefix_count;
   SBEntry::Type type = hash_len == sizeof(SBPrefix) ?
       SBEntry::ADD_PREFIX : SBEntry::ADD_FULL_HASH;
 
-  if (list_name == safe_browsing_util::kBinHashList) {
-    // kBinHashList only contains prefixes, no HOSTKEY and COUNT.
+  if (list_name == safe_browsing_util::kBinHashList ||
+      list_name == safe_browsing_util::kDownloadWhiteList) {
+    // These lists only contain prefixes, no HOSTKEY and COUNT.
     DCHECK_EQ(0, remaining % hash_len);
     prefix_count = remaining / hash_len;
     SBChunkHost chunk_host;
     chunk_host.host = 0;
     chunk_host.entry = SBEntry::Create(type, prefix_count);
     hosts->push_back(chunk_host);
     if (!ReadPrefixes(&chunk_data, &remaining, chunk_host.entry, prefix_count))
       return false;
   } else {
     SBPrefix host;
@@ skipping 136 matching lines @@
 
     data += line.size() + 1;
     remaining -= static_cast<int>(line.size()) + 1;
   }
 
   if (client_key->empty() || wrapped_key->empty())
     return false;
 
   return true;
 }