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
|
#include "Halide.h"
#include <stdio.h>
using namespace Halide;
using namespace Halide::Internal;
// Make sure that "f" is computed at "g"
class CheckCompute : public IRVisitor {
protected:
using IRVisitor::visit;
std::string producer;
std::string consumer;
void visit(const ProducerConsumer *op) override {
if (op->is_producer) {
if (op->name == "f") {
if (producer != "g") {
printf("Produce \"f\" should be inside of produce \"g\"\n");
exit(1);
}
}
std::string old_producer = producer;
producer = op->name;
IRVisitor::visit(op);
producer = old_producer;
} else {
if (op->name == "f") {
if (producer != "g") {
printf("Consume \"f\" should be inside of produce \"g\"\n");
exit(1);
}
}
std::string old_consumer = consumer;
consumer = op->name;
IRVisitor::visit(op);
consumer = old_consumer;
}
}
};
int allocation_bound_test_trace(JITUserContext *user_context, const halide_trace_event_t *e) {
return 0;
}
int main(int argc, char **argv) {
// Setting custom trace on "f" should not have nuked its compute_at schedule.
Var x("x");
Func f("f"), g("g");
f(x) = x;
g(x) += f(x);
f.compute_at(g, x);
f.jit_handlers().custom_trace = allocation_bound_test_trace;
Module m = g.compile_to_module({g.infer_arguments()});
CheckCompute checker;
m.functions().front().body.accept(&checker);
printf("Success!\n");
return 0;
}
|
