2010-06-09 00:52:24 +08:00
|
|
|
//===-- BreakpointResolver.cpp ----------------------------------*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "lldb/Breakpoint/BreakpointResolver.h"
|
|
|
|
|
|
|
|
#include "lldb/Breakpoint/Breakpoint.h"
|
|
|
|
#include "lldb/Breakpoint/BreakpointLocation.h"
|
2018-05-01 00:49:04 +08:00
|
|
|
// Have to include the other breakpoint resolver types here so the static
|
|
|
|
// create from StructuredData can call them.
|
2016-09-13 07:10:56 +08:00
|
|
|
#include "lldb/Breakpoint/BreakpointResolverAddress.h"
|
|
|
|
#include "lldb/Breakpoint/BreakpointResolverFileLine.h"
|
|
|
|
#include "lldb/Breakpoint/BreakpointResolverFileRegex.h"
|
|
|
|
#include "lldb/Breakpoint/BreakpointResolverName.h"
|
2018-09-14 05:35:32 +08:00
|
|
|
#include "lldb/Breakpoint/BreakpointResolverScripted.h"
|
2016-09-07 04:57:50 +08:00
|
|
|
#include "lldb/Core/Address.h"
|
2010-06-09 00:52:24 +08:00
|
|
|
#include "lldb/Core/ModuleList.h"
|
|
|
|
#include "lldb/Core/SearchFilter.h"
|
2013-09-27 09:16:58 +08:00
|
|
|
#include "lldb/Symbol/CompileUnit.h"
|
|
|
|
#include "lldb/Symbol/Function.h"
|
2016-09-07 04:57:50 +08:00
|
|
|
#include "lldb/Symbol/SymbolContext.h"
|
|
|
|
#include "lldb/Target/Target.h"
|
2017-03-04 04:56:28 +08:00
|
|
|
#include "lldb/Utility/Log.h"
|
2017-02-03 05:39:50 +08:00
|
|
|
#include "lldb/Utility/Stream.h"
|
|
|
|
#include "lldb/Utility/StreamString.h"
|
2010-06-09 00:52:24 +08:00
|
|
|
|
|
|
|
using namespace lldb_private;
|
2013-09-27 09:16:58 +08:00
|
|
|
using namespace lldb;
|
2010-06-09 00:52:24 +08:00
|
|
|
|
|
|
|
//----------------------------------------------------------------------
|
|
|
|
// BreakpointResolver:
|
|
|
|
//----------------------------------------------------------------------
|
2016-09-13 07:10:56 +08:00
|
|
|
const char *BreakpointResolver::g_ty_to_name[] = {"FileAndLine", "Address",
|
|
|
|
"SymbolName", "SourceRegex",
|
|
|
|
"Exception", "Unknown"};
|
|
|
|
|
2016-09-15 09:47:22 +08:00
|
|
|
const char *BreakpointResolver::g_option_names[static_cast<uint32_t>(
|
|
|
|
BreakpointResolver::OptionNames::LastOptionName)] = {
|
2018-09-14 05:35:32 +08:00
|
|
|
"AddressOffset", "Exact", "FileName", "Inlines", "Language",
|
|
|
|
"LineNumber", "Column", "ModuleName", "NameMask", "Offset",
|
|
|
|
"PythonClass", "Regex", "ScriptArgs", "SectionName", "SearchDepth",
|
|
|
|
"SkipPrologue", "SymbolNames"};
|
2016-09-13 07:10:56 +08:00
|
|
|
|
|
|
|
const char *BreakpointResolver::ResolverTyToName(enum ResolverTy type) {
|
|
|
|
if (type > LastKnownResolverType)
|
|
|
|
return g_ty_to_name[UnknownResolver];
|
|
|
|
|
|
|
|
return g_ty_to_name[type];
|
|
|
|
}
|
|
|
|
|
|
|
|
BreakpointResolver::ResolverTy
|
2017-05-12 13:49:54 +08:00
|
|
|
BreakpointResolver::NameToResolverTy(llvm::StringRef name) {
|
2016-09-13 07:10:56 +08:00
|
|
|
for (size_t i = 0; i < LastKnownResolverType; i++) {
|
2017-05-12 13:49:54 +08:00
|
|
|
if (name == g_ty_to_name[i])
|
2016-09-13 07:10:56 +08:00
|
|
|
return (ResolverTy)i;
|
|
|
|
}
|
|
|
|
return UnknownResolver;
|
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
BreakpointResolver::BreakpointResolver(Breakpoint *bkpt,
|
|
|
|
const unsigned char resolverTy,
|
|
|
|
lldb::addr_t offset)
|
|
|
|
: m_breakpoint(bkpt), m_offset(offset), SubclassID(resolverTy) {}
|
2010-06-09 00:52:24 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
BreakpointResolver::~BreakpointResolver() {}
|
2010-06-09 00:52:24 +08:00
|
|
|
|
2016-09-13 07:10:56 +08:00
|
|
|
BreakpointResolverSP BreakpointResolver::CreateFromStructuredData(
|
2017-05-12 12:51:55 +08:00
|
|
|
const StructuredData::Dictionary &resolver_dict, Status &error) {
|
2016-09-13 07:10:56 +08:00
|
|
|
BreakpointResolverSP result_sp;
|
|
|
|
if (!resolver_dict.IsValid()) {
|
|
|
|
error.SetErrorString("Can't deserialize from an invalid data object.");
|
|
|
|
return result_sp;
|
|
|
|
}
|
|
|
|
|
2017-05-12 13:49:54 +08:00
|
|
|
llvm::StringRef subclass_name;
|
2016-09-13 07:10:56 +08:00
|
|
|
|
|
|
|
bool success = resolver_dict.GetValueForKeyAsString(
|
|
|
|
GetSerializationSubclassKey(), subclass_name);
|
|
|
|
|
|
|
|
if (!success) {
|
|
|
|
error.SetErrorStringWithFormat(
|
|
|
|
"Resolver data missing subclass resolver key");
|
|
|
|
return result_sp;
|
|
|
|
}
|
|
|
|
|
2017-05-12 13:49:54 +08:00
|
|
|
ResolverTy resolver_type = NameToResolverTy(subclass_name);
|
2016-09-13 07:10:56 +08:00
|
|
|
if (resolver_type == UnknownResolver) {
|
2017-05-12 13:49:54 +08:00
|
|
|
error.SetErrorStringWithFormatv("Unknown resolver type: {0}.",
|
|
|
|
subclass_name);
|
2016-09-13 07:10:56 +08:00
|
|
|
return result_sp;
|
|
|
|
}
|
|
|
|
|
|
|
|
StructuredData::Dictionary *subclass_options = nullptr;
|
|
|
|
success = resolver_dict.GetValueForKeyAsDictionary(
|
|
|
|
GetSerializationSubclassOptionsKey(), subclass_options);
|
|
|
|
if (!success || !subclass_options || !subclass_options->IsValid()) {
|
|
|
|
error.SetErrorString("Resolver data missing subclass options key.");
|
|
|
|
return result_sp;
|
|
|
|
}
|
|
|
|
|
|
|
|
lldb::addr_t offset;
|
|
|
|
success = subclass_options->GetValueForKeyAsInteger(
|
|
|
|
GetKey(OptionNames::Offset), offset);
|
|
|
|
if (!success) {
|
|
|
|
error.SetErrorString("Resolver data missing offset options key.");
|
|
|
|
return result_sp;
|
|
|
|
}
|
|
|
|
|
|
|
|
BreakpointResolver *resolver;
|
|
|
|
|
|
|
|
switch (resolver_type) {
|
|
|
|
case FileLineResolver:
|
|
|
|
resolver = BreakpointResolverFileLine::CreateFromStructuredData(
|
|
|
|
nullptr, *subclass_options, error);
|
|
|
|
break;
|
|
|
|
case AddressResolver:
|
|
|
|
resolver = BreakpointResolverAddress::CreateFromStructuredData(
|
|
|
|
nullptr, *subclass_options, error);
|
|
|
|
break;
|
|
|
|
case NameResolver:
|
|
|
|
resolver = BreakpointResolverName::CreateFromStructuredData(
|
|
|
|
nullptr, *subclass_options, error);
|
|
|
|
break;
|
|
|
|
case FileRegexResolver:
|
|
|
|
resolver = BreakpointResolverFileRegex::CreateFromStructuredData(
|
|
|
|
nullptr, *subclass_options, error);
|
|
|
|
break;
|
2018-09-14 05:35:32 +08:00
|
|
|
case PythonResolver:
|
|
|
|
resolver = BreakpointResolverScripted::CreateFromStructuredData(
|
|
|
|
nullptr, *subclass_options, error);
|
|
|
|
break;
|
2016-09-13 07:10:56 +08:00
|
|
|
case ExceptionResolver:
|
|
|
|
error.SetErrorString("Exception resolvers are hard.");
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
llvm_unreachable("Should never get an unresolvable resolver type.");
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!error.Success()) {
|
|
|
|
return result_sp;
|
|
|
|
} else {
|
|
|
|
// Add on the global offset option:
|
|
|
|
resolver->SetOffset(offset);
|
|
|
|
return BreakpointResolverSP(resolver);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
StructuredData::DictionarySP BreakpointResolver::WrapOptionsDict(
|
|
|
|
StructuredData::DictionarySP options_dict_sp) {
|
|
|
|
if (!options_dict_sp || !options_dict_sp->IsValid())
|
|
|
|
return StructuredData::DictionarySP();
|
|
|
|
|
|
|
|
StructuredData::DictionarySP type_dict_sp(new StructuredData::Dictionary());
|
|
|
|
type_dict_sp->AddStringItem(GetSerializationSubclassKey(), GetResolverName());
|
|
|
|
type_dict_sp->AddItem(GetSerializationSubclassOptionsKey(), options_dict_sp);
|
|
|
|
|
|
|
|
// Add the m_offset to the dictionary:
|
|
|
|
options_dict_sp->AddIntegerItem(GetKey(OptionNames::Offset), m_offset);
|
|
|
|
|
|
|
|
return type_dict_sp;
|
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
void BreakpointResolver::SetBreakpoint(Breakpoint *bkpt) {
|
|
|
|
m_breakpoint = bkpt;
|
2018-09-14 05:35:32 +08:00
|
|
|
NotifyBreakpointSet();
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
void BreakpointResolver::ResolveBreakpointInModules(SearchFilter &filter,
|
|
|
|
ModuleList &modules) {
|
|
|
|
filter.SearchInModuleList(*this, modules);
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
void BreakpointResolver::ResolveBreakpoint(SearchFilter &filter) {
|
|
|
|
filter.Search(*this);
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2018-08-30 23:11:00 +08:00
|
|
|
namespace {
|
|
|
|
struct SourceLoc {
|
|
|
|
uint32_t line = UINT32_MAX;
|
|
|
|
uint32_t column;
|
|
|
|
SourceLoc(uint32_t l, uint32_t c) : line(l), column(c ? c : UINT32_MAX) {}
|
|
|
|
SourceLoc(const SymbolContext &sc)
|
|
|
|
: line(sc.line_entry.line),
|
|
|
|
column(sc.line_entry.column ? sc.line_entry.column : UINT32_MAX) {}
|
|
|
|
};
|
|
|
|
|
|
|
|
bool operator<(const SourceLoc a, const SourceLoc b) {
|
|
|
|
if (a.line < b.line)
|
|
|
|
return true;
|
|
|
|
if (a.line > b.line)
|
|
|
|
return false;
|
|
|
|
uint32_t a_col = a.column ? a.column : UINT32_MAX;
|
|
|
|
uint32_t b_col = b.column ? b.column : UINT32_MAX;
|
|
|
|
return a_col < b_col;
|
|
|
|
}
|
|
|
|
} // namespace
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
void BreakpointResolver::SetSCMatchesByLine(SearchFilter &filter,
|
|
|
|
SymbolContextList &sc_list,
|
|
|
|
bool skip_prologue,
|
2018-08-30 23:11:00 +08:00
|
|
|
llvm::StringRef log_ident,
|
|
|
|
uint32_t line, uint32_t column) {
|
2018-08-30 07:16:42 +08:00
|
|
|
llvm::SmallVector<SymbolContext, 16> all_scs;
|
|
|
|
for (uint32_t i = 0; i < sc_list.GetSize(); ++i)
|
|
|
|
all_scs.push_back(sc_list[i]);
|
|
|
|
|
|
|
|
while (all_scs.size()) {
|
|
|
|
uint32_t closest_line = UINT32_MAX;
|
|
|
|
|
|
|
|
// Move all the elements with a matching file spec to the end.
|
|
|
|
auto &match = all_scs[0];
|
|
|
|
auto worklist_begin = std::partition(
|
|
|
|
all_scs.begin(), all_scs.end(), [&](const SymbolContext &sc) {
|
|
|
|
if (sc.line_entry.file == match.line_entry.file ||
|
|
|
|
sc.line_entry.original_file == match.line_entry.original_file) {
|
|
|
|
// When a match is found, keep track of the smallest line number.
|
|
|
|
closest_line = std::min(closest_line, sc.line_entry.line);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
});
|
2018-08-30 23:11:00 +08:00
|
|
|
|
|
|
|
// (worklist_begin, worklist_end) now contains all entries for one filespec.
|
|
|
|
auto worklist_end = all_scs.end();
|
|
|
|
|
|
|
|
if (column) {
|
|
|
|
// If a column was requested, do a more precise match and only
|
|
|
|
// return the first location that comes after or at the
|
|
|
|
// requested location.
|
|
|
|
SourceLoc requested(line, column);
|
|
|
|
// First, filter out all entries left of the requested column.
|
|
|
|
worklist_end = std::remove_if(
|
|
|
|
worklist_begin, worklist_end,
|
|
|
|
[&](const SymbolContext &sc) { return SourceLoc(sc) < requested; });
|
|
|
|
// Sort the remaining entries by (line, column).
|
|
|
|
std::sort(worklist_begin, worklist_end,
|
|
|
|
[](const SymbolContext &a, const SymbolContext &b) {
|
|
|
|
return SourceLoc(a) < SourceLoc(b);
|
|
|
|
});
|
|
|
|
|
|
|
|
// Filter out all locations with a source location after the closest match.
|
|
|
|
if (worklist_begin != worklist_end)
|
|
|
|
worklist_end = std::remove_if(
|
|
|
|
worklist_begin, worklist_end, [&](const SymbolContext &sc) {
|
|
|
|
return SourceLoc(*worklist_begin) < SourceLoc(sc);
|
|
|
|
});
|
|
|
|
} else {
|
|
|
|
// Remove all entries with a larger line number.
|
|
|
|
// ResolveSymbolContext will always return a number that is >=
|
|
|
|
// the line number you pass in. So the smaller line number is
|
|
|
|
// always better.
|
|
|
|
worklist_end = std::remove_if(worklist_begin, worklist_end,
|
|
|
|
[&](const SymbolContext &sc) {
|
|
|
|
return closest_line != sc.line_entry.line;
|
|
|
|
});
|
|
|
|
}
|
2018-08-30 07:16:42 +08:00
|
|
|
|
|
|
|
// Sort by file address.
|
|
|
|
std::sort(worklist_begin, worklist_end,
|
|
|
|
[](const SymbolContext &a, const SymbolContext &b) {
|
|
|
|
return a.line_entry.range.GetBaseAddress().GetFileAddress() <
|
|
|
|
b.line_entry.range.GetBaseAddress().GetFileAddress();
|
|
|
|
});
|
|
|
|
|
|
|
|
// Go through and see if there are line table entries that are
|
|
|
|
// contiguous, and if so keep only the first of the contiguous range.
|
|
|
|
// We do this by picking the first location in each lexical block.
|
|
|
|
llvm::SmallDenseSet<Block *, 8> blocks_with_breakpoints;
|
|
|
|
for (auto first = worklist_begin; first != worklist_end; ++first) {
|
|
|
|
assert(!blocks_with_breakpoints.count(first->block));
|
|
|
|
blocks_with_breakpoints.insert(first->block);
|
|
|
|
worklist_end =
|
|
|
|
std::remove_if(std::next(first), worklist_end,
|
|
|
|
[&](const SymbolContext &sc) {
|
|
|
|
return blocks_with_breakpoints.count(sc.block);
|
|
|
|
});
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
2010-06-09 00:52:24 +08:00
|
|
|
|
2018-08-30 07:16:42 +08:00
|
|
|
// Make breakpoints out of the closest line number match.
|
|
|
|
for (auto &sc : llvm::make_range(worklist_begin, worklist_end))
|
|
|
|
AddLocation(filter, sc, skip_prologue, log_ident);
|
2016-09-07 04:57:50 +08:00
|
|
|
|
2018-08-30 07:16:42 +08:00
|
|
|
// Remove all contexts processed by this iteration.
|
|
|
|
all_scs.erase(worklist_begin, all_scs.end());
|
|
|
|
}
|
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
|
2018-08-30 07:16:42 +08:00
|
|
|
void BreakpointResolver::AddLocation(SearchFilter &filter,
|
|
|
|
const SymbolContext &sc,
|
|
|
|
bool skip_prologue,
|
|
|
|
llvm::StringRef log_ident) {
|
|
|
|
Log *log(lldb_private::GetLogIfAllCategoriesSet(LIBLLDB_LOG_BREAKPOINTS));
|
|
|
|
Address line_start = sc.line_entry.range.GetBaseAddress();
|
|
|
|
if (!line_start.IsValid()) {
|
|
|
|
if (log)
|
|
|
|
log->Printf("error: Unable to set breakpoint %s at file address "
|
|
|
|
"0x%" PRIx64 "\n",
|
|
|
|
log_ident.str().c_str(), line_start.GetFileAddress());
|
|
|
|
return;
|
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
|
2018-08-30 07:16:42 +08:00
|
|
|
if (!filter.AddressPasses(line_start)) {
|
|
|
|
if (log)
|
|
|
|
log->Printf("Breakpoint %s at file address 0x%" PRIx64
|
|
|
|
" didn't pass the filter.\n",
|
|
|
|
log_ident.str().c_str(), line_start.GetFileAddress());
|
|
|
|
}
|
|
|
|
|
|
|
|
// If the line number is before the prologue end, move it there...
|
|
|
|
bool skipped_prologue = false;
|
|
|
|
if (skip_prologue && sc.function) {
|
|
|
|
Address prologue_addr(sc.function->GetAddressRange().GetBaseAddress());
|
|
|
|
if (prologue_addr.IsValid() && (line_start == prologue_addr)) {
|
|
|
|
const uint32_t prologue_byte_size = sc.function->GetPrologueByteSize();
|
|
|
|
if (prologue_byte_size) {
|
|
|
|
prologue_addr.Slide(prologue_byte_size);
|
|
|
|
|
|
|
|
if (filter.AddressPasses(prologue_addr)) {
|
|
|
|
skipped_prologue = true;
|
|
|
|
line_start = prologue_addr;
|
2013-09-27 09:16:58 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
2013-09-27 09:16:58 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
2018-08-30 07:16:42 +08:00
|
|
|
|
|
|
|
BreakpointLocationSP bp_loc_sp(AddLocation(line_start));
|
|
|
|
if (log && bp_loc_sp && !m_breakpoint->IsInternal()) {
|
|
|
|
StreamString s;
|
|
|
|
bp_loc_sp->GetDescription(&s, lldb::eDescriptionLevelVerbose);
|
|
|
|
log->Printf("Added location (skipped prologue: %s): %s \n",
|
|
|
|
skipped_prologue ? "yes" : "no", s.GetData());
|
|
|
|
}
|
2013-09-27 09:16:58 +08:00
|
|
|
}
|
2016-03-10 02:59:13 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
BreakpointLocationSP BreakpointResolver::AddLocation(Address loc_addr,
|
|
|
|
bool *new_location) {
|
|
|
|
loc_addr.Slide(m_offset);
|
|
|
|
return m_breakpoint->AddLocation(loc_addr, new_location);
|
2016-03-10 02:59:13 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
void BreakpointResolver::SetOffset(lldb::addr_t offset) {
|
|
|
|
// There may already be an offset, so we are actually adjusting location
|
|
|
|
// addresses by the difference.
|
|
|
|
// lldb::addr_t slide = offset - m_offset;
|
2018-08-30 07:16:42 +08:00
|
|
|
// FIXME: We should go fix up all the already set locations for the new
|
|
|
|
// slide.
|
2016-03-10 02:59:13 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
m_offset = offset;
|
2016-03-10 02:59:13 +08:00
|
|
|
}
|