2018-12-18 05:33:36 +00:00
|
|
|
using Ryujinx.HLE.HOS.Kernel.Process;
|
2018-09-18 23:36:43 +00:00
|
|
|
using System;
|
|
|
|
using System.Collections.Generic;
|
|
|
|
using System.Linq;
|
|
|
|
|
2018-12-18 05:33:36 +00:00
|
|
|
namespace Ryujinx.HLE.HOS.Kernel.Threading
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
|
|
|
partial class KScheduler : IDisposable
|
|
|
|
{
|
|
|
|
public const int PrioritiesCount = 64;
|
|
|
|
public const int CpuCoresCount = 4;
|
|
|
|
|
|
|
|
private const int PreemptionPriorityCores012 = 59;
|
|
|
|
private const int PreemptionPriorityCore3 = 63;
|
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
private Horizon _system;
|
2018-09-18 23:36:43 +00:00
|
|
|
|
2018-12-05 00:52:39 +00:00
|
|
|
public KSchedulingData SchedulingData { get; private set; }
|
2018-09-18 23:36:43 +00:00
|
|
|
|
2018-12-05 00:52:39 +00:00
|
|
|
public KCoreContext[] CoreContexts { get; private set; }
|
2018-09-18 23:36:43 +00:00
|
|
|
|
|
|
|
public bool ThreadReselectionRequested { get; set; }
|
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
public KScheduler(Horizon system)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
_system = system;
|
2018-09-18 23:36:43 +00:00
|
|
|
|
|
|
|
SchedulingData = new KSchedulingData();
|
|
|
|
|
|
|
|
CoreManager = new HleCoreManager();
|
|
|
|
|
|
|
|
CoreContexts = new KCoreContext[CpuCoresCount];
|
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
for (int core = 0; core < CpuCoresCount; core++)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
CoreContexts[core] = new KCoreContext(this, CoreManager);
|
2018-09-18 23:36:43 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
private void PreemptThreads()
|
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
_system.CriticalSection.Enter();
|
2018-09-18 23:36:43 +00:00
|
|
|
|
|
|
|
PreemptThread(PreemptionPriorityCores012, 0);
|
|
|
|
PreemptThread(PreemptionPriorityCores012, 1);
|
|
|
|
PreemptThread(PreemptionPriorityCores012, 2);
|
|
|
|
PreemptThread(PreemptionPriorityCore3, 3);
|
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
_system.CriticalSection.Leave();
|
2018-09-18 23:36:43 +00:00
|
|
|
}
|
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
private void PreemptThread(int prio, int core)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
IEnumerable<KThread> scheduledThreads = SchedulingData.ScheduledThreads(core);
|
2018-09-18 23:36:43 +00:00
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
KThread selectedThread = scheduledThreads.FirstOrDefault(x => x.DynamicPriority == prio);
|
2018-09-18 23:36:43 +00:00
|
|
|
|
|
|
|
//Yield priority queue.
|
2018-12-06 11:16:24 +00:00
|
|
|
if (selectedThread != null)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
SchedulingData.Reschedule(prio, core, selectedThread);
|
2018-09-18 23:36:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
IEnumerable<KThread> SuitableCandidates()
|
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
foreach (KThread thread in SchedulingData.SuggestedThreads(core))
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
int srcCore = thread.CurrentCore;
|
2018-09-18 23:36:43 +00:00
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
if (srcCore >= 0)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
KThread highestPrioSrcCore = SchedulingData.ScheduledThreads(srcCore).FirstOrDefault();
|
2018-09-18 23:36:43 +00:00
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
if (highestPrioSrcCore != null && highestPrioSrcCore.DynamicPriority < 2)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
if (highestPrioSrcCore == thread)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//If the candidate was scheduled after the current thread, then it's not worth it.
|
2018-12-06 11:16:24 +00:00
|
|
|
if (selectedThread == null || selectedThread.LastScheduledTime >= thread.LastScheduledTime)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
yield return thread;
|
2018-09-18 23:36:43 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//Select candidate threads that could run on this core.
|
|
|
|
//Only take into account threads that are not yet selected.
|
2018-12-06 11:16:24 +00:00
|
|
|
KThread dst = SuitableCandidates().FirstOrDefault(x => x.DynamicPriority == prio);
|
2018-09-18 23:36:43 +00:00
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
if (dst != null)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
SchedulingData.TransferToCore(prio, core, dst);
|
2018-09-18 23:36:43 +00:00
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
selectedThread = dst;
|
2018-09-18 23:36:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//If the priority of the currently selected thread is lower than preemption priority,
|
|
|
|
//then allow threads with lower priorities to be selected aswell.
|
2018-12-06 11:16:24 +00:00
|
|
|
if (selectedThread != null && selectedThread.DynamicPriority > prio)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
Func<KThread, bool> predicate = x => x.DynamicPriority >= selectedThread.DynamicPriority;
|
2018-09-18 23:36:43 +00:00
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
dst = SuitableCandidates().FirstOrDefault(predicate);
|
2018-09-18 23:36:43 +00:00
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
if (dst != null)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
SchedulingData.TransferToCore(dst.DynamicPriority, core, dst);
|
2018-09-18 23:36:43 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
ThreadReselectionRequested = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
public void SelectThreads()
|
|
|
|
{
|
|
|
|
ThreadReselectionRequested = false;
|
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
for (int core = 0; core < CpuCoresCount; core++)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
KThread thread = SchedulingData.ScheduledThreads(core).FirstOrDefault();
|
2018-09-18 23:36:43 +00:00
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
CoreContexts[core].SelectThread(thread);
|
2018-09-18 23:36:43 +00:00
|
|
|
}
|
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
for (int core = 0; core < CpuCoresCount; core++)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
|
|
|
//If the core is not idle (there's already a thread running on it),
|
|
|
|
//then we don't need to attempt load balancing.
|
2018-12-06 11:16:24 +00:00
|
|
|
if (SchedulingData.ScheduledThreads(core).Any())
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
int[] srcCoresHighestPrioThreads = new int[CpuCoresCount];
|
2018-09-18 23:36:43 +00:00
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
int srcCoresHighestPrioThreadsCount = 0;
|
2018-09-18 23:36:43 +00:00
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
KThread dst = null;
|
2018-09-18 23:36:43 +00:00
|
|
|
|
|
|
|
//Select candidate threads that could run on this core.
|
|
|
|
//Give preference to threads that are not yet selected.
|
2018-12-06 11:16:24 +00:00
|
|
|
foreach (KThread thread in SchedulingData.SuggestedThreads(core))
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
if (thread.CurrentCore < 0 || thread != CoreContexts[thread.CurrentCore].SelectedThread)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
dst = thread;
|
2018-09-18 23:36:43 +00:00
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
srcCoresHighestPrioThreads[srcCoresHighestPrioThreadsCount++] = thread.CurrentCore;
|
2018-09-18 23:36:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//Not yet selected candidate found.
|
2018-12-06 11:16:24 +00:00
|
|
|
if (dst != null)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
|
|
|
//Priorities < 2 are used for the kernel message dispatching
|
|
|
|
//threads, we should skip load balancing entirely.
|
2018-12-06 11:16:24 +00:00
|
|
|
if (dst.DynamicPriority >= 2)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
SchedulingData.TransferToCore(dst.DynamicPriority, core, dst);
|
2018-09-18 23:36:43 +00:00
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
CoreContexts[core].SelectThread(dst);
|
2018-09-18 23:36:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
//All candiates are already selected, choose the best one
|
|
|
|
//(the first one that doesn't make the source core idle if moved).
|
2018-12-06 11:16:24 +00:00
|
|
|
for (int index = 0; index < srcCoresHighestPrioThreadsCount; index++)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
int srcCore = srcCoresHighestPrioThreads[index];
|
2018-09-18 23:36:43 +00:00
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
KThread src = SchedulingData.ScheduledThreads(srcCore).ElementAtOrDefault(1);
|
2018-09-18 23:36:43 +00:00
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
if (src != null)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
|
|
|
//Run the second thread on the queue on the source core,
|
|
|
|
//move the first one to the current core.
|
2018-12-06 11:16:24 +00:00
|
|
|
KThread origSelectedCoreSrc = CoreContexts[srcCore].SelectedThread;
|
2018-09-18 23:36:43 +00:00
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
CoreContexts[srcCore].SelectThread(src);
|
2018-09-18 23:36:43 +00:00
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
SchedulingData.TransferToCore(origSelectedCoreSrc.DynamicPriority, core, origSelectedCoreSrc);
|
2018-09-18 23:36:43 +00:00
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
CoreContexts[core].SelectThread(origSelectedCoreSrc);
|
2018-09-18 23:36:43 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
public KThread GetCurrentThread()
|
|
|
|
{
|
|
|
|
lock (CoreContexts)
|
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
for (int core = 0; core < CpuCoresCount; core++)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
if (CoreContexts[core].CurrentThread?.Context.IsCurrentThread() ?? false)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
return CoreContexts[core].CurrentThread;
|
2018-09-18 23:36:43 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-01-18 22:26:39 +00:00
|
|
|
return GetDummyThread();
|
|
|
|
|
2018-09-18 23:36:43 +00:00
|
|
|
throw new InvalidOperationException("Current thread is not scheduled!");
|
|
|
|
}
|
|
|
|
|
2019-01-18 22:26:39 +00:00
|
|
|
private KThread _dummyThread;
|
|
|
|
|
|
|
|
private KThread GetDummyThread()
|
|
|
|
{
|
|
|
|
if (_dummyThread != null)
|
|
|
|
{
|
|
|
|
return _dummyThread;
|
|
|
|
}
|
|
|
|
|
|
|
|
KProcess dummyProcess = new KProcess(_system);
|
|
|
|
|
|
|
|
KThread dummyThread = new KThread(_system);
|
|
|
|
|
|
|
|
dummyThread.Initialize(0, 0, 0, 44, 0, dummyProcess, ThreadType.Dummy);
|
|
|
|
|
|
|
|
return _dummyThread = dummyThread;
|
|
|
|
}
|
|
|
|
|
2018-11-28 22:18:09 +00:00
|
|
|
public KProcess GetCurrentProcess()
|
|
|
|
{
|
|
|
|
return GetCurrentThread().Owner;
|
|
|
|
}
|
|
|
|
|
2018-09-18 23:36:43 +00:00
|
|
|
public void Dispose()
|
|
|
|
{
|
|
|
|
Dispose(true);
|
|
|
|
}
|
|
|
|
|
2018-12-06 11:16:24 +00:00
|
|
|
protected virtual void Dispose(bool disposing)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
if (disposing)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2018-12-06 11:16:24 +00:00
|
|
|
_keepPreempting = false;
|
2018-09-18 23:36:43 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|