Skip to content

Commit 43b6f7b

Browse files
sebpopkcloudy0717
sebpop
authored and
kcloudy0717
committed
[DA] add testcases for bug llvm#148435 (llvm#154980)
Add regression tests from issue llvm#148435 .
1 parent f6bafa8 commit 43b6f7b

File tree

4 files changed

+181
-0
lines changed

4 files changed

+181
-0
lines changed

‎llvm/test/Analysis/DependenceAnalysis/PR148435.ll‎

Lines changed: 86 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,86 @@
1+
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 5
2+
; RUN: opt < %s -disable-output "-passes=print<da>" 2>&1 | FileCheck %s
3+
4+
define void @_Z1cb(ptr %a) {
5+
; CHECK-LABEL: '_Z1cb'
6+
; CHECK-NEXT: Src: store i8 0, ptr %arrayidx9, align 1 --> Dst: store i8 0, ptr %arrayidx9, align 1
7+
; CHECK-NEXT: da analyze - output [*]!
8+
;
9+
entry:
10+
br label %for.body
11+
12+
for.cond.cleanup.loopexit: ; preds = %for.body
13+
ret void
14+
15+
for.body: ; preds = %for.body, %entry
16+
%indvars.iv23 = phi i64 [ 0, %entry ], [ %indvars.iv.next24, %for.body ]
17+
%idxprom = and i64 %indvars.iv23, 1
18+
%arrayidx9 = getelementptr inbounds [0 x [12 x [12 x i8]]], ptr %a, i64 0, i64 %idxprom, i64 0, i64 %indvars.iv23
19+
store i8 0, ptr %arrayidx9, align 1
20+
%indvars.iv.next24 = add i64 %indvars.iv23, 1
21+
%exitcond.not = icmp eq i64 %indvars.iv.next24, 0
22+
br i1 %exitcond.not, label %for.cond.cleanup.loopexit, label %for.body
23+
}
24+
25+
@a = external global [0 x [12 x [12 x i8]]], align 1
26+
27+
define void @test_siv_no_addrec(i1 %d, i32 %b) {
28+
; CHECK-LABEL: 'test_siv_no_addrec'
29+
; CHECK-NEXT: Src: store i8 0, ptr %arrayidx7, align 1 --> Dst: store i8 0, ptr %arrayidx7, align 1
30+
; CHECK-NEXT: da analyze - output [* *]!
31+
;
32+
entry:
33+
%conv.val = select i1 %d, i16 1, i16 0
34+
br label %for.cond
35+
36+
for.cond: ; preds = %for.inc8, %entry
37+
%e.0 = phi i32 [ %b, %entry ], [ %inc9, %for.inc8 ]
38+
%cmp = icmp ult i32 %e.0, 10
39+
br i1 %cmp, label %for.cond1, label %for.end10
40+
41+
for.cond1: ; preds = %for.inc, %for.cond
42+
%f.0 = phi i16 [ %conv.val, %for.cond ], [ %add, %for.inc ]
43+
%cmp2 = icmp slt i16 %f.0, 10
44+
br i1 %cmp2, label %for.body4, label %for.inc8
45+
46+
for.body4: ; preds = %for.cond1
47+
%sub = add i32 %e.0, -3
48+
%idxprom = zext i32 %sub to i64
49+
%idxprom5 = sext i16 %f.0 to i64
50+
%idxprom6 = zext i32 %e.0 to i64
51+
%arrayidx7 = getelementptr inbounds [0 x [12 x [12 x i8]]], ptr @a, i64 0, i64 %idxprom, i64 %idxprom5, i64 %idxprom6
52+
store i8 0, ptr %arrayidx7, align 1
53+
br label %for.inc
54+
55+
for.inc: ; preds = %for.body4
56+
%add = add i16 %f.0, 2
57+
br label %for.cond1
58+
59+
for.inc8: ; preds = %for.cond1
60+
%inc9 = add i32 %e.0, 1
61+
br label %for.cond
62+
63+
for.end10: ; preds = %for.cond
64+
ret void
65+
}
66+
67+
define void @f1(ptr %a) {
68+
; CHECK-LABEL: 'f1'
69+
; CHECK-NEXT: Src: store i8 0, ptr %idx, align 1 --> Dst: store i8 0, ptr %idx, align 1
70+
; CHECK-NEXT: da analyze - output [*]!
71+
;
72+
entry:
73+
br label %loop
74+
75+
loop:
76+
%i = phi i64 [ 0, %entry ], [ %i.next, %loop ]
77+
%and = and i64 %i, 1
78+
%idx = getelementptr inbounds [4 x [4 x i8]], ptr %a, i64 0, i64 %and, i64 %and
79+
store i8 0, ptr %idx
80+
%i.next = add i64 %i, 1
81+
%exitcond.not = icmp slt i64 %i.next, 8
82+
br i1 %exitcond.not, label %loop, label %exit
83+
84+
exit:
85+
ret void
86+
}

