File: compute_inside_guard.cpp

package info (click to toggle)
halide 21.0.0-4
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 55,752 kB
  • sloc: cpp: 289,334; ansic: 22,751; python: 7,486; makefile: 4,299; sh: 2,508; java: 1,549; javascript: 282; pascal: 207; xml: 127; asm: 9
file content (48 lines) | stat: -rw-r--r-- 1,320 bytes parent folder | download | duplicates (4)
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 "halide_benchmark.h"
#include <stdio.h>

using namespace Halide;

int main(int argc, char **argv) {

    ImageParam input{UInt(8), 1, "input"};

    Var x;

    Func intermediate;
    intermediate(x) = input(x);

    Func output;
    output(x) = intermediate(x);

    Var xo, xi;
    output
        .compute_root()
        .split(x, xo, xi, output.output_buffer().width() / 8, TailStrategy::GuardWithIf);

    // If we compute intermediate at xi, there should be precisely one
    // value of the intermediate needed, so we can put it in
    // register-class storage. This is a way to test if the compiler
    // realizes that there is precisely one value of the intermediate
    // needed, which will only work out if the realization of
    // intermediate lands inside the if statement created by the
    // output's GuardWithIf split.
    intermediate
        .compute_at(output, xi)
        .unroll(x)
        .store_in(MemoryType::Register);

    // Also check that the bounds required of the input haven't been
    // rounded up to a multiple of the split factor (which is not a
    // constant, just to make things even harder).
    Buffer<uint8_t> ibuf(123);
    Buffer<uint8_t> obuf(123);

    input.set(ibuf);
    output.realize(obuf);

    printf("Success!\n");
    return 0;
}