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
|
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 5
; RUN: opt -disable-output -passes='print<access-info>' %s 2>&1 | FileCheck %s
target datalayout = "e-m:e-p:128:128:128"
; Tests with 128 bit inductions and 128 bit pointer width and index size.
define void @backward_i128(ptr %A, i128 %n) {
; CHECK-LABEL: 'backward_i128'
; CHECK-NEXT: loop:
; CHECK-NEXT: Report: unsafe dependent memory operations in loop. Use #pragma clang loop distribute(enable) to allow loop distribution to attempt to isolate the offending operations into a separate loop
; CHECK-NEXT: Backward loop carried data dependence.
; CHECK-NEXT: Dependences:
; CHECK-NEXT: Backward:
; CHECK-NEXT: %l = load i32, ptr %gep.A, align 4 ->
; CHECK-NEXT: store i32 %l, ptr %gep.A.1, align 4
; CHECK-EMPTY:
; 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 i128 [ 0, %entry ], [ %iv.next, %loop ]
%gep.A = getelementptr inbounds i32, ptr %A, i128 %iv
%l = load i32, ptr %gep.A
%iv.1 = add nuw nsw i128 %iv, 1
%gep.A.1 = getelementptr inbounds i32, ptr %A, i128 %iv.1
store i32 %l, ptr %gep.A.1
%iv.next = add i128 %iv, 1
%ec = icmp eq i128 %iv.next, %n
br i1 %ec, label %exit, label %loop
exit:
ret void
}
define void @forward_i128(ptr %A, i128 %n) {
; CHECK-LABEL: 'forward_i128'
; CHECK-NEXT: loop:
; CHECK-NEXT: Memory dependences are safe
; CHECK-NEXT: Dependences:
; CHECK-NEXT: Forward:
; CHECK-NEXT: %l = load i32, ptr %gep.A.1, align 4 ->
; CHECK-NEXT: store i32 %l, ptr %gep.A, align 4
; CHECK-EMPTY:
; 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 i128 [ 0, %entry ], [ %iv.next, %loop ]
%iv.1 = add nuw nsw i128 %iv, 1
%gep.A.1 = getelementptr inbounds i32, ptr %A, i128 %iv.1
%l = load i32, ptr %gep.A.1
%gep.A = getelementptr inbounds i32, ptr %A, i128 %iv
store i32 %l, ptr %gep.A
%iv.next = add i128 %iv, 1
%ec = icmp eq i128 %iv.next, %n
br i1 %ec, label %exit, label %loop
exit:
ret void
}
define void @forward_negative_step(ptr %A, i128 %n) {
; CHECK-LABEL: 'forward_negative_step'
; CHECK-NEXT: loop:
; CHECK-NEXT: Memory dependences are safe
; CHECK-NEXT: Dependences:
; CHECK-NEXT: Forward:
; CHECK-NEXT: %l = load i32, ptr %gep.A, align 4 ->
; CHECK-NEXT: store i32 %l, ptr %gep.A.1, align 4
; CHECK-EMPTY:
; 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 i128 [ 36893488147419103232, %entry ], [ %iv.next, %loop ]
%gep.A = getelementptr inbounds i32, ptr %A, i128 %iv
%l = load i32, ptr %gep.A
%iv.1 = add nuw nsw i128 %iv, 1
%gep.A.1 = getelementptr inbounds i32, ptr %A, i128 %iv.1
store i32 %l, ptr %gep.A.1
%iv.next = add nsw i128 %iv, -1
%ec = icmp eq i128 %iv.next, %n
br i1 %ec, label %exit, label %loop
exit:
ret void
}
; The induction step is i128 2^63 + 1, which does not fit into a 64 bit signed
; integer.
define void @forward_i128_step_63bit_plus_one(ptr %A, i128 %n) {
; CHECK-LABEL: 'forward_i128_step_63bit_plus_one'
; CHECK-NEXT: loop:
; CHECK-NEXT: Report: unsafe dependent memory operations in loop. Use #pragma clang loop distribute(enable) to allow loop distribution to attempt to isolate the offending operations into a separate loop
; CHECK-NEXT: Unsafe indirect dependence.
; CHECK-NEXT: Dependences:
; CHECK-NEXT: IndirectUnsafe:
; CHECK-NEXT: %l = load i32, ptr %gep.A.1, align 4 ->
; CHECK-NEXT: store i32 %l, ptr %gep.A, align 4
; CHECK-EMPTY:
; 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 i128 [ 0, %entry ], [ %iv.next, %loop ]
%iv.1 = add nuw nsw i128 %iv, 1
%gep.A.1 = getelementptr inbounds i32, ptr %A, i128 %iv.1
%l = load i32, ptr %gep.A.1
%gep.A = getelementptr inbounds i32, ptr %A, i128 %iv
store i32 %l, ptr %gep.A
%iv.next = add i128 %iv, 9223372036854775809
%ec = icmp eq i128 %iv.next, %n
br i1 %ec, label %exit, label %loop
exit:
ret void
}
|
