reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
225 unsigned getDepth(SUnit *Node) { return Node->getDepth(); }
include/llvm/CodeGen/MachineScheduler.h 716 return isTop() ? SU->getHeight() : SU->getDepth();
include/llvm/CodeGen/ScheduleDFS.h 159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth());
lib/CodeGen/AggressiveAntiDepBreaker.cpp287 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency; 788 ((SU->getDepth() + SU->Latency) > 789 (CriticalPathSU->getDepth() + CriticalPathSU->Latency))) {lib/CodeGen/CriticalAntiDepBreaker.cpp
153 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency; 457 if (!Max || SU->getDepth() + SU->Latency > Max->getDepth() + Max->Latency) 457 if (!Max || SU->getDepth() + SU->Latency > Max->getDepth() + Max->Latency) 465 << (Max->getDepth() + Max->Latency) << "\n");lib/CodeGen/MachineScheduler.cpp
1337 unsigned LiveOutDepth = DefSU->getDepth() + DefSU->Latency; 1354 if (LiveOutDepth > SU->getDepth()) 1355 CyclicLatency = LiveOutDepth - SU->getDepth(); 2295 if (SU->getDepth() > TopLatency) { 2296 TopLatency = SU->getDepth(); 2615 Latency = Cand.SU->getDepth(); 2624 Latency = Cand.SU->getDepth(); 2683 if (Cand.SU->getDepth() > Zone.getScheduledLatency()) { 2684 if (tryLess(TryCand.SU->getDepth(), Cand.SU->getDepth(), 2684 if (tryLess(TryCand.SU->getDepth(), Cand.SU->getDepth(), 2697 if (tryGreater(TryCand.SU->getDepth(), Cand.SU->getDepth(), 2697 if (tryGreater(TryCand.SU->getDepth(), Cand.SU->getDepth(), 2842 Rem.CriticalPath = DAG->ExitSU.getDepth(); 2846 if (SU->getDepth() > Rem.CriticalPath) 2847 Rem.CriticalPath = SU->getDepth(); 3344 Rem.CriticalPath = DAG->ExitSU.getDepth(); 3348 if (SU->getDepth() > Rem.CriticalPath) 3349 Rem.CriticalPath = SU->getDepth();lib/CodeGen/PostRASchedulerList.cpp
503 assert(CurCycle >= SU->getDepth() && 556 if (PendingQueue[i]->getDepth() <= CurCycle) { 562 } else if (PendingQueue[i]->getDepth() < MinDepth) 563 MinDepth = PendingQueue[i]->getDepth();lib/CodeGen/ScheduleDAG.cpp
248 if (NewDepth <= getDepth()) 330 unsigned MaxDepth = BestI->getSUnit()->getDepth(); 333 if (I->getKind() == SDep::Data && I->getSUnit()->getDepth() > MaxDepth) 350 dbgs() << " Depth : " << getDepth() << "\n"; 406 (isBottomUp ? SUnit.getHeight() : SUnit.getDepth()) >lib/CodeGen/ScheduleDAGInstrs.cpp
1344 unsigned Depth = P.first->getDepth();
lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp2508 int LDepth = left->getDepth() - LPenalty; 2509 int RDepth = right->getDepth() - RPenalty; 2616 if (left->getDepth() != right->getDepth()) 2616 if (left->getDepth() != right->getDepth()) 2617 return left->getDepth() < right->getDepth(); 2617 return left->getDepth() < right->getDepth(); 2777 int spread = (int)left->getDepth() - (int)right->getDepth(); 2777 int spread = (int)left->getDepth() - (int)right->getDepth(); 2780 << left->getDepth() << " != SU(" << right->NodeNum 2781 << "): " << right->getDepth() << "\n"); 2782 return left->getDepth() < right->getDepth(); 2782 return left->getDepth() < right->getDepth();lib/CodeGen/SelectionDAG/ScheduleDAGVLIW.cpp
128 SuccSU->setDepthToAtLeast(SU->getDepth() + D.getLatency()); 156 assert(CurCycle >= SU->getDepth() && "Node scheduled above its depth!"); 189 if (PendingQueue[i]->getDepth() == CurCycle) { 197 assert(PendingQueue[i]->getDepth() > CurCycle && "Negative latency?");lib/Target/AMDGPU/GCNILPSched.cpp
149 int LDepth = left->getDepth(); 150 int RDepth = right->getDepth(); 170 int spread = (int)left->getDepth() - (int)right->getDepth(); 170 int spread = (int)left->getDepth() - (int)right->getDepth(); 173 << left->getDepth() << " != SU(" << right->NodeNum 174 << "): " << right->getDepth() << "\n"); 175 return left->getDepth() < right->getDepth() ? right : left; 175 return left->getDepth() < right->getDepth() ? right : left; 232 if (left->getDepth() != right->getDepth()) 232 if (left->getDepth() != right->getDepth()) 233 return (left->getDepth() < right->getDepth()) ? right : left; 233 return (left->getDepth() < right->getDepth()) ? right : left;lib/Target/Hexagon/HexagonMachineScheduler.cpp
217 ++su) if (SUnits[su].getDepth() > maxD) maxD = 218 SUnits[su].getDepth(); 620 ResCount += (SU->getDepth() * ScaleTwo); 625 dbgstr << "d" << std::setw(3) << SU->getDepth() << "|";lib/Target/Hexagon/HexagonMachineScheduler.h
186 MaxPath = std::max(MaxPath, isTop() ? SU.getHeight() : SU.getDepth()); 212 unsigned PathLength = isTop() ? SU->getHeight() : SU->getDepth();