summaryrefslogtreecommitdiffhomepage
path: root/misc/benchmarks/picobench/picobench_csmap.cpp
blob: 5caab6cccef07669adebe6e55d9dd381ee91c62b (plain)
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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
#include <iostream>
#define i_static
#include <stc/crandom.h>
#define i_static
#include <stc/cstr.h>
#include <cmath>
#include <string>
#include <map>

#define PICOBENCH_IMPLEMENT_WITH_MAIN
#include "picobench.hpp"

enum {N1 = 1000000, S1 = 1};
uint64_t seed = time(NULL); // 18237129837891;

using omap_i = std::map<int, int>;
using omap_x = std::map<uint64_t, uint64_t>;
using omap_s = std::map<std::string, std::string>;

#define i_key int
#define i_val int
#define i_tag i
#include <stc/csmap.h>

#define i_key size_t
#define i_val size_t
#define i_tag x
#include <stc/csmap.h>

#define i_key_str
#define i_val_str
#include <stc/csmap.h>

PICOBENCH_SUITE("Map1");

template <class MapInt>
static void ctor_and_ins_one_i(picobench::state& s)
{
    size_t result = 0;
    picobench::scope scope(s);
    c_forrange (n, s.iterations()) {
        MapInt map;
        map[n];
        result += map.size();
    }
    s.set_result(result);
}
/*
static void ctor_and_ins_one_csmap_i(picobench::state& s)
{
    size_t result = 0;
    picobench::scope scope(s);
    c_forrange (n, s.iterations()) {
        csmap_i map = csmap_i_init();
        csmap_i_insert(&map, n, 0);
        result += csmap_i_size(&map);
        csmap_i_drop(&map);
    }
    s.set_result(result);
}

#define P samples(S1).iterations({N1})
PICOBENCH(ctor_and_ins_one_i<omap_i>).P;
PICOBENCH(ctor_and_ins_one_csmap_i).P;
#undef P
*/

PICOBENCH_SUITE("Map_insert_only");

template <class MapInt>
static void insert_i(picobench::state& s)
{
    MapInt map;
    csrandom(seed);
    picobench::scope scope(s);
    c_forrange (n, s.iterations())
        map.emplace(crandom() & 0xfffffff, n);
    s.set_result(map.size());
}

static void insert_csmap_i(picobench::state& s)
{
    csmap_i map = csmap_i_init();
    csrandom(seed);
    picobench::scope scope(s);
    c_forrange (n, s.iterations())
        csmap_i_insert(&map, crandom() & 0xfffffff, n);
    s.set_result(csmap_i_size(&map));
    csmap_i_drop(&map);
}

#define P samples(S1).iterations({N1})
PICOBENCH(insert_i<omap_i>).P;
PICOBENCH(insert_csmap_i).P;
#undef P


PICOBENCH_SUITE("Map2");

template <class MapInt>
static void ins_and_erase_i(picobench::state& s)
{
    size_t result = 0;
    uint64_t mask = (1ull << s.arg()) - 1;
    MapInt map;
    csrandom(seed);

    picobench::scope scope(s);
    c_forrange (i, s.iterations())
        map.emplace(crandom() & mask, i);
    result = map.size();

    map.clear();
    csrandom(seed);
    c_forrange (i, s.iterations())
        map[crandom() & mask] = i;

    csrandom(seed);
    c_forrange (s.iterations())
        map.erase(crandom() & mask);
    s.set_result(result);
}

static void ins_and_erase_csmap_i(picobench::state& s)
{
    size_t result = 0;
    uint64_t mask = (1ull << s.arg()) - 1;
    csmap_i map = csmap_i_init();
    csrandom(seed);

    picobench::scope scope(s);
    c_forrange (i, s.iterations())
        csmap_i_insert(&map, crandom() & mask, i);
    result = csmap_i_size(&map);

    csmap_i_clear(&map);
    csrandom(seed);
    c_forrange (i, s.iterations())
        csmap_i_insert_or_assign(&map, crandom() & mask, i);

    csrandom(seed);
    c_forrange (s.iterations())
        csmap_i_erase(&map, crandom() & mask);
    s.set_result(result);
    csmap_i_drop(&map);
}

#define P samples(S1).iterations({N1/2, N1/2, N1/2, N1/2}).args({18, 23, 25, 31})
PICOBENCH(ins_and_erase_i<omap_i>).P;
PICOBENCH(ins_and_erase_csmap_i).P;
#undef P

PICOBENCH_SUITE("Map3");

template <class MapInt>
static void ins_and_access_i(picobench::state& s)
{
    uint64_t mask = (1ull << s.arg()) - 1;
    size_t result = 0;
    MapInt map;
    csrandom(seed);

    picobench::scope scope(s);
    c_forrange (s.iterations()) {
        result += ++map[crandom() & mask];
        auto it = map.find(crandom() & mask);
        if (it != map.end()) map.erase(it->first);
    }
    s.set_result(result + map.size());
}

