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
|
#include <roaring/portability.h>
#include <roaring/containers/array.h>
#include <roaring/misc/configreport.h>
#include "benchmark.h"
#include "random.h"
enum { TESTSIZE = 2048 };
// flushes the array from cache
#if defined(IS_X64) && !(defined(_MSC_VER) && !defined(__clang__))
void array_cache_flush(array_container_t* B) {
const int32_t CACHELINESIZE =
computecacheline(); // 64 bytes per cache line
for (int32_t k = 0; k < B->cardinality;
k += CACHELINESIZE / (int32_t)sizeof(uint16_t)) {
__builtin_ia32_clflush(B->array + k);
}
}
#else
// no cache flush on other architectures?
void array_cache_flush(array_container_t* B) { (void)B; }
#endif
// tries to put the array in cache
void array_cache_prefetch(array_container_t* B) {
#ifdef IS_X64
const int32_t CACHELINESIZE =
computecacheline(); // 64 bytes per cache line
#else
const int32_t CACHELINESIZE = 64;
#endif
#if !(defined(_MSC_VER) && !defined(__clang__))
for (int32_t k = 0; k < B->cardinality;
k += CACHELINESIZE / (int32_t)sizeof(uint16_t)) {
__builtin_prefetch(B->array + k);
}
#endif
}
int add_test(array_container_t* B) {
int x;
for (x = 0; x < (1 << 16); x += 3) {
array_container_add(B, (uint16_t)x);
}
return 0;
}
int remove_test(array_container_t* B) {
int x;
for (x = 0; x < (1 << 16); x += 3) {
array_container_remove(B, (uint16_t)x);
}
return 0;
}
int contains_test(array_container_t* B) {
int card = 0;
int x;
for (x = 0; x < (1 << 16); x++) {
card += array_container_contains(B, (uint16_t)x);
}
return card;
}
int union_test(array_container_t* B1, array_container_t* B2,
array_container_t* BO) {
array_container_union(B1, B2, BO);
return BO->cardinality;
}
int intersection_test(array_container_t* B1, array_container_t* B2,
array_container_t* BO) {
array_container_intersection(B1, B2, BO);
return BO->cardinality;
}
int main() {
int repeat = 500;
int size = TESTSIZE;
tellmeall();
printf("array container benchmarks\n");
array_container_t* B = array_container_create();
BEST_TIME(add_test(B), 0, repeat, size);
int answer = contains_test(B);
size = 1 << 16;
BEST_TIME(contains_test(B), answer, repeat, size);
size = (1 << 16) / 3;
BEST_TIME(remove_test(B), 0, repeat, size);
array_container_free(B);
for (int howmany = 32; howmany <= (1 << 16); howmany *= 8) {
array_container_t* Bt = array_container_create();
for (int j = 0; j < howmany; ++j) {
array_container_add(Bt, (uint16_t)pcg32_random());
}
size_t nbrtestvalues = 1024;
uint16_t* testvalues = malloc(nbrtestvalues * sizeof(uint16_t));
printf("\n number of values in container = %d\n", Bt->cardinality);
int card = array_container_cardinality(Bt);
uint32_t* out = malloc(sizeof(uint32_t) * (unsigned long)card);
BEST_TIME(array_container_to_uint32_array(out, Bt, 1234), card, repeat,
card);
free(out);
BEST_TIME_PRE_ARRAY(Bt, array_container_contains, array_cache_prefetch,
testvalues, nbrtestvalues);
BEST_TIME_PRE_ARRAY(Bt, array_container_contains, array_cache_flush,
testvalues, nbrtestvalues);
free(testvalues);
array_container_free(Bt);
}
printf("\n");
array_container_t* B1 = array_container_create();
for (int x = 0; x < 1 << 16; x += 3) {
array_container_add(B1, (uint16_t)x);
}
array_container_t* B2 = array_container_create();
for (int x = 0; x < 1 << 16; x += 5) {
array_container_add(B2, (uint16_t)x);
}
int32_t inputsize = B1->cardinality + B2->cardinality;
array_container_t* BO = array_container_create();
printf("\nUnion and intersections...\n");
printf("\nNote:\n");
printf(
"union times are expressed in cycles per number of input elements "
"(both arrays)\n");
printf(
"intersection times are expressed in cycles per number of output "
"elements\n\n");
printf("==intersection and union test 1 \n");
printf("input 1 cardinality = %d, input 2 cardinality = %d \n",
B1->cardinality, B2->cardinality);
answer = union_test(B1, B2, BO);
printf("union cardinality = %d \n", answer);
printf("B1 card = %d B2 card = %d \n", B1->cardinality, B2->cardinality);
BEST_TIME(union_test(B1, B2, BO), answer, repeat, inputsize);
answer = intersection_test(B1, B2, BO);
printf("intersection cardinality = %d \n", answer);
BEST_TIME(intersection_test(B1, B2, BO), answer, repeat, answer);
printf("==intersection and union test 2 \n");
array_container_clear(B1);
array_container_clear(B2);
for (int x = 0; x < 1 << 16; x += 16) {
array_container_add(B1, (uint16_t)x);
}
for (int x = 1; x < 1 << 16; x += x) {
array_container_add(B2, (uint16_t)x);
}
printf("input 1 cardinality = %d, input 2 cardinality = %d \n",
B1->cardinality, B2->cardinality);
answer = union_test(B1, B2, BO);
printf("union cardinality = %d \n", answer);
printf("B1 card = %d B2 card = %d \n", B1->cardinality, B2->cardinality);
BEST_TIME(union_test(B1, B2, BO), answer, repeat, inputsize);
answer = intersection_test(B1, B2, BO);
printf("intersection cardinality = %d \n", answer);
BEST_TIME(intersection_test(B1, B2, BO), answer, repeat, answer);
array_container_free(B1);
array_container_free(B2);
array_container_free(BO);
return 0;
}
|
