danderson@11: // vim: set sts=8 ts=2 sw=2 tw=99 et: danderson@11: // danderson@11: // Copyright (C) 2013, David Anderson and AlliedModders LLC danderson@11: // All rights reserved. danderson@11: // danderson@11: // Redistribution and use in source and binary forms, with or without danderson@11: // modification, are permitted provided that the following conditions are met: danderson@11: // danderson@11: // * Redistributions of source code must retain the above copyright notice, this danderson@11: // list of conditions and the following disclaimer. danderson@11: // * Redistributions in binary form must reproduce the above copyright notice, danderson@11: // this list of conditions and the following disclaimer in the documentation danderson@11: // and/or other materials provided with the distribution. danderson@11: // * Neither the name of AlliedModders LLC nor the names of its contributors danderson@11: // may be used to endorse or promote products derived from this software danderson@11: // without specific prior written permission. danderson@11: // danderson@11: // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" danderson@11: // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE danderson@11: // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE danderson@11: // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE danderson@11: // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR danderson@11: // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF danderson@11: // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS danderson@11: // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN danderson@11: // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) danderson@11: // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE danderson@11: // POSSIBILITY OF SUCH DAMAGE. danderson@11: danderson@11: #include danderson@11: #include danderson@11: #include danderson@11: #include "runner.h" danderson@11: danderson@11: using namespace ke; danderson@11: danderson@11: // Simple worker that adds up numbers. danderson@11: class TestWorkerModel : public IRunnable danderson@11: { danderson@11: public: danderson@11: TestWorkerModel() danderson@11: : terminate_(false), danderson@11: result_(0) danderson@11: { danderson@11: } danderson@11: danderson@11: void Run() { danderson@11: { danderson@11: AutoLock lock(main()); danderson@11: main()->Notify(); danderson@11: } danderson@11: danderson@11: AutoLock lock(wakeup()); danderson@11: while (true) { danderson@11: while (items_.begin() != items_.end()) { danderson@11: int value = *(items_.begin()); danderson@11: items_.erase(items_.begin()); danderson@11: danderson@11: AutoUnlock unlock(wakeup()); danderson@11: result_ += value; danderson@11: } danderson@11: danderson@11: // Only terminate if we're guaranteed the queue has no items - after danderson@11: // we've just finished processing all items in the queue, while the lock danderson@11: // is held. danderson@11: if (terminate_) danderson@11: return; danderson@11: danderson@11: wakeup()->Wait(); danderson@11: } danderson@11: } danderson@11: danderson@11: ConditionVariable *main() { danderson@11: return &main_; danderson@11: } danderson@11: ConditionVariable *wakeup() { danderson@11: return &wakeup_; danderson@11: } danderson@11: danderson@11: void terminate() { danderson@11: AutoLock lock(&wakeup_); danderson@11: terminate_ = true; danderson@11: wakeup_.Notify(); danderson@11: } danderson@11: danderson@11: int result() { danderson@11: return result_; danderson@11: } danderson@11: danderson@11: void send(int value) { danderson@11: AutoLock lock(&wakeup_); danderson@11: items_.append(value); danderson@11: wakeup_.Notify(); danderson@11: } danderson@11: danderson@11: private: danderson@11: ConditionVariable main_; danderson@11: ConditionVariable wakeup_; danderson@11: LinkedList items_; danderson@11: bool terminate_; danderson@11: int result_; danderson@11: }; danderson@11: danderson@11: class TestThreading : public Test danderson@11: { danderson@11: public: danderson@11: TestThreading() danderson@11: : Test("ThreadUtils") danderson@11: { danderson@11: } danderson@11: danderson@11: bool testWorkerModel() danderson@11: { danderson@11: TestWorkerModel test; danderson@11: ke::AutoPtr thread(new Thread(&test, "TestWorkerModel")); danderson@11: if (!check(thread->Succeeded(), "thread launched")) danderson@11: return false; danderson@11: danderson@11: { danderson@11: AutoLock lock(test.main()); danderson@11: if (!check(test.main()->Wait(5000) == Wait_Signaled, "thread started within five seconds")) danderson@11: return false; danderson@11: } danderson@11: danderson@11: int total = 0; danderson@11: for (int i = 0; i < 100000; i++) { danderson@11: test.send(i); danderson@11: total += i; danderson@11: } danderson@11: danderson@11: test.terminate(); danderson@11: thread->Join(); danderson@11: danderson@11: if (!check(test.result() == total, "thread returned correct result")) danderson@11: return false; danderson@11: danderson@11: return true; danderson@11: } danderson@11: danderson@11: bool Run() KE_OVERRIDE danderson@11: { danderson@11: if (!testWorkerModel()) danderson@11: return false; danderson@11: return true; danderson@11: } danderson@11: } sTestThreading; danderson@11: