blob: 2e2036110dfe36d8c066656854a31fb5bfd7164a (
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
|
// Copyright (C) 2021 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR GPL-3.0-only WITH Qt-GPL-exception-1.0
#include <QVector>
#include <QDebug>
#include <QTest>
#include "qrawvector.h"
#include <vector>
/* Using 'extern accumulate' causes some load making the loop resembling a
'simple inner loop' in 'real' applications.
*/
/* QRawVector::mutateToVector() hacks a semblance of a Qt 5 QVector.
However, Qt 6's QVector is Qt 6's QList and completely different in internal
layout. The QTypedArrayData inside it is also completely rearranged. Until
QRawVector can be rewritten to do whatever it's supposed to do in a
Qt6-compatible way, this test is suppressed, see QTBUG-95061.
*/
#define TEST_RAW 0
// TODO: is this still a thing ? (Dates from g++ 4.3.3 in 2009.)
// For some reason, both 'plain' and '-callgrind' create strange results
// (like varying instruction count for the same assembly code)
// So replace it by a plain loop and measure wall clock time.
//#undef QBENCHMARK
//#define QBENCHMARK for (int j = 0; j != 10000; ++j)
class tst_QVector: public QObject
{
Q_OBJECT
private slots:
void calibration();
// Pure Qt solution
void qvector_separator() { qWarning() << "QVector results: "; }
void qvector_const_read_access();
void qvector_mutable_read_access();
void qvector_pop_back();
void qvector_fill_and_return();
// Purre Standard solution
void stdvector() { qWarning() << "std::vector results: "; }
void stdvector_const_read_access();
void stdvector_mutable_read_access();
void stdvector_pop_back();
void stdvector_fill_and_return();
// Build using std, pass as QVector
void mixedvector() { qWarning() << "mixed results: "; }
void mixedvector_fill_and_return();
// Alternative implementation
void qrawvector_separator() { qWarning() << "QRawVector results: "; }
void qrawvector_const_read_access();
void qrawvector_mutable_read_access();
#if TEST_RAW
void qrawvector_fill_and_return();
#endif
};
void tst_QVector::calibration()
{
QVector<double> v(million);
for (int i = 0; i < million; ++i)
v[i] = i;
QBENCHMARK {
for (int i = 0; i < million; ++i)
accumulate += i;
}
}
///////////////////// QVector /////////////////////
void tst_QVector::qvector_const_read_access()
{
QVector<double> v(million);
for (int i = 0; i < million; ++i)
v[i] = i;
const QVector<double> &vc = v;
QBENCHMARK {
for (int i = 0; i < million; ++i)
accumulate += vc[i];
}
}
void tst_QVector::qvector_mutable_read_access()
{
QVector<double> v(million);
for (int i = 0; i < million; ++i)
v[i] = i;
QBENCHMARK {
for (int i = 0; i < million; ++i)
accumulate += v[i];
}
}
void tst_QVector::qvector_fill_and_return()
{
QBENCHMARK {
QVector<double> v = qvector_fill_and_return_helper();
accumulate += v[1];
}
}
///////////////////// QRawVector /////////////////////
void tst_QVector::qrawvector_const_read_access()
{
QRawVector<double> v(million);
for (int i = 0; i < million; ++i)
v[i] = i;
const QRawVector<double> &vc = v;
QBENCHMARK {
for (int i = vc.size(); --i >= 0;)
accumulate += vc[i];
}
}
void tst_QVector::qrawvector_mutable_read_access()
{
QRawVector<double> v(million);
for (int i = 0; i < million; ++i)
v[i] = i;
QBENCHMARK {
for (int i = 0; i < million; ++i)
accumulate += v[i];
}
}
void tst_QVector::qvector_pop_back()
{
const int c1 = 100000;
QVERIFY(million % c1 == 0);
QVector<int> v;
v.resize(million);
QBENCHMARK {
for (int i = 0; i < c1; ++i)
v.pop_back();
if (v.size() == 0)
v.resize(million);
}
}
#if TEST_RAW
void tst_QVector::qrawvector_fill_and_return()
{
QBENCHMARK {
QVector<double> v = qrawvector_fill_and_return_helper();
accumulate += v[1];
}
}
#endif
///////////////////// std::vector /////////////////////
void tst_QVector::stdvector_const_read_access()
{
std::vector<double> v(million);
for (int i = 0; i < million; ++i)
v[i] = i;
const std::vector<double> &vc = v;
QBENCHMARK {
for (int i = 0; i < million; ++i)
accumulate += vc[i];
}
}
void tst_QVector::stdvector_mutable_read_access()
{
std::vector<double> v(million);
for (int i = 0; i < million; ++i)
v[i] = i;
QBENCHMARK {
for (int i = 0; i < million; ++i)
accumulate += v[i];
}
}
void tst_QVector::stdvector_pop_back()
{
const int size = million / 10;
QVERIFY(million % size == 0);
std::vector<int> v;
v.resize(million);
QBENCHMARK {
for (int i = 0; i < size; ++i)
v.pop_back();
if (v.size() == 0)
v.resize(million);
}
}
void tst_QVector::stdvector_fill_and_return()
{
QBENCHMARK {
std::vector<double> v = stdvector_fill_and_return_helper();
accumulate += v[1];
}
}
///////////////////// mixed vector /////////////////////
void tst_QVector::mixedvector_fill_and_return()
{
QBENCHMARK {
std::vector<double> v = stdvector_fill_and_return_helper();
accumulate += v[1];
}
}
QTEST_MAIN(tst_QVector)
#include "tst_bench_qvector.moc"
|
