Remove kint32max.

net/disk_cache/blockfile/rankings.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/disk_cache/blockfile/rankings.h"
 
+#include <stdint.h>
+
+#include <limits>
+
 #include "net/disk_cache/blockfile/backend_impl.h"
 #include "net/disk_cache/blockfile/disk_format.h"
 #include "net/disk_cache/blockfile/entry_impl.h"
 #include "net/disk_cache/blockfile/errors.h"
 #include "net/disk_cache/blockfile/histogram_macros.h"
 #include "net/disk_cache/blockfile/stress_support.h"
 
 // Provide a BackendImpl object to macros from histogram_macros.h.
 #define CACHE_UMA_BACKEND_IMPL_OBJ backend_
 
@@ skipping 883 matching lines @@
        ++it) {
     if (it->first == address)
       it->second->Discard();
   }
 }
 
 void Rankings::IncrementCounter(List list) {
   if (!count_lists_)
     return;
 
-  DCHECK(control_data_->sizes[list] < kint32max);
-  if (control_data_->sizes[list] < kint32max)
+  DCHECK(control_data_->sizes[list] < std::numeric_limits<int32_t>::max());
+  if (control_data_->sizes[list] < std::numeric_limits<int32_t>::max())
     control_data_->sizes[list]++;
 }
 
 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