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 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273
|
//
// ConcurrentExclusiveSchedulerPair.cs
//
// Authors:
// Jérémie "Garuma" Laval <jeremie.laval@gmail.com>
// Marek Safar <marek.safar@gmail.com>
//
// Copyright (c) 2011 Jérémie "Garuma" Laval
// Copyright 2012 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_5
using System;
using System.Threading;
using System.Collections.Generic;
using System.Collections.Concurrent;
using System.Diagnostics;
namespace System.Threading.Tasks
{
[DebuggerDisplay ("Concurrent={ConcurrentTaskCount}, Exclusive={ExclusiveTaskCount}")]
[DebuggerTypeProxy (typeof (SchedulerDebuggerView))]
public class ConcurrentExclusiveSchedulerPair
{
sealed class SchedulerDebuggerView
{
readonly ConcurrentExclusiveSchedulerPair owner;
public SchedulerDebuggerView (ConcurrentExclusiveSchedulerPair owner)
{
this.owner = owner;
}
public IEnumerable<Task> ScheduledConcurrent {
get {
return owner.concurrentTasks;
}
}
public IEnumerable<Task> ScheduledExclusive {
get {
return owner.exclusiveTasks;
}
}
public TaskScheduler TargetScheduler {
get {
return owner.target;
}
}
}
readonly int maxConcurrencyLevel;
readonly int maxItemsPerTask;
readonly TaskScheduler target;
readonly TaskFactory factory;
readonly Action taskHandler;
readonly ConcurrentQueue<Task> concurrentTasks = new ConcurrentQueue<Task> ();
readonly ConcurrentQueue<Task> exclusiveTasks = new ConcurrentQueue<Task> ();
//readonly ReaderWriterLockSlim rwl = new ReaderWriterLockSlim ();
readonly TaskCompletionSource<object> completion = new TaskCompletionSource<object> ();
readonly InnerTaskScheduler concurrent;
readonly InnerTaskScheduler exclusive;
int numTask;
class InnerTaskScheduler : TaskScheduler
{
readonly ConcurrentExclusiveSchedulerPair scheduler;
readonly ConcurrentQueue<Task> queue;
public InnerTaskScheduler (ConcurrentExclusiveSchedulerPair scheduler,
ConcurrentQueue<Task> queue)
{
this.scheduler = scheduler;
this.queue = queue;
}
public int TaskCount {
get {
return queue.Count;
}
}
public override int MaximumConcurrencyLevel {
get {
return scheduler.maxConcurrencyLevel;
}
}
protected internal override void QueueTask (Task t)
{
scheduler.DoQueue (t, queue);
}
protected override bool TryExecuteTaskInline (Task task, bool taskWasPreviouslyQueued)
{
if (task.Status != TaskStatus.Created)
return false;
task.RunSynchronously (scheduler.target);
return true;
}
public void Execute (Task t)
{
TryExecuteTask (t);
}
[MonoTODO ("Only useful for debugger support")]
protected override IEnumerable<Task> GetScheduledTasks ()
{
throw new NotImplementedException ();
}
}
public ConcurrentExclusiveSchedulerPair () : this (TaskScheduler.Current)
{
}
public ConcurrentExclusiveSchedulerPair (TaskScheduler taskScheduler) : this (taskScheduler, taskScheduler.MaximumConcurrencyLevel)
{
}
public ConcurrentExclusiveSchedulerPair (TaskScheduler taskScheduler, int maxConcurrencyLevel)
: this (taskScheduler, maxConcurrencyLevel, -1)
{
}
public ConcurrentExclusiveSchedulerPair (TaskScheduler taskScheduler, int maxConcurrencyLevel, int maxItemsPerTask)
{
this.target = taskScheduler;
this.maxConcurrencyLevel = maxConcurrencyLevel;
this.maxItemsPerTask = maxItemsPerTask;
this.factory = new TaskFactory (taskScheduler);
this.taskHandler = InternalTaskProcesser;
this.concurrent = new InnerTaskScheduler (this, concurrentTasks);
this.exclusive = new InnerTaskScheduler (this, exclusiveTasks);
}
public void Complete ()
{
completion.SetResult (null);
}
public TaskScheduler ConcurrentScheduler {
get {
return concurrent;
}
}
private int ConcurrentTaskCount {
get {
return concurrent.TaskCount;
}
}
public TaskScheduler ExclusiveScheduler {
get {
return exclusive;
}
}
private int ExclusiveTaskCount {
get {
return exclusive.TaskCount;
}
}
public Task Completion {
get {
return completion.Task;
}
}
void DoQueue (Task task, ConcurrentQueue<Task> queue)
{
queue.Enqueue (task);
SpinUpTasks ();
}
void InternalTaskProcesser ()
{
int times = 0;
// const int lockWaitTime = 2;
while (!concurrentTasks.IsEmpty || !exclusiveTasks.IsEmpty) {
if (maxItemsPerTask != -1 && ++times == maxItemsPerTask)
break;
throw new NotImplementedException ();
/*
bool locked = false;
try {
if (!concurrentTasks.IsEmpty && rwl.TryEnterReadLock (lockWaitTime)) {
locked = true;
Task task;
while (concurrentTasks.TryDequeue (out task)) {
RunTask (task);
}
}
} finally {
if (locked) {
rwl.ExitReadLock ();
locked = false;
}
}
try {
if (!exclusiveTasks.IsEmpty && rwl.TryEnterWriteLock (lockWaitTime)) {
locked = true;
Task task;
while (exclusiveTasks.TryDequeue (out task)) {
RunTask (task);
}
}
} finally {
if (locked) {
rwl.ExitWriteLock ();
}
}
*/
}
// TODO: there's a race here, task adding + spinup check may be done while here
Interlocked.Decrement (ref numTask);
}
void SpinUpTasks ()
{
int currentTaskNumber;
do {
currentTaskNumber = numTask;
if (currentTaskNumber >= maxConcurrencyLevel)
return;
} while (Interlocked.CompareExchange (ref numTask, currentTaskNumber + 1, currentTaskNumber) != currentTaskNumber);
factory.StartNew (taskHandler);
}
void RunTask (Task task)
{
concurrent.Execute (task);
}
}
}
#endif
|