Lines Matching refs:SUnit
46 void R600SchedStrategy::MoveUnits(std::vector<SUnit *> &QSrc,
47 std::vector<SUnit *> &QDst)
59 SUnit* R600SchedStrategy::pickNode(bool &IsTopNode) {
60 SUnit *SU = nullptr;
132 const SUnit &S = DAG->SUnits[i];
142 void R600SchedStrategy::schedNode(SUnit *SU, bool IsTopNode) {
190 void R600SchedStrategy::releaseTopNode(SUnit *SU) {
194 void R600SchedStrategy::releaseBottomNode(SUnit *SU) {
220 R600SchedStrategy::AluKind R600SchedStrategy::getAluKind(SUnit *SU) const {
294 int R600SchedStrategy::getInstKind(SUnit* SU) {
318 SUnit *R600SchedStrategy::PopInst(std::vector<SUnit *> &Q, bool AnyALU) {
321 for (std::vector<SUnit *>::reverse_iterator It = Q.rbegin(), E = Q.rend();
323 SUnit *SU = *It;
339 std::vector<SUnit *> &QSrc = Pending[IDAlu];
389 SUnit *R600SchedStrategy::AttemptFillSlot(unsigned Slot, bool AnyAlu) {
391 SUnit *SlotedSU = PopInst(AvailableAlus[IndexToID[Slot]], AnyAlu);
394 SUnit *UnslotedSU = PopInst(AvailableAlus[AluAny], AnyAlu);
408 SUnit* R600SchedStrategy::pickAlu() {
433 SUnit *SU = AttemptFillSlot(3, true);
442 SUnit *SU = AttemptFillSlot(Chan, false);
455 SUnit* R600SchedStrategy::pickOther(int QID) {
456 SUnit *SU = nullptr;
457 std::vector<SUnit *> &AQ = Available[QID];
