Clang format slam.

net/base/backoff_entry.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 "net/base/backoff_entry.h"
 
 #include <algorithm>
 #include <cmath>
 #include <limits>
 
@@ skipping 32 matching lines @@
     // time set by SetCustomReleaseTime and on the other we would like
     // to push every request up to our "horizon" when dealing with
     // multiple in-flight requests. Ex: If we send three requests and
     // we receive 2 failures and 1 success. The success that follows
     // those failures will not reset the release time, further
     // requests will then need to wait the delay caused by the 2
     // failures.
     base::TimeDelta delay;
     if (policy_->always_use_initial_delay)
       delay = base::TimeDelta::FromMilliseconds(policy_->initial_delay_ms);
-    exponential_backoff_release_time_ = std::max(
-        ImplGetTimeNow() + delay, exponential_backoff_release_time_);
+    exponential_backoff_release_time_ =
+        std::max(ImplGetTimeNow() + delay, exponential_backoff_release_time_);
   }
 }
 
 bool BackoffEntry::ShouldRejectRequest() const {
   return exponential_backoff_release_time_ > ImplGetTimeNow();
 }
 
 base::TimeDelta BackoffEntry::GetTimeUntilRelease() const {
   base::TimeTicks now = ImplGetTimeNow();
   if (exponential_backoff_release_time_ <= now)
@@ skipping 18 matching lines @@
   int64 unused_since_ms =
       (now - exponential_backoff_release_time_).InMilliseconds();
 
   // Release time is further than now, we are managing it.
   if (unused_since_ms < 0)
     return false;
 
   if (failure_count_ > 0) {
     // Need to keep track of failures until maximum back-off period
     // has passed (since further failures can add to back-off).
-    return unused_since_ms >= std::max(policy_->maximum_backoff_ms,
-                                       policy_->entry_lifetime_ms);
+    return unused_since_ms >=
+           std::max(policy_->maximum_backoff_ms, policy_->entry_lifetime_ms);
   }
 
   // Otherwise, consider the entry is outdated if it hasn't been used for the
   // specified lifetime period.
   return unused_since_ms >= policy_->entry_lifetime_ms;
 }
 
 void BackoffEntry::Reset() {
   failure_count_ = 0;
 
@@ skipping 25 matching lines @@
   }
 
   // The delay is calculated with this formula:
   // delay = initial_backoff * multiply_factor^(
   //     effective_failure_count - 1) * Uniform(1 - jitter_factor, 1]
   double delay = policy_->initial_delay_ms;
   delay *= pow(policy_->multiply_factor, effective_failure_count - 1);
   delay -= base::RandDouble() * policy_->jitter_factor * delay;
 
   const int64 kMaxInt64 = std::numeric_limits<int64>::max();
-  int64 delay_int = (delay > kMaxInt64) ?
-      kMaxInt64 : static_cast<int64>(delay + 0.5);
+  int64 delay_int =
+      (delay > kMaxInt64) ? kMaxInt64 : static_cast<int64>(delay + 0.5);
 
   // Ensure that we do not exceed maximum delay.
   if (policy_->maximum_backoff_ms >= 0)
     delay_int = std::min(delay_int, policy_->maximum_backoff_ms);
 
   // Never reduce previously set release horizon, e.g. due to Retry-After
   // header.
   return std::max(
       ImplGetTimeNow() + base::TimeDelta::FromMilliseconds(delay_int),
       exponential_backoff_release_time_);
 }
 
 }  // namespace net