@@ -394,7 +394,7 @@ void PipelineSolver::reset() {
394394 for (auto &SG : SyncPipeline) {
395395 SmallVector<SUnit *, 32 > TempCollection = SG.Collection ;
396396 SG.Collection .clear ();
397- auto SchedBarr = llvm::find_if (TempCollection, [](SUnit *SU) {
397+ auto * SchedBarr = llvm::find_if (TempCollection, [](SUnit *SU) {
398398 return SU->getInstr ()->getOpcode () == AMDGPU::SCHED_GROUP_BARRIER;
399399 });
400400 if (SchedBarr != TempCollection.end ())
@@ -421,7 +421,7 @@ void PipelineSolver::convertSyncMapsToArrays() {
421421 std::pair (SUsToCandSGs.first , SUsToCandSGs.second ));
422422 continue ;
423423 }
424- auto SortPosition = PipelineInstrs[PipelineIDx].begin ();
424+ auto * SortPosition = PipelineInstrs[PipelineIDx].begin ();
425425 // Insert them in sorted order -- this allows for good parsing order in
426426 // the greedy algorithm
427427 while (SortPosition != PipelineInstrs[PipelineIDx].end () &&
@@ -515,7 +515,7 @@ void PipelineSolver::removeEdges(
515515 SUnit *Pred = PredSuccPair.first ;
516516 SUnit *Succ = PredSuccPair.second ;
517517
518- auto Match = llvm::find_if (
518+ auto * Match = llvm::find_if (
519519 Succ->Preds , [&Pred](SDep &P) { return P.getSUnit () == Pred; });
520520 if (Match != Succ->Preds .end ()) {
521521 assert (Match->isArtificial ());
@@ -639,8 +639,8 @@ bool PipelineSolver::solveExact() {
639639 : populateReadyList (ReadyList, CurrSU.second .begin (),
640640 CurrSU.second .end ());
641641
642- auto I = ReadyList.begin ();
643- auto E = ReadyList.end ();
642+ auto * I = ReadyList.begin ();
643+ auto * E = ReadyList.end ();
644644 for (; I != E; ++I) {
645645 // If we are trying SGs in least cost order, and the current SG is cost
646646 // infeasible, then all subsequent SGs will also be cost infeasible, so we
@@ -942,7 +942,7 @@ class MFMAExpInterleaveOpt final : public IGLPStrategy {
942942 bool apply (const SUnit *SU, const ArrayRef<SUnit *> Collection,
943943 SmallVectorImpl<SchedGroup> &SyncPipe) override {
944944
945- auto DAG = SyncPipe[0 ].DAG ;
945+ auto * DAG = SyncPipe[0 ].DAG ;
946946
947947 if (Cache->empty ()) {
948948 auto I = DAG->SUnits .rbegin ();
@@ -976,7 +976,7 @@ class MFMAExpInterleaveOpt final : public IGLPStrategy {
976976 SmallVectorImpl<SchedGroup> &SyncPipe) override {
977977 bool FoundTrans = false ;
978978 unsigned Counter = 1 ;
979- auto DAG = SyncPipe[0 ].DAG ;
979+ auto * DAG = SyncPipe[0 ].DAG ;
980980
981981 if (Cache->empty ()) {
982982 SmallVector<SUnit *, 8 > Worklist;
@@ -1016,13 +1016,13 @@ class MFMAExpInterleaveOpt final : public IGLPStrategy {
10161016 public:
10171017 bool apply (const SUnit *SU, const ArrayRef<SUnit *> Collection,
10181018 SmallVectorImpl<SchedGroup> &SyncPipe) override {
1019- auto DAG = SyncPipe[0 ].DAG ;
1019+ auto * DAG = SyncPipe[0 ].DAG ;
10201020
10211021 if (!SU || !TII->isMFMAorWMMA (*ChainSeed->getInstr ()))
10221022 return false ;
10231023
10241024 if (Cache->empty ()) {
1025- auto TempSU = ChainSeed;
1025+ auto * TempSU = ChainSeed;
10261026 auto Depth = Number;
10271027 while (Depth > 0 ) {
10281028 --Depth;
@@ -1232,7 +1232,7 @@ class MFMAExpInterleaveOpt final : public IGLPStrategy {
12321232 if (!OtherGroup->Collection .size ())
12331233 return true ;
12341234
1235- auto DAG = SyncPipe[0 ].DAG ;
1235+ auto * DAG = SyncPipe[0 ].DAG ;
12361236
12371237 for (auto &OtherEle : OtherGroup->Collection )
12381238 if (DAG->IsReachable (const_cast <SUnit *>(SU), OtherEle))
@@ -1275,7 +1275,7 @@ class MFMAExpInterleaveOpt final : public IGLPStrategy {
12751275 return false ;
12761276
12771277 if (Cache->empty ()) {
1278- auto TempSU = ChainSeed;
1278+ auto * TempSU = ChainSeed;
12791279 auto Depth = Number;
12801280 while (Depth > 0 ) {
12811281 --Depth;
@@ -1315,7 +1315,7 @@ class MFMAExpInterleaveOpt final : public IGLPStrategy {
13151315 SmallVectorImpl<SchedGroup> &SyncPipe) override {
13161316
13171317 SmallVector<SUnit *, 12 > Worklist;
1318- auto DAG = SyncPipe[0 ].DAG ;
1318+ auto * DAG = SyncPipe[0 ].DAG ;
13191319 if (Cache->empty ()) {
13201320 for (auto &SU : DAG->SUnits )
13211321 if (TII->isTRANS (SU.getInstr ()->getOpcode ())) {
@@ -1509,7 +1509,7 @@ bool MFMAExpInterleaveOpt::analyzeDAG(const SIInstrInfo *TII) {
15091509 return isBitPack (Opc);
15101510 });
15111511
1512- auto PackPred =
1512+ auto * PackPred =
15131513 std::find_if ((*TempMFMA)->Preds .begin (), (*TempMFMA)->Preds .end (),
15141514 [&isBitPack](SDep &Pred) {
15151515 auto Opc = Pred.getSUnit ()->getInstr ()->getOpcode ();
@@ -1868,7 +1868,7 @@ class MFMASmallGemmSingleWaveOpt final : public IGLPStrategy {
18681868 }
18691869
18701870 assert (Cache->size ());
1871- auto DAG = SyncPipe[0 ].DAG ;
1871+ auto * DAG = SyncPipe[0 ].DAG ;
18721872 for (auto &Elt : *Cache) {
18731873 if (DAG->IsReachable (Elt, const_cast <SUnit *>(SU)))
18741874 return true ;
@@ -1886,7 +1886,7 @@ class MFMASmallGemmSingleWaveOpt final : public IGLPStrategy {
18861886 public:
18871887 bool apply (const SUnit *SU, const ArrayRef<SUnit *> Collection,
18881888 SmallVectorImpl<SchedGroup> &SyncPipe) override {
1889- auto MI = SU->getInstr ();
1889+ auto * MI = SU->getInstr ();
18901890 if (MI->getOpcode () != AMDGPU::V_PERM_B32_e64)
18911891 return false ;
18921892
@@ -1952,7 +1952,7 @@ class MFMASmallGemmSingleWaveOpt final : public IGLPStrategy {
19521952 public:
19531953 bool apply (const SUnit *SU, const ArrayRef<SUnit *> Collection,
19541954 SmallVectorImpl<SchedGroup> &SyncPipe) override {
1955- auto MI = SU->getInstr ();
1955+ auto * MI = SU->getInstr ();
19561956 if (MI->getOpcode () == TargetOpcode::BUNDLE)
19571957 return false ;
19581958 if (!Collection.size ())
@@ -2023,7 +2023,7 @@ class MFMASmallGemmSingleWaveOpt final : public IGLPStrategy {
20232023 return false ;
20242024 }
20252025
2026- auto DAG = SyncPipe[0 ].DAG ;
2026+ auto * DAG = SyncPipe[0 ].DAG ;
20272027 // Does the previous DS_WRITE share a V_PERM predecessor with this
20282028 // VMEM_READ
20292029 return llvm::any_of (*Cache, [&SU, &DAG](SUnit *Elt) {
@@ -2070,7 +2070,7 @@ bool MFMASmallGemmSingleWaveOpt::applyIGLPStrategy(
20702070 " DSWCounters should be zero in pre-RA scheduling!" );
20712071 SmallVector<SUnit *, 6 > DSWithPerms;
20722072 for (auto &SU : DAG->SUnits ) {
2073- auto I = SU.getInstr ();
2073+ auto * I = SU.getInstr ();
20742074 if (TII->isMFMAorWMMA (*I))
20752075 ++MFMACount;
20762076 else if (TII->isDS (*I)) {
@@ -2091,8 +2091,8 @@ bool MFMASmallGemmSingleWaveOpt::applyIGLPStrategy(
20912091
20922092 if (IsInitial) {
20932093 DSWWithPermCount = DSWithPerms.size ();
2094- auto I = DSWithPerms.begin ();
2095- auto E = DSWithPerms.end ();
2094+ auto * I = DSWithPerms.begin ();
2095+ auto * E = DSWithPerms.end ();
20962096
20972097 // Get the count of DS_WRITES with V_PERM predecessors which
20982098 // have loop carried dependencies (WAR) on the same VMEM_READs.
@@ -2113,7 +2113,7 @@ bool MFMASmallGemmSingleWaveOpt::applyIGLPStrategy(
21132113 break ;
21142114
21152115 for (auto &Succ : Pred.getSUnit ()->Succs ) {
2116- auto MI = Succ.getSUnit ()->getInstr ();
2116+ auto * MI = Succ.getSUnit ()->getInstr ();
21172117 if (!TII->isVMEM (*MI) || !MI->mayLoad ())
21182118 continue ;
21192119
0 commit comments