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
|
//
// TaskCompletionQueue.cs
//
// Authors:
// Jérémie Laval <jeremie dot laval at xamarin dot com>
//
// Copyright 2011 Xamarin Inc (http://www.xamarin.com).
//
// 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.Threading;
using System.Collections.Generic;
using System.Collections.Concurrent;
namespace System.Threading.Tasks
{
internal struct TaskCompletionQueue<TCompletion> where TCompletion : class
{
TCompletion single;
ConcurrentOrderedList<TCompletion> completed;
public void Add (TCompletion continuation)
{
if (single == null && Interlocked.CompareExchange (ref single, continuation, null) == null)
return;
if (completed == null)
Interlocked.CompareExchange (ref completed, new ConcurrentOrderedList<TCompletion> (), null);
completed.TryAdd (continuation);
}
public bool Remove (TCompletion continuation)
{
TCompletion temp = single;
if (temp != null && temp == continuation && Interlocked.CompareExchange (ref single, null, continuation) == continuation)
return true;
if (completed != null)
return completed.TryRemove (continuation);
return false;
}
public bool HasElements {
get {
return single != null || (completed != null && completed.Count != 0);
}
}
public bool TryGetNextCompletion (out TCompletion continuation)
{
continuation = null;
if (single != null && (continuation = Interlocked.Exchange (ref single, null)) != null)
return true;
return completed != null && completed.TryPop (out continuation);
}
}
}
#endif
|
