Searched refs:ReadyQueue (Results 1 – 7 of 7) sorted by relevance
| /openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/ |
| H A D | VLIWMachineScheduler.h | 130 ReadyQueue Available;
131 ReadyQueue Pending;
248 virtual int SchedulingCost(ReadyQueue &Q, SUnit *SU,
256 void traceCandidate(const char *Label, const ReadyQueue &Q, SUnit *SU,
260 SchedCandidate &Candidate, ReadyQueue &Q);
|
| H A D | MachineScheduler.h | 534 class ReadyQueue {
540 ReadyQueue(unsigned id, const Twine &name): ID(id), Name(name.str()) {} in ReadyQueue() function
624 ReadyQueue Available;
625 ReadyQueue Pending;
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/Hexagon/ |
| H A D | HexagonMachineScheduler.h | 36 int SchedulingCost(ReadyQueue &Q, SUnit *SU, SchedCandidate &Candidate,
|
| H A D | HexagonMachineScheduler.cpp | 45 int HexagonConvergingVLIWScheduler::SchedulingCost(ReadyQueue &Q, SUnit *SU, in SchedulingCost()
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/ |
| H A D | VLIWMachineScheduler.cpp | 511 const ReadyQueue &Q, SUnit *SU, in traceCandidate()
526 ReadyQueue &Q) { in readyQueueVerboseDump()
530 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) { in readyQueueVerboseDump()
596 int ConvergingVLIWScheduler::SchedulingCost(ReadyQueue &Q, SUnit *SU, in SchedulingCost()
772 ReadyQueue &Q = Zone.Available; in pickNodeFromQueue()
782 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) { in pickNodeFromQueue()
|
| H A D | MachineScheduler.cpp | 623 LLVM_DUMP_METHOD void ReadyQueue::dump() const { in dump()
2572 for (ReadyQueue::iterator I = Available.begin(); I != Available.end();) { in pickOnlyChoice()
3330 ReadyQueue &Q = Zone.Available; in pickNodeFromQueue()
3623 ReadyQueue &Q = Top.Available; in pickNodeFromQueue()
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/AMDGPU/ |
| H A D | GCNSchedStrategy.cpp | 203 ReadyQueue &Q = Zone.Available; in pickNodeFromQueue()
|