| /freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | MergeFunctions.cpp | 318 dbgs() << "MERGEFUNC-VERIFY: Started for first " << Max << " functions.\n"; in doFunctionalCheck()
334 dbgs() << "MERGEFUNC-VERIFY: Non-symmetric; triple: " << TripleNumber in doFunctionalCheck()
336 dbgs() << *F1 << '\n' << *F2 << '\n'; in doFunctionalCheck()
367 dbgs() << "MERGEFUNC-VERIFY: Non-transitive; triple: " in doFunctionalCheck()
369 dbgs() << "Res1, Res3, Res4: " << Res1 << ", " << Res3 << ", " in doFunctionalCheck()
371 dbgs() << *F1 << '\n' << *F2 << '\n' << *F3 << '\n'; in doFunctionalCheck()
378 dbgs() << "MERGEFUNC-VERIFY: " << (Valid ? "Passed." : "Failed.") << "\n"; in doFunctionalCheck()
448 LLVM_DEBUG(dbgs() << "size of module: " << M.size() << '\n'); in runOnModule()
449 LLVM_DEBUG(dbgs() << "size of worklist: " << Worklist.size() << '\n'); in runOnModule()
460 LLVM_DEBUG(dbgs() << "size of FnTree: " << FnTree.size() << '\n'); in runOnModule()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/ |
| H A D | JITLinkGeneric.cpp | 28 dbgs() << "Starting link phase 1 for graph " << G->getName() << "\n"; in linkPhase1()
36 dbgs() << "Link graph \"" << G->getName() << "\" pre-pruning:\n"; in linkPhase1()
37 G->dump(dbgs()); in linkPhase1()
43 dbgs() << "Link graph \"" << G->getName() << "\" post-pruning:\n"; in linkPhase1()
44 G->dump(dbgs()); in linkPhase1()
79 dbgs() << "Link graph \"" << G->getName() in linkPhase2()
81 G->dump(dbgs()); in linkPhase2()
89 LLVM_DEBUG(dbgs() << "Resolving symbols defined in " << G->getName() << "\n"); in linkPhase2()
99 dbgs() << "No external symbols for " << G->getName() in linkPhase2()
111 dbgs() << "Issuin in linkPhase2()
[all...] |
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopFlatten.cpp | 175 LLVM_DEBUG(dbgs() << "Found use of outer induction variable: "; U->dump()); in checkOuterInductionPhiUsers()
177 LLVM_DEBUG(dbgs() << "Did not match expected pattern, bailing\n"); in checkOuterInductionPhiUsers()
180 LLVM_DEBUG(dbgs() << "Use is optimisable\n"); in checkOuterInductionPhiUsers()
200 LLVM_DEBUG(dbgs() << "Checking linear i*M+j expression for: "; U->dump()); in matchLinearIVUser()
226 LLVM_DEBUG(dbgs() << "Matched multiplication: "; MatchedMul->dump()); in matchLinearIVUser()
227 LLVM_DEBUG(dbgs() << "Matched iteration count: "; MatchedItCount->dump()); in matchLinearIVUser()
234 LLVM_DEBUG(dbgs() << "Multiply has more than one use\n"); in matchLinearIVUser()
249 LLVM_DEBUG(dbgs() << "Looking for inner trip count: "; in matchLinearIVUser()
253 LLVM_DEBUG(dbgs() << "Found. This sse is optimisable\n"); in matchLinearIVUser()
259 LLVM_DEBUG(dbgs() << "Did not match expected pattern, bailing\n"); in matchLinearIVUser()
[all …]
|
| H A D | LoopVersioningLICM.cpp | 179 LLVM_DEBUG(dbgs() << " loop is not in loop-simplify form.\n"); in legalLoopStructure()
184 LLVM_DEBUG(dbgs() << " loop is not innermost\n"); in legalLoopStructure()
189 LLVM_DEBUG(dbgs() << " loop has multiple backedges\n"); in legalLoopStructure()
194 LLVM_DEBUG(dbgs() << " loop has multiple exiting block\n"); in legalLoopStructure()
201 LLVM_DEBUG(dbgs() << " loop is not bottom tested\n"); in legalLoopStructure()
207 LLVM_DEBUG(dbgs() << " Parallel loop is not worth versioning\n"); in legalLoopStructure()
212 LLVM_DEBUG(dbgs() << " loop depth is more then threshold\n"); in legalLoopStructure()
219 LLVM_DEBUG(dbgs() << " loop does not has trip count\n"); in legalLoopStructure()
281 LLVM_DEBUG(dbgs() << " Alias tracker type safety failed!\n"); in legalLoopMemoryAccesses()
286 LLVM_DEBUG(dbgs() << " No memory modified in loop body\n"); in legalLoopMemoryAccesses()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCBranchCoalescing.cpp | 234 LLVM_DEBUG(dbgs() << "Determine if branch block " in canCoalesceBranch()
240 LLVM_DEBUG(dbgs() << "TII unable to Analyze Branch - skip\n"); in canCoalesceBranch()
245 LLVM_DEBUG(dbgs() << "Looking at terminator : " << I << "\n"); in canCoalesceBranch()
263 LLVM_DEBUG(dbgs() << "Terminator contains implicit operands - skip : " in canCoalesceBranch()
270 LLVM_DEBUG(dbgs() << "EH Pad - skip\n"); in canCoalesceBranch()
275 LLVM_DEBUG(dbgs() << "Inline Asm Br - skip\n"); in canCoalesceBranch()
283 LLVM_DEBUG(dbgs() << "Does not form a triangle - skip\n"); in canCoalesceBranch()
289 LLVM_DEBUG(dbgs() << "Does not have 2 successors - skip\n"); in canCoalesceBranch()
308 LLVM_DEBUG(dbgs() << "Fall-through block contains code -- skip\n"); in canCoalesceBranch()
314 dbgs() in canCoalesceBranch()
[all …]
|
| H A D | PPCVSXSwapRemoval.cpp | 530 LLVM_DEBUG(dbgs() << "Swap vector when first built\n\n"); in gatherVectorInstructions()
590 LLVM_DEBUG(dbgs() << "\n*** Forming webs for swap removal ***\n\n"); in formWebs()
596 LLVM_DEBUG(dbgs() << "\n" << SwapVector[EntryIdx].VSEId << " "); in formWebs()
627 LLVM_DEBUG(dbgs() << format("Unioning %d with %d\n", in formWebs()
630 LLVM_DEBUG(dbgs() << " Def: "); in formWebs()
642 LLVM_DEBUG(dbgs() << "\n*** Rejecting webs for swap removal ***\n\n"); in recordUnoptimizableWebs()
661 dbgs() << format("Web %d rejected for physreg, partial reg, or not " in recordUnoptimizableWebs()
664 LLVM_DEBUG(dbgs() << " in " << EntryIdx << ": "); in recordUnoptimizableWebs()
666 LLVM_DEBUG(dbgs() << "\n"); in recordUnoptimizableWebs()
687 LLVM_DEBUG(dbgs() << format( in recordUnoptimizableWebs()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/ |
| H A D | SystemZMachineScheduler.cpp | 28 dbgs() << "{"; in dump()
30 HazardRec.dumpSU(SU, dbgs()); in dump()
32 dbgs() << ", "; in dump()
34 dbgs() << "}\n"; in dump()
82 LLVM_DEBUG(dbgs() << "** Entering " << printMBBReference(*NextMBB)); in enterMBB()
90 if (Loop && Loop->getHeader() == MBB) dbgs() << " (Loop header)"; in enterMBB()
91 dbgs() << ":\n";); in enterMBB()
101 LLVM_DEBUG(dbgs() << "** Continued scheduling from " in enterMBB()
110 LLVM_DEBUG(dbgs() << "** Emitting incoming branch: "; MI.dump();); in enterMBB()
121 LLVM_DEBUG(dbgs() << "** Leaving " << printMBBReference(*MBB) << "\n";); in leaveMBB()
[all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | MacroExpansionContext.cpp | 51 LLVM_DEBUG(llvm::dbgs() << "MacroExpands event: '"; in MacroExpands()
52 dumpTokenInto(PP, llvm::dbgs(), MacroName); in MacroExpands()
53 llvm::dbgs() in MacroExpands()
55 MacroNameBegin.print(llvm::dbgs(), SM); in MacroExpands()
56 llvm::dbgs() << ", expansion end at "; in MacroExpands()
57 ExpansionEnd.print(llvm::dbgs(), SM); llvm::dbgs() << '\n';); in MacroExpands()
66 LLVM_DEBUG(llvm::dbgs() << "maps "; in MacroExpands()
67 It->getFirst().print(llvm::dbgs(), SM); llvm::dbgs() << " to "; in MacroExpands()
68 It->getSecond().print(llvm::dbgs(), SM); in MacroExpands()
69 llvm::dbgs() << '\n';); in MacroExpands()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | AggressiveAntiDepBreaker.cpp | 135 LLVM_DEBUG(dbgs() << "AntiDep Critical-Path Registers:"); in AggressiveAntiDepBreaker()
137 : CriticalPathSet.set_bits()) dbgs() in AggressiveAntiDepBreaker()
139 LLVM_DEBUG(dbgs() << '\n'); in AggressiveAntiDepBreaker()
198 LLVM_DEBUG(dbgs() << "Observe: "); in Observe()
200 LLVM_DEBUG(dbgs() << "\tRegs:"); in Observe()
211 LLVM_DEBUG(if (State->GetGroup(Reg) != 0) dbgs() in Observe()
220 LLVM_DEBUG(dbgs() << '\n'); in Observe()
306 LLVM_DEBUG(if (!header && footer) dbgs() << footer); in HandleLastUse()
316 dbgs() << header << printReg(Reg, TRI); in HandleLastUse()
319 LLVM_DEBUG(dbgs() << "->g" << State->GetGroup(Reg) << tag); in HandleLastUse()
[all …]
|
| H A D | ScheduleDAG.cpp | 76 case Data: dbgs() << "Data"; break; in dump()
77 case Anti: dbgs() << "Anti"; break; in dump()
78 case Output: dbgs() << "Out "; break; in dump()
79 case Order: dbgs() << "Ord "; break; in dump()
84 dbgs() << " Latency=" << getLatency(); in dump()
86 dbgs() << " Reg=" << printReg(getReg(), TRI); in dump()
90 dbgs() << " Latency=" << getLatency(); in dump()
93 dbgs() << " Latency=" << getLatency(); in dump()
95 case Barrier: dbgs() << " Barrier"; break; in dump()
97 case MustAliasMem: dbgs() << " Memory"; break; in dump()
[all …]
|
| H A D | MIRCanonicalizerPass.cpp | 111 dbgs() << "Splicing "; in rescheduleLexographically()
113 dbgs() << " right before: "; in rescheduleLexographically()
203 LLVM_DEBUG(dbgs() << "Operand " << 0 << " of "; II->dump(); MO.dump();); in rescheduleCanonically()
252 dbgs() << "Splicing "; in rescheduleCanonically()
254 dbgs() << " right before: "; in rescheduleCanonically()
274 dbgs() << "Rescheduling Multi-Use Instructions Lexographically.";); in rescheduleCanonically()
282 dbgs() << "Rescheduling Idempotent Instructions Lexographically.";); in rescheduleCanonically()
362 dbgs() << "\n\n NEW BASIC BLOCK: " << MBB->getName() << " \n\n"; in runOnBasicBlock()
363 dbgs() << "\n\n================================================\n\n"; in runOnBasicBlock()
368 LLVM_DEBUG(dbgs() << "\n\n NEW BASIC BLOCK: " << MBB->getName() << "\n\n";); in runOnBasicBlock()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | Evaluator.cpp | 262 LLVM_DEBUG(dbgs() << "Too few arguments for function.\n"); in getFormalParams()
270 LLVM_DEBUG(dbgs() << "Can not convert function argument.\n"); in getFormalParams()
287 LLVM_DEBUG(dbgs() << "Failed to fold bitcast call expr\n"); in castCallResultIfNeeded()
301 LLVM_DEBUG(dbgs() << "Evaluating Instruction: " << *CurInst << "\n"); in EvaluateBlock()
305 LLVM_DEBUG(dbgs() << "Store is volatile! Can not evaluate.\n"); in EvaluateBlock()
311 LLVM_DEBUG(dbgs() << "Folding constant ptr expression: " << *Ptr); in EvaluateBlock()
313 LLVM_DEBUG(dbgs() << "; To: " << *Ptr << "\n"); in EvaluateBlock()
322 LLVM_DEBUG(dbgs() << "Store is not to global with unique initializer: " in EvaluateBlock()
331 LLVM_DEBUG(dbgs() << "Store value is too complex to evaluate store. " in EvaluateBlock()
342 dbgs() << "Found a Load! Volatile load, can not evaluate.\n"); in EvaluateBlock()
[all …]
|
| H A D | UnifyLoopExits.cpp | 103 LLVM_DEBUG(dbgs() << "added ext use for " << I.getName() << "(" in INITIALIZE_PASS_DEPENDENCY()
119 LLVM_DEBUG(dbgs() << "externally used: " << Def->getName() << "\n"); in INITIALIZE_PASS_DEPENDENCY()
124 LLVM_DEBUG(dbgs() << "predecessor " << In->getName() << ": "); in INITIALIZE_PASS_DEPENDENCY()
126 LLVM_DEBUG(dbgs() << "dominated\n"); in INITIALIZE_PASS_DEPENDENCY()
129 LLVM_DEBUG(dbgs() << "not dominated\n"); in INITIALIZE_PASS_DEPENDENCY()
134 LLVM_DEBUG(dbgs() << "external users:"); in INITIALIZE_PASS_DEPENDENCY()
136 LLVM_DEBUG(dbgs() << " " << U->getName()); in INITIALIZE_PASS_DEPENDENCY()
139 LLVM_DEBUG(dbgs() << "\n"); in INITIALIZE_PASS_DEPENDENCY()
168 dbgs() << "Found exit blocks:"; in unifyLoopExits()
170 dbgs() << " " << Exit->getName(); in unifyLoopExits()
[all …]
|
| H A D | FixIrreducible.cpp | 131 LLVM_DEBUG(dbgs() << "child loop: " << Child->getHeader()->getName() in INITIALIZE_PASS_DEPENDENCY()
141 LLVM_DEBUG(dbgs() << "moved block from child: " << BB->getName() in INITIALIZE_PASS_DEPENDENCY()
151 LLVM_DEBUG(dbgs() << "subsumed child loop (common header)\n"); in INITIALIZE_PASS_DEPENDENCY()
157 LLVM_DEBUG(dbgs() << "added child loop to new loop\n"); in INITIALIZE_PASS_DEPENDENCY()
183 dbgs() << "Found predecessors:"; in createNaturalLoopInternal()
185 dbgs() << " " << P->getName(); in createNaturalLoopInternal()
187 dbgs() << "\n"); in createNaturalLoopInternal()
215 LLVM_DEBUG(dbgs() << "added guard block: " << G->getName() << "\n"); in createNaturalLoopInternal()
223 LLVM_DEBUG(dbgs() << "moved block from parent: " << BB->getName() in createNaturalLoopInternal()
227 LLVM_DEBUG(dbgs() << "adde in createNaturalLoopInternal()
[all...] |
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | DependenceAnalysis.cpp | 307 LLVM_DEBUG(dbgs() << "Before normalizing negative direction vectors:\n"; in normalize()
308 dump(dbgs());); in normalize()
326 LLVM_DEBUG(dbgs() << "After normalizing negative direction vectors:\n"; in normalize()
327 dump(dbgs());); in normalize()
503 LLVM_DEBUG(dbgs() << "\tintersect constraints\n"); in intersectConstraints()
504 LLVM_DEBUG(dbgs() << "\t X ="; X->dump(dbgs())); in intersectConstraints()
505 LLVM_DEBUG(dbgs() << "\t Y ="; Y->dump(dbgs())); in intersectConstraints()
521 LLVM_DEBUG(dbgs() << "\t intersect 2 distances\n"); in intersectConstraints()
548 LLVM_DEBUG(dbgs() << "\t intersect 2 lines\n"); in intersectConstraints()
553 LLVM_DEBUG(dbgs() << "\t\tsame slope\n"); in intersectConstraints()
[all …]
|
| H A D | LoopCacheAnalysis.cpp | 118 LLVM_DEBUG(dbgs() << "Trip count of loop " << L.getName() in computeTripCount()
155 LLVM_DEBUG(dbgs().indent(2) << "Succesfully delinearized: " << *this in IndexedReference()
165 LLVM_DEBUG(dbgs().indent(2) in hasSpacialReuse()
172 LLVM_DEBUG(dbgs().indent(2) in hasSpacialReuse()
180 LLVM_DEBUG(dbgs().indent(2) << "No spacial reuse, different subscripts: " in hasSpacialReuse()
195 LLVM_DEBUG(dbgs().indent(2) in hasSpacialReuse()
206 dbgs().indent(2) << "Found spacial reuse.\n"; in hasSpacialReuse()
208 dbgs().indent(2) << "No spacial reuse.\n"; in hasSpacialReuse()
221 LLVM_DEBUG(dbgs().indent(2) in hasTemporalReuse()
230 LLVM_DEBUG(dbgs().indent(2) << "No temporal reuse: no dependence\n"); in hasTemporalReuse()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
| H A D | LostDebugLocObserver.cpp | 21 LOC_DEBUG(dbgs() << ".. No debug info was present\n"); in analyzeDebugLocations()
26 dbgs() << ".. No instructions to carry debug info (dead code?)\n"); in analyzeDebugLocations()
30 LOC_DEBUG(dbgs() << ".. Searching " << PotentialMIsForDebugLocs.size() in analyzeDebugLocations()
40 dbgs() << ".. Assuming line-0 location covers remainder (if any)\n"); in analyzeDebugLocations()
44 LOC_DEBUG(dbgs() << ".. .. found " << MI->getDebugLoc() << " in " << *MI); in analyzeDebugLocations()
54 dbgs() << ".. Lost locations:\n"; in analyzeDebugLocations()
56 dbgs() << ".. .. "; in analyzeDebugLocations()
57 Loc.print(dbgs()); in analyzeDebugLocations()
58 dbgs() << "\n"; in analyzeDebugLocations()
60 dbgs() << ".. MIs with matched locations:\n"; in analyzeDebugLocations()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/ARM/ |
| H A D | MVELaneInterleavingPass.cpp | 131 LLVM_DEBUG(dbgs() << "Beneficial due to " << *E << "\n"); in isProfitableToInterleave()
137 LLVM_DEBUG(dbgs() << "Beneficial due to " << *T << "\n"); in isProfitableToInterleave()
147 LLVM_DEBUG(dbgs() << "Not beneficial due to " << *E << "\n"); in isProfitableToInterleave()
156 LLVM_DEBUG(dbgs() << "tryInterleave from " << *Start << "\n"); in tryInterleave()
268 LLVM_DEBUG(dbgs() << " Unhandled instruction: " << *I << "\n"); in tryInterleave()
277 dbgs() << "Found group:\n Exts:\n"; in tryInterleave()
279 dbgs() << " " << *I << "\n"; in tryInterleave()
280 dbgs() << " Ops:\n"; in tryInterleave()
282 dbgs() << " " << *I << "\n"; in tryInterleave()
283 dbgs() << " OtherLeafs:\n"; in tryInterleave()
[all …]
|
| H A D | MVETailPredication.cpp | 139 LLVM_DEBUG(dbgs() << "ARM TP: Not a v8.1m.main+mve target.\n"); in runOnLoop()
173 LLVM_DEBUG(dbgs() << "ARM TP: Running on Loop: " << *L << *Setup << "\n"); in runOnLoop()
221 LLVM_DEBUG(dbgs() << "ARM TP: element count must be loop invariant.\n"); in IsSafeActiveMask()
235 LLVM_DEBUG(dbgs() << "ARM TP: induction not an add expr: "; IVExpr->dump()); in IsSafeActiveMask()
240 LLVM_DEBUG(dbgs() << "ARM TP: phi not part of this loop\n"); in IsSafeActiveMask()
245 LLVM_DEBUG(dbgs() << "ARM TP: induction step is not a constant: "; in IsSafeActiveMask()
251 LLVM_DEBUG(dbgs() << "ARM TP: Step value " << StepValue in IsSafeActiveMask()
259 LLVM_DEBUG(dbgs() << "ARM TP: Constant tripcount expected in " in IsSafeActiveMask()
276 LLVM_DEBUG(dbgs() << "ARM TP: inconsistent constant tripcount values: " in IsSafeActiveMask()
306 dbgs() << "ARM TP: Analysing overflow behaviour for:\n"; in IsSafeActiveMask()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/M68k/ |
| H A D | M68kISelDAGToDAG.cpp | 152 dbgs() << "M68kISelAddressMode " << this; in dump()
153 dbgs() << "\nDisp: " << Disp; in dump()
154 dbgs() << ", BaseReg: "; in dump()
158 dbgs() << "null"; in dump()
159 dbgs() << ", BaseFI: " << BaseFrameIndex; in dump()
160 dbgs() << ", IndexReg: "; in dump()
164 dbgs() << "null"; in dump()
165 dbgs() << ", Scale: " << Scale; in dump()
167 dbgs() << '\n'; in dump()
670 LLVM_DEBUG(dbgs() << "Selecting: "; Node->dump(CurDAG); dbgs() << '\n'); in Select()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64PromoteConstant.cpp | 122 LLVM_DEBUG(dbgs() << getPassName() << '\n'); in runOnModule()
397 LLVM_DEBUG(dbgs() << "Insertion point dominated by:\n"); in isDominated()
398 LLVM_DEBUG(IPI.first->print(dbgs())); in isDominated()
399 LLVM_DEBUG(dbgs() << '\n'); in isDominated()
425 LLVM_DEBUG(dbgs() << "Merge insertion point with:\n"); in tryAndMerge()
426 LLVM_DEBUG(IPI->first->print(dbgs())); in tryAndMerge()
427 LLVM_DEBUG(dbgs() << "\nat considered insertion point.\n"); in tryAndMerge()
447 LLVM_DEBUG(dbgs() << "Merge insertion point with:\n"); in tryAndMerge()
448 LLVM_DEBUG(IPI->first->print(dbgs())); in tryAndMerge()
449 LLVM_DEBUG(dbgs() << '\n'); in tryAndMerge()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | R600MachineCFGStructurizer.cpp | 58 #define SHOWNEWINSTR(i) LLVM_DEBUG(dbgs() << "New instr: " << *i << "\n");
61 LLVM_DEBUG(dbgs() << msg << "BB" << b->getNumber() << "size " << b->size(); \
62 dbgs() << "\n";);
66 dbgs() << msg << "BB" << b->getNumber() << "size " << b->size(); \
67 b->print(dbgs()); \
68 dbgs() << "\n"; \
142 LLVM_DEBUG(dbgs() << "LoopInfo:\n"; PrintLoopinfo(*MLI);); in runOnMachineFunction()
144 LLVM_DEBUG(MDT->print(dbgs());); in runOnMachineFunction()
146 LLVM_DEBUG(PDT->print(dbgs());); in runOnMachineFunction()
166 dbgs() << "BB" << (*iterBlk)->getNumber(); in printOrderedBlocks()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/ |
| H A D | GIMatchTableExecutorImpl.h | 69 dbgs() << CurrentIdx << ": Rejected\n"); in executeMatchTable()
74 dbgs() << CurrentIdx << ": Resume at " << CurrentIdx << " (" in executeMatchTable()
147 dbgs() << CurrentIdx << ": Begin try-block\n"); in executeMatchTable()
165 dbgs() << CurrentIdx << ": Not a register\n"); in executeMatchTable()
172 dbgs() << CurrentIdx << ": Is a physical register\n"); in executeMatchTable()
192 dbgs() << CurrentIdx << ": MIs[" << NewInsnID in executeMatchTable()
201 dbgs() << CurrentIdx in executeMatchTable()
223 dbgs() << CurrentIdx << ": GIM_CheckOpcode(MIs[" << InsnID in executeMatchTable()
225 if (MatcherOpcode == GIM_CheckOpcodeIsEither) dbgs() in executeMatchTable()
227 dbgs() << ") // Got=" << Opcode << "\n";); in executeMatchTable()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanSLP.cpp | 74 LLVM_DEBUG(dbgs() << "VPSLP: not all operands are VPInstructions\n"); in areVectorizable()
91 LLVM_DEBUG(dbgs() << "VPSLP: Opcodes do not agree \n"); in areVectorizable()
99 LLVM_DEBUG(dbgs() << "VPSLP: operands in different BBs\n"); in areVectorizable()
105 LLVM_DEBUG(dbgs() << "VPSLP: Some operands have multiple users.\n"); in areVectorizable()
128 dbgs() << "VPSLP: instruction modifying memory between loads\n"); in areVectorizable()
137 LLVM_DEBUG(dbgs() << "VPSLP: only simple loads are supported.\n"); in areVectorizable()
147 LLVM_DEBUG(dbgs() << "VPSLP: only simple stores are supported.\n"); in areVectorizable()
243 LLVM_DEBUG(dbgs() << " getBest\n"); in getBest()
246 LLVM_DEBUG(dbgs() << " Candidates for " in getBest()
252 LLVM_DEBUG(dbgs() << *cast<VPInstruction>(Candidate)->getUnderlyingInstr() in getBest()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/ |
| H A D | CodeGenHwModes.cpp | 40 void HwMode::dump() const { dbgs() << Name << ": " << Features << '\n'; } in dump()
61 dbgs() << '{'; in dump()
63 dbgs() << " (" << P.first << ',' << P.second->getName() << ')'; in dump()
64 dbgs() << " }\n"; in dump()
102 dbgs() << "Modes: {\n"; in dump()
104 dbgs() << " "; in dump()
107 dbgs() << "}\n"; in dump()
109 dbgs() << "ModeIds: {\n"; in dump()
111 dbgs() << " " << P.first->getName() << " -> " << P.second << '\n'; in dump()
112 dbgs() << "}\n"; in dump()
[all …]
|