124 lines
3.6 KiB
C#
124 lines
3.6 KiB
C#
#if CSHARP_7_OR_LATER || (UNITY_2018_3_OR_NEWER && (NET_STANDARD_2_0 || NET_4_6))
|
|
#pragma warning disable CS1591 // Missing XML comment for publicly visible type or member
|
|
|
|
using System;
|
|
using System.Threading;
|
|
|
|
namespace UniRx.Async.Internal
|
|
{
|
|
internal class ContinuationQueue
|
|
{
|
|
const int MaxArrayLength = 0X7FEFFFFF;
|
|
const int InitialSize = 16;
|
|
|
|
SpinLock gate = new SpinLock();
|
|
bool dequing = false;
|
|
|
|
int actionListCount = 0;
|
|
Action[] actionList = new Action[InitialSize];
|
|
|
|
int waitingListCount = 0;
|
|
Action[] waitingList = new Action[InitialSize];
|
|
|
|
public void Enqueue(Action continuation)
|
|
{
|
|
bool lockTaken = false;
|
|
try
|
|
{
|
|
gate.Enter(ref lockTaken);
|
|
|
|
if (dequing)
|
|
{
|
|
// Ensure Capacity
|
|
if (waitingList.Length == waitingListCount)
|
|
{
|
|
var newLength = waitingListCount * 2;
|
|
if ((uint)newLength > MaxArrayLength) newLength = MaxArrayLength;
|
|
|
|
var newArray = new Action[newLength];
|
|
Array.Copy(waitingList, newArray, waitingListCount);
|
|
waitingList = newArray;
|
|
}
|
|
waitingList[waitingListCount] = continuation;
|
|
waitingListCount++;
|
|
}
|
|
else
|
|
{
|
|
// Ensure Capacity
|
|
if (actionList.Length == actionListCount)
|
|
{
|
|
var newLength = actionListCount * 2;
|
|
if ((uint)newLength > MaxArrayLength) newLength = MaxArrayLength;
|
|
|
|
var newArray = new Action[newLength];
|
|
Array.Copy(actionList, newArray, actionListCount);
|
|
actionList = newArray;
|
|
}
|
|
actionList[actionListCount] = continuation;
|
|
actionListCount++;
|
|
}
|
|
}
|
|
finally
|
|
{
|
|
if (lockTaken) gate.Exit(false);
|
|
}
|
|
}
|
|
|
|
public void Clear()
|
|
{
|
|
actionListCount = 0;
|
|
actionList = new Action[InitialSize];
|
|
|
|
waitingListCount = 0;
|
|
waitingList = new Action[InitialSize];
|
|
}
|
|
|
|
public void Run()
|
|
{
|
|
{
|
|
bool lockTaken = false;
|
|
try
|
|
{
|
|
gate.Enter(ref lockTaken);
|
|
if (actionListCount == 0) return;
|
|
dequing = true;
|
|
}
|
|
finally
|
|
{
|
|
if (lockTaken) gate.Exit(false);
|
|
}
|
|
}
|
|
|
|
for (int i = 0; i < actionListCount; i++)
|
|
{
|
|
var action = actionList[i];
|
|
actionList[i] = null;
|
|
|
|
action();
|
|
}
|
|
|
|
{
|
|
bool lockTaken = false;
|
|
try
|
|
{
|
|
gate.Enter(ref lockTaken);
|
|
dequing = false;
|
|
|
|
var swapTempActionList = actionList;
|
|
|
|
actionListCount = waitingListCount;
|
|
actionList = waitingList;
|
|
|
|
waitingListCount = 0;
|
|
waitingList = swapTempActionList;
|
|
}
|
|
finally
|
|
{
|
|
if (lockTaken) gate.Exit(false);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
#endif |