Lines Matching refs:Available
1234 ReadyQueue Available;
1252 /// MinReadyCycle - Cycle of the soonest available instruction.
1293 Available.clear();
1318 DAG(0), SchedModel(0), Rem(0), Available(ID, Name+".A"),
1330 return Available.getID() == ConvergingScheduler::TopQID;
1552 I = Bot.Available.begin(), E = Bot.Available.end(); I != E; ++I) {
1599 DEBUG(dbgs() << Available.getName() << " RemLatency SU("
1616 DEBUG(dbgs() << " " << Available.getName() << " + Remain MOps: "
1627 DEBUG(dbgs() << " " << Available.getName() << " + Remain CritRes: "
1652 // ILat = max N.depth for N in Available|Pending
1656 RemLatency = std::max(RemLatency, findMaxLatency(Available.elements()));
1670 DEBUG(dbgs() << " " << Available.getName() << " RemainingLatency "
1680 dbgs() << " " << Available.getName() << " ResourceLimited: "
1706 Available.push(SU);
1748 DEBUG(dbgs() << "Cycle: " << CurrCycle << ' ' << Available.getName() << '\n');
1869 DEBUG(dbgs() << " " << Available.getName()
1874 DEBUG(dbgs() << " " << Available.getName()
1892 /// Release pending ready nodes in to the available queue. This makes them
1895 // If the available queue is empty, it is safe to reset MinReadyCycle.
1896 if (Available.empty())
1900 // so, add them to the available queue.
1915 Available.push(SU);
1925 if (Available.isInQueue(SU))
1926 Available.remove(Available.find(SU));
1942 for (ReadyQueue::iterator I = Available.begin(); I != Available.end();) {
1945 I = Available.remove(I);
1951 for (unsigned i = 0; Available.empty(); ++i) {
1957 if (Available.size() == 1)
1958 return *Available.begin();
1977 dbgs() << Available.getName() << " @" << CurrCycle << "c\n"
2296 ReadyQueue &Q = Zone.Available;
2382 assert(Top.Available.empty() && Top.Pending.empty() &&
2383 Bot.Available.empty() && Bot.Pending.empty() && "ReadyQ garbage");
2777 errs() << "ScheduleDAGMI::viewGraph is only available in debug builds on "
