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
|
#include "Halide.h"
#include <stdio.h>
using namespace Halide;
int call_counter = 0;
extern "C" HALIDE_EXPORT_SYMBOL int count(int x) {
return call_counter++;
}
HalideExtern_1(int, count, int);
int main(int argc, char **argv) {
{
// Split an rvar, compute something at the inner var, and make
// sure the it's evaluated the right number of times.
Func f, g;
Var x;
RDom r(0, 10);
RVar ri, ro;
f(x) = count(x);
g(x) = 0;
g(r) = f(r);
g.update().split(r, ro, ri, 2);
f.compute_at(g, ri);
Buffer<int> im = g.realize({10});
if (call_counter != 10) {
printf("Wrong number of calls to f: %d\n", call_counter);
return 1;
}
for (int i = 0; i < im.width(); i++) {
if (im(i) != i) {
printf("im(%d) = %d instead of %d\n", i, im(i), i);
return 1;
}
}
call_counter = 0;
}
{
// Now at the outer var.
Func f, g;
Var x;
RDom r(0, 10);
RVar ri, ro;
f(x) = count(x);
g(x) = 0;
g(r) = f(r);
g.update().split(r, ro, ri, 2);
f.compute_at(g, ro).unroll(x);
Buffer<int> im = g.realize({10});
if (call_counter != 10) {
printf("Wrong number of calls to f: %d\n", call_counter);
return 1;
}
for (int i = 0; i < im.width(); i++) {
if (im(i) != i) {
printf("im(%d) = %d instead of %d\n", i, im(i), i);
return 1;
}
}
call_counter = 0;
}
{
// Now at the inner var with it unrolled.
Func f, g;
Var x;
RDom r(0, 10);
RVar ri, ro;
f(x) = count(x);
g(x) = 0;
g(r) = f(r);
g.update().split(r, ro, ri, 2).unroll(ri);
f.compute_at(g, ri);
Buffer<int> im = g.realize({10});
if (call_counter != 10) {
printf("Wrong number of calls to f: %d\n", call_counter);
return 1;
}
for (int i = 0; i < im.width(); i++) {
if (im(i) != i) {
printf("im(%d) = %d instead of %d\n", i, im(i), i);
return 1;
}
}
call_counter = 0;
}
{
// Now reorder and compute at the new inner. They'll come out
// in a different order this time, but there should still be
// 10 evaluations of f.
Func f, g;
Var x;
RDom r(0, 10);
RVar ri, ro;
f(x) = count(x);
g(x) = 0;
g(r) = f(r);
g.update().split(r, ro, ri, 2).reorder(ro, ri);
f.compute_at(g, ro);
Buffer<int> im = g.realize({10});
if (call_counter != 10) {
printf("Wrong number of calls to f: %d\n", call_counter);
return 1;
}
for (int i = 0; i < im.width(); i++) {
int correct = (i / 2) + ((i % 2 == 0) ? 0 : 5);
if (im(i) != correct) {
printf("im(%d) = %d instead of %d\n", i, im(i), correct);
return 1;
}
}
call_counter = 0;
}
{
// Now split twice and fuse the outer two vars and compute within that.
Func f, g;
Var x;
RDom r(0, 20);
RVar rio, rii, ri, ro, fused;
f(x) = count(x);
g(x) = 0;
g(r) = f(r);
g.update().split(r, ro, ri, 4).split(ri, rio, rii, 2).fuse(rio, ro, fused);
f.compute_at(g, fused);
Buffer<int> im = g.realize({20});
if (call_counter != 20) {
printf("Wrong number of calls to f: %d\n", call_counter);
return 1;
}
for (int i = 0; i < im.width(); i++) {
int correct = i;
if (im(i) != correct) {
printf("im(%d) = %d instead of %d\n", i, im(i), correct);
return 1;
}
}
call_counter = 0;
}
{
// Split by a non-factor and compute something at the split,
// to check if guardwithif is respected in the bounds
// relationship.
Func f, g;
Var x;
RDom r(0, 10);
RVar ri, ro;
f(x) = count(x);
g(x) = 0;
g(r) = f(r);
g.update().split(r, ro, ri, 3);
f.compute_at(g, ro);
Buffer<int> im = g.realize({10});
if (call_counter != 10) {
printf("Wrong number of calls to f: %d\n", call_counter);
return 1;
}
for (int i = 0; i < im.width(); i++) {
if (im(i) != i) {
printf("im(%d) = %d instead of %d\n", i, im(i), i);
return 1;
}
}
call_counter = 0;
}
printf("Success!\n");
return 0;
}
|
