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 "HalideBuffer.h"
#include "HalideRuntime.h"
#include <math.h>
#include <stdio.h>
#include "bit_operations.h"
using namespace Halide::Runtime;
const int kSize = 1024;
template<typename T>
uint8_t _count_leading_zeros(T v) {
int bits = sizeof(v) * 8;
while (v) {
v >>= 1;
bits--;
}
return bits;
}
int main(int argc, char **argv) {
Buffer<uint8_t, 1> input8(kSize);
Buffer<uint16_t, 1> input16(kSize);
Buffer<uint32_t, 1> input32(kSize);
Buffer<uint64_t, 1> input64(kSize);
Buffer<uint8_t, 1> output8(kSize);
Buffer<uint8_t, 1> output16(kSize);
Buffer<uint8_t, 1> output32(kSize);
Buffer<uint8_t, 1> output64(kSize);
for (int i = 0; i < kSize; i++) {
input8(i) = i;
input16(i) = i * i;
input32(i) = i * i * i;
input64(i) = i * i * i * i;
}
bit_operations(input8, input16, input32, input64, output8, output16, output32, output64);
for (int i = 0; i < kSize; i++) {
assert(output8(i) == _count_leading_zeros(input8(i)));
assert(output16(i) == _count_leading_zeros(input16(i)));
assert(output32(i) == _count_leading_zeros(input32(i)));
assert(output64(i) == _count_leading_zeros(input64(i)));
}
printf("Success!\n");
return 0;
}
|
