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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/log/log.h>
#include <vespa/searchlib/common/bitvector.h>
#include <vespa/vespalib/util/signalhandler.h>
#include <iostream>
#include <string>
#include <vector>
#include <cassert>
#include <unistd.h>
LOG_SETUP("bitvectorbenchmark");
namespace search {
class BitVectorBenchmark
{
private:
std::vector<BitVector *> _bv;
std::vector<unsigned int> _bvc;
void testCountSpeed1();
void testCountSpeed2();
void testCountSpeed3();
void testOrSpeed1();
void testOrSpeed2();
static void usage();
void init(size_t n);
public:
BitVectorBenchmark();
~BitVectorBenchmark();
int main(int argc, char **argv);
};
BitVectorBenchmark::BitVectorBenchmark() :
_bv()
{
}
BitVectorBenchmark::~BitVectorBenchmark()
{
for(size_t i(0); i < _bv.size(); i++) {
delete _bv[i];
}
}
void BitVectorBenchmark::usage()
{
std::cout << "usage: bitvectorbenchmark [-n numBits] [-t operation]" << std::endl;
}
void BitVectorBenchmark::init(size_t n)
{
BitVector *a(BitVector::create(n).release());
BitVector *b(BitVector::create(n).release());
srand(1);
for(size_t i(0), j(0); i < n; i += rand()%10, j++) {
a->flipBit(i);
}
for(size_t i(0), j(0); i < n; i += rand()%10, j++) {
b->flipBit(i);
}
a->invalidateCachedCount();
b->invalidateCachedCount();
_bv.push_back(a);
_bvc.push_back(a->countTrueBits());
_bv.push_back(b);
_bvc.push_back(b->countTrueBits());
}
void BitVectorBenchmark::testOrSpeed1()
{
_bv[0]->orWith(*_bv[1]);
}
void BitVectorBenchmark::testCountSpeed1()
{
_bv[0]->invalidateCachedCount();
unsigned int cnt = _bv[0]->countTrueBits();
assert(cnt == _bvc[0]);
(void) cnt;
}
static int bitTab[256] = {
0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4,
1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,
1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,
2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,
2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,
2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
4,5,5,6,5,6,6,7,5,6,6,7,6,7,7,8
};
void BitVectorBenchmark::testCountSpeed2()
{
const unsigned char * p = reinterpret_cast<const unsigned char *>(_bv[0]->getStart());
size_t sz = _bv[0]->size()/8;
size_t sum0(0);
size_t sum1(0);
size_t sum2(0);
size_t sum3(0);
for (size_t i(0); i < sz; i+=4) {
sum0 += bitTab[p[i+0]];
sum1 += bitTab[p[i+1]];
sum2 += bitTab[p[i+2]];
sum3 += bitTab[p[i+3]];
}
assert(sum0 + sum1 + sum2 + sum3 == _bvc[0]);
}
static int
popCount(unsigned int bits)
{
unsigned int odd = bits & 0x55555555;
unsigned int even = bits & 0xaaaaaaaa;
bits = odd + (even >> 1);
odd = bits & 0x33333333;
even = bits & 0xcccccccc;
bits = odd + (even >> 2);
odd = bits & 0x0f0f0f0f;
even = bits & 0xf0f0f0f0;
bits = odd + (even >> 4);
odd = bits & 0x00ff00ff;
even = bits & 0xff00ff00;
bits = odd + (even >> 8);
odd = bits & 0x0000ffff;
even = bits & 0xffff0000;
bits = odd + (even >> 16);
return bits;
}
void
BitVectorBenchmark::testCountSpeed3()
{
const unsigned int * p = static_cast<const unsigned int *>(_bv[0]->getStart());
const unsigned int * pe = p + (_bv[0]->size()/(sizeof(uint32_t)*8));
size_t sum(0);
for (; p < pe; ++p) {
sum += popCount(*p);
}
assert(sum == _bvc[0]);
}
void BitVectorBenchmark::testOrSpeed2()
{
using T = uint64_t;
T * a = reinterpret_cast<T *>(_bv[0]->getStart());
const T * b = reinterpret_cast<const T *>(_bv[1]->getStart());
size_t sz = _bv[0]->size()/(8*sizeof(*a));
for (size_t i(0); i < sz; i+=2) {
a[i] |= b[i];
a[i+1] |= b[i+1];
// a[i+2] |= b[i+2];
// a[i+3] |= b[i+3];
}
}
int BitVectorBenchmark::main(int argc, char **argv)
{
std::string operation;
size_t numBits(8*1000000);
int opt;
bool optError = false;
while ((opt = getopt(argc, argv, "n:t:")) != -1) {
switch (opt) {
case 'n':
numBits = strtoll(optarg, NULL, 10);
break;
case 't':
operation = optarg;
break;
default:
optError = true;
break;
}
}
if ((argc != optind ) || optError) {
usage();
return -1;
}
init(numBits);
for (size_t i(0); i < operation.size(); i++) {
char op(operation[i]);
size_t splitBits1 = rand() % numBits;
size_t splitBits2 = rand() % numBits;
if (splitBits1 > splitBits2)
std::swap(splitBits1, splitBits2);
for (size_t j(0); j < 1000; j++) {
if (op == 'c') {
testCountSpeed1();
} else if (op == 'd') {
testCountSpeed2();
} else if (op == 'e') {
testCountSpeed3();
} else if (op == 'o') {
testOrSpeed1();
} else if (op == 'p') {
testOrSpeed2();
} else {
std::cerr << "Unknown operation " << op << std::endl;
}
}
}
return 0;
}
}
int main(int argc, char ** argv) {
vespalib::SignalHandler::PIPE.ignore();
search::BitVectorBenchmark myapp;
return myapp.main(argc, argv);
}
|
