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
|
//
// Copyright (c) ZeroC, Inc. All rights reserved.
//
#include <IceUtil/IceUtil.h>
#include <IceUtil/CountDownLatch.h>
#include <CountDownLatchTest.h>
#include <TestHelper.h>
using namespace std;
using namespace IceUtil;
using namespace IceUtilInternal;
static const string testName("countDownLatch");
static const int magic = 0xbeef;
class CountDownLatchTestThread : public Thread
{
public:
CountDownLatchTestThread(CountDownLatch& latch, int& val, bool takeOne) :
_latch(latch),
_val(val),
_takeOne(takeOne)
{
}
virtual void run()
{
if(_takeOne)
{
_latch.countDown();
}
if(_latch.getCount() == 0)
{
test(_val == magic);
}
_latch.await();
test(_latch.getCount() == 0);
test(_val == magic);
}
private:
CountDownLatch& _latch;
int& _val;
bool _takeOne;
};
CountDownLatchTest::CountDownLatchTest() :
TestBase(testName)
{
}
void
CountDownLatchTest::run()
{
const int fullCount = 11;
int val = 0xabcd;
CountDownLatch latch(fullCount);
test(latch.getCount() == fullCount);
const int wave1Count = 6;
int i = 0;
ThreadPtr t1[wave1Count];
for(i = 0; i < wave1Count; i++)
{
t1[i] = new CountDownLatchTestThread(latch, val, false);
t1[i]->start();
}
//
// Sleep a little bit, and check count
//
ThreadControl::sleep(Time::seconds(1));
test(latch.getCount() == fullCount);
//
// Let's count down all except 1
//
ThreadPtr t2[fullCount - 1];
for(i = 0; i < fullCount - 1; i++)
{
t2[i] = new CountDownLatchTestThread(latch, val, true);
t2[i]->start();
}
//
// Sleep until count == 1
//
do
{
ThreadControl::sleep(Time::milliSeconds(100));
for(i = 0; i < wave1Count; i++)
{
test(t1[i]->isAlive());
}
for(i = 0; i < fullCount - 1; i++)
{
test(t2[i]->isAlive());
}
} while(latch.getCount() > 1);
//
// Set val and release last count
//
val = magic;
latch.countDown();
test(latch.getCount() == 0);
//
// Join them all
//
for(i = 0; i < wave1Count; i++)
{
t1[i]->getThreadControl().join();
}
for(i = 0; i < fullCount - 1; i++)
{
t2[i]->getThreadControl().join();
}
test(latch.getCount() == 0);
const int wave2Count = 4;
ThreadPtr t3[wave2Count];
for(i = 0; i < wave2Count; i++)
{
t3[i] = new CountDownLatchTestThread(latch, val, true);
t3[i]->start();
}
test(latch.getCount() == 0);
for(i = 0; i < wave2Count; i++)
{
t3[i]->getThreadControl().join();
}
test(latch.getCount() == 0);
}
|