The existing implementation uses a cache + eviction based scheme to record heap profile information. This design was adopted to ensure a constant memory overhead (due to fixed number of cache entries) along with incremental write-to-disk for evictions. We find that since the number to entries to track is O(unique-allocation-contexts) the overhead of keeping all contexts in memory is not very high. On a clang workload, the max number of unique allocation contexts was ~35K, median ~11K. For each context, we (currently) store 64 bytes of data - this amounts to 5.5MB (max). Given the low overheads for a complex workload, we can simplify the implementation by using a hashmap without eviction. Other changes: * Memory map is dumped at the end rather than startup. The relative order in the profile dump is unchanged since we no longer have evicted entries at runtime. * Added a test to check meminfoblocks are merged. Differential Revision: https://reviews.llvm.org/D111676
36 lines
1.2 KiB
C++
36 lines
1.2 KiB
C++
//===-- memprof_mibmap.cpp -----------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file is a part of MemProfiler, a memory profiler.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "memprof_mibmap.h"
|
|
#include "sanitizer_common/sanitizer_allocator_internal.h"
|
|
#include "sanitizer_common/sanitizer_mutex.h"
|
|
|
|
namespace __memprof {
|
|
|
|
void InsertOrMerge(const uptr Id, const MemInfoBlock &Block, MIBMapTy &Map) {
|
|
MIBMapTy::Handle h(&Map, static_cast<uptr>(Id), /*remove=*/false,
|
|
/*create=*/true);
|
|
if (h.created()) {
|
|
LockedMemInfoBlock *lmib =
|
|
(LockedMemInfoBlock *)InternalAlloc(sizeof(LockedMemInfoBlock));
|
|
lmib->mutex.Init();
|
|
lmib->mib = Block;
|
|
*h = lmib;
|
|
} else {
|
|
LockedMemInfoBlock *lmib = *h;
|
|
SpinMutexLock lock(&lmib->mutex);
|
|
lmib->mib.Merge(Block);
|
|
}
|
|
}
|
|
|
|
} // namespace __memprof
|