|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
Declarations
include/llvm/Support/Debug.h 113 raw_ostream &dbgs();
References
examples/LLJITExamples/LLJITWithObjectCache/LLJITWithObjectCache.cpp 37 dbgs() << "No object for " << M->getModuleIdentifier()
42 dbgs() << "Object for " << M->getModuleIdentifier()
gen/lib/Target/AArch64/AArch64GenAsmMatcher.inc27438 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "AsmMatcher: found " <<
27451 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Trying to match opcode "
27459 dbgs() << " Matching formal operand class " << getMatchClassName(Formal)
27462 DEBUG_WITH_TYPE("asm-matcher", dbgs() << " (";
27463 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
27463 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
27465 DEBUG_WITH_TYPE("asm-matcher", dbgs() << ": ");
27467 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "actual operand index out of range ");
27476 dbgs() << "match success using generic matcher\n");
27486 dbgs() << "match success using target matcher\n");
27498 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "ignoring optional operand\n");
27517 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: multiple "
27525 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Missing target features:";
27528 dbgs() << ' ' << I;
27529 dbgs() << "\n");
27551 dbgs() << "Early target match predicate failed with diag code "
27574 dbgs() << "Target match predicate failed with diag code "
27587 dbgs() << "Opcode result: complete match, selecting this opcode\n");
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/AMDGPUGenAsmMatcher.inc23963 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "AsmMatcher: found " <<
23976 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Trying to match opcode "
23985 dbgs() << " Matching formal operand class " << getMatchClassName(Formal)
23988 DEBUG_WITH_TYPE("asm-matcher", dbgs() << " (";
23989 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
23989 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
23991 DEBUG_WITH_TYPE("asm-matcher", dbgs() << ": ");
23993 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "actual operand index out of range ");
24003 dbgs() << "match success using generic matcher\n");
24013 dbgs() << "match success using target matcher\n");
24026 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "ignoring optional operand\n");
24045 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: multiple "
24053 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Missing target features:";
24056 dbgs() << ' ' << I;
24057 dbgs() << "\n");
24079 dbgs() << "Early target match predicate failed with diag code "
24103 dbgs() << "Target match predicate failed with diag code "
24116 dbgs() << "Opcode result: complete match, selecting this opcode\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/ARMGenAsmMatcher.inc15096 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "AsmMatcher: found " <<
15109 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Trying to match opcode "
15122 dbgs() << " Matching formal operand class " << getMatchClassName(Formal)
15125 DEBUG_WITH_TYPE("asm-matcher", dbgs() << " (";
15126 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
15126 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
15128 DEBUG_WITH_TYPE("asm-matcher", dbgs() << ": ");
15130 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "actual operand index out of range ");
15135 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "recording too-few-operands near miss\n");
15142 dbgs() << "second invalid operand, giving up on this opcode\n");
15147 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "but formal operand not required\n");
15156 dbgs() << "match success using generic matcher\n");
15166 dbgs() << "match success using target matcher\n");
15178 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "ignoring optional operand\n");
15186 dbgs()
15196 dbgs() << "second operand mismatch, skipping this opcode\n");
15203 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: multiple "
15210 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Missing target features:";
15213 dbgs() << ' ' << I;
15214 dbgs() << "\n");
15233 dbgs() << "Early target match predicate failed with diag code "
15245 dbgs()
15249 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: multiple "
15269 dbgs() << "Target match predicate failed with diag code "
15282 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: found one type of "
15295 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: multiple "
15309 dbgs() << "Opcode result: complete match, selecting this opcode\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/AVRGenAsmMatcher.inc 1291 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "AsmMatcher: found " <<
1304 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Trying to match opcode "
1312 dbgs() << " Matching formal operand class " << getMatchClassName(Formal)
1315 DEBUG_WITH_TYPE("asm-matcher", dbgs() << " (";
1316 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
1316 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
1318 DEBUG_WITH_TYPE("asm-matcher", dbgs() << ": ");
1320 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "actual operand index out of range ");
1329 dbgs() << "match success using generic matcher\n");
1339 dbgs() << "match success using target matcher\n");
1351 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "ignoring optional operand\n");
1370 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: multiple "
1378 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Missing target features:";
1381 dbgs() << ' ' << I;
1382 dbgs() << "\n");
1404 dbgs() << "Early target match predicate failed with diag code "
1427 dbgs() << "Target match predicate failed with diag code "
1440 dbgs() << "Opcode result: complete match, selecting this opcode\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/BPFGenAsmMatcher.inc 936 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "AsmMatcher: found " <<
949 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Trying to match opcode "
955 dbgs() << " Matching formal operand class " << getMatchClassName(Formal)
958 DEBUG_WITH_TYPE("asm-matcher", dbgs() << " (";
959 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
959 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
961 DEBUG_WITH_TYPE("asm-matcher", dbgs() << ": ");
963 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "actual operand index out of range ");
972 dbgs() << "match success using generic matcher\n");
982 dbgs() << "match success using target matcher\n");
994 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "ignoring optional operand\n");
1013 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: multiple "
1021 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Missing target features:";
1024 dbgs() << ' ' << I;
1025 dbgs() << "\n");
1047 dbgs() << "Early target match predicate failed with diag code "
1070 dbgs() << "Target match predicate failed with diag code "
1083 dbgs() << "Opcode result: complete match, selecting this opcode\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/HexagonGenAsmMatcher.inc10282 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "AsmMatcher: found " <<
10295 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Trying to match opcode "
10301 dbgs() << " Matching formal operand class " << getMatchClassName(Formal)
10304 DEBUG_WITH_TYPE("asm-matcher", dbgs() << " (";
10305 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
10305 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
10307 DEBUG_WITH_TYPE("asm-matcher", dbgs() << ": ");
10309 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "actual operand index out of range ");
10318 dbgs() << "match success using generic matcher\n");
10328 dbgs() << "match success using target matcher\n");
10340 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "ignoring optional operand\n");
10359 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: multiple "
10367 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Missing target features:";
10370 dbgs() << ' ' << I;
10371 dbgs() << "\n");
10393 dbgs() << "Early target match predicate failed with diag code "
10416 dbgs() << "Target match predicate failed with diag code "
10429 dbgs() << "Opcode result: complete match, selecting this opcode\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/LanaiGenAsmMatcher.inc 1075 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "AsmMatcher: found " <<
1088 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Trying to match opcode "
1096 dbgs() << " Matching formal operand class " << getMatchClassName(Formal)
1099 DEBUG_WITH_TYPE("asm-matcher", dbgs() << " (";
1100 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
1100 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
1102 DEBUG_WITH_TYPE("asm-matcher", dbgs() << ": ");
1104 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "actual operand index out of range ");
1113 dbgs() << "match success using generic matcher\n");
1123 dbgs() << "match success using target matcher\n");
1135 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "ignoring optional operand\n");
1154 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: multiple "
1162 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Missing target features:";
1165 dbgs() << ' ' << I;
1166 dbgs() << "\n");
1188 dbgs() << "Early target match predicate failed with diag code "
1211 dbgs() << "Target match predicate failed with diag code "
1224 dbgs() << "Opcode result: complete match, selecting this opcode\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/MSP430GenAsmMatcher.inc 1133 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "AsmMatcher: found " <<
1146 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Trying to match opcode "
1154 dbgs() << " Matching formal operand class " << getMatchClassName(Formal)
1157 DEBUG_WITH_TYPE("asm-matcher", dbgs() << " (";
1158 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
1158 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
1160 DEBUG_WITH_TYPE("asm-matcher", dbgs() << ": ");
1162 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "actual operand index out of range ");
1171 dbgs() << "match success using generic matcher\n");
1181 dbgs() << "match success using target matcher\n");
1193 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "ignoring optional operand\n");
1212 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: multiple "
1220 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Missing target features:";
1223 dbgs() << ' ' << I;
1224 dbgs() << "\n");
1246 dbgs() << "Early target match predicate failed with diag code "
1269 dbgs() << "Target match predicate failed with diag code "
1282 dbgs() << "Opcode result: complete match, selecting this opcode\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/MipsGenAsmMatcher.inc 8109 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "AsmMatcher: found " <<
8122 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Trying to match opcode "
8130 dbgs() << " Matching formal operand class " << getMatchClassName(Formal)
8133 DEBUG_WITH_TYPE("asm-matcher", dbgs() << " (";
8134 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
8134 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
8136 DEBUG_WITH_TYPE("asm-matcher", dbgs() << ": ");
8138 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "actual operand index out of range ");
8147 dbgs() << "match success using generic matcher\n");
8157 dbgs() << "match success using target matcher\n");
8169 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "ignoring optional operand\n");
8188 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: multiple "
8196 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Missing target features:";
8199 dbgs() << ' ' << I;
8200 dbgs() << "\n");
8222 dbgs() << "Early target match predicate failed with diag code "
8245 dbgs() << "Target match predicate failed with diag code "
8258 dbgs() << "Opcode result: complete match, selecting this opcode\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/PPCGenAsmMatcher.inc 7038 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "AsmMatcher: found " <<
7051 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Trying to match opcode "
7059 dbgs() << " Matching formal operand class " << getMatchClassName(Formal)
7062 DEBUG_WITH_TYPE("asm-matcher", dbgs() << " (";
7063 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
7063 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
7065 DEBUG_WITH_TYPE("asm-matcher", dbgs() << ": ");
7067 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "actual operand index out of range ");
7076 dbgs() << "match success using generic matcher\n");
7086 dbgs() << "match success using target matcher\n");
7098 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "ignoring optional operand\n");
7117 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: multiple "
7125 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Missing target features:";
7128 dbgs() << ' ' << I;
7129 dbgs() << "\n");
7151 dbgs() << "Early target match predicate failed with diag code "
7174 dbgs() << "Target match predicate failed with diag code "
7194 dbgs() << "Opcode result: complete match, selecting this opcode\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/RISCVGenAsmMatcher.inc 2427 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "AsmMatcher: found " <<
2440 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Trying to match opcode "
2448 dbgs() << " Matching formal operand class " << getMatchClassName(Formal)
2451 DEBUG_WITH_TYPE("asm-matcher", dbgs() << " (";
2452 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
2452 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
2454 DEBUG_WITH_TYPE("asm-matcher", dbgs() << ": ");
2456 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "actual operand index out of range ");
2465 dbgs() << "match success using generic matcher\n");
2475 dbgs() << "match success using target matcher\n");
2487 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "ignoring optional operand\n");
2506 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: multiple "
2514 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Missing target features:";
2517 dbgs() << ' ' << I;
2518 dbgs() << "\n");
2540 dbgs() << "Early target match predicate failed with diag code "
2563 dbgs() << "Target match predicate failed with diag code "
2576 dbgs() << "Opcode result: complete match, selecting this opcode\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/SparcGenAsmMatcher.inc 4171 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "AsmMatcher: found " <<
4184 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Trying to match opcode "
4192 dbgs() << " Matching formal operand class " << getMatchClassName(Formal)
4195 DEBUG_WITH_TYPE("asm-matcher", dbgs() << " (";
4196 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
4196 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
4198 DEBUG_WITH_TYPE("asm-matcher", dbgs() << ": ");
4200 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "actual operand index out of range ");
4209 dbgs() << "match success using generic matcher\n");
4219 dbgs() << "match success using target matcher\n");
4231 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "ignoring optional operand\n");
4250 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: multiple "
4258 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Missing target features:";
4261 dbgs() << ' ' << I;
4262 dbgs() << "\n");
4284 dbgs() << "Early target match predicate failed with diag code "
4307 dbgs() << "Target match predicate failed with diag code "
4320 dbgs() << "Opcode result: complete match, selecting this opcode\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/SystemZGenAsmMatcher.inc 5366 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "AsmMatcher: found " <<
5379 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Trying to match opcode "
5387 dbgs() << " Matching formal operand class " << getMatchClassName(Formal)
5390 DEBUG_WITH_TYPE("asm-matcher", dbgs() << " (";
5391 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
5391 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
5393 DEBUG_WITH_TYPE("asm-matcher", dbgs() << ": ");
5395 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "actual operand index out of range ");
5404 dbgs() << "match success using generic matcher\n");
5414 dbgs() << "match success using target matcher\n");
5426 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "ignoring optional operand\n");
5445 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: multiple "
5453 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Missing target features:";
5456 dbgs() << ' ' << I;
5457 dbgs() << "\n");
5479 dbgs() << "Early target match predicate failed with diag code "
5502 dbgs() << "Target match predicate failed with diag code "
5515 dbgs() << "Opcode result: complete match, selecting this opcode\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/WebAssemblyGenAsmMatcher.inc 1135 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "AsmMatcher: found " <<
1148 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Trying to match opcode "
1156 dbgs() << " Matching formal operand class " << getMatchClassName(Formal)
1159 DEBUG_WITH_TYPE("asm-matcher", dbgs() << " (";
1160 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
1160 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
1162 DEBUG_WITH_TYPE("asm-matcher", dbgs() << ": ");
1164 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "actual operand index out of range ");
1173 dbgs() << "match success using generic matcher\n");
1183 dbgs() << "match success using target matcher\n");
1195 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "ignoring optional operand\n");
1214 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: multiple "
1222 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Missing target features:";
1225 dbgs() << ' ' << I;
1226 dbgs() << "\n");
1248 dbgs() << "Early target match predicate failed with diag code "
1271 dbgs() << "Target match predicate failed with diag code "
1284 dbgs() << "Opcode result: complete match, selecting this opcode\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/X86GenAsmMatcher.inc36966 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "AsmMatcher: found " <<
36979 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Trying to match opcode "
36987 dbgs() << " Matching formal operand class " << getMatchClassName(Formal)
36990 DEBUG_WITH_TYPE("asm-matcher", dbgs() << " (";
36991 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
36991 Operands[ActualIdx]->print(dbgs()); dbgs() << "): ");
36993 DEBUG_WITH_TYPE("asm-matcher", dbgs() << ": ");
36995 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "actual operand index out of range ");
37004 dbgs() << "match success using generic matcher\n");
37014 dbgs() << "match success using target matcher\n");
37026 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "ignoring optional operand\n");
37045 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Opcode result: multiple "
37053 DEBUG_WITH_TYPE("asm-matcher", dbgs() << "Missing target features:";
37056 dbgs() << ' ' << I;
37057 dbgs() << "\n");
37079 dbgs() << "Early target match predicate failed with diag code "
37102 dbgs() << "Target match predicate failed with diag code "
37115 dbgs() << "Opcode result: complete match, selecting this opcode\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 517 void dump() const { print(dbgs()); }
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-";
1283 if (OuterLoop) dbgs()
1285 else dbgs() << "function\n");
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 "
691 dbgs() << "Found another devirtualization after hitting the max "
699 dbgs()
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/DominanceFrontierImpl.h 154 print(dbgs());
include/llvm/Analysis/LoopInfoImpl.h 337 dbgs() << "The following blocks are unreachable in the loop: ";
340 dbgs() << *BB << "\n";
729 dbgs() << "Found new loop: " << *HeaderAndLoop.second << "\n";
include/llvm/Analysis/RegionInfoImpl.h 527 print(dbgs(), true, getDepth(), RegionInfoBase<Tr>::printStyle);
794 void RegionInfoBase<Tr>::dump() const { print(dbgs()); }
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/AccelTable.h 151 void dump() const { print(dbgs()); }
184 void dump() const { print(dbgs()); }
235 void dump() const { print(dbgs()); }
include/llvm/CodeGen/GlobalISel/InstructionSelectorImpl.h 63 dbgs() << CurrentIdx << ": Rejected\n");
68 dbgs() << CurrentIdx << ": Resume at " << CurrentIdx << " ("
79 dbgs() << CurrentIdx << ": Begin try-block\n");
96 dbgs() << CurrentIdx << ": Not a register\n");
103 dbgs() << CurrentIdx << ": Is a physical register\n");
118 dbgs() << CurrentIdx << ": MIs[" << NewInsnID
127 dbgs() << CurrentIdx
146 dbgs() << CurrentIdx << ": GIM_CheckOpcode(MIs[" << InsnID
166 dbgs() << CurrentIdx << ": GIM_SwitchOpcode(MIs[" << InsnID << "], ["
194 dbgs() << CurrentIdx << ": GIM_SwitchType(MIs[" << InsnID
199 dbgs() << "Not a VReg\n";
201 dbgs() << MRI.getType(MO.getReg()) << "\n";
231 dbgs() << CurrentIdx << ": GIM_CheckNumOperands(MIs["
244 dbgs()
268 dbgs()
290 dbgs()
309 dbgs()
324 dbgs() << CurrentIdx << ": GIM_CheckAtomicOrdering(MIs["
341 dbgs() << CurrentIdx
359 dbgs() << CurrentIdx
398 dbgs() << "addrspace(" << MMOAddrSpace << ") vs "
428 dbgs() << CurrentIdx << ": GIM_CheckMemoryAlignment"
442 dbgs() << CurrentIdx
457 dbgs() << MMO->getSize() << " bytes vs " << Size
474 dbgs() << CurrentIdx << ": GIM_CheckMemorySize"
487 dbgs() << CurrentIdx << ": Not a register\n");
522 dbgs() << CurrentIdx << ": GIM_CheckType(MIs[" << InsnID
540 dbgs() << CurrentIdx << ": GIM_CheckPointerToAny(MIs["
570 dbgs() << CurrentIdx << ": GIM_CheckRegBankForClass(MIs["
590 dbgs() << CurrentIdx << ": State.Renderers[" << RendererID
613 dbgs() << CurrentIdx << ": GIM_CheckConstantInt(MIs["
638 dbgs() << CurrentIdx << ": GIM_CheckLiteralInt(MIs["
655 dbgs() << CurrentIdx << ": GIM_CheckIntrinsicID(MIs["
670 dbgs() << CurrentIdx << ": GIM_CheckCmpPredicate(MIs["
684 dbgs() << CurrentIdx << ": GIM_CheckIsMBB(MIs[" << InsnID
697 dbgs() << CurrentIdx << ": GIM_CheckIsImm(MIs[" << InsnID
709 dbgs() << CurrentIdx << ": GIM_CheckIsSafeToFold(MIs["
724 dbgs() << CurrentIdx << ": GIM_CheckIsSameOperand(MIs["
738 dbgs() << CurrentIdx << ": GIM_Reject\n");
754 dbgs() << CurrentIdx << ": GIR_MutateOpcode(OutMIs["
769 dbgs() << CurrentIdx << ": GIR_BuildMI(OutMIs["
781 dbgs()
799 dbgs() << CurrentIdx << ": GIR_CopyOrAddZeroReg(OutMIs["
814 dbgs() << CurrentIdx << ": GIR_CopySubReg(OutMIs["
826 dbgs() << CurrentIdx << ": GIR_AddImplicitDef(OutMIs["
837 dbgs() << CurrentIdx << ": GIR_AddImplicitUse(OutMIs["
850 dbgs() << CurrentIdx << ": GIR_AddRegister(OutMIs["
862 dbgs() << CurrentIdx << ": GIR_AddTempRegister(OutMIs["
874 dbgs() << CurrentIdx << ": GIR_AddImm(OutMIs[" << InsnID
886 dbgs() << CurrentIdx << ": GIR_ComplexRenderer(OutMIs["
897 dbgs() << CurrentIdx
917 dbgs() << CurrentIdx << ": GIR_CopyConstantAsSImm(OutMIs["
934 dbgs() << CurrentIdx << ": GIR_CopyFPConstantAsFPImm(OutMIs["
945 dbgs() << CurrentIdx << ": GIR_CustomRenderer(OutMIs["
960 dbgs() << CurrentIdx << ": GIR_ConstrainOperandRC(OutMIs["
972 dbgs() << CurrentIdx
983 dbgs() << CurrentIdx << ": GIR_MergeMemOperands(OutMIs["
989 dbgs() << ", MIs[" << MergeInsnID << "]");
993 DEBUG_WITH_TYPE(TgtInstructionSelector::getName(), dbgs() << ")\n");
1003 dbgs() << CurrentIdx << ": GIR_EraseFromParent(MIs["
1015 dbgs() << CurrentIdx << ": TempRegs[" << TempRegID
1025 dbgs()
1032 dbgs() << CurrentIdx << ": GIR_Done\n");
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/CodeGen/ModuloSchedule.h 147 void dump() { print(dbgs()); }
include/llvm/CodeGen/StackMaps.h 332 void debug() { print(dbgs()); }
include/llvm/ExecutionEngine/Orc/Core.h 906 dbgs() << "Dispatching " << *MU << " for " << JD.getName() << "\n";
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");
121 dbgs() << " code: "
132 dbgs() << " ro-data: "
143 dbgs() << " rw-data: "
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");
275 dbgs() << " " << static_cast<void *>(Alloc.getLocalAddress())
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");
183 llvm::dbgs() << "Arg " << Idx << ": " << ArgV[Idx] << "\n";
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/ExecutionEngine/Orc/Speculation.h 105 llvm::dbgs() << "\n In " << I.first->getName() << " JITDylib ";
107 llvm::dbgs() << "\n Likely Symbol : " << N;
include/llvm/IR/CFGDiff.h 154 LLVM_DUMP_METHOD void dump() const { print(dbgs()); }
include/llvm/IR/PassManager.h 502 dbgs() << "Starting " << getTypeName<IRUnitT>() << " pass manager run.\n";
507 dbgs() << "Running pass: " << P->name() << " on " << IR.getName()
544 dbgs() << "Finished " << getTypeName<IRUnitT>() << " pass manager run.\n";
749 dbgs() << "Clearing all analysis results for: " << Name << "\n";
865 dbgs() << "Invalidating all non-preserved analyses for: " << IR.getName()
909 dbgs() << "Invalidating analysis: " << this->lookUpPass(ID).name()
951 dbgs() << "Running analysis: " << P.name() << " on " << IR.getName()
991 dbgs() << "Invalidating analysis: " << this->lookUpPass(ID).name()
include/llvm/MC/MCAsmMacro.h 136 void dump() const { dump(dbgs()); }
152 void dump() const { dump(dbgs()); }
include/llvm/ProfileData/Coverage/CoverageMapping.h 293 void dump(const Counter &C) const { dump(C, dbgs()); }
include/llvm/ProfileData/SampleProf.h 304 void print(raw_ostream &OS = dbgs(), unsigned Indent = 0) const;
667 void dump(raw_ostream &OS = dbgs()) const;
include/llvm/ProfileData/SampleProfReader.h 345 void dumpFunctionProfile(StringRef FName, raw_ostream &OS = dbgs());
350 void dump(raw_ostream &OS = dbgs());
411 virtual bool dumpSectionInfo(raw_ostream &OS = dbgs()) { return false; };
598 virtual bool dumpSectionInfo(raw_ostream &OS = dbgs()) override;
include/llvm/Support/CFGUpdate.h 52 LLVM_DUMP_METHOD void dump() const { print(dbgs()); }
include/llvm/Support/Error.h 656 dbgs() << "Expected<T> must be checked before access or destruction.\n";
658 dbgs() << "Unchecked Expected<T> contained error:\n";
659 (*getErrorStorage())->log(dbgs());
661 dbgs() << "Expected<T> value was in success state. (Note: Expected<T> "
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: ");
495 : Roots) dbgs()
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 "
578 dbgs() << "DomTree recalculated, skipping future batch updates\n");
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) << " -> "
943 dbgs() << "\tTo (" << BlockNamePrinter(To)
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/IPO/Attributor.h 1460 void dump() const { print(dbgs()); }
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/AliasSetTracker.cpp 709 LLVM_DUMP_METHOD void AliasSet::dump() const { print(dbgs()); }
710 LLVM_DUMP_METHOD void AliasSetTracker::dump() const { print(dbgs()); }
lib/Analysis/BlockFrequencyInfo.cpp 197 print(dbgs());
lib/Analysis/BlockFrequencyInfoImpl.cpp 50 LLVM_DUMP_METHOD void BlockMass::dump() const { print(dbgs()); }
306 dbgs() << " =>"
309 dbgs() << ", succ = " << getBlockName(Succ);
311 dbgs() << ", resolved = " << getBlockName(Resolved);
312 dbgs() << "\n";
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");
416 dbgs() << " => assign " << M << " (" << D.RemMass << ")";
418 dbgs() << " [" << Desc << "]";
420 dbgs() << " to " << BFI.getBlockName(T);
421 dbgs() << "\n";
429 LLVM_DEBUG(dbgs() << " => mass: " << Mass << "\n");
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 << " => "
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
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()
1012 print(dbgs());
lib/Analysis/CFLAndersAliasAnalysis.cpp 862 dbgs()
lib/Analysis/CFLSteensAliasAnalysis.cpp 280 dbgs()
lib/Analysis/CGSCCPassManager.cpp 64 dbgs() << "Starting CGSCC pass manager run.\n";
72 dbgs() << "Running pass: " << Pass->name() << " on " << *C << "\n";
92 LLVM_DEBUG(dbgs() << "Skipping invalidated root or island SCC!\n");
126 dbgs() << "Finished CGSCC pass manager run.\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/CallGraph.cpp 111 LLVM_DUMP_METHOD void CallGraph::dump() const { print(dbgs()); }
180 LLVM_DUMP_METHOD void CallGraphNode::dump() const { print(dbgs()); }
295 void CallGraphWrapperPass::dump() const { print(dbgs(), nullptr); }
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 '"
387 dbgs() << "CGSCCPASSMGR: Refreshed SCC is now:\n";
391 dbgs() << "CGSCCPASSMGR: Refresh devirtualized a call!\n";
393 dbgs() << "CGSCCPASSMGR: SCC Refresh didn't change call graph.\n";
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()));
433 LLVM_DEBUG(dbgs() << "\t X ="; X->dump(dbgs()));
434 LLVM_DEBUG(dbgs() << "\t Y ="; Y->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()));
3343 dbgs() << "\nSrcSubscripts: ";
3345 dbgs() << *SrcSubscripts[i];
3346 dbgs() << "\nDstSubscripts: ";
3348 dbgs() << *DstSubscripts[i];
3370 dbgs() << "{";
3372 dbgs() << VI;
3374 dbgs() << ' ';
3376 dbgs() << "}\n";
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 = ");
3587 LLVM_DEBUG(dbgs() << " Separable = ");
3589 LLVM_DEBUG(dbgs() << " 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 = ");
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 102 dbgs()
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/DomTreeUpdater.cpp 433 raw_ostream &OS = llvm::dbgs();
lib/Analysis/DominanceFrontier.cpp 64 print(dbgs());
lib/Analysis/EHPersonalities.cpp 92 DEBUG_WITH_TYPE("winehprepare-coloring", dbgs() << "\nColoring funclets for "
102 dbgs() << "Visiting " << Visiting->getName() << ", "
117 dbgs() << " Assigned color \'" << Color->getName()
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");
1051 dbgs() << "LV: PHI is a recurrence with respect to an outer loop.\n");
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()
345 LLVM_DUMP_METHOD void IVUsers::dump() const { print(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");
1944 DEBUG_PRINT_STAT(NumConstantArgs);
1945 DEBUG_PRINT_STAT(NumConstantOffsetPtrArgs);
1946 DEBUG_PRINT_STAT(NumAllocaArgs);
1947 DEBUG_PRINT_STAT(NumConstantPtrCmps);
1948 DEBUG_PRINT_STAT(NumConstantPtrDiffs);
1949 DEBUG_PRINT_STAT(NumInstructionsSimplified);
1950 DEBUG_PRINT_STAT(NumInstructions);
1951 DEBUG_PRINT_STAT(SROACostSavings);
1952 DEBUG_PRINT_STAT(SROACostSavingsLost);
1953 DEBUG_PRINT_STAT(LoadEliminationCost);
1954 DEBUG_PRINT_STAT(ContainsNoDuplicateCall);
1955 DEBUG_PRINT_STAT(Cost);
1956 DEBUG_PRINT_STAT(Threshold);
2073 LLVM_DEBUG(llvm::dbgs() << " Analyzing call of " << Callee->getName()
lib/Analysis/LazyCallGraph.cpp 68 LLVM_DEBUG(dbgs() << " Added callable function: " << N.getName() << "\n");
75 LLVM_DEBUG(dbgs() << " Adding functions called by '" << getName()
142 dbgs() << *this << '\n';
155 LLVM_DEBUG(dbgs() << "Building CG for module: " << M.getModuleIdentifier()
171 LLVM_DEBUG(dbgs() << " Adding '" << F.getName()
182 LLVM_DEBUG(dbgs() << " Adding '" << F->getName()
198 dbgs() << " Adding functions referenced by global initializers to the "
227 dbgs() << *this << '\n';
301 dbgs() << *this << '\n';
lib/Analysis/LazyValueInfo.cpp 395 LLVM_DEBUG(dbgs() << "PUSH: " << *BV.second << " in "
526 dbgs() << "Giving up on stack because we are getting too deep\n");
548 dbgs() << "POP " << *e.second << " in " << e.first->getName() << " = "
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");
2053 dbgs() << "LVI for function '" << F.getName() << "':\n";
2056 LVI.printLVI(F, DTree, dbgs());
lib/Analysis/LegacyDivergenceAnalysis.cpp 347 LLVM_DEBUG(dbgs() << "\nAfter divergence analysis on " << F.getName()
349 print(dbgs(), F.getParent()));
lib/Analysis/Lint.cpp 210 dbgs() << MessagesStr.str();
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');
797 dbgs() << "LAA: Runtime check would require comparison between"
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");
828 dbgs() << "\t" << *A.getPointer() << " (" <<
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"
1046 dbgs() << "LAA: Bad stride - Pointer may wrap in the address space "
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 "
1321 dbgs() << "LAA: Distance " << Distance
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");
1540 dbgs() << "LAA: Zero dependence difference but different types\n");
1548 dbgs()
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");
1751 dbgs() << "LAA: loop control flow is not understood by analyzer\n");
1760 dbgs() << "LAA: loop control flow is not understood by analyzer\n");
1771 dbgs() << "LAA: loop control flow is not understood by analyzer\n");
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");
1953 dbgs() << "LAA: A loop annotated parallel, ignore memory dependency "
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 "
2019 dbgs() << "LAA: May be able to perform a memory runtime check if needed.\n");
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 "
2065 dbgs() << "LAA: No unsafe dependent memory operations in loop. We"
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");
2333 dbgs() << "LAA: Stride>=TripCount; No point in versioning as the "
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)
187 dbgs().indent(2) << "Found spacial reuse.\n";
189 dbgs().indent(2) << "No spacial reuse.\n";
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)
243 dbgs().indent(2)
250 LLVM_DEBUG(dbgs().indent(2) << "Found temporal reuse\n");
258 dbgs().indent(2) << "Computing cache cost for:\n";
259 dbgs().indent(4) << *this << "\n";
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");
323 dbgs().indent(2)
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");
531 dbgs() << "References:\n";
532 dbgs().indent(2) << *R << "\n";
533 dbgs().indent(2) << Representative << "\n";
561 dbgs() << "\nIDENTIFIED REFERENCE GROUPS:\n";
564 dbgs().indent(2) << "RefGroup " << n << ":\n";
566 dbgs().indent(4) << *IR << "\n";
569 dbgs() << "\n";
581 LLVM_DEBUG(dbgs() << "Considering loop '" << L.getName()
598 LLVM_DEBUG(dbgs().indent(2) << "Loop '" << L.getName()
lib/Analysis/LoopInfo.cpp 647 LLVM_DUMP_METHOD void Loop::dump() const { print(dbgs()); }
650 print(dbgs(), /*Depth=*/0, /*Verbose=*/true);
lib/Analysis/LoopPass.cpp 41 PrintLoopPassWrapper() : LoopPass(ID), OS(dbgs()) {}
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
906 dbgs() << "ObjectSizeOffsetEvaluator::compute() unhandled value: " << *V
1048 LLVM_DEBUG(dbgs() << "ObjectSizeOffsetEvaluator unknown instruction:" << I
lib/Analysis/MemorySSA.cpp 1412 LLVM_DEBUG(dbgs() << "MemorySSA skipping optimization of " << *MU << " ("
1867 LLVM_DUMP_METHOD void MemorySSA::dump() const { print(dbgs()); }
2242 print(dbgs());
2243 dbgs() << "\n";
2260 MSSA.print(dbgs());
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 937 dbgs()
lib/Analysis/MustExecute.cpp 359 dbgs() << "-- Explore context of: " << I << "\n";
361 dbgs() << " [F: " << CI->getFunction()->getName() << "] " << *CI
441 F.print(dbgs(), &Writer);
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");
489 dbgs() << "\tUnconditional terminator, continue with successor\n");
493 LLVM_DEBUG(dbgs() << "\tNo join point found\n");
lib/Analysis/PHITransAddr.cpp 47 dbgs() << "PHITransAddr: null\n";
50 dbgs() << "PHITransAddr: " << *Addr << "\n";
52 dbgs() << " Input #" << i << " is " << *InstInputs[i] << "\n";
lib/Analysis/RegionPass.cpp 161 LLVM_DEBUG(dbgs() << "\nRegion tree of function " << F.getName()
163 RI->dump(); dbgs() << "\n";);
294 LLVM_DEBUG(dbgs() << "Skipping pass '" << getPassName()
lib/Analysis/ScalarEvolution.cpp 233 print(dbgs());
234 dbgs() << '\n';
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 "
9460 assert(!verifyFunction(*L->getHeader()->getParent(), &dbgs()) &&
9570 assert(!verifyFunction(*L->getHeader()->getParent(), &dbgs()) &&
11033 dbgs() << "Strides:\n";
11035 dbgs() << *S << "\n";
11044 dbgs() << "Terms:\n";
11046 dbgs() << *T << "\n";
11159 dbgs() << "Terms:\n";
11161 dbgs() << *T << "\n";
11190 dbgs() << "Terms after sorting:\n";
11192 dbgs() << *T << "\n";
11204 dbgs() << "Sizes:\n";
11206 dbgs() << *S << "\n";
11228 dbgs() << "Res: " << *Res << "\n";
11229 dbgs() << "Sizes[i]: " << *Sizes[i] << "\n";
11230 dbgs() << "Res divided by Sizes[i]:\n";
11231 dbgs() << "Quotient: " << *Q << "\n";
11232 dbgs() << "Remainder: " << *R << "\n";
11262 dbgs() << "Subscripts:\n";
11264 dbgs() << *S << "\n";
11340 dbgs() << "succeeded to delinearize " << *Expr << "\n";
11341 dbgs() << "ArrayDecl[UnknownSize]";
11343 dbgs() << "[" << *S << "]";
11345 dbgs() << "\nArrayRef";
11347 dbgs() << "[" << *S << "]";
11348 dbgs() << "\n";
11982 dbgs() << "Trip Count for " << *L << " Changed!\n";
11983 dbgs() << "Old: " << *CurBECount << "\n";
11984 dbgs() << "New: " << *NewBECount << "\n";
11985 dbgs() << "Delta: " << *Delta << "\n";
lib/Analysis/ScalarEvolutionExpander.cpp 1990 DEBUG_WITH_TYPE(DebugType, dbgs()
2049 dbgs() << "INDVARS: Eliminated congruent iv.inc: "
2069 DEBUG_WITH_TYPE(DebugType, dbgs() << "INDVARS: Eliminated congruent iv: "
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
lib/Analysis/SyncDependenceAnalysis.cpp 224 LLVM_DEBUG(dbgs() << "SDA:computeJoinPoints. Parent loop: " << (ParentLoop ? ParentLoop->getName() : "<null>") << "\n" );
240 dbgs() << "SDA: rpo order:\n";
242 dbgs() << "- " << RpoBlock->getName() << "\n";
259 LLVM_DEBUG(dbgs() << "SDA::joins. visiting " << Block->getName() << "\n");
291 LLVM_DEBUG(dbgs() << "SDA::joins. After propagation:\n"; printDefs(dbgs()));
291 LLVM_DEBUG(dbgs() << "SDA::joins. After propagation:\n"; printDefs(dbgs()));
316 LLVM_DEBUG(printDefs(dbgs()));
lib/Analysis/Trace.cpp 51 print(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'
1054 dbgs() << "LV: Invalidate candidate interleaved store group due "
1088 dbgs() << "LV: Invalidate candidate interleaved group due to "
1099 dbgs() << "LV: Invalidate candidate interleaved group due to "
1111 dbgs() << "LV: Invalidate candidate interleaved group due to "
1117 dbgs() << "LV: Interleaved group requires epilogue iteration.\n");
1138 dbgs()
lib/Bitcode/Reader/BitcodeReader.cpp 5380 dbgs() << "GUID " << ValueGUID << "(" << OriginalNameID << ") is "
lib/Bitcode/Writer/BitcodeWriterPass.cpp 38 WriteBitcodePass() : ModulePass(ID), OS(dbgs()) {
lib/Bitcode/Writer/ValueEnumerator.cpp 468 print(dbgs(), ValueMap, "Default");
469 dbgs() << '\n';
470 print(dbgs(), MetadataMap, "MetaData");
471 dbgs() << '\n';
lib/CodeGen/AggressiveAntiDepBreaker.cpp 141 LLVM_DEBUG(dbgs() << "AntiDep Critical-Path Registers:");
143 : CriticalPathSet.set_bits()) dbgs()
145 LLVM_DEBUG(dbgs() << '\n');
205 LLVM_DEBUG(dbgs() << "Observe: ");
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);
326 dbgs() << header << printReg(Reg, TRI);
329 LLVM_DEBUG(dbgs() << "->g" << State->GetGroup(Reg) << tag);
342 dbgs() << header << printReg(Reg, TRI);
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) << ":");
589 dbgs() << " ::";
591 dbgs() << " " << printReg(r, TRI);
592 dbgs() << "\n";
616 dbgs() << "*** Performing rename " << printReg(SuperReg, TRI)
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: ");
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 43 dbgs() << "hints:";
45 dbgs() << ' ' << printReg(Hints[I], TRI);
46 dbgs() << '\n';
lib/CodeGen/AsmPrinter/AccelTable.cpp 137 void dump() const { print(dbgs()); }
156 void dump() const { print(dbgs()); }
179 void dump() const { print(dbgs()); }
lib/CodeGen/AsmPrinter/DIE.cpp 89 LLVM_DEBUG(dbgs() << "Invalid form " << format("0x%x", AttrData.getForm())
133 print(dbgs());
273 print(dbgs());
365 print(dbgs());
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"
339 dbgs() << "DbgValueHistoryMap:\n";
347 dbgs() << " - " << LocalVar->getName() << " at ";
350 dbgs() << Location->getFilename() << ":" << Location->getLine() << ":"
353 dbgs() << "<unknown location>";
355 dbgs() << " --\n";
359 dbgs() << " Entry[" << E.index() << "]: ";
361 dbgs() << "Debug value\n";
363 dbgs() << "Clobber\n";
364 dbgs() << " Instr: " << *Entry.getInstr();
367 dbgs() << " - Valid until end of function\n";
369 dbgs() << " - Closed by Entry[" << Entry.getEndIndex() << "]\n";
371 dbgs() << "\n";
lib/CodeGen/AsmPrinter/DebugLocEntry.h 76 llvm::dbgs() << "Loc = { reg=" << Loc.getReg() << " ";
78 llvm::dbgs() << "+0";
79 llvm::dbgs() << "} ";
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");
1470 dbgs() << CurEntry->getValues().size() << " Values:\n";
1473 dbgs() << "-----\n";
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!");
966 dbgs() << "\nTryTailMergeBlocks: ";
967 for (unsigned i = 0, e = MergePotentials.size(); i != e; ++i) dbgs()
970 dbgs() << "\n"; if (SuccBB) {
971 dbgs() << " with successor " << printMBBReference(*SuccBB) << '\n';
973 dbgs() << " which has fall-through from "
975 } dbgs() << "Looking for common tails of at least "
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 144 dbgs() << format("%%bb.%u\toffset=%08x\t", MBB.getNumber(), BBI.Offset)
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/CallingConvLower.cpp 135 dbgs() << "Call operand #" << i << " has unhandled type "
153 dbgs() << "Call operand #" << i << " has unhandled type "
170 dbgs() << "Call result #" << i << " has unhandled type "
182 dbgs() << "Call result has unhandled type "
216 dbgs() << "Call has unhandled type " << EVT(VT).getEVTString()
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");
1479 LLVM_DEBUG(dbgs() << "sinking 'and' use: " << *User << "\n");
2244 print(dbgs());
2245 dbgs() << '\n';
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");
6399 dbgs() << "Estimated cost of computation to be promoted:\nScalar: "
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 212 dbgs() << "Finalizing packet:\n";
216 dbgs() << " * [res:0x" << utohexstr(R) << "] " << *MI;
226 LLVM_DEBUG(dbgs() << "End packet\n");
240 dbgs() << "Scheduling DAG of the packetize region\n";
277 LLVM_DEBUG(dbgs() << "Checking resources for adding MI to packet " << MI);
282 dbgs() << " Resources are available for adding MI to packet\n";
284 dbgs() << " Resources NOT available\n";
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;
527 dbgs() << printReg(Reg, nullptr)
530 } dbgs() << "\n";);
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);
408 dbgs() << "Would clobber";
411 dbgs() << ' ' << printRegUnit(*i, TRI);
412 dbgs() << " live before " << *I;
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);
172 dbgs() << "replaced by: " << *(--dMI);
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);
261 dbgs() << "CSEInfo::CSE Hit for Opc " << It.first << " : " << It.second
lib/CodeGen/GlobalISel/CallLowering.cpp 333 LLVM_DEBUG(dbgs()
360 dbgs()
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");
74 LLVM_DEBUG(dbgs() << "Changing: " << MI << "\n");
78 LLVM_DEBUG(dbgs() << "Changed: " << MI << "\n");
85 dbgs() << "Created: ";
86 MI->print(dbgs());
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: "
609 dbgs() << " Ignoring candidate as memop does not dominate uses: "
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 317 dbgs() << '[' << Depth << "] Shift not known constant: " << *RHSMI);
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
472 dbgs() << "Case clusters: ";
475 dbgs() << "JT:";
477 dbgs() << "BT:";
479 C.Low->getValue().print(dbgs(), true);
481 dbgs() << '-';
482 C.High->getValue().print(dbgs(), true);
484 dbgs() << ' ';
486 dbgs() << '\n';
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");
145 dbgs() << "Into:\n";
147 dbgs() << " " << InsertedMI;
148 dbgs() << '\n';
245 dbgs() << "Rules covered by selecting function: " << MF.getName() << ":";
247 dbgs() << " id" << RuleID;
248 dbgs() << "\n\n";
lib/CodeGen/GlobalISel/Legalizer.cpp 110 LLVM_DEBUG(dbgs() << ".. .. New MI: " << MI);
118 dbgs() << ".. .. New MI: " << *MI;
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()));
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());
181 LLVM_DEBUG(dbgs() << "Applying legalizer ruleset to: "; Query.print(dbgs());
182 dbgs() << "\n");
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");
208 dbgs() << ".. type index coverage check SKIPPED: no rules defined\n");
213 LLVM_DEBUG(dbgs() << ".. type index coverage check SKIPPED:"
219 LLVM_DEBUG(dbgs() << ".. the first uncovered type index: " << FirstUncovered
231 dbgs() << ".. imm index coverage check SKIPPED: no rules defined\n");
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);
134 dbgs() << "Checking use: " << MIUse
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: ";
126 if (CurRegBank) dbgs() << *CurRegBank; else dbgs() << "none";
126 if (CurRegBank) dbgs() << *CurRegBank; else dbgs() << "none";
127 dbgs() << " against ";
129 dbgs() << *DesiredRegBrank << '\n';);
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");
1058 print(dbgs());
1059 dbgs() << '\n';
lib/CodeGen/GlobalISel/RegisterBank.cpp 82 print(dbgs(), /* IsForDebug */ true, TRI);
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');
508 print(dbgs());
509 dbgs() << '\n';
574 print(dbgs());
575 dbgs() << '\n';
628 print(dbgs());
629 dbgs() << '\n';
751 print(dbgs(), true);
752 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");
2149 dbgs() << "Unable to predicate " << I << "!\n";
2198 dbgs() << "Unable to predicate " << I << "!\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);
763 dbgs() << '\t' << header << ": " << NextLine;
777 dbgs() << SlotIndent << Idx << '\t' << *I;
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");
1420 dbgs() << "spills in BB: ";
1422 dbgs() << Rspill->getBlock()->getNumber() << " ";
1423 dbgs() << "were promoted to BB" << (*RIt)->getBlock()->getNumber()
1476 dbgs() << "\nFor Slot" << Slot << " and VN" << OrigVNI->id << ":\n"
1479 dbgs() << spill->getParent()->getNumber() << " ";
1480 dbgs() << "\n";
1491 dbgs() << "Finally inserted spills in BB: ";
1493 dbgs() << Ispill.first->getNumber() << " ";
1494 dbgs() << "\nFinally removed spills in BB: ";
1496 dbgs() << Rspill->getParent()->getNumber() << " ";
1497 dbgs() << "\n";
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/LatencyPriorityQueue.cpp 145 dbgs() << "Latency Priority Queue\n";
146 dbgs() << " Number of Queue Entries: " << Queue.size() << "\n";
148 dbgs() << " ";
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/LexicalScopes.cpp 323 raw_ostream &err = dbgs();
lib/CodeGen/LiveDebugValues.cpp 334 void dump(const TargetRegisterInfo *TRI, raw_ostream &Out = dbgs()) const {
335 dbgs() << "VarLoc(";
339 dbgs() << printReg(Loc.RegNo, TRI);
342 dbgs() << printReg(Loc.SpillLocation.SpillBase, TRI);
343 dbgs() << "[" << Loc.SpillLocation.SpillOffset << "]";
346 dbgs() << Loc.Immediate;
352 dbgs() << ", \"" << Var.getVar()->getName() << "\", " << *Expr << ", ";
354 dbgs() << "!" << Var.getInlinedAt()->getMetadataID() << ")\n";
356 dbgs() << "(null))\n";
768 dbgs() << "Creating VarLoc for register copy:";
781 dbgs() << "Creating VarLoc for spill:";
794 dbgs() << "Creating VarLoc for restore:";
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) << '('
1043 dbgs() << "Add to OutLocs in MBB #" << CurMBB->getNumber() << ": ";
1136 LLVM_DEBUG(dbgs() << "join MBB: " << MBB.getNumber() << "\n");
1151 LLVM_DEBUG(dbgs() << " ignoring unvisited pred MBB: " << p->getNumber()
1170 dbgs() << " gathered candidate incoming var: "
1187 dbgs() << " killing " << Name << ", it doesn't dominate MBB\n";
1247 LLVM_DEBUG(dbgs() << "Inserted: "; MI->dump(););
1255 LLVM_DEBUG(dbgs() << "\nDebug Range Extension\n");
1345 "OutLocs after initialization", dbgs()));
1365 LLVM_DEBUG(dbgs() << "Processing Worklist\n");
1385 "OutLocs after propagating", dbgs()));
1387 "InLocs after propagating", dbgs()));
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()));
1013 dbgs() << "Splitting Loc" << OldLocNo << '\t';
1014 print(dbgs(), nullptr);
1095 LLVM_DEBUG(dbgs() << "Erasing [" << LocMapI.start() << ';'
1108 dbgs() << "Split result: \t";
1109 print(dbgs(), nullptr);
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));
1420 static_cast<LDVImpl*>(pImpl)->print(dbgs());
lib/CodeGen/LiveInterval.cpp 997 dbgs() << *this << '\n';
1047 dbgs() << *this << '\n';
1051 dbgs() << *this << '\n';
1055 dbgs() << *this << '\n';
lib/CodeGen/LiveIntervals.cpp 184 printInstrs(dbgs());
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');
473 dbgs() << Idx << '\t' << UseMI
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 << ": "
1025 dbgs() << " ";
1027 dbgs() << printReg(Reg);
1029 dbgs() << " L" << PrintLaneMask(LaneMask);
1031 dbgs() << printRegUnit(Reg, &TRI);
1033 dbgs() << ":\t" << LR << '\n';
1039 LLVM_DEBUG(dbgs() << " -->\t" << LR << '\n');
1658 LLVM_DEBUG(dbgs() << " Split " << NumComp << " components: " << LI << '\n');
lib/CodeGen/LivePhysRegs.cpp 139 dbgs() << " " << *this;
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);
471 dbgs() << "Inflated " << printReg(LI.reg) << " to "
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/LiveVariables.cpp 69 dbgs() << " Alive in blocks: ";
72 dbgs() << *I << ", ";
73 dbgs() << "\n Killed by:";
75 dbgs() << " No instructions.\n";
78 dbgs() << "\n #" << i << ": " << *Kills[i];
79 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 126 dbgs() << "Splicing ";
128 dbgs() << " right before: ";
219 LLVM_DEBUG(dbgs() << "Operand " << 0 << " of "; II->dump(); MO.dump(););
268 dbgs() << "Splicing ";
270 dbgs() << " right before: ";
290 dbgs() << "Rescheduling Multi-Use Instructions Lexographically.";);
298 dbgs() << "Rescheduling Idempotent Instructions Lexographically.";);
382 LLVM_DEBUG(dbgs() << "\n Canonicalizing BasicBlock " << MBB->getName()
388 dbgs() << "Found potentially duplicate BasicBlocks: " << MBB->getName()
395 dbgs() << "\n\n NEW BASIC BLOCK: " << MBB->getName() << " \n\n";
396 dbgs() << "\n\n================================================\n\n";
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();
445 dbgs() << "\n";);
447 dbgs() << "\n\n================================================\n\n");
457 LLVM_DEBUG(dbgs() << "\n Canonicalizing Function " << MF.getName()
466 dbgs() << "\n\n NEW MACHINE FUNCTION: " << MF.getName() << " \n\n";
467 dbgs() << "\n\n================================================\n\n";
468 dbgs() << "Total Basic Blocks: " << RPOList.size() << "\n";
470 : RPOList) { dbgs() << MBB->getName() << "\n"; } dbgs()
470 : RPOList) { dbgs() << MBB->getName() << "\n"; } dbgs()
lib/CodeGen/MIRPrintingPass.cpp 32 MIRPrintingPass() : MachineFunctionPass(ID), OS(dbgs()) {}
lib/CodeGen/MIRVRegNamerUtils.cpp 74 LLVM_DEBUG(dbgs() << "Found Candidate: "; MI->dump(););
95 LLVM_DEBUG(dbgs() << "Popping frame index.\n";);
105 dbgs() << "Popping vreg ";
107 dbgs() << "\n";
116 LLVM_DEBUG(dbgs() << "Popping physreg.\n";);
133 dbgs() << "\n========================\n";
134 dbgs() << "Visited MI: ";
136 dbgs() << "BB Name: " << Def->getParent()->getName() << "\n";
137 dbgs() << "\n========================\n";
144 LLVM_DEBUG(dbgs() << "Pushing frame index.\n";);
171 LLVM_DEBUG(dbgs() << "Skipping rename for FI " << LastRenameReg << "\n";);
189 dbgs() << "Skipping rename for Phys Reg " << LastRenameReg << "\n";
196 LLVM_DEBUG(dbgs() << "Vreg " << Reg
204 LLVM_DEBUG(dbgs() << "Mapping vreg ";);
208 LLVM_DEBUG(dbgs() << Reg;);
210 LLVM_DEBUG(dbgs() << " to ";);
214 LLVM_DEBUG(dbgs() << Rename;);
216 LLVM_DEBUG(dbgs() << "\n";);
282 LLVM_DEBUG(dbgs() << "Enqueue register"; MO.dump(); dbgs() << "\n";);
282 LLVM_DEBUG(dbgs() << "Enqueue register"; MO.dump(); dbgs() << "\n";);
299 LLVM_DEBUG(dbgs() << "Enqueue Reg/FI"; MO.dump(); dbgs() << "\n";);
299 LLVM_DEBUG(dbgs() << "Enqueue Reg/FI"; MO.dump(); dbgs() << "\n";);
lib/CodeGen/MachineBasicBlock.cpp 246 print(dbgs());
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/MachineBlockFrequencyInfo.cpp 205 MBFI->print(dbgs());
lib/CodeGen/MachineBlockPlacement.cpp 659 LLVM_DEBUG(dbgs() << " " << getBlockName(Succ)
1027 LLVM_DEBUG(dbgs() << "Trellis, but not one of the chosen edges.\n");
1046 dbgs() << " Selected: " << getBlockName(Succ2)
1061 dbgs() << " Selected: " << getBlockName(TrellisSucc)
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)
1524 dbgs() << " Candidate: " << getBlockName(Succ)
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) << " -> ";
1613 MBFI->printBlockFreq(dbgs(), CandidateFreq) << " (freq)\n");
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 "
1975 MBFI->printBlockFreq(dbgs(), Pred) << " freq\n");
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) << " -> "
2119 MBFI->printBlockFreq(dbgs(), ExitEdgeFreq) << ")\n");
2144 dbgs() << " No other candidate exit blocks, using loop header\n");
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)
2525 dbgs() << "Loop chain contains a block without its preds placed!\n"
2530 dbgs() << " ... " << getBlockName(ChainBB) << "\n";
2535 dbgs() << "Loop chain contains a block not contained by the loop!\n"
2545 dbgs() << "Loop contains blocks never placed into a chain!\n"
2579 LLVM_DEBUG(dbgs() << "Pre-merging due to unanalyzable fallthrough: "
2621 dbgs() << "Function chain contains a block not in the function!\n"
2628 dbgs() << "Function contains blocks never placed into a chain!\n"
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");
631 dbgs() << "*** Not the same register constraints, avoid CSE!\n");
lib/CodeGen/MachineCombiner.cpp 312 LLVM_DEBUG(dbgs() << " Dependence data for " << *Root << "\tNewRootDepth: "
321 LLVM_DEBUG(dbgs() << "\tIt MustReduceDepth ");
323 ? dbgs() << "\t and it does it\n"
324 : dbgs() << "\t but it does NOT do it\n");
341 LLVM_DEBUG(dbgs() << "\n\tNewRootLatency: " << NewRootLatency
348 ? dbgs() << "\n\t It IMPROVES PathLen because"
349 : dbgs() << "\n\t It DOES NOT improve PathLen because");
350 LLVM_DEBUG(dbgs() << "\n\t\tNewCycleCount = " << NewCycleCount
397 LLVM_DEBUG(dbgs() << "\t\tResource length before replacement: "
402 ? dbgs() << "\t\t As result it IMPROVES/PRESERVES Resource Length\n"
403 : dbgs() << "\t\t As result it DOES NOT improve/preserve Resource "
497 LLVM_DEBUG(dbgs() << "Combining MBB " << MBB->getName() << "\n");
561 dbgs() << "\tFor the Pattern (" << (int)P
564 InstrPtr->print(dbgs(), /*IsStandalone*/false, /*SkipOpers*/false,
566 dbgs() << "\tThese instructions could replace the removed ones\n";
568 InstrPtr->print(dbgs(), /*IsStandalone*/false, /*SkipOpers*/false,
644 LLVM_DEBUG(dbgs() << getPassName() << ": " << MF.getName() << '\n');
647 dbgs()
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());
420 dbgs() << "MCP: FIXME! Not forwarding COPY to sub-register use:\n "
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()
256 print(MF, dbgs());
lib/CodeGen/MachineFunction.cpp 474 print(dbgs());
955 LLVM_DUMP_METHOD void MachineJumpTableInfo::dump() const { print(dbgs()); }
1114 LLVM_DUMP_METHOD void MachineConstantPool::dump() const { print(dbgs()); }
lib/CodeGen/MachineFunctionPrinterPass.cpp 33 MachineFunctionPrinterPass() : MachineFunctionPass(ID), OS(dbgs()) { }
lib/CodeGen/MachineInstr.cpp 1449 dbgs() << " ";
1450 print(dbgs());
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);
1451 dbgs() << "Hoisting " << *MI;
1453 dbgs() << " from " << printMBBReference(*MI->getParent());
1455 dbgs() << " to " << printMBBReference(*Preheader);
1456 dbgs() << "\n";
lib/CodeGen/MachineLoopInfo.cpp 147 print(dbgs());
lib/CodeGen/MachineOperand.cpp 959 LLVM_DUMP_METHOD void MachineOperand::dump() const { dbgs() << *this << '\n'; }
lib/CodeGen/MachineOutliner.cpp 1286 LLVM_DEBUG(dbgs() << "OutlinedSomething = " << OutlinedSomething << "\n";);
1442 dbgs() << "Machine Outliner: Running on ";
1444 dbgs() << "all functions";
1446 dbgs() << "target-default functions";
1447 dbgs() << "\n";
lib/CodeGen/MachinePipeliner.cpp 250 LLVM_DEBUG(dbgs() << "\n!!! Can not pipeline loop.\n");
322 dbgs() << "Unable to analyzeBranch, can NOT pipeline current Loop\n");
331 dbgs() << "Unable to analyzeLoop, can NOT pipeline current Loop\n");
338 dbgs() << "Preheader not found, can NOT pipeline current Loop\n");
452 LLVM_DEBUG(dbgs() << "MII = " << MII << " MAX_II = " << MAX_II
458 dbgs()
466 LLVM_DEBUG(dbgs() << "MII > " << SwpMaxMii
482 dbgs() << " Rec NodeSet ";
495 dbgs() << " NodeSet ";
509 LLVM_DEBUG(dbgs() << "No schedule found, return\n");
518 dbgs() << "No overlapped iterations, no need to generate pipeline\n");
524 LLVM_DEBUG(dbgs() << "numStages:" << numStages << ">" << SwpMaxStages
1016 LLVM_DEBUG(dbgs() << "calculateResMII:\n");
1048 dbgs() << "Trying to reserve resource for " << NumCycles
1061 LLVM_DEBUG(dbgs() << "ReservedCycles:" << ReservedCycles
1065 LLVM_DEBUG(if (SwpDebugResource) dbgs()
1075 LLVM_DEBUG(dbgs() << "Retrun Res MII:" << Resmii << "\n");
1430 dbgs() << "\tNode " << i << ":\n";
1431 dbgs() << "\t ASAP = " << getASAP(&SUnits[i]) << "\n";
1432 dbgs() << "\t ALAP = " << getALAP(&SUnits[i]) << "\n";
1433 dbgs() << "\t MOV = " << getMOV(&SUnits[i]) << "\n";
1434 dbgs() << "\t D = " << getDepth(&SUnits[i]) << "\n";
1435 dbgs() << "\t H = " << getHeight(&SUnits[i]) << "\n";
1436 dbgs() << "\t ZLD = " << getZeroLatencyDepth(&SUnits[i]) << "\n";
1437 dbgs() << "\t ZLH = " << getZeroLatencyHeight(&SUnits[i]) << "\n";
1615 dbgs() << "Excess register pressure: SU(" << SU->NodeNum << ") "
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");
1951 dbgs() << "Node order: ";
1953 dbgs() << " " << I->NodeNum << " ";
1954 dbgs() << "\n";
1963 LLVM_DEBUG(dbgs() << "NodeOrder is empty! abort scheduling\n" );
1973 LLVM_DEBUG(dbgs() << "Try to schedule with " << II << "\n");
1991 dbgs() << "\n";
1992 dbgs() << "Inst (" << SU->NodeNum << ") ";
1994 dbgs() << "\n";
1997 dbgs() << format("\tes: %8x ls: %8x me: %8x ms: %8x\n", EarlyStart,
2034 dbgs() << "\tCan't schedule\n";
2043 LLVM_DEBUG(dbgs() << "Schedule Found? " << scheduleFound << " (II=" << II
2287 dbgs() << "Trying to insert node between " << StartCycle << " and "
2318 dbgs() << "\tinsert at cycle " << curCycle << " ";
2331 dbgs() << "\tfailed to insert at cycle " << curCycle << " ";
2736 LLVM_DEBUG(dbgs() << "In a circuit, predecessor ";);
2740 LLVM_DEBUG(dbgs() << "Predecessor ";);
2742 LLVM_DEBUG(dbgs() << Pred->NodeNum << " and successor " << Succ->NodeNum
2750 dbgs() << "Invalid node order found!\n";
2885 LLVM_DUMP_METHOD void SMSchedule::dump() const { print(dbgs()); }
2886 LLVM_DUMP_METHOD void NodeSet::dump() const { print(dbgs()); }
2920 dbgs() << "ProcResourceDesc:\n";
2923 dbgs() << format(" %16s(%2d): Mask: 0x%08x, NumUnits:%2d\n",
2927 dbgs() << " -----------------\n";
2936 dbgs() << "canReserveResources:\n";
2945 dbgs() << "No valid Schedule Class Desc for schedClass!\n";
2946 dbgs() << "isPseduo:" << MID->isPseudo() << "\n";
2961 dbgs() << format(" %16s(%2d): Count: %2d, NumUnits:%2d, Cycles:%2d\n",
2969 LLVM_DEBUG(if (SwpDebugResource) dbgs() << "return true\n\n";);
2976 dbgs() << "reserveResources:\n";
2985 dbgs() << "No valid Schedule Class Desc for schedClass!\n";
2986 dbgs() << "isPseduo:" << MID->isPseudo() << "\n";
3000 dbgs() << format(" %16s(%2d): Count: %2d, NumUnits:%2d, Cycles:%2d\n",
3009 dbgs() << "reserveResources: done!\n\n";
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()));
370 LLVM_DEBUG(dbgs() << "Before MISched:\n"; mf.print(dbgs()));
406 LLVM_DEBUG(dbgs() << "Subtarget disables post-MI-sched.\n");
409 LLVM_DEBUG(dbgs() << "Before post-MI-sched:\n"; mf.print(dbgs()));
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)
565 if (RegionEnd != MBB->end()) dbgs() << *RegionEnd;
566 else dbgs() << "End";
567 dbgs() << " RegionInstrs: " << NumRegionInstrs << '\n');
597 dbgs() << "Queue " << Name << ": ";
599 dbgs() << SU->NodeNum << " ";
600 dbgs() << "\n";
628 dbgs() << "*** Scheduling failed! ***\n";
630 dbgs() << " has been released too many times!\n";
665 dbgs() << "*** Scheduling failed! ***\n";
667 dbgs() << " has been released too many times!\n";
747 LLVM_DEBUG(dbgs() << "ScheduleDAGMI::schedule starting\n");
771 LLVM_DEBUG(dbgs() << "** ScheduleDAGMI::schedule picking next node\n");
812 dbgs() << "*** Final schedule for "
815 dbgs() << '\n';
914 dbgs() << "Missing SUnit\n";
1021 LLVM_DEBUG(dbgs() << "Live Thru: ";
1036 LLVM_DEBUG(dbgs() << "Top Pressure:\n";
1038 dbgs() << "Bottom Pressure:\n";
1054 LLVM_DEBUG(dbgs() << TRI->getRegPressureSetName(i) << " Limit " << Limit
1059 LLVM_DEBUG(dbgs() << "Excess PSets: ";
1061 : RegionCriticalPSets) dbgs()
1063 dbgs() << "\n");
1084 LLVM_DEBUG(dbgs() << " " << TRI->getRegPressureSetName(ID) << ": "
1118 LLVM_DEBUG(dbgs() << " UpdateRegP: SU(" << SU.NodeNum << ") "
1121 dbgs() << " to "; PDiff.dump(*TRI););
1125 LLVM_DEBUG(dbgs() << " LiveReg: " << printVRegOrUnit(Reg, TRI) << "\n");
1153 LLVM_DEBUG(dbgs() << " UpdateRegP: SU(" << SU->NodeNum << ") "
1155 dbgs() << " to "; PDiff.dump(*TRI););
1170 dbgs() << " Pressure Diff : ";
1173 dbgs() << " Single Issue : ";
1176 dbgs() << "true;";
1178 dbgs() << "false;";
1179 dbgs() << '\n';
1197 LLVM_DEBUG(dbgs() << "ScheduleDAGMILive::schedule starting\n");
1219 LLVM_DEBUG(dbgs() << "** ScheduleDAGMILive::schedule picking next node\n");
1248 dbgs() << "*** Final schedule for "
1251 dbgs() << '\n';
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: "
2081 dbgs() << " " << Available.getName() << " + Remain CritRes: "
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 "
2432 dbgs() << Available.getName() << " @" << CurrCycle << "c\n"
2434 dbgs() << "\n Executed: " << getExecutedCount() / LFactor << "c";
2435 dbgs() << "\n Critical: " << ResCount / LFactor << "c, "
2542 LLVM_DEBUG(dbgs() << " " << CurrZone.Available.getName()
2552 dbgs() << " " << CurrZone.Available.getName() << " ResourceLimited: "
2554 } if (OtherResLimited) dbgs()
2557 if (!CurrZone.isResourceLimited() && !OtherResLimited) dbgs()
2627 dbgs() << " Cand SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason);
2629 dbgs() << " " << TRI->getRegPressureSetName(P.getPSet())
2632 dbgs() << " ";
2634 dbgs() << " " << SchedModel->getProcResource(ResIdx)->Name << " ";
2636 dbgs() << " ";
2638 dbgs() << " " << Latency << " cycles ";
2640 dbgs() << " ";
2641 dbgs() << '\n';
2706 LLVM_DEBUG(dbgs() << "Pick " << (IsTop ? "Top " : "Bot ")
2796 dbgs() << "GenericScheduler RegionPolicy: "
2832 dbgs() << "IssueCycles="
2838 if (Rem.IsAcyclicLatencyLimited) dbgs() << " ACYCLIC LATENCY LIMIT\n");
2849 LLVM_DEBUG(dbgs() << "Critical Path(GS-RR ): " << Rem.CriticalPath << '\n');
2979 LLVM_DEBUG(if (Cand.RPDelta.Excess.isValid()) dbgs()
3152 LLVM_DEBUG(dbgs() << "Picking from Bot:\n");
3172 LLVM_DEBUG(dbgs() << "Picking from Top:\n");
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');
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) << ": ");
493 dbgs() << printMBBReference(*TBI.Pred) << '\n';
495 dbgs() << "null\n";
505 LLVM_DEBUG(dbgs() << " succ for " << printMBBReference(*I) << ": ");
511 dbgs() << printMBBReference(*TBI.Succ) << '\n';
513 dbgs() << "null\n";
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");
868 dbgs() << format("%7u Instructions\n", TBI.InstrDepth);
873 dbgs() << format("%6uc @ ", MTM.getCycles(PRDepths[K]))
1046 LLVM_DEBUG(dbgs() << "Heights for " << printMBBReference(*MBB) << ":\n");
1052 dbgs() << format("%7u Instructions\n", TBI.InstrHeight);
1057 dbgs() << format("%6uc @ ", MTM.getCycles(PRHeights[K]))
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 69 dbgs() << "Macro fuse: "; DAG.dumpNodeName(FirstSU); dbgs() << " - ";
69 dbgs() << "Macro fuse: "; DAG.dumpNodeName(FirstSU); dbgs() << " - ";
70 DAG.dumpNodeName(SecondSU); dbgs() << " / ";
71 dbgs() << DAG.TII->getName(FirstSU.getInstr()->getOpcode()) << " - "
82 LLVM_DEBUG(dbgs() << " Bind "; DAG.dumpNodeName(SecondSU);
83 dbgs() << " - "; DAG.dumpNodeName(*SU); dbgs() << '\n';);
83 dbgs() << " - "; DAG.dumpNodeName(*SU); dbgs() << '\n';);
94 LLVM_DEBUG(dbgs() << " Bind "; DAG.dumpNodeName(*SU); dbgs() << " - ";
94 LLVM_DEBUG(dbgs() << " Bind "; DAG.dumpNodeName(*SU); dbgs() << " - ";
95 DAG.dumpNodeName(FirstSU); dbgs() << '\n';);
lib/CodeGen/ModuloSchedule.cpp 162 LLVM_DEBUG(dbgs() << "New block\n"; KernelBB->dump(););
229 dbgs() << "prolog:\n";
311 dbgs() << "epilog:\n";
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");
1982 dbgs() << " Stage=" << Stage << ", Cycle=" << Cycle << "\n";
1988 dbgs() << "--- ModuloScheduleTest running on BB#" << BB->getNumber() << "\n";
1997 dbgs() << "Parsing post-instr symbol for " << MI;
lib/CodeGen/PHIElimination.cpp 278 LLVM_DEBUG(dbgs() << "Reusing " << printReg(IncomingReg) << " for "
302 LLVM_DEBUG(dbgs() << "Remove old kill from " << *OldKill);
599 LLVM_DEBUG(dbgs() << printReg(Reg) << " live-out before critical edge "
617 dbgs() << "Split wouldn't help, maybe avoid loop copies?\n";
619 dbgs() << "PreLoop: " << *PreLoop;
621 dbgs() << "CurLoop: " << *CurLoop;
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 246 dbgs() << "*** Final schedule ***\n";
248 dbgs() << '\n';
260 dbgs() << "**** NOOP ****\n";
311 LLVM_DEBUG(dbgs() << "PostRAScheduler\n");
324 dbgs() << "*** DEBUG scheduling " << Fn.getName() << ":"
415 LLVM_DEBUG(dbgs() << "********** List Scheduling **********\n");
462 dbgs() << "*** Scheduling failed! ***\n";
464 dbgs() << " has been released too many times!\n";
499 LLVM_DEBUG(dbgs() << "*** Scheduling [" << CurCycle << "]: ");
514 LLVM_DEBUG(dbgs() << "*** Emitting noop in cycle " << CurCycle << '\n');
566 LLVM_DEBUG(dbgs() << "\n*** Examining Available\n";
604 dbgs() << "*** Will schedule a non-preferred instruction...\n");
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)
980 dbgs() << " " << printReg(Reg, TRI);
985 dbgs() << "*";
988 dbgs() << '=' << printReg(PhysRegState[Reg]);
993 dbgs() << "*";
999 dbgs() << '\n';
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);
1265 dbgs() << "\n>> " << MI << "Regs:";
1280 LLVM_DEBUG(dbgs() << "Spilling live registers at end of block.\n");
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
1152 dbgs() << printReg(PhysReg, TRI) << " would clobber CSR "
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");
1406 dbgs() << " EB#" << i;
1407 dbgs() << ".\n";
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 = ";
1848 MBFI->printBlockFreq(dbgs(), BestCost) << '\n');
1911 LLVM_DEBUG(dbgs() << printReg(PhysReg, TRI) << "\tno positive bundles\n");
1914 LLVM_DEBUG(dbgs() << printReg(PhysReg, TRI) << "\tstatic = ";
1915 MBFI->printBlockFreq(dbgs(), Cost));
1919 dbgs() << " worse than no bundles\n";
1921 dbgs() << " worse than "
1927 LLVM_DEBUG(dbgs() << ", cannot spill all interferences.\n");
1935 LLVM_DEBUG(dbgs() << " no bundles.\n");
1942 dbgs() << ", total = ";
1943 MBFI->printBlockFreq(dbgs(), Cost) << " with bundles";
1945 dbgs() << " EB#" << i;
1946 dbgs() << ".\n";
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");
2251 dbgs() << "tryLocalSplit: ";
2253 dbgs() << ' ' << Uses[i];
2254 dbgs() << '\n';
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");
2555 dbgs() << "Early abort: the interference is not recolorable.\n");
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 "
2645 dbgs() << "Some interferences are not with virtual registers.\n");
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"
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");
910 dump(dbgs());
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()
184 dbgs() << printReg(PReg, TRI) << " ";
187 dbgs() << " \n----------------------------------------\n";
lib/CodeGen/RegUsageInfoPropagate.cpp 105 LLVM_DEBUG(dbgs() << " ++++++++++++++++++++ " << getPassName()
107 LLVM_DEBUG(dbgs() << "MachineFunction : " << MF.getName() << "\n");
120 dbgs()
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");
143 dbgs() << "Call Instruction After Register Usage Info Propagation : "
149 dbgs() << " +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++"
lib/CodeGen/RegisterClassInfo.cpp 156 dbgs() << "AllocationOrder(" << TRI->getRegClassName(RC) << ") = [";
158 dbgs() << ' ' << printReg(RCI.Order[I], TRI);
159 dbgs() << (RCI.ProperSubClass ? " ] (sub-class)\n" : " ]\n");
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);
1725 dbgs() << "\t\tupdated: ";
1727 dbgs() << LIS->getInstructionIndex(*UseMI) << "\t";
1728 dbgs() << *UseMI;
1738 LLVM_DEBUG(dbgs() << "\tCan only merge into reserved registers.\n");
1747 dbgs() << "\tCannot join complex intervals into reserved register.\n");
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 "
1848 dbgs() << "\tConsidering merging to "
1851 dbgs() << printReg(CP.getDstReg()) << " in "
1856 dbgs() << printReg(CP.getSrcReg(), TRI) << " in "
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)
1964 dbgs() << "\tSuccess: " << printReg(CP.getSrcReg(), TRI, CP.getSrcIdx())
1966 dbgs() << "\tResult = ";
1968 dbgs() << printReg(CP.getDstReg(), TRI);
1970 dbgs() << LIS->getInterval(CP.getDstReg());
1971 dbgs() << '\n';
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 "
3181 dbgs() << "\t\tremoved " << i << '@' << Def << ": " << LR << '\n';
3183 dbgs() << "\t\t LHS = " << *LI << '\n';
3198 LLVM_DEBUG(dbgs() << "\t\terased:\t" << Def << '\t' << *MI);
3253 LLVM_DEBUG(dbgs() << "\t\tjoined lanes: " << PrintLaneMask(LaneMask)
3261 dbgs() << "\t\trestoring liveness to " << EndPoints.size() << " points: ";
3263 dbgs() << EndPoints[i];
3265 dbgs() << ',';
3267 dbgs() << ": " << LRange << '\n';
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");
3401 dbgs() << "\t\trestoring liveness to " << EndPoints.size() << " points: ";
3403 dbgs() << EndPoints[i];
3405 dbgs() << ',';
3407 dbgs() << ": " << LHS << '\n';
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 "
lib/CodeGen/RegisterPressure.cpp 86 dbgs() << TRI->getRegPressureSetName(i) << "=" << SetPressure[i] << '\n';
91 dbgs() << "\n";
96 dbgs() << "Max Pressure: ";
98 dbgs() << "Live In: ";
100 dbgs() << printVRegOrUnit(P.RegUnit, TRI);
102 dbgs() << ':' << PrintLaneMask(P.LaneMask);
103 dbgs() << ' ';
105 dbgs() << '\n';
106 dbgs() << "Live Out: ";
108 dbgs() << printVRegOrUnit(P.RegUnit, TRI);
110 dbgs() << ':' << PrintLaneMask(P.LaneMask);
111 dbgs() << ' ';
113 dbgs() << '\n';
119 dbgs() << "Curr Pressure: ";
131 dbgs() << sep << TRI.getRegPressureSetName(Change.getPSet())
135 dbgs() << '\n';
140 dbgs() << "[" << getPSetOrMax() << ", " << getUnitInc() << "]\n";
144 dbgs() << "[Excess=";
146 dbgs() << ", CriticalMax=";
148 dbgs() << ", CurrentMax=";
150 dbgs() << "]\n";
1124 dbgs() << "PDiff: ";
1126 dbgs() << "DELTA: " << *MI;
1128 dbgs() << "Excess1 " << TRI->getRegPressureSetName(Delta.Excess.getPSet())
1131 dbgs() << "Critic1 " << TRI->getRegPressureSetName(Delta.CriticalMax.getPSet())
1134 dbgs() << "CurrMx1 " << TRI->getRegPressureSetName(Delta.CurrentMax.getPSet())
1137 dbgs() << "Excess2 " << TRI->getRegPressureSetName(Delta2.Excess.getPSet())
1140 dbgs() << "Critic2 " << TRI->getRegPressureSetName(Delta2.CriticalMax.getPSet())
1143 dbgs() << "CurrMx2 " << TRI->getRegPressureSetName(Delta2.CurrentMax.getPSet())
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 245 dbgs() << "[SafeStack] "
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 << ": "
256 dbgs() << "Allocas:\n";
258 dbgs() << " " << AllocaNo << ": " << *Allocas[AllocaNo] << "\n";
262 dbgs() << "Block liveness:\n";
267 dbgs() << " BB [" << BlockRange.first << ", " << BlockRange.second
275 dbgs() << "Alloca liveness:\n";
278 dbgs() << " " << AllocaNo << ": " << Range << "\n";
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/ScheduleDAG.cpp 77 case Data: dbgs() << "Data"; break;
78 case Anti: dbgs() << "Anti"; break;
79 case Output: dbgs() << "Out "; break;
80 case Order: dbgs() << "Ord "; break;
85 dbgs() << " Latency=" << getLatency();
87 dbgs() << " Reg=" << printReg(getReg(), TRI);
91 dbgs() << " Latency=" << getLatency();
94 dbgs() << " Latency=" << getLatency();
96 case Barrier: dbgs() << " Barrier"; break;
98 case MustAliasMem: dbgs() << " Memory"; break;
99 case Artificial: dbgs() << " Artificial"; break;
100 case Weak: dbgs() << " Weak"; break;
101 case Cluster: dbgs() << " Cluster"; break;
342 dbgs() << " # preds left : " << NumPredsLeft << "\n";
343 dbgs() << " # succs left : " << NumSuccsLeft << "\n";
345 dbgs() << " # weak preds left : " << WeakPredsLeft << "\n";
347 dbgs() << " # weak succs left : " << WeakSuccsLeft << "\n";
348 dbgs() << " # rdefs left : " << NumRegDefsLeft << "\n";
349 dbgs() << " Latency : " << Latency << "\n";
350 dbgs() << " Depth : " << getDepth() << "\n";
351 dbgs() << " Height : " << getHeight() << "\n";
356 dbgs() << "EntrySU";
358 dbgs() << "ExitSU";
360 dbgs() << "SU(" << SU.NodeNum << ")";
367 dbgs() << " Predecessors:\n";
369 dbgs() << " ";
371 dbgs() << ": ";
373 dbgs() << '\n';
377 dbgs() << " Successors:\n";
379 dbgs() << " ";
381 dbgs() << ": ";
383 dbgs() << '\n';
400 dbgs() << "*** Scheduling failed! ***\n";
402 dbgs() << "has not been scheduled!\n";
409 dbgs() << "*** Scheduling failed! ***\n";
411 dbgs() << "has an unexpected "
418 dbgs() << "*** Scheduling failed! ***\n";
420 dbgs() << "has successors left!\n";
426 dbgs() << "*** Scheduling failed! ***\n";
428 dbgs() << "has predecessors left!\n";
lib/CodeGen/ScheduleDAGInstrs.cpp 100 dbgs() << "{ ";
102 dbgs() << "SU(" << su->NodeNum << ")";
104 dbgs() << ", ";
106 dbgs() << "}\n";
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";);
1000 dbgs() << "Reducing NonAliasStores and NonAliasLoads maps.\n";);
1026 dbgs() << "Unknown";
1028 V->printAsOperand(dbgs());
1031 dbgs() << Itr.first.get<const PseudoSourceValue*>();
1035 dbgs() << " : ";
1042 LLVM_DEBUG(dbgs() << "Before reduction:\nStoring SUnits:\n"; stores.dump();
1043 dbgs() << "Loading SUnits:\n"; loads.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();
1083 dbgs() << "Loading SUnits:\n"; loads.dump());
1104 LLVM_DEBUG(dbgs() << "Fixup kills for " << printMBBReference(MBB) << '\n');
1157 dbgs() << ": ";
1333 LLVM_DEBUG(dbgs() << R.getNumSubtrees() << " subtrees:\n");
1336 LLVM_DEBUG(dbgs() << " SU(" << Idx << ") in tree "
1492 LLVM_DEBUG(dbgs() << " Tree: " << C.TreeID << " @"
1507 dbgs() << *this << '\n';
lib/CodeGen/ScoreboardHazardRecognizer.cpp 71 LLVM_DEBUG(dbgs() << "Disabled scoreboard hazard recognizer\n");
75 LLVM_DEBUG(dbgs() << "Using scoreboard hazard recognizer: Depth = "
88 dbgs() << "Scoreboard:\n";
96 dbgs() << "\t";
98 dbgs() << ((FUs & (1 << j)) ? '1' : '0');
99 dbgs() << '\n';
158 LLVM_DEBUG(dbgs() << "*** Hazard in cycle +" << StageCycle << ", ");
lib/CodeGen/SelectionDAG/DAGCombiner.cpp 993 LLVM_DEBUG(dbgs() << "\nReplacing.1 "; N->dump(&DAG); dbgs() << "\nWith: ";
993 LLVM_DEBUG(dbgs() << "\nReplacing.1 "; N->dump(&DAG); dbgs() << "\nWith: ";
995 dbgs() << " and " << NumTo - 1 << " other values\n");
1053 LLVM_DEBUG(dbgs() << "\nReplacing.2 "; TLO.Old.getNode()->dump(&DAG);
1054 dbgs() << "\nWith: "; TLO.New.getNode()->dump(&DAG);
1055 dbgs() << '\n');
1078 LLVM_DEBUG(dbgs() << "\nReplacing.2 "; TLO.Old.getNode()->dump(&DAG);
1079 dbgs() << "\nWith: "; TLO.New.getNode()->dump(&DAG);
1080 dbgs() << '\n');
1091 LLVM_DEBUG(dbgs() << "\nReplacing.9 "; Load->dump(&DAG); dbgs() << "\nWith: ";
1091 LLVM_DEBUG(dbgs() << "\nReplacing.9 "; Load->dump(&DAG); dbgs() << "\nWith: ";
1092 Trunc.getNode()->dump(&DAG); dbgs() << '\n');
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: ";
1347 LLVM_DEBUG(dbgs() << "\nPromoting "; N->dump(&DAG); dbgs() << "\nTo: ";
1348 Result.getNode()->dump(&DAG); dbgs() << '\n');
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: ";
13654 LLVM_DEBUG(dbgs() << "\nReplacing.4 "; N->dump(&DAG); dbgs() << "\nWith: ";
13655 Result.getNode()->dump(&DAG); dbgs() << '\n');
13827 LLVM_DEBUG(dbgs() << "\nReplacing.5 "; N->dump(&DAG);
13828 dbgs() << "\nWith: "; Result.getNode()->dump(&DAG);
13829 dbgs() << '\n');
14048 LLVM_DEBUG(dbgs() << "\nReplacing.6 "; N->dump(&DAG);
14049 dbgs() << "\nWith chain: "; Chain.getNode()->dump(&DAG);
14050 dbgs() << "\n");
14081 LLVM_DEBUG(dbgs() << "\nReplacing.7 "; N->dump(&DAG);
14082 dbgs() << "\nWith: "; Undef.getNode()->dump(&DAG);
14083 dbgs() << " and 2 other values\n");
16373 LLVM_DEBUG(dbgs() << "\nRemoving store:"; StoreBase.dump();
16374 dbgs() << "\nwithin LIFETIME_END of : ";
16375 LifetimeEndBase.dump(); dbgs() << "\n");
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);
208 dbgs() << " with: "; New->dump(&DAG));
220 LLVM_DEBUG(dbgs() << " ... replacing: "; Old->dump(&DAG);
221 dbgs() << " with: "; New->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);
244 dbgs() << " with: "; New->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");
1262 dbgs() << "NODE: ";
1264 dbgs() << "\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);
50 dbgs() << "\n");
56 dbgs() << "SoftenFloatResult #" << ResNo << ": ";
57 N->dump(&DAG); dbgs() << "\n";
827 LLVM_DEBUG(dbgs() << "Soften float operand " << OpNo << ": "; N->dump(&DAG);
828 dbgs() << "\n");
834 dbgs() << "SoftenFloatOperand Op #" << OpNo << ": ";
835 N->dump(&DAG); dbgs() << "\n";
1112 LLVM_DEBUG(dbgs() << "Expand float result: "; N->dump(&DAG); dbgs() << "\n");
1112 LLVM_DEBUG(dbgs() << "Expand float result: "; N->dump(&DAG); dbgs() << "\n");
1123 dbgs() << "ExpandFloatResult #" << ResNo << ": ";
1124 N->dump(&DAG); dbgs() << "\n";
1627 LLVM_DEBUG(dbgs() << "Expand float operand: "; N->dump(&DAG); dbgs() << "\n");
1627 LLVM_DEBUG(dbgs() << "Expand float operand: "; N->dump(&DAG); dbgs() << "\n");
1637 dbgs() << "ExpandFloatOperand Op #" << OpNo << ": ";
1638 N->dump(&DAG); dbgs() << "\n";
1895 LLVM_DEBUG(dbgs() << "Promote float operand " << OpNo << ": "; N->dump(&DAG);
1896 dbgs() << "\n");
1900 LLVM_DEBUG(dbgs() << "Node has been custom lowered, done\n");
1912 dbgs() << "PromoteFloatOperand Op #" << OpNo << ": ";
1913 N->dump(&DAG); dbgs() << "\n";
2025 LLVM_DEBUG(dbgs() << "Promote float result " << ResNo << ": "; N->dump(&DAG);
2026 dbgs() << "\n");
2031 LLVM_DEBUG(dbgs() << "Node has been custom expanded, done\n");
2042 dbgs() << "PromoteFloatResult #" << ResNo << ": ";
2043 N->dump(&DAG); dbgs() << "\n";
lib/CodeGen/SelectionDAG/LegalizeIntegerTypes.cpp 38 LLVM_DEBUG(dbgs() << "Promote integer result: "; N->dump(&DAG);
39 dbgs() << "\n");
44 LLVM_DEBUG(dbgs() << "Node has been custom expanded, done\n");
51 dbgs() << "PromoteIntegerResult #" << ResNo << ": ";
52 N->dump(&DAG); dbgs() << "\n";
1138 LLVM_DEBUG(dbgs() << "Promote integer operand: "; N->dump(&DAG);
1139 dbgs() << "\n");
1143 LLVM_DEBUG(dbgs() << "Node has been custom lowered, done\n");
1150 dbgs() << "PromoteIntegerOperand Op #" << OpNo << ": ";
1151 N->dump(&DAG); dbgs() << "\n";
1657 LLVM_DEBUG(dbgs() << "Expand integer result: "; N->dump(&DAG);
1658 dbgs() << "\n");
1669 dbgs() << "ExpandIntegerResult #" << ResNo << ": ";
1670 N->dump(&DAG); dbgs() << "\n";
3587 LLVM_DEBUG(dbgs() << "Expand integer operand: "; N->dump(&DAG);
3588 dbgs() << "\n");
3597 dbgs() << "ExpandIntegerOperand Op #" << OpNo << ": ";
3598 N->dump(&DAG); dbgs() << "\n";
lib/CodeGen/SelectionDAG/LegalizeTypes.cpp 134 dbgs() << "Unprocessed value in a map!";
139 dbgs() << "Value with legal type was transformed!";
144 dbgs() << "Processed value not in any map!";
147 dbgs() << "Value in multiple maps!";
154 dbgs() << " ReplacedValues";
156 dbgs() << " PromotedIntegers";
158 dbgs() << " SoftenedFloats";
160 dbgs() << " ScalarizedVectors";
162 dbgs() << " ExpandedIntegers";
164 dbgs() << " ExpandedFloats";
166 dbgs() << " SplitVectors";
168 dbgs() << " WidenedVectors";
170 dbgs() << " PromotedFloats";
171 dbgs() << "\n";
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);
368 dbgs() << "\n");
436 dbgs() << "Result type " << i << " illegal: ";
445 dbgs() << "Operand type " << i << " illegal: ";
452 dbgs() << "New node not analyzed?\n";
454 dbgs() << "Unanalyzed node not noticed?\n";
456 dbgs() << "Operand not processed?\n";
458 dbgs() << "Not added to worklist?\n";
463 Node.dump(&DAG); dbgs() << "\n";
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);
36 dbgs() << "\n");
42 dbgs() << "ScalarizeVectorResult #" << ResNo << ": ";
44 dbgs() << "\n";
582 LLVM_DEBUG(dbgs() << "Scalarize node operand " << OpNo << ": "; N->dump(&DAG);
583 dbgs() << "\n");
590 dbgs() << "ScalarizeVectorOperand Op #" << OpNo << ": ";
592 dbgs() << "\n";
827 LLVM_DEBUG(dbgs() << "Split node result: "; N->dump(&DAG); dbgs() << "\n");
827 LLVM_DEBUG(dbgs() << "Split node result: "; N->dump(&DAG); dbgs() << "\n");
837 dbgs() << "SplitVectorResult #" << ResNo << ": ";
839 dbgs() << "\n";
1806 LLVM_DEBUG(dbgs() << "Split vector extend via incremental extend:";
1807 N->dump(&DAG); dbgs() << "\n");
1962 LLVM_DEBUG(dbgs() << "Split node operand: "; N->dump(&DAG); dbgs() << "\n");
1962 LLVM_DEBUG(dbgs() << "Split node operand: "; N->dump(&DAG); dbgs() << "\n");
1973 dbgs() << "SplitVectorOperand Op #" << OpNo << ": ";
1975 dbgs() << "\n";
2691 LLVM_DEBUG(dbgs() << "Widen node result " << ResNo << ": "; N->dump(&DAG);
2692 dbgs() << "\n");
2702 dbgs() << "WidenVectorResult #" << ResNo << ": ";
2704 dbgs() << "\n";
4127 LLVM_DEBUG(dbgs() << "Widen node operand " << OpNo << ": "; N->dump(&DAG);
4128 dbgs() << "\n");
4138 dbgs() << "WidenVectorOperand op #" << OpNo << ": ";
4140 dbgs() << "\n";
lib/CodeGen/SelectionDAG/ScheduleDAGFast.cpp 118 LLVM_DEBUG(dbgs() << "********** List Scheduling **********\n");
144 dbgs() << "*** Scheduling failed! ***\n";
146 dbgs() << " has been released too many times!\n";
182 LLVM_DEBUG(dbgs() << "*** Scheduling [" << CurCycle << "]: ");
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: ");
716 LLVM_DEBUG(dbgs() << "********** DAG Linearization **********\n");
766 LLVM_DEBUG({ dbgs() << "\n*** Final schedule ***\n"; });
786 LLVM_DEBUG(dbgs() << '\n');
lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp 355 LLVM_DEBUG(dbgs() << "********** List Scheduling " << printMBBReference(*BB)
386 dbgs() << "*** Final schedule ***\n";
388 dbgs() << '\n';
403 dbgs() << "*** Scheduling failed! ***\n";
405 dbgs() << " has been released too many times!\n";
737 LLVM_DEBUG(dbgs() << "\n*** Scheduling [" << CurCycle << "]: ");
742 LLVM_DEBUG(dbgs() << " Height [" << SU->getHeight()
836 LLVM_DEBUG(dbgs() << "*** Unscheduling [" << SU->getHeight() << "]: ");
1048 LLVM_DEBUG(dbgs() << "Unfolding SU #" << SU->NodeNum << "\n");
1139 LLVM_DEBUG(dbgs() << "Considering duplicating the SU\n");
1145 dbgs()
1156 LLVM_DEBUG(dbgs() << "Giving up because it has outgoing glue\n");
1165 dbgs() << "Giving up because it one of the operands is glue and "
1183 LLVM_DEBUG(dbgs() << " Duplicating SU #" << SU->NodeNum << "\n");
1449 LLVM_DEBUG(dbgs() << " Repushing SU #" << SU->NodeNum << '\n');
1470 LLVM_DEBUG(dbgs() << " Interfering reg ";
1471 if (LRegs[0] == TRI->getNumRegs()) dbgs() << "CallResource";
1472 else dbgs() << printReg(LRegs[0], TRI);
1473 dbgs() << " SU #" << CurSU->NodeNum << '\n');
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";
1907 dbgs() << "Height " << SU->getHeight() << ": ";
2077 LLVM_DEBUG(dbgs() << TRI->getRegClassName(RC) << ": " << RP << " / "
2230 LLVM_DEBUG(dbgs() << " SU(" << SU->NodeNum
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 << "): "
3026 dbgs() << " Prescheduling SU #" << SU.NodeNum << " next to PredSU #"
3117 LLVM_DEBUG(dbgs()
lib/CodeGen/SelectionDAG/ScheduleDAGSDNodes.cpp 672 dbgs() << ": ";
675 dbgs() << "PHYS REG COPY\n";
680 dbgs() << "\n";
685 dbgs() << " ";
687 dbgs() << "\n";
710 dbgs() << "**** NOOP ****\n";
lib/CodeGen/SelectionDAG/ScheduleDAGVLIW.cpp 94 LLVM_DEBUG(dbgs() << "********** List Scheduling " << printMBBReference(*BB)
118 dbgs() << "*** Scheduling failed! ***\n";
120 dbgs() << " has been released too many times!\n";
152 LLVM_DEBUG(dbgs() << "*** Scheduling [" << CurCycle << "]: ");
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););
895 dbgs() << "\n";
8111 LLVM_DEBUG(dbgs() << "SALVAGE: Rewriting";
8113 dbgs() << " into " << *DIExpr << '\n');
8582 dbgs() << "Overran sorted position:\n";
8583 S->dumprFull(this); dbgs() << "\n";
8584 dbgs() << "Checking if this is due to cycles\n";
9610 dbgs() << "Offending node:\n";
9611 N->dumprFull(DAG); dbgs() << "\n";
lib/CodeGen/SelectionDAG/SelectionDAGAddressAnalysis.cpp 286 print(dbgs());
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
9536 dbgs() << " argument copy elision failed due to bad fixed stack "
9546 LLVM_DEBUG(dbgs() << " argument copy elision failed: alignment of alloca "
9556 dbgs() << "Eliding argument copy from " << Arg << " to " << *AI << '\n'
10466 LLVM_DEBUG(dbgs() << "Peeled one top case in switch stmt, prob: "
10485 dbgs() << "Scale the probablity for one cluster, before scaling: "
10488 LLVM_DEBUG(dbgs() << "After scaling: " << CC.Prob << "\n");
10536 dbgs() << "Case clusters: ";
10539 dbgs() << "JT:";
10541 dbgs() << "BT:";
10543 C.Low->getValue().print(dbgs(), true);
10545 dbgs() << '-';
10546 C.High->getValue().print(dbgs(), true);
10548 dbgs() << ' ';
10550 dbgs() << '\n';
lib/CodeGen/SelectionDAG/SelectionDAGDumper.cpp 495 print(dbgs(), G);
496 dbgs() << '\n';
785 print(dbgs());
786 dbgs() << "\n";
811 dbgs().indent(indent);
816 dbgs() << "SelectionDAG has " << AllNodes.size() << " nodes:\n";
827 dbgs() << "\n";
831 dbgs() << "SDDbgValues:\n";
835 dbgs() << "Byval SDDbgValues:\n";
839 dbgs() << "\n";
900 DumpNodesr(dbgs(), this, 0, nullptr, once);
905 DumpNodesr(dbgs(), this, 0, G, once);
944 printrWithDepth(dbgs(), G, depth);
lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp 220 LLVM_DEBUG(dbgs() << "\nChanging optimization level for Function "
222 LLVM_DEBUG(dbgs() << "\tBefore: -O" << SavedOptLevel << " ; After: -O"
228 dbgs() << "\tFastISel is "
237 LLVM_DEBUG(dbgs() << "\nRestoring optimization level for Function "
239 LLVM_DEBUG(dbgs() << "\tBefore: -O" << IS.OptLevel << " ; After: -O"
290 dbgs() << "If a target marks an instruction with "
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: "
1700 ++i) dbgs()
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");
2912 dbgs() << " Skipped scope entry (due to false predicate) at "
2963 LLVM_DEBUG(dbgs() << "Expected MemSDNode "; N->dump(CurDAG);
2964 dbgs() << '\n');
3097 LLVM_DEBUG(dbgs() << " OpcodeSwitch from " << SwitchStart << " to "
3129 LLVM_DEBUG(dbgs() << " TypeSwitch[" << EVT(CurNodeVT).getEVTString()
3356 dbgs() << "COVERED: " << getPatternForIndex(index) << "\n";
3357 dbgs() << "INCLUDED: " << getIncludePathForIndex(index) << "\n";
3507 LLVM_DEBUG(if (!MatchedMemRefs.empty() && Res->memoperands_empty()) dbgs()
3509 dbgs() << " " << (IsMorphNodeTo ? "Morphed" : "Created")
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");
370 dbgs() << "Restore point needs to be spanned on several blocks\n");
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: "
557 dbgs() << "New points are too expensive or invalid for the target\n");
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()
241 dbgs() << itr->getIndex() << " ";
244 dbgs() << *itr->getInstr();
246 dbgs() << "\n";
251 dbgs() << "%bb." << i << "\t[" << MBBRanges[i].first << ';'
267 print(dbgs());
268 dbgs() << "\n";
lib/CodeGen/SplitKit.cpp 194 LLVM_DEBUG(dbgs() << "*** Fixing inconsistent live interval! ***\n");
204 LLVM_DEBUG(dbgs() << "Analyze counted " << UseSlots.size() << " instrs in "
397 dbgs() << " empty\n";
402 dbgs() << " [" << I.start() << ';' << I.stop() << "):" << I.value();
403 dbgs() << '\n';
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);
753 LLVM_DEBUG(dbgs() << " useIntv [" << Start << ';' << End << "):");
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");
838 LLVM_DEBUG(dbgs() << " overlapIntv [" << Start << ';' << End << "):");
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 533 dbgs() << tag << " : { ";
535 dbgs() << BV.test(I) << " ";
536 dbgs() << "}\n";
552 dbgs() << "Inspecting block #" << MBB->getNumber() << " ["
560 dbgs() << "Interval[" << I << "]:\n";
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()
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");
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");
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");
355 LLVM_DEBUG(dbgs() << '\n');
384 LLVM_DEBUG(dbgs() << "Removing unused stack object fi#" << NextColor << "\n");
484 dbgs() << "********** Stack Slot Coloring **********\n"
lib/CodeGen/TailDuplicator.cpp 114 dbgs() << "Malformed PHI in " << printMBBReference(*MBB) << ": "
116 dbgs() << " missing input from predecessor "
125 dbgs() << "Warning: malformed PHI in " << printMBBReference(*MBB)
127 dbgs() << " extra input from predecessor "
132 dbgs() << "Malformed PHI in " << printMBBReference(*MBB) << ": "
134 dbgs() << " non-existing " << printMBBReference(*PHIBB) << '\n';
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/TargetPassConfig.cpp 595 PM->add(createMachineFunctionPrinterPass(dbgs(), Banner));
643 addPass(createPrintFunctionPass(dbgs(), "\n\n*** Code after LSR ***\n"));
751 dbgs(), "\n\n*** Final LLVM Code input to ISel ***\n"));
951 addPass(createGCInfoPrinter(dbgs()), false, false);
lib/CodeGen/TargetRegisterInfo.cpp 73 dbgs() << "Error: Super register " << printReg(*SR, this)
457 LLVM_DEBUG(dbgs() << "Can't realign function's stack: " << F.getName()
521 dbgs() << printReg(Reg, TRI, SubRegIndex) << "\n";
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 160 print(dbgs());
243 LLVM_DEBUG(dbgs() << "********** REWRITE VIRTUAL REGISTERS **********\n"
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 "
745 dbgs() << " Cloning block \'" << BB->getName()
779 dbgs() << " Assigned color \'" << FuncletPadBB->getName()
792 dbgs() << " Removed color \'" << FuncletPadBB->getName()
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()
1028 dbgs() << "Cannot store value of type " << *Ty << "!\n";
1133 LLVM_DEBUG(dbgs() << "JIT: Initializing " << Addr << " ");
1181 LLVM_DEBUG(dbgs() << "Bad Type: " << *Init->getType() << "\n");
lib/ExecutionEngine/Interpreter/Execution.cpp 114 dbgs() << "Unhandled type for FAdd instruction: " << *Ty << "\n";
125 dbgs() << "Unhandled type for FSub instruction: " << *Ty << "\n";
136 dbgs() << "Unhandled type for FMul instruction: " << *Ty << "\n";
147 dbgs() << "Unhandled type for FDiv instruction: " << *Ty << "\n";
162 dbgs() << "Unhandled type for Rem instruction: " << *Ty << "\n";
199 dbgs() << "Unhandled type for ICMP_EQ predicate: " << *Ty << "\n";
213 dbgs() << "Unhandled type for ICMP_NE predicate: " << *Ty << "\n";
227 dbgs() << "Unhandled type for ICMP_ULT predicate: " << *Ty << "\n";
241 dbgs() << "Unhandled type for ICMP_SLT predicate: " << *Ty << "\n";
255 dbgs() << "Unhandled type for ICMP_UGT predicate: " << *Ty << "\n";
269 dbgs() << "Unhandled type for ICMP_SGT predicate: " << *Ty << "\n";
283 dbgs() << "Unhandled type for ICMP_ULE predicate: " << *Ty << "\n";
297 dbgs() << "Unhandled type for ICMP_SLE predicate: " << *Ty << "\n";
311 dbgs() << "Unhandled type for ICMP_UGE predicate: " << *Ty << "\n";
325 dbgs() << "Unhandled type for ICMP_SGE predicate: " << *Ty << "\n";
350 dbgs() << "Don't know how to handle this ICmp predicate!\n-->" << I;
386 dbgs() << "Unhandled type for FCmp EQ instruction: " << *Ty << "\n";
442 dbgs() << "Unhandled type for FCmp NE instruction: " << *Ty << "\n";
462 dbgs() << "Unhandled type for FCmp LE instruction: " << *Ty << "\n";
476 dbgs() << "Unhandled type for FCmp GE instruction: " << *Ty << "\n";
490 dbgs() << "Unhandled type for FCmp LT instruction: " << *Ty << "\n";
504 dbgs() << "Unhandled type for FCmp GT instruction: " << *Ty << "\n";
672 dbgs() << "Don't know how to handle this FCmp predicate!\n-->" << I;
729 dbgs() << "Unhandled Cmp predicate\n";
783 dbgs() << "Don't know how to handle this binary operator!\n-->" << I;
811 dbgs() << "Unhandled type for Rem instruction: " << *Ty << "\n";
820 dbgs() << "Don't know how to handle this binary operator!\n-->" << I;
1032 LLVM_DEBUG(dbgs() << "Allocated Type: " << *Ty << " (" << TypeSize
1081 LLVM_DEBUG(dbgs() << "GEP Index " << Total << " bytes.\n");
1099 dbgs() << "Volatile load " << I;
1109 dbgs() << "Volatile store: " << I;
1788 dbgs() << "Unhandled dest type for vaarg instruction: " << *Ty << "\n";
1811 dbgs() << "Unhandled destination type for extractelement instruction: "
1826 dbgs() << "Invalid index in extractelement instruction\n";
2098 dbgs() << "Unhandled ConstantExpr: " << *CE << "\n";
2169 LLVM_DEBUG(dbgs() << "About to interpret: " << I << "\n");
lib/ExecutionEngine/JITLink/EHFrameSupport.cpp 32 dbgs() << "Processing eh-frame record at "
69 LLVM_DEBUG(dbgs() << " length: " << RecordLength << "\n");
159 LLVM_DEBUG(dbgs() << " Record is CIE\n");
279 LLVM_DEBUG(dbgs() << " Record is FDE\n");
282 dbgs() << " CIE pointer: "
303 dbgs() << " PC begin: " << format("0x%016" PRIx64, PCBegin) << "\n";
319 LLVM_DEBUG(dbgs() << " FDE target: " << *TargetSymbol << "\n");
355 LLVM_DEBUG(dbgs() << " FDE LSDA: " << *LSDASymbol << "\n");
lib/ExecutionEngine/JITLink/JITLinkGeneric.cpp 39 dbgs() << "Link graph \"" << G->getName() << "\" pre-pruning:\n";
40 dumpGraph(dbgs());
46 dbgs() << "Link graph \"" << G->getName() << "\" post-pruning:\n";
47 dumpGraph(dbgs());
98 dbgs() << "Link graph \"" << G->getName() << "\" before copy-and-fixup:\n";
99 dumpGraph(dbgs());
107 dbgs() << "Link graph \"" << G->getName() << "\" after copy-and-fixup:\n";
108 dumpGraph(dbgs());
165 dbgs() << "Segment ordering:\n";
167 dbgs() << " Segment "
173 dbgs() << " " << SIEntry.second << ":\n";
175 dbgs() << " " << *B << "\n";
186 LLVM_DEBUG(dbgs() << "JIT linker requesting: { ");
215 dbgs() << (&KV == &*Layout.begin() ? "" : "; ")
222 LLVM_DEBUG(dbgs() << " }\n");
230 dbgs() << "JIT linker got working memory:\n";
233 dbgs() << " " << Prot << ": "
279 dbgs() << "Externals after applying lookup result:\n";
281 dbgs() << " " << Sym->getName() << ": "
297 G->dump(dbgs(), [this](Edge::Kind K) { return getEdgeKindName(K); });
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");
161 dbgs() << " Processing segment "
169 LLVM_DEBUG(dbgs() << " " << *B << ":\n");
175 dbgs() << " Bumped block pointer to "
184 dbgs() << " Zero padding from " << (const void *)LastBlockEnd
193 dbgs() << " Copying block " << *B << " content, "
201 LLVM_DEBUG(dbgs() << " Applying fixups.\n");
223 dbgs() << " Zero padding end of segment from "
lib/ExecutionEngine/JITLink/MachO.cpp 44 dbgs() << "jitLink_MachO: magic = " << format("0x%08" PRIx32, Magic)
61 dbgs() << "jitLink_MachO: cputype = "
lib/ExecutionEngine/JITLink/MachOLinkGraphBuilder.cpp 103 LLVM_DEBUG(dbgs() << "Creating normalized sections...\n");
134 dbgs() << " " << *Name << ": " << formatv("{0:x16}", NSec.Address)
204 LLVM_DEBUG(dbgs() << "Creating normalized symbols...\n");
247 dbgs() << " ";
249 dbgs() << "<anonymous symbol>";
251 dbgs() << *Name;
252 dbgs() << ": value = " << formatv("{0:x16}", Value)
256 dbgs() << static_cast<unsigned>(Sect - 1);
258 dbgs() << "none";
259 dbgs() << "\n";
298 LLVM_DEBUG(dbgs() << "Creating graph symbols...\n");
366 dbgs() << " Skipping section " << NSec.GraphSection->getName()
372 dbgs() << " Processing section " << NSec.GraphSection->getName()
386 dbgs() << " Section non-empty, but contains no symbols. "
396 dbgs() << " Section empty and contains no symbols. Skipping.\n";
425 dbgs() << " Section start not covered by symbol. "
458 dbgs() << " Creating block for " << formatv("{0:x16}", BlockStart)
485 dbgs() << " " << formatv("{0:x16}", NSym.Value) << " -- "
488 dbgs() << "<anonymous symbol>";
490 dbgs() << NSym.Name;
492 dbgs() << " [no-dead-strip]";
494 dbgs() << " [non-canonical]";
495 dbgs() << "\n";
lib/ExecutionEngine/JITLink/MachO_arm64.cpp 223 dbgs() << "Processing " << getMachOARM64RelocationKindName(*Kind)
272 dbgs() << " pair is " << getMachOARM64RelocationKindName(*Kind)
381 printEdge(dbgs(), *BlockToFix, GE,
383 dbgs() << "\n";
lib/ExecutionEngine/JITLink/MachO_x86_64.cpp 232 dbgs() << "Processing relocation at "
350 printEdge(dbgs(), *BlockToFix, GE,
352 dbgs() << "\n";
lib/ExecutionEngine/Orc/Core.cpp 377 dbgs() << "In " << JD.getName() << " resolving " << Symbols << "\n";
396 dbgs() << "In " << JD.getName() << " emitting " << SymbolFlags << "\n";
421 dbgs() << "In " << JD.getName() << " failing materialization for "
440 dbgs() << "In " << JD.getName() << " replacing symbols with " << *MU
546 dbgs() << "materializing reexports: target = " << TgtJD.getName()
1941 dbgs() << "Looking up " << Symbols << " in " << SearchOrder
lib/ExecutionEngine/Orc/ExecutionUtils.cpp 109 dbgs() << " Skipping because why now?\n";
lib/ExecutionEngine/Orc/IndirectionUtils.cpp 107 llvm::dbgs() << "Didn't find callback.\n";
lib/ExecutionEngine/Orc/Layer.cpp 61 dbgs() << "In " << JD.getName() << " discarding " << *Name << " from MU@"
97 [&]() { dbgs() << "Emitting, for " << N << ", " << *this << "\n"; }););
100 dbgs() << "Finished emitting, for " << N << ", " << *this << "\n";
lib/ExecutionEngine/Orc/OrcMCJITReplacement.h 282 dbgs() << "Found dtor: " << NewDtorName << "\n";
lib/ExecutionEngine/RuntimeDyld/RuntimeDyld.cpp 84 dbgs() << "----- Contents of section " << S.getName() << " " << State
88 dbgs() << "\n <section not emitted>\n";
101 dbgs() << "\n" << format("0x%016" PRIx64,
104 dbgs() << " ";
109 dbgs() << "\n" << format("0x%016" PRIx64, LoadAddr) << ":";
111 dbgs() << " " << format("%02x", *DataAddr);
118 dbgs() << "\n";
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: "
873 dbgs() << "emitSection SectionID: " << SectionID << " Name: " << Name
1052 dbgs() << "Reassigning address for section " << SectionID << " ("
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 154 dbgs() << "resolveRelocation Section: " << RE.SectionID
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/RuntimeDyldMachOARM.h 413 LLVM_DEBUG(dbgs() << "Found SECTDIFF: AddrA: " << AddrA
lib/ExecutionEngine/RuntimeDyld/Targets/RuntimeDyldMachOI386.h 197 LLVM_DEBUG(dbgs() << "Found SECTDIFF: AddrA: " << AddrA
lib/IR/AsmWriter.cpp 4430 void Value::dump() const { print(dbgs(), /*IsForDebug=*/true); dbgs() << '\n'; }
4430 void Value::dump() const { print(dbgs(), /*IsForDebug=*/true); dbgs() << '\n'; }
4434 void Type::dump() const { print(dbgs(), /*IsForDebug=*/true); dbgs() << '\n'; }
4434 void Type::dump() const { print(dbgs(), /*IsForDebug=*/true); dbgs() << '\n'; }
4439 print(dbgs(), nullptr,
4445 void Comdat::dump() const { print(dbgs(), /*IsForDebug=*/true); }
4449 void NamedMDNode::dump() const { print(dbgs(), /*IsForDebug=*/true); }
4456 print(dbgs(), M, /*IsForDebug=*/true);
4457 dbgs() << '\n';
4462 void ModuleSummaryIndex::dump() const { print(dbgs(), /*IsForDebug=*/true); }
lib/IR/Attributes.cpp 709 dbgs() << "AS =\n";
710 dbgs() << " { ";
711 dbgs() << getAsString(true) << " }\n";
1409 dbgs() << "PAL[\n";
1413 dbgs() << " { " << i << " => " << getAsString(i) << " }\n";
1416 dbgs() << "]\n";
lib/IR/ConstantRange.cpp 1490 print(dbgs());
lib/IR/Constants.cpp 410 dbgs() << "While deleting: " << *this
lib/IR/ConstantsContext.h 702 LLVM_DEBUG(dbgs() << "Constant.cpp: ConstantUniqueMap\n");
lib/IR/DebugLoc.cpp 115 LLVM_DUMP_METHOD void DebugLoc::dump() const { print(dbgs()); }
lib/IR/IRPrintingPasses.cpp 22 PrintModulePass::PrintModulePass() : OS(dbgs()) {}
49 PrintFunctionPass::PrintFunctionPass() : OS(dbgs()) {}
118 PrintBasicBlockPass() : BasicBlockPass(ID), Out(dbgs()) {}
lib/IR/Instructions.cpp 477 LLVM_DEBUG(dbgs() << "Attempting to update profile weights will result in "
lib/IR/LegacyPassManager.cpp 353 dbgs().indent(Offset*2) << "BasicBlockPass Manager\n";
501 dbgs().indent(Offset*2) << "ModulePass Manager\n";
736 dbgs() << "Pass '" << P->getPassName() << "' is not initialized." << "\n";
737 dbgs() << "Verify if there is a pass dependency cycle." << "\n";
738 dbgs() << "Required Passes:" << "\n";
744 dbgs() << "\t" << AnalysisPass2->getPassName() << "\n";
746 dbgs() << "\t" << "Error: Required pass not found! Possible causes:" << "\n";
747 dbgs() << "\t\t" << "- Pass misconfiguration (e.g.: missing macros)" << "\n";
748 dbgs() << "\t\t" << "- Corruption of the global PassRegistry" << "\n";
789 dbgs(), ("*** IR Dump Before " + P->getPassName() + " ***").str());
798 dbgs(), ("*** IR Dump After " + P->getPassName() + " ***").str());
878 dbgs() << "Pass Arguments: ";
883 dbgs() << " -" << PI->getPassArgument();
887 dbgs() << "\n";
983 dbgs() << " -- '" << P->getPassName() << "' is not preserving '";
984 dbgs() << S->getPassName() << "'\n";
1006 dbgs() << " -- '" << P->getPassName() << "' is not preserving '";
1007 dbgs() << S->getPassName() << "'\n";
1028 dbgs() << " -*- '" << P->getPassName();
1029 dbgs() << "' is the last user of following pass instances.";
1030 dbgs() << " Free these instances\n";
1214 dbgs() << "--" << std::string(Offset*2, ' ');
1227 dbgs() << " -" << PI->getPassArgument();
1236 dbgs() << "[" << std::chrono::system_clock::now() << "] " << (void *)this
1240 dbgs() << "Executing Pass '" << P->getPassName();
1243 dbgs() << "Made Modification '" << P->getPassName();
1246 dbgs() << " Freeing Pass '" << P->getPassName();
1253 dbgs() << "' on BasicBlock '" << Msg << "'...\n";
1256 dbgs() << "' on Function '" << Msg << "'...\n";
1259 dbgs() << "' on Module '" << Msg << "'...\n";
1262 dbgs() << "' on Region '" << Msg << "'...\n";
1265 dbgs() << "' on Loop '" << Msg << "'...\n";
1268 dbgs() << "' on Call Graph Nodes '" << Msg << "'...\n";
1307 dbgs() << (const void*)P << std::string(getDepth()*2+3, ' ') << Msg << " Analyses:";
1309 if (i) dbgs() << ',';
1314 dbgs() << " Uninitialized Pass";
1317 dbgs() << ' ' << PInf->getPassName();
1319 dbgs() << '\n';
1342 dbgs() << "Unable to schedule '" << RequiredPass->getPassName();
1343 dbgs() << "' required by '" << P->getPassName() << "'\n";
1602 dbgs().indent(Offset*2) << "FunctionPass Manager\n";
1936 dbgs() << Manager->getAsPass()->getPassName() << ' ';
1939 dbgs() << '\n';
lib/IR/Pass.cpp 73 dbgs().indent(Offset*2) << getPassName() << "\n";
135 print(dbgs(), nullptr);
172 LLVM_DEBUG(dbgs() << "Skipping pass '" << getPassName() << "' on function "
213 LLVM_DEBUG(dbgs() << "Skipping pass '" << getPassName()
lib/IR/PassTimingInfo.cpp 198 dbgs() << "Dumping timers for " << getTypeName<TimePassesHandler>()
203 dbgs() << "\tTimer " << MyTimer << " for pass " << I.first.first << "("
206 dbgs() << "\tTriggered:\n";
210 dbgs() << "\tTimer " << MyTimer << " for pass " << I.first.first << "("
245 LLVM_DEBUG(dbgs() << "after runBeforePass(" << PassID << ")\n");
258 LLVM_DEBUG(dbgs() << "after runAfterPass(" << PassID << ")\n");
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 ";
776 PrintValueSet(dbgs(), AvailableIn.begin(), AvailableIn.end());
777 dbgs() << " to ";
778 PrintValueSet(dbgs(), AvailableOut.begin(), AvailableOut.end());
779 dbgs() << "\n";);
885 LLVM_DEBUG(dbgs() << "Verifying gc pointers in function: " << F.getName()
888 dbgs() << "Verifying gc pointers in function: " << F.getName() << "\n";
899 dbgs() << "No illegal uses found by SafepointIRVerifier in: " << F.getName()
lib/IR/Value.cpp 86 dbgs() << "While deleting: " << *VTy << " %" << getName() << "\n";
88 dbgs() << "Use still stuck around after Def is destroyed:" << *U << "\n";
912 dbgs() << "While deleting: " << *V->getType() << " %" << V->getName()
968 dbgs() << "After RAUW from " << *Old->getType() << " %"
lib/IR/ValueSymbolTable.cpp 36 dbgs() << "Value still in symbol table! Type = '"
lib/IR/Verifier.cpp 5156 &dbgs(), /*ShouldTreatBrokenDebugInfoAsError=*/false, M);
5544 Res.IRBroken = llvm::verifyModule(M, &dbgs(), &Res.DebugInfoBroken);
5550 return { llvm::verifyFunction(F, &dbgs()), false };
lib/LTO/LTOCodeGenerator.cpp 505 if (verifyModule(*MergedModule, &dbgs(), &BrokenDebugInfo))
lib/LTO/ThinLTOCodeGenerator.cpp 172 if (verifyModule(TheModule, &dbgs(), &BrokenDebugInfo))
1059 LLVM_DEBUG(dbgs() << "Cache " << (ErrOrBuffer ? "hit" : "miss")
lib/MC/MCExpr.cpp 151 dbgs() << *this;
152 dbgs() << '\n';
lib/MC/MCInst.cpp 58 print(dbgs());
59 dbgs() << "\n";
95 print(dbgs());
96 dbgs() << "\n";
lib/MC/MCLabel.cpp 23 print(dbgs());
lib/MC/MCParser/AsmParser.cpp 4484 DEBUG_WITH_TYPE("asm-macros", dbgs() << "Defining new macro:\n";
4649 DEBUG_WITH_TYPE("asm-macros", dbgs()
lib/MC/MCParser/MCAsmParser.cpp 134 dbgs() << " " << *this;
lib/MC/MCSymbol.cpp 86 dbgs() << *this;
lib/MC/MCValue.cpp 42 print(dbgs());
lib/MC/MachObjectWriter.cpp 986 LLVM_DEBUG(dbgs() << "data in code region-- kind: " << Data->Kind
lib/MC/SubtargetFeature.cpp 64 print(dbgs());
lib/MC/WasmObjectWriter.cpp 159 LLVM_DUMP_METHOD void dump() const { print(dbgs()); }
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");
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");
1292 dbgs() << "MCSymbol: " << toString(WS.getType()) << " '" << S << "'"
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 51 dbgs() << "[LSUnit] LQ_Size = " << getLoadQueueSize() << '\n';
52 dbgs() << "[LSUnit] SQ_Size = " << getStoreQueueSize() << '\n';
53 dbgs() << "[LSUnit] NextLQSlotIdx = " << getUsedLQEntries() << '\n';
54 dbgs() << "[LSUnit] NextSQSlotIdx = " << getUsedSQEntries() << '\n';
55 dbgs() << "\n";
58 dbgs() << "[LSUnit] Group (" << GroupIt.first << "): "
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 154 dbgs() << "RegisterFile: addRegisterWrite [ " << Write.getSourceIndex()
360 LLVM_DEBUG(dbgs() << "RegisterFile: collecting writes for register "
391 dbgs() << "[PRF] Found a dependent use of Register "
457 LLVM_DEBUG(dbgs() << "Not enough registers in the register file.\n");
480 dbgs() << MRI.getName(I) << ", " << I
486 dbgs() << '\n';
491 dbgs() << "Register File #" << I;
493 dbgs() << "\n TotalMappings: " << RMT.NumPhysRegs
lib/MCA/HardwareUnits/ResourceManager.cpp 95 dbgs() << "MASK=" << format_hex(ResourceMask, 16)
lib/MCA/HardwareUnits/RetireControlUnit.cpp 94 dbgs() << "Retire Unit: { Total ROB Entries =" << NumROBEntries
lib/MCA/HardwareUnits/Scheduler.cpp 33 dbgs() << "[SCHEDULER]: WaitSet size is: " << WaitSet.size() << '\n';
34 dbgs() << "[SCHEDULER]: ReadySet size is: " << ReadySet.size() << '\n';
35 dbgs() << "[SCHEDULER]: IssuedSet size is: " << IssuedSet.size() << '\n';
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 187 dbgs() << "\t\tResource Mask=" << format_hex(R.first, 16) << ", "
194 dbgs() << "\t\tBuffer Mask=" << format_hex(Current, 16) << '\n';
197 dbgs() << "\t\t Used Units=" << format_hex(ID.UsedProcResUnits, 16) << '\n';
198 dbgs() << "\t\tUsed Groups=" << format_hex(ID.UsedProcResGroups, 16)
330 dbgs() << "\t\t[Def] OpIdx=" << Write.OpIndex
360 dbgs() << "\t\t[Def][I] OpIdx=" << ~Write.OpIndex
375 dbgs() << "\t\t[Def][O] OpIdx=" << Write.OpIndex
408 dbgs() << "\t\t[Def][V] OpIdx=" << Write.OpIndex
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/Instruction.cpp 125 dbgs() << "{ OpIdx=" << WD->OpIndex << ", Lat=" << getLatency() << ", RegID "
130 dbgs() << "IID=" << getSourceIndex() << ' ';
134 dbgs() << "(null)";
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 "
146 dbgs() << "[E] Backpressure increased by register dependencies\n");
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 << '.'
256 dbgs() << "[E] Instruction Issued: #" << IR << '\n';
259 dbgs() << "[E] Resource Used: [" << Resource.first.first << '.'
261 dbgs() << "cycles: " << Resource.second.getNumerator() << '\n';
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/MachOObjectFile.cpp 3147 DEBUG_WITH_TYPE("mach-o-rebase", dbgs() << "REBASE_OPCODE_DONE\n");
3160 dbgs() << "REBASE_OPCODE_SET_TYPE_IMM: "
3184 dbgs() << "REBASE_OPCODE_SET_SEGMENT_AND_OFFSET_ULEB: "
3208 dbgs() << "REBASE_OPCODE_ADD_ADDR_ULEB: "
3235 dbgs() << "REBASE_OPCODE_ADD_ADDR_IMM_SCALED: "
3258 dbgs() << "REBASE_OPCODE_DO_REBASE_IMM_TIMES: "
3290 dbgs() << "REBASE_OPCODE_DO_REBASE_ULEB_TIMES: "
3319 dbgs() << "REBASE_OPCODE_DO_REBASE_ADD_ADDR_ULEB: "
3362 dbgs() << "REBASE_OPCODE_DO_REBASE_ULEB_TIMES_SKIPPING_ULEB: "
3508 DEBUG_WITH_TYPE("mach-o-bind", dbgs() << "BIND_OPCODE_DONE\n");
3532 dbgs() << "BIND_OPCODE_SET_DYLIB_ORDINAL_IMM: "
3564 dbgs() << "BIND_OPCODE_SET_DYLIB_ORDINAL_ULEB: "
3591 dbgs() << "BIND_OPCODE_SET_DYLIB_SPECIAL_IMM: "
3613 dbgs() << "BIND_OPCODE_SET_SYMBOL_TRAILING_FLAGS_IMM: "
3631 dbgs() << "BIND_OPCODE_SET_TYPE_IMM: "
3645 dbgs() << "BIND_OPCODE_SET_ADDEND_SLEB: "
3669 dbgs() << "BIND_OPCODE_SET_SEGMENT_AND_OFFSET_ULEB: "
3693 dbgs() << "BIND_OPCODE_ADD_ADDR_ULEB: "
3726 dbgs() << "BIND_OPCODE_DO_BIND: "
3788 dbgs() << "BIND_OPCODE_DO_BIND_ADD_ADDR_ULEB: "
3843 dbgs()
3908 dbgs() << "BIND_OPCODE_DO_BIND_ULEB_TIMES_SKIPPING_ULEB: "
lib/Object/WasmObjectFile.cpp 53 LLVM_DUMP_METHOD void WasmSymbol::dump() const { print(dbgs()); }
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/Option/Arg.cpp 65 LLVM_DUMP_METHOD void Arg::dump() const { print(dbgs()); }
lib/Option/ArgList.cpp 193 LLVM_DUMP_METHOD void ArgList::dump() const { print(dbgs()); }
lib/Option/Option.cpp 90 LLVM_DUMP_METHOD void Option::dump() const { print(dbgs()); }
lib/Passes/PassRegistry.def 74 MODULE_PASS("print-profile-summary", ProfileSummaryPrinterPass(dbgs()))
75 MODULE_PASS("print-callgraph", CallGraphPrinterPass(dbgs()))
76 MODULE_PASS("print", PrintModulePass(dbgs()))
77 MODULE_PASS("print-lcg", LazyCallGraphPrinterPass(dbgs()))
78 MODULE_PASS("print-lcg-dot", LazyCallGraphDOTPrinterPass(dbgs()))
79 MODULE_PASS("print-stack-safety", StackSafetyGlobalPrinterPass(dbgs()))
211 FUNCTION_PASS("print", PrintFunctionPass(dbgs()))
212 FUNCTION_PASS("print<assumptions>", AssumptionPrinterPass(dbgs()))
213 FUNCTION_PASS("print<block-freq>", BlockFrequencyPrinterPass(dbgs()))
214 FUNCTION_PASS("print<branch-prob>", BranchProbabilityPrinterPass(dbgs()))
215 FUNCTION_PASS("print<da>", DependenceAnalysisPrinterPass(dbgs()))
216 FUNCTION_PASS("print<domtree>", DominatorTreePrinterPass(dbgs()))
217 FUNCTION_PASS("print<postdomtree>", PostDominatorTreePrinterPass(dbgs()))
218 FUNCTION_PASS("print<demanded-bits>", DemandedBitsPrinterPass(dbgs()))
219 FUNCTION_PASS("print<domfrontier>", DominanceFrontierPrinterPass(dbgs()))
220 FUNCTION_PASS("print<loops>", LoopPrinterPass(dbgs()))
221 FUNCTION_PASS("print<memoryssa>", MemorySSAPrinterPass(dbgs()))
222 FUNCTION_PASS("print<phi-values>", PhiValuesPrinterPass(dbgs()))
223 FUNCTION_PASS("print<regions>", RegionInfoPrinterPass(dbgs()))
224 FUNCTION_PASS("print<scalar-evolution>", ScalarEvolutionPrinterPass(dbgs()))
225 FUNCTION_PASS("print<stack-safety-local>", StackSafetyPrinterPass(dbgs()))
301 LOOP_PASS("print", PrintLoopPass(dbgs()))
309 LOOP_PASS("print-access-info", LoopAccessInfoPrinterPass(dbgs()))
310 LOOP_PASS("print<ddg>", DDGAnalysisPrinterPass(dbgs()))
311 LOOP_PASS("print<ivusers>", IVUsersPrinterPass(dbgs()))
312 LOOP_PASS("print<loop-cache-cost>", LoopCachePrinterPass(dbgs()))
lib/Passes/StandardInstrumentations.cpp 74 dbgs() << Banner << Extra << "\n";
75 M->print(dbgs(), nullptr, false);
81 dbgs() << Banner << Extra << "\n" << static_cast<const Value &>(*F);
90 dbgs() << Banner << Extra << "\n";
93 F.print(dbgs());
101 llvm::printLoop(const_cast<Loop &>(*L), dbgs(), Banner);
lib/ProfileData/Coverage/CoverageMapping.cpp 399 dbgs() << "Segment at " << Last.Line << ":" << Last.Col
575 dbgs() << "Combined regions:\n";
577 dbgs() << " " << CR.LineStart << ":" << CR.ColumnStart << " -> "
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 232 dbgs() << "Counter in file " << InferredFileID << " " << LineStart << ":"
236 dbgs() << "Expands to file " << ExpandedFileID;
238 CounterMappingContext(Expressions).dump(C, dbgs());
239 dbgs() << "\n";
lib/ProfileData/GCOV.cpp 114 LLVM_DUMP_METHOD void GCOVFile::dump() const { print(dbgs()); }
360 LLVM_DUMP_METHOD void GCOVFunction::dump() const { print(dbgs()); }
436 LLVM_DUMP_METHOD void GCOVBlock::dump() const { print(dbgs()); }
lib/ProfileData/SampleProf.cpp 103 LLVM_DUMP_METHOD void LineLocation::dump() const { print(dbgs()); }
118 LLVM_DUMP_METHOD void SampleRecord::dump() const { print(dbgs(), 0); }
198 LLVM_DUMP_METHOD void FunctionSamples::dump() const { print(dbgs(), 0); }
lib/Support/APFloat.cpp 4537 LLVM_DUMP_METHOD void APFloat::dump() const { print(dbgs()); }
lib/Support/APInt.cpp 2269 dbgs() << "APInt(" << BitWidth << "b, "
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/BranchProbability.cpp 36 LLVM_DUMP_METHOD void BranchProbability::dump() const { print(dbgs()) << '\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: ";
1578 for (int i = 0; i < argc; ++i) dbgs() << argv[i] << ' ';
1579 dbgs() << '\n';);
lib/Support/Debug.cpp 127 static_cast<circular_raw_ostream &>(llvm::dbgs());
lib/Support/DebugCounter.cpp 61 print(dbgs());
135 print(dbgs());
lib/Support/Error.cpp 105 dbgs() << "Program aborted due to an unhandled Error:\n";
107 getPtr()->log(dbgs());
109 dbgs() << "Error value was Success. (Note: Success values must still be "
lib/Support/ErrorHandling.cpp 204 dbgs() << msg << "\n";
205 dbgs() << "UNREACHABLE executed";
207 dbgs() << " at " << file << ":" << line;
208 dbgs() << "!\n";
lib/Support/FormattedStream.cpp 105 static formatted_raw_ostream S(dbgs());
lib/Support/RandomNumberGenerator.cpp 34 LLVM_DEBUG(if (Seed == 0) dbgs()
lib/Support/ScaledNumber.cpp 321 print(dbgs(), D, E, Width, 0) << "[" << Width << ":" << D << "*2^" << E
lib/Support/Twine.cpp 178 print(dbgs());
182 printRepr(dbgs());
lib/Support/VirtualFileSystem.cpp 1135 LLVM_DUMP_METHOD void RedirectingFileSystem::dump() const { dump(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");
657 dbgs() << "Cannot add to chain because accumulator operand wasn't "
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 65 dbgs() << "********** AArch64 Branch Targets **********\n"
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");
611 dbgs()
625 dbgs()
633 dbgs() << "... Cannot handle arguments in multiple registers.\n");
643 dbgs()
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 "
749 dbgs()
758 dbgs() << "... Call is eligible for tail call optimization.\n");
794 dbgs() << "Cannot lower indirect tail calls with BTI enabled yet.\n");
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()));
296 dbgs() << "********** AArch64 Conditional Branch Tuning **********\n"
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");
512 dbgs() << "AnalyzeBranch didn't find conditional branch in Head.\n");
518 LLVM_DEBUG(dbgs() << "Unsupported branch type on Head\n");
532 LLVM_DEBUG(dbgs() << "CmpBB branch not analyzable.\n");
539 dbgs() << "AnalyzeBranch didn't find conditional branch in CmpBB.\n");
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");
131 dbgs()
137 LLVM_DEBUG(dbgs() << " Ignoring, semantics change with xzr/wzr.\n");
153 LLVM_DEBUG(dbgs() << " Dead def operand #" << I << " in:\n ";
154 MI.print(dbgs()));
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);
2030 if (RPI.isPaired()) dbgs() << ", " << printReg(Reg2, TRI);
2031 dbgs() << ") -> fi#(" << RPI.FrameIdx;
2032 if (RPI.isPaired()) dbgs() << ", " << RPI.FrameIdx + 1;
2033 dbgs() << ")\n");
2120 LLVM_DEBUG(dbgs() << "CSR restore: (" << printReg(Reg1, TRI);
2121 if (RPI.isPaired()) dbgs() << ", " << printReg(Reg2, TRI);
2122 dbgs() << ") -> fi#(" << RPI.FrameIdx;
2123 if (RPI.isPaired()) dbgs() << ", " << RPI.FrameIdx + 1;
2124 dbgs() << ")\n");
2245 LLVM_DEBUG(dbgs() << "*** determineCalleeSaves\nSaved CSRs:";
2247 : SavedRegs.set_bits()) dbgs()
2249 dbgs() << "\n";);
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 1606 (dbgs() << N
1750 (dbgs() << N
lib/Target/AArch64/AArch64ISelLowering.cpp 1582 LLVM_DEBUG(dbgs() << "Is imm " << C
2961 LLVM_DEBUG(dbgs() << "Custom lowering: ");
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");
6293 dbgs() << "Reshuffle failed: "
6314 dbgs() << "Reshuffle failed: currently only do something sane when at "
6362 dbgs() << "Reshuffle failed: span too large for a VEXT to cope\n");
6443 LLVM_DEBUG(dbgs() << "Reshuffle failed: illegal shuffle mask\n");
6455 LLVM_DEBUG(dbgs() << "Reshuffle, creating node: "; Shuffle.dump();
6456 dbgs() << "Reshuffle, creating node: "; V.dump(););
7415 LLVM_DEBUG(dbgs() << "aarch64-lower: transformed: \n");
7417 LLVM_DEBUG(dbgs() << "into: \n");
7615 dbgs() << "LowerBUILD_VECTOR: value undefined, creating undef node\n");
7623 LLVM_DEBUG(dbgs() << "LowerBUILD_VECTOR: only low element used, creating 1 "
7696 dbgs() << "LowerBUILD_VECTOR: use DUP for non-constant splats\n");
7706 dbgs() << "LowerBUILD_VECTOR: DUPLANE works on 128-bit vectors, "
7721 dbgs() << "LowerBUILD_VECTOR: float constant splats, creating int "
7728 LLVM_DEBUG(dbgs() << "LowerBUILD_VECTOR: trying to lower new vector: ";
7765 dbgs() << "LowerBUILD_VECTOR: all elements are constant, use default "
7784 dbgs() << "LowerBUILD_VECTOR: alternatives failed, creating sequence "
7802 LLVM_DEBUG(dbgs() << "Creating node for op0, it is not undefined:\n");
7806 LLVM_DEBUG(if (i < NumElts) dbgs()
7819 dbgs() << "LowerBUILD_VECTOR: use default expansion, failed to find "
9096 LLVM_DEBUG(dbgs() << "Illegal add imm " << Immed
9104 LLVM_DEBUG(dbgs() << "Is " << Immed
9952 dbgs() << "aarch64-lower: bitcast extract_subvector simplification\n");
10041 dbgs() << "aarch64-lower: concat_vectors bitcast simplification\n");
11720 LLVM_DEBUG(dbgs() << "Custom combining: skipping\n");
lib/Target/AArch64/AArch64InstructionSelector.cpp 389 dbgs() << "Couldn't find appropriate subregister for register class.");
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");
1368 dbgs() << "Generic instruction has unexpected implicit operands\n");
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
1898 dbgs()
1905 LLVM_DEBUG(dbgs() << "G_UADDO currently only supported for scalars.\n");
1954 dbgs() << "G_TRUNC/G_PTRTOINT input/output on different banks\n");
1971 LLVM_DEBUG(dbgs() << "Failed to constrain G_TRUNC/G_PTRTOINT\n");
1986 dbgs() << "Unhandled mismatched classes in G_TRUNC/G_PTRTOINT\n");
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");
2812 dbgs() << "Couldn't determine lane copy opcode for instruction.\n");
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");
891 dbgs() << "Creating pair load/store. Replacing instructions:\n ");
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";);
342 LLVM_DEBUG(dbgs() << "Killing chain " << printReg(r, TRI) << " at ";
343 MI.print(dbgs()););
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');
511 dbgs() << "Use to update " << Use.second << ":";
512 Use.first->print(dbgs());
513 dbgs() << '\n';
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 "
310 if (TmpReg != 0) dbgs() << printReg(TmpReg, TRI) << " ";
311 dbgs() << "to be available at MI " << MI);
333 dbgs()
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);
669 dbgs() << "***** AArch64SpeculationHardening - automatic insertion of "
677 dbgs()
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 535 DEBUG_WITH_TYPE("usenative", dbgs() << "<useNative> replace " << *aCI
566 DEBUG_WITH_TYPE("usenative", dbgs() << "<useNative> replace " << *aCI
809 LLVM_DEBUG(dbgs() << "AMDIC: " << *CI << " ---> ");
813 LLVM_DEBUG(dbgs() << *CI << '\n');
1749 LLVM_DEBUG(dbgs() << "AMDIC: process function ";
1750 F.printAsOperand(dbgs(), false, F.getParent()); dbgs() << '\n';);
1750 F.printAsOperand(dbgs(), false, F.getParent()); dbgs() << '\n';);
1766 LLVM_DEBUG(dbgs() << "AMDIC: try folding " << *CI << "\n";
1767 dbgs().flush());
lib/Target/AMDGPU/AMDGPUMachineCFGStructurizer.cpp 267 dbgs() << "=PHIInfo Start=\n";
270 dbgs() << "Dest: " << printReg(Element.DestReg, TRI)
273 dbgs() << printReg(SI.first, TRI) << '(' << printMBBReference(*SI.second)
276 dbgs() << "}\n";
278 dbgs() << "=PHIInfo End=\n";
481 dbgs() << " ";
502 dbgs() << "MBB: " << getMBB()->getNumber();
503 dbgs() << " In: " << printReg(getBBSelectRegIn(), TRI);
504 dbgs() << ", Out: " << printReg(getBBSelectRegOut(), TRI) << "\n";
552 dbgs() << "Region: " << (void *)Region;
553 dbgs() << " In: " << printReg(getBBSelectRegIn(), TRI);
554 dbgs() << ", Out: " << printReg(getBBSelectRegOut(), TRI) << "\n";
558 dbgs() << "Succ: " << getSucc()->getNumber() << "\n";
560 dbgs() << "Succ: none \n";
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
916 dbgs() << "Pepareing to replace register (region): "
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): "
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");
1457 LLVM_DEBUG(dbgs() << "Shrink PHI: ");
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: ");
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: ");
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");
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");
2094 LLVM_DEBUG(dbgs() << "Before PHI Prune\n");
2135 LLVM_DEBUG(dbgs() << "After PHI Prune\n");
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");
2236 LLVM_DEBUG(dbgs() << "Trying to substitute physical register: "
2244 LLVM_DEBUG(dbgs() << "Replacing register: "
2260 LLVM_DEBUG(dbgs() << "Resolve PHI Infos\n");
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 "
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)
2747 LLVM_DEBUG(dbgs() << "Loop BBSelect Merge PHI:\n");
2760 LLVM_DEBUG(LRegion->print(dbgs(), TRI));
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");
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 << " -> "
514 dbgs() << "Found a binary instruction with another alloca object\n");
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');
748 dbgs()
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);
822 dbgs() << "to\n"; DAG->dumpNode(*SU); dbgs() << '\n');
822 dbgs() << "to\n"; DAG->dumpNode(*SU); dbgs() << '\n');
868 LLVM_DEBUG(dbgs() << "Found MFMA: "; DAG->dumpNode(SU);
869 dbgs() << "Need " << Lat
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 161 LLVM_DEBUG(dbgs() << "LoopInfo:\n"; PrintLoopinfo(*MLI););
163 LLVM_DEBUG(MDT->print(dbgs(), (const Module *)nullptr););
165 LLVM_DEBUG(PDT->print(dbgs()););
185 dbgs() << "BB" << (*iterBlk)->getNumber();
186 dbgs() << "(" << getSCCNum(*iterBlk) << "," << (*iterBlk)->size() << ")";
188 dbgs() << "\n";
190 dbgs() << " ";
198 (*iter)->print(dbgs(), 0);
461 SHOWNEWINSTR(MI);
473 SHOWNEWINSTR(MI);
485 SHOWNEWINSTR(NewMBB);
498 SHOWNEWINSTR(NewMI);
510 SHOWNEWINSTR(NewInstr);
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);
795 dbgs() << "\n";);
810 LLVM_DEBUG(dbgs() << "Can't reduce SCC " << getSCCNum(MBB)
812 dbgs() << "doesn't make any progress\n";);
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";);
895 dbgs() << "unreachable block BB" << MBB->getNumber() << "\n";
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";);
1148 dbgs() << "head = BB" << HeadMBB->getNumber()
1151 dbgs() << "\n";
1152 HeadMBB->print(dbgs());
1153 dbgs() << "\n";
1157 dbgs() << ", true = BB" << TrueMBB->getNumber() << " size = "
1160 dbgs() << "\n";
1161 TrueMBB->print(dbgs());
1162 dbgs() << "\n";
1166 dbgs() << ", false = BB" << FalseMBB->getNumber() << " size = "
1169 dbgs() << "\n";
1170 FalseMBB->print(dbgs());
1171 dbgs() << "\n";
1175 dbgs() << ", land = BB" << LandMBB->getNumber() << " size = "
1178 dbgs() << "\n";
1179 LandMBB->print(dbgs());
1180 dbgs() << "\n";
1184 dbgs() << "\n";
1217 dbgs() << "before improveSimpleJumpintoIf: ";
1354 dbgs() << "result from improveSimpleJumpintoIf: ";
1365 LLVM_DEBUG(dbgs() << "serialPattern BB" << DstMBB->getNumber() << " <= BB"
1381 LLVM_DEBUG(dbgs() << "ifPattern BB" << MBB->getNumber(); dbgs() << "{ ";
1381 LLVM_DEBUG(dbgs() << "ifPattern BB" << MBB->getNumber(); dbgs() << "{ ";
1382 if (TrueMBB) { dbgs() << "BB" << TrueMBB->getNumber(); } dbgs()
1382 if (TrueMBB) { dbgs() << "BB" << TrueMBB->getNumber(); } dbgs()
1384 dbgs() << "{ "; if (FalseMBB) {
1385 dbgs() << "BB" << FalseMBB->getNumber();
1386 } dbgs() << " }\n ";
1387 dbgs() << "landBlock: "; if (!LandMBB) { dbgs() << "NULL"; } else {
1387 dbgs() << "landBlock: "; if (!LandMBB) { dbgs() << "NULL"; } else {
1388 dbgs() << "BB" << LandMBB->getNumber();
1389 } dbgs() << "\n";);
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: "
1546 SHOWNEWBLK(CloneMBB, "result of 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 = "
1589 SHOWNEWBLK(DummyExitBlk, "DummyExitBlock to normalize infiniteLoop: ");
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);
1621 SHOWNEWBLK(MBB1, "Removing redundant successor");
1638 LLVM_DEBUG(dbgs() << "Add dummyExitBlock to BB" << MBB->getNumber()
1641 SHOWNEWBLK(DummyExitBlk, "DummyExitBlock: ");
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=";
425 dbgs() << "undef";
427 dbgs() << *OldOpndValue;
428 dbgs() << ", bound_ctrl=" << CombBCZ << '\n');
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"
330 : AvailQueue) dbgs()
332 dbgs() << '\n';);
338 LLVM_DEBUG(dbgs() << "Selected "; DAG.dumpNode(*SU));
lib/Target/AMDGPU/GCNIterativeScheduler.cpp 203 LLVM_DEBUG(dbgs() << "\nScheduling ";
204 printRegion(dbgs(), Rgn.Begin, Rgn.End, Sch.LIS, 2));
273 (dbgs() << "Tracked region ",
274 printRegion(dbgs(), Begin, End, LIS), false));
314 LLVM_DEBUG(printLivenessInfo(dbgs(), RegionBegin, RegionEnd, LIS);
316 dbgs() << "Max RP: ";
318 dbgs(), &MF.getSubtarget<GCNSubtarget>());
319 } dbgs()
423 || (dbgs() << "Max RP mismatch!!!\n"
425 SchedMaxRP.print(dbgs(), &ST),
426 dbgs() << "RP for schedule (reported): ",
427 MaxRP.print(dbgs(), &ST),
428 dbgs() << "RP after scheduling: ",
429 RegionMaxRP.print(dbgs(), &ST),
454 LLVM_DEBUG(dbgs() << "Trying to improve occupancy, target = " << TargetOcc
462 LLVM_DEBUG(printRegion(dbgs(), R->Begin, R->End, LIS, 3);
463 printLivenessInfo(dbgs(), R->Begin, R->End, LIS));
468 LLVM_DEBUG(dbgs() << "Occupancy improvement attempt:\n";
469 printSchedRP(dbgs(), R->MaxPressure, MaxRP));
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");
558 dbgs() << "\nWarning: Pressure becomes worse after minreg!";
559 printSchedRP(dbgs(), R->MaxPressure, RP);
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
173 dbgs()
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
252 : RQ) dbgs()
254 dbgs() << '\n';);
260 LLVM_DEBUG(dbgs() << "Selected "; DAG.dumpNode(*SU));
lib/Target/AMDGPU/GCNNSAReassign.cpp 295 LLVM_DEBUG(dbgs() << "Attempting to reassign NSA: " << *MI
298 dbgs() << " " << llvm::printReg((VRM->getPhys(LI->reg)), TRI);
299 dbgs() << '\n');
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 94 dbgs() << P->printReg(Reg) << " to banks ";
96 dbgs() << " weight " << Weight << '\n';
256 dbgs() << printBank(L) << ' ';
517 dbgs() << "Potential reassignments of " << printReg(Reg, SubReg)
519 dbgs() << '\n'; });
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');
689 if (MBB.getName().empty()) dbgs() << "bb." << MBB.getNumber();
690 else dbgs() << MBB.getName(); dbgs() << ":\n";
690 else dbgs() << MBB.getName(); dbgs() << ":\n";
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";
764 dbgs() << "\n\n");
781 LLVM_DEBUG(dbgs() << "\nCandidates:\n\n";
784 dbgs() << "\n\n");
789 LLVM_DEBUG(dbgs() << "=== After the pass " << CyclesSaved
lib/Target/AMDGPU/GCNRegPressure.cpp 39 dbgs() << "Live regs at " << SI << ": "
52 dbgs() << " " << printReg(Reg, MRI.getTargetRegisterInfo())
56 dbgs() << " " << S << '\n';
60 dbgs() << " " << LI << '\n';
64 if (!Num) dbgs() << " <none>\n";
450 dbgs() << " " << printReg(P.first, TRI)
455 dbgs() << " " << printReg(P.first, TRI)
466 dbgs() << " " << printReg(P.first, TRI)
479 dbgs() << "\nGCNUpwardRPTracker error: Tracked and"
488 dbgs() << "GCNUpwardRPTracker error: Pressure sets different\nTracked: ";
489 CurPressure.print(dbgs());
490 dbgs() << "LIS rpt: ";
491 LISPressure.print(dbgs());
lib/Target/AMDGPU/GCNRegPressure.h 80 void dump() const { print(dbgs()); }
lib/Target/AMDGPU/GCNSchedStrategy.cpp 191 LLVM_DEBUG(dbgs() << "Picking from Bot:\n");
211 LLVM_DEBUG(dbgs() << "Picking from Top:\n");
231 LLVM_DEBUG(dbgs() << "Top Cand: "; traceCandidate(TopCand);
232 dbgs() << "Bot Cand: "; traceCandidate(BotCand););
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:";
341 GCNRPTracker::printLiveRegs(dbgs(), LiveIns[RegionIdx], MRI);
342 dbgs() << "Region live-in pressure: ";
343 llvm::getRegPressure(MRI, LiveIns[RegionIdx]).print(dbgs());
344 dbgs() << "Region register pressure: ";
345 PressureBefore.print(dbgs()));
358 LLVM_DEBUG(dbgs() << "Pressure after scheduling: ";
359 PressureAfter.print(dbgs()));
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");
545 dbgs()
573 LLVM_DEBUG(dbgs() << "********** MI Scheduling **********\n");
574 LLVM_DEBUG(dbgs() << MF.getName() << ":" << printMBBReference(*MBB) << " "
577 if (RegionEnd != MBB->end()) dbgs() << *RegionEnd;
578 else dbgs() << "End";
579 dbgs() << " RegionInstrs: " << NumRegionInstrs << '\n');
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");
128 dbgs() << " ** Pick node **\n";
131 dbgs() << "NO NODE \n";
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() << " ->");
237 LLVM_DEBUG(dbgs() << " "; (*It).dump(); dbgs() << " ->");
371 dbgs() << "Trying to optimize ";
377 LLVM_DEBUG(dbgs() << "Using common slots...\n";);
385 LLVM_DEBUG(dbgs() << "Using free slots...\n";);
lib/Target/AMDGPU/R600Packetizer.cpp 240 dbgs() << "Considering as Trans Inst :";
253 dbgs() << "Couldn't pack :\n";
255 dbgs() << "with the following packets :\n";
258 dbgs() << "\n";
260 dbgs() << "because of Consts read limitations\n";
270 dbgs() << "Couldn't pack :\n";
272 dbgs() << "with the following packets :\n";
275 dbgs() << "\n";
277 dbgs() << "because of Read port limitations\n";
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 1034 dbgs() << "Spilling FP to " << printReg(Spill.VGPR, TRI)
1052 dbgs() << "FP requires fallback spill to " << printReg(Spill.VGPR, TRI)
1055 LLVM_DEBUG(dbgs() << "Saving FP with copy to " <<
lib/Target/AMDGPU/SIInsertWaitcnts.cpp 300 void dump() { print(dbgs()); }
1141 LLVM_DEBUG(dbgs() << "updateWaitcntInBlock\n"
1158 LLVM_DEBUG(dbgs() << "insertWaitcntInBlock\n"
1174 LLVM_DEBUG(dbgs() << "insertWaitcntInBlock\n"
1367 dbgs() << "*** Block" << Block.getNumber() << " ***";
1420 Inst.print(dbgs());
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";);
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;
1652 dbgs() << ")"; P.first->dump());
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 205 dbgs() << " SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason);
206 dbgs() << '\n';
472 dbgs() << "*** Scheduling failed! ***\n";
474 dbgs() << " has been released too many times!\n";
504 dbgs() << "Data Structure Bug in SI Scheduler\n";
579 dbgs() << "Block (" << ID << ")\n";
583 dbgs() << "\nContains High Latency Instruction: "
585 dbgs() << "\nDepends On:\n";
590 dbgs() << "\nSuccessors:\n";
593 dbgs() << "(Data Dep) ";
598 dbgs() << "LiveInPressure " << LiveInPressure[DAG->getSGPRSetID()] << ' '
600 dbgs() << "LiveOutPressure " << LiveOutPressure[DAG->getSGPRSetID()] << ' '
602 dbgs() << "LiveIns:\n";
604 dbgs() << printVRegOrUnit(Reg, DAG->getTRI()) << ' ';
606 dbgs() << "\nLiveOuts:\n";
608 dbgs() << printVRegOrUnit(Reg, DAG->getTRI()) << ' ';
611 dbgs() << "\nInstructions:\n";
620 dbgs() << "///////////////////////\n";
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");
1562 LLVM_DEBUG(dbgs() << "Block Order:"; for (SIScheduleBlock *Block
1564 dbgs() << ' ' << Block->getID();
1565 } dbgs() << '\n';);
1628 LLVM_DEBUG(dbgs() << "Picking New Blocks\n"; dbgs() << "Available: ";
1628 LLVM_DEBUG(dbgs() << "Picking New Blocks\n"; dbgs() << "Available: ";
1630 : ReadyBlocks) dbgs()
1632 dbgs() << "\nCurrent Live:\n";
1634 : LiveRegs) dbgs()
1636 dbgs() << '\n';
1637 dbgs() << "Current VGPRs: " << VregCurrentUsage << '\n';
1638 dbgs() << "Current SGPRs: " << SregCurrentUsage << '\n';);
1670 LLVM_DEBUG(dbgs() << "Best Current Choice: " << Cand.Block->getID() << ' '
1675 LLVM_DEBUG(dbgs() << "Picking: " << Cand.Block->getID() << '\n';
1676 dbgs() << "Is a block with high latency instruction: "
1678 dbgs() << "Position of last high latency dependency: "
1680 dbgs() << "VGPRUsageDiff: " << Cand.VGPRUsageDiff << '\n';
1681 dbgs() << '\n';);
1932 LLVM_DEBUG(dbgs() << "Preparing Scheduling\n");
2037 LLVM_DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") "
2046 dbgs() << "*** Final schedule for "
2049 dbgs() << '\n';
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 133 void dump() const { print(dbgs()); }
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 230 dbgs() << "\n"
241 dbgs() << " " << MI << " Needs = " << PrintState(III->second.Needs)
703 LLVM_DEBUG(dbgs() << "\nProcessing block " << printMBBReference(MBB)
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/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");
237 dbgs() << "[ABAW] Instructions " << *First << " and " << *Last
275 LLVM_DEBUG(dbgs() << "canJoinInstructions: " << *First << *Last);
281 dbgs()
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.");
346 dbgs() << "Successfully decoded 16-bit instruction with limm.");
350 dbgs() << "Not a 16-bit instruction with limm, try without it.");
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())) {
1044 dbgs() << F;
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");
337 dbgs() << format("%08x %bb.%u\t", BBI.Offset, J)
351 LLVM_DEBUG(dbgs() << "***** ARMConstantIslands: "
416 LLVM_DEBUG(dbgs() << "Beginning CP iteration #" << NoCPIters << '\n');
431 LLVM_DEBUG(dbgs() << "Beginning BR iteration #" << NoBRIters << '\n');
473 LLVM_DEBUG(dbgs() << '\n'; dumpBBs());
544 LLVM_DEBUG(dbgs() << "Moved CPI#" << i << " to end of function, size = "
1071 dbgs() << "User of CPE#" << CPEMI->getOperand(0).getImm()
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");
1549 dbgs() << " Moved CPE to #" << ID << " CPI=" << CPI
1639 LLVM_DEBUG(dbgs() << " Changed B to long jump " << *MI);
1684 dbgs() << " Invert Bcc condition and swap its destination with "
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)
1954 dbgs()
1964 LLVM_DEBUG(dbgs() << "%r7 is saved low register, RegDeficit = "
1969 dbgs()
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 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");
947 dbgs() << "G_TRUNC/G_ANYEXT operands on different register banks\n");
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");
1017 dbgs()
1024 dbgs() << "G_INTTOPTR/G_PTRTOINT on non-GPR not supported yet\n");
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;
308 if (Dec) dbgs() << "ARM Loops: Found Loop Dec: " << *Dec;
309 if (End) dbgs() << "ARM Loops: Found Loop End: " << *End;);
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";
318 dbgs() << "Ld0:"; Ld0->dump();
319 dbgs() << "Ld1:"; Ld1->dump();
426 dbgs() << "Consecutive load pairs:\n";
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: ";
10424 Inst.dump_pretty(dbgs(), MII.getName(Inst.getOpcode()));
10425 dbgs() << "\n");
10445 LLVM_DEBUG(dbgs() << "Changed to: ";
10446 Inst.dump_pretty(dbgs(), MII.getName(Inst.getOpcode()));
10447 dbgs() << "\n");
11597 dbgs() << "Missing diagnostic string for operand class "
lib/Target/ARM/MCTargetDesc/ARMAsmBackend.cpp 1100 DEBUG_WITH_TYPE("compact-unwind", llvm::dbgs() << "generateCU()\n");
1137 llvm::dbgs() << ".cfi_offset on unknown register="
1148 llvm::dbgs()
1163 DEBUG_WITH_TYPE("compact-unwind", llvm::dbgs() << "frame register is "
1171 llvm::dbgs()
1180 llvm::dbgs() << "r7 not saved as standard frame\n");
1199 DEBUG_WITH_TYPE("compact-unwind", llvm::dbgs()
1227 llvm::dbgs() << MRI.getName(CSReg.Reg) << " saved at "
1248 llvm::dbgs() << "unsupported number of D registers saved ("
1261 llvm::dbgs() << FloatRegCount << " D-regs saved, but "
1267 llvm::dbgs() << FloatRegCount << " D-regs saved, but "
lib/Target/ARM/MLxExpansionPass.cpp 310 dbgs() << "Expanding: " << *MI;
311 dbgs() << " to:\n";
317 dbgs() << " " << MI1;
318 dbgs() << " " << MI2;
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/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');
184 LLVM_DEBUG(dbgs() << "== "; Node->dump(CurDAG); dbgs() << '\n');
271 LLVM_DEBUG(dbgs() << "Check candidate load: "; LD->dump(); dbgs() << '\n');
271 LLVM_DEBUG(dbgs() << "Check candidate load: "; LD->dump(); dbgs() << '\n');
281 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: ";
490 Node->dump(); dbgs() << '\n');
lib/Target/BPF/BPFMIChecking.cpp 62 LLVM_DEBUG(dbgs() << "*** BPF PreEmit checking pass ***\n\n");
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:");
114 LLVM_DEBUG(dbgs() << " One ZExt elim sequence identified.\n");
142 LLVM_DEBUG(dbgs() << "Starting SRL found:");
151 LLVM_DEBUG(dbgs() << " SLL found:");
160 LLVM_DEBUG(dbgs() << " Type cast Mov found:");
165 LLVM_DEBUG(dbgs()
233 LLVM_DEBUG(dbgs() << "*** BPF PreEmit peephole pass ***\n\n");
244 LLVM_DEBUG(dbgs() << " Redundant Mov Eliminated:");
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:");
1264 LLVM_DEBUG(dbgs() << "\n");
lib/Target/Hexagon/BitTracker.cpp 184 dbgs() << printReg(P.first, &ME.TRI) << " -> " << P.second << "\n";
801 dbgs() << "Visit FI(" << printMBBReference(*PI.getParent()) << "): " << PI;
818 dbgs() << " edge " << printMBBReference(*PB) << "->"
822 dbgs() << " not executable\n";
829 dbgs() << " input reg: " << printReg(RU.Reg, &ME.TRI, RU.Sub)
836 dbgs() << "Output: " << printReg(DefRR.Reg, &ME.TRI, DefRR.Sub)
845 dbgs() << "Visit MI(" << printMBBReference(*MI.getParent()) << "): " << MI;
859 dbgs() << " input reg: " << printReg(RU.Reg, &ME.TRI, RU.Sub)
862 dbgs() << "Outputs:\n";
865 dbgs() << " " << printReg(P.first, &ME.TRI) << " cell: "
930 dbgs() << "Visit BR(" << printMBBReference(B) << "): " << MI;
940 dbgs() << " failed to evaluate: will add all CFG successors\n";
944 dbgs() << " adding targets:";
946 dbgs() << " " << printMBBReference(*BTs[i]);
948 dbgs() << "\n falls through\n";
950 dbgs() << "\n does not fall through\n";
982 dbgs() << "queuing uses of modified reg " << printReg(Reg, &ME.TRI)
1147 print_cells(dbgs() << "Cells after propagation:\n");
lib/Target/Hexagon/HexagonBitSimplify.cpp 2459 dbgs() << __func__ << " on reg: " << printReg(RD.Reg, &HRI, RD.Sub)
2461 dbgs() << "Cell: " << RC << '\n';
2462 dbgs() << "Expected bitfield size: " << Len << " bits, "
3105 LLVM_DEBUG(dbgs() << "Processing loop in " << printMBBReference(*C.LB)
3131 dbgs() << "Phis: {";
3133 dbgs() << ' ' << printReg(I.DefR, HRI) << "=phi("
3138 dbgs() << " }\n";
3254 dbgs() << "Group[" << i << "] inp: "
3258 dbgs() << " " << *G.Ins[j];
lib/Target/Hexagon/HexagonBitTracker.cpp 107 dbgs() << printReg(Reg, &TRI, Sub) << " in reg class "
155 dbgs() << "Reg class id: " << RC.getID() << " idx: " << Idx << '\n';
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);
579 dbgs() << "Gep node equality:\n";
581 dbgs() << "{ " << I->first << ", " << I->second << " }\n";
583 dbgs() << "Gep equivalence classes:\n";
585 dbgs() << '{';
589 dbgs() << ',';
590 dbgs() << ' ' << *J;
592 dbgs() << " }\n";
645 LLVM_DEBUG(dbgs() << "Gep nodes after commoning:\n" << Nodes);
665 LLVM_DEBUG(dbgs() << "Gep nodes after post-commoning cleanup:\n" << Nodes);
671 dbgs() << "NCD of {";
677 dbgs() << ' ' << B->getName();
679 dbgs() << " }\n";
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 580 dbgs() << "Root: " << Root << '\n';
586 dbgs() << "Node: " << N << '\n';
587 dbgs() << " Height: " << N->Height << '\n';
588 dbgs() << " Count: " << N->Count << '\n';
589 dbgs() << " MaxEnd: " << N->MaxEnd << '\n';
590 dbgs() << " Range: " << N->Range << '\n';
591 dbgs() << " Left: " << N->Left << '\n';
592 dbgs() << " Right: " << N->Right << "\n\n";
1277 LLVM_DEBUG(dbgs() << " =" << I << ". " << EV << " " << ED << '\n');
1297 LLVM_DEBUG(dbgs() << " " << I << ". " << EV << " " << ED << '\n');
1310 dbgs() << "Ranges\n";
1312 dbgs() << " " << I << ". " << Ranges[I-Begin] << '\n';
1313 dbgs() << "RangeMap\n";
1315 dbgs() << " " << P.first << " ->";
1317 dbgs() << ' ' << I;
1318 dbgs() << '\n';
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()
1664 dbgs() << "\nExtOpc: " << HII->getName(ExtOpc) << " has no rr version\n";
1693 dbgs() << '\n' << MI;
1742 dbgs() << "Diff: " << -Diff << " out of range " << Uses
1819 dbgs() << '\n' << PrintInit(ExtI, *HRI) << " " << MI;
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");
1995 MF.print(dbgs() << "After " << getPassName() << '\n', nullptr);
1997 dbgs() << "No changes\n";
lib/Target/Hexagon/HexagonConstPropagation.cpp 93 dbgs() << printReg(Reg, TRI, SubReg);
615 dbgs() << " " << printReg(I.first, &TRI) << " -> " << I.second << '\n';
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())
683 dbgs() << " outputs:";
685 dbgs() << ' ' << I.second;
686 dbgs() << '\n';
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)
877 dbgs() << "Picked edge "
934 dbgs() << "Cells after propagation:\n";
935 Cells.print(dbgs(), MCE.TRI);
936 dbgs() << "Dead CFG edges:\n";
942 dbgs() << " " << printMBBReference(B) << " -> "
1048 LLVM_DEBUG(MF.print(dbgs() << "Starting MachineConstPropagator\n", nullptr));
1061 dbgs() << "End of MachineConstPropagator (Changed=" << Changed << ")\n";
1063 MF.print(dbgs(), nullptr);
2801 dbgs() << "Top " << printReg(R.Reg, &HRI, R.SubReg)
2812 dbgs() << "CONST: " << MI;
2817 dbgs() << printReg(R, &TRI) << ": " << Inputs.get(R) << "\n";
2935 dbgs() << "In function: " << MF.getName() << "\n";
2936 dbgs() << "Rewrite: for " << MI << " created " << *NewInstrs[0];
2938 dbgs() << " " << *NewInstrs[i];
3101 dbgs() << "Rewrite: for " << MI;
3103 dbgs() << " created " << *NewMI;
3105 dbgs() << " modified the instruction itself and created:" << *NewMI;
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");
555 dbgs() << "Total number of instructions to be predicated/speculated: "
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)
646 : dbgs() << "Visiting function")
752 dbgs() << *MI;
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",
1289 LIS->print(dbgs() << "After coalescing\n", MF.getFunction().getParent()));
1306 LIS->print(dbgs() << "After splitting\n", MF.getFunction().getParent()));
1314 LLVM_DEBUG(LIS->print(dbgs() << "After predicating\n",
1322 LIS->print(dbgs() << "After expand-condsets\n",
lib/Target/Hexagon/HexagonFrameLowering.cpp 445 dbgs() << "Blocks needing SF: {";
447 dbgs() << " " << printMBBReference(*B);
448 dbgs() << " }\n";
468 dbgs() << "Computed dom block: ";
470 dbgs() << printMBBReference(*DomB);
472 dbgs() << "<null>";
473 dbgs() << ", computed pdom block: ";
475 dbgs() << printMBBReference(*PDomB);
477 dbgs() << "<null>";
478 dbgs() << "\n";
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");
1418 dbgs() << '{';
1421 dbgs() << ' ' << printReg(R, &TRI);
1423 dbgs() << " }";
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);
1448 dbgs() << "\n");
1458 LLVM_DEBUG(dbgs() << "Res: "; dump_registers(Reserved, *TRI);
1459 dbgs() << "\n");
1460 LLVM_DEBUG(dbgs() << "SRegs.2: "; dump_registers(SRegs, *TRI);
1461 dbgs() << "\n");
1482 LLVM_DEBUG(dbgs() << "TmpSup: "; dump_registers(TmpSup, *TRI);
1483 dbgs() << "\n");
1487 LLVM_DEBUG(dbgs() << "SRegs.4: "; dump_registers(SRegs, *TRI);
1488 dbgs() << "\n");
1501 LLVM_DEBUG(dbgs() << "SRegs.5: "; dump_registers(SRegs, *TRI);
1502 dbgs() << "\n");
1541 dbgs() << "CS information: {";
1545 dbgs() << ' ' << printReg(CSI[i].getReg(), TRI) << ":fi#" << FI << ":sp";
1547 dbgs() << '+';
1548 dbgs() << Off;
1550 dbgs() << " }\n";
1558 dbgs() << printReg(R, TRI) << ' ';
2060 LLVM_DEBUG(dbgs() << "Index map for " << printMBBReference(B) << "\n"
2170 dbgs() << "fi#" << P.first;
2172 dbgs() << " (bad)";
2173 dbgs() << " RC: ";
2175 dbgs() << HRI.getRegClassName(P.second.RC) << '\n';
2177 dbgs() << "<null>\n";
2179 dbgs() << " " << printMBBReference(*R.first) << " { " << R.second
2208 dbgs() << "Block-to-FI map (* -- live-on-exit):\n";
2213 dbgs() << " " << printMBBReference(*P.first) << ": {";
2215 dbgs() << " fi#" << I;
2217 dbgs() << '*';
2219 dbgs() << " }\n";
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/HexagonGenInsert.cpp 584 dbgs() << " " << printReg(I->first, HRI) << ":\n";
587 dbgs() << " " << PrintIFR(LL[i].first, HRI) << ", "
797 dbgs() << __func__ << ": " << printReg(VR, HRI)
862 dbgs() << "Prefixes matching register " << printReg(VR, HRI) << "\n";
864 dbgs() << " L=" << I->first << ':';
867 dbgs() << " (" << printReg(LL[i].first, HRI) << ",@"
869 dbgs() << '\n';
914 dbgs() << printReg(VR, HRI) << " = insert(" << printReg(SrcR, HRI)
931 dbgs() << "visiting block " << printMBBReference(*B) << "\n";
1538 dbgs() << "Cell ordering:\n";
1542 dbgs() << printReg(VR, HRI) << " -> " << Pos << "\n";
1562 dbgs() << "Candidates after collection:\n";
1575 dbgs() << "Candidates after pruning:\n";
1588 dbgs() << "Candidates after selection:\n";
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 1249 dbgs() << "Preprocessed (Hexagon) selection DAG:";
1257 dbgs() << "Address tree balanced selection DAG:";
1913 LLVM_DEBUG(dbgs() << "--> No need to balance root (Weight=" << Weight
1920 LLVM_DEBUG(dbgs() << "** Balancing root node: ");
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 ("
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
2215 LLVM_DEBUG(dbgs() << "--> Root is now: ");
2223 LLVM_DEBUG(dbgs() << "--> Root unchanged.\n");
2246 LLVM_DEBUG(dbgs() << "** Rebalancing address calculation in node: ");
2287 LLVM_DEBUG(dbgs() << "--> Final node: ");
lib/Target/Hexagon/HexagonISelDAGToDAGHVX.cpp 271 dbgs() << "{ Order: {";
275 dbgs() << ' ' << P;
277 dbgs() << " -";
279 dbgs() << " }\n";
280 dbgs() << " Needed: {";
282 dbgs() << ' ' << N;
283 dbgs() << " }\n";
285 dbgs() << " Edges: {\n";
287 dbgs() << " " << E.first << " -> {";
289 dbgs() << ' ' << N;
290 dbgs() << " }\n";
292 dbgs() << " }\n";
306 dbgs() << " Colors: {\n";
308 dbgs() << " " << C.first << " -> " << ColorKindToName(C.second) << "\n";
309 dbgs() << " }\n}\n";
979 dbgs() << "Materializing\n";
980 Results.print(dbgs(), DAG);
1030 dbgs() << "Generated node:\n";
1040 DEBUG_WITH_TYPE("isel", {dbgs() << __func__ << '\n';});
1054 DEBUG_WITH_TYPE("isel", {dbgs() << __func__ << '\n';});
1150 DEBUG_WITH_TYPE("isel", {dbgs() << __func__ << '\n';});
1199 DEBUG_WITH_TYPE("isel", {dbgs() << __func__ << '\n';});
1212 DEBUG_WITH_TYPE("isel", {dbgs() << __func__ << '\n';});
1220 DEBUG_WITH_TYPE("isel", {dbgs() << __func__ << '\n';});
1239 DEBUG_WITH_TYPE("isel", {dbgs() << __func__ << '\n';});
1270 DEBUG_WITH_TYPE("isel", {dbgs() << __func__ << '\n';});
1307 DEBUG_WITH_TYPE("isel", {dbgs() << __func__ << '\n';});
1363 DEBUG_WITH_TYPE("isel", {dbgs() << __func__ << '\n';});
1493 DEBUG_WITH_TYPE("isel", {dbgs() << __func__ << '\n';});
1616 DEBUG_WITH_TYPE("isel", {dbgs() << __func__ << '\n';});
1670 DEBUG_WITH_TYPE("isel", {dbgs() << __func__ << '\n';});
1938 DEBUG_WITH_TYPE("isel", {dbgs() << __func__ << '\n';});
2003 dbgs() << "Starting " << __func__ << " on node:\n";
2037 dbgs() << "VecLen=" << VecLen << " HwLen=" << HwLen << " UseLeft="
2069 dbgs() << "Unhandled shuffle:\n";
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");
678 dbgs () << __func__ << " Align: " << A << " Size: ";
680 dbgs() << "\n";
2200 dbgs() << "VecTy: " << EVT(VecTy).getEVTString() << '\n';
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 "
878 dbgs() << "Invalid registers for copy in " << printMBBReference(MBB) << ": "
1564 LLVM_DEBUG(dbgs() << "\nCannot predicate:"; MI.dump(););
2316 LLVM_DEBUG(dbgs() << "V60" << (isLate ? "-LR " : " -- "));
2318 LLVM_DEBUG(dbgs() << "V60" << (isEarly ? "-ES " : " -- "));
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');
1883 dbgs() << "Found pmpy idiom: R = " << PP << ".Q\n";
1885 dbgs() << "Found inverse pmpy idiom: R = (" << PP << "/Q).Q) + "
1887 dbgs() << " Res:" << *PV.Res << "\n P:" << *PV.P << "\n";
1889 dbgs() << " M:" << *PV.M << "\n";
1890 dbgs() << " Q:" << *PV.Q << "\n";
1891 dbgs() << " Iteration count:" << PV.IterCount << "\n";
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");
192 LLVM_DEBUG(dbgs() << "********** MI Converging Scheduling VLIW "
214 dbgs() << "Max Height " << maxH << "\n";);
219 dbgs() << "Max Depth " << maxD << "\n";);
227 dbgs() << "** VLIWMachineScheduler::schedule picking next node\n");
246 dbgs() << "*** Final schedule for "
249 dbgs() << '\n';
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 "
486 dbgs() << Label << " " << Q.getName() << " ";
488 dbgs() << DAG->TRI->getRegPressureSetName(P.getPSet()) << ":"
491 dbgs() << " ";
492 dbgs() << "cost(" << Cost << ")\t";
502 dbgs() << ">>> " << Q.getName() << "\n";
510 dbgs() << dbgstr.str();
512 dbgs() << "\t";
515 dbgs() << "\n";
587 LLVM_DEBUG(if (verbose) dbgs()
592 LLVM_DEBUG(dbgs() << "H|");
599 LLVM_DEBUG(if (verbose) dbgs() << "LB|");
606 dbgs() << dbgstr.str();
614 LLVM_DEBUG(if (verbose) dbgs() << "A|");
616 LLVM_DEBUG(if (verbose) dbgs() << " |");
619 LLVM_DEBUG(if (verbose) dbgs() << "LB|");
626 dbgs() << dbgstr.str();
634 LLVM_DEBUG(if (verbose) dbgs() << "A|");
636 LLVM_DEBUG(if (verbose) dbgs() << " |");
661 dbgs() << dbgstr.str();
681 dbgs() << "RP " << Delta.Excess.getUnitInc() << "/"
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|");
753 dbgs() << dbgstr.str();
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");
478 LLVM_DEBUG(dbgs() << "\n"
504 LLVM_DEBUG(dbgs() << "Instr: "; MI.dump(); dbgs() << "\n");
504 LLVM_DEBUG(dbgs() << "Instr: "; MI.dump(); dbgs() << "\n");
lib/Target/Hexagon/HexagonOptAddrMode.cpp 220 dbgs() << "*** Unable to collect all reaching defs for use ***\n"
229 dbgs() << "*** Multiple Reaching Defs found!!! ***\n";
233 dbgs() << "\t\t[Reaching Def]: "
246 LLVM_DEBUG(dbgs() << "\t\t[DefNode]: "
256 dbgs() << "\t\t\t[Reached Use]: "
264 LLVM_DEBUG(dbgs() << "\t\t\t\tphi real Uses"
309 dbgs() << "isSafeToExtLR: Returning false; another reaching def\n");
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/HexagonRDFOpt.cpp 181 dbgs() << "Partly dead: " << *SA.Addr->getCode();
271 dbgs() << "Rewriting: " << MI;
276 dbgs() << " to: " << MI;
299 MF.print(dbgs() << "Before " << getPassName() << "\n", nullptr);
309 dbgs() << "Starting copy propagation on: " << MF.getName() << '\n'
316 dbgs() << "Starting dead code elimination on: " << MF.getName() << '\n'
324 dbgs() << "Starting liveness recomputation on: " << MF.getName() << '\n';
333 MF.print(dbgs() << "After " << getPassName() << "\n", nullptr);
lib/Target/Hexagon/HexagonRegisterInfo.cpp 94 dbgs() << "Register class: " << getRegClassName(RC) << "\n";
lib/Target/Hexagon/HexagonSplitDouble.cpp 138 dbgs() << '{';
140 dbgs() << ' ' << printReg(I, &TRI);
141 dbgs() << " }";
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');
566 dbgs() << "For loop at " << printMBBReference(*HB) << " ind regs: ";
567 dump_partition(dbgs(), Rs, *TRI);
568 dbgs() << '\n';
998 LLVM_DEBUG(dbgs() << "Splitting: " << *MI);
1132 LLVM_DEBUG(dbgs() << "Splitting partition: ";
1133 dump_partition(dbgs(), Part, *TRI); dbgs() << '\n');
1133 dump_partition(dbgs(), Part, *TRI); dbgs() << '\n');
1150 LLVM_DEBUG(dbgs() << "Created mapping: " << printReg(DR, TRI) << " -> "
1192 LLVM_DEBUG(dbgs() << "Splitting double registers in function: "
1208 dbgs() << "Register partitioning: (partition #0 is fixed)\n";
1210 dbgs() << '#' << I->first << " -> ";
1211 dump_partition(dbgs(), I->second, *TRI);
1212 dbgs() << '\n';
1225 LLVM_DEBUG(dbgs() << "Calculating profit for partition #" << I->first
lib/Target/Hexagon/HexagonStoreWidening.cpp 140 dbgs() << *MI;
475 dbgs() << "Replacing:\n";
477 dbgs() << " " << *I;
478 dbgs() << "with\n";
480 dbgs() << " " << *I;
lib/Target/Hexagon/HexagonTargetObjectFile.cpp 129 TRACE("[SelectSectionForGlobal] GO(" << GO->getName() << ") ");
130 TRACE("input section(" << GO->getSection() << ") ");
132 TRACE((GO->hasPrivateLinkage() ? "private_linkage " : "")
160 TRACE("default_ELF_section\n");
167 TRACE("[getExplicitSectionGlobal] GO(" << GO->getName() << ") from("
169 TRACE((GO->hasPrivateLinkage() ? "private_linkage " : "")
193 TRACE("default_ELF_section\n");
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");
348 TRACE("Small data. Size(" << Size << ")");
358 TRACE(" default sbss\n");
370 TRACE(" unique sbss(" << Name << ")\n");
384 TRACE(" small COMMON (" << Name << ")\n");
394 TRACE(" const_object_as_data ");
402 TRACE(" default sdata\n");
414 TRACE(" unique sdata(" << Name << ")\n");
419 TRACE("default ELF section\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();
420 dbgs() << "in packet\n";);
423 dbgs() << "Checking CUR against ";
437 LLVM_DEBUG(dbgs() << "packet has "; BI->dump(););
442 LLVM_DEBUG(dbgs() << "Can Dot CUR MI\n"; MI.dump(););
1769 dbgs() << "Finalizing packet:\n";
1773 dbgs() << " * [res:0x" << utohexstr(R) << "] " << *MI;
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");
453 dbgs()
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");
743 ++i) { dbgs() << *Dependences[i] << "\n"; });
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 << "("
516 dbgs() << "\tBValue=0x"; dbgs().write_hex(Value) << ": AValue=0x";
516 dbgs() << "\tBValue=0x"; dbgs().write_hex(Value) << ": AValue=0x";
517 dbgs().write_hex(FixupValue)
519 dbgs().write_hex(OldData) << ": Reloc=0x"; dbgs().write_hex(Reloc););
519 dbgs().write_hex(OldData) << ": Reloc=0x"; dbgs().write_hex(Reloc););
532 dbgs() << ": NInst=0x"; dbgs().write_hex(NewData) << "\n";);
532 dbgs() << ": NInst=0x"; dbgs().write_hex(NewData) << "\n";);
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())
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()) {
658 dbgs() << '/';
659 dbgs().write_hex(ISJ->CVI.getUnits()) << '|';
660 dbgs() << ISJ->CVI.getLanes();
661 } dbgs() << ':'
663 dbgs() << '\n');
664 LLVM_DEBUG(dbgs() << '\n');
lib/Target/Hexagon/RDFCopy.cpp 105 dbgs() << "Copies:\n";
107 dbgs() << "Instr: " << *DFG.addr<StmtNode*>(I).Addr->getCode();
108 dbgs() << " eq: {";
110 dbgs() << ' ' << Print<RegisterRef>(J.first, DFG) << '='
112 dbgs() << " }\n";
174 dbgs() << "Can replace " << Print<RegisterRef>(DR, DFG)
lib/Target/Hexagon/RDFDeadCode.cpp 143 dbgs() << "Live nodes:\n";
146 dbgs() << PrintNode<RefNode*>(RA, DFG) << "\n";
168 dbgs() << "Dead instr: " << PrintNode<InstrNode*>(IA, DFG) << "\n";
220 dbgs() << "Removing dead ref nodes:\n";
223 dbgs() << " " << PrintNode<RefNode*>(RA, DFG) << '\n';
239 dbgs() << "erasing: " << *MI;
lib/Target/Hexagon/RDFGraph.cpp 1106 dbgs() << "Multiple definitions of register: "
lib/Target/Hexagon/RDFLiveness.cpp 582 dbgs() << "Phi-up-to-phi map with intervening defs:\n";
584 dbgs() << "phi " << Print<NodeId>(I.first, DFG) << " -> {";
586 dbgs() << ' ' << Print<NodeId>(R.first, DFG)
588 dbgs() << " }\n";
666 dbgs() << "Real use map:\n";
668 dbgs() << "phi " << Print<NodeId>(I.first, DFG);
673 dbgs() << '<' << Print<RegisterRef>(RR, DFG) << '>';
675 dbgs() << "<noreg>";
677 dbgs() << " -> " << Print<RefMap>(I.second, DFG) << '\n';
733 dbgs() << "Phi live-on-entry map:\n";
735 dbgs() << "block #" << I.first->getNumber() << " -> "
796 dbgs() << "Phi live-on-exit map:\n";
798 dbgs() << "block #" << I.first->getNumber() << " -> "
815 dbgs() << printMBBReference(B) << "\t rec = {";
817 dbgs() << ' ' << Print<RegisterRef>(I, DFG);
818 dbgs() << " }\n";
826 dbgs() << "\tcomp = {";
828 dbgs() << ' ' << Print<RegisterRef>(I, DFG);
829 dbgs() << " }\n";
964 dbgs() << "\n-- " << printMBBReference(*B) << ": " << __func__
967 dbgs() << ' ' << I->getBlock()->getNumber();
968 dbgs() << " }\n";
969 dbgs() << " LiveIn: " << Print<RefMap>(LiveIn, DFG) << '\n';
970 dbgs() << " Local: " << Print<RegisterAggr>(LiveMap[B], DFG) << '\n';
979 dbgs() << "after LOX\n";
980 dbgs() << " LiveIn: " << Print<RefMap>(LiveIn, DFG) << '\n';
981 dbgs() << " Local: " << Print<RegisterAggr>(LiveMap[B], DFG) << '\n';
1063 dbgs() << "after defs in block\n";
1064 dbgs() << " LiveIn: " << Print<RefMap>(LiveIn, DFG) << '\n';
1065 dbgs() << " Local: " << Print<RegisterAggr>(LiveMap[B], DFG) << '\n';
1084 dbgs() << "after uses in block\n";
1085 dbgs() << " LiveIn: " << Print<RefMap>(LiveIn, DFG) << '\n';
1086 dbgs() << " Local: " << Print<RegisterAggr>(LiveMap[B], DFG) << '\n';
1101 dbgs() << "after phi uses in block\n";
1102 dbgs() << " LiveIn: " << Print<RefMap>(LiveIn, DFG) << '\n';
1103 dbgs() << " Local: " << Print<RegisterAggr>(Local, DFG) << '\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/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 1230 dbgs() << "Trying MicroMipsR616 table (16-bit instructions):\n");
1241 LLVM_DEBUG(dbgs() << "Trying MicroMips16 table (16-bit instructions):\n");
1257 dbgs() << "Trying MicroMips32r632 table (32-bit instructions):\n");
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");
1315 dbgs() << "Trying Mips32r6_64r6 (GPR64) table (32-bit opcodes):\n");
1324 dbgs() << "Trying Mips32r6_64r6 (PTR64) table (32-bit opcodes):\n");
1332 LLVM_DEBUG(dbgs() << "Trying Mips32r6_64r6 table (32-bit opcodes):\n");
1341 dbgs() << "Trying Mips32r6_64r6 (PTR64) table (32-bit opcodes):\n");
1349 LLVM_DEBUG(dbgs() << "Trying CnMips table (32-bit opcodes):\n");
1357 LLVM_DEBUG(dbgs() << "Trying Mips64 (GPR64) table (32-bit opcodes):\n");
1366 dbgs() << "Trying MipsFP64 (64 bit FPU) table (32-bit opcodes):\n");
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 (";
119 I->print(dbgs()); dbgs() << ")\n");
119 I->print(dbgs()); dbgs() << ")\n");
121 LLVM_DEBUG(dbgs() << ".. and it beats the last one\n");
126 LLVM_DEBUG(dbgs() << ".. and it is unbeatable\n");
209 dbgs() << Prefix << R << "\n";
485 LLVM_DEBUG(dbgs() << "Matching: " << R << "\n");
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/MipsConstantIslandPass.cpp 428 dbgs() << format("%08x %bb.%u\t", BBI.Offset, J)
440 LLVM_DEBUG(dbgs() << "constant island machine function "
447 LLVM_DEBUG(dbgs() << "constant island processing "
489 LLVM_DEBUG(dbgs() << "Beginning CP iteration #" << NoCPIters << '\n');
501 LLVM_DEBUG(dbgs() << "Beginning BR iteration #" << NoBRIters << '\n');
513 LLVM_DEBUG(dbgs() << '\n'; dumpBBs());
581 LLVM_DEBUG(dbgs() << "Moved CPI#" << i << " to end of function, size = "
984 dbgs() << "User of CPE#" << CPEMI->getOperand(0).getImm()
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");
1408 dbgs() << " Moved CPE to #" << ID << " CPI=" << CPI
1465 LLVM_DEBUG(dbgs() << "Branch of destination " << printMBBReference(*DestBB)
1534 LLVM_DEBUG(dbgs() << " Changed B to long jump " << *MI);
1590 dbgs() << " Invert Bcc condition and swap its destination with "
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");
1026 dbgs() << ".. .. gave up (!isTypeSupported || UnsupportedFPMode)\n");
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/MipsInstructionSelector.cpp 106 LLVM_DEBUG(dbgs() << "Failed to constrain " << TII.getName(I.getOpcode())
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/MipsSEISelLowering.cpp 1056 LLVM_DEBUG(dbgs() << "\nMipsSE DAG Combine:\n";
1057 N->printrWithDepth(dbgs(), &DAG); dbgs() << "\n=> \n";
1057 N->printrWithDepth(dbgs(), &DAG); dbgs() << "\n=> \n";
1058 Val.getNode()->printrWithDepth(dbgs(), &DAG); dbgs() << "\n");
1058 Val.getNode()->printrWithDepth(dbgs(), &DAG); dbgs() << "\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");
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/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");
309 dbgs()
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");
467 dbgs() << " *** def is in another block -- safe to move!\n");
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");
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();
775 dbgs() << "\n");
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");
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()));
175 LLVM_DEBUG(dbgs() << " "; VI->print(dbgs()));
196 dbgs() << "Expanding ISEL instructions in "
214 LLVM_DEBUG(dbgs() << "Remove redundant ISEL instruction: " << **I
229 dbgs() << "Fold the ISEL instruction to an unconditional copy:\n");
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.");
307 dbgs() << "Fold the ISEL instruction to an unconditional copy.");
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: ");
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"
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: ");
5545 LLVM_DEBUG(dbgs() << "PPC DAG preprocessing replacing:\nOld: ");
5547 LLVM_DEBUG(dbgs() << "\nNew: ");
5549 LLVM_DEBUG(dbgs() << "\n");
5626 LLVM_DEBUG(dbgs() << "CR Peephole replacing:\nOld: ");
5628 LLVM_DEBUG(dbgs() << "\nNew: ");
5630 LLVM_DEBUG(dbgs() << "\n");
6044 LLVM_DEBUG(dbgs() << "CR Peephole replacing:\nOld: ");
6046 LLVM_DEBUG(dbgs() << "\nNew: ");
6048 LLVM_DEBUG(dbgs() << "\n");
6342 LLVM_DEBUG(dbgs() << "PPC64 ZExt Peephole morphing:\nOld: ");
6347 LLVM_DEBUG(dbgs() << "\nNew: ");
6349 LLVM_DEBUG(dbgs() << "\n");
6356 LLVM_DEBUG(dbgs() << "PPC64 ZExt Peephole replacing:\nOld: ");
6358 LLVM_DEBUG(dbgs() << "\nNew: ");
6360 LLVM_DEBUG(dbgs() << "\n");
6540 LLVM_DEBUG(dbgs() << "Folding add-immediate into mem-op:\nBase: ");
6542 LLVM_DEBUG(dbgs() << "\nN: ");
6544 LLVM_DEBUG(dbgs() << "\n");
6556 LLVM_DEBUG(dbgs() << "Rejected this candidate for alignment.\n\n");
lib/Target/PowerPC/PPCISelLowering.cpp 5373 dbgs() << "TCO caller: "
lib/Target/PowerPC/PPCInstrInfo.cpp 2615 LLVM_DEBUG(dbgs() << "Replace instruction: "
2620 LLVM_DEBUG(dbgs() << "with: "
2848 dbgs() << "Found LI -> CMPI -> ISEL, replacing with a copy.\n");
2850 LLVM_DEBUG(dbgs() << "Is converted to:\n");
2981 LLVM_DEBUG(dbgs() << "Replacing instruction:\n");
2983 LLVM_DEBUG(dbgs() << "Fed by:\n");
3002 LLVM_DEBUG(dbgs() << "With:\n");
3643 LLVM_DEBUG(dbgs() << "Replacing instruction:\n");
3645 LLVM_DEBUG(dbgs() << "Fed by:\n");
3706 LLVM_DEBUG(dbgs() << "With:\n");
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");
284 LLVM_DEBUG(dbgs() << "Converted instruction to imm form: ");
369 LLVM_DEBUG(dbgs() << "Optimizing load-and-splat/splat "
390 LLVM_DEBUG(dbgs() << "Optimizing splat/swap or splat/splat "
405 LLVM_DEBUG(dbgs() << "Optimizing swap/splat => splat: ");
416 LLVM_DEBUG(dbgs() << "Optimizing swap/swap => copy: ");
432 LLVM_DEBUG(dbgs() << "Removing redundant splat: ");
472 LLVM_DEBUG(dbgs() << "Changing redundant splat to a copy: ");
491 LLVM_DEBUG(dbgs() << "Removing redundant shift: ");
496 LLVM_DEBUG(dbgs() << "Changing splat immediate from " << SplatImm
542 LLVM_DEBUG(dbgs() << "Removing redundant FRSP:\n");
544 LLVM_DEBUG(dbgs() << "As it feeds instruction:\n");
546 LLVM_DEBUG(dbgs() << "Through instruction:\n");
595 LLVM_DEBUG(dbgs() << "Zero-extending load\n");
597 LLVM_DEBUG(dbgs() << "and sign-extension\n");
599 LLVM_DEBUG(dbgs() << "are merged into sign-extending load\n");
639 LLVM_DEBUG(dbgs() << "Zero-extending load\n");
641 LLVM_DEBUG(dbgs() << "and sign-extension\n");
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: ");
793 LLVM_DEBUG(dbgs() << "Optimizing ADD to COPY: ");
1248 LLVM_DEBUG(dbgs() << "Optimize two pairs of compare and branch:\n");
1311 LLVM_DEBUG(dbgs() << "into a compare and two branches:\n");
1316 LLVM_DEBUG(dbgs() << "The following compare is moved into "
1369 LLVM_DEBUG(dbgs() << "Converting pair: ");
1378 LLVM_DEBUG(dbgs() << "To: ");
1435 LLVM_DEBUG(dbgs() << "Combining pair: ");
1448 LLVM_DEBUG(dbgs() << "TO: ");
lib/Target/PowerPC/PPCPreEmitPeephole.cpp 73 LLVM_DEBUG(dbgs() << "Remove redundant load immediates from MBB:\n";
74 MBB.dump(); dbgs() << "\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: ");
191 LLVM_DEBUG(dbgs() << "Deleting self-copy instruction: ");
201 LLVM_DEBUG(dbgs() << "Converted instruction to imm form: ");
210 LLVM_DEBUG(dbgs() << "Frame offset folding by using index form: ");
285 LLVM_DEBUG(dbgs() << "PPC pre-emit peephole: erasing instruction: ");
lib/Target/PowerPC/PPCReduceCRLogicals.cpp 149 dbgs() << "Don't know how to handle blocks that don't have exactly"
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());
435 dbgs() << "CRLogicalOpMI: ";
437 dbgs() << "IsBinary: " << IsBinary << ", FeedsISEL: " << FeedsISEL;
438 dbgs() << ", FeedsBR: " << FeedsBR << ", FeedsLogical: ";
439 dbgs() << FeedsLogical << ", SingleUse: " << SingleUse;
440 dbgs() << ", DefsSingleUse: " << DefsSingleUse;
441 dbgs() << ", SubregDef1: " << SubregDef1 << ", SubregDef2: ";
442 dbgs() << SubregDef2 << ", ContainedInBlock: " << ContainedInBlock;
444 dbgs() << "\nDefs:\n";
449 dbgs() << "\n";
451 dbgs() << "CopyDef1: ";
455 dbgs() << "CopyDef2: ";
614 LLVM_DEBUG(dbgs() << "Unable to split as the two operands are the same\n");
621 dbgs() << "Unable to split because one of the operands is a PHI or "
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";);
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");
587 LLVM_DEBUG(dbgs() << "\n*** Forming webs for swap removal ***\n\n");
593 LLVM_DEBUG(dbgs() << "\n" << SwapVector[EntryIdx].VSEId << " ");
624 LLVM_DEBUG(dbgs() << format("Unioning %d with %d\n",
627 LLVM_DEBUG(dbgs() << " Def: ");
639 LLVM_DEBUG(dbgs() << "\n*** Rejecting webs for swap removal ***\n\n");
658 dbgs() << format("Web %d rejected for physreg, partial reg, or not "
661 LLVM_DEBUG(dbgs() << " in " << EntryIdx << ": ");
663 LLVM_DEBUG(dbgs() << "\n");
684 LLVM_DEBUG(dbgs() << format(
686 LLVM_DEBUG(dbgs() << " def " << EntryIdx << ": ");
688 LLVM_DEBUG(dbgs() << " use " << UseIdx << ": ");
690 LLVM_DEBUG(dbgs() << "\n");
708 LLVM_DEBUG(dbgs() << format(
710 LLVM_DEBUG(dbgs() << " def " << DefIdx << ": ");
712 LLVM_DEBUG(dbgs() << " use " << EntryIdx << ": ");
714 LLVM_DEBUG(dbgs() << "\n");
726 dbgs() << format(
728 LLVM_DEBUG(dbgs() << " def "
731 LLVM_DEBUG(dbgs() << " use " << UseIdx << ": ");
733 LLVM_DEBUG(dbgs() << "\n");
739 LLVM_DEBUG(dbgs() << "Swap vector after web analysis:\n\n");
750 LLVM_DEBUG(dbgs() << "\n*** Marking swaps for removal ***\n\n");
765 LLVM_DEBUG(dbgs() << "Marking swap fed by load for removal: ");
780 LLVM_DEBUG(dbgs() << "Marking swap feeding store for removal: ");
826 LLVM_DEBUG(dbgs() << "Changing splat: ");
850 LLVM_DEBUG(dbgs() << " Into: ");
864 LLVM_DEBUG(dbgs() << "Changing XXPERMDI: ");
883 LLVM_DEBUG(dbgs() << " Into: ");
894 LLVM_DEBUG(dbgs() << "Changing SUBREG_TO_REG: ");
902 LLVM_DEBUG(dbgs() << " Into: ");
942 LLVM_DEBUG(dbgs() << "\n*** Removing swaps ***\n\n");
955 LLVM_DEBUG(dbgs() << format("Replaced %d with copy: ",
975 dbgs() << format("%6d", ID);
976 dbgs() << format("%6d", EC->getLeaderValue(ID));
977 dbgs() << format(" %bb.%3d", MI->getParent()->getNumber());
978 dbgs() << format(" %14s ", TII->getName(MI->getOpcode()).str().c_str());
981 dbgs() << "load ";
983 dbgs() << "store ";
985 dbgs() << "swap ";
987 dbgs() << "physreg ";
989 dbgs() << "partialreg ";
992 dbgs() << "swappable ";
995 dbgs() << "special:**unknown**";
1000 dbgs() << "special:extract ";
1003 dbgs() << "special:insert ";
1006 dbgs() << "special:load ";
1009 dbgs() << "special:store ";
1012 dbgs() << "special:splat ";
1015 dbgs() << "special:xxpermdi ";
1018 dbgs() << "special:copywiden ";
1024 dbgs() << "rejected ";
1026 dbgs() << "remove ";
1028 dbgs() << "\n";
1035 dbgs() << "\n";
lib/Target/RISCV/Disassembler/RISCVDisassembler.cpp 332 LLVM_DEBUG(dbgs() << "Trying RISCV32 table :\n");
344 dbgs() << "Trying RISCV32Only_16 table (16-bit Instruction):\n");
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");
101 LLVM_DEBUG(dbgs() << "== "; Node->dump(CurDAG); dbgs() << "\n");
268 LLVM_DEBUG(dbgs() << "Folding add-immediate into mem-op:\nBase: ");
270 LLVM_DEBUG(dbgs() << "\nN: ");
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 209 dbgs() << "++ " << Msg;
210 dbgs() << ": ";
213 dbgs() << " <empty>\n";
215 dbgs() << "{ " << CurGroupDbg << " }";
216 dbgs() << " (" << CurrGroupSize << " decoder slot"
235 dbgs() << "++ | Resource counters: ";
238 dbgs() << SchedModel->getProcResource(i)->Name
240 dbgs() << "\n";
243 dbgs() << "++ | Critical resource: "
250 dbgs() << "++ | Current cycle index: "
254 dbgs() << "++ | Last FPd cycle index: " << LastFPdOpCycleIdx << "\n";
273 LLVM_DEBUG(dbgs() << "++ HazardRecognizer emitting "; dumpSU(SU, dbgs());
273 LLVM_DEBUG(dbgs() << "++ HazardRecognizer emitting "; dumpSU(SU, dbgs());
274 dbgs() << "\n";);
289 LLVM_DEBUG(dbgs() << "++ Clearing state after call.\n";);
312 dbgs() << "++ New critical resource: "
322 LLVM_DEBUG(dbgs() << "++ Last FPd cycle index: " << LastFPdOpCycleIdx
lib/Target/SystemZ/SystemZISelDAGToDAG.cpp 1906 LLVM_DEBUG(dbgs() << "SystemZ DAG preprocessing replacing:\nOld: ");
1908 LLVM_DEBUG(dbgs() << "\nNew: ");
1910 LLVM_DEBUG(dbgs() << "\n");
lib/Target/SystemZ/SystemZMachineScheduler.cpp 28 dbgs() << "{";
30 HazardRec.dumpSU(SU, dbgs());
32 dbgs() << ", ";
34 dbgs() << "}\n";
81 LLVM_DEBUG(dbgs() << "** Entering " << printMBBReference(*NextMBB));
89 if (Loop && Loop->getHeader() == MBB) dbgs() << " (Loop header)";
90 dbgs() << ":\n";);
100 LLVM_DEBUG(dbgs() << "** Continued scheduling from "
110 LLVM_DEBUG(dbgs() << "** Emitting incoming branch: "; I->dump(););
121 LLVM_DEBUG(dbgs() << "** Leaving " << printMBBReference(*MBB) << "\n";);
167 LLVM_DEBUG(dbgs() << "** Only one: ";
168 HazardRec->dumpSU(*Available.begin(), dbgs()); dbgs() << "\n";);
168 HazardRec->dumpSU(*Available.begin(), dbgs()); dbgs() << "\n";);
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();
188 dbgs() << " Height:" << c.SU->getHeight(); dbgs() << "\n";);
188 dbgs() << " Height:" << c.SU->getHeight(); dbgs() << "\n";);
242 LLVM_DEBUG(dbgs() << "** Scheduling SU(" << SU->NodeNum << ") ";
243 if (Available.size() == 1) dbgs() << "(only one) ";
244 Candidate c(SU, *HazardRec); c.dumpCosts(); dbgs() << "\n";);
lib/Target/SystemZ/SystemZMachineScheduler.h 64 dbgs() << " Grouping cost:" << GroupingCost;
66 dbgs() << " Resource cost:" << ResourcesCost;
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");
115 dbgs() << "could not derive a function prototype from usage: " +
lib/Target/WebAssembly/WebAssemblyArgumentMove.cpp 71 dbgs() << "********** Argument Move **********\n"
lib/Target/WebAssembly/WebAssemblyAsmPrinter.cpp 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"
174 LLVM_DUMP_METHOD void WebAssemblyException::dump() const { print(dbgs()); }
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"
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 "
179 dbgs() << "********** Memory Intrinsic Results **********\n"
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 134 dbgs() << "********** Peephole **********\n"
lib/Target/WebAssembly/WebAssemblyPrepareForLiveIntervals.cpp 75 dbgs() << "********** Prepare For LiveIntervals **********\n"
lib/Target/WebAssembly/WebAssemblyRegColoring.cpp 77 dbgs() << "********** Register Coloring **********\n"
99 LLVM_DEBUG(dbgs() << "Interesting register intervals:\n");
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 65 dbgs() << "********** Replace Physical Registers **********\n"
lib/Target/WebAssembly/WebAssemblySetP2AlignOperands.cpp 79 dbgs() << "********** Set p2align Operands **********\n"
lib/Target/X86/Disassembler/X86Disassembler.cpp 97 dbgs() << file << ":" << line << ": " << s;
lib/Target/X86/X86AvoidStoreForwardingBlocks.cpp 682 LLVM_DEBUG(dbgs() << "Start X86AvoidStoreForwardBlocks\n";);
719 LLVM_DEBUG(dbgs() << "Blocked load and store instructions: \n");
722 LLVM_DEBUG(dbgs() << "Replaced with:\n");
734 LLVM_DEBUG(dbgs() << "End X86AvoidStoreForwardBlocks\n";);
lib/Target/X86/X86AvoidTrailingCall.cpp 95 dbgs() << "inserting int3 after trailing call instruction:\n";
97 dbgs() << '\n';
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 353 dbgs() << "Registers: ";
357 dbgs() << ", ";
359 dbgs() << printReg(Reg, MRI->getTargetRegisterInfo(), 0, MRI);
361 dbgs() << "\n" << "Instructions:";
363 dbgs() << "\n ";
364 MI->print(dbgs());
366 dbgs() << "\n";
727 dbgs() << "***** Machine Function before Domain Reassignment *****\n");
728 LLVM_DEBUG(MF.print(dbgs()));
785 dbgs() << "***** Machine Function after Domain Reassignment *****\n");
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: ";);
567 LLVM_DEBUG(dbgs() << "FixLEA: Candidate to replace:"; MI.dump(););
568 LLVM_DEBUG(dbgs() << "FixLEA: Replaced by: ";);
lib/Target/X86/X86FlagsCopyLowering.cpp 338 LLVM_DEBUG(dbgs() << "********** " << getPassName() << " : " << MF.getName()
387 dbgs() << "ERROR: Encountered unexpected def of an eflags copy: ";
412 LLVM_DEBUG(dbgs() << "Rewriting copy: "; CopyI->dump());
493 dbgs() << " Using EFLAGS defined by: ";
496 dbgs() << " Using live-in flags for BB:\n";
568 LLVM_DEBUG(dbgs() << " Rewriting use: "; MI.dump());
662 dbgs()
668 dbgs() << "Use block:\n";
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 173 dbgs() << "Stack contents:";
175 dbgs() << " FP" << Stack[i];
443 LLVM_DEBUG(dbgs() << "\nFPInst:\t" << MI);
473 LLVM_DEBUG(dbgs() << "Register FP#" << Reg - X86::FP0 << " is dead!\n");
482 dbgs() << "Just deleted pseudo instruction\n";
488 dbgs() << "Inserted instructions:\n\t";
489 Start->print(dbgs());
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"
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");
1479 LLVM_DEBUG(dbgs() << "Emitting LD_F0 for implicit FP" << Reg << '\n');
1585 LLVM_DEBUG(dbgs() << "Asm uses " << NumSTUses << " fixed regs, pops "
1626 dbgs() << "Before asm: ";
1676 LLVM_DEBUG(dbgs() << "Inserting dummy KILL\n");
lib/Target/X86/X86ISelDAGToDAG.cpp 109 dbgs() << "X86ISelAddressMode " << this << '\n';
110 dbgs() << "Base_Reg ";
114 dbgs() << "nul\n";
116 dbgs() << " Base.FrameIndex " << Base_FrameIndex << '\n';
117 dbgs() << " Scale " << Scale << '\n'
120 dbgs() << "negate ";
124 dbgs() << "nul\n";
125 dbgs() << " Disp " << Disp << '\n'
130 dbgs() << "nul";
131 dbgs() << " CP ";
135 dbgs() << "nul";
136 dbgs() << '\n'
139 dbgs() << ES;
141 dbgs() << "nul";
142 dbgs() << " MCSym ";
144 dbgs() << MCSym;
146 dbgs() << "nul";
147 dbgs() << " JT" << JT << " Align" << Align << '\n';
1849 dbgs() << "MatchAddress: ";
4355 LLVM_DEBUG(dbgs() << "== "; Node->dump(CurDAG); dbgs() << '\n');
4355 LLVM_DEBUG(dbgs() << "== "; Node->dump(CurDAG); dbgs() << '\n');
4776 LLVM_DEBUG(dbgs() << "=> "; ResLo.getNode()->dump(CurDAG);
4777 dbgs() << '\n');
4786 LLVM_DEBUG(dbgs() << "=> "; ResHi.getNode()->dump(CurDAG);
4787 dbgs() << '\n');
4946 LLVM_DEBUG(dbgs() << "=> "; Result.getNode()->dump(CurDAG);
4947 dbgs() << '\n');
4955 LLVM_DEBUG(dbgs() << "=> "; Result.getNode()->dump(CurDAG);
4956 dbgs() << '\n');
4964 LLVM_DEBUG(dbgs() << "=> "; Result.getNode()->dump(CurDAG);
4965 dbgs() << '\n');
lib/Target/X86/X86ISelLowering.cpp27824 dbgs() << "ReplaceNodeResults: ";
lib/Target/X86/X86InstrInfo.cpp 3044 LLVM_DEBUG(dbgs() << "Cannot copy " << RI.getName(SrcReg) << " to "
4651 dbgs() << "WARNING: Unable to update register constraint for operand "
4653 NewMI.dump(); dbgs() << "\n");
4995 dbgs() << "We failed to fuse operand " << OpNum << " in " << MI;
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()));
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();
555 dbgs() << "\n"; MF.verify(this));
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();
768 dbgs() << "\n");
867 dbgs() << "ERROR: Found an unexpected loading branch or call "
869 MI.dump(); dbgs() << "\n");
905 LLVM_DEBUG(dbgs()
907 MI.dump(); dbgs() << "\n");
925 dbgs() << "Unfolded load successfully into:\n";
928 dbgs() << "\n";
1027 dbgs() << "ERROR: Found other terminators in a block with an indirect "
1031 dbgs() << '\n';
1092 dbgs() << "ERROR: Found conditional entry to target of indirect "
1114 LLVM_DEBUG(dbgs() << " Inserting mov: "; AddrI->dump();
1115 dbgs() << "\n");
1126 LLVM_DEBUG(dbgs() << " Inserting lea: "; AddrI->dump();
1127 dbgs() << "\n");
1153 LLVM_DEBUG(dbgs() << " Inserting cmp: "; CheckI->dump(); dbgs() << "\n");
1153 LLVM_DEBUG(dbgs() << " Inserting cmp: "; CheckI->dump(); dbgs() << "\n");
1166 LLVM_DEBUG(dbgs() << " Inserting lea: "; AddrI->dump(); dbgs() << "\n");
1166 LLVM_DEBUG(dbgs() << " Inserting lea: "; AddrI->dump(); dbgs() << "\n");
1172 LLVM_DEBUG(dbgs() << " Inserting cmp: "; CheckI->dump(); dbgs() << "\n");
1172 LLVM_DEBUG(dbgs() << " Inserting cmp: "; CheckI->dump(); dbgs() << "\n");
1186 LLVM_DEBUG(dbgs() << " Inserting cmov: "; CMovI->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: ";
1351 MI.dump(); dbgs() << "\n");
1519 LLVM_DEBUG(dbgs() << " Unable to harden post-load due to EFLAGS: ";
1520 MI.dump(); dbgs() << "\n");
1704 LLVM_DEBUG(dbgs()
1962 dbgs() << " Skipping hardening base of explicit stack frame load: ";
1963 MI.dump(); dbgs() << "\n");
1971 dbgs() << " Cannot harden base of explicit RSP offset in a load!");
1983 dbgs() << " Cannot harden base of "
2054 LLVM_DEBUG(dbgs() << " Inserting mov: "; MovI->dump(); dbgs() << "\n");
2054 LLVM_DEBUG(dbgs() << " Inserting mov: "; MovI->dump(); dbgs() << "\n");
2065 LLVM_DEBUG(dbgs() << " Inserting broadcast: "; BroadcastI->dump();
2066 dbgs() << "\n");
2076 LLVM_DEBUG(dbgs() << " Inserting or: "; OrI->dump(); dbgs() << "\n");
2076 LLVM_DEBUG(dbgs() << " Inserting or: "; OrI->dump(); dbgs() << "\n");
2096 LLVM_DEBUG(dbgs() << " Inserting broadcast: "; BroadcastI->dump();
2097 dbgs() << "\n");
2107 LLVM_DEBUG(dbgs() << " Inserting or: "; OrI->dump(); dbgs() << "\n");
2107 LLVM_DEBUG(dbgs() << " Inserting or: "; OrI->dump(); dbgs() << "\n");
2120 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();
2131 dbgs() << "\n");
2313 LLVM_DEBUG(dbgs() << " Inserting or: "; OrI->dump(); dbgs() << "\n");
2313 LLVM_DEBUG(dbgs() << " Inserting or: "; OrI->dump(); dbgs() << "\n");
2567 LLVM_DEBUG(dbgs() << " Inserting cmov: "; CMovI->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/Transforms/AggressiveInstCombine/AggressiveInstCombine.cpp 305 LLVM_DEBUG(dbgs() << "Recognized popcount intrinsic\n");
lib/Transforms/AggressiveInstCombine/TruncInstCombine.cpp 408 dbgs() << "ICE: TruncInstCombine reducing type of expression dag "
lib/Transforms/Coroutines/CoroFrame.cpp 110 LLVM_DEBUG(dbgs() << UseBB->getName() << " => " << DefBB->getName()
160 dbgs() << Label << ":";
163 dbgs() << " " << Mapping.indexToBlock(I)->getName();
164 dbgs() << "\n";
170 dbgs() << B->getName() << ":\n";
174 dbgs() << "\n";
219 LLVM_DEBUG(dbgs() << "iteration " << ++Iteration);
220 LLVM_DEBUG(dbgs() << "==============\n");
264 LLVM_DEBUG(dbgs() << "\nblock " << I << " follower " << SI->getName()
270 LLVM_DEBUG(dbgs() << "\nblock " << I << " follower " << SI << "\n");
323 dbgs() << "------------- " << Title << "--------------\n";
330 dbgs() << " user: ";
535 dbgs() << "AllocaInst copy was triggered by instruction: "
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
1100 dbgs() << "[AAReturnedValues] 1 Add new returned value " << Val
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
1991 dbgs() << "[Attributor][AANoAliasCSArg] " << V
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
3471 dbgs() << "[Attributor][ValueSimplify] Can't be stripped more : "
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
4266 dbgs()
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
4473 dbgs() << "[Attributor] Run all AAs to recompute dependences\n");
4487 LLVM_DEBUG(dbgs() << "[Attributor] #Iteration: " << IterationCounter
4518 LLVM_DEBUG(dbgs() << "\n[Attributor] Fixpoint iteration done after: "
4548 dbgs() << "\n[Attributor] Finalized " << Visited.size()
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()
545 dbgs() << "DeadArgumentEliminationPass - Inspecting callers for fn: "
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 "
808 dbgs() << "DeadArgumentEliminationPass - Removing return value "
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");
289 dbgs() << "Ref ignored! Target already in destination module.\n");
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");
411 dbgs() << "ignored! Target was already imported with Threshold "
423 dbgs() << "ignored! Target was already rejected with Threshold "
457 dbgs() << "ignored! No qualifying callee with summary found.\n");
543 LLVM_DEBUG(dbgs() << "Ignores Dead GUID: " << VI << "\n");
551 LLVM_DEBUG(dbgs() << "Initialize import for " << VI << "\n");
571 dbgs() << "Missed imports into module " << ModName << "\n";
583 dbgs() << FailureInfo->VI
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()
1184 dbgs() << DestModule.getSourceFileName() << ": Import " << GV->getName()
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");
272 dbgs() << "VFE safe vtables:\n";
274 dbgs() << " " << VTable->getName() << "\n";
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");
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);
571 dbgs() << "Found a cold block:\n";
586 LLVM_DEBUG(dbgs() << "Entire function is cold\n");
619 dbgs() << "Hot/cold splitting attempting to outline these blocks:\n";
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 1117 dbgs() << MDS->getString() << ": ";
1119 dbgs() << "<unnamed>: ";
1120 BSI.print(dbgs());
lib/Transforms/IPO/MergeFunctions.cpp 316 dbgs() << "MERGEFUNC-SANITY: Started for first " << Max << " functions.\n";
332 dbgs() << "MERGEFUNC-SANITY: Non-symmetric; triple: " << TripleNumber
334 dbgs() << *F1 << '\n' << *F2 << '\n';
365 dbgs() << "MERGEFUNC-SANITY: Non-transitive; triple: "
367 dbgs() << "Res1, Res3, Res4: " << Res1 << ", " << Res3 << ", "
369 dbgs() << *F1 << '\n' << *F2 << '\n' << *F3 << '\n';
376 dbgs() << "MERGEFUNC-SANITY: " << (Valid ? "Passed." : "Failed.") << "\n";
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');
513 dbgs() << " Erasing instructions (in reverse order of appearance in "
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");
634 dbgs()
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 "
690 dbgs() << "writeThunk: (MergeFunctionsPDI) filter parameter related "
733 dbgs() << "writeThunk: (MergeFunctionsPDI) No DISubprogram for "
739 dbgs() << "} // End of parameter related debug info filtering for: "
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/PartialInlining.cpp 456 dbgs() << "OverallFunctionCost = " << OverallFunctionCost << "\n";
495 dbgs() << "Found cold edge: " << thisBB->getName() << "->"
515 dbgs() << "OutlineRegionCost = " << OutlineRegionCost << "\n";
541 dbgs() << "Found Cold Candidate starting at block: "
1142 dbgs() << "inputs: " << Inputs.size() << "\n";
1143 dbgs() << "outputs: " << Outputs.size() << "\n";
1145 dbgs() << "value used in func: " << *value << "\n";
1147 dbgs() << "instr used in func: " << *output << "\n";
1287 dbgs() << "HotCountThreshold = " << PSI->getHotCountThreshold() << "\n";
1288 dbgs() << "ColdCountThreshold = " << PSI->getColdCountThreshold()
1297 dbgs() << ">>>>>> Outlined (Cloned) Function >>>>>>\n";
1298 Cloner.ClonedFunc->print(dbgs());
1299 dbgs() << "<<<<<< Outlined (Cloned) Function <<<<<<\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));
1123 dbgs() << "\nAssign the same weight to all blocks in the same class\n");
1129 LLVM_DEBUG(printBlockWeight(dbgs(), BB));
1170 LLVM_DEBUG(dbgs() << "\nPropagation through edges\n");
1242 LLVM_DEBUG(dbgs() << "All edge weights for " << BB->getName()
1244 printBlockWeight(dbgs(), BB););
1271 LLVM_DEBUG(dbgs() << "Set weight for edge: ";
1272 printEdgeWeight(dbgs(), UnknownEdge));
1298 LLVM_DEBUG(dbgs() << "Set self-referential edge weight to: ";
1299 printEdgeWeight(dbgs(), SelfReferentialEdge));
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));
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/IPO/ThinLTOBitcodeWriter.cpp 498 WriteThinLTOBitcode() : ModulePass(ID), OS(dbgs()), ThinLinkOS(nullptr) {
lib/Transforms/InstCombine/InstCombineCalls.cpp 4307 LLVM_DEBUG(dbgs() << "Removing convergent attr from instr " << Call
lib/Transforms/InstCombine/InstCombineCasts.cpp 701 dbgs() << "ICE: EvaluateInDifferentType converting expression type"
1110 dbgs() << "ICE: EvaluateInDifferentType converting expression type"
1382 dbgs() << "ICE: EvaluateInDifferentType converting expression type"
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';
1026 for (unsigned i = 1, e = PHIsToSlice.size(); i != e; ++i) dbgs()
1108 LLVM_DEBUG(dbgs() << " Made element PHI for offset " << Offset << ": "
lib/Transforms/InstCombine/InstCombineShifts.cpp 615 dbgs() << "ICE: GetShiftedValue propagating shift through expression"
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');
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/ControlHeightReduction.cpp 461 CHR_DEBUG(dbgs() << "CHR IR dump " << Label << " " << ModuleName << " "
464 CHR_DEBUG(dbgs() << " " << *Stats);
465 CHR_DEBUG(dbgs() << "\n");
592 CHR_DEBUG(dbgs() << "checkHoistValue " << *I << "\n");
680 CHR_DEBUG(dbgs() << "BI " << *BI << " ");
681 CHR_DEBUG(dbgs() << "ThenProb " << ThenProb << " ");
682 CHR_DEBUG(dbgs() << "ElseProb " << ElseProb << "\n");
699 CHR_DEBUG(dbgs() << "SI " << *SI << " ");
700 CHR_DEBUG(dbgs() << "TrueProb " << TrueProb << " ");
701 CHR_DEBUG(dbgs() << "FalseProb " << FalseProb << "\n");
754 CHR_DEBUG(dbgs() << "Entry " << Entry->getName() << "\n");
756 CHR_DEBUG(dbgs() << "Entry null\n");
758 CHR_DEBUG(dbgs() << "Exit " << Exit->getName() << "\n");
760 CHR_DEBUG(dbgs() << "Exit null\n");
777 CHR_DEBUG(dbgs() << "BI.isConditional " << BI->isConditional() << "\n");
779 CHR_DEBUG(dbgs() << "BI null\n");
783 CHR_DEBUG(dbgs() << "S0 " << S0->getName() << "\n");
784 CHR_DEBUG(dbgs() << "S1 " << S1->getName() << "\n");
792 CHR_DEBUG(dbgs() << "Found a region with a branch\n");
847 CHR_DEBUG(dbgs() << "Found a select-only region\n");
853 CHR_DEBUG(dbgs() << "Found select(s) in a region with a branch\n");
896 CHR_DEBUG(dbgs() << "InsertPoint " << *InsertPoint << "\n");
916 CHR_DEBUG(dbgs() << "Dropping select " << *SI << "\n");
931 CHR_DEBUG(dbgs() << "InsertPoint " << *InsertPoint << "\n");
941 CHR_DEBUG(dbgs() << "Dropping selects in entry block \n");
944 dbgs() << "SI " << *SI << "\n";
961 CHR_DEBUG(dbgs() << "InsertPoint " << *InsertPoint << "\n");
979 CHR_DEBUG(dbgs() << "Result\n");
981 CHR_DEBUG(dbgs() << "BI " << *Branch << "\n");
984 CHR_DEBUG(dbgs() << "SI " << *SI << "\n");
993 CHR_DEBUG(dbgs() << "findScopes " << R->getNameStr() << "\n");
1002 CHR_DEBUG(dbgs() << "Looking at subregion " << SubR.get()->getNameStr()
1006 CHR_DEBUG(dbgs() << "Subregion Scope " << *SubCHRScope << "\n");
1008 CHR_DEBUG(dbgs() << "Subregion Scope null\n");
1065 dbgs() << "shouldSplit " << *InsertPoint << " PrevConditionValues ";
1067 dbgs() << *V << ", ";
1069 dbgs() << " ConditionValues ";
1071 dbgs() << *V << ", ";
1073 dbgs() << "\n");
1079 CHR_DEBUG(dbgs() << "Split. checkHoistValue false " << *V << "\n");
1099 dbgs() << "PrevBases ";
1101 dbgs() << *V << ", ";
1103 dbgs() << " Bases ";
1105 dbgs() << *V << ", ";
1107 dbgs() << "\n");
1114 CHR_DEBUG(dbgs() << "Split. Intersection empty\n");
1118 CHR_DEBUG(dbgs() << "No split\n");
1170 dbgs() << "ConditionValues ";
1172 dbgs() << *V << ", ";
1174 dbgs() << "\n");
1178 CHR_DEBUG(dbgs() << "Outer " << *Outer << "\n");
1179 CHR_DEBUG(dbgs() << "Should split from outer at "
1202 CHR_DEBUG(dbgs() << "Outer null\n");
1207 CHR_DEBUG(dbgs() << "Should split from prev at "
1264 CHR_DEBUG(dbgs() << "BranchInsertPoint " << *SplitsInsertPoints[I]
1282 dbgs() << "classifyBiasedScopes " << *Scope << "\n";
1283 dbgs() << "TrueBiasedRegions ";
1285 dbgs() << R->getNameStr() << ", ";
1287 dbgs() << "\n";
1288 dbgs() << "FalseBiasedRegions ";
1290 dbgs() << R->getNameStr() << ", ";
1292 dbgs() << "\n";
1293 dbgs() << "TrueBiasedSelects ";
1295 dbgs() << *SI << ", ";
1297 dbgs() << "\n";
1298 dbgs() << "FalseBiasedSelects ";
1300 dbgs() << *SI << ", ";
1302 dbgs() << "\n";);
1344 CHR_DEBUG(dbgs() << "Filtered out by biased branches truthy-regions "
1372 dbgs() << "setCHRRegions HoistStopMap " << *Scope << "\n";
1375 dbgs() << "Region " << R->getNameStr() << "\n";
1377 dbgs() << "HoistStop " << *I << "\n";
1380 dbgs() << "CHRRegions" << "\n";
1382 dbgs() << RI.R->getNameStr() << "\n";
1491 CHR_DEBUG(dbgs() << "hoistValue " << *I << "\n");
1585 dbgs() << "Inserting redudant phis\n";
1587 dbgs() << "BlockInScope " << BB->getName() << "\n";
1597 CHR_DEBUG(dbgs() << "V " << I << "\n");
1598 CHR_DEBUG(dbgs() << "Used outside scope by user " << *UI << "\n");
1603 CHR_DEBUG(dbgs() << "V " << I << "\n");
1604 CHR_DEBUG(dbgs()
1623 CHR_DEBUG(dbgs() << "Insert phi " << *PN << "\n");
1630 CHR_DEBUG(dbgs() << "Updated user " << *UI << "\n");
1662 CHR_DEBUG(dbgs() << "Biased regions condition values \n");
1670 CHR_DEBUG(dbgs() << *V << "\n");
1684 CHR_DEBUG(dbgs() << *V << "\n");
1696 CHR_DEBUG(dbgs() << "transformScopes " << *Scope << "\n");
1722 CHR_DEBUG(dbgs() << "Splitting entry block " << EntryBlock->getName()
1876 CHR_DEBUG(dbgs() << "CHR branch bias " << Weights[0] << ":" << Weights[1]
1908 CHR_DEBUG(dbgs() << "IfThen " << IfThen->getName()
1991 dbgs() << Label << " " << Scopes.size() << "\n";
1993 dbgs() << *Scope << "\n";
2006 dbgs() << "RegionInfo:\n";
2007 RI.print(dbgs()));
2027 CHR_DEBUG(dbgs() << "Set per-scope bias " << SplitScopes.size() << "\n");
2048 dbgs() << "RegionInfo:\n";
2049 RI.print(dbgs()));
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()));
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 562 MST.dumpEdges(dbgs(), Twine("Dump Function ") + FuncName + " Hash: " +
638 LLVM_DEBUG(dbgs() << "Function Hash Computation for " << F.getName() << ":\n"
783 dbgs() << "Fail to split critical edge: not instrument this edge.\n");
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");
1197 dbgs() << "Inconsistent number of counts, skipping this function");
1259 LLVM_DEBUG(dbgs() << "Populate counts in " << NumPasses << " passes.\n");
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: ");
1602 dbgs() << "pgo-view-counts: " << Func.getFunc().getName() << "\n";
1603 NewBFI->print(dbgs());
1615 dbgs() << "pgo-view-raw-counts: " << Func.getFunc().getName() << "\n";
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
1708 dbgs() << W << " ";
1709 } dbgs() << "\n";);
lib/Transforms/Instrumentation/PGOMemOPSizeOpt.cpp 156 LLVM_DEBUG(dbgs() << "MemOP call: "
252 LLVM_DEBUG(dbgs() << "Read one memory intrinsic profile with count "
256 : VDs) { dbgs() << " (" << VD.Value << "," << VD.Count << ")\n"; });
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 139 dbgs() << "Transforming objc_retain => "
149 LLVM_DEBUG(dbgs() << "New: " << *Retain << "\n");
188 LLVM_DEBUG(dbgs() << " Fusing retain/autorelease!\n"
200 LLVM_DEBUG(dbgs() << " New RetainAutorelease: " << *Retain << "\n");
407 llvm::dbgs() << " Contracting retain, release into objc_storeStrong.\n"
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");
703 dbgs() << "Transforming objc_autoreleaseReturnValue => "
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");
809 dbgs() << "A null pointer-to-weak-pointer is undefined behavior."
831 dbgs() << "A null pointer-to-weak-pointer is undefined behavior."
869 dbgs() << "Replacing autorelease{,RV}(x) with objc_release(x) "
884 dbgs() << "Adding tail keyword to function since it can never be "
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");
188 dbgs() << " Found nested releases (i.e. a release pair)\n");
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');
468 dbgs() << "new live blocks:\n";
470 dbgs() << "\t" << BB->getName() << '\n';
471 dbgs() << "dead terminator blocks:\n";
473 dbgs() << "\t" << BB->getName() << '\n';
495 LLVM_DEBUG(dbgs() << "live control in: " << BB->getName() << '\n');
526 dbgs() << "Dropping debug info for " << *DII << "\n";
564 dbgs() << "final dead terminator blocks: " << '\n';
566 dbgs() << '\t' << BB->getName()
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()
384 else dbgs() << "Collect constant " << *ConstInt
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 ["
688 dbgs() << "DSE: Dead Store to soon to be freed memory:\n DEAD: "
799 LLVM_DEBUG(dbgs() << "DSE: Dead Store at End of Block:\n DEAD: "
805 dbgs() << **I;
807 dbgs() << ", ";
808 } dbgs()
822 LLVM_DEBUG(dbgs() << "DSE: Removing trivially dead instruction:\n DEAD: "
934 LLVM_DEBUG(dbgs() << "DSE: Remove Dead Store:\n OW "
1044 dbgs() << "DSE: Remove Store Of Load from same pointer:\n LOAD: "
1062 dbgs() << "DSE: Remove null store to the calloc'ed object:\n DEAD: "
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");
418 dbgs() << "F2I: Value requires more than 64 bits to represent!\n");
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";);
917 dbgs() << "GVN: load "; LI->printAsOperand(dbgs());
917 dbgs() << "GVN: load "; LI->printAsOperand(dbgs());
918 dbgs() << " is clobbered by " << *DepInst << '\n';);
974 dbgs() << "GVN: load "; LI->printAsOperand(dbgs());
974 dbgs() << "GVN: load "; LI->printAsOperand(dbgs());
975 dbgs() << " has unknown def " << *DepInst << '\n';);
1098 dbgs() << "COULD NOT PRE LOAD BECAUSE OF AN EH PAD PREDECESSOR '"
1110 dbgs() << "COULD NOT PRE LOAD BECAUSE OF INDBR CRITICAL EDGE '"
1118 dbgs() << "COULD NOT PRE LOAD BECAUSE OF CALLBR CRITICAL EDGE '"
1125 dbgs() << "COULD NOT PRE LOAD BECAUSE OF AN EH PAD CRITICAL EDGE '"
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());
1331 LLVM_DEBUG(dbgs() << "GVN: non-local load "; LI->printAsOperand(dbgs());
1332 dbgs() << " has unknown dependencies\n";);
1361 LLVM_DEBUG(dbgs() << "GVN REMOVING NONLOCAL LOAD: " << *LI << '\n');
1490 LLVM_DEBUG(dbgs() << "Replacing dominated uses of "
1541 dbgs() << "GVN: load "; L->printAsOperand(dbgs());
1541 dbgs() << "GVN: load "; L->printAsOperand(dbgs());
1542 dbgs() << " has unknown dependence\n";);
1762 LLVM_DEBUG(dbgs() << "GVN replacing: " << *Operand << " with "
2114 LLVM_DEBUG(dbgs() << "GVN iteration: " << Iteration << "\n");
2177 LLVM_DEBUG(dbgs() << "GVN removed: " << *I << '\n');
2407 LLVM_DEBUG(dbgs() << "GVN PRE removed: " << *CurInst << '\n');
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 91 print(dbgs());
92 dbgs() << "\n";
564 LLVM_DEBUG(dbgs() << "GVNSink: running on function @" << F.getName()
633 LLVM_DEBUG(dbgs() << " -- Analyzing instruction set: [\n"; for (auto *I
636 } dbgs() << " ]\n";);
641 LLVM_DEBUG(dbgs() << " VN=" << Twine::utohexstr(N) << " for" << *I << "\n");
762 LLVM_DEBUG(dbgs() << "GVNSink: running on basic block ";
763 BBEnd->printAsOperand(dbgs()); dbgs() << "\n");
763 BBEnd->printAsOperand(dbgs()); dbgs() << "\n");
804 LLVM_DEBUG(dbgs() << " -- Sinking candidates:\n"; for (auto &C
805 : Candidates) dbgs()
813 LLVM_DEBUG(dbgs() << " -- Sinking: " << C << "\n");
816 LLVM_DEBUG(dbgs() << " -- Splitting edge to ";
817 BBEnd->printAsOperand(dbgs()); dbgs() << "\n");
817 BBEnd->printAsOperand(dbgs()); dbgs() << "\n");
820 LLVM_DEBUG(dbgs() << " -- FAILED to split edge!\n");
lib/Transforms/Scalar/GuardWidening.cpp 237 print(dbgs());
238 dbgs() << "\n";
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 177 print(dbgs());
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: "
1870 dbgs() << "irce: in function ";
1871 dbgs() << L->getHeader()->getParent()->getName() << ": ";
1872 dbgs() << "constrained ";
1873 L->print(dbgs());
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 318 dbgs() << "LVI for function '" << F.getName() << "':\n";
319 LVI->printLVI(F, *DT, dbgs());
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;
1609 dbgs() << " BB '" << BB->getName()
1931 LLVM_DEBUG(dbgs() << " Not threading across BB '" << BB->getName()
1942 dbgs() << " Not threading across "
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 145 dbgs()
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: ");
258 LLVM_DEBUG(dbgs() << "Analyzing Loop for deletion: ");
lib/Transforms/Scalar/LoopDistribute.cpp 241 dbgs() << " (cycle)\n";
244 dbgs() << " " << I->getParent()->getName() << ":" << *I << "\n";
249 dbgs() << *BB;
376 LLVM_DEBUG(dbgs()
545 void dump() const { print(dbgs()); }
558 dbgs() << "\nPartition " << Index++ << " (" << &P << "):\n";
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");
864 LLVM_DEBUG(dbgs() << "Skipping; " << Message << "\n");
lib/Transforms/Scalar/LoopFuse.cpp 268 dbgs() << "\tGuardBranch: "
289 LLVM_DEBUG(dbgs() << "FC has invalid CFG requirements!\n");
308 LLVM_DEBUG(dbgs() << "Loop " << L->getName()
314 LLVM_DEBUG(dbgs() << "Loop " << L->getName()
421 dbgs() << "Fusion Candidates: \n";
423 dbgs() << "*** Fusion Candidate Set ***\n";
424 dbgs() << CandidateSet;
425 dbgs() << "****************************\n";
491 dbgs() << "****************************\n";
493 printLoop(*L, dbgs());
494 dbgs() << "****************************\n";
526 LI.print(dbgs());
530 LLVM_DEBUG(dbgs() << "Performing Loop Fusion on function " << F.getName()
535 LLVM_DEBUG(dbgs() << "Got " << LDT.size() << " loop sets for depth "
548 dbgs() << " Visit loop set (#" << LV.size() << "):\n";
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 << " & "
704 LLVM_DEBUG(dbgs() << "Attempting fusion on Candidate Set:\n"
715 LLVM_DEBUG(dbgs() << "Attempting to fuse candidate \n"; FC0->dump();
716 dbgs() << " with\n"; FC1->dump(); dbgs() << "\n");
716 dbgs() << " with\n"; FC1->dump(); dbgs() << "\n");
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());
950 LLVM_DEBUG(dbgs() << "DA res: "; DepResult->dump(dbgs());
951 dbgs() << " [#l: " << DepResult->getLevels() << "][Ordered: "
954 LLVM_DEBUG(dbgs() << "DepResult Levels: " << DepResult->getLevels()
961 dbgs() << "TODO: Implement pred/succ dependence handling!\n");
980 LLVM_DEBUG(dbgs() << "Check if " << FC0 << " can be fused with " << FC1
1149 LLVM_DEBUG(dbgs() << "Fusion Candidate 0: \n"; FC0.dump();
1150 dbgs() << "Fusion Candidate 1: \n"; FC1.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()
2023 dbgs() << "Loop contains instruction with potential side-effects: "
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()
129 dbgs() << "Found " << 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 "
707 dbgs()
748 dbgs() << "Loops where the latch is not the exiting block are not"
764 dbgs() << "Only outer loops with induction or reduction PHI nodes "
778 LLVM_DEBUG(dbgs() << "Loops with more than 1 induction variables are not "
793 dbgs() << "Only inner loops with induction or reduction PHI nodes "
808 dbgs() << "We currently only support loops with 1 induction variable."
823 LLVM_DEBUG(dbgs() << "Loop structure not understood by pass\n");
837 dbgs() << "Can only handle LCSSA PHIs in inner loops currently.\n");
868 dbgs() << "Did not find an instruction to increment the induction "
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
983 dbgs() << "Loops with call instructions cannot be interchanged "
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 294 dbgs() << "Removing from candidates: \n"
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);
512 dbgs()
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 "
550 dbgs() << "Versioning is needed but not allowed when optimizing "
556 LLVM_DEBUG(dbgs() << "Loop is not is loop-simplify form");
lib/Transforms/Scalar/LoopPassManager.cpp 30 dbgs() << "Starting Loop pass manager run.\n";
37 dbgs() << "Running pass: " << Pass->name() << " on " << L;
90 dbgs() << "Finished Loop pass manager run.\n";
96 PrintLoopPass::PrintLoopPass() : OS(dbgs()) {}
lib/Transforms/Scalar/LoopPredication.cpp 244 dbgs() << "LoopICmp Pred = " << Pred << ", IV = " << *IV
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");
675 LLVM_DEBUG(dbgs() << "Failed to parse the loop latch condition!\n");
678 LLVM_DEBUG(dbgs() << "Guard check:\n");
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");
802 LLVM_DEBUG(dbgs() << "Widened checks = " << NumWidened << "\n");
809 LLVM_DEBUG(dbgs() << "Processing guard:\n");
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
933 dbgs()
936 LLVM_DEBUG(dbgs() << "The value is set to 1.0\n");
959 LLVM_DEBUG(dbgs() << "Analyzing ");
986 LLVM_DEBUG(dbgs() << "Latch check:\n");
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");
989 dbgs()
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");
1197 dbgs() << "LRR: Aborting - instruction is not used in 1 iteration: "
1205 dbgs() << "LRR: " << KV.second.find_first() << "\t" << *KV.first << "\n";
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 158 dbgs() << "Constant terminator folding for loop " << L << "\n";
159 dbgs() << "After terminator constant-folding, the loop will";
161 dbgs() << " not";
162 dbgs() << " be destroyed\n";
165 dbgs() << Message << "\n";
167 dbgs() << "\t" << BB->getName() << "\n";
171 dbgs() << Message << "\n";
173 dbgs() << "\t" << BB->getName() << "\n";
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");
549 dbgs() << "No constant terminator folding candidates found in loop "
557 dbgs()
568 dbgs() << "Give up constant terminator folding in loop "
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";
2844 : Users) { dbgs() << " " << *Inst << "\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 << ':';
4132 : Imms) dbgs()
4134 dbgs() << '\n');
4146 LLVM_DEBUG(dbgs() << "Skipping cross-use reuse for " << *OrigReg
4302 LLVM_DEBUG(dbgs() << "\n"
4304 print_uses(dbgs()));
4326 LLVM_DEBUG(dbgs() << "Filtering for use "; LU.print(dbgs());
4326 LLVM_DEBUG(dbgs() << "Filtering for use "; LU.print(dbgs());
4327 dbgs() << '\n');
4351 LLVM_DEBUG(dbgs() << " Filtering loser "; F.print(dbgs());
4351 LLVM_DEBUG(dbgs() << " Filtering loser "; F.print(dbgs());
4352 dbgs() << "\n");
4379 LLVM_DEBUG(dbgs() << " Filtering out formula "; F.print(dbgs());
4379 LLVM_DEBUG(dbgs() << " Filtering out formula "; F.print(dbgs());
4380 dbgs() << "\n"
4382 Best.print(dbgs()); dbgs() << '\n');
4382 Best.print(dbgs()); dbgs() << '\n');
4402 dbgs() << "\n"
4404 print_uses(dbgs());
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());
4455 LLVM_DEBUG(dbgs() << " Deleting "; F.print(dbgs());
4456 dbgs() << '\n');
4471 LLVM_DEBUG(dbgs() << " Deleting "; F.print(dbgs());
4471 LLVM_DEBUG(dbgs() << " Deleting "; F.print(dbgs());
4472 dbgs() << '\n');
4487 LLVM_DEBUG(dbgs() << "After pre-selection:\n"; print_uses(dbgs()));
4487 LLVM_DEBUG(dbgs() << "After pre-selection:\n"; print_uses(dbgs()));
4498 dbgs() << "The search space is too complex.\n"
4518 LLVM_DEBUG(dbgs() << " Deleting use "; LU.print(dbgs()); dbgs() << '\n');
4518 LLVM_DEBUG(dbgs() << " Deleting use "; LU.print(dbgs()); dbgs() << '\n');
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');
4535 LLVM_DEBUG(dbgs() << " Deleting "; F.print(dbgs()); dbgs() << '\n');
4535 LLVM_DEBUG(dbgs() << " Deleting "; F.print(dbgs()); dbgs() << '\n');
4554 LLVM_DEBUG(dbgs() << "After pre-selection:\n"; print_uses(dbgs()));
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()));
4569 LLVM_DEBUG(dbgs() << "After pre-selection:\n"; print_uses(dbgs()));
4587 dbgs() << "The search space is too complex.\n"
4603 LLVM_DEBUG(dbgs() << "Filtering for use "; LU.print(dbgs());
4603 LLVM_DEBUG(dbgs() << "Filtering for use "; LU.print(dbgs());
4604 dbgs() << '\n');
4649 LLVM_DEBUG(dbgs() << " Filtering out formula "; F.print(dbgs());
4649 LLVM_DEBUG(dbgs() << " Filtering out formula "; F.print(dbgs());
4650 dbgs() << "\n"
4652 Best.print(dbgs()); dbgs() << '\n');
4652 Best.print(dbgs()); dbgs() << '\n');
4669 dbgs() << "\n"
4671 print_uses(dbgs());
4727 LLVM_DEBUG(dbgs() << "The search space is too complex.\n");
4748 dbgs() << "Narrowing the search space by deleting costly formulas\n");
4790 LLVM_DEBUG(dbgs() << " The formula "; LU.Formulae[MinIdx].print(dbgs());
4790 LLVM_DEBUG(dbgs() << " The formula "; LU.Formulae[MinIdx].print(dbgs());
4791 dbgs() << " with min reg num " << FMinRegNum << '\n');
4795 LLVM_DEBUG(dbgs() << " Deleting "; LU.Formulae.back().print(dbgs());
4795 LLVM_DEBUG(dbgs() << " Deleting "; LU.Formulae.back().print(dbgs());
4796 dbgs() << '\n');
4802 LLVM_DEBUG(dbgs() << " Leaving only "; F.print(dbgs()); dbgs() << '\n');
4802 LLVM_DEBUG(dbgs() << " Leaving only "; F.print(dbgs()); dbgs() << '\n');
4802 LLVM_DEBUG(dbgs() << " Leaving only "; F.print(dbgs()); dbgs() << '\n');
4808 LLVM_DEBUG(dbgs() << "After pre-selection:\n"; print_uses(dbgs()));
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');
4857 LLVM_DEBUG(dbgs() << " Deleting "; F.print(dbgs()); dbgs() << '\n');
4857 LLVM_DEBUG(dbgs() << " Deleting "; F.print(dbgs()); dbgs() << '\n');
4871 LLVM_DEBUG(dbgs() << "After pre-selection:\n"; print_uses(dbgs()));
4871 LLVM_DEBUG(dbgs() << "After pre-selection:\n"; print_uses(dbgs()));
4953 LLVM_DEBUG(dbgs() << "New best at "; NewCost.print(dbgs());
4953 LLVM_DEBUG(dbgs() << "New best at "; NewCost.print(dbgs());
4954 dbgs() << ".\nRegs:\n";
4955 for (const SCEV *S : NewRegs) dbgs()
4957 dbgs() << '\n');
4982 LLVM_DEBUG(dbgs() << "\nNo Satisfactory Solution\n");
4987 LLVM_DEBUG(dbgs() << "\n"
4989 SolutionCost.print(dbgs()); dbgs() << ":\n";
4989 SolutionCost.print(dbgs()); dbgs() << ":\n";
4991 dbgs() << " ";
4992 Uses[i].print(dbgs());
4993 dbgs() << "\n"
4995 Solution[i]->print(dbgs());
4996 dbgs() << '\n';
5515 LLVM_DEBUG(dbgs() << "LSR skipping loop, too many IV Users in " << U
5549 LLVM_DEBUG(dbgs() << "\nLSR on loop ";
5550 L->getHeader()->printAsOperand(dbgs(), /*PrintType=*/false);
5551 dbgs() << ":\n");
5562 LLVM_DEBUG(dbgs() << "LSR skipping outer loop " << *L << "\n");
5575 LLVM_DEBUG(dbgs() << "LSR found " << Uses.size() << " uses:\n";
5576 print_uses(dbgs()));
5634 dbgs() << " ";
5643 dbgs() << " ";
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 "
248 dbgs() << "Won't unroll-and-jam; More than one inner loop block\n");
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");
355 dbgs() << " Not unrolling loop with convergent instructions.\n");
lib/Transforms/Scalar/LoopUnrollPass.cpp 430 LLVM_DEBUG(dbgs() << "Adding cost of instruction (iteration "
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
951 dbgs() << " will not try to unroll loop with runtime trip count "
973 dbgs() << "Remainder loop is restricted (that could architecture "
1004 LLVM_DEBUG(dbgs() << " runtime unrolling with count: " << UP.Count
1022 LLVM_DEBUG(dbgs() << "Loop Unroll: F["
1030 dbgs() << " Not unrolling loop which is not in loop-simplify form.\n");
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");
414 dbgs() << " LAA: Runtime checks are more than threshold !!\n");
428 LLVM_DEBUG(dbgs() << " Invariant not found !!\n");
433 LLVM_DEBUG(dbgs() << " Found a read-only loop!\n");
440 dbgs()
442 LLVM_DEBUG(dbgs() << " Invariant loads & stores: "
445 LLVM_DEBUG(dbgs() << " Invariant loads & store threshold: "
479 LLVM_DEBUG(dbgs() << "Loop: " << *CurLoop);
483 dbgs() << " Revisiting loop in LoopVersioningLICM not allowed.\n\n");
489 dbgs() << " Loop structure not suitable for LoopVersioningLICM\n\n");
501 dbgs()
508 dbgs()
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
401 : Range.TheStores) dbgs()
403 dbgs() << "With: " << *AMemSet << '\n');
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");
833 dbgs()
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");
188 LLVM_DEBUG(dbgs() << "can Sink? : "; Store0->dump(); dbgs() << "\n");
247 LLVM_DEBUG(dbgs() << "Sink Instruction into BB \n"; BB->dump();
248 dbgs() << "Instruction Left\n"; S0->dump(); dbgs() << "\n";
248 dbgs() << "Instruction Left\n"; S0->dump(); dbgs() << "\n";
249 dbgs() << "Instruction Right\n"; S1->dump(); dbgs() << "\n");
249 dbgs() << "Instruction Right\n"; S1->dump(); dbgs() << "\n");
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 "
1767 dbgs() << "PHI Node " << *I
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");
2733 dbgs()
2802 LLVM_DEBUG(dbgs() << "Skipping phi of ops operand for incoming block "
2810 LLVM_DEBUG(dbgs() << "Found phi of ops operand " << *FoundVal << " in "
2819 dbgs()
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");
333 dbgs()
350 LLVM_DEBUG(dbgs() << "[LSP] terminator instruction: " << *Term);
lib/Transforms/Scalar/Reassociate.cpp 77 dbgs() << Instruction::getOpcodeName(I->getOpcode()) << " "
80 dbgs() << "[ ";
81 Ops[i].Op->printAsOperand(dbgs(), false, M);
82 dbgs() << ", #" << Ops[i].Rank << "] ";
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');
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');
2258 LLVM_DEBUG(dbgs() << "RAOut:\t"; PrintOps(I, Ops); dbgs() << '\n');
lib/Transforms/Scalar/RewriteStatepointsForGC.cpp 378 dbgs() << "Live Variables:\n";
380 dbgs() << " " << V->getName() << " " << *V << "\n";
383 dbgs() << "Safepoint For: " << Call->getCalledValue()->getName() << "\n";
384 dbgs() << "Number live values: " << LiveSet.size() << "\n";
615 LLVM_DEBUG(dbgs() << "fBDV-cached: " << I->getName() << " -> "
688 print(dbgs());
689 dbgs() << '\n';
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");
1124 dbgs() << "Updating base value cache"
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: ";
460 if (auto *F = dyn_cast<Function>(V)) dbgs()
462 else dbgs() << *V << '\n');
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 @"
1119 print(dbgs(), I);
1121 LLVM_DUMP_METHOD void AllocaSlices::dump() const { print(dbgs()); }
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");
3777 dbgs()
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");
405 dbgs() << " unswitching trivial invariant conditions for: " << BI
408 dbgs() << " " << *Invariant << " == true";
410 dbgs() << " ||";
411 dbgs() << "\n";
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
2611 dbgs() << "Cannot unswitch because of cleanuppad in exit block\n";
2616 dbgs() << "Considering " << UnswitchCandidates.size()
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 << " (";
190 Inst->getParent()->printAsOperand(dbgs(), false); dbgs() << " -> ";
190 Inst->getParent()->printAsOperand(dbgs(), false); dbgs() << " -> ";
191 SuccToSinkTo->printAsOperand(dbgs(), false); dbgs() << ")\n");
191 SuccToSinkTo->printAsOperand(dbgs(), false); dbgs() << ")\n");
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");
802 dbgs() << "Function type: " << *RetTy << " f(";
804 dbgs() << *i << ", ";
805 dbgs() << ")\n";
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");
350 dbgs() << "Pointer is too complex for us to evaluate store.");
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");
446 dbgs() << "Found a Load! Not a simple load, can not evaluate.\n");
453 LLVM_DEBUG(dbgs() << "Found a constant pointer expression, constant "
460 dbgs() << "Failed to compute load result. Can not evaluate load."
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");
645 dbgs() << "Failed to evaluate block due to unhandled instruction."
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/ImportedFunctionsInliningStatistics.cpp 158 dbgs() << Out;
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 243 dbgs() << "LoopRotation: NOT rotating - contains non-duplicatable"
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 "
326 dbgs() << "Can't unroll; a conditional latch must exit the loop");
339 LLVM_DEBUG(dbgs() << "Can't unroll; conditional header must exit the loop");
346 dbgs() << " Won't unroll loop: address of header block is taken.\n");
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");
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 443 dbgs() << "Bailout for multi-exit handling when latch exit has >1 "
552 LLVM_DEBUG(dbgs() << "Trying runtime unrolling on Loop: \n");
554 LLVM_DEBUG(UseEpilogRemainder ? dbgs() << "Using epilog remainder.\n"
555 : dbgs() << "Using prolog remainder.\n");
559 LLVM_DEBUG(dbgs() << "Not in simplify form!\n");
572 dbgs()
584 dbgs()
601 dbgs()
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");
648 dbgs()
943 LLVM_DEBUG(dbgs() << "Unrolling remainder loop\n");
lib/Transforms/Utils/LoopUtils.cpp 92 dbgs() << "WARNING: Can't create a dedicated exit block for loop: "
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");
106 llvm::dbgs() << "Weights[" << Idx << "] = " << Weights[Idx] << "\n";
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 "
802 PredInfo->print(dbgs());
867 F.print(dbgs(), &Writer);
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: "
1846 dbgs() << "SINK: stopping here, too many PHIs would be created!\n");
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 629 LLVM_DEBUG(dbgs() << "LSV: Found may-write/throw operation: " << I
633 LLVM_DEBUG(dbgs() << "LSV: Found may-read/write/throw operation: " << I
687 dbgs() << "LSV: Found alias:\n"
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."
1011 dbgs() << "LSV: Stores to vectorize:\n";
1013 dbgs() << " " << *I << "\n";
1153 LLVM_DEBUG(dbgs() << "LSV: Chain doesn't match with the vector factor."
1182 dbgs() << "LSV: Loads to vectorize:\n";
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");
325 dbgs() << "LV: Loop latch condition is not a compare instruction.\n");
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");
557 dbgs()
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()
836 dbgs() << "LV: Not vectorizing: " << DebugMsg;
838 dbgs() << " " << *I;
840 dbgs() << '.';
841 dbgs() << '\n';
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');
4880 dbgs() << "LV: vector predicate hint/switch found.\n"
4889 dbgs() << "LV: Not allowing scalar epilogue due to -Os/-Oz.\n");
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
5042 dbgs() << "LV: Not considering vector loop of width " << i
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');
5276 dbgs() << "LV: Interleaving to saturate store or load ports.\n");
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 # "
5470 dbgs() << "LV(REG): VF = " << VFs[i] << '\n';
5471 dbgs() << "LV(REG): Found max usage: " << MaxUsages[i].size()
5474 dbgs() << "LV(REG): RegisterClass: "
5478 dbgs() << "LV(REG): Found invariant usage: " << Invariant.size()
5481 dbgs() << "LV(REG): RegisterClass: "
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
6426 dbgs() << "LV: Not vectorizing. Inner loops aren't supported in the "
6441 dbgs()
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 \""
7514 LLVM_DEBUG(dbgs() << "\nLV: Checking a loop in \""
7521 dbgs() << "LV: Loop hints:"
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");
7694 dbgs() << "LV: Interleaving is beneficial but is explicitly disabled.");
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');
lib/Transforms/Vectorize/SLPVectorizer.cpp 655 LLVM_DUMP_METHOD void dump() const { dump(dbgs()); }
1103 printMode(RMode, dbgs());
1129 LLVM_DUMP_METHOD void dump() const { print(dbgs()); }
1347 dbgs() << Idx << ".\n";
1349 dbgs() << "Operand " << OpI << ":\n";
1351 dbgs().indent(2) << *V << "\n";
1353 dbgs() << "Scalars: \n";
1355 dbgs().indent(2) << *V << "\n";
1356 dbgs() << "NeedToGather: " << NeedToGather << "\n";
1357 dbgs() << "MainOp: " << *MainOp << "\n";
1358 dbgs() << "AltOp: " << *AltOp << "\n";
1359 dbgs() << "VectorizedValue: ";
1361 dbgs() << *VectorizedValue;
1363 dbgs() << "NULL";
1364 dbgs() << "\n";
1365 dbgs() << "ReuseShuffleIndices: ";
1367 dbgs() << "Emtpy";
1370 dbgs() << ReuseIdx << ", ";
1371 dbgs() << "\n";
1372 dbgs() << "ReorderIndices: ";
1374 dbgs() << ReorderIdx << ", ";
1375 dbgs() << "\n";
1376 dbgs() << "UserTreeIndices: ";
1378 dbgs() << EInfo << ", ";
1379 dbgs() << "\n";
1434 dbgs() << "\n";
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");
2371 dbgs() << "SLP: Reusing or shuffling of reordered extract sequence "
2374 dbgs() << " " << Idx;
2375 dbgs() << "\n";
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 "
3382 dbgs() << "SLP: #LV: " << LiveValues.size();
3384 dbgs() << " " << X->getName();
3385 dbgs() << ", Looking at ";
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");
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";
347 VPDomTree.print(dbgs()));
352 LLVM_DEBUG(dbgs() << "VPLoop Info After buildPlainCFG:\n";
353 VPLInfo.print(dbgs()));
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");
134 dbgs() << "VPSLP: instruction modifying memory between loads\n");
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 ");
322 dbgs() << *cast<VPInstruction>(Ops.second[Lane])->getUnderlyingInstr()
326 LLVM_DEBUG(dbgs() << "\n");
329 LLVM_DEBUG(dbgs() << " Checking " << Op << "\n");
348 dbgs() << " Ops: ";
352 dbgs() << *Instr << " | ";
355 dbgs() << " nullptr | ";
357 dbgs() << "\n";
384 dbgs() << "buildGraph: ";
400 dbgs() << " Visiting Commutative";
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());
466 LLVM_DEBUG(dbgs() << "Create VPInstruction "; VPI->print(dbgs());
467 cast<VPInstruction>(Values[0])->print(dbgs()); dbgs() << "\n");
467 cast<VPInstruction>(Values[0])->print(dbgs()); dbgs() << "\n");
lib/Transforms/Vectorize/VPlanVerifier.cpp 129 LLVM_DEBUG(dbgs() << "Verifying VPlan H-CFG.\n");
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");
330 llvm::dbgs() << "libcxx03 std::call_once implementation, skipping.\n";
334 llvm::dbgs() << "unknown std::call_once implementation, skipping.\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 301 llvm::dbgs() << Buffer;
tools/clang/lib/Format/BreakableToken.cpp 70 LLVM_DEBUG(llvm::dbgs() << "Comment split: \"" << Text
449 llvm::dbgs() << "IndentAtLineBreak " << IndentAtLineBreak << "\n";
450 llvm::dbgs() << "DelimitersOnNewline " << DelimitersOnNewline << "\n";
452 llvm::dbgs() << i << " |" << Content[i] << "| "
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"
308 llvm::dbgs() << "JsModuleReference: {"
314 llvm::dbgs() << ", " << Reference.Symbols[i].Symbol << " as "
316 llvm::dbgs() << ", text: " << getSourceText(Reference.Range);
317 llvm::dbgs() << "}\n";
tools/clang/lib/Format/TokenAnalyzer.cpp 58 llvm::dbgs() << "File encoding: "
61 LLVM_DEBUG(llvm::dbgs() << "Language: " << getLanguageName(Style.Language)
76 LLVM_DEBUG(llvm::dbgs() << "Run " << Run << "...\n");
89 llvm::dbgs() << "Replacements for run " << Run << ":\n";
93 llvm::dbgs() << I->toString() << "\n";
tools/clang/lib/Format/UnwrappedLineFormatter.cpp 716 llvm::dbgs() << "State: ";
718 llvm::dbgs() << (P.Tok ? P.Tok->TokenText : "F") << "|" << P.Indent << "|"
721 llvm::dbgs() << State.NextToken->TokenText << "\n";
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");
1041 llvm::dbgs() << "Penalty for placing "
tools/clang/lib/Format/UnwrappedLineParser.cpp 259 LLVM_DEBUG(llvm::dbgs() << "----\n");
2447 llvm::dbgs() << Prefix << "Line(" << Line.Level
2453 llvm::dbgs() << I->Tok->Tok.getName() << "["
2468 llvm::dbgs() << "\n";
tools/clang/lib/Format/UsingDeclarationsSorter.cpp 166 llvm::dbgs() << "Replacing '" << OldText << "' with '" << Text << "'\n";
tools/clang/lib/Lex/HeaderMap.cpp 176 llvm::dbgs() << "Header Map " << getFileName() << ":\n " << NumBuckets
192 llvm::dbgs() << " " << i << ". " << Key << " -> '" << Prefix << "' '"
tools/clang/lib/StaticAnalyzer/Core/CallEvent.cpp 559 llvm::dbgs() << "Using autosynthesized body for " << FD->getName()
tools/clang/lib/StaticAnalyzer/Core/MemRegion.cpp 1260 LLVM_DEBUG(llvm::dbgs() << "MemRegion::getAsArrayOffset: "
tools/clang/lib/Tooling/InterpolatingCompilationDatabase.cpp 357 llvm::dbgs() << "interpolate: chose " << OriginalPaths[Best.first]
tools/clang/lib/Tooling/Syntax/Tokens.cpp 328 DEBUG_WITH_TYPE("collect-tokens", llvm::dbgs()
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 ");
364 .print(llvm::dbgs(), 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()
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/CodeGen/CodeGenExternalTest.cpp 181 c->print(dbgs(), true);
182 dbgs() << "\n";
198 llvmTy->print(dbgs(), true);
199 dbgs() << "\n";
236 xTy->print(dbgs(), true);
237 dbgs() << "\n";
238 yTy->print(dbgs(), true);
239 dbgs() << "\n";
240 zTy->print(dbgs(), true);
241 dbgs() << "\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/Core/Resolver.cpp 106 DEBUG_WITH_TYPE("resolver", llvm::dbgs()
125 DEBUG_WITH_TYPE("resolver", llvm::dbgs()
150 DEBUG_WITH_TYPE("resolver", llvm::dbgs()
165 DEBUG_WITH_TYPE("resolver", llvm::dbgs()
214 llvm::dbgs() << "******** Resolving undefines:\n");
221 llvm::dbgs() << "Loading file #" << index << "\n");
231 llvm::dbgs() << "Loaded file: " << file->path() << "\n");
296 llvm::dbgs() << "******** Updating references:\n");
345 llvm::dbgs() << "******** Dead stripping unused atoms:\n");
393 llvm::dbgs() << "******** Checking for undefines:\n");
442 llvm::dbgs() << "******** Removing coalesced away atoms:\n");
454 llvm::dbgs() << "******** Resolving atom references:\n");
460 DEBUG_WITH_TYPE("resolver", llvm::dbgs() << "Found undefines... ");
462 DEBUG_WITH_TYPE("resolver", llvm::dbgs() << "which we don't allow\n");
465 DEBUG_WITH_TYPE("resolver", llvm::dbgs() << "which we are ok with\n");
469 DEBUG_WITH_TYPE("resolver", llvm::dbgs() << "******** Finished resolver\n");
476 DEBUG_WITH_TYPE("resolver", llvm::dbgs() << "Resolver final atom list:\n");
481 DEBUG_WITH_TYPE("resolver", llvm::dbgs()
493 DEBUG_WITH_TYPE("resolver", llvm::dbgs()
tools/lld/lib/ReaderWriter/FileArchive.cpp 169 DEBUG_WITH_TYPE("FileArchive", llvm::dbgs()
179 llvm::dbgs()
tools/lld/lib/ReaderWriter/MachO/ArchHandler_arm64.cpp 548 DEBUG_WITH_TYPE("atom-content", llvm::dbgs()
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 76 llvm::dbgs() << "There's a cycle in a follow-on chain!\n";
78 llvm::dbgs() << " " << atomToDebugString(atom) << "\n";
85 llvm::dbgs() << " " << kindValStr
138 llvm::dbgs() << " file=" << atom->file().path()
256 llvm::dbgs() << "Layout: '" << lc._atom.get()->name()
444 LLVM_DEBUG(llvm::dbgs() << "******** Laying out atoms:\n");
459 llvm::dbgs() << "unsorted atoms:\n";
472 llvm::dbgs() << "sorted atoms:\n";
476 LLVM_DEBUG(llvm::dbgs() << "******** Finished laying out atoms\n");
tools/lld/lib/ReaderWriter/MachO/MachONormalizedFileBinaryWriter.cpp 318 llvm::dbgs() << "MachOFileLayout()\n"
359 llvm::dbgs() << "MachOFileLayout()\n"
539 llvm::dbgs() << "buildFileOffsets()\n");
545 llvm::dbgs() << " segment=" << sg.name
560 llvm::dbgs() << " section=" << s->sectionName
1281 DEBUG_WITH_TYPE("trie-builder", llvm::dbgs()
1306 DEBUG_WITH_TYPE("trie-builder", llvm::dbgs()
tools/lld/lib/ReaderWriter/MachO/MachONormalizedFileFromAtoms.cpp 609 llvm::dbgs() << "assignAddressesToSections()\n";
611 llvm::dbgs() << " address=" << llvm::format("0x%08llX", sgi->address)
616 llvm::dbgs()<< " addr=" << llvm::format("0x%08llX", si->address)
739 DEBUG_WITH_TYPE("WriterMachO-address", llvm::dbgs()
750 DEBUG_WITH_TYPE("WriterMachO-address", llvm::dbgs()
765 DEBUG_WITH_TYPE("WriterMachO-address", llvm::dbgs()
771 DEBUG_WITH_TYPE("WriterMachO-address", llvm::dbgs()
785 DEBUG_WITH_TYPE("WriterMachO-address", llvm::dbgs()
tools/lld/lib/ReaderWriter/MachO/MachONormalizedFileToAtoms.cpp 811 llvm::dbgs() << "Adding to stabsList: " << stab << "\n";
1433 LLVM_DEBUG(llvm::dbgs() << "******** Normalizing file to atoms: "
tools/lld/lib/ReaderWriter/YAML/ReaderWriterYAML.cpp 94 llvm::dbgs() << "unnamed atom: creating ref-name: '"
124 llvm::dbgs() << "name collsion: creating ref-name: '"
138 llvm::dbgs() << "name collsion: creating ref-name: '"
146 DEBUG_WITH_TYPE("WriterYAML", llvm::dbgs()
763 DEBUG_WITH_TYPE("WriterYAML", llvm::dbgs()
849 llvm::dbgs() << "created DefinedAtom named: '" << _name
1017 llvm::dbgs() << "created UndefinedAtom named: '" << _name
1085 llvm::dbgs() << "created SharedLibraryAtom named: '"
1159 llvm::dbgs() << "created AbsoluteAtom named: '" << _name
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"
787 if (verifyModule(M, &dbgs())) {
788 dbgs() << "Bad module: " << &M << "\n";
tools/llvm-diff/DiffConsumer.cpp 197 Log.getLeft(I)->print(dbgs()); dbgs() << '\n';
197 Log.getLeft(I)->print(dbgs()); dbgs() << '\n';
202 Log.getLeft(I)->print(dbgs()); dbgs() << '\n';
202 Log.getLeft(I)->print(dbgs()); dbgs() << '\n';
207 Log.getRight(I)->print(dbgs()); dbgs() << '\n';
207 Log.getRight(I)->print(dbgs()); dbgs() << '\n';
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: "
531 : Stats.VarsInFunction) llvm::dbgs()
550 LLVM_DEBUG(llvm::dbgs() << "Variable location quality metrics\n";
551 llvm::dbgs() << "---------------------------------\n");
606 llvm::dbgs() << "Total Availability: "
609 llvm::dbgs() << "PC Ranges covered: "
tools/llvm-isel-fuzzer/llvm-isel-fuzzer.cpp 109 dbgs() << "LLVM ERROR: " << Message << "\n"
tools/llvm-jitlink/llvm-jitlink-macho.cpp 88 dbgs() << "Registering MachO file info for \"" << FileName << "\"\n";
92 dbgs() << " Section \"" << Sec.getName() << "\": "
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");
664 dbgs() << "Dylib search order is [ ";
666 dbgs() << JD->getName() << " ";
667 dbgs() << "]\n";
742 Disassembler.get(), InstPrinter.get(), dbgs());
tools/llvm-objdump/MachODump.cpp 7330 raw_ostream &DebugOut = DebugFlag ? dbgs() : nulls();
tools/llvm-objdump/llvm-objdump.cpp 1344 raw_ostream &DebugOut = DebugFlag ? dbgs() : nulls();
tools/llvm-opt-fuzzer/llvm-opt-fuzzer.cpp 167 dbgs() << "LLVM ERROR: " << Message << "\n"
tools/llvm-rtdyld/llvm-rtdyld.cpp 165 llvm::dbgs() << "In " << KV.first() << "\n";
167 llvm::dbgs() << " \"" << KV2.first() << "\" -> " << KV2.second << "\n";
924 Disassembler.get(), InstPrinter.get(), dbgs());
tools/opt/GraphPrinters.cpp 37 getAnalysis<DominatorTreeWrapperPass>().print(dbgs());
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';
324 dbgs() << "MustWrite: " << MustWrite << '\n';
325 dbgs() << "MayWrite: " << MayWrite << '\n';
326 dbgs() << "ReductionTagMap: " << ReductionTagMap << '\n';
327 dbgs() << "TaggedStmtDomain: " << TaggedStmtDomain << '\n';);
364 LLVM_DEBUG(dbgs() << "Read: " << Read << "\n";
365 dbgs() << "MustWrite: " << MustWrite << "\n";
366 dbgs() << "MayWrite: " << MayWrite << "\n";
367 dbgs() << "Schedule: " << Schedule << "\n");
509 dbgs() << "Wrapped Dependences:\n";
511 dbgs() << "\n";
558 dbgs() << "Final Wrapped Dependences:\n";
560 dbgs() << "\n";
608 dbgs() << "Zipped Dependences:\n";
610 dbgs() << "\n";
620 dbgs() << "Unwrapped Dependences:\n";
622 dbgs() << "\n";
761 void Dependences::dump() const { print(dbgs()); }
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 75 dbgs() << "NOTE: -polly-process-unprofitable active, won't prune "
84 dbgs() << "SCoP pruned because it probably cannot be optimized in "
tools/polly/lib/Analysis/ScopBuilder.cpp 3341 dbgs() << "\n\nNOTE: Run time checks for " << scop->getNameStr()
3666 dbgs() << "Bailing-out because buildDomains encountered problems\n");
3685 LLVM_DEBUG(dbgs() << "Bailing-out because SCoP is empty\n");
3702 LLVM_DEBUG(dbgs() << "Bailing-out because of unfeasible context (early)\n");
3711 dbgs() << "Bailing-out because SCoP is not considered profitable\n");
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");
1436 dbgs() << "\tto " << LastValidRegion->getNameStr() << "\n";
1438 dbgs() << "\tExpanding " << R.getNameStr() << " failed\n";
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");
1657 dbgs() << "Region entry does not match -polly-region-only";
1658 dbgs() << "\n";
1677 LLVM_DEBUG(dbgs() << "OK\n");
tools/polly/lib/Analysis/ScopInfo.cpp 1291 LLVM_DUMP_METHOD void ScopStmt::dump() const { print(dbgs(), true); }
2127 LLVM_DEBUG(dbgs() << "Invalidate SCoP because of reason " << Kind << "\n");
2237 LLVM_DUMP_METHOD void Scop::dump() const { print(dbgs(), true); }
tools/polly/lib/CodeGen/CodeGeneration.cpp 185 LLVM_DEBUG(dbgs() << "Got an IstAst for a different Scop/isl_ctx\n");
tools/polly/lib/CodeGen/CodegenCleanup.cpp 120 dbgs() << F.getName()
125 LLVM_DEBUG(dbgs() << F.getName() << ": Running codegen cleanup...");
tools/polly/lib/CodeGen/IslAst.cpp 759 dbgs() << S.getContextStr() << "\n";
760 dbgs() << stringFromIslObj(Schedule);
799 dbgs() << "Got dependence analysis for different SCoP/isl_ctx\n");
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 209 dbgs() << "INVALID: More than one non-int operand in MulExpr\n"
229 LLVM_DEBUG(dbgs() << "INVALID: AddRec is not affine");
245 dbgs() << "INVALID: Loop of AddRec expression boxed in an a "
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 "
394 dbgs() << "INVALID: unsigned division of non-constant expressions");
434 LLVM_DEBUG(dbgs() << "INVALID: UnknownExpr is not an integer or pointer");
439 LLVM_DEBUG(dbgs() << "INVALID: UnknownExpr references an undef value");
642 dbgs() << "\n";
643 dbgs() << "Expr: " << *Expr << "\n";
644 dbgs() << "Region: " << R->getNameStr() << "\n";
645 dbgs() << " -> ";
652 dbgs() << "VALID\n";
653 dbgs() << "\n";
tools/polly/lib/Transform/DeLICM.cpp 545 LLVM_DEBUG(OS = &llvm::dbgs());
558 dbgs()
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');
690 dbgs()
702 LLVM_DEBUG(dbgs() << " Lifetime: " << Lifetime << '\n');
857 LLVM_DEBUG(dbgs() << " Mapping: " << PHITarget << '\n');
863 dbgs()
889 dbgs() << " Reject because did not find PHI write mapping for "
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
1071 dbgs() << " Reject because storage size is insufficient\n");
1209 LLVM_DEBUG(dbgs() << "DeLICM analysis exceeded max_operations\n");
1220 LLVM_DEBUG(dbgs() << "Computed Zone:\n"; OriginalZone.print(dbgs(), 4));
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
1312 dbgs()
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");
467 dbgs() << " forwarded known load with preexisting MemoryAccess"
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
730 dbgs() << " Synthesizable would not be synthesizable anymore: "
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");
1613 dbgs() << "NewScheduleTree: \n" << str << "\n";
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
514 dbgs() << "Removing " << MA
546 LLVM_DEBUG(dbgs() << "Removing " << MA
568 LLVM_DEBUG(dbgs() << "Removing "; Inst->print(dbgs());
568 LLVM_DEBUG(dbgs() << "Removing "; Inst->print(dbgs());
569 dbgs() << " because it is not used\n");
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 345 dbgs() << "Load after store of same element in same statement\n");
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");
249 dbgs() << "value-mapping (size = " << VM.Values.size() << "):\n";
251 dbgs() << " - id = " << I << ", value = ";
258 dbgs() << " - " << Desc << " value = ";
261 dbgs() << " => use: op = " << U.getOperandNo()
269 dbgs() << " - fail: user mismatch: ID = " << I << "\n";
273 dbgs() << "\nlhs-";
275 dbgs() << "\nrhs-";
280 dbgs() << " - fail: map size: " << L.Values.size()
282 dbgs() << "\nlhs-";
284 dbgs() << "\nrhs-";
290 LLVM_DEBUG(dbgs() << "compare value maps\n");
399 LLVM_DEBUG(dbgs() << "V = "; V->dump());
408 LLVM_DEBUG(dbgs() << " - order: " << I << ", op = " << U.getOperandNo()
414 LLVM_DEBUG(dbgs() << " => shuffle\n");
419 dbgs() << " - order: " << Order.lookup(&U)
440 dbgs() << "V = ";
443 dbgs() << " - order: op = " << U.getOperandNo() << ", U = ";
446 dbgs() << " => reverse\n";
453 dbgs() << " - order: op = " << U.getOperandNo() << ", U = ";
517 LLVM_DEBUG(dbgs() << "\n");
523 LLVM_DEBUG(dbgs() << "\n");
unittests/Analysis/LazyCallGraphTest.cpp 609 dbgs() << "Formed RefSCC: " << RC << "\n";
755 dbgs() << "Formed RefSCC: " << RC << "\n";
847 dbgs() << "Formed RefSCC: " << RC << "\n";
954 dbgs() << "Formed RefSCC: " << RC << "\n";
1031 dbgs() << "Formed RefSCC: " << RC << "\n";
1093 dbgs() << "Formed RefSCC: " << RC << "\n";
unittests/Bitcode/BitReaderTest.cpp 77 EXPECT_FALSE(verifyModule(*M, &dbgs()));
89 EXPECT_FALSE(verifyModule(*M, &dbgs()));
97 EXPECT_FALSE(verifyModule(*M, &dbgs()));
105 EXPECT_FALSE(verifyModule(*M, &dbgs()));
113 EXPECT_FALSE(verifyModule(*M, &dbgs()));
121 EXPECT_FALSE(verifyModule(*M, &dbgs()));
135 EXPECT_FALSE(verifyModule(*M, &dbgs()));
157 EXPECT_FALSE(verifyModule(*M, &dbgs()));
163 EXPECT_FALSE(verifyModule(*M, &dbgs()));
184 EXPECT_FALSE(verifyModule(*M, &dbgs()));
190 EXPECT_FALSE(verifyModule(*M, &dbgs()));
unittests/ExecutionEngine/JITLink/MachO_x86_64_Tests.cpp 37 dbgs() << "Skipping JITLInk unit test: " << toString(TR.takeError())
unittests/IR/CFGBuilder.cpp 38 LLVM_DEBUG(dbgs() << "Creating BB arc " << From->getName() << " -> "
40 dbgs().flush());
59 LLVM_DEBUG(dbgs() << "Deleting BB arc " << From->getName() << " -> "
61 dbgs().flush());
unittests/IR/CFGBuilder.h 77 void dump(raw_ostream &OS = dbgs()) const;
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");
unittests/Support/Casting.cpp 52 dbgs() << "Classof: " << &Val << "\n";
unittests/Target/ARM/MachineInstrTest.cpp 475 dbgs() << Error;
utils/TableGen/CodeGenDAGPatterns.cpp 267 dbgs() << *this << '\n';
822 dbgs() << "Type set is empty for each HW mode:\n"
utils/TableGen/CodeGenHwModes.cpp 28 dbgs() << Name << ": " << Features << '\n';
48 dbgs() << '{';
50 dbgs() << " (" << P.first << ',' << P.second->getName() << ')';
51 dbgs() << " }\n";
95 dbgs() << "Modes: {\n";
97 dbgs() << " ";
100 dbgs() << "}\n";
102 dbgs() << "ModeIds: {\n";
104 dbgs() << " " << P.first() << " -> " << P.second << '\n';
105 dbgs() << "}\n";
107 dbgs() << "ModeSelects: {\n";
109 dbgs() << " " << P.first->getName() << " -> ";
112 dbgs() << "}\n";
utils/TableGen/CodeGenRegisters.cpp 1672 LLVM_DEBUG(dbgs() << "UberSet " << I - UberSets.begin() << " Weight "
1675 : I->Regs) dbgs()
1677 dbgs() << "\n");
1845 LLVM_DEBUG(dbgs() << "UnitSet " << SubIdx << " subsumed by " << SuperIdx
1899 LLVM_DEBUG(dbgs() << "\nBefore pruning:\n"; for (unsigned USIdx = 0,
1902 dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":";
1905 dbgs() << "\n";
1911 LLVM_DEBUG(dbgs() << "\nBefore union:\n"; for (unsigned USIdx = 0,
1914 dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":";
1917 dbgs() << "\n";
1918 } dbgs() << "\nUnion sets:\n");
1958 LLVM_DEBUG(dbgs() << "UnitSet " << RegUnitSets.size() - 1 << " "
1962 dbgs() << "\n";);
1971 dbgs() << "\n"; for (unsigned USIdx = 0, USEnd = RegUnitSets.size();
1973 dbgs() << "UnitSet " << USIdx << " " << RegUnitSets[USIdx].Name << ":";
1976 dbgs() << "\n";
1995 LLVM_DEBUG(dbgs() << "RC " << RC.getName() << " Units: \n";
1998 dbgs() << "\n UnitSetIDs:");
2004 LLVM_DEBUG(dbgs() << " " << USIdx);
2008 LLVM_DEBUG(dbgs() << "\n");
2430 dbgs() << ' ' << RegUnits[Unit].Roots[0]->getName();
2432 dbgs() << " #" << Unit;
utils/TableGen/CodeGenSchedule.cpp 38 dbgs() << Idx << ", ";
218 dbgs() << "\n+++ RESOURCE DEFINITIONS (collectProcResources) +++\n");
537 LLVM_DEBUG(dbgs() << "+++ PROCESSOR MODELs (addProcModel) +++\n");
690 dbgs() << "\n+++ SCHED READS and WRITES (collectSchedRW) +++\n";
692 dbgs() << WIdx << ": ";
694 dbgs() << '\n';
697 dbgs() << RIdx << ": ";
699 dbgs() << '\n';
706 dbgs() << "Unused SchedReadWrite " << Name << '\n';
888 LLVM_DEBUG(dbgs() << "\n+++ SCHED CLASSES (createInstRWClass) +++\n");
900 dbgs()
908 dbgs() << "No machine model for " << Inst->TheDef->getName() << '\n';
920 dbgs() << "Itinerary for " << InstName << ": "
926 dbgs() << "SchedRW machine model for " << InstName;
929 dbgs() << " " << SchedWrites[*WI].Name;
931 dbgs() << " " << SchedReads[*RI].Name;
932 dbgs() << '\n';
940 LLVM_DEBUG(dbgs() << "InstRW on " << ProcModel.ModelName << " for "
948 dbgs() << " " << SchedWrites[WIdx].Name;
950 dbgs() << " " << SchedReads[RIdx].Name;
951 dbgs() << '\n';
959 dbgs() << "No machine model for " << Inst->TheDef->getName()
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()
1189 dbgs() << ProcModel.ItinsDef->getName()
1226 dbgs() << "\n+++ INFERRING SCHED CLASSES (inferSchedClasses) +++\n");
1227 LLVM_DEBUG(dbgs() << NumInstrSchedClasses << " instr sched classes.\n");
1689 LLVM_DEBUG(dbgs() << "INFER RW proc("; dumpIdxVec(ProcIndices);
1690 dbgs() << ") ");
1705 LLVM_DEBUG(dbgs() << "("; dumpIdxVec(Seq); dbgs() << ") ");
1705 LLVM_DEBUG(dbgs() << "("; dumpIdxVec(Seq); dbgs() << ") ");
1707 LLVM_DEBUG(dbgs() << " Reads: ");
1714 LLVM_DEBUG(dbgs() << "("; dumpIdxVec(Seq); dbgs() << ") ");
1714 LLVM_DEBUG(dbgs() << "("; dumpIdxVec(Seq); dbgs() << ") ");
1716 LLVM_DEBUG(dbgs() << '\n');
1901 dbgs() << "WriteResDefs: "; for (RecIter RI = PM.WriteResDefs.begin(),
1905 dbgs() << (*RI)->getValueAsDef("WriteType")->getName() << " ";
1907 dbgs() << (*RI)->getName() << " ";
1908 } dbgs() << "\nReadAdvanceDefs: ";
1913 dbgs() << (*RI)->getValueAsDef("ReadType")->getName() << " ";
1915 dbgs() << (*RI)->getName() << " ";
1916 } dbgs()
1920 RI != RE; ++RI) { dbgs() << (*RI)->getName() << " "; } dbgs()
1920 RI != RE; ++RI) { dbgs() << (*RI)->getName() << " "; } dbgs()
2164 dbgs() << Index << ": " << ModelName << " "
2170 dbgs() << Name << (IsVariadic ? " (V) " : " ");
2172 dbgs() << "(";
2174 dbgs() << ")";
2179 dbgs() << "SCHEDCLASS " << Index << ":" << Name << '\n'
2184 dbgs() << '\n';
2185 dbgs().indent(10);
2188 dbgs() << "\n Reads: ";
2192 dbgs() << '\n';
2193 dbgs().indent(10);
2196 dbgs() << "\n ProcIdx: "; dumpIdxVec(ProcIndices); dbgs() << '\n';
2196 dbgs() << "\n ProcIdx: "; dumpIdxVec(ProcIndices); dbgs() << '\n';
2198 dbgs() << "\n Transitions for Proc ";
2206 dbgs() << "Expanded Variants:\n";
2209 dbgs() << "{";
2214 dbgs() << ", ";
2215 dbgs() << SchedModels.getSchedRW(PCI->RWIdx, PCI->IsRead).Name
2218 dbgs() << "},\n => {";
2222 dbgs() << "(";
2226 dbgs() << ", ";
2227 dbgs() << SchedModels.getSchedWrite(*WI).Name;
2229 dbgs() << "),";
2231 dbgs() << "}\n";
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)
348 dbgs() << " ";
350 dbgs() << "\n";
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/InfoByHwMode.cpp 106 dbgs() << *this << '\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")
239 dbgs() << " Found immediate '" << II->getValue() << "' at "
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");
1057 LLVM_DEBUG(dbgs() << ProcModel.ModelName