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
|
#include "Halide.h"
#include <algorithm>
#include <stdio.h>
using namespace Halide;
int main(int argc, char **argv) {
Var x("x"), y("y");
Func f("f"), g("g"), h("h");
printf("Defining function...\n");
f(x, y) = max(x, y);
g(x, y) = 17 * f(x, y);
h(x, y) = (g(x, y - 1) + g(x - 1, y) + g(x, y) + g(x + 1, y) + g(x, y + 1));
g.store_root();
g.compute_at(h, y);
f.compute_root();
Buffer<int> imh = h.realize({32, 32});
bool success = true;
// Check the result was what we expected
for (int i = 0; i < 32; i++) {
for (int j = 0; j < 32; j++) {
int v1 = std::max(i - 1, j);
int v2 = std::max(i + 1, j);
int v3 = std::max(i, j);
int v4 = std::max(i, j - 1);
int v5 = std::max(i, j + 1);
int correct = 17 * (v1 + v2 + v3 + v4 + v5);
int val = imh(i, j, 0);
if (val != correct) {
printf("imh(%d, %d) = %d instead of %d\n",
i, j, val, correct);
success = false;
}
}
}
if (!success) return 1;
printf("Success!\n");
return 0;
}
|
