Searched refs:dbgs (Results 1 - 25 of 718) sorted by relevance

1234567891011>>

/freebsd-12-stable/contrib/llvm-project/llvm/lib/MC/
H A DMCLabel.cpp23 print(dbgs());
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DUnicodeCharRanges.h76 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");
/freebsd-12-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DCodeGenHwModes.cpp28 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() << "}\
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DLazyMachineBlockFrequencyInfo.cpp60 LLVM_DEBUG(dbgs() << "MachineBlockFrequencyInfo is available\n");
67 LLVM_DEBUG(dbgs() << "Building MachineBlockFrequencyInfo on the fly\n");
68 LLVM_DEBUG(if (MLI) dbgs() << "LoopInfo is available\n");
71 LLVM_DEBUG(dbgs() << "Building LoopInfo on the fly\n");
73 LLVM_DEBUG(if (MDT) dbgs() << "DominatorTree is available\n");
76 LLVM_DEBUG(dbgs() << "Building DominatorTree on the fly\n");
H A DAllocationOrder.cpp43 dbgs() << "hints:";
45 dbgs() << ' ' << printReg(Hints[I], TRI);
46 dbgs() << '\n';
H A DRegUsageInfoPropagate.cpp105 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() << " +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++"
H A DMIRCanonicalizerPass.cpp123 dbgs() << "Splicing ";
125 dbgs() << " right before: ";
216 LLVM_DEBUG(dbgs() << "Operand " << 0 << " of "; II->dump(); MO.dump(););
265 dbgs() << "Splicing ";
267 dbgs() << " right before: ";
287 dbgs() << "Rescheduling Multi-Use Instructions Lexographically.";);
295 dbgs() << "Rescheduling Idempotent Instructions Lexographically.";);
375 dbgs() << "\n\n NEW BASIC BLOCK: " << MBB->getName() << " \n\n";
376 dbgs() << "\n\n================================================\n\n";
381 LLVM_DEBUG(dbgs() << "\
[all...]
H A DScheduleDAG.cpp77 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() << " Memor
[all...]
H A DAggressiveAntiDepBreaker.cpp141 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() << "
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopVersioningLICM.cpp218 LLVM_DEBUG(dbgs() << " loop is not in loop-simplify form.\n");
223 LLVM_DEBUG(dbgs() << " loop is not innermost\n");
228 LLVM_DEBUG(dbgs() << " loop has multiple backedges\n");
233 LLVM_DEBUG(dbgs() << " loop has multiple exiting block\n");
240 LLVM_DEBUG(dbgs() << " loop is not bottom tested\n");
246 LLVM_DEBUG(dbgs() << " Parallel loop is not worth versioning\n");
251 LLVM_DEBUG(dbgs() << " loop depth is more then threshold\n");
258 LLVM_DEBUG(dbgs() << " loop does not has trip count\n");
306 LLVM_DEBUG(dbgs() << " Alias tracker type safety failed!\n");
311 LLVM_DEBUG(dbgs() << " N
[all...]
H A DLoopPassManager.cpp30 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()) {}
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZMachineScheduler.cpp28 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() << "** Leavin
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCBranchCoalescing.cpp235 LLVM_DEBUG(dbgs() << "Determine if branch block "
241 LLVM_DEBUG(dbgs() << "TII unable to Analyze Branch - skip\n");
246 LLVM_DEBUG(dbgs() << "Looking at terminator : " << I << "\n");
264 LLVM_DEBUG(dbgs() << "Terminator contains implicit operands - skip : "
271 LLVM_DEBUG(dbgs() << "EH Pad - skip\n");
279 LLVM_DEBUG(dbgs() << "Does not form a triangle - skip\n");
285 LLVM_DEBUG(dbgs() << "Does not have 2 successors - skip\n");
304 LLVM_DEBUG(dbgs() << "Fall-through block contains code -- skip\n");
310 dbgs()
316 LLVM_DEBUG(dbgs() << "Vali
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DCombiner.cpp65 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;);
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DEvaluator.cpp291 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()
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DMergeFunctions.cpp339 dbgs() << "MERGEFUNC-SANITY: Started for first " << Max << " functions.\n";
355 dbgs() << "MERGEFUNC-SANITY: Non-symmetric; triple: " << TripleNumber
357 dbgs() << *F1 << '\n' << *F2 << '\n';
388 dbgs() << "MERGEFUNC-SANITY: Non-transitive; triple: "
390 dbgs() << "Res1, Res3, Res4: " << Res1 << ", " << Res3 << ", "
392 dbgs() << *F1 << '\n' << *F2 << '\n' << *F3 << '\n';
399 dbgs() << "MERGEFUNC-SANITY: " << (Valid ? "Passed." : "Failed.") << "\n";
442 LLVM_DEBUG(dbgs() << "size of module: " << M.size() << '\n');
443 LLVM_DEBUG(dbgs() << "size of worklist: " << Worklist.size() << '\n');
454 LLVM_DEBUG(dbgs() << "siz
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanSLP.cpp82 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() << *cas
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/
H A DJITLinkGeneric.cpp39 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());
168 dbgs() << "Segment ordering:\n";
170 dbgs() << " Segmen
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyAddMissingPrototypes.cpp62 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: " +
H A DWebAssemblyRegNumbering.cpp62 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");
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64PromoteConstant.cpp122 LLVM_DEBUG(dbgs() << getPassName() << '\n');
383 LLVM_DEBUG(dbgs() << "Insertion point dominated by:\n");
384 LLVM_DEBUG(IPI.first->print(dbgs()));
385 LLVM_DEBUG(dbgs() << '\n');
411 LLVM_DEBUG(dbgs() << "Merge insertion point with:\n");
412 LLVM_DEBUG(IPI->first->print(dbgs()));
413 LLVM_DEBUG(dbgs() << "\nat considered insertion point.\n");
433 LLVM_DEBUG(dbgs() << "Merge insertion point with:\n");
434 LLVM_DEBUG(IPI->first->print(dbgs()));
435 LLVM_DEBUG(dbgs() << '\
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DObjCARCExpand.cpp94 LLVM_DEBUG(dbgs() << "ObjCARCExpand: Visiting Function: " << F.getName()
100 LLVM_DEBUG(dbgs() << "ObjCARCExpand: Visiting: " << *Inst << "\n");
115 LLVM_DEBUG(dbgs() << "ObjCARCExpand: Old = " << *Inst
127 LLVM_DEBUG(dbgs() << "ObjCARCExpand: Finished List.\n\n");
/freebsd-12-stable/contrib/llvm-project/llvm/tools/opt/
H A DGraphPrinters.cpp37 getAnalysis<DominatorTreeWrapperPass>().print(dbgs());
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsOs16.cpp98 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");
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DLoopCacheAnalysis.cpp137 LLVM_DEBUG(dbgs().indent(2) << "Succesfully delinearized: " << *this
147 LLVM_DEBUG(dbgs().indent(2)
154 LLVM_DEBUG(dbgs().indent(2)
162 LLVM_DEBUG(dbgs().indent(2) << "No spacial reuse, different subscripts: "
177 LLVM_DEBUG(dbgs().indent(2)
188 dbgs().indent(2) << "Found spacial reuse.\n";
190 dbgs().indent(2) << "No spacial reuse.\n";
204 LLVM_DEBUG(dbgs().indent(2)
213 LLVM_DEBUG(dbgs().indent(2) << "No temporal reuse: no dependence\n");
218 LLVM_DEBUG(dbgs()
[all...]

Completed in 394 milliseconds

1234567891011>>