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
|
#include "Halide.h"
#include "halide_benchmark.h"
using namespace Halide;
using namespace Halide::Tools;
Func inlined(Func in) {
Var x("x"), y("y");
Func f("f");
f(x, y) = in(x, y) >> 2;
Func g("g");
g(x, y) = f(x, y) >> 2;
return g;
}
int main(int argc, char **argv) {
Func one("one"), three("three");
Var x("x"), y("y");
one(x, y) = x + y;
const int num_stages = 4;
Func two[num_stages];
two[0](x, y) = one(x, y);
for (int j = 1; j < num_stages; j++) {
two[j](x, y) = inlined(one)(x, y) + j;
}
Expr temp = 0;
for (int j = 0; j < num_stages; j++) {
temp += two[j](x, y) / num_stages;
}
three(x, y) = temp;
two[0].compute_root();
for (int i = 1; i < num_stages; i++) {
// These functions refer to other functions that were scheduled inlined
// ("f" and "g"), which used to cause compilation error due to
// incorrect realization order.
two[i].compute_root().compute_with(two[0], Var::outermost());
}
one.compute_at(two[0], Var::outermost());
three.compute_root();
three.realize({1024, 1024});
printf("Success!\n");
return 0;
}
|
