summaryrefslogtreecommitdiffstats
path: root/contrib/llvm/tools/lldb/source/Target/SectionLoadHistory.cpp
diff options
context:
space:
mode:
authordim <dim@FreeBSD.org>2017-04-02 17:24:58 +0000
committerdim <dim@FreeBSD.org>2017-04-02 17:24:58 +0000
commit60b571e49a90d38697b3aca23020d9da42fc7d7f (patch)
tree99351324c24d6cb146b6285b6caffa4d26fce188 /contrib/llvm/tools/lldb/source/Target/SectionLoadHistory.cpp
parentbea1b22c7a9bce1dfdd73e6e5b65bc4752215180 (diff)
downloadFreeBSD-src-60b571e49a90d38697b3aca23020d9da42fc7d7f.zip
FreeBSD-src-60b571e49a90d38697b3aca23020d9da42fc7d7f.tar.gz
Update clang, llvm, lld, lldb, compiler-rt and libc++ to 4.0.0 release:
MFC r309142 (by emaste): Add WITH_LLD_AS_LD build knob If set it installs LLD as /usr/bin/ld. LLD (as of version 3.9) is not capable of linking the world and kernel, but can self-host and link many substantial applications. GNU ld continues to be used for the world and kernel build, regardless of how this knob is set. It is on by default for arm64, and off for all other CPU architectures. Sponsored by: The FreeBSD Foundation MFC r310840: Reapply 310775, now it also builds correctly if lldb is disabled: Move llvm-objdump from CLANG_EXTRAS to installed by default We currently install three tools from binutils 2.17.50: as, ld, and objdump. Work is underway to migrate to a permissively-licensed tool-chain, with one goal being the retirement of binutils 2.17.50. LLVM's llvm-objdump is intended to be compatible with GNU objdump although it is currently missing some options and may have formatting differences. Enable it by default for testing and further investigation. It may later be changed to install as /usr/bin/objdump, it becomes a fully viable replacement. Reviewed by: emaste Differential Revision: https://reviews.freebsd.org/D8879 MFC r312855 (by emaste): Rename LLD_AS_LD to LLD_IS_LD, for consistency with CLANG_IS_CC Reported by: Dan McGregor <dan.mcgregor usask.ca> MFC r313559 | glebius | 2017-02-10 18:34:48 +0100 (Fri, 10 Feb 2017) | 5 lines Don't check struct rtentry on FreeBSD, it is an internal kernel structure. On other systems it may be API structure for SIOCADDRT/SIOCDELRT. Reviewed by: emaste, dim MFC r314152 (by jkim): Remove an assembler flag, which is redundant since r309124. The upstream took care of it by introducing a macro NO_EXEC_STACK_DIRECTIVE. http://llvm.org/viewvc/llvm-project?rev=273500&view=rev Reviewed by: dim MFC r314564: Upgrade our copies of clang, llvm, lld, lldb, compiler-rt and libc++ to 4.0.0 (branches/release_40 296509). The release will follow soon. Please note that from 3.5.0 onwards, clang, llvm and lldb require C++11 support to build; see UPDATING for more information. Also note that as of 4.0.0, lld should be able to link the base system on amd64 and aarch64. See the WITH_LLD_IS_LLD setting in src.conf(5). Though please be aware that this is work in progress. Release notes for llvm, clang and lld will be available here: <http://releases.llvm.org/4.0.0/docs/ReleaseNotes.html> <http://releases.llvm.org/4.0.0/tools/clang/docs/ReleaseNotes.html> <http://releases.llvm.org/4.0.0/tools/lld/docs/ReleaseNotes.html> Thanks to Ed Maste, Jan Beich, Antoine Brodin and Eric Fiselier for their help. Relnotes: yes Exp-run: antoine PR: 215969, 216008 MFC r314708: For now, revert r287232 from upstream llvm trunk (by Daniil Fukalov): [SCEV] limit recursion depth of CompareSCEVComplexity Summary: CompareSCEVComplexity goes too deep (50+ on a quite a big unrolled loop) and runs almost infinite time. Added cache of "equal" SCEV pairs to earlier cutoff of further estimation. Recursion depth limit was also introduced as a parameter. Reviewers: sanjoy Subscribers: mzolotukhin, tstellarAMD, llvm-commits Differential Revision: https://reviews.llvm.org/D26389 This commit is the cause of excessive compile times on skein_block.c (and possibly other files) during kernel builds on amd64. We never saw the problematic behavior described in this upstream commit, so for now it is better to revert it. An upstream bug has been filed here: https://bugs.llvm.org/show_bug.cgi?id=32142 Reported by: mjg MFC r314795: Reapply r287232 from upstream llvm trunk (by Daniil Fukalov): [SCEV] limit recursion depth of CompareSCEVComplexity Summary: CompareSCEVComplexity goes too deep (50+ on a quite a big unrolled loop) and runs almost infinite time. Added cache of "equal" SCEV pairs to earlier cutoff of further estimation. Recursion depth limit was also introduced as a parameter. Reviewers: sanjoy Subscribers: mzolotukhin, tstellarAMD, llvm-commits Differential Revision: https://reviews.llvm.org/D26389 Pull in r296992 from upstream llvm trunk (by Sanjoy Das): [SCEV] Decrease the recursion threshold for CompareValueComplexity Fixes PR32142. r287232 accidentally increased the recursion threshold for CompareValueComplexity from 2 to 32. This change reverses that change by introducing a separate flag for CompareValueComplexity's threshold. The latter revision fixes the excessive compile times for skein_block.c. MFC r314907 | mmel | 2017-03-08 12:40:27 +0100 (Wed, 08 Mar 2017) | 7 lines Unbreak ARMv6 world. The new compiler_rt library imported with clang 4.0.0 have several fatal issues (non-functional __udivsi3 for example) with ARM specific instrict functions. As temporary workaround, until upstream solve these problems, disable all thumb[1][2] related feature. MFC r315016: Update clang, llvm, lld, lldb, compiler-rt and libc++ to 4.0.0 release. We were already very close to the last release candidate, so this is a pretty minor update. Relnotes: yes MFC r316005: Revert r314907, and pull in r298713 from upstream compiler-rt trunk (by Weiming Zhao): builtins: Select correct code fragments when compiling for Thumb1/Thum2/ARM ISA. Summary: Value of __ARM_ARCH_ISA_THUMB isn't based on the actual compilation mode (-mthumb, -marm), it reflect's capability of given CPU. Due to this: - use __tbumb__ and __thumb2__ insteand of __ARM_ARCH_ISA_THUMB - use '.thumb' directive consistently in all affected files - decorate all thumb functions using DEFINE_COMPILERRT_THUMB_FUNCTION() --------- Note: This patch doesn't fix broken Thumb1 variant of __udivsi3 ! Reviewers: weimingz, rengolin, compnerd Subscribers: aemerson, dim Differential Revision: https://reviews.llvm.org/D30938 Discussed with: mmel
Diffstat (limited to 'contrib/llvm/tools/lldb/source/Target/SectionLoadHistory.cpp')
-rw-r--r--contrib/llvm/tools/lldb/source/Target/SectionLoadHistory.cpp257
1 files changed, 125 insertions, 132 deletions
diff --git a/contrib/llvm/tools/lldb/source/Target/SectionLoadHistory.cpp b/contrib/llvm/tools/lldb/source/Target/SectionLoadHistory.cpp
index 196d5b0..49a7cef 100644
--- a/contrib/llvm/tools/lldb/source/Target/SectionLoadHistory.cpp
+++ b/contrib/llvm/tools/lldb/source/Target/SectionLoadHistory.cpp
@@ -19,161 +19,154 @@
using namespace lldb;
using namespace lldb_private;
-
-bool
-SectionLoadHistory::IsEmpty() const
-{
- std::lock_guard<std::recursive_mutex> guard(m_mutex);
- return m_stop_id_to_section_load_list.empty();
+bool SectionLoadHistory::IsEmpty() const {
+ std::lock_guard<std::recursive_mutex> guard(m_mutex);
+ return m_stop_id_to_section_load_list.empty();
}
-void
-SectionLoadHistory::Clear ()
-{
- std::lock_guard<std::recursive_mutex> guard(m_mutex);
- m_stop_id_to_section_load_list.clear();
+void SectionLoadHistory::Clear() {
+ std::lock_guard<std::recursive_mutex> guard(m_mutex);
+ m_stop_id_to_section_load_list.clear();
}
-uint32_t
-SectionLoadHistory::GetLastStopID() const
-{
- std::lock_guard<std::recursive_mutex> guard(m_mutex);
- if (m_stop_id_to_section_load_list.empty())
- return 0;
- else
- return m_stop_id_to_section_load_list.rbegin()->first;
+uint32_t SectionLoadHistory::GetLastStopID() const {
+ std::lock_guard<std::recursive_mutex> guard(m_mutex);
+ if (m_stop_id_to_section_load_list.empty())
+ return 0;
+ else
+ return m_stop_id_to_section_load_list.rbegin()->first;
}
SectionLoadList *
-SectionLoadHistory::GetSectionLoadListForStopID (uint32_t stop_id, bool read_only)
-{
- if (!m_stop_id_to_section_load_list.empty())
- {
- if (read_only)
- {
- // The section load list is for reading data only so we don't need to create
- // a new SectionLoadList for the current stop ID, just return the section
- // load list for the stop ID that is equal to or less than the current stop ID
- if (stop_id == eStopIDNow)
- {
- // If we are asking for the latest and greatest value, it is always
- // at the end of our list because that will be the highest stop ID.
- StopIDToSectionLoadList::reverse_iterator rpos = m_stop_id_to_section_load_list.rbegin();
- return rpos->second.get();
- }
- else
- {
- StopIDToSectionLoadList::iterator pos = m_stop_id_to_section_load_list.lower_bound(stop_id);
- if (pos != m_stop_id_to_section_load_list.end() && pos->first == stop_id)
- return pos->second.get();
- else if (pos != m_stop_id_to_section_load_list.begin())
- {
- --pos;
- return pos->second.get();
- }
- }
- }
- else
- {
- // You can only use "eStopIDNow" when reading from the section load history
- assert(stop_id != eStopIDNow);
-
- // We are updating the section load list (not read only), so if the stop ID
- // passed in isn't the same as the last stop ID in our collection, then create
- // a new node using the current stop ID
- StopIDToSectionLoadList::iterator pos = m_stop_id_to_section_load_list.lower_bound(stop_id);
- if (pos != m_stop_id_to_section_load_list.end() && pos->first == stop_id)
- {
- // We already have an entry for this value
- return pos->second.get();
- }
-
- // We must make a new section load list that is based on the last valid
- // section load list, so here we copy the last section load list and add
- // a new node for the current stop ID.
- StopIDToSectionLoadList::reverse_iterator rpos = m_stop_id_to_section_load_list.rbegin();
- SectionLoadListSP section_load_list_sp(new SectionLoadList(*rpos->second.get()));
- m_stop_id_to_section_load_list[stop_id] = section_load_list_sp;
- return section_load_list_sp.get();
+SectionLoadHistory::GetSectionLoadListForStopID(uint32_t stop_id,
+ bool read_only) {
+ if (!m_stop_id_to_section_load_list.empty()) {
+ if (read_only) {
+ // The section load list is for reading data only so we don't need to
+ // create
+ // a new SectionLoadList for the current stop ID, just return the section
+ // load list for the stop ID that is equal to or less than the current
+ // stop ID
+ if (stop_id == eStopIDNow) {
+ // If we are asking for the latest and greatest value, it is always
+ // at the end of our list because that will be the highest stop ID.
+ StopIDToSectionLoadList::reverse_iterator rpos =
+ m_stop_id_to_section_load_list.rbegin();
+ return rpos->second.get();
+ } else {
+ StopIDToSectionLoadList::iterator pos =
+ m_stop_id_to_section_load_list.lower_bound(stop_id);
+ if (pos != m_stop_id_to_section_load_list.end() &&
+ pos->first == stop_id)
+ return pos->second.get();
+ else if (pos != m_stop_id_to_section_load_list.begin()) {
+ --pos;
+ return pos->second.get();
}
+ }
+ } else {
+ // You can only use "eStopIDNow" when reading from the section load
+ // history
+ assert(stop_id != eStopIDNow);
+
+ // We are updating the section load list (not read only), so if the stop
+ // ID
+ // passed in isn't the same as the last stop ID in our collection, then
+ // create
+ // a new node using the current stop ID
+ StopIDToSectionLoadList::iterator pos =
+ m_stop_id_to_section_load_list.lower_bound(stop_id);
+ if (pos != m_stop_id_to_section_load_list.end() &&
+ pos->first == stop_id) {
+ // We already have an entry for this value
+ return pos->second.get();
+ }
+
+ // We must make a new section load list that is based on the last valid
+ // section load list, so here we copy the last section load list and add
+ // a new node for the current stop ID.
+ StopIDToSectionLoadList::reverse_iterator rpos =
+ m_stop_id_to_section_load_list.rbegin();
+ SectionLoadListSP section_load_list_sp(
+ new SectionLoadList(*rpos->second.get()));
+ m_stop_id_to_section_load_list[stop_id] = section_load_list_sp;
+ return section_load_list_sp.get();
}
- SectionLoadListSP section_load_list_sp(new SectionLoadList());
- if (stop_id == eStopIDNow)
- stop_id = 0;
- m_stop_id_to_section_load_list[stop_id] = section_load_list_sp;
- return section_load_list_sp.get();
+ }
+ SectionLoadListSP section_load_list_sp(new SectionLoadList());
+ if (stop_id == eStopIDNow)
+ stop_id = 0;
+ m_stop_id_to_section_load_list[stop_id] = section_load_list_sp;
+ return section_load_list_sp.get();
}
-SectionLoadList &
-SectionLoadHistory::GetCurrentSectionLoadList ()
-{
- const bool read_only = true;
- std::lock_guard<std::recursive_mutex> guard(m_mutex);
- SectionLoadList *section_load_list = GetSectionLoadListForStopID (eStopIDNow, read_only);
- assert(section_load_list != NULL);
- return *section_load_list;
+SectionLoadList &SectionLoadHistory::GetCurrentSectionLoadList() {
+ const bool read_only = true;
+ std::lock_guard<std::recursive_mutex> guard(m_mutex);
+ SectionLoadList *section_load_list =
+ GetSectionLoadListForStopID(eStopIDNow, read_only);
+ assert(section_load_list != NULL);
+ return *section_load_list;
}
addr_t
-SectionLoadHistory::GetSectionLoadAddress (uint32_t stop_id, const lldb::SectionSP &section_sp)
-{
- std::lock_guard<std::recursive_mutex> guard(m_mutex);
- const bool read_only = true;
- SectionLoadList *section_load_list = GetSectionLoadListForStopID (stop_id, read_only);
- return section_load_list->GetSectionLoadAddress(section_sp);
+SectionLoadHistory::GetSectionLoadAddress(uint32_t stop_id,
+ const lldb::SectionSP &section_sp) {
+ std::lock_guard<std::recursive_mutex> guard(m_mutex);
+ const bool read_only = true;
+ SectionLoadList *section_load_list =
+ GetSectionLoadListForStopID(stop_id, read_only);
+ return section_load_list->GetSectionLoadAddress(section_sp);
}
-bool
-SectionLoadHistory::ResolveLoadAddress (uint32_t stop_id, addr_t load_addr, Address &so_addr)
-{
- // First find the top level section that this load address exists in
- std::lock_guard<std::recursive_mutex> guard(m_mutex);
- const bool read_only = true;
- SectionLoadList *section_load_list = GetSectionLoadListForStopID (stop_id, read_only);
- return section_load_list->ResolveLoadAddress (load_addr, so_addr);
+bool SectionLoadHistory::ResolveLoadAddress(uint32_t stop_id, addr_t load_addr,
+ Address &so_addr) {
+ // First find the top level section that this load address exists in
+ std::lock_guard<std::recursive_mutex> guard(m_mutex);
+ const bool read_only = true;
+ SectionLoadList *section_load_list =
+ GetSectionLoadListForStopID(stop_id, read_only);
+ return section_load_list->ResolveLoadAddress(load_addr, so_addr);
}
-bool
-SectionLoadHistory::SetSectionLoadAddress (uint32_t stop_id,
- const lldb::SectionSP &section_sp,
- addr_t load_addr,
- bool warn_multiple)
-{
- std::lock_guard<std::recursive_mutex> guard(m_mutex);
- const bool read_only = false;
- SectionLoadList *section_load_list = GetSectionLoadListForStopID (stop_id, read_only);
- return section_load_list->SetSectionLoadAddress(section_sp, load_addr, warn_multiple);
+bool SectionLoadHistory::SetSectionLoadAddress(
+ uint32_t stop_id, const lldb::SectionSP &section_sp, addr_t load_addr,
+ bool warn_multiple) {
+ std::lock_guard<std::recursive_mutex> guard(m_mutex);
+ const bool read_only = false;
+ SectionLoadList *section_load_list =
+ GetSectionLoadListForStopID(stop_id, read_only);
+ return section_load_list->SetSectionLoadAddress(section_sp, load_addr,
+ warn_multiple);
}
size_t
-SectionLoadHistory::SetSectionUnloaded (uint32_t stop_id, const lldb::SectionSP &section_sp)
-{
- std::lock_guard<std::recursive_mutex> guard(m_mutex);
- const bool read_only = false;
- SectionLoadList *section_load_list = GetSectionLoadListForStopID (stop_id, read_only);
- return section_load_list->SetSectionUnloaded (section_sp);
+SectionLoadHistory::SetSectionUnloaded(uint32_t stop_id,
+ const lldb::SectionSP &section_sp) {
+ std::lock_guard<std::recursive_mutex> guard(m_mutex);
+ const bool read_only = false;
+ SectionLoadList *section_load_list =
+ GetSectionLoadListForStopID(stop_id, read_only);
+ return section_load_list->SetSectionUnloaded(section_sp);
}
-bool
-SectionLoadHistory::SetSectionUnloaded (uint32_t stop_id, const lldb::SectionSP &section_sp, addr_t load_addr)
-{
- std::lock_guard<std::recursive_mutex> guard(m_mutex);
- const bool read_only = false;
- SectionLoadList *section_load_list = GetSectionLoadListForStopID (stop_id, read_only);
- return section_load_list->SetSectionUnloaded (section_sp, load_addr);
+bool SectionLoadHistory::SetSectionUnloaded(uint32_t stop_id,
+ const lldb::SectionSP &section_sp,
+ addr_t load_addr) {
+ std::lock_guard<std::recursive_mutex> guard(m_mutex);
+ const bool read_only = false;
+ SectionLoadList *section_load_list =
+ GetSectionLoadListForStopID(stop_id, read_only);
+ return section_load_list->SetSectionUnloaded(section_sp, load_addr);
}
-void
-SectionLoadHistory::Dump (Stream &s, Target *target)
-{
- std::lock_guard<std::recursive_mutex> guard(m_mutex);
- StopIDToSectionLoadList::iterator pos, end = m_stop_id_to_section_load_list.end();
- for (pos = m_stop_id_to_section_load_list.begin(); pos != end; ++pos)
- {
- s.Printf("StopID = %u:\n", pos->first);
- pos->second->Dump(s, target);
- s.EOL();
- }
+void SectionLoadHistory::Dump(Stream &s, Target *target) {
+ std::lock_guard<std::recursive_mutex> guard(m_mutex);
+ StopIDToSectionLoadList::iterator pos,
+ end = m_stop_id_to_section_load_list.end();
+ for (pos = m_stop_id_to_section_load_list.begin(); pos != end; ++pos) {
+ s.Printf("StopID = %u:\n", pos->first);
+ pos->second->Dump(s, target);
+ s.EOL();
+ }
}
-
-
OpenPOWER on IntegriCloud