Merge google-perftools r109 (the current contents of third_party/tcmalloc/vendor)

third_party/tcmalloc/chromium/src/tests/realloc_unittest.cc

 // Copyright (c) 2004, 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 15 matching lines @@
 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 // ---
 // Author: Sanjay Ghemawat
 //
 // Test realloc() functionality
 
 #include "config_for_unittests.h"
+#include <assert.h>                     // for assert
 #include <stdio.h>
-#include <stdlib.h>
-#include <algorithm>   // for min()
+#include <stddef.h>                     // for size_t, NULL
+#include <stdlib.h>                     // for free, malloc, realloc
+#include <algorithm>                    // for min
 #include "base/logging.h"
 
 using std::min;
 
+
 // Fill a buffer of the specified size with a predetermined pattern
 static void Fill(unsigned char* buffer, int n) {
   for (int i = 0; i < n; i++) {
     buffer[i] = (i & 0xff);
   }
 }
 
 // Check that the specified buffer has the predetermined pattern
 // generated by Fill()
 static bool Valid(unsigned char* buffer, int n) {
@@ skipping 59 matching lines @@
   for (int i = 0; i < kNumEntries; i++) {
     sum += p[i][1000];
     free(p[i]);
   }
   CHECK_EQ(kNumEntries/2 * (kNumEntries - 1), sum);  // assume kNE is even
   free(p);
 
   printf("PASS\n");
   return 0;
 }