2010-06-09 00:52:24 +08:00
|
|
|
//===-- ModuleList.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/Core/ModuleList.h"
|
2017-04-07 05:28:29 +08:00
|
|
|
#include "lldb/Core/FileSpecList.h" // for FileSpecList
|
2010-06-09 00:52:24 +08:00
|
|
|
#include "lldb/Core/Module.h"
|
<rdar://problem/11757916>
Make breakpoint setting by file and line much more efficient by only looking for inlined breakpoint locations if we are setting a breakpoint in anything but a source implementation file. Implementing this complex for a many reasons. Turns out that parsing compile units lazily had some issues with respect to how we need to do things with DWARF in .o files. So the fixes in the checkin for this makes these changes:
- Add a new setting called "target.inline-breakpoint-strategy" which can be set to "never", "always", or "headers". "never" will never try and set any inlined breakpoints (fastest). "always" always looks for inlined breakpoint locations (slowest, but most accurate). "headers", which is the default setting, will only look for inlined breakpoint locations if the breakpoint is set in what are consudered to be header files, which is realy defined as "not in an implementation source file".
- modify the breakpoint setting by file and line to check the current "target.inline-breakpoint-strategy" setting and act accordingly
- Modify compile units to be able to get their language and other info lazily. This allows us to create compile units from the debug map and not have to fill all of the details in, and then lazily discover this information as we go on debuggging. This is needed to avoid parsing all .o files when setting breakpoints in implementation only files (no inlines). Otherwise we would need to parse the .o file, the object file (mach-o in our case) and the symbol file (DWARF in the object file) just to see what the compile unit was.
- modify the "SymbolFileDWARFDebugMap" to subclass lldb_private::Module so that the virtual "GetObjectFile()" and "GetSymbolVendor()" functions can be intercepted when the .o file contenst are later lazilly needed. Prior to this fix, when we first instantiated the "SymbolFileDWARFDebugMap" class, we would also make modules, object files and symbol files for every .o file in the debug map because we needed to fix up the sections in the .o files with information that is in the executable debug map. Now we lazily do this in the DebugMapModule::GetObjectFile()
Cleaned up header includes a bit as well.
llvm-svn: 162860
2012-08-30 05:13:06 +08:00
|
|
|
#include "lldb/Core/ModuleSpec.h"
|
2016-11-02 00:11:14 +08:00
|
|
|
#include "lldb/Host/FileSystem.h"
|
2010-06-09 00:52:24 +08:00
|
|
|
#include "lldb/Host/Symbols.h"
|
2018-03-03 06:42:44 +08:00
|
|
|
#include "lldb/Interpreter/OptionValueProperties.h"
|
|
|
|
#include "lldb/Interpreter/OptionValueFileSpec.h"
|
|
|
|
#include "lldb/Interpreter/Property.h"
|
2010-06-09 00:52:24 +08:00
|
|
|
#include "lldb/Symbol/ObjectFile.h"
|
2017-04-07 05:28:29 +08:00
|
|
|
#include "lldb/Symbol/SymbolContext.h" // for SymbolContextList, SymbolCon...
|
2010-06-09 00:52:24 +08:00
|
|
|
#include "lldb/Symbol/VariableList.h"
|
2017-11-14 00:16:33 +08:00
|
|
|
#include "lldb/Utility/ArchSpec.h" // for ArchSpec
|
2017-04-07 05:28:29 +08:00
|
|
|
#include "lldb/Utility/ConstString.h" // for ConstString
|
2017-03-04 04:56:28 +08:00
|
|
|
#include "lldb/Utility/Log.h"
|
2017-04-07 05:28:29 +08:00
|
|
|
#include "lldb/Utility/Logging.h" // for GetLogIfAnyCategoriesSet
|
|
|
|
#include "lldb/Utility/UUID.h" // for UUID, operator!=, operator==
|
|
|
|
#include "lldb/lldb-defines.h" // for LLDB_INVALID_INDEX32
|
|
|
|
|
2018-04-10 21:33:45 +08:00
|
|
|
#if defined(_WIN32)
|
2017-04-07 05:28:29 +08:00
|
|
|
#include "lldb/Host/windows/PosixApi.h" // for PATH_MAX
|
|
|
|
#endif
|
2010-06-09 00:52:24 +08:00
|
|
|
|
2017-04-07 05:28:29 +08:00
|
|
|
#include "llvm/ADT/StringRef.h" // for StringRef
|
2017-03-09 01:56:08 +08:00
|
|
|
#include "llvm/Support/FileSystem.h"
|
2017-02-07 01:55:02 +08:00
|
|
|
#include "llvm/Support/Threading.h"
|
2017-04-07 05:28:29 +08:00
|
|
|
#include "llvm/Support/raw_ostream.h" // for fs
|
2018-03-03 06:42:44 +08:00
|
|
|
#include "clang/Driver/Driver.h"
|
2017-04-07 05:28:29 +08:00
|
|
|
|
|
|
|
#include <chrono> // for operator!=, time_point
|
|
|
|
#include <memory> // for shared_ptr
|
|
|
|
#include <mutex>
|
|
|
|
#include <string> // for string
|
|
|
|
#include <utility> // for distance
|
|
|
|
|
|
|
|
namespace lldb_private {
|
|
|
|
class Function;
|
|
|
|
}
|
|
|
|
namespace lldb_private {
|
|
|
|
class RegularExpression;
|
|
|
|
}
|
|
|
|
namespace lldb_private {
|
|
|
|
class Stream;
|
|
|
|
}
|
|
|
|
namespace lldb_private {
|
|
|
|
class SymbolFile;
|
|
|
|
}
|
|
|
|
namespace lldb_private {
|
|
|
|
class Target;
|
|
|
|
}
|
|
|
|
namespace lldb_private {
|
|
|
|
class TypeList;
|
|
|
|
}
|
2017-02-07 01:55:02 +08:00
|
|
|
|
2010-06-09 00:52:24 +08:00
|
|
|
using namespace lldb;
|
|
|
|
using namespace lldb_private;
|
|
|
|
|
2018-03-03 06:42:44 +08:00
|
|
|
namespace {
|
|
|
|
|
2018-09-27 02:50:19 +08:00
|
|
|
static constexpr PropertyDefinition g_properties[] = {
|
2018-03-13 04:52:36 +08:00
|
|
|
{"enable-external-lookup", OptionValue::eTypeBoolean, true, true, nullptr,
|
2018-09-27 02:50:19 +08:00
|
|
|
{},
|
2018-03-13 04:52:36 +08:00
|
|
|
"Control the use of external tools or libraries to locate symbol files. "
|
|
|
|
"On macOS, Spotlight is used to locate a matching .dSYM bundle based on "
|
|
|
|
"the UUID of the executable."},
|
2018-03-10 09:11:25 +08:00
|
|
|
{"clang-modules-cache-path", OptionValue::eTypeFileSpec, true, 0, nullptr,
|
2018-09-27 02:50:19 +08:00
|
|
|
{},
|
2018-09-27 15:11:58 +08:00
|
|
|
"The path to the clang modules cache directory (-fmodules-cache-path)."}};
|
2018-03-03 06:42:44 +08:00
|
|
|
|
2018-03-13 04:52:36 +08:00
|
|
|
enum { ePropertyEnableExternalLookup, ePropertyClangModulesCachePath };
|
2018-03-03 06:42:44 +08:00
|
|
|
|
|
|
|
} // namespace
|
|
|
|
|
|
|
|
ModuleListProperties::ModuleListProperties() {
|
2018-03-10 09:11:25 +08:00
|
|
|
m_collection_sp.reset(new OptionValueProperties(ConstString("symbols")));
|
2018-03-03 06:42:44 +08:00
|
|
|
m_collection_sp->Initialize(g_properties);
|
|
|
|
|
|
|
|
llvm::SmallString<128> path;
|
|
|
|
clang::driver::Driver::getDefaultModuleCachePath(path);
|
|
|
|
SetClangModulesCachePath(path);
|
|
|
|
}
|
|
|
|
|
2018-03-13 04:52:36 +08:00
|
|
|
bool ModuleListProperties::GetEnableExternalLookup() const {
|
|
|
|
const uint32_t idx = ePropertyEnableExternalLookup;
|
|
|
|
return m_collection_sp->GetPropertyAtIndexAsBoolean(
|
|
|
|
nullptr, idx, g_properties[idx].default_uint_value != 0);
|
|
|
|
}
|
|
|
|
|
2018-03-03 06:42:44 +08:00
|
|
|
FileSpec ModuleListProperties::GetClangModulesCachePath() const {
|
|
|
|
return m_collection_sp
|
|
|
|
->GetPropertyAtIndexAsOptionValueFileSpec(nullptr, false,
|
|
|
|
ePropertyClangModulesCachePath)
|
|
|
|
->GetCurrentValue();
|
|
|
|
}
|
|
|
|
|
|
|
|
bool ModuleListProperties::SetClangModulesCachePath(llvm::StringRef path) {
|
|
|
|
return m_collection_sp->SetPropertyAtIndexAsString(
|
|
|
|
nullptr, ePropertyClangModulesCachePath, path);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
ModuleList::ModuleList()
|
|
|
|
: m_modules(), m_modules_mutex(), m_notifier(nullptr) {}
|
|
|
|
|
|
|
|
ModuleList::ModuleList(const ModuleList &rhs)
|
|
|
|
: m_modules(), m_modules_mutex(), m_notifier(nullptr) {
|
|
|
|
std::lock_guard<std::recursive_mutex> lhs_guard(m_modules_mutex);
|
|
|
|
std::lock_guard<std::recursive_mutex> rhs_guard(rhs.m_modules_mutex);
|
|
|
|
m_modules = rhs.m_modules;
|
|
|
|
}
|
|
|
|
|
|
|
|
ModuleList::ModuleList(ModuleList::Notifier *notifier)
|
|
|
|
: m_modules(), m_modules_mutex(), m_notifier(notifier) {}
|
|
|
|
|
|
|
|
const ModuleList &ModuleList::operator=(const ModuleList &rhs) {
|
|
|
|
if (this != &rhs) {
|
|
|
|
// That's probably me nit-picking, but in theoretical situation:
|
|
|
|
//
|
|
|
|
// * that two threads A B and
|
|
|
|
// * two ModuleList's x y do opposite assignments ie.:
|
|
|
|
//
|
|
|
|
// in thread A: | in thread B:
|
|
|
|
// x = y; | y = x;
|
|
|
|
//
|
2018-05-01 00:49:04 +08:00
|
|
|
// This establishes correct(same) lock taking order and thus avoids
|
|
|
|
// priority inversion.
|
2016-09-07 04:57:50 +08:00
|
|
|
if (uintptr_t(this) > uintptr_t(&rhs)) {
|
|
|
|
std::lock_guard<std::recursive_mutex> lhs_guard(m_modules_mutex);
|
|
|
|
std::lock_guard<std::recursive_mutex> rhs_guard(rhs.m_modules_mutex);
|
|
|
|
m_modules = rhs.m_modules;
|
|
|
|
} else {
|
|
|
|
std::lock_guard<std::recursive_mutex> lhs_guard(m_modules_mutex);
|
|
|
|
std::lock_guard<std::recursive_mutex> rhs_guard(rhs.m_modules_mutex);
|
|
|
|
m_modules = rhs.m_modules;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return *this;
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
ModuleList::~ModuleList() = default;
|
2010-06-09 00:52:24 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
void ModuleList::AppendImpl(const ModuleSP &module_sp, bool use_notifier) {
|
|
|
|
if (module_sp) {
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
m_modules.push_back(module_sp);
|
|
|
|
if (use_notifier && m_notifier)
|
|
|
|
m_notifier->ModuleAdded(*this, module_sp);
|
|
|
|
}
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
void ModuleList::Append(const ModuleSP &module_sp) { AppendImpl(module_sp); }
|
2010-06-09 00:52:24 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
void ModuleList::ReplaceEquivalent(const ModuleSP &module_sp) {
|
|
|
|
if (module_sp) {
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
2010-06-09 00:52:24 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
// First remove any equivalent modules. Equivalent modules are modules
|
|
|
|
// whose path, platform path and architecture match.
|
|
|
|
ModuleSpec equivalent_module_spec(module_sp->GetFileSpec(),
|
|
|
|
module_sp->GetArchitecture());
|
|
|
|
equivalent_module_spec.GetPlatformFileSpec() =
|
|
|
|
module_sp->GetPlatformFileSpec();
|
2012-11-08 10:22:02 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
size_t idx = 0;
|
|
|
|
while (idx < m_modules.size()) {
|
|
|
|
ModuleSP module_sp(m_modules[idx]);
|
|
|
|
if (module_sp->MatchesModuleSpec(equivalent_module_spec))
|
|
|
|
RemoveImpl(m_modules.begin() + idx);
|
|
|
|
else
|
|
|
|
++idx;
|
2012-07-13 04:32:19 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
// Now add the new module to the list
|
|
|
|
Append(module_sp);
|
|
|
|
}
|
2012-07-13 04:32:19 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
bool ModuleList::AppendIfNeeded(const ModuleSP &module_sp) {
|
|
|
|
if (module_sp) {
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
collection::iterator pos, end = m_modules.end();
|
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
if (pos->get() == module_sp.get())
|
|
|
|
return false; // Already in the list
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
// Only push module_sp on the list if it wasn't already in there.
|
|
|
|
Append(module_sp);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
void ModuleList::Append(const ModuleList &module_list) {
|
|
|
|
for (auto pos : module_list.m_modules)
|
|
|
|
Append(pos);
|
2012-11-08 10:22:02 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
bool ModuleList::AppendIfNeeded(const ModuleList &module_list) {
|
|
|
|
bool any_in = false;
|
|
|
|
for (auto pos : module_list.m_modules) {
|
|
|
|
if (AppendIfNeeded(pos))
|
|
|
|
any_in = true;
|
|
|
|
}
|
|
|
|
return any_in;
|
2012-11-08 10:22:02 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
bool ModuleList::RemoveImpl(const ModuleSP &module_sp, bool use_notifier) {
|
|
|
|
if (module_sp) {
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
collection::iterator pos, end = m_modules.end();
|
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
if (pos->get() == module_sp.get()) {
|
|
|
|
m_modules.erase(pos);
|
|
|
|
if (use_notifier && m_notifier)
|
|
|
|
m_notifier->ModuleRemoved(*this, module_sp);
|
|
|
|
return true;
|
|
|
|
}
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
|
|
|
return false;
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2012-11-08 10:22:02 +08:00
|
|
|
ModuleList::collection::iterator
|
2016-09-07 04:57:50 +08:00
|
|
|
ModuleList::RemoveImpl(ModuleList::collection::iterator pos,
|
|
|
|
bool use_notifier) {
|
|
|
|
ModuleSP module_sp(*pos);
|
|
|
|
collection::iterator retval = m_modules.erase(pos);
|
|
|
|
if (use_notifier && m_notifier)
|
|
|
|
m_notifier->ModuleRemoved(*this, module_sp);
|
|
|
|
return retval;
|
2012-11-08 10:22:02 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
bool ModuleList::Remove(const ModuleSP &module_sp) {
|
|
|
|
return RemoveImpl(module_sp);
|
2012-11-08 10:22:02 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
bool ModuleList::ReplaceModule(const lldb::ModuleSP &old_module_sp,
|
|
|
|
const lldb::ModuleSP &new_module_sp) {
|
|
|
|
if (!RemoveImpl(old_module_sp, false))
|
2012-05-18 02:38:42 +08:00
|
|
|
return false;
|
2016-09-07 04:57:50 +08:00
|
|
|
AppendImpl(new_module_sp, false);
|
|
|
|
if (m_notifier)
|
|
|
|
m_notifier->ModuleUpdated(*this, old_module_sp, new_module_sp);
|
|
|
|
return true;
|
2012-05-18 02:38:42 +08:00
|
|
|
}
|
2011-08-11 10:48:45 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
bool ModuleList::RemoveIfOrphaned(const Module *module_ptr) {
|
|
|
|
if (module_ptr) {
|
2016-05-19 13:13:57 +08:00
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
2016-09-07 04:57:50 +08:00
|
|
|
collection::iterator pos, end = m_modules.end();
|
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
if (pos->get() == module_ptr) {
|
|
|
|
if (pos->unique()) {
|
|
|
|
pos = RemoveImpl(pos);
|
|
|
|
return true;
|
|
|
|
} else
|
|
|
|
return false;
|
|
|
|
}
|
2010-12-07 07:51:26 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
|
|
|
return false;
|
2010-12-07 07:51:26 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
size_t ModuleList::RemoveOrphans(bool mandatory) {
|
|
|
|
std::unique_lock<std::recursive_mutex> lock(m_modules_mutex, std::defer_lock);
|
2010-06-09 00:52:24 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
if (mandatory) {
|
|
|
|
lock.lock();
|
|
|
|
} else {
|
|
|
|
// Not mandatory, remove orphans if we can get the mutex
|
|
|
|
if (!lock.try_lock())
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
collection::iterator pos = m_modules.begin();
|
|
|
|
size_t remove_count = 0;
|
|
|
|
while (pos != m_modules.end()) {
|
|
|
|
if (pos->unique()) {
|
|
|
|
pos = RemoveImpl(pos);
|
|
|
|
++remove_count;
|
|
|
|
} else {
|
|
|
|
++pos;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return remove_count;
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
size_t ModuleList::Remove(ModuleList &module_list) {
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
size_t num_removed = 0;
|
|
|
|
collection::iterator pos, end = module_list.m_modules.end();
|
|
|
|
for (pos = module_list.m_modules.begin(); pos != end; ++pos) {
|
|
|
|
if (Remove(*pos))
|
|
|
|
++num_removed;
|
|
|
|
}
|
|
|
|
return num_removed;
|
2012-11-08 10:22:02 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
void ModuleList::Clear() { ClearImpl(); }
|
2012-01-28 02:45:39 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
void ModuleList::Destroy() { ClearImpl(); }
|
2012-05-30 10:19:25 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
void ModuleList::ClearImpl(bool use_notifier) {
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
if (use_notifier && m_notifier)
|
|
|
|
m_notifier->WillClearList(*this);
|
|
|
|
m_modules.clear();
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
Module *ModuleList::GetModulePointerAtIndex(size_t idx) const {
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
return GetModulePointerAtIndexUnlocked(idx);
|
2012-05-30 10:19:25 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
Module *ModuleList::GetModulePointerAtIndexUnlocked(size_t idx) const {
|
|
|
|
if (idx < m_modules.size())
|
|
|
|
return m_modules[idx].get();
|
|
|
|
return nullptr;
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
ModuleSP ModuleList::GetModuleAtIndex(size_t idx) const {
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
return GetModuleAtIndexUnlocked(idx);
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
ModuleSP ModuleList::GetModuleAtIndexUnlocked(size_t idx) const {
|
|
|
|
ModuleSP module_sp;
|
|
|
|
if (idx < m_modules.size())
|
|
|
|
module_sp = m_modules[idx];
|
|
|
|
return module_sp;
|
|
|
|
}
|
Centralize the way symbol and functions are looked up by making a Module::LookupInfo class that does all of the heavy lifting.
Background: symbols and functions can be looked up by full mangled name and by basename. SymbolFile and ObjectFile are expected to be able to do the lookups based on full mangled name or by basename, so when the user types something that is incomplete, we must be able to look it up efficiently. For example the user types "a::b::c" as a symbol to set a breakpoint on, we will break this down into a 'lookup "c"' and then weed out N matches down to just the ones that match "a::b::c". Previously this was done manaully in many functions by calling Module::PrepareForFunctionNameLookup(...) and then doing the lookup and manually pruning the results down afterward with duplicated code. Now all places use Module::LookupInfo to do the work in one place.
This allowed me to fix the name lookups to look for "func" with eFunctionNameTypeFull as the "name_type_mask", and correctly weed the results:
"func", "func()", "func(int)", "a::func()", "b::func()", and "a::b::func()" down to just "func", "func()", "func(int)". Previously we would have set 6 breakpoints, now we correctly set just 3. This also extends to the expression parser when it looks up names for functions it needs to not get multiple results so we can call the correct function.
<rdar://problem/24599697>
llvm-svn: 275281
2016-07-14 01:12:24 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
size_t ModuleList::FindFunctions(const ConstString &name,
|
|
|
|
uint32_t name_type_mask, bool include_symbols,
|
|
|
|
bool include_inlines, bool append,
|
|
|
|
SymbolContextList &sc_list) const {
|
|
|
|
if (!append)
|
|
|
|
sc_list.Clear();
|
Centralize the way symbol and functions are looked up by making a Module::LookupInfo class that does all of the heavy lifting.
Background: symbols and functions can be looked up by full mangled name and by basename. SymbolFile and ObjectFile are expected to be able to do the lookups based on full mangled name or by basename, so when the user types something that is incomplete, we must be able to look it up efficiently. For example the user types "a::b::c" as a symbol to set a breakpoint on, we will break this down into a 'lookup "c"' and then weed out N matches down to just the ones that match "a::b::c". Previously this was done manaully in many functions by calling Module::PrepareForFunctionNameLookup(...) and then doing the lookup and manually pruning the results down afterward with duplicated code. Now all places use Module::LookupInfo to do the work in one place.
This allowed me to fix the name lookups to look for "func" with eFunctionNameTypeFull as the "name_type_mask", and correctly weed the results:
"func", "func()", "func(int)", "a::func()", "b::func()", and "a::b::func()" down to just "func", "func()", "func(int)". Previously we would have set 6 breakpoints, now we correctly set just 3. This also extends to the expression parser when it looks up names for functions it needs to not get multiple results so we can call the correct function.
<rdar://problem/24599697>
llvm-svn: 275281
2016-07-14 01:12:24 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
const size_t old_size = sc_list.GetSize();
|
Centralize the way symbol and functions are looked up by making a Module::LookupInfo class that does all of the heavy lifting.
Background: symbols and functions can be looked up by full mangled name and by basename. SymbolFile and ObjectFile are expected to be able to do the lookups based on full mangled name or by basename, so when the user types something that is incomplete, we must be able to look it up efficiently. For example the user types "a::b::c" as a symbol to set a breakpoint on, we will break this down into a 'lookup "c"' and then weed out N matches down to just the ones that match "a::b::c". Previously this was done manaully in many functions by calling Module::PrepareForFunctionNameLookup(...) and then doing the lookup and manually pruning the results down afterward with duplicated code. Now all places use Module::LookupInfo to do the work in one place.
This allowed me to fix the name lookups to look for "func" with eFunctionNameTypeFull as the "name_type_mask", and correctly weed the results:
"func", "func()", "func(int)", "a::func()", "b::func()", and "a::b::func()" down to just "func", "func()", "func(int)". Previously we would have set 6 breakpoints, now we correctly set just 3. This also extends to the expression parser when it looks up names for functions it needs to not get multiple results so we can call the correct function.
<rdar://problem/24599697>
llvm-svn: 275281
2016-07-14 01:12:24 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
if (name_type_mask & eFunctionNameTypeAuto) {
|
|
|
|
Module::LookupInfo lookup_info(name, name_type_mask, eLanguageTypeUnknown);
|
2014-09-20 03:38:19 +08:00
|
|
|
|
2016-05-19 13:13:57 +08:00
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
2014-09-20 03:38:19 +08:00
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
2016-09-07 04:57:50 +08:00
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
(*pos)->FindFunctions(lookup_info.GetLookupName(), nullptr,
|
|
|
|
lookup_info.GetNameTypeMask(), include_symbols,
|
|
|
|
include_inlines, true, sc_list);
|
2014-09-20 03:38:19 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
const size_t new_size = sc_list.GetSize();
|
2016-05-19 13:13:57 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
if (old_size < new_size)
|
|
|
|
lookup_info.Prune(sc_list, old_size);
|
|
|
|
} else {
|
2016-05-19 13:13:57 +08:00
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
2011-07-07 09:59:51 +08:00
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
2016-09-07 04:57:50 +08:00
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
(*pos)->FindFunctions(name, nullptr, name_type_mask, include_symbols,
|
|
|
|
include_inlines, true, sc_list);
|
2011-07-07 09:59:51 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
|
|
|
return sc_list.GetSize() - old_size;
|
2011-07-07 09:59:51 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
size_t ModuleList::FindFunctionSymbols(const ConstString &name,
|
|
|
|
uint32_t name_type_mask,
|
|
|
|
SymbolContextList &sc_list) {
|
|
|
|
const size_t old_size = sc_list.GetSize();
|
|
|
|
|
|
|
|
if (name_type_mask & eFunctionNameTypeAuto) {
|
|
|
|
Module::LookupInfo lookup_info(name, name_type_mask, eLanguageTypeUnknown);
|
2010-06-09 00:52:24 +08:00
|
|
|
|
2016-05-19 13:13:57 +08:00
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
2012-11-08 10:22:02 +08:00
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
2016-09-07 04:57:50 +08:00
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
(*pos)->FindFunctionSymbols(lookup_info.GetLookupName(),
|
|
|
|
lookup_info.GetNameTypeMask(), sc_list);
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
const size_t new_size = sc_list.GetSize();
|
2011-11-19 08:19:25 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
if (old_size < new_size)
|
|
|
|
lookup_info.Prune(sc_list, old_size);
|
|
|
|
} else {
|
2016-05-19 13:13:57 +08:00
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
2012-11-08 10:22:02 +08:00
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
2016-09-07 04:57:50 +08:00
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
(*pos)->FindFunctionSymbols(name, name_type_mask, sc_list);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return sc_list.GetSize() - old_size;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t ModuleList::FindFunctions(const RegularExpression &name,
|
|
|
|
bool include_symbols, bool include_inlines,
|
|
|
|
bool append, SymbolContextList &sc_list) {
|
|
|
|
const size_t old_size = sc_list.GetSize();
|
|
|
|
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
(*pos)->FindFunctions(name, include_symbols, include_inlines, append,
|
|
|
|
sc_list);
|
|
|
|
}
|
|
|
|
|
|
|
|
return sc_list.GetSize() - old_size;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t ModuleList::FindCompileUnits(const FileSpec &path, bool append,
|
|
|
|
SymbolContextList &sc_list) const {
|
|
|
|
if (!append)
|
|
|
|
sc_list.Clear();
|
|
|
|
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
(*pos)->FindCompileUnits(path, true, sc_list);
|
|
|
|
}
|
|
|
|
|
|
|
|
return sc_list.GetSize();
|
|
|
|
}
|
|
|
|
|
2018-05-31 17:46:26 +08:00
|
|
|
size_t ModuleList::FindGlobalVariables(const ConstString &name,
|
2016-09-07 04:57:50 +08:00
|
|
|
size_t max_matches,
|
|
|
|
VariableList &variable_list) const {
|
|
|
|
size_t initial_size = variable_list.GetSize();
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
2018-05-31 17:46:26 +08:00
|
|
|
(*pos)->FindGlobalVariables(name, nullptr, max_matches, variable_list);
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
|
|
|
return variable_list.GetSize() - initial_size;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t ModuleList::FindGlobalVariables(const RegularExpression ®ex,
|
2018-05-31 17:46:26 +08:00
|
|
|
size_t max_matches,
|
2016-09-07 04:57:50 +08:00
|
|
|
VariableList &variable_list) const {
|
|
|
|
size_t initial_size = variable_list.GetSize();
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
2018-05-31 17:46:26 +08:00
|
|
|
(*pos)->FindGlobalVariables(regex, max_matches, variable_list);
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
|
|
|
return variable_list.GetSize() - initial_size;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t ModuleList::FindSymbolsWithNameAndType(const ConstString &name,
|
|
|
|
SymbolType symbol_type,
|
|
|
|
SymbolContextList &sc_list,
|
|
|
|
bool append) const {
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
if (!append)
|
|
|
|
sc_list.Clear();
|
|
|
|
size_t initial_size = sc_list.GetSize();
|
|
|
|
|
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos)
|
|
|
|
(*pos)->FindSymbolsWithNameAndType(name, symbol_type, sc_list);
|
|
|
|
return sc_list.GetSize() - initial_size;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t ModuleList::FindSymbolsMatchingRegExAndType(
|
|
|
|
const RegularExpression ®ex, lldb::SymbolType symbol_type,
|
|
|
|
SymbolContextList &sc_list, bool append) const {
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
if (!append)
|
|
|
|
sc_list.Clear();
|
|
|
|
size_t initial_size = sc_list.GetSize();
|
|
|
|
|
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos)
|
|
|
|
(*pos)->FindSymbolsMatchingRegExAndType(regex, symbol_type, sc_list);
|
|
|
|
return sc_list.GetSize() - initial_size;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t ModuleList::FindModules(const ModuleSpec &module_spec,
|
|
|
|
ModuleList &matching_module_list) const {
|
|
|
|
size_t existing_matches = matching_module_list.GetSize();
|
|
|
|
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
ModuleSP module_sp(*pos);
|
|
|
|
if (module_sp->MatchesModuleSpec(module_spec))
|
|
|
|
matching_module_list.Append(module_sp);
|
|
|
|
}
|
|
|
|
return matching_module_list.GetSize() - existing_matches;
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
ModuleSP ModuleList::FindModule(const Module *module_ptr) const {
|
|
|
|
ModuleSP module_sp;
|
2010-06-09 00:52:24 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
// Scope for "locker"
|
|
|
|
{
|
2016-05-19 13:13:57 +08:00
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
2012-02-26 13:51:37 +08:00
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
2010-06-09 00:52:24 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
if ((*pos).get() == module_ptr) {
|
|
|
|
module_sp = (*pos);
|
|
|
|
break;
|
|
|
|
}
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
|
|
|
return module_sp;
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
ModuleSP ModuleList::FindModule(const UUID &uuid) const {
|
|
|
|
ModuleSP module_sp;
|
Many improvements to the Platform base class and subclasses. The base Platform
class now implements the Host functionality for a lot of things that make
sense by default so that subclasses can check:
int
PlatformSubclass::Foo ()
{
if (IsHost())
return Platform::Foo (); // Let the platform base class do the host specific stuff
// Platform subclass specific code...
int result = ...
return result;
}
Added new functions to the platform:
virtual const char *Platform::GetUserName (uint32_t uid);
virtual const char *Platform::GetGroupName (uint32_t gid);
The user and group names are cached locally so that remote platforms can avoid
sending packets multiple times to resolve this information.
Added the parent process ID to the ProcessInfo class.
Added a new ProcessInfoMatch class which helps us to match processes up
and changed the Host layer over to using this new class. The new class allows
us to search for processs:
1 - by name (equal to, starts with, ends with, contains, and regex)
2 - by pid
3 - And further check for parent pid == value, uid == value, gid == value,
euid == value, egid == value, arch == value, parent == value.
This is all hookup up to the "platform process list" command which required
adding dumping routines to dump process information. If the Host class
implements the process lookup routines, you can now lists processes on
your local machine:
machine1.foo.com % lldb
(lldb) platform process list
PID PARENT USER GROUP EFF USER EFF GROUP TRIPLE NAME
====== ====== ========== ========== ========== ========== ======================== ============================
99538 1 username usergroup username usergroup x86_64-apple-darwin FileMerge
94943 1 username usergroup username usergroup x86_64-apple-darwin mdworker
94852 244 username usergroup username usergroup x86_64-apple-darwin Safari
94727 244 username usergroup username usergroup x86_64-apple-darwin Xcode
92742 92710 username usergroup username usergroup i386-apple-darwin debugserver
This of course also works remotely with the lldb-platform:
machine1.foo.com % lldb-platform --listen 1234
machine2.foo.com % lldb
(lldb) platform create remote-macosx
Platform: remote-macosx
Connected: no
(lldb) platform connect connect://localhost:1444
Platform: remote-macosx
Triple: x86_64-apple-darwin
OS Version: 10.6.7 (10J869)
Kernel: Darwin Kernel Version 10.7.0: Sat Jan 29 15:17:16 PST 2011; root:xnu-1504.9.37~1/RELEASE_I386
Hostname: machine1.foo.com
Connected: yes
(lldb) platform process list
PID PARENT USER GROUP EFF USER EFF GROUP TRIPLE NAME
====== ====== ========== ========== ========== ========== ======================== ============================
99556 244 username usergroup username usergroup x86_64-apple-darwin trustevaluation
99548 65539 username usergroup username usergroup x86_64-apple-darwin lldb
99538 1 username usergroup username usergroup x86_64-apple-darwin FileMerge
94943 1 username usergroup username usergroup x86_64-apple-darwin mdworker
94852 244 username usergroup username usergroup x86_64-apple-darwin Safari
The lldb-platform implements everything with the Host:: layer, so this should
"just work" for linux. I will probably be adding more stuff to the Host layer
for launching processes and attaching to processes so that this support should
eventually just work as well.
Modified the target to be able to be created with an architecture that differs
from the main executable. This is needed for iOS debugging since we can have
an "armv6" binary which can run on an "armv7" machine, so we want to be able
to do:
% lldb
(lldb) platform create remote-ios
(lldb) file --arch armv7 a.out
Where "a.out" is an armv6 executable. The platform then can correctly decide
to open all "armv7" images for all dependent shared libraries.
Modified the disassembly to show the current PC value. Example output:
(lldb) disassemble --frame
a.out`main:
0x1eb7: pushl %ebp
0x1eb8: movl %esp, %ebp
0x1eba: pushl %ebx
0x1ebb: subl $20, %esp
0x1ebe: calll 0x1ec3 ; main + 12 at test.c:18
0x1ec3: popl %ebx
-> 0x1ec4: calll 0x1f12 ; getpid
0x1ec9: movl %eax, 4(%esp)
0x1ecd: leal 199(%ebx), %eax
0x1ed3: movl %eax, (%esp)
0x1ed6: calll 0x1f18 ; printf
0x1edb: leal 213(%ebx), %eax
0x1ee1: movl %eax, (%esp)
0x1ee4: calll 0x1f1e ; puts
0x1ee9: calll 0x1f0c ; getchar
0x1eee: movl $20, (%esp)
0x1ef5: calll 0x1e6a ; sleep_loop at test.c:6
0x1efa: movl $12, %eax
0x1eff: addl $20, %esp
0x1f02: popl %ebx
0x1f03: leave
0x1f04: ret
This can be handy when dealing with the new --line options that was recently
added:
(lldb) disassemble --line
a.out`main + 13 at test.c:19
18 {
-> 19 printf("Process: %i\n\n", getpid());
20 puts("Press any key to continue..."); getchar();
-> 0x1ec4: calll 0x1f12 ; getpid
0x1ec9: movl %eax, 4(%esp)
0x1ecd: leal 199(%ebx), %eax
0x1ed3: movl %eax, (%esp)
0x1ed6: calll 0x1f18 ; printf
Modified the ModuleList to have a lookup based solely on a UUID. Since the
UUID is typically the MD5 checksum of a binary image, there is no need
to give the path and architecture when searching for a pre-existing
image in an image list.
Now that we support remote debugging a bit better, our lldb_private::Module
needs to be able to track what the original path for file was as the platform
knows it, as well as where the file is locally. The module has the two
following functions to retrieve both paths:
const FileSpec &Module::GetFileSpec () const;
const FileSpec &Module::GetPlatformFileSpec () const;
llvm-svn: 128563
2011-03-31 02:16:51 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
if (uuid.IsValid()) {
|
2016-05-19 13:13:57 +08:00
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
2010-08-03 09:26:16 +08:00
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
if ((*pos)->GetUUID() == uuid) {
|
|
|
|
module_sp = (*pos);
|
|
|
|
break;
|
|
|
|
}
|
2012-03-16 05:01:31 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
|
|
|
return module_sp;
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
size_t
|
2016-09-07 04:57:50 +08:00
|
|
|
ModuleList::FindTypes(const SymbolContext &sc, const ConstString &name,
|
|
|
|
bool name_is_fully_qualified, size_t max_matches,
|
|
|
|
llvm::DenseSet<SymbolFile *> &searched_symbol_files,
|
|
|
|
TypeList &types) const {
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
|
|
|
|
size_t total_matches = 0;
|
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
|
|
|
if (sc.module_sp) {
|
2018-05-01 00:49:04 +08:00
|
|
|
// The symbol context "sc" contains a module so we want to search that one
|
|
|
|
// first if it is in our list...
|
2016-09-07 04:57:50 +08:00
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
if (sc.module_sp.get() == (*pos).get()) {
|
|
|
|
total_matches +=
|
|
|
|
(*pos)->FindTypes(sc, name, name_is_fully_qualified, max_matches,
|
|
|
|
searched_symbol_files, types);
|
|
|
|
|
|
|
|
if (total_matches >= max_matches)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (total_matches < max_matches) {
|
|
|
|
SymbolContext world_sc;
|
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
// Search the module if the module is not equal to the one in the symbol
|
2018-05-01 00:49:04 +08:00
|
|
|
// context "sc". If "sc" contains a empty module shared pointer, then the
|
|
|
|
// comparison will always be true (valid_module_ptr != nullptr).
|
2016-09-07 04:57:50 +08:00
|
|
|
if (sc.module_sp.get() != (*pos).get())
|
|
|
|
total_matches +=
|
|
|
|
(*pos)->FindTypes(world_sc, name, name_is_fully_qualified,
|
|
|
|
max_matches, searched_symbol_files, types);
|
|
|
|
|
|
|
|
if (total_matches >= max_matches)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return total_matches;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool ModuleList::FindSourceFile(const FileSpec &orig_spec,
|
|
|
|
FileSpec &new_spec) const {
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
if ((*pos)->FindSourceFile(orig_spec, new_spec))
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ModuleList::FindAddressesForLine(const lldb::TargetSP target_sp,
|
|
|
|
const FileSpec &file, uint32_t line,
|
|
|
|
Function *function,
|
|
|
|
std::vector<Address> &output_local,
|
|
|
|
std::vector<Address> &output_extern) {
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
(*pos)->FindAddressesForLine(target_sp, file, line, function, output_local,
|
|
|
|
output_extern);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
ModuleSP ModuleList::FindFirstModule(const ModuleSpec &module_spec) const {
|
|
|
|
ModuleSP module_sp;
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
ModuleSP module_sp(*pos);
|
|
|
|
if (module_sp->MatchesModuleSpec(module_spec))
|
|
|
|
return module_sp;
|
|
|
|
}
|
|
|
|
return module_sp;
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
size_t ModuleList::GetSize() const {
|
|
|
|
size_t size = 0;
|
|
|
|
{
|
2016-05-19 13:13:57 +08:00
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
2016-09-07 04:57:50 +08:00
|
|
|
size = m_modules.size();
|
|
|
|
}
|
|
|
|
return size;
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
void ModuleList::Dump(Stream *s) const {
|
|
|
|
// s.Printf("%.*p: ", (int)sizeof(void*) * 2, this);
|
|
|
|
// s.Indent();
|
|
|
|
// s << "ModuleList\n";
|
|
|
|
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
(*pos)->Dump(s);
|
|
|
|
}
|
2010-12-14 10:59:59 +08:00
|
|
|
}
|
2010-06-09 00:52:24 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
void ModuleList::LogUUIDAndPaths(Log *log, const char *prefix_cstr) {
|
|
|
|
if (log != nullptr) {
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
collection::const_iterator pos, begin = m_modules.begin(),
|
|
|
|
end = m_modules.end();
|
|
|
|
for (pos = begin; pos != end; ++pos) {
|
|
|
|
Module *module = pos->get();
|
|
|
|
const FileSpec &module_file_spec = module->GetFileSpec();
|
|
|
|
log->Printf("%s[%u] %s (%s) \"%s\"", prefix_cstr ? prefix_cstr : "",
|
|
|
|
(uint32_t)std::distance(begin, pos),
|
|
|
|
module->GetUUID().GetAsString().c_str(),
|
|
|
|
module->GetArchitecture().GetArchitectureName(),
|
|
|
|
module_file_spec.GetPath().c_str());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool ModuleList::ResolveFileAddress(lldb::addr_t vm_addr,
|
|
|
|
Address &so_addr) const {
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
if ((*pos)->ResolveFileAddress(vm_addr, so_addr))
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2018-10-26 04:45:19 +08:00
|
|
|
uint32_t
|
|
|
|
ModuleList::ResolveSymbolContextForAddress(const Address &so_addr,
|
|
|
|
SymbolContextItem resolve_scope,
|
|
|
|
SymbolContext &sc) const {
|
2016-09-07 04:57:50 +08:00
|
|
|
// The address is already section offset so it has a module
|
|
|
|
uint32_t resolved_flags = 0;
|
|
|
|
ModuleSP module_sp(so_addr.GetModule());
|
|
|
|
if (module_sp) {
|
|
|
|
resolved_flags =
|
|
|
|
module_sp->ResolveSymbolContextForAddress(so_addr, resolve_scope, sc);
|
|
|
|
} else {
|
2016-05-19 13:13:57 +08:00
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
2010-06-09 00:52:24 +08:00
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
2016-09-07 04:57:50 +08:00
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
resolved_flags =
|
|
|
|
(*pos)->ResolveSymbolContextForAddress(so_addr, resolve_scope, sc);
|
|
|
|
if (resolved_flags != 0)
|
|
|
|
break;
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
2010-06-09 00:52:24 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
return resolved_flags;
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
uint32_t ModuleList::ResolveSymbolContextForFilePath(
|
|
|
|
const char *file_path, uint32_t line, bool check_inlines,
|
2018-10-26 04:45:19 +08:00
|
|
|
SymbolContextItem resolve_scope, SymbolContextList &sc_list) const {
|
2016-09-07 04:57:50 +08:00
|
|
|
FileSpec file_spec(file_path, false);
|
|
|
|
return ResolveSymbolContextsForFileSpec(file_spec, line, check_inlines,
|
|
|
|
resolve_scope, sc_list);
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
uint32_t ModuleList::ResolveSymbolContextsForFileSpec(
|
|
|
|
const FileSpec &file_spec, uint32_t line, bool check_inlines,
|
2018-10-26 04:45:19 +08:00
|
|
|
SymbolContextItem resolve_scope, SymbolContextList &sc_list) const {
|
2016-09-07 04:57:50 +08:00
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
collection::const_iterator pos, end = m_modules.end();
|
|
|
|
for (pos = m_modules.begin(); pos != end; ++pos) {
|
|
|
|
(*pos)->ResolveSymbolContextsForFileSpec(file_spec, line, check_inlines,
|
|
|
|
resolve_scope, sc_list);
|
|
|
|
}
|
2010-06-09 00:52:24 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
return sc_list.GetSize();
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
size_t ModuleList::GetIndexForModule(const Module *module) const {
|
|
|
|
if (module) {
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
collection::const_iterator pos;
|
|
|
|
collection::const_iterator begin = m_modules.begin();
|
|
|
|
collection::const_iterator end = m_modules.end();
|
|
|
|
for (pos = begin; pos != end; ++pos) {
|
|
|
|
if ((*pos).get() == module)
|
|
|
|
return std::distance(begin, pos);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return LLDB_INVALID_INDEX32;
|
|
|
|
}
|
|
|
|
|
2018-03-03 06:42:44 +08:00
|
|
|
namespace {
|
|
|
|
struct SharedModuleListInfo {
|
|
|
|
ModuleList module_list;
|
|
|
|
ModuleListProperties module_list_properties;
|
|
|
|
};
|
|
|
|
}
|
|
|
|
static SharedModuleListInfo &GetSharedModuleListInfo()
|
|
|
|
{
|
|
|
|
static SharedModuleListInfo *g_shared_module_list_info = nullptr;
|
2017-02-07 01:55:02 +08:00
|
|
|
static llvm::once_flag g_once_flag;
|
|
|
|
llvm::call_once(g_once_flag, []() {
|
2016-09-07 04:57:50 +08:00
|
|
|
// NOTE: Intentionally leak the module list so a program doesn't have to
|
|
|
|
// cleanup all modules and object files as it exits. This just wastes time
|
|
|
|
// doing a bunch of cleanup that isn't required.
|
2018-03-03 06:42:44 +08:00
|
|
|
if (g_shared_module_list_info == nullptr)
|
|
|
|
g_shared_module_list_info = new SharedModuleListInfo();
|
2016-09-07 04:57:50 +08:00
|
|
|
});
|
2018-03-03 06:42:44 +08:00
|
|
|
return *g_shared_module_list_info;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ModuleList &GetSharedModuleList() {
|
|
|
|
return GetSharedModuleListInfo().module_list;
|
|
|
|
}
|
|
|
|
|
|
|
|
ModuleListProperties &ModuleList::GetGlobalModuleListProperties() {
|
|
|
|
return GetSharedModuleListInfo().module_list_properties;
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
bool ModuleList::ModuleIsInCache(const Module *module_ptr) {
|
|
|
|
if (module_ptr) {
|
|
|
|
ModuleList &shared_module_list = GetSharedModuleList();
|
|
|
|
return shared_module_list.FindModule(module_ptr).get() != nullptr;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t ModuleList::FindSharedModules(const ModuleSpec &module_spec,
|
|
|
|
ModuleList &matching_module_list) {
|
|
|
|
return GetSharedModuleList().FindModules(module_spec, matching_module_list);
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t ModuleList::RemoveOrphanSharedModules(bool mandatory) {
|
|
|
|
return GetSharedModuleList().RemoveOrphans(mandatory);
|
|
|
|
}
|
|
|
|
|
2017-05-12 12:51:55 +08:00
|
|
|
Status ModuleList::GetSharedModule(const ModuleSpec &module_spec,
|
|
|
|
ModuleSP &module_sp,
|
|
|
|
const FileSpecList *module_search_paths_ptr,
|
|
|
|
ModuleSP *old_module_sp_ptr,
|
|
|
|
bool *did_create_ptr, bool always_create) {
|
2016-09-07 04:57:50 +08:00
|
|
|
ModuleList &shared_module_list = GetSharedModuleList();
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(
|
|
|
|
shared_module_list.m_modules_mutex);
|
|
|
|
char path[PATH_MAX];
|
|
|
|
|
2017-05-12 12:51:55 +08:00
|
|
|
Status error;
|
2016-09-07 04:57:50 +08:00
|
|
|
|
|
|
|
module_sp.reset();
|
|
|
|
|
|
|
|
if (did_create_ptr)
|
|
|
|
*did_create_ptr = false;
|
|
|
|
if (old_module_sp_ptr)
|
|
|
|
old_module_sp_ptr->reset();
|
|
|
|
|
|
|
|
const UUID *uuid_ptr = module_spec.GetUUIDPtr();
|
|
|
|
const FileSpec &module_file_spec = module_spec.GetFileSpec();
|
|
|
|
const ArchSpec &arch = module_spec.GetArchitecture();
|
|
|
|
|
|
|
|
// Make sure no one else can try and get or create a module while this
|
2018-05-01 00:49:04 +08:00
|
|
|
// function is actively working on it by doing an extra lock on the global
|
|
|
|
// mutex list.
|
2016-09-07 04:57:50 +08:00
|
|
|
if (!always_create) {
|
|
|
|
ModuleList matching_module_list;
|
|
|
|
const size_t num_matching_modules =
|
|
|
|
shared_module_list.FindModules(module_spec, matching_module_list);
|
|
|
|
if (num_matching_modules > 0) {
|
|
|
|
for (size_t module_idx = 0; module_idx < num_matching_modules;
|
|
|
|
++module_idx) {
|
|
|
|
module_sp = matching_module_list.GetModuleAtIndex(module_idx);
|
|
|
|
|
|
|
|
// Make sure the file for the module hasn't been modified
|
|
|
|
if (module_sp->FileHasChanged()) {
|
|
|
|
if (old_module_sp_ptr && !*old_module_sp_ptr)
|
|
|
|
*old_module_sp_ptr = module_sp;
|
|
|
|
|
|
|
|
Log *log(lldb_private::GetLogIfAnyCategoriesSet(LIBLLDB_LOG_MODULES));
|
|
|
|
if (log != nullptr)
|
|
|
|
log->Printf("module changed: %p, removing from global module list",
|
|
|
|
static_cast<void *>(module_sp.get()));
|
|
|
|
|
|
|
|
shared_module_list.Remove(module_sp);
|
|
|
|
module_sp.reset();
|
|
|
|
} else {
|
2018-05-01 00:49:04 +08:00
|
|
|
// The module matches and the module was not modified from when it
|
|
|
|
// was last loaded.
|
2016-09-07 04:57:50 +08:00
|
|
|
return error;
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
2010-06-09 00:52:24 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
if (module_sp)
|
|
|
|
return error;
|
2010-06-09 00:52:24 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
module_sp.reset(new Module(module_spec));
|
2018-05-01 00:49:04 +08:00
|
|
|
// Make sure there are a module and an object file since we can specify a
|
|
|
|
// valid file path with an architecture that might not be in that file. By
|
|
|
|
// getting the object file we can guarantee that the architecture matches
|
2016-09-07 04:57:50 +08:00
|
|
|
if (module_sp->GetObjectFile()) {
|
2018-05-01 00:49:04 +08:00
|
|
|
// If we get in here we got the correct arch, now we just need to verify
|
|
|
|
// the UUID if one was given
|
2016-09-07 04:57:50 +08:00
|
|
|
if (uuid_ptr && *uuid_ptr != module_sp->GetUUID()) {
|
|
|
|
module_sp.reset();
|
|
|
|
} else {
|
|
|
|
if (module_sp->GetObjectFile() &&
|
|
|
|
module_sp->GetObjectFile()->GetType() ==
|
|
|
|
ObjectFile::eTypeStubLibrary) {
|
|
|
|
module_sp.reset();
|
|
|
|
} else {
|
|
|
|
if (did_create_ptr) {
|
|
|
|
*did_create_ptr = true;
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
shared_module_list.ReplaceEquivalent(module_sp);
|
2012-02-26 13:51:37 +08:00
|
|
|
return error;
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
module_sp.reset();
|
|
|
|
}
|
|
|
|
|
|
|
|
if (module_search_paths_ptr) {
|
|
|
|
const auto num_directories = module_search_paths_ptr->GetSize();
|
|
|
|
for (size_t idx = 0; idx < num_directories; ++idx) {
|
|
|
|
auto search_path_spec = module_search_paths_ptr->GetFileSpecAtIndex(idx);
|
|
|
|
if (!search_path_spec.ResolvePath())
|
|
|
|
continue;
|
2017-03-09 01:56:08 +08:00
|
|
|
namespace fs = llvm::sys::fs;
|
|
|
|
if (!fs::is_directory(search_path_spec.GetPath()))
|
2016-09-07 04:57:50 +08:00
|
|
|
continue;
|
|
|
|
search_path_spec.AppendPathComponent(
|
|
|
|
module_spec.GetFileSpec().GetFilename().AsCString());
|
|
|
|
if (!search_path_spec.Exists())
|
|
|
|
continue;
|
|
|
|
|
|
|
|
auto resolved_module_spec(module_spec);
|
|
|
|
resolved_module_spec.GetFileSpec() = search_path_spec;
|
|
|
|
module_sp.reset(new Module(resolved_module_spec));
|
|
|
|
if (module_sp->GetObjectFile()) {
|
2018-05-01 00:49:04 +08:00
|
|
|
// If we get in here we got the correct arch, now we just need to
|
|
|
|
// verify the UUID if one was given
|
2016-09-07 04:57:50 +08:00
|
|
|
if (uuid_ptr && *uuid_ptr != module_sp->GetUUID()) {
|
|
|
|
module_sp.reset();
|
|
|
|
} else {
|
|
|
|
if (module_sp->GetObjectFile()->GetType() ==
|
|
|
|
ObjectFile::eTypeStubLibrary) {
|
2015-03-17 07:44:30 +08:00
|
|
|
module_sp.reset();
|
2016-09-07 04:57:50 +08:00
|
|
|
} else {
|
|
|
|
if (did_create_ptr)
|
|
|
|
*did_create_ptr = true;
|
|
|
|
|
|
|
|
shared_module_list.ReplaceEquivalent(module_sp);
|
2017-05-12 12:51:55 +08:00
|
|
|
return Status();
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
2015-10-22 11:50:28 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
} else {
|
2015-03-17 07:44:30 +08:00
|
|
|
module_sp.reset();
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Either the file didn't exist where at the path, or no path was given, so
|
|
|
|
// we now have to use more extreme measures to try and find the appropriate
|
|
|
|
// module.
|
|
|
|
|
2018-05-01 00:49:04 +08:00
|
|
|
// Fixup the incoming path in case the path points to a valid file, yet the
|
|
|
|
// arch or UUID (if one was passed in) don't match.
|
2016-09-07 04:57:50 +08:00
|
|
|
ModuleSpec located_binary_modulespec =
|
|
|
|
Symbols::LocateExecutableObjectFile(module_spec);
|
|
|
|
|
|
|
|
// Don't look for the file if it appears to be the same one we already
|
|
|
|
// checked for above...
|
|
|
|
if (located_binary_modulespec.GetFileSpec() != module_file_spec) {
|
|
|
|
if (!located_binary_modulespec.GetFileSpec().Exists()) {
|
|
|
|
located_binary_modulespec.GetFileSpec().GetPath(path, sizeof(path));
|
|
|
|
if (path[0] == '\0')
|
|
|
|
module_file_spec.GetPath(path, sizeof(path));
|
|
|
|
// How can this check ever be true? This branch it is false, and we
|
|
|
|
// haven't modified file_spec.
|
|
|
|
if (located_binary_modulespec.GetFileSpec().Exists()) {
|
|
|
|
std::string uuid_str;
|
|
|
|
if (uuid_ptr && uuid_ptr->IsValid())
|
|
|
|
uuid_str = uuid_ptr->GetAsString();
|
|
|
|
|
|
|
|
if (arch.IsValid()) {
|
|
|
|
if (!uuid_str.empty())
|
|
|
|
error.SetErrorStringWithFormat(
|
|
|
|
"'%s' does not contain the %s architecture and UUID %s", path,
|
|
|
|
arch.GetArchitectureName(), uuid_str.c_str());
|
|
|
|
else
|
|
|
|
error.SetErrorStringWithFormat(
|
|
|
|
"'%s' does not contain the %s architecture.", path,
|
|
|
|
arch.GetArchitectureName());
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
} else {
|
|
|
|
error.SetErrorStringWithFormat("'%s' does not exist", path);
|
|
|
|
}
|
|
|
|
if (error.Fail())
|
|
|
|
module_sp.reset();
|
|
|
|
return error;
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
// Make sure no one else can try and get or create a module while this
|
2018-05-01 00:49:04 +08:00
|
|
|
// function is actively working on it by doing an extra lock on the global
|
|
|
|
// mutex list.
|
2016-09-07 04:57:50 +08:00
|
|
|
ModuleSpec platform_module_spec(module_spec);
|
|
|
|
platform_module_spec.GetFileSpec() =
|
|
|
|
located_binary_modulespec.GetFileSpec();
|
|
|
|
platform_module_spec.GetPlatformFileSpec() =
|
|
|
|
located_binary_modulespec.GetFileSpec();
|
|
|
|
platform_module_spec.GetSymbolFileSpec() =
|
|
|
|
located_binary_modulespec.GetSymbolFileSpec();
|
|
|
|
ModuleList matching_module_list;
|
|
|
|
if (shared_module_list.FindModules(platform_module_spec,
|
|
|
|
matching_module_list) > 0) {
|
|
|
|
module_sp = matching_module_list.GetModuleAtIndex(0);
|
|
|
|
|
|
|
|
// If we didn't have a UUID in mind when looking for the object file,
|
|
|
|
// then we should make sure the modification time hasn't changed!
|
|
|
|
if (platform_module_spec.GetUUIDPtr() == nullptr) {
|
2016-11-09 22:04:08 +08:00
|
|
|
auto file_spec_mod_time = FileSystem::GetModificationTime(
|
|
|
|
located_binary_modulespec.GetFileSpec());
|
|
|
|
if (file_spec_mod_time != llvm::sys::TimePoint<>()) {
|
2016-09-07 04:57:50 +08:00
|
|
|
if (file_spec_mod_time != module_sp->GetModificationTime()) {
|
|
|
|
if (old_module_sp_ptr)
|
|
|
|
*old_module_sp_ptr = module_sp;
|
|
|
|
shared_module_list.Remove(module_sp);
|
|
|
|
module_sp.reset();
|
|
|
|
}
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!module_sp) {
|
|
|
|
module_sp.reset(new Module(platform_module_spec));
|
2018-05-01 00:49:04 +08:00
|
|
|
// Make sure there are a module and an object file since we can specify a
|
|
|
|
// valid file path with an architecture that might not be in that file.
|
2016-09-07 04:57:50 +08:00
|
|
|
// By getting the object file we can guarantee that the architecture
|
|
|
|
// matches
|
|
|
|
if (module_sp && module_sp->GetObjectFile()) {
|
|
|
|
if (module_sp->GetObjectFile()->GetType() ==
|
|
|
|
ObjectFile::eTypeStubLibrary) {
|
|
|
|
module_sp.reset();
|
|
|
|
} else {
|
|
|
|
if (did_create_ptr)
|
|
|
|
*did_create_ptr = true;
|
|
|
|
|
|
|
|
shared_module_list.ReplaceEquivalent(module_sp);
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
} else {
|
|
|
|
located_binary_modulespec.GetFileSpec().GetPath(path, sizeof(path));
|
|
|
|
|
|
|
|
if (located_binary_modulespec.GetFileSpec()) {
|
|
|
|
if (arch.IsValid())
|
|
|
|
error.SetErrorStringWithFormat(
|
|
|
|
"unable to open %s architecture in '%s'",
|
|
|
|
arch.GetArchitectureName(), path);
|
|
|
|
else
|
|
|
|
error.SetErrorStringWithFormat("unable to open '%s'", path);
|
|
|
|
} else {
|
|
|
|
std::string uuid_str;
|
|
|
|
if (uuid_ptr && uuid_ptr->IsValid())
|
|
|
|
uuid_str = uuid_ptr->GetAsString();
|
|
|
|
|
|
|
|
if (!uuid_str.empty())
|
|
|
|
error.SetErrorStringWithFormat(
|
|
|
|
"cannot locate a module for UUID '%s'", uuid_str.c_str());
|
|
|
|
else
|
|
|
|
error.SetErrorStringWithFormat("cannot locate a module");
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
2010-06-09 00:52:24 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
return error;
|
2010-06-09 00:52:24 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
bool ModuleList::RemoveSharedModule(lldb::ModuleSP &module_sp) {
|
|
|
|
return GetSharedModuleList().Remove(module_sp);
|
2011-03-15 11:56:33 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
bool ModuleList::RemoveSharedModuleIfOrphaned(const Module *module_ptr) {
|
|
|
|
return GetSharedModuleList().RemoveIfOrphaned(module_ptr);
|
2012-05-18 02:38:42 +08:00
|
|
|
}
|
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
bool ModuleList::LoadScriptingResourcesInTarget(Target *target,
|
2017-05-12 12:51:55 +08:00
|
|
|
std::list<Status> &errors,
|
2016-09-07 04:57:50 +08:00
|
|
|
Stream *feedback_stream,
|
|
|
|
bool continue_on_error) {
|
|
|
|
if (!target)
|
|
|
|
return false;
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
for (auto module : m_modules) {
|
2017-05-12 12:51:55 +08:00
|
|
|
Status error;
|
2016-09-07 04:57:50 +08:00
|
|
|
if (module) {
|
|
|
|
if (!module->LoadScriptingResourceInTarget(target, error,
|
|
|
|
feedback_stream)) {
|
|
|
|
if (error.Fail() && error.AsCString()) {
|
|
|
|
error.SetErrorStringWithFormat("unable to load scripting data for "
|
|
|
|
"module %s - error reported was %s",
|
|
|
|
module->GetFileSpec()
|
|
|
|
.GetFileNameStrippingExtension()
|
|
|
|
.GetCString(),
|
|
|
|
error.AsCString());
|
|
|
|
errors.push_back(error);
|
|
|
|
|
|
|
|
if (!continue_on_error)
|
|
|
|
return false;
|
2013-05-21 06:29:23 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
2013-05-21 06:29:23 +08:00
|
|
|
}
|
2016-09-07 04:57:50 +08:00
|
|
|
}
|
|
|
|
return errors.empty();
|
2013-05-21 06:29:23 +08:00
|
|
|
}
|
2015-02-13 09:19:24 +08:00
|
|
|
|
2016-09-07 04:57:50 +08:00
|
|
|
void ModuleList::ForEach(
|
|
|
|
std::function<bool(const ModuleSP &module_sp)> const &callback) const {
|
|
|
|
std::lock_guard<std::recursive_mutex> guard(m_modules_mutex);
|
|
|
|
for (const auto &module : m_modules) {
|
|
|
|
// If the callback returns false, then stop iterating and break out
|
|
|
|
if (!callback(module))
|
|
|
|
break;
|
|
|
|
}
|
2015-02-13 09:19:24 +08:00
|
|
|
}
|