1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236
|
//
// Barrier.cs
//
// Author:
// Jérémie "Garuma" Laval <jeremie.laval@gmail.com>
//
// Copyright (c) 2009 Jérémie "Garuma" Laval
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
#if NET_4_0
using System;
using System.Diagnostics;
namespace System.Threading
{
[DebuggerDisplay ("Participant Count={ParticipantCount},Participants Remaining={ParticipantsRemaining}")]
public class Barrier : IDisposable
{
const int MaxParticipants = 32767;
Action<Barrier> postPhaseAction;
int participants;
bool cleaned;
CountdownEvent cntd;
ManualResetEventSlim postPhaseEvt = new ManualResetEventSlim ();
long phase;
public Barrier (int participantCount)
: this (participantCount, null)
{
}
public Barrier (int participantCount, Action<Barrier> postPhaseAction)
{
if (participantCount < 0 || participantCount > MaxParticipants)
throw new ArgumentOutOfRangeException ("participantCount");
this.participants = participantCount;
this.postPhaseAction = postPhaseAction;
InitCountdownEvent ();
}
public void Dispose ()
{
Dispose (true);
}
protected virtual void Dispose (bool disposing)
{
if (disposing){
if (cntd != null){
cntd.Dispose ();
cntd = null;
}
postPhaseAction = null;
cleaned = true;
}
}
void InitCountdownEvent ()
{
postPhaseEvt = new ManualResetEventSlim (false);
cntd = new CountdownEvent (participants);
}
public long AddParticipant ()
{
return AddParticipants (1);
}
static Exception GetDisposed ()
{
return new ObjectDisposedException ("Barrier");
}
public long AddParticipants (int participantCount)
{
if (cleaned)
throw GetDisposed ();
if (participantCount < 0)
throw new InvalidOperationException ();
// Basically, we try to add ourselves and return
// the phase. If the call return false, we repeatdly try
// to add ourselves for the next phase
do {
if (cntd.TryAddCount (participantCount)) {
Interlocked.Add (ref participants, participantCount);
return phase;
}
} while (true);
}
public void RemoveParticipant ()
{
RemoveParticipants (1);
}
public void RemoveParticipants (int participantCount)
{
if (cleaned)
throw GetDisposed ();
if (participantCount < 0)
throw new ArgumentOutOfRangeException ("participantCount");
if (cntd.Signal (participantCount))
PostPhaseAction (postPhaseEvt);
Interlocked.Add (ref participants, -participantCount);
}
public void SignalAndWait ()
{
if (cleaned)
throw GetDisposed ();
SignalAndWait ((c) => { c.Wait (); return true; });
}
public void SignalAndWait (CancellationToken cancellationToken)
{
if (cleaned)
throw GetDisposed ();
SignalAndWait ((c) => { c.Wait (cancellationToken); return true; });
}
public bool SignalAndWait (int millisecondsTimeout)
{
if (cleaned)
throw GetDisposed ();
return SignalAndWait ((c) => c.Wait (millisecondsTimeout));
}
public bool SignalAndWait (TimeSpan timeout)
{
if (cleaned)
throw GetDisposed ();
return SignalAndWait ((c) => c.Wait (timeout));
}
public bool SignalAndWait (int millisecondsTimeout, CancellationToken cancellationToken)
{
if (cleaned)
throw GetDisposed ();
return SignalAndWait ((c) => c.Wait (millisecondsTimeout, cancellationToken));
}
public bool SignalAndWait (TimeSpan timeout, CancellationToken cancellationToken)
{
if (cleaned)
throw GetDisposed ();
return SignalAndWait ((c) => c.Wait (timeout, cancellationToken));
}
bool SignalAndWait (Func<CountdownEvent, bool> associate)
{
bool result;
CountdownEvent temp = cntd;
ManualResetEventSlim evt = postPhaseEvt;
if (!temp.Signal ()) {
result = Wait (associate, temp, evt);
} else {
result = true;
PostPhaseAction (evt);
}
return result;
}
bool Wait (Func<CountdownEvent, bool> associate, CountdownEvent temp, ManualResetEventSlim evt)
{
if (!associate (temp))
return false;
evt.Wait ();
return true;
}
void PostPhaseAction (ManualResetEventSlim evt)
{
if (postPhaseAction != null) {
try {
postPhaseAction (this);
} catch (Exception e) {
throw new BarrierPostPhaseException (e);
}
}
InitCountdownEvent ();
phase++;
evt.Set ();
}
public long CurrentPhaseNumber {
get {
return phase;
}
}
public int ParticipantCount {
get {
return participants;
}
}
[MonoTODO]
public int ParticipantsRemaining {
get {
return -1;
}
}
}
}
#endif
|