aboutsummaryrefslogtreecommitdiff
path: root/Ryujinx.HLE/HOS/Kernel/KSlabHeap.cs
diff options
context:
space:
mode:
authorgdkchan <gab.dark.100@gmail.com>2018-11-28 20:18:09 -0200
committerGitHub <noreply@github.com>2018-11-28 20:18:09 -0200
commit00579927e43bf55ee06ae02933c1e755fb4120eb (patch)
tree0fd06db7b28e0accf87b465ec6f4dc74691febab /Ryujinx.HLE/HOS/Kernel/KSlabHeap.cs
parente7fe7d724778535f8eff390abef54274a343c0b7 (diff)
Better process implementation (#491)
* 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
Diffstat (limited to 'Ryujinx.HLE/HOS/Kernel/KSlabHeap.cs')
-rw-r--r--Ryujinx.HLE/HOS/Kernel/KSlabHeap.cs50
1 files changed, 50 insertions, 0 deletions
diff --git a/Ryujinx.HLE/HOS/Kernel/KSlabHeap.cs b/Ryujinx.HLE/HOS/Kernel/KSlabHeap.cs
new file mode 100644
index 00000000..2d6b3ca0
--- /dev/null
+++ b/Ryujinx.HLE/HOS/Kernel/KSlabHeap.cs
@@ -0,0 +1,50 @@
+using System.Collections.Generic;
+
+namespace Ryujinx.HLE.HOS.Kernel
+{
+ class KSlabHeap
+ {
+ private LinkedList<ulong> Items;
+
+ public KSlabHeap(ulong Pa, ulong ItemSize, ulong Size)
+ {
+ Items = new LinkedList<ulong>();
+
+ int ItemsCount = (int)(Size / ItemSize);
+
+ for (int Index = 0; Index < ItemsCount; Index++)
+ {
+ Items.AddLast(Pa);
+
+ Pa += ItemSize;
+ }
+ }
+
+ public bool TryGetItem(out ulong Pa)
+ {
+ lock (Items)
+ {
+ if (Items.First != null)
+ {
+ Pa = Items.First.Value;
+
+ Items.RemoveFirst();
+
+ return true;
+ }
+ }
+
+ Pa = 0;
+
+ return false;
+ }
+
+ public void Free(ulong Pa)
+ {
+ lock (Items)
+ {
+ Items.AddFirst(Pa);
+ }
+ }
+ }
+} \ No newline at end of file