[NOT FOR LANDING] Detailed loading traces

components/safe_browsing_db/prefix_set.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 "components/safe_browsing_db/prefix_set.h"
 
 #include <limits.h>
 
 #include <algorithm>
 #include <utility>
 
 #include "base/files/file_util.h"
 #include "base/files/scoped_file.h"
 #include "base/logging.h"
 #include "base/md5.h"
 #include "base/metrics/histogram.h"
 #include "base/metrics/sparse_histogram.h"
+#include "base/trace_event/trace_event.h"
 
 namespace safe_browsing {
 
 namespace {
 
 // |kMagic| should be reasonably unique, and not match itself across
 // endianness changes.  I generated this value with:
 // md5 -qs chrome/browser/safe_browsing/prefix_set.cc | colrm 9
 static uint32_t kMagic = 0x864088dd;
 
@@ skipping 67 matching lines @@
                      std::vector<SBFullHash>* full_hashes) {
   DCHECK(index && deltas && full_hashes);
   index_.swap(*index);
   deltas_.swap(*deltas);
   full_hashes_.swap(*full_hashes);
 }
 
 PrefixSet::~PrefixSet() {}
 
 bool PrefixSet::PrefixExists(SBPrefix prefix) const {
+  TRACE_EVENT0("toplevel", "PrefixSet::PrefixExists");
   if (index_.empty())
     return false;
 
   // Find the first position after |prefix| in |index_|.
   IndexVector::const_iterator iter =
       std::upper_bound(index_.begin(), index_.end(),
                        IndexPair(prefix, 0), PrefixLess);
 
   // |prefix| comes before anything that's in the set.
   if (iter == index_.begin())
@@ skipping 12 matching lines @@
 
   // Scan forward accumulating deltas while a match is possible.
   for (size_t di = iter->second; di < bound && current < prefix; ++di) {
     current += deltas_[di];
   }
 
   return current == prefix;
 }
 
 bool PrefixSet::Exists(const SBFullHash& hash) const {
+  TRACE_EVENT0("toplevel", "PrefixSet::Exists");
+
   if (std::binary_search(full_hashes_.begin(), full_hashes_.end(),
                          hash, SBFullHashLess)) {
     return true;
   }
+  TRACE_EVENT0("toplevel", "PrefixSet::Exists::B");
   return PrefixExists(hash.prefix);
 }
 
 void PrefixSet::GetPrefixes(std::vector<SBPrefix>* prefixes) const {
   prefixes->reserve(index_.size() + deltas_.size());
 
   for (size_t ii = 0; ii < index_.size(); ++ii) {
     // The deltas for this |index_| entry run to the next index entry,
     // or the end of the deltas.
     const size_t deltas_end =
@@ skipping 293 matching lines @@
   }
   buffer_.push_back(prefix);
 
   // Flush buffer when a run can be constructed.  +1 for the index item, and +1
   // to leave at least one item in the buffer for dropping duplicates.
   if (buffer_.size() > PrefixSet::kMaxRun + 2)
     EmitRun();
 }
 
 }  // namespace safe_browsing