text
stringlengths 0
2.2M
|
---|
// The flag is not set; create event.
|
Semaphore localSemaphore;
|
event = flag->testAndSwap(0,&localSemaphore);
|
if (0 == event ) {
|
// The event handle has been stored in the flag; wait on it now.
|
localSemaphore.wait();
|
return; // RETURN
|
}
|
}
|
ASSERT(event == dummySemaphorePtr);
|
}
|
void *testCase4_fn3(int threadNum, const MyTask& task)
|
{
|
DataCase4 *data = reinterpret_cast<DataCase4 *> (task.arg());
|
for (int i=0; i < 1000; ++i) {
|
setFlag(&data->d_event1);
|
waitOnFlag(&data->d_event2, 100);
|
ASSERT (data->d_event2 != 0);
|
data->d_event2 = 0;
|
ASSERT (data->d_event2 == 0);
|
}
|
return 0;
|
}
|
void *testCase4_fn4(int threadNum, const MyTask& task)
|
{
|
DataCase4 *data = reinterpret_cast<DataCase4 *> (task.arg());
|
for (int i=0; i < 1000; ++i) {
|
waitOnFlag(&data->d_event1, 100);
|
ASSERT (data->d_event1 != 0);
|
data->d_event1 = 0;
|
ASSERT (data->d_event1 == 0);
|
setFlag(&data->d_event2);
|
}
|
return 0;
|
}
|
void *testCase4_fn1(int threadNum, const MyTask& task)
|
{
|
DataCase4 *data = reinterpret_cast<DataCase4 *> (task.arg());
|
for (int i=0; i < 1000; i++) {
|
ASSERT (data->d_flagEnd == i);
|
ASSERT (data->d_flagStart == i);
|
data->d_event1.swap(0);
|
data->d_event2.swap(0);
|
// open gate for the second thread
|
ASSERT(data->d_flagStart.testAndSwap(i, i+1) == i);
|
ASSERT(data->d_flagStart == (i+1));
|
setFlag(&data->d_event1);
|
waitOnFlag(&data->d_event2, 100);
|
// barrier wait till other thread set next value
|
while ((i+1) != data->d_flagEnd) {
|
bslmt::ThreadUtil::yield();
|
}
|
}
|
return 0;
|
}
|
void *testCase4_fn2(int threadNum, const MyTask& task)
|
{
|
DataCase4 *data = reinterpret_cast<DataCase4 *> (task.arg());
|
for (int i=0; i < 1000; i++) {
|
ASSERT (data->d_flagEnd == i);
|
// barrier wait till other thread set next value
|
while ((i+1) != data->d_flagStart) {
|
bslmt::ThreadUtil::yield();
|
}
|
setFlag(&data->d_event2);
|
waitOnFlag(&data->d_event1, 100);
|
// make sure the first thread is waiting for us
|
ASSERT(data->d_flagStart == (i+1));
|
// open gate for the first thread
|
ASSERT(data->d_flagEnd.testAndSwap(i, i+1) == i);
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.