Searched refs:ReadyQueue (Results 1 – 4 of 4) sorted by relevance
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.h | 136 ReadyQueue Available;
137 ReadyQueue Pending;
227 int SchedulingCost(ReadyQueue &Q,
231 CandResult pickNodeFromQueue(ReadyQueue &Q,
235 void traceCandidate(const char *Label, const ReadyQueue &Q, SUnit *SU,
|
| D | HexagonMachineScheduler.cpp | 417 const ReadyQueue &Q, in traceCandidate()
474 int ConvergingVLIWScheduler::SchedulingCost(ReadyQueue &Q, SUnit *SU, in SchedulingCost()
540 pickNodeFromQueue(ReadyQueue &Q, const RegPressureTracker &RPTracker, in pickNodeFromQueue()
549 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) { in pickNodeFromQueue()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineScheduler.h | 492 class ReadyQueue {
498 ReadyQueue(unsigned id, const Twine &name): ID(id), Name(name.str()) {} in ReadyQueue() function
584 ReadyQueue Available;
585 ReadyQueue Pending;
|
| /external/llvm/lib/CodeGen/ |
| D | MachineScheduler.cpp | 516 void ReadyQueue::dump() { in dump()
2244 for (ReadyQueue::iterator I = Available.begin(); I != Available.end();) { in pickOnlyChoice()
2918 ReadyQueue &Q = Zone.Available; in pickNodeFromQueue()
2919 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) { in pickNodeFromQueue()
3208 ReadyQueue &Q = Top.Available; in pickNodeFromQueue()
3209 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) { in pickNodeFromQueue()
|