46 void R600SchedStrategy::MoveUnits(std::vector<SUnit *> &QSrc,  in MoveUnits()
47                                   std::vector<SUnit *> &QDst)  in MoveUnits()
58 SUnit* R600SchedStrategy::pickNode(bool &IsTopNode) {  in pickNode()
59   SUnit *SU = nullptr;  in pickNode()
134       const SUnit &S = DAG->SUnits[i];  in pickNode()
143 void R600SchedStrategy::schedNode(SUnit *SU, bool IsTopNode) {  in schedNode()
190 void R600SchedStrategy::releaseTopNode(SUnit *SU) {  in releaseTopNode()
194 void R600SchedStrategy::releaseBottomNode(SUnit *SU) {  in releaseBottomNode()
220 R600SchedStrategy::AluKind R600SchedStrategy::getAluKind(SUnit *SU) const {  in getAluKind()
294 int R600SchedStrategy::getInstKind(SUnit* SU) {  in getInstKind()
318 SUnit *R600SchedStrategy::PopInst(std::vector<SUnit *> &Q, bool AnyALU) {  in PopInst()
321   for (std::vector<SUnit *>::reverse_iterator It = Q.rbegin(), E = Q.rend();  in PopInst()
323     SUnit *SU = *It;  in PopInst()
338   std::vector<SUnit *> &QSrc = Pending[IDAlu];  in LoadAlu()
388 SUnit *R600SchedStrategy::AttemptFillSlot(unsigned Slot, bool AnyAlu) {  in AttemptFillSlot()
390   SUnit *SlotedSU = PopInst(AvailableAlus[IndexToID[Slot]], AnyAlu);  in AttemptFillSlot()
393   SUnit *UnslotedSU = PopInst(AvailableAlus[AluAny], AnyAlu);  in AttemptFillSlot()
407 SUnit* R600SchedStrategy::pickAlu() {  in pickAlu()
432       SUnit *SU = AttemptFillSlot(3, true);  in pickAlu()
441         SUnit *SU = AttemptFillSlot(Chan, false);  in pickAlu()
454 SUnit* R600SchedStrategy::pickOther(int QID) {  in pickOther()
455   SUnit *SU = nullptr;  in pickOther()
456   std::vector<SUnit *> &AQ = Available[QID];  in pickOther()