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
|
#include <BH/Bench.h>
#include <BH/Math/Vec2i.h>
static int vecA[2] = {5, -3};
static int vecB[2] = {2, 7};
static int vecC[2] = {4, 1};
static int vecOut[2];
BH_BENCH_TEST(Add)
{
while (BH_BenchIter(state))
{
BH_Vec2iAdd(vecA, vecB, vecOut);
BH_BenchDoNotOptimize(vecOut);
}
}
BH_BENCH_TEST(Sub)
{
while (BH_BenchIter(state))
{
BH_Vec2iSub(vecA, vecB, vecOut);
BH_BenchDoNotOptimize(vecOut);
}
}
BH_BENCH_TEST(Mul)
{
while (BH_BenchIter(state))
{
BH_Vec2iMul(vecA, vecB, vecOut);
BH_BenchDoNotOptimize(vecOut);
}
}
BH_BENCH_TEST(Scale)
{
const int s = 3;
while (BH_BenchIter(state))
{
BH_Vec2iScale(vecA, s, vecOut);
BH_BenchDoNotOptimize(vecOut);
}
}
BH_BENCH_TEST(MulAdd)
{
while (BH_BenchIter(state))
{
BH_Vec2iMulAdd(vecA, vecB, vecC, vecOut);
BH_BenchDoNotOptimize(vecOut);
}
}
BH_BENCH_TEST(Negate)
{
while (BH_BenchIter(state))
{
BH_Vec2iNegate(vecA, vecOut);
BH_BenchDoNotOptimize(vecOut);
}
}
BH_BENCH_TEST(Min)
{
while (BH_BenchIter(state))
{
BH_Vec2iMin(vecA, vecB, vecOut);
BH_BenchDoNotOptimize(vecOut);
}
}
BH_BENCH_TEST(Max)
{
while (BH_BenchIter(state))
{
BH_Vec2iMax(vecA, vecB, vecOut);
BH_BenchDoNotOptimize(vecOut);
}
}
int main(int argc, char **argv)
{
BH_UNUSED(argc);
BH_UNUSED(argv);
BH_BENCH_ADD(Add);
BH_BENCH_ADD(Sub);
BH_BENCH_ADD(Mul);
BH_BENCH_ADD(Scale);
BH_BENCH_ADD(MulAdd);
BH_BENCH_ADD(Negate);
BH_BENCH_ADD(Min);
BH_BENCH_ADD(Max);
return BH_BenchRun();
}
|
