38be0d1383
This is the beginning of revision history for this module. If you want to look at revision history older than this, please refer to the Qt Git wiki for how to use Git history grafting. At the time of writing, this wiki is located here: http://qt.gitorious.org/qt/pages/GitIntroductionWithQt If you have already performed the grafting and you don't see any history beyond this commit, try running "git log" with the "--follow" argument. Branched from the monolithic repo, Qt master branch, at commit 896db169ea224deb96c59ce8af800d019de63f12
451 lines
11 KiB
C++
451 lines
11 KiB
C++
/****************************************************************************
|
|
**
|
|
** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
|
|
** All rights reserved.
|
|
** Contact: Nokia Corporation (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 Technology Preview License Agreement accompanying
|
|
** this package.
|
|
**
|
|
** 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.1, included in the file LGPL_EXCEPTION.txt in this package.
|
|
**
|
|
** If you have questions regarding the use of this file, please contact
|
|
** Nokia at qt-info@nokia.com.
|
|
**
|
|
**
|
|
**
|
|
**
|
|
**
|
|
**
|
|
**
|
|
**
|
|
** $QT_END_LICENSE$
|
|
**
|
|
****************************************************************************/
|
|
|
|
|
|
#include <QtTest/QtTest>
|
|
|
|
|
|
#include <qcoreapplication.h>
|
|
#include <qthread.h>
|
|
#include <qsemaphore.h>
|
|
|
|
//TESTED_CLASS=
|
|
//TESTED_FILES=
|
|
|
|
class tst_QSemaphore : public QObject
|
|
{
|
|
Q_OBJECT
|
|
|
|
public:
|
|
tst_QSemaphore();
|
|
~tst_QSemaphore();
|
|
|
|
private slots:
|
|
void acquire();
|
|
void tryAcquire();
|
|
void tryAcquireWithTimeout_data();
|
|
void tryAcquireWithTimeout();
|
|
void tryAcquireWithTimeoutStarvation();
|
|
void release();
|
|
void available();
|
|
void producerConsumer();
|
|
};
|
|
|
|
static QSemaphore *semaphore = 0;
|
|
|
|
tst_QSemaphore::tst_QSemaphore()
|
|
{ }
|
|
|
|
tst_QSemaphore::~tst_QSemaphore()
|
|
{ }
|
|
|
|
class ThreadOne : public QThread
|
|
{
|
|
public:
|
|
ThreadOne() {}
|
|
|
|
protected:
|
|
void run()
|
|
{
|
|
int i = 0;
|
|
while ( i < 100 ) {
|
|
semaphore->acquire();
|
|
i++;
|
|
semaphore->release();
|
|
}
|
|
}
|
|
};
|
|
|
|
class ThreadN : public QThread
|
|
{
|
|
int N;
|
|
|
|
public:
|
|
ThreadN(int n) :N(n) { }
|
|
|
|
protected:
|
|
void run()
|
|
{
|
|
int i = 0;
|
|
while ( i < 100 ) {
|
|
semaphore->acquire(N);
|
|
i++;
|
|
semaphore->release(N);
|
|
}
|
|
}
|
|
};
|
|
|
|
void tst_QSemaphore::acquire()
|
|
{
|
|
{
|
|
// old incrementOne() test
|
|
QVERIFY(!semaphore);
|
|
semaphore = new QSemaphore;
|
|
// make some "thing" available
|
|
semaphore->release();
|
|
|
|
ThreadOne t1;
|
|
ThreadOne t2;
|
|
|
|
t1.start();
|
|
t2.start();
|
|
|
|
QVERIFY(t1.wait(4000));
|
|
QVERIFY(t2.wait(4000));
|
|
|
|
delete semaphore;
|
|
semaphore = 0;
|
|
}
|
|
|
|
// old incrementN() test
|
|
{
|
|
QVERIFY(!semaphore);
|
|
semaphore = new QSemaphore;
|
|
// make 4 "things" available
|
|
semaphore->release(4);
|
|
|
|
ThreadN t1(2);
|
|
ThreadN t2(3);
|
|
|
|
t1.start();
|
|
t2.start();
|
|
|
|
QVERIFY(t1.wait(4000));
|
|
QVERIFY(t2.wait(4000));
|
|
|
|
delete semaphore;
|
|
semaphore = 0;
|
|
}
|
|
|
|
QSemaphore semaphore;
|
|
|
|
QCOMPARE(semaphore.available(), 0);
|
|
semaphore.release();
|
|
QCOMPARE(semaphore.available(), 1);
|
|
semaphore.release();
|
|
QCOMPARE(semaphore.available(), 2);
|
|
semaphore.release(10);
|
|
QCOMPARE(semaphore.available(), 12);
|
|
semaphore.release(10);
|
|
QCOMPARE(semaphore.available(), 22);
|
|
|
|
semaphore.acquire();
|
|
QCOMPARE(semaphore.available(), 21);
|
|
semaphore.acquire();
|
|
QCOMPARE(semaphore.available(), 20);
|
|
semaphore.acquire(10);
|
|
QCOMPARE(semaphore.available(), 10);
|
|
semaphore.acquire(10);
|
|
QCOMPARE(semaphore.available(), 0);
|
|
}
|
|
|
|
void tst_QSemaphore::tryAcquire()
|
|
{
|
|
QSemaphore semaphore;
|
|
|
|
QCOMPARE(semaphore.available(), 0);
|
|
|
|
semaphore.release();
|
|
QCOMPARE(semaphore.available(), 1);
|
|
QVERIFY(!semaphore.tryAcquire(2));
|
|
QCOMPARE(semaphore.available(), 1);
|
|
|
|
semaphore.release();
|
|
QCOMPARE(semaphore.available(), 2);
|
|
QVERIFY(!semaphore.tryAcquire(3));
|
|
QCOMPARE(semaphore.available(), 2);
|
|
|
|
semaphore.release(10);
|
|
QCOMPARE(semaphore.available(), 12);
|
|
QVERIFY(!semaphore.tryAcquire(100));
|
|
QCOMPARE(semaphore.available(), 12);
|
|
|
|
semaphore.release(10);
|
|
QCOMPARE(semaphore.available(), 22);
|
|
QVERIFY(!semaphore.tryAcquire(100));
|
|
QCOMPARE(semaphore.available(), 22);
|
|
|
|
QVERIFY(semaphore.tryAcquire());
|
|
QCOMPARE(semaphore.available(), 21);
|
|
|
|
QVERIFY(semaphore.tryAcquire());
|
|
QCOMPARE(semaphore.available(), 20);
|
|
|
|
QVERIFY(semaphore.tryAcquire(10));
|
|
QCOMPARE(semaphore.available(), 10);
|
|
|
|
QVERIFY(semaphore.tryAcquire(10));
|
|
QCOMPARE(semaphore.available(), 0);
|
|
|
|
// should not be able to acquire more
|
|
QVERIFY(!semaphore.tryAcquire());
|
|
QCOMPARE(semaphore.available(), 0);
|
|
|
|
QVERIFY(!semaphore.tryAcquire());
|
|
QCOMPARE(semaphore.available(), 0);
|
|
|
|
QVERIFY(!semaphore.tryAcquire(10));
|
|
QCOMPARE(semaphore.available(), 0);
|
|
|
|
QVERIFY(!semaphore.tryAcquire(10));
|
|
QCOMPARE(semaphore.available(), 0);
|
|
}
|
|
|
|
void tst_QSemaphore::tryAcquireWithTimeout_data()
|
|
{
|
|
QTest::addColumn<int>("timeout");
|
|
|
|
QTest::newRow("1s") << 1000;
|
|
QTest::newRow("10s") << 10000;
|
|
}
|
|
|
|
void tst_QSemaphore::tryAcquireWithTimeout()
|
|
{
|
|
QFETCH(int, timeout);
|
|
|
|
QSemaphore semaphore;
|
|
QTime time;
|
|
|
|
#define QVERIFYGE(a,b) {int e = a; if (a<b) qDebug() << #a << "=" << e << " !>= " << #b << "=" << b; QVERIFY(e>=b);}
|
|
#define QVERIFYLE(a,b) {int e = a; if (b<a) qDebug() << #a << "=" << e << " !<= " << #b << "=" << b; QVERIFY(e<=b);}
|
|
|
|
QCOMPARE(semaphore.available(), 0);
|
|
|
|
semaphore.release();
|
|
QCOMPARE(semaphore.available(), 1);
|
|
time.start();
|
|
QVERIFY(!semaphore.tryAcquire(2, timeout));
|
|
QVERIFYGE(time.elapsed(), timeout);
|
|
QCOMPARE(semaphore.available(), 1);
|
|
|
|
semaphore.release();
|
|
QCOMPARE(semaphore.available(), 2);
|
|
time.start();
|
|
QVERIFY(!semaphore.tryAcquire(3, timeout));
|
|
QVERIFYGE(time.elapsed(), timeout);
|
|
QCOMPARE(semaphore.available(), 2);
|
|
|
|
semaphore.release(10);
|
|
QCOMPARE(semaphore.available(), 12);
|
|
time.start();
|
|
QVERIFY(!semaphore.tryAcquire(100, timeout));
|
|
QVERIFYGE(time.elapsed(), timeout);
|
|
QCOMPARE(semaphore.available(), 12);
|
|
|
|
semaphore.release(10);
|
|
QCOMPARE(semaphore.available(), 22);
|
|
time.start();
|
|
QVERIFY(!semaphore.tryAcquire(100, timeout));
|
|
QVERIFYGE(time.elapsed(), timeout);
|
|
QCOMPARE(semaphore.available(), 22);
|
|
|
|
time.start();
|
|
QVERIFY(semaphore.tryAcquire(1, timeout));
|
|
QVERIFYLE(time.elapsed(), timeout);
|
|
QCOMPARE(semaphore.available(), 21);
|
|
|
|
time.start();
|
|
QVERIFY(semaphore.tryAcquire(1, timeout));
|
|
QVERIFYLE(time.elapsed(), timeout);
|
|
QCOMPARE(semaphore.available(), 20);
|
|
|
|
time.start();
|
|
QVERIFY(semaphore.tryAcquire(10, timeout));
|
|
QVERIFYLE(time.elapsed(), timeout);
|
|
QCOMPARE(semaphore.available(), 10);
|
|
|
|
time.start();
|
|
QVERIFY(semaphore.tryAcquire(10, timeout));
|
|
QVERIFYLE(time.elapsed(), timeout);
|
|
QCOMPARE(semaphore.available(), 0);
|
|
|
|
// should not be able to acquire more
|
|
time.start();
|
|
QVERIFY(!semaphore.tryAcquire(1, timeout));
|
|
QVERIFYGE(time.elapsed(), timeout);
|
|
QCOMPARE(semaphore.available(), 0);
|
|
|
|
time.start();
|
|
QVERIFY(!semaphore.tryAcquire(1, timeout));
|
|
QVERIFYGE(time.elapsed(), timeout);
|
|
QCOMPARE(semaphore.available(), 0);
|
|
|
|
time.start();
|
|
QVERIFY(!semaphore.tryAcquire(10, timeout));
|
|
QVERIFYGE(time.elapsed(), timeout);
|
|
QCOMPARE(semaphore.available(), 0);
|
|
|
|
time.start();
|
|
QVERIFY(!semaphore.tryAcquire(10, timeout));
|
|
QVERIFYGE(time.elapsed(), timeout);
|
|
QCOMPARE(semaphore.available(), 0);
|
|
}
|
|
|
|
void tst_QSemaphore::tryAcquireWithTimeoutStarvation()
|
|
{
|
|
class Thread : public QThread
|
|
{
|
|
public:
|
|
QSemaphore startup;
|
|
QSemaphore *semaphore;
|
|
int amountToConsume, timeout;
|
|
|
|
void run()
|
|
{
|
|
startup.release();
|
|
forever {
|
|
if (!semaphore->tryAcquire(amountToConsume, timeout))
|
|
break;
|
|
semaphore->release(amountToConsume);
|
|
}
|
|
}
|
|
};
|
|
|
|
QSemaphore semaphore;
|
|
semaphore.release(1);
|
|
|
|
Thread consumer;
|
|
consumer.semaphore = &semaphore;
|
|
consumer.amountToConsume = 1;
|
|
consumer.timeout = 1000;
|
|
|
|
// start the thread and wait for it to start consuming
|
|
consumer.start();
|
|
consumer.startup.acquire();
|
|
|
|
// try to consume more than the thread we started is, and provide a longer
|
|
// timeout... we should timeout, not wait indefinitely
|
|
QVERIFY(!semaphore.tryAcquire(consumer.amountToConsume * 2, consumer.timeout * 2));
|
|
|
|
// the consumer should still be running
|
|
QVERIFY(consumer.isRunning() && !consumer.isFinished());
|
|
|
|
// acquire, and wait for smallConsumer to timeout
|
|
semaphore.acquire();
|
|
QVERIFY(consumer.wait());
|
|
}
|
|
|
|
void tst_QSemaphore::release()
|
|
{ DEPENDS_ON("acquire"); }
|
|
|
|
void tst_QSemaphore::available()
|
|
{ DEPENDS_ON("acquire"); }
|
|
|
|
const char alphabet[] = "ACGTH";
|
|
const int AlphabetSize = sizeof(alphabet) - 1;
|
|
|
|
const int BufferSize = 4096; // GCD of BufferSize and alphabet size must be 1
|
|
char buffer[BufferSize];
|
|
|
|
#ifndef Q_OS_WINCE
|
|
const int ProducerChunkSize = 3;
|
|
const int ConsumerChunkSize = 7;
|
|
const int Multiplier = 10;
|
|
#else
|
|
const int ProducerChunkSize = 2;
|
|
const int ConsumerChunkSize = 5;
|
|
const int Multiplier = 3;
|
|
#endif
|
|
|
|
// note: the code depends on the fact that DataSize is a multiple of
|
|
// ProducerChunkSize, ConsumerChunkSize, and BufferSize
|
|
const int DataSize = ProducerChunkSize * ConsumerChunkSize * BufferSize * Multiplier;
|
|
|
|
QSemaphore freeSpace(BufferSize);
|
|
QSemaphore usedSpace;
|
|
|
|
class Producer : public QThread
|
|
{
|
|
public:
|
|
void run();
|
|
};
|
|
|
|
void Producer::run()
|
|
{
|
|
for (int i = 0; i < DataSize; ++i) {
|
|
freeSpace.acquire();
|
|
buffer[i % BufferSize] = alphabet[i % AlphabetSize];
|
|
usedSpace.release();
|
|
}
|
|
for (int i = 0; i < DataSize; ++i) {
|
|
if ((i % ProducerChunkSize) == 0)
|
|
freeSpace.acquire(ProducerChunkSize);
|
|
buffer[i % BufferSize] = alphabet[i % AlphabetSize];
|
|
if ((i % ProducerChunkSize) == (ProducerChunkSize - 1))
|
|
usedSpace.release(ProducerChunkSize);
|
|
}
|
|
}
|
|
|
|
class Consumer : public QThread
|
|
{
|
|
public:
|
|
void run();
|
|
};
|
|
|
|
void Consumer::run()
|
|
{
|
|
for (int i = 0; i < DataSize; ++i) {
|
|
usedSpace.acquire();
|
|
QCOMPARE(buffer[i % BufferSize], alphabet[i % AlphabetSize]);
|
|
freeSpace.release();
|
|
}
|
|
for (int i = 0; i < DataSize; ++i) {
|
|
if ((i % ConsumerChunkSize) == 0)
|
|
usedSpace.acquire(ConsumerChunkSize);
|
|
QCOMPARE(buffer[i % BufferSize], alphabet[i % AlphabetSize]);
|
|
if ((i % ConsumerChunkSize) == (ConsumerChunkSize - 1))
|
|
freeSpace.release(ConsumerChunkSize);
|
|
}
|
|
}
|
|
|
|
void tst_QSemaphore::producerConsumer()
|
|
{
|
|
Producer producer;
|
|
Consumer consumer;
|
|
producer.start();
|
|
consumer.start();
|
|
producer.wait();
|
|
consumer.wait();
|
|
}
|
|
|
|
QTEST_MAIN(tst_QSemaphore)
|
|
#include "tst_qsemaphore.moc"
|