mirror of
https://git.naxdy.org/Mirror/Ryujinx.git
synced 2024-11-15 17:45:26 +00:00
00579927e4
* Initial implementation of KProcess * Some improvements to the memory manager, implement back guest stack trace printing * Better GetInfo implementation, improve checking in some places with information from process capabilities * Allow the cpu to read/write from the correct memory locations for accesses crossing a page boundary * Change long -> ulong for address/size on memory related methods to avoid unnecessary casts * Attempt at implementing ldr:ro with new KProcess * Allow BSS with size 0 on ldr:ro * Add checking for memory block slab heap usage, return errors if full, exit gracefully * Use KMemoryBlockSize const from KMemoryManager * Allow all methods to read from non-contiguous locations * Fix for TransactParcelAuto * Address PR feedback, additionally fix some small issues related to the KIP loader and implement SVCs GetProcessId, GetProcessList, GetSystemInfo, CreatePort and ManageNamedPort * Fix wrong check for source pages count from page list on MapPhysicalMemory * Fix some issues with UnloadNro on ldr:ro
207 lines
4.9 KiB
C#
207 lines
4.9 KiB
C#
using System;
|
|
|
|
namespace Ryujinx.HLE.HOS.Kernel
|
|
{
|
|
class KHandleTable
|
|
{
|
|
private const int SelfThreadHandle = (0x1ffff << 15) | 0;
|
|
private const int SelfProcessHandle = (0x1ffff << 15) | 1;
|
|
|
|
private Horizon System;
|
|
|
|
private KHandleEntry[] Table;
|
|
|
|
private KHandleEntry TableHead;
|
|
private KHandleEntry NextFreeEntry;
|
|
|
|
private int ActiveSlotsCount;
|
|
|
|
private int Size;
|
|
|
|
private ushort IdCounter;
|
|
|
|
public KHandleTable(Horizon System)
|
|
{
|
|
this.System = System;
|
|
}
|
|
|
|
public KernelResult Initialize(int Size)
|
|
{
|
|
if ((uint)Size > 1024)
|
|
{
|
|
return KernelResult.OutOfMemory;
|
|
}
|
|
|
|
if (Size < 1)
|
|
{
|
|
Size = 1024;
|
|
}
|
|
|
|
this.Size = Size;
|
|
|
|
IdCounter = 1;
|
|
|
|
Table = new KHandleEntry[Size];
|
|
|
|
TableHead = new KHandleEntry(0);
|
|
|
|
KHandleEntry Entry = TableHead;
|
|
|
|
for (int Index = 0; Index < Size; Index++)
|
|
{
|
|
Table[Index] = Entry;
|
|
|
|
Entry.Next = new KHandleEntry(Index + 1);
|
|
|
|
Entry = Entry.Next;
|
|
}
|
|
|
|
Table[Size - 1].Next = null;
|
|
|
|
NextFreeEntry = TableHead;
|
|
|
|
return KernelResult.Success;
|
|
}
|
|
|
|
public KernelResult GenerateHandle(object Obj, out int Handle)
|
|
{
|
|
Handle = 0;
|
|
|
|
lock (Table)
|
|
{
|
|
if (ActiveSlotsCount >= Size)
|
|
{
|
|
return KernelResult.HandleTableFull;
|
|
}
|
|
|
|
KHandleEntry Entry = NextFreeEntry;
|
|
|
|
NextFreeEntry = Entry.Next;
|
|
|
|
Entry.Obj = Obj;
|
|
Entry.HandleId = IdCounter;
|
|
|
|
ActiveSlotsCount++;
|
|
|
|
Handle = (int)((IdCounter << 15) & (uint)0xffff8000) | Entry.Index;
|
|
|
|
if ((short)(IdCounter + 1) >= 0)
|
|
{
|
|
IdCounter++;
|
|
}
|
|
else
|
|
{
|
|
IdCounter = 1;
|
|
}
|
|
}
|
|
|
|
return KernelResult.Success;
|
|
}
|
|
|
|
public bool CloseHandle(int Handle)
|
|
{
|
|
if ((Handle >> 30) != 0 ||
|
|
Handle == SelfThreadHandle ||
|
|
Handle == SelfProcessHandle)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
int Index = (Handle >> 0) & 0x7fff;
|
|
int HandleId = (Handle >> 15);
|
|
|
|
bool Result = false;
|
|
|
|
lock (Table)
|
|
{
|
|
if (HandleId != 0 && Index < Size)
|
|
{
|
|
KHandleEntry Entry = Table[Index];
|
|
|
|
if (Entry.Obj != null && Entry.HandleId == HandleId)
|
|
{
|
|
Entry.Obj = null;
|
|
Entry.Next = NextFreeEntry;
|
|
|
|
NextFreeEntry = Entry;
|
|
|
|
ActiveSlotsCount--;
|
|
|
|
Result = true;
|
|
}
|
|
}
|
|
}
|
|
|
|
return Result;
|
|
}
|
|
|
|
public T GetObject<T>(int Handle)
|
|
{
|
|
int Index = (Handle >> 0) & 0x7fff;
|
|
int HandleId = (Handle >> 15);
|
|
|
|
lock (Table)
|
|
{
|
|
if ((Handle >> 30) == 0 && HandleId != 0)
|
|
{
|
|
KHandleEntry Entry = Table[Index];
|
|
|
|
if (Entry.HandleId == HandleId && Entry.Obj is T Obj)
|
|
{
|
|
return Obj;
|
|
}
|
|
}
|
|
}
|
|
|
|
return default(T);
|
|
}
|
|
|
|
public KThread GetKThread(int Handle)
|
|
{
|
|
if (Handle == SelfThreadHandle)
|
|
{
|
|
return System.Scheduler.GetCurrentThread();
|
|
}
|
|
else
|
|
{
|
|
return GetObject<KThread>(Handle);
|
|
}
|
|
}
|
|
|
|
public KProcess GetKProcess(int Handle)
|
|
{
|
|
if (Handle == SelfProcessHandle)
|
|
{
|
|
return System.Scheduler.GetCurrentProcess();
|
|
}
|
|
else
|
|
{
|
|
return GetObject<KProcess>(Handle);
|
|
}
|
|
}
|
|
|
|
public void Destroy()
|
|
{
|
|
lock (Table)
|
|
{
|
|
for (int Index = 0; Index < Size; Index++)
|
|
{
|
|
KHandleEntry Entry = Table[Index];
|
|
|
|
if (Entry.Obj != null)
|
|
{
|
|
if (Entry.Obj is IDisposable DisposableObj)
|
|
{
|
|
DisposableObj.Dispose();
|
|
}
|
|
|
|
Entry.Obj = null;
|
|
Entry.Next = NextFreeEntry;
|
|
|
|
NextFreeEntry = Entry;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
} |