| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopVersioningLICM.cpp | 176 LLVM_DEBUG(dbgs() << " loop is not in loop-simplify form.\n"); in legalLoopStructure()
181 LLVM_DEBUG(dbgs() << " loop is not innermost\n"); in legalLoopStructure()
186 LLVM_DEBUG(dbgs() << " loop has multiple backedges\n"); in legalLoopStructure()
191 LLVM_DEBUG(dbgs() << " loop has multiple exiting block\n"); in legalLoopStructure()
198 LLVM_DEBUG(dbgs() << " loop is not bottom tested\n"); in legalLoopStructure()
204 LLVM_DEBUG(dbgs() << " Parallel loop is not worth versioning\n"); in legalLoopStructure()
209 LLVM_DEBUG(dbgs() << " loop depth is more than threshold\n"); in legalLoopStructure()
216 LLVM_DEBUG(dbgs() << " loop does not have trip count\n"); in legalLoopStructure()
278 LLVM_DEBUG(dbgs() << " Alias tracker type safety failed!\n"); in legalLoopMemoryAccesses()
283 LLVM_DEBUG(dbgs() << " No memory modified in loop body\n"); in legalLoopMemoryAccesses()
[all …]
|
| 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 | MergeICmps.cpp | 139 LLVM_DEBUG(dbgs() << "load\n"); in visitICmpLoadOperand()
141 LLVM_DEBUG(dbgs() << "used outside of block\n"); in visitICmpLoadOperand()
146 LLVM_DEBUG(dbgs() << "volatile or atomic\n"); in visitICmpLoadOperand()
151 LLVM_DEBUG(dbgs() << "from non-zero AddressSpace\n"); in visitICmpLoadOperand()
156 LLVM_DEBUG(dbgs() << "not dereferenceable\n"); in visitICmpLoadOperand()
166 LLVM_DEBUG(dbgs() << "GEP\n"); in visitICmpLoadOperand()
168 LLVM_DEBUG(dbgs() << "used outside of block\n"); in visitICmpLoadOperand()
314 LLVM_DEBUG(dbgs() << "cmp has several uses\n"); in visitICmp()
319 LLVM_DEBUG(dbgs() << "cmp " in visitICmp()
344 LLVM_DEBUG(dbgs() << "branch\n"); in visitCmpBlock()
[all …]
|
| H A D | LoopTermFold.cpp | 55 LLVM_DEBUG(dbgs() << "Cannot fold on non-innermost loop\n"); in canFoldTermCondOfLoop()
60 LLVM_DEBUG(dbgs() << "Cannot fold on non-simple loop\n"); in canFoldTermCondOfLoop()
65 LLVM_DEBUG(dbgs() << "Cannot fold on backedge that is loop variant\n"); in canFoldTermCondOfLoop()
75 LLVM_DEBUG( in canFoldTermCondOfLoop()
80 LLVM_DEBUG( in canFoldTermCondOfLoop()
133 LLVM_DEBUG(dbgs() << "IV of phi '" << PN in canFoldTermCondOfLoop()
141 LLVM_DEBUG(dbgs() << "SCEV of phi '" << PN in canFoldTermCondOfLoop()
163 LLVM_DEBUG( in canFoldTermCondOfLoop()
171 LLVM_DEBUG( in canFoldTermCondOfLoop()
180 LLVM_DEBUG(dbgs() << "Can not prove poison safety for IV " << PN << "\n"); in canFoldTermCondOfLoop()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | MergeFunctions.cpp | 466 LLVM_DEBUG(doFunctionalCheck(Worklist)); in run()
468 LLVM_DEBUG(dbgs() << "size of module: " << M.size() << '\n'); in run()
469 LLVM_DEBUG(dbgs() << "size of worklist: " << Worklist.size() << '\n'); in run()
480 LLVM_DEBUG(dbgs() << "size of FnTree: " << FnTree.size() << '\n'); in run()
518 LLVM_DEBUG( in eraseInstsUnrelatedToPDI()
524 LLVM_DEBUG(dbgs() << " Deleting Instruction: "); in eraseInstsUnrelatedToPDI()
525 LLVM_DEBUG(I->print(dbgs())); in eraseInstsUnrelatedToPDI()
526 LLVM_DEBUG(dbgs() << "\n"); in eraseInstsUnrelatedToPDI()
533 LLVM_DEBUG(dbgs() << " Deleting DbgVariableRecord "); in eraseInstsUnrelatedToPDI()
534 LLVM_DEBUG(DVR->print(dbgs())); in eraseInstsUnrelatedToPDI()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCVSXSwapRemoval.cpp | 528 LLVM_DEBUG(dbgs() << "Swap vector when first built\n\n"); in gatherVectorInstructions()
529 LLVM_DEBUG(dumpSwapVector()); in gatherVectorInstructions()
588 LLVM_DEBUG(dbgs() << "\n*** Forming webs for swap removal ***\n\n"); in formWebs()
594 LLVM_DEBUG(dbgs() << "\n" << SwapVector[EntryIdx].VSEId << " "); in formWebs()
595 LLVM_DEBUG(MI->dump()); in formWebs()
625 LLVM_DEBUG(dbgs() << format("Unioning %d with %d\n", in formWebs()
628 LLVM_DEBUG(dbgs() << " Def: "); in formWebs()
629 LLVM_DEBUG(DefMI->dump()); in formWebs()
640 LLVM_DEBUG(dbgs() << "\n*** Rejecting webs for swap removal ***\n\n"); in recordUnoptimizableWebs()
658 LLVM_DEBUG( in recordUnoptimizableWebs()
[all …]
|
| H A D | PPCBranchCoalescing.cpp | 232 LLVM_DEBUG(dbgs() << "Determine if branch block " in canCoalesceBranch()
238 LLVM_DEBUG(dbgs() << "TII unable to Analyze Branch - skip\n"); in canCoalesceBranch()
243 LLVM_DEBUG(dbgs() << "Looking at terminator : " << I << "\n"); in canCoalesceBranch()
261 LLVM_DEBUG(dbgs() << "Terminator contains implicit operands - skip : " in canCoalesceBranch()
268 LLVM_DEBUG(dbgs() << "EH Pad - skip\n"); in canCoalesceBranch()
273 LLVM_DEBUG(dbgs() << "Inline Asm Br - skip\n"); in canCoalesceBranch()
281 LLVM_DEBUG(dbgs() << "Does not form a triangle - skip\n"); in canCoalesceBranch()
287 LLVM_DEBUG(dbgs() << "Does not have 2 successors - skip\n"); in canCoalesceBranch()
306 LLVM_DEBUG(dbgs() << "Fall-through block contains code -- skip\n"); in canCoalesceBranch()
311 LLVM_DEBUG( in canCoalesceBranch()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | AggressiveAntiDepBreaker.cpp | 134 LLVM_DEBUG(dbgs() << "AntiDep Critical-Path Registers:"); in AggressiveAntiDepBreaker()
135 LLVM_DEBUG(for (unsigned r in AggressiveAntiDepBreaker()
138 LLVM_DEBUG(dbgs() << '\n'); in AggressiveAntiDepBreaker()
197 LLVM_DEBUG(dbgs() << "Observe: "); in Observe()
198 LLVM_DEBUG(MI.dump()); in Observe()
199 LLVM_DEBUG(dbgs() << "\tRegs:"); in Observe()
210 LLVM_DEBUG(if (State->GetGroup(Reg) != 0) dbgs() in Observe()
219 LLVM_DEBUG(dbgs() << '\n'); in Observe()
305 LLVM_DEBUG(if (!header && footer) dbgs() << footer); in HandleLastUse()
314 LLVM_DEBUG(if (header) { in HandleLastUse()
[all …]
|
| H A D | VLIWMachineScheduler.cpp | 182 LLVM_DEBUG(dbgs() << "Packet[" << TotalPackets << "]:\n"); in reserveResources()
184 LLVM_DEBUG(dbgs() << "\t[" << i << "] SU("); in reserveResources()
185 LLVM_DEBUG(dbgs() << Packet[i]->NodeNum << ")\t"); in reserveResources()
186 LLVM_DEBUG(Packet[i]->getInstr()->dump()); in reserveResources()
202 LLVM_DEBUG(dbgs() << "********** MI Converging Scheduling VLIW " in schedule()
220 LLVM_DEBUG({ in schedule()
227 LLVM_DEBUG({ in schedule()
234 LLVM_DEBUG(dump()); in schedule()
242 LLVM_DEBUG( in schedule()
262 LLVM_DEBUG({ in schedule()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | Evaluator.cpp | 260 LLVM_DEBUG(dbgs() << "Signature mismatch.\n"); in getFormalParams()
279 LLVM_DEBUG(dbgs() << "Evaluating Instruction: " << *CurInst << "\n"); in EvaluateBlock()
283 LLVM_DEBUG(dbgs() << "Store is volatile! Can not evaluate.\n"); in EvaluateBlock()
289 LLVM_DEBUG(dbgs() << "Folding constant ptr expression: " << *Ptr); in EvaluateBlock()
291 LLVM_DEBUG(dbgs() << "; To: " << *Ptr << "\n"); in EvaluateBlock()
300 LLVM_DEBUG(dbgs() << "Store is not to global with unique initializer: " in EvaluateBlock()
309 LLVM_DEBUG(dbgs() << "Store value is too complex to evaluate store. " in EvaluateBlock()
319 LLVM_DEBUG( in EvaluateBlock()
328 LLVM_DEBUG(dbgs() << "Found a constant pointer expression, constant " in EvaluateBlock()
334 LLVM_DEBUG( in EvaluateBlock()
[all …]
|
| H A D | FixIrreducible.cpp | 145 LLVM_DEBUG(dbgs() << "child loop: " << Child->getHeader()->getName() in INITIALIZE_PASS_DEPENDENCY()
154 LLVM_DEBUG(dbgs() << "moved block from child: " << BB->getName() in INITIALIZE_PASS_DEPENDENCY()
164 LLVM_DEBUG(dbgs() << "subsumed child loop (common header)\n"); in INITIALIZE_PASS_DEPENDENCY()
170 LLVM_DEBUG(dbgs() << "added child loop to new loop\n"); in INITIALIZE_PASS_DEPENDENCY()
198 LLVM_DEBUG(dbgs() << "added guard block to loop: " << G->getName() << "\n"); in updateLoopInfo()
205 LLVM_DEBUG(dbgs() << "moved block from parent: " << BB->getName() in updateLoopInfo()
209 LLVM_DEBUG(dbgs() << "added block from child: " << BB->getName() << "\n"); in updateLoopInfo()
212 LLVM_DEBUG(dbgs() << "header for new loop: " in updateLoopInfo()
217 LLVM_DEBUG(dbgs() << "Verify new loop.\n"; NewLoop->print(dbgs())); in updateLoopInfo()
220 LLVM_DEBUG(dbgs() << "Verify parent loop.\n"; ParentLoop->print(dbgs())); in updateLoopInfo()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | DependenceAnalysis.cpp | 326 LLVM_DEBUG(dbgs() << "Before normalizing negative direction vectors:\n"; in normalize()
345 LLVM_DEBUG(dbgs() << "After normalizing negative direction vectors:\n"; in normalize()
522 LLVM_DEBUG(dbgs() << "\tintersect constraints\n"); in intersectConstraints()
523 LLVM_DEBUG(dbgs() << "\t X ="; X->dump(dbgs())); in intersectConstraints()
524 LLVM_DEBUG(dbgs() << "\t Y ="; Y->dump(dbgs())); in intersectConstraints()
540 LLVM_DEBUG(dbgs() << "\t intersect 2 distances\n"); in intersectConstraints()
567 LLVM_DEBUG(dbgs() << "\t intersect 2 lines\n"); in intersectConstraints()
572 LLVM_DEBUG(dbgs() << "\t\tsame slope\n"); in intersectConstraints()
586 LLVM_DEBUG(dbgs() << "\t\tdifferent slopes\n"); in intersectConstraints()
608 LLVM_DEBUG(dbgs() << "\t\tXtop = " << Xtop << "\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()
204 LLVM_DEBUG({ in hasSpacialReuse()
221 LLVM_DEBUG(dbgs().indent(2) in hasTemporalReuse()
230 LLVM_DEBUG(dbgs().indent(2) << "No temporal reuse: no dependence\n"); in hasTemporalReuse()
235 LLVM_DEBUG(dbgs().indent(2) << "Found temporal reuse\n"); in hasTemporalReuse()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/VE/ |
| H A D | LVLGen.cpp | 77 LLVM_DEBUG(dbgs() << "Vector instruction found: "); in runOnMachineBasicBlock()
78 LLVM_DEBUG(MI->dump()); in runOnMachineBasicBlock()
79 LLVM_DEBUG(dbgs() << "Vector length is " << RegName(Reg) << ". "); in runOnMachineBasicBlock()
80 LLVM_DEBUG(dbgs() << "Current VL is " in runOnMachineBasicBlock()
87 LLVM_DEBUG(dbgs() << "Generate a LVL instruction to load " in runOnMachineBasicBlock()
94 LLVM_DEBUG(dbgs() << "Reuse current VL.\n"); in runOnMachineBasicBlock()
104 LLVM_DEBUG(dbgs() << RegName(RegForVL) << " is needed to be updated: "); in runOnMachineBasicBlock()
105 LLVM_DEBUG(MI->dump()); in runOnMachineBasicBlock()
116 LLVM_DEBUG(dbgs() << "********** Begin LVLGen **********\n"); in runOnMachineFunction()
117 LLVM_DEBUG(dbgs() << "********** Function: " << F.getName() << '\n'); in runOnMachineFunction()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64PromoteConstant.cpp | 118 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 …]
|
| H A D | AArch64ConditionalCompares.cpp | 312 LLVM_DEBUG(dbgs() << "Flags not used by terminator: " << *I); in findConvertibleCompare()
330 LLVM_DEBUG(dbgs() << "Immediate out of range for ccmp: " << *I); in findConvertibleCompare()
341 LLVM_DEBUG(dbgs() << "Can't convert compare with live destination: " in findConvertibleCompare()
359 LLVM_DEBUG(dbgs() << "Can't create ccmp with multiple uses: " << *I); in findConvertibleCompare()
365 LLVM_DEBUG(dbgs() << "Not convertible compare: " << *I); in findConvertibleCompare()
370 LLVM_DEBUG(dbgs() << "Flags not defined in " << printMBBReference(*MBB) in findConvertibleCompare()
385 LLVM_DEBUG(dbgs() << printMBBReference(*MBB) << " has live-ins.\n"); in canSpeculateInstrs()
398 LLVM_DEBUG(dbgs() << printMBBReference(*MBB) << " has more than " in canSpeculateInstrs()
405 LLVM_DEBUG(dbgs() << "Can't hoist: " << I); in canSpeculateInstrs()
413 LLVM_DEBUG(dbgs() << "Won't speculate load: " << I); in canSpeculateInstrs()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/ |
| H A D | JITLinkGeneric.cpp | 24 LLVM_DEBUG({ in linkPhase1()
32 LLVM_DEBUG({ in linkPhase1()
39 LLVM_DEBUG({ in linkPhase1()
75 LLVM_DEBUG({ in linkPhase2()
86 LLVM_DEBUG(dbgs() << "Resolving symbols defined in " << G->getName() << "\n"); in linkPhase2()
95 LLVM_DEBUG({ in linkPhase2()
107 LLVM_DEBUG({ in linkPhase2()
134 LLVM_DEBUG({ in linkPhase3()
145 LLVM_DEBUG({ in linkPhase3()
154 LLVM_DEBUG({ in linkPhase3()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/M68k/ |
| H A D | M68kISelDAGToDAG.cpp | 670 LLVM_DEBUG(dbgs() << "Selecting: "; Node->dump(CurDAG); dbgs() << '\n'); in Select()
673 LLVM_DEBUG(dbgs() << "== "; Node->dump(CurDAG); dbgs() << '\n'); in Select()
700 LLVM_DEBUG(dbgs() << "Selecting AddrType::ARIPI: "); in SelectARIPI()
701 LLVM_DEBUG(dbgs() << "NOT IMPLEMENTED\n"); in SelectARIPI()
706 LLVM_DEBUG(dbgs() << "Selecting AddrType::ARIPD: "); in SelectARIPD()
707 LLVM_DEBUG(dbgs() << "NOT IMPLEMENTED\n"); in SelectARIPD()
727 LLVM_DEBUG(dbgs() << "Selecting AddrType::ARID: "); in SelectARID()
734 LLVM_DEBUG(dbgs() << "REJECT: Cannot match PC relative address\n"); in SelectARID()
740 LLVM_DEBUG(dbgs() << "SUCCESS matched FI\n"); in SelectARID()
745 LLVM_DEBUG(dbgs() << "REJECT: Cannot match Index\n"); in SelectARID()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanSLP.cpp | 130 LLVM_DEBUG(dbgs() << "VPSLP: not all operands are VPInstructions\n"); in areVectorizable()
147 LLVM_DEBUG(dbgs() << "VPSLP: Opcodes do not agree \n"); in areVectorizable()
155 LLVM_DEBUG(dbgs() << "VPSLP: operands in different BBs\n"); in areVectorizable()
161 LLVM_DEBUG(dbgs() << "VPSLP: Some operands have multiple users.\n"); in areVectorizable()
183 LLVM_DEBUG( in areVectorizable()
193 LLVM_DEBUG(dbgs() << "VPSLP: only simple loads are supported.\n"); in areVectorizable()
203 LLVM_DEBUG(dbgs() << "VPSLP: only simple stores are supported.\n"); in areVectorizable()
299 LLVM_DEBUG(dbgs() << " getBest\n"); in getBest()
302 LLVM_DEBUG(dbgs() << " Candidates for " in getBest()
308 LLVM_DEBUG(dbgs() << *cast<VPInstruction>(Candidate)->getUnderlyingInstr() in getBest()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | GenericUniformityImpl.h | 113 LLVM_DEBUG(dbgs() << "ModifiedPO(" << POIndex[&BB]
550 LLVM_DEBUG(dbgs() << "labeling " << Context.print(&SuccBlock) << ":\n" in computeJoin()
562 LLVM_DEBUG(dbgs() << "\tfresh label: " << SuccIdx << "\n"); in computeJoin()
568 LLVM_DEBUG(dbgs() << "\tnew label: " << Context.print(&PushedLabel) in computeJoin()
576 LLVM_DEBUG(dbgs() << "\tnew label: " << Context.print(&SuccBlock) << "\n"); in computeJoin()
590 LLVM_DEBUG(dbgs() << "\tDivergent cycle exit: " << Context.print(&ExitBlock) in visitCycleExitEdge()
602 LLVM_DEBUG(dbgs() << "\tDivergent join: " << Context.print(&SuccBlock) in visitEdge()
610 LLVM_DEBUG(dbgs() << "SDA:computeJoinPoints: " in computeJoinPoints()
642 LLVM_DEBUG(dbgs() << "\tImmediate divergent cycle exit: " in computeJoinPoints()
665 LLVM_DEBUG(dbgs() << "Current labels:\n"; printDefs(dbgs())); in computeJoinPoints()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/ARM/ |
| H A D | MVETailPredication.cpp | 137 LLVM_DEBUG(dbgs() << "ARM TP: Not a v8.1m.main+mve target.\n"); in runOnLoop()
171 LLVM_DEBUG(dbgs() << "ARM TP: Running on Loop: " << *L << *Setup << "\n"); in runOnLoop()
219 LLVM_DEBUG(dbgs() << "ARM TP: element count must be loop invariant.\n"); in IsSafeActiveMask()
233 LLVM_DEBUG(dbgs() << "ARM TP: induction not an add expr: "; IVExpr->dump()); in IsSafeActiveMask()
238 LLVM_DEBUG(dbgs() << "ARM TP: phi not part of this loop\n"); in IsSafeActiveMask()
243 LLVM_DEBUG(dbgs() << "ARM TP: induction step is not a constant: "; in IsSafeActiveMask()
249 LLVM_DEBUG(dbgs() << "ARM TP: Step value " << StepValue in IsSafeActiveMask()
257 LLVM_DEBUG(dbgs() << "ARM TP: Constant tripcount expected in " in IsSafeActiveMask()
274 LLVM_DEBUG(dbgs() << "ARM TP: inconsistent constant tripcount values: " in IsSafeActiveMask()
305 LLVM_DEBUG({ in IsSafeActiveMask()
[all …]
|
| H A D | ARMLowOverheadLoops.cpp | 241 LLVM_DEBUG(dbgs() << "ARM Loops: Adding VPT Predicate: " << *MI); in addPredicate()
246 LLVM_DEBUG(dbgs() << "ARM Loops: Resetting VPT Predicate: " << *MI); in resetPredicate()
352 LLVM_DEBUG(dbgs() << "ARM Loops: Can't convert: " << *MI); in isValid()
579 LLVM_DEBUG(dbgs() << "ARM Loops: Able to remove: " << *MI in INITIALIZE_PASS()
588 LLVM_DEBUG(for (auto *Dead : Killed) in INITIALIZE_PASS()
598 LLVM_DEBUG(if (VCTPs.empty()) in ValidateTailPredicate()
609 LLVM_DEBUG(dbgs() << "ARM Loops: tail-predication is disabled\n"); in ValidateTailPredicate()
614 LLVM_DEBUG(dbgs() << "ARM Loops: Invalid VPT state.\n"); in ValidateTailPredicate()
619 LLVM_DEBUG(dbgs() << "ARM Loops: Invalid live outs.\n"); in ValidateTailPredicate()
641 LLVM_DEBUG(dbgs() << "ARM Loops: VCTP operand is defined in the loop.\n"); in ValidateTailPredicate()
[all …]
|
| H A D | MVELaneInterleavingPass.cpp | 125 LLVM_DEBUG(dbgs() << "Beneficial due to " << *E << "\n"); in isProfitableToInterleave()
131 LLVM_DEBUG(dbgs() << "Beneficial due to " << *T << "\n"); in isProfitableToInterleave()
141 LLVM_DEBUG(dbgs() << "Not beneficial due to " << *E << "\n"); in isProfitableToInterleave()
150 LLVM_DEBUG(dbgs() << "tryInterleave from " << *Start << "\n"); in tryInterleave()
262 LLVM_DEBUG(dbgs() << " Unhandled instruction: " << *I << "\n"); in tryInterleave()
270 LLVM_DEBUG({ in tryInterleave()
296 LLVM_DEBUG(dbgs() << "Using VT:" << *VT << "\n"); in tryInterleave()
304 LLVM_DEBUG(dbgs() << " Type is unsupported\n"); in tryInterleave()
309 LLVM_DEBUG(dbgs() << " Type not double sized\n"); in tryInterleave()
314 LLVM_DEBUG(dbgs() << " Wrong type on " << *I << "\n"); in tryInterleave()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | UnicodeCharRanges.h | 74 LLVM_DEBUG(dbgs() << "Upper bound 0x"); in rangesAreValid()
75 LLVM_DEBUG(dbgs().write_hex(Prev)); in rangesAreValid()
76 LLVM_DEBUG(dbgs() << " should be less than succeeding lower bound 0x"); in rangesAreValid()
77 LLVM_DEBUG(dbgs().write_hex(I->Lower) << "\n"); in rangesAreValid()
81 LLVM_DEBUG(dbgs() << "Upper bound 0x"); in rangesAreValid()
82 LLVM_DEBUG(dbgs().write_hex(I->Lower)); in rangesAreValid()
83 LLVM_DEBUG(dbgs() << " should not be less than lower bound 0x"); in rangesAreValid()
84 LLVM_DEBUG(dbgs().write_hex(I->Upper) << "\n"); in rangesAreValid()
|
| H A D | GenericDomTreeConstruction.h | 368 LLVM_DEBUG(dbgs() << "\t\tLooking for trivial roots\n"); in FindRoots()
385 LLVM_DEBUG(dbgs() << "Found a new trivial root: " << BlockNamePrinter(N) in FindRoots()
387 LLVM_DEBUG(dbgs() << "Last visited node: " in FindRoots()
392 LLVM_DEBUG(dbgs() << "\t\tLooking for non-trivial roots\n"); in FindRoots()
437 LLVM_DEBUG(dbgs() in FindRoots()
449 LLVM_DEBUG(dbgs() << "\t\t\tRunning forward DFS\n"); in FindRoots()
458 LLVM_DEBUG(dbgs() << "\t\t\tFound a new furthest away node " in FindRoots()
462 LLVM_DEBUG(dbgs() << "\t\t\tPrev DFSNum: " << Num << ", new DFSNum: " in FindRoots()
466 LLVM_DEBUG(dbgs() << "\t\t\t\tRemoving DFS info for " in FindRoots()
472 LLVM_DEBUG(dbgs() << "\t\t\tRunning reverse DFS\n"); in FindRoots()
[all …]
|