2018-06-11 02:46:42 +02:00
|
|
|
namespace Ryujinx.HLE.OsHle.Handles
|
2018-05-13 05:22:42 +02:00
|
|
|
{
|
|
|
|
class ThreadQueue
|
|
|
|
{
|
2018-06-09 23:19:14 +02:00
|
|
|
private const int LowestPriority = 0x3f;
|
2018-05-13 05:22:42 +02:00
|
|
|
|
|
|
|
private SchedulerThread Head;
|
|
|
|
|
|
|
|
private object ListLock;
|
|
|
|
|
|
|
|
public ThreadQueue()
|
|
|
|
{
|
|
|
|
ListLock = new object();
|
|
|
|
}
|
|
|
|
|
|
|
|
public void Push(SchedulerThread Wait)
|
|
|
|
{
|
|
|
|
lock (ListLock)
|
|
|
|
{
|
|
|
|
//Ensure that we're not creating circular references
|
|
|
|
//by adding a thread that is already on the list.
|
|
|
|
if (HasThread(Wait))
|
|
|
|
{
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2018-06-22 04:05:42 +02:00
|
|
|
if (Head == null || Head.Thread.ActualPriority >= Wait.Thread.ActualPriority)
|
2018-05-13 05:22:42 +02:00
|
|
|
{
|
|
|
|
Wait.Next = Head;
|
|
|
|
|
|
|
|
Head = Wait;
|
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
SchedulerThread Curr = Head;
|
|
|
|
|
|
|
|
while (Curr.Next != null)
|
|
|
|
{
|
2018-06-22 04:05:42 +02:00
|
|
|
if (Curr.Next.Thread.ActualPriority >= Wait.Thread.ActualPriority)
|
2018-05-13 05:22:42 +02:00
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
Curr = Curr.Next;
|
|
|
|
}
|
|
|
|
|
|
|
|
Wait.Next = Curr.Next;
|
|
|
|
Curr.Next = Wait;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
public SchedulerThread Pop(int Core, int MinPriority = LowestPriority)
|
|
|
|
{
|
|
|
|
lock (ListLock)
|
|
|
|
{
|
|
|
|
int CoreMask = 1 << Core;
|
|
|
|
|
|
|
|
SchedulerThread Prev = null;
|
|
|
|
SchedulerThread Curr = Head;
|
|
|
|
|
|
|
|
while (Curr != null)
|
|
|
|
{
|
|
|
|
KThread Thread = Curr.Thread;
|
|
|
|
|
2018-06-09 23:19:14 +02:00
|
|
|
if (Thread.ActualPriority <= MinPriority && (Thread.CoreMask & CoreMask) != 0)
|
2018-05-13 05:22:42 +02:00
|
|
|
{
|
|
|
|
if (Prev != null)
|
|
|
|
{
|
|
|
|
Prev.Next = Curr.Next;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
Head = Head.Next;
|
|
|
|
}
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
Prev = Curr;
|
|
|
|
Curr = Curr.Next;
|
|
|
|
}
|
|
|
|
|
|
|
|
return Curr;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
public bool Remove(SchedulerThread Thread)
|
|
|
|
{
|
|
|
|
lock (ListLock)
|
|
|
|
{
|
|
|
|
if (Head == null)
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
else if (Head == Thread)
|
|
|
|
{
|
|
|
|
Head = Head.Next;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
SchedulerThread Prev = Head;
|
|
|
|
SchedulerThread Curr = Head.Next;
|
|
|
|
|
|
|
|
while (Curr != null)
|
|
|
|
{
|
|
|
|
if (Curr == Thread)
|
|
|
|
{
|
|
|
|
Prev.Next = Curr.Next;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
Prev = Curr;
|
|
|
|
Curr = Curr.Next;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
public bool Resort(SchedulerThread Thread)
|
|
|
|
{
|
|
|
|
lock (ListLock)
|
|
|
|
{
|
|
|
|
if (Remove(Thread))
|
|
|
|
{
|
|
|
|
Push(Thread);
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
public bool HasThread(SchedulerThread Thread)
|
|
|
|
{
|
|
|
|
lock (ListLock)
|
|
|
|
{
|
|
|
|
SchedulerThread Curr = Head;
|
|
|
|
|
|
|
|
while (Curr != null)
|
|
|
|
{
|
|
|
|
if (Curr == Thread)
|
|
|
|
{
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
Curr = Curr.Next;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|