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 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,
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 478 /// ReadyQueue encapsulates vector of "ready" SUnits with basic convenience
479 /// methods for pushing and removing nodes. ReadyQueue's are uniquely identified
484 class ReadyQueue {
490 ReadyQueue(unsigned id, const Twine &name): ID(id), Name(name.str()) {}
576 ReadyQueue Available;
577 ReadyQueue Pending;
  /external/llvm/lib/CodeGen/
MachineScheduler.cpp 504 void ReadyQueue::dump() {
    [all...]

Completed in 271 milliseconds