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"
namespace {
struct SimpleBlur : public Halide::Generator<SimpleBlur> {
Input<Func> input{"input"};
Input<int32_t> width{"width"};
Input<int32_t> height{"height"};
Output<Func> output{"output"};
Var x{"x"}, y{"y"};
Func blur_x{"blur_x"};
void generate() {
using Halide::_;
// Since Input<Func> has no extent limits, we must specify explicit min-extent pairs
Func in = Halide::BoundaryConditions::repeat_edge(input, {{0, width}, {0, height}});
blur_x(x, y, _) = (in(x, y, _) + in(x + 1, y, _) + in(x + 2, y, _)) / 3;
output(x, y, _) = (blur_x(x, y, _) + blur_x(x, y + 1, _) + blur_x(x, y + 2, _)) / 3;
}
void schedule() {
if (using_autoscheduler()) {
const int W = 1536, H = 2560, C = 4;
// Wart: Input<Func> are defined with Vars we don't know.
// Might be x,y but might be _0,_1. Use the args() to work around.
input.set_estimate(input.args()[0], 0, W)
.set_estimate(input.args()[1], 0, H);
for (size_t i = 2; i < input.args().size(); ++i) {
input.set_estimate(input.args()[i], 0, C);
}
width.set_estimate(W);
height.set_estimate(H);
output.set_estimate(x, 0, W)
.set_estimate(y, 0, H);
for (size_t i = 2; i < output.args().size(); ++i) {
output.set_estimate(output.args()[i], 0, C);
}
} else {
Var xi("xi"), yi("yi");
output.split(y, y, yi, 8).parallel(y).vectorize(x, 8);
blur_x.store_at(output, y).compute_at(output, yi).vectorize(x, 8);
}
}
};
} // namespace
HALIDE_REGISTER_GENERATOR(SimpleBlur, simple_blur)
|