Lines Matching full:available
11 // the MachineScheduler. It has a sorted Available set of SUs and a pickNode()
75 Available.clear(); // -misched-cutoff. in initialize()
162 if (Available.empty()) in pickNode()
166 if (Available.size() == 1) { in pickNode()
168 HazardRec->dumpSU(*Available.begin(), dbgs()); dbgs() << "\n";); in pickNode()
169 return *Available.begin(); in pickNode()
172 // All nodes that are possible to schedule are stored in the Available set. in pickNode()
173 LLVM_DEBUG(dbgs() << "** Available: "; Available.dump(*HazardRec);); in pickNode()
176 for (auto *SU : Available) { in pickNode()
243 if (Available.size() == 1) dbgs() << "(only one) "; in schedNode()
246 // Remove SU from Available set and update HazardRec. in schedNode()
247 Available.erase(SU); in schedNode()
258 // Put all released SUs in the Available set. in releaseTopNode()
259 Available.insert(SU); in releaseTopNode()