45 void R600SchedStrategy::MoveUnits(std::vector<SUnit *> &QSrc,  in MoveUnits()
46                                   std::vector<SUnit *> &QDst)  in MoveUnits()
57 SUnit* R600SchedStrategy::pickNode(bool &IsTopNode) {  in pickNode()
58   SUnit *SU = nullptr;  in pickNode()
134           const SUnit &S = DAG->SUnits[i];  in pickNode()
144 void R600SchedStrategy::schedNode(SUnit *SU, bool IsTopNode) {  in schedNode()
192 void R600SchedStrategy::releaseTopNode(SUnit *SU) {  in releaseTopNode()
196 void R600SchedStrategy::releaseBottomNode(SUnit *SU) {  in releaseBottomNode()
222 R600SchedStrategy::AluKind R600SchedStrategy::getAluKind(SUnit *SU) const {  in getAluKind()
295 int R600SchedStrategy::getInstKind(SUnit* SU) {  in getInstKind()
319 SUnit *R600SchedStrategy::PopInst(std::vector<SUnit *> &Q, bool AnyALU) {  in PopInst()
322   for (std::vector<SUnit *>::reverse_iterator It = Q.rbegin(), E = Q.rend();  in PopInst()
324     SUnit *SU = *It;  in PopInst()
339   std::vector<SUnit *> &QSrc = Pending[IDAlu];  in LoadAlu()
389 SUnit *R600SchedStrategy::AttemptFillSlot(unsigned Slot, bool AnyAlu) {  in AttemptFillSlot()
391   SUnit *SlotedSU = PopInst(AvailableAlus[IndexToID[Slot]], AnyAlu);  in AttemptFillSlot()
394   SUnit *UnslotedSU = PopInst(AvailableAlus[AluAny], AnyAlu);  in AttemptFillSlot()
408 SUnit* R600SchedStrategy::pickAlu() {  in pickAlu()
433       SUnit *SU = AttemptFillSlot(3, true);  in pickAlu()
442         SUnit *SU = AttemptFillSlot(Chan, false);  in pickAlu()
455 SUnit* R600SchedStrategy::pickOther(int QID) {  in pickOther()
456   SUnit *SU = nullptr;  in pickOther()
457   std::vector<SUnit *> &AQ = Available[QID];  in pickOther()