1// Copyright (c) 2004, Google Inc. 2// All rights reserved. 3// 4// Redistribution and use in source and binary forms, with or without 5// modification, are permitted provided that the following conditions are 6// met: 7// 8// * Redistributions of source code must retain the above copyright 9// notice, this list of conditions and the following disclaimer. 10// * Redistributions in binary form must reproduce the above 11// copyright notice, this list of conditions and the following disclaimer 12// in the documentation and/or other materials provided with the 13// distribution. 14// * Neither the name of Google Inc. nor the names of its 15// contributors may be used to endorse or promote products derived from 16// this software without specific prior written permission. 17// 18// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 19// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 20// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 21// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 22// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 23// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 24// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 25// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 26// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 27// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 28// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 29 30// --- 31// Author: Sanjay Ghemawat 32// 33// Check that we do not leak memory when cycling through lots of threads. 34 35#include "config_for_unittests.h" 36#include <stdio.h> 37#ifdef HAVE_UNISTD_H 38#include <unistd.h> // for sleep() 39#endif 40#include "base/logging.h" 41#include <gperftools/malloc_extension.h> 42#include "tests/testutil.h" // for RunThread() 43 44// Size/number of objects to allocate per thread (1 MB per thread) 45static const int kObjectSize = 1024; 46static const int kNumObjects = 1024; 47 48// Number of threads to create and destroy 49static const int kNumThreads = 1000; 50 51// Allocate lots of stuff 52static void AllocStuff() { 53 void** objects = new void*[kNumObjects]; 54 for (int i = 0; i < kNumObjects; i++) { 55 objects[i] = malloc(kObjectSize); 56 } 57 for (int i = 0; i < kNumObjects; i++) { 58 free(objects[i]); 59 } 60 delete[] objects; 61} 62 63int main(int argc, char** argv) { 64 static const int kDisplaySize = 1048576; 65 char* display = new char[kDisplaySize]; 66 67 for (int i = 0; i < kNumThreads; i++) { 68 RunThread(&AllocStuff); 69 70 if (((i+1) % 200) == 0) { 71 fprintf(stderr, "Iteration: %d of %d\n", (i+1), kNumThreads); 72 MallocExtension::instance()->GetStats(display, kDisplaySize); 73 fprintf(stderr, "%s\n", display); 74 } 75 } 76 delete[] display; 77 78 printf("PASS\n"); 79#ifdef HAVE_UNISTD_H 80 sleep(1); // Prevent exit race problem with glibc 81#endif 82 return 0; 83} 84