Lines Matching defs:Available
1445 ReadyQueue Available;
1508 Available.clear();
1532 DAG(0), SchedModel(0), Rem(0), Available(ID, Name+".A"),
1544 return Available.getID() == GenericScheduler::TopQID;
1860 I = Bot.Available.begin(), E = Bot.Available.end(); I != E; ++I) {
1912 DEBUG(dbgs() << Available.getName() << " RemLatency SU("
1929 DEBUG(dbgs() << " " << Available.getName() << " + Remain MOps: "
1940 DEBUG(dbgs() << " " << Available.getName() << " + Remain CritRes: "
1965 // ILat = max N.depth for N in Available|Pending
1969 RemLatency = std::max(RemLatency, findMaxLatency(Available.elements()));
1983 DEBUG(dbgs() << " " << Available.getName() << " RemainingLatency "
1993 dbgs() << " " << Available.getName() << " ResourceLimited: "
2019 Available.push(SU);
2061 DEBUG(dbgs() << "Cycle: " << CurrCycle << ' ' << Available.getName() << '\n');
2182 DEBUG(dbgs() << " " << Available.getName()
2187 DEBUG(dbgs() << " " << Available.getName()
2209 if (Available.empty())
2228 Available.push(SU);
2238 if (Available.isInQueue(SU))
2239 Available.remove(Available.find(SU));
2255 for (ReadyQueue::iterator I = Available.begin(); I != Available.end();) {
2258 I = Available.remove(I);
2264 for (unsigned i = 0; Available.empty(); ++i) {
2270 if (Available.size() == 1)
2271 return *Available.begin();
2290 dbgs() << Available.getName() << " @" << CurrCycle << "c\n"
2656 ReadyQueue &Q = Zone.Available;
2742 assert(Top.Available.empty() && Top.Pending.empty() &&
2743 Bot.Available.empty() && Bot.Pending.empty() && "ReadyQ garbage");