Add UMA histograms for the inter-process TimeTicks skew.

content/child/resource_dispatcher.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.
 
 // See http://dev.chromium.org/developers/design-documents/multi-process-resource-loading
 
 #include "content/child/resource_dispatcher.h"
 
 #include "base/basictypes.h"
 #include "base/bind.h"
@@ skipping 767 matching lines @@
   RemoteToLocalTimeTicks(converter, &load_timing->proxy_resolve_end);
   RemoteToLocalTimeTicks(converter, &load_timing->connect_timing.dns_start);
   RemoteToLocalTimeTicks(converter, &load_timing->connect_timing.dns_end);
   RemoteToLocalTimeTicks(converter, &load_timing->connect_timing.connect_start);
   RemoteToLocalTimeTicks(converter, &load_timing->connect_timing.connect_end);
   RemoteToLocalTimeTicks(converter, &load_timing->connect_timing.ssl_start);
   RemoteToLocalTimeTicks(converter, &load_timing->connect_timing.ssl_end);
   RemoteToLocalTimeTicks(converter, &load_timing->send_start);
   RemoteToLocalTimeTicks(converter, &load_timing->send_end);
   RemoteToLocalTimeTicks(converter, &load_timing->receive_headers_end);
+
+  // Collect UMA on the inter-process skew.
+  bool is_skew_additive = false;
+  if (converter.IsSkewAdditiveForMetrics()) {
+    is_skew_additive = true;
+    base::TimeDelta skew = converter.GetSkewForMetrics();
+    if (skew >= base::TimeDelta()) {
+      UMA_HISTOGRAM_TIMES(
+          "InterProcessTimeTicks.BrowserAhead_BrowserToRenderer", skew);
+    } else {
+      UMA_HISTOGRAM_TIMES(
+          "InterProcessTimeTicks.BrowserBehind_BrowserToRenderer", -skew);
+    }
+  }
+  UMA_HISTOGRAM_BOOLEAN(
+      "InterProcessTimeTicks.IsSkewAdditive_BrowserToRenderer",
+      is_skew_additive);
 }
 
 base::TimeTicks ResourceDispatcher::ToRendererCompletionTime(
     const PendingRequestInfo& request_info,
     const base::TimeTicks& browser_completion_time) const {
   if (request_info.completion_time.is_null()) {
     return browser_completion_time;
   }
 
   // TODO(simonjam): The optimal lower bound should be the most recent value of
@@ skipping 62 matching lines @@
 void ResourceDispatcher::ReleaseResourcesInMessageQueue(MessageQueue* queue) {
   while (!queue->empty()) {
     IPC::Message* message = queue->front();
     ReleaseResourcesInDataMessage(*message);
     queue->pop_front();
     delete message;
   }
 }
 
 }  // namespace content