diff options
| author | Ramkumar Ramachandra <ramkumar.ramachandra@codasip.com> | 2025-01-23 12:28:30 +0000 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2025-01-23 12:28:30 +0000 |
| commit | e069518f82bc3699dc4fc81bbc99ae4a6d44449e (patch) | |
| tree | 549e706d799d1868bb5089541a868c8557846ceb /llvm | |
| parent | 9705500582b9c2b2e1dd6de14f03a94d270a9250 (diff) | |
SCEV: cover a codepath in isImpliedCondBalancedTypes (#123070)
The code that checks a predicate against a swapped predicate in
isImpliedCondBalancedTypes is not covered by any existing test, within
any Analysis or Transform. Fix this by adding a test to SCEV.
Diffstat (limited to 'llvm')
| -rw-r--r-- | llvm/test/Analysis/ScalarEvolution/implied-via-division.ll | 53 |
1 files changed, 53 insertions, 0 deletions
diff --git a/llvm/test/Analysis/ScalarEvolution/implied-via-division.ll b/llvm/test/Analysis/ScalarEvolution/implied-via-division.ll index fbe69b4b1889..a1d30406095e 100644 --- a/llvm/test/Analysis/ScalarEvolution/implied-via-division.ll +++ b/llvm/test/Analysis/ScalarEvolution/implied-via-division.ll @@ -411,3 +411,56 @@ header: exit: ret void } + +define void @swapped_predicate(i32 %n) { +; Prove that (n s>= 1) ===> (0 s>= -n / 2). +; CHECK-LABEL: 'swapped_predicate' +; CHECK-NEXT: Determining loop execution counts for: @swapped_predicate +; CHECK-NEXT: Loop %header: backedge-taken count is (1 + %n.div.2)<nuw><nsw> +; CHECK-NEXT: Loop %header: constant max backedge-taken count is i32 1073741824 +; CHECK-NEXT: Loop %header: symbolic max backedge-taken count is (1 + %n.div.2)<nuw><nsw> +; CHECK-NEXT: Loop %header: Trip multiple is 1 +; +entry: + %cmp1 = icmp sge i32 %n, 1 + %n.div.2 = sdiv i32 %n, 2 + call void @llvm.assume(i1 %cmp1) + br label %header + +header: + %indvar = phi i32 [ %indvar.next, %header ], [ 0, %entry ] + %indvar.next = add i32 %indvar, 1 + %minus.indvar = sub nsw i32 0, %indvar + %minus.n.div.2 = sub nsw i32 0, %n.div.2 + %exitcond = icmp sge i32 %minus.indvar, %minus.n.div.2 + br i1 %exitcond, label %header, label %exit + +exit: + ret void +} + +define void @swapped_predicate_neg(i32 %n) { +; Prove that (n s>= 1) =\=> (-n / 2 s>= 0). +; CHECK-LABEL: 'swapped_predicate_neg' +; CHECK-NEXT: Determining loop execution counts for: @swapped_predicate_neg +; CHECK-NEXT: Loop %header: Unpredictable backedge-taken count. +; CHECK-NEXT: Loop %header: Unpredictable constant max backedge-taken count. +; CHECK-NEXT: Loop %header: Unpredictable symbolic max backedge-taken count. +; +entry: + %cmp1 = icmp sge i32 %n, 1 + %n.div.2 = sdiv i32 %n, 2 + call void @llvm.assume(i1 %cmp1) + br label %header + +header: + %indvar = phi i32 [ %indvar.next, %header ], [ 0, %entry ] + %indvar.next = add i32 %indvar, 1 + %minus.indvar = sub nsw i32 0, %indvar + %minus.n.div.2 = sub nsw i32 0, %n.div.2 + %exitcond = icmp sge i32 %minus.n.div.2, %minus.indvar + br i1 %exitcond, label %header, label %exit + +exit: + ret void +} |
