|
danderson@11
|
1 |
// vim: set sts=8 ts=2 sw=2 tw=99 et: |
|
danderson@11
|
2 |
// |
|
danderson@11
|
3 |
// Copyright (C) 2013, David Anderson and AlliedModders LLC |
|
danderson@11
|
4 |
// All rights reserved. |
|
danderson@11
|
5 |
// |
|
danderson@11
|
6 |
// Redistribution and use in source and binary forms, with or without |
|
danderson@11
|
7 |
// modification, are permitted provided that the following conditions are met: |
|
danderson@11
|
8 |
// |
|
danderson@11
|
9 |
// * Redistributions of source code must retain the above copyright notice, this |
|
danderson@11
|
10 |
// list of conditions and the following disclaimer. |
|
danderson@11
|
11 |
// * Redistributions in binary form must reproduce the above copyright notice, |
|
danderson@11
|
12 |
// this list of conditions and the following disclaimer in the documentation |
|
danderson@11
|
13 |
// and/or other materials provided with the distribution. |
|
danderson@11
|
14 |
// * Neither the name of AlliedModders LLC nor the names of its contributors |
|
danderson@11
|
15 |
// may be used to endorse or promote products derived from this software |
|
danderson@11
|
16 |
// without specific prior written permission. |
|
danderson@11
|
17 |
// |
|
danderson@11
|
18 |
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
|
danderson@11
|
19 |
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
|
danderson@11
|
20 |
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
|
danderson@11
|
21 |
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
|
danderson@11
|
22 |
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
|
danderson@11
|
23 |
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
|
danderson@11
|
24 |
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
|
danderson@11
|
25 |
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
|
danderson@11
|
26 |
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
|
danderson@11
|
27 |
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|
danderson@11
|
28 |
// POSSIBILITY OF SUCH DAMAGE. |
|
danderson@11
|
29 |
|
|
danderson@11
|
30 |
#include <am-thread-utils.h> |
|
danderson@11
|
31 |
#include <am-utility.h> |
|
danderson@11
|
32 |
#include <am-linkedlist.h> |
|
danderson@11
|
33 |
#include "runner.h" |
|
danderson@11
|
34 |
|
|
danderson@11
|
35 |
using namespace ke; |
|
danderson@11
|
36 |
|
|
danderson@11
|
37 |
// Simple worker that adds up numbers. |
|
danderson@11
|
38 |
class TestWorkerModel : public IRunnable |
|
danderson@11
|
39 |
{ |
|
danderson@11
|
40 |
public: |
|
danderson@11
|
41 |
TestWorkerModel() |
|
danderson@11
|
42 |
: terminate_(false), |
|
danderson@11
|
43 |
result_(0) |
|
danderson@11
|
44 |
{ |
|
danderson@11
|
45 |
} |
|
danderson@11
|
46 |
|
|
danderson@11
|
47 |
void Run() { |
|
danderson@11
|
48 |
{ |
|
danderson@11
|
49 |
AutoLock lock(main()); |
|
danderson@11
|
50 |
main()->Notify(); |
|
danderson@11
|
51 |
} |
|
danderson@11
|
52 |
|
|
danderson@11
|
53 |
AutoLock lock(wakeup()); |
|
danderson@11
|
54 |
while (true) { |
|
danderson@11
|
55 |
while (items_.begin() != items_.end()) { |
|
danderson@11
|
56 |
int value = *(items_.begin()); |
|
danderson@11
|
57 |
items_.erase(items_.begin()); |
|
danderson@11
|
58 |
|
|
danderson@11
|
59 |
AutoUnlock unlock(wakeup()); |
|
danderson@11
|
60 |
result_ += value; |
|
danderson@11
|
61 |
} |
|
danderson@11
|
62 |
|
|
danderson@11
|
63 |
// Only terminate if we're guaranteed the queue has no items - after |
|
danderson@11
|
64 |
// we've just finished processing all items in the queue, while the lock |
|
danderson@11
|
65 |
// is held. |
|
danderson@11
|
66 |
if (terminate_) |
|
danderson@11
|
67 |
return; |
|
danderson@11
|
68 |
|
|
danderson@11
|
69 |
wakeup()->Wait(); |
|
danderson@11
|
70 |
} |
|
danderson@11
|
71 |
} |
|
danderson@11
|
72 |
|
|
danderson@11
|
73 |
ConditionVariable *main() { |
|
danderson@11
|
74 |
return &main_; |
|
danderson@11
|
75 |
} |
|
danderson@11
|
76 |
ConditionVariable *wakeup() { |
|
danderson@11
|
77 |
return &wakeup_; |
|
danderson@11
|
78 |
} |
|
danderson@11
|
79 |
|
|
danderson@11
|
80 |
void terminate() { |
|
danderson@11
|
81 |
AutoLock lock(&wakeup_); |
|
danderson@11
|
82 |
terminate_ = true; |
|
danderson@11
|
83 |
wakeup_.Notify(); |
|
danderson@11
|
84 |
} |
|
danderson@11
|
85 |
|
|
danderson@11
|
86 |
int result() { |
|
danderson@11
|
87 |
return result_; |
|
danderson@11
|
88 |
} |
|
danderson@11
|
89 |
|
|
danderson@11
|
90 |
void send(int value) { |
|
danderson@11
|
91 |
AutoLock lock(&wakeup_); |
|
danderson@11
|
92 |
items_.append(value); |
|
danderson@11
|
93 |
wakeup_.Notify(); |
|
danderson@11
|
94 |
} |
|
danderson@11
|
95 |
|
|
danderson@11
|
96 |
private: |
|
danderson@11
|
97 |
ConditionVariable main_; |
|
danderson@11
|
98 |
ConditionVariable wakeup_; |
|
danderson@11
|
99 |
LinkedList<int> items_; |
|
danderson@11
|
100 |
bool terminate_; |
|
danderson@11
|
101 |
int result_; |
|
danderson@11
|
102 |
}; |
|
danderson@11
|
103 |
|
|
danderson@11
|
104 |
class TestThreading : public Test |
|
danderson@11
|
105 |
{ |
|
danderson@11
|
106 |
public: |
|
danderson@11
|
107 |
TestThreading() |
|
danderson@11
|
108 |
: Test("ThreadUtils") |
|
danderson@11
|
109 |
{ |
|
danderson@11
|
110 |
} |
|
danderson@11
|
111 |
|
|
danderson@11
|
112 |
bool testWorkerModel() |
|
danderson@11
|
113 |
{ |
|
danderson@11
|
114 |
TestWorkerModel test; |
|
danderson@11
|
115 |
ke::AutoPtr<Thread> thread(new Thread(&test, "TestWorkerModel")); |
|
danderson@11
|
116 |
if (!check(thread->Succeeded(), "thread launched")) |
|
danderson@11
|
117 |
return false; |
|
danderson@11
|
118 |
|
|
danderson@11
|
119 |
{ |
|
danderson@11
|
120 |
AutoLock lock(test.main()); |
|
danderson@11
|
121 |
if (!check(test.main()->Wait(5000) == Wait_Signaled, "thread started within five seconds")) |
|
danderson@11
|
122 |
return false; |
|
danderson@11
|
123 |
} |
|
danderson@11
|
124 |
|
|
danderson@11
|
125 |
int total = 0; |
|
danderson@11
|
126 |
for (int i = 0; i < 100000; i++) { |
|
danderson@11
|
127 |
test.send(i); |
|
danderson@11
|
128 |
total += i; |
|
danderson@11
|
129 |
} |
|
danderson@11
|
130 |
|
|
danderson@11
|
131 |
test.terminate(); |
|
danderson@11
|
132 |
thread->Join(); |
|
danderson@11
|
133 |
|
|
danderson@11
|
134 |
if (!check(test.result() == total, "thread returned correct result")) |
|
danderson@11
|
135 |
return false; |
|
danderson@11
|
136 |
|
|
danderson@11
|
137 |
return true; |
|
danderson@11
|
138 |
} |
|
danderson@11
|
139 |
|
|
danderson@11
|
140 |
bool Run() KE_OVERRIDE |
|
danderson@11
|
141 |
{ |
|
danderson@11
|
142 |
if (!testWorkerModel()) |
|
danderson@11
|
143 |
return false; |
|
danderson@11
|
144 |
return true; |
|
danderson@11
|
145 |
} |
|
danderson@11
|
146 |
} sTestThreading; |
|
danderson@11
|
147 |
|