Test case comments. Fix sloppiness.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@209551 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/test/Analysis/ScalarEvolution/max-trip-count.ll b/test/Analysis/ScalarEvolution/max-trip-count.ll
index d67d2fab2e35252c29ec7df53df787058c7d4558..75f7418f14a73dffae14d053753e2b4af7680807 100644 (file)
--- a/test/Analysis/ScalarEvolution/max-trip-count.ll
+++ b/test/Analysis/ScalarEvolution/max-trip-count.ll
@@ -125,7 +125,7 @@ bar.exit:                                         ; preds = %for.cond.i, %for.bo
   ret i32 0
 }
 
-; Here we have a must-exit loop latch that is not computabe and a
+; Here we have a must-exit loop latch that is not computable and a
 ; may-exit early exit that can only have one non-exiting iteration
 ; before the check is forever skipped.
 ;
@@ -155,7 +155,7 @@ bar.exit:                                         ; preds = %for.cond.i, %for.bo
   ret i32 0
 }
 
-; This loop has two must-exits, both of with dominate the latch. The
+; This loop has two must-exits, both of which dominate the latch. The
 ; MaxBECount should be the minimum of them.
 ;
 ; CHECK-LABEL: @two_mustexit