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;
|
|
|
|
|
2020-05-04 03:41:29 +00:00
|
|
|
private readonly KernelContext _context;
|
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; }
|
|
|
|
|
2020-05-04 03:41:29 +00:00
|
|
|
public KScheduler(KernelContext context)
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
2020-05-04 03:41:29 +00:00
|
|
|
_context = context;
|
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()
|
|
|
|
{
|
2020-05-04 03:41:29 +00:00
|
|
|
_context.CriticalSection.Enter();
|
2018-09-18 23:36:43 +00:00
|
|
|
|
|
|
|
PreemptThread(PreemptionPriorityCores012, 0);
|
|
|
|
PreemptThread(PreemptionPriorityCores012, 1);
|
|
|
|
PreemptThread(PreemptionPriorityCores012, 2);
|
|
|
|
PreemptThread(PreemptionPriorityCore3, 3);
|
|
|
|
|
2020-05-04 03:41:29 +00:00
|
|
|
_context.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
|
|
|
|
2019-07-02 02:39:22 +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;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-07-02 02:39:22 +00:00
|
|
|
// 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
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-07-02 02:39:22 +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
|
|
|
}
|
|
|
|
|
2019-07-02 02:39:22 +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
|
|
|
{
|
2019-07-02 02:39:22 +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
|
|
|
|
2019-07-02 02:39:22 +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
|
|
|
}
|
|
|
|
|
2019-07-02 02:39:22 +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
|
|
|
{
|
2019-07-02 02:39:22 +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;
|
|
|
|
}
|
|
|
|
|
2019-07-02 02:39:22 +00:00
|
|
|
// All candidates 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
|
|
|
{
|
2019-07-02 02:39:22 +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()
|
2020-07-30 13:16:41 +00:00
|
|
|
{
|
|
|
|
return GetCurrentThreadOrNull() ?? GetDummyThread();
|
|
|
|
}
|
|
|
|
|
|
|
|
public KThread GetCurrentThreadOrNull()
|
2018-09-18 23:36:43 +00:00
|
|
|
{
|
|
|
|
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
|
|
|
{
|
Add a new JIT compiler for CPU code (#693)
* Start of the ARMeilleure project
* Refactoring around the old IRAdapter, now renamed to PreAllocator
* Optimize the LowestBitSet method
* Add CLZ support and fix CLS implementation
* Add missing Equals and GetHashCode overrides on some structs, misc small tweaks
* Implement the ByteSwap IR instruction, and some refactoring on the assembler
* Implement the DivideUI IR instruction and fix 64-bits IDIV
* Correct constant operand type on CSINC
* Move division instructions implementation to InstEmitDiv
* Fix destination type for the ConditionalSelect IR instruction
* Implement UMULH and SMULH, with new IR instructions
* Fix some issues with shift instructions
* Fix constant types for BFM instructions
* Fix up new tests using the new V128 struct
* Update tests
* Move DIV tests to a separate file
* Add support for calls, and some instructions that depends on them
* Start adding support for SIMD & FP types, along with some of the related ARM instructions
* Fix some typos and the divide instruction with FP operands
* Fix wrong method call on Clz_V
* Implement ARM FP & SIMD move instructions, Saddlv_V, and misc. fixes
* Implement SIMD logical instructions and more misc. fixes
* Fix PSRAD x86 instruction encoding, TRN, UABD and UABDL implementations
* Implement float conversion instruction, merge in LDj3SNuD fixes, and some other misc. fixes
* Implement SIMD shift instruction and fix Dup_V
* Add SCVTF and UCVTF (vector, fixed-point) variants to the opcode table
* Fix check with tolerance on tester
* Implement FP & SIMD comparison instructions, and some fixes
* Update FCVT (Scalar) encoding on the table to support the Half-float variants
* Support passing V128 structs, some cleanup on the register allocator, merge LDj3SNuD fixes
* Use old memory access methods, made a start on SIMD memory insts support, some fixes
* Fix float constant passed to functions, save and restore non-volatile XMM registers, other fixes
* Fix arguments count with struct return values, other fixes
* More instructions
* Misc. fixes and integrate LDj3SNuD fixes
* Update tests
* Add a faster linear scan allocator, unwinding support on windows, and other changes
* Update Ryujinx.HLE
* Update Ryujinx.Graphics
* Fix V128 return pointer passing, RCX is clobbered
* Update Ryujinx.Tests
* Update ITimeZoneService
* Stop using GetFunctionPointer as that can't be called from native code, misc. fixes and tweaks
* Use generic GetFunctionPointerForDelegate method and other tweaks
* Some refactoring on the code generator, assert on invalid operations and use a separate enum for intrinsics
* Remove some unused code on the assembler
* Fix REX.W prefix regression on float conversion instructions, add some sort of profiler
* Add hardware capability detection
* Fix regression on Sha1h and revert Fcm** changes
* Add SSE2-only paths on vector extract and insert, some refactoring on the pre-allocator
* Fix silly mistake introduced on last commit on CpuId
* Generate inline stack probes when the stack allocation is too large
* Initial support for the System-V ABI
* Support multiple destination operands
* Fix SSE2 VectorInsert8 path, and other fixes
* Change placement of XMM callee save and restore code to match other compilers
* Rename Dest to Destination and Inst to Instruction
* Fix a regression related to calls and the V128 type
* Add an extra space on comments to match code style
* Some refactoring
* Fix vector insert FP32 SSE2 path
* Port over the ARM32 instructions
* Avoid memory protection races on JIT Cache
* Another fix on VectorInsert FP32 (thanks to LDj3SNuD
* Float operands don't need to use the same register when VEX is supported
* Add a new register allocator, higher quality code for hot code (tier up), and other tweaks
* Some nits, small improvements on the pre allocator
* CpuThreadState is gone
* Allow changing CPU emulators with a config entry
* Add runtime identifiers on the ARMeilleure project
* Allow switching between CPUs through a config entry (pt. 2)
* Change win10-x64 to win-x64 on projects
* Update the Ryujinx project to use ARMeilleure
* Ensure that the selected register is valid on the hybrid allocator
* Allow exiting on returns to 0 (should fix test regression)
* Remove register assignments for most used variables on the hybrid allocator
* Do not use fixed registers as spill temp
* Add missing namespace and remove unneeded using
* Address PR feedback
* Fix types, etc
* Enable AssumeStrictAbiCompliance by default
* Ensure that Spill and Fill don't load or store any more than necessary
2019-08-08 18:56:22 +00:00
|
|
|
if (CoreContexts[core].CurrentThread?.IsCurrentHostThread() ?? 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
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-07-30 13:16:41 +00:00
|
|
|
return null;
|
2018-09-18 23:36:43 +00:00
|
|
|
}
|
|
|
|
|
2019-01-18 22:26:39 +00:00
|
|
|
private KThread _dummyThread;
|
|
|
|
|
|
|
|
private KThread GetDummyThread()
|
|
|
|
{
|
|
|
|
if (_dummyThread != null)
|
|
|
|
{
|
|
|
|
return _dummyThread;
|
|
|
|
}
|
|
|
|
|
2020-05-04 03:41:29 +00:00
|
|
|
KProcess dummyProcess = new KProcess(_context);
|
2019-01-18 22:26:39 +00:00
|
|
|
|
2020-12-01 23:23:43 +00:00
|
|
|
dummyProcess.HandleTable.Initialize(1024);
|
|
|
|
|
2020-05-04 03:41:29 +00:00
|
|
|
KThread dummyThread = new KThread(_context);
|
2019-01-18 22:26:39 +00:00
|
|
|
|
|
|
|
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
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|