1032     ReadyQueue Available;  member
1071       Available.clear();  in reset()
1095       DAG(0), SchedModel(0), Rem(0), Available(ID, Name+".A"),  in SchedBoundary()
1107       return Available.getID() == ConvergingScheduler::TopQID;  in isTop()
1303          I = Bot.Available.begin(), E = Bot.Available.end(); I != E; ++I) {  in registerRoots()
1341   for (ReadyQueue::iterator I = Available.begin(), E = Available.end();  in setLatencyPolicy()
1357     DEBUG(dbgs() << "Increase ILP: " << Available.getName() << '\n');  in setLatencyPolicy()
1372     Available.push(SU);  in releaseNode()
1406   DEBUG(dbgs() << "  *** " << Available.getName() << " cycle "  in bumpCycle()
1485   if (Available.empty())  in releasePending()
1503     Available.push(SU);  in releasePending()
1513   if (Available.isInQueue(SU))  in removeReady()
1514     Available.remove(Available.find(SU));  in removeReady()
1530     for (ReadyQueue::iterator I = Available.begin(); I != Available.end();) {  in pickOnlyChoice()
1533         I = Available.remove(I);  in pickOnlyChoice()
1539   for (unsigned i = 0; Available.empty(); ++i) {  in pickOnlyChoice()
1545   if (Available.size() == 1)  in pickOnlyChoice()
1546     return *Available.begin();  in pickOnlyChoice()
1574     DEBUG(dbgs() << "Balance " << CriticalZone.Available.getName() << " reduce "  in balanceZones()
1585     DEBUG(dbgs() << "Balance " << OppositeZone.Available.getName() << " demand "  in balanceZones()
1910   dbgs() << Label << " " << Zone.Available.getName() << " ";  in traceCandidate()
1936   ReadyQueue &Q = Zone.Available;  in pickNodeFromQueue()
2034     assert(Top.Available.empty() && Top.Pending.empty() &&  in pickNode()
2035            Bot.Available.empty() && Bot.Pending.empty() && "ReadyQ garbage");  in pickNode()