@@ -23,16 +23,21 namespace Implab.Parallels { | |||||
23 |
|
23 | |||
24 | public T GetItem(int timeout) { |
|
24 | public T GetItem(int timeout) { | |
25 | T item; |
|
25 | T item; | |
26 | var t1 = Environment.TickCount; |
|
26 | ||
27 | var dt = timeout; |
|
27 | if (!TryDequeue(out item)) { | |
28 | while (!TryDequeue(out item)) { |
|
28 | var t1 = Environment.TickCount; | |
29 | lock (m_lock) |
|
29 | var dt = timeout; | |
30 | if (!Monitor.Wait(m_lock, dt)) |
|
30 | ||
31 | throw new TimeoutException(); |
|
31 | lock (m_lock) { | |
32 |
|
|
32 | while (!TryDequeue(out item)) { | |
33 | dt = timeout - Environment.TickCount + t1; |
|
33 | if (!Monitor.Wait(m_lock, dt)) | |
34 | if (dt < 0) |
|
34 | throw new TimeoutException(); | |
35 |
|
|
35 | if (timeout >= 0) { | |
|
36 | dt = timeout - Environment.TickCount + t1; | |||
|
37 | if (dt < 0) | |||
|
38 | throw new TimeoutException(); | |||
|
39 | } | |||
|
40 | } | |||
36 | } |
|
41 | } | |
37 | } |
|
42 | } | |
38 | return item; |
|
43 | return item; | |
@@ -40,9 +45,11 namespace Implab.Parallels { | |||||
40 |
|
45 | |||
41 | public T GetItem() { |
|
46 | public T GetItem() { | |
42 | T item; |
|
47 | T item; | |
43 |
|
|
48 | if (!TryDequeue(out item)) | |
44 | lock (m_lock) |
|
49 | lock (m_lock) { | |
45 | Monitor.Wait(m_lock); |
|
50 | while (!TryDequeue(out item)) | |
|
51 | Monitor.Wait(m_lock); | |||
|
52 | } | |||
46 | return item; |
|
53 | return item; | |
47 | } |
|
54 | } | |
48 |
|
55 | |||
@@ -51,16 +58,22 namespace Implab.Parallels { | |||||
51 |
|
58 | |||
52 | var buffer = new T[max]; |
|
59 | var buffer = new T[max]; | |
53 | int actual; |
|
60 | int actual; | |
54 | var t1 = Environment.TickCount; |
|
61 | if (!TryDequeueRange(buffer, 0, max, out actual)) { | |
55 |
var |
|
62 | var t1 = Environment.TickCount; | |
56 | while (!TryDequeueRange(buffer,0,max,out actual)) { |
|
63 | var dt = timeout; | |
57 | lock (m_lock) |
|
64 | ||
58 |
|
|
65 | lock (m_lock) { | |
59 | throw new TimeoutException(); |
|
66 | while (!TryDequeueRange(buffer, 0, max, out actual)) { | |
60 |
|
|
67 | ||
61 | dt = timeout - Environment.TickCount + t1; |
|
68 | if (!Monitor.Wait(m_lock, dt)) | |
62 | if (dt < 0) |
|
69 | throw new TimeoutException(); | |
63 | throw new TimeoutException(); |
|
70 | ||
|
71 | if (timeout >= 0) { | |||
|
72 | dt = timeout - Environment.TickCount + t1; | |||
|
73 | if (dt < 0) | |||
|
74 | throw new TimeoutException(); | |||
|
75 | } | |||
|
76 | } | |||
64 | } |
|
77 | } | |
65 | } |
|
78 | } | |
66 |
|
79 | |||
@@ -74,9 +87,10 namespace Implab.Parallels { | |||||
74 |
|
87 | |||
75 | var buffer = new T[max]; |
|
88 | var buffer = new T[max]; | |
76 | int actual; |
|
89 | int actual; | |
77 |
|
|
90 | if (!TryDequeueRange(buffer, 0, max, out actual)) | |
78 | lock (m_lock) |
|
91 | lock (m_lock) | |
79 | Monitor.Wait(m_lock); |
|
92 | while (!TryDequeueRange(buffer, 0, max, out actual)) | |
|
93 | Monitor.Wait(m_lock); | |||
80 |
|
94 | |||
81 | var data = new T[actual]; |
|
95 | var data = new T[actual]; | |
82 | Array.Copy(buffer, data, actual); |
|
96 | Array.Copy(buffer, data, actual); |
General Comments 0
You need to be logged in to leave comments.
Login now