mirror of
https://github.com/GreemDev/Ryujinx.git
synced 2024-12-24 17:55:49 +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
83 lines
No EOL
2 KiB
C#
83 lines
No EOL
2 KiB
C#
using Ryujinx.Common;
|
|
using System;
|
|
|
|
namespace Ryujinx.HLE.HOS.Kernel
|
|
{
|
|
class KContextIdManager
|
|
{
|
|
private const int IdMasksCount = 8;
|
|
|
|
private int[] IdMasks;
|
|
|
|
private int NextFreeBitHint;
|
|
|
|
public KContextIdManager()
|
|
{
|
|
IdMasks = new int[IdMasksCount];
|
|
}
|
|
|
|
public int GetId()
|
|
{
|
|
lock (IdMasks)
|
|
{
|
|
int Id = 0;
|
|
|
|
if (!TestBit(NextFreeBitHint))
|
|
{
|
|
Id = NextFreeBitHint;
|
|
}
|
|
else
|
|
{
|
|
for (int Index = 0; Index < IdMasksCount; Index++)
|
|
{
|
|
int Mask = IdMasks[Index];
|
|
|
|
int FirstFreeBit = BitUtils.CountLeadingZeros32((Mask + 1) & ~Mask);
|
|
|
|
if (FirstFreeBit < 32)
|
|
{
|
|
int BaseBit = Index * 32 + 31;
|
|
|
|
Id = BaseBit - FirstFreeBit;
|
|
|
|
break;
|
|
}
|
|
else if (Index == IdMasksCount - 1)
|
|
{
|
|
throw new InvalidOperationException("Maximum number of Ids reached!");
|
|
}
|
|
}
|
|
}
|
|
|
|
NextFreeBitHint = Id + 1;
|
|
|
|
SetBit(Id);
|
|
|
|
return Id;
|
|
}
|
|
}
|
|
|
|
public void PutId(int Id)
|
|
{
|
|
lock (IdMasks)
|
|
{
|
|
ClearBit(Id);
|
|
}
|
|
}
|
|
|
|
private bool TestBit(int Bit)
|
|
{
|
|
return (IdMasks[NextFreeBitHint / 32] & (1 << (NextFreeBitHint & 31))) != 0;
|
|
}
|
|
|
|
private void SetBit(int Bit)
|
|
{
|
|
IdMasks[NextFreeBitHint / 32] |= (1 << (NextFreeBitHint & 31));
|
|
}
|
|
|
|
private void ClearBit(int Bit)
|
|
{
|
|
IdMasks[NextFreeBitHint / 32] &= ~(1 << (NextFreeBitHint & 31));
|
|
}
|
|
}
|
|
} |