Searched refs:ReadyQueue (Results 1 – 4 of 4) sorted by relevance
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.h | 137 ReadyQueue Available;
138 ReadyQueue Pending;
228 int SchedulingCost(ReadyQueue &Q,
232 CandResult pickNodeFromQueue(ReadyQueue &Q,
236 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 | 484 class ReadyQueue {
490 ReadyQueue(unsigned id, const Twine &name): ID(id), Name(name.str()) {} in ReadyQueue() function
576 ReadyQueue Available;
577 ReadyQueue Pending;
|
| /external/llvm/lib/CodeGen/ |
| D | MachineScheduler.cpp | 504 void ReadyQueue::dump() { in dump()
2149 for (ReadyQueue::iterator I = Available.begin(); I != Available.end();) { in pickOnlyChoice()
2794 ReadyQueue &Q = Zone.Available; in pickNodeFromQueue()
2801 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) { in pickNodeFromQueue()
3067 ReadyQueue &Q = Top.Available; in pickNodeFromQueue()
3071 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) { in pickNodeFromQueue()
|