Code:
/ 4.0 / 4.0 / untmp / DEVDIV_TFS / Dev10 / Releases / RTMRel / ndp / clr / src / BCL / System / Threading / CancellationTokenSource.cs / 1305376 / CancellationTokenSource.cs
#pragma warning disable 0420
// ==++==
//
// Copyright (c) Microsoft Corporation. All rights reserved.
//
// ==--==
//
// [....]
////////////////////////////////////////////////////////////////////////////////
using System;
using System.Security;
using System.Collections.Generic;
using System.Runtime.InteropServices;
using System.Security.Permissions;
using System.Diagnostics.Contracts;
namespace System.Threading
{
///
/// Signals to a
///
///
/// Token property)
/// that can be handed to operations that wish to be notified of cancellation or that can be used to
/// register asynchronous operations for cancellation. That token may have cancellation requested by
/// calling to the source's Cancel
/// method.
///
///
/// All members of this class, except Dispose , are thread-safe and may be used
/// concurrently from multiple threads.
///
///
[ComVisible(false)]
[HostProtection(SecurityAction.LinkDemand, Synchronization = true, ExternalThreading = true)]
public sealed class CancellationTokenSource : IDisposable
{
//static sources that can be used as the backing source for 'fixed' CancellationTokens that never change state.
private static readonly CancellationTokenSource _staticSource_Set = new CancellationTokenSource(true);
private static readonly CancellationTokenSource _staticSource_NotCancelable = new CancellationTokenSource(false);
//Note: the callback lists array is only created on first registration.
// the actual callback lists are only created on demand.
// Storing a registered callback costs around >60bytes, hence some overhead for the lists array is OK
// At most 24 lists seems reasonable, and caps the cost of the listsArray to 96bytes(32-bit,24-way) or 192bytes(64-bit,24-way).
private static readonly int s_nLists = (PlatformHelper.ProcessorCount > 24) ? 24 : PlatformHelper.ProcessorCount;
private volatile ManualResetEvent m_kernelEvent; //lazily initialized if required.
private volatile SparselyPopulatedArray[] m_registeredCallbacksLists;
// legal values for m_state
private const int CANNOT_BE_CANCELED = 0;
private const int NOT_CANCELED = 1;
private const int NOTIFYING = 2;
private const int NOTIFYINGCOMPLETE = 3;
//m_state uses the pattern "volatile int32 reads, with cmpxch writes" which is safe for updates and cannot suffer torn reads.
private volatile int m_state;
/// The ID of the thread currently executing the main body of CTS.Cancel()
/// this helps us to know if a call to ctr.Dispose() is running 'within' a cancellation callback.
/// This is updated as we move between the main thread calling cts.Cancel() and any syncContexts that are used to
/// actually run the callbacks.
private volatile int m_threadIDExecutingCallbacks = -1;
private bool m_disposed;
private List m_linkingRegistrations; //lazily initialized if required.
private static readonly Action s_LinkedTokenCancelDelegate = new Action(LinkedTokenCancelDelegate);
// we track the running callback to assist ctr.Dispose() to wait for the target callback to complete.
private volatile CancellationCallbackInfo m_executingCallback;
private static void LinkedTokenCancelDelegate(object source)
{
CancellationTokenSource cts = source as CancellationTokenSource;
Contract.Assert(source != null);
cts.Cancel();
}
// ----------------------
// ** public properties
///
/// Gets whether cancellation has been requested for this CancellationTokenSource .
///
/// Whether cancellation has been requested for this CancellationTokenSource .
///
///
/// This property indicates whether cancellation has been requested for this token source, such as
/// due to a call to its
/// Cancel method.
///
///
/// If this property returns true, it only guarantees that cancellation has been requested. It does not
/// guarantee that every handler registered with the corresponding token has finished executing, nor
/// that cancellation requests have finished propagating to all registered handlers. Additional
/// synchronization may be required, particularly in situations where related objects are being
/// canceled concurrently.
///
///
public bool IsCancellationRequested
{
get { return m_state >= NOTIFYING; }
}
///
/// A simple helper to determine whether cancellation has finished.
///
internal bool IsCancellationCompleted
{
get { return m_state == NOTIFYINGCOMPLETE; }
}
///
/// A simple helper to determine whether disposal has occured.
///
internal bool IsDisposed
{
get { return m_disposed; }
}
///
/// The ID of the thread that is running callbacks.
///
internal int ThreadIDExecutingCallbacks
{
set { m_threadIDExecutingCallbacks = value; }
get { return m_threadIDExecutingCallbacks; }
}
///
/// Gets the CancellationToken
/// associated with this
/// The CancellationToken
/// associated with this
/// The token source has been
/// disposed.
public CancellationToken Token
{
get
{
ThrowIfDisposed();
return new CancellationToken(this);
}
}
// ----------------------
// ** internal and private properties.
///
///
///
internal bool CanBeCanceled
{
get { return m_state != CANNOT_BE_CANCELED; }
}
///
///
///
internal WaitHandle WaitHandle
{
get
{
ThrowIfDisposed();
// fast path if already allocated.
if (m_kernelEvent != null)
return m_kernelEvent;
// lazy-init the mre.
ManualResetEvent mre = new ManualResetEvent(false);
if (Interlocked.CompareExchange(ref m_kernelEvent, mre, null) != null)
{
((IDisposable)mre).Dispose();
}
// There is a ---- between checking IsCancellationRequested and setting the event.
// However, at this point, the kernel object definitely exists and the cases are:
// 1. if IsCancellationRequested = true, then we will call Set()
// 2. if IsCancellationRequested = false, then NotifyCancellation will see that the event exists, and will call Set().
if (IsCancellationRequested)
m_kernelEvent.Set();
return m_kernelEvent;
}
}
///
/// The currently executing callback
///
internal CancellationCallbackInfo ExecutingCallback
{
get { return m_executingCallback; }
}
#if DEBUG
///
/// Used by the dev unit tests to check the number of outstanding registrations.
/// They use private reflection to gain access. Because this would be dead retail
/// code, however, it is ifdef'd out to work only in debug builds.
///
private int CallbackCount
{
get
{
SparselyPopulatedArray[] callbackLists = m_registeredCallbacksLists;
if (callbackLists == null)
return 0;
int count = 0;
foreach(SparselyPopulatedArray sparseArray in callbackLists)
{
if(sparseArray != null)
{
SparselyPopulatedArrayFragment currCallbacks = sparseArray.Head;
while (currCallbacks != null)
{
for (int i = 0; i < currCallbacks.Length; i++)
if (currCallbacks[i] != null)
count++;
currCallbacks = currCallbacks.Next;
}
}
}
return count;
}
}
#endif
// ** Public Constructors
///
/// Initializes the
public CancellationTokenSource()
{
m_state = NOT_CANCELED;
}
// ** Private constructors for static sources.
// set=false ==> cannot be canceled.
// set=true ==> is canceled.
private CancellationTokenSource(bool set)
{
m_state = set ? NOTIFYINGCOMPLETE : CANNOT_BE_CANCELED;
}
// ** Public Methods
///
/// Communicates a request for cancellation.
///
///
///
/// The associated IsCancellationRequested returns true.
/// Any callbacks or cancelable operations
/// registered with the
///
/// Cancelable operations and callbacks registered with the token should not throw exceptions.
/// However, this overload of Cancel will aggregate any exceptions thrown into a
///
/// The
///
/// An aggregate exception containing all the exceptions thrown
/// by the registered callbacks on the associated
/// This
public void Cancel()
{
Cancel(false);
}
///
/// Communicates a request for cancellation.
///
///
///
/// The associated IsCancellationRequested returns true.
/// Any callbacks or cancelable operations
/// registered with the
///
/// Cancelable operations and callbacks registered with the token should not throw exceptions.
/// If
///
/// The
///
/// An aggregate exception containing all the exceptions thrown
/// by the registered callbacks on the associated
/// This
public void Cancel(bool throwOnFirstException)
{
ThrowIfDisposed();
NotifyCancellation(throwOnFirstException);
}
///
/// Releases the resources used by this
///
/// This method is not thread-safe for any other concurrent calls.
///
public void Dispose()
{
if (m_disposed)
return;
bool isLinked = m_linkingRegistrations != null;
if (isLinked)
{
foreach (CancellationTokenRegistration registration in m_linkingRegistrations)
{
registration.Dispose();
}
m_linkingRegistrations = null; //free for GC
}
// registered callbacks are now either complete or will never run, due to guarantees made by ctr.Dispose()
// so we can now perform main disposal work without risk of linking callbacks trying to use this CTS.
m_registeredCallbacksLists = null; // free for GC.
if (m_kernelEvent != null)
{
m_kernelEvent.Close(); // the critical cleanup to release an OS handle
m_kernelEvent = null; // free for GC.
}
m_disposed = true;
}
// -- Internal methods.
///
/// Throws an exception if the source has been disposed.
///
internal void ThrowIfDisposed()
{
if (m_disposed)
throw new ObjectDisposedException(null, Environment.GetResourceString("CancellationTokenSource_Disposed"));
}
///
/// InternalGetStaticSource()
///
/// A static source to be shared among multiple tokens.
internal static CancellationTokenSource InternalGetStaticSource(bool set)
{
return set ? _staticSource_Set : _staticSource_NotCancelable;
}
///
/// Registers a callback object. If cancellation has already occurred, the
/// callback will have been run by the time this method returns.
///
internal CancellationTokenRegistration InternalRegister(
Action callback, object stateForCallback, SynchronizationContext targetSyncContext, ExecutionContext executionContext)
{
ThrowIfDisposed();
// the CancellationToken has already checked that the token is cancelable before calling this method.
Contract.Assert(CanBeCanceled, "Cannot register for uncancelable token src");
// if not canceled, register the event handlers
// if canceled already, run the callback synchronously
// Apart from the semantics of late-enlistment, this also ensures that during ExecuteCallbackHandlers() there
// will be no mutation of the _registeredCallbacks list
if (!IsCancellationRequested)
{
int myIndex = Thread.CurrentThread.ManagedThreadId % s_nLists;
CancellationCallbackInfo callbackInfo = new CancellationCallbackInfo(callback, stateForCallback, targetSyncContext, executionContext, this);
//allocate the callback list array
if (m_registeredCallbacksLists == null)
{
SparselyPopulatedArray[] list = new SparselyPopulatedArray[s_nLists];
Interlocked.CompareExchange(ref m_registeredCallbacksLists, list, null);
}
//allocate the actual lists on-demand to save mem in low-use situations, and to avoid false-sharing.
if (m_registeredCallbacksLists[myIndex] == null)
{
SparselyPopulatedArray callBackArray = new SparselyPopulatedArray(4);
Interlocked.CompareExchange(ref (m_registeredCallbacksLists[myIndex]), callBackArray, null);
}
// Now add the registration to the list.
SparselyPopulatedArray callbacks = m_registeredCallbacksLists[myIndex];
SparselyPopulatedArrayAddInfo addInfo = callbacks.Add(callbackInfo);
CancellationTokenRegistration registration = new CancellationTokenRegistration(this, callbackInfo, addInfo);
if (!IsCancellationRequested)
return registration;
//If a cancellation has since come in, we will try to undo the registration and run the callback directly here.
bool deregisterOccurred = registration.TryDeregister();
if (!deregisterOccurred)
{
// the callback execution process must have snagged the callback for execution, so
// 1. wait for the callback to complete, then
// 2. return a dummy registration.
WaitForCallbackToComplete(callbackInfo);
return new CancellationTokenRegistration();
}
}
// If cancellation already occurred, we run the callback on this thread and return an empty registration.
callback(stateForCallback);
return new CancellationTokenRegistration();
}
///
///
///
private void NotifyCancellation(bool throwOnFirstException)
{
// fast-path test to check if Notify has been called previously
if (IsCancellationRequested)
return;
// If we're the first to signal cancellation, do the main extra work.
if (Interlocked.CompareExchange(ref m_state, NOTIFYING, NOT_CANCELED) == NOT_CANCELED)
{
//record the threadID being used for running the callbacks.
ThreadIDExecutingCallbacks = Thread.CurrentThread.ManagedThreadId;
//If the kernel event is null at this point, it will be set during lazy construction.
if (m_kernelEvent != null)
m_kernelEvent.Set(); // update the MRE value.
// - late enlisters to the Canceled event will have their callbacks called immediately in the Register() methods.
// - Callbacks are not called inside a lock.
// - After transition, no more delegates will be added to the
// - list of handlers, and hence it can be consumed and cleared at leisure by ExecuteCallbackHandlers.
ExecuteCallbackHandlers(throwOnFirstException);
Contract.Assert(IsCancellationCompleted, "Expected cancellation to have finished");
}
}
///
/// Invoke the Canceled event.
///
///
/// The handlers are invoked synchronously in LIFO order.
///
private void ExecuteCallbackHandlers(bool throwOnFirstException)
{
Contract.Assert(IsCancellationRequested, "ExecuteCallbackHandlers should only be called after setting IsCancellationRequested->true");
Contract.Assert(ThreadIDExecutingCallbacks != -1, "ThreadIDExecutingCallbacks should have been set.");
// Design decision: call the delegates in LIFO order so that callbacks fire 'deepest first'.
// This is intended to help with nesting scenarios so that child enlisters cancel before their parents.
List exceptionList = null;
SparselyPopulatedArray[] callbackLists = m_registeredCallbacksLists;
// If there are no callbacks to run, we can safely exit. Any ----s to lazy initialize it
// will see IsCancellationRequested and will then run the callback themselves.
if (callbackLists == null)
{
Interlocked.Exchange(ref m_state, NOTIFYINGCOMPLETE);
return;
}
try
{
for (int index = 0; index < callbackLists.Length; index++)
{
SparselyPopulatedArray list = callbackLists[index];
if (list != null)
{
SparselyPopulatedArrayFragment currArrayFragment = list.Tail;
while (currArrayFragment != null)
{
for (int i = currArrayFragment.Length - 1; i >= 0; i--)
{
// 1a. publish the indended callback, to ensure ctr.Dipose can tell if a wait is necessary.
// 1b. transition to the target syncContext and continue there..
// On the target SyncContext.
// 2. actually remove the callback
// 3. execute the callback
// re:#2 we do the remove on the syncCtx so that we can be sure we have control of the syncCtx before
// grabbing the callback. This prevents a deadlock if ctr.Dispose() might run on the syncCtx too.
m_executingCallback = currArrayFragment[i];
if (m_executingCallback != null)
{
//Transition to the target [....] context (if necessary), and continue our work there.
CancellationCallbackCoreWorkArguments args = new CancellationCallbackCoreWorkArguments(currArrayFragment, i);
// marshal exceptions: either aggregate or perform an immediate rethrow
// We assume that syncCtx.Send() has forwarded on user exceptions when appropriate.
try
{
if (m_executingCallback.TargetSyncContext != null)
{
m_executingCallback.TargetSyncContext.Send(CancellationCallbackCoreWork_OnSyncContext, args);
// CancellationCallbackCoreWork_OnSyncContext may have altered ThreadIDExecutingCallbacks, so reset it.
ThreadIDExecutingCallbacks = Thread.CurrentThread.ManagedThreadId;
}
else
{
CancellationCallbackCoreWork_OnSyncContext(args);
}
}
catch(Exception ex)
{
if (throwOnFirstException)
throw;
// Otherwise, log it and proceed.
if(exceptionList == null)
exceptionList = new List();
exceptionList.Add(ex);
}
}
}
currArrayFragment = currArrayFragment.Prev;
}
}
}
}
finally
{
m_state = NOTIFYINGCOMPLETE;
m_executingCallback = null;
Thread.MemoryBarrier(); // for safety, prevent reorderings crossing this point and seeing inconsistent state.
}
if (exceptionList != null)
{
Contract.Assert(exceptionList.Count > 0, "Expected exception count > 0");
throw new AggregateException(exceptionList);
}
}
// The main callback work that executes on the target synchronization context
private void CancellationCallbackCoreWork_OnSyncContext(object obj)
{
CancellationCallbackCoreWorkArguments args = (CancellationCallbackCoreWorkArguments) obj;
// now remove the intended callback..and ensure that it worked.
// otherwise the callback has disappeared in the interim and we can immediately return.
CancellationCallbackInfo callback = args.m_currArrayFragment.SafeAtomicRemove(args.m_currArrayIndex, m_executingCallback);
if (callback == m_executingCallback)
{
if (callback.TargetExecutionContext != null)
{
// we are running via a custom [....] context, so update the executing threadID
callback.CancellationTokenSource.ThreadIDExecutingCallbacks = Thread.CurrentThread.ManagedThreadId;
}
callback.ExecuteCallback();
}
}
///
/// Creates a CancellationTokenSource that will be in the canceled state
/// when any of the source tokens are in the canceled state.
///
/// CancellationToken to observe.
/// CancellationToken to observe.
/// A CancellationTokenSource that is linked
/// to the source tokens.
/// A CancellationTokenSource associated with
/// one of the source tokens has been disposed.
public static CancellationTokenSource CreateLinkedTokenSource(CancellationToken token1, CancellationToken token2)
{
CancellationTokenSource linkedTokenSource = new CancellationTokenSource();
if( token1.CanBeCanceled )
{
linkedTokenSource.m_linkingRegistrations = new List();
linkedTokenSource.m_linkingRegistrations.Add(token1.InternalRegisterWithoutEC(s_LinkedTokenCancelDelegate, linkedTokenSource));
}
if( token2.CanBeCanceled )
{
if( linkedTokenSource.m_linkingRegistrations == null )
{
linkedTokenSource.m_linkingRegistrations = new List();
}
linkedTokenSource.m_linkingRegistrations.Add(token2.InternalRegisterWithoutEC(s_LinkedTokenCancelDelegate, linkedTokenSource));
}
return linkedTokenSource;
}
///
/// Creates a CancellationTokenSource that will be in the canceled state
/// when any of the source tokens are in the canceled state.
///
/// CancellationToken instances to observe.
/// A CancellationTokenSource that is linked
/// to the source tokens.
/// A CancellationTokenSource associated with
/// one of the source tokens has been disposed.
public static CancellationTokenSource CreateLinkedTokenSource(params CancellationToken[] tokens)
{
if (tokens == null)
throw new ArgumentNullException("tokens");
if (tokens.Length == 0)
throw new ArgumentException(Environment.GetResourceString("CancellationToken_CreateLinkedToken_TokensIsEmpty"));
// a defensive copy is not required as the array has value-items that have only a single IntPtr field,
// hence each item cannot be null itself, and reads of the payloads cannot be torn.
Contract.EndContractBlock();
CancellationTokenSource linkedTokenSource = new CancellationTokenSource();
linkedTokenSource.m_linkingRegistrations = new List();
for (int i = 0; i < tokens.Length; i++)
{
if (tokens[i].CanBeCanceled)
{
linkedTokenSource.m_linkingRegistrations.Add(tokens[i].InternalRegisterWithoutEC(s_LinkedTokenCancelDelegate, linkedTokenSource));
}
}
return linkedTokenSource;
}
// Wait for a single callback to complete (or, more specifically, to not be running).
// It is ok to call this method if the callback has already finished.
// Calling this method before the target callback has been selected for execution would be an error.
internal void WaitForCallbackToComplete(CancellationCallbackInfo callbackInfo)
{
SpinWait sw = new SpinWait();
while (ExecutingCallback == callbackInfo)
{
sw.SpinOnce(); //spin as we assume callback execution is fast and that this situation is rare.
}
}
}
// ----------------------------------------------------------
// -- CancellationCallbackCoreWorkArguments --
// ---------------------------------------------------------
// Helper struct for passing data to the target [....] context
internal struct CancellationCallbackCoreWorkArguments
{
internal SparselyPopulatedArrayFragment m_currArrayFragment;
internal int m_currArrayIndex;
public CancellationCallbackCoreWorkArguments(SparselyPopulatedArrayFragment currArrayFragment, int currArrayIndex)
{
m_currArrayFragment = currArrayFragment;
m_currArrayIndex = currArrayIndex;
}
}
// ---------------------------------------------------------
// -- CancellationCallbackInfo --
// ---------------------------------------------------------
///
/// A helper class for collating the various bits of information required to execute
/// cancellation callbacks.
///
internal class CancellationCallbackInfo
{
internal readonly Action Callback;
internal readonly object StateForCallback;
internal readonly SynchronizationContext TargetSyncContext;
internal readonly ExecutionContext TargetExecutionContext;
internal readonly CancellationTokenSource CancellationTokenSource;
internal CancellationCallbackInfo(
Action callback, object stateForCallback, SynchronizationContext targetSyncContext, ExecutionContext targetExecutionContext,
CancellationTokenSource cancellationTokenSource)
{
Callback = callback;
StateForCallback = stateForCallback;
TargetSyncContext = targetSyncContext;
TargetExecutionContext = targetExecutionContext;
CancellationTokenSource = cancellationTokenSource;
}
///
/// InternalExecuteCallbackSynchronously_GeneralPath
/// This will be called on the target synchronization context, however, we still need to restore the required execution context
///
[SecuritySafeCritical]
internal void ExecuteCallback()
{
if (TargetExecutionContext != null)
{
ExecutionContext.Run(
TargetExecutionContext,
ExecutionContextCallback,
this);
}
else
{
//otherwise run directly
ExecutionContextCallback(this);
}
}
// the worker method to actually run the callback
// The signature is such that it can be used as a 'ContextCallback'
private static void ExecutionContextCallback(object obj)
{
CancellationCallbackInfo callbackInfo = obj as CancellationCallbackInfo;
Contract.Assert(callbackInfo != null);
callbackInfo.Callback(callbackInfo.StateForCallback);
}
}
// ----------------------------------------------------------
// -- SparselyPopulatedArray --
// ---------------------------------------------------------
///
/// A sparsely populated array. Elements can be sparse and some null, but this allows for
/// lock-free additions and growth, and also for constant time removal (by nulling out).
///
/// The kind of elements contained within.
internal class SparselyPopulatedArray where T : class
{
private readonly SparselyPopulatedArrayFragment m_head;
private volatile SparselyPopulatedArrayFragment m_tail;
///
/// Allocates a new array with the given initial size.
///
/// (initialSize);
}
///
/// The head of the doubly linked list.
///
internal SparselyPopulatedArrayFragment Head
{
get { return m_head; }
}
///
/// The tail of the doubly linked list.
///
internal SparselyPopulatedArrayFragment Tail
{
get { return m_tail; }
}
///
/// Adds an element in the first available slot, beginning the search from the tail-to-head.
/// If no slots are available, the array is grown. The method doesn't return until successful.
///
/// Information about where the add happened, to enable O(1) deregistration.
internal SparselyPopulatedArrayAddInfo Add(T element)
{
while (true)
{
// Get the tail, and ensure it's up to date.
SparselyPopulatedArrayFragment tail = m_tail;
while (tail.m_next != null)
m_tail = (tail = tail.m_next);
// Search for a free index, starting from the tail.
SparselyPopulatedArrayFragment curr = tail;
while (curr != null)
{
const int RE_SEARCH_THRESHOLD = -10; // Every 10 skips, force a search.
if (curr.m_freeCount < 1)
--curr.m_freeCount;
if (curr.m_freeCount > 0 || curr.m_freeCount < RE_SEARCH_THRESHOLD)
{
int c = curr.Length;
// We'll compute a start offset based on how many free slots we think there
// are. This optimizes for ordinary the LIFO deregistration pattern, and is
// far from perfect due to the non-threadsafe ++ and -- of the free counter.
int start = ((c - curr.m_freeCount) % c);
if (start < 0)
{
start = 0;
curr.m_freeCount--; // Too many free elements; fix up.
}
Contract.Assert(start >= 0 && start < c, "start is outside of bounds");
// Now walk the array until we find a free slot (or reach the end).
for (int i = 0; i < c; i++)
{
// If the slot is null, try to CAS our element into it.
int tryIndex = (start + i) % c;
Contract.Assert(tryIndex >= 0 && tryIndex < curr.m_elements.Length, "tryIndex is outside of bounds");
if (curr.m_elements[tryIndex] == null && Interlocked.CompareExchange(ref curr.m_elements[tryIndex], element, null) == null)
{
// We adjust the free count by --. Note: if this drops to 0, we will skip
// the fragment on the next search iteration. Searching threads will -- the
// count and force a search every so often, just in case fragmentation occurs.
int newFreeCount = curr.m_freeCount - 1;
curr.m_freeCount = newFreeCount > 0 ? newFreeCount : 0;
return new SparselyPopulatedArrayAddInfo(curr, tryIndex);
}
}
}
curr = curr.m_prev;
}
// If we got here, we need to add a new chunk to the tail and try again.
SparselyPopulatedArrayFragment newTail = new SparselyPopulatedArrayFragment(
tail.m_elements.Length == 4096 ? 4096 : tail.m_elements.Length * 2, tail);
if (Interlocked.CompareExchange(ref tail.m_next, newTail, null) == null)
{
m_tail = newTail;
}
}
}
}
///
/// A struct to hold a link to the exact spot in an array an element was inserted, enabling
/// constant time removal later on.
///
internal struct SparselyPopulatedArrayAddInfo where T : class
{
private SparselyPopulatedArrayFragment m_source;
private int m_index;
internal SparselyPopulatedArrayAddInfo(SparselyPopulatedArrayFragment source, int index)
{
Contract.Assert(source != null);
Contract.Assert(index >= 0 && index < source.Length);
m_source = source;
m_index = index;
}
internal SparselyPopulatedArrayFragment Source
{
get { return m_source; }
}
internal int Index
{
get { return m_index; }
}
}
///
/// A fragment of a sparsely populated array, doubly linked.
///
/// The kind of elements contained within.
internal class SparselyPopulatedArrayFragment where T : class
{
internal readonly T[] m_elements; // The contents, sparsely populated (with nulls).
internal volatile int m_freeCount; // A hint of the number of free elements.
internal volatile SparselyPopulatedArrayFragment m_next; // The next fragment in the chain.
internal volatile SparselyPopulatedArrayFragment m_prev; // The previous fragment in the chain.
internal SparselyPopulatedArrayFragment(int size) : this(size, null)
{
}
internal SparselyPopulatedArrayFragment(int size, SparselyPopulatedArrayFragment prev)
{
m_elements = new T[size];
m_freeCount = size;
m_prev = prev;
}
internal T this[int index]
{
get { return m_elements[index]; }
}
internal int Length
{
get { return m_elements.Length; }
}
internal SparselyPopulatedArrayFragment Next
{
get { return m_next; }
}
internal SparselyPopulatedArrayFragment Prev
{
get { return m_prev; }
}
// only removes the item at the specified index if it is still the expected one.
// Returns the prevailing value.
// The remove occured successfully if the return value == expected element
// otherwise the remove did not occur.
internal T SafeAtomicRemove(int index, T expectedElement)
{
T prevailingValue = Interlocked.CompareExchange(ref m_elements[index], null, expectedElement);
if (prevailingValue != null)
++m_freeCount;
return prevailingValue;
}
}
}
// File provided for Reference Use Only by Microsoft Corporation (c) 2007.
// Copyright (c) Microsoft Corporation. All rights reserved.
