Mirrors/Ryujinx
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Allocation free tree lookup

Browse source
This commit is contained in:
gdk 2022-08-30 22:26:40 -03:00 • committed by Mary-nyan
parent c646638680
commit 7dd69f2d0e
2 changed files with 24 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

20
Ryujinx.Memory/WindowsShared/MappingTree.cs
View file

@ -13,7 +13,7 @@ namespace Ryujinx.Memory.WindowsShared
public int GetNodes(ulong start, ulong end, ref RangeNode<T>[] overlaps, int overlapCount = 0)
{
RangeNode<T> node = GetNode(new RangeNode<T>(start, start + 1UL, default));
RangeNode<T> node = this.GetNodeByKey(start);
for (; node != null; node = node.Successor)
{
@ -34,7 +34,7 @@ namespace Ryujinx.Memory.WindowsShared
}
}
class RangeNode<T> : IntrusiveRedBlackTreeNode<RangeNode<T>>, IComparable<RangeNode<T>>
class RangeNode<T> : IntrusiveRedBlackTreeNode<RangeNode<T>>, IComparable<RangeNode<T>>, IComparable<ulong>
{
public ulong Start { get; }
public ulong End { get; private set; }
@ -67,5 +67,21 @@ namespace Ryujinx.Memory.WindowsShared
return 1;
}
}
public int CompareTo(ulong address)
{
if (address < Start)
{
return 1;
}
else if (address <= End - 1UL)
{
return 0;
}
else
{
return -1;
}
}
}
}