Searched refs:ReadyQueue (Results 1 – 12 of 12) 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/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/ |
D | HexagonMachineScheduler.h | 138 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);
|
D | HexagonMachineScheduler.cpp | 485 const ReadyQueue &Q, SUnit *SU, int Cost, PressureChange P) { in traceCandidate() 499 ReadyQueue &Q) { in readyQueueVerboseDump() 503 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) { in readyQueueVerboseDump() 576 int ConvergingVLIWScheduler::SchedulingCost(ReadyQueue &Q, SUnit *SU, in SchedulingCost() 767 ReadyQueue &Q = Zone.Available; in pickNodeFromQueue() 777 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) { in pickNodeFromQueue()
|
/external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-mca/ |
D | Scheduler.cpp | 230 dbgs() << "[SCHEDULER]: ReadyQueue size is: " << ReadyQueue.size() << '\n'; in dump() 307 ReadyQueue[IID] = IS; in promoteToReadyQueue() 316 auto It = std::find_if(ReadyQueue.begin(), ReadyQueue.end(), in select() 322 if (It == ReadyQueue.end()) in select() 332 for (auto I = It, E = ReadyQueue.end(); I != E; ++I) { in select() 343 ReadyQueue.erase(It); in select() 397 ReadyQueue[IR.getSourceIndex()] = IR.getInstruction(); in issueImmediately()
|
D | Scheduler.h | 414 std::map<unsigned, Instruction *> ReadyQueue; variable 508 assert(ReadyQueue.find(Idx) == ReadyQueue.end()); in sanityCheck()
|
/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/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/ |
D | MachineScheduler.h | 535 class ReadyQueue { 541 ReadyQueue(unsigned id, const Twine &name): ID(id), Name(name.str()) {} in ReadyQueue() function 625 ReadyQueue Available; 626 ReadyQueue Pending;
|
/external/swiftshader/third_party/llvm-7.0/llvm/docs/CommandGuide/ |
D | llvm-mca.rst | 652 * ReadyQueue: a queue of instructions ready to execute. 656 scheduler are either placed into the WaitQueue or into the ReadyQueue. 659 WaitQueue to the ReadyQueue, and if instructions from the ReadyQueue can be 665 Issued instructions are moved from the ReadyQueue to the IssuedQueue. There,
|
/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()
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/AMDGPU/ |
D | GCNSchedStrategy.cpp | 150 ReadyQueue &Q = Zone.Available; in pickNodeFromQueue()
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
D | MachineScheduler.cpp | 586 LLVM_DUMP_METHOD void ReadyQueue::dump() const { in dump() 2327 for (ReadyQueue::iterator I = Available.begin(); I != Available.end();) { in pickOnlyChoice() 2996 ReadyQueue &Q = Zone.Available; in pickNodeFromQueue() 3285 ReadyQueue &Q = Top.Available; in pickNodeFromQueue()
|