1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
|
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 4
; RUN: opt -passes='print<access-info>' -disable-output %s 2>&1 | FileCheck %s
target datalayout = "e-m:o-i64:64-i128:128-n32:64-S128"
; Test case for https://github.com/llvm/llvm-project/issues/82665.
define void @indirect_ptr_recurrences_read_write(ptr %A, ptr %B) {
; CHECK-LABEL: 'indirect_ptr_recurrences_read_write'
; CHECK-NEXT: loop:
; CHECK-NEXT: Memory dependences are safe
; CHECK-NEXT: Dependences:
; CHECK-NEXT: Run-time memory checks:
; CHECK-NEXT: Grouped accesses:
; CHECK-EMPTY:
; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop.
; CHECK-NEXT: SCEV assumptions:
; CHECK-EMPTY:
; CHECK-NEXT: Expressions re-written:
;
entry:
br label %loop
loop:
%iv = phi i64 [ 1, %entry ], [ %iv.next, %loop ]
%ptr.recur = phi ptr [ %A, %entry ], [ %ptr.next, %loop ]
%gep.B = getelementptr inbounds ptr, ptr %B, i64 %iv
%ptr.next = load ptr, ptr %gep.B, align 8, !tbaa !6
%l = load i32, ptr %ptr.recur, align 4, !tbaa !10
%xor = xor i32 %l, 1
store i32 %xor, ptr %ptr.recur, align 4, !tbaa !10
%iv.next = add nuw nsw i64 %iv, 1
%ec = icmp eq i64 %iv.next, 5
br i1 %ec, label %exit, label %loop
exit:
ret void
}
define i32 @indirect_ptr_recurrences_read_only_loop(ptr %A, ptr %B) {
; CHECK-LABEL: 'indirect_ptr_recurrences_read_only_loop'
; CHECK-NEXT: loop:
; CHECK-NEXT: Memory dependences are safe
; CHECK-NEXT: Dependences:
; CHECK-NEXT: Run-time memory checks:
; CHECK-NEXT: Grouped accesses:
; CHECK-EMPTY:
; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop.
; CHECK-NEXT: SCEV assumptions:
; CHECK-EMPTY:
; CHECK-NEXT: Expressions re-written:
;
entry:
br label %loop
loop:
%iv = phi i64 [ 1, %entry ], [ %iv.next, %loop ]
%ptr.recur = phi ptr [ %A, %entry ], [ %ptr.next, %loop ]
%red = phi i32 [ 0, %entry ], [ %xor, %loop ]
%gep.B = getelementptr inbounds ptr, ptr %B, i64 %iv
%ptr.next = load ptr, ptr %gep.B, align 8, !tbaa !6
%l = load i32, ptr %ptr.recur, align 4, !tbaa !10
%xor = xor i32 %l, 1
%iv.next = add nuw nsw i64 %iv, 1
%ec = icmp eq i64 %iv.next, 5
br i1 %ec, label %exit, label %loop
exit:
ret i32 %xor
}
define void @indirect_ptr_recurrences_read_write_may_alias_no_tbaa(ptr %A, ptr %B) {
; CHECK-LABEL: 'indirect_ptr_recurrences_read_write_may_alias_no_tbaa'
; CHECK-NEXT: loop:
; CHECK-NEXT: Report: cannot identify array bounds
; CHECK-NEXT: Dependences:
; CHECK-NEXT: Run-time memory checks:
; CHECK-NEXT: Grouped accesses:
; CHECK-EMPTY:
; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop.
; CHECK-NEXT: SCEV assumptions:
; CHECK-EMPTY:
; CHECK-NEXT: Expressions re-written:
;
entry:
br label %loop
loop:
%iv = phi i64 [ 1, %entry ], [ %iv.next, %loop ]
%ptr.recur = phi ptr [ %A, %entry ], [ %ptr.next, %loop ]
%gep.B = getelementptr inbounds ptr, ptr %B, i64 %iv
%ptr.next = load ptr, ptr %gep.B, align 8, !tbaa !6
%l = load i32, ptr %ptr.recur, align 4
%xor = xor i32 %l, 1
store i32 %xor, ptr %ptr.recur, align 4
%iv.next = add nuw nsw i64 %iv, 1
%ec = icmp eq i64 %iv.next, 5
br i1 %ec, label %exit, label %loop
exit:
ret void
}
define void @indirect_ptr_recurrences_read_write_may_alias_different_obj(ptr %A, ptr %B, ptr %C) {
; CHECK-LABEL: 'indirect_ptr_recurrences_read_write_may_alias_different_obj'
; CHECK-NEXT: loop:
; CHECK-NEXT: Report: cannot identify array bounds
; CHECK-NEXT: Dependences:
; CHECK-NEXT: Run-time memory checks:
; CHECK-NEXT: Grouped accesses:
; CHECK-EMPTY:
; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop.
; CHECK-NEXT: SCEV assumptions:
; CHECK-EMPTY:
; CHECK-NEXT: Expressions re-written:
;
entry:
br label %loop
loop:
%iv = phi i64 [ 1, %entry ], [ %iv.next, %loop ]
%ptr.recur = phi ptr [ %A, %entry ], [ %ptr.next, %loop ]
%gep.B = getelementptr inbounds ptr, ptr %B, i64 %iv
%ptr.next = load ptr, ptr %gep.B, align 8, !tbaa !6
%l = load i32, ptr %ptr.recur, align 4
%xor = xor i32 %l, 1
%gep.C = getelementptr inbounds ptr, ptr %C, i64 %iv
store i32 %xor, ptr %gep.C, align 4
%iv.next = add nuw nsw i64 %iv, 1
%ec = icmp eq i64 %iv.next, 5
br i1 %ec, label %exit, label %loop
exit:
ret void
}
define void @indirect_ptr_recurrences_read_write_may_noalias_different_obj(ptr %A, ptr %B, ptr noalias %C) {
; CHECK-LABEL: 'indirect_ptr_recurrences_read_write_may_noalias_different_obj'
; CHECK-NEXT: loop:
; CHECK-NEXT: Memory dependences are safe
; CHECK-NEXT: Dependences:
; CHECK-NEXT: Run-time memory checks:
; CHECK-NEXT: Grouped accesses:
; CHECK-EMPTY:
; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop.
; CHECK-NEXT: SCEV assumptions:
; CHECK-EMPTY:
; CHECK-NEXT: Expressions re-written:
;
entry:
br label %loop
loop:
%iv = phi i64 [ 1, %entry ], [ %iv.next, %loop ]
%ptr.recur = phi ptr [ %A, %entry ], [ %ptr.next, %loop ]
%gep.B = getelementptr inbounds ptr, ptr %B, i64 %iv
%ptr.next = load ptr, ptr %gep.B, align 8, !tbaa !6
%l = load i32, ptr %ptr.recur, align 4
%xor = xor i32 %l, 1
%gep.C = getelementptr inbounds ptr, ptr %C, i64 %iv
store i32 %xor, ptr %gep.C, align 4
%iv.next = add nuw nsw i64 %iv, 1
%ec = icmp eq i64 %iv.next, 5
br i1 %ec, label %exit, label %loop
exit:
ret void
}
!6 = !{!7, !7, i64 0}
!7 = !{!"any pointer", !8, i64 0}
!8 = !{!"omnipotent char", !9, i64 0}
!9 = !{!"Simple C/C++ TBAA"}
!10 = !{!11, !11, i64 0}
!11 = !{!"int", !8, i64 0}
|
