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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
|
#include "Halide.h"
using namespace Halide;
using namespace Halide::Internal;
class CheckForSelects : public IRVisitor {
using IRVisitor::visit;
void visit(const Select *op) override {
result = true;
}
public:
bool result = false;
};
int trace_min, trace_extent;
int my_trace(JITUserContext *user_context, const halide_trace_event_t *e) {
if (e->event == 2) {
trace_min = e->coordinates[0];
trace_extent = e->coordinates[1];
}
return 0;
}
int main(int argc, char **argv) {
// Force the bounds of an intermediate pipeline stage to be even to remove a select
{
Func f, g, h;
Var x;
f(x) = 3;
g(x) = select(x % 2 == 0, f(x + 1), f(x - 1) + 8);
Param<int> p;
h(x) = g(x - p) + g(x + p);
f.compute_root();
g.compute_root().align_bounds(x, 2).unroll(x, 2).trace_realizations();
// The lowered IR should contain no selects.
Module m = g.compile_to_module({p});
CheckForSelects checker;
m.functions()[0].body.accept(&checker);
if (checker.result) {
printf("Lowered code contained a select\n");
return 1;
}
p.set(3);
h.jit_handlers().custom_trace = my_trace;
Buffer<int> result = h.realize({10});
for (int i = 0; i < 10; i++) {
int correct = (i & 1) == 1 ? 6 : 22;
if (result(i) != correct) {
printf("result(%d) = %d instead of %d\n",
i, result(i), correct);
return 1;
}
}
// Bounds of f should be [-p, 10+2*p] rounded outwards
if (trace_min != -4 || trace_extent != 18) {
printf("%d: Wrong bounds: [%d, %d]\n", __LINE__, trace_min, trace_extent);
return 1;
}
// Increasing p by one should have no effect
p.set(4);
assert(result.data());
h.realize(result);
if (trace_min != -4 || trace_extent != 18) {
printf("%d: Wrong bounds: [%d, %d]\n", __LINE__, trace_min, trace_extent);
return 1;
}
// But increasing it again should cause a jump of two in the bounds computed.
assert(result.data());
p.set(5);
h.realize(result);
if (trace_min != -6 || trace_extent != 22) {
printf("%d: Wrong bounds: [%d, %d]\n", __LINE__, trace_min, trace_extent);
return 1;
}
}
// Now try a case where we misalign with an offset (i.e. force the
// bounds to be odd). This should also remove the select.
{
Func f, g, h;
Var x;
f(x) = 3;
g(x) = select(x % 2 == 0, f(x + 1), f(x - 1) + 8);
Param<int> p;
h(x) = g(x - p) + g(x + p);
f.compute_root();
g.compute_root().align_bounds(x, 2, 1).unroll(x, 2).trace_realizations();
// The lowered IR should contain no selects.
Module m = g.compile_to_module({p});
CheckForSelects checker;
m.functions()[0].body.accept(&checker);
if (checker.result) {
printf("Lowered code contained a select\n");
return 1;
}
p.set(3);
h.jit_handlers().custom_trace = my_trace;
Buffer<int> result = h.realize({10});
for (int i = 0; i < 10; i++) {
int correct = (i & 1) == 1 ? 6 : 22;
if (result(i) != correct) {
printf("result(%d) = %d instead of %d\n",
i, result(i), correct);
return 1;
}
}
// Now the min/max should stick to odd numbers
if (trace_min != -3 || trace_extent != 16) {
printf("%d: Wrong bounds: [%d, %d]\n", __LINE__, trace_min, trace_extent);
return 1;
}
// Increasing p by one should have no effect
p.set(4);
h.realize(result);
if (trace_min != -5 || trace_extent != 20) {
printf("%d: Wrong bounds: [%d, %d]\n", __LINE__, trace_min, trace_extent);
return 1;
}
// But increasing it again should cause a jump of two in the bounds computed.
p.set(5);
h.realize(result);
if (trace_min != -5 || trace_extent != 20) {
printf("%d: Wrong bounds: [%d, %d]\n", __LINE__, trace_min, trace_extent);
return 1;
}
}
// Now try a case where we align the extent but not the min.
{
Func f, g, h;
Var x;
f(x) = 3;
g(x) = select(x % 2 == 0, f(x + 1), f(x - 1) + 8);
Param<int> p;
h(x) = g(x - p) + g(x + p);
f.compute_root();
g.compute_root().align_extent(x, 32).trace_realizations();
p.set(3);
h.jit_handlers().custom_trace = my_trace;
Buffer<int> result = h.realize({10});
for (int i = 0; i < 10; i++) {
int correct = (i & 1) == 1 ? 6 : 22;
if (result(i) != correct) {
printf("result(%d) = %d instead of %d\n",
i, result(i), correct);
return 1;
}
}
// Now the min/max should stick to odd numbers
if (trace_min != -3 || trace_extent != 32) {
printf("%d: Wrong bounds: [%d, %d]\n", __LINE__, trace_min, trace_extent);
return 1;
}
// Increasing p by one should have no effect
p.set(4);
h.realize(result);
if (trace_min != -4 || trace_extent != 32) {
printf("%d: Wrong bounds: [%d, %d]\n", __LINE__, trace_min, trace_extent);
return 1;
}
// But increasing it again should cause a jump of two in the bounds computed.
p.set(5);
h.realize(result);
if (trace_min != -5 || trace_extent != 32) {
printf("%d: Wrong bounds: [%d, %d]\n", __LINE__, trace_min, trace_extent);
return 1;
}
}
// Try a case where aligning a buffer means that strided loads can
// do dense aligned loads and then shuffle. This used to trigger a
// bug in codegen.
{
Func f, g;
Var x;
f(x) = x;
// Do strided loads of every possible alignment
Expr e = 0;
for (int i = -32; i <= 32; i++) {
e += f(3 * x + i);
}
g(x) = e;
f.compute_root();
g.bound(x, 0, 1024).vectorize(x, 16, TailStrategy::RoundUp);
// Just check if it crashes
g.realize({1024});
}
printf("Success!\n");
return 0;
}
|
