HomeSort by relevance Sort by last modified time
    Searched refs:ReadyQueue (Results 1 - 6 of 6) 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 289 // instruction that cannot issue appears as if it's not in the ReadyQueue.
412 const ReadyQueue &Q,
469 int ConvergingVLIWScheduler::SchedulingCost(ReadyQueue &Q, SUnit *SU,
535 pickNodeFromQueue(ReadyQueue &Q, const RegPressureTracker &RPTracker,
544 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) {
  /external/chromium_org/chrome/browser/extensions/api/alarms/
alarm_manager.h 136 typedef std::queue<ReadyAction> ReadyQueue;
137 typedef std::map<ExtensionId, ReadyQueue> ReadyMap;
alarm_manager.cc 309 ReadyQueue& extension_ready_queue = ready_actions_[extension_id];
411 ready_actions_.insert(ReadyMap::value_type(extension->id(), ReadyQueue()));
  /external/llvm/include/llvm/CodeGen/
MachineScheduler.h 469 /// ReadyQueue encapsulates vector of "ready" SUnits with basic convenience
470 /// methods for pushing and removing nodes. ReadyQueue's are uniquely identified
475 class ReadyQueue {
481 ReadyQueue(unsigned id, const Twine &name): ID(id), Name(name.str()) {}
567 ReadyQueue Available;
568 ReadyQueue Pending;
  /external/llvm/lib/CodeGen/
MachineScheduler.cpp 482 void ReadyQueue::dump() {
    [all...]

Completed in 96 milliseconds