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
|
#include "Halide.h"
using namespace Halide;
class FindAllocations : public Internal::IRMutator {
public:
std::map<std::string, int> allocation_size;
private:
using Internal::IRMutator::visit;
Internal::Stmt visit(const Internal::Allocate *op) override {
int total_size = 1;
for (const auto &e : op->extents) {
total_size *= Internal::as_const_int(e).value_or(0);
}
// Trim of the suffix.
std::string name = op->name.substr(0, op->name.find("$"));
allocation_size[name] = total_size;
return Internal::IRMutator::visit(op);
}
};
int main(int argc, char **argv) {
// Test for a constant bound.
{
Func f("f"), g("g");
Var x("x"), y("y");
f(x, y) = x + y;
g(x, y) = 2 * f(x, y);
f.compute_at(g, y);
const int fixed_alloc_size = 16;
f.bound_storage(x, fixed_alloc_size);
FindAllocations s;
g.add_custom_lowering_pass(&s, []() {});
Module m = g.compile_to_module({});
if (s.allocation_size["f"] != fixed_alloc_size) {
std::cerr << "Allocation size for f doesn't match one which was set explicitly \n";
return 1;
}
// Also check that output is correct.
Buffer<int> im = g.realize({10, 10});
for (int y = 0; y < im.height(); y++) {
for (int x = 0; x < im.width(); x++) {
int correct = 2 * (x + y);
if (im(x, y) != correct) {
printf("im(%d, %d) = %d instead of %d\n",
x, y, im(x, y), correct);
return 1;
}
}
}
}
// Test for multiple bounds.
{
Func f("f"), h("h"), g("g");
Var x("x"), y("y");
f(x, y) = x + y;
h(x, y) = x - 2 * y;
g(x, y) = 2 * f(x, y) + 3 * h(x, y);
f.compute_at(g, y);
h.compute_root();
const int fixed_alloc_size_f = 16, fixed_alloc_size_h = 10;
f.bound_storage(x, fixed_alloc_size_f);
h.bound_storage(x, fixed_alloc_size_h);
h.bound_storage(y, fixed_alloc_size_h);
FindAllocations s;
g.add_custom_lowering_pass(&s, []() {});
Module m = g.compile_to_module({});
if (s.allocation_size["f"] != fixed_alloc_size_f) {
std::cerr << "Allocation size for f doesn't match one which was set explicitly \n";
return 1;
}
if (s.allocation_size["h"] != fixed_alloc_size_h * fixed_alloc_size_h) {
std::cerr << "Allocation size for h doesn't match one which was set explicitly \n";
return 1;
}
// Also check that output is correct.
Buffer<int> im = g.realize({10, 10});
for (int y = 0; y < im.height(); y++) {
for (int x = 0; x < im.width(); x++) {
int correct = 2 * (x + y) + 3 * (x - 2 * y);
if (im(x, y) != correct) {
printf("im(%d, %d) = %d instead of %d\n",
x, y, im(x, y), correct);
return 1;
}
}
}
}
// Test for an expression bound.
{
ImageParam input(Int(32), 2);
Func f("f"), g("g");
Var x("x"), y("y");
f(x, y) = input(x, y) + x + y;
g(x, y) = 2 * f(x, y);
f.compute_at(g, y);
f.bound_storage(x, input.width());
Buffer<int> input_buffer(10, 10);
input_buffer.fill(10);
input.set(input_buffer);
// Also check that output is correct.
Buffer<int> im = g.realize({10, 10});
for (int y = 0; y < im.height(); y++) {
for (int x = 0; x < im.width(); x++) {
int correct = 2 * (x + y + 10);
if (im(x, y) != correct) {
printf("im(%d, %d) = %d instead of %d\n",
x, y, im(x, y), correct);
return 1;
}
}
}
}
printf("Success!\n");
return 0;
}
|
