reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
243 bool isReadySetEmpty() const { return ReadySet.empty(); } 271 assert(find(ReadySet, IR) == ReadySet.end() && "Already in the ready set!"); 271 assert(find(ReadySet, IR) == ReadySet.end() && "Already in the ready set!");lib/MCA/HardwareUnits/Scheduler.cpp
34 dbgs() << "[SCHEDULER]: ReadySet size is: " << ReadySet.size() << '\n'; 144 ReadySet.emplace_back(IR); 193 unsigned QueueIndex = ReadySet.size(); 194 for (unsigned I = 0, E = ReadySet.size(); I != E; ++I) { 195 InstRef &IR = ReadySet[I]; 196 if (QueueIndex == ReadySet.size() || 197 Strategy->compare(IR, ReadySet[QueueIndex])) { 208 if (QueueIndex == ReadySet.size()) 212 InstRef IR = ReadySet[QueueIndex]; 213 std::swap(ReadySet[QueueIndex], ReadySet[ReadySet.size() - 1]); 213 std::swap(ReadySet[QueueIndex], ReadySet[ReadySet.size() - 1]); 213 std::swap(ReadySet[QueueIndex], ReadySet[ReadySet.size() - 1]); 214 ReadySet.pop_back(); 244 Insts.insert(Insts.end(), ReadySet.begin(), ReadySet.end()); 244 Insts.insert(Insts.end(), ReadySet.begin(), ReadySet.end()); 334 ReadySet.push_back(IR);