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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
|
#include "Halide.h"
#include "halide_benchmark.h"
#include <cstdio>
using namespace Halide;
using namespace Halide::Tools;
template<typename A>
const char *string_of_type();
#define DECL_SOT(name) \
template<> \
const char *string_of_type<name>() { \
return #name; \
}
DECL_SOT(uint8_t);
DECL_SOT(int8_t);
DECL_SOT(uint16_t);
DECL_SOT(int16_t);
DECL_SOT(uint32_t);
DECL_SOT(int32_t);
DECL_SOT(float);
DECL_SOT(double);
template<typename A>
bool test() {
const Target target = get_jit_target_from_environment();
const int vec_width = target.natural_vector_size<A>();
int W = vec_width * 1;
int H = 10000;
Buffer<A> input(W, H + 20);
for (int y = 0; y < H + 20; y++) {
for (int x = 0; x < W; x++) {
input(x, y) = Internal::safe_numeric_cast<A>((rand() & 0xffff) * 0.125 + 1.0);
}
}
Var x, y;
Func f, g;
Expr e = input(x, y);
for (int i = 1; i < 5; i++) {
e = e + input(x, y + i);
}
for (int i = 5; i >= 0; i--) {
e = e + input(x, y + i);
}
f(x, y) = e;
g(x, y) = e;
f.bound(x, 0, vec_width).vectorize(x);
// Stop llvm from auto-vectorizing the scalar case and messing up
// the comparison. Also causes cache effects, but the entire input
// is small enough to fit in cache.
g.reorder(y, x);
Buffer<A> outputg = g.realize({W, H});
Buffer<A> outputf = f.realize({W, H});
double t_g = benchmark([&]() {
g.realize(outputg);
});
double t_f = benchmark([&]() {
f.realize(outputf);
});
for (int y = 0; y < H; y++) {
for (int x = 0; x < W; x++) {
if (outputf(x, y) != outputg(x, y)) {
printf("%s x %d failed at %d %d: %d vs %d\n",
string_of_type<A>(), vec_width,
x, y,
(int)outputf(x, y),
(int)outputg(x, y));
return false;
}
}
}
printf("Vectorized vs scalar (%s x %d): %1.3gms %1.3gms. Speedup = %1.3f\n",
string_of_type<A>(), vec_width, t_f * 1e3, t_g * 1e3, t_g / t_f);
if (t_f > t_g) {
return false;
}
return true;
}
int main(int argc, char **argv) {
Target target = get_jit_target_from_environment();
if (target.arch == Target::WebAssembly) {
printf("[SKIP] Performance tests are meaningless and/or misleading under WebAssembly interpreter.\n");
return 0;
}
bool ok = true;
// Only native vector widths for now
ok = ok && test<float>();
ok = ok && test<double>();
ok = ok && test<uint8_t>();
ok = ok && test<int8_t>();
ok = ok && test<uint16_t>();
ok = ok && test<int16_t>();
ok = ok && test<uint32_t>();
ok = ok && test<int32_t>();
if (!ok) {
return 1;
}
printf("Success!\n");
return 0;
}
|
