mirror of
https://github.com/BepInEx/mono.git
synced 2026-11-18 03:51:19 -10:00
In class/System.Core/: * net_4_0_System.Core.dll.sources: add PLinq sources In class/System.Core/System.Linq/: * OrderedParallelQuery.cs: * ParallelEnumerable.cs: * ParallelExecuter.cs: * ParallelPartitioner.cs: * ParallelQuery.cs: * ParallelQueryEnumerator.cs: First check-in of PLinq In class/System.Core/System.Linq/Internal/: * AggregationList.cs: * ConcurrentGrouping.cs: * ConcurrentLookup.cs: * OrderingEnumerator.cs: * ParallelQuickSort.cs: * RangeList.cs: * RepeatList.cs: * ReverseList.cs: * StripPartitioner.cs: Initial check-in of PLinq In class/System.Core/System.Linq/Internal/QueryNodes/: * QueryBaseNode.cs: * QueryCastNode.cs: * QueryChildNode.cs: * QueryConcatNode.cs: * QueryDefaultEmptyNode.cs: * QueryGroupByNode.cs: * QueryMuxNode.cs: * QueryOptionNode.cs: * QueryOrderByNode.cs: * QueryOrderGuardNode.cs: * QueryOrderedStreamNode.cs: * QueryReverseNode.cs: * QuerySelectManyNode.cs: * QuerySelectNode.cs: * QuerySetNode.cs: * QueryStartNode.cs: * QueryStreamNode.cs: * QueryWhereNode.cs: * QueryZipNode.cs: * WrapHelper.cs: Initial check-in of PLinq In class/System.Core/System.Linq/Internal/Visitors/: * INodeVisitor.cs: * IVisitableNode.cs: * QueryCheckerVisitor.cs: * QueryOptions.cs: First check-in of PLinq svn path=/trunk/mcs/; revision=155533
193 lines
6.8 KiB
C#
193 lines
6.8 KiB
C#
#if NET_4_0
|
|
//
|
|
// ParallelExecuter.cs
|
|
//
|
|
// Author:
|
|
// Jérémie "Garuma" Laval <[email protected]>
|
|
//
|
|
// Copyright (c) 2010 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.
|
|
|
|
using System;
|
|
using System.Threading;
|
|
using System.Threading.Tasks;
|
|
using System.Collections;
|
|
using System.Collections.Generic;
|
|
using System.Collections.Concurrent;
|
|
|
|
namespace System.Linq
|
|
{
|
|
// TODO: Refactory each of the Process method into one big entity
|
|
// Check CancellationToken.Canceled parameter in the Task's action body too
|
|
internal static class ParallelExecuter
|
|
{
|
|
internal static QueryOptions CheckQuery<T> (QueryBaseNode<T> startingNode)
|
|
{
|
|
return CheckQuery<T> (startingNode, false);
|
|
}
|
|
|
|
internal static QueryOptions CheckQuery<T> (QueryBaseNode<T> startingNode, bool blocking)
|
|
{
|
|
return CheckQuery (startingNode, GetBestWorkerNumber (blocking));
|
|
}
|
|
|
|
internal static QueryOptions CheckQuery<T> (QueryBaseNode<T> startingNode, int partitionCount)
|
|
{
|
|
QueryCheckerVisitor visitor = new QueryCheckerVisitor (partitionCount);
|
|
startingNode.Visit (visitor);
|
|
|
|
return visitor.Options;
|
|
}
|
|
|
|
// QueryOptions.ImplementerToken = QueryOptions.ImplementerToken.Chain (myOperatorSource);
|
|
internal static CancellationToken Chain (this CancellationToken self, CancellationTokenSource other)
|
|
{
|
|
CancellationTokenSource linked = CancellationTokenSource.CreateLinkedTokenSource (self, other.Token);
|
|
return linked.Token;
|
|
}
|
|
|
|
internal static int GetBestWorkerNumber ()
|
|
{
|
|
return GetBestWorkerNumber (false);
|
|
}
|
|
|
|
internal static int GetBestWorkerNumber (bool blocking)
|
|
{
|
|
return blocking ? Environment.ProcessorCount + 1 : Environment.ProcessorCount;
|
|
}
|
|
|
|
internal static Task[] Process<TSource, TElement> (QueryBaseNode<TSource> node, Action<TElement> call,
|
|
Func<QueryBaseNode<TSource>, QueryOptions, IList<IEnumerable<TElement>>> acquisitionFunc,
|
|
QueryOptions options)
|
|
{
|
|
return Process<TSource, TElement> (node, call, acquisitionFunc, null, options);
|
|
}
|
|
|
|
internal static Task[] Process<TSource, TElement> (QueryBaseNode<TSource> node, Action<TElement> call,
|
|
Func<QueryBaseNode<TSource>, QueryOptions, IList<IEnumerable<TElement>>> acquisitionFunc,
|
|
Action endAction,
|
|
QueryOptions options)
|
|
{
|
|
IList<IEnumerable<TElement>> enumerables = acquisitionFunc (node, options);
|
|
|
|
Task[] tasks = new Task[enumerables.Count];
|
|
|
|
for (int i = 0; i < tasks.Length; i++) {
|
|
int index = i;
|
|
tasks[i] = Task.Factory.StartNew (() => {
|
|
foreach (TElement item in enumerables[index]) {
|
|
// This is from specific operators
|
|
if (options.ImplementerToken.IsCancellationRequested)
|
|
break;
|
|
if (options.Token.IsCancellationRequested)
|
|
throw new OperationCanceledException (options.Token);
|
|
|
|
call (item);
|
|
}
|
|
if (endAction != null)
|
|
endAction ();
|
|
}, options.Token);
|
|
}
|
|
|
|
return tasks;
|
|
}
|
|
|
|
internal static void ProcessAndBlock<T> (QueryBaseNode<T> node, Action<T> call)
|
|
{
|
|
QueryOptions options = CheckQuery (node, true);
|
|
|
|
Task[] tasks = Process (node, call, (n, o) => n.GetEnumerables (o), options);
|
|
Task.WaitAll (tasks, options.Token);
|
|
}
|
|
|
|
internal static Action ProcessAndCallback<T> (QueryBaseNode<T> node, Action<T> call,
|
|
Action callback, QueryOptions options)
|
|
{
|
|
Task[] tasks = Process (node, call, (n, o) => n.GetEnumerables (o), options);
|
|
Task.Factory.ContinueWhenAll (tasks, (_) => callback ());
|
|
|
|
return () => Task.WaitAll (tasks, options.Token);
|
|
}
|
|
|
|
internal static Action ProcessAndCallback<T> (QueryBaseNode<T> node, Action<KeyValuePair<long, T>> call,
|
|
Action callback, QueryOptions options)
|
|
{
|
|
return ProcessAndCallback<T> (node, call, null, callback, options);
|
|
}
|
|
|
|
internal static Action ProcessAndCallback<T> (QueryBaseNode<T> node, Action<KeyValuePair<long, T>> call,
|
|
Action endAction,
|
|
Action callback, QueryOptions options)
|
|
{
|
|
Task[] tasks = Process (node, call, (n, o) => n.GetOrderedEnumerables (o), endAction, options);
|
|
Task.Factory.ContinueWhenAll (tasks, (_) => callback ());
|
|
|
|
return () => Task.WaitAll (tasks, options.Token);
|
|
}
|
|
|
|
internal static void ProcessAndAggregate<T, U> (QueryBaseNode<T> node,
|
|
Func<U> seedFunc,
|
|
Func<U, T, U> localCall,
|
|
Action<IList<U>> call)
|
|
{
|
|
QueryOptions options = CheckQuery (node, true);
|
|
|
|
IList<IEnumerable<T>> enumerables = node.GetEnumerables (options);
|
|
U[] locals = new U[enumerables.Count];
|
|
Task[] tasks = new Task[enumerables.Count];
|
|
|
|
bool init = false;
|
|
if (seedFunc != null) {
|
|
for (int i = 0; i < locals.Length; i++)
|
|
locals[i] = seedFunc ();
|
|
init = true;
|
|
}
|
|
|
|
for (int i = 0; i < tasks.Length; i++) {
|
|
int index = i;
|
|
tasks[i] = Task.Factory.StartNew (() => {
|
|
foreach (T item in enumerables[index]) {
|
|
// This is from specific operators
|
|
if (options.ImplementerToken.IsCancellationRequested)
|
|
break;
|
|
if (options.Token.IsCancellationRequested)
|
|
throw new OperationCanceledException (options.Token);
|
|
|
|
if (!init) {
|
|
init = true;
|
|
// HACK: TODO: omfwtfitsomuchsucks
|
|
locals[index] = (U)(object)item;
|
|
continue;
|
|
}
|
|
|
|
U acc = locals[index];
|
|
locals[index] = localCall (acc, item);
|
|
}
|
|
}, options.Token);
|
|
}
|
|
|
|
Task.WaitAll (tasks, options.Token);
|
|
|
|
if (call != null)
|
|
call (locals);
|
|
}
|
|
}
|
|
}
|
|
#endif |