diff options
| author | Johnny Chen <johnny.chen@apple.com> | 2011-04-18 22:11:31 +0000 |
|---|---|---|
| committer | Johnny Chen <johnny.chen@apple.com> | 2011-04-18 22:11:31 +0000 |
| commit | a6ca9fb4072d32381079c3c699978bb1271bc3c9 (patch) | |
| tree | 354861968d5f3b7a2ada7dc5c269944a3770b994 | |
| parent | ddac5dd269f7223857941afe9d29a3cccab9f083 (diff) | |
| download | bcm5719-llvm-a6ca9fb4072d32381079c3c699978bb1271bc3c9.tar.gz bcm5719-llvm-a6ca9fb4072d32381079c3c699978bb1271bc3c9.zip | |
Rename some variables, no functionality change.
llvm-svn: 129724
| -rw-r--r-- | lldb/source/Plugins/SymbolFile/DWARF/DWARFDebugAranges.cpp | 15 |
1 files changed, 7 insertions, 8 deletions
diff --git a/lldb/source/Plugins/SymbolFile/DWARF/DWARFDebugAranges.cpp b/lldb/source/Plugins/SymbolFile/DWARF/DWARFDebugAranges.cpp index 89d0d4a90f2..ebc3fdcd4f3 100644 --- a/lldb/source/Plugins/SymbolFile/DWARF/DWARFDebugAranges.cpp +++ b/lldb/source/Plugins/SymbolFile/DWARF/DWARFDebugAranges.cpp @@ -292,8 +292,6 @@ DWARFDebugAranges::AppendRange (dw_offset_t offset, dw_addr_t low_pc, dw_addr_t void DWARFDebugAranges::Sort() { - std::vector<size_t> indices; - size_t end; Timer scoped_timer(__PRETTY_FUNCTION__, "%s this = %p", __PRETTY_FUNCTION__, this); @@ -302,8 +300,9 @@ DWARFDebugAranges::Sort() // Merge all neighbouring ranges into a single range and remember the // indices of all ranges merged. - end = m_aranges.size(); - for (size_t merge, cursor = 1; cursor < end; ++cursor) + const size_t old_size = m_aranges.size(); + std::vector<size_t> merged; + for (size_t merge, cursor = 1; cursor < old_size; ++cursor) { merge = cursor - 1; Range &r1 = m_aranges[merge]; @@ -312,18 +311,18 @@ DWARFDebugAranges::Sort() if (r1.hi_pc == r2.lo_pc && r1.offset == r2.offset) { r2.lo_pc = r1.lo_pc; - indices.push_back(merge); + merged.push_back(merge); } } - if (indices.empty()) + if (merged.empty()) return; // Remove the merged ranges by shifting down all the keepers... - size_t new_size = m_aranges.size() - indices.size(); + const size_t new_size = old_size - merged.size(); for (size_t i = 0, src = 0, dst = 0; dst < new_size; ++src, ++dst) { - while (src == indices[i]) { + while (src == merged[i]) { ++src; ++i; } |