static void ins_and_access_csmap_i(picobench::state& s)
{
    uint64_t mask = (1ull << s.arg()) - 1;
    size_t result = 0;
    csmap_i map = csmap_i_init();
    csrandom(seed);

    picobench::scope scope(s);
    c_forrange (s.iterations()) {
        result += ++csmap_i_insert(&map, crandom() & mask, 0).ref->second;
        const csmap_i_value* val = csmap_i_get(&map, crandom() & mask);
        if (val) csmap_i_erase(&map, val->first);
    }
    s.set_result(result + csmap_i_size(&map));
    csmap_i_drop(&map);
}

#define P samples(S1).iterations({N1, N1, N1, N1}).args({18, 23, 25, 31})
PICOBENCH(ins_and_access_i<omap_i>).P;
PICOBENCH(ins_and_access_csmap_i).P;
#undef P

PICOBENCH_SUITE("Map4");

static void randomize(char* str, int len) {
    union {uint64_t i; char c[8];} r = {.i = crandom()};
    for (int i = len - 7, j = 0; i < len; ++j, ++i)
        str[i] = (r.c[j] & 63) + 48;
}

template <class MapStr>
static void ins_and_access_s(picobench::state& s)
{
    std::string str(s.arg(), 'x');
    size_t result = 0;
    MapStr map;

    picobench::scope scope(s);
    csrandom(seed);
    c_forrange (s.iterations()) {
        randomize(&str[0], str.size());
        map.emplace(str, str);
    }
    csrandom(seed);
    c_forrange (s.iterations()) {
        randomize(&str[0], str.size());
        result += map.erase(str);
    }
    s.set_result(result + map.size());
}

static void ins_and_access_csmap_s(picobench::state& s)
{
    cstr str = cstr_with_size(s.arg(), 'x');
    char* buf = cstr_data(&str);
    size_t result = 0;
    csmap_str map = csmap_str_init();

    picobench::scope scope(s);
    csrandom(seed);
    c_forrange (s.iterations()) {
        randomize(buf, s.arg());
        csmap_str_emplace(&map, buf, buf);
    }
    csrandom(seed);
    c_forrange (s.iterations()) {
        randomize(buf, s.arg());
        result += csmap_str_erase(&map, buf);
        /*csmap_str_iter it = csmap_str_find(&map, buf);
        if (it.ref) {
            ++result;
            csmap_str_erase(&map, cstr_str(&it.ref->first));
        }*/
    }
    s.set_result(result + csmap_str_size(&map));
    cstr_drop(&str);
    csmap_str_drop(&map);
}

#define P samples(S1).iterations({N1/5, N1/5, N1/5, N1/10, N1/40}).args({13, 7, 8, 100, 1000})
PICOBENCH(ins_and_access_s<omap_s>).P;
PICOBENCH(ins_and_access_csmap_s).P;
#undef P

PICOBENCH_SUITE("Map5");

template <class MapX>
static void iterate_x(picobench::state& s)
{
    MapX map;
    uint64_t K = (1ull << s.arg()) - 1;

    picobench::scope scope(s);
    csrandom(seed);
    size_t result = 0;

    // measure insert then iterate whole map
    c_forrange (n, s.iterations()) {
        map[crandom()] = n;
        if (!(n & K)) for (auto const& keyVal : map)
            result += keyVal.second;
    }

    // reset rng back to inital state
    csrandom(seed);

    // measure erase then iterate whole map
    c_forrange (n, s.iterations()) {
        map.erase(crandom());
        if (!(n & K)) for (auto const& keyVal : map)
            result += keyVal.second;
    }
    s.set_result(result);
}
/*
static void iterate_csmap_x(picobench::state& s)
{
    csmap_x map = csmap_x_init();
    uint64_t K = (1ull << s.arg()) - 1;

    picobench::scope scope(s);
    csrandom(seed);
    size_t result = 0;

    // measure insert then iterate whole map
    c_forrange (n, s.iterations()) {
        csmap_x_insert_or_assign(&map, crandom(), n);
        if (!(n & K)) c_foreach (i, csmap_x, map)
            result += i.ref->second;
    }

    // reset rng back to inital state
    csrandom(seed);

    // measure erase then iterate whole map
    c_forrange (n, s.iterations()) {
        csmap_x_erase(&map, crandom());
        if (!(n & K)) c_foreach (i, csmap_x, map)
            result += i.ref->second;
    }
    s.set_result(result);
    csmap_x_drop(&map);
}

#define P samples(S1).iterations({N1/20}).args({12})
PICOBENCH(iterate_x<omap_x>).P;
PICOBENCH(iterate_csmap_x).P;
#undef P
*/