Remove safe-browsing false-positive tracking.

chrome/browser/safe_browsing/safe_browsing_store.cc

 // Copyright (c) 2011 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 "chrome/browser/safe_browsing/safe_browsing_store.h"
 
 #include <algorithm>
 
-#include "base/metrics/histogram.h"
+#include "base/logging.h"
 
 namespace {
 
 // Find items matching between |subs| and |adds|, and remove them,
 // recording the item from |adds| in |adds_removed|.  To minimize
 // copies, the inputs are processing in parallel, so |subs| and |adds|
 // should be compatibly ordered (either by SBAddPrefixLess or
 // SBAddPrefixHashLess).
 //
 // |predAddSub| provides add < sub, |predSubAdd| provides sub < add,
@@ skipping 93 matching lines @@
   for (typename ItemsT::iterator iter = end_iter;
        iter != items->end(); ++iter) {
     if (del_set.count(iter->chunk_id) == 0) {
       *end_iter = *iter;
       ++end_iter;
     }
   }
   items->erase(end_iter, items->end());
 }
 
-enum MissTypes {
-  MISS_TYPE_ALL,
-  MISS_TYPE_FALSE,
-
-  // Always at the end.
-  MISS_TYPE_MAX
-};
-
 }  // namespace
 
-void SBCheckPrefixMisses(const SBAddPrefixes& add_prefixes,
-                         const std::set<SBPrefix>& prefix_misses) {
-  if (prefix_misses.empty())
-    return;
-
-  // Record a hit for all prefixes which missed when sent to the
-  // server.
-  for (size_t i = 0; i < prefix_misses.size(); ++i) {
-    UMA_HISTOGRAM_ENUMERATION("SB2.BloomFilterFalsePositives",
-                              MISS_TYPE_ALL, MISS_TYPE_MAX);
-  }
-
-  // Collect the misses which are not present in |add_prefixes|.
-  // Since |add_prefixes| can contain multiple copies of the same
-  // prefix, it is not sufficient to count the number of elements
-  // present in both collections.
-  std::set<SBPrefix> false_misses(prefix_misses.begin(), prefix_misses.end());
-  for (SBAddPrefixes::const_iterator iter = add_prefixes.begin();
-       iter != add_prefixes.end(); ++iter) {
-    // |erase()| on an absent element should cost like |find()|.
-    false_misses.erase(iter->prefix);
-  }
-
-  // Record a hit for prefixes which we shouldn't have sent in the
-  // first place.
-  for (size_t i = 0; i < false_misses.size(); ++i) {
-    UMA_HISTOGRAM_ENUMERATION("SB2.BloomFilterFalsePositives",
-                              MISS_TYPE_FALSE, MISS_TYPE_MAX);
-  }
-
-  // Divide |MISS_TYPE_FALSE| by |MISS_TYPE_ALL| to get the
-  // bloom-filter false-positive rate.
-}
-
 void SBProcessSubs(SBAddPrefixes* add_prefixes,
                    SBSubPrefixes* sub_prefixes,
                    std::vector<SBAddFullHash>* add_full_hashes,
                    std::vector<SBSubFullHash>* sub_full_hashes,
                    const base::hash_set<int32>& add_chunks_deleted,
                    const base::hash_set<int32>& sub_chunks_deleted) {
   // It is possible to structure templates and template
   // specializations such that the following calls work without having
   // to qualify things.  It becomes very arbitrary, though, and less
   // clear how things are working.
@@ skipping 30 matching lines @@
                &removed_full_adds);
 
   // Remove items from the deleted chunks.  This is done after other
   // processing to allow subs to knock out adds (and be removed) even
   // if the add's chunk is deleted.
   RemoveDeleted(add_prefixes, add_chunks_deleted);
   RemoveDeleted(sub_prefixes, sub_chunks_deleted);
   RemoveDeleted(add_full_hashes, add_chunks_deleted);
   RemoveDeleted(sub_full_hashes, sub_chunks_deleted);
 }