121 lines
3.3 KiB
C++
121 lines
3.3 KiB
C++
//===-- sanitizer_symbolizer.cc -------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file is shared between AddressSanitizer and ThreadSanitizer
|
|
// run-time libraries.
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "sanitizer_allocator_internal.h"
|
|
#include "sanitizer_platform.h"
|
|
#include "sanitizer_internal_defs.h"
|
|
#include "sanitizer_libc.h"
|
|
#include "sanitizer_placement_new.h"
|
|
#include "sanitizer_symbolizer_internal.h"
|
|
|
|
namespace __sanitizer {
|
|
|
|
AddressInfo::AddressInfo() {
|
|
internal_memset(this, 0, sizeof(AddressInfo));
|
|
function_offset = kUnknown;
|
|
}
|
|
|
|
void AddressInfo::Clear() {
|
|
InternalFree(module);
|
|
InternalFree(function);
|
|
InternalFree(file);
|
|
internal_memset(this, 0, sizeof(AddressInfo));
|
|
function_offset = kUnknown;
|
|
}
|
|
|
|
void AddressInfo::FillModuleInfo(const char *mod_name, uptr mod_offset,
|
|
ModuleArch mod_arch) {
|
|
module = internal_strdup(mod_name);
|
|
module_offset = mod_offset;
|
|
module_arch = mod_arch;
|
|
}
|
|
|
|
SymbolizedStack::SymbolizedStack() : next(nullptr), info() {}
|
|
|
|
SymbolizedStack *SymbolizedStack::New(uptr addr) {
|
|
void *mem = InternalAlloc(sizeof(SymbolizedStack));
|
|
SymbolizedStack *res = new(mem) SymbolizedStack();
|
|
res->info.address = addr;
|
|
return res;
|
|
}
|
|
|
|
void SymbolizedStack::ClearAll() {
|
|
info.Clear();
|
|
if (next)
|
|
next->ClearAll();
|
|
InternalFree(this);
|
|
}
|
|
|
|
DataInfo::DataInfo() {
|
|
internal_memset(this, 0, sizeof(DataInfo));
|
|
}
|
|
|
|
void DataInfo::Clear() {
|
|
InternalFree(module);
|
|
InternalFree(file);
|
|
InternalFree(name);
|
|
internal_memset(this, 0, sizeof(DataInfo));
|
|
}
|
|
|
|
Symbolizer *Symbolizer::symbolizer_;
|
|
StaticSpinMutex Symbolizer::init_mu_;
|
|
LowLevelAllocator Symbolizer::symbolizer_allocator_;
|
|
|
|
void Symbolizer::InvalidateModuleList() {
|
|
modules_fresh_ = false;
|
|
}
|
|
|
|
void Symbolizer::AddHooks(Symbolizer::StartSymbolizationHook start_hook,
|
|
Symbolizer::EndSymbolizationHook end_hook) {
|
|
CHECK(start_hook_ == 0 && end_hook_ == 0);
|
|
start_hook_ = start_hook;
|
|
end_hook_ = end_hook;
|
|
}
|
|
|
|
const char *Symbolizer::ModuleNameOwner::GetOwnedCopy(const char *str) {
|
|
mu_->CheckLocked();
|
|
|
|
// 'str' will be the same string multiple times in a row, optimize this case.
|
|
if (last_match_ && !internal_strcmp(last_match_, str))
|
|
return last_match_;
|
|
|
|
// FIXME: this is linear search.
|
|
// We should optimize this further if this turns out to be a bottleneck later.
|
|
for (uptr i = 0; i < storage_.size(); ++i) {
|
|
if (!internal_strcmp(storage_[i], str)) {
|
|
last_match_ = storage_[i];
|
|
return last_match_;
|
|
}
|
|
}
|
|
last_match_ = internal_strdup(str);
|
|
storage_.push_back(last_match_);
|
|
return last_match_;
|
|
}
|
|
|
|
Symbolizer::Symbolizer(IntrusiveList<SymbolizerTool> tools)
|
|
: module_names_(&mu_), modules_(), modules_fresh_(false), tools_(tools),
|
|
start_hook_(0), end_hook_(0) {}
|
|
|
|
Symbolizer::SymbolizerScope::SymbolizerScope(const Symbolizer *sym)
|
|
: sym_(sym) {
|
|
if (sym_->start_hook_)
|
|
sym_->start_hook_();
|
|
}
|
|
|
|
Symbolizer::SymbolizerScope::~SymbolizerScope() {
|
|
if (sym_->end_hook_)
|
|
sym_->end_hook_();
|
|
}
|
|
|
|
} // namespace __sanitizer
|