/**************************************************************************** ** ** Copyright (C) 2014 Digia Plc and/or its subsidiary(-ies). ** Contact: http://www.qt-project.org/legal ** ** This file is part of the test suite of the Qt Toolkit. ** ** $QT_BEGIN_LICENSE:LGPL21$ ** Commercial License Usage ** Licensees holding valid commercial Qt licenses may use this file in ** accordance with the commercial license agreement provided with the ** Software or, alternatively, in accordance with the terms contained in ** a written agreement between you and Digia. For licensing terms and ** conditions see http://qt.digia.com/licensing. For further information ** use the contact form at http://qt.digia.com/contact-us. ** ** 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 or version 3 as published by the Free ** Software Foundation and appearing in the file LICENSE.LGPLv21 and ** LICENSE.LGPLv3 included in the packaging of this file. Please review the ** following information to ensure the GNU Lesser General Public License ** requirements will be met: https://www.gnu.org/licenses/lgpl.html and ** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. ** ** In addition, as a special exception, Digia gives you certain additional ** rights. These rights are described in the Digia Qt LGPL Exception ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. ** ** $QT_END_LICENSE$ ** ****************************************************************************/ #include 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 namespace std { template <> struct iterator_traits { typedef random_access_iterator_tag iterator_category; }; int distance(TestIterator &a, TestIterator &b) { return b - a; } } #include #include using namespace QtConcurrent; class tst_QtConcurrentIterateKernel: public QObject { Q_OBJECT private slots: // "for" iteration tests: void instantiate(); void cancel(); void stresstest(); void noIterations(); void throttling(); void blockSize(); void multipleResults(); }; QAtomicInt iterations; class PrintFor : public IterateKernel { public: PrintFor(TestIterator begin, TestIterator end) : IterateKernel(begin, end) { iterations.store(0); } 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; } bool runIteration(TestIterator it, int index , void *result) { return runIterations(it, index, index + 1, result); } }; class SleepPrintFor : public IterateKernel { public: SleepPrintFor(TestIterator begin, TestIterator end) : IterateKernel(begin, end) { iterations.store(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; } bool runIteration(TestIterator it, int index , void *result) { return runIterations(it, index, index + 1, result); } }; void tst_QtConcurrentIterateKernel::instantiate() { startThreadEngine(new PrintFor(0, 40)).startBlocking(); QCOMPARE(iterations.load(), 40); } void tst_QtConcurrentIterateKernel::cancel() { { QFuture f = startThreadEngine(new SleepPrintFor(0, 40)).startAsynchronously(); f.cancel(); f.waitForFinished(); QVERIFY(f.isCanceled()); // the threads might run one iteration each before they are canceled. QVERIFY2(iterations.load() <= QThread::idealThreadCount(), (QByteArray::number(iterations.load()) + ' ' + QByteArray::number(QThread::idealThreadCount()))); } } QAtomicInt counter; class CountFor : public IterateKernel { public: CountFor(TestIterator begin, TestIterator end) : IterateKernel(begin, end) { iterations.store(0); } inline bool runIterations(TestIterator/*beginIterator*/, int begin, int end, void *) { counter.fetchAndAddRelaxed(end - begin); return false; } bool runIteration(TestIterator it, int index , void *result) { return runIterations(it, index, index + 1, result); } }; void tst_QtConcurrentIterateKernel::stresstest() { const int iterations = 1000; const int times = 50; for (int i = 0; i < times; ++i) { counter.store(0); CountFor f(0, iterations); f.startBlocking(); QCOMPARE(counter.load(), iterations); } } void tst_QtConcurrentIterateKernel::noIterations() { const int times = 20000; for (int i = 0; i < times; ++i) startThreadEngine(new IterateKernel(0, 0)).startBlocking(); } QMutex threadsMutex; QSet threads; class ThrottleFor : public IterateKernel { 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(begin, end) { iterations.store(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) { QMutexLocker locker(&threadsMutex); threads.insert(thread); } if (100 >= begin && 100 < end) { throttling = true; } QTest::qWait(1); return false; } bool runIteration(TestIterator it, int index , void *result) { return runIterations(it, index, index + 1, result); } bool shouldThrottleThread() { const int load = iterations.load(); return (load > 100 && load < 200); } bool throttling; }; void tst_QtConcurrentIterateKernel::throttling() { const int totalIterations = 400; iterations.store(0); threads.clear(); ThrottleFor f(0, totalIterations); f.startBlocking(); QCOMPARE(iterations.load(), totalIterations); QCOMPARE(threads.count(), 1); } class BlockSizeRecorder : public IterateKernel { public: BlockSizeRecorder(TestIterator begin, TestIterator end) : IterateKernel(begin, end) , peakBlockSize(0) , peakBegin(0) {} inline bool runIterations(TestIterator, int begin, int end, void *) { const int blockSize = end - begin; if (blockSize > peakBlockSize) { peakBlockSize = blockSize; peakBegin = begin; } return false; } int peakBlockSize; int peakBegin; }; static QByteArray msgBlockSize(const BlockSizeRecorder &recorder, int expectedMinimumBlockSize) { return QByteArrayLiteral("peakBlockSize=") + QByteArray::number(recorder.peakBlockSize) + QByteArrayLiteral(" is less than expectedMinimumBlockSize=") + QByteArray::number(expectedMinimumBlockSize) + QByteArrayLiteral(", reached at: ") + QByteArray::number(recorder.peakBegin) + QByteArrayLiteral(" (ideal thread count: ") + QByteArray::number(QThread::idealThreadCount()) + ')'; } void tst_QtConcurrentIterateKernel::blockSize() { const int expectedMinimumBlockSize = 1024 / QThread::idealThreadCount(); BlockSizeRecorder recorder(0, 10000); recorder.startBlocking(); #ifdef Q_OS_WIN if (recorder.peakBlockSize < expectedMinimumBlockSize) QEXPECT_FAIL("", msgBlockSize(recorder, expectedMinimumBlockSize).constData(), Abort); #endif // Q_OS_WIN QVERIFY2(recorder.peakBlockSize >= expectedMinimumBlockSize, msgBlockSize(recorder, expectedMinimumBlockSize)); } class MultipleResultsFor : public IterateKernel { public: MultipleResultsFor(TestIterator begin, TestIterator end) : IterateKernel(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_QtConcurrentIterateKernel::multipleResults() { QFuture 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(); } QTEST_MAIN(tst_QtConcurrentIterateKernel) #include "tst_qtconcurrentiteratekernel.moc"