Apply suggestions from code review

Co-authored-by: Nikita Popov <[email protected]>

Author: kasuga-fj

llvm/lib/Transforms/Utils/LoopPeel.cpp

@@ -221,9 +221,9 @@ PhiAnalyzer::PhiAnalyzer(const Loop &L, unsigned MaxIterations)
   assert(MaxIterations > 0 && "no peeling is allowed?");
 }
 
-// Test if \p Phi is induction variable or not. It can be checked by using SCEV,
-// but it's expensive to calculate it here. Instead, we perform the cheaper
-// checks, which cannot detect complex one but enough for some cases.
+/// Test if \p Phi is induction variable or not. It can be checked by using SCEV,
+/// but it's expensive to calculate it here. Instead, we perform the cheaper
+/// checks, which cannot detect complex one but enough for some cases.
 bool PhiAnalyzer::isInductionPHI(const PHINode *Phi) const {
   // Currently, we only support loops that consist of one basic block. In this
   // case, the phi can become an IV if it has an incoming value from the basic
@@ -253,7 +253,7 @@ bool PhiAnalyzer::isInductionPHI(const PHINode *Phi) const {
     if (Visited.contains(Cur))
       return false;
 
-    Instruction *I = dyn_cast<Instruction>(Cur);
+    auto *I = dyn_cast<Instruction>(Cur);
     if (!I || I->getParent() != Phi->getParent())
       return false;
 

llvm/test/Transforms/LoopUnroll/peel-loop-phi-analysis.ll

@@ -287,8 +287,8 @@ for.body:
   %x = phi i32 [ 0, %entry ], [ %y, %for.body ]
   %a = phi i32 [ 0, %entry ], [ %add, %for.body ]
   %y = phi i32 [ 0, %entry ], [ %a, %for.body ]
-  tail call void @_Z1gi(i32 signext %x)
-  tail call void @_Z1gi(i32 signext %a)
+  tail call void @_Z1gi(i32 %x)
+  tail call void @_Z1gi(i32 %a)
   %add = add nuw nsw i32 %i, 2
   %inc = add nuw nsw i32 %i, 1
   %exitcond = icmp ne i32 %inc, 100000