// Copyright (c) 2005, 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
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// 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
//
// TODO: Log large allocations
#include "config.h"
#include <stdlib.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_MMAP
#include <sys/mman.h>
#endif
#include <errno.h>
#include <assert.h>
#include <algorithm>
#include <string>
#include <google/heap-profiler.h>
#include "base/logging.h"
#include "base/basictypes.h" // for PRId64, among other things
#include "base/googleinit.h"
#include "base/commandlineflags.h"
#include <google/malloc_hook.h>
#include <google/malloc_extension.h>
#include "base/spinlock.h"
#include "base/low_level_alloc.h"
#include "heap-profile-table.h"
#ifndef PATH_MAX
#ifdef MAXPATHLEN
#define PATH_MAX MAXPATHLEN
#else
#define PATH_MAX 4096 // seems conservative for max filename len!
#endif
#endif
using STL_NAMESPACE::string;
using STL_NAMESPACE::sort;
//----------------------------------------------------------------------
// Flags that control heap-profiling
//----------------------------------------------------------------------
DEFINE_int64(heap_profile_allocation_interval,
EnvToInt64("HEAP_PROFILE_ALLOCATION_INTERVAL", 1 << 30 /*1GB*/),
"Dump heap profiling information once every specified "
"number of bytes allocated by the program.");
DEFINE_int64(heap_profile_inuse_interval,
EnvToInt64("HEAP_PROFILE_INUSE_INTERVAL", 100 << 20 /*100MB*/),
"Dump heap profiling information whenever the high-water "
"memory usage mark increases by the specified number of "
"bytes.");
DEFINE_bool(mmap_log,
EnvToBool("HEAP_PROFILE_MMAP_LOG", false),
"Should mmap/munmap calls be logged?");
DEFINE_bool(mmap_profile,
EnvToBool("HEAP_PROFILE_MMAP", false),
"If heap-profiling on, also profile mmaps");
//----------------------------------------------------------------------
// Locking
//----------------------------------------------------------------------
// A pthread_mutex has way too much lock contention to be used here.
//
// I would like to use Mutex, but it can call malloc(),
// which can cause us to fall into an infinite recursion.
//
// So we use a simple spinlock.
static SpinLock heap_lock(SpinLock::LINKER_INITIALIZED);
//----------------------------------------------------------------------
// Simple allocator for heap profiler's internal memory
//----------------------------------------------------------------------
static LowLevelAlloc::Arena *heap_profiler_memory;
static void* ProfilerMalloc(size_t bytes) {
return LowLevelAlloc::AllocWithArena(bytes, heap_profiler_memory);
}
static void ProfilerFree(void* p) {
LowLevelAlloc::Free(p);
}
//----------------------------------------------------------------------
// Profiling control/state data
//----------------------------------------------------------------------
static bool is_on = false; // If are on as a subsytem.
static bool dumping = false; // Dumping status to prevent recursion
static char* filename_prefix = NULL; // Prefix used for profile file names
// (NULL if no need for dumping yet)
static int dump_count = 0; // How many dumps so far
static int64 last_dump = 0; // When did we last dump
static int64 high_water_mark = 0; // In-use-bytes at last high-water dump
static HeapProfileTable* heap_profile = NULL; // the heap profile table
//----------------------------------------------------------------------
// Profile generation
//----------------------------------------------------------------------
extern "C" char* GetHeapProfile() {
// We used to be smarter about estimating the required memory and
// then capping it to 1MB and generating the profile into that.
// However it should not cost us much to allocate 1MB every time.
static const int size = 1 << 20;
// This is intended to be normal malloc: we return it to the user to free it
char* buf = reinterpret_cast<char*>(malloc(size));
if (buf == NULL) return NULL;
// Grab the lock and generate the profile.
heap_lock.Lock();
int buflen = is_on ? heap_profile->FillOrderedProfile(buf, size - 1) : 0;
buf[buflen] = '\0';
RAW_DCHECK(buflen == strlen(buf), "");
heap_lock.Unlock();
return buf;
}
// Helper for HeapProfilerDump.
static void DumpProfileLocked(const char* reason) {
RAW_DCHECK(is_on, "");
RAW_DCHECK(!dumping, "");
if (filename_prefix == NULL) return; // we do not yet need dumping
dumping = true;
// Make file name
char file_name[1000];
dump_count++;
snprintf(file_name, sizeof(file_name), "%s.%04d%s",
filename_prefix, dump_count, HeapProfileTable::kFileExt);
// Release allocation lock around the meat of this routine
// thus not blocking other threads too much.
heap_lock.Unlock();
{
// Dump the profile
RAW_VLOG(0, "Dumping heap profile to %s (%s)", file_name, reason);
FILE* f = fopen(file_name, "w");
if (f != NULL) {
const char* profile = GetHeapProfile();
fputs(profile, f);
free(const_cast<char*>(profile)); // was made with normal malloc
fclose(f);
} else {
RAW_LOG(ERROR, "Failed dumping heap profile to %s", file_name);
}
}
heap_lock.Lock();
dumping = false;
}
//----------------------------------------------------------------------
// Profile collection
//----------------------------------------------------------------------
// Record an allocation in the profile.
static void RecordAlloc(const void* ptr, size_t bytes, int skip_count) {
heap_lock.Lock();
if (is_on) {
heap_profile->RecordAlloc(ptr, bytes, skip_count + 1);
const HeapProfileTable::Stats& total = heap_profile->total();
const int64 inuse_bytes = total.alloc_size - total.free_size;
if (!dumping) {
bool need_to_dump = false;
char buf[128];
if (total.alloc_size >=
last_dump + FLAGS_heap_profile_allocation_interval) {
snprintf(buf, sizeof(buf), "%"PRId64" MB allocated",
total.alloc_size >> 20);
// Track that we made a "total allocation size" dump
last_dump = total.alloc_size;
need_to_dump = true;
} else if (inuse_bytes >
high_water_mark + FLAGS_heap_profile_inuse_interval) {
sprintf(buf, "%"PRId64" MB in use", inuse_bytes >> 20);
// Track that we made a "high water mark" dump
high_water_mark = inuse_bytes;
need_to_dump = true;
}
if (need_to_dump) {
DumpProfileLocked(buf);
}
}
}
heap_lock.Unlock();
}
// Record a deallocation in the profile.
static void RecordFree(const void* ptr) {
heap_lock.Lock();
if (is_on) {
heap_profile->RecordFree(ptr);
}
heap_lock.Unlock();
}
//----------------------------------------------------------------------
// Allocation/deallocation hooks for MallocHook
//----------------------------------------------------------------------
static void NewHook(const void* ptr, size_t size) {
if (ptr != NULL) RecordAlloc(ptr, size, 0);
}
static void DeleteHook(const void* ptr) {
if (ptr != NULL) RecordFree(ptr);
}
// TODO(jandrews): Re-enable stack tracing
#ifdef TODO_REENABLE_STACK_TRACING
static void RawInfoStackDumper(const char* message, void*) {
RAW_LOG(INFO, "%.*s", static_cast<int>(strlen(message) - 1), message);
// -1 is to chop the \n which will be added by RAW_LOG
}
#endif
static void MmapHook(const void* result, const void* start, size_t size,
int prot, int flags, int fd, off_t offset) {
// Log the mmap if necessary
if (FLAGS_mmap_log) {
// We use PRIxS not just '%p' to avoid deadlocks
// in pretty-printing of NULL as "nil".
// TODO(maxim): instead should use a safe snprintf reimplementation
RAW_LOG(INFO,
"mmap(start=0x%"PRIxS", len=%"PRIuS", prot=0x%x, flags=0x%x, "
"fd=%d, offset=0x%x) = 0x%"PRIxS"",
(uintptr_t) start, size, prot, flags, fd, (unsigned int) offset,
(uintptr_t) result);
#ifdef TODO_REENABLE_STACK_TRACING
DumpStackTrace(1, RawInfoStackDumper, NULL);
#endif
}
// Record mmap in profile if appropriate
if (FLAGS_mmap_profile && result != (void*) MAP_FAILED) {
RecordAlloc(result, size, 0);
}
}
static void MunmapHook(const void* ptr, size_t size) {
if (FLAGS_mmap_profile) {
RecordFree(ptr);
}
if (FLAGS_mmap_log) {
// We use PRIxS not just '%p' to avoid deadlocks
// in pretty-printing of NULL as "nil".
// TODO(maxim): instead should use a safe snprintf reimplementation
RAW_LOG(INFO, "munmap(start=0x%"PRIxS", len=%"PRIuS")",
(uintptr_t) ptr, size);
}
}
//----------------------------------------------------------------------
// Starting/stopping/dumping
//----------------------------------------------------------------------
extern "C" void HeapProfilerStart(const char* prefix) {
heap_lock.Lock();
if (filename_prefix != NULL) return;
RAW_DCHECK(!is_on, "");
heap_profiler_memory =
LowLevelAlloc::NewArena(0, LowLevelAlloc::DefaultArena());
heap_profile = new (ProfilerMalloc(sizeof(HeapProfileTable)))
HeapProfileTable(ProfilerMalloc, ProfilerFree);
is_on = true;
last_dump = 0;
// We do not reset dump_count so if the user does a sequence of
// HeapProfilerStart/HeapProfileStop, we will get a continuous
// sequence of profiles.
// Now set the hooks that capture mallocs/frees
MallocHook::SetNewHook(NewHook);
MallocHook::SetDeleteHook(DeleteHook);
RAW_VLOG(0, "Starting tracking the heap");
// Copy filename prefix
const int prefix_length = strlen(prefix);
filename_prefix = reinterpret_cast<char*>(ProfilerMalloc(prefix_length + 1));
memcpy(filename_prefix, prefix, prefix_length);
filename_prefix[prefix_length] = '\0';
heap_lock.Unlock();
// This should be done before the hooks are set up, since it should
// call new, and we want that to be accounted for correctly.
MallocExtension::Initialize();
}
extern "C" void HeapProfilerStop() {
heap_lock.Lock();
if (!is_on) return;
filename_prefix = NULL;
MallocHook::SetNewHook(NULL);
MallocHook::SetDeleteHook(NULL);
// free profile
heap_profile->~HeapProfileTable();
ProfilerFree(heap_profile);
heap_profile = NULL;
// free prefix
ProfilerFree(filename_prefix);
filename_prefix = NULL;
if (!LowLevelAlloc::DeleteArena(heap_profiler_memory)) {
RAW_LOG(FATAL, "Memory leak in HeapProfiler:");
}
is_on = false;
heap_lock.Unlock();
}
extern "C" void HeapProfilerDump(const char *reason) {
heap_lock.Lock();
if (is_on && !dumping) {
DumpProfileLocked(reason);
}
heap_lock.Unlock();
}
//----------------------------------------------------------------------
// Initialization/finalization code
//----------------------------------------------------------------------
// Initialization code
static void HeapProfilerInit() {
if (FLAGS_mmap_profile || FLAGS_mmap_log) {
MallocHook::SetMmapHook(MmapHook);
MallocHook::SetMunmapHook(MunmapHook);
}
// Everything after this point is for setting up the profiler based on envvar
char* heapprofile = getenv("HEAPPROFILE");
if (!heapprofile || heapprofile[0] == '\0') {
return;
}
// We do a uid check so we don't write out files in a setuid executable.
#ifdef HAVE_GETEUID
if (getuid() != geteuid()) {
RAW_LOG(WARNING, ("HeapProfiler: ignoring HEAPPROFILE because "
"program seems to be setuid\n"));
return;
}
#endif
// If we're a child process of the 'main' process, we can't just use
// the name HEAPPROFILE -- the parent process will be using that.
// Instead we append our pid to the name. How do we tell if we're a
// child process? Ideally we'd set an environment variable that all
// our children would inherit. But -- and perhaps this is a bug in
// gcc -- if you do a setenv() in a shared libarary in a global
// constructor, the environment setting is lost by the time main()
// is called. The only safe thing we can do in such a situation is
// to modify the existing envvar. So we do a hack: in the parent,
// we set the high bit of the 1st char of HEAPPROFILE. In the child,
// we notice the high bit is set and append the pid(). This works
// assuming cpuprofile filenames don't normally have the high bit
// set in their first character! If that assumption is violated,
// we'll still get a profile, but one with an unexpected name.
// TODO(csilvers): set an envvar instead when we can do it reliably.
char fname[PATH_MAX];
if (heapprofile[0] & 128) { // high bit is set
snprintf(fname, sizeof(fname), "%c%s_%u", // add pid and clear high bit
heapprofile[0] & 127, heapprofile+1, (unsigned int)(getpid()));
} else {
snprintf(fname, sizeof(fname), "%s", heapprofile);
heapprofile[0] |= 128; // set high bit for kids to see
}
HeapProfileTable::CleanupOldProfiles(fname);
HeapProfilerStart(fname);
}
// class used for finalization -- dumps the heap-profile at program exit
struct HeapProfileEndWriter {
~HeapProfileEndWriter() { HeapProfilerDump("Exiting"); }
};
REGISTER_MODULE_INITIALIZER(heapprofiler, HeapProfilerInit());
static HeapProfileEndWriter heap_profile_end_writer;
syntax highlighted by Code2HTML, v. 0.9.1