Home
last modified time | relevance | path

Searched refs:ReadyQueue (Results 1 – 5 of 5) sorted by relevance

/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.h138 ReadyQueue Available;
139 ReadyQueue Pending;
258 int SchedulingCost(ReadyQueue &Q,
266 void traceCandidate(const char *Label, const ReadyQueue &Q, SUnit *SU,
270 SchedCandidate &Candidate, ReadyQueue &Q);
H A DHexagonMachineScheduler.cpp484 const ReadyQueue &Q, SUnit *SU, int Cost, PressureChange P) { in traceCandidate()
498 ReadyQueue &Q) { in readyQueueVerboseDump()
502 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) { in readyQueueVerboseDump()
575 int ConvergingVLIWScheduler::SchedulingCost(ReadyQueue &Q, SUnit *SU, in SchedulingCost()
766 ReadyQueue &Q = Zone.Available; in pickNodeFromQueue()
776 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) { in pickNodeFromQueue()
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h542 class ReadyQueue {
548 ReadyQueue(unsigned id, const Twine &name): ID(id), Name(name.str()) {} in ReadyQueue() function
632 ReadyQueue Available;
633 ReadyQueue Pending;
/freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/
H A DGCNSchedStrategy.cpp150 ReadyQueue &Q = Zone.Available; in pickNodeFromQueue()
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DMachineScheduler.cpp591 LLVM_DUMP_METHOD void ReadyQueue::dump() const { in dump()
2364 for (ReadyQueue::iterator I = Available.begin(); I != Available.end();) { in pickOnlyChoice()
3082 ReadyQueue &Q = Zone.Available; in pickNodeFromQueue()
3371 ReadyQueue &Q = Top.Available; in pickNodeFromQueue()