Searched refs:ReadyQueue (Results 1 - 6 of 6) sorted by relevance
/external/llvm/lib/Target/Hexagon/ |
H A D | HexagonMachineScheduler.h | 137 ReadyQueue Available; 138 ReadyQueue Pending; 227 int SchedulingCost(ReadyQueue &Q, 231 CandResult pickNodeFromQueue(ReadyQueue &Q, 235 void traceCandidate(const char *Label, const ReadyQueue &Q, SUnit *SU,
|
H A D | HexagonMachineScheduler.cpp | 286 // instruction that cannot issue appears as if it's not in the ReadyQueue. 409 const ReadyQueue &Q, 468 int ConvergingVLIWScheduler::SchedulingCost(ReadyQueue &Q, SUnit *SU, 534 pickNodeFromQueue(ReadyQueue &Q, const RegPressureTracker &RPTracker, 543 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) {
|
/external/chromium_org/chrome/browser/extensions/api/alarms/ |
H A D | alarm_manager.h | 131 typedef std::queue<ReadyAction> ReadyQueue; typedef in class:extensions::AlarmManager 132 typedef std::map<ExtensionId, ReadyQueue> ReadyMap;
|
H A D | alarm_manager.cc | 297 ReadyQueue& extension_ready_queue = ready_actions_[extension_id]; 406 ReadyMap::value_type(extension->id(), ReadyQueue()));
|
/external/llvm/include/llvm/CodeGen/ |
H A D | MachineScheduler.h | 137 /// ReadyQueue encapsulates vector of "ready" SUnits with basic convenience 138 /// methods for pushing and removing nodes. ReadyQueue's are uniquely identified 143 class ReadyQueue { class in namespace:llvm 149 ReadyQueue(unsigned id, const Twine &name): ID(id), Name(name.str()) {} function in class:llvm::ReadyQueue
|
/external/llvm/lib/CodeGen/ |
H A D | MachineScheduler.cpp | 308 void ReadyQueue::dump() { 1234 ReadyQueue Available; 1235 ReadyQueue Pending; 1701 // instruction that cannot issue appears as if it's not in the ReadyQueue. 1942 for (ReadyQueue::iterator I = Available.begin(); I != Available.end();) { 2296 ReadyQueue &Q = Zone.Available; 2303 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) {
|
Completed in 215 milliseconds