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
|
/*
* Copyright (C) 2015 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include <mutex>
#include <thread>
#include <wtf/Condition.h>
#include <wtf/DataLog.h>
#include <wtf/Deque.h>
#include <wtf/Lock.h>
#include <wtf/StringPrintStream.h>
#include <wtf/Threading.h>
#include <wtf/Vector.h>
using namespace WTF;
namespace TestWebKitAPI {
namespace {
const bool verbose = false;
enum NotifyStyle {
AlwaysNotifyOne,
TacticallyNotifyAll
};
template<typename Functor>
void wait(Condition& condition, std::unique_lock<Lock>& locker, const Functor& predicate, std::chrono::microseconds timeout)
{
if (timeout == std::chrono::microseconds::max())
condition.wait(locker, predicate);
else {
// This tests timeouts in the sense that it verifies that we can call wait() again after a
// timeout happened. That's a non-trivial piece of functionality since upon timeout the
// ParkingLot has to remove us from the queue.
while (!predicate())
condition.waitFor(locker, timeout, predicate);
}
}
void notify(NotifyStyle notifyStyle, Condition& condition, bool shouldNotify)
{
switch (notifyStyle) {
case AlwaysNotifyOne:
condition.notifyOne();
break;
case TacticallyNotifyAll:
if (shouldNotify)
condition.notifyAll();
break;
}
}
void runTest(
unsigned numProducers,
unsigned numConsumers,
unsigned maxQueueSize,
unsigned numMessagesPerProducer,
NotifyStyle notifyStyle,
std::chrono::microseconds timeout = std::chrono::microseconds::max(),
std::chrono::microseconds delay = std::chrono::microseconds::zero())
{
Deque<unsigned> queue;
bool shouldContinue = true;
Lock lock;
Condition emptyCondition;
Condition fullCondition;
Vector<ThreadIdentifier> consumerThreads;
Vector<ThreadIdentifier> producerThreads;
Vector<unsigned> received;
Lock receivedLock;
for (unsigned i = numConsumers; i--;) {
ThreadIdentifier threadIdentifier = createThread(
"Consumer thread",
[&] () {
for (;;) {
unsigned result;
unsigned shouldNotify = false;
{
std::unique_lock<Lock> locker(lock);
wait(
emptyCondition, locker,
[&] () {
if (verbose)
dataLog(toString(currentThread(), ": Checking consumption predicate with shouldContinue = ", shouldContinue, ", queue.size() == ", queue.size(), "\n"));
return !shouldContinue || !queue.isEmpty();
},
timeout);
if (!shouldContinue && queue.isEmpty())
return;
shouldNotify = queue.size() == maxQueueSize;
result = queue.takeFirst();
}
notify(notifyStyle, fullCondition, shouldNotify);
{
std::lock_guard<Lock> locker(receivedLock);
received.append(result);
}
}
});
consumerThreads.append(threadIdentifier);
}
std::this_thread::sleep_for(delay);
for (unsigned i = numProducers; i--;) {
ThreadIdentifier threadIdentifier = createThread(
"Producer Thread",
[&] () {
for (unsigned i = 0; i < numMessagesPerProducer; ++i) {
bool shouldNotify = false;
{
std::unique_lock<Lock> locker(lock);
wait(
fullCondition, locker,
[&] () {
if (verbose)
dataLog(toString(currentThread(), ": Checking production predicate with shouldContinue = ", shouldContinue, ", queue.size() == ", queue.size(), "\n"));
return queue.size() < maxQueueSize;
},
timeout);
shouldNotify = queue.isEmpty();
queue.append(i);
}
notify(notifyStyle, emptyCondition, shouldNotify);
}
});
producerThreads.append(threadIdentifier);
}
for (ThreadIdentifier threadIdentifier : producerThreads)
waitForThreadCompletion(threadIdentifier);
{
std::lock_guard<Lock> locker(lock);
shouldContinue = false;
}
emptyCondition.notifyAll();
for (ThreadIdentifier threadIdentifier : consumerThreads)
waitForThreadCompletion(threadIdentifier);
EXPECT_EQ(numProducers * numMessagesPerProducer, received.size());
std::sort(received.begin(), received.end());
for (unsigned messageIndex = 0; messageIndex < numMessagesPerProducer; ++messageIndex) {
for (unsigned producerIndex = 0; producerIndex < numProducers; ++producerIndex)
EXPECT_EQ(messageIndex, received[messageIndex * numProducers + producerIndex]);
}
}
} // anonymous namespace
TEST(WTF_Condition, OneProducerOneConsumerOneSlot)
{
runTest(1, 1, 1, 100000, TacticallyNotifyAll);
}
TEST(WTF_Condition, OneProducerOneConsumerOneSlotTimeout)
{
runTest(
1, 1, 1, 100000, TacticallyNotifyAll,
std::chrono::microseconds(10000),
std::chrono::microseconds(1000000));
}
TEST(WTF_Condition, OneProducerOneConsumerHundredSlots)
{
runTest(1, 1, 100, 1000000, TacticallyNotifyAll);
}
TEST(WTF_Condition, TenProducersOneConsumerOneSlot)
{
runTest(10, 1, 1, 10000, TacticallyNotifyAll);
}
TEST(WTF_Condition, TenProducersOneConsumerHundredSlotsNotifyAll)
{
runTest(10, 1, 100, 10000, TacticallyNotifyAll);
}
TEST(WTF_Condition, TenProducersOneConsumerHundredSlotsNotifyOne)
{
runTest(10, 1, 100, 10000, AlwaysNotifyOne);
}
TEST(WTF_Condition, OneProducerTenConsumersOneSlot)
{
runTest(1, 10, 1, 10000, TacticallyNotifyAll);
}
TEST(WTF_Condition, OneProducerTenConsumersHundredSlotsNotifyAll)
{
runTest(1, 10, 100, 100000, TacticallyNotifyAll);
}
TEST(WTF_Condition, OneProducerTenConsumersHundredSlotsNotifyOne)
{
runTest(1, 10, 100, 100000, AlwaysNotifyOne);
}
TEST(WTF_Condition, TenProducersTenConsumersOneSlot)
{
runTest(10, 10, 1, 50000, TacticallyNotifyAll);
}
TEST(WTF_Condition, TenProducersTenConsumersHundredSlotsNotifyAll)
{
runTest(10, 10, 100, 50000, TacticallyNotifyAll);
}
TEST(WTF_Condition, TenProducersTenConsumersHundredSlotsNotifyOne)
{
runTest(10, 10, 100, 50000, AlwaysNotifyOne);
}
TEST(WTF_Condition, TimeoutTimesOut)
{
Lock lock;
Condition condition;
lock.lock();
bool result = condition.waitFor(
lock, std::chrono::microseconds(10000), [] () -> bool { return false; });
lock.unlock();
EXPECT_FALSE(result);
}
} // namespace TestWebKitAPI
|