[llvm] 88f7dc1 - [SCEV] Regenerate test checks (NFC)
Nikita Popov via llvm-commits
llvm-commits at lists.llvm.org
Fri Nov 24 06:49:50 PST 2023
Author: Nikita Popov
Date: 2023-11-24T15:49:28+01:00
New Revision: 88f7dc17eb271e37caf381f02eb75b3493e2b4a5
URL: https://github.com/llvm/llvm-project/commit/88f7dc17eb271e37caf381f02eb75b3493e2b4a5
DIFF: https://github.com/llvm/llvm-project/commit/88f7dc17eb271e37caf381f02eb75b3493e2b4a5.diff
LOG: [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.
Added:
Modified:
llvm/test/Analysis/ScalarEvolution/add-like-or.ll
llvm/test/Analysis/ScalarEvolution/addrec-computed-during-addrec-calculation.ll
llvm/test/Analysis/ScalarEvolution/addrec-sub-nsw.ll
llvm/test/Analysis/ScalarEvolution/alloca.ll
llvm/test/Analysis/ScalarEvolution/backedge-taken-count-guard-info.ll
llvm/test/Analysis/ScalarEvolution/decrementing_addrecs.ll
llvm/test/Analysis/ScalarEvolution/exact-exit-count-more-precise.ll
llvm/test/Analysis/ScalarEvolution/exit-count-select-safe.ll
llvm/test/Analysis/ScalarEvolution/exit-count-select.ll
llvm/test/Analysis/ScalarEvolution/extract-lowbits-sameconstmask.ll
llvm/test/Analysis/ScalarEvolution/finite-trip-count.ll
llvm/test/Analysis/ScalarEvolution/flags-from-poison-noautogen.ll
llvm/test/Analysis/ScalarEvolution/flags-from-poison.ll
llvm/test/Analysis/ScalarEvolution/fold.ll
llvm/test/Analysis/ScalarEvolution/huge-trip-multiple.ll
llvm/test/Analysis/ScalarEvolution/increasing-or-decreasing-iv.ll
llvm/test/Analysis/ScalarEvolution/load.ll
llvm/test/Analysis/ScalarEvolution/logical-operations.ll
llvm/test/Analysis/ScalarEvolution/lshr-shl-differentconstmask.ll
llvm/test/Analysis/ScalarEvolution/malloc.ll
llvm/test/Analysis/ScalarEvolution/max-backedge-taken-count-guard-info-rewrite-expressions.ll
llvm/test/Analysis/ScalarEvolution/max-backedge-taken-count-guard-info.ll
llvm/test/Analysis/ScalarEvolution/max-backedge-taken-count-limit-by-wrapping.ll
llvm/test/Analysis/ScalarEvolution/max-be-count-not-constant.ll
llvm/test/Analysis/ScalarEvolution/max-expr-cache.ll
llvm/test/Analysis/ScalarEvolution/min-max-exprs.ll
llvm/test/Analysis/ScalarEvolution/ne-overflow.ll
llvm/test/Analysis/ScalarEvolution/no-wrap-symbolic-becount.ll
llvm/test/Analysis/ScalarEvolution/nsw-offset-assume.ll
llvm/test/Analysis/ScalarEvolution/nsw-offset.ll
llvm/test/Analysis/ScalarEvolution/nsw.ll
llvm/test/Analysis/ScalarEvolution/overflow-intrinsics-trip-count.ll
llvm/test/Analysis/ScalarEvolution/predicated-trip-count.ll
llvm/test/Analysis/ScalarEvolution/ptrtoint.ll
llvm/test/Analysis/ScalarEvolution/range-signedness.ll
llvm/test/Analysis/ScalarEvolution/range_nw_flag.ll
llvm/test/Analysis/ScalarEvolution/ranges.ll
llvm/test/Analysis/ScalarEvolution/sdiv.ll
llvm/test/Analysis/ScalarEvolution/sext-add-inreg-loop.ll
llvm/test/Analysis/ScalarEvolution/sext-mul.ll
llvm/test/Analysis/ScalarEvolution/sext-to-zext.ll
llvm/test/Analysis/ScalarEvolution/shift-recurrences.ll
llvm/test/Analysis/ScalarEvolution/shl-lshr-differentconstmask.ll
llvm/test/Analysis/ScalarEvolution/smax-br-phi-idioms.ll
llvm/test/Analysis/ScalarEvolution/smin-smax-folds.ll
llvm/test/Analysis/ScalarEvolution/solve-quadratic-i1.ll
llvm/test/Analysis/ScalarEvolution/solve-quadratic-overflow.ll
llvm/test/Analysis/ScalarEvolution/srem.ll
llvm/test/Analysis/ScalarEvolution/symbolic_max_exit_count.ll
llvm/test/Analysis/ScalarEvolution/trip-count-andor-selectform.ll
llvm/test/Analysis/ScalarEvolution/trip-count-andor.ll
llvm/test/Analysis/ScalarEvolution/trip-count-implied-addrec.ll
llvm/test/Analysis/ScalarEvolution/trip-count-minmax.ll
llvm/test/Analysis/ScalarEvolution/trip-count.ll
llvm/test/Analysis/ScalarEvolution/trip-count10.ll
llvm/test/Analysis/ScalarEvolution/trip-count14.ll
llvm/test/Analysis/ScalarEvolution/trip-count15.ll
llvm/test/Analysis/ScalarEvolution/trip-count2.ll
llvm/test/Analysis/ScalarEvolution/trip-count3.ll
llvm/test/Analysis/ScalarEvolution/trip-count4.ll
llvm/test/Analysis/ScalarEvolution/trip-count8.ll
llvm/test/Analysis/ScalarEvolution/trip-count9.ll
llvm/test/Analysis/ScalarEvolution/trip-multiple-guard-info.ll
llvm/test/Analysis/ScalarEvolution/trip-multiple.ll
llvm/test/Analysis/ScalarEvolution/umin-umax-folds.ll
llvm/test/Analysis/ScalarEvolution/unknown_phis.ll
Removed:
################################################################################
diff --git a/llvm/test/Analysis/ScalarEvolution/add-like-or.ll b/llvm/test/Analysis/ScalarEvolution/add-like-or.ll
index e144755d8fba7ad..38b6c44fdf35683 100644
--- a/llvm/test/Analysis/ScalarEvolution/add-like-or.ll
+++ b/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
diff --git a/llvm/test/Analysis/ScalarEvolution/addrec-computed-during-addrec-calculation.ll b/llvm/test/Analysis/ScalarEvolution/addrec-computed-during-addrec-calculation.ll
index 56be4e0726f8e2e..9dfde18b6fdae1e 100644
--- a/llvm/test/Analysis/ScalarEvolution/addrec-computed-during-addrec-calculation.ll
+++ b/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.
diff --git a/llvm/test/Analysis/ScalarEvolution/addrec-sub-nsw.ll b/llvm/test/Analysis/ScalarEvolution/addrec-sub-nsw.ll
index 032aaa4a7010764..cf59ff8812bbc90 100644
--- a/llvm/test/Analysis/ScalarEvolution/addrec-sub-nsw.ll
+++ b/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
diff --git a/llvm/test/Analysis/ScalarEvolution/alloca.ll b/llvm/test/Analysis/ScalarEvolution/alloca.ll
index fbbdf02be1936e2..1a704322bf05a20 100644
--- a/llvm/test/Analysis/ScalarEvolution/alloca.ll
+++ b/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
diff --git a/llvm/test/Analysis/ScalarEvolution/backedge-taken-count-guard-info.ll b/llvm/test/Analysis/ScalarEvolution/backedge-taken-count-guard-info.ll
index 8e0b29cc62d14f9..2c29447358b387c 100644
--- a/llvm/test/Analysis/ScalarEvolution/backedge-taken-count-guard-info.ll
+++ b/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
diff --git a/llvm/test/Analysis/ScalarEvolution/decrementing_addrecs.ll b/llvm/test/Analysis/ScalarEvolution/decrementing_addrecs.ll
index 9ca82061dc4998a..e92f66cf6e18ed2 100644
--- a/llvm/test/Analysis/ScalarEvolution/decrementing_addrecs.ll
+++ b/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
diff --git a/llvm/test/Analysis/ScalarEvolution/exact-exit-count-more-precise.ll b/llvm/test/Analysis/ScalarEvolution/exact-exit-count-more-precise.ll
index 4b652c7e6df5dec..19a65b4aa37109a 100644
--- a/llvm/test/Analysis/ScalarEvolution/exact-exit-count-more-precise.ll
+++ b/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
diff --git a/llvm/test/Analysis/ScalarEvolution/exit-count-select-safe.ll b/llvm/test/Analysis/ScalarEvolution/exit-count-select-safe.ll
index cf52c1b6cf8a253..2af1309cab7e4f4 100644
--- a/llvm/test/Analysis/ScalarEvolution/exit-count-select-safe.ll
+++ b/llvm/test/Analysis/ScalarEvolution/exit-count-select-safe.ll
@@ -16,7 +16,7 @@ define i32 @logical_and_2ops(i32 %n, i32 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%n umin_seq %m)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%n umin_seq %m)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -46,7 +46,7 @@ define i32 @logical_or_2ops(i32 %n, i32 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%n umin_seq %m)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%n umin_seq %m)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -78,7 +78,7 @@ define i32 @logical_and_3ops(i32 %n, i32 %m, i32 %k) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%n umin_seq %m umin_seq %k)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%n umin_seq %m umin_seq %k)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -112,7 +112,7 @@ define i32 @logical_or_3ops(i32 %n, i32 %m, i32 %k) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%n umin_seq %m umin_seq %k)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%n umin_seq %m umin_seq %k)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -148,7 +148,7 @@ define i32 @logical_or_3ops_duplicate(i32 %n, i32 %m, i32 %k) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%n umin_seq %m umin_seq %k)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%n umin_seq %m umin_seq %k)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -186,7 +186,7 @@ define i32 @logical_or_3ops_redundant_uminseq_operand(i32 %n, i32 %m, i32 %k) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((%n umin %m) umin_seq %k)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((%n umin %m) umin_seq %k)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -223,7 +223,7 @@ define i32 @logical_or_3ops_redundant_umin_operand(i32 %n, i32 %m, i32 %k) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%n umin_seq %k umin_seq %m)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%n umin_seq %k umin_seq %m)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -262,7 +262,7 @@ define i32 @logical_or_4ops_redundant_operand_across_umins(i32 %n, i32 %m, i32 %
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((%n umin %m) umin_seq %k umin_seq %q)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((%n umin %m) umin_seq %k umin_seq %q)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -302,7 +302,7 @@ define i32 @logical_or_3ops_operand_wise_redundant_umin(i32 %n, i32 %m, i32 %k)
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((%n umin %m) umin_seq %k)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((%n umin %m) umin_seq %k)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -340,7 +340,7 @@ define i32 @logical_or_3ops_partially_redundant_umin(i32 %n, i32 %m, i32 %k) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%n umin_seq (%m umin %k))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%n umin_seq (%m umin %k))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -386,13 +386,13 @@ define i32 @logical_or_5ops_redundant_opearand_of_inner_uminseq(i32 %a, i32 %b,
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%a umin_seq %b umin_seq ((%e umin_seq %d) umin %c))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%a umin_seq %b umin_seq ((%e umin_seq %d) umin %c))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %first.loop: backedge-taken count is (%e umin_seq %d umin_seq %a)
; CHECK-NEXT: Loop %first.loop: constant max backedge-taken count is -1
; CHECK-NEXT: Loop %first.loop: symbolic max backedge-taken count is (%e umin_seq %d umin_seq %a)
; CHECK-NEXT: Loop %first.loop: Predicated backedge-taken count is (%e umin_seq %d umin_seq %a)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %first.loop: Trip multiple is 1
+; CHECK-NEXT: Loop %first.loop: Trip multiple is 1
;
entry:
br label %first.loop
@@ -439,7 +439,7 @@ define i32 @logical_and_2ops_and_constant(i32 %n, i32 %m, i32 %k) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (42 umin %n)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (42 umin %n)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -478,13 +478,13 @@ define i32 @computeSCEVAtScope(i32 %d.0) {
; CHECK-NEXT: Loop %for.cond: symbolic max backedge-taken count is (-1 * %d.0)
; CHECK-NEXT: Loop %for.cond: Predicated backedge-taken count is (-1 * %d.0)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.cond: Trip multiple is 1
+; CHECK-NEXT: Loop %for.cond: Trip multiple is 1
; CHECK-NEXT: Loop %for.cond4: backedge-taken count is 0
; CHECK-NEXT: Loop %for.cond4: constant max backedge-taken count is 0
; CHECK-NEXT: Loop %for.cond4: symbolic max backedge-taken count is 0
; CHECK-NEXT: Loop %for.cond4: Predicated backedge-taken count is 0
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.cond4: Trip multiple is 1
+; CHECK-NEXT: Loop %for.cond4: Trip multiple is 1
; CHECK-NEXT: Loop %while.cond: <multiple exits> Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %while.cond: Unpredictable constant max backedge-taken count.
; CHECK-NEXT: Loop %while.cond: Unpredictable symbolic max backedge-taken count.
@@ -547,7 +547,7 @@ define i64 @uminseq_vs_ptrtoint_complexity(i64 %n, i64 %m, ptr %ptr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%n umin_seq %m)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%n umin_seq %m)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -581,7 +581,7 @@ define i32 @logical_and_implies_poison1(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((1 + %n) umin %n)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((1 + %n) umin %n)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%add = add i32 %n, 1
@@ -614,7 +614,7 @@ define i32 @logical_and_implies_poison2(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((1 + %n) umin %n)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((1 + %n) umin %n)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%add = add i32 %n, 1
@@ -647,7 +647,7 @@ define i32 @logical_and_implies_poison3(i32 %n, i32 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((%n + %m) umin %n)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((%n + %m) umin %n)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%add = add i32 %n, %m
@@ -680,7 +680,7 @@ define i32 @logical_and_implies_poison_wrong_direction(i32 %n, i32 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%n umin_seq (%n + %m))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%n umin_seq (%n + %m))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%add = add i32 %n, %m
@@ -711,7 +711,7 @@ define i32 @logical_and_implies_poison_noundef(i32 %n, i32 noundef %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%n umin %m)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%n umin %m)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -741,7 +741,7 @@ define i32 @logical_and_implies_poison_noundef_wrong_direction(i32 %n, i32 nound
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%m umin_seq %n)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%m umin_seq %n)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -775,7 +775,7 @@ define i32 @logical_and_implies_poison_complex1(i32 %n, i32 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((%n + %m) umin (1 + %n + %m))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((%n + %m) umin (1 + %n + %m))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%add = add i32 %n, %m
@@ -811,7 +811,7 @@ define i32 @logical_and_implies_poison_complex2(i32 %n, i32 %m, i32 %l) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((%n + %m) umin (%n + %m + %l))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((%n + %m) umin (%n + %m + %l))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%add = add i32 %n, %m
@@ -847,7 +847,7 @@ define i32 @logical_and_implies_poison_complex_wrong_direction(i32 %n, i32 %m, i
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((%n + %m) umin_seq (%n + %m + %l))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((%n + %m) umin_seq (%n + %m + %l))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%add = add i32 %n, %m
@@ -883,7 +883,7 @@ define i32 @logical_and_implies_multiple_ops(i32 %n, i32 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (((1 + %n) umin %n) umin_seq %m)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (((1 + %n) umin %n) umin_seq %m)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%add = add i32 %n, 1
@@ -920,7 +920,7 @@ define i32 @logical_and_implies_multiple_ops2(i32 %n, i32 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%n umin_seq ((1 + %n) umin %m))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%n umin_seq ((1 + %n) umin %m))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%add = add i32 %n, 1
@@ -957,7 +957,7 @@ define i32 @logical_and_implies_multiple_ops3(i32 %n, i32 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%m umin_seq ((1 + %n) umin %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%m umin_seq ((1 + %n) umin %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%add = add i32 %n, 1
@@ -994,7 +994,7 @@ define i32 @logical_and_not_zero(i16 %n, i32 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((1 + (zext i16 %n to i32))<nuw><nsw> umin %m)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((1 + (zext i16 %n to i32))<nuw><nsw> umin %m)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%n.ext = zext i16 %n to i32
@@ -1030,7 +1030,7 @@ define i32 @logical_and_not_zero_wrong_order(i16 %n, i32 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%m umin_seq (1 + (zext i16 %n to i32))<nuw><nsw>)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%m umin_seq (1 + (zext i16 %n to i32))<nuw><nsw>)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%n.ext = zext i16 %n to i32
@@ -1062,7 +1062,7 @@ define i32 @logical_and_not_zero_needs_context(i32 %n, i32 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%n umin_seq %m)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%n umin_seq %m)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp = icmp ne i32 %n, 0
@@ -1101,7 +1101,7 @@ define i32 @logical_and_known_smaller(i16 %n, i16 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (zext i16 %n to i32)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i16 %n to i32)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%n.ext = zext i16 %n to i32
@@ -1140,7 +1140,7 @@ define i32 @logical_and_known_smaller_equal(i16 %n, i16 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (zext i16 %n to i32)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i16 %n to i32)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%n.ext = zext i16 %n to i32
@@ -1179,7 +1179,7 @@ define i32 @logical_and_not_known_smaller_equal(i16 %n, i16 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((zext i16 %n to i32) umin_seq (65534 + (zext i16 %m to i32))<nuw><nsw>)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((zext i16 %n to i32) umin_seq (65534 + (zext i16 %m to i32))<nuw><nsw>)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%n.ext = zext i16 %n to i32
@@ -1218,7 +1218,7 @@ define i32 @logical_and_known_greater(i16 %n, i16 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (zext i16 %n to i32)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i16 %n to i32)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%n.ext = zext i16 %n to i32
@@ -1257,7 +1257,7 @@ define i32 @logical_and_known_greater_equal(i16 %n, i16 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (zext i16 %n to i32)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i16 %n to i32)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%n.ext = zext i16 %n to i32
@@ -1296,7 +1296,7 @@ define i32 @logical_and_not_known_greater_equal(i16 %n, i16 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((zext i16 %n to i32) umin (65534 + (zext i16 %m to i32))<nuw><nsw>)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((zext i16 %n to i32) umin (65534 + (zext i16 %m to i32))<nuw><nsw>)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%n.ext = zext i16 %n to i32
@@ -1329,7 +1329,7 @@ define i32 @logical_and_zero_arg1(i32 %n) {
; 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:
br label %loop
@@ -1359,7 +1359,7 @@ define i32 @logical_and_zero_arg2(i32 %n) {
; 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:
br label %loop
diff --git a/llvm/test/Analysis/ScalarEvolution/exit-count-select.ll b/llvm/test/Analysis/ScalarEvolution/exit-count-select.ll
index f8a90ddaf08eec3..f9de34e54b9e93a 100644
--- a/llvm/test/Analysis/ScalarEvolution/exit-count-select.ll
+++ b/llvm/test/Analysis/ScalarEvolution/exit-count-select.ll
@@ -18,7 +18,7 @@ define void @logical_and_m_const(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (2 umin %n)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (2 umin %n)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -50,7 +50,7 @@ define void @logical_and_nonzero(i32 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (2 umin %m)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (2 umin %m)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -83,7 +83,7 @@ define void @logical_and_zero(i32 %m) {
; 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:
br label %loop
@@ -147,7 +147,7 @@ define void @logical_or_m_const(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (2 umin %n)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (2 umin %n)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -179,7 +179,7 @@ define void @logical_or_nonzero(i32 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (2 umin %m)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (2 umin %m)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -212,7 +212,7 @@ define void @logical_or_zero(i32 %m) {
; 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:
br label %loop
diff --git a/llvm/test/Analysis/ScalarEvolution/extract-lowbits-sameconstmask.ll b/llvm/test/Analysis/ScalarEvolution/extract-lowbits-sameconstmask.ll
index fcb0322cc39684c..b98f966473f4ea7 100644
--- a/llvm/test/Analysis/ScalarEvolution/extract-lowbits-sameconstmask.ll
+++ b/llvm/test/Analysis/ScalarEvolution/extract-lowbits-sameconstmask.ll
@@ -6,9 +6,9 @@ define i32 @mul(i32 %val) nounwind {
; CHECK-LABEL: 'mul'
; CHECK-NEXT: Classifying expressions for: @mul
; CHECK-NEXT: %tmp1 = mul i32 %val, 16
-; CHECK-NEXT: --> (16 * %val) U: [0,-15) S: [-2147483648,2147483633)
+; CHECK-NEXT: --> (16 * %val) U: [0,-15) S: [-2147483648,2147483633)
; CHECK-NEXT: %tmp2 = udiv i32 %tmp1, 16
-; CHECK-NEXT: --> ((16 * %val) /u 16) U: [0,268435456) S: [0,268435456)
+; CHECK-NEXT: --> ((16 * %val) /u 16) U: [0,268435456) S: [0,268435456)
; CHECK-NEXT: Determining loop execution counts for: @mul
;
%tmp1 = mul i32 %val, 16
@@ -26,7 +26,7 @@ define i32 @mask_abc(i32 %val) nounwind {
; CHECK-LABEL: 'mask_abc'
; CHECK-NEXT: Classifying expressions for: @mask_abc
; CHECK-NEXT: %masked = and i32 %val, 15
-; CHECK-NEXT: --> (zext i4 (trunc i32 %val to i4) to i32) U: [0,16) S: [0,16)
+; CHECK-NEXT: --> (zext i4 (trunc i32 %val to i4) to i32) U: [0,16) S: [0,16)
; CHECK-NEXT: Determining loop execution counts for: @mask_abc
;
%masked = and i32 %val, 15
@@ -37,9 +37,9 @@ define i32 @mask_d(i32 %val) nounwind {
; CHECK-LABEL: 'mask_d'
; CHECK-NEXT: Classifying expressions for: @mask_d
; CHECK-NEXT: %highbitscleared = shl i32 %val, 4
-; CHECK-NEXT: --> (16 * %val) U: [0,-15) S: [-2147483648,2147483633)
+; CHECK-NEXT: --> (16 * %val) U: [0,-15) S: [-2147483648,2147483633)
; CHECK-NEXT: %masked = lshr i32 %highbitscleared, 4
-; CHECK-NEXT: --> ((16 * %val) /u 16) U: [0,268435456) S: [0,268435456)
+; CHECK-NEXT: --> ((16 * %val) /u 16) U: [0,268435456) S: [0,268435456)
; CHECK-NEXT: Determining loop execution counts for: @mask_d
;
%highbitscleared = shl i32 %val, 4
diff --git a/llvm/test/Analysis/ScalarEvolution/finite-trip-count.ll b/llvm/test/Analysis/ScalarEvolution/finite-trip-count.ll
index a6b49756719853c..af7454a3570a606 100644
--- a/llvm/test/Analysis/ScalarEvolution/finite-trip-count.ll
+++ b/llvm/test/Analysis/ScalarEvolution/finite-trip-count.ll
@@ -14,7 +14,7 @@ define void @sle_pre_inc(i32 %len) willreturn {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (0 smax (1 + %len))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (0 smax (1 + %len))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
@@ -38,7 +38,7 @@ define void @sle_post_inc(i32 %len) willreturn {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + (1 smax (1 + %len)))<nsw>
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (1 smax (1 + %len)))<nsw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
@@ -84,7 +84,7 @@ define void @ule_pre_inc(i32 %len) willreturn {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (1 + %len)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (1 + %len)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
@@ -108,7 +108,7 @@ define void @ule_post_inc(i32 %len) willreturn {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + (1 umax (1 + %len)))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (1 umax (1 + %len)))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
@@ -154,7 +154,7 @@ define void @sge_pre_inc(i32 %end) willreturn {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (100 + (-1 * (100 smin (-1 + %end))))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (100 + (-1 * (100 smin (-1 + %end))))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
@@ -178,7 +178,7 @@ define void @sge_post_inc(i32 %end) willreturn {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (100 + (-1 * (100 smin (-1 + %end))))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (100 + (-1 * (100 smin (-1 + %end))))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
@@ -224,7 +224,7 @@ define void @use_pre_inc(i32 %end) willreturn {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (100 + (-1 * (100 umin (-1 + %end)))<nsw>)<nsw>
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (100 + (-1 * (100 umin (-1 + %end)))<nsw>)<nsw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
@@ -248,7 +248,7 @@ define void @use_post_inc(i32 %end) willreturn {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (99 + (-1 * (99 umin (-1 + %end)))<nsw>)<nsw>
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (99 + (-1 * (99 umin (-1 + %end)))<nsw>)<nsw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
@@ -294,7 +294,7 @@ define void @pr54191(i64 %n) mustprogress {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-2 + %n) /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-2 + %n) /u 2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%guard = icmp sgt i64 %n, 1
diff --git a/llvm/test/Analysis/ScalarEvolution/flags-from-poison-noautogen.ll b/llvm/test/Analysis/ScalarEvolution/flags-from-poison-noautogen.ll
index 54652489dbd1e6b..0f49ad4aabc4817 100644
--- a/llvm/test/Analysis/ScalarEvolution/flags-from-poison-noautogen.ll
+++ b/llvm/test/Analysis/ScalarEvolution/flags-from-poison-noautogen.ll
@@ -19,22 +19,22 @@ define void @subrecurrences(i32 %outer_l, i32 %inner_l, i32 %val) {
; CHECK-NEXT: %i_idx.inc = add nsw i32 %i_idx, 1
; CHECK-NEXT: --> {1,+,1}<nuw><%inner> U: [1,0) S: [1,0) Exits: (1 + %inner_l) LoopDispositions: { %inner: Computable, %outer: Variant }
; CHECK-NEXT: %v = sub nsw i32 %i_idx, %o_idx.inc
-; CHECK-NEXT: --> {{\{}}{-1,+,-1}<nw><%outer>,+,1}<nsw><%inner> U: full-set S: full-set Exits: {(-1 + %inner_l),+,-1}<nw><%outer> LoopDispositions: { %inner: Computable, %outer: Variant }
+; CHECK-NEXT: --> {{\{\{}}-1,+,-1}<nw><%outer>,+,1}<nsw><%inner> U: full-set S: full-set Exits: {(-1 + %inner_l),+,-1}<nw><%outer> LoopDispositions: { %inner: Computable, %outer: Variant }
; CHECK-NEXT: %forub = udiv i32 1, %v
-; CHECK-NEXT: --> (1 /u {{\{}}{-1,+,-1}<nw><%outer>,+,1}<nsw><%inner>) U: [0,2) S: [0,2) Exits: (1 /u {(-1 + %inner_l),+,-1}<nw><%outer>) LoopDispositions: { %inner: Computable, %outer: Variant }
+; CHECK-NEXT: --> (1 /u {{\{\{}}-1,+,-1}<nw><%outer>,+,1}<nsw><%inner>) U: [0,2) S: [0,2) Exits: (1 /u {(-1 + %inner_l),+,-1}<nw><%outer>) LoopDispositions: { %inner: Computable, %outer: Variant }
; CHECK-NEXT: Determining loop execution counts for: @subrecurrences
; CHECK-NEXT: Loop %inner: backedge-taken count is %inner_l
; CHECK-NEXT: Loop %inner: constant max backedge-taken count is -1
; CHECK-NEXT: Loop %inner: symbolic max backedge-taken count is %inner_l
; CHECK-NEXT: Loop %inner: Predicated backedge-taken count is %inner_l
; CHECK-NEXT: Predicates:
-; CHECK: Loop %inner: Trip multiple is 1
+; CHECK-NEXT: Loop %inner: Trip multiple is 1
; CHECK-NEXT: Loop %outer: backedge-taken count is %outer_l
; CHECK-NEXT: Loop %outer: constant max backedge-taken count is -1
; CHECK-NEXT: Loop %outer: symbolic max backedge-taken count is %outer_l
; CHECK-NEXT: Loop %outer: Predicated backedge-taken count is %outer_l
; CHECK-NEXT: Predicates:
-; CHECK: Loop %outer: Trip multiple is 1
+; CHECK-NEXT: Loop %outer: Trip multiple is 1
;
entry:
br label %outer
diff --git a/llvm/test/Analysis/ScalarEvolution/flags-from-poison.ll b/llvm/test/Analysis/ScalarEvolution/flags-from-poison.ll
index a5bdee5c3b459bb..84e68dd175776a3 100644
--- a/llvm/test/Analysis/ScalarEvolution/flags-from-poison.ll
+++ b/llvm/test/Analysis/ScalarEvolution/flags-from-poison.ll
@@ -34,7 +34,7 @@ define void @test-add-nsw(ptr %input, i32 %offset, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -73,7 +73,7 @@ define void @test-add-nuw(ptr %input, i32 %offset, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -113,7 +113,7 @@ define void @test-add-scope-invariant(ptr %input, i32 %needle) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %offset) + %needle)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %offset) + %needle)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%offset = load i32, ptr %input
@@ -396,7 +396,7 @@ define void @test-add-nuw-from-icmp(ptr %input, i32 %offset,
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
i32 %numIterations) {
entry:
@@ -436,7 +436,7 @@ define void @test-add-no-load(ptr %input, i32 %offset, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -474,7 +474,7 @@ define void @test-add-not-header(ptr %input, i32 %offset, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -513,7 +513,7 @@ define void @test-add-not-header2(ptr %input, i32 %offset, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -597,7 +597,7 @@ define void @test-add-not-header4(ptr %input, i32 %offset, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -674,7 +674,7 @@ define void @test-add-not-header6(ptr %input, i32 %offset, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -713,7 +713,7 @@ define void @test-add-not-header7(ptr %input, i32 %offset, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -754,7 +754,7 @@ define void @test-add-not-header8(ptr %input, i32 %offset, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -795,7 +795,7 @@ define void @test-add-call(ptr %input, i32 %offset, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -833,7 +833,7 @@ define void @test-add-call2(ptr %input, i32 %offset, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -870,7 +870,7 @@ define void @test-gep-propagates-poison(ptr %input, i32 %offset, i32 %numIterati
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -909,7 +909,7 @@ define void @test-add-mul-propagates(ptr %input, i32 %offset, i32 %numIterations
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -948,7 +948,7 @@ define void @test-mul-propagates-poison(ptr %input, i32 %offset, i32 %numIterati
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -986,7 +986,7 @@ define void @test-mul-propagates-poison-2(ptr %input, i32 %offset, i32 %numItera
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -1023,7 +1023,7 @@ define void @test-add-div(ptr %input, i32 %offset, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -1058,7 +1058,7 @@ define void @test-add-div2(ptr %input, i32 %offset, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -1093,7 +1093,7 @@ define void @test-add-store(ptr %input, i32 %offset, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -1136,7 +1136,7 @@ define void @test-add-twice(ptr %input, i32 %offset, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -1180,7 +1180,7 @@ define void @test-mul-nsw(ptr %input, i32 %stride, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -1218,7 +1218,7 @@ define void @test-mul-nuw(ptr %input, i32 %stride, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -1258,7 +1258,7 @@ define void @test-shl-nsw(ptr %input, i32 %start, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %start) + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %start) + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -1298,7 +1298,7 @@ define void @test-shl-nuw-edgecase(ptr %input, i32 %start, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %start) + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %start) + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -1338,7 +1338,7 @@ define void @test-shl-nuw-nsw(ptr %input, i32 %start, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %start) + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %start) + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -1378,7 +1378,7 @@ define void @test-shl-no-nsw(ptr %input, i32 %start, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %start) + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %start) + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -1418,7 +1418,7 @@ define void @test-shl-nsw-edgecase(ptr %input, i32 %start, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %start) + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %start) + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -1456,7 +1456,7 @@ define void @test-shl-nuw(ptr %input, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -1497,7 +1497,7 @@ define void @test-sub-no-nsw(ptr %input, i32 %start, i32 %sub, i32 %numIteration
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %start) + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %start) + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -1539,7 +1539,7 @@ define void @test-sub-nsw(ptr %input, i32 %start, i32 %sub, i32 %numIterations)
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %start) + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %start) + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%halfsub = ashr i32 %sub, 1
@@ -1580,7 +1580,7 @@ define void @test-sub-nsw-lhs-non-negative(ptr %input, i32 %sub, i32 %numIterati
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -1678,7 +1678,7 @@ define void @test-sub-with-add(ptr %input, i32 %offset, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
diff --git a/llvm/test/Analysis/ScalarEvolution/fold.ll b/llvm/test/Analysis/ScalarEvolution/fold.ll
index 2096d309b2435da..e8e3dc97c75192b 100644
--- a/llvm/test/Analysis/ScalarEvolution/fold.ll
+++ b/llvm/test/Analysis/ScalarEvolution/fold.ll
@@ -82,7 +82,7 @@ define void @test4(i32 %x, i32 %y) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 20
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 20
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 21
+; CHECK-NEXT: Loop %loop: Trip multiple is 21
;
entry:
%Y = and i32 %y, 3
diff --git a/llvm/test/Analysis/ScalarEvolution/huge-trip-multiple.ll b/llvm/test/Analysis/ScalarEvolution/huge-trip-multiple.ll
index f511d0435a63960..55fcea22b584097 100644
--- a/llvm/test/Analysis/ScalarEvolution/huge-trip-multiple.ll
+++ b/llvm/test/Analysis/ScalarEvolution/huge-trip-multiple.ll
@@ -19,7 +19,7 @@ define void @trip_count_4294967295() {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 4294967294
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 4294967294
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 4294967295
+; CHECK-NEXT: Loop %for.body: Trip multiple is 4294967295
;
entry:
br label %for.body
@@ -48,7 +48,7 @@ define void @trip_count_4294967296() {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 4294967295
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 4294967295
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 2147483648
+; CHECK-NEXT: Loop %for.body: Trip multiple is 2147483648
;
entry:
br label %for.body
@@ -77,7 +77,7 @@ define void @trip_count_8589935692() {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 8589934591
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 8589934591
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 2147483648
+; CHECK-NEXT: Loop %for.body: Trip multiple is 2147483648
;
entry:
br label %for.body
@@ -106,7 +106,7 @@ define void @trip_count_9223372036854775808() {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 9223372036854775807
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 9223372036854775807
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 2147483648
+; CHECK-NEXT: Loop %for.body: Trip multiple is 2147483648
;
entry:
br label %for.body
@@ -135,7 +135,7 @@ define void @trip_count_18446744073709551615() {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is -2
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is -2
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
diff --git a/llvm/test/Analysis/ScalarEvolution/increasing-or-decreasing-iv.ll b/llvm/test/Analysis/ScalarEvolution/increasing-or-decreasing-iv.ll
index f3465b89ab879c0..a264a7bf4979218 100644
--- a/llvm/test/Analysis/ScalarEvolution/increasing-or-decreasing-iv.ll
+++ b/llvm/test/Analysis/ScalarEvolution/increasing-or-decreasing-iv.ll
@@ -22,7 +22,7 @@ define void @f0(i1 %c) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 127
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 127
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 128
+; CHECK-NEXT: Loop %loop: Trip multiple is 128
;
entry:
%start = select i1 %c, i32 127, i32 0
@@ -90,7 +90,7 @@ define void @f1(i1 %c) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 15
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 15
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 16
+; CHECK-NEXT: Loop %loop: Trip multiple is 16
;
entry:
%start = select i1 %c, i32 120, i32 0
@@ -151,7 +151,7 @@ define void @f2(i1 %c) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 127
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 127
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 128
+; CHECK-NEXT: Loop %loop: Trip multiple is 128
;
entry:
%start = select i1 %c, i32 127, i32 0
@@ -194,7 +194,7 @@ define void @f3(i1 %c) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 127
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 127
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 128
+; CHECK-NEXT: Loop %loop: Trip multiple is 128
;
entry:
@@ -244,7 +244,7 @@ define void @f4(i1 %c) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 127
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 127
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 128
+; CHECK-NEXT: Loop %loop: Trip multiple is 128
;
entry:
@@ -288,7 +288,7 @@ define void @f5(i1 %c) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 127
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 127
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 128
+; CHECK-NEXT: Loop %loop: Trip multiple is 128
;
entry:
%start = select i1 %c, i32 127, i32 0
@@ -334,7 +334,7 @@ define void @f6(i1 %c) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 127
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 127
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 128
+; CHECK-NEXT: Loop %loop: Trip multiple is 128
;
entry:
%start = select i1 %c, i32 127, i32 0
@@ -383,7 +383,7 @@ define void @f7(i1 %c) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 127
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 127
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 128
+; CHECK-NEXT: Loop %loop: Trip multiple is 128
;
entry:
%start = select i1 %c, i32 127, i32 0
diff --git a/llvm/test/Analysis/ScalarEvolution/load.ll b/llvm/test/Analysis/ScalarEvolution/load.ll
index 3d2c2a2f5019756..83b60c58d517419 100644
--- a/llvm/test/Analysis/ScalarEvolution/load.ll
+++ b/llvm/test/Analysis/ScalarEvolution/load.ll
@@ -35,7 +35,7 @@ define i32 @test1() nounwind readnone {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 49
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 49
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 50
+; CHECK-NEXT: Loop %for.body: Trip multiple is 50
;
entry:
br label %for.body
@@ -89,7 +89,7 @@ define i32 @test2() nounwind uwtable readonly {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 4
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 4
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 5
+; CHECK-NEXT: Loop %for.body: Trip multiple is 5
;
entry:
br label %for.body
diff --git a/llvm/test/Analysis/ScalarEvolution/logical-operations.ll b/llvm/test/Analysis/ScalarEvolution/logical-operations.ll
index 4ca2fbef9014b67..3fe1bd1e1646751 100644
--- a/llvm/test/Analysis/ScalarEvolution/logical-operations.ll
+++ b/llvm/test/Analysis/ScalarEvolution/logical-operations.ll
@@ -436,7 +436,7 @@ define ptr @tautological_select_like_phi(i32 %tc) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 100
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 100
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 101
+; CHECK-NEXT: Loop %loop: Trip multiple is 101
;
entry:
br label %loop
diff --git a/llvm/test/Analysis/ScalarEvolution/lshr-shl-
diff erentconstmask.ll b/llvm/test/Analysis/ScalarEvolution/lshr-shl-
diff erentconstmask.ll
index 0a927c30ebf2c83..f2e2c5ee3987051 100644
--- a/llvm/test/Analysis/ScalarEvolution/lshr-shl-
diff erentconstmask.ll
+++ b/llvm/test/Analysis/ScalarEvolution/lshr-shl-
diff erentconstmask.ll
@@ -6,9 +6,9 @@ define i32 @udiv_biggerLshr(i32 %val) nounwind {
; CHECK-LABEL: 'udiv_biggerLshr'
; CHECK-NEXT: Classifying expressions for: @udiv_biggerLshr
; CHECK-NEXT: %tmp1 = udiv i32 %val, 64
-; CHECK-NEXT: --> (%val /u 64) U: [0,67108864) S: [0,67108864)
+; CHECK-NEXT: --> (%val /u 64) U: [0,67108864) S: [0,67108864)
; CHECK-NEXT: %tmp2 = mul i32 %tmp1, 16
-; CHECK-NEXT: --> (16 * (%val /u 64))<nuw><nsw> U: [0,1073741809) S: [0,1073741809)
+; CHECK-NEXT: --> (16 * (%val /u 64))<nuw><nsw> U: [0,1073741809) S: [0,1073741809)
; CHECK-NEXT: Determining loop execution counts for: @udiv_biggerLshr
;
%tmp1 = udiv i32 %val, 64
@@ -20,9 +20,9 @@ define i32 @udiv_biggerShl(i32 %val) nounwind {
; CHECK-LABEL: 'udiv_biggerShl'
; CHECK-NEXT: Classifying expressions for: @udiv_biggerShl
; CHECK-NEXT: %tmp1 = udiv i32 %val, 16
-; CHECK-NEXT: --> (%val /u 16) U: [0,268435456) S: [0,268435456)
+; CHECK-NEXT: --> (%val /u 16) U: [0,268435456) S: [0,268435456)
; CHECK-NEXT: %tmp2 = mul i32 %tmp1, 64
-; CHECK-NEXT: --> (64 * (%val /u 16)) U: [0,-63) S: [-2147483648,2147483585)
+; CHECK-NEXT: --> (64 * (%val /u 16)) U: [0,-63) S: [-2147483648,2147483585)
; CHECK-NEXT: Determining loop execution counts for: @udiv_biggerShl
;
%tmp1 = udiv i32 %val, 16
@@ -36,9 +36,9 @@ define i32 @shifty_biggerLshr(i32 %val) {
; CHECK-LABEL: 'shifty_biggerLshr'
; CHECK-NEXT: Classifying expressions for: @shifty_biggerLshr
; CHECK-NEXT: %tmp1 = lshr i32 %val, 6
-; CHECK-NEXT: --> (%val /u 64) U: [0,67108864) S: [0,67108864)
+; CHECK-NEXT: --> (%val /u 64) U: [0,67108864) S: [0,67108864)
; CHECK-NEXT: %tmp2 = shl i32 %tmp1, 4
-; CHECK-NEXT: --> (16 * (%val /u 64))<nuw><nsw> U: [0,1073741809) S: [0,1073741809)
+; CHECK-NEXT: --> (16 * (%val /u 64))<nuw><nsw> U: [0,1073741809) S: [0,1073741809)
; CHECK-NEXT: Determining loop execution counts for: @shifty_biggerLshr
;
%tmp1 = lshr i32 %val, 6
@@ -50,9 +50,9 @@ define i32 @shifty_biggerLshr_lshrexact(i32 %val) {
; CHECK-LABEL: 'shifty_biggerLshr_lshrexact'
; CHECK-NEXT: Classifying expressions for: @shifty_biggerLshr_lshrexact
; CHECK-NEXT: %tmp1 = lshr exact i32 %val, 6
-; CHECK-NEXT: --> (%val /u 64) U: [0,67108864) S: [0,67108864)
+; CHECK-NEXT: --> (%val /u 64) U: [0,67108864) S: [0,67108864)
; CHECK-NEXT: %tmp2 = shl i32 %tmp1, 4
-; CHECK-NEXT: --> (16 * (%val /u 64))<nuw><nsw> U: [0,1073741809) S: [0,1073741809)
+; CHECK-NEXT: --> (16 * (%val /u 64))<nuw><nsw> U: [0,1073741809) S: [0,1073741809)
; CHECK-NEXT: Determining loop execution counts for: @shifty_biggerLshr_lshrexact
;
%tmp1 = lshr exact i32 %val, 6
@@ -64,9 +64,9 @@ define i32 @shifty_biggerShr(i32 %val) {
; CHECK-LABEL: 'shifty_biggerShr'
; CHECK-NEXT: Classifying expressions for: @shifty_biggerShr
; CHECK-NEXT: %tmp1 = lshr i32 %val, 4
-; CHECK-NEXT: --> (%val /u 16) U: [0,268435456) S: [0,268435456)
+; CHECK-NEXT: --> (%val /u 16) U: [0,268435456) S: [0,268435456)
; CHECK-NEXT: %tmp2 = shl i32 %tmp1, 6
-; CHECK-NEXT: --> (64 * (%val /u 16)) U: [0,-63) S: [-2147483648,2147483585)
+; CHECK-NEXT: --> (64 * (%val /u 16)) U: [0,-63) S: [-2147483648,2147483585)
; CHECK-NEXT: Determining loop execution counts for: @shifty_biggerShr
;
%tmp1 = lshr i32 %val, 4
@@ -78,9 +78,9 @@ define i32 @shifty_biggerShr_lshrexact(i32 %val) {
; CHECK-LABEL: 'shifty_biggerShr_lshrexact'
; CHECK-NEXT: Classifying expressions for: @shifty_biggerShr_lshrexact
; CHECK-NEXT: %tmp1 = lshr exact i32 %val, 4
-; CHECK-NEXT: --> (%val /u 16) U: [0,268435456) S: [0,268435456)
+; CHECK-NEXT: --> (%val /u 16) U: [0,268435456) S: [0,268435456)
; CHECK-NEXT: %tmp2 = shl i32 %tmp1, 6
-; CHECK-NEXT: --> (64 * (%val /u 16)) U: [0,-63) S: [-2147483648,2147483585)
+; CHECK-NEXT: --> (64 * (%val /u 16)) U: [0,-63) S: [-2147483648,2147483585)
; CHECK-NEXT: Determining loop execution counts for: @shifty_biggerShr_lshrexact
;
%tmp1 = lshr exact i32 %val, 4
@@ -94,9 +94,9 @@ define i32 @masky_biggerLshr(i32 %val) {
; CHECK-LABEL: 'masky_biggerLshr'
; CHECK-NEXT: Classifying expressions for: @masky_biggerLshr
; CHECK-NEXT: %tmp1 = lshr i32 %val, 2
-; CHECK-NEXT: --> (%val /u 4) U: [0,1073741824) S: [0,1073741824)
+; CHECK-NEXT: --> (%val /u 4) U: [0,1073741824) S: [0,1073741824)
; CHECK-NEXT: %tmp2 = and i32 %tmp1, -16
-; CHECK-NEXT: --> (16 * (%val /u 64))<nuw><nsw> U: [0,1073741809) S: [0,1073741809)
+; CHECK-NEXT: --> (16 * (%val /u 64))<nuw><nsw> U: [0,1073741809) S: [0,1073741809)
; CHECK-NEXT: Determining loop execution counts for: @masky_biggerLshr
;
%tmp1 = lshr i32 %val, 2
@@ -108,7 +108,7 @@ define i32 @masky_biggerLshr_lshrexact(i32 %val) {
; CHECK-LABEL: 'masky_biggerLshr_lshrexact'
; CHECK-NEXT: Classifying expressions for: @masky_biggerLshr_lshrexact
; CHECK-NEXT: %tmp1 = lshr exact i32 %val, 2
-; CHECK-NEXT: --> (%val /u 4) U: [0,1073741824) S: [0,1073741824)
+; CHECK-NEXT: --> (%val /u 4) U: [0,1073741824) S: [0,1073741824)
; CHECK-NEXT: Determining loop execution counts for: @masky_biggerLshr_lshrexact
;
%tmp1 = lshr exact i32 %val, 2
@@ -119,9 +119,9 @@ define i32 @masky_biggerShr(i32 %val) {
; CHECK-LABEL: 'masky_biggerShr'
; CHECK-NEXT: Classifying expressions for: @masky_biggerShr
; CHECK-NEXT: %tmp1 = shl i32 %val, 2
-; CHECK-NEXT: --> (4 * %val) U: [0,-3) S: [-2147483648,2147483645)
+; CHECK-NEXT: --> (4 * %val) U: [0,-3) S: [-2147483648,2147483645)
; CHECK-NEXT: %tmp2 = and i32 %tmp1, -64
-; CHECK-NEXT: --> (64 * (zext i26 (trunc i32 (%val /u 16) to i26) to i32))<nuw> U: [0,-63) S: [-2147483648,2147483585)
+; CHECK-NEXT: --> (64 * (zext i26 (trunc i32 (%val /u 16) to i26) to i32))<nuw> U: [0,-63) S: [-2147483648,2147483585)
; CHECK-NEXT: Determining loop execution counts for: @masky_biggerShr
;
%tmp1 = shl i32 %val, 2
@@ -133,7 +133,7 @@ define i32 @masky_biggerShr_lshrexact(i32 %val) {
; CHECK-LABEL: 'masky_biggerShr_lshrexact'
; CHECK-NEXT: Classifying expressions for: @masky_biggerShr_lshrexact
; CHECK-NEXT: %tmp1 = shl i32 %val, 2
-; CHECK-NEXT: --> (4 * %val) U: [0,-3) S: [-2147483648,2147483645)
+; CHECK-NEXT: --> (4 * %val) U: [0,-3) S: [-2147483648,2147483645)
; CHECK-NEXT: Determining loop execution counts for: @masky_biggerShr_lshrexact
;
%tmp1 = shl i32 %val, 2
diff --git a/llvm/test/Analysis/ScalarEvolution/malloc.ll b/llvm/test/Analysis/ScalarEvolution/malloc.ll
index 578220cf5c37cc5..3655120aba5027e 100644
--- a/llvm/test/Analysis/ScalarEvolution/malloc.ll
+++ b/llvm/test/Analysis/ScalarEvolution/malloc.ll
@@ -27,7 +27,7 @@ define ptr @undefined_max() {
; CHECK-LABEL: 'undefined_max'
; CHECK-NEXT: Classifying expressions for: @undefined_max
; CHECK-NEXT: %alloc = call nonnull ptr @malloc(i64 -1)
-; CHECK-NEXT: --> %alloc U: full-set S: full-set
+; CHECK-NEXT: --> %alloc U: full-set S: full-set
; CHECK-NEXT: Determining loop execution counts for: @undefined_max
;
%alloc = call nonnull ptr @malloc(i64 -1)
diff --git a/llvm/test/Analysis/ScalarEvolution/max-backedge-taken-count-guard-info-rewrite-expressions.ll b/llvm/test/Analysis/ScalarEvolution/max-backedge-taken-count-guard-info-rewrite-expressions.ll
index 49613180bad1a03..483ce64072ed607 100644
--- a/llvm/test/Analysis/ScalarEvolution/max-backedge-taken-count-guard-info-rewrite-expressions.ll
+++ b/llvm/test/Analysis/ScalarEvolution/max-backedge-taken-count-guard-info-rewrite-expressions.ll
@@ -21,7 +21,7 @@ define void @rewrite_zext(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-8 + (8 * ((zext i32 %n to i64) /u 8))<nuw><nsw>)<nsw> /u 8)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-8 + (8 * ((zext i32 %n to i64) /u 8))<nuw><nsw>)<nsw> /u 8)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%ext = zext i32 %n to i64
@@ -65,7 +65,7 @@ define i32 @rewrite_zext_min_max(i32 %N, ptr %arr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-4 + (4 * ((16 umin (zext i32 %N to i64)) /u 4))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-4 + (4 * ((16 umin (zext i32 %N to i64)) /u 4))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%umin = call i32 @llvm.umin.i32(i32 %N, i32 16)
@@ -113,7 +113,7 @@ define i32 @rewrite_min_max_zext(i32 %N, ptr %arr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-4 + (4 * ((16 umin (zext i32 %N to i64)) /u 4))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-4 + (4 * ((16 umin (zext i32 %N to i64)) /u 4))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%N.wide = zext i32 %N to i64
@@ -161,7 +161,7 @@ define i32 @rewrite_sext_min_max(i32 %N, ptr %arr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-4 + (4 * (zext i3 (trunc i64 ((16 smin (sext i32 %N to i64)) /u 4) to i3) to i64))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-4 + (4 * (zext i3 (trunc i64 ((16 smin (sext i32 %N to i64)) /u 4) to i3) to i64))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%smin = call i32 @llvm.smin.i32(i32 %N, i32 16)
@@ -209,7 +209,7 @@ define i32 @rewrite_min_max_sext(i32 %N, ptr %arr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-4 + (4 * (zext i3 (trunc i64 ((16 smin (sext i32 %N to i64)) /u 4) to i3) to i64))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-4 + (4 * (zext i3 (trunc i64 ((16 smin (sext i32 %N to i64)) /u 4) to i3) to i64))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%N.wide = sext i32 %N to i64
@@ -259,7 +259,7 @@ define i32 @rewrite_zext_with_info_from_icmp_ne(i32 %N) {
; 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 %N, 3
@@ -309,7 +309,7 @@ define i32 @rewrite_zext_no_icmp_ne(i32 %N) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-4 + (4 * ((4 + (zext i32 (-1 + (zext i2 (trunc i32 %N to i2) to i32))<nsw> to i64))<nuw><nsw> /u 4))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-4 + (4 * ((4 + (zext i32 (-1 + (zext i2 (trunc i32 %N to i2) to i32))<nsw> to i64))<nuw><nsw> /u 4))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%and = and i32 %N, 3
@@ -351,7 +351,7 @@ define void @rewrite_zext_and_base_1(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-8 + (8 * ((zext i32 %n to i64) /u 8))<nuw><nsw>)<nsw> /u 8)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-8 + (8 * ((zext i32 %n to i64) /u 8))<nuw><nsw>)<nsw> /u 8)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%ext = zext i32 %n to i64
@@ -396,7 +396,7 @@ define void @rewrite_zext_and_base_2(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-8 + (8 * ((zext i32 %n to i64) /u 8))<nuw><nsw>)<nsw> /u 8)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-8 + (8 * ((zext i32 %n to i64) /u 8))<nuw><nsw>)<nsw> /u 8)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%ext = zext i32 %n to i64
@@ -439,7 +439,7 @@ define void @guard_pessimizes_analysis_step2(i1 %c, i32 %N) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((14 + (-1 * %init)<nsw>)<nsw> /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((14 + (-1 * %init)<nsw>)<nsw> /u 2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%N.ext = zext i32 %N to i64
@@ -487,7 +487,7 @@ define i32 @rewrite_sext_slt_narrow_check(i32 %N, ptr %arr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-4 + (4 * (zext i3 (trunc i64 ((zext i32 (4 smax %N) to i64) /u 4) to i3) to i64))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-4 + (4 * (zext i3 (trunc i64 ((zext i32 (4 smax %N) to i64) /u 4) to i3) to i64))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%smin = call i32 @llvm.smax.i32(i32 %N, i32 4)
@@ -533,7 +533,7 @@ define i32 @rewrite_zext_ult_narrow_check(i32 %N, ptr %arr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-4 + (4 * (zext i3 (trunc i64 ((4 umax (zext i32 %N to i64)) /u 4) to i3) to i64))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-4 + (4 * (zext i3 (trunc i64 ((4 umax (zext i32 %N to i64)) /u 4) to i3) to i64))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%umin = call i32 @llvm.umax.i32(i32 %N, i32 4)
@@ -579,7 +579,7 @@ define i32 @rewrite_zext_ule_narrow_check(i32 %N, ptr %arr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-4 + (4 * (zext i3 (trunc i64 ((4 umax (zext i32 %N to i64)) /u 4) to i3) to i64))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-4 + (4 * (zext i3 (trunc i64 ((4 umax (zext i32 %N to i64)) /u 4) to i3) to i64))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%umin = call i32 @llvm.umax.i32(i32 %N, i32 4)
@@ -625,7 +625,7 @@ define i32 @rewrite_zext_sle_narrow_check(i32 %N, ptr %arr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-4 + (4 * (zext i3 (trunc i64 ((zext i32 (4 smax %N) to i64) /u 4) to i3) to i64))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-4 + (4 * (zext i3 (trunc i64 ((zext i32 (4 smax %N) to i64) /u 4) to i3) to i64))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%smin = call i32 @llvm.smax.i32(i32 %N, i32 4)
@@ -671,7 +671,7 @@ define i32 @rewrite_zext_uge_narrow_check(i32 %N, ptr %arr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-4 + (4 * ((16 umin (zext i32 %N to i64)) /u 4))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-4 + (4 * ((16 umin (zext i32 %N to i64)) /u 4))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%umin = call i32 @llvm.umin.i32(i32 %N, i32 16)
@@ -717,7 +717,7 @@ define i32 @rewrite_sext_sge_narrow_check(i32 %N, ptr %arr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-4 + (4 * (zext i3 (trunc i64 ((16 smin (sext i32 %N to i64)) /u 4) to i3) to i64))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-4 + (4 * (zext i3 (trunc i64 ((16 smin (sext i32 %N to i64)) /u 4) to i3) to i64))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%smin = call i32 @llvm.smin.i32(i32 %N, i32 16)
@@ -763,7 +763,7 @@ define i32 @rewrite_zext_ugt_narrow_check(i32 %N, ptr %arr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-4 + (4 * ((16 umin (zext i32 %N to i64)) /u 4))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-4 + (4 * ((16 umin (zext i32 %N to i64)) /u 4))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%umin = call i32 @llvm.umin.i32(i32 %N, i32 16)
@@ -809,7 +809,7 @@ define i32 @rewrite_sext_sgt_narrow_check(i32 %N, ptr %arr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-4 + (4 * (zext i3 (trunc i64 ((16 smin (sext i32 %N to i64)) /u 4) to i3) to i64))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-4 + (4 * (zext i3 (trunc i64 ((16 smin (sext i32 %N to i64)) /u 4) to i3) to i64))<nuw><nsw>)<nsw> /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%smin = call i32 @llvm.smin.i32(i32 %N, i32 16)
diff --git a/llvm/test/Analysis/ScalarEvolution/max-backedge-taken-count-guard-info.ll b/llvm/test/Analysis/ScalarEvolution/max-backedge-taken-count-guard-info.ll
index eb8e9dd09dc4fb4..33baa996faf8973 100644
--- a/llvm/test/Analysis/ScalarEvolution/max-backedge-taken-count-guard-info.ll
+++ b/llvm/test/Analysis/ScalarEvolution/max-backedge-taken-count-guard-info.ll
@@ -18,7 +18,7 @@ define void @test_guard_less_than_16(ptr nocapture %a, i64 %i) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (15 + (-1 * %i))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (15 + (-1 * %i))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp3 = icmp ult i64 %i, 16
@@ -51,7 +51,7 @@ define void @test_guard_less_than_16_operands_swapped(ptr nocapture %a, i64 %i)
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (15 + (-1 * %i))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (15 + (-1 * %i))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp3 = icmp ugt i64 16, %i
@@ -84,7 +84,7 @@ define void @test_guard_less_than_16_branches_flipped(ptr nocapture %a, i64 %i)
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (15 + (-1 * %i))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (15 + (-1 * %i))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp3 = icmp ult i64 %i, 16
@@ -117,7 +117,7 @@ define void @test_guard_uge_16_branches_flipped(ptr nocapture %a, i64 %i) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (15 + (-1 * %i))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (15 + (-1 * %i))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp3 = icmp uge i64 %i, 16
@@ -150,7 +150,7 @@ define void @test_guard_eq_12(ptr nocapture %a, i64 %N) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %N
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %N
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 13
+; CHECK-NEXT: Loop %loop: Trip multiple is 13
;
entry:
%c.1 = icmp eq i64 %N, 12
@@ -183,7 +183,7 @@ define void @test_guard_ule_12(ptr nocapture %a, i64 %N) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %N
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %N
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%c.1 = icmp ule i64 %N, 12
@@ -216,7 +216,7 @@ define void @test_guard_ule_12_step2(ptr nocapture %a, i64 %N) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%N /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%N /u 2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%c.1 = icmp ule i64 %N, 12
@@ -249,7 +249,7 @@ define void @test_multiple_const_guards_order1(ptr nocapture %a, i64 %i) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %i
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %i
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%c.1 = icmp ult i64 %i, 16
@@ -286,7 +286,7 @@ define void @test_multiple_const_guards_order2(ptr nocapture %a, i64 %i) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %i
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %i
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%c.1 = icmp ult i64 %i, 10
@@ -323,7 +323,7 @@ define void @test_multiple_var_guards_order1(ptr nocapture %a, i64 %i, i64 %N) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %i
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %i
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%c.1 = icmp ult i64 %N, 12
@@ -360,7 +360,7 @@ define void @test_multiple_var_guards_order2(ptr nocapture %a, i64 %i, i64 %N) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %i
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %i
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%c.1 = icmp ult i64 %i, %N
@@ -398,7 +398,7 @@ define void @test_multiple_var_guards_cycle(ptr nocapture %a, i64 %i, i64 %N) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %N
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %N
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%c.1 = icmp ult i64 %N, %i
@@ -435,7 +435,7 @@ define void @test_guard_ult_ne(ptr nocapture readonly %data, i64 %count) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %count)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %count)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp.ult = icmp ult i64 %count, 5
@@ -472,7 +472,7 @@ define void @test_guard_ne_ult(ptr nocapture readonly %data, i64 %count) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %count)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %count)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp.ne = icmp ne i64 %count, 0
@@ -511,7 +511,7 @@ define void @test_guard_if_and_enter(ptr nocapture readonly %data, i64 %count) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %count)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %count)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp.ult = icmp ult i64 %count, 5
@@ -548,7 +548,7 @@ define void @test_guard_if_and_skip(ptr nocapture readonly %data, i64 %count) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %count)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %count)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp.ult = icmp ult i64 %count, 5
@@ -587,7 +587,7 @@ define void @test_guard_if_and_and(ptr nocapture readonly %data, i64 %count, i1
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %count)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %count)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp.ult = icmp ult i64 %count, 5
@@ -627,7 +627,7 @@ define void @test_guard_if_and_or(ptr nocapture readonly %data, i64 %count, i1 %
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %count)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %count)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp.ult = icmp ult i64 %count, 5
@@ -665,7 +665,7 @@ define void @test_guard_if_or_skip(ptr nocapture readonly %data, i64 %count) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %count)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %count)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp.uge = icmp uge i64 %count, 5
@@ -702,7 +702,7 @@ define void @test_guard_if_or_enter(ptr nocapture readonly %data, i64 %count) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %count)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %count)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp.uge = icmp uge i64 %count, 5
@@ -741,7 +741,7 @@ define void @test_guard_if_or_or(ptr nocapture readonly %data, i64 %count, i1 %c
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %count)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %count)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp.uge = icmp uge i64 %count, 5
@@ -781,7 +781,7 @@ define void @test_guard_if_or_and(ptr nocapture readonly %data, i64 %count, i1 %
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %count)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %count)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp.uge = icmp uge i64 %count, 5
@@ -820,7 +820,7 @@ define void @test_guard_and_assume(ptr nocapture readonly %data, i64 %count) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %count)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %count)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp = icmp ult i64 %count, 5
@@ -857,7 +857,7 @@ define void @test_guard_assume_and(ptr nocapture readonly %data, i64 %count) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %count)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %count)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp.ult = icmp ult i64 %count, 5
@@ -896,7 +896,7 @@ define void @guard_pessimizes_analysis_step1(i1 %c, i32 %N) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (9 + (-1 * %init)<nsw>)<nsw>
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (9 + (-1 * %init)<nsw>)<nsw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br i1 %c, label %bb1, label %guard
@@ -937,7 +937,7 @@ define void @guard_pessimizes_analysis_step2(i1 %c, i32 %N) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((8 + (-1 * %init)<nsw>)<nsw> /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((8 + (-1 * %init)<nsw>)<nsw> /u 2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br i1 %c, label %bb1, label %guard
@@ -979,7 +979,7 @@ define void @crash(ptr %ptr) {
; CHECK-NEXT: Loop %while.body125: symbolic max backedge-taken count is {(-2 + (-1 * (ptrtoint ptr %ptr to i64))),+,-1}<nw><%while.cond111>
; CHECK-NEXT: Loop %while.body125: Predicated backedge-taken count is {(-2 + (-1 * (ptrtoint ptr %ptr to i64))),+,-1}<nw><%while.cond111>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %while.body125: Trip multiple is 1
+; CHECK-NEXT: Loop %while.body125: Trip multiple is 1
; CHECK-NEXT: Loop %while.cond111: Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %while.cond111: Unpredictable constant max backedge-taken count.
; CHECK-NEXT: Loop %while.cond111: Unpredictable symbolic max backedge-taken count.
@@ -1033,7 +1033,7 @@ define void @test_guard_uge(i32 %blockSize) {
; CHECK-NEXT: Loop %while.body: symbolic max backedge-taken count is (-1 + (%blockSize /u 4))<nsw>
; CHECK-NEXT: Loop %while.body: Predicated backedge-taken count is (-1 + (%blockSize /u 4))<nsw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %while.body: Trip multiple is 1
+; CHECK-NEXT: Loop %while.body: Trip multiple is 1
;
%shr = lshr i32 %blockSize, 2
%guard = icmp uge i32 %blockSize, 4
@@ -1070,7 +1070,7 @@ define void @test_guard_ugt(i32 %blockSize) {
; CHECK-NEXT: Loop %while.body: symbolic max backedge-taken count is (-1 + (%blockSize /u 4))<nsw>
; CHECK-NEXT: Loop %while.body: Predicated backedge-taken count is (-1 + (%blockSize /u 4))<nsw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %while.body: Trip multiple is 1
+; CHECK-NEXT: Loop %while.body: Trip multiple is 1
;
%shr = lshr i32 %blockSize, 2
%guard = icmp ugt i32 %blockSize, 3
@@ -1107,7 +1107,7 @@ define void @test_guard_uge_and_ule(i32 %blockSize) {
; CHECK-NEXT: Loop %while.body: symbolic max backedge-taken count is (-1 + (%blockSize /u 4))<nsw>
; CHECK-NEXT: Loop %while.body: Predicated backedge-taken count is (-1 + (%blockSize /u 4))<nsw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %while.body: Trip multiple is 1
+; CHECK-NEXT: Loop %while.body: Trip multiple is 1
;
%shr = lshr i32 %blockSize, 2
%guard1 = icmp uge i32 %blockSize, 4
@@ -1148,7 +1148,7 @@ define void @test_guard_ugt_and_ult(i32 %blockSize) {
; CHECK-NEXT: Loop %while.body: symbolic max backedge-taken count is (-1 + (%blockSize /u 4))<nsw>
; CHECK-NEXT: Loop %while.body: Predicated backedge-taken count is (-1 + (%blockSize /u 4))<nsw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %while.body: Trip multiple is 1
+; CHECK-NEXT: Loop %while.body: Trip multiple is 1
;
%shr = lshr i32 %blockSize, 2
%guard1 = icmp ugt i32 %blockSize, 3
@@ -1191,7 +1191,7 @@ define void @test_guard_slt_sgt_1(ptr nocapture %a, i64 %N) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %N)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %N)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%c.0 = icmp slt i64 %N, 12
@@ -1228,7 +1228,7 @@ define void @test_guard_slt_sgt_2(ptr nocapture %a, i64 %i) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (17 + (-1 * %i))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (17 + (-1 * %i))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%c.0 = icmp slt i64 %i, 16
@@ -1265,7 +1265,7 @@ define void @test_guard_sle_sge_1(ptr nocapture %a, i64 %N) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %N)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %N)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%c.0 = icmp sle i64 %N, 12
@@ -1302,7 +1302,7 @@ define void @test_guard_sle_sge_2(ptr nocapture %a, i64 %i) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (17 + (-1 * %i))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (17 + (-1 * %i))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%c.0 = icmp sle i64 %i, 16
@@ -1342,7 +1342,7 @@ define void @optimized_range_check_unsigned(ptr %pred, i32 %N) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %N)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %N)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%N.off = add i32 %N, -1
@@ -1379,7 +1379,7 @@ define void @optimized_range_check_unsigned_icmp_ops_swapped(ptr %pred, i32 %N)
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %N)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %N)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%N.off = add i32 %N, -1
@@ -1418,7 +1418,7 @@ define void @optimized_range_check_unsigned2(ptr %pred, i32 %N) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %N)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %N)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%N.off = add i32 %N, -2
@@ -1458,7 +1458,7 @@ define void @optimized_range_check_unsigned3(ptr %pred, i1 %c) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %N)<nsw>
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %N)<nsw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%N = select i1 %c, i32 2, i32 3
@@ -1497,7 +1497,7 @@ define void @not_optimized_range_check_unsigned1(ptr %pred, i32 %N) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %N)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %N)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%N.off = add i32 %N, -1
@@ -1535,7 +1535,7 @@ define void @not_optimized_range_check_unsigned2(ptr %pred, i32 %N) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %N)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %N)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%N.off = add i32 %N, -1
@@ -1567,7 +1567,7 @@ define i32 @sle_sgt_ult_umax_to_smax(i32 %num) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-4 + %num) /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-4 + %num) /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
guard.1:
%cmp.1 = icmp sle i32 %num, 0
@@ -1605,7 +1605,7 @@ define i32 @ult_sle_sgt_umax_to_smax(i32 %num) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-4 + %num) /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-4 + %num) /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
guard.1:
%cmp.1 = icmp ult i32 %num, 4
@@ -1642,7 +1642,7 @@ define i32 @ptr_induction_ult_1(ptr %a, ptr %b) {
; 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:
%cmp.6 = icmp ult ptr %a, %b
@@ -1703,7 +1703,7 @@ define void @gep_addrec_nw(ptr %a) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 378
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 378
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 379
+; CHECK-NEXT: Loop %for.body: Trip multiple is 379
;
entry:
br label %for.body
diff --git a/llvm/test/Analysis/ScalarEvolution/max-backedge-taken-count-limit-by-wrapping.ll b/llvm/test/Analysis/ScalarEvolution/max-backedge-taken-count-limit-by-wrapping.ll
index 90a8b02ab7b680f..9e0214e12746d80 100644
--- a/llvm/test/Analysis/ScalarEvolution/max-backedge-taken-count-limit-by-wrapping.ll
+++ b/llvm/test/Analysis/ScalarEvolution/max-backedge-taken-count-limit-by-wrapping.ll
@@ -12,7 +12,7 @@ define void @max_backedge_taken_count_by_wrapping1_nsw_nuw(i8 %N, ptr %ptr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%N /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%N /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -37,7 +37,7 @@ define void @max_backedge_taken_count_by_wrapping1_nuw(i8 %N, ptr %ptr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (%N /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%N /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -62,7 +62,7 @@ define void @max_backedge_taken_count_by_wrapping2_nsw_nuw(i8 %N, ptr %ptr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-64 + %N) /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-64 + %N) /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -87,7 +87,7 @@ define void @max_backedge_taken_count_by_wrapping2_nuw(i8 %N, ptr %ptr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-64 + %N) /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-64 + %N) /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
diff --git a/llvm/test/Analysis/ScalarEvolution/max-be-count-not-constant.ll b/llvm/test/Analysis/ScalarEvolution/max-be-count-not-constant.ll
index 07d16b1342c134f..f91b923e4acd99f 100644
--- a/llvm/test/Analysis/ScalarEvolution/max-be-count-not-constant.ll
+++ b/llvm/test/Analysis/ScalarEvolution/max-be-count-not-constant.ll
@@ -25,7 +25,7 @@ define void @pluto(i32 %arg) {
; CHECK-NEXT: Loop %bb2: symbolic max backedge-taken count is (1 /u (2 + %tmp)<nsw>)
; CHECK-NEXT: Loop %bb2: Predicated backedge-taken count is (1 /u (2 + %tmp)<nsw>)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %bb2: Trip multiple is 1
+; CHECK-NEXT: Loop %bb2: Trip multiple is 1
;
bb:
%tmp = ashr i32 %arg, 31
diff --git a/llvm/test/Analysis/ScalarEvolution/max-expr-cache.ll b/llvm/test/Analysis/ScalarEvolution/max-expr-cache.ll
index 6aaf55dba10224b..d401ff31035e8f1 100644
--- a/llvm/test/Analysis/ScalarEvolution/max-expr-cache.ll
+++ b/llvm/test/Analysis/ScalarEvolution/max-expr-cache.ll
@@ -92,7 +92,7 @@ define void @smax(i32 %tmp3) {
; CHECK-NEXT: Loop %bb53: symbolic max backedge-taken count is (-1 + (zext i32 (0 smax %tmp49) to i64) + (-1 * undef))
; CHECK-NEXT: Loop %bb53: Predicated backedge-taken count is (-1 + (zext i32 (0 smax %tmp49) to i64) + (-1 * undef))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %bb53: Trip multiple is 1
+; CHECK-NEXT: Loop %bb53: Trip multiple is 1
; CHECK-NEXT: Loop %bb4: <multiple exits> Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %bb4: Unpredictable constant max backedge-taken count.
; CHECK-NEXT: Loop %bb4: Unpredictable symbolic max backedge-taken count.
@@ -254,7 +254,7 @@ define void @umax(i32 %tmp3) {
; CHECK-NEXT: Loop %bb53: symbolic max backedge-taken count is (-1 + (zext i32 %tmp49 to i64) + (-1 * undef))
; CHECK-NEXT: Loop %bb53: Predicated backedge-taken count is (-1 + (zext i32 %tmp49 to i64) + (-1 * undef))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %bb53: Trip multiple is 1
+; CHECK-NEXT: Loop %bb53: Trip multiple is 1
; CHECK-NEXT: Loop %bb4: <multiple exits> Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %bb4: Unpredictable constant max backedge-taken count.
; CHECK-NEXT: Loop %bb4: Unpredictable symbolic max backedge-taken count.
diff --git a/llvm/test/Analysis/ScalarEvolution/min-max-exprs.ll b/llvm/test/Analysis/ScalarEvolution/min-max-exprs.ll
index d65da6fc7e5ac91..bc0c05aafc6b361 100644
--- a/llvm/test/Analysis/ScalarEvolution/min-max-exprs.ll
+++ b/llvm/test/Analysis/ScalarEvolution/min-max-exprs.ll
@@ -51,7 +51,7 @@ define void @f(ptr %A, i32 %N) {
; CHECK-NEXT: Loop %bb1: symbolic max backedge-taken count is (0 smax %N)
; CHECK-NEXT: Loop %bb1: Predicated backedge-taken count is (0 smax %N)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %bb1: Trip multiple is 1
+; CHECK-NEXT: Loop %bb1: Trip multiple is 1
;
bb:
br label %bb1
diff --git a/llvm/test/Analysis/ScalarEvolution/ne-overflow.ll b/llvm/test/Analysis/ScalarEvolution/ne-overflow.ll
index cca56bcd6c3b83a..6ae241c85f65020 100644
--- a/llvm/test/Analysis/ScalarEvolution/ne-overflow.ll
+++ b/llvm/test/Analysis/ScalarEvolution/ne-overflow.ll
@@ -15,7 +15,7 @@ define void @test(i32 %N) mustprogress {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is ((-2 + %N) /u 2)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is ((-2 + %N) /u 2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
@@ -38,7 +38,7 @@ define void @test_preinc(i32 %N) mustprogress {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (%N /u 2)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (%N /u 2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
@@ -131,7 +131,7 @@ define void @test_1024(i32 %N) mustprogress {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is ((-1024 + %N) /u 1024)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is ((-1024 + %N) /u 1024)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
@@ -154,7 +154,7 @@ define void @test_uneven_divide(i32 %N) mustprogress {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + (-1431655765 * %N))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (-1431655765 * %N))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
@@ -253,7 +253,7 @@ define void @test_zext(i64 %N) mustprogress {
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (%N /u 2)
; CHECK-NEXT: Predicates:
-; CHECK-NEXT: {0,+,2}<nuw><%for.body> Added Flags: <nusw>
+; CHECK-NEXT: {0,+,2}<nuw><%for.body> Added Flags: <nusw>
;
entry:
br label %for.body
diff --git a/llvm/test/Analysis/ScalarEvolution/no-wrap-symbolic-becount.ll b/llvm/test/Analysis/ScalarEvolution/no-wrap-symbolic-becount.ll
index b44be462067cc2d..1831d81cc99fe60 100644
--- a/llvm/test/Analysis/ScalarEvolution/no-wrap-symbolic-becount.ll
+++ b/llvm/test/Analysis/ScalarEvolution/no-wrap-symbolic-becount.ll
@@ -78,7 +78,7 @@ define i32 @test_02(i32 %start, ptr %p, ptr %q) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (9223372036854775806 + (2147483648 * (zext i32 %start to i64))<nuw><nsw>)<nuw>
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (9223372036854775806 + (2147483648 * (zext i32 %start to i64))<nuw><nsw>)<nuw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%zext = zext i32 %start to i64
@@ -139,7 +139,7 @@ define void @pointer_iv_nowrap_guard(ptr %startptr, ptr %endptr) local_unnamed_a
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-8001 + (-1 * (ptrtoint ptr %startptr to i64)) + ((8004 + (ptrtoint ptr %startptr to i64)) umax (ptrtoint ptr %endptr to i64))) /u 4)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-8001 + (-1 * (ptrtoint ptr %startptr to i64)) + ((8004 + (ptrtoint ptr %startptr to i64)) umax (ptrtoint ptr %endptr to i64))) /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%init = getelementptr inbounds i32, ptr %startptr, i64 2000
diff --git a/llvm/test/Analysis/ScalarEvolution/nsw-offset-assume.ll b/llvm/test/Analysis/ScalarEvolution/nsw-offset-assume.ll
index 117f249704d992a..bc308f258dd1d01 100644
--- a/llvm/test/Analysis/ScalarEvolution/nsw-offset-assume.ll
+++ b/llvm/test/Analysis/ScalarEvolution/nsw-offset-assume.ll
@@ -49,7 +49,7 @@ define void @foo(i32 %no, ptr nocapture %d, ptr nocapture %q) nounwind {
; CHECK-NEXT: Loop %bb: symbolic max backedge-taken count is ((-1 + (2 * (%no /u 2))<nuw>) /u 2)
; CHECK-NEXT: Loop %bb: Predicated backedge-taken count is ((-1 + (2 * (%no /u 2))<nuw>) /u 2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %bb: Trip multiple is 1
+; CHECK-NEXT: Loop %bb: Trip multiple is 1
;
entry:
%n = and i32 %no, 4294967294
diff --git a/llvm/test/Analysis/ScalarEvolution/nsw-offset.ll b/llvm/test/Analysis/ScalarEvolution/nsw-offset.ll
index 4e9e91d294e20cd..51b8db676804882 100644
--- a/llvm/test/Analysis/ScalarEvolution/nsw-offset.ll
+++ b/llvm/test/Analysis/ScalarEvolution/nsw-offset.ll
@@ -46,7 +46,7 @@ define void @foo(i32 %no, ptr nocapture %d, ptr nocapture %q) nounwind {
; CHECK-NEXT: Loop %bb: symbolic max backedge-taken count is ((-1 + (2 * (%no /u 2))<nuw>) /u 2)
; CHECK-NEXT: Loop %bb: Predicated backedge-taken count is ((-1 + (2 * (%no /u 2))<nuw>) /u 2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %bb: Trip multiple is 1
+; CHECK-NEXT: Loop %bb: Trip multiple is 1
;
entry:
%n = and i32 %no, 4294967294
diff --git a/llvm/test/Analysis/ScalarEvolution/nsw.ll b/llvm/test/Analysis/ScalarEvolution/nsw.ll
index 031ec46edcdaca1..5c4c9fcd8a0d559 100644
--- a/llvm/test/Analysis/ScalarEvolution/nsw.ll
+++ b/llvm/test/Analysis/ScalarEvolution/nsw.ll
@@ -81,7 +81,7 @@ define void @test2(ptr %begin, ptr %end) ssp {
; CHECK-NEXT: Loop %for.body.i.i: symbolic max backedge-taken count is ((-4 + (-1 * (ptrtoint ptr %begin to i64)) + (ptrtoint ptr %end to i64)) /u 4)
; CHECK-NEXT: Loop %for.body.i.i: Predicated backedge-taken count is ((-4 + (-1 * (ptrtoint ptr %begin to i64)) + (ptrtoint ptr %end to i64)) /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body.i.i: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body.i.i: Trip multiple is 1
;
entry:
%cmp1.i.i = icmp eq ptr %begin, %end
@@ -122,7 +122,7 @@ define void @test3(ptr %begin, ptr %end) nounwind ssp {
; CHECK-NEXT: Loop %for.body.i.i: symbolic max backedge-taken count is ((-4 + (-1 * (ptrtoint ptr %begin to i64)) + (ptrtoint ptr %end to i64)) /u 4)
; CHECK-NEXT: Loop %for.body.i.i: Predicated backedge-taken count is ((-4 + (-1 * (ptrtoint ptr %begin to i64)) + (ptrtoint ptr %end to i64)) /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body.i.i: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body.i.i: Trip multiple is 1
;
entry:
%cmp7.i.i = icmp eq ptr %begin, %end
@@ -185,7 +185,7 @@ define i32 @PR12375(ptr readnone %arg) {
; CHECK-NEXT: Loop %bb1: symbolic max backedge-taken count is 1
; CHECK-NEXT: Loop %bb1: Predicated backedge-taken count is 1
; CHECK-NEXT: Predicates:
-; CHECK: Loop %bb1: Trip multiple is 2
+; CHECK-NEXT: Loop %bb1: Trip multiple is 2
;
bb:
%tmp = getelementptr inbounds i32, ptr %arg, i64 2
@@ -216,7 +216,7 @@ define void @PR12376(ptr nocapture %arg, ptr nocapture %arg1) {
; CHECK-NEXT: Loop %bb2: symbolic max backedge-taken count is ((-1 + (-1 * (ptrtoint ptr %arg to i64)) + ((4 + (ptrtoint ptr %arg to i64))<nuw> umax (ptrtoint ptr %arg1 to i64))) /u 4)
; CHECK-NEXT: Loop %bb2: Predicated backedge-taken count is ((-1 + (-1 * (ptrtoint ptr %arg to i64)) + ((4 + (ptrtoint ptr %arg to i64))<nuw> umax (ptrtoint ptr %arg1 to i64))) /u 4)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %bb2: Trip multiple is 1
+; CHECK-NEXT: Loop %bb2: Trip multiple is 1
;
bb:
br label %bb2
@@ -252,7 +252,7 @@ define void @nswnowrap(i32 %v, ptr %buf) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is ((-1 * %v) + ((1 + %v)<nsw> smax %v)), actual taken count either this or zero.
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is ((-1 * %v) + ((1 + %v)<nsw> smax %v))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
%add = add nsw i32 %v, 1
@@ -295,7 +295,7 @@ define void @test4(i32 %arg) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + (-1 * %arg) + (10 smax (1 + %arg)<nsw>))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (-1 * %arg) + (10 smax (1 + %arg)<nsw>))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
%array = alloca [10 x i32], align 4
@@ -329,7 +329,7 @@ define void @bad_postinc_nsw_a(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((((-1 * (1 umin %n))<nuw><nsw> + %n) /u 7) + (1 umin %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((((-1 * (1 umin %n))<nuw><nsw> + %n) /u 7) + (1 umin %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -390,7 +390,7 @@ define void @pr28012(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 + (7 umax %n)) /u 7)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + (7 umax %n)) /u 7)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -455,7 +455,7 @@ define void @pr66066() {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 1
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 1
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 2
+; CHECK-NEXT: Loop %loop: Trip multiple is 2
;
entry:
br label %loop
diff --git a/llvm/test/Analysis/ScalarEvolution/overflow-intrinsics-trip-count.ll b/llvm/test/Analysis/ScalarEvolution/overflow-intrinsics-trip-count.ll
index 29c345637dd6f54..769db5ae0d5b58b 100644
--- a/llvm/test/Analysis/ScalarEvolution/overflow-intrinsics-trip-count.ll
+++ b/llvm/test/Analysis/ScalarEvolution/overflow-intrinsics-trip-count.ll
@@ -16,7 +16,7 @@ define void @uadd_exhaustive() {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 35
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 35
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 36
+; CHECK-NEXT: Loop %for.body: Trip multiple is 36
;
entry:
br i1 undef, label %for.end, label %for.body.preheader
@@ -43,7 +43,7 @@ define void @sadd_exhaustive() {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 67
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 67
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 68
+; CHECK-NEXT: Loop %for.body: Trip multiple is 68
;
entry:
br i1 undef, label %for.end, label %for.body.preheader
@@ -70,7 +70,7 @@ define void @usub_exhaustive() {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 50
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 50
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 51
+; CHECK-NEXT: Loop %for.body: Trip multiple is 51
;
entry:
br i1 undef, label %for.end, label %for.body.preheader
@@ -97,7 +97,7 @@ define void @ssub_exhaustive() {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 68
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 68
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 69
+; CHECK-NEXT: Loop %for.body: Trip multiple is 69
;
entry:
br i1 undef, label %for.end, label %for.body.preheader
@@ -124,7 +124,7 @@ define void @smul_exhaustive() {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 14
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 14
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 15
+; CHECK-NEXT: Loop %for.body: Trip multiple is 15
;
entry:
br i1 undef, label %for.end, label %for.body.preheader
@@ -151,7 +151,7 @@ define void @umul_exhaustive() {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 15
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 15
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 16
+; CHECK-NEXT: Loop %for.body: Trip multiple is 16
;
entry:
br i1 undef, label %for.end, label %for.body.preheader
@@ -178,7 +178,7 @@ define void @uadd_symbolic_start(i16 %start) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + (-1 * %start))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (-1 * %start))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br i1 undef, label %for.end, label %for.body.preheader
@@ -205,7 +205,7 @@ define void @sadd_symbolic_start(i16 %start) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (32767 + (-1 * %start))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (32767 + (-1 * %start))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br i1 undef, label %for.end, label %for.body.preheader
@@ -283,7 +283,7 @@ define void @usub_symbolic_start(i16 %start) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is %start
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is %start
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br i1 undef, label %for.end, label %for.body.preheader
@@ -310,7 +310,7 @@ define void @ssub_symbolic_start(i16 %start) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-32768 + %start)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-32768 + %start)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br i1 undef, label %for.end, label %for.body.preheader
@@ -391,7 +391,7 @@ define void @sadd_symbolic_non_latch(i16 %start) {
; CHECK-NEXT: symbolic max exit count for for.latch: (230 + (-1 * %start))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is ((230 + (-1 * %start)) umin (32767 + (-1 * %start)))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br i1 undef, label %for.end, label %for.body.preheader
diff --git a/llvm/test/Analysis/ScalarEvolution/predicated-trip-count.ll b/llvm/test/Analysis/ScalarEvolution/predicated-trip-count.ll
index 7764cf45df6b87c..72f3c11d9c853f9 100644
--- a/llvm/test/Analysis/ScalarEvolution/predicated-trip-count.ll
+++ b/llvm/test/Analysis/ScalarEvolution/predicated-trip-count.ll
@@ -35,7 +35,7 @@ define void @test1(i32 %N, i32 %M) {
; CHECK-NEXT: Loop %bb3: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %bb3: Predicated backedge-taken count is (1 + (-1 smax %M))
; CHECK-NEXT: Predicates:
-; CHECK-NEXT: {0,+,1}<%bb3> Added Flags: <nssw>
+; CHECK-NEXT: {0,+,1}<%bb3> Added Flags: <nssw>
;
entry:
br label %bb3
@@ -102,7 +102,7 @@ define void @test2(i32 %N, i32 %M, i16 %Start) {
; CHECK-NEXT: Loop %bb3: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %bb3: Predicated backedge-taken count is (1 + (sext i16 %Start to i32) + (-1 * ((1 + (sext i16 %Start to i32))<nsw> smin %M)))
; CHECK-NEXT: Predicates:
-; CHECK-NEXT: {%Start,+,-1}<%bb3> Added Flags: <nssw>
+; CHECK-NEXT: {%Start,+,-1}<%bb3> Added Flags: <nssw>
;
entry:
br label %bb3
diff --git a/llvm/test/Analysis/ScalarEvolution/ptrtoint.ll b/llvm/test/Analysis/ScalarEvolution/ptrtoint.ll
index 6331035d1e4c4e2..4451b7ee6bac068 100644
--- a/llvm/test/Analysis/ScalarEvolution/ptrtoint.ll
+++ b/llvm/test/Analysis/ScalarEvolution/ptrtoint.ll
@@ -233,7 +233,7 @@ define void @ptrtoint_of_addrec(ptr %in, i32 %count) {
; X64-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (zext i32 %count to i64))<nsw>
; X64-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (zext i32 %count to i64))<nsw>
; X64-NEXT: Predicates:
-; X64: Loop %loop: Trip multiple is 1
+; X64-NEXT: Loop %loop: Trip multiple is 1
;
; X32-LABEL: 'ptrtoint_of_addrec'
; X32-NEXT: Classifying expressions for: @ptrtoint_of_addrec
@@ -253,7 +253,7 @@ define void @ptrtoint_of_addrec(ptr %in, i32 %count) {
; X32-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (zext i32 %count to i64))<nsw>
; X32-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (zext i32 %count to i64))<nsw>
; X32-NEXT: Predicates:
-; X32: Loop %loop: Trip multiple is 1
+; X32-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%i3 = zext i32 %count to i64
@@ -401,7 +401,7 @@ define void @pr46786_c26_char(ptr %arg, ptr %arg1, ptr %arg2) {
; X64-NEXT: Loop %bb6: symbolic max backedge-taken count is (-1 + (-1 * (ptrtoint ptr %arg to i64)) + (ptrtoint ptr %arg1 to i64))
; X64-NEXT: Loop %bb6: Predicated backedge-taken count is (-1 + (-1 * (ptrtoint ptr %arg to i64)) + (ptrtoint ptr %arg1 to i64))
; X64-NEXT: Predicates:
-; X64: Loop %bb6: Trip multiple is 1
+; X64-NEXT: Loop %bb6: Trip multiple is 1
;
; X32-LABEL: 'pr46786_c26_char'
; X32-NEXT: Classifying expressions for: @pr46786_c26_char
@@ -429,7 +429,7 @@ define void @pr46786_c26_char(ptr %arg, ptr %arg1, ptr %arg2) {
; X32-NEXT: Loop %bb6: symbolic max backedge-taken count is (-1 + (-1 * (ptrtoint ptr %arg to i32)) + (ptrtoint ptr %arg1 to i32))
; X32-NEXT: Loop %bb6: Predicated backedge-taken count is (-1 + (-1 * (ptrtoint ptr %arg to i32)) + (ptrtoint ptr %arg1 to i32))
; X32-NEXT: Predicates:
-; X32: Loop %bb6: Trip multiple is 1
+; X32-NEXT: Loop %bb6: Trip multiple is 1
;
%i = icmp eq ptr %arg, %arg1
br i1 %i, label %bb5, label %bb3
@@ -490,7 +490,7 @@ define void @pr46786_c26_int(ptr %arg, ptr %arg1, ptr %arg2) {
; X64-NEXT: Loop %bb6: symbolic max backedge-taken count is ((-4 + (-1 * (ptrtoint ptr %arg to i64)) + (ptrtoint ptr %arg1 to i64)) /u 4)
; X64-NEXT: Loop %bb6: Predicated backedge-taken count is ((-4 + (-1 * (ptrtoint ptr %arg to i64)) + (ptrtoint ptr %arg1 to i64)) /u 4)
; X64-NEXT: Predicates:
-; X64: Loop %bb6: Trip multiple is 1
+; X64-NEXT: Loop %bb6: Trip multiple is 1
;
; X32-LABEL: 'pr46786_c26_int'
; X32-NEXT: Classifying expressions for: @pr46786_c26_int
@@ -520,7 +520,7 @@ define void @pr46786_c26_int(ptr %arg, ptr %arg1, ptr %arg2) {
; X32-NEXT: Loop %bb6: symbolic max backedge-taken count is ((-4 + (-1 * (ptrtoint ptr %arg to i32)) + (ptrtoint ptr %arg1 to i32)) /u 4)
; X32-NEXT: Loop %bb6: Predicated backedge-taken count is ((-4 + (-1 * (ptrtoint ptr %arg to i32)) + (ptrtoint ptr %arg1 to i32)) /u 4)
; X32-NEXT: Predicates:
-; X32: Loop %bb6: Trip multiple is 1
+; X32-NEXT: Loop %bb6: Trip multiple is 1
;
%i = icmp eq ptr %arg, %arg1
br i1 %i, label %bb5, label %bb3
diff --git a/llvm/test/Analysis/ScalarEvolution/range-signedness.ll b/llvm/test/Analysis/ScalarEvolution/range-signedness.ll
index 7022892dea71522..119bfc39afe699e 100644
--- a/llvm/test/Analysis/ScalarEvolution/range-signedness.ll
+++ b/llvm/test/Analysis/ScalarEvolution/range-signedness.ll
@@ -44,7 +44,7 @@ define void @y(ptr %addr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 10
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 10
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 11
+; CHECK-NEXT: Loop %loop: Trip multiple is 11
;
entry:
br label %loop
diff --git a/llvm/test/Analysis/ScalarEvolution/range_nw_flag.ll b/llvm/test/Analysis/ScalarEvolution/range_nw_flag.ll
index a69480d7b01e1f5..1272975406f7610 100644
--- a/llvm/test/Analysis/ScalarEvolution/range_nw_flag.ll
+++ b/llvm/test/Analysis/ScalarEvolution/range_nw_flag.ll
@@ -19,7 +19,7 @@ define void @test-add-nuw(ptr %input, i32 %offset, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -55,7 +55,7 @@ define void @test-addrec-nuw(ptr %input, i32 %offset, i32 %numIterations) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp = icmp sgt i32 %offset, 10
@@ -93,7 +93,7 @@ define void @test-addrec-nsw-start-neg-strip-neg(ptr %input, i32 %offset, i32 %n
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %numIterations))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %numIterations))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp = icmp slt i32 %offset, -10
@@ -131,7 +131,7 @@ define void @test-addrec-nsw-start-pos-strip-neg(ptr %input, i32 %offset, i32 %n
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %numIterations))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %numIterations))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp = icmp slt i32 %offset, 10
@@ -169,7 +169,7 @@ define void @test-addrec-nsw-start-pos-strip-pos(ptr %input, i32 %offset, i32 %n
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp = icmp sgt i32 %offset, 10
@@ -207,7 +207,7 @@ define void @test-addrec-nsw-start-neg-strip-pos(ptr %input, i32 %offset, i32 %n
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %numIterations)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%cmp = icmp sgt i32 %offset, -10
diff --git a/llvm/test/Analysis/ScalarEvolution/ranges.ll b/llvm/test/Analysis/ScalarEvolution/ranges.ll
index d42abac1971fb08..3b43c525d2ce903 100644
--- a/llvm/test/Analysis/ScalarEvolution/ranges.ll
+++ b/llvm/test/Analysis/ScalarEvolution/ranges.ll
@@ -140,7 +140,7 @@ define void @add_6(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((((-1 * (1 umin %n))<nuw><nsw> + %n) /u 6) + (1 umin %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((((-1 * (1 umin %n))<nuw><nsw> + %n) /u 6) + (1 umin %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -167,7 +167,7 @@ define void @add_7(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((((-1 * (1 umin %n))<nuw><nsw> + %n) /u 7) + (1 umin %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((((-1 * (1 umin %n))<nuw><nsw> + %n) /u 7) + (1 umin %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -194,7 +194,7 @@ define void @add_8(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((7 + %n) /u 8)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((7 + %n) /u 8)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -222,7 +222,7 @@ define void @add_9(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((((-1 * (1 umin %n))<nuw><nsw> + %n) /u 9) + (1 umin %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((((-1 * (1 umin %n))<nuw><nsw> + %n) /u 9) + (1 umin %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -250,7 +250,7 @@ define void @add_10(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((((-1 * (1 umin %n))<nuw><nsw> + %n) /u 10) + (1 umin %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((((-1 * (1 umin %n))<nuw><nsw> + %n) /u 10) + (1 umin %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -515,7 +515,7 @@ define void @truncate(i16 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((((-1 * (1 umin %n))<nuw><nsw> + %n) /u 9) + (1 umin %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((((-1 * (1 umin %n))<nuw><nsw> + %n) /u 9) + (1 umin %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
diff --git a/llvm/test/Analysis/ScalarEvolution/sdiv.ll b/llvm/test/Analysis/ScalarEvolution/sdiv.ll
index dcd10a82a2e2acc..3d4aaa29536e78f 100644
--- a/llvm/test/Analysis/ScalarEvolution/sdiv.ll
+++ b/llvm/test/Analysis/ScalarEvolution/sdiv.ll
@@ -35,7 +35,7 @@ define dso_local void @_Z4loopi(i32 %width) local_unnamed_addr #0 {
; CHECK-NEXT: Loop %for.cond: symbolic max backedge-taken count is %width
; CHECK-NEXT: Loop %for.cond: Predicated backedge-taken count is %width
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.cond: Trip multiple is 1
+; CHECK-NEXT: Loop %for.cond: Trip multiple is 1
;
entry:
%storage = alloca [2 x i32], align 4
diff --git a/llvm/test/Analysis/ScalarEvolution/sext-add-inreg-loop.ll b/llvm/test/Analysis/ScalarEvolution/sext-add-inreg-loop.ll
index 92becb7995919fb..1345aa4e6411764 100644
--- a/llvm/test/Analysis/ScalarEvolution/sext-add-inreg-loop.ll
+++ b/llvm/test/Analysis/ScalarEvolution/sext-add-inreg-loop.ll
@@ -28,7 +28,7 @@ define dso_local i32 @test_loop(ptr nocapture noundef readonly %x) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 8
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 8
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 9
+; CHECK-NEXT: Loop %for.body: Trip multiple is 9
;
entry:
br label %for.body
diff --git a/llvm/test/Analysis/ScalarEvolution/sext-mul.ll b/llvm/test/Analysis/ScalarEvolution/sext-mul.ll
index 082e9269442385d..a31789c5ee3f771 100644
--- a/llvm/test/Analysis/ScalarEvolution/sext-mul.ll
+++ b/llvm/test/Analysis/ScalarEvolution/sext-mul.ll
@@ -34,7 +34,7 @@ define void @foo(ptr nocapture %arg, i32 %arg1, i32 %arg2) {
; CHECK-NEXT: Loop %bb7: symbolic max backedge-taken count is (-1 + (zext i32 %arg2 to i64))<nsw>
; CHECK-NEXT: Loop %bb7: Predicated backedge-taken count is (-1 + (zext i32 %arg2 to i64))<nsw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %bb7: Trip multiple is 1
+; CHECK-NEXT: Loop %bb7: Trip multiple is 1
;
bb:
%tmp = icmp sgt i32 %arg2, 0
@@ -101,7 +101,7 @@ define void @goo(ptr nocapture %arg3, i32 %arg4, i32 %arg5) {
; CHECK-NEXT: Loop %bb7: symbolic max backedge-taken count is (-1 + (zext i32 %arg5 to i128))<nsw>
; CHECK-NEXT: Loop %bb7: Predicated backedge-taken count is (-1 + (zext i32 %arg5 to i128))<nsw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %bb7: Trip multiple is 1
+; CHECK-NEXT: Loop %bb7: Trip multiple is 1
;
bb:
%t = icmp sgt i32 %arg5, 0
diff --git a/llvm/test/Analysis/ScalarEvolution/sext-to-zext.ll b/llvm/test/Analysis/ScalarEvolution/sext-to-zext.ll
index 2eca58b32483b14..18f20c371789844 100644
--- a/llvm/test/Analysis/ScalarEvolution/sext-to-zext.ll
+++ b/llvm/test/Analysis/ScalarEvolution/sext-to-zext.ll
@@ -24,7 +24,7 @@ define void @f(i1 %c) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 99
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 99
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 100
+; CHECK-NEXT: Loop %loop: Trip multiple is 100
;
entry:
%start = select i1 %c, i32 100, i32 0
diff --git a/llvm/test/Analysis/ScalarEvolution/shift-recurrences.ll b/llvm/test/Analysis/ScalarEvolution/shift-recurrences.ll
index 3301af14788604c..bbb1f46197a809e 100644
--- a/llvm/test/Analysis/ScalarEvolution/shift-recurrences.ll
+++ b/llvm/test/Analysis/ScalarEvolution/shift-recurrences.ll
@@ -211,7 +211,7 @@ define void @test_shl2() {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 4
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 4
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 5
+; CHECK-NEXT: Loop %loop: Trip multiple is 5
;
entry:
br label %loop
@@ -246,7 +246,7 @@ define void @test_shl3(i1 %c) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 4
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 4
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 5
+; CHECK-NEXT: Loop %loop: Trip multiple is 5
;
entry:
%shiftamt = select i1 %c, i64 1, i64 0
@@ -280,7 +280,7 @@ define void @test_shl4() {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 60
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 60
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 61
+; CHECK-NEXT: Loop %loop: Trip multiple is 61
;
entry:
br label %loop
@@ -313,7 +313,7 @@ define void @test_shl5() {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 61
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 61
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 62
+; CHECK-NEXT: Loop %loop: Trip multiple is 62
;
entry:
br label %loop
@@ -348,7 +348,7 @@ define void @test_shl6(i1 %c) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 4
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 4
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 5
+; CHECK-NEXT: Loop %loop: Trip multiple is 5
;
entry:
br label %loop
@@ -382,7 +382,7 @@ define void @test_shl7(i1 %c, i64 %shiftamt) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 4
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 4
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 5
+; CHECK-NEXT: Loop %loop: Trip multiple is 5
;
entry:
br label %loop
@@ -529,7 +529,7 @@ define void @test_ashr_tc_positive() {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 4
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 4
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 5
+; CHECK-NEXT: Loop %loop: Trip multiple is 5
;
entry:
br label %loop
@@ -561,7 +561,7 @@ define void @test_ashr_tc_negative() {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 4
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 4
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 5
+; CHECK-NEXT: Loop %loop: Trip multiple is 5
;
entry:
br label %loop
@@ -595,7 +595,7 @@ define void @test_ashr_tc_either(i1 %a) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 60
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 60
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 61
+; CHECK-NEXT: Loop %loop: Trip multiple is 61
;
entry:
%start = sext i1 %a to i8
@@ -628,7 +628,7 @@ define void @test_ashr_zero_shift() {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 4
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 4
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 5
+; CHECK-NEXT: Loop %loop: Trip multiple is 5
;
entry:
br label %loop
@@ -660,7 +660,7 @@ define void @test_lshr_tc_positive() {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 4
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 4
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 5
+; CHECK-NEXT: Loop %loop: Trip multiple is 5
;
entry:
br label %loop
@@ -692,7 +692,7 @@ define void @test_lshr_tc_negative() {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 4
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 4
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 5
+; CHECK-NEXT: Loop %loop: Trip multiple is 5
;
entry:
br label %loop
@@ -726,7 +726,7 @@ define void @test_lshr_tc_either(i1 %a) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 4
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 4
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 5
+; CHECK-NEXT: Loop %loop: Trip multiple is 5
;
entry:
%start = sext i1 %a to i8
@@ -759,7 +759,7 @@ define void @test_lshr_zero_shift() {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 4
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 4
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 5
+; CHECK-NEXT: Loop %loop: Trip multiple is 5
;
entry:
br label %loop
@@ -792,7 +792,7 @@ define void @test_lshr_power_of_2_start() {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 4
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 4
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 5
+; CHECK-NEXT: Loop %loop: Trip multiple is 5
;
entry:
br label %loop
@@ -825,7 +825,7 @@ define void @test_lshr_arbitrary_start() {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 4
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 4
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 5
+; CHECK-NEXT: Loop %loop: Trip multiple is 5
;
entry:
br label %loop
@@ -857,7 +857,7 @@ define void @test_lshr_start_power_of_2_plus_one() {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 4
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 4
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 5
+; CHECK-NEXT: Loop %loop: Trip multiple is 5
;
entry:
br label %loop
diff --git a/llvm/test/Analysis/ScalarEvolution/shl-lshr-
diff erentconstmask.ll b/llvm/test/Analysis/ScalarEvolution/shl-lshr-
diff erentconstmask.ll
index c9ecaeaeaabf158..c2402f7626e3d5c 100644
--- a/llvm/test/Analysis/ScalarEvolution/shl-lshr-
diff erentconstmask.ll
+++ b/llvm/test/Analysis/ScalarEvolution/shl-lshr-
diff erentconstmask.ll
@@ -6,9 +6,9 @@ define i32 @mul_biggerShl(i32 %val) nounwind {
; CHECK-LABEL: 'mul_biggerShl'
; CHECK-NEXT: Classifying expressions for: @mul_biggerShl
; CHECK-NEXT: %tmp1 = mul i32 %val, 64
-; CHECK-NEXT: --> (64 * %val) U: [0,-63) S: [-2147483648,2147483585)
+; CHECK-NEXT: --> (64 * %val) U: [0,-63) S: [-2147483648,2147483585)
; CHECK-NEXT: %tmp2 = udiv i32 %tmp1, 16
-; CHECK-NEXT: --> ((64 * %val) /u 16) U: [0,268435453) S: [0,268435456)
+; CHECK-NEXT: --> ((64 * %val) /u 16) U: [0,268435453) S: [0,268435456)
; CHECK-NEXT: Determining loop execution counts for: @mul_biggerShl
;
%tmp1 = mul i32 %val, 64
@@ -20,9 +20,9 @@ define i32 @mul_biggerLshl(i32 %val) nounwind {
; CHECK-LABEL: 'mul_biggerLshl'
; CHECK-NEXT: Classifying expressions for: @mul_biggerLshl
; CHECK-NEXT: %tmp1 = mul i32 %val, 16
-; CHECK-NEXT: --> (16 * %val) U: [0,-15) S: [-2147483648,2147483633)
+; CHECK-NEXT: --> (16 * %val) U: [0,-15) S: [-2147483648,2147483633)
; CHECK-NEXT: %tmp2 = udiv i32 %tmp1, 64
-; CHECK-NEXT: --> ((16 * %val) /u 64) U: [0,67108864) S: [0,67108864)
+; CHECK-NEXT: --> ((16 * %val) /u 64) U: [0,67108864) S: [0,67108864)
; CHECK-NEXT: Determining loop execution counts for: @mul_biggerLshl
;
%tmp1 = mul i32 %val, 16
@@ -36,9 +36,9 @@ define i32 @shifty_biggerShl(i32 %val) {
; CHECK-LABEL: 'shifty_biggerShl'
; CHECK-NEXT: Classifying expressions for: @shifty_biggerShl
; CHECK-NEXT: %tmp1 = shl i32 %val, 6
-; CHECK-NEXT: --> (64 * %val) U: [0,-63) S: [-2147483648,2147483585)
+; CHECK-NEXT: --> (64 * %val) U: [0,-63) S: [-2147483648,2147483585)
; CHECK-NEXT: %tmp2 = lshr i32 %tmp1, 4
-; CHECK-NEXT: --> ((64 * %val) /u 16) U: [0,268435453) S: [0,268435456)
+; CHECK-NEXT: --> ((64 * %val) /u 16) U: [0,268435453) S: [0,268435456)
; CHECK-NEXT: Determining loop execution counts for: @shifty_biggerShl
;
%tmp1 = shl i32 %val, 6
@@ -50,9 +50,9 @@ define i32 @shifty_biggerShl_shlnuw(i32 %val) {
; CHECK-LABEL: 'shifty_biggerShl_shlnuw'
; CHECK-NEXT: Classifying expressions for: @shifty_biggerShl_shlnuw
; CHECK-NEXT: %tmp1 = shl nuw i32 %val, 6
-; CHECK-NEXT: --> (64 * %val) U: [0,-63) S: [-2147483648,2147483585)
+; CHECK-NEXT: --> (64 * %val) U: [0,-63) S: [-2147483648,2147483585)
; CHECK-NEXT: %tmp2 = lshr i32 %tmp1, 4
-; CHECK-NEXT: --> ((64 * %val) /u 16) U: [0,268435453) S: [0,268435456)
+; CHECK-NEXT: --> ((64 * %val) /u 16) U: [0,268435453) S: [0,268435456)
; CHECK-NEXT: Determining loop execution counts for: @shifty_biggerShl_shlnuw
;
%tmp1 = shl nuw i32 %val, 6
@@ -64,9 +64,9 @@ define i32 @shifty_biggerLshr(i32 %val) {
; CHECK-LABEL: 'shifty_biggerLshr'
; CHECK-NEXT: Classifying expressions for: @shifty_biggerLshr
; CHECK-NEXT: %tmp1 = shl i32 %val, 4
-; CHECK-NEXT: --> (16 * %val) U: [0,-15) S: [-2147483648,2147483633)
+; CHECK-NEXT: --> (16 * %val) U: [0,-15) S: [-2147483648,2147483633)
; CHECK-NEXT: %tmp2 = lshr i32 %tmp1, 6
-; CHECK-NEXT: --> ((16 * %val) /u 64) U: [0,67108864) S: [0,67108864)
+; CHECK-NEXT: --> ((16 * %val) /u 64) U: [0,67108864) S: [0,67108864)
; CHECK-NEXT: Determining loop execution counts for: @shifty_biggerLshr
;
%tmp1 = shl i32 %val, 4
@@ -78,9 +78,9 @@ define i32 @shifty_biggerLshr_shlnuw(i32 %val) {
; CHECK-LABEL: 'shifty_biggerLshr_shlnuw'
; CHECK-NEXT: Classifying expressions for: @shifty_biggerLshr_shlnuw
; CHECK-NEXT: %tmp1 = shl nuw i32 %val, 4
-; CHECK-NEXT: --> (16 * %val) U: [0,-15) S: [-2147483648,2147483633)
+; CHECK-NEXT: --> (16 * %val) U: [0,-15) S: [-2147483648,2147483633)
; CHECK-NEXT: %tmp2 = lshr i32 %tmp1, 6
-; CHECK-NEXT: --> ((16 * %val) /u 64) U: [0,67108864) S: [0,67108864)
+; CHECK-NEXT: --> ((16 * %val) /u 64) U: [0,67108864) S: [0,67108864)
; CHECK-NEXT: Determining loop execution counts for: @shifty_biggerLshr_shlnuw
;
%tmp1 = shl nuw i32 %val, 4
@@ -94,9 +94,9 @@ define i32 @masky_biggerShl(i32 %val) {
; CHECK-LABEL: 'masky_biggerShl'
; CHECK-NEXT: Classifying expressions for: @masky_biggerShl
; CHECK-NEXT: %tmp1 = shl i32 %val, 2
-; CHECK-NEXT: --> (4 * %val) U: [0,-3) S: [-2147483648,2147483645)
+; CHECK-NEXT: --> (4 * %val) U: [0,-3) S: [-2147483648,2147483645)
; CHECK-NEXT: %tmp2 = and i32 %tmp1, 268435452
-; CHECK-NEXT: --> (4 * (zext i26 (trunc i32 %val to i26) to i32))<nuw><nsw> U: [0,268435453) S: [0,268435453)
+; CHECK-NEXT: --> (4 * (zext i26 (trunc i32 %val to i26) to i32))<nuw><nsw> U: [0,268435453) S: [0,268435453)
; CHECK-NEXT: Determining loop execution counts for: @masky_biggerShl
;
%tmp1 = shl i32 %val, 2
@@ -108,7 +108,7 @@ define i32 @masky_biggerShl_shlnuw(i32 %val) {
; CHECK-LABEL: 'masky_biggerShl_shlnuw'
; CHECK-NEXT: Classifying expressions for: @masky_biggerShl_shlnuw
; CHECK-NEXT: %tmp1 = shl nuw i32 %val, 2
-; CHECK-NEXT: --> (4 * %val) U: [0,-3) S: [-2147483648,2147483645)
+; CHECK-NEXT: --> (4 * %val) U: [0,-3) S: [-2147483648,2147483645)
; CHECK-NEXT: Determining loop execution counts for: @masky_biggerShl_shlnuw
;
%tmp1 = shl nuw i32 %val, 2
@@ -119,9 +119,9 @@ define i32 @masky_biggerLshr(i32 %val) {
; CHECK-LABEL: 'masky_biggerLshr'
; CHECK-NEXT: Classifying expressions for: @masky_biggerLshr
; CHECK-NEXT: %tmp1 = lshr i32 %val, 2
-; CHECK-NEXT: --> (%val /u 4) U: [0,1073741824) S: [0,1073741824)
+; CHECK-NEXT: --> (%val /u 4) U: [0,1073741824) S: [0,1073741824)
; CHECK-NEXT: %tmp2 = and i32 %tmp1, 67108863
-; CHECK-NEXT: --> (zext i26 (trunc i32 (%val /u 4) to i26) to i32) U: [0,67108864) S: [0,67108864)
+; CHECK-NEXT: --> (zext i26 (trunc i32 (%val /u 4) to i26) to i32) U: [0,67108864) S: [0,67108864)
; CHECK-NEXT: Determining loop execution counts for: @masky_biggerLshr
;
%tmp1 = lshr i32 %val, 2
@@ -133,7 +133,7 @@ define i32 @masky_biggerLshr_shlnuw(i32 %val) {
; CHECK-LABEL: 'masky_biggerLshr_shlnuw'
; CHECK-NEXT: Classifying expressions for: @masky_biggerLshr_shlnuw
; CHECK-NEXT: %tmp1 = lshr i32 %val, 2
-; CHECK-NEXT: --> (%val /u 4) U: [0,1073741824) S: [0,1073741824)
+; CHECK-NEXT: --> (%val /u 4) U: [0,1073741824) S: [0,1073741824)
; CHECK-NEXT: Determining loop execution counts for: @masky_biggerLshr_shlnuw
;
%tmp1 = lshr i32 %val, 2
diff --git a/llvm/test/Analysis/ScalarEvolution/smax-br-phi-idioms.ll b/llvm/test/Analysis/ScalarEvolution/smax-br-phi-idioms.ll
index e307bd589a93d64..9ec124ed333c722 100644
--- a/llvm/test/Analysis/ScalarEvolution/smax-br-phi-idioms.ll
+++ b/llvm/test/Analysis/ScalarEvolution/smax-br-phi-idioms.ll
@@ -163,7 +163,7 @@ define i32 @f5(ptr %val) {
; CHECK-NEXT: symbolic max exit count for for.condt: false
; CHECK-NEXT: Loop %for.end: Predicated backedge-taken count is false
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.end: Trip multiple is 1
+; CHECK-NEXT: Loop %for.end: Trip multiple is 1
;
entry:
br label %for.end
diff --git a/llvm/test/Analysis/ScalarEvolution/smin-smax-folds.ll b/llvm/test/Analysis/ScalarEvolution/smin-smax-folds.ll
index 57395a6a6cc2c3c..5fc871433dd6124 100644
--- a/llvm/test/Analysis/ScalarEvolution/smin-smax-folds.ll
+++ b/llvm/test/Analysis/ScalarEvolution/smin-smax-folds.ll
@@ -38,7 +38,7 @@ define void @smin_simplify_with_guard(i32 %n) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
%cmp10 = icmp sgt i32 %n, -1
@@ -75,7 +75,7 @@ define void @smin_to_smax(i32 %n) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is ((-1 * (0 smin %n)) + %n)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is ((-1 * (0 smin %n)) + %n)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body.lr.ph
@@ -111,7 +111,7 @@ define void @smax_simplify_with_guard(i32 %start, i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 * %start) + %n)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 * %start) + %n)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%guard = icmp sge i32 %n, %start
diff --git a/llvm/test/Analysis/ScalarEvolution/solve-quadratic-i1.ll b/llvm/test/Analysis/ScalarEvolution/solve-quadratic-i1.ll
index a0cdb00c9b3aa6b..89f15fa8737622f 100644
--- a/llvm/test/Analysis/ScalarEvolution/solve-quadratic-i1.ll
+++ b/llvm/test/Analysis/ScalarEvolution/solve-quadratic-i1.ll
@@ -22,7 +22,7 @@ define void @f0() {
; CHECK-NEXT: Loop %b1: symbolic max backedge-taken count is 1
; CHECK-NEXT: Loop %b1: Predicated backedge-taken count is 1
; CHECK-NEXT: Predicates:
-; CHECK: Loop %b1: Trip multiple is 2
+; CHECK-NEXT: Loop %b1: Trip multiple is 2
;
b0:
br label %b1
@@ -73,7 +73,7 @@ define void @f1() #0 {
; CHECK-NEXT: Loop %b1: symbolic max backedge-taken count is 2
; CHECK-NEXT: Loop %b1: Predicated backedge-taken count is 2
; CHECK-NEXT: Predicates:
-; CHECK: Loop %b1: Trip multiple is 3
+; CHECK-NEXT: Loop %b1: Trip multiple is 3
;
b0:
store i16 0, ptr @g0, align 2
diff --git a/llvm/test/Analysis/ScalarEvolution/solve-quadratic-overflow.ll b/llvm/test/Analysis/ScalarEvolution/solve-quadratic-overflow.ll
index 2f831827b549f6f..e04d019b819c2fb 100644
--- a/llvm/test/Analysis/ScalarEvolution/solve-quadratic-overflow.ll
+++ b/llvm/test/Analysis/ScalarEvolution/solve-quadratic-overflow.ll
@@ -28,7 +28,7 @@ define signext i32 @f0() {
; CHECK-NEXT: Loop %b1: symbolic max backedge-taken count is 255
; CHECK-NEXT: Loop %b1: Predicated backedge-taken count is 255
; CHECK-NEXT: Predicates:
-; CHECK: Loop %b1: Trip multiple is 256
+; CHECK-NEXT: Loop %b1: Trip multiple is 256
;
b0:
br label %b1
diff --git a/llvm/test/Analysis/ScalarEvolution/srem.ll b/llvm/test/Analysis/ScalarEvolution/srem.ll
index c331f81301ad983..3a7f7e736607e5a 100644
--- a/llvm/test/Analysis/ScalarEvolution/srem.ll
+++ b/llvm/test/Analysis/ScalarEvolution/srem.ll
@@ -35,7 +35,7 @@ define dso_local void @_Z4loopi(i32 %width) local_unnamed_addr #0 {
; CHECK-NEXT: Loop %for.cond: symbolic max backedge-taken count is %width
; CHECK-NEXT: Loop %for.cond: Predicated backedge-taken count is %width
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.cond: Trip multiple is 1
+; CHECK-NEXT: Loop %for.cond: Trip multiple is 1
;
entry:
%storage = alloca [2 x i32], align 4
diff --git a/llvm/test/Analysis/ScalarEvolution/symbolic_max_exit_count.ll b/llvm/test/Analysis/ScalarEvolution/symbolic_max_exit_count.ll
index 9cbb6263e3935cb..d0be0082e713866 100644
--- a/llvm/test/Analysis/ScalarEvolution/symbolic_max_exit_count.ll
+++ b/llvm/test/Analysis/ScalarEvolution/symbolic_max_exit_count.ll
@@ -413,7 +413,7 @@ define i32 @test_two_phis_simple(i32 %start_1, i32 %start_2, i32 %len) {
; CHECK-NEXT: symbolic max exit count for backedge: %start_2
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (%start_1 umin_seq %start_2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
diff --git a/llvm/test/Analysis/ScalarEvolution/trip-count-andor-selectform.ll b/llvm/test/Analysis/ScalarEvolution/trip-count-andor-selectform.ll
index 6cf57f5afbbbd8f..42fca4adbca5e6a 100644
--- a/llvm/test/Analysis/ScalarEvolution/trip-count-andor-selectform.ll
+++ b/llvm/test/Analysis/ScalarEvolution/trip-count-andor-selectform.ll
@@ -12,7 +12,7 @@ define void @unsimplified_and1(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -36,7 +36,7 @@ define void @unsimplified_and2(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -60,7 +60,7 @@ define void @unsimplified_and3(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is false
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is false
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -84,7 +84,7 @@ define void @unsimplified_and4(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is false
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is false
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -152,7 +152,7 @@ define void @unsimplified_or3(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -176,7 +176,7 @@ define void @unsimplified_or4(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -200,7 +200,7 @@ define void @reversed_and1(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -224,7 +224,7 @@ define void @reversed_and2(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -292,7 +292,7 @@ define void @reversed_or1(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is false
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is false
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -316,7 +316,7 @@ define void @reversed_or2(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is false
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is false
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -340,7 +340,7 @@ define void @reversed_or3(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -364,7 +364,7 @@ define void @reversed_or4(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
diff --git a/llvm/test/Analysis/ScalarEvolution/trip-count-andor.ll b/llvm/test/Analysis/ScalarEvolution/trip-count-andor.ll
index bb91e842446bf9c..c689cb4e3b867c1 100644
--- a/llvm/test/Analysis/ScalarEvolution/trip-count-andor.ll
+++ b/llvm/test/Analysis/ScalarEvolution/trip-count-andor.ll
@@ -12,7 +12,7 @@ define void @unsimplified_and1(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -36,7 +36,7 @@ define void @unsimplified_and2(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -60,7 +60,7 @@ define void @unsimplified_and3(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is false
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is false
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -84,7 +84,7 @@ define void @unsimplified_and4(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is false
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is false
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -152,7 +152,7 @@ define void @unsimplified_or3(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -176,7 +176,7 @@ define void @unsimplified_or4(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -200,7 +200,7 @@ define void @reversed_and1(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -224,7 +224,7 @@ define void @reversed_and2(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -292,7 +292,7 @@ define void @reversed_or1(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is false
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is false
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -316,7 +316,7 @@ define void @reversed_or2(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is false
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is false
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -340,7 +340,7 @@ define void @reversed_or3(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
@@ -364,7 +364,7 @@ define void @reversed_or4(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
diff --git a/llvm/test/Analysis/ScalarEvolution/trip-count-implied-addrec.ll b/llvm/test/Analysis/ScalarEvolution/trip-count-implied-addrec.ll
index 98423bf246e8887..e04563207d78bdc 100644
--- a/llvm/test/Analysis/ScalarEvolution/trip-count-implied-addrec.ll
+++ b/llvm/test/Analysis/ScalarEvolution/trip-count-implied-addrec.ll
@@ -17,7 +17,7 @@ define void @nw_implies_nuw(i16 %n) mustprogress {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
@@ -63,7 +63,7 @@ define void @nw_implies_nsw(i16 %n) mustprogress {
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (128 + (-128 smax %n))
; CHECK-NEXT: Predicates:
-; CHECK-NEXT: {-128,+,1}<%for.body> Added Flags: <nssw>
+; CHECK-NEXT: {-128,+,1}<%for.body> Added Flags: <nssw>
;
entry:
br label %for.body
@@ -110,7 +110,7 @@ define void @actually_infinite() {
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 257
; CHECK-NEXT: Predicates:
-; CHECK-NEXT: {0,+,1}<%for.body> Added Flags: <nusw>
+; CHECK-NEXT: {0,+,1}<%for.body> Added Flags: <nusw>
;
entry:
br label %for.body
@@ -135,7 +135,7 @@ define void @rhs_mustexit_1(i16 %n.raw) mustprogress {
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (1 umax (-1 + (zext i8 (trunc i16 %n.raw to i8) to i16))<nsw>))
; CHECK-NEXT: Predicates:
-; CHECK-NEXT: {1,+,1}<nw><%for.body> Added Flags: <nusw>
+; CHECK-NEXT: {1,+,1}<nw><%for.body> Added Flags: <nusw>
;
entry:
%n.and = and i16 %n.raw, 255
@@ -239,7 +239,7 @@ define void @neg_rhs_wrong_range(i16 %n.raw) mustprogress {
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is ((-1 + (2 umax (-1 + (zext i8 (trunc i16 %n.raw to i8) to i16))<nsw>)) /u 2)
; CHECK-NEXT: Predicates:
-; CHECK-NEXT: {2,+,2}<nw><%for.body> Added Flags: <nusw>
+; CHECK-NEXT: {2,+,2}<nw><%for.body> Added Flags: <nusw>
;
entry:
%n.and = and i16 %n.raw, 255
@@ -266,7 +266,7 @@ define void @neg_rhs_maybe_infinite(i16 %n.raw) {
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (1 umax (-1 + (zext i8 (trunc i16 %n.raw to i8) to i16))<nsw>))
; CHECK-NEXT: Predicates:
-; CHECK-NEXT: {1,+,1}<%for.body> Added Flags: <nusw>
+; CHECK-NEXT: {1,+,1}<%for.body> Added Flags: <nusw>
;
entry:
%n.and = and i16 %n.raw, 255
@@ -295,7 +295,7 @@ define void @rhs_narrow_range(i16 %n.raw) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + (1 umax (2 * (zext i7 (trunc i16 (%n.raw /u 2) to i7) to i16))<nuw><nsw>))<nsw>
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (1 umax (2 * (zext i7 (trunc i16 (%n.raw /u 2) to i7) to i16))<nuw><nsw>))<nsw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
%n = and i16 %n.raw, 254
@@ -345,7 +345,7 @@ define void @ult_constant_rhs(i16 %n.raw, i8 %start) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (255 + (-1 * (zext i8 (1 + %start) to i16))<nsw>)<nsw>
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (255 + (-1 * (zext i8 (1 + %start) to i16))<nsw>)<nsw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
@@ -370,7 +370,7 @@ define void @ult_constant_rhs_stride2(i16 %n.raw, i8 %start) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is ((1 + (-1 * (zext i8 (2 + %start) to i16))<nsw> + (254 umax (zext i8 (2 + %start) to i16))) /u 2)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is ((1 + (-1 * (zext i8 (2 + %start) to i16))<nsw> + (254 umax (zext i8 (2 + %start) to i16))) /u 2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
@@ -395,7 +395,7 @@ define void @ult_constant_rhs_stride2_neg(i16 %n.raw, i8 %start) {
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is ((256 + (-1 * (zext i8 (2 + %start) to i16))<nsw>)<nsw> /u 2)
; CHECK-NEXT: Predicates:
-; CHECK-NEXT: {(2 + %start),+,2}<%for.body> Added Flags: <nusw>
+; CHECK-NEXT: {(2 + %start),+,2}<%for.body> Added Flags: <nusw>
;
entry:
br label %for.body
@@ -420,7 +420,7 @@ define void @ult_restricted_rhs(i16 %n.raw) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + (1 umax (zext i8 (trunc i16 %n.raw to i8) to i16)))<nsw>
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (1 umax (zext i8 (trunc i16 %n.raw to i8) to i16)))<nsw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
%n = and i16 %n.raw, 255
@@ -445,7 +445,7 @@ define void @ult_guarded_rhs(i16 %n) {;
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + (1 umax %n))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (1 umax %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
%in_range = icmp ult i16 %n, 256
diff --git a/llvm/test/Analysis/ScalarEvolution/trip-count-minmax.ll b/llvm/test/Analysis/ScalarEvolution/trip-count-minmax.ll
index 431e604358cbc2a..7d4876baa9e5d9c 100644
--- a/llvm/test/Analysis/ScalarEvolution/trip-count-minmax.ll
+++ b/llvm/test/Analysis/ScalarEvolution/trip-count-minmax.ll
@@ -19,7 +19,7 @@ define void @nomulitply(i32 noundef %a, i32 noundef %b) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + (%a umin %b))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (%a umin %b))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
; No information about a or b. Trip multiple is 1.
; void nomulitple(unsigned a, unsigned b) {
@@ -65,7 +65,7 @@ define void @umin(i32 noundef %a, i32 noundef %b) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + ((2 * %a) umin (4 * %b)))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + ((2 * %a) umin (4 * %b)))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
; void umin(unsigned a, unsigned b) {
; a *= 2;
@@ -115,7 +115,7 @@ define void @umax(i32 noundef %a, i32 noundef %b) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + ((2 * %a) umax (4 * %b)))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + ((2 * %a) umax (4 * %b)))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 2
+; CHECK-NEXT: Loop %for.body: Trip multiple is 2
;
; void umax(unsigned a, unsigned b) {
@@ -165,7 +165,7 @@ define void @smin(i32 noundef %a, i32 noundef %b) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + ((2 * %a)<nsw> smin (4 * %b)<nsw>))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + ((2 * %a)<nsw> smin (4 * %b)<nsw>))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
; void smin(signed a, signed b) {
; a *= 2;
@@ -214,7 +214,7 @@ define void @smax(i32 noundef %a, i32 noundef %b) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + ((2 * %a)<nsw> smax (4 * %b)<nsw>))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + ((2 * %a)<nsw> smax (4 * %b)<nsw>))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 2
+; CHECK-NEXT: Loop %for.body: Trip multiple is 2
;
; void smax(signed a, signed b) {
; a *= 2;
@@ -263,7 +263,7 @@ define void @umin_seq2(i32 %n, i32 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 + (1 umax (2 * %n))) umin_seq (-1 + (1 umax (16 * %m))))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + (1 umax (2 * %n))) umin_seq (-1 + (1 umax (16 * %m))))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
; Can't find that trip multiple is 2 for this case of umin_seq
entry:
@@ -301,7 +301,7 @@ define void @umin-3and6(i32 noundef %a, i32 noundef %b) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + ((3 * %a) umin (6 * %b)))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + ((3 * %a) umin (6 * %b)))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
; Trip multiple is 1 because we use GetMinTrailingZeros() to compute trip multiples.
; SCEV cannot compute that the trip multiple is 3.
diff --git a/llvm/test/Analysis/ScalarEvolution/trip-count.ll b/llvm/test/Analysis/ScalarEvolution/trip-count.ll
index 0e8898f55a7c259..5973d52d05ea6f8 100644
--- a/llvm/test/Analysis/ScalarEvolution/trip-count.ll
+++ b/llvm/test/Analysis/ScalarEvolution/trip-count.ll
@@ -14,7 +14,7 @@ define void @PR1101(i32 %N) {
; CHECK-NEXT: Loop %bb3: symbolic max backedge-taken count is 10000
; CHECK-NEXT: Loop %bb3: Predicated backedge-taken count is 10000
; CHECK-NEXT: Predicates:
-; CHECK: Loop %bb3: Trip multiple is 10001
+; CHECK-NEXT: Loop %bb3: Trip multiple is 10001
;
entry:
br label %bb3
@@ -45,7 +45,7 @@ define i32 @PR22795() {
; CHECK-NEXT: Loop %preheader: symbolic max backedge-taken count is 7
; CHECK-NEXT: Loop %preheader: Predicated backedge-taken count is 7
; CHECK-NEXT: Predicates:
-; CHECK: Loop %preheader: Trip multiple is 8
+; CHECK-NEXT: Loop %preheader: Trip multiple is 8
;
entry:
%bins = alloca [16 x i64], align 16
@@ -108,7 +108,7 @@ define void @pr28012(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is -1431655751
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is -1431655751
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 2863311546
+; CHECK-NEXT: Loop %loop: Trip multiple is 2863311546
;
entry:
br label %loop
diff --git a/llvm/test/Analysis/ScalarEvolution/trip-count10.ll b/llvm/test/Analysis/ScalarEvolution/trip-count10.ll
index 9131094f9cb5989..2b2439c0ac4669a 100644
--- a/llvm/test/Analysis/ScalarEvolution/trip-count10.ll
+++ b/llvm/test/Analysis/ScalarEvolution/trip-count10.ll
@@ -32,7 +32,7 @@ define void @b(i64 %n) nounwind {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is false
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is false
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%t0 = icmp sgt i64 %n, 0
@@ -55,7 +55,7 @@ define void @c(i64 %n) nounwind {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is false
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is false
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%t0 = icmp sgt i64 %n, 0
@@ -136,7 +136,7 @@ define void @constant_phi_operands() nounwind {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 1
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 1
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 2
+; CHECK-NEXT: Loop %loop: Trip multiple is 2
;
entry:
br label %loop
diff --git a/llvm/test/Analysis/ScalarEvolution/trip-count14.ll b/llvm/test/Analysis/ScalarEvolution/trip-count14.ll
index 1e835303146687a..7c551afc79e4ddd 100644
--- a/llvm/test/Analysis/ScalarEvolution/trip-count14.ll
+++ b/llvm/test/Analysis/ScalarEvolution/trip-count14.ll
@@ -9,7 +9,7 @@ define void @s32_max1(i32 %n, ptr %p) {
; CHECK-NEXT: Loop %do.body: symbolic max backedge-taken count is ((-1 * %n) + ((1 + %n) smax %n)), actual taken count either this or zero.
; CHECK-NEXT: Loop %do.body: Predicated backedge-taken count is ((-1 * %n) + ((1 + %n) smax %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %do.body: Trip multiple is 1
+; CHECK-NEXT: Loop %do.body: Trip multiple is 1
;
entry:
%add = add i32 %n, 1
@@ -35,7 +35,7 @@ define void @s32_max2(i32 %n, ptr %p) {
; CHECK-NEXT: Loop %do.body: symbolic max backedge-taken count is ((-1 * %n) + ((2 + %n) smax %n)), actual taken count either this or zero.
; CHECK-NEXT: Loop %do.body: Predicated backedge-taken count is ((-1 * %n) + ((2 + %n) smax %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %do.body: Trip multiple is 1
+; CHECK-NEXT: Loop %do.body: Trip multiple is 1
;
entry:
%add = add i32 %n, 2
@@ -61,7 +61,7 @@ define void @s32_maxx(i32 %n, i32 %x, ptr %p) {
; CHECK-NEXT: Loop %do.body: symbolic max backedge-taken count is ((-1 * %n) + ((%n + %x) smax %n))
; CHECK-NEXT: Loop %do.body: Predicated backedge-taken count is ((-1 * %n) + ((%n + %x) smax %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %do.body: Trip multiple is 1
+; CHECK-NEXT: Loop %do.body: Trip multiple is 1
;
entry:
%add = add i32 %x, %n
@@ -91,7 +91,7 @@ define void @s32_max2_unpredictable_exit(i32 %n, i32 %x, ptr %p) {
; CHECK-NEXT: symbolic max exit count for if.end: ((-1 * %n) + ((2 + %n) smax %n))
; CHECK-NEXT: Loop %do.body: Predicated backedge-taken count is (((-1 * %n) + ((2 + %n) smax %n)) umin ((-1 * %n) + %x))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %do.body: Trip multiple is 1
+; CHECK-NEXT: Loop %do.body: Trip multiple is 1
;
entry:
%add = add i32 %n, 2
@@ -121,7 +121,7 @@ define void @u32_max1(i32 %n, ptr %p) {
; CHECK-NEXT: Loop %do.body: symbolic max backedge-taken count is ((-1 * %n) + ((1 + %n) umax %n)), actual taken count either this or zero.
; CHECK-NEXT: Loop %do.body: Predicated backedge-taken count is ((-1 * %n) + ((1 + %n) umax %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %do.body: Trip multiple is 1
+; CHECK-NEXT: Loop %do.body: Trip multiple is 1
;
entry:
%add = add i32 %n, 1
@@ -147,7 +147,7 @@ define void @u32_max2(i32 %n, ptr %p) {
; CHECK-NEXT: Loop %do.body: symbolic max backedge-taken count is ((-1 * %n) + ((2 + %n) umax %n)), actual taken count either this or zero.
; CHECK-NEXT: Loop %do.body: Predicated backedge-taken count is ((-1 * %n) + ((2 + %n) umax %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %do.body: Trip multiple is 1
+; CHECK-NEXT: Loop %do.body: Trip multiple is 1
;
entry:
%add = add i32 %n, 2
@@ -173,7 +173,7 @@ define void @u32_maxx(i32 %n, i32 %x, ptr %p) {
; CHECK-NEXT: Loop %do.body: symbolic max backedge-taken count is ((-1 * %n) + ((%n + %x) umax %n))
; CHECK-NEXT: Loop %do.body: Predicated backedge-taken count is ((-1 * %n) + ((%n + %x) umax %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %do.body: Trip multiple is 1
+; CHECK-NEXT: Loop %do.body: Trip multiple is 1
;
entry:
%add = add i32 %x, %n
@@ -203,7 +203,7 @@ define void @u32_max2_unpredictable_exit(i32 %n, i32 %x, ptr %p) {
; CHECK-NEXT: symbolic max exit count for if.end: ((-1 * %n) + ((2 + %n) umax %n))
; CHECK-NEXT: Loop %do.body: Predicated backedge-taken count is (((-1 * %n) + ((2 + %n) umax %n)) umin ((-1 * %n) + %x))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %do.body: Trip multiple is 1
+; CHECK-NEXT: Loop %do.body: Trip multiple is 1
;
entry:
%add = add i32 %n, 2
diff --git a/llvm/test/Analysis/ScalarEvolution/trip-count15.ll b/llvm/test/Analysis/ScalarEvolution/trip-count15.ll
index e043357aa09c301..2a995c635ca7a37 100644
--- a/llvm/test/Analysis/ScalarEvolution/trip-count15.ll
+++ b/llvm/test/Analysis/ScalarEvolution/trip-count15.ll
@@ -16,7 +16,7 @@ define void @umin_unsigned_check(i64 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (1 + (4096 umin %n))<nuw><nsw>
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (1 + (4096 umin %n))<nuw><nsw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%min.cmp = icmp ult i64 4096, %n
@@ -47,7 +47,7 @@ define void @umin_signed_check(i64 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (1 + (4096 umin %n))<nuw><nsw>
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (1 + (4096 umin %n))<nuw><nsw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%min.cmp = icmp ult i64 4096, %n
@@ -78,7 +78,7 @@ define void @smin_signed_check(i64 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (0 smax (1 + (4096 smin %n))<nsw>)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (0 smax (1 + (4096 smin %n))<nsw>)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%min.cmp = icmp slt i64 4096, %n
diff --git a/llvm/test/Analysis/ScalarEvolution/trip-count2.ll b/llvm/test/Analysis/ScalarEvolution/trip-count2.ll
index a71c9020d3fbea0..adc15a118368d20 100644
--- a/llvm/test/Analysis/ScalarEvolution/trip-count2.ll
+++ b/llvm/test/Analysis/ScalarEvolution/trip-count2.ll
@@ -11,7 +11,7 @@ define void @PR1101(i32 %N) {
; CHECK-NEXT: Loop %bb3: symbolic max backedge-taken count is 4
; CHECK-NEXT: Loop %bb3: Predicated backedge-taken count is 4
; CHECK-NEXT: Predicates:
-; CHECK: Loop %bb3: Trip multiple is 5
+; CHECK-NEXT: Loop %bb3: Trip multiple is 5
;
entry:
br label %bb3
diff --git a/llvm/test/Analysis/ScalarEvolution/trip-count3.ll b/llvm/test/Analysis/ScalarEvolution/trip-count3.ll
index e48bd5b9e62eb69..232878ed3083d0b 100644
--- a/llvm/test/Analysis/ScalarEvolution/trip-count3.ll
+++ b/llvm/test/Analysis/ScalarEvolution/trip-count3.ll
@@ -44,7 +44,7 @@ define void @sha_stream_bb3_2E_i(ptr %sha_info, ptr %data1, i32, ptr %buffer_add
; CHECK-NEXT: Loop %bb3.i: symbolic max backedge-taken count is ((63 + (-1 * (63 smin %0)) + %0) /u 64)
; CHECK-NEXT: Loop %bb3.i: Predicated backedge-taken count is ((63 + (-1 * (63 smin %0)) + %0) /u 64)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %bb3.i: Trip multiple is 1
+; CHECK-NEXT: Loop %bb3.i: Trip multiple is 1
;
newFuncRoot:
br label %bb3.i
diff --git a/llvm/test/Analysis/ScalarEvolution/trip-count4.ll b/llvm/test/Analysis/ScalarEvolution/trip-count4.ll
index 29829eba45ef509..c8e83ffd757ac22 100644
--- a/llvm/test/Analysis/ScalarEvolution/trip-count4.ll
+++ b/llvm/test/Analysis/ScalarEvolution/trip-count4.ll
@@ -11,7 +11,7 @@ define void @another_count_down_signed(ptr %d, i64 %n) nounwind {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-11 + %n)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-11 + %n)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
diff --git a/llvm/test/Analysis/ScalarEvolution/trip-count8.ll b/llvm/test/Analysis/ScalarEvolution/trip-count8.ll
index cc4ee5b5a3a33d1..a0bb7a8e063259f 100644
--- a/llvm/test/Analysis/ScalarEvolution/trip-count8.ll
+++ b/llvm/test/Analysis/ScalarEvolution/trip-count8.ll
@@ -12,7 +12,7 @@ define i32 @foo(i32 %ecx) nounwind {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %ecx)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %ecx)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
%cmp2 = icmp eq i32 %ecx, 0 ; <i1> [#uses=1]
diff --git a/llvm/test/Analysis/ScalarEvolution/trip-count9.ll b/llvm/test/Analysis/ScalarEvolution/trip-count9.ll
index 55d299c82dd4419..5301ac5f9eb3b83 100644
--- a/llvm/test/Analysis/ScalarEvolution/trip-count9.ll
+++ b/llvm/test/Analysis/ScalarEvolution/trip-count9.ll
@@ -17,7 +17,7 @@ define void @foo(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %n)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %n)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
@@ -59,7 +59,7 @@ define void @start1(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-2 + (2 smax %n))<nsw>
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-2 + (2 smax %n))<nsw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
@@ -101,7 +101,7 @@ define void @startx(i4 %n, i4 %x) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
@@ -143,7 +143,7 @@ define void @nsw(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %n)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %n)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
@@ -173,7 +173,7 @@ define void @nsw_step2(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 + %n) /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + %n) /u 2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
@@ -195,7 +195,7 @@ define void @nsw_start1(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-2 + (2 smax %n))<nsw>
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-2 + (2 smax %n))<nsw>
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
@@ -217,7 +217,7 @@ define void @nsw_start1_step2(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-2 + (3 smax %n))<nsw> /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-2 + (3 smax %n))<nsw> /u 2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
@@ -239,7 +239,7 @@ define void @nsw_startx(i4 %n, i4 %x) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
@@ -261,7 +261,7 @@ define void @nsw_startx_step2(i4 %n, i4 %x) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax %n)) /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax %n)) /u 2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
@@ -283,7 +283,7 @@ define void @even(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (2 * %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (2 * %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 2
+; CHECK-NEXT: Loop %loop: Trip multiple is 2
;
entry:
%m = shl i4 %n, 1
@@ -306,7 +306,7 @@ define void @even_step2(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 + (2 * %n)) /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + (2 * %n)) /u 2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
@@ -329,7 +329,7 @@ define void @even_start1(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-2 + (2 * %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-2 + (2 * %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
@@ -352,7 +352,7 @@ define void @even_start1_step2(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-2 + (2 * %n)) /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-2 + (2 * %n)) /u 2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
@@ -375,7 +375,7 @@ define void @even_startx(i4 %n, i4 %x) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax (2 * %n)))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax (2 * %n)))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
@@ -398,7 +398,7 @@ define void @even_startx_step2(i4 %n, i4 %x) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax (2 * %n))) /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax (2 * %n))) /u 2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
@@ -421,7 +421,7 @@ define void @even_nsw(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (2 * %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (2 * %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 2
+; CHECK-NEXT: Loop %loop: Trip multiple is 2
;
entry:
%m = shl i4 %n, 1
@@ -444,7 +444,7 @@ define void @even_nsw_step2(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 + (2 * %n)) /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + (2 * %n)) /u 2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
@@ -467,7 +467,7 @@ define void @even_nsw_start1(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-2 + (2 * %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-2 + (2 * %n))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
@@ -490,7 +490,7 @@ define void @even_nsw_start1_step2(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-2 + (2 * %n)) /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-2 + (2 * %n)) /u 2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
@@ -513,7 +513,7 @@ define void @even_nsw_startx(i4 %n, i4 %x) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax (2 * %n)))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax (2 * %n)))
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
@@ -536,7 +536,7 @@ define void @even_nsw_startx_step2(i4 %n, i4 %x) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax (2 * %n))) /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax (2 * %n))) /u 2)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
diff --git a/llvm/test/Analysis/ScalarEvolution/trip-multiple-guard-info.ll b/llvm/test/Analysis/ScalarEvolution/trip-multiple-guard-info.ll
index da7bdbcf2d92620..a0a5158bdff1606 100644
--- a/llvm/test/Analysis/ScalarEvolution/trip-multiple-guard-info.ll
+++ b/llvm/test/Analysis/ScalarEvolution/trip-multiple-guard-info.ll
@@ -18,7 +18,7 @@ define void @test_trip_multiple_4(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 4
+; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
@@ -53,7 +53,7 @@ define void @test_trip_multiple_4_guard(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 4
+; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
@@ -89,7 +89,7 @@ define void @test_trip_multiple_4_ugt_5(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 4
+; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
@@ -125,7 +125,7 @@ define void @test_trip_multiple_4_ugt_5_order_swapped(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 4
+; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
@@ -160,7 +160,7 @@ define void @test_trip_multiple_4_sgt_5(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 4
+; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
@@ -196,7 +196,7 @@ define void @test_trip_multiple_4_sgt_5_order_swapped(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 4
+; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
@@ -231,7 +231,7 @@ define void @test_trip_multiple_4_uge_5(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 4
+; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
@@ -267,7 +267,7 @@ define void @test_trip_multiple_4_uge_5_order_swapped(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 4
+; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
@@ -303,7 +303,7 @@ define void @test_trip_multiple_4_sge_5(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 4
+; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
@@ -338,7 +338,7 @@ define void @test_trip_multiple_4_sge_5_order_swapped(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 4
+; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
@@ -374,7 +374,7 @@ define void @test_trip_multiple_4_icmp_ops_swapped(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 4
+; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
@@ -409,7 +409,7 @@ define void @test_trip_multiple_4_upper_lower_bounds(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 4
+; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%cmp.1 = icmp uge i32 %num, 5
@@ -446,7 +446,7 @@ define void @test_trip_multiple_4_upper_lower_bounds_swapped1(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 4
+; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%cmp.1 = icmp uge i32 %num, 5
@@ -483,7 +483,7 @@ define void @test_trip_multiple_4_upper_lower_bounds_swapped2(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 4
+; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%cmp.1 = icmp uge i32 %num, 5
@@ -520,7 +520,7 @@ define void @test_trip_multiple_5(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 5
+; CHECK-NEXT: Loop %for.body: Trip multiple is 5
;
entry:
%u = urem i32 %num, 5
@@ -557,7 +557,7 @@ define void @test_trunc_operand_larger_than_urem_expr(i64 %N) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %N)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %N)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 1
+; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
%conv = trunc i64 %N to i32
diff --git a/llvm/test/Analysis/ScalarEvolution/trip-multiple.ll b/llvm/test/Analysis/ScalarEvolution/trip-multiple.ll
index 65d3c5938001fd6..a292dcec77960ef 100644
--- a/llvm/test/Analysis/ScalarEvolution/trip-multiple.ll
+++ b/llvm/test/Analysis/ScalarEvolution/trip-multiple.ll
@@ -29,7 +29,7 @@ define void @trip_multiple_3(i32 noundef %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 3
+; CHECK-NEXT: Loop %for.body: Trip multiple is 3
;
entry:
%rem = urem i32 %num, 3
@@ -65,7 +65,7 @@ define void @trip_multiple_4(i32 noundef %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 4
+; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%rem = urem i32 %num, 4
@@ -102,7 +102,7 @@ define void @trip_multiple_5(i32 noundef %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 5
+; CHECK-NEXT: Loop %for.body: Trip multiple is 5
;
entry:
%rem = urem i32 %num, 5
@@ -139,7 +139,7 @@ define void @trip_multiple_6(i32 noundef %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 6
+; CHECK-NEXT: Loop %for.body: Trip multiple is 6
;
entry:
%rem = urem i32 %num, 6
@@ -176,7 +176,7 @@ define void @trip_multiple_7(i32 noundef %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 7
+; CHECK-NEXT: Loop %for.body: Trip multiple is 7
;
entry:
%rem = urem i32 %num, 7
@@ -213,7 +213,7 @@ define void @trip_multiple_8(i32 noundef %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 8
+; CHECK-NEXT: Loop %for.body: Trip multiple is 8
;
entry:
%rem = urem i32 %num, 8
@@ -249,7 +249,7 @@ define void @trip_multiple_9(i32 noundef %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 9
+; CHECK-NEXT: Loop %for.body: Trip multiple is 9
;
entry:
%rem = urem i32 %num, 9
@@ -285,7 +285,7 @@ define void @trip_multiple_10(i32 noundef %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %for.body: Trip multiple is 10
+; CHECK-NEXT: Loop %for.body: Trip multiple is 10
;
entry:
%rem = urem i32 %num, 10
diff --git a/llvm/test/Analysis/ScalarEvolution/umin-umax-folds.ll b/llvm/test/Analysis/ScalarEvolution/umin-umax-folds.ll
index 74c07c2933e3f1c..94f4acc0c5d1150 100644
--- a/llvm/test/Analysis/ScalarEvolution/umin-umax-folds.ll
+++ b/llvm/test/Analysis/ScalarEvolution/umin-umax-folds.ll
@@ -20,7 +20,7 @@ define void @umin_sext_x_zext_x(i32 %len) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
@@ -56,7 +56,7 @@ define void @ule_sext_x_zext_x(i32 %len) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
@@ -92,7 +92,7 @@ define void @uge_sext_x_zext_x(i32 %len) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (sext i32 %len to i64)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (sext i32 %len to i64)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
@@ -128,7 +128,7 @@ define void @ult_sext_x_zext_x(i32 %len) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
@@ -164,7 +164,7 @@ define void @ugt_sext_x_zext_x(i32 %len) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (sext i32 %len to i64)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (sext i32 %len to i64)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
@@ -200,7 +200,7 @@ define void @sle_sext_x_zext_x(i32 %len) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
@@ -236,7 +236,7 @@ define void @sge_sext_x_zext_x(i32 %len) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
@@ -272,7 +272,7 @@ define void @slt_sext_x_zext_x(i32 %len) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (sext i32 %len to i64)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (sext i32 %len to i64)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
@@ -308,7 +308,7 @@ define void @sgt_sext_x_zext_x(i32 %len) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
diff --git a/llvm/test/Analysis/ScalarEvolution/unknown_phis.ll b/llvm/test/Analysis/ScalarEvolution/unknown_phis.ll
index d0fab9b9447cb51..7bd7a5eb2cfcc3c 100644
--- a/llvm/test/Analysis/ScalarEvolution/unknown_phis.ll
+++ b/llvm/test/Analysis/ScalarEvolution/unknown_phis.ll
@@ -52,7 +52,7 @@ define void @merge_values_with_ranges_looped(ptr %a_len_ptr, ptr %b_len_ptr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 99
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 99
; CHECK-NEXT: Predicates:
-; CHECK: Loop %loop: Trip multiple is 100
+; CHECK-NEXT: Loop %loop: Trip multiple is 100
;
entry:
More information about the llvm-commits
mailing list