HomeSort by: relevance | last modified time | path
    Searched refs:ReadyQueue (Results 1 - 5 of 5) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonMachineScheduler.h 137 ReadyQueue Available;
138 ReadyQueue Pending;
257 int SchedulingCost(ReadyQueue &Q,
265 void traceCandidate(const char *Label, const ReadyQueue &Q, SUnit *SU,
269 SchedCandidate &Candidate, ReadyQueue &Q);
HexagonMachineScheduler.cpp 353 // instruction that cannot issue appears as if it's not in the ReadyQueue.
485 const ReadyQueue &Q, SUnit *SU, int Cost, PressureChange P) {
499 ReadyQueue &Q) {
503 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) {
576 int ConvergingVLIWScheduler::SchedulingCost(ReadyQueue &Q, SUnit *SU,
767 ReadyQueue &Q = Zone.Available;
777 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
MachineScheduler.h 525 /// ReadyQueue encapsulates vector of "ready" SUnits with basic convenience
526 /// methods for pushing and removing nodes. ReadyQueue's are uniquely identified
531 class ReadyQueue {
537 ReadyQueue(unsigned id, const Twine &name): ID(id), Name(name.str()) {}
621 ReadyQueue Available;
622 ReadyQueue Pending;
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
GCNSchedStrategy.cpp 150 ReadyQueue &Q = Zone.Available;
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
MachineScheduler.cpp 616 LLVM_DUMP_METHOD void ReadyQueue::dump() const {
2275 // instruction that cannot issue appears as if it's not in the ReadyQueue.
2567 for (ReadyQueue::iterator I = Available.begin(); I != Available.end();) {
3295 ReadyQueue &Q = Zone.Available;
3585 ReadyQueue &Q = Top.Available;

Completed in 19 milliseconds