‎llvm/test/Analysis/DependenceAnalysis/bounds-check.ll‎

Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 5
2+
; RUN: opt < %s -disable-output "-passes=print<da>" 2>&1 | FileCheck %s
3+
4+
; Test case for SmallBitVector bounds checking bug in DependenceAnalysis.
5+
; This test ensures that loop index mapping functions don't cause out-of-bounds
6+
; access to SmallBitVector when loop depths exceed MaxLevels.
7+
8+
define void @bounds_check_test(ptr %a) {
9+
; CHECK-LABEL: 'bounds_check_test'
10+
; CHECK-NEXT: Src: store i8 0, ptr %idx, align 1 --> Dst: store i8 0, ptr %idx, align 1
11+
; CHECK-NEXT: da analyze - output [*]!
12+
;
13+
entry:
14+
br label %loop
15+
16+
loop:
17+
%i = phi i64 [ 0, %entry ], [ %i.next, %loop ]
18+
%and = and i64 %i, 1 ; Creates index 0 or 1
19+
%idx = getelementptr inbounds [4 x [4 x i8]], ptr %a, i64 0, i64 %and, i64 %i
20+
store i8 0, ptr %idx
21+
%i.next = add i64 %i, 1
22+
%exitcond.not = icmp slt i64 %i.next, 4
23+
br i1 %exitcond.not, label %loop, label %exit
24+
25+
exit:
26+
ret void
27+
}

‎llvm/test/Analysis/DependenceAnalysis/wrapping-addrec-1.ll‎

Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 5
2+
; RUN: opt < %s -disable-output "-passes=print<da>" 2>&1 | FileCheck %s
3+
4+
; Test case for bug #148435 - SIV test assertion failure
5+
6+
define void @f(ptr %a) {
7+
; CHECK-LABEL: 'f'
8+
; CHECK-NEXT: Src: store i8 42, ptr %idx, align 1 --> Dst: store i8 42, ptr %idx, align 1
9+
; CHECK-NEXT: da analyze - output [* *]!
10+
;
11+
entry:
12+
br label %loop.i.header
13+
14+
loop.i.header:
15+
%i = phi i64 [ 0, %entry ], [ %i.next, %loop.i.latch ]
16+
%and.i = and i64 %i, 1
17+
br label %loop.j
18+
19+
loop.j:
20+
%j = phi i64 [ 0, %loop.i.header ], [ %j.next, %loop.j ]
21+
%and.j = and i64 %j, 1
22+
%idx = getelementptr [2 x [2 x i8]], ptr %a, i64 0, i64 %and.i, i64 %and.j
23+
store i8 42, ptr %idx
24+
%j.next = add i64 %j, 1
25+
%exitcond.j = icmp eq i64 %j.next, 100
26+
br i1 %exitcond.j, label %loop.i.latch, label %loop.j
27+
28+
loop.i.latch:
29+
%i.next = add i64 %i, 1
30+
%exitcond.i = icmp eq i64 %i.next, 100
31+
br i1 %exitcond.i, label %exit, label %loop.i.header
32+
33+
exit:
34+
ret void
35+
}

‎llvm/test/Analysis/DependenceAnalysis/wrapping-addrec.ll‎

Lines changed: 33 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,33 @@
1+
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 5
2+
; RUN: opt < %s -disable-output "-passes=print<da>" 2>&1 | FileCheck %s
3+
4+
; Test case for wrapping AddRec detection in DependenceAnalysis.
5+
; This ensures that AddRec expressions that wrap (creating cyclic rather than
6+
; linear patterns) are rejected from SIV analysis and treated conservatively.
7+
8+
; This test case has a clear dependence pattern that was incorrectly reported as "none!"
9+
; The issue: {false,+,true} in i1 arithmetic creates pattern (0,1,0,1,0,1,...).
10+
; - i=0: a[0][0][0], i=1: a[0][1][1], i=2: a[0][0][0], i=3: a[0][1][1], ...
11+
; - Clear dependencies at distances 2, 4, 6 between iterations accessing same locations.
12+
; - Strong SIV test was missing these due to treating wrapping pattern as linear.
13+
14+
define void @test_wrapping_i1_addrec(ptr %a) {
15+
; CHECK-LABEL: 'test_wrapping_i1_addrec'
16+
; CHECK-NEXT: Src: store i8 0, ptr %idx, align 1 --> Dst: store i8 0, ptr %idx, align 1
17+
; CHECK-NEXT: da analyze - output [*]!
18+
;
19+
entry:
20+
br label %loop
21+
22+
loop:
23+
%i = phi i64 [ 0, %entry ], [ %i.next, %loop ]
24+
%and = and i64 %i, 1
25+
%idx = getelementptr inbounds [4 x [4 x i8]], ptr %a, i64 0, i64 %and, i64 %and
26+
store i8 0, ptr %idx
27+
%i.next = add i64 %i, 1
28+
%exitcond.not = icmp slt i64 %i.next, 8
29+
br i1 %exitcond.not, label %loop, label %exit
30+
31+
exit:
32+
ret void
33+
}

0 commit comments

Comments
 (0)