1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/tests/test-threadutils.cpp Mon Aug 26 23:18:03 2013 -0700
1.3 @@ -0,0 +1,147 @@
1.4 +// vim: set sts=8 ts=2 sw=2 tw=99 et:
1.5 +//
1.6 +// Copyright (C) 2013, David Anderson and AlliedModders LLC
1.7 +// All rights reserved.
1.8 +//
1.9 +// Redistribution and use in source and binary forms, with or without
1.10 +// modification, are permitted provided that the following conditions are met:
1.11 +//
1.12 +// * Redistributions of source code must retain the above copyright notice, this
1.13 +// list of conditions and the following disclaimer.
1.14 +// * Redistributions in binary form must reproduce the above copyright notice,
1.15 +// this list of conditions and the following disclaimer in the documentation
1.16 +// and/or other materials provided with the distribution.
1.17 +// * Neither the name of AlliedModders LLC nor the names of its contributors
1.18 +// may be used to endorse or promote products derived from this software
1.19 +// without specific prior written permission.
1.20 +//
1.21 +// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
1.22 +// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1.23 +// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1.24 +// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
1.25 +// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
1.26 +// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
1.27 +// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
1.28 +// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
1.29 +// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
1.30 +// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1.31 +// POSSIBILITY OF SUCH DAMAGE.
1.32 +
1.33 +#include <am-thread-utils.h>
1.34 +#include <am-utility.h>
1.35 +#include <am-linkedlist.h>
1.36 +#include "runner.h"
1.37 +
1.38 +using namespace ke;
1.39 +
1.40 +// Simple worker that adds up numbers.
1.41 +class TestWorkerModel : public IRunnable
1.42 +{
1.43 + public:
1.44 + TestWorkerModel()
1.45 + : terminate_(false),
1.46 + result_(0)
1.47 + {
1.48 + }
1.49 +
1.50 + void Run() {
1.51 + {
1.52 + AutoLock lock(main());
1.53 + main()->Notify();
1.54 + }
1.55 +
1.56 + AutoLock lock(wakeup());
1.57 + while (true) {
1.58 + while (items_.begin() != items_.end()) {
1.59 + int value = *(items_.begin());
1.60 + items_.erase(items_.begin());
1.61 +
1.62 + AutoUnlock unlock(wakeup());
1.63 + result_ += value;
1.64 + }
1.65 +
1.66 + // Only terminate if we're guaranteed the queue has no items - after
1.67 + // we've just finished processing all items in the queue, while the lock
1.68 + // is held.
1.69 + if (terminate_)
1.70 + return;
1.71 +
1.72 + wakeup()->Wait();
1.73 + }
1.74 + }
1.75 +
1.76 + ConditionVariable *main() {
1.77 + return &main_;
1.78 + }
1.79 + ConditionVariable *wakeup() {
1.80 + return &wakeup_;
1.81 + }
1.82 +
1.83 + void terminate() {
1.84 + AutoLock lock(&wakeup_);
1.85 + terminate_ = true;
1.86 + wakeup_.Notify();
1.87 + }
1.88 +
1.89 + int result() {
1.90 + return result_;
1.91 + }
1.92 +
1.93 + void send(int value) {
1.94 + AutoLock lock(&wakeup_);
1.95 + items_.append(value);
1.96 + wakeup_.Notify();
1.97 + }
1.98 +
1.99 + private:
1.100 + ConditionVariable main_;
1.101 + ConditionVariable wakeup_;
1.102 + LinkedList<int> items_;
1.103 + bool terminate_;
1.104 + int result_;
1.105 +};
1.106 +
1.107 +class TestThreading : public Test
1.108 +{
1.109 + public:
1.110 + TestThreading()
1.111 + : Test("ThreadUtils")
1.112 + {
1.113 + }
1.114 +
1.115 + bool testWorkerModel()
1.116 + {
1.117 + TestWorkerModel test;
1.118 + ke::AutoPtr<Thread> thread(new Thread(&test, "TestWorkerModel"));
1.119 + if (!check(thread->Succeeded(), "thread launched"))
1.120 + return false;
1.121 +
1.122 + {
1.123 + AutoLock lock(test.main());
1.124 + if (!check(test.main()->Wait(5000) == Wait_Signaled, "thread started within five seconds"))
1.125 + return false;
1.126 + }
1.127 +
1.128 + int total = 0;
1.129 + for (int i = 0; i < 100000; i++) {
1.130 + test.send(i);
1.131 + total += i;
1.132 + }
1.133 +
1.134 + test.terminate();
1.135 + thread->Join();
1.136 +
1.137 + if (!check(test.result() == total, "thread returned correct result"))
1.138 + return false;
1.139 +
1.140 + return true;
1.141 + }
1.142 +
1.143 + bool Run() KE_OVERRIDE
1.144 + {
1.145 + if (!testWorkerModel())
1.146 + return false;
1.147 + return true;
1.148 + }
1.149 +} sTestThreading;
1.150 +