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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
|
#include <BH/Bench.h>
#include <BH/Hashmap.h>
#include <stdio.h>
#define NUM_ENTRIES 1000
static int keys[NUM_ENTRIES];
static char values[NUM_ENTRIES][16];
static BH_Hashmap *map;
static BH_Hashmap *warmMap;
int BH_IntEqual(const void *a, const void *b)
{
return (*(const int*)a == *(const int*)b) ? 0 : 1;
}
size_t BH_IntHash(const void *key)
{
int k = *(const int*)key;
return (size_t)((k * 2654435761U) >> 8);
}
static void setupData(void)
{
int i;
for (i = 0; i < NUM_ENTRIES; ++i)
{
keys[i] = i + 1;
sprintf(values[i], "value_%d", i + 1);
}
}
static void setupWarmMap(void)
{
int i;
warmMap = BH_HashmapNew(BH_IntEqual, BH_IntHash);
for (i = 0; i < NUM_ENTRIES; ++i)
{
BH_HashmapInsert(warmMap, &keys[i], values[i]);
}
}
BH_BENCH_TEST(NewFree)
{
while (BH_BenchIter(state))
{
map = BH_HashmapNew(BH_IntEqual, BH_IntHash);
BH_BenchDoNotOptimize(map);
BH_HashmapFree(map);
}
}
BH_BENCH_TEST(ReserveInsert)
{
BH_BenchSubcount(state, NUM_ENTRIES);
while (BH_BenchIter(state))
{
map = BH_HashmapNew(BH_IntEqual, BH_IntHash);
BH_HashmapReserve(map, NUM_ENTRIES);
for (int i = 0; i < NUM_ENTRIES; ++i)
{
BH_HashmapInsert(map, &keys[i], values[i]);
}
BH_HashmapClear(map);
BH_BenchDoNotOptimize(map);
BH_HashmapFree(map);
}
}
BH_BENCH_TEST(Lookup)
{
BH_BenchSubcount(state, NUM_ENTRIES);
while (BH_BenchIter(state))
{
int i;
void *value = NULL;
for (i = 0; i < NUM_ENTRIES; ++i)
{
BH_HashmapAt(warmMap, &keys[i], &value);
}
BH_BenchDoNotOptimize(value);
}
}
BH_BENCH_TEST(Remove)
{
BH_BenchSubcount(state, NUM_ENTRIES);
while (BH_BenchIter(state))
{
int i;
map = BH_HashmapNew(BH_IntEqual, BH_IntHash);
for (i = 0; i < NUM_ENTRIES; ++i)
{
BH_HashmapInsert(map, &keys[i], values[i]);
}
for (i = 0; i < NUM_ENTRIES; ++i)
{
BH_HashmapRemove(map, &keys[i]);
}
BH_BenchDoNotOptimize(map);
BH_HashmapFree(map);
}
}
int main(int argc, char **argv)
{
BH_UNUSED(argc);
BH_UNUSED(argv);
setupData();
setupWarmMap();
BH_BENCH_ADD(NewFree);
BH_BENCH_ADD(ReserveInsert);
BH_BENCH_ADD(Lookup);
BH_BENCH_ADD(Remove);
return BH_BenchRun();
}
|
