Disk cache: Use TimeTicks instead of Time for some of the...

net/disk_cache/rankings.cc

 // Copyright (c) 2006-2008 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/disk_cache/rankings.h"
 
 #include "base/histogram.h"
 #include "net/disk_cache/backend_impl.h"
 #include "net/disk_cache/entry_impl.h"
 #include "net/disk_cache/errors.h"
 #include "net/disk_cache/histogram_macros.h"
 
 using base::Time;
+using base::TimeTicks;
 
 // This is used by crash_cache.exe to generate unit test files.
 disk_cache::RankCrashes g_rankings_crash = disk_cache::NO_CRASH;
 
 namespace {
 
 enum Operation {
   INSERT = 1,
   REMOVE
 };
@@ skipping 176 matching lines @@
     heads_[i].set_value(0);
     tails_[i].set_value(0);
   }
   control_data_ = NULL;
 }
 
 bool Rankings::GetRanking(CacheRankingsBlock* rankings) {
   if (!rankings->address().is_initialized())
     return false;
 
-  Time start = Time::Now();
+  TimeTicks start = TimeTicks::Now();
   if (!rankings->Load())
     return false;
 
   if (!SanityCheck(rankings, true)) {
     backend_->CriticalError(ERR_INVALID_LINKS);
     return false;
   }
 
   backend_->OnEvent(Stats::OPEN_RANKINGS);
 
@@ skipping 178 matching lines @@
   DecrementCounter(list);
   UpdateIterators(&next);
   UpdateIterators(&prev);
 }
 
 // A crash in between Remove and Insert will lead to a dirty entry not on the
 // list. We want to avoid that case as much as we can (as while waiting for IO),
 // but the net effect is just an assert on debug when attempting to remove the
 // entry. Otherwise we'll need reentrant transactions, which is an overkill.
 void Rankings::UpdateRank(CacheRankingsBlock* node, bool modified, List list) {
-  Time start = Time::Now();
+  TimeTicks start = TimeTicks::Now();
   Remove(node, list);
   Insert(node, modified, list);
   CACHE_UMA(AGE_MS, "UpdateRank", 0, start);
 }
 
 void Rankings::CompleteTransaction() {
   Addr node_addr(static_cast<CacheAddr>(control_data_->transaction));
   if (!node_addr.is_initialized() || node_addr.is_separate_file()) {
     NOTREACHED();
     LOG(ERROR) << "Invalid rankings info.";
@@ skipping 375 matching lines @@
 void Rankings::DecrementCounter(List list) {
   if (!count_lists_)
     return;
 
   DCHECK(control_data_->sizes[list] > 0);
   if (control_data_->sizes[list] > 0)
     control_data_->sizes[list]--;
 }
 
 }  // namespace disk_cache