Use the exact-width integer types defined in <stdint.h> rather than

net/base/backoff_entry.h

 // 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.
 
 #ifndef NET_BASE_BACKOFF_ENTRY_H_
 #define NET_BASE_BACKOFF_ENTRY_H_
 
 #include "base/macros.h"
 #include "base/threading/non_thread_safe.h"
 #include "base/time/time.h"
@@ skipping 27 matching lines @@
 
     // Factor by which the waiting time will be multiplied.
     double multiply_factor;
 
     // Fuzzing percentage. ex: 10% will spread requests randomly
     // between 90%-100% of the calculated time.
     double jitter_factor;
 
     // Maximum amount of time we are willing to delay our request, -1
     // for no maximum.
-    int64 maximum_backoff_ms;
+    int64_t maximum_backoff_ms;
 
     // Time to keep an entry from being discarded even when it
     // has no significant state, -1 to never discard.
-    int64 entry_lifetime_ms;
+    int64_t entry_lifetime_ms;
 
     // If true, we always use a delay of initial_delay_ms, even before
     // we've seen num_errors_to_ignore errors.  Otherwise, initial_delay_ms
     // is the first delay once we start exponential backoff.
     //
     // So if we're ignoring 1 error, we'll see (N, N, Nm, Nm^2, ...) if true,
     // and (0, 0, N, Nm, ...) when false, where N is initial_backoff_ms and
     // m is multiply_factor, assuming we've already seen one success.
     bool always_use_initial_delay;
   };
@@ skipping 63 matching lines @@
   const Policy* const policy_;  // Not owned.
 
   base::TickClock* const clock_;  // Not owned.
 
   DISALLOW_COPY_AND_ASSIGN(BackoffEntry);
 };
 
 }  // namespace net
 
 #endif  // NET_BASE_BACKOFF_ENTRY_H_