HomeSort by relevance Sort by last modified time
    Searched refs:ReadyQueue (Results 1 - 4 of 4) sorted by null

  /external/llvm/lib/Target/Hexagon/
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,
HexagonMachineScheduler.cpp 294 // instruction that cannot issue appears as if it's not in the ReadyQueue.
417 const ReadyQueue &Q,
474 int ConvergingVLIWScheduler::SchedulingCost(ReadyQueue &Q, SUnit *SU,
540 pickNodeFromQueue(ReadyQueue &Q, const RegPressureTracker &RPTracker,
549 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) {
  /external/llvm/include/llvm/CodeGen/
MachineScheduler.h 486 /// ReadyQueue encapsulates vector of "ready" SUnits with basic convenience
487 /// methods for pushing and removing nodes. ReadyQueue's are uniquely identified
492 class ReadyQueue {
498 ReadyQueue(unsigned id, const Twine &name): ID(id), Name(name.str()) {}
584 ReadyQueue Available;
585 ReadyQueue Pending;
    [all...]
  /external/llvm/lib/CodeGen/
MachineScheduler.cpp 516 void ReadyQueue::dump() {
    [all...]

Completed in 83 milliseconds