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
321
322
323
324
325
326
327
328
329
330
331
332
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** Contact: Qt Software Information (qt-info@nokia.com)
**
** This file is part of the test suite of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the either Technology Preview License Agreement or the
** Beta Release License Agreement.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain
** additional rights. These rights are described in the Nokia Qt LGPL
** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this
** package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
** If you are unsure which license is appropriate for your use, please
** contact the sales department at qt-sales@nokia.com.
** $QT_END_LICENSE$
**
****************************************************************************/
#include <QThread>
#include "../qfuture/versioncheck.h"
struct TestIterator
{
TestIterator(int i)
:i(i) { }
int operator-(const TestIterator &other)
{
return i - other.i;
}
TestIterator& operator++()
{
++i;
return *this;
}
bool operator!=(const TestIterator &other) const
{
return i != other.i;
}
int i;
};
#include <qiterator.h>
namespace std {
template <>
struct iterator_traits<TestIterator>
{
typedef random_access_iterator_tag iterator_category;
};
int distance(TestIterator &a, TestIterator &b)
{
return b - a;
}
}
#include <qtconcurrentiteratekernel.h>
#include <QtTest/QtTest>
#ifndef QT_NO_CONCURRENT_TEST
using namespace QtConcurrent;
class tst_iteratekernel: public QObject
{
Q_OBJECT
private slots:
// "for" iteration tests:
void instantiate();
void cancel();
void stresstest();
void noIterations();
void throttling();
void blockSize();
void multipleResults();
#if 0
//"while" iterations tests:
void instantiateWhile();
void stresstestWhile();
#endif
};
QAtomicInt iterations;
class PrintFor : public IterateKernel<TestIterator, void>
{
public:
PrintFor(TestIterator begin, TestIterator end) : IterateKernel<TestIterator, void>(begin, end) {iterations = 0; }
inline bool runIterations(TestIterator/*beginIterator*/, int begin, int end, void *)
{
iterations.fetchAndAddRelaxed(end - begin);
#ifdef PRINT
qDebug() << QThread::currentThread() << "iteration" << begin << "to" << end << "(exclusive)";
#endif
return false;
}
};
class SleepPrintFor : public IterateKernel<TestIterator, void>
{
public:
SleepPrintFor(TestIterator begin, TestIterator end) : IterateKernel<TestIterator, void>(begin, end) {iterations = 0; }
inline bool runIterations(TestIterator/*beginIterator*/, int begin, int end, void *)
{
QTest::qSleep(200);
iterations.fetchAndAddRelaxed(end - begin);
#ifdef PRINT
qDebug() << QThread::currentThread() << "iteration" << begin << "to" << end << "(exclusive)";
#endif
return false;
}
};
void tst_iteratekernel::instantiate()
{
startThreadEngine(new PrintFor(0, 40)).startBlocking();
QCOMPARE((int)iterations, 40);
}
void tst_iteratekernel::cancel()
{
{
QFuture<void> f = startThreadEngine(new SleepPrintFor(0, 40)).startAsynchronously();
f.cancel();
f.waitForFinished();
QVERIFY(f.isCanceled());
QVERIFY(int(iterations) <= QThread::idealThreadCount()); // the threads might run one iteration each before they are canceled.
}
}
QAtomicInt counter;
class CountFor : public IterateKernel<TestIterator, void>
{
public:
CountFor(TestIterator begin, TestIterator end) : IterateKernel<TestIterator, void>(begin, end) {iterations = 0; }
inline bool runIterations(TestIterator/*beginIterator*/, int begin, int end, void *)
{
counter.fetchAndAddRelaxed(end - begin);
return false;
}
};
void tst_iteratekernel::stresstest()
{
const int iterations = 1000;
const int times = 50;
for (int i = 0; i < times; ++i) {
counter = 0;
CountFor f(0, iterations);
f.startBlocking();
QCOMPARE((int)counter, iterations);
}
}
void tst_iteratekernel::noIterations()
{
const int times = 20000;
for (int i = 0; i < times; ++i)
startThreadEngine(new IterateKernel<TestIterator, void>(0, 0)).startBlocking();
}
QSet<QThread *> threads;
class ThrottleFor : public IterateKernel<TestIterator, void>
{
public:
// this class throttles between iterations 100 and 200,
// and then records how many threads that run between
// iterations 140 and 160.
ThrottleFor(TestIterator begin, TestIterator end) : IterateKernel<TestIterator, void>(begin, end) {iterations = 0; throttling = false; }
inline bool runIterations(TestIterator/*beginIterator*/, int begin, int end, void *)
{
if (200 >= begin && 200 < end) {
throttling = false;
}
iterations.fetchAndAddRelaxed(end - begin);
QThread *thread = QThread::currentThread();
if (begin > 140 && end < 160)
threads.insert(thread);
if (100 >= begin && 100 < end) {
throttling = true;
}
QTest::qWait(1);
return false;
}
bool shouldThrottleThread()
{
return (iterations > 100 && iterations < 200);
}
bool throttling;
};
void tst_iteratekernel::throttling()
{
const int totalIterations = 400;
iterations = 0;
threads.clear();
ThrottleFor f(0, totalIterations);
f.startBlocking();
QCOMPARE((int)iterations, totalIterations);
QCOMPARE(threads.count(), 1);
}
int peakBlockSize = 0;
class BlockSizeRecorder : public IterateKernel<TestIterator, void>
{
public:
BlockSizeRecorder(TestIterator begin, TestIterator end) : IterateKernel<TestIterator, void>(begin, end) { }
inline bool runIterations(TestIterator, int begin, int end, void *)
{
peakBlockSize = qMax(peakBlockSize, end - begin);
return false;
}
};
void tst_iteratekernel::blockSize()
{
const int expectedMinimumBlockSize = 1024 / QThread::idealThreadCount();
BlockSizeRecorder(0, 10000).startBlocking();
if (peakBlockSize < expectedMinimumBlockSize)
qDebug() << "block size" << peakBlockSize;
QVERIFY(peakBlockSize >= expectedMinimumBlockSize);
}
class MultipleResultsFor : public IterateKernel<TestIterator, int>
{
public:
MultipleResultsFor(TestIterator begin, TestIterator end) : IterateKernel<TestIterator, int>(begin, end) { }
inline bool runIterations(TestIterator, int begin, int end, int *results)
{
for (int i = begin; i < end; ++i)
results[i - begin] = i;
return true;
}
};
void tst_iteratekernel::multipleResults()
{
QFuture<int> f = startThreadEngine(new MultipleResultsFor(0, 10)).startAsynchronously();
QCOMPARE(f.results().count() , 10);
QCOMPARE(f.resultAt(0), 0);
QCOMPARE(f.resultAt(5), 5);
QCOMPARE(f.resultAt(9), 9);
f.waitForFinished();
}
#if 0
class PrintWhile : public IterateKernel<TestIterator, void>
{
public:
PrintWhile() : IterateKernel<TestIterator, void>(0, 10, WhileIteration) { }
bool runIteration(TestIterator it, TestIterator, void *)
{
return false;
}
};
void tst_iteratekernel::instantiateWhile()
{
PrintWhile w;
w.startBlocking();
}
QAtomicInt iterationCount;
class StressWhile : public IterateKernel<TestIterator, void>
{
public:
StressWhile(TestIterator iterations) : IterateKernel<TestIterator, void>(0, iterations, WhileIteration) { }
bool runIteration(TestIterator it, TestIterator index, void *)
{
if (it == index) // should match.
::iterationCount.ref();
return false;
}
};
void tst_iteratekernel::stresstestWhile()
{
int iterations = 100000;
StressWhile w(iterations);
w.startBlocking();
QCOMPARE(int(iterationCount), iterations);
}
#endif
QTEST_MAIN(tst_iteratekernel)
#include "tst_qtconcurrentiteratekernel.moc"
#else
QTEST_NOOP_MAIN
#endif
|