|
36 | 36 | #include "llvm/Support/LEB128.h" |
37 | 37 | #include "llvm/Support/Path.h" |
38 | 38 | #include "llvm/Support/ThreadPool.h" |
39 | | -#include <iostream> |
40 | 39 | #include <vector> |
41 | 40 |
|
42 | 41 | namespace llvm { |
@@ -2360,16 +2359,6 @@ void DWARFLinker::DIECloner::generateLineTableForUnit(CompileUnit &Unit) { |
2360 | 2359 | LineTableMapping[DummyKey] = DummyVal; |
2361 | 2360 | SmallVector<uint64_t> SortedLineTableKeys(LineTableMapping.keys()); |
2362 | 2361 | llvm::sort(SortedLineTableKeys); |
2363 | | - for (auto Key : SortedLineTableKeys) { |
2364 | | - std::cout << std::hex << Key << " " << LineTableMapping[Key] |
2365 | | - << "\n"; |
2366 | | - } |
2367 | | - for (auto StmtAttr : StmtAttrs) { |
2368 | | - std::cout << std::hex << StmtAttr.get() << "\n"; |
2369 | | - } |
2370 | | - for (auto Row : SeqStartRows) { |
2371 | | - std::cout << std::hex << Row << "\n"; |
2372 | | - } |
2373 | 2362 |
|
2374 | 2363 | size_t StmtAttrIdx = 0, SeqStartIdx = 0; |
2375 | 2364 | size_t NextSeqOff = 0; |
@@ -2410,22 +2399,6 @@ void DWARFLinker::DIECloner::generateLineTableForUnit(CompileUnit &Unit) { |
2410 | 2399 | // on. |
2411 | 2400 | SeqOffToOrigRow[NextSeqOff] = NextRow; |
2412 | 2401 | } |
2413 | | - // size_t i = 0, j = 0; |
2414 | | - // while (i < StmtAttrs.size() && j < SeqStartRows.size()) { |
2415 | | - // auto It = SeqOffToOrigRow.find(StmtAttrs[i].get()); |
2416 | | - // // The match is not set, use current result. |
2417 | | - // if (It == SeqOffToOrigRow.end()) { |
2418 | | - // SeqOffToOrigRow.try_emplace(StmtAttrs[i].get(), |
2419 | | - // SeqStartRows[j]); |
2420 | | - // } else { |
2421 | | - // while (It->second != SeqStartRows[j] && j < |
2422 | | - // SeqStartRows.size()) { |
2423 | | - // ++j; |
2424 | | - // } |
2425 | | - // } |
2426 | | - // ++i; |
2427 | | - // ++j; |
2428 | | - // } |
2429 | 2402 | } |
2430 | 2403 |
|
2431 | 2404 | // Create a map of original row indices to new row indices. |
|
0 commit comments