Home
last modified time | relevance | path

Searched refs:dbgs (Results 1 – 25 of 388) sorted by relevance

12345678910>>...16

/external/llvm/utils/TableGen/
DDFAPacketizerEmitter.cpp273 DEBUG(dbgs() << "InsnClass: "); in dbgsInsnClass()
276 DEBUG(dbgs() << ", "); in dbgsInsnClass()
278 DEBUG(dbgs() << "0x" << utohexstr(InsnClass[i])); in dbgsInsnClass()
281 DEBUG(dbgs() << " (input: 0x" << utohexstr(InsnInput) << ")"); in dbgsInsnClass()
288 DEBUG(dbgs() << "StateInfo: "); in dbgsStateInfo()
294 DEBUG(dbgs() << ", "); in dbgsStateInfo()
296 DEBUG(dbgs() << "0x" << utohexstr(thisState)); in dbgsStateInfo()
305 DEBUG(dbgs() << " "); in dbgsIndent()
358 DEBUG(dbgs() << " thisState: 0x" << utohexstr(thisState) << "\n"); in AddInsnClass()
378 dbgs() << "AddInsnClassStages " << chkstage << " (0x" in AddInsnClassStages()
[all …]
/external/llvm/lib/Target/AArch64/
DAArch64PromoteConstant.cpp96 DEBUG(dbgs() << getPassName() << '\n'); in runOnModule()
358 DEBUG(dbgs() << "Insertion point dominated by:\n"); in isDominated()
359 DEBUG(IPI.first->print(dbgs())); in isDominated()
360 DEBUG(dbgs() << '\n'); in isDominated()
385 DEBUG(dbgs() << "Merge insertion point with:\n"); in tryAndMerge()
386 DEBUG(IPI->first->print(dbgs())); in tryAndMerge()
387 DEBUG(dbgs() << "\nat considered insertion point.\n"); in tryAndMerge()
407 DEBUG(dbgs() << "Merge insertion point with:\n"); in tryAndMerge()
408 DEBUG(IPI->first->print(dbgs())); in tryAndMerge()
409 DEBUG(dbgs() << '\n'); in tryAndMerge()
[all …]
DAArch64AddressTypePromotion.cpp255 DEBUG(dbgs() << "*** Propagate Sign Extension ***\n"); in propagateSignExtension()
264 DEBUG(dbgs() << "Consider:\n" << *SExt << '\n'); in propagateSignExtension()
268 DEBUG(dbgs() << "No uses => marked as delete\n"); in propagateSignExtension()
274 DEBUG(dbgs() << "Try to get through:\n" << *Inst << '\n'); in propagateSignExtension()
278 DEBUG(dbgs() << "Cannot get through\n"); in propagateSignExtension()
285 DEBUG(dbgs() << "SExt or trunc, mark it as to remove\n"); in propagateSignExtension()
313 DEBUG(dbgs() << "Propagate SExt to operands\n"); in propagateSignExtension()
316 DEBUG(dbgs() << "Operand:\n" << *(Inst->getOperand(OpIdx)) << '\n'); in propagateSignExtension()
319 DEBUG(dbgs() << "No need to propagate\n"); in propagateSignExtension()
325 DEBUG(dbgs() << "Statically sign extend\n"); in propagateSignExtension()
[all …]
DAArch64ConditionalCompares.cpp313 DEBUG(dbgs() << "Flags not used by terminator: " << *I); in findConvertibleCompare()
331 DEBUG(dbgs() << "Immediate out of range for ccmp: " << *I); in findConvertibleCompare()
342 DEBUG(dbgs() << "Can't convert compare with live destination: " << *I); in findConvertibleCompare()
360 DEBUG(dbgs() << "Can't create ccmp with multiple uses: " << *I); in findConvertibleCompare()
366 DEBUG(dbgs() << "Not convertible compare: " << *I); in findConvertibleCompare()
371 DEBUG(dbgs() << "Flags not defined in BB#" << MBB->getNumber() << '\n'); in findConvertibleCompare()
385 DEBUG(dbgs() << "BB#" << MBB->getNumber() << " has live-ins.\n"); in canSpeculateInstrs()
398 DEBUG(dbgs() << "BB#" << MBB->getNumber() << " has more than " in canSpeculateInstrs()
405 DEBUG(dbgs() << "Can't hoist: " << I); in canSpeculateInstrs()
413 DEBUG(dbgs() << "Won't speculate load: " << I); in canSpeculateInstrs()
[all …]
DAArch64DeadRegisterDefinitionsPass.cpp88 DEBUG(dbgs() << " Ignoring, operand is frame index\n"); in processMachineBasicBlock()
95 DEBUG(dbgs() << " Dead def operand #" << i << " in:\n "; in processMachineBasicBlock()
96 MI.print(dbgs())); in processMachineBasicBlock()
99 DEBUG(dbgs() << " Ignoring, def is tied operand.\n"); in processMachineBasicBlock()
105 DEBUG(dbgs() << " Ignoring, implicitly defines overlap reg.\n"); in processMachineBasicBlock()
113 DEBUG(dbgs() << " Ignoring, register is not a GPR.\n"); in processMachineBasicBlock()
122 DEBUG(dbgs() << " Replacing with zero register. New:\n "); in processMachineBasicBlock()
124 DEBUG(MI.print(dbgs())); in processMachineBasicBlock()
137 DEBUG(dbgs() << "***** AArch64DeadRegisterDefinitions *****\n"); in runOnMachineFunction()
/external/llvm/lib/Target/PowerPC/
DPPCVSXSwapRemoval.cpp524 DEBUG(dbgs() << "Swap vector when first built\n\n"); in gatherVectorInstructions()
584 DEBUG(dbgs() << "\n*** Forming webs for swap removal ***\n\n"); in formWebs()
590 DEBUG(dbgs() << "\n" << SwapVector[EntryIdx].VSEId << " "); in formWebs()
621 DEBUG(dbgs() << format("Unioning %d with %d\n", SwapVector[DefIdx].VSEId, in formWebs()
623 DEBUG(dbgs() << " Def: "); in formWebs()
635 DEBUG(dbgs() << "\n*** Rejecting webs for swap removal ***\n\n"); in recordUnoptimizableWebs()
653 DEBUG(dbgs() << in recordUnoptimizableWebs()
656 DEBUG(dbgs() << " in " << EntryIdx << ": "); in recordUnoptimizableWebs()
658 DEBUG(dbgs() << "\n"); in recordUnoptimizableWebs()
679 DEBUG(dbgs() << in recordUnoptimizableWebs()
[all …]
/external/llvm/lib/Analysis/
DDependenceAnalysis.cpp422 DEBUG(dbgs() << "\tintersect constraints\n"); in intersectConstraints()
423 DEBUG(dbgs() << "\t X ="; X->dump(dbgs())); in intersectConstraints()
424 DEBUG(dbgs() << "\t Y ="; Y->dump(dbgs())); in intersectConstraints()
440 DEBUG(dbgs() << "\t intersect 2 distances\n"); in intersectConstraints()
467 DEBUG(dbgs() << "\t intersect 2 lines\n"); in intersectConstraints()
472 DEBUG(dbgs() << "\t\tsame slope\n"); in intersectConstraints()
486 DEBUG(dbgs() << "\t\tdifferent slopes\n"); in intersectConstraints()
508 DEBUG(dbgs() << "\t\tXtop = " << Xtop << "\n"); in intersectConstraints()
509 DEBUG(dbgs() << "\t\tXbot = " << Xbot << "\n"); in intersectConstraints()
510 DEBUG(dbgs() << "\t\tYtop = " << Ytop << "\n"); in intersectConstraints()
[all …]
DBlockFrequencyInfoImpl.cpp30 void BlockMass::dump() const { print(dbgs()); } in dump()
276 dbgs() << " =>" in addToDist()
279 dbgs() << ", succ = " << getBlockName(Succ); in addToDist()
281 dbgs() << ", resolved = " << getBlockName(Resolved); in addToDist()
282 dbgs() << "\n"; in addToDist()
337 DEBUG(dbgs() << "compute-loop-scale: " << getLoopName(Loop) << "\n"); in computeLoopScale()
363 DEBUG(dbgs() << " - exit-mass = " << ExitMass << " (" << BlockMass::getFull() in computeLoopScale()
370 DEBUG(dbgs() << "packaging-loop: " << getLoopName(Loop) << "\n"); in packageLoop()
376 DEBUG(dbgs() << " - node: " << getBlockName(M.Index) << "\n"); in packageLoop()
385 dbgs() << " => assign " << M << " (" << D.RemMass << ")"; in debugAssign()
[all …]
/external/llvm/lib/CodeGen/
DAggressiveAntiDepBreaker.cpp130 DEBUG(dbgs() << "AntiDep Critical-Path Registers:"); in AggressiveAntiDepBreaker()
133 dbgs() << " " << TRI->getName(r)); in AggressiveAntiDepBreaker()
134 DEBUG(dbgs() << '\n'); in AggressiveAntiDepBreaker()
192 DEBUG(dbgs() << "Observe: "); in Observe()
194 DEBUG(dbgs() << "\tRegs:"); in Observe()
206 dbgs() << " " << TRI->getName(Reg) << "=g" << in Observe()
214 DEBUG(dbgs() << '\n'); in Observe()
304 DEBUG(if (!header && footer) dbgs() << footer); in HandleLastUse()
314 dbgs() << header << TRI->getName(Reg); header = nullptr; }); in HandleLastUse()
315 DEBUG(dbgs() << "->g" << State->GetGroup(Reg) << tag); in HandleLastUse()
[all …]
DScheduleDAG.cpp317 dbgs() << "SU(" << NodeNum << "): "; in dump()
324 dbgs() << " # preds left : " << NumPredsLeft << "\n"; in dumpAll()
325 dbgs() << " # succs left : " << NumSuccsLeft << "\n"; in dumpAll()
327 dbgs() << " # weak preds left : " << WeakPredsLeft << "\n"; in dumpAll()
329 dbgs() << " # weak succs left : " << WeakSuccsLeft << "\n"; in dumpAll()
330 dbgs() << " # rdefs left : " << NumRegDefsLeft << "\n"; in dumpAll()
331 dbgs() << " Latency : " << Latency << "\n"; in dumpAll()
332 dbgs() << " Depth : " << getDepth() << "\n"; in dumpAll()
333 dbgs() << " Height : " << getHeight() << "\n"; in dumpAll()
336 dbgs() << " Predecessors:\n"; in dumpAll()
[all …]
DEarlyIfConversion.cpp188 DEBUG(dbgs() << "BB#" << MBB->getNumber() << " has live-ins.\n"); in canSpeculateInstrs()
202 DEBUG(dbgs() << "BB#" << MBB->getNumber() << " has more than " in canSpeculateInstrs()
209 DEBUG(dbgs() << "Can't hoist: " << *I); in canSpeculateInstrs()
217 DEBUG(dbgs() << "Won't speculate load: " << *I); in canSpeculateInstrs()
224 DEBUG(dbgs() << "Can't speculate: " << *I); in canSpeculateInstrs()
231 DEBUG(dbgs() << "Won't speculate regmask: " << *I); in canSpeculateInstrs()
249 DEBUG(dbgs() << "BB#" << MBB->getNumber() << " depends on " << *DefMI); in canSpeculateInstrs()
251 DEBUG(dbgs() << "Can't insert instructions below terminator.\n"); in canSpeculateInstrs()
282 DEBUG(dbgs() << "Can't insert code after " << *I); in findInsertionPoint()
317 dbgs() << "Would clobber"; in findInsertionPoint()
[all …]
DExpandPostRAPseudos.cpp100 DEBUG(dbgs() << "subreg: CONVERTING: " << *MI); in LowerSubregToReg()
104 DEBUG(dbgs() << "subreg: replaced by: " << *MI); in LowerSubregToReg()
117 DEBUG(dbgs() << "subreg: replace by: " << *MI); in LowerSubregToReg()
120 DEBUG(dbgs() << "subreg: eliminated!"); in LowerSubregToReg()
129 DEBUG(dbgs() << "subreg: " << *CopyMI); in LowerSubregToReg()
132 DEBUG(dbgs() << '\n'); in LowerSubregToReg()
140 DEBUG(dbgs() << "dead copy: " << *MI); in LowerCopy()
142 DEBUG(dbgs() << "replaced by: " << *MI); in LowerCopy()
150 DEBUG(dbgs() << "identity copy: " << *MI); in LowerCopy()
157 DEBUG(dbgs() << "replaced by: " << *MI); in LowerCopy()
[all …]
DStackColoring.cpp197 DEBUG(dbgs() << "Inspecting block #" << BasicBlocks.lookup(MBB) << " [" in dump()
204 DEBUG(dbgs()<<"BEGIN : {"); in dump()
206 DEBUG(dbgs()<<BlockInfo.Begin.test(i)<<" "); in dump()
207 DEBUG(dbgs()<<"}\n"); in dump()
209 DEBUG(dbgs()<<"END : {"); in dump()
211 DEBUG(dbgs()<<BlockInfo.End.test(i)<<" "); in dump()
213 DEBUG(dbgs()<<"}\n"); in dump()
215 DEBUG(dbgs()<<"LIVE_IN: {"); in dump()
217 DEBUG(dbgs()<<BlockInfo.LiveIn.test(i)<<" "); in dump()
219 DEBUG(dbgs()<<"}\n"); in dump()
[all …]
DSplitKit.cpp148 DEBUG(dbgs() << "*** Fixing inconsistent live interval! ***\n"); in analyzeUses()
158 DEBUG(dbgs() << "Analyze counted " in analyzeUses()
352 dbgs() << " empty\n"; in dump()
357 dbgs() << " [" << I.start() << ';' << I.stop() << "):" << I.value(); in dump()
358 dbgs() << '\n'; in dump()
465 DEBUG(dbgs() << " selectIntv " << OpenIdx << " -> " << Idx << '\n'); in selectIntv()
471 DEBUG(dbgs() << " enterIntvBefore " << Idx); in enterIntvBefore()
475 DEBUG(dbgs() << ": not live\n"); in enterIntvBefore()
478 DEBUG(dbgs() << ": valno " << ParentVNI->id << '\n'); in enterIntvBefore()
488 DEBUG(dbgs() << " enterIntvAfter " << Idx); in enterIntvAfter()
[all …]
DMachineCombiner.cpp135 DEBUG(dbgs() << "NEW INSTR "; InstrPtr->dump(); dbgs() << "\n";); in getDepth()
255 DEBUG(dbgs() << "DEPENDENCE DATA FOR " << Root << "\n"; in improvesCriticalPathLen()
256 dbgs() << " NewRootDepth: " << NewRootDepth << "\n"; in improvesCriticalPathLen()
257 dbgs() << " RootDepth: " << RootDepth << "\n"); in improvesCriticalPathLen()
274 DEBUG(dbgs() << " NewRootLatency: " << NewRootLatency << "\n"; in improvesCriticalPathLen()
275 dbgs() << " RootLatency: " << RootLatency << "\n"; in improvesCriticalPathLen()
276 dbgs() << " RootSlack: " << RootSlack << "\n"; in improvesCriticalPathLen()
277 dbgs() << " NewRootDepth + NewRootLatency = " in improvesCriticalPathLen()
279 dbgs() << " RootDepth + RootLatency + RootSlack = " in improvesCriticalPathLen()
329 DEBUG(dbgs() << "RESOURCE DATA: \n"; in preservesResourceLen()
[all …]
DRegAllocFast.cpp285 DEBUG(dbgs() << "Spilling " << PrintReg(LRI->VirtReg, TRI) in spillVirtReg()
289 DEBUG(dbgs() << " to stack slot #" << FI << "\n"); in spillVirtReg()
315 DEBUG(dbgs() << "Inserting debug info due to spill:" << "\n" << *NewDV); in spillVirtReg()
450 DEBUG(dbgs() << PrintReg(PhysReg, TRI) << " is already used in instr.\n"); in calcSpillCost()
459 DEBUG(dbgs() << PrintReg(VirtReg, TRI) << " corresponding " in calcSpillCost()
470 DEBUG(dbgs() << PrintReg(PhysReg, TRI) << " is disabled.\n"); in calcSpillCost()
499 DEBUG(dbgs() << "Assigning " << PrintReg(LR.VirtReg, TRI) << " to " in assignVirtToPhysReg()
554 DEBUG(dbgs() << "Allocating " << PrintReg(VirtReg) << " from " in allocVirtReg()
560 DEBUG(dbgs() << "\tRegister: " << PrintReg(*I, TRI) << "\n"); in allocVirtReg()
561 DEBUG(dbgs() << "\tCost: " << Cost << "\n"); in allocVirtReg()
[all …]
DRegAllocGreedy.cpp633 DEBUG(dbgs() << "missed hint " << PrintReg(Hint, TRI) << '\n'); in tryAssign()
649 DEBUG(dbgs() << PrintReg(PhysReg, TRI) << " is available at cost " << Cost in tryAssign()
679 DEBUG(dbgs() << "can reassign: " << VirtReg << " from " in canReassign()
708 DEBUG(dbgs() << "should evict: " << B << " w= " << B.weight << '\n'); in shouldEvict()
814 DEBUG(dbgs() << "evicting " << PrintReg(PhysReg, TRI) in evictInterference()
878 DEBUG(dbgs() << TRI->getRegClassName(RC) << " minimum cost = " << MinCost in tryEvict()
887 DEBUG(dbgs() << "Only trying the first " << OrderLimit << " regs.\n"); in tryEvict()
898 DEBUG(dbgs() << PrintReg(PhysReg, TRI) << " would clobber CSR " in tryEvict()
1083 DEBUG(dbgs() << ", v=" << Visited); in growRegion()
1101 DEBUG(dbgs() << "Compact region bundles"); in calcCompactRegion()
[all …]
DMachineScheduler.cpp323 DEBUG(dbgs() << "Before MISched:\n"; mf.print(dbgs())); in runOnMachineFunction()
356 DEBUG(dbgs() << "Subtarget disables post-MI-sched.\n"); in runOnMachineFunction()
359 DEBUG(dbgs() << "Before post-MI-sched:\n"; mf.print(dbgs())); in runOnMachineFunction()
463 DEBUG(dbgs() << "********** MI Scheduling **********\n"); in scheduleRegions()
464 DEBUG(dbgs() << MF->getName() in scheduleRegions()
467 if (RegionEnd != MBB->end()) dbgs() << *RegionEnd; in scheduleRegions()
468 else dbgs() << "End"; in scheduleRegions()
469 dbgs() << " RegionInstrs: " << NumRegionInstrs in scheduleRegions()
505 dbgs() << "Queue " << Name << ": "; in dump()
507 dbgs() << Queue[i]->NodeNum << " "; in dump()
[all …]
/external/mesa3d/src/gallium/drivers/radeon/
DAMDILPeepholeOptimizer.cpp397 dbgs() << "Null pointer passed into function.\n"; in setupBitInsert()
409 dbgs() << "Failed setup with no Shl or And instruction on base opcode!\n"; in setupBitInsert()
417 dbgs() << "Failed setup since the base operand is not an instruction!\n"; in setupBitInsert()
435 dbgs() << "Failed setup since both mask and shift are NULL!\n"; in setupBitInsert()
490 dbgs() << "!!! Vectors are not supported yet!\n"; in optimizeBitInsert()
501 dbgs() << "Found an OR Operation that failed setup!\n"; in optimizeBitInsert()
513 dbgs() << "Found an OR Operation that failed setup!\n"; in optimizeBitInsert()
524 dbgs() << "Found an OR operation that can possible be optimized to ubit insert!\n"; in optimizeBitInsert()
525 dbgs() << "Op: "; inst->dump(); in optimizeBitInsert()
526 dbgs() << "LHS: "; if (LHS) { LHS->dump(); } else { dbgs() << "(None)\n"; } in optimizeBitInsert()
[all …]
/external/llvm/lib/Target/AMDGPU/
DAMDILCFGStructurizer.cpp69 DEBUG(dbgs() << "New instr: " << *i << "\n");
73 dbgs() << msg << "BB" << b->getNumber() << "size " << b->size(); \
74 dbgs() << "\n"; \
80 dbgs() << msg << "BB" << b->getNumber() << "size " << b->size(); \
81 b->print(dbgs()); \
82 dbgs() << "\n"; \
172 DEBUG(dbgs() << "LoopInfo:\n"; PrintLoopinfo(*MLI);); in runOnMachineFunction()
174 DEBUG(MDT->print(dbgs(), (const llvm::Module*)nullptr);); in runOnMachineFunction()
176 DEBUG(PDT->print(dbgs());); in runOnMachineFunction()
196 dbgs() << "BB" << (*iterBlk)->getNumber(); in printOrderedBlocks()
[all …]
/external/llvm/include/llvm/Support/
DUnicodeCharRanges.h80 DEBUG(dbgs() << "Upper bound 0x"); in rangesAreValid()
81 DEBUG(dbgs().write_hex(Prev)); in rangesAreValid()
82 DEBUG(dbgs() << " should be less than succeeding lower bound 0x"); in rangesAreValid()
83 DEBUG(dbgs().write_hex(I->Lower) << "\n"); in rangesAreValid()
87 DEBUG(dbgs() << "Upper bound 0x"); in rangesAreValid()
88 DEBUG(dbgs().write_hex(I->Lower)); in rangesAreValid()
89 DEBUG(dbgs() << " should not be less than lower bound 0x"); in rangesAreValid()
90 DEBUG(dbgs().write_hex(I->Upper) << "\n"); in rangesAreValid()
/external/llvm/tools/verify-uselistorder/
Dverify-uselistorder.cpp111 DEBUG(dbgs() << " - create-temp-file\n"); in init()
126 DEBUG(dbgs() << " - write bitcode\n"); in writeBitcode()
139 DEBUG(dbgs() << " - write assembly\n"); in writeAssembly()
152 DEBUG(dbgs() << " - read bitcode\n"); in readBitcode()
173 DEBUG(dbgs() << " - read assembly\n"); in readAssembly()
247 dbgs() << "value-mapping (size = " << VM.Values.size() << "):\n"; in dumpMapping()
249 dbgs() << " - id = " << I << ", value = "; in dumpMapping()
256 dbgs() << " - " << Desc << " value = "; in debugValue()
259 dbgs() << " => use: op = " << U.getOperandNo() in debugValue()
267 dbgs() << " - fail: user mismatch: ID = " << I << "\n"; in debugUserMismatch()
[all …]
/external/llvm/lib/Transforms/Scalar/
DLoopInterchange.cpp68 DEBUG(dbgs() << *II << " "); in printDepMatrix()
69 DEBUG(dbgs() << "\n"); in printDepMatrix()
80 DEBUG(dbgs() << "Cannot handle loops of depth greater than " in populateDependencyMatrix()
106 DEBUG(dbgs() << "Found " << MemInstr.size() in populateDependencyMatrix()
121 DEBUG(dbgs() << "Found Dependency between Src=" << Src << " Des=" << Des in populateDependencyMatrix()
126 DEBUG(dbgs() << "Flow dependence not handled"); in populateDependencyMatrix()
130 DEBUG(dbgs() << "Found Anti dependence \n"); in populateDependencyMatrix()
170 DEBUG(dbgs() << "Cannot handle more than " << MaxMemInstrCount in populateDependencyMatrix()
282 DEBUG(dbgs() << "Calling populateWorklist called\n"); in populateWorklist()
465 DEBUG(dbgs() << "Worklist size = " << Worklist.size() << "\n"); in runOnFunction()
[all …]
DMergedLoadStoreMotion.cpp291 DEBUG(dbgs() << " Hoist Instruction into BB \n"; BB->dump(); in hoistInstruction()
292 dbgs() << "Instruction Left\n"; HoistCand->dump(); dbgs() << "\n"; in hoistInstruction()
293 dbgs() << "Instruction Right\n"; ElseInst->dump(); dbgs() << "\n"); in hoistInstruction()
342 DEBUG(dbgs() << "Hoist Instruction into BB \n"; BB->dump(); in hoistLoad()
343 dbgs() << "Instruction Left\n"; L0->dump(); dbgs() << "\n"; in hoistLoad()
344 dbgs() << "Instruction Right\n"; L1->dump(); dbgs() << "\n"); in hoistLoad()
412 DEBUG(dbgs() << "can Sink? : "; Store0->dump(); dbgs() << "\n"); in canSinkFromBlock()
469 DEBUG(dbgs() << "Sink Instruction into BB \n"; BB->dump(); in sinkStore()
470 dbgs() << "Instruction Left\n"; S0->dump(); dbgs() << "\n"; in sinkStore()
471 dbgs() << "Instruction Right\n"; S1->dump(); dbgs() << "\n"); in sinkStore()
[all …]
DLoopDistribute.cpp182 dbgs() << " (cycle)\n"; in print()
185 dbgs() << " " << I->getParent()->getName() << ":" << *I << "\n"; in print()
190 dbgs() << *BB; in printBlocks()
317 DEBUG(dbgs() << "Merging partitions due to this load in multiple " in mergeToAvoidDuplicatedLoads()
477 void dump() const { print(dbgs()); } in dump()
490 dbgs() << "\nPartition " << Index++ << " (" << &P << "):\n"; in printBlocks()
557 DEBUG(dbgs() << "Backward dependences:\n"); in MemoryInstructionDependences()
566 DEBUG(Dep.print(dbgs(), 2, Instructions)); in MemoryInstructionDependences()
662 DEBUG(dbgs() << "\nLDist: In \"" << L->getHeader()->getParent()->getName() in processLoop()
667 DEBUG(dbgs() << "Skipping; no preheader"); in processLoop()
[all …]

12345678910>>...16