Merged third_party/tcmalloc/vendor/src(google-perftools r87) into...

third_party/tcmalloc/chromium/src/packed-cache-inl.h

 // Copyright (c) 2007, Google Inc.
 // All rights reserved.
 //
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 // notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
@@ skipping 93 matching lines @@
 // if a whole key plus a whole value fits in an entry.  Otherwise, an
 // entry is the high bits of a key and a value, packed together.
 // E.g., a 20 bit key and a 7 bit value only require a uint16 for each
 // entry if kHashbits >= 11.
 //
 // Alternatives to this scheme will be added as needed.
 
 #ifndef TCMALLOC_PACKED_CACHE_INL_H_
 #define TCMALLOC_PACKED_CACHE_INL_H_
 
+#include "config.h"
+#ifdef HAVE_STDINT_H
+#include <stdint.h>
+#endif
 #include "base/basictypes.h"  // for COMPILE_ASSERT
 #include "internal_logging.h"
 
 // A safe way of doing "(1 << n) - 1" -- without worrying about overflow
 // Note this will all be resolved to a constant expression at compile-time
 #define N_ONES_(IntType, N)                                     \
   ( (N) == 0 ? 0 : ((static_cast<IntType>(1) << ((N)-1))-1 +    \
                     (static_cast<IntType>(1) << ((N)-1))) )
 
 // The types K and V provide upper bounds on the number of valid keys
@@ skipping 95 matching lines @@
   static const V kValueMask = N_ONES_(V, kValuebits);
 
   // array_ is the cache.  Its elements are volatile because any
   // thread can write any array element at any time.
   volatile T array_[1 << kHashbits];
 };
 
 #undef N_ONES_
 
 #endif  // TCMALLOC_PACKED_CACHE_INL_H_