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
|
#include <BH/Bench.h>
#include <BH/Math/Box2f.h>
static float boxAMin[2] = {1.0f, 2.0f};
static float boxAMax[2] = {5.0f, 6.0f};
static float boxBMin[2] = {3.0f, 4.0f};
static float boxBMax[2] = {7.0f, 8.0f};
static float pointInside[2] = {3.0f, 4.0f};
static float pointList[] =
{
1.0f, 2.0f,
4.0f, 6.0f,
2.0f, 3.0f,
5.0f, 1.0f,
3.0f, 7.0f
};
static size_t pointCount = 5;
static float outMin[2];
static float outMax[2];
BH_BENCH_TEST(Union)
{
while (BH_BenchIter(state))
{
BH_Box2fUnion(boxAMin, boxAMax, boxBMin, boxBMax, outMin, outMax);
BH_BenchDoNotOptimize(outMin);
BH_BenchDoNotOptimize(outMax);
}
}
BH_BENCH_TEST(Intersect)
{
while (BH_BenchIter(state))
{
int result;
result = BH_Box2fIntersect(boxAMin, boxAMax, boxBMin, boxBMax, outMin, outMax);
BH_BenchDoNotOptimize(result);
BH_BenchDoNotOptimize(outMin);
BH_BenchDoNotOptimize(outMax);
}
}
BH_BENCH_TEST(Contains)
{
while (BH_BenchIter(state))
{
int result;
result = BH_Box2fContains(boxAMin, boxAMax, pointInside);
BH_BenchDoNotOptimize(result);
}
}
BH_BENCH_TEST(Enclose)
{
while (BH_BenchIter(state))
{
int result;
result = BH_Box2fEnclose(pointList, pointCount, outMin, outMax);
BH_BenchDoNotOptimize(result);
BH_BenchDoNotOptimize(outMin);
BH_BenchDoNotOptimize(outMax);
}
}
int main(void)
{
BH_BENCH_ADD(Union);
BH_BENCH_ADD(Intersect);
BH_BENCH_ADD(Contains);
BH_BENCH_ADD(Enclose);
return BH_BenchRun();
}
|
