[SCEV] Regenerate test checks (NFC)

There have been some minor but pervasive changes to the generated
CHECK lines, so regenerate all of them, to minimize future diffs.

Author: nikic

llvm/test/Analysis/ScalarEvolution/add-like-or.ll

@@ -36,7 +36,7 @@ define void @mask-high(i64 %arg, ptr dereferenceable(4) %arg1) {
 ; CHECK-NEXT:  Loop %bb6: symbolic max backedge-taken count is (-1 + (-16 * (%arg /u 16)) + ((sext i32 %i to i64) smax (1 + (16 * (%arg /u 16))<nuw>)<nuw><nsw>))
 ; CHECK-NEXT:  Loop %bb6: Predicated backedge-taken count is (-1 + (-16 * (%arg /u 16)) + ((sext i32 %i to i64) smax (1 + (16 * (%arg /u 16))<nuw>)<nuw><nsw>))
 ; CHECK-NEXT:   Predicates:
-; CHECK:       Loop %bb6: Trip multiple is 1
+; CHECK-NEXT:  Loop %bb6: Trip multiple is 1
 ;
 bb:
   %i = load i32, ptr %arg1, align 4

llvm/test/Analysis/ScalarEvolution/addrec-computed-during-addrec-calculation.ll

@@ -24,7 +24,7 @@ define void @test(ptr %p) {
 ; CHECK-NEXT:    %iv3.next = add nsw i64 %iv3, 1
 ; CHECK-NEXT:    --> {(1 + (sext i32 {%iv,+,1}<%loop2> to i64))<nsw>,+,1}<nsw><%loop3> U: [-2147483647,2147483649) S: [-2147483647,2147483649) Exits: (1 + (sext i32 {%iv,+,1}<%loop2> to i64))<nsw> LoopDispositions: { %loop3: Computable, %loop.header: Variant }
 ; CHECK-NEXT:    %iv.next = trunc i64 %iv3 to i32
-; CHECK-NEXT:    --> {{{.*}}{%iv,+,1}<%loop2>,+,1}<%loop3> U: full-set S: full-set --> {%iv,+,1}<%loop2> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop.header: Variant, %loop2: Variant, %loop3: Computable }
+; CHECK-NEXT:    --> {{\{\{}}%iv,+,1}<%loop2>,+,1}<%loop3> U: full-set S: full-set --> {%iv,+,1}<%loop2> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop.header: Variant, %loop2: Variant, %loop3: Computable }
 ; CHECK-NEXT:  Determining loop execution counts for: @test
 ; CHECK-NEXT:  Loop %loop2: Unpredictable backedge-taken count.
 ; CHECK-NEXT:  Loop %loop2: constant max backedge-taken count is -1
