15821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Copyright (c) 2004, Google Inc. 25821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// All rights reserved. 35821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// 45821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Redistribution and use in source and binary forms, with or without 55821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// modification, are permitted provided that the following conditions are 65821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// met: 75821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// 85821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// * Redistributions of source code must retain the above copyright 95821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// notice, this list of conditions and the following disclaimer. 105821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// * Redistributions in binary form must reproduce the above 115821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// copyright notice, this list of conditions and the following disclaimer 125821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// in the documentation and/or other materials provided with the 135821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// distribution. 145821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// * Neither the name of Google Inc. nor the names of its 155821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// contributors may be used to endorse or promote products derived from 165821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// this software without specific prior written permission. 175821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// 185821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 195821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 205821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 215821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 225821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 235821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 245821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 255821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 265821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 275821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 285821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 295821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 305821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// --- 315821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Author: Sanjay Ghemawat 325821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// 335821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Test realloc() functionality 345821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 355821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include "config_for_unittests.h" 365821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include <assert.h> // for assert 375821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include <stdio.h> 385821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include <stddef.h> // for size_t, NULL 395821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include <stdlib.h> // for free, malloc, realloc 405821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include <algorithm> // for min 415821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include "base/logging.h" 425821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 435821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)using std::min; 445821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 455821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 465821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Fill a buffer of the specified size with a predetermined pattern 475821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)static void Fill(unsigned char* buffer, int n) { 485821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) for (int i = 0; i < n; i++) { 495821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) buffer[i] = (i & 0xff); 505821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 515821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)} 525821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 535821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Check that the specified buffer has the predetermined pattern 545821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// generated by Fill() 555821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)static bool Valid(unsigned char* buffer, int n) { 565821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) for (int i = 0; i < n; i++) { 575821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) if (buffer[i] != (i & 0xff)) { 585821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return false; 595821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 605821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 615821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return true; 625821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)} 635821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 645821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Return the next interesting size/delta to check. Returns -1 if no more. 655821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)static int NextSize(int size) { 665821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) if (size < 100) { 675821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return size+1; 685821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } else if (size < 100000) { 695821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) // Find next power of two 705821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) int power = 1; 715821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) while (power < size) { 725821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) power <<= 1; 735821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 745821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 755821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) // Yield (power-1, power, power+1) 765821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) if (size < power-1) { 775821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return power-1; 785821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } else if (size == power-1) { 795821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return power; 805821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } else { 815821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) assert(size == power); 825821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return power+1; 835821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 845821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } else { 855821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return -1; 865821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 875821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)} 885821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 895821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)int main(int argc, char** argv) { 905821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) for (int src_size = 0; src_size >= 0; src_size = NextSize(src_size)) { 915821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) for (int dst_size = 0; dst_size >= 0; dst_size = NextSize(dst_size)) { 925821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) unsigned char* src = (unsigned char*) malloc(src_size); 935821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) Fill(src, src_size); 945821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) unsigned char* dst = (unsigned char*) realloc(src, dst_size); 955821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CHECK(Valid(dst, min(src_size, dst_size))); 965821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) Fill(dst, dst_size); 975821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CHECK(Valid(dst, dst_size)); 985821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) if (dst != NULL) free(dst); 995821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 1005821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 1015821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1025821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) // Now make sure realloc works correctly even when we overflow the 1035821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) // packed cache, so some entries are evicted from the cache. 1045821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) // The cache has 2^12 entries, keyed by page number. 1055821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) const int kNumEntries = 1 << 14; 1065821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) int** p = (int**)malloc(sizeof(*p) * kNumEntries); 1075821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) int sum = 0; 1085821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) for (int i = 0; i < kNumEntries; i++) { 1095821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) p[i] = (int*)malloc(8192); // no page size is likely to be bigger 1105821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) p[i][1000] = i; // use memory deep in the heart of p 1115821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 1125821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) for (int i = 0; i < kNumEntries; i++) { 1135821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) p[i] = (int*)realloc(p[i], 9000); 1145821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 1155821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) for (int i = 0; i < kNumEntries; i++) { 1165821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) sum += p[i][1000]; 1175821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) free(p[i]); 1185821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 1195821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CHECK_EQ(kNumEntries/2 * (kNumEntries - 1), sum); // assume kNE is even 1205821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) free(p); 1215821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1225821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) printf("PASS\n"); 1235821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return 0; 1245821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)} 125