mirror of
https://github.com/Ryujinx/Ryujinx.git
synced 2024-08-20 15:48:43 +02:00
87 lines
2.1 KiB
C#
87 lines
2.1 KiB
C#
using Ryujinx.Common.Collections;
|
|
using System;
|
|
|
|
namespace Ryujinx.Memory.WindowsShared
|
|
{
|
|
/// <summary>
|
|
/// A intrusive Red-Black Tree that also supports getting nodes overlapping a given range.
|
|
/// </summary>
|
|
/// <typeparam name="T">Type of the value stored on the node</typeparam>
|
|
class MappingTree<T> : IntrusiveRedBlackTree<RangeNode<T>>
|
|
{
|
|
private const int ArrayGrowthSize = 16;
|
|
|
|
public int GetNodes(ulong start, ulong end, ref RangeNode<T>[] overlaps, int overlapCount = 0)
|
|
{
|
|
RangeNode<T> node = this.GetNodeByKey(start);
|
|
|
|
for (; node != null; node = node.Successor)
|
|
{
|
|
if (overlaps.Length <= overlapCount)
|
|
{
|
|
Array.Resize(ref overlaps, overlapCount + ArrayGrowthSize);
|
|
}
|
|
|
|
overlaps[overlapCount++] = node;
|
|
|
|
if (node.End >= end)
|
|
{
|
|
break;
|
|
}
|
|
}
|
|
|
|
return overlapCount;
|
|
}
|
|
}
|
|
|
|
class RangeNode<T> : IntrusiveRedBlackTreeNode<RangeNode<T>>, IComparable<RangeNode<T>>, IComparable<ulong>
|
|
{
|
|
public ulong Start { get; }
|
|
public ulong End { get; private set; }
|
|
public T Value { get; }
|
|
|
|
public RangeNode(ulong start, ulong end, T value)
|
|
{
|
|
Start = start;
|
|
End = end;
|
|
Value = value;
|
|
}
|
|
|
|
public void Extend(ulong sizeDelta)
|
|
{
|
|
End += sizeDelta;
|
|
}
|
|
|
|
public int CompareTo(RangeNode<T> other)
|
|
{
|
|
if (Start < other.Start)
|
|
{
|
|
return -1;
|
|
}
|
|
else if (Start <= other.End - 1UL)
|
|
{
|
|
return 0;
|
|
}
|
|
else
|
|
{
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
public int CompareTo(ulong address)
|
|
{
|
|
if (address < Start)
|
|
{
|
|
return 1;
|
|
}
|
|
else if (address <= End - 1UL)
|
|
{
|
|
return 0;
|
|
}
|
|
else
|
|
{
|
|
return -1;
|
|
}
|
|
}
|
|
}
|
|
} |