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
|
/*
SPDX-FileCopyrightText: 2012-2013 Milian Wolff <mail@milianw.de>
SPDX-FileCopyrightText: 2020 Igor Kushnir <igorkuo@gmail.com>
SPDX-License-Identifier: GPL-2.0-only OR GPL-3.0-only OR LicenseRef-KDE-Accepted-GPL
*/
#include "bench_indexedstring.h"
#include <language/util/kdevhash.h>
#include <serialization/indexedstring.h>
#include <tests/testhelpers.h>
#include <QTest>
#include <utility>
#include <vector>
QTEST_GUILESS_MAIN(BenchIndexedString)
using namespace KDevelop;
static QVector<QString> generateData()
{
QVector<QString> data;
static const int NUM_ITEMS = 100000;
data.resize(NUM_ITEMS);
for (int i = 0; i < NUM_ITEMS; ++i) {
data[i] = QStringLiteral("/foo/%1").arg(i);
}
return data;
}
void BenchIndexedString::bench_index()
{
const QVector<QString> data = generateData();
QBENCHMARK {
for (const QString& item : data) {
IndexedString idx(item);
Q_UNUSED(idx);
}
}
}
static QVector<uint> setupTest()
{
const QVector<QString> data = generateData();
QVector<uint> indices;
indices.reserve(data.size());
for (const QString& item : data) {
IndexedString idx(item);
indices << idx.index();
}
return indices;
}
void BenchIndexedString::bench_length()
{
const QVector<uint> indices = setupTest();
QBENCHMARK {
for (uint index : indices) {
IndexedString str = IndexedString::fromIndex(index);
str.length();
}
}
}
void BenchIndexedString::bench_qstring()
{
const QVector<uint> indices = setupTest();
QBENCHMARK {
for (uint index : indices) {
IndexedString str = IndexedString::fromIndex(index);
str.str();
}
}
}
void BenchIndexedString::bench_kurl()
{
const QVector<uint> indices = setupTest();
QBENCHMARK {
for (uint index : indices) {
IndexedString str = IndexedString::fromIndex(index);
str.toUrl();
}
}
}
void BenchIndexedString::bench_qhashQString()
{
const QVector<QString> data = generateData();
quint64 sum = 0;
QBENCHMARK {
for (const auto& string : data) {
sum += qHash(string);
}
}
QVERIFY(sum > 0);
}
void BenchIndexedString::bench_qhashIndexedString()
{
const QVector<uint> indices = setupTest();
quint64 sum = 0;
QBENCHMARK {
for (uint index : indices) {
sum += qHash(IndexedString::fromIndex(index));
}
}
QVERIFY(sum > 0);
}
void BenchIndexedString::bench_hashString()
{
const QVector<QString> strings = generateData();
QVector<QByteArray> byteArrays;
byteArrays.reserve(strings.size());
for (const auto& string : strings) {
byteArrays << string.toUtf8();
}
quint64 sum = 0;
QBENCHMARK {
for (const auto& array : qAsConst(byteArrays)) {
sum += IndexedString::hashString(array.constData(), array.length());
}
}
QVERIFY(sum > 0);
}
void BenchIndexedString::bench_kdevhash()
{
const QVector<QString> strings = generateData();
QVector<QByteArray> byteArrays;
byteArrays.reserve(strings.size());
for (const auto& string : strings) {
byteArrays << string.toUtf8();
}
quint64 sum = 0;
QBENCHMARK {
for (const auto& array : qAsConst(byteArrays)) {
sum += KDevHash() << array;
}
}
QVERIFY(sum > 0);
}
void BenchIndexedString::bench_qSet()
{
const QVector<uint> indices = setupTest();
QSet<IndexedString> set;
QBENCHMARK {
for (uint index : indices) {
set.insert(IndexedString::fromIndex(index));
}
}
}
static std::vector<IndexedString> createIndexedStrings(std::size_t count)
{
std::vector<IndexedString> result;
// result.reserve(count) is called after verifying that count is not too great.
constexpr char first{33};
constexpr char last{127};
constexpr std::size_t dataSize{4};
std::size_t maxCount{1};
for (std::size_t i = 0; i < dataSize; ++i) {
maxCount *= (last - first);
}
// Subtract 1 to account for the fact that count is checked at the beginning
// of the innermost loop in order to support count == 0.
--maxCount;
QVERIFY_RETURN(count <= maxCount, result);
result.reserve(count);
char data[dataSize + 1] = {};
QCOMPARE_RETURN(data[dataSize], 0, result);
for (char a = first; a != last; ++a) {
data[0] = a;
for (char b = first; b != last; ++b) {
data[1] = b;
for (char c = first; c != last; ++c) {
data[2] = c;
for (char d = first; d != last; ++d) {
if (count-- == 0) {
return result;
}
data[3] = d;
result.emplace_back(data, dataSize);
}
}
}
}
Q_UNREACHABLE();
}
void BenchIndexedString::bench_create()
{
QBENCHMARK_ONCE {
createIndexedStrings(1'000'000);
}
}
void BenchIndexedString::bench_destroy()
{
auto strings = createIndexedStrings(10'000'000);
QBENCHMARK_ONCE {
strings = {};
}
}
void BenchIndexedString::bench_swap()
{
IndexedString a("foo");
IndexedString b("bar");
QBENCHMARK {
using std::swap;
swap(a, b);
}
}
|