@@ -35,7 +35,7 @@ define void @test(ptr %p) {
 ; CHECK-NEXT:  Loop %loop3: symbolic max backedge-taken count is false
 ; CHECK-NEXT:  Loop %loop3: Predicated backedge-taken count is false
 ; CHECK-NEXT:   Predicates:
-; CHECK:       Loop %loop3: Trip multiple is 1
+; CHECK-NEXT:  Loop %loop3: Trip multiple is 1
 ; CHECK-NEXT:  Loop %loop.header: <multiple exits> Unpredictable backedge-taken count.
 ; CHECK-NEXT:  Loop %loop.header: Unpredictable constant max backedge-taken count.
 ; CHECK-NEXT:  Loop %loop.header: Unpredictable symbolic max backedge-taken count.

llvm/test/Analysis/ScalarEvolution/addrec-sub-nsw.ll

@@ -16,7 +16,7 @@ define i32 @test_1_non_negative(i32 %n) {
 ; CHECK-NEXT:  Loop %loop: symbolic max backedge-taken count is (-1 + (1 smax %n))<nsw>
 ; CHECK-NEXT:  Loop %loop: Predicated backedge-taken count is (-1 + (1 smax %n))<nsw>
 ; CHECK-NEXT:   Predicates:
-; CHECK:       Loop %loop: Trip multiple is 1
+; CHECK-NEXT:  Loop %loop: Trip multiple is 1
 ;
 entry:
   %precond = icmp sge i32 %n, 0
@@ -55,7 +55,7 @@ define i32 @test_2_non_positive(i32 %n) {
 ; CHECK-NEXT:  Loop %loop: symbolic max backedge-taken count is (-1 + (1 smax %n))<nsw>
 ; CHECK-NEXT:  Loop %loop: Predicated backedge-taken count is (-1 + (1 smax %n))<nsw>
 ; CHECK-NEXT:   Predicates:
-; CHECK:       Loop %loop: Trip multiple is 1
+; CHECK-NEXT:  Loop %loop: Trip multiple is 1
 ;
 entry:
   %precond = icmp sge i32 %n, 0

llvm/test/Analysis/ScalarEvolution/alloca.ll

@@ -48,7 +48,7 @@ define void @alloca_icmp_null_exit_count() {
 ; CHECK-NEXT:  Loop %loop: symbolic max backedge-taken count is 2
 ; CHECK-NEXT:  Loop %loop: Predicated backedge-taken count is 2
 ; CHECK-NEXT:   Predicates:
-; CHECK:       Loop %loop: Trip multiple is 3
+; CHECK-NEXT:  Loop %loop: Trip multiple is 3
 ;
 entry:
   %alloca = alloca [3 x i32], align 4

llvm/test/Analysis/ScalarEvolution/backedge-taken-count-guard-info.ll

@@ -18,7 +18,7 @@ define void @loop_guard_improves_exact_backedge_taken_count_1(i32 %conv) {
 ; CHECK-NEXT:  Loop %loop: symbolic max backedge-taken count is 0
 ; CHECK-NEXT:  Loop %loop: Predicated backedge-taken count is 0
 ; CHECK-NEXT:   Predicates:
-; CHECK:       Loop %loop: Trip multiple is 1
+; CHECK-NEXT:  Loop %loop: Trip multiple is 1
 ;
 entry:
   %and = and i32 %conv, 1
@@ -54,7 +54,7 @@ define void @loop_guard_improves_exact_backedge_taken_count_2(i32 %conv) {
 ; CHECK-NEXT:  Loop %loop: symbolic max backedge-taken count is (zext i1 (trunc i32 %conv to i1) to i64)
 ; CHECK-NEXT:  Loop %loop: Predicated backedge-taken count is (zext i1 (trunc i32 %conv to i1) to i64)
 ; CHECK-NEXT:   Predicates:
-; CHECK:       Loop %loop: Trip multiple is 2
+; CHECK-NEXT:  Loop %loop: Trip multiple is 2
 ;
 entry:
   %and = and i32 %conv, 1

llvm/test/Analysis/ScalarEvolution/decrementing_addrecs.ll

@@ -51,7 +51,7 @@ define i32 @test_step_1_flags(i32 %n) {
 ; DEFAULT-NEXT:  Loop %loop: symbolic max backedge-taken count is (-1 + %n)
 ; DEFAULT-NEXT:  Loop %loop: Predicated backedge-taken count is (-1 + %n)
 ; DEFAULT-NEXT:   Predicates:
-; DEFAULT:       Loop %loop: Trip multiple is 1
+; DEFAULT-NEXT:  Loop %loop: Trip multiple is 1
 ;
 ; EXPENSIVE_SHARPENING-LABEL: 'test_step_1_flags'
 ; EXPENSIVE_SHARPENING-NEXT:  Classifying expressions for: @test_step_1_flags
@@ -77,7 +77,7 @@ define i32 @test_step_1_flags(i32 %n) {
 ; EXPENSIVE_SHARPENING-NEXT:  Loop %loop: symbolic max backedge-taken count is (-1 + %n)
 ; EXPENSIVE_SHARPENING-NEXT:  Loop %loop: Predicated backedge-taken count is (-1 + %n)
 ; EXPENSIVE_SHARPENING-NEXT:   Predicates:
-; EXPENSIVE_SHARPENING:       Loop %loop: Trip multiple is 1
+; EXPENSIVE_SHARPENING-NEXT:  Loop %loop: Trip multiple is 1
 ;
 entry:
   %n.minus.1 = sub nsw i32 %n, 1

llvm/test/Analysis/ScalarEvolution/exact-exit-count-more-precise.ll

@@ -18,7 +18,7 @@ define void @test_and(i16 %in) {
 ; CHECK-NEXT:  Loop %bb1.i: symbolic max backedge-taken count is (1 + (-1 * %in))
 ; CHECK-NEXT:  Loop %bb1.i: Predicated backedge-taken count is (1 + (-1 * %in))
 ; CHECK-NEXT:   Predicates:
-; CHECK:       Loop %bb1.i: Trip multiple is 1
+; CHECK-NEXT:  Loop %bb1.i: Trip multiple is 1
 ; CHECK-NEXT:  Loop %bb2: <multiple exits> Unpredictable backedge-taken count.
 ; CHECK-NEXT:  Loop %bb2: Unpredictable constant max backedge-taken count.
 ; CHECK-NEXT:  Loop %bb2: Unpredictable symbolic max backedge-taken count.
@@ -60,7 +60,7 @@ define void @test_or() {
 ; CHECK-NEXT:  Loop %BB: symbolic max backedge-taken count is undef
 ; CHECK-NEXT:  Loop %BB: Predicated backedge-taken count is undef
 ; CHECK-NEXT:   Predicates:
-; CHECK:       Loop %BB: Trip multiple is 1
+; CHECK-NEXT:  Loop %BB: Trip multiple is 1
 ;
   %C10 = icmp slt i1 undef, undef
   br i1 %C10, label %BB, label %exit