|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
gen/lib/Target/AArch64/AArch64GenDisassemblerTables.inc25738 LLVM_DEBUG(dbgs() << Loc << ": OPC_ExtractField(" << Start << ", "
25755 LLVM_DEBUG(dbgs() << Loc << ": OPC_FilterValue(" << Val << ", " << NumToSkip
25776 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckField(" << Start << ", "
25797 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckPredicate(" << PIdx << "): "
25816 LLVM_DEBUG(dbgs() << Loc << ": OPC_Decode: opcode " << Opc
25838 LLVM_DEBUG(dbgs() << Loc << ": OPC_TryDecode: opcode " << Opc
25843 LLVM_DEBUG(dbgs() << (S != MCDisassembler::Fail ? "PASS" : "FAIL") << "\n");
25850 LLVM_DEBUG(dbgs() << "FAIL: continuing at " << (Ptr - DecodeTable) << "\n");
25867 LLVM_DEBUG(dbgs() << Loc << ": OPC_SoftFail: " << (Fail ? "FAIL\n":"PASS\n"));
25871 LLVM_DEBUG(dbgs() << Loc << ": OPC_Fail\n");
gen/lib/Target/AArch64/AArch64GenSubtargetInfo.inc17798 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
17799 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
gen/lib/Target/AMDGPU/AMDGPUGenDisassemblerTables.inc42002 LLVM_DEBUG(dbgs() << Loc << ": OPC_ExtractField(" << Start << ", "
42019 LLVM_DEBUG(dbgs() << Loc << ": OPC_FilterValue(" << Val << ", " << NumToSkip
42040 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckField(" << Start << ", "
42061 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckPredicate(" << PIdx << "): "
42080 LLVM_DEBUG(dbgs() << Loc << ": OPC_Decode: opcode " << Opc
42102 LLVM_DEBUG(dbgs() << Loc << ": OPC_TryDecode: opcode " << Opc
42107 LLVM_DEBUG(dbgs() << (S != MCDisassembler::Fail ? "PASS" : "FAIL") << "\n");
42114 LLVM_DEBUG(dbgs() << "FAIL: continuing at " << (Ptr - DecodeTable) << "\n");
42131 LLVM_DEBUG(dbgs() << Loc << ": OPC_SoftFail: " << (Fail ? "FAIL\n":"PASS\n"));
42135 LLVM_DEBUG(dbgs() << Loc << ": OPC_Fail\n");
gen/lib/Target/AMDGPU/AMDGPUGenSubtargetInfo.inc 657 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
658 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
gen/lib/Target/AMDGPU/R600GenSubtargetInfo.inc 270 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
271 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
gen/lib/Target/ARC/ARCGenDisassemblerTables.inc 1473 LLVM_DEBUG(dbgs() << Loc << ": OPC_ExtractField(" << Start << ", "
1490 LLVM_DEBUG(dbgs() << Loc << ": OPC_FilterValue(" << Val << ", " << NumToSkip
1511 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckField(" << Start << ", "
1532 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckPredicate(" << PIdx << "): "
1551 LLVM_DEBUG(dbgs() << Loc << ": OPC_Decode: opcode " << Opc
1573 LLVM_DEBUG(dbgs() << Loc << ": OPC_TryDecode: opcode " << Opc
1578 LLVM_DEBUG(dbgs() << (S != MCDisassembler::Fail ? "PASS" : "FAIL") << "\n");
1585 LLVM_DEBUG(dbgs() << "FAIL: continuing at " << (Ptr - DecodeTable) << "\n");
1602 LLVM_DEBUG(dbgs() << Loc << ": OPC_SoftFail: " << (Fail ? "FAIL\n":"PASS\n"));
1606 LLVM_DEBUG(dbgs() << Loc << ": OPC_Fail\n");
gen/lib/Target/ARC/ARCGenSubtargetInfo.inc 118 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
119 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
gen/lib/Target/ARM/ARMGenDisassemblerTables.inc21780 LLVM_DEBUG(dbgs() << Loc << ": OPC_ExtractField(" << Start << ", "
21797 LLVM_DEBUG(dbgs() << Loc << ": OPC_FilterValue(" << Val << ", " << NumToSkip
21818 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckField(" << Start << ", "
21839 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckPredicate(" << PIdx << "): "
21858 LLVM_DEBUG(dbgs() << Loc << ": OPC_Decode: opcode " << Opc
21880 LLVM_DEBUG(dbgs() << Loc << ": OPC_TryDecode: opcode " << Opc
21885 LLVM_DEBUG(dbgs() << (S != MCDisassembler::Fail ? "PASS" : "FAIL") << "\n");
21892 LLVM_DEBUG(dbgs() << "FAIL: continuing at " << (Ptr - DecodeTable) << "\n");
21909 LLVM_DEBUG(dbgs() << Loc << ": OPC_SoftFail: " << (Fail ? "FAIL\n":"PASS\n"));
21913 LLVM_DEBUG(dbgs() << Loc << ": OPC_Fail\n");
gen/lib/Target/ARM/ARMGenSubtargetInfo.inc19377 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
19378 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
gen/lib/Target/AVR/AVRGenDisassemblerTables.inc 595 LLVM_DEBUG(dbgs() << Loc << ": OPC_ExtractField(" << Start << ", "
612 LLVM_DEBUG(dbgs() << Loc << ": OPC_FilterValue(" << Val << ", " << NumToSkip
633 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckField(" << Start << ", "
654 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckPredicate(" << PIdx << "): "
673 LLVM_DEBUG(dbgs() << Loc << ": OPC_Decode: opcode " << Opc
695 LLVM_DEBUG(dbgs() << Loc << ": OPC_TryDecode: opcode " << Opc
700 LLVM_DEBUG(dbgs() << (S != MCDisassembler::Fail ? "PASS" : "FAIL") << "\n");
707 LLVM_DEBUG(dbgs() << "FAIL: continuing at " << (Ptr - DecodeTable) << "\n");
724 LLVM_DEBUG(dbgs() << Loc << ": OPC_SoftFail: " << (Fail ? "FAIL\n":"PASS\n"));
728 LLVM_DEBUG(dbgs() << Loc << ": OPC_Fail\n");
gen/lib/Target/AVR/AVRGenSubtargetInfo.inc 466 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
467 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
gen/lib/Target/BPF/BPFGenDisassemblerTables.inc 532 LLVM_DEBUG(dbgs() << Loc << ": OPC_ExtractField(" << Start << ", "
549 LLVM_DEBUG(dbgs() << Loc << ": OPC_FilterValue(" << Val << ", " << NumToSkip
570 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckField(" << Start << ", "
591 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckPredicate(" << PIdx << "): "
610 LLVM_DEBUG(dbgs() << Loc << ": OPC_Decode: opcode " << Opc
632 LLVM_DEBUG(dbgs() << Loc << ": OPC_TryDecode: opcode " << Opc
637 LLVM_DEBUG(dbgs() << (S != MCDisassembler::Fail ? "PASS" : "FAIL") << "\n");
644 LLVM_DEBUG(dbgs() << "FAIL: continuing at " << (Ptr - DecodeTable) << "\n");
661 LLVM_DEBUG(dbgs() << Loc << ": OPC_SoftFail: " << (Fail ? "FAIL\n":"PASS\n"));
665 LLVM_DEBUG(dbgs() << Loc << ": OPC_Fail\n");
gen/lib/Target/BPF/BPFGenSubtargetInfo.inc 136 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
137 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
gen/lib/Target/Hexagon/HexagonGenDisassemblerTables.inc12219 LLVM_DEBUG(dbgs() << Loc << ": OPC_ExtractField(" << Start << ", "
12236 LLVM_DEBUG(dbgs() << Loc << ": OPC_FilterValue(" << Val << ", " << NumToSkip
12257 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckField(" << Start << ", "
12278 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckPredicate(" << PIdx << "): "
12297 LLVM_DEBUG(dbgs() << Loc << ": OPC_Decode: opcode " << Opc
12319 LLVM_DEBUG(dbgs() << Loc << ": OPC_TryDecode: opcode " << Opc
12324 LLVM_DEBUG(dbgs() << (S != MCDisassembler::Fail ? "PASS" : "FAIL") << "\n");
12331 LLVM_DEBUG(dbgs() << "FAIL: continuing at " << (Ptr - DecodeTable) << "\n");
12348 LLVM_DEBUG(dbgs() << Loc << ": OPC_SoftFail: " << (Fail ? "FAIL\n":"PASS\n"));
12352 LLVM_DEBUG(dbgs() << Loc << ": OPC_Fail\n");
gen/lib/Target/Hexagon/HexagonGenSubtargetInfo.inc 4639 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
4640 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
gen/lib/Target/Lanai/LanaiGenDisassemblerTables.inc 473 LLVM_DEBUG(dbgs() << Loc << ": OPC_ExtractField(" << Start << ", "
490 LLVM_DEBUG(dbgs() << Loc << ": OPC_FilterValue(" << Val << ", " << NumToSkip
511 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckField(" << Start << ", "
532 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckPredicate(" << PIdx << "): "
551 LLVM_DEBUG(dbgs() << Loc << ": OPC_Decode: opcode " << Opc
573 LLVM_DEBUG(dbgs() << Loc << ": OPC_TryDecode: opcode " << Opc
578 LLVM_DEBUG(dbgs() << (S != MCDisassembler::Fail ? "PASS" : "FAIL") << "\n");
585 LLVM_DEBUG(dbgs() << "FAIL: continuing at " << (Ptr - DecodeTable) << "\n");
602 LLVM_DEBUG(dbgs() << Loc << ": OPC_SoftFail: " << (Fail ? "FAIL\n":"PASS\n"));
606 LLVM_DEBUG(dbgs() << Loc << ": OPC_Fail\n");
gen/lib/Target/Lanai/LanaiGenSubtargetInfo.inc 199 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
200 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
gen/lib/Target/MSP430/MSP430GenDisassemblerTables.inc 1350 LLVM_DEBUG(dbgs() << Loc << ": OPC_ExtractField(" << Start << ", "
1367 LLVM_DEBUG(dbgs() << Loc << ": OPC_FilterValue(" << Val << ", " << NumToSkip
1388 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckField(" << Start << ", "
1409 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckPredicate(" << PIdx << "): "
1428 LLVM_DEBUG(dbgs() << Loc << ": OPC_Decode: opcode " << Opc
1450 LLVM_DEBUG(dbgs() << Loc << ": OPC_TryDecode: opcode " << Opc
1455 LLVM_DEBUG(dbgs() << (S != MCDisassembler::Fail ? "PASS" : "FAIL") << "\n");
1462 LLVM_DEBUG(dbgs() << "FAIL: continuing at " << (Ptr - DecodeTable) << "\n");
1479 LLVM_DEBUG(dbgs() << Loc << ": OPC_SoftFail: " << (Fail ? "FAIL\n":"PASS\n"));
1483 LLVM_DEBUG(dbgs() << Loc << ": OPC_Fail\n");
gen/lib/Target/MSP430/MSP430GenSubtargetInfo.inc 136 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
137 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
gen/lib/Target/Mips/MipsGenDisassemblerTables.inc10330 LLVM_DEBUG(dbgs() << Loc << ": OPC_ExtractField(" << Start << ", "
10347 LLVM_DEBUG(dbgs() << Loc << ": OPC_FilterValue(" << Val << ", " << NumToSkip
10368 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckField(" << Start << ", "
10389 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckPredicate(" << PIdx << "): "
10408 LLVM_DEBUG(dbgs() << Loc << ": OPC_Decode: opcode " << Opc
10430 LLVM_DEBUG(dbgs() << Loc << ": OPC_TryDecode: opcode " << Opc
10435 LLVM_DEBUG(dbgs() << (S != MCDisassembler::Fail ? "PASS" : "FAIL") << "\n");
10442 LLVM_DEBUG(dbgs() << "FAIL: continuing at " << (Ptr - DecodeTable) << "\n");
10459 LLVM_DEBUG(dbgs() << Loc << ": OPC_SoftFail: " << (Fail ? "FAIL\n":"PASS\n"));
10463 LLVM_DEBUG(dbgs() << Loc << ": OPC_Fail\n");
gen/lib/Target/Mips/MipsGenSubtargetInfo.inc 3793 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
3794 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
gen/lib/Target/NVPTX/NVPTXGenSubtargetInfo.inc 190 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
191 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
gen/lib/Target/PowerPC/PPCGenDisassemblerTables.inc 6580 LLVM_DEBUG(dbgs() << Loc << ": OPC_ExtractField(" << Start << ", "
6597 LLVM_DEBUG(dbgs() << Loc << ": OPC_FilterValue(" << Val << ", " << NumToSkip
6618 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckField(" << Start << ", "
6639 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckPredicate(" << PIdx << "): "
6658 LLVM_DEBUG(dbgs() << Loc << ": OPC_Decode: opcode " << Opc
6680 LLVM_DEBUG(dbgs() << Loc << ": OPC_TryDecode: opcode " << Opc
6685 LLVM_DEBUG(dbgs() << (S != MCDisassembler::Fail ? "PASS" : "FAIL") << "\n");
6692 LLVM_DEBUG(dbgs() << "FAIL: continuing at " << (Ptr - DecodeTable) << "\n");
6709 LLVM_DEBUG(dbgs() << Loc << ": OPC_SoftFail: " << (Fail ? "FAIL\n":"PASS\n"));
6713 LLVM_DEBUG(dbgs() << Loc << ": OPC_Fail\n");
gen/lib/Target/PowerPC/PPCGenSubtargetInfo.inc 8115 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
8116 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
gen/lib/Target/RISCV/RISCVGenDisassemblerTables.inc 1756 LLVM_DEBUG(dbgs() << Loc << ": OPC_ExtractField(" << Start << ", "
1773 LLVM_DEBUG(dbgs() << Loc << ": OPC_FilterValue(" << Val << ", " << NumToSkip
1794 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckField(" << Start << ", "
1815 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckPredicate(" << PIdx << "): "
1834 LLVM_DEBUG(dbgs() << Loc << ": OPC_Decode: opcode " << Opc
1856 LLVM_DEBUG(dbgs() << Loc << ": OPC_TryDecode: opcode " << Opc
1861 LLVM_DEBUG(dbgs() << (S != MCDisassembler::Fail ? "PASS" : "FAIL") << "\n");
1868 LLVM_DEBUG(dbgs() << "FAIL: continuing at " << (Ptr - DecodeTable) << "\n");
1885 LLVM_DEBUG(dbgs() << Loc << ": OPC_SoftFail: " << (Fail ? "FAIL\n":"PASS\n"));
1889 LLVM_DEBUG(dbgs() << Loc << ": OPC_Fail\n");
gen/lib/Target/RISCV/RISCVGenSubtargetInfo.inc 213 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
214 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
gen/lib/Target/Sparc/SparcGenDisassemblerTables.inc 2378 LLVM_DEBUG(dbgs() << Loc << ": OPC_ExtractField(" << Start << ", "
2395 LLVM_DEBUG(dbgs() << Loc << ": OPC_FilterValue(" << Val << ", " << NumToSkip
2416 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckField(" << Start << ", "
2437 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckPredicate(" << PIdx << "): "
2456 LLVM_DEBUG(dbgs() << Loc << ": OPC_Decode: opcode " << Opc
2478 LLVM_DEBUG(dbgs() << Loc << ": OPC_TryDecode: opcode " << Opc
2483 LLVM_DEBUG(dbgs() << (S != MCDisassembler::Fail ? "PASS" : "FAIL") << "\n");
2490 LLVM_DEBUG(dbgs() << "FAIL: continuing at " << (Ptr - DecodeTable) << "\n");
2507 LLVM_DEBUG(dbgs() << Loc << ": OPC_SoftFail: " << (Fail ? "FAIL\n":"PASS\n"));
2511 LLVM_DEBUG(dbgs() << Loc << ": OPC_Fail\n");
gen/lib/Target/Sparc/SparcGenSubtargetInfo.inc 490 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
491 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
gen/lib/Target/SystemZ/SystemZGenDisassemblerTables.inc10751 LLVM_DEBUG(dbgs() << Loc << ": OPC_ExtractField(" << Start << ", "
10768 LLVM_DEBUG(dbgs() << Loc << ": OPC_FilterValue(" << Val << ", " << NumToSkip
10789 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckField(" << Start << ", "
10810 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckPredicate(" << PIdx << "): "
10829 LLVM_DEBUG(dbgs() << Loc << ": OPC_Decode: opcode " << Opc
10851 LLVM_DEBUG(dbgs() << Loc << ": OPC_TryDecode: opcode " << Opc
10856 LLVM_DEBUG(dbgs() << (S != MCDisassembler::Fail ? "PASS" : "FAIL") << "\n");
10863 LLVM_DEBUG(dbgs() << "FAIL: continuing at " << (Ptr - DecodeTable) << "\n");
10880 LLVM_DEBUG(dbgs() << Loc << ": OPC_SoftFail: " << (Fail ? "FAIL\n":"PASS\n"));
10884 LLVM_DEBUG(dbgs() << Loc << ": OPC_Fail\n");
gen/lib/Target/SystemZ/SystemZGenSubtargetInfo.inc 5119 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
5120 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
gen/lib/Target/WebAssembly/WebAssemblyGenSubtargetInfo.inc 148 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
149 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
gen/lib/Target/X86/X86GenSubtargetInfo.inc21345 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
21346 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
gen/lib/Target/XCore/XCoreGenDisassemblerTables.inc 822 LLVM_DEBUG(dbgs() << Loc << ": OPC_ExtractField(" << Start << ", "
839 LLVM_DEBUG(dbgs() << Loc << ": OPC_FilterValue(" << Val << ", " << NumToSkip
860 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckField(" << Start << ", "
881 LLVM_DEBUG(dbgs() << Loc << ": OPC_CheckPredicate(" << PIdx << "): "
900 LLVM_DEBUG(dbgs() << Loc << ": OPC_Decode: opcode " << Opc
922 LLVM_DEBUG(dbgs() << Loc << ": OPC_TryDecode: opcode " << Opc
927 LLVM_DEBUG(dbgs() << (S != MCDisassembler::Fail ? "PASS" : "FAIL") << "\n");
934 LLVM_DEBUG(dbgs() << "FAIL: continuing at " << (Ptr - DecodeTable) << "\n");
951 LLVM_DEBUG(dbgs() << Loc << ": OPC_SoftFail: " << (Fail ? "FAIL\n":"PASS\n"));
955 LLVM_DEBUG(dbgs() << Loc << ": OPC_Fail\n");
gen/lib/Target/XCore/XCoreGenSubtargetInfo.inc 119 LLVM_DEBUG(dbgs() << "\nFeatures:" << FS);
120 LLVM_DEBUG(dbgs() << "\nCPU:" << CPU << "\n\n");
include/llvm/Analysis/BlockFrequencyInfoImpl.h 1034 LLVM_DEBUG(dbgs() << "\nblock-frequency: " << F.getName()
1072 LLVM_DEBUG(dbgs() << "reverse-post-order-traversal\n");
1075 LLVM_DEBUG(dbgs() << " - " << getIndex(I) << ": " << getBlockName(Node)
1087 LLVM_DEBUG(dbgs() << "loop-detection\n");
1105 LLVM_DEBUG(dbgs() << " - loop = " << getBlockName(Header) << "\n");
1134 LLVM_DEBUG(dbgs() << " - loop = " << getBlockName(Header)
1156 LLVM_DEBUG(dbgs() << "compute-mass-in-loop: " << getLoopName(Loop) << "\n");
1159 LLVM_DEBUG(dbgs() << "isIrreducible = true\n");
1171 LLVM_DEBUG(dbgs() << "Missing irr loop header metadata on "
1176 LLVM_DEBUG(dbgs() << getBlockName(HeaderNode)
1200 LLVM_DEBUG(dbgs() << "Giving weight " << MinWeight << " to "
1230 LLVM_DEBUG(dbgs() << "compute-mass-in-function\n");
1282 LLVM_DEBUG(dbgs() << "analyze-irreducible-in-";
1311 LLVM_DEBUG(dbgs() << " - node: " << getBlockName(Node) << "\n");
include/llvm/Analysis/CGSCCPassManager.h 470 LLVM_DEBUG(dbgs() << "Running function passes across an SCC: " << C
646 LLVM_DEBUG(dbgs() << "Found devirtualized call from "
690 LLVM_DEBUG(
698 LLVM_DEBUG(
788 LLVM_DEBUG(dbgs() << "Skipping an invalid RefSCC...\n");
795 LLVM_DEBUG(dbgs() << "Running an SCC pass across the RefSCC: " << *RC
810 LLVM_DEBUG(dbgs() << "Skipping an invalid SCC...\n");
814 LLVM_DEBUG(dbgs() << "Skipping an SCC that is now part of some other "
877 LLVM_DEBUG(dbgs() << "Skipping invalidated root or island SCC!\n");
908 LLVM_DEBUG(dbgs()
include/llvm/Analysis/RegionInfoImpl.h 677 LLVM_DEBUG(region->verifyRegion());
include/llvm/Analysis/SparsePropagation.h 262 LLVM_DEBUG(dbgs() << "Marking Block Executable: " << BB->getName() << "\n");
272 LLVM_DEBUG(dbgs() << "Marking Edge Executable: " << Source->getName()
476 LLVM_DEBUG(dbgs() << "\nPopped off V-WL: " << *V << "\n");
491 LLVM_DEBUG(dbgs() << "\nPopped off BBWL: " << *BB);
include/llvm/CodeGen/GlobalISel/LegalizationArtifactCombiner.h 59 LLVM_DEBUG(dbgs() << ".. Combine MI: " << MI;);
108 LLVM_DEBUG(dbgs() << ".. Combine MI: " << MI;);
148 LLVM_DEBUG(dbgs() << ".. Combine MI: " << MI;);
203 LLVM_DEBUG(dbgs() << ".. Combine G_ANYEXT(G_IMPLICIT_DEF): " << MI;);
210 LLVM_DEBUG(dbgs() << ".. Combine G_[SZ]EXT(G_IMPLICIT_DEF): " << MI;);
526 LLVM_DEBUG(dbgs() << *DeadMI << "Is dead, eagerly deleting\n");
include/llvm/ExecutionEngine/Orc/Core.h 904 LLVM_DEBUG({
include/llvm/ExecutionEngine/Orc/OrcRemoteTargetClient.h 65 LLVM_DEBUG(dbgs() << "Destroyed remote allocator " << Id << "\n");
80 LLVM_DEBUG(dbgs() << "Allocator " << Id << " allocated code for "
93 LLVM_DEBUG(dbgs() << "Allocator " << Id << " allocated ro-data for "
102 LLVM_DEBUG(dbgs() << "Allocator " << Id << " allocated rw-data for "
114 LLVM_DEBUG(dbgs() << "Allocator " << Id << " reserved:\n");
120 LLVM_DEBUG(
131 LLVM_DEBUG(
142 LLVM_DEBUG(
166 LLVM_DEBUG(dbgs() << "Allocator " << Id << " applied mappings:\n");
180 LLVM_DEBUG(dbgs() << "Allocator " << Id << " finalizing:\n");
265 LLVM_DEBUG(dbgs() << "Created remote allocator " << Id << "\n");
274 LLVM_DEBUG(
295 LLVM_DEBUG(dbgs() << " copying section: "
306 LLVM_DEBUG(dbgs() << " setting "
516 LLVM_DEBUG(dbgs() << "Calling int(*)(void) "
525 LLVM_DEBUG(dbgs() << "Calling int(*)(int, char*[]) "
533 LLVM_DEBUG(dbgs() << "Calling void(*)(void) "
include/llvm/ExecutionEngine/Orc/OrcRemoteTargetServer.h 163 LLVM_DEBUG(dbgs() << " Calling " << format("0x%016x", Addr) << "\n");
165 LLVM_DEBUG(dbgs() << " Result = " << Result << "\n");
182 LLVM_DEBUG(for (int Idx = 0; Idx < ArgC; ++Idx) {
186 LLVM_DEBUG(dbgs() << " Calling " << format("0x%016x", Addr) << "\n");
188 LLVM_DEBUG(dbgs() << " Result = " << Result << "\n");
199 LLVM_DEBUG(dbgs() << " Calling " << format("0x%016x", Addr) << "\n");
201 LLVM_DEBUG(dbgs() << " Complete.\n");
211 LLVM_DEBUG(dbgs() << " Created allocator " << Id << "\n");
221 LLVM_DEBUG(dbgs() << " Create indirect stubs owner " << Id << "\n");
228 LLVM_DEBUG(dbgs() << " Registering EH frames at "
241 LLVM_DEBUG(dbgs() << " Destroyed allocator " << Id << "\n");
257 LLVM_DEBUG(dbgs() << " ISMgr " << Id << " request " << NumStubsRequired
329 LLVM_DEBUG(dbgs() << " Symbol '" << Name
341 LLVM_DEBUG(dbgs() << " Remote info:\n"
356 LLVM_DEBUG(dbgs() << " Reading " << Size << " bytes from "
369 LLVM_DEBUG(dbgs() << " Registering EH frames at "
387 LLVM_DEBUG(dbgs() << " Allocator " << Id << " reserved " << LocalAllocAddr
405 LLVM_DEBUG(dbgs() << " Allocator " << Id << " set permissions on "
419 LLVM_DEBUG(dbgs() << " Writing " << DBW.getSize() << " bytes to "
425 LLVM_DEBUG(dbgs() << " Writing pointer *" << format("0x%016x", Addr)
include/llvm/Support/GenericDomTreeConstruction.h 152 LLVM_DEBUG(dbgs() << "\tHiding edge " << BlockNamePrinter(N) << " -> "
159 LLVM_DEBUG(dbgs() << "\tShowing virtual edge " << BlockNamePrinter(N)
399 LLVM_DEBUG(dbgs() << "\t\tLooking for trivial roots\n");
416 LLVM_DEBUG(dbgs() << "Found a new trivial root: " << BlockNamePrinter(N)
418 LLVM_DEBUG(dbgs() << "Last visited node: "
423 LLVM_DEBUG(dbgs() << "\t\tLooking for non-trivial roots\n");
443 LLVM_DEBUG(dbgs()
455 LLVM_DEBUG(dbgs() << "\t\t\tRunning forward DFS\n");
459 LLVM_DEBUG(dbgs() << "\t\t\tFound a new furthest away node "
464 LLVM_DEBUG(dbgs() << "\t\t\tPrev DFSNum: " << Num << ", new DFSNum: "
468 LLVM_DEBUG(dbgs() << "\t\t\t\tRemoving DFS info for "
474 LLVM_DEBUG(dbgs() << "\t\t\tRunning reverse DFS\n");
477 LLVM_DEBUG(dbgs() << "\t\t\t\tfound node "
483 LLVM_DEBUG(dbgs() << "Total: " << Total << ", Num: " << Num << "\n");
484 LLVM_DEBUG(dbgs() << "Discovered CFG nodes:\n");
485 LLVM_DEBUG(for (size_t i = 0; i <= Num; ++i) dbgs()
493 LLVM_DEBUG(dbgs() << "Found roots: ");
494 LLVM_DEBUG(for (auto *Root
497 LLVM_DEBUG(dbgs() << "\n");
513 LLVM_DEBUG(dbgs() << "Removing redundant roots\n");
521 LLVM_DEBUG(dbgs() << "\tChecking if " << BlockNamePrinter(Root)
534 LLVM_DEBUG(dbgs() << "\tForward DFS walk found another root "
577 LLVM_DEBUG(
600 LLVM_DEBUG(dbgs() << "\tdiscovered a new reachable node "
654 LLVM_DEBUG(dbgs() << "Inserting edge " << BlockNamePrinter(From) << " -> "
694 LLVM_DEBUG(dbgs() << "\t\tAfter the insertion, " << BlockNamePrinter(To)
732 LLVM_DEBUG(dbgs() << "Roots are different in updated trees\n"
743 LLVM_DEBUG(dbgs() << "\tReachable " << BlockNamePrinter(From->getBlock())
757 LLVM_DEBUG(dbgs() << "\t\tNCA == " << BlockNamePrinter(NCD) << "\n");
784 LLVM_DEBUG(dbgs() << "Mark " << BlockNamePrinter(TN) <<
805 LLVM_DEBUG(dbgs() << "\tSuccessor " << BlockNamePrinter(Succ)
821 LLVM_DEBUG(dbgs() << "\t\tMarking visited not affected "
830 LLVM_DEBUG(dbgs() << "\t\tAdd " << BlockNamePrinter(Succ)
839 LLVM_DEBUG(dbgs() << " Next: " << BlockNamePrinter(TN) << "\n");
850 LLVM_DEBUG(dbgs() << "Updating NCD = " << BlockNamePrinter(NCD) << "\n");
853 LLVM_DEBUG(dbgs() << "\tIDom(" << BlockNamePrinter(TN)
870 LLVM_DEBUG(dbgs() << "Inserting " << BlockNamePrinter(From)
878 LLVM_DEBUG(dbgs() << "Inserted " << BlockNamePrinter(From)
885 LLVM_DEBUG(dbgs() << "\tInserting discovered connecting edge "
915 LLVM_DEBUG(dbgs() << "After adding unreachable nodes\n");
921 LLVM_DEBUG(dbgs() << "Deleting edge " << BlockNamePrinter(From) << " -> "
942 LLVM_DEBUG(
956 LLVM_DEBUG(dbgs() << "\tNCD " << BlockNamePrinter(NCD) << ", ToIDom "
974 LLVM_DEBUG(dbgs() << "Deleting reachable " << BlockNamePrinter(FromTN)
976 LLVM_DEBUG(dbgs() << "\tRebuilding subtree\n");
989 LLVM_DEBUG(dbgs() << "The entire tree needs to be rebuilt\n");
1000 LLVM_DEBUG(dbgs() << "\tTop of subtree: " << BlockNamePrinter(ToIDomTN)
1005 LLVM_DEBUG(dbgs() << "\tRunning Semi-NCA\n");
1014 LLVM_DEBUG(dbgs() << "IsReachableFromIDom " << BlockNamePrinter(TN)
1018 LLVM_DEBUG(dbgs() << "\tPred " << BlockNamePrinter(Pred) << "\n");
1023 LLVM_DEBUG(dbgs() << "\tSupport " << BlockNamePrinter(Support) << "\n");
1025 LLVM_DEBUG(dbgs() << "\t" << BlockNamePrinter(TN)
1039 LLVM_DEBUG(dbgs() << "Deleting unreachable subtree "
1048 LLVM_DEBUG(dbgs() << "\tDeletion made a region reverse-unreachable\n");
1049 LLVM_DEBUG(dbgs() << "\tAdding new root " << BlockNamePrinter(ToTN)
1087 LLVM_DEBUG(dbgs() << "Processing affected node " << BlockNamePrinter(TN)
1095 LLVM_DEBUG(dbgs() << "The entire tree needs to be rebuilt\n");
1105 LLVM_DEBUG(dbgs() << "Erasing node " << BlockNamePrinter(TN) << "\n");
1113 LLVM_DEBUG(dbgs() << "DeleteUnreachable: running DFS with MinNode = "
1127 LLVM_DEBUG(dbgs() << "Previous IDom(MinNode) = "
1173 LLVM_DEBUG(dbgs() << "Legalizing " << BUI.Updates.size() << " updates\n");
1513 LLVM_DEBUG(dbgs() << "Verifying parent property of node "
1608 LLVM_DEBUG(dbgs() << "Legalizing " << BUI.Updates.size() << " updates\n");
include/llvm/Support/UnicodeCharRanges.h 76 LLVM_DEBUG(dbgs() << "Upper bound 0x");
77 LLVM_DEBUG(dbgs().write_hex(Prev));
78 LLVM_DEBUG(dbgs() << " should be less than succeeding lower bound 0x");
79 LLVM_DEBUG(dbgs().write_hex(I->Lower) << "\n");
83 LLVM_DEBUG(dbgs() << "Upper bound 0x");
84 LLVM_DEBUG(dbgs().write_hex(I->Lower));
85 LLVM_DEBUG(dbgs() << " should not be less than lower bound 0x");
86 LLVM_DEBUG(dbgs().write_hex(I->Upper) << "\n");
include/llvm/Transforms/InstCombine/InstCombineWorklist.h 42 LLVM_DEBUG(dbgs() << "IC: ADD: " << *I << '\n');
59 LLVM_DEBUG(dbgs() << "IC: ADDING: " << List.size()
include/llvm/Transforms/Utils/SSAUpdaterImpl.h 380 LLVM_DEBUG(dbgs() << " Inserted PHI: " << *PHI << "\n");
lib/Analysis/BlockFrequencyInfoImpl.cpp 318 LLVM_DEBUG(debugSuccessor("backedge"));
324 LLVM_DEBUG(debugSuccessor(" exit "));
336 LLVM_DEBUG(debugSuccessor("abort!!!"));
347 LLVM_DEBUG(debugSuccessor(" local "));
367 LLVM_DEBUG(dbgs() << "compute-loop-scale: " << getLoopName(Loop) << "\n");
393 LLVM_DEBUG(dbgs() << " - exit-mass = " << ExitMass << " ("
401 LLVM_DEBUG(dbgs() << "packaging-loop: " << getLoopName(Loop) << "\n");
407 LLVM_DEBUG(dbgs() << " - node: " << getBlockName(M.Index) << "\n");
429 LLVM_DEBUG(dbgs() << " => mass: " << Mass << "\n");
439 LLVM_DEBUG(debugAssign(*this, D, W.TargetNode, Taken, nullptr));
449 LLVM_DEBUG(debugAssign(*this, D, W.TargetNode, Taken, "back"));
456 LLVM_DEBUG(debugAssign(*this, D, W.TargetNode, Taken, "exit"));
484 LLVM_DEBUG(dbgs() << "float-to-int: min = " << Min << ", max = " << Max
489 LLVM_DEBUG(dbgs() << " - " << BFI.getBlockName(Index) << ": float = "
500 LLVM_DEBUG(dbgs() << "unwrap-loop-package: " << BFI.getLoopName(Loop)
505 LLVM_DEBUG(dbgs() << " => combined-scale = " << Loop.Scale << "\n");
515 LLVM_DEBUG(dbgs() << " - " << BFI.getBlockName(N) << ": " << F << " => "
548 LLVM_DEBUG(dump());
703 LLVM_DEBUG(dbgs() << " => entry = " << BFI.getBlockName(Irr.Node)
735 LLVM_DEBUG(dbgs() << " => extra = " << BFI.getBlockName(Irr.Node)
745 LLVM_DEBUG(dbgs() << " => other = " << BFI.getBlockName(Irr.Node) << "\n");
756 LLVM_DEBUG(dbgs() << " - found-scc\n");
817 LLVM_DEBUG(dbgs() << "adjust-loop-header-mass:\n");
821 LLVM_DEBUG(dbgs() << " - Add back edge mass for node "
827 LLVM_DEBUG(dbgs() << " Nothing added. Back edge mass is zero\n");
832 LLVM_DEBUG(dbgs() << " Distribute loop mass " << LoopMass
838 LLVM_DEBUG(debugAssign(*this, D, W.TargetNode, Taken, nullptr));
849 LLVM_DEBUG(debugAssign(*this, D, W.TargetNode, Taken, nullptr));
lib/Analysis/BranchProbabilityInfo.cpp 924 LLVM_DEBUG(dbgs() << "set edge " << Src->getName() << " -> "
951 LLVM_DEBUG(dbgs() << "---- Branch Probability Info : " << F.getName()
970 LLVM_DEBUG(dbgs() << "BPI: SCC " << SccNum << ":");
972 LLVM_DEBUG(dbgs() << " " << BB->getName());
975 LLVM_DEBUG(dbgs() << "\n");
981 LLVM_DEBUG(dbgs() << "Computing probabilities for " << BB->getName()
lib/Analysis/CFLAndersAliasAnalysis.cpp 861 LLVM_DEBUG(
lib/Analysis/CFLSteensAliasAnalysis.cpp 279 LLVM_DEBUG(
lib/Analysis/CGSCCPassManager.cpp 92 LLVM_DEBUG(dbgs() << "Skipping invalidated root or island SCC!\n");
376 LLVM_DEBUG(dbgs() << "Enqueuing the existing SCC in the worklist:" << *C
413 LLVM_DEBUG(dbgs() << "Enqueuing a newly formed SCC:" << NewC << "\n");
538 LLVM_DEBUG(dbgs() << "Deleting outgoing edge from '"
570 LLVM_DEBUG(dbgs() << "Enqueuing a new RefSCC in the update worklist: "
588 LLVM_DEBUG(dbgs() << "Switch outgoing call edge to a ref edge from '" << N
617 LLVM_DEBUG(dbgs() << "Switch outgoing ref edge to a call edge from '" << N
621 LLVM_DEBUG(dbgs() << "Switch an internal ref edge to a call edge from '"
685 LLVM_DEBUG(dbgs() << "Enqueuing the existing SCC in the worklist: " << *C
691 LLVM_DEBUG(dbgs() << "Enqueuing a newly earlier in post-order SCC: "
lib/Analysis/CallGraphSCCPass.cpp 185 LLVM_DEBUG(dbgs() << "CGSCCPASSMGR: Pass Dirtied SCC: " << P->getPassName()
205 LLVM_DEBUG(dbgs() << "CGSCCPASSMGR: Refreshing SCC with " << CurSCC.size()
330 LLVM_DEBUG(dbgs() << " CGSCCPASSMGR: Devirtualized call to '"
386 LLVM_DEBUG(if (MadeChange) {
493 LLVM_DEBUG(if (Iteration) dbgs()
501 LLVM_DEBUG(dbgs() << " CGSCCPASSMGR: Stopped iteration after "
lib/Analysis/CodeMetrics.cpp 62 LLVM_DEBUG(dbgs() << "Ephemeral Value: " << *V << "\n");
lib/Analysis/DemandedBits.cpp 323 LLVM_DEBUG(dbgs() << "DemandedBits: Root: " << I << "\n");
357 LLVM_DEBUG(dbgs() << "DemandedBits: Visiting: " << *UserI);
362 LLVM_DEBUG(dbgs() << " Alive Out: 0x"
369 LLVM_DEBUG(dbgs() << "\n");
lib/Analysis/DependenceAnalysis.cpp 432 LLVM_DEBUG(dbgs() << "\tintersect constraints\n");
433 LLVM_DEBUG(dbgs() << "\t X ="; X->dump(dbgs()));
434 LLVM_DEBUG(dbgs() << "\t Y ="; Y->dump(dbgs()));
450 LLVM_DEBUG(dbgs() << "\t intersect 2 distances\n");
477 LLVM_DEBUG(dbgs() << "\t intersect 2 lines\n");
482 LLVM_DEBUG(dbgs() << "\t\tsame slope\n");
496 LLVM_DEBUG(dbgs() << "\t\tdifferent slopes\n");
518 LLVM_DEBUG(dbgs() << "\t\tXtop = " << Xtop << "\n");
519 LLVM_DEBUG(dbgs() << "\t\tXbot = " << Xbot << "\n");
520 LLVM_DEBUG(dbgs() << "\t\tYtop = " << Ytop << "\n");
521 LLVM_DEBUG(dbgs() << "\t\tYbot = " << Ybot << "\n");
533 LLVM_DEBUG(dbgs() << "\t\tX = " << Xq << ", Y = " << Yq << "\n");
542 LLVM_DEBUG(dbgs() << "\t\tupper bound = " << UpperBound << "\n");
562 LLVM_DEBUG(dbgs() << "\t intersect Point and Line\n");
1101 LLVM_DEBUG(dbgs() << " src = " << *Src << "\n");
1102 LLVM_DEBUG(dbgs() << " dst = " << *Dst << "\n");
1105 LLVM_DEBUG(dbgs() << " provably dependent\n");
1109 LLVM_DEBUG(dbgs() << " provably independent\n");
1113 LLVM_DEBUG(dbgs() << " possibly dependent\n");
1150 LLVM_DEBUG(dbgs() << "\tStrong SIV test\n");
1151 LLVM_DEBUG(dbgs() << "\t Coeff = " << *Coeff);
1152 LLVM_DEBUG(dbgs() << ", " << *Coeff->getType() << "\n");
1153 LLVM_DEBUG(dbgs() << "\t SrcConst = " << *SrcConst);
1154 LLVM_DEBUG(dbgs() << ", " << *SrcConst->getType() << "\n");
1155 LLVM_DEBUG(dbgs() << "\t DstConst = " << *DstConst);
1156 LLVM_DEBUG(dbgs() << ", " << *DstConst->getType() << "\n");
1162 LLVM_DEBUG(dbgs() << "\t Delta = " << *Delta);
1163 LLVM_DEBUG(dbgs() << ", " << *Delta->getType() << "\n");
1167 LLVM_DEBUG(dbgs() << "\t UpperBound = " << *UpperBound);
1168 LLVM_DEBUG(dbgs() << ", " << *UpperBound->getType() << "\n");
1189 LLVM_DEBUG(dbgs() << "\t Distance = " << Distance << "\n");
1190 LLVM_DEBUG(dbgs() << "\t Remainder = " << Remainder << "\n");
1217 LLVM_DEBUG(dbgs() << "\t Distance = " << *Delta << "\n");
1286 LLVM_DEBUG(dbgs() << "\tWeak-Crossing SIV test\n");
1287 LLVM_DEBUG(dbgs() << "\t Coeff = " << *Coeff << "\n");
1288 LLVM_DEBUG(dbgs() << "\t SrcConst = " << *SrcConst << "\n");
1289 LLVM_DEBUG(dbgs() << "\t DstConst = " << *DstConst << "\n");
1295 LLVM_DEBUG(dbgs() << "\t Delta = " << *Delta << "\n");
1325 LLVM_DEBUG(dbgs() << "\t Split iter = " << *SplitIter << "\n");
1333 LLVM_DEBUG(dbgs() << "\t Delta = " << *Delta << "\n");
1334 LLVM_DEBUG(dbgs() << "\t ConstCoeff = " << *ConstCoeff << "\n");
1345 LLVM_DEBUG(dbgs() << "\t UpperBound = " << *UpperBound << "\n");
1349 LLVM_DEBUG(dbgs() << "\t ML = " << *ML << "\n");
1377 LLVM_DEBUG(dbgs() << "\t Remainder = " << Remainder << "\n");
1384 LLVM_DEBUG(dbgs() << "\t Distance = " << Distance << "\n");
1389 LLVM_DEBUG(dbgs() << "\t Remainder = " << Remainder << "\n");
1425 LLVM_DEBUG(dbgs() << "\t GCD = " << G << "\n");
1498 LLVM_DEBUG(dbgs() << "\tExact SIV test\n");
1499 LLVM_DEBUG(dbgs() << "\t SrcCoeff = " << *SrcCoeff << " = AM\n");
1500 LLVM_DEBUG(dbgs() << "\t DstCoeff = " << *DstCoeff << " = BM\n");
1501 LLVM_DEBUG(dbgs() << "\t SrcConst = " << *SrcConst << "\n");
1502 LLVM_DEBUG(dbgs() << "\t DstConst = " << *DstConst << "\n");
1508 LLVM_DEBUG(dbgs() << "\t Delta = " << *Delta << "\n");
1529 LLVM_DEBUG(dbgs() << "\t X = " << X << ", Y = " << Y << "\n");
1538 LLVM_DEBUG(dbgs() << "\t UM = " << UM << "\n");
1549 LLVM_DEBUG(dbgs() << "\t TL = " << TL << "\n");
1552 LLVM_DEBUG(dbgs() << "\t TU = " << TU << "\n");
1557 LLVM_DEBUG(dbgs() << "\t TU = " << TU << "\n");
1560 LLVM_DEBUG(dbgs() << "\t TL = " << TL << "\n");
1568 LLVM_DEBUG(dbgs() << "\t TL = " << TL << "\n");
1571 LLVM_DEBUG(dbgs() << "\t TU = " << TU << "\n");
1576 LLVM_DEBUG(dbgs() << "\t TU = " << TU << "\n");
1579 LLVM_DEBUG(dbgs() << "\t TL = " << TL << "\n");
1594 LLVM_DEBUG(dbgs() << "\t exploring LT direction\n");
1598 LLVM_DEBUG(dbgs() << "\t\t TL = " << TL << "\n");
1602 LLVM_DEBUG(dbgs() << "\t\t TU = " << TU << "\n");
1612 LLVM_DEBUG(dbgs() << "\t exploring EQ direction\n");
1615 LLVM_DEBUG(dbgs() << "\t\t TL = " << TL << "\n");
1619 LLVM_DEBUG(dbgs() << "\t\t TU = " << TU << "\n");
1624 LLVM_DEBUG(dbgs() << "\t\t TL = " << TL << "\n");
1628 LLVM_DEBUG(dbgs() << "\t\t TU = " << TU << "\n");
1638 LLVM_DEBUG(dbgs() << "\t exploring GT direction\n");
1641 LLVM_DEBUG(dbgs() << "\t\t TL = " << TL << "\n");
1645 LLVM_DEBUG(dbgs() << "\t\t TU = " << TU << "\n");
1711 LLVM_DEBUG(dbgs() << "\tWeak-Zero (src) SIV test\n");
1712 LLVM_DEBUG(dbgs() << "\t DstCoeff = " << *DstCoeff << "\n");
1713 LLVM_DEBUG(dbgs() << "\t SrcConst = " << *SrcConst << "\n");
1714 LLVM_DEBUG(dbgs() << "\t DstConst = " << *DstConst << "\n");
1722 LLVM_DEBUG(dbgs() << "\t Delta = " << *Delta << "\n");
1743 LLVM_DEBUG(dbgs() << "\t UpperBound = " << *UpperBound << "\n");
1820 LLVM_DEBUG(dbgs() << "\tWeak-Zero (dst) SIV test\n");
1821 LLVM_DEBUG(dbgs() << "\t SrcCoeff = " << *SrcCoeff << "\n");
1822 LLVM_DEBUG(dbgs() << "\t SrcConst = " << *SrcConst << "\n");
1823 LLVM_DEBUG(dbgs() << "\t DstConst = " << *DstConst << "\n");
1831 LLVM_DEBUG(dbgs() << "\t Delta = " << *Delta << "\n");
1852 LLVM_DEBUG(dbgs() << "\t UpperBound = " << *UpperBound << "\n");
1901 LLVM_DEBUG(dbgs() << "\tExact RDIV test\n");
1902 LLVM_DEBUG(dbgs() << "\t SrcCoeff = " << *SrcCoeff << " = AM\n");
1903 LLVM_DEBUG(dbgs() << "\t DstCoeff = " << *DstCoeff << " = BM\n");
1904 LLVM_DEBUG(dbgs() << "\t SrcConst = " << *SrcConst << "\n");
1905 LLVM_DEBUG(dbgs() << "\t DstConst = " << *DstConst << "\n");
1909 LLVM_DEBUG(dbgs() << "\t Delta = " << *Delta << "\n");
1927 LLVM_DEBUG(dbgs() << "\t X = " << X << ", Y = " << Y << "\n");
1936 LLVM_DEBUG(dbgs() << "\t SrcUM = " << SrcUM << "\n");
1946 LLVM_DEBUG(dbgs() << "\t DstUM = " << DstUM << "\n");
1957 LLVM_DEBUG(dbgs() << "\t TL = " << TL << "\n");
1960 LLVM_DEBUG(dbgs() << "\t TU = " << TU << "\n");
1965 LLVM_DEBUG(dbgs() << "\t TU = " << TU << "\n");
1968 LLVM_DEBUG(dbgs() << "\t TL = " << TL << "\n");
1976 LLVM_DEBUG(dbgs() << "\t TL = " << TL << "\n");
1979 LLVM_DEBUG(dbgs() << "\t TU = " << TU << "\n");
1984 LLVM_DEBUG(dbgs() << "\t TU = " << TU << "\n");
1987 LLVM_DEBUG(dbgs() << "\t TL = " << TL << "\n");
2043 LLVM_DEBUG(dbgs() << "\ttry symbolic RDIV test\n");
2044 LLVM_DEBUG(dbgs() << "\t A1 = " << *A1);
2045 LLVM_DEBUG(dbgs() << ", type = " << *A1->getType() << "\n");
2046 LLVM_DEBUG(dbgs() << "\t A2 = " << *A2 << "\n");
2047 LLVM_DEBUG(dbgs() << "\t C1 = " << *C1 << "\n");
2048 LLVM_DEBUG(dbgs() << "\t C2 = " << *C2 << "\n");
2051 LLVM_DEBUG(if (N1) dbgs() << "\t N1 = " << *N1 << "\n");
2052 LLVM_DEBUG(if (N2) dbgs() << "\t N2 = " << *N2 << "\n");
2055 LLVM_DEBUG(dbgs() << "\t C2 - C1 = " << *C2_C1 << "\n");
2056 LLVM_DEBUG(dbgs() << "\t C1 - C2 = " << *C1_C2 << "\n");
2063 LLVM_DEBUG(dbgs() << "\t A1*N1 = " << *A1N1 << "\n");
2072 LLVM_DEBUG(dbgs() << "\t A2*N2 = " << *A2N2 << "\n");
2086 LLVM_DEBUG(dbgs() << "\t A1*N1 - A2*N2 = " << *A1N1_A2N2 << "\n");
2107 LLVM_DEBUG(dbgs() << "\t A1*N1 - A2*N2 = " << *A1N1_A2N2 << "\n");
2124 LLVM_DEBUG(dbgs() << "\t A1*N1 = " << *A1N1 << "\n");
2133 LLVM_DEBUG(dbgs() << "\t A2*N2 = " << *A2N2 << "\n");
2156 LLVM_DEBUG(dbgs() << " src = " << *Src << "\n");
2157 LLVM_DEBUG(dbgs() << " dst = " << *Dst << "\n");
2233 LLVM_DEBUG(dbgs() << " src = " << *Src << "\n");
2234 LLVM_DEBUG(dbgs() << " dst = " << *Dst << "\n");
2290 LLVM_DEBUG(dbgs() << " src = " << *Src << "\n");
2291 LLVM_DEBUG(dbgs() << " dst = " << *Dst << "\n");
2331 LLVM_DEBUG(dbgs() << "starting gcd\n");
2376 LLVM_DEBUG(dbgs() << " Delta = " << *Delta << "\n");
2403 LLVM_DEBUG(dbgs() << " ConstDelta = " << ConstDelta << "\n");
2407 LLVM_DEBUG(dbgs() << " RunningGCD = " << RunningGCD << "\n");
2426 LLVM_DEBUG(dbgs() << " ExtraGCD = " << ExtraGCD << '\n');
2481 LLVM_DEBUG(dbgs() << "\tRunningGCD = " << RunningGCD << "\n");
2484 LLVM_DEBUG(dbgs() << "\tRemainder = " << Remainder << "\n");
2494 LLVM_DEBUG(dbgs() << "all done\n");
2535 LLVM_DEBUG(dbgs() << "starting Banerjee\n");
2537 LLVM_DEBUG(dbgs() << " Src = " << *Src << '\n');
2540 LLVM_DEBUG(dbgs() << " Dst = " << *Dst << '\n');
2545 LLVM_DEBUG(dbgs() << "\tDelta = " << *Delta << '\n');
2548 LLVM_DEBUG(dbgs() << "\tBounds[*]\n");
2555 LLVM_DEBUG(dbgs() << "\t " << K << '\t');
2557 LLVM_DEBUG(dbgs() << *Bound[K].Lower[Dependence::DVEntry::ALL] << '\t');
2559 LLVM_DEBUG(dbgs() << "-inf\t");
2561 LLVM_DEBUG(dbgs() << *Bound[K].Upper[Dependence::DVEntry::ALL] << '\n');
2563 LLVM_DEBUG(dbgs() << "+inf\n");
2619 LLVM_DEBUG(dbgs() << "\t[");
2626 LLVM_DEBUG(dbgs() << " <");
2629 LLVM_DEBUG(dbgs() << " =");
2632 LLVM_DEBUG(dbgs() << " >");
2635 LLVM_DEBUG(dbgs() << " *");
2643 LLVM_DEBUG(dbgs() << " ]\n");
2654 LLVM_DEBUG(dbgs() << "\tBound for level = " << Level << '\n');
2655 LLVM_DEBUG(dbgs() << "\t <\t");
2657 LLVM_DEBUG(dbgs() << *Bound[Level].Lower[Dependence::DVEntry::LT]
2660 LLVM_DEBUG(dbgs() << "-inf\t");
2662 LLVM_DEBUG(dbgs() << *Bound[Level].Upper[Dependence::DVEntry::LT]
2665 LLVM_DEBUG(dbgs() << "+inf\n");
2666 LLVM_DEBUG(dbgs() << "\t =\t");
2668 LLVM_DEBUG(dbgs() << *Bound[Level].Lower[Dependence::DVEntry::EQ]
2671 LLVM_DEBUG(dbgs() << "-inf\t");
2673 LLVM_DEBUG(dbgs() << *Bound[Level].Upper[Dependence::DVEntry::EQ]
2676 LLVM_DEBUG(dbgs() << "+inf\n");
2677 LLVM_DEBUG(dbgs() << "\t >\t");
2679 LLVM_DEBUG(dbgs() << *Bound[Level].Lower[Dependence::DVEntry::GT]
2682 LLVM_DEBUG(dbgs() << "-inf\t");
2684 LLVM_DEBUG(dbgs() << *Bound[Level].Upper[Dependence::DVEntry::GT]
2687 LLVM_DEBUG(dbgs() << "+inf\n");
2934 LLVM_DEBUG(dbgs() << "\tCoefficient Info\n");
2936 LLVM_DEBUG(dbgs() << "\t " << K << "\t" << *CI[K].Coeff);
2937 LLVM_DEBUG(dbgs() << "\tPos Part = ");
2938 LLVM_DEBUG(dbgs() << *CI[K].PosPart);
2939 LLVM_DEBUG(dbgs() << "\tNeg Part = ");
2940 LLVM_DEBUG(dbgs() << *CI[K].NegPart);
2941 LLVM_DEBUG(dbgs() << "\tUpper Bound = ");
2943 LLVM_DEBUG(dbgs() << *CI[K].Iterations);
2945 LLVM_DEBUG(dbgs() << "+inf");
2946 LLVM_DEBUG(dbgs() << '\n');
2948 LLVM_DEBUG(dbgs() << "\t Constant = " << *Subscript << '\n');
3073 LLVM_DEBUG(dbgs() << "\t Constraint[" << LI << "] is");
3074 LLVM_DEBUG(Constraints[LI].dump(dbgs()));
3095 LLVM_DEBUG(dbgs() << "\t\tSrc is " << *Src << "\n");
3102 LLVM_DEBUG(dbgs() << "\t\tnew Src is " << *Src << "\n");
3103 LLVM_DEBUG(dbgs() << "\t\tDst is " << *Dst << "\n");
3105 LLVM_DEBUG(dbgs() << "\t\tnew Dst is " << *Dst << "\n");
3124 LLVM_DEBUG(dbgs() << "\t\tA = " << *A << ", B = " << *B << ", C = " << *C
3126 LLVM_DEBUG(dbgs() << "\t\tSrc = " << *Src << "\n");
3127 LLVM_DEBUG(dbgs() << "\t\tDst = " << *Dst << "\n");
3183 LLVM_DEBUG(dbgs() << "\t\tnew Src = " << *Src << "\n");
3184 LLVM_DEBUG(dbgs() << "\t\tnew Dst = " << *Dst << "\n");
3199 LLVM_DEBUG(dbgs() << "\t\tSrc is " << *Src << "\n");
3202 LLVM_DEBUG(dbgs() << "\t\tnew Src is " << *Src << "\n");
3203 LLVM_DEBUG(dbgs() << "\t\tDst is " << *Dst << "\n");
3205 LLVM_DEBUG(dbgs() << "\t\tnew Dst is " << *Dst << "\n");
3213 LLVM_DEBUG(dbgs() << "\tUpdate direction, constraint =");
3214 LLVM_DEBUG(CurConstraint.dump(dbgs()));
3342 LLVM_DEBUG({
3417 LLVM_DEBUG(dbgs() << "can only handle simple loads and stores\n");
3432 LLVM_DEBUG(dbgs() << "can't analyze may or partial alias\n");
3436 LLVM_DEBUG(dbgs() << "no alias\n");
3444 LLVM_DEBUG(dbgs() << " common nesting levels = " << CommonLevels << "\n");
3445 LLVM_DEBUG(dbgs() << " maximum nesting levels = " << MaxLevels << "\n");
3454 LLVM_DEBUG(dbgs() << " SrcSCEV = " << *SrcSCEV << "\n");
3455 LLVM_DEBUG(dbgs() << " DstSCEV = " << *DstSCEV << "\n");
3461 LLVM_DEBUG(dbgs() << " delinearized\n");
3477 LLVM_DEBUG(dbgs() << " subscript " << P << "\n");
3478 LLVM_DEBUG(dbgs() << "\tsrc = " << *Pair[P].Src << "\n");
3479 LLVM_DEBUG(dbgs() << "\tdst = " << *Pair[P].Dst << "\n");
3480 LLVM_DEBUG(dbgs() << "\tclass = " << Pair[P].Classification << "\n");
3481 LLVM_DEBUG(dbgs() << "\tloops = ");
3482 LLVM_DEBUG(dumpSmallBitVector(Pair[P].Loops));
3587 LLVM_DEBUG(dbgs() << " Separable = ");
3588 LLVM_DEBUG(dumpSmallBitVector(Separable));
3589 LLVM_DEBUG(dbgs() << " Coupled = ");
3590 LLVM_DEBUG(dumpSmallBitVector(Coupled));
3597 LLVM_DEBUG(dbgs() << "testing subscript " << SI);
3600 LLVM_DEBUG(dbgs() << ", ZIV\n");
3605 LLVM_DEBUG(dbgs() << ", SIV\n");
3614 LLVM_DEBUG(dbgs() << ", RDIV\n");
3619 LLVM_DEBUG(dbgs() << ", MIV\n");
3630 LLVM_DEBUG(dbgs() << "starting on coupled subscripts\n");
3631 LLVM_DEBUG(dbgs() << "MaxLevels + 1 = " << MaxLevels + 1 << "\n");
3636 LLVM_DEBUG(dbgs() << "testing subscript group " << SI << " { ");
3643 LLVM_DEBUG(dbgs() << SJ << " ");
3651 LLVM_DEBUG(dbgs() << "}\n");
3655 LLVM_DEBUG(dbgs() << "testing subscript " << SJ << ", SIV\n");
3659 LLVM_DEBUG(dbgs() << "SIV\n");
3675 LLVM_DEBUG(dbgs() << " propagating\n");
3676 LLVM_DEBUG(dbgs() << "\tMivs = ");
3677 LLVM_DEBUG(dumpSmallBitVector(Mivs));
3680 LLVM_DEBUG(dbgs() << "\tSJ = " << SJ << "\n");
3683 LLVM_DEBUG(dbgs() << "\t Changed\n");
3691 LLVM_DEBUG(dbgs() << "ZIV\n");
3714 LLVM_DEBUG(dbgs() << "RDIV test\n");
3727 LLVM_DEBUG(dbgs() << "MIV test\n");
3736 LLVM_DEBUG(dbgs() << " updating\n");
3862 LLVM_DEBUG(dbgs() << " delinearized\n");
lib/Analysis/DependenceGraphBuilder.cpp 101 LLVM_DEBUG(
111 LLVM_DEBUG(dbgs()
lib/Analysis/DivergenceAnalysis.cpp 279 LLVM_DEBUG(dbgs() << "\tpropJoinDiv " << JoinBlock.getName() << "\n");
300 LLVM_DEBUG(dbgs() << "propBranchDiv " << Term.getParent()->getName() << "\n");
326 LLVM_DEBUG(dbgs() << "propLoopDiv " << ExitingLoop.getName() << "\n");
lib/Analysis/IVDescriptors.cpp 623 LLVM_DEBUG(dbgs() << "Found an ADD reduction PHI." << *Phi << "\n");
628 LLVM_DEBUG(dbgs() << "Found a MUL reduction PHI." << *Phi << "\n");
633 LLVM_DEBUG(dbgs() << "Found an OR reduction PHI." << *Phi << "\n");
638 LLVM_DEBUG(dbgs() << "Found an AND reduction PHI." << *Phi << "\n");
643 LLVM_DEBUG(dbgs() << "Found a XOR reduction PHI." << *Phi << "\n");
648 LLVM_DEBUG(dbgs() << "Found a MINMAX reduction PHI." << *Phi << "\n");
653 LLVM_DEBUG(dbgs() << "Found an FMult reduction PHI." << *Phi << "\n");
658 LLVM_DEBUG(dbgs() << "Found an FAdd reduction PHI." << *Phi << "\n");
663 LLVM_DEBUG(dbgs() << "Found an float MINMAX reduction PHI." << *Phi
1009 LLVM_DEBUG(dbgs() << "LV: PHI is not a poly recurrence.\n");
1043 LLVM_DEBUG(dbgs() << "LV: PHI is not a poly recurrence.\n");
1050 LLVM_DEBUG(
lib/Analysis/IVUsers.cpp 237 LLVM_DEBUG(dbgs() << "FOUND USER in other loop: " << *User << '\n'
242 LLVM_DEBUG(dbgs() << "FOUND USER: " << *User << '\n'
276 LLVM_DEBUG(dbgs()
283 LLVM_DEBUG(if (SE->getSCEV(I) != ISE) dbgs()
lib/Analysis/IndirectCallPromotionAnalysis.cpp 73 LLVM_DEBUG(dbgs() << " \nWork on callsite " << *Inst
81 LLVM_DEBUG(dbgs() << " Candidate " << I << " Count=" << Count
85 LLVM_DEBUG(dbgs() << " Not promote: Cold target.\n");
lib/Analysis/InlineCost.cpp 931 LLVM_DEBUG(dbgs() << "Hot callsite.\n");
938 LLVM_DEBUG(dbgs() << "Cold callsite.\n");
949 LLVM_DEBUG(dbgs() << "Hot callee.\n");
955 LLVM_DEBUG(dbgs() << "Cold callee.\n");
2073 LLVM_DEBUG(llvm::dbgs() << " Analyzing call of " << Callee->getName()
2080 LLVM_DEBUG(CA.dump());
lib/Analysis/LazyCallGraph.cpp 68 LLVM_DEBUG(dbgs() << " Added callable function: " << N.getName() << "\n");
75 LLVM_DEBUG(dbgs() << " Adding functions called by '" << getName()
155 LLVM_DEBUG(dbgs() << "Building CG for module: " << M.getModuleIdentifier()
171 LLVM_DEBUG(dbgs() << " Adding '" << F.getName()
182 LLVM_DEBUG(dbgs() << " Adding '" << F->getName()
197 LLVM_DEBUG(
lib/Analysis/LazyValueInfo.cpp 395 LLVM_DEBUG(dbgs() << "PUSH: " << *BV.second << " in "
525 LLVM_DEBUG(
547 LLVM_DEBUG(
600 LLVM_DEBUG(dbgs() << " reuse BB '" << BB->getName() << "' val="
661 LLVM_DEBUG(dbgs() << " compute BB '" << BB->getName()
759 LLVM_DEBUG(dbgs() << " compute BB '" << BB->getName()
803 LLVM_DEBUG(dbgs() << " compute BB '" << BB->getName()
1036 LLVM_DEBUG(dbgs() << " compute BB '" << BB->getName()
1089 LLVM_DEBUG(dbgs() << " compute BB '" << BB->getName()
1157 LLVM_DEBUG(dbgs() << " compute BB '" << BB->getName()
1184 LLVM_DEBUG(dbgs() << " compute BB '" << BB->getName()
1553 LLVM_DEBUG(dbgs() << "LVI Getting block end value " << *V << " at '"
1564 LLVM_DEBUG(dbgs() << " Result = " << Result << "\n");
1569 LLVM_DEBUG(dbgs() << "LVI Getting value " << *V << " at '" << CxtI->getName()
1580 LLVM_DEBUG(dbgs() << " Result = " << Result << "\n");
1587 LLVM_DEBUG(dbgs() << "LVI Getting edge value " << *V << " from '"
1599 LLVM_DEBUG(dbgs() << " Result = " << Result << "\n");
lib/Analysis/LegacyDivergenceAnalysis.cpp 347 LLVM_DEBUG(dbgs() << "\nAfter divergence analysis on " << F.getName()
lib/Analysis/LoopAccessAnalysis.cpp 167 LLVM_DEBUG(dbgs() << "LAA: Replacing SCEV: " << *OrigSCEV
689 LLVM_DEBUG(dbgs() << "LAA: Found a runtime check ptr:" << *Ptr << '\n');
734 LLVM_DEBUG(dbgs() << "LAA: Can't find bounds for ptr:" << *Ptr << '\n');
796 LLVM_DEBUG(
807 LLVM_DEBUG(dbgs() << "LAA: We need to do " << RtCheck.getNumberOfChecks()
823 LLVM_DEBUG(dbgs() << "LAA: Processing memory accesses...\n");
824 LLVM_DEBUG(dbgs() << " AST: "; AST.dump());
825 LLVM_DEBUG(dbgs() << "LAA: Accesses(" << Accesses.size() << "):\n");
826 LLVM_DEBUG({
910 LLVM_DEBUG(dbgs()
927 LLVM_DEBUG(dbgs() << " " << *UnderlyingObj << "\n");
999 LLVM_DEBUG(dbgs() << "LAA: Bad stride - Not a pointer to a scalar type"
1011 LLVM_DEBUG(dbgs() << "LAA: Bad stride - Not an AddRecExpr pointer " << *Ptr
1018 LLVM_DEBUG(dbgs() << "LAA: Bad stride - Not striding over innermost loop "
1040 LLVM_DEBUG(dbgs() << "LAA: Pointer may wrap in the address space:\n"
1045 LLVM_DEBUG(
1058 LLVM_DEBUG(dbgs() << "LAA: Bad stride - Not a constant strided " << *Ptr
1087 LLVM_DEBUG(dbgs() << "LAA: Non unit strided pointer which is not either "
1320 LLVM_DEBUG(
1479 LLVM_DEBUG(dbgs() << "LAA: Src Scev: " << *Src << "Sink Scev: " << *Sink
1481 LLVM_DEBUG(dbgs() << "LAA: Distance for " << *InstMap[AIdx] << " to "
1488 LLVM_DEBUG(dbgs() << "Pointer access with non-constant stride\n");
1505 LLVM_DEBUG(dbgs() << "LAA: Dependence because of non-constant distance\n");
1516 LLVM_DEBUG(dbgs() << "LAA: Strided accesses are independent\n");
1526 LLVM_DEBUG(dbgs() << "LAA: Forward but may prevent st->ld forwarding\n");
1530 LLVM_DEBUG(dbgs() << "LAA: Dependence is negative\n");
1539 LLVM_DEBUG(
1547 LLVM_DEBUG(
1590 LLVM_DEBUG(dbgs() << "LAA: Failure because of positive distance "
1597 LLVM_DEBUG(dbgs() << "LAA: Failure because it needs at least "
1627 LLVM_DEBUG(dbgs() << "LAA: Positive distance " << Val.getSExtValue()
1694 LLVM_DEBUG(dbgs()
1707 LLVM_DEBUG(dbgs() << "Total Dependences: " << Dependences.size() << "\n");
1737 LLVM_DEBUG(dbgs() << "LAA: Found a loop in "
1743 LLVM_DEBUG(dbgs() << "LAA: loop is not the innermost loop\n");
1750 LLVM_DEBUG(
1759 LLVM_DEBUG(
1770 LLVM_DEBUG(
1782 LLVM_DEBUG(dbgs() << "LAA: SCEV could not compute the loop exit count.\n");
1860 LLVM_DEBUG(dbgs() << "LAA: Found a non-simple load.\n");
1884 LLVM_DEBUG(dbgs() << "LAA: Found a non-simple store.\n");
1908 LLVM_DEBUG(dbgs() << "LAA: Found a read-only loop!\n");
1952 LLVM_DEBUG(
1979 LLVM_DEBUG(dbgs() << "LAA: Found an unsafe dependency between a uniform "
1997 LLVM_DEBUG(dbgs() << "LAA: Found a write-only loop!\n");
2012 LLVM_DEBUG(dbgs() << "LAA: We can't vectorize because we can't find "
2018 LLVM_DEBUG(
2023 LLVM_DEBUG(dbgs() << "LAA: Checking memory dependencies\n");
2029 LLVM_DEBUG(dbgs() << "LAA: Retrying with memory checks\n");
2045 LLVM_DEBUG(dbgs() << "LAA: Can't vectorize with memory checks\n");
2057 LLVM_DEBUG(dbgs() << "LAA: We can't vectorize because a runtime check "
2064 LLVM_DEBUG(
2074 LLVM_DEBUG(dbgs() << "LAA: unsafe dependent memory operations in loop\n");
2158 LLVM_DEBUG(dbgs() << "LAA: Adding RT check for a loop invariant ptr:"
2172 LLVM_DEBUG(dbgs() << "LAA: Adding RT check for range:\n");
2175 LLVM_DEBUG(dbgs() << "Start: " << *CG->Low << " End: " << *CG->High
2294 LLVM_DEBUG(dbgs() << "LAA: Found a strided access that is a candidate for "
2296 LLVM_DEBUG(dbgs() << " Ptr: " << *Ptr << " Stride: " << *Stride << "\n");
2332 LLVM_DEBUG(
2338 LLVM_DEBUG(dbgs() << "LAA: Found a strided access that we can version.");
lib/Analysis/LoopCacheAnalysis.cpp 136 LLVM_DEBUG(dbgs().indent(2) << "Succesfully delinearized: " << *this
146 LLVM_DEBUG(dbgs().indent(2)
153 LLVM_DEBUG(dbgs().indent(2)
161 LLVM_DEBUG(dbgs().indent(2) << "No spacial reuse, different subscripts: "
176 LLVM_DEBUG(dbgs().indent(2)
185 LLVM_DEBUG({
203 LLVM_DEBUG(dbgs().indent(2)
212 LLVM_DEBUG(dbgs().indent(2) << "No temporal reuse: no dependence\n");
217 LLVM_DEBUG(dbgs().indent(2) << "Found temporal reuse\n");
231 LLVM_DEBUG(dbgs().indent(2) << "No temporal reuse: distance unknown\n");
237 LLVM_DEBUG(dbgs().indent(2)
242 LLVM_DEBUG(
250 LLVM_DEBUG(dbgs().indent(2) << "Found temporal reuse\n");
257 LLVM_DEBUG({
264 LLVM_DEBUG(dbgs().indent(4) << "Reference is loop invariant: RefCost=1\n");
270 LLVM_DEBUG(dbgs() << "Trip count of loop " << L.getName()
275 LLVM_DEBUG(dbgs() << "TripCount=" << *TripCount << "\n");
288 LLVM_DEBUG(dbgs().indent(4)
292 LLVM_DEBUG(dbgs().indent(4)
300 LLVM_DEBUG(dbgs().indent(4)
311 LLVM_DEBUG(dbgs() << "Delinearizing: " << StoreOrLoadInst << "\n");
322 LLVM_DEBUG(
330 LLVM_DEBUG(dbgs().indent(2) << "In Loop '" << L->getName()
341 LLVM_DEBUG(dbgs().indent(2)
473 LLVM_DEBUG(dbgs() << "Expecting the outermost loop in a loop nest\n");
482 LLVM_DEBUG(dbgs() << "Cannot compute cache cost of loop nest with more "
491 LLVM_DEBUG(dbgs() << "POPULATING REFERENCE GROUPS\n");
496 LLVM_DEBUG(dbgs() << "COMPUTING LOOP CACHE COSTS\n");
530 LLVM_DEBUG({
560 LLVM_DEBUG({
581 LLVM_DEBUG(dbgs() << "Considering loop '" << L.getName()
598 LLVM_DEBUG(dbgs().indent(2) << "Loop '" << L.getName()
lib/Analysis/LoopPass.cpp 404 LLVM_DEBUG(dbgs() << "Skipping pass '" << getPassName() << "' in function "
lib/Analysis/MemoryBuiltins.cpp 610 LLVM_DEBUG(dbgs() << "ObjectSizeOffsetVisitor::compute() unhandled value: "
818 LLVM_DEBUG(dbgs() << "ObjectSizeOffsetVisitor unknown instruction:" << I
905 LLVM_DEBUG(
1048 LLVM_DEBUG(dbgs() << "ObjectSizeOffsetEvaluator unknown instruction:" << I
lib/Analysis/MemoryDependenceAnalysis.cpp 831 LLVM_DEBUG(AssertSorted(Cache));
844 LLVM_DEBUG(AssertSorted(Cache, NumSortedEntries));
1231 LLVM_DEBUG(AssertSorted(*Cache));
1262 LLVM_DEBUG(AssertSorted(*Cache, NumSortedEntries));
1476 LLVM_DEBUG(AssertSorted(*Cache));
1697 LLVM_DEBUG(verifyRemoved(RemInst));
lib/Analysis/MemorySSA.cpp 1412 LLVM_DEBUG(dbgs() << "MemorySSA skipping optimization of " << *MU << " ("
2366 LLVM_DEBUG(dbgs() << "Starting Memory SSA clobber for " << *I << " is ");
2367 LLVM_DEBUG(dbgs() << *StartingUseOrDef << "\n");
2368 LLVM_DEBUG(dbgs() << "Final Memory SSA clobber for " << *I << " is ");
2369 LLVM_DEBUG(dbgs() << *Clobber << "\n");
2431 LLVM_DEBUG(dbgs() << "Starting Memory SSA clobber for " << *I << " is ");
2432 LLVM_DEBUG(dbgs() << *StartingAccess << "\n");
2433 LLVM_DEBUG(dbgs() << "Optimized Memory SSA clobber for " << *I << " is ");
2434 LLVM_DEBUG(dbgs() << *OptimizedAccess << "\n");
2445 LLVM_DEBUG(dbgs() << "Result Memory SSA clobber [SkipSelf = " << SkipSelf);
2446 LLVM_DEBUG(dbgs() << "] for " << *I << " is " << *Result << "\n");
lib/Analysis/MemorySSAUpdater.cpp 936 LLVM_DEBUG(
lib/Analysis/MustExecute.cpp 451 LLVM_DEBUG(dbgs() << "Find next instruction for " << *PP << "\n");
455 LLVM_DEBUG(dbgs() << "\tReached terminator in intra-block mode, done\n");
472 LLVM_DEBUG(dbgs() << "\tIntermediate instruction does transfer control\n");
481 LLVM_DEBUG(dbgs() << "\tUnhandled terminator\n");
488 LLVM_DEBUG(
493 LLVM_DEBUG(dbgs() << "\tNo join point found\n");
lib/Analysis/RegionPass.cpp 161 LLVM_DEBUG(dbgs() << "\nRegion tree of function " << F.getName()
294 LLVM_DEBUG(dbgs() << "Skipping pass '" << getPassName()
lib/Analysis/ScalarEvolution.cpp 4856 LLVM_DEBUG(dbgs() << "P2 is compile-time false\n";);
4864 LLVM_DEBUG(dbgs() << "P3 is compile-time false\n";);
4873 LLVM_DEBUG(dbgs() << "Added Predicate: " << *Pred);
8447 LLVM_DEBUG(dbgs() << __func__ << ": analyzing quadratic addrec: "
8452 LLVM_DEBUG(dbgs() << __func__ << ": coefficients are not constant\n");
8463 LLVM_DEBUG(dbgs() << __func__ << ": addrec coeff bw: "
8485 LLVM_DEBUG(dbgs() << __func__ << ": equation " << A << "x^2 + " << B
8550 LLVM_DEBUG(dbgs() << __func__ << ": solving for unsigned overflow\n");
8578 LLVM_DEBUG(dbgs() << __func__ << ": solving boundary crossing for range "
8602 LLVM_DEBUG(dbgs() << "SolveQuadraticAddRecRange: checking boundary "
8608 LLVM_DEBUG(dbgs() << "SolveQuadraticAddRecRange: solving for "
8612 LLVM_DEBUG(dbgs() << "SolveQuadraticAddRecRange: solving for "
11032 LLVM_DEBUG({
11043 LLVM_DEBUG({
11158 LLVM_DEBUG({
11189 LLVM_DEBUG({
11203 LLVM_DEBUG({
11227 LLVM_DEBUG({
11261 LLVM_DEBUG({
11339 LLVM_DEBUG({
lib/Analysis/StackSafetyAnalysis.cpp 371 LLVM_DEBUG(dbgs() << "[StackSafety] " << F.getName() << "\n");
388 LLVM_DEBUG(dbgs() << "[StackSafety] done\n");
389 LLVM_DEBUG(Info.print(dbgs()));
489 LLVM_DEBUG(dbgs() << "=== update [" << FS.UpdateCount
541 LLVM_DEBUG(verifyFixedPoint());
lib/Analysis/SyncDependenceAnalysis.cpp 224 LLVM_DEBUG(dbgs() << "SDA:computeJoinPoints. Parent loop: " << (ParentLoop ? ParentLoop->getName() : "<null>") << "\n" );
239 LLVM_DEBUG(
259 LLVM_DEBUG(dbgs() << "SDA::joins. visiting " << Block->getName() << "\n");
291 LLVM_DEBUG(dbgs() << "SDA::joins. After propagation:\n"; printDefs(dbgs()));
316 LLVM_DEBUG(printDefs(dbgs()));
lib/Analysis/VectorUtils.cpp 885 LLVM_DEBUG(dbgs() << "LV: Analyzing interleaved accesses...\n");
928 LLVM_DEBUG(dbgs() << "LV: Creating an interleave group with:" << *B
970 LLVM_DEBUG(dbgs() << "LV: Invalidated store group due to "
1038 LLVM_DEBUG(dbgs() << "LV: Inserted:" << *A << '\n'
1053 LLVM_DEBUG(
1087 LLVM_DEBUG(
1098 LLVM_DEBUG(
1110 LLVM_DEBUG(
1116 LLVM_DEBUG(
1137 LLVM_DEBUG(
lib/CodeGen/AggressiveAntiDepBreaker.cpp 141 LLVM_DEBUG(dbgs() << "AntiDep Critical-Path Registers:");
142 LLVM_DEBUG(for (unsigned r
145 LLVM_DEBUG(dbgs() << '\n');
205 LLVM_DEBUG(dbgs() << "Observe: ");
206 LLVM_DEBUG(MI.dump());
207 LLVM_DEBUG(dbgs() << "\tRegs:");
218 LLVM_DEBUG(if (State->GetGroup(Reg) != 0) dbgs()
227 LLVM_DEBUG(dbgs() << '\n');
316 LLVM_DEBUG(if (!header && footer) dbgs() << footer);
325 LLVM_DEBUG(if (header) {
329 LLVM_DEBUG(dbgs() << "->g" << State->GetGroup(Reg) << tag);
341 LLVM_DEBUG(if (header) {
345 LLVM_DEBUG(dbgs() << " " << printReg(SubregReg, TRI) << "->g"
351 LLVM_DEBUG(if (!header && footer) dbgs() << footer);
374 LLVM_DEBUG(dbgs() << "\tDef Groups:");
381 LLVM_DEBUG(dbgs() << " " << printReg(Reg, TRI) << "=g"
391 LLVM_DEBUG(if (State->GetGroup(Reg) != 0) dbgs() << "->g0(alloc-req)");
401 LLVM_DEBUG(dbgs() << "->g" << State->GetGroup(Reg) << "(via "
414 LLVM_DEBUG(dbgs() << '\n');
445 LLVM_DEBUG(dbgs() << "\tUse Groups:");
477 LLVM_DEBUG(dbgs() << " " << printReg(Reg, TRI) << "=g"
486 LLVM_DEBUG(if (State->GetGroup(Reg) != 0) dbgs() << "->g0(alloc-req)");
498 LLVM_DEBUG(dbgs() << '\n');
503 LLVM_DEBUG(dbgs() << "\tKill Group:");
513 LLVM_DEBUG(dbgs() << "=" << printReg(Reg, TRI));
516 LLVM_DEBUG(dbgs() << " " << printReg(Reg, TRI));
521 LLVM_DEBUG(dbgs() << "->g" << State->GetGroup(FirstReg) << '\n');
544 LLVM_DEBUG(dbgs() << " " << TRI->getRegClassName(RC));
571 LLVM_DEBUG(dbgs() << "\tRename Candidates for Group g" << AntiDepGroupIndex
582 LLVM_DEBUG(dbgs() << "\t\t" << printReg(Reg, TRI) << ":");
588 LLVM_DEBUG({
634 LLVM_DEBUG(dbgs() << "\tEmpty Super Regclass!!\n");
638 LLVM_DEBUG(dbgs() << "\tFind Registers:");
654 LLVM_DEBUG(dbgs() << " [" << printReg(NewSuperReg, TRI) << ':');
671 LLVM_DEBUG(dbgs() << " " << printReg(NewReg, TRI));
675 LLVM_DEBUG(dbgs() << "(no rename)");
684 LLVM_DEBUG(dbgs() << "(live)");
692 LLVM_DEBUG(dbgs()
711 LLVM_DEBUG(dbgs() << "(ec)");
725 LLVM_DEBUG(dbgs() << "(ec)");
738 LLVM_DEBUG(dbgs() << "]\n");
742 LLVM_DEBUG(dbgs() << ']');
745 LLVM_DEBUG(dbgs() << '\n');
798 LLVM_DEBUG(dbgs() << "\n===== Aggressive anti-dependency breaking\n");
799 LLVM_DEBUG(dbgs() << "Available regs:");
802 LLVM_DEBUG(dbgs() << " " << printReg(Reg, TRI));
804 LLVM_DEBUG(dbgs() << '\n');
821 LLVM_DEBUG(dbgs() << "Anti: ");
822 LLVM_DEBUG(MI.dump());
858 LLVM_DEBUG(dbgs() << "\tAntidep reg: " << printReg(AntiDepReg, TRI));
863 LLVM_DEBUG(dbgs() << " (non-allocatable)\n");
868 LLVM_DEBUG(dbgs() << " (not critical-path)\n");
874 LLVM_DEBUG(dbgs() << " (passthru)\n");
881 LLVM_DEBUG(dbgs() << " (implicit)\n");
907 LLVM_DEBUG(dbgs() << " (real dependency)\n");
913 LLVM_DEBUG(dbgs() << " (other dependency)\n");
951 LLVM_DEBUG(dbgs() << " (zero group)\n");
955 LLVM_DEBUG(dbgs() << '\n');
960 LLVM_DEBUG(dbgs() << "\tBreaking anti-dependence edge on "
969 LLVM_DEBUG(dbgs() << " " << printReg(CurrReg, TRI) << "->"
1004 LLVM_DEBUG(dbgs() << '\n');
lib/CodeGen/AllocationOrder.cpp 41 LLVM_DEBUG({
lib/CodeGen/AsmPrinter/DIE.cpp 89 LLVM_DEBUG(dbgs() << "Invalid form " << format("0x%x", AttrData.getForm())
lib/CodeGen/AsmPrinter/DIEHash.cpp 45 LLVM_DEBUG(dbgs() << "Adding string " << Str << " to hash.\n");
55 LLVM_DEBUG(dbgs() << "Adding ULEB128 " << Value << " to hash.\n");
66 LLVM_DEBUG(dbgs() << "Adding ULEB128 " << Value << " to hash.\n");
82 LLVM_DEBUG(dbgs() << "Adding parent context to hash...\n");
110 LLVM_DEBUG(dbgs() << "... adding context: " << Name << "\n");
120 LLVM_DEBUG(dbgs() << "Attribute: "
lib/CodeGen/AsmPrinter/DbgEntityHistoryCalculator.cpp 63 LLVM_DEBUG(dbgs() << "Coalescing identical DBG_VALUE entries:\n"
lib/CodeGen/AsmPrinter/DebugHandlerBase.cpp 209 LLVM_DEBUG(DbgValues.dump());
lib/CodeGen/AsmPrinter/DwarfDebug.cpp 761 LLVM_DEBUG(dbgs() << "CallSiteEntry: " << MF.getName() << " -> "
1423 LLVM_DEBUG(dbgs() << "DotDebugLoc: " << *Instr << "\n");
1457 LLVM_DEBUG(dbgs() << "Omitting location list entry with empty range.\n");
1469 LLVM_DEBUG({
lib/CodeGen/AtomicExpandPass.cpp 388 LLVM_DEBUG(dbgs() << "Replaced " << *LI << " with " << *NewLI << "\n");
475 LLVM_DEBUG(dbgs() << "Replaced " << *SI << " with " << *NewSI << "\n");
1075 LLVM_DEBUG(dbgs() << "Replaced " << *CI << " with " << *NewCI << "\n");
lib/CodeGen/BranchFolding.cpp 155 LLVM_DEBUG(dbgs() << "\nRemoving MBB: " << *MBB);
658 LLVM_DEBUG(dbgs() << "Common tail length of " << printMBBReference(*MBB1)
815 LLVM_DEBUG(dbgs() << "\nSplitting " << printMBBReference(*MBB) << ", size "
825 LLVM_DEBUG(dbgs() << "... failed!");
965 LLVM_DEBUG(
1057 LLVM_DEBUG(dbgs() << "\nUsing common tail in " << printMBBReference(*MBB)
1062 LLVM_DEBUG(dbgs() << printMBBReference(*SameTails[i].getBlock())
1069 LLVM_DEBUG(dbgs() << "\n");
1350 LLVM_DEBUG(dbgs() << "Copied debug entity from empty block to pred: "
1362 LLVM_DEBUG(dbgs() << "Copied debug entity from empty block to succ: "
1478 LLVM_DEBUG(dbgs() << "\nMerging into block: " << PrevBB
1565 LLVM_DEBUG(dbgs() << "\nMoving MBB: " << *MBB
lib/CodeGen/BranchRelaxation.cpp 288 LLVM_DEBUG(dbgs() << "Out of range branch to destination "
361 LLVM_DEBUG(dbgs() << " Invert condition and swap "
386 LLVM_DEBUG(dbgs() << " Insert B to " << printMBBReference(*TBB)
399 LLVM_DEBUG(dbgs() << " The branch condition can't be inverted. "
419 LLVM_DEBUG(dbgs() << " Insert cond B to the new BB "
544 LLVM_DEBUG(dbgs() << "***** BranchRelaxation *****\n");
561 LLVM_DEBUG(dbgs() << " Basic blocks before relaxation\n"; dumpBBs(););
570 LLVM_DEBUG(dbgs() << " Basic blocks after relaxation\n\n"; dumpBBs());
lib/CodeGen/BreakFalseDeps.cpp 167 LLVM_DEBUG(dbgs() << "Clearance: " << Clearance << ", want " << Pref);
170 LLVM_DEBUG(dbgs() << ": Break dependency.\n");
173 LLVM_DEBUG(dbgs() << ": OK .\n");
273 LLVM_DEBUG(dbgs() << "********** BREAK FALSE DEPENDENCIES **********\n");
lib/CodeGen/CalcSpillWeights.cpp 37 LLVM_DEBUG(dbgs() << "********** Compute Spill Weights **********\n"
lib/CodeGen/CodeGenPrepare.cpp 585 LLVM_DEBUG(dbgs() << "To merge:\n" << *BB << "\n\n\n");
823 LLVM_DEBUG(dbgs() << "MERGING MOSTLY EMPTY BLOCKS - BEFORE:\n"
836 LLVM_DEBUG(dbgs() << "AFTER:\n" << *SinglePred << "\n\n\n");
874 LLVM_DEBUG(dbgs() << "AFTER:\n" << *DestBB << "\n\n\n");
1465 LLVM_DEBUG(dbgs() << "found 'and' feeding only icmp 0;\n");
1466 LLVM_DEBUG(AndI->getParent()->dump());
1479 LLVM_DEBUG(dbgs() << "sinking 'and' use: " << *User << "\n");
1493 LLVM_DEBUG(User->getParent()->dump());
2335 LLVM_DEBUG(dbgs() << "Do: move: " << *Inst << "\nbefore: " << *Before
2342 LLVM_DEBUG(dbgs() << "Undo: moveBefore: " << *Inst << "\n");
2359 LLVM_DEBUG(dbgs() << "Do: setOperand: " << Idx << "\n"
2368 LLVM_DEBUG(dbgs() << "Undo: setOperand:" << Idx << "\n"
2384 LLVM_DEBUG(dbgs() << "Do: OperandsHider: " << *Inst << "\n");
2400 LLVM_DEBUG(dbgs() << "Undo: OperandsHider: " << *Inst << "\n");
2417 LLVM_DEBUG(dbgs() << "Do: TruncBuilder: " << *Val << "\n");
2425 LLVM_DEBUG(dbgs() << "Undo: TruncBuilder: " << *Val << "\n");
2443 LLVM_DEBUG(dbgs() << "Do: SExtBuilder: " << *Val << "\n");
2451 LLVM_DEBUG(dbgs() << "Undo: SExtBuilder: " << *Val << "\n");
2469 LLVM_DEBUG(dbgs() << "Do: ZExtBuilder: " << *Val << "\n");
2477 LLVM_DEBUG(dbgs() << "Undo: ZExtBuilder: " << *Val << "\n");
2492 LLVM_DEBUG(dbgs() << "Do: MutateType: " << *Inst << " with " << *NewTy
2499 LLVM_DEBUG(dbgs() << "Undo: MutateType: " << *Inst << " with " << *OrigTy
2529 LLVM_DEBUG(dbgs() << "Do: UsersReplacer: " << *Inst << " with " << *New
2546 LLVM_DEBUG(dbgs() << "Undo: UsersReplacer: " << *Inst << "\n");
2590 LLVM_DEBUG(dbgs() << "Do: InstructionRemover: " << *Inst << "\n");
2603 LLVM_DEBUG(dbgs() << "Undo: InstructionRemover: " << *Inst << "\n");
3945 LLVM_DEBUG(dbgs() << "Propagate Ext to operands\n");
3948 LLVM_DEBUG(dbgs() << "Operand:\n" << *(ExtOpnd->getOperand(OpIdx)) << '\n');
3951 LLVM_DEBUG(dbgs() << "No need to propagate\n");
3957 LLVM_DEBUG(dbgs() << "Statically extend\n");
3966 LLVM_DEBUG(dbgs() << "Statically extend\n");
3975 LLVM_DEBUG(dbgs() << "More operands to ext\n");
3996 LLVM_DEBUG(dbgs() << "Extension is useless now\n");
4012 LLVM_DEBUG(dbgs() << "OldCost: " << OldCost << "\tNewCost: " << NewCost
4291 LLVM_DEBUG(dbgs() << "Sign extension does not pay off: rollback\n");
4753 LLVM_DEBUG(dbgs() << "CGP: Found local addrmode: " << AddrMode
4773 LLVM_DEBUG(dbgs() << "CGP: Reusing nonlocal addrmode: " << AddrMode
4781 LLVM_DEBUG(dbgs() << "CGP: SINKING nonlocal addrmode: " << AddrMode
4929 LLVM_DEBUG(dbgs() << "CGP: SINKING nonlocal addrmode: " << AddrMode
6197 LLVM_DEBUG(dbgs() << "Sinking " << *UI << " to user " << *I << "\n");
6216 LLVM_DEBUG(dbgs() << "Removing dead instruction: " << *I << "\n");
6398 LLVM_DEBUG(
6605 LLVM_DEBUG(dbgs() << "Found an interesting transition: " << *Inst << '\n');
6611 LLVM_DEBUG(dbgs() << "Use: " << *ToBePromoted << '\n');
6614 LLVM_DEBUG(dbgs() << "Instruction to promote is in a different block ("
6622 LLVM_DEBUG(dbgs() << "Assume " << *Inst << '\n'
6630 LLVM_DEBUG(dbgs() << "Try promoting.\n");
6634 LLVM_DEBUG(dbgs() << "Promoting is possible... Enqueue for promotion!\n");
7139 LLVM_DEBUG(dbgs() << "Moving Debug Value before :\n"
7219 LLVM_DEBUG(dbgs() << "Before branch condition splitting\n"; BB.dump());
7340 LLVM_DEBUG(dbgs() << "After branch condition splitting\n"; BB.dump();
lib/CodeGen/CriticalAntiDepBreaker.cpp 464 LLVM_DEBUG(dbgs() << "Critical path has total latency "
466 LLVM_DEBUG(dbgs() << "Available regs:");
469 LLVM_DEBUG(dbgs() << " " << printReg(Reg, TRI));
471 LLVM_DEBUG(dbgs() << '\n');
648 LLVM_DEBUG(dbgs() << "Breaking anti-dependence edge on "
lib/CodeGen/DFAPacketizer.cpp 210 LLVM_DEBUG({
226 LLVM_DEBUG(dbgs() << "End packet\n");
239 LLVM_DEBUG({
277 LLVM_DEBUG(dbgs() << "Checking resources for adding MI to packet " << MI);
280 LLVM_DEBUG({
292 LLVM_DEBUG(dbgs() << " Checking against MJ " << *MJ);
295 LLVM_DEBUG(dbgs() << " Not legal to add MI, try to prune\n");
299 LLVM_DEBUG(dbgs()
304 LLVM_DEBUG(dbgs() << " Pruned dependence for adding MI\n");
308 LLVM_DEBUG(if (ResourceAvail) dbgs()
318 LLVM_DEBUG(dbgs() << "* Adding MI to packet " << MI << '\n');
lib/CodeGen/DeadMachineInstructionElim.cpp 129 LLVM_DEBUG(dbgs() << "DeadMachineInstructionElim: DELETING: " << *MI);
lib/CodeGen/DetectDeadLanes.cpp 441 LLVM_DEBUG(dbgs() << "Copy across incompatible classes: " << UseMI);
522 LLVM_DEBUG(dbgs() << "Defined/Used lanes:\n"; for (unsigned RegIdx = 0;
545 LLVM_DEBUG(dbgs()
552 LLVM_DEBUG(dbgs()
556 LLVM_DEBUG(dbgs()
578 LLVM_DEBUG(dbgs() << "Skipping Detect dead lanes pass\n");
lib/CodeGen/EarlyIfConversion.cpp 203 LLVM_DEBUG(dbgs() << printMBBReference(*MBB) << " has live-ins.\n");
217 LLVM_DEBUG(dbgs() << printMBBReference(*MBB) << " has more than "
224 LLVM_DEBUG(dbgs() << "Can't hoist: " << *I);
232 LLVM_DEBUG(dbgs() << "Won't speculate load: " << *I);
239 LLVM_DEBUG(dbgs() << "Can't speculate: " << *I);
257 LLVM_DEBUG(dbgs() << "Won't speculate regmask: " << *I);
275 LLVM_DEBUG(dbgs() << printMBBReference(*I->getParent()) << " depends on "
278 LLVM_DEBUG(dbgs() << "Can't insert instructions below terminator.\n");
297 LLVM_DEBUG(dbgs() << printMBBReference(*MBB) << " has live-ins.\n");
312 LLVM_DEBUG(dbgs() << printMBBReference(*MBB) << " has more than "
319 LLVM_DEBUG(dbgs() << "Can't predicate: " << *I);
373 LLVM_DEBUG(dbgs() << "Can't insert code after " << *I);
407 LLVM_DEBUG({
419 LLVM_DEBUG(dbgs() << "Can insert before " << *I);
422 LLVM_DEBUG(dbgs() << "No legal insertion point found.\n");
455 LLVM_DEBUG(dbgs() << "\nDiamond: " << printMBBReference(*Head) << " -> "
462 LLVM_DEBUG(dbgs() << "Tail has live-ins.\n");
466 LLVM_DEBUG(dbgs() << "\nTriangle: " << printMBBReference(*Head) << " -> "
475 LLVM_DEBUG(dbgs() << "No phis in tail.\n");
482 LLVM_DEBUG(dbgs() << "Branch not analyzable.\n");
488 LLVM_DEBUG(dbgs() << "AnalyzeBranch didn't find conditional branch.\n");
495 LLVM_DEBUG(dbgs() << "AnalyzeBranch found an unconditional branch.\n");
524 LLVM_DEBUG(dbgs() << "Can't convert: " << *PI.PHI);
568 LLVM_DEBUG(dbgs() << "If-converting " << *PI.PHI);
571 LLVM_DEBUG(dbgs() << " --> " << *std::prev(FirstTerm));
590 LLVM_DEBUG(dbgs() << "If-converting " << *PI.PHI);
600 LLVM_DEBUG(dbgs() << " --> " << *std::prev(FirstTerm));
614 LLVM_DEBUG(dbgs() << " --> " << *PI.PHI);
678 LLVM_DEBUG(dbgs() << "Joining tail " << printMBBReference(*Tail)
687 LLVM_DEBUG(dbgs() << "Converting to unconditional branch.\n");
692 LLVM_DEBUG(dbgs() << *Head);
808 LLVM_DEBUG(dbgs() << "TBB: " << TBBTrace << "FBB: " << FBBTrace);
822 LLVM_DEBUG(dbgs() << "Resource length " << ResLength
825 LLVM_DEBUG(dbgs() << "Not enough available ILP.\n");
835 LLVM_DEBUG(dbgs() << "Branch depth: " << BranchDepth << '\n');
844 LLVM_DEBUG(dbgs() << "Slack " << Slack << ":\t" << *PI.PHI);
850 LLVM_DEBUG(dbgs() << "Condition adds " << Extra << " cycles.\n");
852 LLVM_DEBUG(dbgs() << "Exceeds limit of " << CritLimit << '\n');
861 LLVM_DEBUG(dbgs() << "TBB data adds " << Extra << " cycles.\n");
863 LLVM_DEBUG(dbgs() << "Exceeds limit of " << CritLimit << '\n');
872 LLVM_DEBUG(dbgs() << "FBB data adds " << Extra << " cycles.\n");
874 LLVM_DEBUG(dbgs() << "Exceeds limit of " << CritLimit << '\n');
899 LLVM_DEBUG(dbgs() << "********** EARLY IF-CONVERSION **********\n"
1034 LLVM_DEBUG(dbgs() << "********** EARLY IF-PREDICATOR **********\n"
lib/CodeGen/ExecutionDomainFix.cpp 164 LLVM_DEBUG(dbgs() << printMBBReference(*MBB) << ": entry\n");
203 LLVM_DEBUG(dbgs() << printMBBReference(*MBB)
248 LLVM_DEBUG(dbgs() << printReg(RC->getRegister(rx), TRI) << ":\t" << *MI);
422 LLVM_DEBUG(dbgs() << "********** FIX EXECUTION DOMAIN: "
lib/CodeGen/ExpandPostRAPseudos.cpp 95 LLVM_DEBUG(dbgs() << "subreg: CONVERTING: " << *MI);
101 LLVM_DEBUG(dbgs() << "subreg: replaced by: " << *MI);
114 LLVM_DEBUG(dbgs() << "subreg: replace by: " << *MI);
117 LLVM_DEBUG(dbgs() << "subreg: eliminated!");
126 LLVM_DEBUG(dbgs() << "subreg: " << *CopyMI);
129 LLVM_DEBUG(dbgs() << '\n');
137 LLVM_DEBUG(dbgs() << "dead copy: " << *MI);
139 LLVM_DEBUG(dbgs() << "replaced by: " << *MI);
148 LLVM_DEBUG(dbgs() << (IdentityCopy ? "identity copy: " : "undef copy: ")
156 LLVM_DEBUG(dbgs() << "replaced by: " << *MI);
164 LLVM_DEBUG(dbgs() << "real copy: " << *MI);
170 LLVM_DEBUG({
182 LLVM_DEBUG(dbgs() << "Machine Function\n"
lib/CodeGen/FaultMaps.cpp 64 LLVM_DEBUG(dbgs() << "********** Fault Map Output **********\n");
71 LLVM_DEBUG(dbgs() << WFMP << "#functions = " << FunctionInfos.size() << "\n");
74 LLVM_DEBUG(dbgs() << WFMP << "functions:\n");
84 LLVM_DEBUG(dbgs() << WFMP << " function addr: " << *FnLabel << "\n");
87 LLVM_DEBUG(dbgs() << WFMP << " #faulting PCs: " << FFI.size() << "\n");
93 LLVM_DEBUG(dbgs() << WFMP << " fault type: "
97 LLVM_DEBUG(dbgs() << WFMP << " faulting PC offset: "
101 LLVM_DEBUG(dbgs() << WFMP << " fault handler PC offset: "
lib/CodeGen/GlobalISel/CSEInfo.cpp 153 LLVM_DEBUG(dbgs() << "CSEInfo::Found Instr " << *Inst->MI;);
172 LLVM_DEBUG(dbgs() << "CSEInfo::Recording new MI " << *MI);
179 LLVM_DEBUG(dbgs() << "CSEInfo::Handling recorded MI " << *MI);
238 LLVM_DEBUG(dbgs() << "CSEInfo::Add MI: " << MI);
259 LLVM_DEBUG(for (auto &It
lib/CodeGen/GlobalISel/CallLowering.cpp 333 LLVM_DEBUG(dbgs()
359 LLVM_DEBUG(
388 LLVM_DEBUG(dbgs() << "Cannot analyze " << EVT(VT).getEVTString()
lib/CodeGen/GlobalISel/Combiner.cpp 65 LLVM_DEBUG(dbgs() << "Erasing: " << MI << "\n");
69 LLVM_DEBUG(dbgs() << "Creating: " << MI << "\n");
71 LLVM_DEBUG(CreatedInstrs.insert(&MI));
74 LLVM_DEBUG(dbgs() << "Changing: " << MI << "\n");
78 LLVM_DEBUG(dbgs() << "Changed: " << MI << "\n");
83 LLVM_DEBUG(for (const auto *MI
88 LLVM_DEBUG(CreatedInstrs.clear());
113 LLVM_DEBUG(dbgs() << "Generic MI Combiner for: " << MF.getName() << '\n');
140 LLVM_DEBUG(dbgs() << *CurMI << "Is dead; erasing.\n");
151 LLVM_DEBUG(dbgs() << "\nTry combining " << *CurrInst;);
lib/CodeGen/GlobalISel/CombinerHelper.cpp 419 LLVM_DEBUG(dbgs() << "Preferred use is: " << *Preferred.MI);
571 LLVM_DEBUG(dbgs() << "Searching for post-indexing opportunity for: " << MI);
580 LLVM_DEBUG(dbgs() << " Ignoring candidate with illegal addrmode: "
590 LLVM_DEBUG(dbgs() << " Ignoring candidate with offset after mem-op: "
608 LLVM_DEBUG(
614 LLVM_DEBUG(dbgs() << " Found match: " << Use);
641 LLVM_DEBUG(dbgs() << "Found potential pre-indexed load_store: " << MI);
645 LLVM_DEBUG(dbgs() << " Skipping, not legal for target");
651 LLVM_DEBUG(dbgs() << " Skipping, frame index would need copy anyway.");
658 LLVM_DEBUG(dbgs() << " Skipping, storing base so need copy anyway.");
665 LLVM_DEBUG(dbgs() << " Skipping, does not dominate all addr uses");
675 LLVM_DEBUG(dbgs() << " Skipping, does not dominate all addr uses.");
731 LLVM_DEBUG(dbgs() << " Combinined to indexed operation");
1095 LLVM_DEBUG(dbgs() << "Inlining memcpy: " << MI << " into loads & stores\n");
1202 LLVM_DEBUG(dbgs() << "Inlining memmove: " << MI << " into loads & stores\n");
lib/CodeGen/GlobalISel/GISelKnownBits.cpp 315 LLVM_DEBUG(
321 LLVM_DEBUG(dbgs() << '[' << Depth << "] Shift is " << Shift << '\n');
366 LLVM_DEBUG(dbgs() << "[" << Depth << "] Compute known bits: " << MI << "["
lib/CodeGen/GlobalISel/IRTranslator.cpp 137 LLVM_DEBUG(dbgs() << "Checking DILocation from " << *CurrInst
471 LLVM_DEBUG({
808 LLVM_DEBUG(dbgs() << "Switch to bit test optimization unimplemented");
815 LLVM_DEBUG(dbgs() << "Failed to lower jump table");
824 LLVM_DEBUG(dbgs() << "Failed to lower switch range");
1323 LLVM_DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
lib/CodeGen/GlobalISel/InstructionSelect.cpp 72 LLVM_DEBUG(dbgs() << "Selecting function: " << MF.getName() << '\n');
125 LLVM_DEBUG(dbgs() << "Selecting: \n " << MI);
130 LLVM_DEBUG(dbgs() << "Is dead; erasing.\n");
143 LLVM_DEBUG({
244 LLVM_DEBUG({
lib/CodeGen/GlobalISel/Legalizer.cpp 110 LLVM_DEBUG(dbgs() << ".. .. New MI: " << MI);
111 LLVM_DEBUG(NewMIs.push_back(&MI));
116 LLVM_DEBUG({
124 LLVM_DEBUG(dbgs() << ".. .. Erasing: " << MI);
130 LLVM_DEBUG(dbgs() << ".. .. Changing MI: " << MI);
136 LLVM_DEBUG(dbgs() << ".. .. Changed MI: " << MI);
147 LLVM_DEBUG(dbgs() << "Legalize Machine IR for: " << MF.getName() << '\n');
223 LLVM_DEBUG(dbgs() << MI << "Is dead; erasing.\n");
262 LLVM_DEBUG(dbgs() << MI << "Is dead\n");
272 LLVM_DEBUG(dbgs() << *DeadMI << "Is dead\n");
lib/CodeGen/GlobalISel/LegalizerHelper.cpp 84 LLVM_DEBUG(dbgs() << "Legalizing: "; MI.print(dbgs()));
93 LLVM_DEBUG(dbgs() << ".. Already legal\n");
96 LLVM_DEBUG(dbgs() << ".. Convert to libcall\n");
99 LLVM_DEBUG(dbgs() << ".. Narrow scalar\n");
102 LLVM_DEBUG(dbgs() << ".. Widen scalar\n");
105 LLVM_DEBUG(dbgs() << ".. Lower\n");
108 LLVM_DEBUG(dbgs() << ".. Reduce number of elements\n");
111 LLVM_DEBUG(dbgs() << ".. Increase number of elements\n");
114 LLVM_DEBUG(dbgs() << ".. Custom legalization\n");
118 LLVM_DEBUG(dbgs() << ".. Unable to legalize\n");
528 LLVM_DEBUG(dbgs() << "Size " << Size << " too large to legalize.\n");
671 LLVM_DEBUG(dbgs() << "Can't narrow sext to type " << NarrowTy << "\n");
709 LLVM_DEBUG(dbgs() << "Can't narrow trunc to type " << NarrowTy << "\n");
lib/CodeGen/GlobalISel/LegalizerInfo.cpp 181 LLVM_DEBUG(dbgs() << "Applying legalizer ruleset to: "; Query.print(dbgs());
184 LLVM_DEBUG(dbgs() << ".. fallback to legacy rules (no rules defined)\n");
189 LLVM_DEBUG(dbgs() << ".. match\n");
191 LLVM_DEBUG(dbgs() << ".. .. " << Rule.getAction() << ", "
198 LLVM_DEBUG(dbgs() << ".. no match\n");
200 LLVM_DEBUG(dbgs() << ".. unsupported\n");
207 LLVM_DEBUG(
213 LLVM_DEBUG(dbgs() << ".. type index coverage check SKIPPED:"
219 LLVM_DEBUG(dbgs() << ".. the first uncovered type index: " << FirstUncovered
230 LLVM_DEBUG(
236 LLVM_DEBUG(dbgs() << ".. imm index coverage check SKIPPED:"
241 LLVM_DEBUG(dbgs() << ".. the first uncovered imm index: " << FirstUncovered
410 LLVM_DEBUG(dbgs() << ".. opcode " << Opcode << " is aliased to " << Alias
465 LLVM_DEBUG(dbgs() << ".. (legacy) Type " << i << " Action="
469 LLVM_DEBUG(dbgs() << ".. (legacy) Type " << i << " Legal\n");
471 LLVM_DEBUG(dbgs() << ".. (legacy) Legal\n");
708 LLVM_DEBUG(dbgs() << MII.getName(Opcode) << " (opcode " << Opcode
lib/CodeGen/GlobalISel/Localizer.cpp 121 LLVM_DEBUG(dbgs() << "Should localize: " << MI);
133 LLVM_DEBUG(MachineInstr &MIUse = *MOUse.getParent();
138 LLVM_DEBUG(dbgs() << "Fixing non-local use\n");
159 LLVM_DEBUG(dbgs() << "Inserted: " << *LocalizedMI);
161 LLVM_DEBUG(dbgs() << "Update use with: " << printReg(NewVRegIt->second)
198 LLVM_DEBUG(dbgs() << "Intra-block: moving " << *MI << " before " << *&*II
214 LLVM_DEBUG(dbgs() << "Localize instructions for: " << MF.getName() << '\n');
lib/CodeGen/GlobalISel/RegBankSelect.cpp 77 LLVM_DEBUG(dbgs() << "RegBankSelect mode overrided by command line\n");
125 LLVM_DEBUG(dbgs() << "Does assignment already match: ";
166 LLVM_DEBUG(dbgs() << "Copy: " << printReg(Src) << " to: " << printReg(Dst)
302 LLVM_DEBUG(dbgs() << "New best: " << CurCost << '\n');
454 LLVM_DEBUG(dbgs() << "Evaluating mapping cost for: " << MI);
455 LLVM_DEBUG(dbgs() << "With: " << InstrMapping << '\n');
458 LLVM_DEBUG(dbgs() << "Mapping is too expensive from the start\n");
474 LLVM_DEBUG(dbgs() << "Opd" << OpIdx << '\n');
480 LLVM_DEBUG(dbgs() << "=> is free (match).\n");
484 LLVM_DEBUG(dbgs() << "=> is free (simple assignment).\n");
503 LLVM_DEBUG(dbgs() << "Mapping involves impossible repairing\n");
566 LLVM_DEBUG(dbgs() << "Mapping is too expensive, stop processing\n");
576 LLVM_DEBUG(dbgs() << "Total cost is: " << Cost << "\n");
616 LLVM_DEBUG(dbgs() << "Actual mapping of the operands: " << OpdMapper << '\n');
623 LLVM_DEBUG(dbgs() << "Assign: " << MI);
644 LLVM_DEBUG(dbgs() << "Best Mapping: " << *BestMapping << '\n');
657 LLVM_DEBUG(dbgs() << "Assign register banks for: " << MF.getName() << '\n');
706 LLVM_DEBUG(dbgs() << "Instruction mapping changed control flow\n");
lib/CodeGen/GlobalISel/RegisterBankInfo.cpp 75 LLVM_DEBUG(dbgs() << "Verify " << RegBank << '\n');
436 LLVM_DEBUG(dbgs() << "Applying default-like mapping\n");
440 LLVM_DEBUG(dbgs() << "OpIdx " << OpIdx);
443 LLVM_DEBUG(dbgs() << " is not a register, nothing to be done\n");
447 LLVM_DEBUG(dbgs() << " is %%noreg, nothing to be done\n");
459 LLVM_DEBUG(dbgs() << " has not been repaired, nothing to be done\n");
464 LLVM_DEBUG(dbgs() << " changed, replace " << printReg(OrigReg, nullptr));
466 LLVM_DEBUG(dbgs() << " with " << printReg(NewReg, nullptr));
480 LLVM_DEBUG(dbgs() << "\nChange type of new opd from " << NewTy << " to "
484 LLVM_DEBUG(dbgs() << '\n');
lib/CodeGen/GlobalISel/Utils.cpp 128 LLVM_DEBUG(dbgs() << "Converting operand: " << MO << '\n');
lib/CodeGen/GlobalMerge.cpp 445 LLVM_DEBUG(dbgs() << " Trying to merge set, starts with #"
lib/CodeGen/HardwareLoops.cpp 178 LLVM_DEBUG(dbgs() << "HWLoops: Running on " << F.getName() << "\n");
234 LLVM_DEBUG(dbgs() << "HWLoops: Try to convert profitable loop: " << *L);
259 LLVM_DEBUG(dbgs() << "HWLoops: Converting loop..\n");
297 LLVM_DEBUG(dbgs() << " - Found condition: " << *ICmp << "\n");
318 LLVM_DEBUG(dbgs() << "HWLoops: Initialising loop counter value:\n");
335 LLVM_DEBUG(dbgs() << " - Attempting to use test.set counter.\n");
346 LLVM_DEBUG(dbgs() << "- Bailing, unsafe to expand ExitCount "
363 LLVM_DEBUG(dbgs() << " - Loop Count: " << *Count << "\n"
388 LLVM_DEBUG(dbgs() << "HWLoops: Inserted loop counter: "
411 LLVM_DEBUG(dbgs() << "HWLoops: Inserted loop dec: " << *NewCond << "\n");
425 LLVM_DEBUG(dbgs() << "HWLoops: Inserted loop dec: " << *Call << "\n");
437 LLVM_DEBUG(dbgs() << "HWLoops: PHI Counter: " << *Index << "\n");
lib/CodeGen/IfConversion.cpp 309 LLVM_DEBUG(dbgs() << "Common inst: " << I);
313 LLVM_DEBUG(dbgs() << "Common inst: " << I);
323 LLVM_DEBUG(dbgs() << "Saving branch: " << I);
326 LLVM_DEBUG(dbgs() << "Common inst: " << I);
332 LLVM_DEBUG(dbgs() << "Saving branch: " << I);
335 LLVM_DEBUG(dbgs() << "Common inst: " << I);
341 LLVM_DEBUG(dbgs() << "Saving branch: " << I);
354 LLVM_DEBUG(dbgs() << "Predicating: " << I);
360 LLVM_DEBUG(dbgs() << "Predicating: " << I);
375 LLVM_DEBUG(dbgs() << "MeetIfcvtSizeLimit(BranchBytes=" << BranchBytes
389 LLVM_DEBUG(dbgs() << "MeetIfcvtSizeLimit(TCycle=" << TCycle
464 LLVM_DEBUG(dbgs() << "\nIfcvt: function (" << ++FnNum << ") \'"
468 LLVM_DEBUG(dbgs() << " skipped\n");
471 LLVM_DEBUG(dbgs() << "\n");
509 LLVM_DEBUG(dbgs() << "Ifcvt (Simple"
516 LLVM_DEBUG(dbgs() << (RetVal ? "succeeded!" : "failed!") << "\n");
533 LLVM_DEBUG(dbgs() << "Ifcvt (Triangle");
535 LLVM_DEBUG(dbgs() << " false");
537 LLVM_DEBUG(dbgs() << " rev");
538 LLVM_DEBUG(dbgs() << "): " << printMBBReference(*BBI.BB)
542 LLVM_DEBUG(dbgs() << (RetVal ? "succeeded!" : "failed!") << "\n");
556 LLVM_DEBUG(dbgs() << "Ifcvt (Diamond): " << printMBBReference(*BBI.BB)
562 LLVM_DEBUG(dbgs() << (RetVal ? "succeeded!" : "failed!") << "\n");
567 LLVM_DEBUG(dbgs() << "Ifcvt (Forked Diamond): "
574 LLVM_DEBUG(dbgs() << (RetVal ? "succeeded!" : "failed!") << "\n");
lib/CodeGen/InlineSpiller.cpp 343 LLVM_DEBUG(dbgs() << "\talso spill snippet " << SnipLI << '\n');
394 LLVM_DEBUG(dbgs() << "\tmerged orig valno " << OrigVNI->id << ": "
416 LLVM_DEBUG(dbgs() << "\thoisted: " << SrcVNI->def << '\t' << *MII);
435 LLVM_DEBUG(dbgs() << "Checking redundant spills for " << VNI->id << '@'
444 LLVM_DEBUG(dbgs() << "Merged to stack int: " << *StackInt << '\n');
472 LLVM_DEBUG(dbgs() << "Redundant spill " << Idx << '\t' << MI);
556 LLVM_DEBUG(dbgs() << "\tadding <undef> flags: ");
562 LLVM_DEBUG(dbgs() << UseIdx << '\t' << MI);
576 LLVM_DEBUG(dbgs() << "\tcannot remat for " << UseIdx << '\t' << MI);
584 LLVM_DEBUG(dbgs() << "\tcannot remat tied reg: " << UseIdx << '\t' << MI);
601 LLVM_DEBUG(dbgs() << "\tcannot remat for " << UseIdx << '\t' << MI);
618 LLVM_DEBUG(dbgs() << "\tremat: " << DefIdx << '\t'
629 LLVM_DEBUG(dbgs() << "\t " << UseIdx << '\t' << MI << '\n');
677 LLVM_DEBUG(dbgs() << "All defs dead: " << *MI);
686 LLVM_DEBUG(dbgs() << "Remat created " << DeadDefs.size() << " dead defs.\n");
709 LLVM_DEBUG(dbgs() << RegsToSpill.size()
732 LLVM_DEBUG(dbgs() << "Coalescing stack access: " << *MI);
890 LLVM_DEBUG(dumpMachineInstrRangeWithSlotIndex(MIS.begin(), MIS.end(), LIS,
914 LLVM_DEBUG(dumpMachineInstrRangeWithSlotIndex(MIS.begin(), MI, LIS, "reload",
954 LLVM_DEBUG(dumpMachineInstrRangeWithSlotIndex(std::next(MI), MIS.end(), LIS,
963 LLVM_DEBUG(dbgs() << "spillAroundUses " << printReg(Reg) << '\n');
976 LLVM_DEBUG(dbgs() << "Modifying debug info due to spill:\t" << *MI);
1010 LLVM_DEBUG(dbgs() << "Found new snippet copy: " << *MI);
1053 LLVM_DEBUG(dbgs() << "\trewrite: " << Idx << '\t' << *MI << '\n');
1079 LLVM_DEBUG(dbgs() << "Merged spilled regs: " << *StackInt << '\n');
1087 LLVM_DEBUG(dbgs() << "Eliminating " << DeadDefs.size() << " dead defs\n");
1119 LLVM_DEBUG(dbgs() << "Inline spilling "
1306 LLVM_DEBUG(dbgs() << "Orders size is " << Orders.size() << "\n");
1309 LLVM_DEBUG(dbgs() << "BB" << (*RIt)->getBlock()->getNumber() << ",");
1310 LLVM_DEBUG(dbgs() << "\n");
1419 LLVM_DEBUG({
1475 LLVM_DEBUG({
1490 LLVM_DEBUG({
lib/CodeGen/InterleavedAccessPass.cpp 340 LLVM_DEBUG(dbgs() << "IA: Found an interleaved load: " << *LI << "\n");
432 LLVM_DEBUG(dbgs() << "IA: Found an interleaved store: " << *SI << "\n");
449 LLVM_DEBUG(dbgs() << "*** " << getPassName() << ": " << F.getName() << "\n");
lib/CodeGen/InterleavedLoadCombinePass.cpp 1117 LLVM_DEBUG(dbgs() << "Checking interleaved load\n");
1322 LLVM_DEBUG(dbgs() << "*** " << getPassName() << ": " << F.getName()
lib/CodeGen/LazyMachineBlockFrequencyInfo.cpp 59 LLVM_DEBUG(dbgs() << "MachineBlockFrequencyInfo is available\n");
66 LLVM_DEBUG(dbgs() << "Building MachineBlockFrequencyInfo on the fly\n");
67 LLVM_DEBUG(if (MLI) dbgs() << "LoopInfo is available\n");
70 LLVM_DEBUG(dbgs() << "Building LoopInfo on the fly\n");
72 LLVM_DEBUG(if (MDT) dbgs() << "DominatorTree is available\n");
75 LLVM_DEBUG(dbgs() << "Building DominatorTree on the fly\n");
lib/CodeGen/LiveDebugValues.cpp 767 LLVM_DEBUG({
780 LLVM_DEBUG({
793 LLVM_DEBUG({
929 LLVM_DEBUG(dbgs() << "Examining instruction: "; MI.dump(););
963 LLVM_DEBUG(dbgs() << "Recognized as spill: "; MI.dump(););
964 LLVM_DEBUG(dbgs() << "Register: " << Reg << " " << printReg(Reg, TRI)
970 LLVM_DEBUG(dbgs() << "Recognized as restore: "; MI.dump(););
971 LLVM_DEBUG(dbgs() << "Register: " << Reg << " " << printReg(Reg, TRI)
978 LLVM_DEBUG(dbgs() << "Spilling Register " << printReg(Reg, TRI) << '('
983 LLVM_DEBUG(dbgs() << "Restoring Register " << printReg(Reg, TRI) << '('
1040 LLVM_DEBUG(for (unsigned ID
1136 LLVM_DEBUG(dbgs() << "join MBB: " << MBB.getNumber() << "\n");
1151 LLVM_DEBUG(dbgs() << " ignoring unvisited pred MBB: " << p->getNumber()
1167 LLVM_DEBUG({
1185 LLVM_DEBUG({
1247 LLVM_DEBUG(dbgs() << "Inserted: "; MI->dump(););
1255 LLVM_DEBUG(dbgs() << "\nDebug Range Extension\n");
1344 LLVM_DEBUG(printVarLocInMBB(MF, OutLocs, VarLocIDs,
1365 LLVM_DEBUG(dbgs() << "Processing Worklist\n");
1384 LLVM_DEBUG(printVarLocInMBB(MF, OutLocs, VarLocIDs,
1386 LLVM_DEBUG(printVarLocInMBB(MF, InLocs, VarLocIDs,
1417 LLVM_DEBUG(printVarLocInMBB(MF, OutLocs, VarLocIDs, "Final OutLocs", dbgs()));
1418 LLVM_DEBUG(printVarLocInMBB(MF, InLocs, VarLocIDs, "Final InLocs", dbgs()));
lib/CodeGen/LiveDebugVariables.cpp 604 LLVM_DEBUG(dbgs() << "Can't handle " << MI);
623 LLVM_DEBUG(dbgs() << "Discarding debug info (no LIS interval): " << Idx
635 LLVM_DEBUG(dbgs() << "Discarding debug info (reg not live): " << Idx
661 LLVM_DEBUG(dbgs() << "Can't handle " << MI);
805 LLVM_DEBUG(dbgs() << "Got " << CopyValues.size() << " copies of " << *LI
820 LLVM_DEBUG(dbgs() << "Kill at " << Idx << " covered by valno #"
961 LLVM_DEBUG(dbgs() << "********** COMPUTING LIVE DEBUG VARIABLES: "
966 LLVM_DEBUG(print(dbgs()));
1012 LLVM_DEBUG({
1095 LLVM_DEBUG(dbgs() << "Erasing [" << LocMapI.start() << ';'
1107 LLVM_DEBUG({
1352 LLVM_DEBUG(dbgs() << "\t[" << Start << ';' << Stop << "):" << Loc.locNo());
1356 LLVM_DEBUG(dbgs() << ' ' << printMBBReference(*MBB) << '-' << MBBEnd);
1367 LLVM_DEBUG(dbgs() << ' ' << printMBBReference(*MBB) << '-' << MBBEnd);
1371 LLVM_DEBUG(dbgs() << '\n');
1380 LLVM_DEBUG(dbgs() << "\t" << loc);
1383 LLVM_DEBUG(dbgs() << ' ' << printMBBReference(*MBB));
1386 LLVM_DEBUG(dbgs() << '\n');
1390 LLVM_DEBUG(dbgs() << "********** EMITTING LIVE DEBUG VARIABLES **********\n");
1396 LLVM_DEBUG(userValue->print(dbgs(), TRI));
1400 LLVM_DEBUG(dbgs() << "********** EMITTING LIVE DEBUG LABELS **********\n");
1402 LLVM_DEBUG(userLabel->print(dbgs(), TRI));
lib/CodeGen/LiveIntervals.cpp 150 LLVM_DEBUG(dump());
313 LLVM_DEBUG(dbgs() << "Computing live-in reg-units in ABI blocks.\n");
326 LLVM_DEBUG(dbgs() << Begin << "\t" << printMBBReference(MBB));
338 LLVM_DEBUG(dbgs() << ' ' << printRegUnit(Unit, TRI) << '#' << VNI->id);
341 LLVM_DEBUG(dbgs() << '\n');
343 LLVM_DEBUG(dbgs() << "Created " << NewRanges.size() << " new intervals.\n");
413 LLVM_DEBUG(dbgs() << " live-in at " << BlockStart << '\n');
443 LLVM_DEBUG(dbgs() << "Shrink: " << *li << '\n');
472 LLVM_DEBUG(
496 LLVM_DEBUG(dbgs() << "Shrunk: " << *li << '\n');
526 LLVM_DEBUG(dbgs() << "Dead PHI at " << Def << " may separate interval\n");
534 LLVM_DEBUG(dbgs() << "All defs dead: " << Def << '\t' << *MI);
543 LLVM_DEBUG(dbgs() << "Shrink: " << SR << '\n');
602 LLVM_DEBUG(dbgs() << "Dead PHI at " << VNI->def
609 LLVM_DEBUG(dbgs() << "Shrunk: " << SR << '\n');
973 LLVM_DEBUG(dbgs() << "handleMove " << OldIdx << " -> " << NewIdx << ": "
1024 LLVM_DEBUG({
1039 LLVM_DEBUG(dbgs() << " -->\t" << LR << '\n');
1658 LLVM_DEBUG(dbgs() << " Split " << NumComp << " components: " << LI << '\n');
lib/CodeGen/LiveRangeEdit.cpp 222 LLVM_DEBUG(dbgs() << "Try to fold single def: " << *DefMI
232 LLVM_DEBUG(dbgs() << " folded: " << *FoldMI);
271 LLVM_DEBUG(dbgs() << "Won't delete: " << Idx << '\t' << *MI);
278 LLVM_DEBUG(dbgs() << "Can't delete: " << Idx << '\t' << *MI);
282 LLVM_DEBUG(dbgs() << "Deleting dead def " << Idx << '\t' << *MI);
356 LLVM_DEBUG(dbgs() << "Converted physregs to:\t" << *MI);
469 LLVM_DEBUG({
lib/CodeGen/LiveRangeShrink.cpp 113 LLVM_DEBUG(dbgs() << "**** Analysing " << MF.getName() << '\n');
lib/CodeGen/LiveRegMatrix.cpp 104 LLVM_DEBUG(dbgs() << "assigning " << printReg(VirtReg.reg, TRI) << " to "
111 LLVM_DEBUG(dbgs() << ' ' << printRegUnit(Unit, TRI) << ' ' << Range);
117 LLVM_DEBUG(dbgs() << '\n');
122 LLVM_DEBUG(dbgs() << "unassigning " << printReg(VirtReg.reg, TRI) << " from "
128 LLVM_DEBUG(dbgs() << ' ' << printRegUnit(Unit, TRI));
134 LLVM_DEBUG(dbgs() << '\n');
lib/CodeGen/LocalStackSlotAllocation.cpp 160 LLVM_DEBUG(dbgs() << "Allocate FI(" << FrameIdx << ") to local offset "
362 LLVM_DEBUG(dbgs() << "Considering: " << MI);
378 LLVM_DEBUG(dbgs() << " Replacing FI in: " << MI);
388 LLVM_DEBUG(dbgs() << " Reusing base register " << BaseReg << "\n");
416 LLVM_DEBUG(dbgs() << " Materializing base register " << BaseReg
439 LLVM_DEBUG(dbgs() << "Resolved: " << MI);
lib/CodeGen/MIRCanonicalizerPass.cpp 125 LLVM_DEBUG({
219 LLVM_DEBUG(dbgs() << "Operand " << 0 << " of "; II->dump(); MO.dump(););
267 LLVM_DEBUG({
289 LLVM_DEBUG(
297 LLVM_DEBUG(
382 LLVM_DEBUG(dbgs() << "\n Canonicalizing BasicBlock " << MBB->getName()
387 LLVM_DEBUG({
394 LLVM_DEBUG({
404 LLVM_DEBUG(dbgs() << "\n\n NEW BASIC BLOCK: " << MBB->getName() << "\n\n";);
406 LLVM_DEBUG(dbgs() << "MBB Before Canonical Copy Propagation:\n";
409 LLVM_DEBUG(dbgs() << "MBB After Canonical Copy Propagation:\n"; MBB->dump(););
411 LLVM_DEBUG(dbgs() << "MBB Before Scheduling:\n"; MBB->dump(););
414 LLVM_DEBUG(dbgs() << "MBB After Scheduling:\n"; MBB->dump(););
444 LLVM_DEBUG(dbgs() << "Updated MachineBasicBlock:\n"; MBB->dump();
446 LLVM_DEBUG(
457 LLVM_DEBUG(dbgs() << "\n Canonicalizing Function " << MF.getName()
465 LLVM_DEBUG(
lib/CodeGen/MIRVRegNamerUtils.cpp 74 LLVM_DEBUG(dbgs() << "Found Candidate: "; MI->dump(););
95 LLVM_DEBUG(dbgs() << "Popping frame index.\n";);
104 LLVM_DEBUG({
116 LLVM_DEBUG(dbgs() << "Popping physreg.\n";);
132 LLVM_DEBUG({
144 LLVM_DEBUG(dbgs() << "Pushing frame index.\n";);
171 LLVM_DEBUG(dbgs() << "Skipping rename for FI " << LastRenameReg << "\n";);
188 LLVM_DEBUG({
196 LLVM_DEBUG(dbgs() << "Vreg " << Reg
204 LLVM_DEBUG(dbgs() << "Mapping vreg ";);
206 LLVM_DEBUG(auto foo = &*MRI.reg_begin(Reg); foo->dump(););
208 LLVM_DEBUG(dbgs() << Reg;);
210 LLVM_DEBUG(dbgs() << " to ";);
212 LLVM_DEBUG(auto foo = &*MRI.reg_begin(Rename); foo->dump(););
214 LLVM_DEBUG(dbgs() << Rename;);
216 LLVM_DEBUG(dbgs() << "\n";);
282 LLVM_DEBUG(dbgs() << "Enqueue register"; MO.dump(); dbgs() << "\n";);
299 LLVM_DEBUG(dbgs() << "Enqueue Reg/FI"; MO.dump(); dbgs() << "\n";);
lib/CodeGen/MachineBasicBlock.cpp 884 LLVM_DEBUG(dbgs() << "Splitting critical edge: " << printMBBReference(*this)
915 LLVM_DEBUG(dbgs() << "Removing terminator kill: " << *MI);
1001 LLVM_DEBUG(dbgs() << "Restored terminator kill: " << *I);
1134 LLVM_DEBUG(dbgs() << "Won't split critical edge after degenerate "
lib/CodeGen/MachineBlockPlacement.cpp 659 LLVM_DEBUG(dbgs() << " " << getBlockName(Succ)
1027 LLVM_DEBUG(dbgs() << "Trellis, but not one of the chosen edges.\n");
1044 LLVM_DEBUG(BranchProbability Succ2Prob = getAdjustedProbability(
1059 LLVM_DEBUG(BranchProbability SuccProb = getAdjustedProbability(
1168 LLVM_DEBUG(dbgs() << "Pre-computing triangle chains.\n");
1242 LLVM_DEBUG(dbgs() << "Marking edge: " << getBlockName(src) << "->"
1450 LLVM_DEBUG(dbgs() << " Not a candidate: " << getBlockName(Succ) << " -> "
1481 LLVM_DEBUG(dbgs() << "Selecting best successor for: " << getBlockName(BB)
1523 LLVM_DEBUG(
1530 LLVM_DEBUG(dbgs() << " Not the best candidate, continuing\n");
1534 LLVM_DEBUG(dbgs() << " Setting it as best candidate\n");
1556 LLVM_DEBUG(dbgs() << " Candidate: " << getBlockName(Succ)
1566 LLVM_DEBUG(dbgs() << " Selected: " << getBlockName(BestSucc.BB) << "\n");
1612 LLVM_DEBUG(dbgs() << " " << getBlockName(MBB) << " -> ";
1739 LLVM_DEBUG(dbgs() << "Unnatural loop CFG detected, forcibly merging the "
1759 LLVM_DEBUG(dbgs() << "Merging from " << getBlockName(BB) << " to "
1766 LLVM_DEBUG(dbgs() << "Finished forming chain for header block "
1963 LLVM_DEBUG(dbgs() << "Finding best loop top for: " << getBlockName(OldTop)
1973 LLVM_DEBUG(dbgs() << " old top pred: " << getBlockName(Pred) << ", has "
2000 LLVM_DEBUG(dbgs() << " final top unchanged\n");
2010 LLVM_DEBUG(dbgs() << " final top: " << getBlockName(BestPred) << "\n");
2071 LLVM_DEBUG(dbgs() << "Finding best loop exit for: "
2095 LLVM_DEBUG(dbgs() << " exiting: " << getBlockName(MBB) << " -> "
2102 LLVM_DEBUG(dbgs() << " looping: " << getBlockName(MBB) << " -> "
2116 LLVM_DEBUG(dbgs() << " exiting: " << getBlockName(MBB) << " -> "
2143 LLVM_DEBUG(
2148 LLVM_DEBUG(dbgs() << " Loop has 1 block, using loop header as exit\n");
2159 LLVM_DEBUG(dbgs() << " Best exiting block: " << getBlockName(ExitingBB)
2270 LLVM_DEBUG(dbgs() << "Rotating loop to put exit " << getBlockName(ExitingBB)
2405 LLVM_DEBUG(dbgs() << "The cost of loop rotation by making "
2416 LLVM_DEBUG(dbgs() << "Rotate loop by making " << getBlockName(*RotationPos)
2520 LLVM_DEBUG({
2579 LLVM_DEBUG(dbgs() << "Pre-merging due to unanalyzable fallthrough: "
2611 LLVM_DEBUG({
2636 LLVM_DEBUG(dbgs() << "[MBP] Function: " << F->getName() << "\n");
2638 LLVM_DEBUG(dbgs() << (ChainBB == *FunctionChain.begin() ? "Placing chain "
2725 LLVM_DEBUG(dbgs() << "Reverse order of the two branches: "
2727 LLVM_DEBUG(dbgs() << " Edge probability: "
2894 LLVM_DEBUG(dbgs() << "Redoing tail duplication for Succ#" << BB->getNumber()
2943 LLVM_DEBUG(dbgs() << "TailDuplicator deleted block: "
lib/CodeGen/MachineCSE.cpp 198 LLVM_DEBUG(dbgs() << "Coalescing: " << *DefMI);
199 LLVM_DEBUG(dbgs() << "*** to: " << *MI);
497 LLVM_DEBUG(dbgs() << "Entering: " << MBB->getName() << '\n');
503 LLVM_DEBUG(dbgs() << "Exiting: " << MBB->getName() << '\n');
587 LLVM_DEBUG(dbgs() << "Examining: " << *MI);
588 LLVM_DEBUG(dbgs() << "*** Found a common subexpression: " << *CSMI);
621 LLVM_DEBUG(dbgs() << "*** Not profitable, avoid CSE!\n");
630 LLVM_DEBUG(
lib/CodeGen/MachineCombiner.cpp 312 LLVM_DEBUG(dbgs() << " Dependence data for " << *Root << "\tNewRootDepth: "
321 LLVM_DEBUG(dbgs() << "\tIt MustReduceDepth ");
322 LLVM_DEBUG(NewRootDepth < RootDepth
341 LLVM_DEBUG(dbgs() << "\n\tNewRootLatency: " << NewRootLatency
347 LLVM_DEBUG(NewCycleCount <= OldCycleCount
350 LLVM_DEBUG(dbgs() << "\n\t\tNewCycleCount = " << NewCycleCount
397 LLVM_DEBUG(dbgs() << "\t\tResource length before replacement: "
400 LLVM_DEBUG(
497 LLVM_DEBUG(dbgs() << "Combining MBB " << MBB->getName() << "\n");
560 LLVM_DEBUG(if (dump_intrs) {
644 LLVM_DEBUG(dbgs() << getPassName() << ": " << MF.getName() << '\n');
646 LLVM_DEBUG(
lib/CodeGen/MachineCopyPropagation.cpp 248 LLVM_DEBUG(dbgs() << "MCP: Copy is used - not dead: "; Copy->dump());
298 LLVM_DEBUG(dbgs() << "MCP: copy is a NOP, removing: "; Copy.dump());
419 LLVM_DEBUG(
436 LLVM_DEBUG(dbgs() << "MCP: Skipping forwarding due to debug counter:\n "
441 LLVM_DEBUG(dbgs() << "MCP: Replacing " << printReg(MOUse.getReg(), TRI)
449 LLVM_DEBUG(dbgs() << "MCP: After replacement: " << MI << "\n");
462 LLVM_DEBUG(dbgs() << "MCP: CopyPropagateBlock " << MBB.getName() << "\n");
513 LLVM_DEBUG(dbgs() << "MCP: Copy is a deletion candidate: "; MI->dump());
594 LLVM_DEBUG(dbgs() << "MCP: Removing copy due to regmask clobbering: ";
620 LLVM_DEBUG(dbgs() << "MCP: Removing copy due to no live-out succ: ";
lib/CodeGen/MachineFrameInfo.cpp 44 LLVM_DEBUG(dbgs() << "Warning: requested alignment " << Alignment.value()
lib/CodeGen/MachineLICM.cpp 320 LLVM_DEBUG(dbgs() << "******** Pre-regalloc Machine LICM: ");
322 LLVM_DEBUG(dbgs() << "******** Post-regalloc Machine LICM: ");
323 LLVM_DEBUG(dbgs() << MF.getName() << " ********\n");
594 LLVM_DEBUG(dbgs() << "Hoisting to " << printMBBReference(*Preheader)
633 LLVM_DEBUG(dbgs() << "Entering " << printMBBReference(*MBB) << '\n');
640 LLVM_DEBUG(dbgs() << "Exiting " << printMBBReference(*MBB) << '\n');
1212 LLVM_DEBUG(dbgs() << "Won't hoist cheap instr with loop PHI use: " << MI);
1231 LLVM_DEBUG(dbgs() << "Hoist High Latency: " << MI);
1249 LLVM_DEBUG(dbgs() << "Hoist non-reg-pressure: " << MI);
1256 LLVM_DEBUG(dbgs() << "Won't hoist instr with loop PHI use: " << MI);
1265 LLVM_DEBUG(dbgs() << "Won't speculate: " << MI);
1273 LLVM_DEBUG(dbgs() << "Can't remat / high reg-pressure: " << MI);
1370 LLVM_DEBUG(dbgs() << "CSEing " << *MI << " with " << *Dup);
1450 LLVM_DEBUG({
lib/CodeGen/MachineOutliner.cpp 1286 LLVM_DEBUG(dbgs() << "OutlinedSomething = " << OutlinedSomething << "\n";);
1441 LLVM_DEBUG({
lib/CodeGen/MachinePipeliner.cpp 250 LLVM_DEBUG(dbgs() << "\n!!! Can not pipeline loop.\n");
321 LLVM_DEBUG(
330 LLVM_DEBUG(
337 LLVM_DEBUG(
433 LLVM_DEBUG(dump());
452 LLVM_DEBUG(dbgs() << "MII = " << MII << " MAX_II = " << MAX_II
457 LLVM_DEBUG(
466 LLVM_DEBUG(dbgs() << "MII > " << SwpMaxMii
480 LLVM_DEBUG({
493 LLVM_DEBUG({
509 LLVM_DEBUG(dbgs() << "No schedule found, return\n");
517 LLVM_DEBUG(
524 LLVM_DEBUG(dbgs() << "numStages:" << numStages << ">" << SwpMaxStages
1016 LLVM_DEBUG(dbgs() << "calculateResMII:\n");
1047 LLVM_DEBUG({
1061 LLVM_DEBUG(dbgs() << "ReservedCycles:" << ReservedCycles
1065 LLVM_DEBUG(if (SwpDebugResource) dbgs()
1075 LLVM_DEBUG(dbgs() << "Retrun Res MII:" << Resmii << "\n");
1366 LLVM_DEBUG({
1428 LLVM_DEBUG({
1614 LLVM_DEBUG(
1668 LLVM_DEBUG(dbgs() << "Clear recurrence node-sets\n");
1814 LLVM_DEBUG(dbgs() << "NodeSet size " << Nodes.size() << "\n");
1820 LLVM_DEBUG(dbgs() << " Bottom up (preds) ");
1824 LLVM_DEBUG(dbgs() << " Top down (succs) ");
1829 LLVM_DEBUG(dbgs() << " Top down (intersect) ");
1835 LLVM_DEBUG(dbgs() << " Bottom up (all) ");
1846 LLVM_DEBUG(dbgs() << " Bottom up (default) ");
1869 LLVM_DEBUG(dbgs() << maxHeight->NodeNum << " ");
1892 LLVM_DEBUG(dbgs() << "\n Switching order to bottom up ");
1914 LLVM_DEBUG(dbgs() << maxDepth->NodeNum << " ");
1941 LLVM_DEBUG(dbgs() << "\n Switching order to top down ");
1947 LLVM_DEBUG(dbgs() << "\nDone with Nodeset\n");
1950 LLVM_DEBUG({
1963 LLVM_DEBUG(dbgs() << "NodeOrder is empty! abort scheduling\n" );
1973 LLVM_DEBUG(dbgs() << "Try to schedule with " << II << "\n");
1990 LLVM_DEBUG({
1996 LLVM_DEBUG({
2032 LLVM_DEBUG({
2043 LLVM_DEBUG(dbgs() << "Schedule Found? " << scheduleFound << " (II=" << II
2286 LLVM_DEBUG({
2317 LLVM_DEBUG({
2330 LLVM_DEBUG({
2736 LLVM_DEBUG(dbgs() << "In a circuit, predecessor ";);
2740 LLVM_DEBUG(dbgs() << "Predecessor ";);
2742 LLVM_DEBUG(dbgs() << Pred->NodeNum << " and successor " << Succ->NodeNum
2748 LLVM_DEBUG({
2857 LLVM_DEBUG(dump(););
2918 LLVM_DEBUG({
2934 LLVM_DEBUG({
2944 LLVM_DEBUG({
2959 LLVM_DEBUG({
2969 LLVM_DEBUG(if (SwpDebugResource) dbgs() << "return true\n\n";);
2974 LLVM_DEBUG({
2984 LLVM_DEBUG({
2996 LLVM_DEBUG({
3007 LLVM_DEBUG({
lib/CodeGen/MachineRegionInfo.cpp 92 LLVM_DEBUG(RI.dump());
lib/CodeGen/MachineSSAUpdater.cpp 206 LLVM_DEBUG(dbgs() << " Inserted PHI: " << *InsertedPHI << "\n");
lib/CodeGen/MachineScheduler.cpp 370 LLVM_DEBUG(dbgs() << "Before MISched:\n"; mf.print(dbgs()));
382 LLVM_DEBUG(LIS->dump());
392 LLVM_DEBUG(LIS->dump());
406 LLVM_DEBUG(dbgs() << "Subtarget disables post-MI-sched.\n");
409 LLVM_DEBUG(dbgs() << "Before post-MI-sched:\n"; mf.print(dbgs()));
561 LLVM_DEBUG(dbgs() << "********** MI Scheduling **********\n");
562 LLVM_DEBUG(dbgs() << MF->getName() << ":" << printMBBReference(*MBB)
747 LLVM_DEBUG(dbgs() << "ScheduleDAGMI::schedule starting\n");
748 LLVM_DEBUG(SchedImpl->dumpPolicy());
758 LLVM_DEBUG(dump());
771 LLVM_DEBUG(dbgs() << "** ScheduleDAGMI::schedule picking next node\n");
811 LLVM_DEBUG({
1006 LLVM_DEBUG(RPTracker.dump());
1021 LLVM_DEBUG(dbgs() << "Live Thru: ";
1036 LLVM_DEBUG(dbgs() << "Top Pressure:\n";
1054 LLVM_DEBUG(dbgs() << TRI->getRegPressureSetName(i) << " Limit " << Limit
1059 LLVM_DEBUG(dbgs() << "Excess PSets: ";
1084 LLVM_DEBUG(dbgs() << " " << TRI->getRegPressureSetName(ID) << ": "
1118 LLVM_DEBUG(dbgs() << " UpdateRegP: SU(" << SU.NodeNum << ") "
1125 LLVM_DEBUG(dbgs() << " LiveReg: " << printVRegOrUnit(Reg, TRI) << "\n");
1153 LLVM_DEBUG(dbgs() << " UpdateRegP: SU(" << SU->NodeNum << ") "
1197 LLVM_DEBUG(dbgs() << "ScheduleDAGMILive::schedule starting\n");
1198 LLVM_DEBUG(SchedImpl->dumpPolicy());
1210 LLVM_DEBUG(dump());
1219 LLVM_DEBUG(dbgs() << "** ScheduleDAGMILive::schedule picking next node\n");
1247 LLVM_DEBUG({
1364 LLVM_DEBUG(dbgs() << "Cyclic Path: SU(" << DefSU->NodeNum << ") -> SU("
1370 LLVM_DEBUG(dbgs() << "Cyclic Critical Path: " << MaxCyclicLatency << "c\n");
1414 LLVM_DEBUG(dbgs() << "Top Pressure:\n"; dumpRegSetPressure(
1451 LLVM_DEBUG(dbgs() << "Bottom Pressure:\n"; dumpRegSetPressure(
1577 LLVM_DEBUG(dbgs() << "Cluster ld/st SU(" << SUa->NodeNum << ") - SU("
1586 LLVM_DEBUG(dbgs() << " Copy Succ SU(" << Succ.getSUnit()->NodeNum
1794 LLVM_DEBUG(dbgs() << "Constraining copy SU(" << CopySU->NodeNum << ")\n");
1798 LLVM_DEBUG(dbgs() << " Local use SU(" << (*I)->NodeNum << ") -> SU("
1804 LLVM_DEBUG(dbgs() << " Global use SU(" << (*I)->NodeNum << ") -> SU("
2002 LLVM_DEBUG(dbgs() << " SU(" << SU->NodeNum << ") uops="
2010 LLVM_DEBUG(dbgs() << " hazard: SU(" << SU->NodeNum << ") must "
2028 LLVM_DEBUG(dbgs() << " SU(" << SU->NodeNum << ") "
2052 LLVM_DEBUG(dbgs() << Available.getName() << " RemLatency SU("
2069 LLVM_DEBUG(dbgs() << " " << Available.getName() << " + Remain MOps: "
2080 LLVM_DEBUG(
2147 LLVM_DEBUG(dbgs() << "Cycle: " << CurrCycle << ' ' << Available.getName()
2168 LLVM_DEBUG(dbgs() << " " << SchedModel->getResourceName(PIdx) << " +"
2180 LLVM_DEBUG(dbgs() << " *** Critical resource "
2189 LLVM_DEBUG(dbgs() << " Resource conflict: "
2219 LLVM_DEBUG(dbgs() << " Ready @" << ReadyCycle << "c\n");
2229 LLVM_DEBUG(dbgs() << " *** Stall until: " << ReadyCycle << "\n");
2258 LLVM_DEBUG(dbgs() << " *** Critical resource NumMicroOps: "
2297 LLVM_DEBUG(dbgs() << " " << Available.getName() << " TopLatency SU("
2302 LLVM_DEBUG(dbgs() << " " << Available.getName() << " BotLatency SU("
2327 LLVM_DEBUG(dbgs() << " Bump cycle to " << (isTop() ? "end" : "begin")
2333 LLVM_DEBUG(dbgs() << " *** Max MOps " << CurrMOps << " at cycle "
2337 LLVM_DEBUG(dumpScheduledState());
2410 LLVM_DEBUG(Pending.dump());
2411 LLVM_DEBUG(Available.dump());
2542 LLVM_DEBUG(dbgs() << " " << CurrZone.Available.getName()
2551 LLVM_DEBUG(if (CurrZone.isResourceLimited()) {
2706 LLVM_DEBUG(dbgs() << "Pick " << (IsTop ? "Top " : "Bot ")
2831 LLVM_DEBUG(
2849 LLVM_DEBUG(dbgs() << "Critical Path(GS-RR ): " << Rem.CriticalPath << '\n');
2979 LLVM_DEBUG(if (Cand.RPDelta.Excess.isValid()) dbgs()
3123 LLVM_DEBUG(traceCandidate(Cand));
3152 LLVM_DEBUG(dbgs() << "Picking from Bot:\n");
3159 LLVM_DEBUG(traceCandidate(BotCand));
3172 LLVM_DEBUG(dbgs() << "Picking from Top:\n");
3179 LLVM_DEBUG(traceCandidate(TopCand));
3199 LLVM_DEBUG(traceCandidate(Cand));
3248 LLVM_DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") "
3271 LLVM_DEBUG(dbgs() << " Rescheduling physreg copy ";
3351 LLVM_DEBUG(dbgs() << "Critical Path: (PGS-RR) " << Rem.CriticalPath << '\n');
3409 LLVM_DEBUG(traceCandidate(Cand));
3441 LLVM_DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") "
3531 LLVM_DEBUG(dbgs() << "Pick node "
lib/CodeGen/MachineSink.cpp 220 LLVM_DEBUG(dbgs() << "Coalescing: " << *DefMI);
221 LLVM_DEBUG(dbgs() << "*** to: " << MI);
304 LLVM_DEBUG(dbgs() << "******** Machine Sinking ********\n");
331 LLVM_DEBUG(dbgs() << " *** Splitting critical edge: "
338 LLVM_DEBUG(dbgs() << " *** Not legal to break critical edge\n");
888 LLVM_DEBUG(dbgs() << "Sink instr " << MI << "\tinto block " << *SuccToSinkTo);
898 LLVM_DEBUG(dbgs() << " *** NOTE: Won't sink load along critical edge.\n");
905 LLVM_DEBUG(dbgs() << " *** NOTE: Critical edge found\n");
911 LLVM_DEBUG(dbgs() << " *** NOTE: Loop header found\n");
917 LLVM_DEBUG(dbgs() << "Sinking along critical edge.\n");
925 LLVM_DEBUG(dbgs() << " *** PUNTING: Not legal or profitable to "
939 LLVM_DEBUG(dbgs() << " *** PUNTING: Not legal or profitable to "
lib/CodeGen/MachineTraceMetrics.cpp 397 LLVM_DEBUG(dbgs() << "Invalidate traces through " << printMBBReference(*MBB)
478 LLVM_DEBUG(dbgs() << "Computing " << getName() << " trace through "
487 LLVM_DEBUG(dbgs() << " pred for " << printMBBReference(*I) << ": ");
491 LLVM_DEBUG({
505 LLVM_DEBUG(dbgs() << " succ for " << printMBBReference(*I) << ": ");
509 LLVM_DEBUG({
532 LLVM_DEBUG(dbgs() << "Invalidate " << printMBBReference(*MBB) << ' '
557 LLVM_DEBUG(dbgs() << "Invalidate " << printMBBReference(*MBB) << ' '
814 LLVM_DEBUG(dbgs() << TBI.CriticalPath << '\t' << Cycle << '\t' << UseMI);
816 LLVM_DEBUG(dbgs() << Cycle << '\t' << UseMI);
861 LLVM_DEBUG(dbgs() << "\nDepths for " << printMBBReference(*MBB) << ":\n");
867 LLVM_DEBUG({
1046 LLVM_DEBUG(dbgs() << "Heights for " << printMBBReference(*MBB) << ":\n");
1051 LLVM_DEBUG({
1082 LLVM_DEBUG(dbgs() << "pred\t" << Height << '\t' << PHI);
1123 LLVM_DEBUG(dbgs() << Cycle << '\t' << MI);
1128 LLVM_DEBUG(dbgs() << TBI.CriticalPath << '\t' << Cycle << '\t' << MI);
1133 LLVM_DEBUG(dbgs() << printMBBReference(*MBB) << " Live-ins:");
1137 LLVM_DEBUG(dbgs() << ' ' << printReg(LIR.Reg) << '@' << LIR.Height);
1144 LLVM_DEBUG(dbgs() << ' ' << printRegUnit(RI->RegUnit, MTM.TRI) << '@'
1147 LLVM_DEBUG(dbgs() << '\n');
1154 LLVM_DEBUG(dbgs() << "Critical path: " << TBI.CriticalPath << '\n');
lib/CodeGen/MacroFusion.cpp 68 LLVM_DEBUG(
82 LLVM_DEBUG(dbgs() << " Bind "; DAG.dumpNodeName(SecondSU);
94 LLVM_DEBUG(dbgs() << " Bind "; DAG.dumpNodeName(*SU); dbgs() << " - ";
lib/CodeGen/ModuloSchedule.cpp 162 LLVM_DEBUG(dbgs() << "New block\n"; KernelBB->dump(););
228 LLVM_DEBUG({
310 LLVM_DEBUG({
1413 LLVM_DEBUG(dbgs() << " -- padding defaults array from " << Defaults.size()
1779 LLVM_DEBUG(dbgs() << "Dynamic: TC > " << TC << "\n");
1783 LLVM_DEBUG(dbgs() << "Static-false: TC > " << TC << "\n");
1794 LLVM_DEBUG(dbgs() << "Static-true: TC > " << TC << "\n");
1820 LLVM_DEBUG(Schedule.dump());
lib/CodeGen/PHIElimination.cpp 278 LLVM_DEBUG(dbgs() << "Reusing " << printReg(IncomingReg) << " for "
302 LLVM_DEBUG(dbgs() << "Remove old kill from " << *OldKill);
304 LLVM_DEBUG(MBB.dump());
599 LLVM_DEBUG(dbgs() << printReg(Reg) << " live-out before critical edge "
616 LLVM_DEBUG({
632 LLVM_DEBUG(dbgs() << "Failed to split critical edge.\n");
lib/CodeGen/PeepholeOptimizer.cpp 698 LLVM_DEBUG(dbgs()
712 LLVM_DEBUG(dbgs() << "findNextSource: PHI limit reached\n");
1146 LLVM_DEBUG(dbgs() << "-- getNewSource\n");
1147 LLVM_DEBUG(dbgs() << " Replacing: " << OrigPHI);
1148 LLVM_DEBUG(dbgs() << " With: " << NewPHI);
1244 LLVM_DEBUG(dbgs() << "-- RewriteSource\n");
1245 LLVM_DEBUG(dbgs() << " Replacing: " << CopyLike);
1246 LLVM_DEBUG(dbgs() << " With: " << *NewCopy);
1463 LLVM_DEBUG(dbgs() << "NAPhysCopy: intervening clobber forbids erasing "
1472 LLVM_DEBUG(dbgs() << "NAPhysCopy: erasing " << MI);
1481 LLVM_DEBUG(dbgs() << "NAPhysCopy: missed opportunity " << MI);
1577 LLVM_DEBUG(dbgs() << "Optimize recurrence chain from " << PHI);
1579 LLVM_DEBUG(dbgs() << "\tInst: " << *(RI.getMI()));
1585 LLVM_DEBUG(dbgs() << "\t\tCommuted: " << *(RI.getMI()));
1597 LLVM_DEBUG(dbgs() << "********** PEEPHOLE OPTIMIZER **********\n");
1598 LLVM_DEBUG(dbgs() << "********** Function: " << MF.getName() << '\n');
1669 LLVM_DEBUG(dbgs()
1679 LLVM_DEBUG(dbgs()
1696 LLVM_DEBUG(dbgs() << "NAPhysCopy: blowing away all info due to "
1773 LLVM_DEBUG(dbgs() << "Replacing: " << *MI);
1774 LLVM_DEBUG(dbgs() << " With: " << *FoldMI);
1798 LLVM_DEBUG(dbgs() << "Encountered load fold barrier on " << *MI);
lib/CodeGen/PostRASchedulerList.cpp 245 LLVM_DEBUG({
311 LLVM_DEBUG(dbgs() << "PostRAScheduler\n");
415 LLVM_DEBUG(dbgs() << "********** List Scheduling **********\n");
416 LLVM_DEBUG(dump());
499 LLVM_DEBUG(dbgs() << "*** Scheduling [" << CurCycle << "]: ");
500 LLVM_DEBUG(dumpNode(*SU));
514 LLVM_DEBUG(dbgs() << "*** Emitting noop in cycle " << CurCycle << '\n');
566 LLVM_DEBUG(dbgs() << "\n*** Examining Available\n";
603 LLVM_DEBUG(
631 LLVM_DEBUG(dbgs() << "*** Max instructions per cycle " << CurCycle
639 LLVM_DEBUG(dbgs() << "*** Finished cycle " << CurCycle << '\n');
644 LLVM_DEBUG(dbgs() << "*** Stall in cycle " << CurCycle << '\n');
lib/CodeGen/ProcessImplicitDefs.cpp 75 LLVM_DEBUG(dbgs() << "Processing " << *MI);
86 LLVM_DEBUG(dbgs() << "Converting to IMPLICIT_DEF: " << *UserMI);
118 LLVM_DEBUG(dbgs() << "Physreg user: " << *UserMI);
127 LLVM_DEBUG(dbgs() << "Keeping physreg: " << *MI);
134 LLVM_DEBUG(dbgs() << "********** PROCESS IMPLICIT DEFS **********\n"
156 LLVM_DEBUG(dbgs() << printMBBReference(*MFI) << " has " << WorkList.size()
lib/CodeGen/PrologEpilogInserter.cpp 651 LLVM_DEBUG(dbgs() << "alloc FI(" << FrameIdx << ") at SP[" << -Offset
655 LLVM_DEBUG(dbgs() << "alloc FI(" << FrameIdx << ") at SP[" << Offset
752 LLVM_DEBUG(dbgs() << "alloc FI(" << FrameIdx << ") scavenged at SP["
756 LLVM_DEBUG(dbgs() << "alloc FI(" << FrameIdx << ") scavenged at SP["
852 LLVM_DEBUG(dbgs() << "alloc FI(" << i << ") at SP[" << -Offset << "]\n");
869 LLVM_DEBUG(dbgs() << "alloc FI(" << i << ") at SP[" << Offset << "]\n");
906 LLVM_DEBUG(dbgs() << "Local frame base offset: " << Offset << "\n");
912 LLVM_DEBUG(dbgs() << "alloc FI(" << Entry.first << ") at SP[" << FIOffset
lib/CodeGen/ReachingDefAnalysis.cpp 50 LLVM_DEBUG(dbgs() << printMBBReference(*MBB) << ": entry\n");
72 LLVM_DEBUG(dbgs() << printMBBReference(*MBB)
112 LLVM_DEBUG(dbgs() << printReg(MO.getReg(), TRI) << ":\t" << CurInstr
145 LLVM_DEBUG(dbgs() << "********** REACHING DEFINITION ANALYSIS **********\n");
lib/CodeGen/RegAllocBase.cpp 94 LLVM_DEBUG(dbgs() << "Dropping unused " << *VirtReg << '\n');
106 LLVM_DEBUG(dbgs() << "\nselectOrSplit "
151 LLVM_DEBUG(dbgs() << "not queueing unused " << *SplitVirtReg << '\n');
156 LLVM_DEBUG(dbgs() << "queuing new interval: " << *SplitVirtReg << "\n");
lib/CodeGen/RegAllocBasic.cpp 221 LLVM_DEBUG(dbgs() << "spilling " << printReg(PhysReg, TRI)
294 LLVM_DEBUG(dbgs() << "spilling: " << VirtReg << '\n');
306 LLVM_DEBUG(dbgs() << "********** BASIC REGISTER ALLOCATION **********\n"
324 LLVM_DEBUG(dbgs() << "Post alloc VirtRegMap:\n" << *VRM << "\n");
lib/CodeGen/RegAllocFast.cpp 316 LLVM_DEBUG(dbgs() << "Spilling " << printReg(VirtReg, TRI)
319 LLVM_DEBUG(dbgs() << " to stack slot #" << FI << '\n');
333 LLVM_DEBUG(dbgs() << "Inserting debug info due to spill:\n" << *NewDV);
344 LLVM_DEBUG(dbgs() << "Reloading " << printReg(VirtReg, TRI) << " into "
561 LLVM_DEBUG(dbgs() << printReg(PhysReg, TRI)
571 LLVM_DEBUG(dbgs() << printReg(VirtReg, TRI) << " corresponding "
583 LLVM_DEBUG(dbgs() << printReg(PhysReg, TRI) << " is disabled.\n");
612 LLVM_DEBUG(dbgs() << "Assigning " << printReg(VirtReg, TRI) << " to "
668 LLVM_DEBUG(dbgs() << "Search register for " << printReg(VirtReg)
678 LLVM_DEBUG(dbgs() << "\tPreferred Register 1: " << printReg(Hint0, TRI)
685 LLVM_DEBUG(dbgs() << "\tPreferred Register 1: " << printReg(Hint0, TRI)
699 LLVM_DEBUG(dbgs() << "\tPreferred Register 0: " << printReg(Hint1, TRI)
706 LLVM_DEBUG(dbgs() << "\tPreferred Register 0: " << printReg(Hint1, TRI)
717 LLVM_DEBUG(dbgs() << "\tRegister: " << printReg(PhysReg, TRI) << ' ');
719 LLVM_DEBUG(dbgs() << "Cost: " << Cost << " BestCost: " << BestCost << '\n');
822 LLVM_DEBUG(dbgs() << "Killing last use: " << MO << '\n');
828 LLVM_DEBUG(dbgs() << "Clearing dubious kill: " << MO << '\n');
831 LLVM_DEBUG(dbgs() << "Clearing dubious dead: " << MO << '\n');
839 LLVM_DEBUG(dbgs() << "Clearing clean kill: " << MO << '\n');
842 LLVM_DEBUG(dbgs() << "Clearing clean dead: " << MO << '\n');
888 LLVM_DEBUG(dbgs() << "Scanning for through registers:");
898 LLVM_DEBUG(dbgs() << ' ' << printReg(Reg));
904 LLVM_DEBUG(dbgs() << "\nChecking for physdef collisions.\n");
918 LLVM_DEBUG(dbgs() << "Allocating tied uses.\n");
927 LLVM_DEBUG(dbgs() << "Operand " << I << "(" << MO
936 LLVM_DEBUG(dbgs() << "Partial redefine: " << MO << '\n');
944 LLVM_DEBUG(dbgs() << "Allocating early clobbers.\n");
966 LLVM_DEBUG(dbgs() << "\tSetting " << printReg(Reg, TRI)
1159 LLVM_DEBUG(dbgs() << " Spilling remaining registers before call.\n");
1203 LLVM_DEBUG(dbgs() << "<< " << MI);
1205 LLVM_DEBUG(dbgs() << "Mark identity copy for removal\n");
1231 LLVM_DEBUG(dbgs() << "Modifying debug info due to spill:" << "\t" << MI);
1236 LLVM_DEBUG(dbgs() << "Unable to allocate vreg used by DBG_VALUE");
1247 LLVM_DEBUG(dbgs() << "\nAllocating " << MBB);
1264 LLVM_DEBUG(
1280 LLVM_DEBUG(dbgs() << "Spilling live registers at end of block.\n");
1289 LLVM_DEBUG(MBB.dump());
1293 LLVM_DEBUG(dbgs() << "********** FAST REGISTER ALLOCATION **********\n"
lib/CodeGen/RegAllocGreedy.cpp 780 LLVM_DEBUG(dbgs() << "missed hint " << printReg(Hint, TRI) << '\n');
799 LLVM_DEBUG(dbgs() << printReg(PhysReg, TRI) << " is available at cost "
828 LLVM_DEBUG(dbgs() << "can reassign: " << VirtReg << " from "
857 LLVM_DEBUG(dbgs() << "should evict: " << B << " w= " << B.weight << '\n');
1057 LLVM_DEBUG(dbgs() << "evicting " << printReg(PhysReg, TRI)
1130 LLVM_DEBUG(dbgs() << TRI->getRegClassName(RC) << " minimum cost = "
1139 LLVM_DEBUG(dbgs() << "Only trying the first " << OrderLimit
1151 LLVM_DEBUG(
1360 LLVM_DEBUG(dbgs() << ", v=" << Visited);
1379 LLVM_DEBUG(dbgs() << "Compact region bundles");
1388 LLVM_DEBUG(dbgs() << ", none.\n");
1393 LLVM_DEBUG(dbgs() << ", cannot spill all interferences.\n");
1400 LLVM_DEBUG(dbgs() << ", none.\n");
1404 LLVM_DEBUG({
1682 LLVM_DEBUG(dbgs() << "splitAroundRegion with " << NumGlobalIntvs
1720 LLVM_DEBUG(dbgs() << printMBBReference(*BI.MBB) << " isolated.\n");
1802 LLVM_DEBUG(dbgs() << "Main interval covers the same " << OrigBlocks
1847 LLVM_DEBUG(dbgs() << "Cost of isolating all blocks = ";
1911 LLVM_DEBUG(dbgs() << printReg(PhysReg, TRI) << "\tno positive bundles\n");
1914 LLVM_DEBUG(dbgs() << printReg(PhysReg, TRI) << "\tstatic = ";
1917 LLVM_DEBUG({
1927 LLVM_DEBUG(dbgs() << ", cannot spill all interferences.\n");
1935 LLVM_DEBUG(dbgs() << " no bundles.\n");
1941 LLVM_DEBUG({
1962 LLVM_DEBUG(dbgs() << "Best split candidate of vreg "
1965 LLVM_DEBUG(dbgs() << "not ");
1966 LLVM_DEBUG(dbgs() << "cause bad eviction chain\n");
1989 LLVM_DEBUG(dbgs() << "Split for " << printReg(Cand.PhysReg, TRI) << " in "
2002 LLVM_DEBUG(dbgs() << "Split for compact region in " << B
2102 LLVM_DEBUG(dbgs() << "Split around " << Uses.size()
2118 LLVM_DEBUG(dbgs() << " skip:\t" << Uses[i] << '\t' << *MI);
2128 LLVM_DEBUG(dbgs() << "All uses were copies.\n");
2250 LLVM_DEBUG({
2263 LLVM_DEBUG(dbgs() << RMS.size() << " regmasks in block:");
2277 LLVM_DEBUG(dbgs() << ' ' << RMS[ri] << ':' << Uses[i] << '-'
2285 LLVM_DEBUG(dbgs() << '\n');
2344 LLVM_DEBUG(dbgs() << printReg(PhysReg, TRI) << ' ' << Uses[SplitBefore]
2349 LLVM_DEBUG(dbgs() << " all\n");
2374 LLVM_DEBUG(dbgs() << " w=" << EstWeight);
2379 LLVM_DEBUG(dbgs() << " (best)");
2390 LLVM_DEBUG(dbgs() << " shrink\n");
2404 LLVM_DEBUG(dbgs() << " end\n");
2408 LLVM_DEBUG(dbgs() << " extend\n");
2417 LLVM_DEBUG(dbgs() << "Best local split range: " << Uses[BestBefore] << '-'
2439 LLVM_DEBUG(dbgs() << "Tagging non-progress ranges: ");
2444 LLVM_DEBUG(dbgs() << printReg(LREdit.get(i)));
2446 LLVM_DEBUG(dbgs() << '\n');
2540 LLVM_DEBUG(dbgs() << "Early abort: too many interferences.\n");
2554 LLVM_DEBUG(
2608 LLVM_DEBUG(dbgs() << "Try last chance recoloring for " << VirtReg << '\n');
2617 LLVM_DEBUG(dbgs() << "Abort because max depth has been reached.\n");
2635 LLVM_DEBUG(dbgs() << "Try to assign: " << VirtReg << " to "
2644 LLVM_DEBUG(
2654 LLVM_DEBUG(dbgs() << "Some interferences cannot be recolored.\n");
2696 LLVM_DEBUG(dbgs() << "Fail to assign: " << VirtReg << " to "
2744 LLVM_DEBUG(dbgs() << "Try to recolor: " << *LI << '\n');
2756 LLVM_DEBUG(dbgs() << "Recoloring of " << *LI
2760 LLVM_DEBUG(dbgs() << "Recoloring of " << *LI
2928 LLVM_DEBUG(dbgs() << "Trying to reconcile hints for: " << printReg(Reg, TRI)
2950 LLVM_DEBUG(dbgs() << printReg(Reg, TRI) << '(' << printReg(CurrPhys, TRI)
2959 LLVM_DEBUG(dbgs() << "Checking profitability:\n");
2962 LLVM_DEBUG(dbgs() << "Old Cost: " << OldCopiesCost.getFrequency()
2966 LLVM_DEBUG(dbgs() << "=> Not profitable.\n");
2972 LLVM_DEBUG(dbgs() << "=> Profitable.\n");
3060 LLVM_DEBUG(dbgs() << StageName[Stage] << " Cascade "
3091 LLVM_DEBUG(dbgs() << "wait for second round\n");
3120 LLVM_DEBUG(dbgs() << "Do as if this register is in memory\n");
3211 LLVM_DEBUG(dbgs() << "********** GREEDY REGISTER ALLOCATION **********\n"
3247 LLVM_DEBUG(LIS->dump());
lib/CodeGen/RegAllocPBQP.cpp 687 LLVM_DEBUG(dbgs() << "VREG " << printReg(VReg, &TRI) << " -> SPILLED (Cost: "
696 LLVM_DEBUG(dbgs() << printReg(LI.reg, &TRI) << " ");
700 LLVM_DEBUG(dbgs() << ")\n");
726 LLVM_DEBUG(dbgs() << "VREG " << printReg(VReg, &TRI) << " -> "
803 LLVM_DEBUG(dbgs() << "PBQP Register Allocating for " << MF.getName() << "\n");
838 LLVM_DEBUG(dbgs() << " PBQP Regalloc round " << Round << ":\n");
852 LLVM_DEBUG(dbgs() << "Dumping graph for round " << Round << " to \""
870 LLVM_DEBUG(dbgs() << "Post alloc VirtRegMap:\n" << VRM << "\n");
lib/CodeGen/RegUsageInfoCollector.cpp 106 LLVM_DEBUG(dbgs() << " -------------------- " << getPassName()
112 LLVM_DEBUG(dbgs() << "Not analyzing non-callable function\n");
119 LLVM_DEBUG(dbgs() << "Not analyzing function with no callers\n");
136 LLVM_DEBUG(dbgs() << "Clobbered Registers: ");
177 LLVM_DEBUG(dbgs() << MF.getName()
181 LLVM_DEBUG(
lib/CodeGen/RegUsageInfoPropagate.cpp 105 LLVM_DEBUG(dbgs() << " ++++++++++++++++++++ " << getPassName()
107 LLVM_DEBUG(dbgs() << "MachineFunction : " << MF.getName() << "\n");
119 LLVM_DEBUG(
122 LLVM_DEBUG(dbgs() << MI << "\n");
136 LLVM_DEBUG(dbgs() << "Function definition is not exact\n");
139 LLVM_DEBUG(dbgs() << "Failed to find call target function\n");
142 LLVM_DEBUG(
148 LLVM_DEBUG(
lib/CodeGen/RegisterClassInfo.cpp 155 LLVM_DEBUG({
lib/CodeGen/RegisterCoalescer.cpp 623 LLVM_DEBUG(dbgs() << "Extending: " << printReg(IntB.reg, TRI));
656 LLVM_DEBUG(dbgs() << " result = " << IntB << '\n');
828 LLVM_DEBUG(dbgs() << "\tremoveCopyByCommutingDef: " << AValNo->def << '\t'
898 LLVM_DEBUG(dbgs() << "\t\tnoop: " << DefIdx << '\t' << *UseMI);
969 LLVM_DEBUG(dbgs() << "\t\textended: " << IntB << '\n');
973 LLVM_DEBUG(dbgs() << "\t\ttrimmed: " << IntA << '\n');
1119 LLVM_DEBUG(dbgs() << "\tremovePartialRedundancy: Move the copy to "
1137 LLVM_DEBUG(dbgs() << "\tremovePartialRedundancy: Remove the copy from "
1415 LLVM_DEBUG(dbgs()
1474 LLVM_DEBUG(dbgs() << "Remat: " << NewMI);
1490 LLVM_DEBUG(dbgs() << "\t\tupdated: " << *UseMI);
1558 LLVM_DEBUG(dbgs() << "\tReplaced copy of <undef> value with an "
1565 LLVM_DEBUG(dbgs() << "\tEliminating copy of <undef> value\n");
1609 LLVM_DEBUG(dbgs() << "\tnew undef: " << UseIdx << '\t' << MI);
1724 LLVM_DEBUG({
1738 LLVM_DEBUG(dbgs() << "\tCan only merge into reserved registers.\n");
1746 LLVM_DEBUG(
1753 LLVM_DEBUG(dbgs() << LIS->getInstructionIndex(*CopyMI) << '\t' << *CopyMI);
1757 LLVM_DEBUG(dbgs() << "\tNot coalescable.\n");
1772 LLVM_DEBUG(dbgs() << "\tSubtarget bailed on coalescing.\n");
1781 LLVM_DEBUG(dbgs() << "\tCopy is dead.\n");
1803 LLVM_DEBUG(dbgs() << "\tCopy already coalesced: " << LI << '\n');
1820 LLVM_DEBUG(dbgs() << "\tMerged values: " << LI << '\n');
1828 LLVM_DEBUG(dbgs() << "\tConsidering merging "
1847 LLVM_DEBUG({
1890 LLVM_DEBUG(dbgs() << "\t\tshrunk: " << DstLI << '\n');
1892 LLVM_DEBUG(dbgs() << "\tTrivial!\n");
1904 LLVM_DEBUG(dbgs() << "\tInterference!\n");
1938 LLVM_DEBUG(dbgs() << "Shrink LaneUses (Lane " << PrintLaneMask(S.LaneMask)
1963 LLVM_DEBUG({
1984 LLVM_DEBUG(dbgs() << "\t\tRHS = " << RHS << '\n');
2003 LLVM_DEBUG(dbgs() << "\t\tInterference: " << printRegUnit(*UI, TRI)
2013 LLVM_DEBUG(dbgs() << "\t\tRegMask interference\n");
2043 LLVM_DEBUG(dbgs() << "\t\tMultiple vreg uses!\n");
2048 LLVM_DEBUG(dbgs() << "\t\tComplex control flow!\n");
2066 LLVM_DEBUG(dbgs() << "\t\tInterference (read): " << *MI);
2074 LLVM_DEBUG(dbgs() << "\t\tRemoving phys reg def of "
2610 LLVM_DEBUG(dbgs() << "IMPLICIT_DEF defined at " << V.OtherVNI->def
2735 LLVM_DEBUG(dbgs() << "\t\tmerge " << printReg(Reg) << ':' << ValNo << '@'
2751 LLVM_DEBUG(dbgs() << "Cannot erase implicit_def with missing values\n");
2775 LLVM_DEBUG(dbgs() << "\t\tinterference at " << printReg(Reg) << ':' << i
2798 LLVM_DEBUG(dbgs() << "\t\ttaints global " << printReg(Other.Reg) << ':'
2802 LLVM_DEBUG(dbgs() << "\t\ttaints local " << printReg(Other.Reg) << ':'
2845 LLVM_DEBUG(dbgs() << "\t\tconflict at " << printReg(Reg) << ':' << i << '@'
2883 LLVM_DEBUG(dbgs() << "\t\ttainted lanes used by: " << *MI);
2956 LLVM_DEBUG(dbgs() << "\t\tpruned " << printReg(Other.Reg) << " at " << Def
2968 LLVM_DEBUG(dbgs() << "\t\tpruned all of " << printReg(Reg) << " at "
3036 LLVM_DEBUG(dbgs() << "\t\tExpecting instruction removal at " << Def
3047 LLVM_DEBUG(dbgs() << "\t\tPrune sublane " << PrintLaneMask(S.LaneMask)
3066 LLVM_DEBUG(dbgs() << "\t\tDead uses at sublane "
3180 LLVM_DEBUG({
3198 LLVM_DEBUG(dbgs() << "\t\terased:\t" << Def << '\t' << *MI);
3253 LLVM_DEBUG(dbgs() << "\t\tjoined lanes: " << PrintLaneMask(LaneMask)
3260 LLVM_DEBUG({
3312 LLVM_DEBUG(dbgs() << "\t\tRHS = " << RHS << "\n\t\tLHS = " << LHS << '\n');
3346 LLVM_DEBUG(dbgs() << "\t\tLHST = " << printReg(CP.getDstReg()) << ' ' << LHS
3362 LLVM_DEBUG(dbgs() << "\tJoined SubRanges " << LHS << "\n");
3400 LLVM_DEBUG({
3561 LLVM_DEBUG(dbgs() << "Apply terminal rule for: " << printReg(DstReg)
3571 LLVM_DEBUG(dbgs() << MBB->getName() << ":\n");
3636 LLVM_DEBUG(dbgs() << "********** JOINING INTERVALS ***********\n");
3695 LLVM_DEBUG(dbgs() << "********** SIMPLE REGISTER COALESCING **********\n"
3713 LLVM_DEBUG(dbgs() << "Trying to inflate " << InflateRegs.size()
3720 LLVM_DEBUG(dbgs() << printReg(Reg) << " inflated to "
3744 LLVM_DEBUG(dump());
lib/CodeGen/RegisterScavenging.cpp 290 LLVM_DEBUG(dbgs() << "Scavenger found unused reg: " << printReg(Reg, TRI)
563 LLVM_DEBUG(dbgs() << "Scavenged register: " << printReg(SReg, TRI) << "\n");
573 LLVM_DEBUG(dbgs() << "Scavenged register (with spill): "
597 LLVM_DEBUG(dbgs() << "Scavenged free register: " << printReg(Reg, TRI)
609 LLVM_DEBUG(dbgs() << "Reload before: " << *ReloadBefore << '\n');
613 LLVM_DEBUG(dbgs() << "Scavenged register with spill: " << printReg(Reg, TRI)
769 LLVM_DEBUG(dbgs() << "Warning: Required two scavenging passes for block "
lib/CodeGen/RenameIndependentSubregs.cpp 136 LLVM_DEBUG(dbgs() << printReg(Reg) << ": Found " << Classes.getNumClasses()
138 LLVM_DEBUG(dbgs() << printReg(Reg) << ": Splitting into newly created:");
144 LLVM_DEBUG(dbgs() << ' ' << printReg(NewVReg));
146 LLVM_DEBUG(dbgs() << '\n');
382 LLVM_DEBUG(dbgs() << "Renaming independent subregister live ranges in "
lib/CodeGen/ResetMachineFunctionPass.cpp 65 LLVM_DEBUG(dbgs() << "Resetting: " << MF.getName() << '\n');
lib/CodeGen/SafeStack.cpp 244 LLVM_DEBUG(
307 LLVM_DEBUG(dbgs()
331 LLVM_DEBUG(dbgs()
351 LLVM_DEBUG(dbgs() << "[SafeStack] Unsafe alloca: " << *AllocaPtr
833 LLVM_DEBUG(dbgs() << "[SafeStack] safestack applied\n");
854 LLVM_DEBUG(dbgs() << "[SafeStack] Function: " << F.getName() << "\n");
857 LLVM_DEBUG(dbgs() << "[SafeStack] safestack is not requested"
863 LLVM_DEBUG(dbgs() << "[SafeStack] function definition"
lib/CodeGen/SafeStackColoring.cpp 103 LLVM_DEBUG(dbgs() << "Instructions:\n");
106 LLVM_DEBUG(dbgs() << " " << InstNo << ": BB " << BB->getName() << "\n");
123 LLVM_DEBUG(dbgs() << " " << InstNo << ": "
284 LLVM_DEBUG(dumpAllocas());
307 LLVM_DEBUG(dumpBlockLiveness());
309 LLVM_DEBUG(dumpLiveRanges());
lib/CodeGen/SafeStackLayout.cpp 65 LLVM_DEBUG(dbgs() << "Layout: size " << Obj.Size << ", align "
70 LLVM_DEBUG(dbgs() << " First candidate: " << Start << " .. " << End << "\n");
72 LLVM_DEBUG(dbgs() << " Examining region: " << R.Start << " .. " << R.End
76 LLVM_DEBUG(dbgs() << " Does not intersect, skip.\n");
83 LLVM_DEBUG(dbgs() << " Overlaps. Next candidate: " << Start << " .. "
88 LLVM_DEBUG(dbgs() << " Reusing region(s).\n");
97 LLVM_DEBUG(dbgs() << " Creating gap region: " << LastRegionEnd << " .. "
102 LLVM_DEBUG(dbgs() << " Creating new region: " << LastRegionEnd << " .. "
152 LLVM_DEBUG(print(dbgs()));
lib/CodeGen/ScheduleDAGInstrs.cpp 890 LLVM_DEBUG(dbgs() << "Global memory object and new barrier chain: SU("
912 LLVM_DEBUG(dbgs() << "Reducing FPExceptions map.\n";);
995 LLVM_DEBUG(dbgs() << "Reducing Stores and Loads maps.\n";);
999 LLVM_DEBUG(
1042 LLVM_DEBUG(dbgs() << "Before reduction:\nStoring SUnits:\n"; stores.dump();
1069 LLVM_DEBUG(dbgs() << "Inserting new barrier chain: SU("
1073 LLVM_DEBUG(dbgs() << "Keeping old barrier chain: SU("
1082 LLVM_DEBUG(dbgs() << "After reduction:\nStoring SUnits:\n"; stores.dump();
1104 LLVM_DEBUG(dbgs() << "Fixup kills for " << printMBBReference(MBB) << '\n');
1333 LLVM_DEBUG(dbgs() << R.getNumSubtrees() << " subtrees:\n");
1336 LLVM_DEBUG(dbgs() << " SU(" << Idx << ") in tree "
1492 LLVM_DEBUG(dbgs() << " Tree: " << C.TreeID << " @"
lib/CodeGen/ScoreboardHazardRecognizer.cpp 71 LLVM_DEBUG(dbgs() << "Disabled scoreboard hazard recognizer\n");
75 LLVM_DEBUG(dbgs() << "Using scoreboard hazard recognizer: Depth = "
158 LLVM_DEBUG(dbgs() << "*** Hazard in cycle +" << StageCycle << ", ");
159 LLVM_DEBUG(DAG->dumpNode(*SU));
225 LLVM_DEBUG(ReservedScoreboard.dump());
226 LLVM_DEBUG(RequiredScoreboard.dump());
lib/CodeGen/SelectionDAG/DAGCombiner.cpp 993 LLVM_DEBUG(dbgs() << "\nReplacing.1 "; N->dump(&DAG); dbgs() << "\nWith: ";
1053 LLVM_DEBUG(dbgs() << "\nReplacing.2 "; TLO.Old.getNode()->dump(&DAG);
1078 LLVM_DEBUG(dbgs() << "\nReplacing.2 "; TLO.Old.getNode()->dump(&DAG);
1091 LLVM_DEBUG(dbgs() << "\nReplacing.9 "; Load->dump(&DAG); dbgs() << "\nWith: ";
1191 LLVM_DEBUG(dbgs() << "\nPromoting "; Op.getNode()->dump(&DAG));
1256 LLVM_DEBUG(dbgs() << "\nPromoting "; Op.getNode()->dump(&DAG));
1307 LLVM_DEBUG(dbgs() << "\nPromoting "; Op.getNode()->dump(&DAG));
1347 LLVM_DEBUG(dbgs() << "\nPromoting "; N->dump(&DAG); dbgs() << "\nTo: ";
1434 LLVM_DEBUG(dbgs() << "\nCombining: "; N->dump(&DAG));
1462 LLVM_DEBUG(dbgs() << " ... into: "; RV.getNode()->dump(&DAG));
4878 LLVM_DEBUG(dbgs() << "Backwards propagate AND: "; N->dump());
4884 LLVM_DEBUG(dbgs() << "First, need to fix up: "; FixupNode->dump());
4909 LLVM_DEBUG(dbgs() << "Propagate AND back to: "; Load->dump());
13654 LLVM_DEBUG(dbgs() << "\nReplacing.4 "; N->dump(&DAG); dbgs() << "\nWith: ";
13827 LLVM_DEBUG(dbgs() << "\nReplacing.5 "; N->dump(&DAG);
14048 LLVM_DEBUG(dbgs() << "\nReplacing.6 "; N->dump(&DAG);
14081 LLVM_DEBUG(dbgs() << "\nReplacing.7 "; N->dump(&DAG);
16373 LLVM_DEBUG(dbgs() << "\nRemoving store:"; StoreBase.dump();
lib/CodeGen/SelectionDAG/FastISel.cpp 265 LLVM_DEBUG(dbgs() << "removing dead local value materialization "
317 LLVM_DEBUG(dbgs() << "sinking local value to first use " << LocalMI);
1349 LLVM_DEBUG(dbgs() << "Dropping debug info for " << *DI << "\n");
1355 LLVM_DEBUG(dbgs() << "Dropping debug info for " << *DI << "\n");
1400 LLVM_DEBUG(dbgs() << "Dropping debug info for " << *DI << "\n");
1443 LLVM_DEBUG(dbgs() << "Dropping debug info for " << *DI << "\n");
1451 LLVM_DEBUG(dbgs() << "Dropping debug info for " << *DI << "\n");
lib/CodeGen/SelectionDAG/FunctionLoweringInfo.cpp 514 LLVM_DEBUG(dbgs() << "Argument does not have assigned frame index!\n");
lib/CodeGen/SelectionDAG/LegalizeDAG.cpp 207 LLVM_DEBUG(dbgs() << " ... replacing: "; Old->dump(&DAG);
220 LLVM_DEBUG(dbgs() << " ... replacing: "; Old->dump(&DAG);
230 LLVM_DEBUG(dbgs() << " ... replacing: "; Old->dump(&DAG));
234 LLVM_DEBUG(dbgs() << (i == 0 ? " with: " : " and: ");
243 LLVM_DEBUG(dbgs() << " ... replacing: "; Old->dump(&DAG);
424 LLVM_DEBUG(dbgs() << "Optimizing float store operations\n");
493 LLVM_DEBUG(dbgs() << "Legalizing store operation\n");
510 LLVM_DEBUG(dbgs() << "Expanding unsupported unaligned store\n");
514 LLVM_DEBUG(dbgs() << "Legal store\n");
518 LLVM_DEBUG(dbgs() << "Trying custom lowering\n");
539 LLVM_DEBUG(dbgs() << "Legalizing truncating store operations\n");
672 LLVM_DEBUG(dbgs() << "Legalizing non-extending load operation\n");
721 LLVM_DEBUG(dbgs() << "Legalizing extending load operation\n");
964 LLVM_DEBUG(dbgs() << "\nLegalizing: "; Node->dump(&DAG));
1220 LLVM_DEBUG(dbgs() << "Legal node: nothing to do\n");
1223 LLVM_DEBUG(dbgs() << "Trying custom legalization\n");
1231 LLVM_DEBUG(dbgs() << "Successfully custom legalized node\n");
1240 LLVM_DEBUG(dbgs() << "Successfully custom legalized node\n");
1244 LLVM_DEBUG(dbgs() << "Could not custom legalize node\n");
2071 LLVM_DEBUG(dbgs() << "Created tailcall: "; DAG.getRoot().dump(&DAG));
2076 LLVM_DEBUG(dbgs() << "Created libcall: "; CallInfo.first.dump(&DAG));
2353 LLVM_DEBUG(dbgs() << "Legalizing INT_TO_FP\n");
2355 LLVM_DEBUG(dbgs() << "32-bit [signed|unsigned] integer to float/double "
2654 LLVM_DEBUG(dbgs() << "Trying to expand node\n");
2825 LLVM_DEBUG(dbgs() << "Successfully expanded STRICT_FP_ROUND node\n");
2845 LLVM_DEBUG(dbgs() << "Successfully expanded STRICT_FP_EXTEND node\n");
2903 LLVM_DEBUG(dbgs() << "Successfully expanded STRICT_FP_TO_SINT node\n");
2917 LLVM_DEBUG(dbgs() << "Successfully expanded STRICT_FP_TO_UINT node\n");
3144 LLVM_DEBUG(dbgs() << "Legalizing FP_TO_FP16\n");
3740 LLVM_DEBUG(dbgs() << "Cannot expand node\n");
3744 LLVM_DEBUG(dbgs() << "Successfully expanded node\n");
3750 LLVM_DEBUG(dbgs() << "Trying to convert node to libcall\n");
4105 LLVM_DEBUG(dbgs() << "Successfully converted node to libcall\n");
4108 LLVM_DEBUG(dbgs() << "Could not convert node to libcall\n");
4122 LLVM_DEBUG(dbgs() << "Trying to promote node\n");
4579 LLVM_DEBUG(dbgs() << "Successfully promoted node\n");
4582 LLVM_DEBUG(dbgs() << "Could not promote node\n");
lib/CodeGen/SelectionDAG/LegalizeFloatTypes.cpp 49 LLVM_DEBUG(dbgs() << "Soften float result " << ResNo << ": "; N->dump(&DAG);
827 LLVM_DEBUG(dbgs() << "Soften float operand " << OpNo << ": "; N->dump(&DAG);
1112 LLVM_DEBUG(dbgs() << "Expand float result: "; N->dump(&DAG); dbgs() << "\n");
1627 LLVM_DEBUG(dbgs() << "Expand float operand: "; N->dump(&DAG); dbgs() << "\n");
1895 LLVM_DEBUG(dbgs() << "Promote float operand " << OpNo << ": "; N->dump(&DAG);
1900 LLVM_DEBUG(dbgs() << "Node has been custom lowered, done\n");
2025 LLVM_DEBUG(dbgs() << "Promote float result " << ResNo << ": "; N->dump(&DAG);
2031 LLVM_DEBUG(dbgs() << "Node has been custom expanded, done\n");
lib/CodeGen/SelectionDAG/LegalizeIntegerTypes.cpp 38 LLVM_DEBUG(dbgs() << "Promote integer result: "; N->dump(&DAG);
44 LLVM_DEBUG(dbgs() << "Node has been custom expanded, done\n");
1138 LLVM_DEBUG(dbgs() << "Promote integer operand: "; N->dump(&DAG);
1143 LLVM_DEBUG(dbgs() << "Node has been custom lowered, done\n");
1657 LLVM_DEBUG(dbgs() << "Expand integer result: "; N->dump(&DAG);
3587 LLVM_DEBUG(dbgs() << "Expand integer operand: "; N->dump(&DAG);
lib/CodeGen/SelectionDAG/LegalizeTypes.cpp 225 LLVM_DEBUG(dbgs() << "Legalizing node: "; N->dump(&DAG));
227 LLVM_DEBUG(dbgs() << "Ignoring node results\n");
235 LLVM_DEBUG(dbgs() << "Analyzing result type: " << ResultVT.getEVTString()
239 LLVM_DEBUG(dbgs() << "Legal result type\n");
293 LLVM_DEBUG(dbgs() << "Analyzing operand: "; Op.dump(&DAG));
297 LLVM_DEBUG(dbgs() << "Legal operand\n");
367 LLVM_DEBUG(dbgs() << "Legally typed node: "; N->dump(&DAG);
lib/CodeGen/SelectionDAG/LegalizeVectorOps.cpp 249 LLVM_DEBUG(dbgs() << "\nLegalizing extending vector load: ";
278 LLVM_DEBUG(dbgs() << "\nLegalizing truncating vector store: ";
483 LLVM_DEBUG(dbgs() << "\nLegalizing vector op: "; Node->dump(&DAG));
492 LLVM_DEBUG(dbgs() << "Legal node: nothing to do\n");
495 LLVM_DEBUG(dbgs() << "Trying custom legalization\n");
497 LLVM_DEBUG(dbgs() << "Successfully custom legalized node\n");
501 LLVM_DEBUG(dbgs() << "Could not custom legalize node\n");
lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp 35 LLVM_DEBUG(dbgs() << "Scalarize node result " << ResNo << ": "; N->dump(&DAG);
582 LLVM_DEBUG(dbgs() << "Scalarize node operand " << OpNo << ": "; N->dump(&DAG);
827 LLVM_DEBUG(dbgs() << "Split node result: "; N->dump(&DAG); dbgs() << "\n");
1806 LLVM_DEBUG(dbgs() << "Split vector extend via incremental extend:";
1962 LLVM_DEBUG(dbgs() << "Split node operand: "; N->dump(&DAG); dbgs() << "\n");
2691 LLVM_DEBUG(dbgs() << "Widen node result " << ResNo << ": "; N->dump(&DAG);
4127 LLVM_DEBUG(dbgs() << "Widen node operand " << OpNo << ": "; N->dump(&DAG);
lib/CodeGen/SelectionDAG/ScheduleDAGFast.cpp 118 LLVM_DEBUG(dbgs() << "********** List Scheduling **********\n");
127 LLVM_DEBUG(dump());
182 LLVM_DEBUG(dbgs() << "*** Scheduling [" << CurCycle << "]: ");
183 LLVM_DEBUG(dumpNode(*SU));
238 LLVM_DEBUG(dbgs() << "Unfolding SU # " << SU->NodeNum << "\n");
348 LLVM_DEBUG(dbgs() << "Duplicating SU # " << SU->NodeNum << "\n");
595 LLVM_DEBUG(dbgs() << "Adding an edge from SU # " << TrySU->NodeNum
601 LLVM_DEBUG(dbgs() << "Adding an edge from SU # " << NewDef->NodeNum
669 LLVM_DEBUG(dbgs() << "\n*** Scheduling: ");
670 LLVM_DEBUG(N->dump(DAG));
716 LLVM_DEBUG(dbgs() << "********** DAG Linearization **********\n");
766 LLVM_DEBUG({ dbgs() << "\n*** Final schedule ***\n"; });
772 LLVM_DEBUG(N->dump(DAG));
786 LLVM_DEBUG(dbgs() << '\n');
lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp 355 LLVM_DEBUG(dbgs() << "********** List Scheduling " << printMBBReference(*BB)
373 LLVM_DEBUG(dump());
385 LLVM_DEBUG({
737 LLVM_DEBUG(dbgs() << "\n*** Scheduling [" << CurCycle << "]: ");
738 LLVM_DEBUG(dumpNode(*SU));
742 LLVM_DEBUG(dbgs() << " Height [" << SU->getHeight()
836 LLVM_DEBUG(dbgs() << "*** Unscheduling [" << SU->getHeight() << "]: ");
837 LLVM_DEBUG(dumpNode(*SU));
1048 LLVM_DEBUG(dbgs() << "Unfolding SU #" << SU->NodeNum << "\n");
1139 LLVM_DEBUG(dbgs() << "Considering duplicating the SU\n");
1140 LLVM_DEBUG(dumpNode(*SU));
1144 LLVM_DEBUG(
1156 LLVM_DEBUG(dbgs() << "Giving up because it has outgoing glue\n");
1164 LLVM_DEBUG(
1183 LLVM_DEBUG(dbgs() << " Duplicating SU #" << SU->NodeNum << "\n");
1449 LLVM_DEBUG(dbgs() << " Repushing SU #" << SU->NodeNum << '\n');
1470 LLVM_DEBUG(dbgs() << " Interfering reg ";
1524 LLVM_DEBUG(dbgs() << "ARTIFICIAL edge from SU(" << BtSU->NodeNum
1531 LLVM_DEBUG(dbgs() << "TrySU not available; choosing node from queue\n");
1534 LLVM_DEBUG(dbgs() << "TrySU available\n");
1578 LLVM_DEBUG(dbgs() << " Adding an edge from SU #" << TrySU->NodeNum
1584 LLVM_DEBUG(dbgs() << " Adding an edge from SU #" << NewDef->NodeNum
1613 LLVM_DEBUG(dbgs() << "\nExamining Available:\n";
2077 LLVM_DEBUG(dbgs() << TRI->getRegClassName(RC) << ": " << RP << " / "
2230 LLVM_DEBUG(dbgs() << " SU(" << SU->NodeNum
2238 LLVM_DEBUG(dumpRegPressure());
2318 LLVM_DEBUG(dumpRegPressure());
2413 LLVM_DEBUG(dbgs() << "VRegCycle: SU(" << SU->NodeNum << ")\n");
2451 LLVM_DEBUG(dbgs() << " VReg cycle use: SU (" << SU->NodeNum << ")\n");
2511 LLVM_DEBUG(dbgs() << " Comparing latency of SU (" << left->NodeNum
2535 LLVM_DEBUG(dbgs() << " SU (" << left->NodeNum << ") "
2681 LLVM_DEBUG(dbgs() << " pressure SU(" << left->NodeNum << ") > SU("
2686 LLVM_DEBUG(dbgs() << " pressure SU(" << right->NodeNum << ") > SU("
2749 LLVM_DEBUG(dbgs() << "RegPressureDiff SU(" << left->NodeNum
2763 LLVM_DEBUG(dbgs() << "Live uses SU(" << left->NodeNum << "): " << LLiveUses
2779 LLVM_DEBUG(dbgs() << "Depth of SU(" << left->NodeNum << "): "
3025 LLVM_DEBUG(
3117 LLVM_DEBUG(dbgs()
lib/CodeGen/SelectionDAG/ScheduleDAGVLIW.cpp 94 LLVM_DEBUG(dbgs() << "********** List Scheduling " << printMBBReference(*BB)
152 LLVM_DEBUG(dbgs() << "*** Scheduling [" << CurCycle << "]: ");
153 LLVM_DEBUG(dumpNode(*SU));
247 LLVM_DEBUG(dbgs() << "*** Advancing cycle, no work to do\n");
255 LLVM_DEBUG(dbgs() << "*** Emitting noop\n");
lib/CodeGen/SelectionDAG/SelectionDAG.cpp 103 LLVM_DEBUG(dbgs() << Msg; V.getNode()->dump(G););
8111 LLVM_DEBUG(dbgs() << "SALVAGE: Rewriting";
lib/CodeGen/SelectionDAG/SelectionDAGBuilder.cpp 1138 LLVM_DEBUG(dbgs() << "Dropping dangling debug info for " << *DI << "\n");
1185 LLVM_DEBUG(dbgs() << "Resolve dangling debug info [order="
1187 LLVM_DEBUG(dbgs() << " By mapping to:\n "; Val.dump());
1192 LLVM_DEBUG(if (ValSDNodeOrder > DbgSDNodeOrder) dbgs()
1199 LLVM_DEBUG(dbgs() << "Resolved dangling debug info for " << *DI
1202 LLVM_DEBUG(dbgs() << "Dropping debug info for " << *DI << "\n");
1249 LLVM_DEBUG(dbgs() << "Salvaged debug location info for:\n "
1262 LLVM_DEBUG(dbgs() << "Dropping debug value info for:\n " << DDI.getDI()
1264 LLVM_DEBUG(dbgs() << " Last seen at:\n " << *DDI.getDI()->getOperand(0)
3122 LLVM_DEBUG(dbgs() << "Detected a reduction operation:" << I << "\n");
5817 LLVM_DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
5880 LLVM_DEBUG(dbgs() << "Dropping debug info for " << DI << "\n");
9493 LLVM_DEBUG(dbgs() << "Found argument copy elision candidate: " << *AI
9535 LLVM_DEBUG(
9546 LLVM_DEBUG(dbgs() << " argument copy elision failed: alignment of alloca "
9555 LLVM_DEBUG({
9737 LLVM_DEBUG({
10466 LLVM_DEBUG(dbgs() << "Peeled one top case in switch stmt, prob: "
10484 LLVM_DEBUG(
10488 LLVM_DEBUG(dbgs() << "After scaling: " << CC.Prob << "\n");
10535 LLVM_DEBUG({
lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp 220 LLVM_DEBUG(dbgs() << "\nChanging optimization level for Function "
222 LLVM_DEBUG(dbgs() << "\tBefore: -O" << SavedOptLevel << " ; After: -O"
227 LLVM_DEBUG(
237 LLVM_DEBUG(dbgs() << "\nRestoring optimization level for Function "
239 LLVM_DEBUG(dbgs() << "\tBefore: -O" << IS.OptLevel << " ; After: -O"
446 LLVM_DEBUG(dbgs() << "\n\n\n=== " << Fn.getName() << "\n");
584 LLVM_DEBUG(dbgs() << "Dropping debug info for dead vreg"
693 LLVM_DEBUG(dbgs() << "*** MachineFunction at end of ISel ***\n");
694 LLVM_DEBUG(MF->print(dbgs()));
804 LLVM_DEBUG(dbgs() << "Initial selection DAG: "
824 LLVM_DEBUG(dbgs() << "Optimized lowered selection DAG: "
846 LLVM_DEBUG(dbgs() << "Type-legalized selection DAG: "
870 LLVM_DEBUG(dbgs() << "Optimized type-legalized selection DAG: "
883 LLVM_DEBUG(dbgs() << "Vector-legalized selection DAG: "
894 LLVM_DEBUG(dbgs() << "Vector/type-legalized selection DAG: "
909 LLVM_DEBUG(dbgs() << "Optimized vector-legalized selection DAG: "
934 LLVM_DEBUG(dbgs() << "Legalized selection DAG: "
954 LLVM_DEBUG(dbgs() << "Optimized legalized selection DAG: "
973 LLVM_DEBUG(dbgs() << "Selected selection DAG: "
1095 LLVM_DEBUG(dbgs() << "===== Instruction selection begins: "
1167 LLVM_DEBUG(dbgs() << "\nISEL: Starting selection on root node: ";
1176 LLVM_DEBUG(dbgs() << "\n===== Instruction selection ends:\n");
1341 LLVM_DEBUG(dbgs() << "Enabling fast-isel\n");
1697 LLVM_DEBUG(dbgs() << "Total amount of phi nodes to update: "
2331 LLVM_DEBUG(dbgs() << "ISEL: Match complete!\n");
2832 LLVM_DEBUG(dbgs() << "ISEL: Starting pattern match\n");
2844 LLVM_DEBUG(dbgs() << " Initial Opcode index to " << MatcherIndex << "\n");
2911 LLVM_DEBUG(
2963 LLVM_DEBUG(dbgs() << "Expected MemSDNode "; N->dump(CurDAG);
3097 LLVM_DEBUG(dbgs() << " OpcodeSwitch from " << SwitchStart << " to "
3129 LLVM_DEBUG(dbgs() << " TypeSwitch[" << EVT(CurNodeVT).getEVTString()
3507 LLVM_DEBUG(if (!MatchedMemRefs.empty() && Res->memoperands_empty()) dbgs()
3573 LLVM_DEBUG(dbgs() << " Match failed at index " << CurrentOpcodeIndex
3594 LLVM_DEBUG(dbgs() << " Continuing at " << MatcherIndex << "\n");
lib/CodeGen/SelectionDAG/SelectionDAGPrinter.cpp 231 LLVM_DEBUG(dbgs() << "setSubgraphColor hit max level\n");
lib/CodeGen/ShrinkWrap.cpp 272 LLVM_DEBUG(dbgs() << "Frame instruction: " << MI << '\n');
303 LLVM_DEBUG(dbgs() << "Use or define CSR(" << UseOrDefCSR << ") or FI("
335 LLVM_DEBUG(dbgs() << "Found a block that is not reachable from Entry\n");
369 LLVM_DEBUG(
458 LLVM_DEBUG(dbgs() << RemarkMessage << '\n');
466 LLVM_DEBUG(dbgs() << "**** Analysing " << MF.getName() << '\n');
488 LLVM_DEBUG(dbgs() << "Look into: " << MBB.getNumber() << ' '
506 LLVM_DEBUG(dbgs() << "EHPad prevents shrink-wrapping\n");
521 LLVM_DEBUG(dbgs() << "No Shrink wrap candidate found\n");
534 LLVM_DEBUG(dbgs() << "Nothing to shrink-wrap\n");
538 LLVM_DEBUG(dbgs() << "\n ** Results **\nFrequency of the Entry: " << EntryFreq
543 LLVM_DEBUG(dbgs() << "Shrink wrap candidates (#, Name, Freq):\nSave: "
556 LLVM_DEBUG(
579 LLVM_DEBUG(dbgs() << "Final shrink wrap candidates:\nSave: "
lib/CodeGen/SjLjEHPrepare.cpp 311 LLVM_DEBUG(dbgs() << "SJLJ Spill: " << Inst << " around "
lib/CodeGen/SlotIndexes.cpp 98 LLVM_DEBUG(mf->print(dbgs(), this));
161 LLVM_DEBUG(dbgs() << "\n*** Renumbered SlotIndexes " << startItr->getIndex()
lib/CodeGen/SplitKit.cpp 194 LLVM_DEBUG(dbgs() << "*** Fixing inconsistent live interval! ***\n");
204 LLVM_DEBUG(dbgs() << "Analyze counted " << UseSlots.size() << " instrs in "
688 LLVM_DEBUG(dbgs() << " selectIntv " << OpenIdx << " -> " << Idx << '\n');
694 LLVM_DEBUG(dbgs() << " enterIntvBefore " << Idx);
698 LLVM_DEBUG(dbgs() << ": not live\n");
701 LLVM_DEBUG(dbgs() << ": valno " << ParentVNI->id << '\n');
711 LLVM_DEBUG(dbgs() << " enterIntvAfter " << Idx);
715 LLVM_DEBUG(dbgs() << ": not live\n");
718 LLVM_DEBUG(dbgs() << ": valno " << ParentVNI->id << '\n');
731 LLVM_DEBUG(dbgs() << " enterIntvAtEnd " << printMBBReference(MBB) << ", "
735 LLVM_DEBUG(dbgs() << ": not live\n");
738 LLVM_DEBUG(dbgs() << ": valno " << ParentVNI->id);
742 LLVM_DEBUG(dump());
753 LLVM_DEBUG(dbgs() << " useIntv [" << Start << ';' << End << "):");
755 LLVM_DEBUG(dump());
760 LLVM_DEBUG(dbgs() << " leaveIntvAfter " << Idx);
766 LLVM_DEBUG(dbgs() << ": not live\n");
769 LLVM_DEBUG(dbgs() << ": valno " << ParentVNI->id << '\n');
791 LLVM_DEBUG(dbgs() << " leaveIntvBefore " << Idx);
797 LLVM_DEBUG(dbgs() << ": not live\n");
800 LLVM_DEBUG(dbgs() << ": valno " << ParentVNI->id << '\n');
811 LLVM_DEBUG(dbgs() << " leaveIntvAtTop " << printMBBReference(MBB) << ", "
816 LLVM_DEBUG(dbgs() << ": not live\n");
823 LLVM_DEBUG(dump());
838 LLVM_DEBUG(dbgs() << " overlapIntv [" << Start << ';' << End << "):");
840 LLVM_DEBUG(dump());
849 LLVM_DEBUG(dbgs() << "Removing " << Copies.size() << " back-copies.\n");
864 LLVM_DEBUG(dbgs() << "Removing " << Def << '\t' << *MI);
879 LLVM_DEBUG(dbgs() << " cannot find simple kill of RegIdx " << RegIdx
884 LLVM_DEBUG(dbgs() << " move kill to " << Kill << '\t' << *MBBI);
911 LLVM_DEBUG(dbgs() << "Def in " << printMBBReference(*DefMBB)
919 LLVM_DEBUG(dbgs() << "Def in " << printMBBReference(*DefMBB)
930 LLVM_DEBUG(dbgs() << "Def in " << printMBBReference(*DefMBB)
1038 LLVM_DEBUG(dbgs() << "Direct complement def at " << VNI->def << '\n');
1045 LLVM_DEBUG(dbgs() << "Single complement def at " << VNI->def << '\n');
1069 LLVM_DEBUG(dbgs() << "Multi-mapped complement " << VNI->id << '@'
1126 LLVM_DEBUG(dbgs() << " blit " << S << ':');
1148 LLVM_DEBUG(dbgs() << " [" << Start << ';' << End << ")=" << RegIdx << '('
1155 LLVM_DEBUG(dbgs() << ':' << VNI->id);
1163 LLVM_DEBUG(dbgs() << "(recalc)");
1182 LLVM_DEBUG(dbgs() << ':' << VNI->id << "*" << printMBBReference(*MBB));
1195 LLVM_DEBUG(dbgs() << ">" << printMBBReference(*MBB));
1220 LLVM_DEBUG(dbgs() << '\n');
1322 LLVM_DEBUG(dbgs() << "Zapping " << *MI);
1338 LLVM_DEBUG(dbgs() << " rewr " << printMBBReference(*MI->getParent())
1424 LLVM_DEBUG(dbgs() << "All defs dead: " << *MI);
1606 LLVM_DEBUG(dbgs() << "%bb." << MBBNum << " [" << Start << ';' << Stop
1619 LLVM_DEBUG(dbgs() << ", spill on entry.\n");
1633 LLVM_DEBUG(dbgs() << ", reload on exit.\n");
1647 LLVM_DEBUG(dbgs() << ", straight through.\n");
1663 LLVM_DEBUG(dbgs() << ", switch avoiding interference.\n");
1684 LLVM_DEBUG(dbgs() << ", create local intv for interference.\n");
1708 LLVM_DEBUG(dbgs() << printMBBReference(*BI.MBB) << " [" << Start << ';'
1719 LLVM_DEBUG(dbgs() << " before interference.\n");
1744 LLVM_DEBUG(dbgs() << ", spill after last use before interference.\n");
1750 LLVM_DEBUG(dbgs() << ", spill before last split point.\n");
1765 LLVM_DEBUG(dbgs() << ", creating local interval " << LocalIntv << ".\n");
1801 LLVM_DEBUG(dbgs() << printMBBReference(*BI.MBB) << " [" << Start << ';'
1814 LLVM_DEBUG(dbgs() << " after interference.\n");
1826 LLVM_DEBUG(dbgs() << ", reload after interference.\n");
1842 LLVM_DEBUG(dbgs() << ", interference overlaps uses.\n");
lib/CodeGen/StackColoring.cpp 669 LLVM_DEBUG(dbgs() << "Found a lifetime ");
670 LLVM_DEBUG(dbgs() << (MI.getOpcode() == TargetOpcode::LIFETIME_START
673 LLVM_DEBUG(dbgs() << " marker for slot #" << Slot);
674 LLVM_DEBUG(dbgs()
704 LLVM_DEBUG(dumpBV("Conservative slots", ConservativeSlots));
735 LLVM_DEBUG(dbgs() << "Found a use of slot #" << Slot);
736 LLVM_DEBUG(dbgs()
738 LLVM_DEBUG(Indexes->getInstructionIndex(MI).print(dbgs()));
741 LLVM_DEBUG(dbgs()
744 LLVM_DEBUG(dbgs() << "\n");
882 LLVM_DEBUG(dbgs() << "Removed " << Count << " markers.\n");
896 LLVM_DEBUG(dbgs() << "Remapping debug info for ["
1072 LLVM_DEBUG(dbgs() << "Fixed " << FixedMemOp << " machine memory operands.\n");
1073 LLVM_DEBUG(dbgs() << "Fixed " << FixedDbg << " debug locations.\n");
1074 LLVM_DEBUG(dbgs() << "Fixed " << FixedInstr << " machine instructions.\n");
1112 LLVM_DEBUG(dbgs() << "Invalidating range #" << Slot << "\n");
1136 LLVM_DEBUG(dbgs() << "********** Stack Coloring **********\n"
1163 LLVM_DEBUG(dbgs() << "Found " << NumMarkers << " markers and " << NumSlots
1165 LLVM_DEBUG(dbgs() << "Slot structure:\n");
1168 LLVM_DEBUG(dbgs() << "Slot #" << i << " - " << MFI->getObjectSize(i)
1173 LLVM_DEBUG(dbgs() << "Total Stack size: " << TotalSize << " bytes\n\n");
1179 LLVM_DEBUG(dbgs() << "Will not try to merge slots.\n");
1192 LLVM_DEBUG(dbgs() << "Dataflow iterations: " << NumIterations << "\n");
1193 LLVM_DEBUG(dump());
1197 LLVM_DEBUG(dumpIntervals());
1269 LLVM_DEBUG(dbgs() << "Merging #" << FirstSlot << " and slots #"
1290 LLVM_DEBUG(dbgs() << "Merge " << RemovedSlots << " slots. Saved "
lib/CodeGen/StackMapLivenessAnalysis.cpp 108 LLVM_DEBUG(dbgs() << "********** COMPUTING STACKMAP LIVENESS: "
126 LLVM_DEBUG(dbgs() << "****** BB " << MBB.getName() << " ******\n");
140 LLVM_DEBUG(dbgs() << " " << LiveRegs << " " << *I);
lib/CodeGen/StackMaps.cpp 421 LLVM_DEBUG(dbgs() << WSMP << "#functions = " << FnInfos.size() << '\n');
424 LLVM_DEBUG(dbgs() << WSMP << "#constants = " << ConstPool.size() << '\n');
427 LLVM_DEBUG(dbgs() << WSMP << "#callsites = " << CSInfos.size() << '\n');
440 LLVM_DEBUG(dbgs() << WSMP << "functions:\n");
442 LLVM_DEBUG(dbgs() << WSMP << "function addr: " << FR.first
456 LLVM_DEBUG(dbgs() << WSMP << "constants:\n");
458 LLVM_DEBUG(dbgs() << WSMP << ConstEntry.second << '\n');
493 LLVM_DEBUG(print(dbgs()));
570 LLVM_DEBUG(dbgs() << "********** Stack Map Output **********\n");
lib/CodeGen/StackSlotColoring.cpp 220 LLVM_DEBUG(dbgs() << "Spill slot intervals:\n");
223 LLVM_DEBUG(li.dump());
242 LLVM_DEBUG(dbgs() << '\n');
289 LLVM_DEBUG(dbgs() << "cannot share FIs with different stack IDs\n");
306 LLVM_DEBUG(dbgs() << "Assigning fi#" << FI << " to fi#" << Color << "\n");
329 LLVM_DEBUG(dbgs() << "Color spill slot intervals:\n");
343 LLVM_DEBUG(dbgs() << "\nSpill slots after coloring:\n");
354 LLVM_DEBUG(SSIntervals[i]->dump());
355 LLVM_DEBUG(dbgs() << '\n');
384 LLVM_DEBUG(dbgs() << "Removing unused stack object fi#" << NextColor << "\n");
483 LLVM_DEBUG({
lib/CodeGen/TailDuplicator.cpp 264 LLVM_DEBUG(dbgs() << "\n*** Before tail-duplicating\n");
720 LLVM_DEBUG(dbgs() << "\nTail-duplicating into PredBB: " << *PredBB
801 LLVM_DEBUG(dbgs() << "\n*** Tail-duplicating " << printMBBReference(*TailBB)
832 LLVM_DEBUG(dbgs() << "\nTail-duplicating into PredBB: " << *PredBB
890 LLVM_DEBUG(dbgs() << "\nMerging into block: " << *PrevBB
996 LLVM_DEBUG(dbgs() << "\nRemoving MBB: " << *MBB);
lib/CodeGen/TargetRegisterInfo.cpp 457 LLVM_DEBUG(dbgs() << "Can't realign function's stack: " << F.getName()
lib/CodeGen/TwoAddressInstructionPass.cpp 686 LLVM_DEBUG(dbgs() << "2addr: COMMUTING : " << *MI);
690 LLVM_DEBUG(dbgs() << "2addr: COMMUTING FAILED!\n");
694 LLVM_DEBUG(dbgs() << "2addr: COMMUTED TO: " << *NewMI);
741 LLVM_DEBUG(dbgs() << "2addr: CONVERTING 2-ADDR: " << *mi);
742 LLVM_DEBUG(dbgs() << "2addr: TO 3-ADDR: " << *NewMI);
1018 LLVM_DEBUG(dbgs() << "\trescheduled below kill: " << *KillMI);
1184 LLVM_DEBUG(dbgs() << "\trescheduled kill: " << *KillMI);
1360 LLVM_DEBUG(dbgs() << "2addr: UNFOLDING: " << MI);
1369 LLVM_DEBUG(dbgs() << "2addr: ABANDONING UNFOLD\n");
1382 LLVM_DEBUG(dbgs() << "2addr: NEW LOAD: " << *NewMIs[0]
1447 LLVM_DEBUG(dbgs() << "2addr: ABANDONING UNFOLD\n");
1491 LLVM_DEBUG(dbgs() << "\t\trewrite undef:\t" << *MI);
1589 LLVM_DEBUG(dbgs() << "\t\tprepend:\t" << *MIB);
1687 LLVM_DEBUG(dbgs() << "********** REWRITING TWO-ADDR INSTRS **********\n");
1688 LLVM_DEBUG(dbgs() << "********** Function: " << MF->getName() << '\n');
1731 LLVM_DEBUG(dbgs() << '\t' << *mi);
1758 LLVM_DEBUG(dbgs() << "\t\trewrite to:\t" << *mi);
1772 LLVM_DEBUG(dbgs() << "\t\tconvert to:\t" << *mi);
1804 LLVM_DEBUG(dbgs() << "Illegal REG_SEQUENCE instruction:" << MI);
1855 LLVM_DEBUG(dbgs() << "Inserted: " << *CopyMI);
1862 LLVM_DEBUG(dbgs() << "Turned: " << MI << " into an IMPLICIT_DEF");
1867 LLVM_DEBUG(dbgs() << "Eliminated: " << MI);
lib/CodeGen/VirtRegMap.cpp 243 LLVM_DEBUG(dbgs() << "********** REWRITE VIRTUAL REGISTERS **********\n"
245 LLVM_DEBUG(VRM->dump());
377 LLVM_DEBUG(dbgs() << "Identity copy: " << MI);
388 LLVM_DEBUG(dbgs() << " replace by: " << MI);
395 LLVM_DEBUG(dbgs() << " deleted.\n");
501 LLVM_DEBUG(MBBI->print(dbgs(), Indexes));
584 LLVM_DEBUG(dbgs() << "> " << *MI);
lib/CodeGen/WinEHPrepare.cpp 282 LLVM_DEBUG(dbgs() << "TryLow[" << BB->getName() << "]: " << TryLow << '\n');
283 LLVM_DEBUG(dbgs() << "TryHigh[" << BB->getName() << "]: " << TryHigh
285 LLVM_DEBUG(dbgs() << "CatchHigh[" << BB->getName() << "]: " << CatchHigh
297 LLVM_DEBUG(dbgs() << "Assigning state #" << CleanupState << " to BB "
363 LLVM_DEBUG(dbgs() << "Assigning state #" << TryState << " to BB "
399 LLVM_DEBUG(dbgs() << "Assigning state #" << CleanupState << " to BB "
1051 LLVM_DEBUG(verifyFunction(F));
1054 LLVM_DEBUG(verifyFunction(F));
1058 LLVM_DEBUG(verifyPreparedFunclets(F));
1060 LLVM_DEBUG(colorFunclets(F));
1061 LLVM_DEBUG(verifyPreparedFunclets(F));
lib/ExecutionEngine/ExecutionEngine.cpp 216 LLVM_DEBUG(dbgs() << "JIT: Map \'" << Name << "\' to [" << Addr << "]\n";);
345 LLVM_DEBUG(dbgs() << "JIT: ARGV = " << (void *)Array.get() << "\n");
351 LLVM_DEBUG(dbgs() << "JIT: ARGV[" << i << "] = " << (void *)Dest.get()
1133 LLVM_DEBUG(dbgs() << "JIT: Initializing " << Addr << " ");
1134 LLVM_DEBUG(Init->dump());
1181 LLVM_DEBUG(dbgs() << "Bad Type: " << *Init->getType() << "\n");
lib/ExecutionEngine/Interpreter/Execution.cpp 1032 LLVM_DEBUG(dbgs() << "Allocated Type: " << *Ty << " (" << TypeSize
1081 LLVM_DEBUG(dbgs() << "GEP Index " << Total << " bytes.\n");
2169 LLVM_DEBUG(dbgs() << "About to interpret: " << I << "\n");
lib/ExecutionEngine/JITLink/EHFrameSupport.cpp 31 LLVM_DEBUG({
69 LLVM_DEBUG(dbgs() << " length: " << RecordLength << "\n");
159 LLVM_DEBUG(dbgs() << " Record is CIE\n");
279 LLVM_DEBUG(dbgs() << " Record is FDE\n");
281 LLVM_DEBUG({
302 LLVM_DEBUG({
319 LLVM_DEBUG(dbgs() << " FDE target: " << *TargetSymbol << "\n");
355 LLVM_DEBUG(dbgs() << " FDE LSDA: " << *LSDASymbol << "\n");
lib/ExecutionEngine/JITLink/JITLinkGeneric.cpp 38 LLVM_DEBUG({
45 LLVM_DEBUG({
97 LLVM_DEBUG({
106 LLVM_DEBUG({
164 LLVM_DEBUG({
186 LLVM_DEBUG(dbgs() << "JIT linker requesting: { ");
214 LLVM_DEBUG({
222 LLVM_DEBUG(dbgs() << " }\n");
229 LLVM_DEBUG({
278 LLVM_DEBUG({
332 LLVM_DEBUG(dbgs() << "Dead-stripping symbols:\n");
338 LLVM_DEBUG(dbgs() << " " << *Sym << "...\n");
345 LLVM_DEBUG(dbgs() << "Dead-stripping blocks:\n");
351 LLVM_DEBUG(dbgs() << " " << *B << "...\n");
lib/ExecutionEngine/JITLink/JITLinkGeneric.h 150 LLVM_DEBUG(dbgs() << "Copying and fixing up blocks:\n");
160 LLVM_DEBUG({
169 LLVM_DEBUG(dbgs() << " " << *B << ":\n");
174 LLVM_DEBUG({
182 LLVM_DEBUG({
192 LLVM_DEBUG({
201 LLVM_DEBUG(dbgs() << " Applying fixups.\n");
222 LLVM_DEBUG({
lib/ExecutionEngine/JITLink/MachO.cpp 43 LLVM_DEBUG({
60 LLVM_DEBUG({
lib/ExecutionEngine/JITLink/MachOLinkGraphBuilder.cpp 103 LLVM_DEBUG(dbgs() << "Creating normalized sections...\n");
133 LLVM_DEBUG({
204 LLVM_DEBUG(dbgs() << "Creating normalized symbols...\n");
246 LLVM_DEBUG({
298 LLVM_DEBUG(dbgs() << "Creating graph symbols...\n");
365 LLVM_DEBUG({
371 LLVM_DEBUG({
385 LLVM_DEBUG({
395 LLVM_DEBUG({
424 LLVM_DEBUG({
457 LLVM_DEBUG({
484 LLVM_DEBUG({
lib/ExecutionEngine/JITLink/MachO_arm64.cpp 222 LLVM_DEBUG({
271 LLVM_DEBUG({
378 LLVM_DEBUG({
lib/ExecutionEngine/JITLink/MachO_x86_64.cpp 231 LLVM_DEBUG({
347 LLVM_DEBUG({
lib/ExecutionEngine/Orc/Core.cpp 376 LLVM_DEBUG({
395 LLVM_DEBUG({
420 LLVM_DEBUG({
439 LLVM_DEBUG(JD.getExecutionSession().runSessionLocked([&]() {
544 LLVM_DEBUG({
1939 LLVM_DEBUG({
lib/ExecutionEngine/Orc/Layer.cpp 60 LLVM_DEBUG(JD.getExecutionSession().runSessionLocked([&]() {
96 LLVM_DEBUG(ES.runSessionLocked(
99 LLVM_DEBUG(ES.runSessionLocked([&]() {
lib/ExecutionEngine/RuntimeDyld/RuntimeDyld.cpp 127 LLVM_DEBUG(for (int i = 0, e = Sections.size(); i != e; ++i)
139 LLVM_DEBUG(for (int i = 0, e = Sections.size(); i != e; ++i)
151 LLVM_DEBUG(dbgs() << "Resolving relocations Section #" << Idx << "\t"
234 LLVM_DEBUG(dbgs() << "Parse symbols:\n");
300 LLVM_DEBUG(dbgs() << "\tType: " << SymType << " (absolute) Name: " << Name
332 LLVM_DEBUG(dbgs() << "\tType: " << SymType << " Name: " << Name
347 LLVM_DEBUG(dbgs() << "Parse relocations:\n");
374 LLVM_DEBUG(dbgs() << "\tSectionID: " << SectionID << "\n");
416 LLVM_DEBUG(dbgs() << "Process remaining sections:\n");
427 LLVM_DEBUG(dbgs() << "\tSectionID: " << (*SectionIDOrErr) << "\n");
735 LLVM_DEBUG(dbgs() << "emitCommonSection SectionID: " << SectionID
760 LLVM_DEBUG(dbgs() << "Allocating common symbol " << Name << " address "
861 LLVM_DEBUG(dbgs() << "emitSection SectionID: " << SectionID << " Name: "
872 LLVM_DEBUG(
1051 LLVM_DEBUG(
1079 LLVM_DEBUG(dbgs() << "Resolving absolute relocations."
1122 LLVM_DEBUG(dbgs() << "Resolving relocations Name: " << Name << "\t"
lib/ExecutionEngine/RuntimeDyld/RuntimeDyldChecker.cpp 692 LLVM_DEBUG(dbgs() << "RuntimeDyldChecker: Checking '" << CheckExpr
697 LLVM_DEBUG(dbgs() << "RuntimeDyldChecker: '" << CheckExpr << "' "
lib/ExecutionEngine/RuntimeDyld/RuntimeDyldELF.cpp 279 LLVM_DEBUG(dbgs() << "Writing " << format("%p", (Value + Addend)) << " at "
292 LLVM_DEBUG(dbgs() << "Writing " << format("%p", TruncatedAddr) << " at "
318 LLVM_DEBUG(dbgs() << "Writing " << format("%p", RealOffset) << " at "
376 LLVM_DEBUG(dbgs() << "resolveAArch64Relocation, LocalAddress: 0x"
496 LLVM_DEBUG(dbgs() << "resolveARMRelocation, LocalAddress: "
892 LLVM_DEBUG(dbgs() << "Writing " << format("%p", (Value + Addend)) << " at "
900 LLVM_DEBUG(dbgs() << "Writing " << format("%p", Value) << " at "
1058 LLVM_DEBUG(dbgs() << "\t\tThis is an AArch64 branch relocation.");
1069 LLVM_DEBUG(dbgs() << " Stub function found\n");
1072 LLVM_DEBUG(dbgs() << " Create a new stub function\n");
1129 LLVM_DEBUG(dbgs() << "\t\tRelType: " << RelType << " Addend: " << Addend
1171 LLVM_DEBUG(dbgs() << "\t\tThis is section symbol\n");
1203 LLVM_DEBUG(dbgs() << "\t\tSectionID: " << SectionID << " Offset: " << Offset
1226 LLVM_DEBUG(dbgs() << "\t\tThis is an ARM branch relocation.\n");
1236 LLVM_DEBUG(dbgs() << " Stub function found\n");
1239 LLVM_DEBUG(dbgs() << " Create a new stub function\n");
1274 LLVM_DEBUG(dbgs() << "\t\tThis is a Mips branch relocation.");
1289 LLVM_DEBUG(dbgs() << " Stub function found\n");
1292 LLVM_DEBUG(dbgs() << " Create a new stub function\n");
1376 LLVM_DEBUG(dbgs() << "\t\tThis is a Mips branch relocation.");
1384 LLVM_DEBUG(dbgs() << " Stub function found\n");
1387 LLVM_DEBUG(dbgs() << " Create a new stub function\n");
1495 LLVM_DEBUG(dbgs() << " Stub function found\n");
1498 LLVM_DEBUG(dbgs() << " Create a new stub function\n");
1615 LLVM_DEBUG(dbgs() << "\t\tThis is a SystemZ indirect relocation.");
1623 LLVM_DEBUG(dbgs() << " Stub function found\n");
1626 LLVM_DEBUG(dbgs() << " Create a new stub function\n");
1677 LLVM_DEBUG(dbgs() << " Stub function found\n");
1680 LLVM_DEBUG(dbgs() << " Create a new stub function\n");
lib/ExecutionEngine/RuntimeDyld/RuntimeDyldMachO.cpp 198 LLVM_DEBUG(dbgs() << "Populating pointer table section "
212 LLVM_DEBUG(dbgs() << " " << IndirectSymbolName << ": index " << SymbolIndex
280 LLVM_DEBUG(dbgs() << "Processing FDE: Delta for text: " << DeltaForText
lib/ExecutionEngine/RuntimeDyld/Targets/RuntimeDyldCOFFI386.h 82 LLVM_DEBUG(dbgs() << "\t\tIn Section " << SectionID << " Offset " << Offset
147 LLVM_DEBUG(dbgs() << "\t\tOffset: " << RE.Offset
162 LLVM_DEBUG(dbgs() << "\t\tOffset: " << RE.Offset
180 LLVM_DEBUG(dbgs() << "\t\tOffset: " << RE.Offset
192 LLVM_DEBUG(dbgs() << "\t\tOffset: " << RE.Offset
201 LLVM_DEBUG(dbgs() << "\t\tOffset: " << RE.Offset
lib/ExecutionEngine/RuntimeDyld/Targets/RuntimeDyldCOFFThumb.h 102 LLVM_DEBUG(dbgs() << "\t\tIn Section " << SectionID << " Offset " << Offset
192 LLVM_DEBUG(dbgs() << "\t\tOffset: " << RE.Offset
206 LLVM_DEBUG(dbgs() << "\t\tOffset: " << RE.Offset
219 LLVM_DEBUG(dbgs() << "\t\tOffset: " << RE.Offset
228 LLVM_DEBUG(dbgs() << "\t\tOffset: " << RE.Offset
238 LLVM_DEBUG(dbgs() << "\t\tOffset: " << RE.Offset
270 LLVM_DEBUG(dbgs() << "\t\tOffset: " << RE.Offset
285 LLVM_DEBUG(dbgs() << "\t\tOffset: " << RE.Offset
300 LLVM_DEBUG(dbgs() << "\t\tOffset: " << RE.Offset
lib/ExecutionEngine/RuntimeDyld/Targets/RuntimeDyldCOFFX86_64.h 158 LLVM_DEBUG(dbgs() << " Create a new stub function for "
166 LLVM_DEBUG(dbgs() << " Stub function found for " << TargetName.data()
248 LLVM_DEBUG(dbgs() << "\t\tIn Section " << SectionID << " Offset " << Offset
lib/ExecutionEngine/RuntimeDyld/Targets/RuntimeDyldELFMips.cpp 57 LLVM_DEBUG(dbgs() << "evaluateMIPS32Relocation, LocalAddress: 0x"
112 LLVM_DEBUG(dbgs() << "evaluateMIPS64Relocation, LocalAddress: 0x"
310 LLVM_DEBUG(dbgs() << "resolveMIPSO32Relocation, LocalAddress: "
lib/ExecutionEngine/RuntimeDyld/Targets/RuntimeDyldMachOAArch64.h 356 LLVM_DEBUG(dumpRelocationToResolve(RE, Value));
lib/ExecutionEngine/RuntimeDyld/Targets/RuntimeDyldMachOARM.h 204 LLVM_DEBUG(dumpRelocationToResolve(RE, Value));
413 LLVM_DEBUG(dbgs() << "Found SECTDIFF: AddrA: " << AddrA
lib/ExecutionEngine/RuntimeDyld/Targets/RuntimeDyldMachOI386.h 99 LLVM_DEBUG(dumpRelocationToResolve(RE, Value));
197 LLVM_DEBUG(dbgs() << "Found SECTDIFF: AddrA: " << AddrA
lib/ExecutionEngine/RuntimeDyld/Targets/RuntimeDyldMachOX86_64.h 87 LLVM_DEBUG(dumpRelocationToResolve(RE, Value));
lib/IR/ConstantsContext.h 702 LLVM_DEBUG(dbgs() << "Constant.cpp: ConstantUniqueMap\n");
lib/IR/Core.cpp 1874 LLVM_DEBUG(
1900 LLVM_DEBUG(
1905 LLVM_DEBUG(
1913 LLVM_DEBUG(
lib/IR/Instructions.cpp 477 LLVM_DEBUG(dbgs() << "Attempting to update profile weights will result in "
lib/IR/Pass.cpp 172 LLVM_DEBUG(dbgs() << "Skipping pass '" << getPassName() << "' on function "
213 LLVM_DEBUG(dbgs() << "Skipping pass '" << getPassName()
lib/IR/PassTimingInfo.cpp 245 LLVM_DEBUG(dbgs() << "after runBeforePass(" << PassID << ")\n");
246 LLVM_DEBUG(dump());
258 LLVM_DEBUG(dbgs() << "after runAfterPass(" << PassID << ")\n");
259 LLVM_DEBUG(dump());
lib/IR/SafepointIRVerifier.cpp 713 LLVM_DEBUG(dbgs() << "Removing urelocated " << I
721 LLVM_DEBUG(dbgs() << "Removing poisoned " << I << " from Contribution of "
775 LLVM_DEBUG(dbgs() << "Transfered block " << BB->getName() << " from ";
885 LLVM_DEBUG(dbgs() << "Verifying gc pointers in function: " << F.getName()
lib/LTO/ThinLTOCodeGenerator.cpp 1059 LLVM_DEBUG(dbgs() << "Cache " << (ErrOrBuffer ? "hit" : "miss")
lib/MC/MachObjectWriter.cpp 986 LLVM_DEBUG(dbgs() << "data in code region-- kind: " << Data->Kind
lib/MC/WasmObjectWriter.cpp 352 LLVM_DEBUG(dbgs() << "startSection " << SectionId << "\n");
369 LLVM_DEBUG(dbgs() << "startCustomSection " << Name << "\n");
395 LLVM_DEBUG(dbgs() << "endSection size=" << Size << "\n");
509 LLVM_DEBUG(dbgs() << "WasmReloc: " << Rec << "\n");
588 LLVM_DEBUG(errs() << "addData: " << DataSection.getSectionName() << "\n");
621 LLVM_DEBUG(dbgs() << "addData -> " << DataBytes.size() << "\n");
646 LLVM_DEBUG(dbgs() << "applyRelocation: " << RelEntry << "\n");
1060 LLVM_DEBUG(dbgs() << "registerFunctionType: " << Symbol
1062 LLVM_DEBUG(dbgs() << " -> type index: " << Pair.first->second << "\n");
1081 LLVM_DEBUG(dbgs() << "registerEventType: " << Symbol << " new:" << Pair.second
1083 LLVM_DEBUG(dbgs() << " -> type index: " << Pair.first->second << "\n");
1109 LLVM_DEBUG(dbgs() << "WasmObjectWriter::writeObject\n");
1291 LLVM_DEBUG(
1332 LLVM_DEBUG(dbgs() << " -> function index: " << Index << "\n");
1339 LLVM_DEBUG(dbgs() << " -> segment index: -1"
1364 LLVM_DEBUG(dbgs() << " -> segment index: " << Ref.Segment << "\n");
1372 LLVM_DEBUG(dbgs() << " -> global index: "
1390 LLVM_DEBUG(dbgs() << " -> event index: " << WasmIndices.find(&WS)->second
1411 LLVM_DEBUG(dbgs() << WS.getName() << ": weak alias of '" << *ResolvedSym
1419 LLVM_DEBUG(dbgs() << " -> index:" << WasmIndex << "\n");
1425 LLVM_DEBUG(dbgs() << " -> index:" << Ref.Segment << "\n");
1438 LLVM_DEBUG(dbgs() << "adding to symtab: " << WS << "\n");
1486 LLVM_DEBUG(dbgs() << " -> adding " << WS.getName()
lib/MCA/HardwareUnits/LSUnit.cpp 92 LLVM_DEBUG(dbgs() << "[LSUnit]: GROUP DEP: (" << ImmediateLoadDominator
98 LLVM_DEBUG(dbgs() << "[LSUnit]: GROUP DEP: (" << CurrentStoreGroupID
131 LLVM_DEBUG(dbgs() << "[LSUnit]: GROUP DEP: (" << CurrentStoreGroupID
137 LLVM_DEBUG(dbgs() << "[LSUnit]: GROUP DEP: (" << CurrentLoadBarrierGroupID
179 LLVM_DEBUG(dbgs() << "[LSUnit]: Instruction idx=" << IR.getSourceIndex()
185 LLVM_DEBUG(dbgs() << "[LSUnit]: Instruction idx=" << IR.getSourceIndex()
lib/MCA/HardwareUnits/RegisterFile.cpp 153 LLVM_DEBUG({
360 LLVM_DEBUG(dbgs() << "RegisterFile: collecting writes for register "
388 LLVM_DEBUG({
457 LLVM_DEBUG(dbgs() << "Not enough registers in the register file.\n");
lib/MCA/HardwareUnits/Scheduler.cpp 140 LLVM_DEBUG(dbgs() << "[SCHEDULER]: Instruction #" << IR
177 LLVM_DEBUG(dbgs() << "[SCHEDULER]: Instruction #" << IR
226 LLVM_DEBUG(dbgs() << "[SCHEDULER]: Instruction #" << IR
309 LLVM_DEBUG(dbgs() << "[SCHEDULER] Adding #" << IR << " to the WaitSet\n");
315 LLVM_DEBUG(dbgs() << "[SCHEDULER] Adding #" << IR
333 LLVM_DEBUG(dbgs() << "[SCHEDULER] Adding #" << IR << " to the ReadySet\n");
lib/MCA/InstrBuilder.cpp 185 LLVM_DEBUG({
329 LLVM_DEBUG({
359 LLVM_DEBUG({
374 LLVM_DEBUG({
407 LLVM_DEBUG({
440 LLVM_DEBUG(dbgs() << "\t\t[Use] OpIdx=" << Read.OpIndex
452 LLVM_DEBUG(dbgs() << "\t\t[Use][I] OpIdx=" << ~Read.OpIndex
476 LLVM_DEBUG(dbgs() << "\t\t[Use][V] OpIdx=" << Read.OpIndex
542 LLVM_DEBUG(dbgs() << "\n\t\tOpcode Name= " << MCII.getName(Opcode) << '\n');
543 LLVM_DEBUG(dbgs() << "\t\tSchedClassID=" << SchedClassID << '\n');
580 LLVM_DEBUG(dbgs() << "\t\tMaxLatency=" << ID->MaxLatency << '\n');
581 LLVM_DEBUG(dbgs() << "\t\tNumMicroOps=" << ID->NumMicroOps << '\n');
lib/MCA/Pipeline.cpp 86 LLVM_DEBUG(dbgs() << "\n[E] Cycle begin: " << Cycles << '\n');
92 LLVM_DEBUG(dbgs() << "[E] Cycle end: " << Cycles << "\n");
lib/MCA/Stages/DispatchStage.cpp 41 LLVM_DEBUG(dbgs() << "[E] Instruction Dispatched: #" << IR << '\n');
lib/MCA/Stages/ExecuteStage.cpp 134 LLVM_DEBUG(dbgs() << "[E] Backpressure increased because of unavailable "
145 LLVM_DEBUG(
152 LLVM_DEBUG(dbgs() << "[E] Backpressure increased by memory dependencies\n");
228 LLVM_DEBUG(dbgs() << "[E] Instruction Executed: #" << IR << '\n');
234 LLVM_DEBUG(dbgs() << "[E] Instruction Pending: #" << IR << '\n');
240 LLVM_DEBUG(dbgs() << "[E] Instruction Ready: #" << IR << '\n');
246 LLVM_DEBUG(dbgs() << "[E] Resource Available: [" << RR.first << '.'
255 LLVM_DEBUG({
lib/MCA/Stages/RetireStage.cpp 51 LLVM_DEBUG(llvm::dbgs() << "[E] Instruction Retired: #" << IR << '\n');
lib/MCA/Support.cpp 71 LLVM_DEBUG(dbgs() << "\nProcessor resource masks:"
75 LLVM_DEBUG(dbgs() << '[' << format_decimal(I,2) << "] " << " - "
lib/Object/WasmObjectFile.cpp 215 LLVM_DEBUG(dbgs() << "readSection type=" << Section.Type << "\n");
411 LLVM_DEBUG(dbgs() << "readSubsection type=" << int(Type) << " size=" << Size
626 LLVM_DEBUG(dbgs() << "Adding symbol: " << Symbols.back() << "\n");
1254 LLVM_DEBUG(dbgs() << "getSymbolFlags: ptr=" << &Sym << " " << Sym << "\n");
lib/ProfileData/Coverage/CoverageMapping.cpp 397 LLVM_DEBUG({
574 LLVM_DEBUG({
589 LLVM_DEBUG(dbgs() << " ! Segment " << L.Line << ":" << L.Col
668 LLVM_DEBUG(dbgs() << "Emitting segments for file: " << Filename << "\n");
714 LLVM_DEBUG(dbgs() << "Emitting segments for function: " << Function.Name
733 LLVM_DEBUG(dbgs() << "Emitting segments for expansion of file "
lib/ProfileData/Coverage/CoverageMappingReader.cpp 231 LLVM_DEBUG({
lib/Support/APInt.cpp 2849 LLVM_DEBUG(dbgs() << __func__ << ": solving " << A << "x^2 + " << B
2854 LLVM_DEBUG(dbgs() << __func__ << ": zero solution\n");
2966 LLVM_DEBUG(dbgs() << __func__ << ": updated coefficients " << A << "x^2 + "
3000 LLVM_DEBUG(dbgs() << __func__ << ": solution (root): " << X << '\n');
3021 LLVM_DEBUG(dbgs() << __func__ << ": no valid solution\n");
3026 LLVM_DEBUG(dbgs() << __func__ << ": solution (wrap): " << X << '\n');
lib/Support/CachePruning.cpp 163 LLVM_DEBUG(dbgs() << "No pruning settings set, exit early\n");
190 LLVM_DEBUG(dbgs() << "Timestamp file too recent ("
225 LLVM_DEBUG(dbgs() << "Ignore " << File->path() << " (can't stat)\n");
233 LLVM_DEBUG(dbgs() << "Remove " << File->path() << " ("
254 LLVM_DEBUG(dbgs() << " - Remove " << FileInfo->Path << " (size "
282 LLVM_DEBUG(dbgs() << "Occupancy: " << ((100 * TotalSize) / AvailableSpace)
lib/Support/CommandLine.cpp 1577 LLVM_DEBUG(dbgs() << "Args: ";
lib/Support/DAGDeltaAlgorithm.cpp 126 LLVM_DEBUG({
226 LLVM_DEBUG({
322 LLVM_DEBUG({
lib/Support/RandomNumberGenerator.cpp 34 LLVM_DEBUG(if (Seed == 0) dbgs()
lib/Target/AArch64/AArch64A53Fix835769.cpp 118 LLVM_DEBUG(dbgs() << "***** AArch64A53Fix835769 *****\n");
192 LLVM_DEBUG(dbgs() << "Running on MBB: " << MBB
209 LLVM_DEBUG(dbgs() << " Examining: " << MI);
211 LLVM_DEBUG(dbgs() << " PrevInstr: " << *PrevInstr
219 LLVM_DEBUG(dbgs() << " ** pattern found at Idx " << Idx << "!\n");
228 LLVM_DEBUG(dbgs() << "Scan complete, " << Sequences.size()
lib/Target/AArch64/AArch64A57FPLoadBalancing.cpp 317 LLVM_DEBUG(dbgs() << "***** AArch64A57FPLoadBalancing *****\n");
332 LLVM_DEBUG(dbgs() << "Running on MBB: " << MBB
346 LLVM_DEBUG(dbgs() << "Scan complete, " << AllChains.size()
364 LLVM_DEBUG(dbgs() << "Created " << EC.getNumClasses() << " disjoint sets.\n");
443 LLVM_DEBUG(dbgs() << "colorChainSet(): #sets=" << GV.size() << "\n");
473 LLVM_DEBUG(dbgs() << " - Parity=" << Parity
481 LLVM_DEBUG(dbgs() << " - " << G->str()
533 LLVM_DEBUG(dbgs() << " - colorChain(" << G->str() << ", "
540 LLVM_DEBUG(dbgs() << "Scavenging (thus coloring) failed!\n");
543 LLVM_DEBUG(dbgs() << " - Scavenged register: " << printReg(Reg, TRI) << "\n");
591 LLVM_DEBUG(dbgs() << " - Kill instruction seen.\n");
595 LLVM_DEBUG(dbgs() << " - Destination register not changed.\n");
616 LLVM_DEBUG(dbgs() << "New chain started for register "
636 LLVM_DEBUG(dbgs() << "Chain found for accumulator register "
646 LLVM_DEBUG(dbgs() << "Instruction was successfully added to chain.\n");
656 LLVM_DEBUG(
662 LLVM_DEBUG(dbgs() << "Creating new chain for dest register "
691 LLVM_DEBUG(dbgs() << "Kill seen for chain " << printReg(MO.getReg(), TRI)
702 LLVM_DEBUG(dbgs() << "Kill (regmask) seen for chain "
lib/Target/AArch64/AArch64AdvSIMDScalarPass.cpp 279 LLVM_DEBUG(dbgs() << " adding copy: " << *MIB);
288 LLVM_DEBUG(dbgs() << "Scalar transform: " << MI);
393 LLVM_DEBUG(dbgs() << "***** AArch64AdvSIMDScalar *****\n");
lib/Target/AArch64/AArch64BranchTargets.cpp 64 LLVM_DEBUG(
105 LLVM_DEBUG(dbgs() << "Adding BTI " << (CouldJump ? "j" : "")
lib/Target/AArch64/AArch64CallLowering.cpp 285 LLVM_DEBUG(dbgs() << "Can't handle extended arg types which need split");
320 LLVM_DEBUG(dbgs() << "Outgoing vector ret has too many elts");
342 LLVM_DEBUG(dbgs() << "Could not handle ret ty");
582 LLVM_DEBUG(dbgs() << "... Could not analyze call operands.\n");
589 LLVM_DEBUG(dbgs() << "... Cannot fit call operands on caller's stack.\n");
610 LLVM_DEBUG(
624 LLVM_DEBUG(
632 LLVM_DEBUG(
642 LLVM_DEBUG(
651 LLVM_DEBUG(dbgs() << "... Callee-saved register was not copied into "
673 LLVM_DEBUG(dbgs() << "Attempting to lower call as tail call\n");
680 LLVM_DEBUG(dbgs() << "... Cannot handle tail calls with swifterror yet.\n");
685 LLVM_DEBUG(dbgs() << "... Calling convention cannot be tail called.\n");
709 LLVM_DEBUG(dbgs() << "... Cannot tail call from callers with byval, "
727 LLVM_DEBUG(dbgs() << "... Cannot tail call externally-defined function "
748 LLVM_DEBUG(
757 LLVM_DEBUG(
793 LLVM_DEBUG(
950 LLVM_DEBUG(dbgs() << "Failed to lower musttail call as tail call\n");
lib/Target/AArch64/AArch64CollectLOH.cpp 387 LLVM_DEBUG(dbgs() << "Adding MCLOH_AdrpAdrp:\n"
397 LLVM_DEBUG(dbgs() << "Adding MCLOH_AdrpAdd:\n"
404 LLVM_DEBUG(dbgs() << "Adding MCLOH_AdrpLdr:\n"
411 LLVM_DEBUG(dbgs() << "Adding MCLOH_AdrpAddLdr:\n"
419 LLVM_DEBUG(dbgs() << "Adding MCLOH_AdrpAddStr:\n"
427 LLVM_DEBUG(dbgs() << "Adding MCLOH_AdrpLdrGotLdr:\n"
434 LLVM_DEBUG(dbgs() << "Adding MCLOH_AdrpLdrGotStr:\n"
441 LLVM_DEBUG(dbgs() << "Adding MCLOH_AdrpLdrGot:\n"
506 LLVM_DEBUG(dbgs() << "********** AArch64 Collect LOH **********\n"
lib/Target/AArch64/AArch64CondBrTuning.cpp 203 LLVM_DEBUG(dbgs() << " Replacing instructions:\n ");
204 LLVM_DEBUG(DefMI.print(dbgs()));
205 LLVM_DEBUG(dbgs() << " ");
206 LLVM_DEBUG(MI.print(dbgs()));
262 LLVM_DEBUG(dbgs() << " Replacing instructions:\n ");
263 LLVM_DEBUG(DefMI.print(dbgs()));
264 LLVM_DEBUG(dbgs() << " ");
265 LLVM_DEBUG(MI.print(dbgs()));
277 LLVM_DEBUG(dbgs() << " with instruction:\n ");
278 LLVM_DEBUG(NewCmp->print(dbgs()));
279 LLVM_DEBUG(dbgs() << " ");
280 LLVM_DEBUG(NewBr->print(dbgs()));
295 LLVM_DEBUG(
lib/Target/AArch64/AArch64ConditionOptimizer.cpp 175 LLVM_DEBUG(dbgs() << "Immediate of cmp is symbolic, " << *I << '\n');
178 LLVM_DEBUG(dbgs() << "Immediate of cmp may be out of range, " << *I
182 LLVM_DEBUG(dbgs() << "Destination of cmp is not dead, " << *I << '\n');
210 LLVM_DEBUG(dbgs() << "Flags not defined in " << printMBBReference(*MBB)
329 LLVM_DEBUG(dbgs() << "********** AArch64 Conditional Compares **********\n"
388 LLVM_DEBUG(dbgs() << "Head branch:\n");
389 LLVM_DEBUG(dbgs() << "\tcondition: " << AArch64CC::getCondCodeName(HeadCmp)
391 LLVM_DEBUG(dbgs() << "\timmediate: " << HeadImm << '\n');
393 LLVM_DEBUG(dbgs() << "True branch:\n");
394 LLVM_DEBUG(dbgs() << "\tcondition: " << AArch64CC::getCondCodeName(TrueCmp)
396 LLVM_DEBUG(dbgs() << "\timmediate: " << TrueImm << '\n');
lib/Target/AArch64/AArch64ConditionalCompares.cpp 313 LLVM_DEBUG(dbgs() << "Flags not used by terminator: " << *I);
331 LLVM_DEBUG(dbgs() << "Immediate out of range for ccmp: " << *I);
342 LLVM_DEBUG(dbgs() << "Can't convert compare with live destination: "
361 LLVM_DEBUG(dbgs() << "Can't create ccmp with multiple uses: " << *I);
367 LLVM_DEBUG(dbgs() << "Not convertible compare: " << *I);
372 LLVM_DEBUG(dbgs() << "Flags not defined in " << printMBBReference(*MBB)
387 LLVM_DEBUG(dbgs() << printMBBReference(*MBB) << " has live-ins.\n");
400 LLVM_DEBUG(dbgs() << printMBBReference(*MBB) << " has more than "
407 LLVM_DEBUG(dbgs() << "Can't hoist: " << I);
415 LLVM_DEBUG(dbgs() << "Won't speculate load: " << I);
422 LLVM_DEBUG(dbgs() << "Can't speculate: " << I);
428 LLVM_DEBUG(dbgs() << "Clobbers flags: " << I);
462 LLVM_DEBUG(dbgs() << "\nTriangle: " << printMBBReference(*Head) << " -> "
474 LLVM_DEBUG(dbgs() << "Can't handle phis in Tail.\n");
480 LLVM_DEBUG(dbgs() << "Can't handle live-in physregs in Tail.\n");
488 LLVM_DEBUG(dbgs() << "Can't handle phis in CmpBB.\n");
494 LLVM_DEBUG(dbgs() << "Can't handle live-in physregs in CmpBB.\n");
503 LLVM_DEBUG(dbgs() << "Head branch not analyzable.\n");
511 LLVM_DEBUG(
518 LLVM_DEBUG(dbgs() << "Unsupported branch type on Head\n");
532 LLVM_DEBUG(dbgs() << "CmpBB branch not analyzable.\n");
538 LLVM_DEBUG(
545 LLVM_DEBUG(dbgs() << "Unsupported branch type on CmpBB\n");
553 LLVM_DEBUG(dbgs() << "Head->CmpBB on "
570 LLVM_DEBUG(dbgs() << "Merging " << printMBBReference(*CmpBB) << " into "
717 LLVM_DEBUG(dbgs() << "Result:\n" << *Head);
867 LLVM_DEBUG(dbgs() << "Code size delta: " << CodeSizeDelta << '\n');
873 LLVM_DEBUG(dbgs() << "Code size is increasing, give up on this one.\n");
892 LLVM_DEBUG(dbgs() << "Head depth: " << HeadDepth
895 LLVM_DEBUG(dbgs() << "Branch delay would be larger than " << DelayLimit
903 LLVM_DEBUG(dbgs() << "Resources: " << ResDepth << '\n');
909 LLVM_DEBUG(dbgs() << "Too many instructions to speculate.\n");
929 LLVM_DEBUG(dbgs() << "********** AArch64 Conditional Compares **********\n"
lib/Target/AArch64/AArch64DeadRegisterDefinitionsPass.cpp 124 LLVM_DEBUG(dbgs() << " Ignoring, operand is frame index\n");
130 LLVM_DEBUG(
137 LLVM_DEBUG(dbgs() << " Ignoring, semantics change with xzr/wzr.\n");
153 LLVM_DEBUG(dbgs() << " Dead def operand #" << I << " in:\n ";
157 LLVM_DEBUG(dbgs() << " Ignoring, def is tied operand.\n");
163 LLVM_DEBUG(dbgs() << " Ignoring, register is not a GPR.\n");
170 LLVM_DEBUG(dbgs() << " Ignoring, register is not a GPR.\n");
173 LLVM_DEBUG(dbgs() << " Replacing with zero register. New:\n ");
176 LLVM_DEBUG(MI.print(dbgs()));
194 LLVM_DEBUG(dbgs() << "***** AArch64DeadRegisterDefinitions *****\n");
lib/Target/AArch64/AArch64FalkorHWPFFix.cpp 171 LLVM_DEBUG(dbgs() << "Load: " << I << " marked as strided\n");
733 LLVM_DEBUG(dbgs() << "Attempting to fix tag collision: " << MI);
736 LLVM_DEBUG(dbgs() << "Skipping fix due to debug counter:\n " << MI);
761 LLVM_DEBUG(dbgs() << "Changing base reg to: "
780 LLVM_DEBUG(dbgs() << "Doing post MOV of incremented reg: "
lib/Target/AArch64/AArch64FrameLowering.cpp 2029 LLVM_DEBUG(dbgs() << "CSR spill: (" << printReg(Reg1, TRI);
2120 LLVM_DEBUG(dbgs() << "CSR restore: (" << printReg(Reg1, TRI);
2245 LLVM_DEBUG(dbgs() << "*** determineCalleeSaves\nSaved CSRs:";
2276 LLVM_DEBUG(dbgs() << "Spilling " << printReg(UnspilledCSGPR, RegInfo)
2296 LLVM_DEBUG(dbgs() << "No available CS registers, allocated fi#" << FI
2304 LLVM_DEBUG(dbgs() << "Estimated stack frame size: "
2392 LLVM_DEBUG(dbgs() << "Offset from the SP for " << FI << " is "
lib/Target/AArch64/AArch64ISelDAGToDAG.cpp 1605 LLVM_DEBUG(
1749 LLVM_DEBUG(
2872 LLVM_DEBUG(errs() << "== "; Node->dump(CurDAG); errs() << "\n");
lib/Target/AArch64/AArch64ISelLowering.cpp 1582 LLVM_DEBUG(dbgs() << "Is imm " << C
2961 LLVM_DEBUG(dbgs() << "Custom lowering: ");
2962 LLVM_DEBUG(Op.dump());
4308 LLVM_DEBUG(dbgs() << "AArch64TargetLowering::getGOT\n");
4321 LLVM_DEBUG(dbgs() << "AArch64TargetLowering::getAddrLarge\n");
4337 LLVM_DEBUG(dbgs() << "AArch64TargetLowering::getAddr\n");
4351 LLVM_DEBUG(dbgs() << "AArch64TargetLowering::getAddrTiny\n");
5740 LLVM_DEBUG(dbgs() << (IsLegal ? "Legal " : "Illegal ") << VT.getEVTString()
6256 LLVM_DEBUG(dbgs() << "AArch64TargetLowering::ReconstructShuffle\n");
6292 LLVM_DEBUG(
6313 LLVM_DEBUG(
6361 LLVM_DEBUG(
6408 LLVM_DEBUG(for (auto Src
6443 LLVM_DEBUG(dbgs() << "Reshuffle failed: illegal shuffle mask\n");
6455 LLVM_DEBUG(dbgs() << "Reshuffle, creating node: "; Shuffle.dump();
7415 LLVM_DEBUG(dbgs() << "aarch64-lower: transformed: \n");
7416 LLVM_DEBUG(N->dump(&DAG));
7417 LLVM_DEBUG(dbgs() << "into: \n");
7418 LLVM_DEBUG(ResultSLI->dump(&DAG));
7614 LLVM_DEBUG(
7623 LLVM_DEBUG(dbgs() << "LowerBUILD_VECTOR: only low element used, creating 1 "
7695 LLVM_DEBUG(
7705 LLVM_DEBUG(
7720 LLVM_DEBUG(
7728 LLVM_DEBUG(dbgs() << "LowerBUILD_VECTOR: trying to lower new vector: ";
7764 LLVM_DEBUG(
7783 LLVM_DEBUG(
7802 LLVM_DEBUG(dbgs() << "Creating node for op0, it is not undefined:\n");
7806 LLVM_DEBUG(if (i < NumElts) dbgs()
7818 LLVM_DEBUG(
9096 LLVM_DEBUG(dbgs() << "Illegal add imm " << Immed
9104 LLVM_DEBUG(dbgs() << "Is " << Immed
9951 LLVM_DEBUG(
10040 LLVM_DEBUG(
11720 LLVM_DEBUG(dbgs() << "Custom combining: skipping\n");
lib/Target/AArch64/AArch64InstructionSelector.cpp 388 LLVM_DEBUG(
408 LLVM_DEBUG(dbgs() << "Generic binop register should be typed\n");
416 LLVM_DEBUG(dbgs() << "Generic inst non-reg operands are unsupported\n");
425 LLVM_DEBUG(dbgs() << "Generic inst has physical register operand\n");
431 LLVM_DEBUG(dbgs() << "Generic register has no bank or class\n");
436 LLVM_DEBUG(dbgs() << "Generic inst operands have different banks\n");
657 LLVM_DEBUG(dbgs() << "Unexpected dest size "
688 LLVM_DEBUG(dbgs() << "Couldn't determine source register class\n");
708 LLVM_DEBUG(dbgs() << "Couldn't determine subregister for copy.\n");
747 LLVM_DEBUG(dbgs() << "Failed to constrain " << TII.getName(I.getOpcode())
1028 LLVM_DEBUG(dbgs() << "Unhandled G_SHL type");
1070 LLVM_DEBUG(dbgs() << "Unhandled G_ASHR type");
1343 LLVM_DEBUG(dbgs() << "PHI operand has no type, not a gvreg?\n");
1349 LLVM_DEBUG(dbgs() << "PHI operand has unexpected size/bank\n");
1367 LLVM_DEBUG(
1399 LLVM_DEBUG(dbgs() << "G_BRCOND has type: " << Ty
1455 LLVM_DEBUG(dbgs() << "Dst type for G_BSWAP currently unsupported.\n");
1463 LLVM_DEBUG(dbgs() << "Unsupported number of elements for G_BSWAP.\n");
1502 LLVM_DEBUG(dbgs() << "Unable to materialize FP " << Ty
1509 LLVM_DEBUG(dbgs() << "Unable to materialize FP " << Ty
1522 LLVM_DEBUG(dbgs() << "Unable to materialize integer " << Ty
1529 LLVM_DEBUG(dbgs() << "Unable to materialize integer " << Ty
1559 LLVM_DEBUG(dbgs() << "Failed to constrain G_FCONSTANT def operand\n");
1676 LLVM_DEBUG(dbgs() << "G_FRAME_INDEX pointer has type: " << Ty
1725 LLVM_DEBUG(dbgs() << "Load/Store pointer has type: " << PtrTy
1739 LLVM_DEBUG(dbgs() << "Atomic load/store not fully supported yet\n");
1831 LLVM_DEBUG(dbgs() << "G_[SU]MULH on bank: " << RB << ", expected: GPR\n");
1836 LLVM_DEBUG(dbgs() << "G_[SU]MULH has type: " << Ty
1897 LLVM_DEBUG(
1905 LLVM_DEBUG(dbgs() << "G_UADDO currently only supported for scalars.\n");
1953 LLVM_DEBUG(
1971 LLVM_DEBUG(dbgs() << "Failed to constrain G_TRUNC/G_PTRTOINT\n");
1985 LLVM_DEBUG(
2019 LLVM_DEBUG(dbgs() << "G_ANYEXT on bank: " << RBDst
2026 LLVM_DEBUG(dbgs() << "G_ANYEXT on bank: " << RBSrc
2034 LLVM_DEBUG(dbgs() << "G_ANYEXT operand has no size, not a gvreg?\n");
2039 LLVM_DEBUG(dbgs() << "G_ANYEXT to size: " << DstSize
2098 LLVM_DEBUG(dbgs() << "Failed to constrain " << TII.getName(Opcode)
2159 LLVM_DEBUG(dbgs() << "G_SELECT cond has type: " << Ty
2195 LLVM_DEBUG(dbgs() << "G_ICMP result has type: " << Ty
2212 LLVM_DEBUG(dbgs() << "G_FCMP result has type: " << Ty
2445 LLVM_DEBUG(dbgs() << "Unsupported type for G_INTRINSIC_TRUNC!\n");
2500 LLVM_DEBUG(dbgs() << "Unsupported type for G_INTRINSIC_ROUND!\n");
2647 LLVM_DEBUG(dbgs() << "Could not map G_ICMP to cmp opcode");
2655 LLVM_DEBUG(dbgs() << "Could not determine source register class.\n");
2798 LLVM_DEBUG(dbgs() << "Elt size '" << EltSize << "' unsupported.\n");
2811 LLVM_DEBUG(
2819 LLVM_DEBUG(dbgs() << "Could not determine destination register class.\n");
2828 LLVM_DEBUG(dbgs() << "Could not determine source register class.\n");
2882 LLVM_DEBUG(dbgs() << "Cannot extract into GPR.\n");
2913 LLVM_DEBUG(dbgs() << "Unexpected vector type for vec split unmerge");
2944 LLVM_DEBUG(dbgs() << "Unmerging vector-to-gpr and scalar-to-scalar "
3040 LLVM_DEBUG(dbgs() << "Couldn't constrain copy destination.\n");
3100 LLVM_DEBUG(dbgs() << "Could not load from constant pool of type "
3284 LLVM_DEBUG(dbgs() << "Could not do vector concat of differing vector tys");
3290 LLVM_DEBUG(dbgs() << "Vector concat not supported for full size vectors");
3296 LLVM_DEBUG(dbgs() << "Vector concat supported for 64b vectors");
3310 LLVM_DEBUG(dbgs() << "Could not emit a vector from scalar value");
3435 LLVM_DEBUG(dbgs() << "Couldn't emit compare for select!\n");
3614 LLVM_DEBUG(dbgs() << "Could not optimize splat pattern < 128b yet");
3669 LLVM_DEBUG(dbgs() << "Could not select a \"scalar\" G_SHUFFLE_VECTOR\n");
3692 LLVM_DEBUG(dbgs() << "Could not load from a constant pool");
3701 LLVM_DEBUG(dbgs() << "Could not do vector concat for tbl1");
3825 LLVM_DEBUG(dbgs() << "Unsupported register class!\n");
3832 LLVM_DEBUG(dbgs() << "Unsupported destination size! (" << VecSize
3892 LLVM_DEBUG(dbgs() << "Unsupported register class!\n");
3900 LLVM_DEBUG(dbgs() << "Unsupported destination size! (" << DstSize
lib/Target/AArch64/AArch64LegalizerInfo.cpp 702 LLVM_DEBUG(dbgs() << "Tried to do custom legalization on wrong load/store");
lib/Target/AArch64/AArch64LoadStoreOptimizer.cpp 772 LLVM_DEBUG(dbgs() << "Creating wider store. Replacing instructions:\n ");
773 LLVM_DEBUG(I->print(dbgs()));
774 LLVM_DEBUG(dbgs() << " ");
775 LLVM_DEBUG(MergeMI->print(dbgs()));
776 LLVM_DEBUG(dbgs() << " with instruction:\n ");
777 LLVM_DEBUG(((MachineInstr *)MIB)->print(dbgs()));
778 LLVM_DEBUG(dbgs() << "\n");
890 LLVM_DEBUG(
892 LLVM_DEBUG(I->print(dbgs()));
893 LLVM_DEBUG(dbgs() << " ");
894 LLVM_DEBUG(Paired->print(dbgs()));
895 LLVM_DEBUG(dbgs() << " with instruction:\n ");
909 LLVM_DEBUG(((MachineInstr *)MIB)->print(dbgs()));
910 LLVM_DEBUG(dbgs() << "\n");
927 LLVM_DEBUG(dbgs() << " Extend operand:\n ");
928 LLVM_DEBUG(((MachineInstr *)MIBSXTW)->print(dbgs()));
930 LLVM_DEBUG(((MachineInstr *)MIB)->print(dbgs()));
932 LLVM_DEBUG(dbgs() << "\n");
970 LLVM_DEBUG(dbgs() << "Remove load instruction:\n ");
971 LLVM_DEBUG(LoadI->print(dbgs()));
972 LLVM_DEBUG(dbgs() << "\n");
1044 LLVM_DEBUG(dbgs() << "Promoting load by replacing :\n ");
1045 LLVM_DEBUG(StoreI->print(dbgs()));
1046 LLVM_DEBUG(dbgs() << " ");
1047 LLVM_DEBUG(LoadI->print(dbgs()));
1048 LLVM_DEBUG(dbgs() << " with instructions:\n ");
1049 LLVM_DEBUG(StoreI->print(dbgs()));
1050 LLVM_DEBUG(dbgs() << " ");
1051 LLVM_DEBUG((BitExtMI)->print(dbgs()));
1052 LLVM_DEBUG(dbgs() << "\n");
1421 LLVM_DEBUG(dbgs() << "Creating pre-indexed load/store.");
1424 LLVM_DEBUG(dbgs() << "Creating post-indexed load/store.");
1426 LLVM_DEBUG(dbgs() << " Replacing instructions:\n ");
1427 LLVM_DEBUG(I->print(dbgs()));
1428 LLVM_DEBUG(dbgs() << " ");
1429 LLVM_DEBUG(Update->print(dbgs()));
1430 LLVM_DEBUG(dbgs() << " with instruction:\n ");
1431 LLVM_DEBUG(((MachineInstr *)MIB)->print(dbgs()));
1432 LLVM_DEBUG(dbgs() << "\n");
lib/Target/AArch64/AArch64PBQPRegAlloc.cpp 166 LLVM_DEBUG(dbgs() << "Rd is a physical reg:"
168 LLVM_DEBUG(dbgs() << "Ra is a physical reg:"
249 LLVM_DEBUG(dbgs() << "Moving acc chain from " << printReg(Ra, TRI)
255 LLVM_DEBUG(dbgs() << "Creating new acc chain for " << printReg(Rd, TRI)
281 LLVM_DEBUG(dbgs() << "Refining constraint !\n";);
331 LLVM_DEBUG(MF.dump());
342 LLVM_DEBUG(dbgs() << "Killing chain " << printReg(r, TRI) << " at ";
lib/Target/AArch64/AArch64PromoteConstant.cpp 121 LLVM_DEBUG(dbgs() << getPassName() << '\n');
382 LLVM_DEBUG(dbgs() << "Insertion point dominated by:\n");
383 LLVM_DEBUG(IPI.first->print(dbgs()));
384 LLVM_DEBUG(dbgs() << '\n');
410 LLVM_DEBUG(dbgs() << "Merge insertion point with:\n");
411 LLVM_DEBUG(IPI->first->print(dbgs()));
412 LLVM_DEBUG(dbgs() << "\nat considered insertion point.\n");
432 LLVM_DEBUG(dbgs() << "Merge insertion point with:\n");
433 LLVM_DEBUG(IPI->first->print(dbgs()));
434 LLVM_DEBUG(dbgs() << '\n');
435 LLVM_DEBUG(NewPt->print(dbgs()));
436 LLVM_DEBUG(dbgs() << '\n');
445 LLVM_DEBUG(dbgs() << "Considered use, opidx " << OpNo << ":\n");
446 LLVM_DEBUG(User->print(dbgs()));
447 LLVM_DEBUG(dbgs() << '\n');
451 LLVM_DEBUG(dbgs() << "Considered insertion point:\n");
452 LLVM_DEBUG(InsertionPoint->print(dbgs()));
453 LLVM_DEBUG(dbgs() << '\n');
462 LLVM_DEBUG(dbgs() << "Keep considered insertion point\n");
478 LLVM_DEBUG(dbgs() << "Global replacement: ");
479 LLVM_DEBUG(PC.GV->print(dbgs()));
480 LLVM_DEBUG(dbgs() << '\n');
498 LLVM_DEBUG(dbgs() << "**********\n");
499 LLVM_DEBUG(dbgs() << "New def: ");
500 LLVM_DEBUG(LoadedCst->print(dbgs()));
501 LLVM_DEBUG(dbgs() << '\n');
510 LLVM_DEBUG({
526 LLVM_DEBUG(dbgs() << "** Compute insertion points **\n");
lib/Target/AArch64/AArch64RedundantCopyElimination.cpp 414 LLVM_DEBUG(dbgs() << "Remove redundant Copy : " << *MI);
416 LLVM_DEBUG(dbgs() << "Remove redundant Move : " << *MI);
460 LLVM_DEBUG(dbgs() << "Clearing kill flags.\n\tFirstUse: " << *FirstUse
lib/Target/AArch64/AArch64SpeculationHardening.cpp 242 LLVM_DEBUG(dbgs() << "Instrument control flow tracking on MBB: " << MBB);
250 LLVM_DEBUG(dbgs() << "... doesn't end with CondControlFlow\n");
271 LLVM_DEBUG(dbgs() << "SplitEdgeTBB: " << *SplitEdgeTBB << "\n");
272 LLVM_DEBUG(dbgs() << "SplitEdgeFBB: " << *SplitEdgeFBB << "\n");
308 LLVM_DEBUG(dbgs() << "RS finds "
332 LLVM_DEBUG(
343 LLVM_DEBUG(dbgs() << " About to insert Reg to SP and back taint "
449 LLVM_DEBUG(dbgs() << "About to harden register : " << Reg << "\n");
462 LLVM_DEBUG(dbgs() << "slhLoads running on MBB: " << MBB);
475 LLVM_DEBUG(dbgs() << "About to harden: " << MI);
668 LLVM_DEBUG(
676 LLVM_DEBUG(
lib/Target/AArch64/AArch64StackTagging.cpp 183 LLVM_DEBUG(dbgs() << "Combined initializer\n");
222 LLVM_DEBUG(dbgs() << " [" << Offset << ", " << Offset + Size
232 LLVM_DEBUG(dbgs() << " [" << Offset << ", " << Offset + Size
241 LLVM_DEBUG(dbgs() << " [" << Offset << ", " << Offset + 16 << "):\n");
242 LLVM_DEBUG(dbgs() << " " << *A << "\n " << *B << "\n");
418 LLVM_DEBUG(dbgs() << "collecting initializers for " << *AI
lib/Target/AArch64/AArch64StackTaggingPreRA.cpp 186 LLVM_DEBUG(dbgs() << "********** AArch64 Stack Tagging PreRA **********\n"
lib/Target/AArch64/AArch64StorePairSuppress.cpp 93 LLVM_DEBUG(dbgs() << " Suppress STP in BB: " << BB->getNumber()
133 LLVM_DEBUG(dbgs() << "*** " << getPassName() << ": " << MF.getName() << '\n');
136 LLVM_DEBUG(dbgs() << " Skipping pass: no machine model present.\n");
160 LLVM_DEBUG(dbgs() << "Unpairing store " << MI << "\n");
lib/Target/AArch64/AArch64TargetTransformInfo.cpp 757 LLVM_DEBUG(dbgs() << "falkor-hwpf: detected " << StridedLoads
763 LLVM_DEBUG(dbgs() << "falkor-hwpf: setting unroll MaxCount to "
lib/Target/AMDGPU/AMDGPUISelDAGToDAG.cpp 501 LLVM_DEBUG(dbgs() << "After PreProcess:\n";
lib/Target/AMDGPU/AMDGPUInline.cpp 169 LLVM_DEBUG(dbgs() << " Wrapper only call detected: "
lib/Target/AMDGPU/AMDGPUInstructionSelector.cpp 193 LLVM_DEBUG(dbgs() << "PHI operand has no type, not a gvreg?\n");
199 LLVM_DEBUG(dbgs() << "illegal scc phi\n");
205 LLVM_DEBUG(dbgs() << "PHI operand has unexpected size/bank\n");
1202 LLVM_DEBUG(dbgs() << "Failed to constrain G_TRUNC\n");
lib/Target/AMDGPU/AMDGPULegalizerInfo.cpp 1847 LLVM_DEBUG(dbgs() << "Required arg register missing\n");
lib/Target/AMDGPU/AMDGPULibCalls.cpp 778 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> " << *nval << "\n");
788 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> " << *nval << "\n");
809 LLVM_DEBUG(dbgs() << "AMDIC: " << *CI << " ---> ");
813 LLVM_DEBUG(dbgs() << *CI << '\n');
831 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> " << *nval << "\n");
909 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> 1\n");
919 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> " << *opr0 << "\n");
925 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> " << *opr0 << " * " << *opr0
933 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> 1 / " << *opr0 << "\n");
951 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> "
1008 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> "
1147 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> "
1165 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> " << *opr0 << "\n");
1173 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> sqrt(" << *opr0 << ")\n");
1182 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> cbrt(" << *opr0 << ")\n");
1188 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> 1.0 / " << *opr0 << "\n");
1198 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> rsqrt(" << *opr0
1218 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> " << *opr2 << "\n");
1224 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> " << *opr1 << " + " << *opr2
1232 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> " << *opr0 << " + " << *opr2
1241 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> " << *opr0 << " * "
1270 LLVM_DEBUG(errs() << "AMDIC: " << *CI << " ---> "
1361 LLVM_DEBUG(errs() << "AMDIC: fold_sincos (" << *CI << ", " << *UI << ") with "
1396 LLVM_DEBUG(errs() << "AMDIC: fold_wavefrontsize (" << *CI << ") with "
1749 LLVM_DEBUG(dbgs() << "AMDIC: process function ";
1766 LLVM_DEBUG(dbgs() << "AMDIC: try folding " << *CI << "\n";
lib/Target/AMDGPU/AMDGPUMachineCFGStructurizer.cpp 661 LLVM_DEBUG(dbgs() << "Visiting " << printMBBReference(*MBB) << "\n");
698 LLVM_DEBUG(dbgs() << "Considering Register: " << printReg(Reg, TRI)
703 LLVM_DEBUG(dbgs() << "Add LiveOut (PHI): " << printReg(Reg, TRI) << "\n");
709 LLVM_DEBUG(dbgs() << "Add LiveOut (MBB " << printMBBReference(*MBB)
721 LLVM_DEBUG(dbgs() << "Add LiveOut (Loop): " << printReg(Reg, TRI)
738 LLVM_DEBUG(dbgs() << "Considering Register: " << printReg(Reg, TRI)
742 LLVM_DEBUG(dbgs() << "Add LiveOut (Region " << (void *)Region
754 LLVM_DEBUG(dbgs() << "-Store Live Outs Begin (" << printMBBReference(*MBB)
779 LLVM_DEBUG(dbgs()
790 LLVM_DEBUG(dbgs() << "-Store Live Outs Endn-\n");
850 LLVM_DEBUG(dbgs() << "Add Region LiveOut (" << (void *)Region
915 LLVM_DEBUG(
925 LLVM_DEBUG(dbgs() << "Region before register replace\n");
926 LLVM_DEBUG(Current->print(dbgs(), MRI->getTargetRegisterInfo()));
928 LLVM_DEBUG(dbgs() << "Region after register replace\n");
929 LLVM_DEBUG(Current->print(dbgs(), MRI->getTargetRegisterInfo()));
953 LLVM_DEBUG(dbgs() << "Trying to substitute physical register: "
958 LLVM_DEBUG(dbgs() << "Replacing register (region): "
1031 LLVM_DEBUG(this->getEntry()->getParent()->dump());
1032 LLVM_DEBUG(dbgs() << printReg(Reg, TRI) << "\n");
1036 LLVM_DEBUG(dbgs() << "Register "
1040 LLVM_DEBUG(dbgs() << "Register "
1050 LLVM_DEBUG(dbgs() << "Removing kill flag on register: "
1424 LLVM_DEBUG(dbgs() << "Extractking killed phi:\n");
1425 LLVM_DEBUG(Instr.dump());
1457 LLVM_DEBUG(dbgs() << "Shrink PHI: ");
1458 LLVM_DEBUG(PHI.dump());
1459 LLVM_DEBUG(dbgs() << " to " << printReg(getPHIDestReg(PHI), TRI)
1490 LLVM_DEBUG(dbgs() << printReg(CombinedSourceReg, TRI) << ", "
1502 LLVM_DEBUG(dbgs() << printReg(SourceReg, TRI) << ", "
1505 LLVM_DEBUG(dbgs() << ")\n");
1514 LLVM_DEBUG(dbgs() << "Replace PHI: ");
1515 LLVM_DEBUG(PHI.dump());
1516 LLVM_DEBUG(dbgs() << " with " << printReg(getPHIDestReg(PHI), TRI)
1534 LLVM_DEBUG(dbgs() << printReg(CombinedSourceReg, TRI) << ", "
1544 LLVM_DEBUG(dbgs() << printReg(SourceReg, TRI) << ", "
1547 LLVM_DEBUG(dbgs() << ")\n");
1557 LLVM_DEBUG(dbgs() << "Replace entry PHI: ");
1558 LLVM_DEBUG(PHI.dump());
1559 LLVM_DEBUG(dbgs() << " with ");
1572 LLVM_DEBUG(dbgs() << " register " << printReg(CombinedSourceReg, TRI)
1576 LLVM_DEBUG(dbgs() << printReg(getPHIDestReg(PHI), TRI) << " = PHI(");
1583 LLVM_DEBUG(dbgs() << printReg(CombinedSourceReg, TRI) << ", "
1594 LLVM_DEBUG(dbgs() << printReg(SourceReg, TRI) << ", "
1597 LLVM_DEBUG(dbgs() << ")\n");
1619 LLVM_DEBUG(dbgs() << "Register " << printReg(Reg, TRI) << " is "
1695 LLVM_DEBUG(dbgs() << "Inserting unconditional branch: " << MBB->getNumber()
1745 LLVM_DEBUG(dbgs() << "Created exit block: " << LastMerge->getNumber()
1762 LLVM_DEBUG(dbgs() << "Merge PHI (" << printMBBReference(*MergeBB)
1825 LLVM_DEBUG(dbgs() << "Removing edge: " << printMBBReference(*Edge.first)
1859 LLVM_DEBUG(dbgs() << "Created If block: " << IfBB->getNumber() << "\n");
1864 LLVM_DEBUG(dbgs() << "Moved " << printMBBReference(*CodeBBStart)
1950 LLVM_DEBUG(dbgs() << "Register "
1954 LLVM_DEBUG(dbgs() << "Register "
1957 LLVM_DEBUG(dbgs() << "DEFS BEGIN:\n");
1959 LLVM_DEBUG(DI->getParent()->dump());
1961 LLVM_DEBUG(dbgs() << "DEFS END\n");
2003 LLVM_DEBUG(dbgs() << "Insert Chained PHI\n");
2039 LLVM_DEBUG(dbgs() << "LiveOut: " << printReg(LI, TRI));
2045 LLVM_DEBUG(dbgs() << "- through");
2048 LLVM_DEBUG(dbgs() << "\n");
2065 LLVM_DEBUG(dbgs() << "Initializer for reg: " << printReg(Reg) << "\n");
2070 LLVM_DEBUG(dbgs() << "Insert Non-Chained Live out PHI\n");
2080 LLVM_DEBUG(dbgs() << "Inserting PHI Live Out from "
2087 LLVM_DEBUG(dbgs() << "Insertion done.\n");
2090 LLVM_DEBUG(PHIInfo.dump(MRI));
2094 LLVM_DEBUG(dbgs() << "Before PHI Prune\n");
2095 LLVM_DEBUG(PHIInfo.dump(MRI));
2135 LLVM_DEBUG(dbgs() << "After PHI Prune\n");
2136 LLVM_DEBUG(PHIInfo.dump(MRI));
2144 LLVM_DEBUG(dbgs() << "RegionExit: " << Exit->getNumber() << " Pred: "
2162 LLVM_DEBUG(dbgs() << "Entry PHI " << printReg(DestReg, TRI) << " = PHI(");
2186 LLVM_DEBUG(dbgs()
2197 LLVM_DEBUG(dbgs() << printReg(SourceReg, TRI) << ", "
2206 LLVM_DEBUG(dbgs() << printReg(CurrentBackedgeReg, TRI) << ", "
2209 LLVM_DEBUG(dbgs() << ")\n");
2215 LLVM_DEBUG(PHIInfo.dump(MRI));
2236 LLVM_DEBUG(dbgs() << "Trying to substitute physical register: "
2244 LLVM_DEBUG(dbgs() << "Replacing register: "
2256 LLVM_DEBUG(PHIInfo.dump(MRI));
2260 LLVM_DEBUG(dbgs() << "Resolve PHI Infos\n");
2261 LLVM_DEBUG(PHIInfo.dump(MRI));
2265 LLVM_DEBUG(dbgs() << "DestReg: " << printReg(DestReg, TRI) << "\n");
2268 LLVM_DEBUG(dbgs() << "DestReg: " << printReg(DestReg, TRI)
2343 LLVM_DEBUG(dbgs() << "RegionExitReg: ");
2344 LLVM_DEBUG(Cond[0].print(dbgs(), TRI));
2345 LLVM_DEBUG(dbgs() << "\n");
2355 LLVM_DEBUG(dbgs() << "Insert BB Select PHI (BB)\n");
2360 LLVM_DEBUG(InnerRegion.print(dbgs(), TRI));
2401 LLVM_DEBUG(dbgs() << "RegionExitReg: ");
2402 LLVM_DEBUG(Cond[0].print(dbgs(), TRI));
2403 LLVM_DEBUG(dbgs() << "\n");
2410 LLVM_DEBUG(dbgs() << "Insert BB Select PHI (region)\n");
2456 LLVM_DEBUG(dbgs() << "Split Entry PHI " << printReg(NewDestReg, TRI)
2460 LLVM_DEBUG(dbgs() << printReg(PHISource, TRI) << ", "
2464 LLVM_DEBUG(dbgs() << " ," << printReg(RegionSourceReg, TRI) << ", "
2498 LLVM_DEBUG(dbgs() << "Created new exit block: " << NewExit->getNumber()
2547 LLVM_DEBUG(dbgs() << "Split " << printMBBReference(*Entry) << " to "
2640 LLVM_DEBUG(PHIInfo.dump(MRI));
2643 LLVM_DEBUG(dbgs() << "===========If Region Start===============\n");
2645 LLVM_DEBUG(dbgs() << "Has Backedge: Yes\n");
2647 LLVM_DEBUG(dbgs() << "Has Backedge: No\n");
2653 LLVM_DEBUG(dbgs() << "CurrentRegion: \n");
2654 LLVM_DEBUG(LRegion->print(dbgs(), TRI));
2668 LLVM_DEBUG(dbgs() << "Linearizing region: ");
2669 LLVM_DEBUG(InnerLRegion->print(dbgs(), TRI));
2670 LLVM_DEBUG(dbgs() << "\n");
2688 LLVM_DEBUG(dbgs() << "BBSelectRegIn: " << printReg(BBSelectRegIn, TRI)
2690 LLVM_DEBUG(dbgs() << "BBSelectRegOut: " << printReg(BBSelectRegOut, TRI)
2700 LLVM_DEBUG(dbgs() << "Linearizing block: " << MBB->getNumber() << "\n");
2712 LLVM_DEBUG(dbgs() << "BBSelectRegIn: " << printReg(BBSelectRegIn, TRI)
2714 LLVM_DEBUG(dbgs() << "BBSelectRegOut: " << printReg(BBSelectRegOut, TRI)
2726 LLVM_DEBUG(PHIInfo.dump(MRI));
2747 LLVM_DEBUG(dbgs() << "Loop BBSelect Merge PHI:\n");
2759 LLVM_DEBUG(Region->getEntry()->getParent()->dump());
2760 LLVM_DEBUG(LRegion->print(dbgs(), TRI));
2761 LLVM_DEBUG(PHIInfo.dump(MRI));
2763 LLVM_DEBUG(dbgs() << "===========If Region End===============\n");
2803 LLVM_DEBUG(dbgs() << "Fallthrough Map:\n");
2807 LLVM_DEBUG(dbgs() << "Fallthrough: " << MBBI.getNumber() << " -> "
2819 LLVM_DEBUG(dbgs() << "Add LiveOut (BBSelect): " << printReg(SelectOut, TRI)
2882 LLVM_DEBUG(dbgs() << "----STRUCTURIZER START----\n");
2883 LLVM_DEBUG(MF.dump());
2886 LLVM_DEBUG(Regions->dump());
2891 LLVM_DEBUG(RTree->dump(TRI));
2894 LLVM_DEBUG(dbgs() << "----STRUCTURIZER END----\n");
lib/Target/AMDGPU/AMDGPUOpenCLEnqueuedBlockLowering.cpp 117 LLVM_DEBUG(dbgs() << "found enqueued kernel: " << F.getName() << '\n');
127 LLVM_DEBUG(dbgs() << "runtime handle created: " << *GV << '\n');
148 LLVM_DEBUG(dbgs() << "mark enqueue_kernel caller:" << F->getName() << '\n');
lib/Target/AMDGPU/AMDGPUPerfHintAnalysis.cpp 145 LLVM_DEBUG(dbgs() << "[isIndirectAccess] " << *Inst << '\n');
158 LLVM_DEBUG(dbgs() << " check: " << *V << '\n');
163 LLVM_DEBUG(dbgs() << " is IA\n");
199 LLVM_DEBUG(dbgs() << " dropped\n");
202 LLVM_DEBUG(dbgs() << " is not IA\n");
209 LLVM_DEBUG(dbgs() << "[AMDGPUPerfHint] process " << F.getName() << '\n');
270 LLVM_DEBUG(dbgs() << F.getName() << " MemInst: " << Info->MemInstCount
277 LLVM_DEBUG(dbgs() << F.getName() << " is memory bound\n");
283 LLVM_DEBUG(dbgs() << F.getName() << " needs limit wave\n");
317 LLVM_DEBUG(dbgs() << "[isLargeStride] " << *Inst << '\n');
332 LLVM_DEBUG(dbgs() << "[isLargeStride] MO: " << *MO << '\n');
360 LLVM_DEBUG(dbgs() << "[isLargeStride compare]\n"
lib/Target/AMDGPU/AMDGPUPrintfRuntimeBinding.cpp 262 LLVM_DEBUG(dbgs() << "Printf string original size = " << SizeStr
278 LLVM_DEBUG(dbgs() << "Printf ArgSize (in buffer) = " << ArgSize
283 LLVM_DEBUG(dbgs() << "Printf format string in source = " << Str.str()
333 LLVM_DEBUG(dbgs() << "Printf metadata = " << Sizes.str() << '\n');
543 LLVM_DEBUG(dbgs() << "inserting store to printf buffer:\n"
550 LLVM_DEBUG(dbgs() << "inserting gep to the printf buffer:\n"
lib/Target/AMDGPU/AMDGPUPromoteAlloca.cpp 361 LLVM_DEBUG(dbgs() << " Promotion alloca to vector is disabled\n");
368 LLVM_DEBUG(dbgs() << "Alloca candidate for vectorization\n");
378 LLVM_DEBUG(dbgs() << " Cannot convert type to vector\n");
399 LLVM_DEBUG(dbgs() << " Cannot compute vector index for GEP " << *GEP
417 LLVM_DEBUG(dbgs() << " Converting alloca to vector " << *AllocaTy << " -> "
513 LLVM_DEBUG(
636 LLVM_DEBUG(dbgs() << "Function has local memory argument. Promoting to "
706 LLVM_DEBUG(dbgs() << F.getName() << " uses " << CurrentLocalMemUsage
728 LLVM_DEBUG(dbgs() << "Trying to promote " << I << '\n');
747 LLVM_DEBUG(
777 LLVM_DEBUG(dbgs() << " " << AllocSize
787 LLVM_DEBUG(dbgs() << " Do not know how to convert all uses\n");
791 LLVM_DEBUG(dbgs() << "Promoting alloca to local memory\n");
lib/Target/AMDGPU/AMDGPUPropagateAttributes.cpp 267 LLVM_DEBUG(dbgs() << "Cloning " << F.getName() << '\n');
292 LLVM_DEBUG(dbgs() << "Set features "
lib/Target/AMDGPU/AMDGPURewriteOutArguments.cpp 251 LLVM_DEBUG(dbgs() << "Found possible out argument " << Arg
312 LLVM_DEBUG(dbgs() << "Found out argument store: " << *SI << '\n');
330 LLVM_DEBUG(dbgs()
361 LLVM_DEBUG(dbgs() << "Computed new return type: " << *NewRetTy << '\n');
lib/Target/AMDGPU/AMDGPUSubtarget.cpp 821 LLVM_DEBUG(dbgs() << "Inserting edge from\n" ; DAG->dumpNode(*From);
868 LLVM_DEBUG(dbgs() << "Found MFMA: "; DAG->dumpNode(SU);
lib/Target/AMDGPU/AMDGPUTargetTransformInfo.cpp 127 LLVM_DEBUG(dbgs() << "Set unroll threshold " << UP.Threshold
206 LLVM_DEBUG(dbgs() << "Set unroll threshold " << Threshold
lib/Target/AMDGPU/AMDILCFGStructurizer.cpp 156 LLVM_DEBUG(MF.dump(););
161 LLVM_DEBUG(dbgs() << "LoopInfo:\n"; PrintLoopinfo(*MLI););
163 LLVM_DEBUG(MDT->print(dbgs(), (const Module *)nullptr););
165 LLVM_DEBUG(PDT->print(dbgs()););
168 LLVM_DEBUG(MF.dump(););
648 LLVM_DEBUG(dbgs() << "BB" << MBB->getNumber()
711 LLVM_DEBUG(dbgs() << "AMDGPUCFGStructurizer::prepare\n";);
754 LLVM_DEBUG(dbgs() << "AMDGPUCFGStructurizer::run\n");
761 LLVM_DEBUG(dbgs() << "Ordered blocks:\n"; printOrderedBlocks(););
771 LLVM_DEBUG(dbgs() << "numIter = " << NumIter
794 LLVM_DEBUG(dbgs() << "start processing SCC" << getSCCNum(SccBeginMBB);
810 LLVM_DEBUG(dbgs() << "Can't reduce SCC " << getSCCNum(MBB)
818 LLVM_DEBUG(dbgs() << "repeat processing SCC" << getSCCNum(MBB)
837 LLVM_DEBUG(dbgs() << "Reduce to one block\n";);
847 LLVM_DEBUG(dbgs() << "No progress\n";);
860 LLVM_DEBUG(dbgs() << "Erase BB" << ((*It).first)->getNumber() << "\n";);
869 LLVM_DEBUG(FuncRep->viewCFG());
903 LLVM_DEBUG(dbgs() << "Begin patternMatch BB" << MBB->getNumber() << "\n";);
908 LLVM_DEBUG(dbgs() << "End patternMatch BB" << MBB->getNumber()
1029 LLVM_DEBUG(dbgs() << "Processing:\n"; ExaminedLoop->dump(););
1043 LLVM_DEBUG(dbgs() << "Loop has " << ExitingMBBs.size()
1086 LLVM_DEBUG(dbgs() << "isLoopContBreakBlock yes src1 = BB"
1100 LLVM_DEBUG(dbgs() << "handleJumpintoIf swap trueBlk and FalseBlk"
1115 LLVM_DEBUG(dbgs() << "handleJumpintoIfImp head = BB" << HeadMBB->getNumber()
1121 LLVM_DEBUG(dbgs() << "check down = BB" << DownBlk->getNumber(););
1124 LLVM_DEBUG(dbgs() << " working\n";);
1137 LLVM_DEBUG(dbgs() << " not working\n";);
1216 LLVM_DEBUG(
1353 LLVM_DEBUG(
1365 LLVM_DEBUG(dbgs() << "serialPattern BB" << DstMBB->getNumber() << " <= BB"
1381 LLVM_DEBUG(dbgs() << "ifPattern BB" << MBB->getNumber(); dbgs() << "{ ";
1435 LLVM_DEBUG(dbgs() << "loopPattern header = BB" << DstBlk->getNumber()
1445 LLVM_DEBUG(dbgs() << "loopbreakPattern exiting = BB"
1466 LLVM_DEBUG(dbgs() << "settleLoopcontBlock conting = BB"
1542 LLVM_DEBUG(dbgs() << "Cloned block: "
1557 LLVM_DEBUG(dbgs() << "migrateInstruction don't see branch instr\n";);
1560 LLVM_DEBUG(dbgs() << "migrateInstruction see branch instr: " << *BranchMI);
1563 LLVM_DEBUG(dbgs() << "migrateInstruction before splice dstSize = "
1570 LLVM_DEBUG(dbgs() << "migrateInstruction after splice dstSize = "
1590 LLVM_DEBUG(dbgs() << "Old branch instr: " << *BranchMI << "\n";);
1603 LLVM_DEBUG(dbgs() << "Removing uncond branch instr: " << *BranchMI);
1619 LLVM_DEBUG(dbgs() << "Removing unneeded cond branch instr: " << *BranchMI);
1638 LLVM_DEBUG(dbgs() << "Add dummyExitBlock to BB" << MBB->getNumber()
1658 LLVM_DEBUG(dbgs() << "Retiring BB" << MBB->getNumber() << "\n";);
lib/Target/AMDGPU/GCNDPPCombine.cpp 163 LLVM_DEBUG(dbgs() << " failed: no DPP opcode\n");
186 LLVM_DEBUG(dbgs() << " failed: no old operand in DPP instruction,"
207 LLVM_DEBUG(dbgs() << " failed: src0 is illegal\n");
229 LLVM_DEBUG(dbgs() << " failed: src1 is illegal\n");
240 LLVM_DEBUG(dbgs() << " failed: src2 is illegal\n");
257 LLVM_DEBUG(dbgs() << " combined: " << *DPPInst.getInstr());
322 LLVM_DEBUG(dbgs() << " failed: no src1 or it isn't a register\n");
326 LLVM_DEBUG(dbgs() << " failed: old immediate isn't an identity\n");
331 LLVM_DEBUG(dbgs() << " failed: src1 isn't a VGPR32 register\n");
352 LLVM_DEBUG(dbgs() << "\nDPP combine: " << MovMI);
358 LLVM_DEBUG(dbgs() << " failed: dpp move writes physreg\n");
362 LLVM_DEBUG(dbgs() << " failed: EXEC mask should remain the same"
383 LLVM_DEBUG(dbgs() << " failed: dpp move reads physreg\n");
400 LLVM_DEBUG(dbgs() << " failed: the DPP mov isn't combinable\n");
405 LLVM_DEBUG(dbgs() <<
417 LLVM_DEBUG(dbgs() <<
423 LLVM_DEBUG(dbgs() << " old=";
455 LLVM_DEBUG(dbgs() << " try: " << OrigMI);
463 LLVM_DEBUG(dbgs() << " failed: EXEC mask should remain the same"
489 LLVM_DEBUG(dbgs() << " failed: VOP3 hasn't e32 equivalent\n");
498 LLVM_DEBUG(dbgs() << " failed: VOP3 has non-default modifiers\n");
502 LLVM_DEBUG(dbgs() << " failed: not VOP1/2/3\n");
506 LLVM_DEBUG(dbgs() << " combining: " << OrigMI);
519 LLVM_DEBUG(dbgs() << " commuted: " << *NewMI);
526 LLVM_DEBUG(dbgs() << " failed: cannot be commuted\n");
529 LLVM_DEBUG(dbgs() << " failed: no suitable operands\n");
lib/Target/AMDGPU/GCNILPSched.cpp 152 LLVM_DEBUG(dbgs() << " Comparing latency of SU (" << left->NodeNum
172 LLVM_DEBUG(dbgs() << "Depth of SU(" << left->NodeNum << "): "
327 LLVM_DEBUG(dbgs() << "\n=== Picking candidate\n"
338 LLVM_DEBUG(dbgs() << "Selected "; DAG.dumpNode(*SU));
lib/Target/AMDGPU/GCNIterativeScheduler.cpp 203 LLVM_DEBUG(dbgs() << "\nScheduling ";
314 LLVM_DEBUG(printLivenessInfo(dbgs(), RegionBegin, RegionEnd, LIS);
454 LLVM_DEBUG(dbgs() << "Trying to improve occupancy, target = " << TargetOcc
462 LLVM_DEBUG(printRegion(dbgs(), R->Begin, R->End, LIS, 3);
468 LLVM_DEBUG(dbgs() << "Occupancy improvement attempt:\n";
477 LLVM_DEBUG(dbgs() << "New occupancy = " << NewOcc
504 LLVM_DEBUG(dbgs() << "Scheduling using default scheduler, "
519 LLVM_DEBUG(printSchedRP(dbgs(), R->MaxPressure, RP));
522 LLVM_DEBUG(dbgs() << "Didn't fit into target occupancy O" << TgtOcc);
525 LLVM_DEBUG(dbgs() << ", scheduling minimal register\n");
528 LLVM_DEBUG(dbgs() << ", restoring\n");
557 LLVM_DEBUG(if (R->MaxPressure.less(ST, RP, TgtOcc)) {
566 LLVM_DEBUG(printSchedResult(dbgs(), R, RP));
588 LLVM_DEBUG(dbgs() << "Scheduling using default scheduler, "
598 LLVM_DEBUG(printSchedRP(dbgs(), R->MaxPressure, RP));
601 LLVM_DEBUG(dbgs() << "Didn't fit into target occupancy O" << TgtOcc);
604 LLVM_DEBUG(dbgs() << ", scheduling minimal register\n");
609 LLVM_DEBUG(printSchedResult(dbgs(), R, RP));
lib/Target/AMDGPU/GCNMinRegStrategy.cpp 144 LLVM_DEBUG(dbgs() << "\nSelecting max priority candidates among " << Num
149 LLVM_DEBUG(dbgs() << "\nSelecting min non-ready producing candidate among "
154 LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ") would left non-ready "
160 LLVM_DEBUG(dbgs() << "\nSelecting most producing candidate among " << Num
165 LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ") would make ready " << Res
172 LLVM_DEBUG(
207 LLVM_DEBUG(dbgs() << "Make the predecessors of SU(" << SchedSU->NodeNum
214 LLVM_DEBUG(dbgs() << " SU(" << C.SU->NodeNum << ')');
217 LLVM_DEBUG(dbgs() << '\n');
248 LLVM_DEBUG(dbgs() << "\n=== Picking candidate, Step = " << StepNo
260 LLVM_DEBUG(dbgs() << "Selected "; DAG.dumpNode(*SU));
lib/Target/AMDGPU/GCNNSAReassign.cpp 295 LLVM_DEBUG(dbgs() << "Attempting to reassign NSA: " << *MI
303 LLVM_DEBUG(dbgs() << "\tCannot reallocate.\n");
316 LLVM_DEBUG(dbgs() << "\tNSA conversion conflict with " << *I->first);
334 LLVM_DEBUG(dbgs() << "\tNew allocation:\t\t ["
lib/Target/AMDGPU/GCNRegBankReassign.cpp 516 LLVM_DEBUG(if (FreeBanks) {
527 LLVM_DEBUG(MI.dump());
532 LLVM_DEBUG(dbgs() << "Stall cycles = " << StallCycles << '\n');
548 LLVM_DEBUG(dbgs() << "Conflicting operands: " << printReg(Reg1, SubReg1) <<
554 LLVM_DEBUG(dbgs() << "Stall weight = " << Weight << '\n');
610 LLVM_DEBUG(dbgs() << "Trying register " << printReg(Reg) << '\n');
624 LLVM_DEBUG(dbgs() << "Try reassign " << printReg(C.Reg) << " in "; C.MI->dump();
632 LLVM_DEBUG(dbgs() << "--- Stall cycles in range = " << OrigStalls << '\n');
646 LLVM_DEBUG(dbgs() << "Trying bank " << printBank(Bank) << '\n');
649 LLVM_DEBUG(dbgs() << "With bank " << printBank(Bank) << " -> "
663 LLVM_DEBUG(dbgs() << "No free registers in bank " << printBank(BS.Bank)
667 LLVM_DEBUG(dbgs() << "Found free register " << printReg(Reg)
673 LLVM_DEBUG(dbgs() << "--- Cycles saved: " << OrigStalls - BS.Stalls << '\n');
688 LLVM_DEBUG(if (Collect) {
706 LLVM_DEBUG(if (Collect) { dbgs() << '\n'; });
722 LLVM_DEBUG(dbgs() << "=== After the pass " << StallCycles
751 LLVM_DEBUG(dbgs() << "=== RegBanks reassign analysis on function " << MF.getName()
757 LLVM_DEBUG(dbgs() << "=== " << StallCycles << " stall cycles detected in "
762 LLVM_DEBUG(dbgs() << "\nCandidates:\n\n";
781 LLVM_DEBUG(dbgs() << "\nCandidates:\n\n";
789 LLVM_DEBUG(dbgs() << "=== After the pass " << CyclesSaved
lib/Target/AMDGPU/GCNSchedStrategy.cpp 163 LLVM_DEBUG(traceCandidate(Cand));
191 LLVM_DEBUG(dbgs() << "Picking from Bot:\n");
198 LLVM_DEBUG(traceCandidate(BotCand));
211 LLVM_DEBUG(dbgs() << "Picking from Top:\n");
218 LLVM_DEBUG(traceCandidate(TopCand));
231 LLVM_DEBUG(dbgs() << "Top Cand: "; traceCandidate(TopCand);
261 LLVM_DEBUG(dbgs() << "Picking: "; traceCandidate(Cand););
307 LLVM_DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") "
320 LLVM_DEBUG(dbgs() << "Starting occupancy is " << StartingOccupancy << ".\n");
340 LLVM_DEBUG(dbgs() << "Pressure before scheduling:\nRegion live-ins:";
358 LLVM_DEBUG(dbgs() << "Pressure after scheduling: ";
364 LLVM_DEBUG(dbgs() << "Pressure in desired limits, done.\n");
370 LLVM_DEBUG(dbgs() << "Occupancy before scheduling: " << WavesBefore
380 LLVM_DEBUG(dbgs() << "Function is memory bound, allow occupancy drop up to "
387 LLVM_DEBUG(dbgs() << "Occupancy lowered for the function to "
396 LLVM_DEBUG(dbgs() << "Attempting to revert scheduling.\n");
426 LLVM_DEBUG(dbgs() << "Scheduling " << *MI);
522 LLVM_DEBUG(dbgs() << "All regions recorded, starting actual scheduling.\n");
544 LLVM_DEBUG(
573 LLVM_DEBUG(dbgs() << "********** MI Scheduling **********\n");
574 LLVM_DEBUG(dbgs() << MF.getName() << ":" << printMBBReference(*MBB) << " "
lib/Target/AMDGPU/R600ClauseMergePass.cpp 124 LLVM_DEBUG(dbgs() << "Excess inst counts\n");
142 LLVM_DEBUG(dbgs() << "Wrong KC0\n");
158 LLVM_DEBUG(dbgs() << "Wrong KC0\n");
lib/Target/AMDGPU/R600ControlFlowFinalizer.cpp 534 LLVM_DEBUG(dbgs() << CfCount << ":"; I->dump(););
552 LLVM_DEBUG(dbgs()
566 LLVM_DEBUG(dbgs() << CfCount << ":"; MI->dump(););
601 LLVM_DEBUG(dbgs() << CfCount << ":"; MIb->dump(););
614 LLVM_DEBUG(dbgs() << CfCount << ":"; MIb->dump(););
630 LLVM_DEBUG(dbgs() << CfCount << ":"; MIb->dump(););
677 LLVM_DEBUG(dbgs() << CfCount << ":"; MI->dump(););
lib/Target/AMDGPU/R600MachineScheduler.cpp 81 LLVM_DEBUG(dbgs() << NeededWF << " approx. Wavefronts Required\n");
127 LLVM_DEBUG(if (SU) {
144 LLVM_DEBUG(dbgs() << "Instruction Type Switch\n");
173 LLVM_DEBUG(dbgs() << CurEmitted << " Instructions Emitted in this clause\n");
190 LLVM_DEBUG(dbgs() << "Top Releasing "; DAG->dumpNode(*SU));
194 LLVM_DEBUG(dbgs() << "Bottom Releasing "; DAG->dumpNode(*SU));
346 LLVM_DEBUG(dbgs() << "New Slot\n");
lib/Target/AMDGPU/R600OptimizeVectorRegisters.cpp 226 LLVM_DEBUG(dbgs() << " ->"; Tmp->dump(););
232 LLVM_DEBUG(dbgs() << " ->"; NewMI->dump(););
234 LLVM_DEBUG(dbgs() << " Updating Swizzle:\n");
237 LLVM_DEBUG(dbgs() << " "; (*It).dump(); dbgs() << " ->");
239 LLVM_DEBUG((*It).dump());
370 LLVM_DEBUG({
377 LLVM_DEBUG(dbgs() << "Using common slots...\n";);
385 LLVM_DEBUG(dbgs() << "Using free slots...\n";);
lib/Target/AMDGPU/R600Packetizer.cpp 239 LLVM_DEBUG({
252 LLVM_DEBUG({
269 LLVM_DEBUG({
lib/Target/AMDGPU/SIAnnotateControlFlow.cpp 204 LLVM_DEBUG(dbgs() << "Erased unused condition phi\n");
lib/Target/AMDGPU/SIFixSGPRCopies.cpp 496 LLVM_DEBUG(dbgs()
506 LLVM_DEBUG(dbgs()
524 LLVM_DEBUG(dbgs()
670 LLVM_DEBUG(dbgs() << "Fixing REG_SEQUENCE: " << MI);
682 LLVM_DEBUG(dbgs() << " Fixing INSERT_SUBREG: " << MI);
805 LLVM_DEBUG(dbgs() << "Moving PHI to AGPR: " << MI);
834 LLVM_DEBUG(dbgs() << "Fixing PHI: " << MI);
838 LLVM_DEBUG(dbgs() << "Legalizing PHI: " << MI);
lib/Target/AMDGPU/SIFixVGPRCopies.cpp 61 LLVM_DEBUG(dbgs() << "Add exec use to " << MI);
lib/Target/AMDGPU/SIFixupVectorISel.cpp 173 LLVM_DEBUG(dbgs() << "Global Mem opp " << MI << '\n');
214 LLVM_DEBUG(dbgs() << "New Global Mem " << *NewGlob << '\n');
lib/Target/AMDGPU/SIFoldOperands.cpp 245 LLVM_DEBUG(dbgs() << "Not shrinking " << MI << " due to vcc liveness\n");
324 LLVM_DEBUG(dbgs() << "Append " << (Commuted ? "commuted" : "normal")
672 LLVM_DEBUG(dbgs() << "Folding " << OpToFold
757 LLVM_DEBUG(dbgs() << "Folded " << *UseMI << '\n');
1093 LLVM_DEBUG(dbgs() << "Folded " << *MI << " into ");
1105 LLVM_DEBUG(dbgs() << *MI << '\n');
1146 LLVM_DEBUG(dbgs() << "Constant folded " << *UseMI << '\n');
1227 LLVM_DEBUG(dbgs() << "Folded source from " << MI << " into OpNo "
1310 LLVM_DEBUG(dbgs() << "Folding clamp " << *DefClamp << " into " << *Def
1434 LLVM_DEBUG(dbgs() << "Folding omod " << MI << " into " << *Def << '\n');
lib/Target/AMDGPU/SIFrameLowering.cpp 1032 LLVM_DEBUG(
1050 LLVM_DEBUG(
1055 LLVM_DEBUG(dbgs() << "Saving FP with copy to " <<
lib/Target/AMDGPU/SIInsertWaitcnts.cpp 507 LLVM_DEBUG({
1141 LLVM_DEBUG(dbgs() << "updateWaitcntInBlock\n"
1158 LLVM_DEBUG(dbgs() << "insertWaitcntInBlock\n"
1174 LLVM_DEBUG(dbgs() << "insertWaitcntInBlock\n"
1366 LLVM_DEBUG({
1419 LLVM_DEBUG({
lib/Target/AMDGPU/SILoadStoreOptimizer.cpp 950 LLVM_DEBUG(dbgs() << "Inserted read2: " << *Read2 << '\n');
1033 LLVM_DEBUG(dbgs() << "Inserted write2 inst: " << *Write2 << '\n');
1366 LLVM_DEBUG(dbgs() << " "; Mov->dump());
1385 LLVM_DEBUG(dbgs() << " Re-Computed Anchor-Base:\n");
1403 LLVM_DEBUG(dbgs() << " "; LoHalf->dump(););
1413 LLVM_DEBUG(dbgs() << " "; HiHalf->dump(););
1423 LLVM_DEBUG(dbgs() << " "; FullBase->dump(); dbgs() << "\n";);
1533 LLVM_DEBUG(dbgs() << "\nTryToPromoteConstantOffsetToImmFor "; MI.dump());
1536 LLVM_DEBUG(dbgs() << " Const-offset is already promoted.\n";);
1550 LLVM_DEBUG(dbgs() << " Failed to extract constant-offset or there are no"
1555 LLVM_DEBUG(dbgs() << " BASE: {" << MAddr.Base.HiReg << ", "
1634 LLVM_DEBUG(dbgs() << " Anchor-Inst(with max-distance from Offset): ";
1636 LLVM_DEBUG(dbgs() << " Anchor-Offset from BASE: "
1643 LLVM_DEBUG(dbgs() << " After promotion: "; MI.dump(););
1651 LLVM_DEBUG(dbgs() << " Promote Offset(" << P.second;
1654 LLVM_DEBUG(dbgs() << " After promotion: "; P.first->dump());
1845 LLVM_DEBUG(dbgs() << "Running SILoadStoreOptimizer\n");
lib/Target/AMDGPU/SILowerI1Copies.cpp 518 LLVM_DEBUG(dbgs() << "Lower copy from i1: " << MI);
567 LLVM_DEBUG(dbgs() << "Lower PHI: " << *MI);
689 LLVM_DEBUG(dbgs() << "Lower Other: " << MI);
lib/Target/AMDGPU/SIMachineScheduler.cpp 1208 LLVM_DEBUG(dbgs() << "Coloring the graph\n");
1265 LLVM_DEBUG(dbgs() << "Blocks created:\n\n";
1289 LLVM_DEBUG(dbgs() << "Topological Sort\n");
1336 LLVM_DEBUG(dbgs() << "\nScheduling Blocks\n\n");
1340 LLVM_DEBUG(dbgs() << "First phase: Fast scheduling for Reg Liveness\n");
1394 LLVM_DEBUG(dbgs() << "Restoring MI Pos\n");
1408 LLVM_DEBUG(for (unsigned i = 0, e = CurrentBlocks.size(); i != e; ++i) {
1562 LLVM_DEBUG(dbgs() << "Block Order:"; for (SIScheduleBlock *Block
1628 LLVM_DEBUG(dbgs() << "Picking New Blocks\n"; dbgs() << "Available: ";
1670 LLVM_DEBUG(dbgs() << "Best Current Choice: " << Cand.Block->getID() << ' '
1675 LLVM_DEBUG(dbgs() << "Picking: " << Cand.Block->getID() << '\n';
1932 LLVM_DEBUG(dbgs() << "Preparing Scheduling\n");
1935 LLVM_DEBUG(dump());
2037 LLVM_DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") "
2045 LLVM_DEBUG({
lib/Target/AMDGPU/SIOptimizeExecMasking.cpp 307 LLVM_DEBUG(dbgs() << "Fold exec copy: " << *PrepareExecInst);
311 LLVM_DEBUG(dbgs() << "into: " << *PrepareExecInst << '\n');
321 LLVM_DEBUG(dbgs() << "Exec copy source register is live out\n");
333 LLVM_DEBUG(dbgs() << "exec read prevents saveexec: " << *J << '\n');
344 LLVM_DEBUG(dbgs() << "Multiple instructions modify "
356 LLVM_DEBUG(dbgs() << "Found save exec op: " << *SaveExecInst << '\n');
359 LLVM_DEBUG(dbgs()
372 LLVM_DEBUG(dbgs() << "Found second use of save inst candidate: " << *J
386 LLVM_DEBUG(dbgs() << "Insert save exec op: " << *SaveExecInst << '\n');
lib/Target/AMDGPU/SIOptimizeExecMaskingPreRA.cpp 253 LLVM_DEBUG(dbgs() << "Folding sequence:\n\t" << *Sel << '\t' << *Cmp << '\t'
266 LLVM_DEBUG(dbgs() << "=>\n\t" << *Andn2 << '\n');
276 LLVM_DEBUG(dbgs() << "Erasing: " << *Cmp << '\n');
283 LLVM_DEBUG(dbgs() << "Erasing: " << *Sel << '\n');
353 LLVM_DEBUG(dbgs()
393 LLVM_DEBUG(dbgs() << "Redundant EXEC = S_OR_B64 found: " << *Lead << '\n');
424 LLVM_DEBUG(dbgs() << "Redundant EXEC COPY: " << *SaveExec << '\n');
lib/Target/AMDGPU/SIPeepholeSDWA.cpp 855 LLVM_DEBUG(dbgs() << "Match: " << MI << "To: " << *Operand << '\n');
992 LLVM_DEBUG(dbgs() << "Convert instruction:" << MI);
1143 LLVM_DEBUG(dbgs() << *SDWAInst << "\nOperand: " << *Operand);
1164 LLVM_DEBUG(dbgs() << "\nInto:" << *SDWAInst << '\n');
lib/Target/AMDGPU/SIPreAllocateWWMRegs.cpp 164 LLVM_DEBUG(dbgs() << "SIPreAllocateWWMRegs: function " << MF.getName() << "\n");
195 LLVM_DEBUG(dbgs() << "entering WWM region: " << MI << "\n");
201 LLVM_DEBUG(dbgs() << "exiting WWM region: " << MI << "\n");
208 LLVM_DEBUG(dbgs() << "processing " << MI << "\n");
lib/Target/AMDGPU/SIShrinkInstructions.cpp 522 LLVM_DEBUG(dbgs() << "Matched v_swap_b32:\n" << MovT << *MovX << MovY);
783 LLVM_DEBUG(dbgs() << "Shrinking " << MI);
794 LLVM_DEBUG(dbgs() << "e32 MI = " << *Inst32 << '\n');
lib/Target/AMDGPU/SIWholeQuadMode.cpp 703 LLVM_DEBUG(dbgs() << "\nProcessing block " << printMBBReference(MBB)
925 LLVM_DEBUG(printInfo());
lib/Target/ARC/ARCBranchFinalize.cpp 114 LLVM_DEBUG(dbgs() << "Replacing pseudo branch with BRcc\n");
130 LLVM_DEBUG(dbgs() << "Branch: " << *MI << "\n");
131 LLVM_DEBUG(dbgs() << "Replacing pseudo branch with Cmp + Bcc\n");
143 LLVM_DEBUG(dbgs() << "Running ARC Branch Finalize on " << MF.getName()
158 LLVM_DEBUG(dbgs() << "Unknown (or size 0) size for: " << MI << "\n");
174 LLVM_DEBUG(dbgs() << "Estimated function size for " << MF.getName() << ": "
lib/Target/ARC/ARCFrameLowering.cpp 61 LLVM_DEBUG(dbgs() << "Internal: adjust stack by: " << Amount << ","
92 LLVM_DEBUG(dbgs() << "Determine Callee Saves: " << MF.getName() << "\n");
118 LLVM_DEBUG(dbgs() << "Emit Prologue: " << MF.getName() << "\n");
136 LLVM_DEBUG(dbgs() << "Varargs\n");
148 LLVM_DEBUG(dbgs() << "Saving FP\n");
157 LLVM_DEBUG(dbgs() << "Creating store funclet.\n");
173 LLVM_DEBUG(dbgs() << "Creating save blink.\n");
180 LLVM_DEBUG(dbgs() << "Adjusting stack by: "
186 LLVM_DEBUG(dbgs() << "Setting FP from SP.\n");
242 LLVM_DEBUG(dbgs() << "Emit Epilogue: " << MF.getName() << "\n");
323 LLVM_DEBUG(dbgs() << "Varargs\n");
358 LLVM_DEBUG(dbgs() << "Creating fixed object (" << StackObj << ") for FP at "
366 LLVM_DEBUG(dbgs() << "Creating fixed object (" << StackObj
390 LLVM_DEBUG(dbgs() << "Creating fixed object (" << I.getFrameIdx()
394 LLVM_DEBUG(dbgs() << "Updating fixed object (" << I.getFrameIdx()
406 LLVM_DEBUG(dbgs() << "Spill callee saved registers: "
423 LLVM_DEBUG(dbgs() << "Restore callee saved registers: "
438 LLVM_DEBUG(dbgs() << "Process function before frame finalized: "
441 LLVM_DEBUG(dbgs() << "Current stack size: " << MFI.getStackSize() << "\n");
447 LLVM_DEBUG(dbgs() << "Created scavenging index RegScavFI=" << RegScavFI
472 LLVM_DEBUG(dbgs() << "EmitCallFramePseudo: " << MF.getName() << "\n");
lib/Target/ARC/ARCISelLowering.cpp 488 LLVM_DEBUG(errs() << "LowerFormalArguments Unhandled argument type: "
lib/Target/ARC/ARCInstrInfo.cpp 313 LLVM_DEBUG(dbgs() << "Created store reg=" << printReg(SrcReg, TRI)
340 LLVM_DEBUG(dbgs() << "Created load reg=" << printReg(DestReg, TRI)
lib/Target/ARC/ARCOptAddrMode.cpp 192 LLVM_DEBUG(dbgs() << "[ABAW] tryToCombine " << Ldst);
194 LLVM_DEBUG(dbgs() << "[ABAW] Not a recognized load/store\n");
203 LLVM_DEBUG(dbgs() << "[ABAW] Offset is not immediate\n");
209 LLVM_DEBUG(dbgs() << "[ABAW] Base is not VReg\n");
215 LLVM_DEBUG(dbgs() << "[ABAW] Non-zero offset\n");
235 LLVM_DEBUG(MachineInstr *First = &Ldst; MachineInstr *Last = &Add;
275 LLVM_DEBUG(dbgs() << "canJoinInstructions: " << *First << *Last);
280 LLVM_DEBUG(
297 LLVM_DEBUG(dbgs() << "[canJoinInstructions] Store uses result of Add\n");
324 LLVM_DEBUG(dbgs() << "[canJoinInstructions] Can sink Add down to Ldst\n");
327 LLVM_DEBUG(dbgs() << "[canJoinInstructions] Can hoist Ldst to Add\n");
334 LLVM_DEBUG(dbgs() << "[canJoinInstructions] Can hoist Add to Ldst\n");
355 LLVM_DEBUG(dbgs() << "Instruction cannot handle displacement " << -NewOffset
464 LLVM_DEBUG(dbgs() << "[ABAW] New Ldst: " << Ldst);
lib/Target/ARC/ARCRegisterInfo.cpp 68 LLVM_DEBUG(dbgs() << "Scavenged register " << printReg(BaseReg, TRI)
92 LLVM_DEBUG(dbgs() << "Building LDFI\n");
105 LLVM_DEBUG(dbgs() << "Building STFI\n");
113 LLVM_DEBUG(dbgs() << "Building GETFI\n");
181 LLVM_DEBUG(dbgs() << "\nFunction : " << MF.getName() << "\n");
182 LLVM_DEBUG(dbgs() << "<--------->\n");
183 LLVM_DEBUG(dbgs() << MI << "\n");
184 LLVM_DEBUG(dbgs() << "FrameIndex : " << FrameIndex << "\n");
185 LLVM_DEBUG(dbgs() << "ObjSize : " << ObjSize << "\n");
186 LLVM_DEBUG(dbgs() << "FrameOffset : " << Offset << "\n");
187 LLVM_DEBUG(dbgs() << "StackSize : " << StackSize << "\n");
188 LLVM_DEBUG(dbgs() << "LocalFrameSize : " << LocalFrameSize << "\n");
206 LLVM_DEBUG(dbgs() << "Offset : " << Offset << "\n"
lib/Target/ARC/Disassembler/ARCDisassembler.cpp 125 LLVM_DEBUG(dbgs() << "Not a GPR32 register.");
225 LLVM_DEBUG(dbgs() << "Decoding StLImm found non-limm register.");
240 LLVM_DEBUG(dbgs() << "Decoding LdLImm:\n");
243 LLVM_DEBUG(dbgs() << "Decoding LdLImm found non-limm register.");
258 LLVM_DEBUG(dbgs() << "Decoding LdRLimm\n");
264 LLVM_DEBUG(dbgs() << "Decoding LdRLimm found non-limm register.");
274 LLVM_DEBUG(dbgs() << "Decoding MOV_S h-register\n");
325 LLVM_DEBUG(dbgs() << "Successfully decoded 64-bit instruction.");
328 LLVM_DEBUG(dbgs() << "Not a 64-bit instruction, falling back to 32-bit.");
345 LLVM_DEBUG(
349 LLVM_DEBUG(
lib/Target/ARC/MCTargetDesc/ARCInstPrinter.cpp 32 LLVM_DEBUG(dbgs() << "Unknown condition code passed: " << cc << "\n");
lib/Target/ARM/A15SDOptimizer.cpp 182 LLVM_DEBUG(dbgs() << "Deleting base instruction " << *MI << "\n");
234 LLVM_DEBUG(dbgs() << "Deleting instruction " << *Def << "\n");
266 LLVM_DEBUG(dbgs() << "Found a subreg copy: " << *SPRMI);
274 LLVM_DEBUG(dbgs() << "Subreg copy is compatible - returning ");
275 LLVM_DEBUG(dbgs() << printReg(FullReg) << "\n");
389 LLVM_DEBUG(dbgs() << "Found partial copy" << *MI << "\n");
644 LLVM_DEBUG(dbgs() << "Replacing operand " << **I << " with "
670 LLVM_DEBUG(dbgs() << "Running on function " << Fn.getName() << "\n");
lib/Target/ARM/ARMBaseInstrInfo.cpp 1614 LLVM_DEBUG(dbgs() << "widening: " << MI);
1643 LLVM_DEBUG(dbgs() << "replaced by: " << MI);
lib/Target/ARM/ARMBaseRegisterInfo.cpp 875 LLVM_DEBUG(dbgs() << "\tARM::shouldCoalesce - Coalesced Weight: "
877 LLVM_DEBUG(dbgs() << "\tARM::shouldCoalesce - Reg Weight: "
lib/Target/ARM/ARMBasicBlockInfo.cpp 48 LLVM_DEBUG(dbgs() << "computeBlockSize: " << MBB->getName() << "\n");
100 LLVM_DEBUG(dbgs() << "Branch of destination " << printMBBReference(*DestBB)
122 LLVM_DEBUG(dbgs() << "Adjust block:\n"
lib/Target/ARM/ARMCodeGenPrepare.cpp 388 LLVM_DEBUG(dbgs() << "ARM CGP: Allowing safe overflow for " << *I << "\n");
450 LLVM_DEBUG(dbgs() << "ARM CGP: Replacing " << *From << " with " << *To
471 LLVM_DEBUG(dbgs() << "ARM CGP: Prepare underflowing adds.\n");
482 LLVM_DEBUG(dbgs() << "ARM CGP: Adjusting " << *I << "\n");
497 LLVM_DEBUG(dbgs() << "ARM CGP: New equivalent: " << *NewVal << "\n");
508 LLVM_DEBUG(dbgs() << "ARM CGP: Inserting ZExt for " << *V << "\n");
526 LLVM_DEBUG(dbgs() << "ARM CGP: Promoting sources:\n");
528 LLVM_DEBUG(dbgs() << " - " << *V << "\n");
542 LLVM_DEBUG(dbgs() << "ARM CGP: Mutating the tree..\n");
590 LLVM_DEBUG(dbgs() << "ARM CGP: Inserting DSP intrinsic for "
604 LLVM_DEBUG(dbgs() << "ARM CGP: Fixing up the sinks:\n");
615 LLVM_DEBUG(dbgs() << "ARM CGP: Creating " << *TruncTy << " Trunc for "
627 LLVM_DEBUG(dbgs() << "ARM CGP: For Sink: " << *I << "\n");
664 LLVM_DEBUG(dbgs() << "ARM CGP: Cleanup..\n");
677 LLVM_DEBUG(dbgs() << "ARM CGP: Removing unnecessary cast: " << *ZExt
696 LLVM_DEBUG(dbgs() << "ARM CGP: Removing " << *I << "\n");
710 LLVM_DEBUG(dbgs() << "ARM CGP: Converting truncs..\n");
740 LLVM_DEBUG(dbgs() << "ARM CGP: Promoting use-def chains to from "
797 LLVM_DEBUG(dbgs() << "ARM CGP: Mutation complete\n");
888 LLVM_DEBUG(dbgs() << "ARM CGP: Will use an intrinsic for: " << *I << "\n");
904 LLVM_DEBUG(dbgs() << "ARM CGP: TryToPromote: " << *V << ", TypeSize = "
926 LLVM_DEBUG(dbgs() << "ARM CGP: Can't handle: " << *V << "\n");
982 LLVM_DEBUG(dbgs() << "ARM CGP: Visited nodes:\n";
1019 LLVM_DEBUG(dbgs() << "ARM CGP: Running on " << F.getName() << "\n");
1035 LLVM_DEBUG(dbgs() << "ARM CGP: Searching from: " << CI << "\n");
1043 LLVM_DEBUG(if (verifyFunction(F, &dbgs())) {
1049 LLVM_DEBUG(dbgs() << "After ARMCodeGenPrepare: " << F << "\n");
lib/Target/ARM/ARMConstantIslandPass.cpp 311 LLVM_DEBUG(dbgs() << "Verifying " << CPUsers.size() << " CP users.\n");
319 LLVM_DEBUG(dbgs() << "OK\n");
322 LLVM_DEBUG(dbgs() << "Out of range.\n");
324 LLVM_DEBUG(MF->dump());
334 LLVM_DEBUG({
351 LLVM_DEBUG(dbgs() << "***** ARMConstantIslands: "
402 LLVM_DEBUG(dumpBBs());
416 LLVM_DEBUG(dbgs() << "Beginning CP iteration #" << NoCPIters << '\n');
425 LLVM_DEBUG(dumpBBs());
431 LLVM_DEBUG(dbgs() << "Beginning BR iteration #" << NoBRIters << '\n');
437 LLVM_DEBUG(dumpBBs());
473 LLVM_DEBUG(dbgs() << '\n'; dumpBBs());
544 LLVM_DEBUG(dbgs() << "Moved CPI#" << i << " to end of function, size = "
547 LLVM_DEBUG(BB->dump());
1067 LLVM_DEBUG({
1139 LLVM_DEBUG(dbgs() << "In range\n");
1155 LLVM_DEBUG(dbgs() << "Replacing CPE#" << CPI << " with CPE#"
1242 LLVM_DEBUG(dbgs() << "Found water after " << printMBBReference(*WaterBB)
1287 LLVM_DEBUG(dbgs() << "Split at end of " << printMBBReference(*UserMBB)
1331 LLVM_DEBUG(dbgs() << format("Split in middle of big block before %#x",
1339 LLVM_DEBUG(dbgs() << format(", adjusted to %#x", BaseInsertOffset)
1376 LLVM_DEBUG(dbgs() << format("Move inside block: %#x\n", BaseInsertOffset));
1472 LLVM_DEBUG(dbgs() << "Found water in range\n");
1485 LLVM_DEBUG(dbgs() << "No water found\n");
1548 LLVM_DEBUG(
1639 LLVM_DEBUG(dbgs() << " Changed B to long jump " << *MI);
1683 LLVM_DEBUG(
1711 LLVM_DEBUG(dbgs() << " Insert B to " << printMBBReference(*DestBB)
1806 LLVM_DEBUG(dbgs() << "Shrink: " << *U.MI);
1844 LLVM_DEBUG(dbgs() << "Shrink branch: " << *Br.MI);
1971 LLVM_DEBUG(dbgs() << "Fold: " << *Cmp.MI << " and: " << *Br.MI);
2151 LLVM_DEBUG(dbgs() << "Removing Dead Add: " << *RemovableAdd);
2288 LLVM_DEBUG(dbgs() << "Shrink JT: " << *MI);
2302 LLVM_DEBUG(dbgs() << printMBBReference(*MBB) << ": " << *NewJTMI);
lib/Target/ARM/ARMExpandPseudoInsts.cpp 472 LLVM_DEBUG(dbgs() << "Expanding: "; MI.dump());
575 LLVM_DEBUG(dbgs() << "To: "; MIB.getInstr()->dump(););
583 LLVM_DEBUG(dbgs() << "Expanding: "; MI.dump());
651 LLVM_DEBUG(dbgs() << "To: "; MIB.getInstr()->dump(););
659 LLVM_DEBUG(dbgs() << "Expanding: "; MI.dump());
750 LLVM_DEBUG(dbgs() << "Expanding: "; MI.dump());
780 LLVM_DEBUG(dbgs() << "To: "; MIB.getInstr()->dump(););
838 LLVM_DEBUG(dbgs() << "Expanding: "; MI.dump());
920 LLVM_DEBUG(dbgs() << "To: "; LO16.getInstr()->dump(););
921 LLVM_DEBUG(dbgs() << "And: "; HI16.getInstr()->dump(););
1976 LLVM_DEBUG(dbgs() << "********** ARM EXPAND PSEUDO INSTRUCTIONS **********\n"
1985 LLVM_DEBUG(dbgs() << "***************************************************\n");
lib/Target/ARM/ARMFrameLowering.cpp 1867 LLVM_DEBUG(dbgs() << "EstimatedLimit: " << EstimatedRSStackSizeLimit
1927 LLVM_DEBUG(dbgs()
1936 LLVM_DEBUG(dbgs() << AFI->getReturnRegsCount()
1941 LLVM_DEBUG(dbgs() << "RegDeficit = " << RegDeficit << "\n");
1948 LLVM_DEBUG(dbgs() << printReg(Reg, TRI)
1953 LLVM_DEBUG(
1964 LLVM_DEBUG(dbgs() << "%r7 is saved low register, RegDeficit = "
1968 LLVM_DEBUG(
1978 LLVM_DEBUG(dbgs() << printReg(Reg, TRI)
1992 LLVM_DEBUG(dbgs() << "%lr is saved register, RegDeficit = "
1996 LLVM_DEBUG(dbgs() << "%lr is not saved, adding to AvailableRegs\n");
2005 LLVM_DEBUG(dbgs() << "Final RegDeficit = " << RegDeficit << "\n");
2008 LLVM_DEBUG(dbgs() << "Spilling " << printReg(Reg, TRI)
2020 LLVM_DEBUG(dbgs() << "After adding spills, RegDeficit = " << RegDeficit
2047 LLVM_DEBUG(dbgs() << "NumGPRSpills = " << NumGPRSpills << "\n");
2060 LLVM_DEBUG(dbgs() << "Spilling " << printReg(Reg, TRI)
2071 LLVM_DEBUG(dbgs() << "Spilling " << printReg(Reg, TRI)
2117 LLVM_DEBUG(dbgs() << "Reserving emergency spill slot\n");
lib/Target/ARM/ARMISelLowering.cpp 7480 LLVM_DEBUG(for (auto Src
9149 LLVM_DEBUG(dbgs() << "Lowering node: "; Op.dump());
11734 LLVM_DEBUG(dbgs() << "Simplify shl use:\n"; SHL.getOperand(0).dump();
11736 LLVM_DEBUG(dbgs() << "Into:\n"; X.dump(); BinOp.dump(); Res.dump());
17069 LLVM_DEBUG(dbgs() << "isHA: " << IsHA << " "; Ty->dump());
lib/Target/ARM/ARMInstructionSelector.cpp 223 LLVM_DEBUG(dbgs() << "Failed to constrain " << TII.getName(I.getOpcode())
513 LLVM_DEBUG(dbgs() << "Unexpected size for register");
518 LLVM_DEBUG(dbgs() << "Unexpected register bank for register");
611 LLVM_DEBUG(dbgs() << "ROPI and RWPI only supported for ELF\n");
617 LLVM_DEBUG(dbgs() << "TLS variables not supported yet\n");
759 LLVM_DEBUG(dbgs() << "Object format not supported yet\n");
905 LLVM_DEBUG(dbgs() << "Unsupported source size for extension");
946 LLVM_DEBUG(
952 LLVM_DEBUG(dbgs() << "G_TRUNC/G_ANYEXT on non-GPR not supported yet\n");
962 LLVM_DEBUG(dbgs() << "Unsupported constant type\n");
969 LLVM_DEBUG(dbgs() << "Unsupported pointer constant value\n");
976 LLVM_DEBUG(dbgs() << "Unsupported pointer constant value\n");
1016 LLVM_DEBUG(
1023 LLVM_DEBUG(
1045 LLVM_DEBUG(dbgs() << "Subtarget only supports single precision");
1049 LLVM_DEBUG(dbgs() << "Unsupported size for G_FCMP operand");
1080 LLVM_DEBUG(dbgs() << "Atomic load/store not supported yet\n");
1135 LLVM_DEBUG(dbgs() << "Unsupported condition register for G_BRCOND");
lib/Target/ARM/ARMLoadStoreOptimizer.cpp 2340 LLVM_DEBUG(dbgs() << "Formed " << *MIB << "\n");
2354 LLVM_DEBUG(dbgs() << "Formed " << *MIB << "\n");
lib/Target/ARM/ARMLowOverheadLoops.cpp 95 LLVM_DEBUG(dbgs() << "ARM Loops on " << MF->getName() << " ------------- \n");
208 LLVM_DEBUG(dbgs() << "ARM Loops: Failed to find suitable insertion point for"
221 LLVM_DEBUG(dbgs() << "ARM Loops: Processing " << *ML);
248 LLVM_DEBUG(dbgs() << "ARM Loops: Failed to find loop preheader!\n"
254 LLVM_DEBUG(dbgs() << " - Found multiple out-of-loop preds.\n");
279 LLVM_DEBUG(dbgs() << "ARM Loops: Found call.\n");
296 LLVM_DEBUG(dbgs() << "ARM Loops: Found LR Use/Def: " << MI);
307 LLVM_DEBUG(if (Start) dbgs() << "ARM Loops: Found Loop Start: " << *Start;
312 LLVM_DEBUG(dbgs() << "ARM Loops: Not a low-overhead loop.\n");
315 LLVM_DEBUG(dbgs() << "ARM Loops: Failed to find all loop components.\n");
325 LLVM_DEBUG(dbgs() << "ARM Loops: LoopEnd is not targetting header.\n");
333 LLVM_DEBUG(dbgs() << "ARM Loops: LE offset is out-of-range\n");
340 LLVM_DEBUG(dbgs() << "ARM Loops: WLS offset is out-of-range!\n");
346 LLVM_DEBUG(dbgs() << "ARM Loops: Unable to find safe insertion point.\n");
349 LLVM_DEBUG(dbgs() << "ARM Loops: Start insertion point: " << *InsertPt);
360 LLVM_DEBUG(dbgs() << "ARM Loops: Reverting to cmp: " << *MI);
382 LLVM_DEBUG(dbgs() << "ARM Loops: Reverting to sub: " << *MI);
415 LLVM_DEBUG(dbgs() << "ARM Loops: Reverting to cmp, br: " << *MI);
462 LLVM_DEBUG(dbgs() << "ARM Loops: Inserted start: " << *MIB);
475 LLVM_DEBUG(dbgs() << "ARM Loops: Inserted LE: " << *MIB);
493 LLVM_DEBUG(dbgs() << "ARM Loops: Removing branch: " << *Terminator);
515 LLVM_DEBUG(dbgs() << "ARM Loops: Reverting any remaining pseudos...\n");
lib/Target/ARM/ARMParallelDSP.cpp 143 LLVM_DEBUG(dbgs() << "Pairing:\n"
184 LLVM_DEBUG(dbgs() << "Reduction:\n";
186 LLVM_DEBUG(dbgs() << *Add << "\n");
188 LLVM_DEBUG(dbgs() << *Mul->Root << "\n"
191 LLVM_DEBUG(if (Acc) dbgs() << "Acc in: " << *Acc << "\n")
275 LLVM_DEBUG(dbgs() << "Unaligned memory access not supported: not "
281 LLVM_DEBUG(dbgs() << "DSP extension not enabled: not running pass "
287 LLVM_DEBUG(dbgs() << "Only supporting little endian: not running pass "
292 LLVM_DEBUG(dbgs() << "\n== Parallel DSP pass ==\n");
293 LLVM_DEBUG(dbgs() << " - " << F.getName() << "\n\n");
317 LLVM_DEBUG(dbgs() << "Loads are sequential and valid:\n";
425 LLVM_DEBUG(if (!LoadPairs.empty()) {
428 LLVM_DEBUG(dbgs() << *MapIt.first << ", "
537 LLVM_DEBUG(dbgs() << "After search, Reduction:\n"; R.dump());
575 LLVM_DEBUG(dbgs() << "OK: found two pairs of parallel loads!\n");
579 LLVM_DEBUG(dbgs() << "OK: found two pairs of parallel loads!\n");
580 LLVM_DEBUG(dbgs() << " exchanging Ld2 and Ld3\n");
586 LLVM_DEBUG(dbgs() << "OK: found two pairs of parallel loads!\n");
587 LLVM_DEBUG(dbgs() << " exchanging Ld0 and Ld1\n");
588 LLVM_DEBUG(dbgs() << " and swapping muls\n");
677 LLVM_DEBUG(dbgs() << "Accumulating unpaired mul: " << *Mul << "\n");
795 LLVM_DEBUG(dbgs() << "From Base and Offset:\n"
lib/Target/ARM/ARMTargetTransformInfo.cpp 1021 LLVM_DEBUG(dbgs() << "Loop has:\n"
1059 LLVM_DEBUG(dbgs() << "Cost of loop: " << Cost << "\n");
lib/Target/ARM/AsmParser/ARMAsmParser.cpp10423 LLVM_DEBUG(dbgs() << "Parsed as: ";
10445 LLVM_DEBUG(dbgs() << "Changed to: ";
11596 LLVM_DEBUG(
lib/Target/ARM/MLxExpansionPass.cpp 309 LLVM_DEBUG({
lib/Target/ARM/MVETailPredication.cpp 126 LLVM_DEBUG(dbgs() << "TP: Not a v8.1m.main+mve target.\n");
174 LLVM_DEBUG(dbgs() << "TP: Running on Loop: " << *L
446 LLVM_DEBUG(dbgs() << "TP: Found predicated vector loop.\n");
468 LLVM_DEBUG(dbgs() << "TP: Not tail predicate: " << *Predicate << "\n");
472 LLVM_DEBUG(dbgs() << "TP: Found tail predicate: " << *Predicate << "\n");
502 LLVM_DEBUG(dbgs() << "TP: Insert processed elements phi: "
lib/Target/ARM/MVEVPTBlockPass.cpp 193 LLVM_DEBUG(dbgs() << "VPT block created for: "; MI->dump());
206 LLVM_DEBUG(dbgs() << " adding : "; MBIter->dump());
235 LLVM_DEBUG(dbgs() << " folding VCMP into VPST: "; VCMP->dump());
265 LLVM_DEBUG(dbgs() << "********** ARM MVE VPT BLOCKS **********\n"
272 LLVM_DEBUG(dbgs() << "**************************************\n");
lib/Target/ARM/Thumb2SizeReduction.cpp 613 LLVM_DEBUG(errs() << "Converted 32-bit: " << *MI
661 LLVM_DEBUG(errs() << "Converted 32-bit: " << *MI
841 LLVM_DEBUG(errs() << "Converted 32-bit: " << *MI
964 LLVM_DEBUG(errs() << "Converted 32-bit: " << *MI
lib/Target/AVR/AVRISelDAGToDAG.cpp 519 LLVM_DEBUG(errs() << "== "; N->dump(CurDAG); errs() << "\n");
lib/Target/AVR/AsmParser/AVRAsmParser.cpp 504 LLVM_DEBUG(dbgs() << "parseOperand\n");
550 LLVM_DEBUG(dbgs() << "parseMemriOperand()\n");
lib/Target/BPF/BPFAbstractMemberAccess.cpp 179 LLVM_DEBUG(dbgs() << "********** Abstract Member Accesses **********\n");
lib/Target/BPF/BPFISelDAGToDAG.cpp 184 LLVM_DEBUG(dbgs() << "== "; Node->dump(CurDAG); dbgs() << '\n');
271 LLVM_DEBUG(dbgs() << "Check candidate load: "; LD->dump(); dbgs() << '\n');
281 LLVM_DEBUG(dbgs() << "Check candidate load: "; LD->dump(); dbgs() << '\n');
304 LLVM_DEBUG(dbgs() << "Replacing load of size " << size << " with constant "
400 LLVM_DEBUG(dbgs() << "Byte array at offset " << Offset << " with value "
489 LLVM_DEBUG(dbgs() << "Remove the redundant AND operation in: ";
lib/Target/BPF/BPFMIChecking.cpp 62 LLVM_DEBUG(dbgs() << "*** BPF PreEmit checking pass ***\n\n");
164 LLVM_DEBUG(MI.dump());
lib/Target/BPF/BPFMIPeephole.cpp 75 LLVM_DEBUG(dbgs() << "*** BPF MachineSSA ZEXT Elim peephole pass ***\n\n");
82 LLVM_DEBUG(dbgs() << " Def of Mov Src:");
83 LLVM_DEBUG(DefInsn->dump());
114 LLVM_DEBUG(dbgs() << " One ZExt elim sequence identified.\n");
142 LLVM_DEBUG(dbgs() << "Starting SRL found:");
143 LLVM_DEBUG(MI.dump());
151 LLVM_DEBUG(dbgs() << " SLL found:");
152 LLVM_DEBUG(SllMI->dump());
160 LLVM_DEBUG(dbgs() << " Type cast Mov found:");
161 LLVM_DEBUG(MovMI->dump());
165 LLVM_DEBUG(dbgs()
233 LLVM_DEBUG(dbgs() << "*** BPF PreEmit peephole pass ***\n\n");
244 LLVM_DEBUG(dbgs() << " Redundant Mov Eliminated:");
245 LLVM_DEBUG(ToErase->dump());
344 LLVM_DEBUG(dbgs() << "*** BPF MachineSSA TRUNC Elim peephole pass ***\n\n");
lib/Target/BPF/BPFMISimplifyPatchable.cpp 71 LLVM_DEBUG(dbgs() << "*** BPF simplify patchable insts pass ***\n\n");
lib/Target/Hexagon/AsmParser/HexagonAsmParser.cpp 465 LLVM_DEBUG(dbgs() << "Bundle:");
466 LLVM_DEBUG(MCB.dump_pretty(dbgs()));
467 LLVM_DEBUG(dbgs() << "--\n");
560 LLVM_DEBUG(dbgs() << "Insn:");
561 LLVM_DEBUG(MCI.dump_pretty(dbgs()));
562 LLVM_DEBUG(dbgs() << "\n\n");
1262 LLVM_DEBUG(dbgs() << "Unmatched Operand:");
1263 LLVM_DEBUG(Op->dump());
1264 LLVM_DEBUG(dbgs() << "\n");
lib/Target/Hexagon/HexagonBitSimplify.cpp 2458 LLVM_DEBUG({
2774 LLVM_DEBUG(BT.trace(true));
3105 LLVM_DEBUG(dbgs() << "Processing loop in " << printMBBReference(*C.LB)
3130 LLVM_DEBUG({
3251 LLVM_DEBUG({
3319 LLVM_DEBUG(BT.trace(true));
lib/Target/Hexagon/HexagonBlockRanges.cpp 424 LLVM_DEBUG(dbgs() << __func__ << ": index map\n" << IndexMap << '\n');
426 LLVM_DEBUG(dbgs() << __func__ << ": live map\n"
488 LLVM_DEBUG(dbgs() << __func__ << ": dead map\n"
lib/Target/Hexagon/HexagonBranchRelaxation.cpp 92 LLVM_DEBUG(dbgs() << "****** Hexagon Branch Relaxation ******\n");
201 LLVM_DEBUG(dbgs() << "Long distance jump. isExtendable("
208 LLVM_DEBUG(dbgs() << "\tUnderimplemented relax branch instruction.\n");
lib/Target/Hexagon/HexagonCommonGEP.cpp 345 LLVM_DEBUG(dbgs() << "Visiting GEP: " << *GepI << '\n');
429 LLVM_DEBUG(dbgs() << "Gep nodes after initial collection:\n" << Nodes);
578 LLVM_DEBUG({
645 LLVM_DEBUG(dbgs() << "Gep nodes after commoning:\n" << Nodes);
665 LLVM_DEBUG(dbgs() << "Gep nodes after post-commoning cleanup:\n" << Nodes);
670 LLVM_DEBUG({
693 LLVM_DEBUG(dbgs() << "computed:" << Dom->getName() << '\n');
756 LLVM_DEBUG(dbgs() << "Loc for node:" << Node << '\n');
823 LLVM_DEBUG(dbgs() << "LocRec begin for node:" << Node << '\n');
833 LLVM_DEBUG(dbgs() << "LocRec end for node:" << Node << '\n');
955 LLVM_DEBUG(dbgs() << "Separating chain for node (" << Node << ") user: " << *R
997 LLVM_DEBUG(dbgs() << "new node: " << NewNode << " " << *NewNode << '\n');
1008 LLVM_DEBUG(dbgs() << "Separating constant chains for node: " << Node << '\n');
1045 LLVM_DEBUG(dbgs() << "Nodes with foldable users:\n" << FNs);
1067 LLVM_DEBUG(dbgs() << "Initial node placement:\n" << LocationAsBlock(Loc));
1073 LLVM_DEBUG(dbgs() << "Node placement after adjustment for invariance:\n"
1080 LLVM_DEBUG(dbgs() << "Node use information:\n" << Uses);
1086 LLVM_DEBUG(dbgs() << "Final node placement:\n" << LocationAsBlock(Loc));
1091 LLVM_DEBUG(dbgs() << "Fabricating GEP in " << LocB->getName()
1130 LLVM_DEBUG(dbgs() << "new GEP: " << *NewInst << '\n');
1163 LLVM_DEBUG(dbgs() << "Nodes before materialization:\n" << Nodes << '\n');
lib/Target/Hexagon/HexagonConstExtenders.cpp 1277 LLVM_DEBUG(dbgs() << " =" << I << ". " << EV << " " << ED << '\n');
1297 LLVM_DEBUG(dbgs() << " " << I << ". " << EV << " " << ED << '\n');
1309 LLVM_DEBUG({
1403 LLVM_DEBUG(dbgs() << "IMap (before fixup) = " << PrintIMap(IMap, *HRI));
1473 LLVM_DEBUG(dbgs() << "IMap (after fixup) = " << PrintIMap(IMap, *HRI));
1576 LLVM_DEBUG(dbgs() << "Inserted def in bb#" << MBB.getNumber()
1840 LLVM_DEBUG(dbgs() << __func__ << " Idx:" << Idx << " ExtR:"
1948 LLVM_DEBUG(dbgs() << getPassName() << ": skipping " << MF.getName()
1952 LLVM_DEBUG(MF.print(dbgs() << "Before " << getPassName() << '\n', nullptr));
1981 LLVM_DEBUG(dbgs() << "Collected " << Extenders.size() << " extenders\n");
1993 LLVM_DEBUG({
lib/Target/Hexagon/HexagonConstPropagation.cpp 622 LLVM_DEBUG(dbgs() << "Visiting FI(" << printMBBReference(*MB) << "): " << PN);
647 LLVM_DEBUG(dbgs() << " edge " << printMBBReference(*PB) << "->"
663 LLVM_DEBUG(dbgs() << " edge from " << printMBBReference(*PB) << ": "
677 LLVM_DEBUG(dbgs() << "Visiting MI(" << printMBBReference(*MI.getParent())
681 LLVM_DEBUG({
734 LLVM_DEBUG(dbgs() << "Visiting " << (EvalOk ? "BR" : "br") << "("
769 LLVM_DEBUG(dbgs() << " failed to evaluate a branch...adding all CFG "
777 LLVM_DEBUG(dbgs() << " pushing edge " << printMBBReference(B) << " -> "
784 LLVM_DEBUG(dbgs() << "Visiting uses of " << printReg(Reg, &MCE.TRI)
876 LLVM_DEBUG(
933 LLVM_DEBUG({
1048 LLVM_DEBUG(MF.print(dbgs() << "Starting MachineConstPropagator\n", nullptr));
1060 LLVM_DEBUG({
2932 LLVM_DEBUG({
3099 LLVM_DEBUG({
3139 LLVM_DEBUG(dbgs() << "Rewrite(" << printMBBReference(B) << "):" << BrI);
lib/Target/Hexagon/HexagonCopyToCombine.cpp 650 LLVM_DEBUG(dbgs() << "Found a CONST64\n");
lib/Target/Hexagon/HexagonEarlyIfConv.cpp 240 LLVM_DEBUG(dbgs() << "Checking flow pattern at " << printMBBReference(*B)
328 LLVM_DEBUG(dbgs() << "One of blocks " << PrintMB(TB) << ", " << PrintMB(FB)
334 LLVM_DEBUG(dbgs() << "Detected " << PrintFP(FP, *TRI) << "\n");
554 LLVM_DEBUG(
583 LLVM_DEBUG(dbgs() << "Total number of extra muxes from converted phis: "
588 LLVM_DEBUG(dbgs() << "Total number of predicate registers: " << PredDefs
630 LLVM_DEBUG(dbgs() << "Conversion is not valid\n");
634 LLVM_DEBUG(dbgs() << "Conversion is not profitable\n");
645 LLVM_DEBUG((L ? dbgs() << "Visiting loop H:" << PrintMB(HB)
762 LLVM_DEBUG(dbgs() << "Predicating block " << PrintMB(FromB) << "\n");
954 LLVM_DEBUG(dbgs() << "Removing block " << PrintMB(B) << "\n");
984 LLVM_DEBUG(dbgs() << "Removing phi nodes from block " << PrintMB(B) << "\n");
1011 LLVM_DEBUG(dbgs() << "Merging blocks " << PrintMB(PredB) << " and "
lib/Target/Hexagon/HexagonExpandCondsets.cpp 656 LLVM_DEBUG(dbgs() << "created an initial copy: " << *MIB);
669 LLVM_DEBUG(dbgs() << "\nsplitting " << printMBBReference(*MI.getParent())
940 LLVM_DEBUG(dbgs() << "\nattempt to predicate if-" << (Cond ? "true" : "false")
962 LLVM_DEBUG(dbgs() << "Source def: " << *DefI);
1047 LLVM_DEBUG(dbgs() << "Can move up: " << (CanUp ? "yes" : "no")
1143 LLVM_DEBUG(dbgs() << "compatible registers: ("
1179 LLVM_DEBUG(dbgs() << "coalesced: " << L1 << "\n");
1260 LLVM_DEBUG(LIS->print(dbgs() << "Before expand-condsets\n",
1288 LLVM_DEBUG(
1305 LLVM_DEBUG(
1314 LLVM_DEBUG(LIS->print(dbgs() << "After predicating\n",
1320 LLVM_DEBUG({
lib/Target/Hexagon/HexagonFrameLowering.cpp 444 LLVM_DEBUG({
467 LLVM_DEBUG({
485 LLVM_DEBUG(dbgs() << "Dom block does not dominate pdom block\n");
489 LLVM_DEBUG(dbgs() << "PDom block does not post-dominate dom block\n");
1429 LLVM_DEBUG(dbgs() << __func__ << " on " << MF.getName() << '\n');
1439 LLVM_DEBUG(dbgs() << "Initial CS registers: {");
1442 LLVM_DEBUG(dbgs() << ' ' << printReg(R, TRI));
1446 LLVM_DEBUG(dbgs() << " }\n");
1447 LLVM_DEBUG(dbgs() << "SRegs.1: "; dump_registers(SRegs, *TRI);
1458 LLVM_DEBUG(dbgs() << "Res: "; dump_registers(Reserved, *TRI);
1460 LLVM_DEBUG(dbgs() << "SRegs.2: "; dump_registers(SRegs, *TRI);
1482 LLVM_DEBUG(dbgs() << "TmpSup: "; dump_registers(TmpSup, *TRI);
1487 LLVM_DEBUG(dbgs() << "SRegs.4: "; dump_registers(SRegs, *TRI);
1501 LLVM_DEBUG(dbgs() << "SRegs.5: "; dump_registers(SRegs, *TRI);
1540 LLVM_DEBUG({
2060 LLVM_DEBUG(dbgs() << "Index map for " << printMBBReference(B) << "\n"
2168 LLVM_DEBUG({
2207 LLVM_DEBUG({
2234 LLVM_DEBUG(dbgs() << printMBBReference(B) << " dead map\n"
2240 LLVM_DEBUG(dbgs() << "Working on fi#" << FI << '\n');
2243 LLVM_DEBUG(dbgs() << "--Examining range:" << RL << '\n');
2258 LLVM_DEBUG(dbgs() << "Replacement reg:" << printReg(FoundR, &HRI)
lib/Target/Hexagon/HexagonGenPredicate.cpp 226 LLVM_DEBUG(dbgs() << __func__ << ": " << printReg(Reg.R, TRI, Reg.S) << "\n");
231 LLVM_DEBUG(dbgs() << "Dead reg: " << printReg(Reg.R, TRI, Reg.S) << '\n');
253 LLVM_DEBUG(dbgs() << __func__ << ": " << PrintRegister(Reg, *TRI));
261 LLVM_DEBUG(dbgs() << " -> " << PrintRegister(PR, *TRI) << '\n');
277 LLVM_DEBUG(dbgs() << " -> !" << PrintRegister(RegisterSubReg(NewPR), *TRI)
368 LLVM_DEBUG(dbgs() << __func__ << ": " << MI << " " << *MI);
430 LLVM_DEBUG(dbgs() << "generated: " << *MIB);
453 LLVM_DEBUG(dbgs() << __func__ << "\n");
lib/Target/Hexagon/HexagonHardwareLoops.cpp 378 LLVM_DEBUG(dbgs() << "********* Hexagon Hardware Loops *********\n");
1013 LLVM_DEBUG(dbgs() << "\nhw_loop head, "
1020 LLVM_DEBUG(dbgs() << "\nCannot convert to hw_loop due to:";
1086 LLVM_DEBUG(dbgs() << "HW looping will remove: " << *MI);
1240 LLVM_DEBUG(dbgs() << "Change to hardware loop at "; L->dump());
1369 LLVM_DEBUG(dbgs() << "\nhw_loop head, "
1770 LLVM_DEBUG(dbgs() << "\n DefMI(" << i
1778 LLVM_DEBUG(dbgs() << "\n DefMI(" << i
lib/Target/Hexagon/HexagonHazardRecognizer.cpp 28 LLVM_DEBUG(dbgs() << "Reset hazard recognizer\n");
45 LLVM_DEBUG(dbgs() << "*** Hazard in cycle " << PacketNum << ", " << *MI);
61 LLVM_DEBUG(dbgs() << "*** Try .new version? " << (RetVal == NoHazard)
69 LLVM_DEBUG(dbgs() << "*** .cur Hazard in cycle " << PacketNum << ", "
78 LLVM_DEBUG(dbgs() << "Advance cycle, clear state\n");
136 LLVM_DEBUG(dbgs() << " Add instruction " << *MI);
lib/Target/Hexagon/HexagonISelDAGToDAG.cpp 1913 LLVM_DEBUG(dbgs() << "--> No need to balance root (Weight=" << Weight
1915 LLVM_DEBUG(N->dump(CurDAG));
1920 LLVM_DEBUG(dbgs() << "** Balancing root node: ");
1921 LLVM_DEBUG(N->dump(CurDAG));
1969 LLVM_DEBUG(dbgs() << "--> Subtree was RAUWd. Restarting...\n");
2040 LLVM_DEBUG(dbgs() << "--> Current height=" << NodeHeights[SDValue(N, 0)]
2048 LLVM_DEBUG(dbgs() << "--> Found common factor for two MUL children!\n");
2082 LLVM_DEBUG(dbgs() << "--> Combining GA and offset ("
2084 LLVM_DEBUG(GANode->dump(CurDAG));
2128 LLVM_DEBUG(dbgs() << "--> Pushing constant to tip of tree.");
2155 LLVM_DEBUG(dbgs() << "--> Subtree was RAUWd. Restarting...\n");
2189 LLVM_DEBUG(dbgs() << "--> Built new node (Weight=" << Weight
2191 LLVM_DEBUG(NewNode.dump());
2215 LLVM_DEBUG(dbgs() << "--> Root is now: ");
2216 LLVM_DEBUG(NewRoot.dump());
2223 LLVM_DEBUG(dbgs() << "--> Root unchanged.\n");
2246 LLVM_DEBUG(dbgs() << "** Rebalancing address calculation in node: ");
2247 LLVM_DEBUG(N->dump(CurDAG));
2287 LLVM_DEBUG(dbgs() << "--> Final node: ");
2288 LLVM_DEBUG(N->dump(CurDAG));
lib/Target/Hexagon/HexagonISelLowering.cpp 364 LLVM_DEBUG(dbgs() << (CLI.IsTailCall ? "Eligible for Tail Call\n"
438 LLVM_DEBUG(dbgs() << "Function needs byte stack align due to call args\n");
677 LLVM_DEBUG({
lib/Target/Hexagon/HexagonInstrInfo.cpp 432 LLVM_DEBUG(dbgs() << "\nErasing the jump to successor block\n";);
501 LLVM_DEBUG(dbgs() << "\nCant analyze " << printMBBReference(MBB)
549 LLVM_DEBUG(dbgs() << "\nCant analyze " << printMBBReference(MBB)
559 LLVM_DEBUG(dbgs() << "\nRemoving branches out of " << printMBBReference(MBB));
631 LLVM_DEBUG(dbgs() << "\nInserting NVJump for "
1564 LLVM_DEBUG(dbgs() << "\nCannot predicate:"; MI.dump(););
2316 LLVM_DEBUG(dbgs() << "V60" << (isLate ? "-LR " : " -- "));
2317 LLVM_DEBUG(LRMI.dump());
2318 LLVM_DEBUG(dbgs() << "V60" << (isEarly ? "-ES " : " -- "));
2319 LLVM_DEBUG(ESMI.dump());
2322 LLVM_DEBUG(dbgs() << "++Is Late Result feeding Early Source\n");
4265 LLVM_DEBUG(dbgs() << "No predregs for new-value jumps/endloop");
4367 LLVM_DEBUG(dbgs() << "\n[invertAndChangeJumpTarget] to "
4397 LLVM_DEBUG(dbgs() << "\n"
4409 LLVM_DEBUG(dbgs() << "\nTrying to reverse pred. sense of:"; MI.dump());
lib/Target/Hexagon/HexagonLoopIdiomRecognition.cpp 1762 LLVM_DEBUG(dbgs() << "Starting PolynomialMultiplyRecognize on loop\n"
1770 LLVM_DEBUG(dbgs() << "Loop header:\n" << *LoopB);
1792 LLVM_DEBUG(dbgs() << "Loop IV: " << *CIV << "\nIterCount: " << IterCount
1820 LLVM_DEBUG(dbgs() << "scanSelect(pre-scan): " << PE(C, SelI) << '\n');
1833 LLVM_DEBUG(dbgs() << "Have not found candidates for pmpy\n");
1873 LLVM_DEBUG(dbgs() << "scanSelect: " << *SelI << '\n');
1880 LLVM_DEBUG({
2291 LLVM_DEBUG(dbgs() << " Formed " << (Overlap ? "memmove: " : "memcpy: ")
lib/Target/Hexagon/HexagonMachineScheduler.cpp 177 LLVM_DEBUG(dbgs() << "Packet[" << TotalPackets << "]:\n");
179 LLVM_DEBUG(dbgs() << "\t[" << i << "] SU(");
180 LLVM_DEBUG(dbgs() << Packet[i]->NodeNum << ")\t");
181 LLVM_DEBUG(Packet[i]->getInstr()->dump());
192 LLVM_DEBUG(dbgs() << "********** MI Converging Scheduling VLIW "
210 LLVM_DEBUG(unsigned maxH = 0;
215 LLVM_DEBUG(unsigned maxD = 0;
220 LLVM_DEBUG(dump());
226 LLVM_DEBUG(
245 LLVM_DEBUG({
384 LLVM_DEBUG(dbgs() << "*** Next cycle " << Available.getName() << " cycle "
409 LLVM_DEBUG(dbgs() << "*** Max instrs at cycle " << CurrCycle << '\n');
413 LLVM_DEBUG(dbgs() << "*** IssueCount " << IssueCount << " at cycle "
587 LLVM_DEBUG(if (verbose) dbgs()
592 LLVM_DEBUG(dbgs() << "H|");
599 LLVM_DEBUG(if (verbose) dbgs() << "LB|");
603 LLVM_DEBUG(if (verbose) {
614 LLVM_DEBUG(if (verbose) dbgs() << "A|");
616 LLVM_DEBUG(if (verbose) dbgs() << " |");
619 LLVM_DEBUG(if (verbose) dbgs() << "LB|");
623 LLVM_DEBUG(if (verbose) {
634 LLVM_DEBUG(if (verbose) dbgs() << "A|");
636 LLVM_DEBUG(if (verbose) dbgs() << " |");
658 LLVM_DEBUG(if (verbose) {
680 LLVM_DEBUG(if (verbose) {
695 LLVM_DEBUG(if (verbose) dbgs() << "C|");
699 LLVM_DEBUG(if (verbose) dbgs() << "C|");
711 LLVM_DEBUG(if (verbose) dbgs() << "Z|");
720 LLVM_DEBUG(if (verbose) dbgs() << "Z|");
736 LLVM_DEBUG(if (verbose) dbgs() << "D|");
744 LLVM_DEBUG(if (verbose) dbgs() << "D|");
750 LLVM_DEBUG(if (verbose) {
768 LLVM_DEBUG(if (SchedDebugVerboseLevel > 1)
787 LLVM_DEBUG(traceCandidate("DCAND", Q, *I, CurrentCost));
800 LLVM_DEBUG(traceCandidate("NCAND", Q, *I, CurrentCost));
811 LLVM_DEBUG(traceCandidate("CCAND", Q, *I, CurrentCost));
824 LLVM_DEBUG(traceCandidate("WCAND", Q, *I, CurrentCost));
843 LLVM_DEBUG(traceCandidate("SPCAND", Q, *I, CurrentCost));
861 LLVM_DEBUG(traceCandidate("TCAND", Q, *I, CurrentCost));
883 LLVM_DEBUG(dbgs() << "Picked only Bottom\n");
888 LLVM_DEBUG(dbgs() << "Picked only Top\n");
906 LLVM_DEBUG(dbgs() << "Prefered Bottom Node\n");
917 LLVM_DEBUG(dbgs() << "Prefered Top Node\n");
924 LLVM_DEBUG(dbgs() << "Prefered Bottom Node SingleMax\n");
929 LLVM_DEBUG(dbgs() << "Prefered Top Node SingleMax\n");
934 LLVM_DEBUG(dbgs() << "Prefered Top Node Cost\n");
939 LLVM_DEBUG(dbgs() << "Prefered Bottom in Node order\n");
982 LLVM_DEBUG(dbgs() << "*** " << (IsTopNode ? "Top" : "Bottom")
lib/Target/Hexagon/HexagonNewValueJump.cpp 450 LLVM_DEBUG(dbgs() << "********** Hexagon New Value Jump **********\n"
476 LLVM_DEBUG(dbgs() << "** dumping bb ** " << MBB->getNumber() << "\n");
477 LLVM_DEBUG(MBB->dump());
478 LLVM_DEBUG(dbgs() << "\n"
504 LLVM_DEBUG(dbgs() << "Instr: "; MI.dump(); dbgs() << "\n");
lib/Target/Hexagon/HexagonOptAddrMode.cpp 219 LLVM_DEBUG({
228 LLVM_DEBUG({
246 LLVM_DEBUG(dbgs() << "\t\t[DefNode]: "
254 LLVM_DEBUG({
264 LLVM_DEBUG(dbgs() << "\t\t\t\tphi real Uses"
308 LLVM_DEBUG(
399 LLVM_DEBUG(dbgs() << "\t\t[MI <BB#" << UseMI->getParent()->getNumber()
454 LLVM_DEBUG(dbgs() << "\nGetting ReachedUses for === " << MI << "\n");
519 LLVM_DEBUG(dbgs() << "[Changing]: " << *OldMI << "\n");
520 LLVM_DEBUG(dbgs() << "[TO]: " << *MIB << "\n");
531 LLVM_DEBUG(dbgs() << "[Changing]: " << *OldMI << "\n");
532 LLVM_DEBUG(dbgs() << "[TO]: " << *MIB << "\n");
574 LLVM_DEBUG(dbgs() << "[Changing]: " << *OldMI << "\n");
575 LLVM_DEBUG(dbgs() << "[TO]: " << *MIB << "\n");
584 LLVM_DEBUG(dbgs() << "[Changing]: " << *OldMI << "\n");
585 LLVM_DEBUG(dbgs() << "[TO]: " << *MIB << "\n");
608 LLVM_DEBUG(dbgs() << "Processing addasl :" << *AddAslMI << "\n");
619 LLVM_DEBUG(dbgs() << "[InstrNode]: "
622 LLVM_DEBUG(dbgs() << "[MI <" << printMBBReference(*UseMI->getParent())
701 LLVM_DEBUG(dbgs() << "[Analyzing " << HII->getName(MI->getOpcode())
739 LLVM_DEBUG(dbgs() << "\t[Total reached uses] : " << UNodeList.size()
741 LLVM_DEBUG(dbgs() << "\t[Processing Reached Uses] ===\n");
749 LLVM_DEBUG(dbgs() << "\t\t[MI <" << printMBBReference(*UseMI->getParent())
802 LLVM_DEBUG(dbgs() << "==== [RefMap#]=====:\n "
lib/Target/Hexagon/HexagonSplitDouble.cpp 248 LLVM_DEBUG(dbgs() << printReg(R, TRI) << " ~~");
271 LLVM_DEBUG(dbgs() << ' ' << printReg(T, TRI));
277 LLVM_DEBUG(dbgs() << '\n');
470 LLVM_DEBUG(dbgs() << "Partition profit: " << TotalP << '\n');
565 LLVM_DEBUG({
998 LLVM_DEBUG(dbgs() << "Splitting: " << *MI);
1132 LLVM_DEBUG(dbgs() << "Splitting partition: ";
1150 LLVM_DEBUG(dbgs() << "Created mapping: " << printReg(DR, TRI) << " -> "
1192 LLVM_DEBUG(dbgs() << "Splitting double registers in function: "
1207 LLVM_DEBUG({
1225 LLVM_DEBUG(dbgs() << "Calculating profit for partition #" << I->first
lib/Target/Hexagon/HexagonStoreWidening.cpp 474 LLVM_DEBUG({
lib/Target/Hexagon/HexagonTargetObjectFile.cpp 203 LLVM_DEBUG(dbgs() << "Small-data allocation is disabled, but symbols "
206 LLVM_DEBUG(dbgs() << "Checking if value is in small-data, -G"
210 LLVM_DEBUG(dbgs() << "no, not a global variable\n");
219 LLVM_DEBUG(dbgs() << (IsSmall ? "yes" : "no")
226 LLVM_DEBUG(dbgs() << "no, small-data allocation is disabled\n");
231 LLVM_DEBUG(dbgs() << "no, is a constant\n");
237 LLVM_DEBUG(dbgs() << "no, is static\n");
243 LLVM_DEBUG(dbgs() << "no, is an array\n");
253 LLVM_DEBUG(dbgs() << "no, has opaque type\n");
260 LLVM_DEBUG(dbgs() << "no, has size 0\n");
264 LLVM_DEBUG(dbgs() << "no, size exceeds sdata threshold: " << Size << '\n');
268 LLVM_DEBUG(dbgs() << "yes\n");
lib/Target/Hexagon/HexagonVLIWPacketizer.cpp 380 LLVM_DEBUG(dbgs() << "Cleanup packet has "; BI->dump(););
395 LLVM_DEBUG(dbgs() << "Demoted CUR "; MI->dump(););
419 LLVM_DEBUG(dbgs() << "Can we DOT Cur Vector MI\n"; MI.dump();
422 LLVM_DEBUG({
437 LLVM_DEBUG(dbgs() << "packet has "; BI->dump(););
442 LLVM_DEBUG(dbgs() << "Can Dot CUR MI\n"; MI.dump(););
1767 LLVM_DEBUG({
1781 LLVM_DEBUG(dbgs() << " Not added to NoShufPacket\n");
1805 LLVM_DEBUG(dbgs() << "End packet\n");
lib/Target/Hexagon/HexagonVectorLoopCarriedReuse.cpp 442 LLVM_DEBUG(dbgs() << "Not considering for reuse: " << *II << "\n");
450 LLVM_DEBUG(dbgs() << "Processing dependence " << *(D->front()) << "\n");
452 LLVM_DEBUG(
462 LLVM_DEBUG(dbgs() << "Checking if any uses of " << *PN
473 LLVM_DEBUG(dbgs() << *User
486 LLVM_DEBUG(dbgs() << PNUsers.size() << " use(s) of the PHI in the block\n");
578 LLVM_DEBUG(dbgs() << "Found Value for reuse.\n");
601 LLVM_DEBUG(dbgs() << ReuseCandidate);
609 LLVM_DEBUG(dbgs() << "reuseValue is making the following changes\n");
630 LLVM_DEBUG(dbgs() << "Added " << *InstInPreheader << " to "
643 LLVM_DEBUG(dbgs() << "Adding " << *NewPhi << " to " << BB->getName()
663 LLVM_DEBUG(dbgs() << "Working on Loop: " << *CurLoop->getHeader() << "\n");
741 LLVM_DEBUG(dbgs() << "Found " << Dependences.size() << " dependences\n");
742 LLVM_DEBUG(for (size_t i = 0; i < Dependences.size();
lib/Target/Hexagon/HexagonVectorPrint.cpp 146 LLVM_DEBUG(dbgs() << "Found vector reg inside bundle \n";
154 LLVM_DEBUG(dbgs() << "Found vector reg \n"; MI.dump());
166 LLVM_DEBUG(dbgs() << "Evaluating V MI\n"; I->dump());
172 LLVM_DEBUG(dbgs() << "add to end of bundle\n"; I->dump());
176 LLVM_DEBUG(dbgs() << "add after instruction\n"; I->dump());
183 LLVM_DEBUG(dbgs() << "adding dump for V" << Reg - Hexagon::V0 << '\n');
186 LLVM_DEBUG(dbgs() << "adding dump for W" << Reg - Hexagon::W0 << '\n');
192 LLVM_DEBUG(dbgs() << "adding dump for Q" << Reg - Hexagon::Q0 << '\n');
lib/Target/Hexagon/MCTargetDesc/HexagonAsmBackend.cpp 511 LLVM_DEBUG(dbgs() << "Name=" << getFixupKindInfo(Kind).Name << "("
513 LLVM_DEBUG(
529 LLVM_DEBUG(uint32_t NewData = 0;
689 LLVM_DEBUG(dbgs() << "Alignment not a multiple of the instruction size:"
lib/Target/Hexagon/MCTargetDesc/HexagonMCCodeEmitter.cpp 373 LLVM_DEBUG(dbgs() << "Encoding bundle\n";);
416 LLVM_DEBUG(dbgs() << "Encoding insn `"
425 LLVM_DEBUG(dbgs() << "Unimplemented inst `"
631 LLVM_DEBUG(dbgs() << "----------------------------------------\n"
lib/Target/Hexagon/MCTargetDesc/HexagonMCCompound.cpp 206 LLVM_DEBUG(dbgs() << "Possible compound ignored\n");
234 LLVM_DEBUG(dbgs() << "CX: C2_cmpeq\n");
247 LLVM_DEBUG(dbgs() << "CX: C2_cmpgt\n");
260 LLVM_DEBUG(dbgs() << "CX: C2_cmpgtu\n");
273 LLVM_DEBUG(dbgs() << "CX: C2_cmpeqi\n");
291 LLVM_DEBUG(dbgs() << "CX: C2_cmpgti\n");
309 LLVM_DEBUG(dbgs() << "CX: C2_cmpgtui\n");
320 LLVM_DEBUG(dbgs() << "CX: S2_tstbit_i\n");
373 LLVM_DEBUG(dbgs() << "J,B: " << JumpInst->getOpcode() << ","
378 LLVM_DEBUG(dbgs() << "B: " << Inst->getOpcode() << ","
423 LLVM_DEBUG(dbgs() << "Found ERROR\n");
lib/Target/Hexagon/MCTargetDesc/HexagonMCDuplexInfo.cpp 1052 LLVM_DEBUG(dbgs() << "skip out of order write pair: " << k << "," << j
1073 LLVM_DEBUG(dbgs() << "adding pair: " << j << "," << k << ":"
1078 LLVM_DEBUG(dbgs() << "skipping pair: " << j << "," << k << ":"
1098 LLVM_DEBUG(dbgs()
1103 LLVM_DEBUG(dbgs()
lib/Target/Hexagon/MCTargetDesc/HexagonMCShuffler.cpp 39 LLVM_DEBUG(dbgs() << "Shuffling: " << MCII.getName(MI.getOpcode())
100 LLVM_DEBUG(MCB.dump());
121 LLVM_DEBUG(dbgs() << "Skipping empty bundle");
124 LLVM_DEBUG(dbgs() << "Skipping stand-alone insn");
146 LLVM_DEBUG(dbgs() << "Skipping empty bundle");
149 LLVM_DEBUG(dbgs() << "Skipping stand-alone insn");
lib/Target/Hexagon/MCTargetDesc/HexagonShuffler.cpp 657 LLVM_DEBUG(dbgs().write_hex(ISJ->Core.getUnits()); if (ISJ->CVI.isValid()) {
664 LLVM_DEBUG(dbgs() << '\n');
lib/Target/Lanai/LanaiISelDAGToDAG.cpp 277 LLVM_DEBUG(errs() << "== "; Node->dump(CurDAG); errs() << "\n");
lib/Target/Lanai/LanaiISelLowering.cpp 484 LLVM_DEBUG(dbgs() << "LowerFormalArguments Unhandled argument type: "
lib/Target/MSP430/MSP430BranchSelector.cpp 141 LLVM_DEBUG(dbgs() << " Found a branch that needs expanding, "
148 LLVM_DEBUG(dbgs() << " Found a basic block that needs to be split, "
232 LLVM_DEBUG(dbgs() << "\n********** " << getPassName() << " **********\n");
lib/Target/MSP430/MSP430ISelDAGToDAG.cpp 184 LLVM_DEBUG(errs() << "MatchAddress: "; AM.dump());
385 LLVM_DEBUG(errs() << "== "; Node->dump(CurDAG); errs() << "\n");
lib/Target/Mips/AsmParser/MipsAsmParser.cpp 1468 LLVM_DEBUG(dbgs() << "createNumericReg(" << Index << ", ...)\n");
5992 LLVM_DEBUG(dbgs() << "parseOperand\n");
6005 LLVM_DEBUG(dbgs() << ".. Generic Parser\n");
6035 LLVM_DEBUG(dbgs() << ".. generic integer expression\n");
6108 LLVM_DEBUG(dbgs() << "parseMemOperand\n");
6349 LLVM_DEBUG(dbgs() << ".. identifier\n");
6355 LLVM_DEBUG(dbgs() << ".. integer\n");
6369 LLVM_DEBUG(dbgs() << Token.getKind() << "\n");
6383 LLVM_DEBUG(dbgs() << "parseAnyRegister\n");
6390 LLVM_DEBUG(dbgs() << ".. !$ -> try sym aliasing\n");
6395 LLVM_DEBUG(dbgs() << ".. !symalias -> NoMatch\n");
6398 LLVM_DEBUG(dbgs() << ".. $\n");
6411 LLVM_DEBUG(dbgs() << "parseJumpTarget\n");
6603 LLVM_DEBUG(dbgs() << "ParseInstruction\n");
lib/Target/Mips/Disassembler/MipsDisassembler.cpp 1229 LLVM_DEBUG(
1241 LLVM_DEBUG(dbgs() << "Trying MicroMips16 table (16-bit instructions):\n");
1256 LLVM_DEBUG(
1267 LLVM_DEBUG(dbgs() << "Trying MicroMips32 table (32-bit instructions):\n");
1277 LLVM_DEBUG(dbgs() << "Trying MicroMipsFP64 table (32-bit opcodes):\n");
1306 LLVM_DEBUG(dbgs() << "Trying COP3_ table (32-bit opcodes):\n");
1314 LLVM_DEBUG(
1323 LLVM_DEBUG(
1332 LLVM_DEBUG(dbgs() << "Trying Mips32r6_64r6 table (32-bit opcodes):\n");
1340 LLVM_DEBUG(
1349 LLVM_DEBUG(dbgs() << "Trying CnMips table (32-bit opcodes):\n");
1357 LLVM_DEBUG(dbgs() << "Trying Mips64 (GPR64) table (32-bit opcodes):\n");
1365 LLVM_DEBUG(
1373 LLVM_DEBUG(dbgs() << "Trying Mips table (32-bit opcodes):\n");
lib/Target/Mips/MCTargetDesc/MipsELFObjectWriter.cpp 118 LLVM_DEBUG(dbgs() << std::distance(First, I) << " is a match (";
121 LLVM_DEBUG(dbgs() << ".. and it beats the last one\n");
126 LLVM_DEBUG(dbgs() << ".. and it is unbeatable\n");
474 LLVM_DEBUG(dumpRelocs("R: ", Relocs));
485 LLVM_DEBUG(dbgs() << "Matching: " << R << "\n");
520 LLVM_DEBUG(dumpRelocs("S: ", Sorted));
lib/Target/Mips/MicroMipsSizeReduction.cpp 700 LLVM_DEBUG(dbgs() << "Converting 32-bit: " << *MI);
705 LLVM_DEBUG(dbgs() << " to 16-bit: " << *MI);
754 LLVM_DEBUG(dbgs() << "and converting 32-bit: " << *MI2
768 LLVM_DEBUG(dbgs() << " to 16-bit: " << *MIB);
lib/Target/Mips/Mips16HardFloat.cpp 486 LLVM_DEBUG(errs() << "removing -use-soft-float\n");
490 LLVM_DEBUG(errs() << "still has -use-soft-float\n");
514 LLVM_DEBUG(errs() << "Run on Module Mips16HardFloat\n");
lib/Target/Mips/Mips16RegisterInfo.cpp 129 LLVM_DEBUG(errs() << "Offset : " << Offset << "\n"
lib/Target/Mips/MipsConstantIslandPass.cpp 440 LLVM_DEBUG(dbgs() << "constant island machine function "
447 LLVM_DEBUG(dbgs() << "constant island processing "
479 LLVM_DEBUG(dumpBBs());
489 LLVM_DEBUG(dbgs() << "Beginning CP iteration #" << NoCPIters << '\n');
495 LLVM_DEBUG(dumpBBs());
501 LLVM_DEBUG(dbgs() << "Beginning BR iteration #" << NoBRIters << '\n');
507 LLVM_DEBUG(dumpBBs());
513 LLVM_DEBUG(dbgs() << '\n'; dumpBBs());
581 LLVM_DEBUG(dbgs() << "Moved CPI#" << i << " to end of function, size = "
584 LLVM_DEBUG(BB->dump());
981 LLVM_DEBUG({
1054 LLVM_DEBUG(dbgs() << "In range\n");
1070 LLVM_DEBUG(dbgs() << "Replacing CPE#" << CPI << " with CPE#"
1108 LLVM_DEBUG(dbgs() << "In range\n");
1126 LLVM_DEBUG(dbgs() << "Replacing CPE#" << CPI << " with CPE#"
1192 LLVM_DEBUG(dbgs() << "Found water after " << printMBBReference(*WaterBB)
1230 LLVM_DEBUG(dbgs() << "Split at end of " << printMBBReference(*UserMBB)
1256 LLVM_DEBUG(dbgs() << format("Split in middle of big block before %#x",
1264 LLVM_DEBUG(dbgs() << format(", adjusted to %#x", BaseInsertOffset)
1273 LLVM_DEBUG(dbgs() << format("Move inside block: %#x\n", BaseInsertOffset));
1329 LLVM_DEBUG(dbgs() << "Found water in range\n");
1348 LLVM_DEBUG(dbgs() << "No water found\n");
1407 LLVM_DEBUG(
1465 LLVM_DEBUG(dbgs() << "Branch of destination " << printMBBReference(*DestBB)
1534 LLVM_DEBUG(dbgs() << " Changed B to long jump " << *MI);
1589 LLVM_DEBUG(
1611 LLVM_DEBUG(dbgs() << " Insert B to " << printMBBReference(*DestBB)
1649 LLVM_DEBUG(dbgs() << "constant island constant " << *I << "\n");
1651 LLVM_DEBUG(dbgs() << "num operands " << J << "\n");
1655 LLVM_DEBUG(dbgs() << "literal " << V << "\n");
1661 LLVM_DEBUG(dbgs() << "constant island constant " << *I << "\n");
lib/Target/Mips/MipsFastISel.cpp 1021 LLVM_DEBUG(dbgs() << "selectSelect\n");
1025 LLVM_DEBUG(
1315 LLVM_DEBUG(dbgs() << "fastLowerArguments\n");
1318 LLVM_DEBUG(dbgs() << ".. gave up (!CanLowerReturn)\n");
1324 LLVM_DEBUG(dbgs() << ".. gave up (varargs)\n");
1330 LLVM_DEBUG(dbgs() << ".. gave up (calling convention is not C)\n");
1356 LLVM_DEBUG(dbgs() << ".. gave up (inreg, structret, byval)\n");
1362 LLVM_DEBUG(dbgs() << ".. gave up (struct, array, or vector)\n");
1367 LLVM_DEBUG(dbgs() << ".. " << FormalArg.getArgNo() << ": "
1370 LLVM_DEBUG(dbgs() << ".. .. gave up (not a simple type)\n");
1382 LLVM_DEBUG(dbgs() << ".. .. gave up (i8/i16 arg is not extended)\n");
1387 LLVM_DEBUG(dbgs() << ".. .. gave up (ran out of GPR32 arguments)\n");
1391 LLVM_DEBUG(dbgs() << ".. .. GPR32(" << *NextGPR32 << ")\n");
1402 LLVM_DEBUG(dbgs() << ".. .. gave up (i32 arg is zero extended)\n");
1407 LLVM_DEBUG(dbgs() << ".. .. gave up (ran out of GPR32 arguments)\n");
1411 LLVM_DEBUG(dbgs() << ".. .. GPR32(" << *NextGPR32 << ")\n");
1421 LLVM_DEBUG(dbgs() << ".. .. gave up (UnsupportedFPMode)\n");
1425 LLVM_DEBUG(dbgs() << ".. .. gave up (ran out of FGR32 arguments)\n");
1428 LLVM_DEBUG(dbgs() << ".. .. FGR32(" << *NextFGR32 << ")\n");
1440 LLVM_DEBUG(dbgs() << ".. .. gave up (UnsupportedFPMode)\n");
1444 LLVM_DEBUG(dbgs() << ".. .. gave up (ran out of AFGR64 arguments)\n");
1447 LLVM_DEBUG(dbgs() << ".. .. AFGR64(" << *NextAFGR64 << ")\n");
1460 LLVM_DEBUG(dbgs() << ".. .. gave up (unknown type)\n");
1685 LLVM_DEBUG(dbgs() << "selectRet\n");
1749 LLVM_DEBUG(dbgs() << ".. .. gave up (UnsupportedFPMode\n");
lib/Target/Mips/MipsISelDAGToDAG.cpp 272 LLVM_DEBUG(errs() << "== "; Node->dump(CurDAG); errs() << "\n");
lib/Target/Mips/MipsInstructionSelector.cpp 106 LLVM_DEBUG(dbgs() << "Failed to constrain " << TII.getName(I.getOpcode())
lib/Target/Mips/MipsModuleISelDAGToDAG.cpp 47 LLVM_DEBUG(errs() << "In MipsModuleDAGToDAGISel::runMachineFunction\n");
lib/Target/Mips/MipsOs16.cpp 98 LLVM_DEBUG(dbgs() << "Working on call"
113 LLVM_DEBUG(dbgs() << "Run on Module MipsOs16 \n"
116 LLVM_DEBUG(dbgs() << "using mask \n" << Mips32FunctionMask << "\n");
125 LLVM_DEBUG(dbgs() << "Working on " << F.getName() << "\n");
132 LLVM_DEBUG(dbgs() << "mask forced mips32: " << F.getName() << "\n");
146 LLVM_DEBUG(dbgs() << "os16 forced mips32: " << F.getName() << "\n");
150 LLVM_DEBUG(dbgs() << "os16 forced mips16: " << F.getName() << "\n");
lib/Target/Mips/MipsRegisterInfo.cpp 262 LLVM_DEBUG(errs() << "\nFunction : " << MF.getName() << "\n";
270 LLVM_DEBUG(errs() << "FrameIndex : " << FrameIndex << "\n"
lib/Target/Mips/MipsSEISelLowering.cpp 1056 LLVM_DEBUG(dbgs() << "\nMipsSE DAG Combine:\n";
lib/Target/Mips/MipsSERegisterInfo.cpp 206 LLVM_DEBUG(errs() << "Offset : " << Offset << "\n"
lib/Target/Mips/MipsSubtarget.cpp 262 LLVM_DEBUG(dbgs() << "use constant islands " << Mips16ConstantIslands
lib/Target/Mips/MipsTargetMachine.cpp 210 LLVM_DEBUG(dbgs() << "resetSubtarget\n");
284 LLVM_DEBUG(errs() << "No Target Transform Info Pass Added\n");
289 LLVM_DEBUG(errs() << "Target Transform Info Pass Added\n");
lib/Target/NVPTX/NVPTXPrologEpilogPass.cpp 118 LLVM_DEBUG(dbgs() << "alloc FI(" << FrameIdx << ") at SP[" << -Offset
122 LLVM_DEBUG(dbgs() << "alloc FI(" << FrameIdx << ") at SP[" << Offset
186 LLVM_DEBUG(dbgs() << "Local frame base offset: " << Offset << "\n");
192 LLVM_DEBUG(dbgs() << "alloc FI(" << Entry.first << ") at SP[" << FIOffset
lib/Target/NVPTX/NVVMReflect.cpp 159 LLVM_DEBUG(dbgs() << "Arg of _reflect : " << ReflectArg << "\n");
lib/Target/PowerPC/PPCAsmPrinter.cpp 879 LLVM_DEBUG(assert(
909 LLVM_DEBUG(assert(
lib/Target/PowerPC/PPCBranchCoalescing.cpp 234 LLVM_DEBUG(dbgs() << "Determine if branch block "
240 LLVM_DEBUG(dbgs() << "TII unable to Analyze Branch - skip\n");
245 LLVM_DEBUG(dbgs() << "Looking at terminator : " << I << "\n");
263 LLVM_DEBUG(dbgs() << "Terminator contains implicit operands - skip : "
270 LLVM_DEBUG(dbgs() << "EH Pad - skip\n");
278 LLVM_DEBUG(dbgs() << "Does not form a triangle - skip\n");
284 LLVM_DEBUG(dbgs() << "Does not have 2 successors - skip\n");
303 LLVM_DEBUG(dbgs() << "Fall-through block contains code -- skip\n");
308 LLVM_DEBUG(
315 LLVM_DEBUG(dbgs() << "Valid Candidate\n");
330 LLVM_DEBUG(dbgs() << "Operand list is different size\n");
338 LLVM_DEBUG(dbgs() << "Op1: " << Op1 << "\n"
348 LLVM_DEBUG(dbgs() << "The operands are not provably identical.\n");
351 LLVM_DEBUG(dbgs() << "Op1 and Op2 are identical!\n");
364 LLVM_DEBUG(dbgs() << "Op1Def: " << *Op1Def << " and " << *Op2Def
367 LLVM_DEBUG(dbgs() << "Operands produce different values\n");
371 LLVM_DEBUG(dbgs() << "The operands are not provably identical.\n");
395 LLVM_DEBUG(dbgs() << "SourceMBB contains no PHI instructions.\n");
425 LLVM_DEBUG(dbgs() << "Checking if " << MI << " can move to beginning of "
431 LLVM_DEBUG(dbgs() << " *** used in a PHI -- cannot move ***\n");
437 LLVM_DEBUG(dbgs() << " Safe to move to the beginning.\n");
456 LLVM_DEBUG(dbgs() << "Checking if " << MI << " can move to end of "
463 LLVM_DEBUG(dbgs() << " *** Cannot move this instruction ***\n");
466 LLVM_DEBUG(
472 LLVM_DEBUG(dbgs() << " Safe to move to the end.\n");
542 LLVM_DEBUG(dbgs()
550 LLVM_DEBUG(dbgs() << "PHI " << *I
565 LLVM_DEBUG(dbgs() << "Instruction " << *I
570 LLVM_DEBUG(dbgs() << "Instruction " << *I
722 LLVM_DEBUG(dbgs() << "******** Branch Coalescing ********\n");
725 LLVM_DEBUG(dbgs() << "Function: "; MF.dump(); dbgs() << "\n");
755 LLVM_DEBUG(dbgs() << "Blocks " << Cand1.BranchBlock->getNumber()
761 LLVM_DEBUG(dbgs() << "Cannot merge blocks "
767 LLVM_DEBUG(dbgs() << "Merging blocks " << Cand1.BranchBlock->getNumber()
774 LLVM_DEBUG(dbgs() << "Function after merging: "; MF.dump();
785 LLVM_DEBUG(dbgs() << "Finished Branch Coalescing\n");
lib/Target/PowerPC/PPCCTRLoops.cpp 155 LLVM_DEBUG(dbgs() << printMBBReference(*MBB) << " (" << MBB->getFullName()
174 LLVM_DEBUG(dbgs() << "Unable to find a MTCTR instruction for "
lib/Target/PowerPC/PPCExpandISEL.cpp 128 LLVM_DEBUG(dbgs() << "Function: "; MF.dump(); dbgs() << "\n");
132 LLVM_DEBUG(dbgs() << "No ISEL instructions in this function\n");
172 LLVM_DEBUG(dbgs() << printMBBReference(*MF->getBlockNumbered(I.first))
175 LLVM_DEBUG(dbgs() << " "; VI->print(dbgs()));
195 LLVM_DEBUG(
214 LLVM_DEBUG(dbgs() << "Remove redundant ISEL instruction: " << **I
228 LLVM_DEBUG(
230 LLVM_DEBUG(dbgs() << "ISEL: " << **I << "\n");
241 LLVM_DEBUG(dbgs() << "Expand ISEL instructions:\n");
242 LLVM_DEBUG(dbgs() << "ISEL: " << **I << "\n");
250 LLVM_DEBUG(dbgs() << "ISEL: " << **I << "\n");
270 LLVM_DEBUG(dbgs() << "ISEL: " << **MI << "\n");
287 LLVM_DEBUG(dbgs() << "Remove redundant ISEL instruction.");
306 LLVM_DEBUG(
446 LLVM_DEBUG(dbgs() << "Dest: " << Dest << "\n");
447 LLVM_DEBUG(dbgs() << "TrueValue: " << TrueValue << "\n");
448 LLVM_DEBUG(dbgs() << "FalseValue: " << FalseValue << "\n");
449 LLVM_DEBUG(dbgs() << "ConditionRegister: " << ConditionRegister << "\n");
lib/Target/PowerPC/PPCHazardRecognizers.cpp 181 LLVM_DEBUG(dbgs() << "**** Adding to dispatch group: ");
182 LLVM_DEBUG(DAG->dumpNode(*SU));
268 LLVM_DEBUG(errs() << "=== Start of dispatch group\n");
lib/Target/PowerPC/PPCISelDAGToDAG.cpp 550 LLVM_DEBUG(dbgs() << "Use branch hint for '" << FuncInfo->Fn->getName()
1166 LLVM_DEBUG(dbgs() << "\tbit group for " << V.getNode() << " RLAmt = " << R
1517 LLVM_DEBUG(dbgs() << "\tcombining final bit group with initial one\n");
1620 LLVM_DEBUG(dbgs() << "\t32-bit replicated bit group for "
1636 LLVM_DEBUG(dbgs() << "\tcombining 32-bit replicated bit group for "
1664 LLVM_DEBUG(dbgs() << "\tcombining bit group for " << I->V.getNode()
1789 LLVM_DEBUG(dbgs() << "\t\trotation groups for " << VRI.V.getNode()
1797 LLVM_DEBUG(dbgs() << "\t\t\t\tusing masking\n");
2145 LLVM_DEBUG(dbgs() << "\t\trotation groups for " << VRI.V.getNode()
2162 LLVM_DEBUG(dbgs() << "\t\t\t\tusing masking\n");
2413 LLVM_DEBUG(dbgs() << "Considering bit-permutation-based instruction"
2415 LLVM_DEBUG(N->dump(CurDAG));
2432 LLVM_DEBUG(dbgs() << "\tEarly masking:\n");
2434 LLVM_DEBUG(dbgs() << "\t\tisel would use " << InstCnt << " instructions\n");
2436 LLVM_DEBUG(dbgs() << "\tLate masking:\n");
2438 LLVM_DEBUG(dbgs() << "\t\tisel would use " << InstCntLateMask
2442 LLVM_DEBUG(dbgs() << "\tUsing early-masking for isel\n");
2446 LLVM_DEBUG(dbgs() << "\tUsing late-masking for isel\n");
4341 LLVM_DEBUG(dbgs() << "Found a node that can be lowered to a SETB: ");
4342 LLVM_DEBUG(N->dump());
5545 LLVM_DEBUG(dbgs() << "PPC DAG preprocessing replacing:\nOld: ");
5546 LLVM_DEBUG(N->dump(CurDAG));
5547 LLVM_DEBUG(dbgs() << "\nNew: ");
5548 LLVM_DEBUG(Res.getNode()->dump(CurDAG));
5549 LLVM_DEBUG(dbgs() << "\n");
5626 LLVM_DEBUG(dbgs() << "CR Peephole replacing:\nOld: ");
5627 LLVM_DEBUG(User->dump(CurDAG));
5628 LLVM_DEBUG(dbgs() << "\nNew: ");
5629 LLVM_DEBUG(ResNode->dump(CurDAG));
5630 LLVM_DEBUG(dbgs() << "\n");
6044 LLVM_DEBUG(dbgs() << "CR Peephole replacing:\nOld: ");
6045 LLVM_DEBUG(MachineNode->dump(CurDAG));
6046 LLVM_DEBUG(dbgs() << "\nNew: ");
6047 LLVM_DEBUG(ResNode->dump(CurDAG));
6048 LLVM_DEBUG(dbgs() << "\n");
6342 LLVM_DEBUG(dbgs() << "PPC64 ZExt Peephole morphing:\nOld: ");
6343 LLVM_DEBUG(PN->dump(CurDAG));
6347 LLVM_DEBUG(dbgs() << "\nNew: ");
6348 LLVM_DEBUG(PN->dump(CurDAG));
6349 LLVM_DEBUG(dbgs() << "\n");
6356 LLVM_DEBUG(dbgs() << "PPC64 ZExt Peephole replacing:\nOld: ");
6357 LLVM_DEBUG(N->dump(CurDAG));
6358 LLVM_DEBUG(dbgs() << "\nNew: ");
6359 LLVM_DEBUG(Op32.getNode()->dump(CurDAG));
6360 LLVM_DEBUG(dbgs() << "\n");
6540 LLVM_DEBUG(dbgs() << "Folding add-immediate into mem-op:\nBase: ");
6541 LLVM_DEBUG(Base->dump(CurDAG));
6542 LLVM_DEBUG(dbgs() << "\nN: ");
6543 LLVM_DEBUG(N->dump(CurDAG));
6544 LLVM_DEBUG(dbgs() << "\n");
6556 LLVM_DEBUG(dbgs() << "Rejected this candidate for alignment.\n\n");
lib/Target/PowerPC/PPCISelLowering.cpp 5368 LLVM_DEBUG(
lib/Target/PowerPC/PPCInstrInfo.cpp 2615 LLVM_DEBUG(dbgs() << "Replace instruction: "
2617 LLVM_DEBUG(ADDIMI->dump());
2618 LLVM_DEBUG(ADDMI->dump());
2619 LLVM_DEBUG(MI.dump());
2620 LLVM_DEBUG(dbgs() << "with: "
2638 LLVM_DEBUG(ADDIMI->dump());
2639 LLVM_DEBUG(MI.dump());
2847 LLVM_DEBUG(
2849 LLVM_DEBUG(DefMI->dump(); MI.dump(); CompareUseMI.dump());
2850 LLVM_DEBUG(dbgs() << "Is converted to:\n");
2857 LLVM_DEBUG(CompareUseMI.dump());
2981 LLVM_DEBUG(dbgs() << "Replacing instruction:\n");
2982 LLVM_DEBUG(MI.dump());
2983 LLVM_DEBUG(dbgs() << "Fed by:\n");
2984 LLVM_DEBUG(DefMI->dump());
3002 LLVM_DEBUG(dbgs() << "With:\n");
3003 LLVM_DEBUG(MI.dump());
3643 LLVM_DEBUG(dbgs() << "Replacing instruction:\n");
3644 LLVM_DEBUG(MI.dump());
3645 LLVM_DEBUG(dbgs() << "Fed by:\n");
3646 LLVM_DEBUG(DefMI.dump());
3706 LLVM_DEBUG(dbgs() << "With:\n");
3707 LLVM_DEBUG(MI.dump());
lib/Target/PowerPC/PPCLoopPreIncPrep.cpp 334 LLVM_DEBUG(dbgs() << "PIP: Transforming: " << *BasePtrSCEV << "\n");
363 LLVM_DEBUG(dbgs() << "PIP: New start is: " << *BasePtrStartSCEV << "\n");
549 LLVM_DEBUG(dbgs() << "PIP: Examining: " << *L << "\n");
562 LLVM_DEBUG(dbgs() << "PIP fails since no predecessor for current loop.\n");
lib/Target/PowerPC/PPCMIPeephole.cpp 141 LLVM_DEBUG(dbgs() << "*** PowerPC MI peephole pass ***\n\n");
142 LLVM_DEBUG(MF->dump());
284 LLVM_DEBUG(dbgs() << "Converted instruction to imm form: ");
285 LLVM_DEBUG(MI.dump());
369 LLVM_DEBUG(dbgs() << "Optimizing load-and-splat/splat "
371 LLVM_DEBUG(MI.dump());
390 LLVM_DEBUG(dbgs() << "Optimizing splat/swap or splat/splat "
392 LLVM_DEBUG(MI.dump());
405 LLVM_DEBUG(dbgs() << "Optimizing swap/splat => splat: ");
406 LLVM_DEBUG(MI.dump());
416 LLVM_DEBUG(dbgs() << "Optimizing swap/swap => copy: ");
417 LLVM_DEBUG(MI.dump());
432 LLVM_DEBUG(dbgs() << "Removing redundant splat: ");
433 LLVM_DEBUG(MI.dump());
472 LLVM_DEBUG(dbgs() << "Changing redundant splat to a copy: ");
473 LLVM_DEBUG(MI.dump());
491 LLVM_DEBUG(dbgs() << "Removing redundant shift: ");
492 LLVM_DEBUG(DefMI->dump());
496 LLVM_DEBUG(dbgs() << "Changing splat immediate from " << SplatImm
498 LLVM_DEBUG(MI.dump());
542 LLVM_DEBUG(dbgs() << "Removing redundant FRSP:\n");
543 LLVM_DEBUG(RoundInstr->dump());
544 LLVM_DEBUG(dbgs() << "As it feeds instruction:\n");
545 LLVM_DEBUG(MI.dump());
546 LLVM_DEBUG(dbgs() << "Through instruction:\n");
547 LLVM_DEBUG(DefMI->dump());
595 LLVM_DEBUG(dbgs() << "Zero-extending load\n");
596 LLVM_DEBUG(SrcMI->dump());
597 LLVM_DEBUG(dbgs() << "and sign-extension\n");
598 LLVM_DEBUG(MI.dump());
599 LLVM_DEBUG(dbgs() << "are merged into sign-extending load\n");
639 LLVM_DEBUG(dbgs() << "Zero-extending load\n");
640 LLVM_DEBUG(SrcMI->dump());
641 LLVM_DEBUG(dbgs() << "and sign-extension\n");
642 LLVM_DEBUG(MI.dump());
643 LLVM_DEBUG(dbgs() << "are merged into sign-extending load\n");
653 LLVM_DEBUG(dbgs() << "Removing redundant sign-extension\n");
704 LLVM_DEBUG(dbgs() << "Removing redundant zero-extension\n");
770 LLVM_DEBUG(dbgs() << "Optimizing LI to ADDI: ");
771 LLVM_DEBUG(LiMI->dump());
789 LLVM_DEBUG(LiMI->dump());
793 LLVM_DEBUG(dbgs() << "Optimizing ADD to COPY: ");
794 LLVM_DEBUG(MI.dump());
1248 LLVM_DEBUG(dbgs() << "Optimize two pairs of compare and branch:\n");
1249 LLVM_DEBUG(CMPI1->dump());
1250 LLVM_DEBUG(BI1->dump());
1251 LLVM_DEBUG(CMPI2->dump());
1252 LLVM_DEBUG(BI2->dump());
1311 LLVM_DEBUG(dbgs() << "into a compare and two branches:\n");
1312 LLVM_DEBUG(CMPI1->dump());
1313 LLVM_DEBUG(BI1->dump());
1314 LLVM_DEBUG(BI2->dump());
1316 LLVM_DEBUG(dbgs() << "The following compare is moved into "
1319 LLVM_DEBUG(CMPI2->dump());
1369 LLVM_DEBUG(dbgs() << "Converting pair: ");
1370 LLVM_DEBUG(SrcMI->dump());
1371 LLVM_DEBUG(MI.dump());
1378 LLVM_DEBUG(dbgs() << "To: ");
1379 LLVM_DEBUG(MI.dump());
1435 LLVM_DEBUG(dbgs() << "Combining pair: ");
1436 LLVM_DEBUG(SrcMI->dump());
1437 LLVM_DEBUG(MI.dump());
1448 LLVM_DEBUG(dbgs() << "TO: ");
1449 LLVM_DEBUG(NewInstr->dump());
lib/Target/PowerPC/PPCPreEmitPeephole.cpp 73 LLVM_DEBUG(dbgs() << "Remove redundant load immediates from MBB:\n";
94 LLVM_DEBUG(dbgs() << "Scanning after load immediate: "; BBI->dump(););
101 LLVM_DEBUG(dbgs() << " Kill flag of " << *DeadOrKillToUnset
115 LLVM_DEBUG(dbgs()
138 LLVM_DEBUG(dbgs()
149 LLVM_DEBUG(dbgs()
153 LLVM_DEBUG(dbgs() << " Remove redundant load immediate: ";
183 LLVM_DEBUG(dbgs() << "Deleting self-copy instruction: ");
184 LLVM_DEBUG(MI.dump());
191 LLVM_DEBUG(dbgs() << "Deleting self-copy instruction: ");
192 LLVM_DEBUG(MI.dump());
201 LLVM_DEBUG(dbgs() << "Converted instruction to imm form: ");
202 LLVM_DEBUG(MI.dump());
210 LLVM_DEBUG(dbgs() << "Frame offset folding by using index form: ");
211 LLVM_DEBUG(MI.dump());
285 LLVM_DEBUG(dbgs() << "PPC pre-emit peephole: erasing instruction: ");
286 LLVM_DEBUG(MI->dump());
lib/Target/PowerPC/PPCReduceCRLogicals.cpp 148 LLVM_DEBUG(
246 LLVM_DEBUG(dbgs() << "After splitting, ThisMBB:\n"; ThisMBB->dump());
247 LLVM_DEBUG(dbgs() << "NewMBB:\n"; NewMBB->dump());
248 LLVM_DEBUG(dbgs() << "New branch-to block:\n"; NewBRTarget->dump());
519 LLVM_DEBUG(Ret.dump());
614 LLVM_DEBUG(dbgs() << "Unable to split as the two operands are the same\n");
620 LLVM_DEBUG(
633 LLVM_DEBUG(dbgs() << "Unable to split blocks on this opcode.\n");
637 LLVM_DEBUG(dbgs() << "Splitting the following CR op:\n"; CRI.dump());
651 LLVM_DEBUG(dbgs() << "We will split the following block:\n";);
652 LLVM_DEBUG(CRI.MI->getParent()->dump());
653 LLVM_DEBUG(dbgs() << "Before instruction:\n"; SplitBefore->dump());
686 LLVM_DEBUG(dbgs() << "We will " << (InvertNewBranch ? "invert" : "copy"));
687 LLVM_DEBUG(dbgs() << " the original branch and the target is the "
690 LLVM_DEBUG(dbgs() << "Original branch instruction: "; Branch->dump());
lib/Target/PowerPC/PPCTLSDynamicCall.cpp 75 LLVM_DEBUG(dbgs() << "TLS Dynamic Call Fixup:\n " << MI);
lib/Target/PowerPC/PPCVSXFMAMutate.cpp 243 LLVM_DEBUG(dbgs() << "VSX FMA Mutation:\n " << MI);
275 LLVM_DEBUG(dbgs() << " -> " << MI);
312 LLVM_DEBUG(dbgs() << " extended: " << NewFMAInt << '\n');
325 LLVM_DEBUG(dbgs() << " extended: " << AddendSrcRange << '\n');
329 LLVM_DEBUG(dbgs() << " trimmed: " << FMAInt << '\n');
333 LLVM_DEBUG(dbgs() << " removing: " << *AddendMI << '\n');
lib/Target/PowerPC/PPCVSXSwapRemoval.cpp 527 LLVM_DEBUG(dbgs() << "Swap vector when first built\n\n");
528 LLVM_DEBUG(dumpSwapVector());
587 LLVM_DEBUG(dbgs() << "\n*** Forming webs for swap removal ***\n\n");
593 LLVM_DEBUG(dbgs() << "\n" << SwapVector[EntryIdx].VSEId << " ");
594 LLVM_DEBUG(MI->dump());
624 LLVM_DEBUG(dbgs() << format("Unioning %d with %d\n",
627 LLVM_DEBUG(dbgs() << " Def: ");
628 LLVM_DEBUG(DefMI->dump());
639 LLVM_DEBUG(dbgs() << "\n*** Rejecting webs for swap removal ***\n\n");
657 LLVM_DEBUG(
661 LLVM_DEBUG(dbgs() << " in " << EntryIdx << ": ");
662 LLVM_DEBUG(SwapVector[EntryIdx].VSEMI->dump());
663 LLVM_DEBUG(dbgs() << "\n");
684 LLVM_DEBUG(dbgs() << format(
686 LLVM_DEBUG(dbgs() << " def " << EntryIdx << ": ");
687 LLVM_DEBUG(MI->dump());
688 LLVM_DEBUG(dbgs() << " use " << UseIdx << ": ");
689 LLVM_DEBUG(UseMI.dump());
690 LLVM_DEBUG(dbgs() << "\n");
708 LLVM_DEBUG(dbgs() << format(
710 LLVM_DEBUG(dbgs() << " def " << DefIdx << ": ");
711 LLVM_DEBUG(DefMI->dump());
712 LLVM_DEBUG(dbgs() << " use " << EntryIdx << ": ");
713 LLVM_DEBUG(MI->dump());
714 LLVM_DEBUG(dbgs() << "\n");
725 LLVM_DEBUG(
728 LLVM_DEBUG(dbgs() << " def "
730 LLVM_DEBUG(DefMI->dump());
731 LLVM_DEBUG(dbgs() << " use " << UseIdx << ": ");
732 LLVM_DEBUG(SwapVector[UseIdx].VSEMI->dump());
733 LLVM_DEBUG(dbgs() << "\n");
739 LLVM_DEBUG(dbgs() << "Swap vector after web analysis:\n\n");
740 LLVM_DEBUG(dumpSwapVector());
750 LLVM_DEBUG(dbgs() << "\n*** Marking swaps for removal ***\n\n");
765 LLVM_DEBUG(dbgs() << "Marking swap fed by load for removal: ");
766 LLVM_DEBUG(UseMI.dump());
780 LLVM_DEBUG(dbgs() << "Marking swap feeding store for removal: ");
781 LLVM_DEBUG(DefMI->dump());
826 LLVM_DEBUG(dbgs() << "Changing splat: ");
827 LLVM_DEBUG(MI->dump());
850 LLVM_DEBUG(dbgs() << " Into: ");
851 LLVM_DEBUG(MI->dump());
864 LLVM_DEBUG(dbgs() << "Changing XXPERMDI: ");
865 LLVM_DEBUG(MI->dump());
883 LLVM_DEBUG(dbgs() << " Into: ");
884 LLVM_DEBUG(MI->dump());
894 LLVM_DEBUG(dbgs() << "Changing SUBREG_TO_REG: ");
895 LLVM_DEBUG(MI->dump());
902 LLVM_DEBUG(dbgs() << " Into: ");
903 LLVM_DEBUG(MI->dump());
919 LLVM_DEBUG(std::prev(InsertPoint)->dump());
922 LLVM_DEBUG(std::prev(InsertPoint)->dump());
927 LLVM_DEBUG(std::prev(InsertPoint)->dump());
931 LLVM_DEBUG(std::prev(InsertPoint)->dump());
942 LLVM_DEBUG(dbgs() << "\n*** Removing swaps ***\n\n");
955 LLVM_DEBUG(dbgs() << format("Replaced %d with copy: ",
957 LLVM_DEBUG(MI->dump());
lib/Target/RISCV/Disassembler/RISCVDisassembler.cpp 332 LLVM_DEBUG(dbgs() << "Trying RISCV32 table :\n");
343 LLVM_DEBUG(
354 LLVM_DEBUG(dbgs() << "Trying RISCV_C table (16-bit Instruction):\n");
lib/Target/RISCV/RISCVISelDAGToDAG.cpp 101 LLVM_DEBUG(dbgs() << "== "; Node->dump(CurDAG); dbgs() << "\n");
268 LLVM_DEBUG(dbgs() << "Folding add-immediate into mem-op:\nBase: ");
269 LLVM_DEBUG(Base->dump(CurDAG));
270 LLVM_DEBUG(dbgs() << "\nN: ");
271 LLVM_DEBUG(N->dump(CurDAG));
272 LLVM_DEBUG(dbgs() << "\n");
lib/Target/RISCV/RISCVISelLowering.cpp 1637 LLVM_DEBUG(dbgs() << "InputArg #" << i << " has unhandled type "
1658 LLVM_DEBUG(dbgs() << "OutputArg #" << i << " has unhandled type "
lib/Target/RISCV/RISCVMergeBaseOffset.cpp 112 LLVM_DEBUG(dbgs() << " Merged offset " << Offset << " into base.\n"
163 LLVM_DEBUG(dbgs() << " Offset Instrs: " << OffsetTail
171 LLVM_DEBUG(dbgs() << " Offset Instr: " << OffsetTail);
187 LLVM_DEBUG(dbgs() << "Don't know how to get offset from this instr:"
193 LLVM_DEBUG(dbgs() << " Offset Instr: " << Tail);
265 LLVM_DEBUG(dbgs() << "MBB: " << MBB.getName() << "\n");
270 LLVM_DEBUG(dbgs() << " Found lowered global address with one use: "
lib/Target/SystemZ/SystemZHazardRecognizer.cpp 88 LLVM_DEBUG(CurGroupDbg = "";);
138 LLVM_DEBUG(dumpCurrGroup("Completed decode group"));
139 LLVM_DEBUG(CurGroupDbg = "";);
163 LLVM_DEBUG(dumpState(););
273 LLVM_DEBUG(dbgs() << "++ HazardRecognizer emitting "; dumpSU(SU, dbgs());
275 LLVM_DEBUG(dumpCurrGroup("Decode group before emission"););
282 LLVM_DEBUG(raw_string_ostream cgd(CurGroupDbg);
289 LLVM_DEBUG(dbgs() << "++ Clearing state after call.\n";);
311 LLVM_DEBUG(
322 LLVM_DEBUG(dbgs() << "++ Last FPd cycle index: " << LastFPdOpCycleIdx
454 LLVM_DEBUG(CurGroupDbg = Incoming->CurGroupDbg;);
lib/Target/SystemZ/SystemZISelDAGToDAG.cpp 600 LLVM_DEBUG(AM.dump(CurDAG));
1462 LLVM_DEBUG(errs() << "== "; Node->dump(CurDAG); errs() << "\n");
1906 LLVM_DEBUG(dbgs() << "SystemZ DAG preprocessing replacing:\nOld: ");
1907 LLVM_DEBUG(N->dump(CurDAG));
1908 LLVM_DEBUG(dbgs() << "\nNew: ");
1909 LLVM_DEBUG(Res.getNode()->dump(CurDAG));
1910 LLVM_DEBUG(dbgs() << "\n");
lib/Target/SystemZ/SystemZMachineScheduler.cpp 75 LLVM_DEBUG(HazardRec->dumpState(););
81 LLVM_DEBUG(dbgs() << "** Entering " << printMBBReference(*NextMBB));
88 LLVM_DEBUG(const MachineLoop *Loop = MLI->getLoopFor(MBB);
100 LLVM_DEBUG(dbgs() << "** Continued scheduling from "
104 LLVM_DEBUG(HazardRec->dumpState(););
110 LLVM_DEBUG(dbgs() << "** Emitting incoming branch: "; I->dump(););
121 LLVM_DEBUG(dbgs() << "** Leaving " << printMBBReference(*MBB) << "\n";);
167 LLVM_DEBUG(dbgs() << "** Only one: ";
173 LLVM_DEBUG(dbgs() << "** Available: "; Available.dump(*HazardRec););
184 LLVM_DEBUG(dbgs() << "** Best so far: ";);
186 LLVM_DEBUG(dbgs() << "** Tried : ";);
187 LLVM_DEBUG(HazardRec->dumpSU(c.SU, dbgs()); c.dumpCosts();
242 LLVM_DEBUG(dbgs() << "** Scheduling SU(" << SU->NodeNum << ") ";
lib/Target/WebAssembly/MCTargetDesc/WebAssemblyMCCodeEmitter.cpp 92 LLVM_DEBUG(dbgs() << "Encoding immediate: type="
lib/Target/WebAssembly/WebAssemblyAddMissingPrototypes.cpp 62 LLVM_DEBUG(dbgs() << "********** Add Missing Prototypes **********\n");
71 LLVM_DEBUG(dbgs() << "Found no-prototype function: " << F.getName()
93 LLVM_DEBUG(dbgs() << "prototype-less use: " << F.getName() << "\n");
94 LLVM_DEBUG(dbgs() << *U.getUser() << "\n");
101 LLVM_DEBUG(dbgs() << "found function type: " << *NewType << "\n");
106 LLVM_DEBUG(dbgs() << " " << *DestType << "\n");
107 LLVM_DEBUG(dbgs() << " "<< *NewType << "\n");
114 LLVM_DEBUG(
lib/Target/WebAssembly/WebAssemblyArgumentMove.cpp 70 LLVM_DEBUG({
lib/Target/WebAssembly/WebAssemblyAsmPrinter.cpp 64 LLVM_DEBUG(errs() << "Unknown type for register number: " << RegNo);
309 LLVM_DEBUG(dbgs() << "EmitInstruction: " << *MI << '\n');
lib/Target/WebAssembly/WebAssemblyCFGSort.cpp 407 LLVM_DEBUG(dbgs() << "********** CFG Sorting **********\n"
lib/Target/WebAssembly/WebAssemblyCFGStackify.cpp 1355 LLVM_DEBUG(dbgs() << "********** CFG Stackifying **********\n"
lib/Target/WebAssembly/WebAssemblyCallIndirectFixup.cpp 103 LLVM_DEBUG(dbgs() << "********** Fixing up CALL_INDIRECTs **********\n"
113 LLVM_DEBUG(dbgs() << "Found call_indirect: " << MI << '\n');
141 LLVM_DEBUG(dbgs() << " After transform: " << MI);
147 LLVM_DEBUG(dbgs() << "\nDone fixing up CALL_INDIRECTs\n\n");
lib/Target/WebAssembly/WebAssemblyExceptionInfo.cpp 35 LLVM_DEBUG(dbgs() << "********** Exception Info Calculation **********\n"
lib/Target/WebAssembly/WebAssemblyExplicitLocals.cpp 187 LLVM_DEBUG(dbgs() << "********** Make Locals Explicit **********\n"
lib/Target/WebAssembly/WebAssemblyFixFunctionBitcasts.cpp 156 LLVM_DEBUG(dbgs() << "createWrapper: struct param type in bitcast: "
160 LLVM_DEBUG(dbgs() << "createWrapper: arg type mismatch calling: "
162 LLVM_DEBUG(dbgs() << "Arg[" << Args.size() << "] Expected: "
185 LLVM_DEBUG(dbgs() << "Creating dummy return: " << *RtnType << "\n");
196 LLVM_DEBUG(dbgs() << "createWrapper: struct return type in bitcast: "
200 LLVM_DEBUG(dbgs() << "createWrapper: return type mismatch calling: "
202 LLVM_DEBUG(dbgs() << "Expected: " << *ExpectedRtnType
217 LLVM_DEBUG(dbgs() << "createWrapper: no wrapper needed: " << F->getName()
222 LLVM_DEBUG(dbgs() << "createWrapper: " << F->getName() << "\n");
238 LLVM_DEBUG(dbgs() << "********** Fix Function Bitcasts **********\n");
261 LLVM_DEBUG(dbgs() << "Found `main` function with incorrect type: "
lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp 484 LLVM_DEBUG(dbgs() << "********** Fixing Irreducible Control Flow **********\n"
lib/Target/WebAssembly/WebAssemblyISelDAGToDAG.cpp 51 LLVM_DEBUG(dbgs() << "********** ISelDAGToDAG **********\n"
82 LLVM_DEBUG(errs() << "== "; Node->dump(CurDAG); errs() << "\n");
lib/Target/WebAssembly/WebAssemblyLateEHPrepare.cpp 103 LLVM_DEBUG(dbgs() << "********** Late EH Prepare **********\n"
lib/Target/WebAssembly/WebAssemblyLowerBrUnless.cpp 57 LLVM_DEBUG(dbgs() << "********** Lowering br_unless **********\n"
lib/Target/WebAssembly/WebAssemblyLowerEmscriptenEHSjLj.cpp 625 LLVM_DEBUG(dbgs() << "********** Lower Emscripten EH & SjLj **********\n");
lib/Target/WebAssembly/WebAssemblyLowerGlobalDtors.cpp 61 LLVM_DEBUG(dbgs() << "********** Lower Global Destructors **********\n");
lib/Target/WebAssembly/WebAssemblyMemIntrinsicResults.cpp 120 LLVM_DEBUG(dbgs() << "Setting operand " << O << " in " << *Where << " from "
178 LLVM_DEBUG({
199 LLVM_DEBUG(dbgs() << "Basic Block: " << MBB.getName() << '\n');
lib/Target/WebAssembly/WebAssemblyOptimizeLiveIntervals.cpp 69 LLVM_DEBUG(dbgs() << "********** Optimize LiveIntervals **********\n"
lib/Target/WebAssembly/WebAssemblyOptimizeReturned.cpp 73 LLVM_DEBUG(dbgs() << "********** Optimize returned Attributes **********\n"
lib/Target/WebAssembly/WebAssemblyPeephole.cpp 133 LLVM_DEBUG({
lib/Target/WebAssembly/WebAssemblyPrepareForLiveIntervals.cpp 74 LLVM_DEBUG({
lib/Target/WebAssembly/WebAssemblyRegColoring.cpp 76 LLVM_DEBUG({
99 LLVM_DEBUG(dbgs() << "Interesting register intervals:\n");
111 LLVM_DEBUG(LI->dump());
114 LLVM_DEBUG(dbgs() << '\n');
130 LLVM_DEBUG(dbgs() << "Coloring register intervals:\n");
160 LLVM_DEBUG(dbgs() << "Assigning vreg" << Register::virtReg2Index(LI->reg)
lib/Target/WebAssembly/WebAssemblyRegNumbering.cpp 62 LLVM_DEBUG(dbgs() << "********** Register Numbering **********\n"
79 LLVM_DEBUG(dbgs() << "Arg VReg " << MI.getOperand(0).getReg()
98 LLVM_DEBUG(dbgs() << "VReg " << VReg << " -> WAReg "
104 LLVM_DEBUG(dbgs() << "VReg " << VReg << " -> WAReg " << CurReg << "\n");
lib/Target/WebAssembly/WebAssemblyRegStackify.cpp 488 LLVM_DEBUG(dbgs() << "Move for single use: "; Def->dump());
519 LLVM_DEBUG(dbgs() << " - Replaced register: "; Def->dump());
533 LLVM_DEBUG(dbgs() << "Rematerializing cheap def: "; Def.dump());
534 LLVM_DEBUG(dbgs() << " - for use in "; Op.getParent()->dump());
547 LLVM_DEBUG(dbgs() << " - Cloned to "; Clone->dump());
560 LLVM_DEBUG(dbgs() << " - Deleting original\n");
600 LLVM_DEBUG(dbgs() << "Move and tee for multi-use:"; Def->dump());
643 LLVM_DEBUG(dbgs() << " - Replaced register: "; Def->dump());
644 LLVM_DEBUG(dbgs() << " - Tee instruction: "; Tee->dump());
769 LLVM_DEBUG(dbgs() << "********** Register Stackifying **********\n"
lib/Target/WebAssembly/WebAssemblyReplacePhysRegs.cpp 64 LLVM_DEBUG({
lib/Target/WebAssembly/WebAssemblySetP2AlignOperands.cpp 78 LLVM_DEBUG({
lib/Target/X86/X86AvoidStoreForwardingBlocks.cpp 408 LLVM_DEBUG(NewLoad->dump());
432 LLVM_DEBUG(NewStore->dump());
682 LLVM_DEBUG(dbgs() << "Start X86AvoidStoreForwardBlocks\n";);
719 LLVM_DEBUG(dbgs() << "Blocked load and store instructions: \n");
720 LLVM_DEBUG(LoadInst->dump());
721 LLVM_DEBUG(StoreInst->dump());
722 LLVM_DEBUG(dbgs() << "Replaced with:\n");
734 LLVM_DEBUG(dbgs() << "End X86AvoidStoreForwardBlocks\n";);
lib/Target/X86/X86AvoidTrailingCall.cpp 94 LLVM_DEBUG({
lib/Target/X86/X86CmovConversion.cpp 163 LLVM_DEBUG(dbgs() << "********** " << getPassName() << " : " << MF.getName()
770 LLVM_DEBUG(dbgs() << "\tRewritten cmov: "; NewCMOV->dump());
778 LLVM_DEBUG(dbgs() << "\tRewritten load instr: "; NewMI->dump());
840 LLVM_DEBUG(dbgs() << "\tFrom: "; MIIt->dump());
841 LLVM_DEBUG(dbgs() << "\tTo: "; MIB->dump());
lib/Target/X86/X86CondBrFolding.cpp 163 LLVM_DEBUG(dbgs() << "Dead BB detected!\n");
380 LLVM_DEBUG(dbgs() << "After optimization:\nRootMBB is: " << *RootMBB << "\n");
382 LLVM_DEBUG(dbgs() << "PredMBB is: " << *(BranchPath[0]) << "\n");
389 LLVM_DEBUG(dbgs() << "***** X86CondBr Folding on Function: " << MF.getName()
402 LLVM_DEBUG(dbgs() << "Work on MBB." << MBB.getNumber()
409 LLVM_DEBUG(dbgs() << "Found one path (len=" << BranchPath.size() << "):\n");
411 LLVM_DEBUG(dbgs() << "Target MBB is: " << MBB << "\n");
415 LLVM_DEBUG(dbgs() << "Path MBB (" << Index << " of " << BranchPath.size()
417 LLVM_DEBUG(dbgs() << "CC=" << PMBBInfo->BranchCode
lib/Target/X86/X86DiscriminateMemOps.cpp 153 LLVM_DEBUG(dbgs() << "Unable to create a unique discriminator "
lib/Target/X86/X86DomainReassignment.cpp 726 LLVM_DEBUG(
728 LLVM_DEBUG(MF.print(dbgs()));
774 LLVM_DEBUG(C.dump(MRI));
784 LLVM_DEBUG(
786 LLVM_DEBUG(MF.print(dbgs()));
lib/Target/X86/X86FixupBWInsts.cpp 161 LLVM_DEBUG(dbgs() << "Start X86FixupBWInsts\n";);
167 LLVM_DEBUG(dbgs() << "End X86FixupBWInsts\n";);
lib/Target/X86/X86FixupLEAs.cpp 209 LLVM_DEBUG(dbgs() << "Start X86FixupLEAs\n";);
233 LLVM_DEBUG(dbgs() << "End X86FixupLEAs\n";);
469 LLVM_DEBUG(dbgs() << "FixLEA: Candidate to replace:"; MBI->dump(););
471 LLVM_DEBUG(dbgs() << "FixLEA: Replaced by: "; NewMI->dump(););
502 LLVM_DEBUG(dbgs() << "FixLEA: Candidate to replace:"; I->dump(););
503 LLVM_DEBUG(dbgs() << "FixLEA: Replaced by: ";);
511 LLVM_DEBUG(NewMI->dump(););
521 LLVM_DEBUG(NewMI->dump(););
567 LLVM_DEBUG(dbgs() << "FixLEA: Candidate to replace:"; MI.dump(););
568 LLVM_DEBUG(dbgs() << "FixLEA: Replaced by: ";);
605 LLVM_DEBUG(NewMI->dump(););
619 LLVM_DEBUG(NewMI->dump(););
625 LLVM_DEBUG(NewMI->dump(););
646 LLVM_DEBUG(MI.getPrevNode()->dump(););
652 LLVM_DEBUG(NewMI->dump(););
665 LLVM_DEBUG(NewMI->dump(););
671 LLVM_DEBUG(NewMI->dump(););
lib/Target/X86/X86FlagsCopyLowering.cpp 338 LLVM_DEBUG(dbgs() << "********** " << getPassName() << " : " << MF.getName()
386 LLVM_DEBUG(
412 LLVM_DEBUG(dbgs() << "Rewriting copy: "; CopyI->dump());
486 LLVM_DEBUG({
568 LLVM_DEBUG(dbgs() << " Rewriting use: "; MI.dump());
661 LLVM_DEBUG({
705 LLVM_DEBUG(dbgs() << "ERROR: Found a COPY involving EFLAGS: ";
747 LLVM_DEBUG(dbgs() << " save cond: "; SetI->dump());
772 LLVM_DEBUG(dbgs() << " test cond: "; TestI->dump());
824 LLVM_DEBUG(dbgs() << " add cond: "; AddI->dump());
852 LLVM_DEBUG(dbgs() << " fixed cmov: "; CMovI.dump());
874 LLVM_DEBUG(dbgs() << " fixed jCC: "; JmpI.dump());
lib/Target/X86/X86FloatingPoint.cpp 443 LLVM_DEBUG(dbgs() << "\nFPInst:\t" << MI);
473 LLVM_DEBUG(dbgs() << "Register FP#" << Reg - X86::FP0 << " is dead!\n");
479 LLVM_DEBUG({
508 LLVM_DEBUG(dbgs() << "\nSetting up live-ins for " << printMBBReference(*MBB)
516 LLVM_DEBUG(dbgs() << "Block has no FP live-ins.\n");
525 LLVM_DEBUG(dbgs() << "Live-in st(" << (i - 1) << "): %fp"
535 LLVM_DEBUG(MBB->dump());
547 LLVM_DEBUG(dbgs() << "Setting up live-outs for " << printMBBReference(*MBB)
560 LLVM_DEBUG(dbgs() << "No live-outs.\n");
565 LLVM_DEBUG(dbgs() << "LB#" << BundleIdx << ": ");
567 LLVM_DEBUG(dbgs() << "Shuffling stack to match.\n");
571 LLVM_DEBUG(dbgs() << "Fixing stack order now.\n");
903 LLVM_DEBUG(dbgs() << "Renaming %fp" << KReg << " as imp %fp" << DReg
918 LLVM_DEBUG(dbgs() << "Popping %fp" << KReg << "\n");
927 LLVM_DEBUG(dbgs() << "Killing %fp" << KReg << "\n");
935 LLVM_DEBUG(dbgs() << "Defining %fp" << DReg << " as 0\n");
942 LLVM_DEBUG(dumpStack());
965 LLVM_DEBUG(dumpStack());
1479 LLVM_DEBUG(dbgs() << "Emitting LD_F0 for implicit FP" << Reg << '\n');
1585 LLVM_DEBUG(dbgs() << "Asm uses " << NumSTUses << " fixed regs, pops "
1625 LLVM_DEBUG({
1676 LLVM_DEBUG(dbgs() << "Inserting dummy KILL\n");
lib/Target/X86/X86ISelDAGToDAG.cpp 1848 LLVM_DEBUG({
4355 LLVM_DEBUG(dbgs() << "== "; Node->dump(CurDAG); dbgs() << '\n');
4776 LLVM_DEBUG(dbgs() << "=> "; ResLo.getNode()->dump(CurDAG);
4786 LLVM_DEBUG(dbgs() << "=> "; ResHi.getNode()->dump(CurDAG);
4946 LLVM_DEBUG(dbgs() << "=> "; Result.getNode()->dump(CurDAG);
4955 LLVM_DEBUG(dbgs() << "=> "; Result.getNode()->dump(CurDAG);
4964 LLVM_DEBUG(dbgs() << "=> "; Result.getNode()->dump(CurDAG);
lib/Target/X86/X86InstrInfo.cpp 3044 LLVM_DEBUG(dbgs() << "Cannot copy " << RI.getName(SrcReg) << " to "
4650 LLVM_DEBUG(
lib/Target/X86/X86InstructionSelector.cpp 298 LLVM_DEBUG(dbgs() << "Failed to constrain " << TII.getName(I.getOpcode())
334 LLVM_DEBUG(dbgs() << " C++ instruction selection: "; I.print(dbgs()));
519 LLVM_DEBUG(dbgs() << "Atomic ordering not supported yet\n");
523 LLVM_DEBUG(dbgs() << "Unaligned atomics not supported yet\n");
696 LLVM_DEBUG(dbgs() << "Failed to constrain " << TII.getName(I.getOpcode())
721 LLVM_DEBUG(dbgs() << TII.getName(I.getOpcode())
759 LLVM_DEBUG(dbgs() << "Failed to constrain " << TII.getName(I.getOpcode())
813 LLVM_DEBUG(dbgs() << "Failed to constrain " << TII.getName(I.getOpcode())
915 LLVM_DEBUG(dbgs() << "Failed to constrain " << TII.getName(I.getOpcode())
1222 LLVM_DEBUG(dbgs() << "Failed to constrain EXTRACT_SUBREG\n");
1259 LLVM_DEBUG(dbgs() << "Failed to constrain INSERT_SUBREG\n");
1502 LLVM_DEBUG(dbgs() << "Failed to constrain " << TII.getName(I.getOpcode())
1637 LLVM_DEBUG(dbgs() << "Failed to constrain " << TII.getName(I.getOpcode())
lib/Target/X86/X86OptimizeLEAs.cpp 549 LLVM_DEBUG(dbgs() << "OptimizeLEAs: Candidate to replace: "; MI.dump(););
561 LLVM_DEBUG(dbgs() << "OptimizeLEAs: Replaced by: "; MI.dump(););
654 LLVM_DEBUG(dbgs() << "OptimizeLEAs: Remove redundant LEA: ";
lib/Target/X86/X86RetpolineThunks.cpp 93 LLVM_DEBUG(dbgs() << getPassName() << '\n');
lib/Target/X86/X86SpeculativeLoadHardening.cpp 314 LLVM_DEBUG(dbgs() << " Split edge from '" << MBB.getName() << "' to '"
399 LLVM_DEBUG(dbgs() << "********** " << getPassName() << " : " << MF.getName()
554 LLVM_DEBUG(dbgs() << "Final speculative load hardened function:\n"; MF.dump();
671 LLVM_DEBUG(dbgs() << "WARNING: unable to secure successors of block:\n";
703 LLVM_DEBUG(dbgs() << "Tracing predicate through block: " << MBB.getName()
767 LLVM_DEBUG(dbgs() << " Inserting cmov: "; CMovI->dump();
866 LLVM_DEBUG(
905 LLVM_DEBUG(dbgs()
924 LLVM_DEBUG({
1026 LLVM_DEBUG({
1091 LLVM_DEBUG({
1114 LLVM_DEBUG(dbgs() << " Inserting mov: "; AddrI->dump();
1126 LLVM_DEBUG(dbgs() << " Inserting lea: "; AddrI->dump();
1153 LLVM_DEBUG(dbgs() << " Inserting cmp: "; CheckI->dump(); dbgs() << "\n");
1166 LLVM_DEBUG(dbgs() << " Inserting lea: "; AddrI->dump(); dbgs() << "\n");
1172 LLVM_DEBUG(dbgs() << " Inserting cmp: "; CheckI->dump(); dbgs() << "\n");
1186 LLVM_DEBUG(dbgs() << " Inserting cmov: "; CMovI->dump(); dbgs() << "\n");
1350 LLVM_DEBUG(dbgs() << " Unable to harden post-load due to EFLAGS: ";
1519 LLVM_DEBUG(dbgs() << " Unable to harden post-load due to EFLAGS: ";
1704 LLVM_DEBUG(dbgs()
1961 LLVM_DEBUG(
1970 LLVM_DEBUG(
1982 LLVM_DEBUG(
2054 LLVM_DEBUG(dbgs() << " Inserting mov: "; MovI->dump(); dbgs() << "\n");
2065 LLVM_DEBUG(dbgs() << " Inserting broadcast: "; BroadcastI->dump();
2076 LLVM_DEBUG(dbgs() << " Inserting or: "; OrI->dump(); dbgs() << "\n");
2096 LLVM_DEBUG(dbgs() << " Inserting broadcast: "; BroadcastI->dump();
2107 LLVM_DEBUG(dbgs() << " Inserting or: "; OrI->dump(); dbgs() << "\n");
2120 LLVM_DEBUG(dbgs() << " Inserting or: "; OrI->dump(); dbgs() << "\n");
2130 LLVM_DEBUG(dbgs() << " Inserting shrx: "; ShiftI->dump();
2313 LLVM_DEBUG(dbgs() << " Inserting or: "; OrI->dump(); dbgs() << "\n");
2567 LLVM_DEBUG(dbgs() << " Inserting cmov: "; CMovI->dump(); dbgs() << "\n");
lib/Target/X86/X86Subtarget.cpp 281 LLVM_DEBUG(dbgs() << "Subtarget features: SSELevel " << X86SSELevel
lib/Target/X86/X86VZeroUpper.cpp 266 LLVM_DEBUG(dbgs() << "MBB #" << MBB.getNumber() << " exit state: "
341 LLVM_DEBUG(dbgs() << "MBB #" << MBB.getNumber()
lib/Target/X86/X86WinEHState.cpp 694 LLVM_DEBUG(dbgs() << "X86WinEHState: " << BB->getName()
696 LLVM_DEBUG(dbgs() << "X86WinEHState: " << BB->getName()
742 LLVM_DEBUG(dbgs() << "X86WinEHState: " << BB->getName()
lib/Target/XCore/XCoreRegisterInfo.cpp 276 LLVM_DEBUG(errs() << "\nFunction : " << MF.getName() << "\n");
277 LLVM_DEBUG(errs() << "<--------->\n");
278 LLVM_DEBUG(MI.print(errs()));
279 LLVM_DEBUG(errs() << "FrameIndex : " << FrameIndex << "\n");
280 LLVM_DEBUG(errs() << "FrameOffset : " << Offset << "\n");
281 LLVM_DEBUG(errs() << "StackSize : " << StackSize << "\n");
300 LLVM_DEBUG(errs() << "Offset : " << Offset << "\n"
lib/Transforms/AggressiveInstCombine/AggressiveInstCombine.cpp 305 LLVM_DEBUG(dbgs() << "Recognized popcount intrinsic\n");
lib/Transforms/AggressiveInstCombine/TruncInstCombine.cpp 407 LLVM_DEBUG(
lib/Transforms/Coroutines/CoroFrame.cpp 110 LLVM_DEBUG(dbgs() << UseBB->getName() << " => " << DefBB->getName()
219 LLVM_DEBUG(dbgs() << "iteration " << ++Iteration);
220 LLVM_DEBUG(dbgs() << "==============\n");
264 LLVM_DEBUG(dbgs() << "\nblock " << I << " follower " << SI->getName()
266 LLVM_DEBUG(dump("S.Kills", S.Kills));
267 LLVM_DEBUG(dump("SavedKills", SavedKills));
270 LLVM_DEBUG(dbgs() << "\nblock " << I << " follower " << SI << "\n");
271 LLVM_DEBUG(dump("S.Consume", S.Consumes));
272 LLVM_DEBUG(dump("SavedCons", SavedConsumes));
277 LLVM_DEBUG(dump());
534 LLVM_DEBUG(
1374 LLVM_DEBUG(dump("Materializations", Spills));
1433 LLVM_DEBUG(dump("Spills", Spills));
lib/Transforms/Coroutines/CoroSplit.cpp 1564 LLVM_DEBUG(dbgs() << "CoroSplit: Processing coroutine '" << F->getName()
lib/Transforms/IPO/ArgumentPromotion.cpp 226 LLVM_DEBUG(dbgs() << "ARG PROMOTION: Promoting to:" << *NF << "\n"
435 LLVM_DEBUG(dbgs() << "*** Promoted load of argument '" << I->getName()
462 LLVM_DEBUG(dbgs() << "*** Promoted agg argument '" << TheArg->getName()
726 LLVM_DEBUG(dbgs() << "argpromotion not promoting argument '"
959 LLVM_DEBUG(dbgs() << "argpromotion disable promoting argument '"
lib/Transforms/IPO/Attributor.cpp 320 LLVM_DEBUG(dbgs() << "[Attributor] Update: " << *this << "\n");
324 LLVM_DEBUG(dbgs() << "[Attributor] Update " << HasChanged << " " << *this
536 LLVM_DEBUG(dbgs() << "[Attributor] Clamp return value states for "
555 LLVM_DEBUG(dbgs() << "[Attributor] RV: " << RV << " AA: " << AA.getAsStr()
562 LLVM_DEBUG(dbgs() << "[Attributor] AA State: " << AAS << " RV State: " << T
610 LLVM_DEBUG(dbgs() << "[Attributor] Clamp call site argument states for "
633 LLVM_DEBUG(dbgs() << "[Attributor] ACS: " << *ACS.getInstruction()
640 LLVM_DEBUG(dbgs() << "[Attributor] AA State: " << AAS << " CSA State: " << T
1098 LLVM_DEBUG({
1130 LLVM_DEBUG(dbgs() << "[AAReturnedValues] Returned value: " << *It.first
1137 LLVM_DEBUG(dbgs() << "[AAReturnedValues] Unresolved call: " << *CB
1146 LLVM_DEBUG(dbgs() << "[AAReturnedValues] Found another AAReturnedValues: "
1153 LLVM_DEBUG(dbgs() << "[AAReturnedValues] Unresolved call: " << *CB
1177 LLVM_DEBUG(dbgs() << "[AAReturnedValues] transitively returned value "
1191 LLVM_DEBUG(dbgs() << "[AAReturnedValues] Skip call as it has not "
1225 LLVM_DEBUG(dbgs() << "[AAReturnedValues] Add new returned value "
1981 LLVM_DEBUG(dbgs() << "[Attributor][AANoAliasCSArg] " << V
1990 LLVM_DEBUG(
2009 LLVM_DEBUG(dbgs()
2174 LLVM_DEBUG(dbgs()
2407 LLVM_DEBUG(dbgs() << "[AAIsDead] AssumedLiveBlocks: "
3059 LLVM_DEBUG(dbgs() << "Check use: " << *U->get() << " in " << *UInst
3065 LLVM_DEBUG(dbgs() << " - too many uses to explore!\n");
3072 LLVM_DEBUG(dbgs() << " - ptr2int assume the worst!\n");
3123 LLVM_DEBUG(dbgs() << " - captures [Mem " << CapturedInMem << "|Int "
3357 LLVM_DEBUG(dbgs() << "[Attributor][ValueSimplify] " << QueryingValue
3377 LLVM_DEBUG(dbgs() << "[Attributor][ValueSimplify] " << V << " -> " << *C
3470 LLVM_DEBUG(
3564 LLVM_DEBUG(dbgs() << "H2S: Removing free call: " << *FreeCall << "\n");
3569 LLVM_DEBUG(dbgs() << "H2S: Removing malloc call: " << *MallocCall
3653 LLVM_DEBUG(dbgs() << "[H2S] escaping store to memory: " << *UserI << "\n");
3688 LLVM_DEBUG(dbgs() << "[H2S] Bad user: " << *UserI << "\n");
3701 LLVM_DEBUG(dbgs() << "[H2S] Unknown user: " << *UserI << "\n");
4109 LLVM_DEBUG(dbgs() << "[AAMemoryBehavior] Use: " << **U << " in " << *UserI
4252 LLVM_DEBUG(dbgs() << "[Attributor] No function associated with " << IRP
4265 LLVM_DEBUG(
4275 LLVM_DEBUG(dbgs() << "[Attributor] Function "
4303 LLVM_DEBUG(dbgs() << "[Attributor] User " << EffectiveUse->getUser()
4312 LLVM_DEBUG(dbgs() << "[Attributor] Call site callback failed for "
4448 LLVM_DEBUG(dbgs() << "[Attributor] Identified and initialized "
4466 LLVM_DEBUG(dbgs() << "\n\n[Attributor] #Iteration: " << IterationCounter
4472 LLVM_DEBUG(
4487 LLVM_DEBUG(dbgs() << "[Attributor] #Iteration: " << IterationCounter
4518 LLVM_DEBUG(dbgs() << "\n[Attributor] Fixpoint iteration done after: "
4546 LLVM_DEBUG({
4585 LLVM_DEBUG(dbgs() << "\n[Attributor] Manifested " << NumManifested
4599 LLVM_DEBUG(dbgs() << "\n[Attributor] Delete at least "
4925 LLVM_DEBUG(dbgs() << "[Attributor] Run on module with " << M.size()
lib/Transforms/IPO/BlockExtractor.cpp 200 LLVM_DEBUG(dbgs() << "BlockExtractor: Extracting "
212 LLVM_DEBUG(dbgs() << "Extracted group '" << (*BBs.begin())->getName()
215 LLVM_DEBUG(dbgs() << "Failed to extract for group '"
222 LLVM_DEBUG(dbgs() << "BlockExtractor: Trying to delete " << F->getName()
lib/Transforms/IPO/ConstantMerge.cpp 118 LLVM_DEBUG(dbgs() << "Replacing global: @" << Old->getName() << " -> @"
192 LLVM_DEBUG(dbgs() << "Cmap[" << *Init << "] = " << GV->getName()
227 LLVM_DEBUG(dbgs() << "Will replace: @" << GV->getName() << " -> @"
lib/Transforms/IPO/DeadArgumentElimination.cpp 535 LLVM_DEBUG(dbgs() << "DeadArgumentEliminationPass - " << F.getName()
544 LLVM_DEBUG(
613 LLVM_DEBUG(dbgs() << "DeadArgumentEliminationPass - " << F.getName()
621 LLVM_DEBUG(dbgs() << "DeadArgumentEliminationPass - Inspecting args for fn: "
681 LLVM_DEBUG(dbgs() << "DeadArgumentEliminationPass - Intrinsically live fn: "
703 LLVM_DEBUG(dbgs() << "DeadArgumentEliminationPass - Marking "
762 LLVM_DEBUG(dbgs() << "DeadArgumentEliminationPass - Removing argument "
807 LLVM_DEBUG(
1092 LLVM_DEBUG(dbgs() << "DeadArgumentEliminationPass - Deleting dead varargs\n");
1103 LLVM_DEBUG(dbgs() << "DeadArgumentEliminationPass - Determining liveness\n");
lib/Transforms/IPO/ForceFunctionAttrs.cpp 79 LLVM_DEBUG(dbgs() << "ForcedAttribute: " << KV.second
lib/Transforms/IPO/FunctionAttrs.cpp 1066 LLVM_DEBUG(dbgs() << "Eagerly marking " << F->getName()
1086 LLVM_DEBUG(dbgs() << "SCC marking " << F->getName() << " as nonnull\n");
1291 LLVM_DEBUG(dbgs() << "Removing convergent attr from fn " << F.getName()
1312 LLVM_DEBUG(dbgs()
1335 LLVM_DEBUG(dbgs()
lib/Transforms/IPO/FunctionImport.cpp 151 LLVM_DEBUG(dbgs() << "Loading '" << FileName << "'\n");
288 LLVM_DEBUG(
293 LLVM_DEBUG(dbgs() << " ref -> " << VI << "\n");
359 LLVM_DEBUG(dbgs() << " edge -> " << VI << " Threshold:" << Threshold
363 LLVM_DEBUG(dbgs() << "ignored! import-cutoff value of " << ImportCutoff
373 LLVM_DEBUG(dbgs() << "ignored! Target already in destination module.\n");
410 LLVM_DEBUG(
422 LLVM_DEBUG(
456 LLVM_DEBUG(
543 LLVM_DEBUG(dbgs() << "Ignores Dead GUID: " << VI << "\n");
551 LLVM_DEBUG(dbgs() << "Initialize import for " << VI << "\n");
626 LLVM_DEBUG(dbgs() << "Computing import for Module '"
650 LLVM_DEBUG(dbgs() << "Import/Export lists for " << ImportLists.size()
656 LLVM_DEBUG(dbgs() << "* Module " << ModName << " exports "
663 LLVM_DEBUG(dbgs() << " - " << Src.second.size() - NumGVSPerMod
665 LLVM_DEBUG(dbgs() << " - " << NumGVSPerMod
676 LLVM_DEBUG(dbgs() << "* Module " << ModulePath << " imports from "
681 LLVM_DEBUG(dbgs() << " - " << Src.second.size() - NumGVSPerMod
683 LLVM_DEBUG(dbgs() << " - " << NumGVSPerMod << " vars imported from "
699 LLVM_DEBUG(dbgs() << "Computing import for Module '" << ModulePath << "'\n");
759 LLVM_DEBUG(dbgs() << "Live root: " << VI << "\n");
842 LLVM_DEBUG(dbgs() << LiveSymbols << " symbols Live, and " << DeadSymbols
911 LLVM_DEBUG(dbgs() << "Converting to a declaration: `" << GV.getName()
986 LLVM_DEBUG(dbgs() << "ODR fixing up linkage for `" << GV.getName()
1078 LLVM_DEBUG(dbgs() << "Starting import for Module "
1112 LLVM_DEBUG(dbgs() << (Import ? "Is" : "Not") << " importing function "
1134 LLVM_DEBUG(dbgs() << (Import ? "Is" : "Not") << " importing global "
1148 LLVM_DEBUG(dbgs() << (Import ? "Is" : "Not") << " importing alias "
1159 LLVM_DEBUG(dbgs() << "Is importing aliasee fn " << Base->getGUID()
1202 LLVM_DEBUG(dbgs() << "Imported " << ImportedCount - ImportedGVCount
1205 LLVM_DEBUG(dbgs() << "Imported " << ImportedGVCount
lib/Transforms/IPO/GlobalDCE.cpp 133 LLVM_DEBUG(dbgs() << "Ignoring dep " << GVU->getName() << " -> "
160 LLVM_DEBUG(dbgs() << "Building type info -> vtable map\n");
196 LLVM_DEBUG(dbgs() << GV.getName() << " is safe for VFE\n");
213 LLVM_DEBUG(dbgs() << "can't find pointer in vtable!\n");
220 LLVM_DEBUG(dbgs() << "vtable entry is not function pointer!\n");
225 LLVM_DEBUG(dbgs() << "vfunc dep " << Caller->getName() << " -> "
232 LLVM_DEBUG(dbgs() << "Scanning type.checked.load intrinsics\n");
271 LLVM_DEBUG(
lib/Transforms/IPO/GlobalOpt.cpp 546 LLVM_DEBUG(dbgs() << "PERFORMING GLOBAL SRA ON: " << *GV << "\n");
789 LLVM_DEBUG(dbgs() << "OPTIMIZED LOADS FROM STORED ONCE POINTER: " << *GV
804 LLVM_DEBUG(dbgs() << " *** GLOBAL NOW DEAD!\n");
840 LLVM_DEBUG(errs() << "PROMOTING GLOBAL: " << *GV << " CALL = " << *CI
1279 LLVM_DEBUG(dbgs() << "SROA HEAP ALLOC: " << *GV << " MALLOC = " << *CI
1625 LLVM_DEBUG(dbgs() << " *** SHRINKING TO BOOL: " << *GV << "\n");
1779 LLVM_DEBUG(dbgs() << "GLOBAL DEAD: " << GV << "\n");
1946 LLVM_DEBUG(dbgs() << "LOCALIZING GLOBAL: " << *GV << "\n");
1967 LLVM_DEBUG(dbgs() << "GLOBAL NEVER LOADED: " << *GV << "\n");
1990 LLVM_DEBUG(dbgs() << "MARKING CONSTANT: " << *GV << "\n");
2003 LLVM_DEBUG(dbgs() << " *** Marking constant allowed us to simplify "
2032 LLVM_DEBUG(dbgs() << " *** Substituting initializer allowed us to "
2582 LLVM_DEBUG(dbgs() << "FULLY EVALUATED GLOBAL CTOR FUNCTION '"
lib/Transforms/IPO/HotColdSplitting.cpp 236 LLVM_DEBUG(dbgs() << "Applying penalty for splitting: " << Penalty << "\n");
245 LLVM_DEBUG(dbgs() << "Applying penalty for: " << NumInputs << " inputs\n");
251 LLVM_DEBUG(dbgs() << "Applying penalty for: " << NumOutputs << " outputs\n");
277 LLVM_DEBUG(dbgs() << "Applying bonus for: " << Region.size()
285 LLVM_DEBUG(dbgs() << "Applying penalty for: " << SuccsOutsideRegion.size()
312 LLVM_DEBUG(dbgs() << "Split profitability: benefit = " << OutliningBenefit
331 LLVM_DEBUG(llvm::dbgs() << "Outlined Region: " << *OutF);
570 LLVM_DEBUG({
586 LLVM_DEBUG(dbgs() << "Entire function is cold\n");
618 LLVM_DEBUG({
657 LLVM_DEBUG(llvm::dbgs() << "Skipping " << F.getName() << "\n");
661 LLVM_DEBUG(llvm::dbgs() << "Outlining in " << F.getName() << "\n");
lib/Transforms/IPO/Inliner.cpp 219 LLVM_DEBUG(dbgs() << " ***MERGED ALLOCA: " << *AI
429 LLVM_DEBUG(dbgs() << " Inlining " << inlineCostStr(IC)
435 LLVM_DEBUG(dbgs() << " NOT Inlining " << inlineCostStr(IC)
447 LLVM_DEBUG(dbgs() << " NOT Inlining " << inlineCostStr(IC)
459 LLVM_DEBUG(dbgs() << " NOT Inlining: " << *CS.getInstruction()
475 LLVM_DEBUG(dbgs() << " Inlining " << inlineCostStr(IC)
537 LLVM_DEBUG(dbgs() << "Inliner visiting SCC:");
542 LLVM_DEBUG(dbgs() << " " << (F ? F->getName() : "INDIRECTNODE"));
592 LLVM_DEBUG(dbgs() << ": " << CallSites.size() << " call sites.\n");
673 LLVM_DEBUG(dbgs() << " -> Deleting dead call: " << *Instr << "\n");
726 LLVM_DEBUG(dbgs() << " -> Deleting dead function: "
986 LLVM_DEBUG(dbgs() << "Inlining calls in: " << F.getName() << "\n");
1044 LLVM_DEBUG(dbgs() << "Skipping inlining internal SCC edge from a node "
1168 LLVM_DEBUG(dbgs() << "Updated inlining SCC: " << *C << "\n");
1195 LLVM_DEBUG(dbgs() << "Inlined an internal call edge and split an SCC, "
lib/Transforms/IPO/Internalize.cpp 191 LLVM_DEBUG(dbgs() << "Internalizing func " << I.getName() << "\n");
220 LLVM_DEBUG(dbgs() << "Internalized gvar " << GV.getName() << "\n");
230 LLVM_DEBUG(dbgs() << "Internalized alias " << GA.getName() << "\n");
lib/Transforms/IPO/LowerTypeTests.cpp 1115 LLVM_DEBUG({
lib/Transforms/IPO/MergeFunctions.cpp 420 LLVM_DEBUG(doSanityCheck(Worklist));
422 LLVM_DEBUG(dbgs() << "size of module: " << M.size() << '\n');
423 LLVM_DEBUG(dbgs() << "size of worklist: " << Worklist.size() << '\n');
434 LLVM_DEBUG(dbgs() << "size of FnTree: " << FnTree.size() << '\n');
512 LLVM_DEBUG(
518 LLVM_DEBUG(dbgs() << " Deleting Instruction: ");
519 LLVM_DEBUG(I->print(dbgs()));
520 LLVM_DEBUG(dbgs() << "\n");
524 LLVM_DEBUG(dbgs() << " } // Done erasing instructions unrelated to parameter "
558 LLVM_DEBUG(dbgs() << " Deciding: ");
559 LLVM_DEBUG(BI->print(dbgs()));
560 LLVM_DEBUG(dbgs() << "\n");
563 LLVM_DEBUG(dbgs() << " Include (parameter): ");
564 LLVM_DEBUG(BI->print(dbgs()));
565 LLVM_DEBUG(dbgs() << "\n");
568 LLVM_DEBUG(dbgs() << " Delete (!parameter): ");
569 LLVM_DEBUG(BI->print(dbgs()));
570 LLVM_DEBUG(dbgs() << "\n");
573 LLVM_DEBUG(dbgs() << " Deciding: ");
574 LLVM_DEBUG(BI->print(dbgs()));
575 LLVM_DEBUG(dbgs() << "\n");
578 LLVM_DEBUG(dbgs() << " Parameter: ");
579 LLVM_DEBUG(DILocVar->print(dbgs()));
582 LLVM_DEBUG(dbgs() << " Processing alloca users: ");
583 LLVM_DEBUG(dbgs() << "\n");
588 LLVM_DEBUG(dbgs() << " Include: ");
589 LLVM_DEBUG(AI->print(dbgs()));
590 LLVM_DEBUG(dbgs() << "\n");
592 LLVM_DEBUG(dbgs() << " Include (parameter): ");
593 LLVM_DEBUG(SI->print(dbgs()));
594 LLVM_DEBUG(dbgs() << "\n");
596 LLVM_DEBUG(dbgs() << " Include: ");
597 LLVM_DEBUG(BI->print(dbgs()));
598 LLVM_DEBUG(dbgs() << "\n");
601 LLVM_DEBUG(dbgs() << " Delete (!parameter): ");
602 LLVM_DEBUG(SI->print(dbgs()));
603 LLVM_DEBUG(dbgs() << "\n");
607 LLVM_DEBUG(dbgs() << " Defer: ");
608 LLVM_DEBUG(U->print(dbgs()));
609 LLVM_DEBUG(dbgs() << "\n");
613 LLVM_DEBUG(dbgs() << " Delete (alloca NULL): ");
614 LLVM_DEBUG(BI->print(dbgs()));
615 LLVM_DEBUG(dbgs() << "\n");
618 LLVM_DEBUG(dbgs() << " Delete (!parameter): ");
619 LLVM_DEBUG(BI->print(dbgs()));
620 LLVM_DEBUG(dbgs() << "\n");
623 LLVM_DEBUG(dbgs() << " Will Include Terminator: ");
624 LLVM_DEBUG(BI->print(dbgs()));
625 LLVM_DEBUG(dbgs() << "\n");
628 LLVM_DEBUG(dbgs() << " Defer: ");
629 LLVM_DEBUG(BI->print(dbgs()));
630 LLVM_DEBUG(dbgs() << "\n");
633 LLVM_DEBUG(
641 LLVM_DEBUG(dbgs() << " !PDIRelated: ");
642 LLVM_DEBUG(I->print(dbgs()));
643 LLVM_DEBUG(dbgs() << "\n");
646 LLVM_DEBUG(dbgs() << " PDIRelated: ");
647 LLVM_DEBUG(I->print(dbgs()));
648 LLVM_DEBUG(dbgs() << "\n");
651 LLVM_DEBUG(dbgs() << " }\n");
663 LLVM_DEBUG(dbgs() << "canCreateThunkFor: " << F->getName()
685 LLVM_DEBUG(dbgs() << "writeThunk: (MergeFunctionsPDI) Do not create a new "
689 LLVM_DEBUG(
732 LLVM_DEBUG(
738 LLVM_DEBUG(
749 LLVM_DEBUG(dbgs() << "writeThunk: " << H->getName() << '\n');
781 LLVM_DEBUG(dbgs() << "writeAlias: " << GA->getName() << '\n');
909 LLVM_DEBUG(dbgs() << "Inserting as unique: " << NewFunction->getName()
924 LLVM_DEBUG(dbgs() << " " << OldF.getFunc()->getName()
937 LLVM_DEBUG(dbgs() << "Deferred " << F->getName() << ".\n");
lib/Transforms/IPO/SampleProfile.cpp 704 LLVM_DEBUG(dbgs() << " " << DLoc.getLine() << "."
742 LLVM_DEBUG(dbgs() << "Block weights\n");
750 LLVM_DEBUG(printBlockWeight(dbgs(), &BB));
980 LLVM_DEBUG(dbgs()
1085 LLVM_DEBUG(dbgs() << "\nBlock equivalence classes\n");
1092 LLVM_DEBUG(printBlockEquivalence(dbgs(), BB1));
1113 LLVM_DEBUG(printBlockEquivalence(dbgs(), BB1));
1122 LLVM_DEBUG(
1129 LLVM_DEBUG(printBlockWeight(dbgs(), BB));
1170 LLVM_DEBUG(dbgs() << "\nPropagation through edges\n");
1242 LLVM_DEBUG(dbgs() << "All edge weights for " << BB->getName()
1271 LLVM_DEBUG(dbgs() << "Set weight for edge: ";
1298 LLVM_DEBUG(dbgs() << "Set self-referential edge weight to: ";
1417 LLVM_DEBUG(dbgs() << "\nPropagation complete. Setting branch weights\n");
1463 LLVM_DEBUG(dbgs() << "\nGetting weights for branch at line "
1474 LLVM_DEBUG(dbgs() << "\t"; printEdgeWeight(dbgs(), E));
1479 LLVM_DEBUG(dbgs() << " (saturated due to uint32_t overflow)");
1502 LLVM_DEBUG(dbgs() << "SUCCESS. Found non-zero weights.\n");
1511 LLVM_DEBUG(dbgs() << "SKIPPED. All branch weights are zero.\n");
1608 LLVM_DEBUG(dbgs() << "Line number for the first instruction in "
lib/Transforms/InstCombine/InstCombineCalls.cpp 4307 LLVM_DEBUG(dbgs() << "Removing convergent attr from instr " << Call
lib/Transforms/InstCombine/InstCombineCasts.cpp 700 LLVM_DEBUG(
1109 LLVM_DEBUG(
1381 LLVM_DEBUG(
lib/Transforms/InstCombine/InstCombineInternal.h 673 LLVM_DEBUG(dbgs() << "IC: Replacing " << I << "\n"
706 LLVM_DEBUG(dbgs() << "IC: ERASE " << I << '\n');
lib/Transforms/InstCombine/InstCombineLoadStoreAlloca.cpp 272 LLVM_DEBUG(dbgs() << "Found pointer user: " << *U << '\n');
408 LLVM_DEBUG(dbgs() << "Found alloca equal to global: " << AI << '\n');
409 LLVM_DEBUG(dbgs() << " memcpy = " << *Copy << '\n');
lib/Transforms/InstCombine/InstCombinePHI.cpp 1025 LLVM_DEBUG(dbgs() << "SLICING UP PHI: " << FirstPhi << '\n';
1108 LLVM_DEBUG(dbgs() << " Made element PHI for offset " << Offset << ": "
lib/Transforms/InstCombine/InstCombineShifts.cpp 614 LLVM_DEBUG(
lib/Transforms/InstCombine/InstructionCombining.cpp 3189 LLVM_DEBUG(dbgs() << "SINK: " << *DII << '\n');
3213 LLVM_DEBUG(dbgs() << "IC: DCE: " << *I << '\n');
3227 LLVM_DEBUG(dbgs() << "IC: ConstFold to: " << *C << " from: " << *I
3247 LLVM_DEBUG(dbgs() << "IC: ConstFold (all bits known) to: " << *C
3287 LLVM_DEBUG(dbgs() << "IC: Sink: " << *I << '\n');
3307 LLVM_DEBUG(raw_string_ostream SS(OrigI); I->print(SS); OrigI = SS.str(););
3308 LLVM_DEBUG(dbgs() << "IC: Visiting: " << OrigI << '\n');
3314 LLVM_DEBUG(dbgs() << "IC: Old = " << *I << '\n'
3342 LLVM_DEBUG(dbgs() << "IC: Mod = " << OrigI << '\n'
3394 LLVM_DEBUG(dbgs() << "IC: DCE: " << *Inst << '\n');
3406 LLVM_DEBUG(dbgs() << "IC: ConstFold to: " << *C << " from: " << *Inst
3429 LLVM_DEBUG(dbgs() << "IC: ConstFold operand of: " << *Inst
3535 LLVM_DEBUG(dbgs() << "\n\nINSTCOMBINE ITERATION #" << Iteration << " on "
lib/Transforms/Instrumentation/AddressSanitizer.cpp 945 LLVM_DEBUG(dbgs() << F);
1804 LLVM_DEBUG(dbgs() << "GLOBAL: " << *G << "\n");
1871 LLVM_DEBUG(dbgs() << "Ignoring global in sorted section (contains '$'): "
1889 LLVM_DEBUG(dbgs() << "Ignoring ObjC runtime global: " << *G << "\n");
1901 LLVM_DEBUG(dbgs() << "Ignoring CFString: " << *G << "\n");
1907 LLVM_DEBUG(dbgs() << "Ignoring a cstring literal: " << *G << "\n");
2378 LLVM_DEBUG(dbgs() << "NEW GLOBAL: " << *NewGlobal << "\n");
2412 LLVM_DEBUG(dbgs() << M);
2628 LLVM_DEBUG(dbgs() << "ASAN instrumenting:\n" << F << "\n");
2741 LLVM_DEBUG(dbgs() << "ASAN done instrumenting: " << FunctionModified << " "
3054 LLVM_DEBUG(dbgs() << DescriptionString << " --- " << L.FrameSize << "\n");
lib/Transforms/Instrumentation/BoundsChecking.cpp 61 LLVM_DEBUG(dbgs() << "Instrument " << *Ptr << " for " << Twine(NeededSize)
lib/Transforms/Instrumentation/CFGMST.h 99 LLVM_DEBUG(dbgs() << "Build Edge on " << F.getName() << "\n");
109 LLVM_DEBUG(dbgs() << " Edge: from fake node to " << Entry->getName()
140 LLVM_DEBUG(dbgs() << " Edge: from " << BB->getName() << " to "
166 LLVM_DEBUG(dbgs() << " Edge: from " << BB->getName() << " to fake exit"
lib/Transforms/Instrumentation/GCOVProfiling.cpp 348 LLVM_DEBUG(dbgs() << "Function: " << getFunctionName(SP) << "\n");
417 LLVM_DEBUG(dbgs() << Blocks.size() << " blocks.\n");
430 LLVM_DEBUG(dbgs() << Block.Number << " -> "
lib/Transforms/Instrumentation/HWAddressSanitizer.cpp 364 LLVM_DEBUG(dbgs() << "Init " << M.getName() << "\n");
720 LLVM_DEBUG(dbgs() << "Instrumenting: " << *I << "\n");
1110 LLVM_DEBUG(dbgs() << "Function: " << F.getName() << "\n");
lib/Transforms/Instrumentation/IndirectCallPromotion.cpp 225 LLVM_DEBUG(dbgs() << " \nWork on callsite #" << NumOfPGOICallsites << *Inst
230 LLVM_DEBUG(dbgs() << " Skip: User options.\n");
238 LLVM_DEBUG(dbgs() << " Candidate " << I << " Count=" << Count
242 LLVM_DEBUG(dbgs() << " Not promote: User options.\n");
250 LLVM_DEBUG(dbgs() << " Not promote: User option.\n");
258 LLVM_DEBUG(dbgs() << " Not promote: Cutoff reached.\n");
268 LLVM_DEBUG(dbgs() << " Not promote: Cannot find the target\n");
390 LLVM_DEBUG(dbgs() << "Failed to create symtab: " << SymtabFailure << "\n");
413 LLVM_DEBUG(dbgs() << "\n== IR Dump After =="; F.print(dbgs()));
414 LLVM_DEBUG(dbgs() << "\n");
418 LLVM_DEBUG(dbgs() << " Stop: Cutoff reached.\n");
lib/Transforms/Instrumentation/InstrProfiling.cpp 298 LLVM_DEBUG(dbgs() << Promoted << " counters promoted for loop (depth="
lib/Transforms/Instrumentation/MemorySanitizer.cpp 1068 LLVM_DEBUG(if (!InsertChecks) dbgs()
1173 LLVM_DEBUG(dbgs() << " STORE: " << *NewSI << "\n");
1206 LLVM_DEBUG(dbgs() << " SHAD0 : " << *Shadow << "\n");
1208 LLVM_DEBUG(dbgs() << " SHAD1 : " << *ConvertedShadow << "\n");
1238 LLVM_DEBUG(dbgs() << " CHECK: " << *Cmp << "\n");
1249 LLVM_DEBUG(dbgs() << "DONE:\n" << F);
1360 LLVM_DEBUG(dbgs() << "getShadowTy: " << *ST << " ===> " << *Res << "\n");
1522 LLVM_DEBUG(dbgs() << "ORIGIN: " << *V << " ==> " << *Origin << "\n");
1585 LLVM_DEBUG(dbgs() << "No shadow: " << *V << "\n" << *(I->getParent()));
1593 LLVM_DEBUG(dbgs() << "Undef: " << *U << " ==> " << *AllOnes << "\n");
1608 LLVM_DEBUG(dbgs() << "Arg is not sized\n");
1641 LLVM_DEBUG(dbgs() << " ByValCpy: " << *Cpy << "\n");
1654 LLVM_DEBUG(dbgs()
3293 LLVM_DEBUG(dbgs() << " CallSite: " << I << "\n");
3299 LLVM_DEBUG(dbgs() << "Arg " << i << " is not sized: " << I << "\n");
3309 LLVM_DEBUG(dbgs() << " Arg#" << i << ": " << *A
3341 LLVM_DEBUG(dbgs() << " Param:" << *Store << "\n");
3344 LLVM_DEBUG(dbgs() << " done with call args\n");
3581 LLVM_DEBUG(dbgs() << "ExtractValue: " << I << "\n");
3583 LLVM_DEBUG(dbgs() << " AggShadow: " << *AggShadow << "\n");
3585 LLVM_DEBUG(dbgs() << " ResShadow: " << *ResShadow << "\n");
3592 LLVM_DEBUG(dbgs() << "InsertValue: " << I << "\n");
3595 LLVM_DEBUG(dbgs() << " AggShadow: " << *AggShadow << "\n");
3596 LLVM_DEBUG(dbgs() << " InsShadow: " << *InsShadow << "\n");
3598 LLVM_DEBUG(dbgs() << " Res: " << *Res << "\n");
3613 LLVM_DEBUG(dbgs() << "Resume: " << I << "\n");
3618 LLVM_DEBUG(dbgs() << "CleanupReturn: " << CRI << "\n");
3623 LLVM_DEBUG(dbgs() << "CatchReturn: " << CRI << "\n");
3722 LLVM_DEBUG(dbgs() << "DEFAULT: " << I << "\n");
lib/Transforms/Instrumentation/PGOInstrumentation.cpp 591 LLVM_DEBUG(dumpInfo("after CFGMST"));
638 LLVM_DEBUG(dbgs() << "Function Hash Computation for " << F.getName() << ":\n"
782 LLVM_DEBUG(
789 LLVM_DEBUG(dbgs() << "Split critical edge: " << getBBInfo(SrcBB).Index
848 LLVM_DEBUG(dbgs() << "Instrument one VP " << ValueProfKindDescr[Kind]
1148 LLVM_DEBUG(dbgs() << "Error in reading profile for Func "
1153 LLVM_DEBUG(dbgs() << "unknown function");
1162 LLVM_DEBUG(dbgs() << "hash mismatch (skip=" << SkipWarning << ")");
1165 LLVM_DEBUG(dbgs() << " IsCS=" << IsCS << "\n");
1182 LLVM_DEBUG(dbgs() << CountFromProfile.size() << " counts\n");
1185 LLVM_DEBUG(dbgs() << " " << I << ": " << CountFromProfile[I] << "\n");
1190 LLVM_DEBUG(dbgs() << "SUM = " << ValueSum << "\n");
1196 LLVM_DEBUG(
1259 LLVM_DEBUG(dbgs() << "Populate counts in " << NumPasses << " passes.\n");
1284 LLVM_DEBUG(FuncInfo.dumpInfo("after reading profile."));
1290 LLVM_DEBUG(dbgs() << "\nSetting branch weights for func " << F.getName()
1333 LLVM_DEBUG(dbgs() << "\nAnnotating irreducible loop header weights.\n");
1432 LLVM_DEBUG(dbgs() << "Read one value site profile (kind = " << Kind
1523 LLVM_DEBUG(dbgs() << "Read in profile counters: ");
1627 LLVM_DEBUG(dbgs() << "Set inline attribute to function: " << F->getName()
1632 LLVM_DEBUG(dbgs() << "Set cold attribute to function: " << F->getName()
1706 LLVM_DEBUG(dbgs() << "Weight is: "; for (const auto &W
lib/Transforms/Instrumentation/PGOMemOPSizeOpt.cpp 156 LLVM_DEBUG(dbgs() << "MemOP call: "
252 LLVM_DEBUG(dbgs() << "Read one memory intrinsic profile with count "
254 LLVM_DEBUG(
267 LLVM_DEBUG(dbgs() << "Scale counts: numerator = " << ActualCount
317 LLVM_DEBUG(dbgs() << "Optimize one memory intrinsic call to " << Version
338 LLVM_DEBUG(dbgs() << "\n\n== Basic Block Before ==\n");
339 LLVM_DEBUG(dbgs() << *BB << "\n");
366 LLVM_DEBUG(dbgs() << "\n\n== Basic Block After==\n");
390 LLVM_DEBUG(dbgs() << *CaseBB << "\n");
397 LLVM_DEBUG(dbgs() << *BB << "\n");
398 LLVM_DEBUG(dbgs() << *DefaultBB << "\n");
399 LLVM_DEBUG(dbgs() << *MergeBB << "\n");
lib/Transforms/Instrumentation/ThreadSanitizer.cpp 536 LLVM_DEBUG(dbgs() << " VPTR : " << *I << "\n");
lib/Transforms/ObjCARC/ObjCARCAPElim.cpp 105 LLVM_DEBUG(dbgs() << "ObjCARCAPElim::OptimizeBB: Zapping push pop "
lib/Transforms/ObjCARC/ObjCARCContract.cpp 138 LLVM_DEBUG(
149 LLVM_DEBUG(dbgs() << "New: " << *Retain << "\n");
188 LLVM_DEBUG(dbgs() << " Fusing retain/autorelease!\n"
200 LLVM_DEBUG(dbgs() << " New RetainAutorelease: " << *Retain << "\n");
406 LLVM_DEBUG(
433 LLVM_DEBUG(llvm::dbgs() << " New Store Strong: " << *StoreStrong
491 LLVM_DEBUG(dbgs() << "Adding inline asm marker for the return value "
513 LLVM_DEBUG(dbgs() << "OBJCARCContract: Old = " << *CI << "\n"
565 LLVM_DEBUG(llvm::dbgs() << "**** ObjCARC Contract ****\n");
601 LLVM_DEBUG(dbgs() << "Visiting: " << *Inst << "\n");
lib/Transforms/ObjCARC/ObjCARCExpand.cpp 93 LLVM_DEBUG(dbgs() << "ObjCARCExpand: Visiting Function: " << F.getName()
99 LLVM_DEBUG(dbgs() << "ObjCARCExpand: Visiting: " << *Inst << "\n");
114 LLVM_DEBUG(dbgs() << "ObjCARCExpand: Old = " << *Inst
126 LLVM_DEBUG(dbgs() << "ObjCARCExpand: Finished List.\n\n");
lib/Transforms/ObjCARC/ObjCARCOpts.cpp 438 LLVM_DEBUG(dbgs() << " NONE!\n");
458 LLVM_DEBUG(dbgs() << " NONE!\n");
643 LLVM_DEBUG(dbgs() << "Erasing autoreleaseRV,retainRV pair: " << *I << "\n"
656 LLVM_DEBUG(dbgs() << "Transforming objc_retainAutoreleasedReturnValue => "
664 LLVM_DEBUG(dbgs() << "New = " << *RetainRV << "\n");
702 LLVM_DEBUG(
715 LLVM_DEBUG(dbgs() << "New: " << *AutoreleaseRV << "\n");
746 LLVM_DEBUG(dbgs() << "\n== ObjCARCOpt::OptimizeIndividualCalls ==\n");
761 LLVM_DEBUG(dbgs() << "Visiting: Class: " << Class << "; " << *Inst << "\n");
790 LLVM_DEBUG(dbgs() << "Erasing no-op cast: " << *Inst << "\n");
808 LLVM_DEBUG(
830 LLVM_DEBUG(
868 LLVM_DEBUG(
883 LLVM_DEBUG(
894 LLVM_DEBUG(dbgs() << "Removing tail keyword from function: " << *Inst
902 LLVM_DEBUG(dbgs() << "Found no throw class. Setting nounwind on: "
918 LLVM_DEBUG(dbgs() << "ARC calls with null are no-ops. Erasing: " << *Inst
1020 LLVM_DEBUG(dbgs() << "Cloning " << *CInst
1028 LLVM_DEBUG(dbgs() << "Erasing: " << *CInst << "\n");
1202 LLVM_DEBUG(dbgs() << " Class: " << Class << "\n");
1225 LLVM_DEBUG(dbgs() << " Matching with: " << *Inst << "\n");
1267 LLVM_DEBUG(dbgs() << "\n== ObjCARCOpt::VisitBottomUp ==\n");
1290 LLVM_DEBUG(dbgs() << "Before:\n"
1302 LLVM_DEBUG(dbgs() << " Visiting " << *Inst << "\n");
1324 LLVM_DEBUG(dbgs() << "\nFinal State:\n" << BBStates[BB] << "\n");
1337 LLVM_DEBUG(dbgs() << " Class: " << Class << "\n");
1363 LLVM_DEBUG(dbgs() << " Matching with: " << *Inst << "\n");
1403 LLVM_DEBUG(dbgs() << "\n== ObjCARCOpt::VisitTopDown ==\n");
1425 LLVM_DEBUG(dbgs() << "Before:\n"
1431 LLVM_DEBUG(dbgs() << " Visiting " << Inst << "\n");
1443 LLVM_DEBUG(dbgs() << "\nState Before Checking for CFG Hazards:\n"
1446 LLVM_DEBUG(dbgs() << "Final State:\n" << BBStates[BB] << "\n");
1574 LLVM_DEBUG(dbgs() << "== ObjCARCOpt::MoveCalls ==\n");
1585 LLVM_DEBUG(dbgs() << "Inserting new Retain: " << *Call
1602 LLVM_DEBUG(dbgs() << "Inserting new Release: " << *Call
1612 LLVM_DEBUG(dbgs() << "Deleting retain: " << *OrigRetain << "\n");
1617 LLVM_DEBUG(dbgs() << "Deleting release: " << *OrigRelease << "\n");
1824 LLVM_DEBUG(dbgs() << "\n== ObjCARCOpt::PerformCodePlacement ==\n");
1838 LLVM_DEBUG(dbgs() << "Visiting: " << *Retain << "\n");
1883 LLVM_DEBUG(dbgs() << "\n== ObjCARCOpt::OptimizeWeakCalls ==\n");
1891 LLVM_DEBUG(dbgs() << "Visiting: " << *Inst << "\n");
2153 LLVM_DEBUG(dbgs() << "\n== ObjCARCOpt::OptimizeReturns ==\n");
2162 LLVM_DEBUG(dbgs() << "Visiting: " << *Ret << "\n");
2200 LLVM_DEBUG(dbgs() << "Erasing: " << *Retain << "\nErasing: " << *Autorelease
2261 LLVM_DEBUG(dbgs() << "<<< ObjCARCOpt: Visiting Function: " << F.getName()
2311 LLVM_DEBUG(dbgs() << "\n");
lib/Transforms/ObjCARC/PtrState.cpp 128 LLVM_DEBUG(dbgs() << " Setting Known Positive.\n");
133 LLVM_DEBUG(dbgs() << " Clearing Known Positive.\n");
138 LLVM_DEBUG(dbgs() << " Old: " << GetSeq() << "; New: " << NewSeq
144 LLVM_DEBUG(dbgs() << " Resetting sequence progress.\n");
187 LLVM_DEBUG(
238 LLVM_DEBUG(dbgs() << " CanAlterRefCount: Seq: " << S << "; "
290 LLVM_DEBUG(dbgs() << " CanUse: Seq: " << GetSeq() << "; "
294 LLVM_DEBUG(dbgs() << " PreciseReleaseUse: Seq: " << GetSeq()
300 LLVM_DEBUG(dbgs() << " ReleaseUse: Seq: " << GetSeq() << "; "
308 LLVM_DEBUG(dbgs() << " PreciseStopUse: Seq: " << GetSeq()
390 LLVM_DEBUG(dbgs() << " CanAlterRefCount: Seq: " << GetSeq() << "; "
423 LLVM_DEBUG(dbgs() << " CanUse: Seq: " << GetSeq() << "; "
lib/Transforms/Scalar/ADCE.cpp 302 LLVM_DEBUG(dbgs() << "post-dom root child is a return: " << BB->getName()
360 LLVM_DEBUG(dbgs() << "work live: "; LiveInst->dump(););
382 LLVM_DEBUG(dbgs() << "mark live: "; I->dump());
406 LLVM_DEBUG(dbgs() << "mark block live: " << BBInfo.BB->getName() << '\n');
467 LLVM_DEBUG({
495 LLVM_DEBUG(dbgs() << "live control in: " << BB->getName() << '\n');
509 LLVM_DEBUG({
563 LLVM_DEBUG({
615 LLVM_DEBUG(dbgs() << "ADCE: (Post)DomTree edge enqueued for deletion"
661 LLVM_DEBUG(dbgs() << "making unconditional " << BB->getName() << '\n');
lib/Transforms/Scalar/AlignmentFromAssumptions.cpp 98 LLVM_DEBUG(dbgs() << "\talignment relative to " << *AlignSCEV << " is "
139 LLVM_DEBUG(dbgs() << "AFI: alignment of " << *Ptr << " relative to "
144 LLVM_DEBUG(dbgs() << "\tnew alignment: " << NewAlignment << "\n");
160 LLVM_DEBUG(dbgs() << "\ttrying start/inc alignment using start "
170 LLVM_DEBUG(dbgs() << "\tnew start alignment: " << NewAlignment << "\n");
171 LLVM_DEBUG(dbgs() << "\tnew inc alignment: " << NewIncAlignment << "\n");
177 LLVM_DEBUG(dbgs() << "\tnew start/inc alignment: " << NewIncAlignment
183 LLVM_DEBUG(dbgs() << "\tnew start/inc alignment: " << NewAlignment
188 LLVM_DEBUG(dbgs() << "\tnew start/inc alignment: " << NewAlignment
339 LLVM_DEBUG(dbgs() << "\tmem inst: " << NewDestAlignment << "\n";);
351 LLVM_DEBUG(dbgs() << "\tmem trans: " << NewSrcAlignment << "\n";);
lib/Transforms/Scalar/BDCE.cpp 122 LLVM_DEBUG(dbgs() << "BDCE: Trivializing: " << U << " (all bits dead)\n");
lib/Transforms/Scalar/CallSiteSplitting.cpp 322 LLVM_DEBUG(dbgs() << "split call-site : " << *Instr << " into \n");
350 LLVM_DEBUG(dbgs() << " " << *NewCI << " in " << SplitBlock->getName()
lib/Transforms/Scalar/ConstantHoisting.cpp 146 LLVM_DEBUG(dbgs() << "********** Begin Constant Hoisting **********\n");
147 LLVM_DEBUG(dbgs() << "********** Function: " << Fn.getName() << '\n');
159 LLVM_DEBUG(dbgs() << "********** Function after Constant Hoisting: "
161 LLVM_DEBUG(dbgs() << Fn);
163 LLVM_DEBUG(dbgs() << "********** End Constant Hoisting **********\n");
381 LLVM_DEBUG(if (isa<ConstantInt>(Inst->getOperand(Idx))) dbgs()
565 LLVM_DEBUG(dbgs() << "== Maximize constants in range ==\n");
572 LLVM_DEBUG(dbgs() << "= Constant: " << ConstCand->ConstInt->getValue()
579 LLVM_DEBUG(dbgs() << "Cost: " << Cost << "\n");
589 LLVM_DEBUG(dbgs() << "Offset " << Diff.getValue() << " "
595 LLVM_DEBUG(dbgs() << "Cumulative cost: " << Cost << "\n");
599 LLVM_DEBUG(dbgs() << "New candidate: " << MaxCostItr->ConstInt->getValue()
754 LLVM_DEBUG(dbgs() << "Materialize constant (" << *Base->getOperand(0)
764 LLVM_DEBUG(dbgs() << "Update: " << *ConstUser.Inst << '\n');
767 LLVM_DEBUG(dbgs() << "To : " << *ConstUser.Inst << '\n');
783 LLVM_DEBUG(dbgs() << "Clone instruction: " << *CastInst << '\n'
787 LLVM_DEBUG(dbgs() << "Update: " << *ConstUser.Inst << '\n');
789 LLVM_DEBUG(dbgs() << "To : " << *ConstUser.Inst << '\n');
811 LLVM_DEBUG(dbgs() << "Create instruction: " << *ConstExprInst << '\n'
813 LLVM_DEBUG(dbgs() << "Update: " << *ConstUser.Inst << '\n');
819 LLVM_DEBUG(dbgs() << "To : " << *ConstUser.Inst << '\n');
879 LLVM_DEBUG(dbgs() << "Hoist constant (" << *ConstInfo.BaseInt
lib/Transforms/Scalar/CorrelatedValuePropagation.cpp 259 LLVM_DEBUG(dbgs() << "CVP: Threading PHI over " << *SI << '\n');
lib/Transforms/Scalar/DeadStoreElimination.cpp 430 LLVM_DEBUG(dbgs() << "DSE: Partial overwrite: Earlier [" << EarlierOff
470 LLVM_DEBUG(dbgs() << "DSE: Full overwrite from partials: Earlier ["
485 LLVM_DEBUG(dbgs() << "DSE: Partial overwrite an earlier load ["
687 LLVM_DEBUG(
799 LLVM_DEBUG(dbgs() << "DSE: Dead Store at End of Block:\n DEAD: "
822 LLVM_DEBUG(dbgs() << "DSE: Removing trivially dead instruction:\n DEAD: "
934 LLVM_DEBUG(dbgs() << "DSE: Remove Dead Store:\n OW "
1043 LLVM_DEBUG(
1061 LLVM_DEBUG(
1186 LLVM_DEBUG(dbgs() << "DSE: Remove Dead Store:\n DEAD: " << *DepWrite
1251 LLVM_DEBUG(dbgs() << "DSE: Merge Stores:\n Earlier: " << *DepWrite
lib/Transforms/Scalar/EarlyCSE.cpp 839 LLVM_DEBUG(dbgs() << "EarlyCSE CVP: Add conditional value for '"
843 LLVM_DEBUG(dbgs() << "Skipping due to debug counter\n");
904 LLVM_DEBUG(dbgs() << "EarlyCSE DCE: " << *Inst << '\n');
906 LLVM_DEBUG(dbgs() << "Skipping due to debug counter\n");
926 LLVM_DEBUG(dbgs() << "EarlyCSE considering assumption: " << *Inst
930 LLVM_DEBUG(dbgs() << "EarlyCSE skipping assumption: " << *Inst << '\n');
936 LLVM_DEBUG(dbgs() << "EarlyCSE skipping sideeffect: " << *Inst << '\n');
974 LLVM_DEBUG(dbgs()
1000 LLVM_DEBUG(dbgs() << "EarlyCSE Simplify: " << *Inst << " to: " << *V
1003 LLVM_DEBUG(dbgs() << "Skipping due to debug counter\n");
1027 LLVM_DEBUG(dbgs() << "EarlyCSE CSE: " << *Inst << " to: " << *V
1030 LLVM_DEBUG(dbgs() << "Skipping due to debug counter\n");
1088 LLVM_DEBUG(dbgs() << "EarlyCSE CSE LOAD: " << *Inst
1091 LLVM_DEBUG(dbgs() << "Skipping due to debug counter\n");
1131 LLVM_DEBUG(dbgs() << "EarlyCSE CSE CALL: " << *Inst
1134 LLVM_DEBUG(dbgs() << "Skipping due to debug counter\n");
1187 LLVM_DEBUG(dbgs() << "EarlyCSE DSE (writeback): " << *Inst << '\n');
1189 LLVM_DEBUG(dbgs() << "Skipping due to debug counter\n");
1222 LLVM_DEBUG(dbgs() << "EarlyCSE DEAD STORE: " << *LastStore
1225 LLVM_DEBUG(dbgs() << "Skipping due to debug counter\n");
lib/Transforms/Scalar/Float2Int.cpp 150 LLVM_DEBUG(dbgs() << "F2I: " << *I << ":" << R << "\n");
381 LLVM_DEBUG(dbgs() << "F2I: Failing because of " << *U << "\n");
402 LLVM_DEBUG(dbgs() << "F2I: MinBitwidth=" << MinBW << ", R: " << R << "\n");
413 LLVM_DEBUG(dbgs() << "F2I: Value not guaranteed to be representable!\n");
417 LLVM_DEBUG(
517 LLVM_DEBUG(dbgs() << "F2I: Looking at function " << F.getName() << "\n");
lib/Transforms/Scalar/GVN.cpp 781 LLVM_DEBUG(dbgs() << "GVN COERCED NONLOCAL VAL:\nOffset: " << Offset
798 LLVM_DEBUG(dbgs() << "GVN COERCED NONLOCAL LOAD:\nOffset: " << Offset
806 LLVM_DEBUG(dbgs() << "GVN COERCED NONLOCAL MEM INTRIN:\nOffset: " << Offset
812 LLVM_DEBUG(dbgs() << "GVN COERCED NONLOCAL Undef:\n";);
915 LLVM_DEBUG(
972 LLVM_DEBUG(
1097 LLVM_DEBUG(
1109 LLVM_DEBUG(
1117 LLVM_DEBUG(
1124 LLVM_DEBUG(
1154 LLVM_DEBUG(dbgs() << "Split critical edge " << OrigPred->getName() << "->"
1194 LLVM_DEBUG(dbgs() << "COULDN'T INSERT PHI TRANSLATED VALUE OF: "
1220 LLVM_DEBUG(dbgs() << "GVN REMOVING PRE LOAD: " << *LI << '\n');
1221 LLVM_DEBUG(if (!NewInsts.empty()) dbgs()
1273 LLVM_DEBUG(dbgs() << "GVN INSERTED " << *NewLoad << '\n');
1331 LLVM_DEBUG(dbgs() << "GVN: non-local load "; LI->printAsOperand(dbgs());
1361 LLVM_DEBUG(dbgs() << "GVN REMOVING NONLOCAL LOAD: " << *LI << '\n');
1490 LLVM_DEBUG(dbgs() << "Replacing dominated uses of "
1539 LLVM_DEBUG(
1762 LLVM_DEBUG(dbgs() << "GVN replacing: " << *Operand << " with "
2114 LLVM_DEBUG(dbgs() << "GVN iteration: " << Iteration << "\n");
2177 LLVM_DEBUG(dbgs() << "GVN removed: " << *I << '\n');
2180 LLVM_DEBUG(verifyRemoved(I));
2369 LLVM_DEBUG(verifyRemoved(PREInstr));
2407 LLVM_DEBUG(dbgs() << "GVN PRE removed: " << *CurInst << '\n');
2410 LLVM_DEBUG(verifyRemoved(CurInst));
lib/Transforms/Scalar/GVNHoist.cpp 624 LLVM_DEBUG(dbgs() << "\nPushing on stack: " << *VI.second);
638 LLVM_DEBUG(dbgs() << "\nLooking at CHIs in: " << Pred->getName(););
653 LLVM_DEBUG(dbgs()
799 LLVM_DEBUG(dbgs() << "\nInsertion a CHI for BB: " << IDFB->getName()
lib/Transforms/Scalar/GVNSink.cpp 564 LLVM_DEBUG(dbgs() << "GVNSink: running on function @" << F.getName()
633 LLVM_DEBUG(dbgs() << " -- Analyzing instruction set: [\n"; for (auto *I
641 LLVM_DEBUG(dbgs() << " VN=" << Twine::utohexstr(N) << " for" << *I << "\n");
762 LLVM_DEBUG(dbgs() << "GVNSink: running on basic block ";
804 LLVM_DEBUG(dbgs() << " -- Sinking candidates:\n"; for (auto &C
813 LLVM_DEBUG(dbgs() << " -- Sinking: " << C << "\n");
816 LLVM_DEBUG(dbgs() << " -- Splitting edge to ";
820 LLVM_DEBUG(dbgs() << " -- FAILED to split edge!\n");
lib/Transforms/Scalar/GuardWidening.cpp 407 LLVM_DEBUG(dbgs() << "Score between " << *getCondition(Instr)
418 LLVM_DEBUG(dbgs() << "Did not eliminate guard " << *Instr << "\n");
425 LLVM_DEBUG(dbgs() << "Widening " << *Instr << " into " << *BestSoFar
lib/Transforms/Scalar/IndVarSimplify.cpp 223 LLVM_DEBUG(dbgs() << "INDVARS: GEP rewrite bail out " << *FromBase
676 LLVM_DEBUG(dbgs() << "INDVARS: RLEV: AfterLoopVal = " << *ExitVal
1114 LLVM_DEBUG(dbgs() << "Cloning bitwise IVUser: " << *NarrowUse << "\n");
1145 LLVM_DEBUG(dbgs() << "Cloning arithmetic IVUser: " << *NarrowUse << "\n");
1348 LLVM_DEBUG(dbgs() << "INDVARS: Truncate IV " << *DU.WideDef << " for user "
1491 LLVM_DEBUG(dbgs() << "Cloning arithmetic IVUser: " << *NarrowUse << "\n");
1520 LLVM_DEBUG(dbgs() << "INDVARS: eliminating " << *User << " replaced by "
1531 LLVM_DEBUG(dbgs() << "INDVARS: eliminating " << *User << " replaced by "
1570 LLVM_DEBUG(dbgs() << "INDVARS: Widen lcssa phi " << *UsePhi << " to "
1602 LLVM_DEBUG(dbgs() << "INDVARS: New IV " << *WidePhi
1610 LLVM_DEBUG(dbgs() << "INDVARS: eliminating " << *DU.NarrowUse
1676 LLVM_DEBUG(dbgs() << "Wide use expression mismatch: " << *WideUse << ": "
1787 LLVM_DEBUG(dbgs() << "Wide IV: " << *WidePhi << "\n");
2537 LLVM_DEBUG(dbgs() << "INDVARS: Rewriting loop exit condition to:\n"
lib/Transforms/Scalar/InductiveRangeCheckElimination.cpp 656 LLVM_DEBUG(dbgs() << "irce: isSafeDecreasingBound with:\n");
657 LLVM_DEBUG(dbgs() << "irce: Start: " << *Start << "\n");
658 LLVM_DEBUG(dbgs() << "irce: Step: " << *Step << "\n");
659 LLVM_DEBUG(dbgs() << "irce: BoundSCEV: " << *BoundSCEV << "\n");
660 LLVM_DEBUG(dbgs() << "irce: Pred: " << ICmpInst::getPredicateName(Pred)
662 LLVM_DEBUG(dbgs() << "irce: LatchExitBrIdx: " << LatchBrExitIdx << "\n");
704 LLVM_DEBUG(dbgs() << "irce: isSafeIncreasingBound with:\n");
705 LLVM_DEBUG(dbgs() << "irce: Start: " << *Start << "\n");
706 LLVM_DEBUG(dbgs() << "irce: Step: " << *Step << "\n");
707 LLVM_DEBUG(dbgs() << "irce: BoundSCEV: " << *BoundSCEV << "\n");
708 LLVM_DEBUG(dbgs() << "irce: Pred: " << ICmpInst::getPredicateName(Pred)
710 LLVM_DEBUG(dbgs() << "irce: LatchExitBrIdx: " << LatchBrExitIdx << "\n");
1399 LLVM_DEBUG(dbgs() << "irce: could not compute subranges\n");
1434 LLVM_DEBUG(dbgs() << "irce: could not prove no-overflow when computing "
1441 LLVM_DEBUG(dbgs() << "irce: could not prove that it is safe to expand the"
1461 LLVM_DEBUG(dbgs() << "irce: could not prove no-overflow when computing "
1468 LLVM_DEBUG(dbgs() << "irce: could not prove that it is safe to expand the"
1787 LLVM_DEBUG(dbgs() << "irce: giving up constraining loop, too large\n");
1793 LLVM_DEBUG(dbgs() << "irce: loop has no preheader, leaving\n");
1816 LLVM_DEBUG(PrintRecognizedRangeChecks(dbgs()));
1825 LLVM_DEBUG(dbgs() << "irce: could not parse loop structure: "
1876 LLVM_DEBUG(PrintConstrainedLoopInfo());
lib/Transforms/Scalar/InferAddressSpaces.cpp 663 LLVM_DEBUG(dbgs() << "Updating the address space of\n " << *V << '\n');
669 LLVM_DEBUG(dbgs() << " to " << NewAS.getValue() << '\n');
911 LLVM_DEBUG(dbgs() << "Replacing the uses of " << *V << "\n with\n "
918 LLVM_DEBUG(dbgs() << "Inserting replacement const cast: " << Replace
lib/Transforms/Scalar/JumpThreading.cpp 359 LLVM_DEBUG(dbgs() << "Jump threading on function '" << F.getName() << "'\n");
408 LLVM_DEBUG(dbgs() << " JT: Deleting dead block '" << BB.getName()
1107 LLVM_DEBUG(dbgs() << " In block '" << BB->getName()
1119 LLVM_DEBUG(dbgs() << " In block '" << BB->getName()
1607 LLVM_DEBUG(dbgs() << "IN BB: " << *BB;
1931 LLVM_DEBUG(dbgs() << " Not threading across BB '" << BB->getName()
1939 LLVM_DEBUG({
1953 LLVM_DEBUG(dbgs() << " Not threading BB '" << BB->getName()
1963 LLVM_DEBUG(dbgs() << " Factoring out " << PredBBs.size()
1969 LLVM_DEBUG(dbgs() << " Threading edge from '" << PredBB->getName()
2073 LLVM_DEBUG(dbgs() << "JT: Renaming non-local uses of: " << I << "\n");
2084 LLVM_DEBUG(dbgs() << "\n");
2270 LLVM_DEBUG(dbgs() << " Not duplicating loop header '" << BB->getName()
2279 LLVM_DEBUG(dbgs() << " Not duplicating BB '" << BB->getName()
2290 LLVM_DEBUG(dbgs() << " Factoring out " << PredBBs.size()
2298 LLVM_DEBUG(dbgs() << " Duplicating block '" << BB->getName()
2393 LLVM_DEBUG(dbgs() << "JT: Renaming non-local uses of: " << I << "\n");
2404 LLVM_DEBUG(dbgs() << "\n");
2732 LLVM_DEBUG(dbgs() << "Moved guard " << *Guard << " to block "
lib/Transforms/Scalar/LICM.cpp 346 LLVM_DEBUG(dbgs() << "LICM: Using Alias Set Tracker.\n");
349 LLVM_DEBUG(dbgs() << "LICM: Using MemorySSA.\n");
528 LLVM_DEBUG(dbgs() << "LICM deleting dead inst: " << I << '\n');
703 LLVM_DEBUG(dbgs() << "LICM using " << InitialPreheader->getName()
731 LLVM_DEBUG(dbgs() << "LICM created " << New->getName()
833 LLVM_DEBUG(dbgs() << "LICM folding inst: " << I << " --> " << *C
952 LLVM_DEBUG(dbgs() << "LICM rehoisting to "
1565 LLVM_DEBUG(dbgs() << "LICM sinking instruction: " << I << "\n");
1666 LLVM_DEBUG(dbgs() << "LICM hoisting to " << Dest->getName() << ": " << I
2093 LLVM_DEBUG(dbgs() << "LICM: Promoting value stored to in loop: " << *SomePtr
2268 LLVM_DEBUG(dbgs() << "Alasing N2 threshold exhausted for "
2275 LLVM_DEBUG(dbgs() << "Aliasing failed on " << I << " for "
2280 LLVM_DEBUG(dbgs() << "Aliasing okay for " << *(MemLoc.Ptr) << "\n");
lib/Transforms/Scalar/LoopDataPrefetch.cpp 246 LLVM_DEBUG(dbgs() << "Prefetching " << ItersAhead
323 LLVM_DEBUG(dbgs() << " Access: " << *PtrValue << ", SCEV: " << *LSCEV
lib/Transforms/Scalar/LoopDeletion.cpp 144 LLVM_DEBUG(
152 LLVM_DEBUG(dbgs() << "Loop contains subloops.\n");
160 LLVM_DEBUG(dbgs() << "Loop is proven to never execute, delete it!");
181 LLVM_DEBUG(dbgs() << "Deletion requires single exit block\n");
187 LLVM_DEBUG(dbgs() << "Loop is not invariant, cannot delete.\n");
196 LLVM_DEBUG(dbgs() << "Could not compute SCEV MaxBackedgeTakenCount.\n");
201 LLVM_DEBUG(dbgs() << "Loop is invariant, delete it!");
212 LLVM_DEBUG(dbgs() << "Analyzing Loop for deletion: ");
213 LLVM_DEBUG(L.dump());
258 LLVM_DEBUG(dbgs() << "Analyzing Loop for deletion: ");
259 LLVM_DEBUG(L->dump());
lib/Transforms/Scalar/LoopDistribute.cpp 376 LLVM_DEBUG(dbgs()
638 LLVM_DEBUG(dbgs() << "Backward dependences:\n");
647 LLVM_DEBUG(Dep.print(dbgs(), 2, Instructions));
668 LLVM_DEBUG(dbgs() << "\nLDist: In \""
742 LLVM_DEBUG(dbgs() << "Seeded partitions:\n" << Partitions);
750 LLVM_DEBUG(dbgs() << "\nMerged partitions:\n" << Partitions);
757 LLVM_DEBUG(dbgs() << "\nPopulated partitions:\n" << Partitions);
762 LLVM_DEBUG(dbgs() << "\nPartitions merged to ensure unique loads:\n"
786 LLVM_DEBUG(dbgs() << "\nDistributing loop: " << *L << "\n");
814 LLVM_DEBUG(dbgs() << "\nPointers:\n");
815 LLVM_DEBUG(LAI->getRuntimePointerChecking()->printChecks(dbgs(), Checks));
841 LLVM_DEBUG(dbgs() << "\nAfter removing unused Instrs:\n");
842 LLVM_DEBUG(Partitions.printBlocks());
864 LLVM_DEBUG(dbgs() << "Skipping; " << Message << "\n");
lib/Transforms/Scalar/LoopFuse.cpp 289 LLVM_DEBUG(dbgs() << "FC has invalid CFG requirements!\n");
308 LLVM_DEBUG(dbgs() << "Loop " << L->getName()
314 LLVM_DEBUG(dbgs() << "Loop " << L->getName()
530 LLVM_DEBUG(dbgs() << "Performing Loop Fusion on function " << F.getName()
535 LLVM_DEBUG(dbgs() << "Got " << LDT.size() << " loop sets for depth "
547 LLVM_DEBUG({
564 LLVM_DEBUG(dbgs() << "Descend one level!\n");
570 LLVM_DEBUG(dbgs() << "Function after Loop Fusion: \n"; F.dump(););
579 LLVM_DEBUG(dbgs() << "Loop Fusion complete\n");
628 LLVM_DEBUG(dbgs() << "Adding " << CurrCand
638 LLVM_DEBUG(dbgs() << "Adding " << CurrCand << " to new set\n");
672 LLVM_DEBUG(dbgs() << "Trip count of first loop could not be computed!");
679 LLVM_DEBUG(dbgs() << "Trip count of second loop could not be computed!");
682 LLVM_DEBUG(dbgs() << "\tTrip counts: " << *TripCount0 << " & "
699 LLVM_DEBUG(printFusionCandidates(FusionCandidates));
704 LLVM_DEBUG(dbgs() << "Attempting fusion on Candidate Set:\n"
715 LLVM_DEBUG(dbgs() << "Attempting to fuse candidate \n"; FC0->dump();
722 LLVM_DEBUG(dbgs() << "Fusion candidates do not have identical trip "
730 LLVM_DEBUG(dbgs()
740 LLVM_DEBUG(dbgs() << "Fusion candidates do not have identical "
753 LLVM_DEBUG(dbgs() << "Fusion candidate does not have empty "
761 LLVM_DEBUG(dbgs() << "Fusion candidate does not have empty exit "
769 LLVM_DEBUG(dbgs() << "Fusion candidate does not have empty guard "
779 LLVM_DEBUG(dbgs() << "Memory dependencies do not allow fusion!\n");
786 LLVM_DEBUG(dbgs()
798 LLVM_DEBUG(dbgs() << "\tFusion is performed: " << *FC0 << " and "
828 LLVM_DEBUG(dbgs() << "Candidate Set (after fusion): " << CandidateSet
888 LLVM_DEBUG(dbgs() << " Access function check: " << *SCEVPtr0 << " vs "
895 LLVM_DEBUG(dbgs() << " Access function after rewrite: " << *SCEVPtr0
921 LLVM_DEBUG(dbgs() << " Relation: " << *SCEVPtr0
937 LLVM_DEBUG(dbgs() << "Check dep: " << I0 << " vs " << I1 << " : "
950 LLVM_DEBUG(dbgs() << "DA res: "; DepResult->dump(dbgs());
954 LLVM_DEBUG(dbgs() << "DepResult Levels: " << DepResult->getLevels()
960 LLVM_DEBUG(
980 LLVM_DEBUG(dbgs() << "Check if " << FC0 << " can be fused with " << FC1
1149 LLVM_DEBUG(dbgs() << "Fusion Candidate 0: \n"; FC0.dump();
1302 LLVM_DEBUG(dbgs() << "Fusion done:\n");
1555 LLVM_DEBUG(dbgs() << "Fusion done:\n");
lib/Transforms/Scalar/LoopIdiomRecognize.cpp 397 LLVM_DEBUG(dbgs() << DEBUG_TYPE " Scanning: F["
1031 LLVM_DEBUG(dbgs() << " Formed memset: " << *NewCall << "\n"
1171 LLVM_DEBUG(dbgs() << " Formed memcpy: " << *NewCall << "\n"
1198 LLVM_DEBUG(dbgs() << " " << CurLoop->getHeader()->getParent()->getName()
1209 LLVM_DEBUG(dbgs() << DEBUG_TYPE " Scanning: F["
1921 LLVM_DEBUG(dbgs() << "Basic control-flow layout unrecognized.\n");
1924 LLVM_DEBUG(dbgs() << "Recognized basic control-flow layout.\n");
1931 LLVM_DEBUG(dbgs() << "Analyzing header icmp " << *BCmpValue
1948 LLVM_DEBUG(dbgs() << "Loop header icmp did not match bcmp pattern.\n");
1951 LLVM_DEBUG(dbgs() << "Recognized header icmp as bcmp pattern with loads:\n\t"
1981 LLVM_DEBUG(dbgs() << "Loop control-flow not recognized.\n");
1989 LLVM_DEBUG(dbgs() << "Recognized loop control-flow.\n");
1991 LLVM_DEBUG(dbgs() << "Performing side-effect analysis on the loop.\n");
2005 LLVM_DEBUG(dbgs()
2022 LLVM_DEBUG(
2029 LLVM_DEBUG(dbgs() << "No loop instructions deemed to have side-effects.\n");
2044 LLVM_DEBUG(dbgs() << "Failed to get SCEV expressions for load sources.\n");
2048 LLVM_DEBUG(dbgs() << "Got SCEV expressions (at loop scope) for loads:\n\t"
2058 LLVM_DEBUG(dbgs() << "Unsupported SCEV expressions for loads. Only support "
2070 LLVM_DEBUG(dbgs() << "Got SCEV expressions for load sources:\n\t" << *SrcA
2077 LLVM_DEBUG(dbgs() << "Unsupported SCEV expressions for loads, unavaliable "
2082 LLVM_DEBUG(dbgs() << "SCEV expressions for loads are acceptable.\n");
2092 LLVM_DEBUG(dbgs() << "Got SCEV expression for loop latch exit count: "
2100 LLVM_DEBUG(dbgs() << "Unsupported SCEV expression for loop latch exit.\n");
2111 LLVM_DEBUG(dbgs() << "Computed iteration count: " << *Iterations << "\n");
2130 LLVM_DEBUG(dbgs() << "Recognizing bcmp idiom\n");
2134 LLVM_DEBUG(dbgs() << "Basic loop structure unrecognized.\n");
2137 LLVM_DEBUG(dbgs() << "Recognized basic loop structure.\n");
2160 LLVM_DEBUG(dbgs() << "Got comparison between values of type " << *BCmpValTy
2166 LLVM_DEBUG(dbgs() << "Value size is not a multiple of byte.\n");
2174 LLVM_DEBUG(dbgs() << "Size is exactly " << BCmpTyBytes
2198 LLVM_DEBUG(dbgs() << "Computed total byte count: " << *NBytes << "\n");
2205 LLVM_DEBUG(dbgs() << L);
2215 LLVM_DEBUG(dbgs() << "Recognized bcmp idiom\n");
2228 LLVM_DEBUG(dbgs() << "Transforming control-flow.\n");
2405 LLVM_DEBUG(dbgs() << "Deleting old loop.\n");
2599 LLVM_DEBUG(dbgs() << "Transforming bcmp loop idiom into a call.\n");
2600 LLVM_DEBUG(dbgs() << "Emitting new instructions.\n");
2664 LLVM_DEBUG(dbgs() << "Transformed loop bcmp idiom into a call.\n");
2689 LLVM_DEBUG(dbgs() << "bcmp idiom recognition failed.\n");
lib/Transforms/Scalar/LoopInterchange.cpp 109 LLVM_DEBUG(dbgs() << "Found " << MemInstr.size()
127 LLVM_DEBUG(StringRef DepType =
171 LLVM_DEBUG(dbgs() << "Cannot handle more than " << MaxMemInstrCount
274 LLVM_DEBUG(dbgs() << "Calling populateWorklist on Func: "
469 LLVM_DEBUG(dbgs() << "Couldn't compute backedge count\n");
473 LLVM_DEBUG(dbgs() << "NumBackEdges is not equal to 1\n");
477 LLVM_DEBUG(dbgs() << "Loop doesn't have unique exit block\n");
494 LLVM_DEBUG(dbgs() << "Loop doesn't contain minimum nesting level.\n");
498 LLVM_DEBUG(dbgs() << "Cannot handle loops of depth greater than "
503 LLVM_DEBUG(dbgs() << "Not valid loop candidate for interchange\n");
507 LLVM_DEBUG(dbgs() << "Processing LoopList of size = " << LoopNestDepth
514 LLVM_DEBUG(dbgs() << "Populating dependency matrix failed\n");
525 LLVM_DEBUG(dbgs() << "OuterMostLoop needs an unique exit block");
553 LLVM_DEBUG(dbgs() << "Processing Inner Loop Id = " << InnerLoopId
560 LLVM_DEBUG(dbgs() << "Not interchanging loops. Cannot prove legality.\n");
563 LLVM_DEBUG(dbgs() << "Loops are legal to interchange\n");
566 LLVM_DEBUG(dbgs() << "Interchanging loops not profitable.\n");
580 LLVM_DEBUG(dbgs() << "Loops interchanged.\n");
599 LLVM_DEBUG(dbgs() << "Checking if loops are tightly nested\n");
614 LLVM_DEBUG(dbgs() << "Checking instructions in Loop header and Loop latch\n");
621 LLVM_DEBUG(dbgs() << "Loops are perfectly nested\n");
692 LLVM_DEBUG(dbgs() << "Inner loop PHI is not part of reductions "
706 LLVM_DEBUG(
747 LLVM_DEBUG(
763 LLVM_DEBUG(
778 LLVM_DEBUG(dbgs() << "Loops with more than 1 induction variables are not "
792 LLVM_DEBUG(
807 LLVM_DEBUG(
823 LLVM_DEBUG(dbgs() << "Loop structure not understood by pass\n");
836 LLVM_DEBUG(
867 LLVM_DEBUG(
893 LLVM_DEBUG(dbgs() << "Found unsupported instructions between induction "
911 LLVM_DEBUG(dbgs() << "Did not find the induction variable.\n");
964 LLVM_DEBUG(dbgs() << "Failed interchange InnerLoopId = " << InnerLoopId
982 LLVM_DEBUG(
998 LLVM_DEBUG(dbgs() << "Not legal because of current transform limitation\n");
1004 LLVM_DEBUG(dbgs() << "Loops not tightly nested\n");
1016 LLVM_DEBUG(dbgs() << "Found unsupported PHI nodes in outer loop exit.\n");
1110 LLVM_DEBUG(dbgs() << "Cost = " << Cost << "\n");
1227 LLVM_DEBUG(dbgs() << "Splitting the inner loop latch\n");
1230 LLVM_DEBUG(dbgs() << "Failed to find the point to split loop latch \n");
1296 LLVM_DEBUG(dbgs() << "splitting InnerLoopHeader done\n");
1301 LLVM_DEBUG(dbgs() << "adjustLoopLinks failed\n");
1427 LLVM_DEBUG(dbgs() << "adjustLoopBranches called\n");
lib/Transforms/Scalar/LoopLoadElimination.cpp 293 LLVM_DEBUG(
405 LLVM_DEBUG(dbgs() << "\nPointer Checks (count: " << Checks.size()
407 LLVM_DEBUG(LAI.getRuntimePointerChecking()->printChecks(dbgs(), Checks));
452 LLVM_DEBUG(dbgs() << "\nIn \"" << L->getHeader()->getParent()->getName()
492 LLVM_DEBUG(dbgs() << "Candidate " << Cand);
511 LLVM_DEBUG(
527 LLVM_DEBUG(dbgs() << "Too many run-time checks needed.\n");
533 LLVM_DEBUG(dbgs() << "Too many SCEV run-time checks needed.\n");
539 LLVM_DEBUG(dbgs() << "Versioning is needed but not allowed with "
549 LLVM_DEBUG(
556 LLVM_DEBUG(dbgs() << "Loop is not is loop-simplify form");
lib/Transforms/Scalar/LoopPredication.cpp 482 LLVM_DEBUG(dbgs() << "IV of type: " << *LatchType
485 LLVM_DEBUG(dbgs() << "LatchCheck.IV: " << *NewLatchCheck.IV << "\n");
486 LLVM_DEBUG(dbgs() << "LatchCheck.Limit: " << *NewLatchCheck.Limit << "\n");
572 LLVM_DEBUG(dbgs() << "Can't expand limit check!\n");
577 LLVM_DEBUG(dbgs() << "Can't expand limit check!\n");
588 LLVM_DEBUG(dbgs() << "LHS: " << *LatchLimit << "\n");
589 LLVM_DEBUG(dbgs() << "RHS: " << *RHS << "\n");
590 LLVM_DEBUG(dbgs() << "Pred: " << LimitCheckPred << "\n");
615 LLVM_DEBUG(dbgs() << "Can't expand limit check!\n");
620 LLVM_DEBUG(dbgs() << "Can't expand limit check!\n");
627 LLVM_DEBUG(dbgs() << "Not the same. PostDecLatchCheckIV: "
666 LLVM_DEBUG(dbgs() << "Analyzing ICmpInst condition:\n");
667 LLVM_DEBUG(ICI->dump());
675 LLVM_DEBUG(dbgs() << "Failed to parse the loop latch condition!\n");
678 LLVM_DEBUG(dbgs() << "Guard check:\n");
679 LLVM_DEBUG(RangeCheck->dump());
681 LLVM_DEBUG(dbgs() << "Unsupported range check predicate("
687 LLVM_DEBUG(dbgs() << "Range check IV is not affine!\n");
694 LLVM_DEBUG(dbgs() << "Range check and latch have IVs different steps!\n");
700 LLVM_DEBUG(dbgs() << "Failed to generate a loop latch check "
713 LLVM_DEBUG(dbgs() << "Range and latch have different step values!\n");
783 LLVM_DEBUG(dbgs() << "Processing guard:\n");
784 LLVM_DEBUG(Guard->dump());
802 LLVM_DEBUG(dbgs() << "Widened checks = " << NumWidened << "\n");
809 LLVM_DEBUG(dbgs() << "Processing guard:\n");
810 LLVM_DEBUG(BI->dump());
830 LLVM_DEBUG(dbgs() << "Widened checks = " << NumWidened << "\n");
839 LLVM_DEBUG(dbgs() << "The loop doesn't have a single latch!\n");
845 LLVM_DEBUG(dbgs() << "Failed to match the latch terminator!\n");
855 LLVM_DEBUG(dbgs() << "Failed to match the latch condition!\n");
860 LLVM_DEBUG(dbgs() << "Failed to parse the loop latch condition!\n");
870 LLVM_DEBUG(dbgs() << "The induction variable is not affine!\n");
876 LLVM_DEBUG(dbgs() << "Unsupported loop stride(" << *Step << ")!\n");
893 LLVM_DEBUG(dbgs() << "Unsupported loop latch predicate(" << Result->Pred
932 LLVM_DEBUG(
936 LLVM_DEBUG(dbgs() << "The value is set to 1.0\n");
959 LLVM_DEBUG(dbgs() << "Analyzing ");
960 LLVM_DEBUG(L->dump());
986 LLVM_DEBUG(dbgs() << "Latch check:\n");
987 LLVM_DEBUG(LatchCheck.dump());
990 LLVM_DEBUG(dbgs() << "Loop not profitable to predicate!\n");
lib/Transforms/Scalar/LoopRerollPass.cpp 591 LLVM_DEBUG(dbgs() << "LRR: Possible IV: " << *I << " = " << *PHISCEV
597 LLVM_DEBUG(dbgs() << "LRR: Possible loop control only IV: " << *I
665 LLVM_DEBUG(dbgs() << "LRR: Possible reduction: " << *I << " (with "
804 LLVM_DEBUG(dbgs() << "LRR: Aborting due to non-instruction: " << *I
827 LLVM_DEBUG(dbgs() << "LRR: Multiple roots found for base - aborting!\n");
843 LLVM_DEBUG(dbgs() << "LRR: Aborting - Root and Base #users not the same: "
983 LLVM_DEBUG(dbgs() << "LRR: Aborting because no root sets found!\n");
988 LLVM_DEBUG(
998 LLVM_DEBUG(dbgs() << "LRR: Aborting - too many iterations found. "
1004 LLVM_DEBUG(dbgs() << "LRR: Successfully found roots: Scale=" << Scale
1039 LLVM_DEBUG(dbgs() << "LRR: Aborting - use sets are different sizes\n");
1196 LLVM_DEBUG(
1203 LLVM_DEBUG(for (auto &KV
1265 LLVM_DEBUG(dbgs() << "LRR: iteration root match failed at "
1302 LLVM_DEBUG(dbgs() << "LRR: iteration root match failed at " << *BaseInst
1313 LLVM_DEBUG(dbgs() << "LRR: iteration root match failed at "
1328 LLVM_DEBUG(dbgs() << "LRR: iteration root match failed at " << *BaseInst
1381 LLVM_DEBUG(dbgs()
1396 LLVM_DEBUG(dbgs() << "LRR: iteration root match failed at " << *BaseInst
1414 LLVM_DEBUG(dbgs() << "LRR: Matched all iteration increments for " << *IV
1439 LLVM_DEBUG(dbgs() << "LRR: removing: " << *J << "\n");
1517 LLVM_DEBUG(dbgs() << "LRR: Out-of-order non-associative reduction: "
1524 LLVM_DEBUG(dbgs()
1623 LLVM_DEBUG(dbgs() << "LRR: Found all root induction increments for: " << *IV
1653 LLVM_DEBUG(dbgs() << "LRR: F[" << Header->getParent()->getName() << "] Loop %"
1665 LLVM_DEBUG(dbgs() << "\n Before Reroll:\n" << *(L->getHeader()) << "\n");
1666 LLVM_DEBUG(dbgs() << "LRR: backedge-taken count = " << *BackedgeTakenCount
1677 LLVM_DEBUG(dbgs() << "LRR: No possible IVs found\n");
1692 LLVM_DEBUG(dbgs() << "\n After Reroll:\n" << *(L->getHeader()) << "\n");
lib/Transforms/Scalar/LoopSimplifyCFG.cpp 459 LLVM_DEBUG(dbgs() << "Deleting dead loop block " << BB->getName()
481 LLVM_DEBUG(dbgs() << "Replacing terminator of " << BB->getName()
538 LLVM_DEBUG(dbgs() << "In function " << Header->getParent()->getName()
542 LLVM_DEBUG(dbgs() << "Loops with irreducible CFG are not supported!\n");
548 LLVM_DEBUG(
556 LLVM_DEBUG(
567 LLVM_DEBUG(
577 LLVM_DEBUG(dump());
579 LLVM_DEBUG(dbgs() << "Constant-folding " << FoldCandidates.size()
587 LLVM_DEBUG(dbgs() << "Deleting " << DeadLoopBlocks.size()
lib/Transforms/Scalar/LoopSink.cpp 238 LLVM_DEBUG(dbgs() << "Sinking a clone of " << I << " To: " << N->getName()
242 LLVM_DEBUG(dbgs() << "Sinking " << I << " To: " << MoveBB->getName() << '\n');
lib/Transforms/Scalar/LoopStrengthReduce.cpp 2469 LLVM_DEBUG(dbgs() << " Change loop exiting icmp to use postinc iv: "
2711 LLVM_DEBUG(print_factors_and_types(dbgs()));
2842 LLVM_DEBUG(dbgs() << "Chain: " << *Chain.Incs[0].UserInst << " users:\n";
2897 LLVM_DEBUG(dbgs() << "Chain: " << *Chain.Incs[0].UserInst << " Cost: " << cost
2951 LLVM_DEBUG(dbgs() << "IV Chain Limit\n");
2964 LLVM_DEBUG(dbgs() << "IV Chain#" << ChainIdx << " Head: (" << *UserInst
2967 LLVM_DEBUG(dbgs() << "IV Chain#" << ChainIdx << " Inc: (" << *UserInst
3038 LLVM_DEBUG(dbgs() << "Collecting IV Chains.\n");
3107 LLVM_DEBUG(dbgs() << "Final Chain: " << *Chain.Incs[0].UserInst << "\n");
3110 LLVM_DEBUG(dbgs() << " Inc: " << *Inc.UserInst << "\n");
3167 LLVM_DEBUG(dbgs() << "Concealed chain head: " << *Head.UserInst << "\n");
3172 LLVM_DEBUG(dbgs() << "Generate chain at: " << *IVSrc << "\n");
3251 LLVM_DEBUG(dbgs() << "Use is in profitable chain: " << **UseI << '\n');
3332 LLVM_DEBUG(print_fixups(dbgs()));
4130 LLVM_DEBUG(dbgs() << "Generating cross-use offsets for " << *Reg << ':';
4146 LLVM_DEBUG(dbgs() << "Skipping cross-use reuse for " << *OrigReg
4302 LLVM_DEBUG(dbgs() << "\n"
4326 LLVM_DEBUG(dbgs() << "Filtering for use "; LU.print(dbgs());
4351 LLVM_DEBUG(dbgs() << " Filtering loser "; F.print(dbgs());
4379 LLVM_DEBUG(dbgs() << " Filtering out formula "; F.print(dbgs());
4401 LLVM_DEBUG(if (ChangedFormulae) {
4431 LLVM_DEBUG(dbgs() << "The search space is too complex.\n");
4433 LLVM_DEBUG(dbgs() << "Narrowing the search space by eliminating formulae "
4455 LLVM_DEBUG(dbgs() << " Deleting "; F.print(dbgs());
4471 LLVM_DEBUG(dbgs() << " Deleting "; F.print(dbgs());
4487 LLVM_DEBUG(dbgs() << "After pre-selection:\n"; print_uses(dbgs()));
4497 LLVM_DEBUG(
4518 LLVM_DEBUG(dbgs() << " Deleting use "; LU.print(dbgs()); dbgs() << '\n');
4526 LLVM_DEBUG(dbgs() << "New fixup has offset " << Fixup.Offset << '\n');
4535 LLVM_DEBUG(dbgs() << " Deleting "; F.print(dbgs()); dbgs() << '\n');
4554 LLVM_DEBUG(dbgs() << "After pre-selection:\n"; print_uses(dbgs()));
4562 LLVM_DEBUG(dbgs() << "The search space is too complex.\n");
4564 LLVM_DEBUG(dbgs() << "Narrowing the search space by re-filtering out "
4569 LLVM_DEBUG(dbgs() << "After pre-selection:\n"; print_uses(dbgs()));
4586 LLVM_DEBUG(
4603 LLVM_DEBUG(dbgs() << "Filtering for use "; LU.print(dbgs());
4649 LLVM_DEBUG(dbgs() << " Filtering out formula "; F.print(dbgs());
4668 LLVM_DEBUG(if (ChangedFormulae) {
4727 LLVM_DEBUG(dbgs() << "The search space is too complex.\n");
4747 LLVM_DEBUG(
4790 LLVM_DEBUG(dbgs() << " The formula "; LU.Formulae[MinIdx].print(dbgs());
4795 LLVM_DEBUG(dbgs() << " Deleting "; LU.Formulae.back().print(dbgs());
4802 LLVM_DEBUG(dbgs() << " Leaving only "; F.print(dbgs()); dbgs() << '\n');
4808 LLVM_DEBUG(dbgs() << "After pre-selection:\n"; print_uses(dbgs()));
4821 LLVM_DEBUG(dbgs() << "The search space is too complex.\n");
4843 LLVM_DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best
4857 LLVM_DEBUG(dbgs() << " Deleting "; F.print(dbgs()); dbgs() << '\n');
4871 LLVM_DEBUG(dbgs() << "After pre-selection:\n"; print_uses(dbgs()));
4953 LLVM_DEBUG(dbgs() << "New best at "; NewCost.print(dbgs());
4982 LLVM_DEBUG(dbgs() << "\nNo Satisfactory Solution\n");
4987 LLVM_DEBUG(dbgs() << "\n"
5515 LLVM_DEBUG(dbgs() << "LSR skipping loop, too many IV Users in " << U
5549 LLVM_DEBUG(dbgs() << "\nLSR on loop ";
5562 LLVM_DEBUG(dbgs() << "LSR skipping outer loop " << *L << "\n");
5575 LLVM_DEBUG(dbgs() << "LSR found " << Uses.size() << " uses:\n";
lib/Transforms/Scalar/LoopUnrollAndJamPass.cpp 173 LLVM_DEBUG(dbgs() << "Won't unroll-and-jam; explicit count set by "
215 LLVM_DEBUG(dbgs() << "Won't unroll-and-jam; can't create remainder and "
238 LLVM_DEBUG(dbgs() << "Won't unroll-and-jam; small inner loop count is "
247 LLVM_DEBUG(
268 LLVM_DEBUG(dbgs() << "Won't unroll-and-jam; No loop invariant loads\n");
307 LLVM_DEBUG(dbgs() << "Loop Unroll and Jam: F["
321 LLVM_DEBUG(dbgs() << " Disabled due to pragma.\n");
326 LLVM_DEBUG(dbgs() << " Disabled due to not being safe.\n");
342 LLVM_DEBUG(dbgs() << " Outer Loop Size: " << OuterLoopSize << "\n");
343 LLVM_DEBUG(dbgs() << " Inner Loop Size: " << InnerLoopSize << "\n");
345 LLVM_DEBUG(dbgs() << " Not unrolling loop which contains non-duplicatable "
350 LLVM_DEBUG(dbgs() << " Not unrolling loop with inlinable calls.\n");
354 LLVM_DEBUG(
lib/Transforms/Scalar/LoopUnrollPass.cpp 430 LLVM_DEBUG(dbgs() << "Adding cost of instruction (iteration "
432 LLVM_DEBUG(I->dump());
467 LLVM_DEBUG(dbgs() << "Starting LoopUnroll profitability analysis...\n");
474 LLVM_DEBUG(dbgs() << " Analyzing iteration " << Iteration << "\n");
542 LLVM_DEBUG(dbgs() << "Can't analyze cost of loop with call\n");
554 LLVM_DEBUG(dbgs() << " Exceeded threshold.. exiting.\n"
610 LLVM_DEBUG(dbgs() << " No opportunities found.. exiting.\n"
632 LLVM_DEBUG(dbgs() << "Analysis finished:\n"
854 LLVM_DEBUG(dbgs() << " will not try to unroll partially because "
908 LLVM_DEBUG(dbgs() << " partially unrolling with count: " << UP.Count
950 LLVM_DEBUG(
972 LLVM_DEBUG(
1004 LLVM_DEBUG(dbgs() << " runtime unrolling with count: " << UP.Count
1022 LLVM_DEBUG(dbgs() << "Loop Unroll: F["
1029 LLVM_DEBUG(
1061 LLVM_DEBUG(dbgs() << " Loop Size = " << LoopSize << "\n");
1063 LLVM_DEBUG(dbgs() << " Not unrolling loop which contains non-duplicatable"
1074 LLVM_DEBUG(dbgs() << " Not unrolling loop with inlinable calls.\n");
lib/Transforms/Scalar/LoopUnswitch.cpp 308 LLVM_DEBUG(dbgs() << "NOT unswitching loop %" << L->getHeader()->getName()
884 LLVM_DEBUG(dbgs() << "NOT unswitching loop %"
893 LLVM_DEBUG(dbgs() << "NOT unswitching loop %"
1002 LLVM_DEBUG(dbgs() << "loop-unswitch: Trivial-Unswitch loop %"
1236 LLVM_DEBUG(dbgs() << "loop-unswitch: Unswitching loop %"
1418 LLVM_DEBUG(dbgs() << "Replace with '" << *V << "': " << *I << "\n");
1589 LLVM_DEBUG(dbgs() << "Remove dead instruction '" << *I << "\n");
lib/Transforms/Scalar/LoopVersioningLICM.cpp 217 LLVM_DEBUG(dbgs() << " loop is not in loop-simplify form.\n");
222 LLVM_DEBUG(dbgs() << " loop is not innermost\n");
227 LLVM_DEBUG(dbgs() << " loop has multiple backedges\n");
232 LLVM_DEBUG(dbgs() << " loop has multiple exiting block\n");
239 LLVM_DEBUG(dbgs() << " loop is not bottom tested\n");
245 LLVM_DEBUG(dbgs() << " Parallel loop is not worth versioning\n");
250 LLVM_DEBUG(dbgs() << " loop depth is more then threshold\n");
257 LLVM_DEBUG(dbgs() << " loop does not has trip count\n");
305 LLVM_DEBUG(dbgs() << " Alias tracker type safety failed!\n");
310 LLVM_DEBUG(dbgs() << " No memory modified in loop body\n");
316 LLVM_DEBUG(dbgs() << " No ambiguity in memory access.\n");
334 LLVM_DEBUG(dbgs() << " Convergent call site found.\n");
339 LLVM_DEBUG(dbgs() << " Unsafe call site found.\n");
346 LLVM_DEBUG(dbgs() << " May throw instruction found in loop body\n");
354 LLVM_DEBUG(dbgs() << " Found a non-simple load.\n");
368 LLVM_DEBUG(dbgs() << " Found a non-simple store.\n");
407 LLVM_DEBUG(dbgs() << " LAA: Runtime check not found !!\n");
413 LLVM_DEBUG(
428 LLVM_DEBUG(dbgs() << " Invariant not found !!\n");
433 LLVM_DEBUG(dbgs() << " Found a read-only loop!\n");
439 LLVM_DEBUG(
442 LLVM_DEBUG(dbgs() << " Invariant loads & stores: "
445 LLVM_DEBUG(dbgs() << " Invariant loads & store threshold: "
479 LLVM_DEBUG(dbgs() << "Loop: " << *CurLoop);
482 LLVM_DEBUG(
488 LLVM_DEBUG(
500 LLVM_DEBUG(
507 LLVM_DEBUG(
519 LLVM_DEBUG(dbgs() << " Loop Versioning found to be beneficial\n\n");
lib/Transforms/Scalar/MemCpyOptimizer.cpp 400 LLVM_DEBUG(dbgs() << "Replace stores:\n"; for (Instruction *SI
527 LLVM_DEBUG(dbgs() << "Lifting " << *I << " before " << *P << "\n");
602 LLVM_DEBUG(dbgs() << "Promoting " << *LI << " to " << *SI << " => "
692 LLVM_DEBUG(dbgs() << "Promoting " << *SI << " to " << *M << "\n");
978 LLVM_DEBUG(dbgs() << "MemCpyOptPass: Forwarding memcpy->memcpy src:\n"
1239 LLVM_DEBUG(dbgs() << "MemCpyOptPass: Optimizing memmove -> memcpy: " << *M
1322 LLVM_DEBUG(dbgs() << "MemCpyOptPass: Forwarding memcpy to byval:\n"
lib/Transforms/Scalar/MergeICmps.cpp 145 LLVM_DEBUG(dbgs() << "load\n");
147 LLVM_DEBUG(dbgs() << "used outside of block\n");
152 LLVM_DEBUG(dbgs() << "volatile or atomic\n");
159 LLVM_DEBUG(dbgs() << "GEP\n");
161 LLVM_DEBUG(dbgs() << "used outside of block\n");
166 LLVM_DEBUG(dbgs() << "not dereferenceable\n");
331 LLVM_DEBUG(dbgs() << "cmp has several uses\n");
336 LLVM_DEBUG(dbgs() << "cmp "
358 LLVM_DEBUG(dbgs() << "branch\n");
366 LLVM_DEBUG(dbgs() << "icmp\n");
375 LLVM_DEBUG(dbgs() << "const\n");
377 LLVM_DEBUG(dbgs() << "false\n");
380 LLVM_DEBUG(dbgs() << "icmp\n");
395 LLVM_DEBUG(dbgs() << "Block '" << Comparison.BB->getName()
401 LLVM_DEBUG(dbgs() << "\n");
449 LLVM_DEBUG(dbgs() << "chain with invalid BCECmpBlock, no merge.\n");
453 LLVM_DEBUG(dbgs() << "block '" << Comparison.BB->getName()
470 LLVM_DEBUG(dbgs()
476 LLVM_DEBUG(dbgs()
512 LLVM_DEBUG(dbgs() << "chain with no BCE basic blocks, no merge\n");
624 LLVM_DEBUG(dbgs() << "Merging " << Comparisons.size() << " comparisons -> "
627 LLVM_DEBUG(dbgs() << "Only one comparison, updating branches\n");
642 LLVM_DEBUG(dbgs() << "Splitting non_BCE work to header\n");
692 LLVM_DEBUG(dbgs() << "Simplifying comparison chain starting at block "
707 LLVM_DEBUG(dbgs() << "Merging block " << Comparisons_[I].BB->getName()
726 LLVM_DEBUG(dbgs() << "Updating jump into old chain from " << Pred->getName()
738 LLVM_DEBUG(dbgs() << "Changing function entry from "
749 LLVM_DEBUG(dbgs() << "Deleting merged block " << Cmp.BB->getName() << "\n");
769 LLVM_DEBUG(dbgs() << "skip: block " << BlockIndex
777 LLVM_DEBUG(dbgs() << "skip: block " << BlockIndex
783 LLVM_DEBUG(dbgs() << "skip: block " << BlockIndex
795 LLVM_DEBUG(dbgs() << "processPhi()\n");
797 LLVM_DEBUG(dbgs() << "skip: only one incoming value in phi\n");
821 LLVM_DEBUG(dbgs() << "skip: several non-constant values\n");
832 LLVM_DEBUG(
841 LLVM_DEBUG(dbgs() << "skip: no non-constant block\n");
845 LLVM_DEBUG(dbgs() << "skip: last block non-phi successor\n");
855 LLVM_DEBUG(dbgs() << "skip: only one compare block\n");
865 LLVM_DEBUG(dbgs() << "MergeICmpsLegacyPass: " << F.getName() << "\n");
lib/Transforms/Scalar/MergedLoadStoreMotion.cpp 188 LLVM_DEBUG(dbgs() << "can Sink? : "; Store0->dump(); dbgs() << "\n");
247 LLVM_DEBUG(dbgs() << "Sink Instruction into BB \n"; BB->dump();
340 LLVM_DEBUG(dbgs() << "Search again\n"; Instruction *I = &*RBI; I->dump());
350 LLVM_DEBUG(dbgs() << "Instruction Merger\n");
lib/Transforms/Scalar/NewGVN.cpp 225 LLVM_DEBUG(dbgs() << "Component root is " << *I << "\n");
231 LLVM_DEBUG(dbgs() << "Component member is " << *Member << "\n");
1072 LLVM_DEBUG(dbgs() << "Simplified " << *I << " to "
1081 LLVM_DEBUG(dbgs() << "Simplified " << *I << " to "
1109 LLVM_DEBUG(dbgs() << "Simplified " << *I << " to "
1430 LLVM_DEBUG(dbgs() << "Coercing load from store " << *DepSI
1446 LLVM_DEBUG(dbgs() << "Coercing load from load " << *LI
1456 LLVM_DEBUG(dbgs() << "Coercing load from meminst " << *DepMI
1538 LLVM_DEBUG(dbgs() << "Found predicate info from instruction !\n");
1578 LLVM_DEBUG(dbgs() << "Copy is not of any condition operands!\n");
1664 LLVM_DEBUG(dbgs() << "Setting " << *From);
1665 LLVM_DEBUG(dbgs() << " equivalent to congruence class ");
1666 LLVM_DEBUG(dbgs() << NewClass->getID()
1668 LLVM_DEBUG(dbgs() << *NewClass->getMemoryLeader() << "\n");
1686 LLVM_DEBUG(dbgs() << "Memory class leader change for class "
1766 LLVM_DEBUG(
1772 LLVM_DEBUG(dbgs() << "No arguments of PHI node " << *I << " are live\n");
1811 LLVM_DEBUG(dbgs() << "Simplified PHI node " << *I << " to " << *AllSameValue
2081 LLVM_DEBUG(dbgs() << "Adding memory user " << *U << " to " << *To << "\n");
2217 LLVM_DEBUG(dbgs() << "Memory class leader change for class "
2227 LLVM_DEBUG(dbgs() << "Memory class leader change for class "
2267 LLVM_DEBUG(dbgs() << "Changing leader of congruence class "
2290 LLVM_DEBUG(dbgs() << "Erasing expression " << *OldClass->getDefiningExpr()
2308 LLVM_DEBUG(dbgs() << "Value class leader change for class "
2372 LLVM_DEBUG(dbgs() << "Created new congruence class for " << *I
2377 LLVM_DEBUG(dbgs() << " and stored value "
2379 LLVM_DEBUG(dbgs() << "\n");
2397 LLVM_DEBUG(dbgs() << "New class " << EClass->getID() << " for expression "
2436 LLVM_DEBUG(dbgs() << "Block " << getBlockName(To)
2441 LLVM_DEBUG(dbgs() << "Block " << getBlockName(To)
2489 LLVM_DEBUG(dbgs() << "Condition for Terminator " << *TI
2493 LLVM_DEBUG(dbgs() << "Condition for Terminator " << *TI
2675 LLVM_DEBUG(dbgs() << "Cannot find phi of ops operand for " << *TransInst
2725 LLVM_DEBUG(dbgs() << "Found possible dependent phi of ops\n");
2732 LLVM_DEBUG(
2802 LLVM_DEBUG(dbgs() << "Skipping phi of ops operand for incoming block "
2810 LLVM_DEBUG(dbgs() << "Found phi of ops operand " << *FoundVal << " in "
2818 LLVM_DEBUG(
2846 LLVM_DEBUG(dbgs() << "Created phi of ops " << *ValuePHI << " for " << *I
2919 LLVM_DEBUG(dbgs() << "Congruence class " << CongruenceClasses[i]->getID()
2991 LLVM_DEBUG(dbgs() << "Skipping trivially dead instruction " << I << "\n");
3057 LLVM_DEBUG(dbgs() << "Memory Phi value numbered to " << *AllSameValue
3060 LLVM_DEBUG(dbgs() << "Memory Phi value numbered to itself\n");
3079 LLVM_DEBUG(dbgs() << "Processing instruction " << *I << "\n");
3260 LLVM_DEBUG(dbgs() << "Beginning iteration verification\n");
3378 LLVM_DEBUG(dbgs() << "Skipping instructions in block "
3390 LLVM_DEBUG(dbgs() << "Processing MemoryPhi " << *MP << "\n");
3460 LLVM_DEBUG(dbgs() << "Block " << getBlockName(&F.getEntryBlock())
3488 LLVM_DEBUG(dbgs() << "We believe block " << getBlockName(&BB)
3680 LLVM_DEBUG(dbgs() << " BasicBlock Dead:" << *BB);
3707 LLVM_DEBUG(dbgs() << "Marking " << *I << " for deletion\n");
3712 LLVM_DEBUG(dbgs() << "Replacing " << *I << " with " << *V << "\n");
3838 LLVM_DEBUG(dbgs() << "Replacing incoming value of " << PHI
3873 LLVM_DEBUG(dbgs() << "Eliminating in congruence class " << CC->getID()
3912 LLVM_DEBUG(dbgs() << "Found replacement " << *(Leader) << " for "
3953 LLVM_DEBUG(dbgs() << "Inserting fully real phi of ops" << *Def
3962 LLVM_DEBUG(dbgs() << "Elimination Stack is empty\n");
3964 LLVM_DEBUG(dbgs() << "Elimination Stack Top DFS numbers are ("
3969 LLVM_DEBUG(dbgs() << "Current DFS numbers are (" << MemberDFSIn << ","
4052 LLVM_DEBUG(dbgs()
4123 LLVM_DEBUG(dbgs() << "Marking dead store " << *Member
lib/Transforms/Scalar/PlaceSafepoints.cpp 323 LLVM_DEBUG(dbgs() << "skipping safepoint placement in finite loop\n");
332 LLVM_DEBUG(
350 LLVM_DEBUG(dbgs() << "[LSP] terminator instruction: " << *Term);
lib/Transforms/Scalar/Reassociate.cpp 172 LLVM_DEBUG(dbgs() << "Calculated Rank[" << Arg.getName() << "] = " << Rank
213 LLVM_DEBUG(dbgs() << "Calculated Rank[" << V->getName() << "] = " << Rank
455 LLVM_DEBUG(dbgs() << "LINEARIZE: " << *I << '\n');
504 LLVM_DEBUG(dbgs() << "OPERAND: " << *Op << " (" << Weight << ")\n");
511 LLVM_DEBUG(dbgs() << "DIRECT ADD: " << *Op << " (" << Weight << ")\n");
524 LLVM_DEBUG(dbgs()
584 LLVM_DEBUG(dbgs()
587 LLVM_DEBUG(dbgs() << *Tmp << '\n');
595 LLVM_DEBUG(dbgs() << "ADD LEAF: " << *Op << " (" << Weight << ")\n");
687 LLVM_DEBUG(dbgs() << "RA: " << *Op << '\n');
689 LLVM_DEBUG(dbgs() << "TO: " << *Op << '\n');
697 LLVM_DEBUG(dbgs() << "RA: " << *Op << '\n');
710 LLVM_DEBUG(dbgs() << "TO: " << *Op << '\n');
723 LLVM_DEBUG(dbgs() << "RA: " << *Op << '\n');
736 LLVM_DEBUG(dbgs() << "TO: " << *Op << '\n');
768 LLVM_DEBUG(dbgs() << "RA: " << *Op << '\n');
770 LLVM_DEBUG(dbgs() << "TO: " << *Op << '\n');
969 LLVM_DEBUG(dbgs() << "Negated: " << *New << '\n');
1454 LLVM_DEBUG(dbgs() << "\nFACTORING [" << NumFound << "]: " << *TheOp
1588 LLVM_DEBUG(dbgs() << "\nFACTORING [" << MaxOcc << "]: " << *MaxOccVal
1911 LLVM_DEBUG(dbgs() << "Erasing dead inst: "; I->dump());
1963 LLVM_DEBUG(dbgs() << "FMul with negative constant: " << *I << '\n');
1977 LLVM_DEBUG(dbgs() << "FDiv with negative constant: " << *I << '\n');
2054 LLVM_DEBUG(dbgs() << "Combine negations for: " << *I << '\n');
2209 LLVM_DEBUG(dbgs() << "RAIn:\t"; PrintOps(I, Ops); dbgs() << '\n');
2227 LLVM_DEBUG(dbgs() << "Reassoc to scalar: " << *V << '\n');
2258 LLVM_DEBUG(dbgs() << "RAOut:\t"; PrintOps(I, Ops); dbgs() << '\n');
lib/Transforms/Scalar/RewriteStatepointsForGC.cpp 615 LLVM_DEBUG(dbgs() << "fBDV-cached: " << I->getName() << " -> "
847 LLVM_DEBUG(dbgs() << "States after initialization:\n");
849 LLVM_DEBUG(dbgs() << " " << Pair.second << " for " << *Pair.first << "\n");
922 LLVM_DEBUG(dbgs() << "States after meet iteration:\n");
924 LLVM_DEBUG(dbgs() << " " << Pair.second << " for " << *Pair.first << "\n");
1123 LLVM_DEBUG(
lib/Transforms/Scalar/SCCP.cpp 282 LLVM_DEBUG(dbgs() << "Marking Block Executable: " << BB->getName() << '\n');
435 LLVM_DEBUG(dbgs() << "markConstant: " << *C << ": " << *V << '\n');
449 LLVM_DEBUG(dbgs() << "markForcedConstant: " << *C << ": " << *V << '\n');
459 LLVM_DEBUG(dbgs() << "markOverdefined: ";
562 LLVM_DEBUG(dbgs() << "Marking Edge Executable: " << Source->getName()
657 LLVM_DEBUG(dbgs() << "SCCP: Don't know how to handle: " << I << '\n');
751 LLVM_DEBUG(dbgs() << "Unknown terminator instruction: " << TI << '\n');
1374 LLVM_DEBUG(dbgs() << "\nPopped off OI-WL: " << *I << '\n');
1390 LLVM_DEBUG(dbgs() << "\nPopped off I-WL: " << *I << '\n');
1408 LLVM_DEBUG(dbgs() << "\nPopped off BBWL: " << *BB << '\n');
1788 LLVM_DEBUG(dbgs() << " Can\'t treat the result of musttail call : " << *CI
1793 LLVM_DEBUG(dbgs() << " Constant: " << *Const << " = " << *V << '\n');
1804 LLVM_DEBUG(dbgs() << "SCCP on function '" << F.getName() << "'\n");
1819 LLVM_DEBUG(dbgs() << "RESOLVING UNDEFs\n");
1831 LLVM_DEBUG(dbgs() << " BasicBlock Dead:" << BB);
1929 LLVM_DEBUG(dbgs() << "Can't zap returns of the function : " << F.getName()
1957 LLVM_DEBUG(dbgs() << "Can't zap return of the block due to present "
2051 LLVM_DEBUG(dbgs() << "RESOLVING UNDEFS\n");
2084 LLVM_DEBUG(dbgs() << " BasicBlock Dead:" << *BB);
2221 LLVM_DEBUG(dbgs() << "Found that GV '" << GV->getName()
lib/Transforms/Scalar/SROA.cpp 678 LLVM_DEBUG(dbgs() << "WARNING: Ignoring " << Size << " byte use @"
698 LLVM_DEBUG(dbgs() << "WARNING: Clamping a " << Size << " byte use @"
815 LLVM_DEBUG(dbgs() << "WARNING: Ignoring " << Size << " byte store @"
1263 LLVM_DEBUG(dbgs() << " original: " << PN << "\n");
1313 LLVM_DEBUG(dbgs() << " speculated to: " << *NewPN << "\n");
1355 LLVM_DEBUG(dbgs() << " original: " << SI << "\n");
1386 LLVM_DEBUG(dbgs() << " speculated to: " << *V << "\n");
2133 LLVM_DEBUG(dbgs() << " start: " << *V << "\n");
2142 LLVM_DEBUG(dbgs() << " shifted: " << *V << "\n");
2148 LLVM_DEBUG(dbgs() << " trunced: " << *V << "\n");
2159 LLVM_DEBUG(dbgs() << " start: " << *V << "\n");
2162 LLVM_DEBUG(dbgs() << " extended: " << *V << "\n");
2171 LLVM_DEBUG(dbgs() << " shifted: " << *V << "\n");
2177 LLVM_DEBUG(dbgs() << " masked: " << *Old << "\n");
2179 LLVM_DEBUG(dbgs() << " inserted: " << *V << "\n");
2196 LLVM_DEBUG(dbgs() << " extract: " << *V << "\n");
2206 LLVM_DEBUG(dbgs() << " shuffle: " << *V << "\n");
2220 LLVM_DEBUG(dbgs() << " insert: " << *V << "\n");
2245 LLVM_DEBUG(dbgs() << " shuffle: " << *V << "\n");
2253 LLVM_DEBUG(dbgs() << " blend: " << *V << "\n");
2356 LLVM_DEBUG(dbgs() << " rewriting " << (IsSplit ? "split " : ""));
2357 LLVM_DEBUG(AS.printSlice(dbgs(), I, ""));
2358 LLVM_DEBUG(dbgs() << "\n");
2388 LLVM_DEBUG(dbgs() << " !!!! Cannot rewrite: " << I << "\n");
2494 LLVM_DEBUG(dbgs() << " original: " << LI << "\n");
2594 LLVM_DEBUG(dbgs() << " to: " << *V << "\n");
2622 LLVM_DEBUG(dbgs() << " to: " << *Store << "\n");
2644 LLVM_DEBUG(dbgs() << " to: " << *Store << "\n");
2649 LLVM_DEBUG(dbgs() << " original: " << SI << "\n");
2717 LLVM_DEBUG(dbgs() << " to: " << *NewSI << "\n");
2751 LLVM_DEBUG(dbgs() << " splat: " << *V << "\n");
2756 LLVM_DEBUG(dbgs() << " original: " << II << "\n");
2806 LLVM_DEBUG(dbgs() << " to: " << *New << "\n");
2872 LLVM_DEBUG(dbgs() << " to: " << *New << "\n");
2880 LLVM_DEBUG(dbgs() << " original: " << II << "\n");
2909 LLVM_DEBUG(dbgs() << " to: " << II << "\n");
2992 LLVM_DEBUG(dbgs() << " to: " << *New << "\n");
3066 LLVM_DEBUG(dbgs() << " to: " << *Store << "\n");
3072 LLVM_DEBUG(dbgs() << " original: " << II << "\n");
3103 LLVM_DEBUG(dbgs() << " to: " << *New << "\n");
3146 LLVM_DEBUG(dbgs() << " original: " << PN << "\n");
3165 LLVM_DEBUG(dbgs() << " to: " << PN << "\n");
3179 LLVM_DEBUG(dbgs() << " original: " << SI << "\n");
3192 LLVM_DEBUG(dbgs() << " to: " << SI << "\n");
3236 LLVM_DEBUG(dbgs() << " Rewriting FCA loads and stores...\n");
3367 LLVM_DEBUG(dbgs() << " to: " << *Load << "\n");
3377 LLVM_DEBUG(dbgs() << " original: " << LI << "\n");
3412 LLVM_DEBUG(dbgs() << " to: " << *Store << "\n");
3424 LLVM_DEBUG(dbgs() << " original: " << SI << "\n");
3629 LLVM_DEBUG(dbgs() << "Pre-splitting loads and stores\n");
3661 LLVM_DEBUG(dbgs() << " Searching for candidate loads and stores\n");
3716 LLVM_DEBUG(dbgs() << " Candidate: " << *I << "\n");
3776 LLVM_DEBUG(
3853 LLVM_DEBUG(dbgs() << " Splitting load: " << *LI << "\n");
3880 LLVM_DEBUG(dbgs() << " new slice [" << NewSlices.back().beginOffset()
3902 LLVM_DEBUG(dbgs() << " Deferred splitting of store: " << *SI
3910 LLVM_DEBUG(dbgs() << " Splitting store of load: " << *SI << "\n");
3927 LLVM_DEBUG(dbgs() << " +" << PartOffset << ":" << *PStore << "\n");
3976 LLVM_DEBUG(dbgs() << " Splitting store: " << *SI << "\n");
3986 LLVM_DEBUG(dbgs() << " of load: " << *LI << "\n");
4027 LLVM_DEBUG(dbgs() << " new slice [" << NewSlices.back().beginOffset()
4031 LLVM_DEBUG(dbgs() << " of split load: " << *PLoad << "\n");
4086 LLVM_DEBUG(dbgs() << " Pre-split slices:\n");
4089 LLVM_DEBUG(AS.print(dbgs(), I, " "));
4174 LLVM_DEBUG(dbgs() << "Rewriting alloca partition "
4435 LLVM_DEBUG(dbgs() << "SROA alloca: " << AI << "\n");
4459 LLVM_DEBUG(AS.print(dbgs()));
4487 LLVM_DEBUG(dbgs() << " Speculating PHIs\n");
4491 LLVM_DEBUG(dbgs() << " Speculating Selects\n");
4512 LLVM_DEBUG(dbgs() << "Deleting dead instruction: " << *I << "\n");
4551 LLVM_DEBUG(dbgs() << "Promoting allocas with mem2reg...\n");
4559 LLVM_DEBUG(dbgs() << "SROA function: " << F.getName() << "\n");
lib/Transforms/Scalar/SimpleLoopUnswitch.cpp 353 LLVM_DEBUG(dbgs() << " Trying to unswitch branch: " << BI << "\n");
404 LLVM_DEBUG({
540 LLVM_DEBUG(dbgs() << " done: unswitching trivial branch...\n");
575 LLVM_DEBUG(dbgs() << " Trying to unswitch switch: " << SI << "\n");
601 LLVM_DEBUG(dbgs() << " unswitching trivial switch...\n");
835 LLVM_DEBUG(dbgs() << " done: unswitching trivial switch...\n");
2379 LLVM_DEBUG(dbgs() << "Turning " << *GI << " into a branch.\n");
2516 LLVM_DEBUG(dbgs() << " Computed multiplier " << CostMultiplier
2615 LLVM_DEBUG(
2653 LLVM_DEBUG(dbgs() << " Total loop cost: " << LoopCost << "\n");
2745 LLVM_DEBUG(dbgs() << " Computed cost of " << CandidateCost
2749 LLVM_DEBUG(dbgs() << " Computed cost of " << CandidateCost
2762 LLVM_DEBUG(dbgs() << "Cannot unswitch, lowest cost found: "
2772 LLVM_DEBUG(dbgs() << " Unswitching non-trivial (cost = "
2849 LLVM_DEBUG(dbgs() << "Unswitching loop in " << F.getName() << ": " << L
2928 LLVM_DEBUG(dbgs() << "Unswitching loop in " << F.getName() << ": " << *L
lib/Transforms/Scalar/Sink.cpp 189 LLVM_DEBUG(dbgs() << "Sink" << *Inst << " (";
244 LLVM_DEBUG(dbgs() << "Sinking iteration " << NumSinkIter << "\n");
lib/Transforms/Scalar/SpeculateAroundPHIs.cpp 66 LLVM_DEBUG(dbgs() << " Unsafe: use in a different BB: " << *UI << "\n");
72 LLVM_DEBUG(dbgs() << " Unsafe: convergent "
85 LLVM_DEBUG(dbgs() << " Unsafe: can't speculate use: " << *UI << "\n");
136 LLVM_DEBUG(dbgs() << " Unsafe: can't speculate transitive use: "
239 LLVM_DEBUG(dbgs() << " Free: " << PN << "\n");
247 LLVM_DEBUG(dbgs() << " Unsafe PHI: " << PN << "\n");
298 LLVM_DEBUG(dbgs() << " Not profitable to fold imm: " << *IncomingC
324 LLVM_DEBUG(dbgs() << " Cost savings " << (TotalMatCost - TotalFoldedCost)
503 LLVM_DEBUG(dbgs() << " Not profitable, speculation cost: " << *PN
563 LLVM_DEBUG(dbgs() << " Speculating around " << SpecPNs.size() << " PHIs!\n");
576 LLVM_DEBUG(dbgs() << " Split critical edge from: " << PredBB->getName()
611 LLVM_DEBUG(dbgs() << " Inserting " << NumSpecInsts
735 LLVM_DEBUG(dbgs() << "Evaluating phi nodes for speculation:\n");
764 LLVM_DEBUG(dbgs() << " No safe and profitable PHIs found!\n");
784 LLVM_DEBUG(dbgs() << " Invalid: predecessor terminator: "
790 LLVM_DEBUG(dbgs() << " Unimportant: phi with only one predecessor\n");
lib/Transforms/Scalar/SpeculativeExecution.cpp 154 LLVM_DEBUG(dbgs() << "Not running SpeculativeExecution because "
lib/Transforms/Scalar/StructurizeCFG.cpp 519 LLVM_DEBUG(dbgs() << "Visiting: "
958 LLVM_DEBUG(dbgs() << "BB: " << Br->getParent()->getName()
1013 LLVM_DEBUG(dbgs() << "Skipping region with uniform control flow: " << *R
lib/Transforms/Scalar/TailRecursionElimination.cpp 313 LLVM_DEBUG(dbgs() << "Marked as tail call candidate: " << *CI << "\n");
714 LLVM_DEBUG(dbgs() << "FOLDING: " << *BB
lib/Transforms/Scalar/WarnMissedTransforms.cpp 26 LLVM_DEBUG(dbgs() << "Leftover unroll transformation\n");
37 LLVM_DEBUG(dbgs() << "Leftover unroll-and-jam transformation\n");
48 LLVM_DEBUG(dbgs() << "Leftover vectorization transformation\n");
73 LLVM_DEBUG(dbgs() << "Leftover distribute transformation\n");
lib/Transforms/Utils/AddDiscriminators.cpp 213 LLVM_DEBUG(dbgs() << "Could not encode discriminator: "
219 LLVM_DEBUG(dbgs() << DIL->getFilename() << ":" << DIL->getLine() << ":"
250 LLVM_DEBUG(dbgs()
lib/Transforms/Utils/BasicBlockUtils.cpp 213 LLVM_DEBUG(dbgs() << "Merging: " << BB->getName() << " into "
lib/Transforms/Utils/CodeExtractor.cpp 212 LLVM_DEBUG(dbgs() << "Region front block: " << Result.front()->getName()
222 LLVM_DEBUG(dbgs() << "The first block cannot be an unwind block\n");
232 LLVM_DEBUG(dbgs() << "No blocks in this region may have entries from "
497 LLVM_DEBUG(dbgs() << "Sinking lifetime.start: " << *LMI.LifeStart
502 LLVM_DEBUG(dbgs() << "Hoisting lifetime.end: " << *LMI.LifeEnd << "\n");
524 LLVM_DEBUG(dbgs() << "Sinking alloca: " << *AI << "\n");
554 LLVM_DEBUG(dbgs() << "Sinking alloca (via bitcast): " << *AI << "\n");
563 LLVM_DEBUG(dbgs() << "Sinking bitcast-of-alloca: " << *BitcastAddr
773 LLVM_DEBUG(dbgs() << "inputs: " << inputs.size() << "\n");
774 LLVM_DEBUG(dbgs() << "outputs: " << outputs.size() << "\n");
788 LLVM_DEBUG(dbgs() << "value used in func: " << *value << "\n");
794 LLVM_DEBUG(dbgs() << "instr used in func: " << *output << "\n");
801 LLVM_DEBUG({
1601 LLVM_DEBUG(if (verifyFunction(*newFunction, &errs())) {
1605 LLVM_DEBUG(if (verifyFunction(*oldFunction))
1607 LLVM_DEBUG(if (AC && verifyAssumptionCache(*oldFunction, AC))
lib/Transforms/Utils/CtorUtils.cpp 138 LLVM_DEBUG(dbgs() << "Optimizing Global Constructor: " << *F << "\n");
lib/Transforms/Utils/Evaluator.cpp 291 LLVM_DEBUG(dbgs() << "Too few arguments for function.\n");
300 LLVM_DEBUG(dbgs() << "Can not convert function argument.\n");
320 LLVM_DEBUG(dbgs() << "Failed to fold bitcast call expr\n");
334 LLVM_DEBUG(dbgs() << "Evaluating Instruction: " << *CurInst << "\n");
338 LLVM_DEBUG(dbgs() << "Store is not simple! Can not evaluate.\n");
343 LLVM_DEBUG(dbgs() << "Folding constant ptr expression: " << *Ptr);
345 LLVM_DEBUG(dbgs() << "; To: " << *Ptr << "\n");
349 LLVM_DEBUG(
359 LLVM_DEBUG(dbgs() << "Store value is too complex to evaluate store. "
366 LLVM_DEBUG(dbgs()
387 LLVM_DEBUG(dbgs() << "Failed to bitcast constant ptr, can not "
393 LLVM_DEBUG(dbgs() << "Evaluated bitcast: " << *Val << "\n");
402 LLVM_DEBUG(dbgs() << "Found a BinaryOperator! Simplifying: "
408 LLVM_DEBUG(dbgs() << "Found a CmpInst! Simplifying: " << *InstResult
414 LLVM_DEBUG(dbgs() << "Found a Cast! Simplifying: " << *InstResult
420 LLVM_DEBUG(dbgs() << "Found a Select! Simplifying: " << *InstResult
425 LLVM_DEBUG(dbgs() << "Found an ExtractValueInst! Simplifying: "
431 LLVM_DEBUG(dbgs() << "Found an InsertValueInst! Simplifying: "
442 LLVM_DEBUG(dbgs() << "Found a GEP! Simplifying: " << *InstResult << "\n");
445 LLVM_DEBUG(
453 LLVM_DEBUG(dbgs() << "Found a constant pointer expression, constant "
459 LLVM_DEBUG(
465 LLVM_DEBUG(dbgs() << "Evaluated load: " << *InstResult << "\n");
468 LLVM_DEBUG(dbgs() << "Found an array alloca. Can not evaluate.\n");
477 LLVM_DEBUG(dbgs() << "Found an alloca. Result: " << *InstResult << "\n");
483 LLVM_DEBUG(dbgs() << "Ignoring debug info.\n");
490 LLVM_DEBUG(dbgs() << "Found inline asm, can not evaluate.\n");
497 LLVM_DEBUG(dbgs() << "Can not optimize a volatile memset "
506 LLVM_DEBUG(dbgs() << "Ignoring no-op memset.\n");
513 LLVM_DEBUG(dbgs() << "Ignoring lifetime intrinsic.\n");
522 LLVM_DEBUG(dbgs()
535 LLVM_DEBUG(dbgs() << "Found a global var that is an invariant: "
538 LLVM_DEBUG(dbgs()
547 LLVM_DEBUG(dbgs() << "Skipping assume intrinsic.\n");
551 LLVM_DEBUG(dbgs() << "Skipping sideeffect intrinsic.\n");
556 LLVM_DEBUG(dbgs() << "Unknown intrinsic. Can not evaluate.\n");
564 LLVM_DEBUG(dbgs() << "Can not resolve function pointer.\n");
575 LLVM_DEBUG(dbgs() << "Constant folded function call. Result: "
578 LLVM_DEBUG(dbgs() << "Can not constant fold function call.\n");
583 LLVM_DEBUG(dbgs() << "Can not constant fold vararg function call.\n");
591 LLVM_DEBUG(dbgs() << "Failed to evaluate function.\n");
600 LLVM_DEBUG(dbgs() << "Successfully evaluated function. Result: "
603 LLVM_DEBUG(dbgs()
608 LLVM_DEBUG(dbgs() << "Found a terminator instruction.\n");
635 LLVM_DEBUG(dbgs() << "Can not handle terminator.");
640 LLVM_DEBUG(dbgs() << "Successfully evaluated block.\n");
644 LLVM_DEBUG(
660 LLVM_DEBUG(dbgs() << "Found an invoke instruction. Finished Block.\n\n");
699 LLVM_DEBUG(dbgs() << "Trying to evaluate BB: " << *CurBB << "\n");
lib/Transforms/Utils/FlattenCFG.cpp 314 LLVM_DEBUG(dbgs() << "Use parallel and/or in:\n" << *FirstCondBlock);
481 LLVM_DEBUG(dbgs() << "If conditions merged into:\n" << *FirstEntryBlock);
lib/Transforms/Utils/FunctionComparator.cpp 391 LLVM_DEBUG(dbgs() << "Looking at valueID " << L->getValueID() << "\n");
lib/Transforms/Utils/LibCallsShrinkWrap.cpp 81 LLVM_DEBUG(dbgs() << "CDCE calls: " << CI->getCalledFunction()->getName()
85 LLVM_DEBUG(dbgs() << "Transformed\n");
423 LLVM_DEBUG(dbgs() << "Not handled powf() and powl()\n");
435 LLVM_DEBUG(dbgs() << "Not handled pow(): constant base out of range\n");
449 LLVM_DEBUG(dbgs() << "Not handled pow(): FP type base\n");
463 LLVM_DEBUG(dbgs() << "Not handled pow(): type too wide\n");
479 LLVM_DEBUG(dbgs() << "Not handled pow(): base not from integer convert\n");
498 LLVM_DEBUG(dbgs() << "== Basic Block After ==");
499 LLVM_DEBUG(dbgs() << *CallBB->getSinglePredecessor() << *CallBB
lib/Transforms/Utils/Local.cpp 762 LLVM_DEBUG(dbgs() << "Looking to fold " << BB->getName() << " into "
786 LLVM_DEBUG(dbgs()
803 LLVM_DEBUG(dbgs() << "Can't fold, phi node " << PN->getName()
1001 LLVM_DEBUG(dbgs() << "Killing Trivial BB: \n" << *BB);
1300 LLVM_DEBUG(dbgs() << "Failed to convert dbg.declare to dbg.value: "
1330 LLVM_DEBUG(dbgs() << "Failed to convert dbg.declare to dbg.value: "
1361 LLVM_DEBUG(dbgs() << "Failed to convert dbg.declare to dbg.value: "
1635 LLVM_DEBUG(dbgs() << "SALVAGE: " << *DII << '\n');
1751 LLVM_DEBUG(dbgs() << "MOVE: " << *DII << '\n');
1775 LLVM_DEBUG(dbgs() << "REWRITE: " << *DII << '\n');
1786 LLVM_DEBUG(dbgs() << "Erased UseBeforeDef: " << *DII << '\n');
2472 LLVM_DEBUG(dbgs() << "Replace dominated use of '" << From->getName()
2688 LLVM_DEBUG(dbgs() << "collectBitParts max recursion depth reached.\n");
2985 LLVM_DEBUG(dbgs() << "Alloca search cancelled on unknown instruction: "
lib/Transforms/Utils/LoopRotationUtils.cpp 242 LLVM_DEBUG(
249 LLVM_DEBUG(dbgs() << "LoopRotation: NOT rotating - contains convergent "
274 LLVM_DEBUG(dbgs() << "LoopRotation: rotating "; L->dump());
512 LLVM_DEBUG(dbgs() << "LoopRotation: into "; L->dump());
615 LLVM_DEBUG(dbgs() << "Folding loop latch " << Latch->getName() << " into "
lib/Transforms/Utils/LoopSimplify.cpp 151 LLVM_DEBUG(dbgs() << "LoopSimplify: Creating pre-header "
252 LLVM_DEBUG(dbgs() << "LoopSimplify: Splitting out a new outer loop\n");
382 LLVM_DEBUG(dbgs() << "LoopSimplify: Inserting unique backedge block "
500 LLVM_DEBUG(dbgs() << "LoopSimplify: Deleting edge from dead predecessor "
524 LLVM_DEBUG(dbgs()
668 LLVM_DEBUG(dbgs() << "LoopSimplify: Eliminating exiting block "
lib/Transforms/Utils/LoopUnroll.cpp 284 LLVM_DEBUG(dbgs() << " Can't unroll; loop preheader-insertion failed.\n");
290 LLVM_DEBUG(dbgs() << " Can't unroll; loop exit-block-insertion failed.\n");
296 LLVM_DEBUG(dbgs() << " Can't unroll; Loop body cannot be cloned.\n");
312 LLVM_DEBUG(dbgs() << " Can't unroll; loop not terminated by a conditional "
325 LLVM_DEBUG(
339 LLVM_DEBUG(dbgs() << "Can't unroll; conditional header must exit the loop");
345 LLVM_DEBUG(
351 LLVM_DEBUG(dbgs() << " Trip Count = " << ULO.TripCount << "\n");
353 LLVM_DEBUG(dbgs() << " Trip Multiple = " << ULO.TripMultiple << "\n");
362 LLVM_DEBUG(dbgs() << "Won't unroll; almost nothing to do\n");
418 LLVM_DEBUG(
442 LLVM_DEBUG(dbgs() << "Won't unroll; remainder loop could not be "
462 LLVM_DEBUG(dbgs() << "COMPLETELY UNROLLING loop %" << Header->getName()
472 LLVM_DEBUG(dbgs() << "PEELING loop %" << Header->getName()
489 LLVM_DEBUG(dbgs() << "UNROLLING loop %" << Header->getName() << " by "
492 LLVM_DEBUG(dbgs() << " with a breakout at trip " << BreakoutTrip);
499 LLVM_DEBUG(dbgs() << " with " << ULO.TripMultiple << " trips per branch");
507 LLVM_DEBUG(dbgs() << " with run-time trip count");
512 LLVM_DEBUG(dbgs() << "!\n");
596 LLVM_DEBUG(dbgs()
lib/Transforms/Utils/LoopUnrollAndJam.cpp 185 LLVM_DEBUG(dbgs() << "Won't unroll-and-jam; almost nothing to do\n");
202 LLVM_DEBUG(dbgs() << "Won't unroll-and-jam; remainder loop could not be "
218 LLVM_DEBUG(dbgs() << "COMPLETELY UNROLL AND JAMMING loop %"
233 LLVM_DEBUG(dbgs() << "UNROLL AND JAMMING loop %" << Header->getName()
236 LLVM_DEBUG(dbgs() << " with " << TripMultiple << " trips per branch");
242 LLVM_DEBUG(dbgs() << " with run-time trip count");
245 LLVM_DEBUG(dbgs() << "!\n");
307 LLVM_DEBUG(dbgs()
636 LLVM_DEBUG(dbgs() << " Confused dependency between:\n"
643 LLVM_DEBUG(dbgs() << " > dependency between:\n"
652 LLVM_DEBUG(dbgs() << " < > dependency between:\n"
745 LLVM_DEBUG(dbgs() << "Won't unroll-and-jam; Address taken\n");
755 LLVM_DEBUG(dbgs() << "Won't unroll-and-jam; Incompatible loop layout\n");
763 LLVM_DEBUG(dbgs() << "Won't unroll-and-jam; Can't currently handle "
771 LLVM_DEBUG(dbgs() << "Won't unroll-and-jam; Inner loop iteration count is "
780 LLVM_DEBUG(dbgs() << "Won't unroll-and-jam; Something may throw\n");
808 LLVM_DEBUG(dbgs() << "Won't unroll-and-jam; can't move required "
817 LLVM_DEBUG(dbgs() << "Won't unroll-and-jam; failed dependency check\n");
lib/Transforms/Utils/LoopUnrollPeel.cpp 277 LLVM_DEBUG(dbgs() << "Force-peeling first " << UnrollForcePeelCount
331 LLVM_DEBUG(dbgs() << "Peel " << DesiredPeelCount
359 LLVM_DEBUG(dbgs() << "Profile-based estimated trip count is " << *PeelCount
365 LLVM_DEBUG(dbgs() << "Peeling first " << *PeelCount
370 LLVM_DEBUG(dbgs() << "Requested peel count: " << *PeelCount << "\n");
371 LLVM_DEBUG(dbgs() << "Already peel count: " << AlreadyPeeled << "\n");
372 LLVM_DEBUG(dbgs() << "Max peel count: " << UnrollPeelMaxCount << "\n");
373 LLVM_DEBUG(dbgs() << "Peel cost: " << LoopSize * (*PeelCount + 1)
375 LLVM_DEBUG(dbgs() << "Max peel cost: " << UP.Threshold << "\n");
lib/Transforms/Utils/LoopUnrollRuntime.cpp 442 LLVM_DEBUG(
552 LLVM_DEBUG(dbgs() << "Trying runtime unrolling on Loop: \n");
553 LLVM_DEBUG(L->dump());
554 LLVM_DEBUG(UseEpilogRemainder ? dbgs() << "Using epilog remainder.\n"
559 LLVM_DEBUG(dbgs() << "Not in simplify form!\n");
571 LLVM_DEBUG(
583 LLVM_DEBUG(
600 LLVM_DEBUG(
620 LLVM_DEBUG(dbgs() << "Could not compute exit block SCEV\n");
630 LLVM_DEBUG(dbgs() << "Could not compute trip count SCEV.\n");
640 LLVM_DEBUG(dbgs() << "High cost for expanding trip count scev!\n");
647 LLVM_DEBUG(
943 LLVM_DEBUG(dbgs() << "Unrolling remainder loop\n");
lib/Transforms/Utils/LoopUtils.cpp 91 LLVM_DEBUG(
95 LLVM_DEBUG(dbgs() << "LoopSimplify: Creating dedicated exit block "
lib/Transforms/Utils/LowerSwitch.cpp 273 LLVM_DEBUG(dbgs() << "LHS: " << LHS << "\n");
275 LLVM_DEBUG(dbgs() << "RHS: " << RHS << "\n");
278 LLVM_DEBUG(dbgs() << "Pivot ==> [" << Pivot.Low->getValue() << ", "
301 LLVM_DEBUG(dbgs() << "LHS Bounds ==> [" << LowerBound->getSExtValue() << ", "
459 LLVM_DEBUG(dbgs() << "Clusterify finished. Total clusters: " << Cases.size()
lib/Transforms/Utils/MisExpect.cpp 101 LLVM_DEBUG(llvm::dbgs() << "------------------\n");
102 LLVM_DEBUG(llvm::dbgs()
104 LLVM_DEBUG(llvm::dbgs() << "Instruction: " << *I << ":\n");
105 LLVM_DEBUG(for (int Idx = 0, Size = Weights.size(); Idx < Size; ++Idx) {
135 LLVM_DEBUG(llvm::dbgs()
137 LLVM_DEBUG(llvm::dbgs() << "Profile Count: " << ProfileCount << ":\n");
138 LLVM_DEBUG(llvm::dbgs()
140 LLVM_DEBUG(llvm::dbgs() << "------------------\n");
lib/Transforms/Utils/PredicateInfo.cpp 604 LLVM_DEBUG(dbgs() << "Visiting " << *Op << "\n");
673 LLVM_DEBUG(dbgs() << "Rename Stack is empty\n");
675 LLVM_DEBUG(dbgs() << "Rename Stack Top DFS numbers are ("
680 LLVM_DEBUG(dbgs() << "Current DFS numbers are (" << VD.DFSIn << ","
700 LLVM_DEBUG(dbgs() << "Skipping execution due to debug counter\n");
711 LLVM_DEBUG(dbgs() << "Found replacement " << *Result.Def << " for "
lib/Transforms/Utils/SSAUpdater.cpp 185 LLVM_DEBUG(dbgs() << " Inserted PHI: " << *InsertedPHI << "\n");
lib/Transforms/Utils/SSAUpdaterBulk.cpp 42 LLVM_DEBUG(dbgs() << "SSAUpdater: Var=" << Var << ": initialized with Ty = "
53 LLVM_DEBUG(dbgs() << "SSAUpdater: Var=" << Var
63 LLVM_DEBUG(dbgs() << "SSAUpdater: Var=" << Var << ": added a use" << *U->get()
137 LLVM_DEBUG(dbgs() << "SSAUpdater: rewriting " << R.Uses.size()
185 LLVM_DEBUG(dbgs() << "SSAUpdater: replacing " << *OldVal << " with " << *V
lib/Transforms/Utils/SimplifyCFG.cpp 861 LLVM_DEBUG(dbgs() << "Threading pred instr: " << *Pred->getTerminator()
875 LLVM_DEBUG(dbgs() << "Threading pred instr: " << *Pred->getTerminator()
885 LLVM_DEBUG(dbgs() << "Leaving: " << *TI << "\n");
926 LLVM_DEBUG(dbgs() << "Threading pred instr: " << *Pred->getTerminator()
1773 LLVM_DEBUG(dbgs() << "SINK: instruction can be sunk: " << *(*LRI)[0]
1786 LLVM_DEBUG(dbgs() << "SINK: #phid values: " << NumPHIdValues << "\n");
1814 LLVM_DEBUG(dbgs() << "SINK: Splitting edge\n");
1836 LLVM_DEBUG(dbgs() << "SINK: Sink: "
1845 LLVM_DEBUG(
2089 LLVM_DEBUG(dbgs() << "SPECULATIVELY EXECUTING BB" << *ThenBB << "\n";);
2405 LLVM_DEBUG(dbgs() << "FOUND IF CONDITION! " << *IfCond
2521 LLVM_DEBUG(dbgs() << "\nCHANGING BRANCH TO TWO RETURNS INTO SELECT:"
2705 LLVM_DEBUG(dbgs() << "FOLDING BRANCH TO COMMON DEST:\n" << *PBI << *BB);
3342 LLVM_DEBUG(dbgs() << "FOLDING BRs:" << *PBI->getParent()
3361 LLVM_DEBUG(dbgs() << *PBI->getParent()->getParent());
3445 LLVM_DEBUG(dbgs() << "INTO: " << *PBI->getParent());
3446 LLVM_DEBUG(dbgs() << *PBI->getParent()->getParent());
3746 LLVM_DEBUG(dbgs() << "Converting 'icmp' chain with " << Values.size()
3771 LLVM_DEBUG(dbgs() << " ** 'icmp' chain unhandled condition: " << *ExtraCase
3803 LLVM_DEBUG(dbgs() << " ** 'icmp' chain result is:\n" << *BB << '\n');
4131 LLVM_DEBUG(dbgs() << "FOLDING: " << *BB
4325 LLVM_DEBUG(dbgs() << "SimplifyCFG: switch default is dead.\n");
4475 LLVM_DEBUG(dbgs() << "SimplifyCFG: switch case " << CaseVal
6051 LLVM_DEBUG(dbgs() << "Removing BB: \n" << *BB);
lib/Transforms/Utils/SimplifyIndVar.cpp 159 LLVM_DEBUG(dbgs() << "INDVARS: Eliminated IV operand: " << *IVOperand
236 LLVM_DEBUG(dbgs() << "INDVARS: Simplified comparison: " << *ICmp << '\n');
267 LLVM_DEBUG(dbgs() << "INDVARS: Eliminated comparison: " << *ICmp << '\n');
271 LLVM_DEBUG(dbgs() << "INDVARS: Eliminated comparison: " << *ICmp << '\n');
282 LLVM_DEBUG(dbgs() << "INDVARS: Turn to unsigned comparison: " << *ICmp
309 LLVM_DEBUG(dbgs() << "INDVARS: Simplified sdiv: " << *SDiv << '\n');
325 LLVM_DEBUG(dbgs() << "INDVARS: Simplified srem: " << *Rem << '\n');
334 LLVM_DEBUG(dbgs() << "INDVARS: Simplified rem: " << *Rem << '\n');
348 LLVM_DEBUG(dbgs() << "INDVARS: Simplified rem: " << *Rem << '\n');
677 LLVM_DEBUG(dbgs() << "INDVARS: Replace IV user: " << *I
718 LLVM_DEBUG(dbgs() << "INDVARS: Eliminated identity: " << *UseInst << '\n');
lib/Transforms/Utils/SplitModule.cpp 103 LLVM_DEBUG(dbgs() << "Partition module with (" << M->size()
195 LLVM_DEBUG(dbgs() << "Root[" << CurrentClusterID << "] cluster_size("
204 LLVM_DEBUG(dbgs() << "----> " << (*MI)->getName()
lib/Transforms/Utils/VNCoercion.cpp 436 LLVM_DEBUG(dbgs() << "GVN WIDENED LOAD: " << *SrcVal << "\n");
437 LLVM_DEBUG(dbgs() << "TO: " << *NewLoad << "\n");
lib/Transforms/Vectorize/LoadStoreVectorizer.cpp 607 LLVM_DEBUG({
629 LLVM_DEBUG(dbgs() << "LSV: Found may-write/throw operation: " << I
633 LLVM_DEBUG(dbgs() << "LSV: Found may-read/write/throw operation: " << I
686 LLVM_DEBUG({
856 LLVM_DEBUG(dbgs() << "LSV: Analyzing a chain of length " << Size << ".\n");
870 LLVM_DEBUG(dbgs() << "LSV: Vectorizing " << Instrs.size()
1003 LLVM_DEBUG(dbgs() << "LSV: Chain doesn't match with the vector factor."
1010 LLVM_DEBUG({
1153 LLVM_DEBUG(dbgs() << "LSV: Chain doesn't match with the vector factor."
1181 LLVM_DEBUG({
1261 LLVM_DEBUG(dbgs() << "LSV: Target said misaligned is allowed? " << Allows
lib/Transforms/Vectorize/LoopVectorizationLegality.cpp 89 LLVM_DEBUG(if (InterleaveOnlyWhenForced && Interleave.Value == 1) dbgs()
115 LLVM_DEBUG(dbgs() << "LV: Not vectorizing: #pragma vectorize disable.\n");
121 LLVM_DEBUG(dbgs() << "LV: Not vectorizing: No #pragma vectorize enable.\n");
127 LLVM_DEBUG(dbgs() << "LV: Not vectorizing: Disabled/already vectorized.\n");
233 LLVM_DEBUG(dbgs() << "LV: ignoring invalid hint '" << Name << "'\n");
268 LLVM_DEBUG(dbgs() << "LV: Too many memory checks needed.\n");
309 LLVM_DEBUG(dbgs() << "LV: Canonical IV not found.\n");
317 LLVM_DEBUG(dbgs() << "LV: Unsupported loop latch branch.\n");
324 LLVM_DEBUG(
334 LLVM_DEBUG(dbgs() << "LV: Loop latch condition is not uniform.\n");
401 LLVM_DEBUG(dbgs() << "LV: Found an outside user for : " << *UI << '\n');
540 LLVM_DEBUG(dbgs() << "LV: Found an induction variable.\n");
556 LLVM_DEBUG(
779 LLVM_DEBUG(dbgs() << "LV: Found FP op with unsafe algebra.\n");
814 LLVM_DEBUG(dbgs() << "LV: Did not find one integer induction var.\n");
1107 LLVM_DEBUG(dbgs() << "LV: Found a loop: " << TheLoop->getHeader()->getName()
1125 LLVM_DEBUG(dbgs() << "LV: We can vectorize this outer loop!\n");
1133 LLVM_DEBUG(dbgs() << "LV: Can't if-convert the loop.\n");
1142 LLVM_DEBUG(dbgs() << "LV: Can't vectorize the instructions or CFG\n");
1151 LLVM_DEBUG(dbgs() << "LV: Can't vectorize due to memory conflicts\n");
1158 LLVM_DEBUG(dbgs() << "LV: We can vectorize this loop"
1187 LLVM_DEBUG(dbgs() << "LV: checking if tail can be folded by masking.\n");
1237 LLVM_DEBUG(dbgs() << "LV: can fold tail by masking.\n");
lib/Transforms/Vectorize/LoopVectorize.cpp 820 LLVM_DEBUG(dbgs()
875 LLVM_DEBUG(debugVectorizationFailure(DebugMsg, I));
1539 LLVM_DEBUG(dbgs() << "LV: Loop hints prevent outer loop vectorization.\n");
1545 LLVM_DEBUG(dbgs() << "LV: Not vectorizing: Interleave is not supported for "
4334 LLVM_DEBUG(dbgs() << "LV: Found an unhandled instruction: " << I);
4450 LLVM_DEBUG(dbgs() << "LV: Found scalar instruction: " << *I << "\n");
4467 LLVM_DEBUG(dbgs() << "LV: Found scalar instruction: " << *Ind << "\n");
4468 LLVM_DEBUG(dbgs() << "LV: Found scalar instruction: " << *IndUpdate
4497 LLVM_DEBUG(dbgs() << "LV: Found scalar instruction: " << *Src << "\n");
4537 LLVM_DEBUG(dbgs() << "LV: Found scalar instruction: " << *Ind << "\n");
4538 LLVM_DEBUG(dbgs() << "LV: Found scalar instruction: " << *IndUpdate
4677 LLVM_DEBUG(dbgs() << "LV: Found uniform instruction: " << *Cmp << "\n");
4738 LLVM_DEBUG(dbgs() << "LV: Found uniform instruction: " << *V << "\n");
4768 LLVM_DEBUG(dbgs() << "LV: Found uniform instruction: " << *OI << "\n");
4813 LLVM_DEBUG(dbgs() << "LV: Found uniform instruction: " << *Ind << "\n");
4814 LLVM_DEBUG(dbgs() << "LV: Found uniform instruction: " << *IndUpdate
4822 LLVM_DEBUG(dbgs() << "LV: Performing code size checks.\n");
4867 LLVM_DEBUG(dbgs() << "LV: Found trip count: " << TC << '\n');
4879 LLVM_DEBUG(
4888 LLVM_DEBUG(
4891 LLVM_DEBUG(dbgs() << "LV: Not allowing scalar epilogue due to low trip "
4911 LLVM_DEBUG(dbgs() << "LV: No tail will remain for any chosen VF.\n");
4958 LLVM_DEBUG(dbgs() << "LV: The Smallest and Widest types: " << SmallestType
4960 LLVM_DEBUG(dbgs() << "LV: The Widest register safe to use is: "
4966 LLVM_DEBUG(dbgs() << "LV: The target has no vector registers.\n");
4973 LLVM_DEBUG(dbgs() << "LV: Clamping the MaxVF to the constant trip count: "
5008 LLVM_DEBUG(dbgs() << "LV: Overriding calculated MaxVF(" << MaxVF
5022 LLVM_DEBUG(dbgs() << "LV: Scalar loop costs: " << (int)ScalarCost << ".\n");
5038 LLVM_DEBUG(dbgs() << "LV: Vector loop of width " << i
5041 LLVM_DEBUG(
5060 LLVM_DEBUG(if (ForceVectorization && Width > 1 && Cost >= ScalarCost) dbgs()
5063 LLVM_DEBUG(dbgs() << "LV: Selecting VF: " << Width << ".\n");
5175 LLVM_DEBUG(dbgs() << "LV: The target has " << TargetNumRegisters
5236 LLVM_DEBUG(dbgs() << "LV: Interleaving because of reductions.\n");
5247 LLVM_DEBUG(dbgs() << "LV: Loop cost is " << LoopCost << '\n');
5275 LLVM_DEBUG(
5280 LLVM_DEBUG(dbgs() << "LV: Interleaving to reduce branch cost.\n");
5288 LLVM_DEBUG(dbgs() << "LV: Interleaving to expose ILP.\n");
5292 LLVM_DEBUG(dbgs() << "LV: Not Interleaving.\n");
5381 LLVM_DEBUG(dbgs() << "LV(REG): Calculating max register usage:\n");
5450 LLVM_DEBUG(dbgs() << "LV(REG): At #" << i << " Interval # "
5469 LLVM_DEBUG({
5672 LLVM_DEBUG(dbgs() << "LV: Found an estimated cost of " << C.first
6403 LLVM_DEBUG(dbgs() << "LV: VPlan computed VF " << VF << ".\n");
6407 LLVM_DEBUG(dbgs() << "LV: VPlan stress testing: "
6414 LLVM_DEBUG(dbgs() << "LV: Using " << (UserVF ? "user " : "") << "VF " << VF
6425 LLVM_DEBUG(
6440 LLVM_DEBUG(
6448 LLVM_DEBUG(dbgs() << "LV: Using user VF " << UserVF << ".\n");
6454 LLVM_DEBUG(printPlans(dbgs()));
6472 LLVM_DEBUG(printPlans(dbgs()));
6481 LLVM_DEBUG(dbgs() << "Setting best plan to VF=" << VF << ", UF=" << UF
6961 LLVM_DEBUG(dbgs() << "LV: Scalarizing:" << *I << "\n");
6965 LLVM_DEBUG(dbgs() << "LV: Scalarizing and predicating:" << *I << "\n");
7156 LLVM_DEBUG(dbgs() << "Sinking" << *SAIt->first << " after"
7495 LLVM_DEBUG(dbgs() << "Vectorizing outer loop in \""
7502 LLVM_DEBUG(verifyFunction(*L->getHeader()->getParent()));
7514 LLVM_DEBUG(dbgs() << "\nLV: Checking a loop in \""
7520 LLVM_DEBUG(
7543 LLVM_DEBUG(dbgs() << "LV: Loop hints prevent vectorization.\n");
7554 LLVM_DEBUG(dbgs() << "LV: Not vectorizing: Cannot prove legality.\n");
7578 LLVM_DEBUG(dbgs() << "LV: Found a loop with a very small trip count. "
7582 LLVM_DEBUG(dbgs() << " But vectorizing was explicitly forced.\n");
7584 LLVM_DEBUG(dbgs() << "\n");
7656 LLVM_DEBUG(dbgs() << "LV: Not vectorizing: loop did not meet vectorization "
7663 LLVM_DEBUG(dbgs() << "LV: Vectorization is possible but not beneficial.\n");
7673 LLVM_DEBUG(dbgs() << "LV: Ignoring UserIC, because vectorization and "
7681 LLVM_DEBUG(dbgs() << "LV: Interleaving is not beneficial.\n");
7693 LLVM_DEBUG(
7721 LLVM_DEBUG(dbgs() << "LV: Interleave Count is " << IC << '\n');
7728 LLVM_DEBUG(dbgs() << "LV: Found a vectorizable loop (" << VF.Width
7736 LLVM_DEBUG(dbgs() << "LV: Found a vectorizable loop (" << VF.Width
7738 LLVM_DEBUG(dbgs() << "LV: Interleave Count is " << IC << '\n');
7797 LLVM_DEBUG(verifyFunction(*L->getHeader()->getParent()));
lib/Transforms/Vectorize/SLPVectorizer.cpp 1733 LLVM_DEBUG(dbgs() << "SLP: schedule " << *SD << "\n");
1755 LLVM_DEBUG(dbgs()
1787 LLVM_DEBUG(dbgs()
1813 LLVM_DEBUG(dbgs()
2134 LLVM_DEBUG(dbgs() << "SLP: Need to extract: Extra arg from lane "
2139 LLVM_DEBUG(dbgs() << "SLP: Checking user:" << *U << ".\n");
2153 LLVM_DEBUG(dbgs() << "SLP: \tInternal user will be removed:" << *U
2164 LLVM_DEBUG(dbgs() << "SLP: Need to extract:" << *U << " from lane "
2178 LLVM_DEBUG(dbgs() << "SLP: Gathering due to max recursion depth.\n");
2185 LLVM_DEBUG(dbgs() << "SLP: Gathering due to vector type.\n");
2192 LLVM_DEBUG(dbgs() << "SLP: Gathering due to store vector type.\n");
2199 LLVM_DEBUG(dbgs() << "SLP: Gathering due to C,S,B,O. \n");
2210 LLVM_DEBUG(dbgs() << "SLP: The instruction (" << *V
2219 LLVM_DEBUG(dbgs() << "SLP: \tChecking bundle: " << *S.OpValue << ".\n");
2221 LLVM_DEBUG(dbgs() << "SLP: Gathering due to partial overlap.\n");
2228 LLVM_DEBUG(dbgs() << "SLP: Perfect diamond merge at " << *S.OpValue
2239 LLVM_DEBUG(dbgs() << "SLP: The instruction (" << *V
2251 LLVM_DEBUG(dbgs() << "SLP: Gathering due to gathered scalar.\n");
2265 LLVM_DEBUG(dbgs() << "SLP: bundle in unreachable block.\n");
2284 LLVM_DEBUG(dbgs() << "SLP: Shuffle for reused scalars.\n");
2287 LLVM_DEBUG(dbgs() << "SLP: Scalar used twice in bundle.\n");
2302 LLVM_DEBUG(dbgs() << "SLP: We are not able to schedule this bundle!\n");
2310 LLVM_DEBUG(dbgs() << "SLP: We are able to schedule this bundle.\n");
2325 LLVM_DEBUG(dbgs()
2336 LLVM_DEBUG(dbgs() << "SLP: added a vector of PHINodes.\n");
2358 LLVM_DEBUG(dbgs() << "SLP: Reusing or shuffling extract sequence.\n");
2370 LLVM_DEBUG({
2392 LLVM_DEBUG(dbgs() << "SLP: Gather extract sequence.\n");
2412 LLVM_DEBUG(dbgs() << "SLP: Gathering loads of non-packed type.\n");
2426 LLVM_DEBUG(dbgs() << "SLP: Gathering non-simple loads.\n");
2458 LLVM_DEBUG(dbgs() << "SLP: added a vector of loads.\n");
2467 LLVM_DEBUG(dbgs() << "SLP: added a vector of jumbled loads.\n");
2473 LLVM_DEBUG(dbgs() << "SLP: Gathering non-consecutive loads.\n");
2498 LLVM_DEBUG(dbgs()
2505 LLVM_DEBUG(dbgs() << "SLP: added a vector of casts.\n");
2531 LLVM_DEBUG(dbgs()
2539 LLVM_DEBUG(dbgs() << "SLP: added a vector of compares.\n");
2587 LLVM_DEBUG(dbgs() << "SLP: added a vector of un/bin op.\n");
2616 LLVM_DEBUG(dbgs() << "SLP: not-vectorizable GEP (nested indexes).\n");
2630 LLVM_DEBUG(dbgs()
2643 LLVM_DEBUG(dbgs()
2654 LLVM_DEBUG(dbgs() << "SLP: added a vector of GEPs.\n");
2673 LLVM_DEBUG(dbgs() << "SLP: Non-consecutive store.\n");
2679 LLVM_DEBUG(dbgs() << "SLP: added a vector of stores.\n");
2698 LLVM_DEBUG(dbgs() << "SLP: Non-vectorizable call.\n");
2715 LLVM_DEBUG(dbgs() << "SLP: mismatched calls:" << *CI << "!=" << *V
2728 LLVM_DEBUG(dbgs() << "SLP: mismatched arguments in call:" << *CI
2743 LLVM_DEBUG(dbgs() << "SLP: mismatched bundle operands in calls:"
2770 LLVM_DEBUG(dbgs() << "SLP: ShuffleVector are not vectorized.\n");
2775 LLVM_DEBUG(dbgs() << "SLP: added a ShuffleVector op.\n");
2803 LLVM_DEBUG(dbgs() << "SLP: Gathering unknown instruction.\n");
3218 LLVM_DEBUG(dbgs() << "SLP: Call cost " << VecCallCost - ScalarCallCost
3273 LLVM_DEBUG(dbgs() << "SLP: Check whether the tree with height "
3327 LLVM_DEBUG(dbgs() << "SLP: Assume load combining for scalar reduction of "
3381 LLVM_DEBUG({
3424 LLVM_DEBUG(dbgs() << "SLP: Calculating cost for tree of size "
3453 LLVM_DEBUG(dbgs() << "SLP: Adding cost " << C
3500 LLVM_DEBUG(dbgs() << Str);
3726 LLVM_DEBUG(dbgs() << "SLP: Diamond merged for " << *E->Scalars[0] << ".\n");
3877 LLVM_DEBUG(dbgs() << "SLP: Diamond merged for " << *VL0 << ".\n");
3899 LLVM_DEBUG(dbgs() << "SLP: Diamond merged for " << *VL0 << ".\n");
3927 LLVM_DEBUG(dbgs() << "SLP: Diamond merged for " << *VL0 << ".\n");
3946 LLVM_DEBUG(dbgs() << "SLP: Diamond merged for " << *VL0 << ".\n");
3989 LLVM_DEBUG(dbgs() << "SLP: Diamond merged for " << *VL0 << ".\n");
4131 LLVM_DEBUG(dbgs() << "SLP: OpVec[" << j << "]: " << *OpVec << "\n");
4177 LLVM_DEBUG(dbgs() << "SLP: Diamond merged for " << *VL0 << ".\n");
4263 LLVM_DEBUG(dbgs() << "SLP: Extracting " << ExternalUses.size()
4352 LLVM_DEBUG(dbgs() << "SLP: Replaced:" << *User << ".\n");
4373 LLVM_DEBUG(dbgs() << "SLP: \tvalidating user:" << *U << ".\n");
4381 LLVM_DEBUG(dbgs() << "SLP: \tErasing scalar:" << *Scalar << ".\n");
4392 LLVM_DEBUG(dbgs() << "SLP: Optimizing " << GatherSeq.size()
4489 LLVM_DEBUG(dbgs() << "SLP: bundle: " << *S.OpValue << "\n");
4506 LLVM_DEBUG(dbgs() << "SLP: reset schedule because " << *BundleMember
4543 LLVM_DEBUG(dbgs() << "SLP: try schedule bundle " << *Bundle << " in block "
4574 LLVM_DEBUG(dbgs() << "SLP: cancel scheduling of " << *Bundle << "\n");
4633 LLVM_DEBUG(dbgs() << "SLP: initialize schedule region to " << *I << "\n");
4645 LLVM_DEBUG(dbgs() << "SLP: exceeded schedule region size limit\n");
4655 LLVM_DEBUG(dbgs() << "SLP: extend schedule region start to " << *I
4669 LLVM_DEBUG(dbgs() << "SLP: extend schedule region end to " << *I
4734 LLVM_DEBUG(dbgs() << "SLP: update deps of " << *BundleMember
4836 LLVM_DEBUG(dbgs() << "SLP: gets ready on update: " << *SD->Inst
4860 LLVM_DEBUG(dbgs() << "SLP: schedule block " << BS->BB->getName() << "\n");
5293 LLVM_DEBUG(dbgs() << "SLP: Analyzing blocks in " << F.getName() << ".\n");
5308 LLVM_DEBUG(dbgs() << "SLP: Found stores for " << Stores.size()
5320 LLVM_DEBUG(dbgs() << "SLP: Found GEPs for " << GEPs.size()
5328 LLVM_DEBUG(dbgs() << "SLP: vectorized \"" << F.getName() << "\"\n");
5329 LLVM_DEBUG(verifyFunction(F));
5337 LLVM_DEBUG(dbgs() << "SLP: Analyzing a store chain of length " << ChainLen
5357 LLVM_DEBUG(dbgs() << "SLP: Analyzing " << VF << " stores at offset " << i
5368 LLVM_DEBUG(dbgs() << "SLP: Found cost=" << Cost << " for VF=" << VF
5371 LLVM_DEBUG(dbgs() << "SLP: Decided to vectorize cost=" << Cost << "\n");
5507 LLVM_DEBUG(dbgs() << "SLP: Trying to vectorize a list of length = "
5577 LLVM_DEBUG(dbgs() << "SLP: Analyzing " << OpsWidth << " operations "
5602 LLVM_DEBUG(dbgs() << "SLP: Vectorizing list at cost:" << Cost << ".\n");
6444 LLVM_DEBUG(dbgs() << "SLP: Vectorizing horizontal reduction at cost:"
6568 LLVM_DEBUG(dbgs() << "SLP: Adding cost " << VecReduxCost - ScalarReduxCost
6836 LLVM_DEBUG(dbgs() << "SLP: array mappable to vector: " << *IVI << "\n");
6925 LLVM_DEBUG(dbgs() << "SLP: Trying to vectorize starting at PHIs ("
7029 LLVM_DEBUG(dbgs() << "SLP: Analyzing a getelementptr list of length "
7118 LLVM_DEBUG(dbgs() << "SLP: Analyzing a store chain of length "
lib/Transforms/Vectorize/VPlan.cpp 120 LLVM_DEBUG(dbgs() << "LV: created " << NewBB->getName() << '\n');
143 LLVM_DEBUG(dbgs() << "LV: draw edge from" << PredBB->getName() << '\n');
193 LLVM_DEBUG(dbgs() << "LV: vectorizing VPBB:" << getName()
227 LLVM_DEBUG(dbgs() << "LV: filled BB:" << *NewBB);
250 LLVM_DEBUG(dbgs() << "LV: VPBlock in RPO " << Block->getName() << '\n');
267 LLVM_DEBUG(dbgs() << "LV: VPBlock in RPO " << Block->getName() << '\n');
lib/Transforms/Vectorize/VPlanHCFGBuilder.cpp 116 LLVM_DEBUG(dbgs() << "Creating VPBasicBlock for " << BB->getName() << "\n");
340 LLVM_DEBUG(Plan.setName("HCFGBuilder: Plain CFG\n"); dbgs() << Plan);
346 LLVM_DEBUG(dbgs() << "Dominator Tree after building the plain CFG.\n";
352 LLVM_DEBUG(dbgs() << "VPLoop Info After buildPlainCFG:\n";
lib/Transforms/Vectorize/VPlanPredicator.cpp 221 LLVM_DEBUG(dbgs() << "Linearizing: " << PrevBlock->getName() << "->"
lib/Transforms/Vectorize/VPlanSLP.cpp 82 LLVM_DEBUG(dbgs() << "VPSLP: not all operands are VPInstructions\n");
99 LLVM_DEBUG(dbgs() << "VPSLP: Opcodes do not agree \n");
107 LLVM_DEBUG(dbgs() << "VPSLP: operands in different BBs\n");
113 LLVM_DEBUG(dbgs() << "VPSLP: Some operands have multiple users.\n");
133 LLVM_DEBUG(
143 LLVM_DEBUG(dbgs() << "VPSLP: only simple loads are supported.\n");
153 LLVM_DEBUG(dbgs() << "VPSLP: only simple stores are supported.\n");
246 LLVM_DEBUG(dbgs() << " getBest\n");
249 LLVM_DEBUG(dbgs() << " Candidates for "
255 LLVM_DEBUG(dbgs() << *cast<VPInstruction>(Candidate)->getUnderlyingInstr()
260 LLVM_DEBUG(dbgs() << "\n");
291 LLVM_DEBUG(dbgs() << "Found best "
305 LLVM_DEBUG(dbgs() << "Reordering multinode\n");
317 LLVM_DEBUG(dbgs() << " Finding best value for lane " << Lane << "\n");
319 LLVM_DEBUG(dbgs() << " Candidates ");
321 LLVM_DEBUG(
326 LLVM_DEBUG(dbgs() << "\n");
329 LLVM_DEBUG(dbgs() << " Checking " << Op << "\n");
383 LLVM_DEBUG({
399 LLVM_DEBUG({
406 LLVM_DEBUG(dbgs() << " Same opcode, continue building\n");
409 LLVM_DEBUG(dbgs() << " Adding multinode Ops\n");
419 LLVM_DEBUG(dbgs() << "Reorder \n");
434 LLVM_DEBUG(dbgs() << "Found final order\n");
437 LLVM_DEBUG(dbgs() << " NonCommuntative\n");
466 LLVM_DEBUG(dbgs() << "Create VPInstruction "; VPI->print(dbgs());
lib/Transforms/Vectorize/VPlanVerifier.cpp 129 LLVM_DEBUG(dbgs() << "Verifying VPlan H-CFG.\n");
tools/bugpoint/ExtractFunction.cpp 326 LLVM_DEBUG(errs() << "Removing function ");
327 LLVM_DEBUG(TNOF->printAsOperand(errs(), false));
328 LLVM_DEBUG(errs() << "\n");
tools/bugpoint/OptimizerDriver.cpp 227 LLVM_DEBUG(errs() << "\nAbout to run:\t";
tools/bugpoint/ToolRunner.cpp 194 LLVM_DEBUG(errs() << "\nAbout to run:\t";
462 LLVM_DEBUG(errs() << "\nAbout to run:\t";
580 LLVM_DEBUG(errs() << "\nAbout to run:\t";
584 LLVM_DEBUG(errs() << "\nSending output to " << OutputFile << "\n");
687 LLVM_DEBUG(errs() << "\nAbout to run:\t";
734 LLVM_DEBUG(
743 LLVM_DEBUG(errs() << "<run locally>");
831 LLVM_DEBUG(errs() << "\nAbout to run:\t";
tools/clang/lib/AST/ExprConstant.cpp 9519 LLVM_DEBUG(llvm::dbgs() << "The number of elements to initialize: "
tools/clang/lib/Analysis/BodyFarm.cpp 318 LLVM_DEBUG(llvm::dbgs() << "Generating body for call_once\n");
346 LLVM_DEBUG(llvm::dbgs() << "Flag field is not a record: "
363 LLVM_DEBUG(llvm::dbgs() << "No field _M_once or __state_ found on "
371 LLVM_DEBUG(llvm::dbgs()
400 LLVM_DEBUG(llvm::dbgs() << "Types of params of the callback do not match "
416 LLVM_DEBUG(llvm::dbgs() << "Types of params of the callback do not match "
tools/clang/lib/CodeGen/ObjectFilePCHContainerOperations.cpp 293 LLVM_DEBUG({
tools/clang/lib/Format/BreakableToken.cpp 70 LLVM_DEBUG(llvm::dbgs() << "Comment split: \"" << Text
448 LLVM_DEBUG({
tools/clang/lib/Format/ContinuationIndenter.cpp 1886 LLVM_DEBUG(llvm::dbgs() << "Breaking protruding token at column "
1890 LLVM_DEBUG(llvm::dbgs()
1899 LLVM_DEBUG(llvm::dbgs() << " Over limit, need: "
1919 LLVM_DEBUG(llvm::dbgs() << " No break opportunity.\n");
1946 LLVM_DEBUG(llvm::dbgs() << " ToSplit: " << ToSplitColumns << "\n");
1966 LLVM_DEBUG(llvm::dbgs()
1968 LLVM_DEBUG(llvm::dbgs()
1981 LLVM_DEBUG(llvm::dbgs()
1990 LLVM_DEBUG(llvm::dbgs() << " Continuing on line...\n");
2006 LLVM_DEBUG(llvm::dbgs() << " Breaking...\n");
2012 LLVM_DEBUG(llvm::dbgs()
2039 LLVM_DEBUG(llvm::dbgs() << " Breaking at: " << TailOffset + Split.first
2079 LLVM_DEBUG(llvm::dbgs()
2083 LLVM_DEBUG(llvm::dbgs() << SplitBeforeNext.first << ", "
2092 LLVM_DEBUG(llvm::dbgs()
2106 LLVM_DEBUG(llvm::dbgs() << " Did not find later break\n");
2115 LLVM_DEBUG(llvm::dbgs() << " Next split protrudes, need: "
2128 LLVM_DEBUG(llvm::dbgs() << "not found.\n");
2170 LLVM_DEBUG(llvm::dbgs() << "Replacing whitespace after last line.\n");
tools/clang/lib/Format/Format.cpp 1172 LLVM_DEBUG(llvm::dbgs()
1788 LLVM_DEBUG(llvm::dbgs()
2615 LLVM_DEBUG(llvm::dbgs() << "Trying " << ConfigFile << "...\n");
2624 LLVM_DEBUG(llvm::dbgs() << "Trying " << ConfigFile << "...\n");
2646 LLVM_DEBUG(llvm::dbgs()
tools/clang/lib/Format/SortJavaScriptImports.cpp 189 LLVM_DEBUG(llvm::dbgs() << "Replacing imports:\n"
307 LLVM_DEBUG({
tools/clang/lib/Format/TokenAnalyzer.cpp 57 LLVM_DEBUG(
61 LLVM_DEBUG(llvm::dbgs() << "Language: " << getLanguageName(Style.Language)
76 LLVM_DEBUG(llvm::dbgs() << "Run " << Run << "...\n");
88 LLVM_DEBUG({
tools/clang/lib/Format/TokenAnnotator.cpp 2294 LLVM_DEBUG({ printDebugInfo(Line); });
tools/clang/lib/Format/UnwrappedLineFormatter.cpp 962 LLVM_DEBUG(llvm::dbgs()
987 LLVM_DEBUG(llvm::dbgs() << "Could not find a solution.\n");
995 LLVM_DEBUG(llvm::dbgs()
997 LLVM_DEBUG(llvm::dbgs() << "---\n");
1038 LLVM_DEBUG({
tools/clang/lib/Format/UnwrappedLineParser.cpp 259 LLVM_DEBUG(llvm::dbgs() << "----\n");
2474 LLVM_DEBUG({
tools/clang/lib/Format/UsingDeclarationsSorter.cpp 162 LLVM_DEBUG({
tools/clang/lib/StaticAnalyzer/Core/CallEvent.cpp 557 LLVM_DEBUG({
tools/clang/lib/StaticAnalyzer/Core/MemRegion.cpp 1260 LLVM_DEBUG(llvm::dbgs() << "MemRegion::getAsArrayOffset: "
tools/clang/lib/Tooling/Tooling.cpp 545 LLVM_DEBUG({ llvm::dbgs() << "Processing: " << File << ".\n"; });
tools/clang/tools/extra/clang-include-fixer/IncludeFixer.cpp 158 LLVM_DEBUG(llvm::dbgs() << "Query missing complete type '" << QueryString
279 LLVM_DEBUG(llvm::dbgs() << "TypoScopeQualifiers: " << TypoScopeString
360 LLVM_DEBUG(llvm::dbgs() << "Looking up '" << Query << "' at ");
361 LLVM_DEBUG(CI->getSourceManager()
365 LLVM_DEBUG(llvm::dbgs() << " ...");
393 LLVM_DEBUG(llvm::dbgs() << "Having found " << MatchedSymbols.size()
tools/clang/tools/extra/clang-include-fixer/SymbolIndexManager.cpp 99 LLVM_DEBUG(llvm::dbgs() << "Searching " << Names.back() << "... got "
tools/clang/tools/extra/clang-move/HelperDeclRefGraph.cpp 118 LLVM_DEBUG(llvm::dbgs() << "Find helper function usage: "
128 LLVM_DEBUG(llvm::dbgs()
tools/clang/tools/extra/clang-move/Move.cpp 676 LLVM_DEBUG(llvm::dbgs() << "Add helper : " << ND->getNameAsString() << " ("
736 LLVM_DEBUG(llvm::dbgs() << "Check helper is used: "
740 LLVM_DEBUG(llvm::dbgs() << "Helper removed in old.cc: "
821 LLVM_DEBUG(llvm::dbgs() << "Helper used in new.cc: " << D->getNameAsString()
930 LLVM_DEBUG(RGBuilder.getGraph()->dump());
tools/clang/tools/extra/clang-tidy/ClangTidyOptions.cpp 227 LLVM_DEBUG(llvm::dbgs() << "Getting options for file " << FileName
257 LLVM_DEBUG(llvm::dbgs()
285 LLVM_DEBUG(llvm::dbgs() << "Trying " << ConfigFile << "...\n");
tools/clang/tools/extra/clang-tidy/readability/IdentifierNamingCheck.cpp 864 LLVM_DEBUG(llvm::dbgs()
901 LLVM_DEBUG(llvm::dbgs()
tools/clang/unittests/Format/FormatTest.cpp 37 LLVM_DEBUG(llvm::errs() << "---\n");
38 LLVM_DEBUG(llvm::errs() << Code << "\n\n");
51 LLVM_DEBUG(llvm::errs() << "\n" << *Result << "\n\n");
tools/clang/unittests/Format/FormatTestCSharp.cpp 23 LLVM_DEBUG(llvm::errs() << "---\n");
24 LLVM_DEBUG(llvm::errs() << Code << "\n\n");
29 LLVM_DEBUG(llvm::errs() << "\n" << *Result << "\n\n");
tools/clang/unittests/Format/FormatTestComments.cpp 40 LLVM_DEBUG(llvm::errs() << "---\n");
41 LLVM_DEBUG(llvm::errs() << Code << "\n\n");
54 LLVM_DEBUG(llvm::errs() << "\n" << *Result << "\n\n");
tools/clang/unittests/Format/FormatTestJS.cpp 23 LLVM_DEBUG(llvm::errs() << "---\n");
24 LLVM_DEBUG(llvm::errs() << Code << "\n\n");
32 LLVM_DEBUG(llvm::errs() << "\n" << *Result << "\n\n");
tools/clang/unittests/Format/FormatTestJava.cpp 23 LLVM_DEBUG(llvm::errs() << "---\n");
24 LLVM_DEBUG(llvm::errs() << Code << "\n\n");
29 LLVM_DEBUG(llvm::errs() << "\n" << *Result << "\n\n");
tools/clang/unittests/Format/FormatTestObjC.cpp 42 LLVM_DEBUG(llvm::errs() << "---\n");
43 LLVM_DEBUG(llvm::errs() << Code << "\n\n");
55 LLVM_DEBUG(llvm::errs() << "\n" << *Result << "\n\n");
tools/clang/unittests/Format/FormatTestProto.cpp 23 LLVM_DEBUG(llvm::errs() << "---\n");
24 LLVM_DEBUG(llvm::errs() << Code << "\n\n");
29 LLVM_DEBUG(llvm::errs() << "\n" << *Result << "\n\n");
tools/clang/unittests/Format/FormatTestRawStrings.cpp 35 LLVM_DEBUG(llvm::errs() << "---\n");
36 LLVM_DEBUG(llvm::errs() << Code << "\n\n");
49 LLVM_DEBUG(llvm::errs() << "\n" << *Result << "\n\n");
tools/clang/unittests/Format/FormatTestSelective.cpp 23 LLVM_DEBUG(llvm::errs() << "---\n");
24 LLVM_DEBUG(llvm::errs() << Code << "\n\n");
32 LLVM_DEBUG(llvm::errs() << "\n" << *Result << "\n\n");
tools/clang/unittests/Format/FormatTestTableGen.cpp 23 LLVM_DEBUG(llvm::errs() << "---\n");
24 LLVM_DEBUG(llvm::errs() << Code << "\n\n");
29 LLVM_DEBUG(llvm::errs() << "\n" << *Result << "\n\n");
tools/clang/unittests/Format/FormatTestTextProto.cpp 23 LLVM_DEBUG(llvm::errs() << "---\n");
24 LLVM_DEBUG(llvm::errs() << Code << "\n\n");
29 LLVM_DEBUG(llvm::errs() << "\n" << *Result << "\n\n");
tools/clang/unittests/Format/NamespaceEndCommentsFixerTest.cpp 27 LLVM_DEBUG(llvm::errs() << "---\n");
28 LLVM_DEBUG(llvm::errs() << Code << "\n\n");
33 LLVM_DEBUG(llvm::errs() << "\n" << *Result << "\n\n");
tools/clang/unittests/Format/UsingDeclarationsSorterTest.cpp 25 LLVM_DEBUG(llvm::errs() << "---\n");
26 LLVM_DEBUG(llvm::errs() << Code << "\n\n");
31 LLVM_DEBUG(llvm::errs() << "\n" << *Result << "\n\n");
tools/clang/unittests/libclang/LibclangTest.cpp 441 LLVM_DEBUG(llvm::dbgs()
451 LLVM_DEBUG(llvm::dbgs() << "Reparse failed\n");
682 LLVM_DEBUG(llvm::dbgs() << "Saving failed\n");
691 LLVM_DEBUG(llvm::dbgs() << "Loading failed\n");
tools/lld/lib/ReaderWriter/MachO/CompactUnwindPass.cpp 284 LLVM_DEBUG(llvm::dbgs() << "MachO Compact Unwind pass\n");
321 LLVM_DEBUG(llvm::dbgs() << " Splitting entries into pages\n");
338 LLVM_DEBUG(llvm::dbgs()
364 LLVM_DEBUG(llvm::dbgs() << " Collecting __compact_unwind entries\n");
373 LLVM_DEBUG(llvm::dbgs() << " Entry for "
377 LLVM_DEBUG(llvm::dbgs()
381 LLVM_DEBUG(llvm::dbgs() << '\n');
456 LLVM_DEBUG(llvm::dbgs() << " Creating __unwind_info entries\n");
467 LLVM_DEBUG(llvm::dbgs()
tools/lld/lib/ReaderWriter/MachO/LayoutPass.cpp 193 LLVM_DEBUG(reason = formatReason("override", lc._override, rc._override));
202 LLVM_DEBUG(
212 LLVM_DEBUG(reason =
229 LLVM_DEBUG(reason = formatReason(".o order", (int)leftFile->ordinal(),
239 LLVM_DEBUG(reason = formatReason("ordinal", (int)leftRoot->ordinal(),
254 LLVM_DEBUG({
444 LLVM_DEBUG(llvm::dbgs() << "******** Laying out atoms:\n");
453 LLVM_DEBUG(checkFollowonChain(atomRange));
458 LLVM_DEBUG({
468 LLVM_DEBUG(checkTransitivity(vec, _customSorter));
471 LLVM_DEBUG({
476 LLVM_DEBUG(llvm::dbgs() << "******** Finished laying out atoms\n");
tools/lld/lib/ReaderWriter/MachO/MachONormalizedFileToAtoms.cpp 1433 LLVM_DEBUG(llvm::dbgs() << "******** Normalizing file to atoms: "
tools/lld/wasm/Driver.cpp 347 LLVM_DEBUG(errorHandler().verbose = true);
tools/lld/wasm/InputChunks.cpp 103 LLVM_DEBUG(dbgs() << "applying relocations: " << toString(this)
110 LLVM_DEBUG(dbgs() << "apply reloc: type=" << relocTypeToString(rel.Type));
112 LLVM_DEBUG(dbgs() << " sym=" << file->getSymbols()[rel.Index]->getName());
113 LLVM_DEBUG(dbgs() << " addend=" << rel.Addend << " index=" << rel.Index
151 LLVM_DEBUG(dbgs() << "writeRelocations: " << file->getName()
165 LLVM_DEBUG(dbgs() << "InputFunction::setFunctionIndex: " << getName()
172 LLVM_DEBUG(dbgs() << "InputFunction::setTableIndex: " << getName() << " -> "
231 LLVM_DEBUG(dbgs() << "calculateSize: " << getName() << "\n");
243 LLVM_DEBUG(dbgs() << " region: " << (rel.Offset - lastRelocEnd) << "\n");
248 LLVM_DEBUG(dbgs() << " final region: " << (end - lastRelocEnd) << "\n");
256 LLVM_DEBUG(dbgs() << " calculateSize orig: " << function->Size << "\n");
257 LLVM_DEBUG(dbgs() << " calculateSize new: " << compressedSize << "\n");
277 LLVM_DEBUG(dbgs() << "write func: " << getName() << "\n");
282 LLVM_DEBUG(dbgs() << " write chunk: " << chunkSize << "\n");
290 LLVM_DEBUG(dbgs() << " write final chunk: " << chunkSize << "\n");
292 LLVM_DEBUG(dbgs() << " total: " << (buf + chunkSize - orig) << "\n");
299 LLVM_DEBUG(dbgs() << "generating runtime relocations: " << getName()
309 LLVM_DEBUG(dbgs() << "gen reloc: type=" << relocTypeToString(rel.Type)
tools/lld/wasm/InputFiles.cpp 250 LLVM_DEBUG(dbgs() << "Parsing object: " << toString(this) << "\n");
471 LLVM_DEBUG(dbgs() << "Parsing library: " << toString(this) << "\n");
480 LLVM_DEBUG(dbgs() << "Read " << count << " symbols\n");
493 LLVM_DEBUG(dbgs() << "loading lazy: " << sym->getName() << "\n");
494 LLVM_DEBUG(dbgs() << "from archive: " << toString(this) << "\n");
tools/lld/wasm/MarkLive.cpp 57 LLVM_DEBUG(dbgs() << "markLive: " << sym->getName() << "\n");
140 LLVM_DEBUG(dbgs() << "markLive\n");
tools/lld/wasm/SymbolTable.cpp 198 LLVM_DEBUG(dbgs() << "addSyntheticFunction: " << name << "\n");
215 LLVM_DEBUG(dbgs() << "addOptionalDataSymbol: " << name << "\n");
224 LLVM_DEBUG(dbgs() << "addSyntheticDataSymbol: " << name << "\n");
231 LLVM_DEBUG(dbgs() << "addSyntheticGlobal: " << name << " -> " << global
243 LLVM_DEBUG(dbgs() << "resolving existing undefined symbol: "
250 LLVM_DEBUG(dbgs() << "existing symbol takes precedence\n");
256 LLVM_DEBUG(dbgs() << "replacing existing weak symbol\n");
270 LLVM_DEBUG(dbgs() << "addDefinedFunction: " << name << " ["
326 LLVM_DEBUG(dbgs() << "addDefinedData:" << name << " addr:" << address
350 LLVM_DEBUG(dbgs() << "addDefinedGlobal:" << name << "\n");
374 LLVM_DEBUG(dbgs() << "addDefinedEvent:" << name << "\n");
431 LLVM_DEBUG(dbgs() << "addUndefinedFunction: " << name << " ["
478 LLVM_DEBUG(dbgs() << "addUndefinedData: " << name << "\n");
500 LLVM_DEBUG(dbgs() << "addUndefinedGlobal: " << name << "\n");
520 LLVM_DEBUG(dbgs() << "addLazy: " << sym->getName() << "\n");
544 LLVM_DEBUG(dbgs() << "replacing existing weak undefined symbol\n");
551 LLVM_DEBUG(dbgs() << "replacing existing undefined\n");
564 LLVM_DEBUG(dbgs() << "getFunctionVariant: " << sym->getName() << " -> "
584 LLVM_DEBUG(dbgs() << "added new variant\n");
588 LLVM_DEBUG(dbgs() << "variant already exists: " << toString(*variant) << "\n");
607 LLVM_DEBUG(dbgs() << "wrap: " << sym->getName() << "\n");
689 LLVM_DEBUG(dbgs() << "symbol with (" << variants.size()
693 LLVM_DEBUG(dbgs() << " variant: " + f->getName() << " "
tools/lld/wasm/Symbols.cpp 144 LLVM_DEBUG(dbgs() << "setOutputSymbolIndex " << name << " -> " << index
151 LLVM_DEBUG(dbgs() << "setGOTIndex " << name << " -> " << index << "\n");
174 LLVM_DEBUG(dbgs() << "setHidden: " << name << " -> " << isHidden << "\n");
207 LLVM_DEBUG(dbgs() << "setFunctionIndex " << name << " -> " << index << "\n");
239 LLVM_DEBUG(dbgs() << "setTableIndex " << name << " -> " << index << "\n");
251 LLVM_DEBUG(dbgs() << "getVirtualAddress: " << getName() << "\n");
264 LLVM_DEBUG(dbgs() << "setVirtualAddress " << name << " -> " << value << "\n");
270 LLVM_DEBUG(dbgs() << "getOutputSegmentOffset: " << getName() << "\n");
275 LLVM_DEBUG(dbgs() << "getOutputSegmentIndex: " << getName() << "\n");
287 LLVM_DEBUG(dbgs() << "setGlobalIndex " << name << " -> " << index << "\n");
312 LLVM_DEBUG(dbgs() << "setEventIndex " << name << " -> " << index << "\n");
tools/lld/wasm/SyntheticSections.cpp 73 LLVM_DEBUG(llvm::dbgs() << "type " << toString(sig) << "\n");
108 LLVM_DEBUG(dbgs() << "addGOTEntry: " << toString(*sym) << "\n");
256 LLVM_DEBUG(dbgs() << "addStaticGOTEntry: " << sym->getName() << " "
315 LLVM_DEBUG(dbgs() << "addEvent: " << eventIndex << "\n");
tools/lld/wasm/Writer.cpp 129 LLVM_DEBUG(dbgs() << "createCustomSection: " << name << "\n");
148 LLVM_DEBUG(dbgs() << "check section " << i << "\n");
327 LLVM_DEBUG(dbgs() << "addStartStopSymbols: " << name << "\n");
495 LLVM_DEBUG(dbgs() << "import: " << sym->getName() << "\n");
543 LLVM_DEBUG(dbgs() << "Export: " << name << "\n");
557 LLVM_DEBUG(dbgs() << "Local symtab entries: " << file->getName() << "\n");
595 LLVM_DEBUG(dbgs() << "scanRelocations: " << file->getName() << "\n");
614 LLVM_DEBUG(dbgs() << "Functions: " << file->getName() << "\n");
623 LLVM_DEBUG(dbgs() << "Globals: " << file->getName() << "\n");
629 LLVM_DEBUG(dbgs() << "Events: " << file->getName() << "\n");
668 LLVM_DEBUG(dbgs() << "new segment: " << name << "\n");
682 LLVM_DEBUG(dbgs() << "added data: " << name << ": " << s->size << "\n");
716 LLVM_DEBUG(dbgs() << "createInitMemoryFunction\n");
843 LLVM_DEBUG(dbgs() << "createApplyRelocationsFunction\n");
946 LLVM_DEBUG(dbgs() << "initFunctions: " << toString(*sym) << "\n");
tools/lld/wasm/WriterUtils.cpp 67 LLVM_DEBUG(dbgs() << format(" | %08lld: ", offset) << msg << "\n");
tools/lli/lli.cpp 679 LLVM_DEBUG(dbgs() << "Executing '" << EntryFn->getName() << "' at 0x"
tools/llvm-dwarfdump/Statistics.cpp 455 LLVM_DEBUG(llvm::dbgs() << Key << ": " << Value << '\n');
462 LLVM_DEBUG(llvm::dbgs() << Key << " with 0% of its scope covered: "
466 LLVM_DEBUG(llvm::dbgs() << Key << " with 1-9% of its scope covered: "
471 LLVM_DEBUG(llvm::dbgs()
477 LLVM_DEBUG(llvm::dbgs() << Key << " with 100% of its scope covered: "
530 LLVM_DEBUG(for (auto &V
550 LLVM_DEBUG(llvm::dbgs() << "Variable location quality metrics\n";
605 LLVM_DEBUG(
tools/llvm-ifs/llvm-ifs.cpp 352 LLVM_DEBUG({
tools/llvm-jitlink/llvm-jitlink-macho.cpp 87 LLVM_DEBUG({
91 LLVM_DEBUG({
tools/llvm-jitlink/llvm-jitlink.cpp 585 LLVM_DEBUG(dbgs() << "Creating JITDylibs...\n");
591 LLVM_DEBUG(dbgs() << " 0: " << MainJD.getName() << "\n");
602 LLVM_DEBUG(dbgs() << " " << JDIdx << ": " << JD.getName() << "\n");
618 LLVM_DEBUG(dbgs() << "Adding objects...\n");
625 LLVM_DEBUG(dbgs() << " " << InputFileArgIdx << ": \"" << InputFile
633 LLVM_DEBUG(dbgs() << "Defining absolute symbols...\n");
663 LLVM_DEBUG({
tools/polly/lib/Analysis/DependenceInfo.cpp 304 LLVM_DEBUG(if (!Flow) dbgs()
316 LLVM_DEBUG(dbgs() << "Scop: \n" << S << "\n");
323 LLVM_DEBUG(dbgs() << "Read: " << Read << '\n';
364 LLVM_DEBUG(dbgs() << "Read: " << Read << "\n";
508 LLVM_DEBUG({
557 LLVM_DEBUG({
607 LLVM_DEBUG({
619 LLVM_DEBUG({
635 LLVM_DEBUG(dump());
tools/polly/lib/Analysis/PolyhedralInfo.cpp 81 LLVM_DEBUG(dbgs() << "Loop :\t" << L->getHeader()->getName() << ":\n");
88 LLVM_DEBUG(dbgs() << "Dependences :\t" << stringFromIslObj(Deps) << "\n");
91 LLVM_DEBUG(dbgs() << "Schedule: \t" << stringFromIslObj(Schedule) << "\n");
127 LLVM_DEBUG(dbgs() << "Relative loop depth:\t" << CurrDim << "\n");
134 LLVM_DEBUG(dbgs() << "Maximum depth of Stmt:\t" << MaxDim << "\n");
tools/polly/lib/Analysis/PruneUnprofitable.cpp 74 LLVM_DEBUG(
83 LLVM_DEBUG(
tools/polly/lib/Analysis/ScopBuilder.cpp 3340 LLVM_DEBUG(
3665 LLVM_DEBUG(
3685 LLVM_DEBUG(dbgs() << "Bailing-out because SCoP is empty\n");
3702 LLVM_DEBUG(dbgs() << "Bailing-out because of unfeasible context (early)\n");
3710 LLVM_DEBUG(
3729 LLVM_DEBUG(dbgs() << "Bailing-out because could not build alias checks\n");
3741 LLVM_DEBUG(dbgs() << "Bailing-out because of unfeasible context (late)\n");
3765 LLVM_DEBUG(dbgs() << *scop);
3770 LLVM_DEBUG(dbgs() << "SCoP detected but dismissed\n");
tools/polly/lib/Analysis/ScopDetection.cpp 393 LLVM_DEBUG(dbgs() << RejectReason->getMessage());
394 LLVM_DEBUG(dbgs() << "\n");
687 LLVM_DEBUG(dbgs() << "Allow call to debug function: "
1393 LLVM_DEBUG(dbgs() << "\tExpanding " << R.getNameStr() << "\n");
1400 LLVM_DEBUG(dbgs() << "\t\tTrying " << ExpandedRegion->getNameStr() << "\n");
1434 LLVM_DEBUG({
1640 LLVM_DEBUG(dbgs() << "Checking region: " << CurRegion.getNameStr() << "\n\t");
1643 LLVM_DEBUG(dbgs() << "Top level region is invalid\n");
1650 LLVM_DEBUG(dbgs() << "Unreachable in exit\n");
1656 LLVM_DEBUG({
1677 LLVM_DEBUG(dbgs() << "OK\n");
tools/polly/lib/Analysis/ScopInfo.cpp 2127 LLVM_DEBUG(dbgs() << "Invalidate SCoP because of reason " << Kind << "\n");
tools/polly/lib/CodeGen/CodeGeneration.cpp 89 LLVM_DEBUG({
185 LLVM_DEBUG(dbgs() << "Got an IstAst for a different Scop/isl_ctx\n");
tools/polly/lib/CodeGen/CodegenCleanup.cpp 119 LLVM_DEBUG(
125 LLVM_DEBUG(dbgs() << F.getName() << ": Running codegen cleanup...");
tools/polly/lib/CodeGen/IslAst.cpp 758 LLVM_DEBUG({
798 LLVM_DEBUG(
806 LLVM_DEBUG(printScop(dbgs(), Scop));
tools/polly/lib/Support/DumpModulePass.cpp 62 LLVM_DEBUG(dbgs() << "Dumping module to " << Dumpfile << '\n');
tools/polly/lib/Support/SCEVValidator.cpp 208 LLVM_DEBUG(
229 LLVM_DEBUG(dbgs() << "INVALID: AddRec is not affine");
244 LLVM_DEBUG(
258 LLVM_DEBUG(dbgs() << "INVALID: AddRec within scop has non-int"
319 LLVM_DEBUG(dbgs() << "INVALID: UMaxExpr has a non-constant operand");
334 LLVM_DEBUG(dbgs() << "INVALID: UMinExpr has a non-constant operand");
344 LLVM_DEBUG(dbgs() << "INVALID: UnknownExpr references an instruction "
393 LLVM_DEBUG(
434 LLVM_DEBUG(dbgs() << "INVALID: UnknownExpr is not an integer or pointer");
439 LLVM_DEBUG(dbgs() << "INVALID: UnknownExpr references an undef value");
641 LLVM_DEBUG({
650 LLVM_DEBUG({
tools/polly/lib/Transform/DeLICM.cpp 545 LLVM_DEBUG(OS = &llvm::dbgs());
557 LLVM_DEBUG(
574 LLVM_DEBUG(dbgs() << " Reject because value is escaping\n");
591 LLVM_DEBUG(dbgs()
601 LLVM_DEBUG(dbgs() << " Reject ExitPHI or other non-value\n");
684 LLVM_DEBUG(dbgs() << " Def Mapping: " << DefTarget << '\n');
689 LLVM_DEBUG(
702 LLVM_DEBUG(dbgs() << " Lifetime: " << Lifetime << '\n');
857 LLVM_DEBUG(dbgs() << " Mapping: " << PHITarget << '\n');
862 LLVM_DEBUG(
888 LLVM_DEBUG(
892 LLVM_DEBUG(dbgs() << " Relevant Mapping: "
894 LLVM_DEBUG(dbgs() << " Deduced Mapping: " << WritesTarget
896 LLVM_DEBUG(dbgs() << " Missing instances: "
910 LLVM_DEBUG(dbgs() << " Lifetime: " << Lifetime << "\n");
1023 LLVM_DEBUG(dbgs() << " Target mapping is " << EltTarget << '\n');
1061 LLVM_DEBUG(dbgs() << "\n Trying to map " << MA << " (SAI: " << SAI
1070 LLVM_DEBUG(
1209 LLVM_DEBUG(dbgs() << "DeLICM analysis exceeded max_operations\n");
1220 LLVM_DEBUG(dbgs() << "Computed Zone:\n"; OriginalZone.print(dbgs(), 4));
1242 LLVM_DEBUG(dbgs() << "Access " << MA
1253 LLVM_DEBUG(dbgs() << "Access " << MA
1263 LLVM_DEBUG(dbgs()
1275 LLVM_DEBUG(dbgs() << "Access " << MA
1298 LLVM_DEBUG(dbgs() << "Access " << MA
1311 LLVM_DEBUG(
1325 LLVM_DEBUG(dbgs() << "Analyzing target access " << MA << "\n");
1364 LLVM_DEBUG(dbgs() << "Abort because cannot reliably compute lifetimes\n");
1368 LLVM_DEBUG(dbgs() << "Collapsing scalars to unused array elements...\n");
1371 LLVM_DEBUG(dbgs() << "\nFinal Scop:\n");
1372 LLVM_DEBUG(dbgs() << S);
tools/polly/lib/Transform/FlattenAlgo.cpp 183 LLVM_DEBUG(dbgs() << "Abort; dimension is not of fixed size\n");
194 LLVM_DEBUG(dbgs() << "Next counter:\n " << Counter << "\n");
195 LLVM_DEBUG(dbgs() << "Remaining scatter set:\n " << ScatterSet << "\n");
210 LLVM_DEBUG(dbgs() << "Next step in sequence is:\n " << FirstSubScatter
214 LLVM_DEBUG(dbgs() << "Abort; sequence step is not bounded\n");
245 LLVM_DEBUG(dbgs() << "Sequence-flatten result is:\n " << NewSchedule
273 LLVM_DEBUG(dbgs() << "Abort; dimension not bounded by constant\n");
278 LLVM_DEBUG(dbgs() << "Min bound:\n " << Min << "\n");
281 LLVM_DEBUG(dbgs() << "Max bound:\n " << Max << "\n");
285 LLVM_DEBUG(dbgs() << "Abort; dimension bounds could not be determined\n");
303 LLVM_DEBUG(dbgs() << "Loop-flatten result is:\n " << Result << "\n");
310 LLVM_DEBUG(dbgs() << "Recursive schedule to process:\n " << Schedule
325 LLVM_DEBUG(dbgs() << "Fixed dimension; try sequence flattening\n");
332 LLVM_DEBUG(dbgs() << "Try loop flattening\n");
338 LLVM_DEBUG(dbgs() << "Try sequence flattening again\n");
tools/polly/lib/Transform/FlattenSchedule.cpp 60 LLVM_DEBUG(dbgs() << "Going to flatten old schedule:\n");
62 LLVM_DEBUG(printSchedule(dbgs(), OldSchedule, 2));
66 LLVM_DEBUG(dbgs() << "Old schedule with domains:\n");
67 LLVM_DEBUG(printSchedule(dbgs(), RestrictedOldSchedule, 2));
71 LLVM_DEBUG(dbgs() << "Flattened new schedule:\n");
72 LLVM_DEBUG(printSchedule(dbgs(), NewSchedule, 2));
75 LLVM_DEBUG(dbgs() << "Gisted, flattened new schedule:\n");
76 LLVM_DEBUG(printSchedule(dbgs(), NewSchedule, 2));
tools/polly/lib/Transform/ForwardOpTree.cpp 299 LLVM_DEBUG(dbgs() << "Known analysis exceeded max_operations\n");
304 LLVM_DEBUG(dbgs() << "All known: " << Known << "\n");
466 LLVM_DEBUG(
471 LLVM_DEBUG(dbgs() << " forwarded known load with new MemoryAccess"
510 LLVM_DEBUG(dbgs() << " local translator is " << LocalTranslator
514 LLVM_DEBUG(dbgs() << " expected values where " << TargetExpectedVal
516 LLVM_DEBUG(dbgs() << " candidate elements where " << Candidates
729 LLVM_DEBUG(
788 LLVM_DEBUG(dbgs() << " Cannot forward instruction: " << *Inst << "\n");
798 LLVM_DEBUG(dbgs() << "Trying to forward operand tree " << RA << "...\n");
920 LLVM_DEBUG(dbgs() << "Prepare forwarders...\n");
924 LLVM_DEBUG(dbgs() << "Forwarding operand trees...\n");
928 LLVM_DEBUG(dbgs() << "Not all operations completed because of "
934 LLVM_DEBUG(dbgs() << "\nFinal Scop:\n");
935 LLVM_DEBUG(dbgs() << S);
tools/polly/lib/Transform/ScheduleOptimizer.cpp 1340 LLVM_DEBUG(dbgs() << "The matrix multiplication pattern was detected\n");
1484 LLVM_DEBUG(dbgs() << "DependenceInfo for another SCoP/isl_ctx\n");
1539 LLVM_DEBUG(dbgs() << "\n\nCompute schedule from: ");
1540 LLVM_DEBUG(dbgs() << "Domain := " << Domain << ";\n");
1541 LLVM_DEBUG(dbgs() << "Proximity := " << Proximity << ";\n");
1542 LLVM_DEBUG(dbgs() << "Validity := " << Validity << ";\n");
1608 LLVM_DEBUG({
tools/polly/lib/Transform/ScopInliner.cpp 62 LLVM_DEBUG(dbgs() << "Skipping " << F->getName()
79 LLVM_DEBUG(dbgs() << "Skipping " << F->getName()
92 LLVM_DEBUG(dbgs() << F->getName()
tools/polly/lib/Transform/Simplify.cpp 194 LLVM_DEBUG(dbgs() << "Removing " << MA
450 LLVM_DEBUG(dbgs() << "Cleanup of " << MA << ":\n");
451 LLVM_DEBUG(dbgs() << " Scalar: " << *StoredVal << "\n");
452 LLVM_DEBUG(dbgs() << " AccRel: " << AccRel << "\n");
494 LLVM_DEBUG(dbgs() << "Removed " << StmtsRemoved << " (of " << NumStmtsBefore
513 LLVM_DEBUG(
546 LLVM_DEBUG(dbgs() << "Removing " << MA
568 LLVM_DEBUG(dbgs() << "Removing "; Inst->print(dbgs());
635 LLVM_DEBUG(dbgs() << "Removing partial writes that never happen...\n");
638 LLVM_DEBUG(dbgs() << "Removing overwrites...\n");
641 LLVM_DEBUG(dbgs() << "Coalesce partial writes...\n");
644 LLVM_DEBUG(dbgs() << "Removing redundant writes...\n");
647 LLVM_DEBUG(dbgs() << "Cleanup unused accesses...\n");
651 LLVM_DEBUG(dbgs() << "Removing statements without side effects...\n");
656 LLVM_DEBUG(dbgs() << "\nFinal Scop:\n");
657 LLVM_DEBUG(dbgs() << S);
tools/polly/lib/Transform/ZoneAlgo.cpp 344 LLVM_DEBUG(
364 LLVM_DEBUG(dbgs() << "WRITE in non-affine subregion not supported\n");
375 LLVM_DEBUG(dbgs() << "WRITE after WRITE to same element\n");
tools/verify-uselistorder/verify-uselistorder.cpp 109 LLVM_DEBUG(dbgs() << " - create-temp-file\n");
124 LLVM_DEBUG(dbgs() << " - write bitcode\n");
137 LLVM_DEBUG(dbgs() << " - write assembly\n");
150 LLVM_DEBUG(dbgs() << " - read bitcode\n");
171 LLVM_DEBUG(dbgs() << " - read assembly\n");
290 LLVM_DEBUG(dbgs() << "compare value maps\n");
292 LLVM_DEBUG(debugSizeMismatch(LM, RM));
319 LLVM_DEBUG(debugUserMismatch(LM, RM, I));
323 LLVM_DEBUG(debugUserMismatch(LM, RM, I));
327 LLVM_DEBUG(debugUserMismatch(LM, RM, I));
334 LLVM_DEBUG(debugUserMismatch(LM, RM, I));
399 LLVM_DEBUG(dbgs() << "V = "; V->dump());
408 LLVM_DEBUG(dbgs() << " - order: " << I << ", op = " << U.getOperandNo()
414 LLVM_DEBUG(dbgs() << " => shuffle\n");
417 LLVM_DEBUG({
439 LLVM_DEBUG({
451 LLVM_DEBUG({
517 LLVM_DEBUG(dbgs() << "\n");
523 LLVM_DEBUG(dbgs() << "\n");
unittests/IR/CFGBuilder.cpp 38 LLVM_DEBUG(dbgs() << "Creating BB arc " << From->getName() << " -> "
59 LLVM_DEBUG(dbgs() << "Deleting BB arc " << From->getName() << " -> "
unittests/IR/DominatorTreeBatchUpdatesTest.cpp 61 LLVM_DEBUG(dbgs() << "Legalized updates:\t");
62 LLVM_DEBUG(for (auto &U : Legalized) { U.dump(); dbgs() << ", "; });
63 LLVM_DEBUG(dbgs() << "\n");
84 LLVM_DEBUG(dbgs() << "Legalized postdom updates:\t");
85 LLVM_DEBUG(for (auto &U : Legalized) { U.dump(); dbgs() << ", "; });
86 LLVM_DEBUG(dbgs() << "\n");
utils/TableGen/AsmMatcherEmitter.cpp 1089 LLVM_DEBUG({
1477 LLVM_DEBUG(Pair.second.dump());
utils/TableGen/AsmWriterEmitter.cpp 353 LLVM_DEBUG(errs() << "Not enough bits to densely encode " << NumBits
utils/TableGen/CodeGenDAGPatterns.cpp 3186 LLVM_DEBUG(ThePat.dump());
3776 LLVM_DEBUG(I.dump());
4340 LLVM_DEBUG(errs() << "<empty set>");
4342 LLVM_DEBUG(errs() << "[ ");
4344 LLVM_DEBUG(errs() << DepVar.getKey() << " ");
4346 LLVM_DEBUG(errs() << "]");
4370 LLVM_DEBUG(if (!Idxs.empty()) {
4580 LLVM_DEBUG(errs() << "Generating instruction variants.\n");
4605 LLVM_DEBUG(errs() << "Dependent/multiply used variables: ");
4606 LLVM_DEBUG(DumpDepVars(DepVars));
4607 LLVM_DEBUG(errs() << "\n");
4615 LLVM_DEBUG(errs() << "FOUND VARIANTS OF: ";
4653 LLVM_DEBUG(errs() << " VAR#" << v << ": "; Variant->dump();
4665 LLVM_DEBUG(errs() << " *** ALREADY EXISTS, ignoring variant.\n");
4686 LLVM_DEBUG(errs() << "\n");
utils/TableGen/CodeGenRegisters.cpp 1672 LLVM_DEBUG(dbgs() << "UberSet " << I - UberSets.begin() << " Weight "
1845 LLVM_DEBUG(dbgs() << "UnitSet " << SubIdx << " subsumed by " << SuperIdx
1899 LLVM_DEBUG(dbgs() << "\nBefore pruning:\n"; for (unsigned USIdx = 0,
1911 LLVM_DEBUG(dbgs() << "\nBefore union:\n"; for (unsigned USIdx = 0,
1958 LLVM_DEBUG(dbgs() << "UnitSet " << RegUnitSets.size() - 1 << " "
1970 LLVM_DEBUG(
1995 LLVM_DEBUG(dbgs() << "RC " << RC.getName() << " Units: \n";
2004 LLVM_DEBUG(dbgs() << " " << USIdx);
2008 LLVM_DEBUG(dbgs() << "\n");
utils/TableGen/CodeGenSchedule.cpp 217 LLVM_DEBUG(
537 LLVM_DEBUG(dbgs() << "+++ PROCESSOR MODELs (addProcModel) +++\n");
561 LLVM_DEBUG(ProcModels.back().dump());
689 LLVM_DEBUG(
888 LLVM_DEBUG(dbgs() << "\n+++ SCHED CLASSES (createInstRWClass) +++\n");
895 LLVM_DEBUG(EnableDump = true);
899 LLVM_DEBUG(
906 LLVM_DEBUG({
925 LLVM_DEBUG({
940 LLVM_DEBUG(dbgs() << "InstRW on " << ProcModel.ModelName << " for "
946 LLVM_DEBUG({
955 LLVM_DEBUG({
1096 LLVM_DEBUG(dbgs() << "InstRW: Reuse SC " << OldSCIdx << ":"
1107 LLVM_DEBUG(dbgs() << "InstRW: New SC " << SCIdx << ":" << SC.Name << " on "
1153 LLVM_DEBUG(dbgs() << "\n+++ PROBLEM ITINERARIES (collectProcItins) +++\n");
1179 LLVM_DEBUG(dbgs() << ProcModel.ItinsDef->getName()
1186 LLVM_DEBUG(
1225 LLVM_DEBUG(
1227 LLVM_DEBUG(dbgs() << NumInstrSchedClasses << " instr sched classes.\n");
1689 LLVM_DEBUG(dbgs() << "INFER RW proc("; dumpIdxVec(ProcIndices);
1705 LLVM_DEBUG(dbgs() << "("; dumpIdxVec(Seq); dbgs() << ") ");
1707 LLVM_DEBUG(dbgs() << " Reads: ");
1714 LLVM_DEBUG(dbgs() << "("; dumpIdxVec(Seq); dbgs() << ") ");
1716 LLVM_DEBUG(dbgs() << '\n');
1724 LLVM_DEBUG(Transitions.dump());
1899 LLVM_DEBUG(
utils/TableGen/DAGISelEmitter.cpp 141 LLVM_DEBUG(errs() << "\n\nALL PATTERNS TO MATCH:\n\n";
utils/TableGen/DAGISelMatcherOpt.cpp 299 LLVM_DEBUG(errs() << "Couldn't merge this:\n"; Optn->print(errs(), 4);
utils/TableGen/DFAEmitter.cpp 264 LLVM_DEBUG(dbgs() << "Emitting automaton for " << R->getName() << "\n");
276 LLVM_DEBUG(dbgs() << " Action alphabet cardinality: " << Actions.size()
278 LLVM_DEBUG(dbgs() << " Each state has " << Transitions.size()
303 LLVM_DEBUG(dbgs() << " NFA automaton has " << SeenStates.size()
utils/TableGen/DFAPacketizerEmitter.cpp 174 LLVM_DEBUG(dbgs() << "InsnClass: ");
177 LLVM_DEBUG(dbgs() << ", ");
179 LLVM_DEBUG(dbgs() << "0x" << Twine::utohexstr(InsnClass[i]));
182 LLVM_DEBUG(dbgs() << " (input: 0x" << Twine::utohexstr(InsnInput) << ")");
190 LLVM_DEBUG(dbgs() << " ");
206 LLVM_DEBUG(dbgs() << "-------------------------------------------------------"
208 LLVM_DEBUG(dbgs() << "collectAllFuncUnits");
209 LLVM_DEBUG(dbgs() << " (" << ProcItinList.size() << " itineraries)\n");
217 LLVM_DEBUG(dbgs() << " FU:" << i << " (" << FUs.size() << " FUs) "
227 LLVM_DEBUG(dbgs() << " " << FUs[j]->getName() << ":0x"
234 LLVM_DEBUG(dbgs() << "\n");
248 LLVM_DEBUG(dbgs() << "-------------------------------------------------------"
250 LLVM_DEBUG(dbgs() << "collectAllComboFuncs");
251 LLVM_DEBUG(dbgs() << " (" << ComboFuncList.size() << " sets)\n");
258 LLVM_DEBUG(dbgs() << " CFD:" << i << " (" << FUs.size() << " combo FUs) "
272 LLVM_DEBUG(dbgs() << " combo: " << ComboFuncName << ":0x"
277 LLVM_DEBUG(dbgs() << " " << FuncName << ":0x"
283 LLVM_DEBUG(dbgs() << " => combo bits: " << ComboFuncName << ":0x"
305 LLVM_DEBUG(dbgs() << " " << ItinData->getValueAsDef("TheClass")->getName()
318 LLVM_DEBUG(dbgs() << " stage:" << i << " [" << UnitList.size()
327 LLVM_DEBUG(dbgs() << " " << j << ":" << UnitName);
338 LLVM_DEBUG(dbgs() << "\t");
340 LLVM_DEBUG(dbgs() << " (bits: 0x" << Twine::utohexstr(UnitBitValue)
347 LLVM_DEBUG({
370 LLVM_DEBUG(dbgs() << "-------------------------------------------------------"
utils/TableGen/FixedLenDecoderEmitter.cpp 1929 LLVM_DEBUG(dbgs() << "Numbered operand mapping for " << Def.getName()
utils/TableGen/GlobalISelEmitter.cpp 4920 LLVM_DEBUG(dbgs() << "NumGroups: " << NumGroups << "\n");
utils/TableGen/PseudoLoweringEmitter.cpp 122 LLVM_DEBUG(dbgs() << "Pseudo definition: " << Rec->getName() << "\n");
128 LLVM_DEBUG(dbgs() << " Result: " << *Dag << "\n");
172 LLVM_DEBUG(dbgs() << " Operand mapping:\n");
190 LLVM_DEBUG(dbgs() << " " << SourceOp->getValue() << " ==> " << i
utils/TableGen/RISCVCompressInstEmitter.cpp 167 LLVM_DEBUG(dbgs() << (IsSourceInst ? "Input" : "Output")
238 LLVM_DEBUG(
346 LLVM_DEBUG(dbgs() << " Operand mapping:\n Source Dest\n");
356 LLVM_DEBUG(dbgs() << " " << DestOperandMap[i].Data.Operand
381 LLVM_DEBUG(dbgs() << " " << SourceOp->getValue() << " ====> " << i
412 LLVM_DEBUG(dbgs() << "Input: " << *SourceDag << "\n");
425 LLVM_DEBUG(dbgs() << "Output: " << *DestDag << "\n");
utils/TableGen/RegisterBankEmitter.cpp 293 LLVM_DEBUG(dbgs()
utils/TableGen/SubtargetEmitter.cpp 989 LLVM_DEBUG(dbgs() << "\n+++ SCHED CLASSES (GenSchedClassTables) +++\n");
991 LLVM_DEBUG(SC.dump(&SchedModels));
1057 LLVM_DEBUG(dbgs() << ProcModel.ModelName