| @@ -1,333 +1,333 | |||||
| 1 | using System; |
|
1 | using System; | |
| 2 | using Microsoft.VisualStudio.TestTools.UnitTesting; |
|
2 | using Microsoft.VisualStudio.TestTools.UnitTesting; | |
| 3 | using System.Reflection; |
|
3 | using System.Reflection; | |
| 4 | using System.Threading; |
|
4 | using System.Threading; | |
| 5 | using Implab.Parallels; |
|
5 | using Implab.Parallels; | |
| 6 |
|
6 | |||
| 7 | namespace Implab.Test { |
|
7 | namespace Implab.Test { | |
| 8 | [TestClass] |
|
8 | [TestClass] | |
| 9 | public class AsyncTests { |
|
9 | public class AsyncTests { | |
| 10 | [TestMethod] |
|
10 | [TestMethod] | |
| 11 | public void ResolveTest() { |
|
11 | public void ResolveTest() { | |
| 12 | int res = -1; |
|
12 | int res = -1; | |
| 13 | var p = new Promise<int>(); |
|
13 | var p = new Promise<int>(); | |
| 14 | p.Then(x => res = x); |
|
14 | p.Then(x => res = x); | |
| 15 | p.Resolve(100); |
|
15 | p.Resolve(100); | |
| 16 |
|
16 | |||
| 17 | Assert.AreEqual(100, res); |
|
17 | Assert.AreEqual(100, res); | |
| 18 | } |
|
18 | } | |
| 19 |
|
19 | |||
| 20 | [TestMethod] |
|
20 | [TestMethod] | |
| 21 | public void RejectTest() { |
|
21 | public void RejectTest() { | |
| 22 | int res = -1; |
|
22 | int res = -1; | |
| 23 | Exception err = null; |
|
23 | Exception err = null; | |
| 24 |
|
24 | |||
| 25 | var p = new Promise<int>(); |
|
25 | var p = new Promise<int>(); | |
| 26 | p.Then(x => res = x, e => err = e); |
|
26 | p.Then(x => res = x, e => err = e); | |
| 27 | p.Reject(new ApplicationException("error")); |
|
27 | p.Reject(new ApplicationException("error")); | |
| 28 |
|
28 | |||
| 29 | Assert.AreEqual(res, -1); |
|
29 | Assert.AreEqual(res, -1); | |
| 30 | Assert.AreEqual(err.Message, "error"); |
|
30 | Assert.AreEqual(err.Message, "error"); | |
| 31 |
|
31 | |||
| 32 | } |
|
32 | } | |
| 33 |
|
33 | |||
| 34 | [TestMethod] |
|
34 | [TestMethod] | |
| 35 | public void JoinSuccessTest() { |
|
35 | public void JoinSuccessTest() { | |
| 36 | var p = new Promise<int>(); |
|
36 | var p = new Promise<int>(); | |
| 37 | p.Resolve(100); |
|
37 | p.Resolve(100); | |
| 38 | Assert.AreEqual(p.Join(), 100); |
|
38 | Assert.AreEqual(p.Join(), 100); | |
| 39 | } |
|
39 | } | |
| 40 |
|
40 | |||
| 41 | [TestMethod] |
|
41 | [TestMethod] | |
| 42 | public void JoinFailTest() { |
|
42 | public void JoinFailTest() { | |
| 43 | var p = new Promise<int>(); |
|
43 | var p = new Promise<int>(); | |
| 44 | p.Reject(new ApplicationException("failed")); |
|
44 | p.Reject(new ApplicationException("failed")); | |
| 45 |
|
45 | |||
| 46 | try { |
|
46 | try { | |
| 47 | p.Join(); |
|
47 | p.Join(); | |
| 48 | throw new ApplicationException("WRONG!"); |
|
48 | throw new ApplicationException("WRONG!"); | |
| 49 | } catch (TargetInvocationException err) { |
|
49 | } catch (TargetInvocationException err) { | |
| 50 | Assert.AreEqual(err.InnerException.Message, "failed"); |
|
50 | Assert.AreEqual(err.InnerException.Message, "failed"); | |
| 51 | } catch { |
|
51 | } catch { | |
| 52 | Assert.Fail("Got wrong excaption"); |
|
52 | Assert.Fail("Got wrong excaption"); | |
| 53 | } |
|
53 | } | |
| 54 | } |
|
54 | } | |
| 55 |
|
55 | |||
| 56 | [TestMethod] |
|
56 | [TestMethod] | |
| 57 | public void MapTest() { |
|
57 | public void MapTest() { | |
| 58 | var p = new Promise<int>(); |
|
58 | var p = new Promise<int>(); | |
| 59 |
|
59 | |||
| 60 | var p2 = p.Map(x => x.ToString()); |
|
60 | var p2 = p.Map(x => x.ToString()); | |
| 61 | p.Resolve(100); |
|
61 | p.Resolve(100); | |
| 62 |
|
62 | |||
| 63 | Assert.AreEqual(p2.Join(), "100"); |
|
63 | Assert.AreEqual(p2.Join(), "100"); | |
| 64 | } |
|
64 | } | |
| 65 |
|
65 | |||
| 66 | [TestMethod] |
|
66 | [TestMethod] | |
| 67 | public void FixErrorTest() { |
|
67 | public void FixErrorTest() { | |
| 68 | var p = new Promise<int>(); |
|
68 | var p = new Promise<int>(); | |
| 69 |
|
69 | |||
| 70 | var p2 = p.Error(e => 101); |
|
70 | var p2 = p.Error(e => 101); | |
| 71 |
|
71 | |||
| 72 | p.Reject(new Exception()); |
|
72 | p.Reject(new Exception()); | |
| 73 |
|
73 | |||
| 74 | Assert.AreEqual(p2.Join(), 101); |
|
74 | Assert.AreEqual(p2.Join(), 101); | |
| 75 | } |
|
75 | } | |
| 76 |
|
76 | |||
| 77 | [TestMethod] |
|
77 | [TestMethod] | |
| 78 | public void ChainTest() { |
|
78 | public void ChainTest() { | |
| 79 | var p1 = new Promise<int>(); |
|
79 | var p1 = new Promise<int>(); | |
| 80 |
|
80 | |||
| 81 | var p3 = p1.Chain(x => { |
|
81 | var p3 = p1.Chain(x => { | |
| 82 | var p2 = new Promise<string>(); |
|
82 | var p2 = new Promise<string>(); | |
| 83 | p2.Resolve(x.ToString()); |
|
83 | p2.Resolve(x.ToString()); | |
| 84 | return p2; |
|
84 | return p2; | |
| 85 | }); |
|
85 | }); | |
| 86 |
|
86 | |||
| 87 | p1.Resolve(100); |
|
87 | p1.Resolve(100); | |
| 88 |
|
88 | |||
| 89 | Assert.AreEqual(p3.Join(), "100"); |
|
89 | Assert.AreEqual(p3.Join(), "100"); | |
| 90 | } |
|
90 | } | |
| 91 |
|
91 | |||
| 92 | [TestMethod] |
|
92 | [TestMethod] | |
| 93 | public void PoolTest() { |
|
93 | public void PoolTest() { | |
| 94 | var pid = Thread.CurrentThread.ManagedThreadId; |
|
94 | var pid = Thread.CurrentThread.ManagedThreadId; | |
| 95 | var p = AsyncPool.Invoke(() => Thread.CurrentThread.ManagedThreadId); |
|
95 | var p = AsyncPool.Invoke(() => Thread.CurrentThread.ManagedThreadId); | |
| 96 |
|
96 | |||
| 97 | Assert.AreNotEqual(pid, p.Join()); |
|
97 | Assert.AreNotEqual(pid, p.Join()); | |
| 98 | } |
|
98 | } | |
| 99 |
|
99 | |||
| 100 | [TestMethod] |
|
100 | [TestMethod] | |
| 101 | public void WorkerPoolSizeTest() { |
|
101 | public void WorkerPoolSizeTest() { | |
| 102 | var pool = new WorkerPool(5, 10, 0); |
|
102 | var pool = new WorkerPool(5, 10, 0); | |
| 103 |
|
103 | |||
| 104 |
Assert.AreEqual(5, pool. |
|
104 | Assert.AreEqual(5, pool.PoolSize); | |
| 105 |
|
105 | |||
| 106 | pool.Invoke(() => { Thread.Sleep(1000000); return 10; }); |
|
106 | pool.Invoke(() => { Thread.Sleep(1000000); return 10; }); | |
| 107 | pool.Invoke(() => { Thread.Sleep(1000000); return 10; }); |
|
107 | pool.Invoke(() => { Thread.Sleep(1000000); return 10; }); | |
| 108 | pool.Invoke(() => { Thread.Sleep(1000000); return 10; }); |
|
108 | pool.Invoke(() => { Thread.Sleep(1000000); return 10; }); | |
| 109 |
|
109 | |||
| 110 |
Assert.AreEqual(5, pool. |
|
110 | Assert.AreEqual(5, pool.PoolSize); | |
| 111 |
|
111 | |||
| 112 | for (int i = 0; i < 100; i++) |
|
112 | for (int i = 0; i < 100; i++) | |
| 113 | pool.Invoke(() => { Thread.Sleep(1000000); return 10; }); |
|
113 | pool.Invoke(() => { Thread.Sleep(1000000); return 10; }); | |
| 114 | Thread.Sleep(100); |
|
114 | Thread.Sleep(100); | |
| 115 |
Assert.AreEqual(10, pool. |
|
115 | Assert.AreEqual(10, pool.PoolSize); | |
| 116 |
|
116 | |||
| 117 | pool.Dispose(); |
|
117 | pool.Dispose(); | |
| 118 | } |
|
118 | } | |
| 119 |
|
119 | |||
| 120 | [TestMethod] |
|
120 | [TestMethod] | |
| 121 | public void WorkerPoolCorrectTest() { |
|
121 | public void WorkerPoolCorrectTest() { | |
| 122 | var pool = new WorkerPool(0,1000,100); |
|
122 | var pool = new WorkerPool(0,1000,100); | |
| 123 |
|
123 | |||
| 124 | int iterations = 1000; |
|
124 | int iterations = 1000; | |
| 125 | int pending = iterations; |
|
125 | int pending = iterations; | |
| 126 | var stop = new ManualResetEvent(false); |
|
126 | var stop = new ManualResetEvent(false); | |
| 127 |
|
127 | |||
| 128 | var count = 0; |
|
128 | var count = 0; | |
| 129 | for (int i = 0; i < iterations; i++) { |
|
129 | for (int i = 0; i < iterations; i++) { | |
| 130 | pool |
|
130 | pool | |
| 131 | .Invoke(() => 1) |
|
131 | .Invoke(() => 1) | |
| 132 | .Then(x => Interlocked.Add(ref count, x)) |
|
132 | .Then(x => Interlocked.Add(ref count, x)) | |
| 133 | .Then(x => Math.Log10(x)) |
|
133 | .Then(x => Math.Log10(x)) | |
| 134 | .Anyway(() => { |
|
134 | .Anyway(() => { | |
| 135 | Interlocked.Decrement(ref pending); |
|
135 | Interlocked.Decrement(ref pending); | |
| 136 | if (pending == 0) |
|
136 | if (pending == 0) | |
| 137 | stop.Set(); |
|
137 | stop.Set(); | |
| 138 | }); |
|
138 | }); | |
| 139 | } |
|
139 | } | |
| 140 |
|
140 | |||
| 141 | stop.WaitOne(); |
|
141 | stop.WaitOne(); | |
| 142 |
|
142 | |||
| 143 | Assert.AreEqual(iterations, count); |
|
143 | Assert.AreEqual(iterations, count); | |
| 144 | Console.WriteLine("Max threads: {0}", pool.MaxRunningThreads); |
|
144 | Console.WriteLine("Max threads: {0}", pool.MaxRunningThreads); | |
| 145 | pool.Dispose(); |
|
145 | pool.Dispose(); | |
| 146 |
|
146 | |||
| 147 | } |
|
147 | } | |
| 148 |
|
148 | |||
| 149 | [TestMethod] |
|
149 | [TestMethod] | |
| 150 | public void WorkerPoolDisposeTest() { |
|
150 | public void WorkerPoolDisposeTest() { | |
| 151 | var pool = new WorkerPool(5, 20); |
|
151 | var pool = new WorkerPool(5, 20); | |
| 152 |
Assert.AreEqual(5, pool. |
|
152 | Assert.AreEqual(5, pool.PoolSize); | |
| 153 | pool.Dispose(); |
|
153 | pool.Dispose(); | |
| 154 |
Thread.Sleep( |
|
154 | Thread.Sleep(200); | |
| 155 |
Assert.AreEqual(0, pool. |
|
155 | Assert.AreEqual(0, pool.PoolSize); | |
| 156 | pool.Dispose(); |
|
156 | pool.Dispose(); | |
| 157 | } |
|
157 | } | |
| 158 |
|
158 | |||
| 159 | [TestMethod] |
|
159 | [TestMethod] | |
| 160 | public void MTQueueTest() { |
|
160 | public void MTQueueTest() { | |
| 161 | var queue = new MTQueue<int>(); |
|
161 | var queue = new MTQueue<int>(); | |
| 162 | int res; |
|
162 | int res; | |
| 163 |
|
163 | |||
| 164 | queue.Enqueue(10); |
|
164 | queue.Enqueue(10); | |
| 165 | Assert.IsTrue(queue.TryDequeue(out res)); |
|
165 | Assert.IsTrue(queue.TryDequeue(out res)); | |
| 166 | Assert.AreEqual(10, res); |
|
166 | Assert.AreEqual(10, res); | |
| 167 | Assert.IsFalse(queue.TryDequeue(out res)); |
|
167 | Assert.IsFalse(queue.TryDequeue(out res)); | |
| 168 |
|
168 | |||
| 169 | for (int i = 0; i < 1000; i++) |
|
169 | for (int i = 0; i < 1000; i++) | |
| 170 | queue.Enqueue(i); |
|
170 | queue.Enqueue(i); | |
| 171 |
|
171 | |||
| 172 | for (int i = 0; i < 1000; i++) { |
|
172 | for (int i = 0; i < 1000; i++) { | |
| 173 | queue.TryDequeue(out res); |
|
173 | queue.TryDequeue(out res); | |
| 174 | Assert.AreEqual(i, res); |
|
174 | Assert.AreEqual(i, res); | |
| 175 | } |
|
175 | } | |
| 176 |
|
176 | |||
| 177 | int writers = 0; |
|
177 | int writers = 0; | |
| 178 | int readers = 0; |
|
178 | int readers = 0; | |
| 179 | var stop = new ManualResetEvent(false); |
|
179 | var stop = new ManualResetEvent(false); | |
| 180 | int total = 0; |
|
180 | int total = 0; | |
| 181 |
|
181 | |||
| 182 | int itemsPerWriter = 1000; |
|
182 | int itemsPerWriter = 1000; | |
| 183 | int writersCount = 3; |
|
183 | int writersCount = 3; | |
| 184 |
|
184 | |||
| 185 | for (int i = 0; i < writersCount; i++) { |
|
185 | for (int i = 0; i < writersCount; i++) { | |
| 186 | Interlocked.Increment(ref writers); |
|
186 | Interlocked.Increment(ref writers); | |
| 187 | var wn = i; |
|
187 | var wn = i; | |
| 188 | AsyncPool |
|
188 | AsyncPool | |
| 189 | .InvokeNewThread(() => { |
|
189 | .InvokeNewThread(() => { | |
| 190 | for (int ii = 0; ii < itemsPerWriter; ii++) { |
|
190 | for (int ii = 0; ii < itemsPerWriter; ii++) { | |
| 191 | queue.Enqueue(1); |
|
191 | queue.Enqueue(1); | |
| 192 | } |
|
192 | } | |
| 193 | return 1; |
|
193 | return 1; | |
| 194 | }) |
|
194 | }) | |
| 195 | .Anyway(() => Interlocked.Decrement(ref writers)); |
|
195 | .Anyway(() => Interlocked.Decrement(ref writers)); | |
| 196 | } |
|
196 | } | |
| 197 |
|
197 | |||
| 198 | for (int i = 0; i < 10; i++) { |
|
198 | for (int i = 0; i < 10; i++) { | |
| 199 | Interlocked.Increment(ref readers); |
|
199 | Interlocked.Increment(ref readers); | |
| 200 | var wn = i; |
|
200 | var wn = i; | |
| 201 | AsyncPool |
|
201 | AsyncPool | |
| 202 | .InvokeNewThread(() => { |
|
202 | .InvokeNewThread(() => { | |
| 203 | int t; |
|
203 | int t; | |
| 204 | do { |
|
204 | do { | |
| 205 | while (queue.TryDequeue(out t)) |
|
205 | while (queue.TryDequeue(out t)) | |
| 206 | Interlocked.Add(ref total, t); |
|
206 | Interlocked.Add(ref total, t); | |
| 207 | } while (writers > 0); |
|
207 | } while (writers > 0); | |
| 208 | return 1; |
|
208 | return 1; | |
| 209 | }) |
|
209 | }) | |
| 210 | .Anyway(() => { |
|
210 | .Anyway(() => { | |
| 211 | Interlocked.Decrement(ref readers); |
|
211 | Interlocked.Decrement(ref readers); | |
| 212 | if (readers == 0) |
|
212 | if (readers == 0) | |
| 213 | stop.Set(); |
|
213 | stop.Set(); | |
| 214 | }); |
|
214 | }); | |
| 215 | } |
|
215 | } | |
| 216 |
|
216 | |||
| 217 | stop.WaitOne(); |
|
217 | stop.WaitOne(); | |
| 218 |
|
218 | |||
| 219 | Assert.AreEqual(itemsPerWriter * writersCount, total); |
|
219 | Assert.AreEqual(itemsPerWriter * writersCount, total); | |
| 220 | } |
|
220 | } | |
| 221 |
|
221 | |||
| 222 | [TestMethod] |
|
222 | [TestMethod] | |
| 223 | public void ParallelMapTest() { |
|
223 | public void ParallelMapTest() { | |
| 224 |
|
224 | |||
| 225 | int count = 100000; |
|
225 | int count = 100000; | |
| 226 |
|
226 | |||
| 227 | double[] args = new double[count]; |
|
227 | double[] args = new double[count]; | |
| 228 | var rand = new Random(); |
|
228 | var rand = new Random(); | |
| 229 |
|
229 | |||
| 230 | for (int i = 0; i < count; i++) |
|
230 | for (int i = 0; i < count; i++) | |
| 231 | args[i] = rand.NextDouble(); |
|
231 | args[i] = rand.NextDouble(); | |
| 232 |
|
232 | |||
| 233 | var t = Environment.TickCount; |
|
233 | var t = Environment.TickCount; | |
| 234 | var res = args.ParallelMap(x => Math.Sin(x*x), 4).Join(); |
|
234 | var res = args.ParallelMap(x => Math.Sin(x*x), 4).Join(); | |
| 235 |
|
235 | |||
| 236 | Console.WriteLine("Map complete in {0} ms", Environment.TickCount - t); |
|
236 | Console.WriteLine("Map complete in {0} ms", Environment.TickCount - t); | |
| 237 |
|
237 | |||
| 238 | t = Environment.TickCount; |
|
238 | t = Environment.TickCount; | |
| 239 | for (int i = 0; i < count; i++) |
|
239 | for (int i = 0; i < count; i++) | |
| 240 | Assert.AreEqual(Math.Sin(args[i] * args[i]), res[i]); |
|
240 | Assert.AreEqual(Math.Sin(args[i] * args[i]), res[i]); | |
| 241 | Console.WriteLine("Verified in {0} ms", Environment.TickCount - t); |
|
241 | Console.WriteLine("Verified in {0} ms", Environment.TickCount - t); | |
| 242 | } |
|
242 | } | |
| 243 |
|
243 | |||
| 244 | [TestMethod] |
|
244 | [TestMethod] | |
| 245 | public void ChainedMapTest() { |
|
245 | public void ChainedMapTest() { | |
| 246 |
|
246 | |||
| 247 |
using (var pool = new WorkerPool( |
|
247 | using (var pool = new WorkerPool(0,100,0)) { | |
| 248 | int count = 10000; |
|
248 | int count = 10000; | |
| 249 |
|
249 | |||
| 250 | double[] args = new double[count]; |
|
250 | double[] args = new double[count]; | |
| 251 | var rand = new Random(); |
|
251 | var rand = new Random(); | |
| 252 |
|
252 | |||
| 253 | for (int i = 0; i < count; i++) |
|
253 | for (int i = 0; i < count; i++) | |
| 254 | args[i] = rand.NextDouble(); |
|
254 | args[i] = rand.NextDouble(); | |
| 255 |
|
255 | |||
| 256 | var t = Environment.TickCount; |
|
256 | var t = Environment.TickCount; | |
| 257 | var res = args |
|
257 | var res = args | |
| 258 | .ChainedMap( |
|
258 | .ChainedMap( | |
| 259 | x => pool.Invoke( |
|
259 | x => pool.Invoke( | |
| 260 | () => Math.Sin(x * x) |
|
260 | () => Math.Sin(x * x) | |
| 261 | ), |
|
261 | ), | |
| 262 | 4 |
|
262 | 4 | |
| 263 | ) |
|
263 | ) | |
| 264 | .Join(); |
|
264 | .Join(); | |
| 265 |
|
265 | |||
| 266 | Console.WriteLine("Map complete in {0} ms", Environment.TickCount - t); |
|
266 | Console.WriteLine("Map complete in {0} ms", Environment.TickCount - t); | |
| 267 |
|
267 | |||
| 268 | t = Environment.TickCount; |
|
268 | t = Environment.TickCount; | |
| 269 | for (int i = 0; i < count; i++) |
|
269 | for (int i = 0; i < count; i++) | |
| 270 | Assert.AreEqual(Math.Sin(args[i] * args[i]), res[i]); |
|
270 | Assert.AreEqual(Math.Sin(args[i] * args[i]), res[i]); | |
| 271 | Console.WriteLine("Verified in {0} ms", Environment.TickCount - t); |
|
271 | Console.WriteLine("Verified in {0} ms", Environment.TickCount - t); | |
| 272 | Console.WriteLine("Max workers: {0}", pool.MaxRunningThreads); |
|
272 | Console.WriteLine("Max workers: {0}", pool.MaxRunningThreads); | |
| 273 | } |
|
273 | } | |
| 274 | } |
|
274 | } | |
| 275 |
|
275 | |||
| 276 | [TestMethod] |
|
276 | [TestMethod] | |
| 277 | public void ParallelForEachTest() { |
|
277 | public void ParallelForEachTest() { | |
| 278 |
|
278 | |||
| 279 | int count = 100000; |
|
279 | int count = 100000; | |
| 280 |
|
280 | |||
| 281 | int[] args = new int[count]; |
|
281 | int[] args = new int[count]; | |
| 282 | var rand = new Random(); |
|
282 | var rand = new Random(); | |
| 283 |
|
283 | |||
| 284 | for (int i = 0; i < count; i++) |
|
284 | for (int i = 0; i < count; i++) | |
| 285 | args[i] = (int)(rand.NextDouble() * 100); |
|
285 | args[i] = (int)(rand.NextDouble() * 100); | |
| 286 |
|
286 | |||
| 287 | int result = 0; |
|
287 | int result = 0; | |
| 288 |
|
288 | |||
| 289 | var t = Environment.TickCount; |
|
289 | var t = Environment.TickCount; | |
| 290 | args.ParallelForEach(x => Interlocked.Add(ref result, x), 4).Join(); |
|
290 | args.ParallelForEach(x => Interlocked.Add(ref result, x), 4).Join(); | |
| 291 |
|
291 | |||
| 292 | Console.WriteLine("Iteration complete in {0} ms, result: {1}", Environment.TickCount - t, result); |
|
292 | Console.WriteLine("Iteration complete in {0} ms, result: {1}", Environment.TickCount - t, result); | |
| 293 |
|
293 | |||
| 294 | int result2 = 0; |
|
294 | int result2 = 0; | |
| 295 |
|
295 | |||
| 296 | t = Environment.TickCount; |
|
296 | t = Environment.TickCount; | |
| 297 | for (int i = 0; i < count; i++) |
|
297 | for (int i = 0; i < count; i++) | |
| 298 | result2 += args[i]; |
|
298 | result2 += args[i]; | |
| 299 | Assert.AreEqual(result2, result); |
|
299 | Assert.AreEqual(result2, result); | |
| 300 | Console.WriteLine("Verified in {0} ms", Environment.TickCount - t); |
|
300 | Console.WriteLine("Verified in {0} ms", Environment.TickCount - t); | |
| 301 | } |
|
301 | } | |
| 302 |
|
302 | |||
| 303 | [TestMethod] |
|
303 | [TestMethod] | |
| 304 | public void ComplexCase1Test() { |
|
304 | public void ComplexCase1Test() { | |
| 305 | var flags = new bool[3]; |
|
305 | var flags = new bool[3]; | |
| 306 |
|
306 | |||
| 307 | // op1 (aync 200ms) => op2 (async 200ms) => op3 (sync map) |
|
307 | // op1 (aync 200ms) => op2 (async 200ms) => op3 (sync map) | |
| 308 |
|
308 | |||
| 309 | var p = PromiseHelper |
|
309 | var p = PromiseHelper | |
| 310 | .Sleep(200, "Alan") |
|
310 | .Sleep(200, "Alan") | |
| 311 | .Cancelled(() => flags[0] = true) |
|
311 | .Cancelled(() => flags[0] = true) | |
| 312 | .Chain(x => |
|
312 | .Chain(x => | |
| 313 | PromiseHelper |
|
313 | PromiseHelper | |
| 314 | .Sleep(200, "Hi, " + x) |
|
314 | .Sleep(200, "Hi, " + x) | |
| 315 | .Map(y => y) |
|
315 | .Map(y => y) | |
| 316 | .Cancelled(() => flags[1] = true) |
|
316 | .Cancelled(() => flags[1] = true) | |
| 317 | ) |
|
317 | ) | |
| 318 | .Cancelled(() => flags[2] = true); |
|
318 | .Cancelled(() => flags[2] = true); | |
| 319 | Thread.Sleep(300); |
|
319 | Thread.Sleep(300); | |
| 320 | p.Cancel(); |
|
320 | p.Cancel(); | |
| 321 | try { |
|
321 | try { | |
| 322 | Assert.AreEqual(p.Join(), "Hi, Alan"); |
|
322 | Assert.AreEqual(p.Join(), "Hi, Alan"); | |
| 323 | Assert.Fail("Shouldn't get here"); |
|
323 | Assert.Fail("Shouldn't get here"); | |
| 324 | } catch (OperationCanceledException) { |
|
324 | } catch (OperationCanceledException) { | |
| 325 | } |
|
325 | } | |
| 326 |
|
326 | |||
| 327 | Assert.IsFalse(flags[0]); |
|
327 | Assert.IsFalse(flags[0]); | |
| 328 | Assert.IsTrue(flags[1]); |
|
328 | Assert.IsTrue(flags[1]); | |
| 329 | Assert.IsTrue(flags[2]); |
|
329 | Assert.IsTrue(flags[2]); | |
| 330 | } |
|
330 | } | |
| 331 | } |
|
331 | } | |
| 332 | } |
|
332 | } | |
| 333 |
|
333 | |||
| 1 | NO CONTENT: modified file, binary diff hidden |
|
NO CONTENT: modified file, binary diff hidden |
| @@ -1,238 +1,279 | |||||
| 1 | using System; |
|
1 | using System; | |
| 2 | using System.Collections.Generic; |
|
2 | using System.Collections.Generic; | |
| 3 | using System.Linq; |
|
3 | using System.Linq; | |
| 4 | using System.Text; |
|
4 | using System.Text; | |
| 5 | using System.Threading; |
|
5 | using System.Threading; | |
| 6 | using System.Diagnostics; |
|
6 | using System.Diagnostics; | |
| 7 |
|
7 | |||
| 8 | namespace Implab.Parallels { |
|
8 | namespace Implab.Parallels { | |
| 9 | public abstract class DispatchPool<TUnit> : IDisposable { |
|
9 | public abstract class DispatchPool<TUnit> : IDisposable { | |
| 10 | readonly int m_minThreads; |
|
10 | readonly int m_minThreads; | |
| 11 | readonly int m_maxThreads; |
|
11 | readonly int m_maxThreads; | |
| 12 |
int m_ |
|
12 | int m_createdThreads = 0; | |
|
|
13 | int m_activeThreads = 0; | |||
|
|
14 | int m_sleepingThreads = 0; | |||
| 13 | int m_maxRunningThreads = 0; |
|
15 | int m_maxRunningThreads = 0; | |
| 14 | int m_suspended = 0; |
|
|||
| 15 | int m_exitRequired = 0; |
|
16 | int m_exitRequired = 0; | |
|
|
17 | int m_releaseTimeout = 100; // timeout while the working thread will wait for the new tasks before exit | |||
| 16 | AutoResetEvent m_hasTasks = new AutoResetEvent(false); |
|
18 | AutoResetEvent m_hasTasks = new AutoResetEvent(false); | |
| 17 |
|
19 | |||
| 18 | protected DispatchPool(int min, int max) { |
|
20 | protected DispatchPool(int min, int max) { | |
| 19 | if (min < 0) |
|
21 | if (min < 0) | |
| 20 | throw new ArgumentOutOfRangeException("min"); |
|
22 | throw new ArgumentOutOfRangeException("min"); | |
| 21 | if (max <= 0) |
|
23 | if (max <= 0) | |
| 22 | throw new ArgumentOutOfRangeException("max"); |
|
24 | throw new ArgumentOutOfRangeException("max"); | |
| 23 |
|
25 | |||
| 24 | if (min > max) |
|
26 | if (min > max) | |
| 25 | min = max; |
|
27 | min = max; | |
| 26 | m_minThreads = min; |
|
28 | m_minThreads = min; | |
| 27 | m_maxThreads = max; |
|
29 | m_maxThreads = max; | |
| 28 | } |
|
30 | } | |
| 29 |
|
31 | |||
| 30 | protected DispatchPool(int threads) |
|
32 | protected DispatchPool(int threads) | |
| 31 | : this(threads, threads) { |
|
33 | : this(threads, threads) { | |
| 32 | } |
|
34 | } | |
| 33 |
|
35 | |||
| 34 | protected DispatchPool() { |
|
36 | protected DispatchPool() { | |
| 35 | int maxThreads, maxCP; |
|
37 | int maxThreads, maxCP; | |
| 36 | ThreadPool.GetMaxThreads(out maxThreads, out maxCP); |
|
38 | ThreadPool.GetMaxThreads(out maxThreads, out maxCP); | |
| 37 |
|
39 | |||
| 38 | m_minThreads = 0; |
|
40 | m_minThreads = 0; | |
| 39 | m_maxThreads = maxThreads; |
|
41 | m_maxThreads = maxThreads; | |
| 40 | } |
|
42 | } | |
| 41 |
|
43 | |||
| 42 | protected void InitPool() { |
|
44 | protected void InitPool() { | |
| 43 | for (int i = 0; i < m_minThreads; i++) |
|
45 | for (int i = 0; i < m_minThreads; i++) | |
| 44 | StartWorker(); |
|
46 | StartWorker(); | |
| 45 | } |
|
47 | } | |
| 46 |
|
48 | |||
| 47 |
public int |
|
49 | public int PoolSize { | |
| 48 | get { |
|
50 | get { | |
| 49 |
return m_ |
|
51 | return m_createdThreads; | |
|
|
52 | } | |||
|
|
53 | } | |||
|
|
54 | ||||
|
|
55 | public int ActiveThreads { | |||
|
|
56 | get { | |||
|
|
57 | return m_activeThreads; | |||
| 50 | } |
|
58 | } | |
| 51 | } |
|
59 | } | |
| 52 |
|
60 | |||
| 53 | public int MaxRunningThreads { |
|
61 | public int MaxRunningThreads { | |
| 54 | get { |
|
62 | get { | |
| 55 | return m_maxRunningThreads; |
|
63 | return m_maxRunningThreads; | |
| 56 | } |
|
64 | } | |
| 57 | } |
|
65 | } | |
| 58 |
|
66 | |||
| 59 | protected bool IsDisposed { |
|
67 | protected bool IsDisposed { | |
| 60 | get { |
|
68 | get { | |
| 61 | return m_exitRequired != 0; |
|
69 | return m_exitRequired != 0; | |
| 62 | } |
|
70 | } | |
| 63 | } |
|
71 | } | |
| 64 |
|
72 | |||
| 65 | protected abstract bool TryDequeue(out TUnit unit); |
|
73 | protected abstract bool TryDequeue(out TUnit unit); | |
| 66 |
|
74 | |||
| 67 | protected virtual bool ExtendPool() { |
|
75 | protected virtual bool ExtendPool() { | |
| 68 |
if (m_s |
|
76 | if (m_sleepingThreads == 0) | |
| 69 | m_hasTasks.Set(); |
|
77 | // no sleeping workers are available | |
|
|
78 | // try create one | |||
|
|
79 | return StartWorker(); | |||
|
|
80 | else { | |||
|
|
81 | // we can get here a race condition when several threads asks to extend pool | |||
|
|
82 | // and some sleaping threads are exited due timeout but they are still counted as sleeping | |||
|
|
83 | // in that case all of this threads could exit except one | |||
|
|
84 | WakePool(); | |||
| 70 | return true; |
|
85 | return true; | |
| 71 |
} |
|
86 | } | |
| 72 | return StartWorker(); |
|
87 | ||
| 73 | } |
|
88 | } | |
| 74 |
|
89 | |||
| 75 | /// <summary> |
|
90 | /// <summary> | |
| 76 | /// ΠΠ°ΠΏΡΡΠΊΠ°Π΅Ρ Π»ΠΈΠ±ΠΎ Π½ΠΎΠ²ΡΠΉ ΠΏΠΎΡΠΎΠΊ, Π΅ΡΠ»ΠΈ ΡΠ°Π½ΡΡΠ΅ Π½Π΅ Π±ΡΠ»ΠΎ Π½ΠΈ ΠΎΠ΄Π½ΠΎΠ³ΠΎ ΠΏΠΎΡΠΎΠΊΠ°, Π»ΠΈΠ±ΠΎ ΡΡΡΠ°Π½Π°Π²Π»ΠΈΠ²Π°Π΅Ρ ΡΠΎΠ±ΡΡΠΈΠ΅ ΠΏΡΠΎΠ±ΡΠΆΠ΄Π΅Π½ΠΈΠ΅ ΠΎΠ΄Π½ΠΎΠ³ΠΎ ΡΠΏΡΡΠ΅Π³ΠΎ ΠΏΠΎΡΠΎΠΊΠ° |
|
91 | /// ΠΠ°ΠΏΡΡΠΊΠ°Π΅Ρ Π»ΠΈΠ±ΠΎ Π½ΠΎΠ²ΡΠΉ ΠΏΠΎΡΠΎΠΊ, Π΅ΡΠ»ΠΈ ΡΠ°Π½ΡΡΠ΅ Π½Π΅ Π±ΡΠ»ΠΎ Π½ΠΈ ΠΎΠ΄Π½ΠΎΠ³ΠΎ ΠΏΠΎΡΠΎΠΊΠ°, Π»ΠΈΠ±ΠΎ ΡΡΡΠ°Π½Π°Π²Π»ΠΈΠ²Π°Π΅Ρ ΡΠΎΠ±ΡΡΠΈΠ΅ ΠΏΡΠΎΠ±ΡΠΆΠ΄Π΅Π½ΠΈΠ΅ ΠΎΠ΄Π½ΠΎΠ³ΠΎ ΡΠΏΡΡΠ΅Π³ΠΎ ΠΏΠΎΡΠΎΠΊΠ° | |
| 77 | /// </summary> |
|
92 | /// </summary> | |
| 78 | protected void WakePool() { |
|
93 | protected void WakePool() { | |
| 79 | m_hasTasks.Set(); // wake sleeping thread; |
|
94 | m_hasTasks.Set(); // wake sleeping thread; | |
| 80 |
|
95 | |||
| 81 | if (AllocateThreadSlot(1)) { |
|
96 | if (AllocateThreadSlot(1)) { | |
|
|
97 | // if there were no threads in the pool | |||
| 82 | var worker = new Thread(this.Worker); |
|
98 | var worker = new Thread(this.Worker); | |
| 83 | worker.IsBackground = true; |
|
99 | worker.IsBackground = true; | |
| 84 | worker.Start(); |
|
100 | worker.Start(); | |
| 85 | } |
|
101 | } | |
| 86 | } |
|
102 | } | |
| 87 |
|
103 | |||
| 88 | protected virtual void Suspend() { |
|
104 | bool Sleep(int timeout) { | |
| 89 | m_hasTasks.WaitOne(); |
|
105 | Interlocked.Increment(ref m_sleepingThreads); | |
|
|
106 | var result = m_hasTasks.WaitOne(timeout); | |||
|
|
107 | Interlocked.Decrement(ref m_sleepingThreads); | |||
|
|
108 | return result; | |||
|
|
109 | } | |||
|
|
110 | ||||
|
|
111 | protected virtual bool Suspend() { | |||
|
|
112 | //no tasks left, exit if the thread is no longer needed | |||
|
|
113 | bool last; | |||
|
|
114 | bool requestExit; | |||
|
|
115 | ||||
|
|
116 | if (m_releaseTimeout > 0) | |||
|
|
117 | requestExit = !Sleep(m_releaseTimeout); | |||
|
|
118 | else | |||
|
|
119 | requestExit = true; | |||
|
|
120 | ||||
|
|
121 | ||||
|
|
122 | if (requestExit && ReleaseThreadSlot(out last)) { | |||
|
|
123 | // in case at the moment the last thread was being released | |||
|
|
124 | // a new task was added to the queue, we need to try | |||
|
|
125 | // to revoke the thread to avoid the situation when the task is left unprocessed | |||
|
|
126 | if (last && m_hasTasks.WaitOne(0)) { | |||
|
|
127 | if (AllocateThreadSlot(1)) | |||
|
|
128 | return true; // spin again... | |||
|
|
129 | else | |||
|
|
130 | // we failed to reallocate the first slot for this thread | |||
|
|
131 | // therefore we need to release the event | |||
|
|
132 | m_hasTasks.Set(); | |||
|
|
133 | } | |||
|
|
134 | ||||
|
|
135 | return false; | |||
|
|
136 | } | |||
|
|
137 | ||||
|
|
138 | Sleep(-1); | |||
|
|
139 | ||||
|
|
140 | return true; | |||
| 90 | } |
|
141 | } | |
| 91 |
|
142 | |||
| 92 | #region thread slots traits |
|
143 | #region thread slots traits | |
| 93 |
|
144 | |||
| 94 | bool AllocateThreadSlot() { |
|
145 | bool AllocateThreadSlot() { | |
| 95 | int current; |
|
146 | int current; | |
| 96 | // use spins to allocate slot for the new thread |
|
147 | // use spins to allocate slot for the new thread | |
| 97 | do { |
|
148 | do { | |
| 98 |
current = m_ |
|
149 | current = m_createdThreads; | |
| 99 | if (current >= m_maxThreads || m_exitRequired != 0) |
|
150 | if (current >= m_maxThreads || m_exitRequired != 0) | |
| 100 | // no more slots left or the pool has been disposed |
|
151 | // no more slots left or the pool has been disposed | |
| 101 | return false; |
|
152 | return false; | |
| 102 |
} while (current != Interlocked.CompareExchange(ref m_ |
|
153 | } while (current != Interlocked.CompareExchange(ref m_createdThreads, current + 1, current)); | |
| 103 |
|
154 | |||
| 104 | UpdateMaxThreads(current + 1); |
|
155 | UpdateMaxThreads(current + 1); | |
| 105 |
|
156 | |||
| 106 | return true; |
|
157 | return true; | |
| 107 | } |
|
158 | } | |
| 108 |
|
159 | |||
| 109 | bool AllocateThreadSlot(int desired) { |
|
160 | bool AllocateThreadSlot(int desired) { | |
| 110 |
if (desired - 1 != Interlocked.CompareExchange(ref m_ |
|
161 | if (desired - 1 != Interlocked.CompareExchange(ref m_createdThreads, desired, desired - 1)) | |
| 111 | return false; |
|
162 | return false; | |
| 112 |
|
163 | |||
| 113 | UpdateMaxThreads(desired); |
|
164 | UpdateMaxThreads(desired); | |
| 114 |
|
165 | |||
| 115 | return true; |
|
166 | return true; | |
| 116 | } |
|
167 | } | |
| 117 |
|
168 | |||
| 118 | bool ReleaseThreadSlot(out bool last) { |
|
169 | bool ReleaseThreadSlot(out bool last) { | |
| 119 | last = false; |
|
170 | last = false; | |
| 120 | int current; |
|
171 | int current; | |
| 121 | // use spins to release slot for the new thread |
|
172 | // use spins to release slot for the new thread | |
| 122 | do { |
|
173 | do { | |
| 123 |
current = m_ |
|
174 | current = m_createdThreads; | |
| 124 | if (current <= m_minThreads && m_exitRequired == 0) |
|
175 | if (current <= m_minThreads && m_exitRequired == 0) | |
| 125 | // the thread is reserved |
|
176 | // the thread is reserved | |
| 126 | return false; |
|
177 | return false; | |
| 127 |
} while (current != Interlocked.CompareExchange(ref m_ |
|
178 | } while (current != Interlocked.CompareExchange(ref m_createdThreads, current - 1, current)); | |
| 128 |
|
179 | |||
| 129 | last = (current == 1); |
|
180 | last = (current == 1); | |
| 130 |
|
181 | |||
| 131 | return true; |
|
182 | return true; | |
| 132 | } |
|
183 | } | |
| 133 |
|
184 | |||
| 134 | /// <summary> |
|
185 | /// <summary> | |
| 135 | /// releases thread slot unconditionally, used during cleanup |
|
186 | /// releases thread slot unconditionally, used during cleanup | |
| 136 | /// </summary> |
|
187 | /// </summary> | |
| 137 | /// <returns>true - no more threads left</returns> |
|
188 | /// <returns>true - no more threads left</returns> | |
| 138 | bool ReleaseThreadSlotAnyway() { |
|
189 | bool ReleaseThreadSlotAnyway() { | |
| 139 |
var left = Interlocked.Decrement(ref m_ |
|
190 | var left = Interlocked.Decrement(ref m_createdThreads); | |
| 140 | return left == 0; |
|
191 | return left == 0; | |
| 141 | } |
|
192 | } | |
| 142 |
|
193 | |||
| 143 | void UpdateMaxThreads(int count) { |
|
194 | void UpdateMaxThreads(int count) { | |
| 144 | int max; |
|
195 | int max; | |
| 145 | do { |
|
196 | do { | |
| 146 | max = m_maxRunningThreads; |
|
197 | max = m_maxRunningThreads; | |
| 147 | if (max >= count) |
|
198 | if (max >= count) | |
| 148 | break; |
|
199 | break; | |
| 149 | } while(max != Interlocked.CompareExchange(ref m_maxRunningThreads, count, max)); |
|
200 | } while(max != Interlocked.CompareExchange(ref m_maxRunningThreads, count, max)); | |
| 150 | } |
|
201 | } | |
| 151 |
|
202 | |||
| 152 | #endregion |
|
203 | #endregion | |
| 153 |
|
204 | |||
| 154 | bool StartWorker() { |
|
205 | bool StartWorker() { | |
| 155 | if (AllocateThreadSlot()) { |
|
206 | if (AllocateThreadSlot()) { | |
| 156 | // slot successfully allocated |
|
207 | // slot successfully allocated | |
| 157 | var worker = new Thread(this.Worker); |
|
208 | var worker = new Thread(this.Worker); | |
| 158 | worker.IsBackground = true; |
|
209 | worker.IsBackground = true; | |
| 159 | worker.Start(); |
|
210 | worker.Start(); | |
| 160 |
|
211 | |||
| 161 | return true; |
|
212 | return true; | |
| 162 | } else { |
|
213 | } else { | |
| 163 | return false; |
|
214 | return false; | |
| 164 | } |
|
215 | } | |
| 165 | } |
|
216 | } | |
| 166 |
|
217 | |||
| 167 | bool FetchTask(out TUnit unit) { |
|
218 | bool FetchTask(out TUnit unit) { | |
| 168 | do { |
|
219 | do { | |
| 169 | // exit if requested |
|
220 | // exit if requested | |
| 170 | if (m_exitRequired != 0) { |
|
221 | if (m_exitRequired != 0) { | |
| 171 | // release the thread slot |
|
222 | // release the thread slot | |
|
|
223 | Interlocked.Decrement(ref m_activeThreads); | |||
| 172 | if (ReleaseThreadSlotAnyway()) // it was the last worker |
|
224 | if (ReleaseThreadSlotAnyway()) // it was the last worker | |
| 173 | m_hasTasks.Dispose(); |
|
225 | m_hasTasks.Dispose(); | |
| 174 | else |
|
226 | else | |
| 175 | m_hasTasks.Set(); // wake next worker |
|
227 | m_hasTasks.Set(); // wake next worker | |
| 176 | unit = default(TUnit); |
|
228 | unit = default(TUnit); | |
| 177 | return false; |
|
229 | return false; | |
| 178 | } |
|
230 | } | |
| 179 |
|
231 | |||
| 180 | // fetch task |
|
232 | // fetch task | |
| 181 | if (TryDequeue(out unit)) { |
|
233 | if (TryDequeue(out unit)) { | |
| 182 | ExtendPool(); |
|
234 | ExtendPool(); | |
| 183 | return true; |
|
235 | return true; | |
| 184 | } |
|
236 | } | |
| 185 |
|
237 | |||
| 186 | //no tasks left, exit if the thread is no longer needed |
|
238 | Interlocked.Decrement(ref m_activeThreads); | |
| 187 | bool last; |
|
|||
| 188 | if (ReleaseThreadSlot(out last)) { |
|
|||
| 189 | if (last && m_hasTasks.WaitOne(0)) { |
|
|||
| 190 | if (AllocateThreadSlot(1)) |
|
|||
| 191 | continue; // spin again... |
|
|||
| 192 | else |
|
|||
| 193 | // we failed to reallocate slot for this thread |
|
|||
| 194 | // therefore we need to release the event |
|
|||
| 195 | m_hasTasks.Set(); |
|
|||
| 196 | } |
|
|||
| 197 |
|
||||
| 198 | return false; |
|
|||
| 199 | } |
|
|||
| 200 |
|
239 | |||
| 201 | // entering suspend state |
|
240 | // entering suspend state | |
| 202 | Interlocked.Increment(ref m_suspended); |
|
|||
| 203 | // keep this thread and wait |
|
241 | // keep this thread and wait | |
| 204 |
Suspend() |
|
242 | if (!Suspend()) | |
| 205 | Interlocked.Decrement(ref m_suspended); |
|
243 | return false; | |
|
|
244 | ||||
|
|
245 | Interlocked.Increment(ref m_activeThreads); | |||
| 206 | } while (true); |
|
246 | } while (true); | |
| 207 | } |
|
247 | } | |
| 208 |
|
248 | |||
| 209 | protected abstract void InvokeUnit(TUnit unit); |
|
249 | protected abstract void InvokeUnit(TUnit unit); | |
| 210 |
|
250 | |||
| 211 | void Worker() { |
|
251 | void Worker() { | |
| 212 | TUnit unit; |
|
252 | TUnit unit; | |
|
|
253 | Interlocked.Increment(ref m_activeThreads); | |||
| 213 | while (FetchTask(out unit)) |
|
254 | while (FetchTask(out unit)) | |
| 214 | InvokeUnit(unit); |
|
255 | InvokeUnit(unit); | |
| 215 | } |
|
256 | } | |
| 216 |
|
257 | |||
| 217 | protected virtual void Dispose(bool disposing) { |
|
258 | protected virtual void Dispose(bool disposing) { | |
| 218 | if (disposing) { |
|
259 | if (disposing) { | |
| 219 | if (m_exitRequired == 0) { |
|
260 | if (m_exitRequired == 0) { | |
| 220 | if (Interlocked.CompareExchange(ref m_exitRequired, 1, 0) != 0) |
|
261 | if (Interlocked.CompareExchange(ref m_exitRequired, 1, 0) != 0) | |
| 221 | return; |
|
262 | return; | |
| 222 |
|
263 | |||
| 223 | // wake sleeping threads |
|
264 | // wake sleeping threads | |
| 224 | m_hasTasks.Set(); |
|
265 | m_hasTasks.Set(); | |
| 225 | GC.SuppressFinalize(this); |
|
266 | GC.SuppressFinalize(this); | |
| 226 | } |
|
267 | } | |
| 227 | } |
|
268 | } | |
| 228 | } |
|
269 | } | |
| 229 |
|
270 | |||
| 230 | public void Dispose() { |
|
271 | public void Dispose() { | |
| 231 | Dispose(true); |
|
272 | Dispose(true); | |
| 232 | } |
|
273 | } | |
| 233 |
|
274 | |||
| 234 | ~DispatchPool() { |
|
275 | ~DispatchPool() { | |
| 235 | Dispose(false); |
|
276 | Dispose(false); | |
| 236 | } |
|
277 | } | |
| 237 | } |
|
278 | } | |
| 238 | } |
|
279 | } | |
| @@ -1,89 +1,90 | |||||
| 1 | using System; |
|
1 | using System; | |
| 2 | using System.Collections.Generic; |
|
2 | using System.Collections.Generic; | |
| 3 | using System.Linq; |
|
3 | using System.Linq; | |
| 4 | using System.Text; |
|
4 | using System.Text; | |
| 5 | using System.Threading; |
|
5 | using System.Threading; | |
| 6 | using System.Diagnostics; |
|
6 | using System.Diagnostics; | |
| 7 |
|
7 | |||
| 8 | namespace Implab.Parallels { |
|
8 | namespace Implab.Parallels { | |
| 9 | public class WorkerPool : DispatchPool<Action> { |
|
9 | public class WorkerPool : DispatchPool<Action> { | |
| 10 |
|
10 | |||
| 11 | MTQueue<Action> m_queue = new MTQueue<Action>(); |
|
11 | MTQueue<Action> m_queue = new MTQueue<Action>(); | |
| 12 | int m_queueLength = 0; |
|
12 | int m_queueLength = 0; | |
| 13 | readonly int m_threshold = 1; |
|
13 | readonly int m_threshold = 1; | |
| 14 |
|
14 | |||
| 15 | public WorkerPool(int minThreads, int maxThreads, int threshold) |
|
15 | public WorkerPool(int minThreads, int maxThreads, int threshold) | |
| 16 | : base(minThreads, maxThreads) { |
|
16 | : base(minThreads, maxThreads) { | |
| 17 | m_threshold = threshold; |
|
17 | m_threshold = threshold; | |
| 18 | InitPool(); |
|
18 | InitPool(); | |
| 19 | } |
|
19 | } | |
| 20 |
|
20 | |||
| 21 | public WorkerPool(int minThreads, int maxThreads) : |
|
21 | public WorkerPool(int minThreads, int maxThreads) : | |
| 22 | base(minThreads, maxThreads) { |
|
22 | base(minThreads, maxThreads) { | |
| 23 | InitPool(); |
|
23 | InitPool(); | |
| 24 | } |
|
24 | } | |
| 25 |
|
25 | |||
| 26 | public WorkerPool(int threads) |
|
26 | public WorkerPool(int threads) | |
| 27 | : base(threads) { |
|
27 | : base(threads) { | |
| 28 | InitPool(); |
|
28 | InitPool(); | |
| 29 | } |
|
29 | } | |
| 30 |
|
30 | |||
| 31 | public WorkerPool() |
|
31 | public WorkerPool() | |
| 32 | : base() { |
|
32 | : base() { | |
| 33 | InitPool(); |
|
33 | InitPool(); | |
| 34 | } |
|
34 | } | |
| 35 |
|
35 | |||
| 36 | public Promise<T> Invoke<T>(Func<T> task) { |
|
36 | public Promise<T> Invoke<T>(Func<T> task) { | |
| 37 | if (task == null) |
|
37 | if (task == null) | |
| 38 | throw new ArgumentNullException("task"); |
|
38 | throw new ArgumentNullException("task"); | |
| 39 | if (IsDisposed) |
|
39 | if (IsDisposed) | |
| 40 | throw new ObjectDisposedException(ToString()); |
|
40 | throw new ObjectDisposedException(ToString()); | |
| 41 |
|
41 | |||
| 42 | var promise = new Promise<T>(); |
|
42 | var promise = new Promise<T>(); | |
| 43 |
|
43 | |||
| 44 | EnqueueTask(delegate() { |
|
44 | EnqueueTask(delegate() { | |
| 45 | try { |
|
45 | try { | |
| 46 | promise.Resolve(task()); |
|
46 | promise.Resolve(task()); | |
| 47 | } catch (Exception e) { |
|
47 | } catch (Exception e) { | |
| 48 | promise.Reject(e); |
|
48 | promise.Reject(e); | |
| 49 | } |
|
49 | } | |
| 50 | }); |
|
50 | }); | |
| 51 |
|
51 | |||
| 52 | return promise; |
|
52 | return promise; | |
| 53 | } |
|
53 | } | |
| 54 |
|
54 | |||
| 55 | protected void EnqueueTask(Action unit) { |
|
55 | protected void EnqueueTask(Action unit) { | |
| 56 | Debug.Assert(unit != null); |
|
56 | Debug.Assert(unit != null); | |
| 57 | var len = Interlocked.Increment(ref m_queueLength); |
|
57 | var len = Interlocked.Increment(ref m_queueLength); | |
| 58 | m_queue.Enqueue(unit); |
|
58 | m_queue.Enqueue(unit); | |
| 59 |
|
59 | |||
| 60 |
|
|
60 | ExtendPool(); | |
| 61 | WakePool(); |
|
|||
| 62 | } |
|
61 | } | |
| 63 |
|
62 | |||
| 64 | protected override bool ExtendPool() { |
|
63 | protected override bool ExtendPool() { | |
| 65 |
if (m_queueLength <= m_threshold*Thread |
|
64 | if (m_queueLength <= m_threshold*ActiveThreads) | |
| 66 | // in this case we are in active thread and it request for additional workers |
|
65 | // in this case we are in active thread and it request for additional workers | |
| 67 | // satisfy it only when queue is longer than threshold |
|
66 | // satisfy it only when queue is longer than threshold | |
| 68 | return false; |
|
67 | return false; | |
| 69 | return base.ExtendPool(); |
|
68 | return base.ExtendPool(); | |
| 70 | } |
|
69 | } | |
| 71 |
|
70 | |||
| 72 | protected override bool TryDequeue(out Action unit) { |
|
71 | protected override bool TryDequeue(out Action unit) { | |
| 73 | if (m_queue.TryDequeue(out unit)) { |
|
72 | if (m_queue.TryDequeue(out unit)) { | |
| 74 | Interlocked.Decrement(ref m_queueLength); |
|
73 | Interlocked.Decrement(ref m_queueLength); | |
| 75 | return true; |
|
74 | return true; | |
| 76 | } |
|
75 | } | |
| 77 | return false; |
|
76 | return false; | |
| 78 | } |
|
77 | } | |
| 79 |
|
78 | |||
| 80 | protected override void InvokeUnit(Action unit) { |
|
79 | protected override void InvokeUnit(Action unit) { | |
| 81 | unit(); |
|
80 | unit(); | |
| 82 | } |
|
81 | } | |
| 83 |
|
82 | |||
| 84 |
protected override |
|
83 | protected override bool Suspend() { | |
| 85 | if (m_queueLength == 0) |
|
84 | if (m_queueLength == 0) | |
| 86 | base.Suspend(); |
|
85 | return base.Suspend(); | |
|
|
86 | else | |||
|
|
87 | return true; // spin again without locks... | |||
| 87 | } |
|
88 | } | |
| 88 | } |
|
89 | } | |
| 89 | } |
|
90 | } | |
General Comments 0
You need to be logged in to leave comments.
Login now
