Ryujinx/Ryujinx.Graphics.Gpu/Memory/RangeList.cs

343 lines
11 KiB
C#
Raw Normal View History

using System;
2019-12-31 23:09:49 +01:00
using System.Collections;
2019-10-13 08:02:07 +02:00
using System.Collections.Generic;
namespace Ryujinx.Graphics.Gpu.Memory
{
/// <summary>
/// List of GPU resources with data on guest memory.
/// </summary>
/// <typeparam name="T">Type of the GPU resource</typeparam>
2019-12-31 23:37:00 +01:00
class RangeList<T> : IEnumerable<T> where T : IRange
2019-10-13 08:02:07 +02:00
{
private const int ArrayGrowthSize = 32;
2019-12-31 23:09:49 +01:00
private readonly List<T> _items;
2019-10-13 08:02:07 +02:00
/// <summary>
/// Creates a new GPU resources list.
/// </summary>
2019-10-13 08:02:07 +02:00
public RangeList()
{
_items = new List<T>();
}
/// <summary>
/// Adds a new item to the list.
/// </summary>
/// <param name="item">The item to be added</param>
2019-10-13 08:02:07 +02:00
public void Add(T item)
{
int index = BinarySearch(item.Address);
2019-10-13 08:02:07 +02:00
if (index < 0)
{
index = ~index;
2019-10-13 08:02:07 +02:00
}
_items.Insert(index, item);
2019-10-13 08:02:07 +02:00
}
/// <summary>
/// Removes an item from the list.
/// </summary>
/// <param name="item">The item to be removed</param>
/// <returns>True if the item was removed, or false if it was not found</returns>
2019-10-13 08:02:07 +02:00
public bool Remove(T item)
{
int index = BinarySearch(item.Address);
if (index >= 0)
2019-10-13 08:02:07 +02:00
{
while (index > 0 && _items[index - 1].Address == item.Address)
{
index--;
}
2019-10-13 08:02:07 +02:00
while (index < _items.Count)
2019-10-13 08:02:07 +02:00
{
if (_items[index].Equals(item))
2019-10-13 08:02:07 +02:00
{
_items.RemoveAt(index);
return true;
2019-10-13 08:02:07 +02:00
}
if (_items[index].Address > item.Address)
2019-10-13 08:02:07 +02:00
{
break;
}
2019-10-13 08:02:07 +02:00
index++;
}
}
2019-10-13 08:02:07 +02:00
return false;
}
2019-10-13 08:02:07 +02:00
/// <summary>
/// Gets the first item on the list overlapping in memory with the specified item.
2020-01-01 16:39:09 +01:00
/// </summary>
/// <remarks>
/// Despite the name, this has no ordering guarantees of the returned item.
/// It only ensures that the item returned overlaps the specified item.
2020-01-01 16:39:09 +01:00
/// </remarks>
/// <param name="item">Item to check for overlaps</param>
/// <returns>The overlapping item, or the default value for the type if none found</returns>
2019-10-13 08:02:07 +02:00
public T FindFirstOverlap(T item)
{
return FindFirstOverlap(item.Address, item.Size);
}
/// <summary>
/// Gets the first item on the list overlapping the specified memory range.
2020-01-01 16:39:09 +01:00
/// </summary>
/// <remarks>
/// Despite the name, this has no ordering guarantees of the returned item.
/// It only ensures that the item returned overlaps the specified memory range.
2020-01-01 16:39:09 +01:00
/// </remarks>
/// <param name="address">Start address of the range</param>
/// <param name="size">Size in bytes of the range</param>
/// <returns>The overlapping item, or the default value for the type if none found</returns>
2019-10-13 08:02:07 +02:00
public T FindFirstOverlap(ulong address, ulong size)
{
int index = BinarySearch(address, size);
2019-10-13 08:02:07 +02:00
if (index < 0)
{
return default(T);
2019-10-13 08:02:07 +02:00
}
return _items[index];
2019-10-13 08:02:07 +02:00
}
/// <summary>
/// Gets all items overlapping with the specified item in memory.
/// </summary>
/// <param name="item">Item to check for overlaps</param>
/// <param name="output">Output array where matches will be written. It is automatically resized to fit the results</param>
/// <returns>The number of overlapping items found</returns>
public int FindOverlaps(T item, ref T[] output)
2019-10-13 08:02:07 +02:00
{
return FindOverlaps(item.Address, item.Size, ref output);
2019-10-13 08:02:07 +02:00
}
/// <summary>
/// Gets all items on the list overlapping the specified memory range.
/// </summary>
/// <param name="address">Start address of the range</param>
/// <param name="size">Size in bytes of the range</param>
/// <param name="output">Output array where matches will be written. It is automatically resized to fit the results</param>
/// <returns>The number of overlapping items found</returns>
public int FindOverlaps(ulong address, ulong size, ref T[] output)
2019-10-13 08:02:07 +02:00
{
int outputIndex = 0;
2019-10-13 08:02:07 +02:00
ulong endAddress = address + size;
lock (_items)
{
foreach (T item in _items)
{
if (item.Address >= endAddress)
{
break;
}
if (item.OverlapsWith(address, size))
{
if (outputIndex == output.Length)
{
Array.Resize(ref output, outputIndex + ArrayGrowthSize);
}
output[outputIndex++] = item;
2019-10-13 08:02:07 +02:00
}
}
}
return outputIndex;
2019-10-13 08:02:07 +02:00
}
/// <summary>
/// Gets all items overlapping with the specified item in memory.
2020-01-01 16:39:09 +01:00
/// </summary>
/// <remarks>
/// This method only returns correct results if none of the items on the list overlaps with
/// each other. If that is not the case, this method should not be used.
/// This method is faster than the regular method to find all overlaps.
2020-01-01 16:39:09 +01:00
/// </remarks>
/// <param name="item">Item to check for overlaps</param>
/// <param name="output">Output array where matches will be written. It is automatically resized to fit the results</param>
/// <returns>The number of overlapping items found</returns>
public int FindOverlapsNonOverlapping(T item, ref T[] output)
{
return FindOverlapsNonOverlapping(item.Address, item.Size, ref output);
}
/// <summary>
/// Gets all items on the list overlapping the specified memory range.
2020-01-01 16:39:09 +01:00
/// </summary>
/// <remarks>
/// This method only returns correct results if none of the items on the list overlaps with
/// each other. If that is not the case, this method should not be used.
/// This method is faster than the regular method to find all overlaps.
2020-01-01 16:39:09 +01:00
/// </remarks>
/// <param name="address">Start address of the range</param>
/// <param name="size">Size in bytes of the range</param>
/// <param name="output">Output array where matches will be written. It is automatically resized to fit the results</param>
/// <returns>The number of overlapping items found</returns>
public int FindOverlapsNonOverlapping(ulong address, ulong size, ref T[] output)
2019-10-13 08:02:07 +02:00
{
// This is a bit faster than FindOverlaps, but only works
// when none of the items on the list overlaps with each other.
int outputIndex = 0;
2019-10-13 08:02:07 +02:00
int index = BinarySearch(address, size);
if (index >= 0)
2019-10-13 08:02:07 +02:00
{
while (index > 0 && _items[index - 1].OverlapsWith(address, size))
{
index--;
}
2019-10-13 08:02:07 +02:00
do
2019-10-13 08:02:07 +02:00
{
if (outputIndex == output.Length)
{
Array.Resize(ref output, outputIndex + ArrayGrowthSize);
}
output[outputIndex++] = _items[index++];
}
while (index < _items.Count && _items[index].OverlapsWith(address, size));
}
2019-10-13 08:02:07 +02:00
return outputIndex;
}
/// <summary>
/// Gets all items on the list with the specified memory address.
/// </summary>
/// <param name="address">Address to find</param>
/// <param name="output">Output array where matches will be written. It is automatically resized to fit the results</param>
/// <returns>The number of matches found</returns>
public int FindOverlaps(ulong address, ref T[] output)
{
int index = BinarySearch(address);
2019-10-13 08:02:07 +02:00
int outputIndex = 0;
if (index >= 0)
{
while (index > 0 && _items[index - 1].Address == address)
{
index--;
}
while (index < _items.Count)
{
T overlap = _items[index++];
if (overlap.Address != address)
{
break;
2019-10-13 08:02:07 +02:00
}
if (outputIndex == output.Length)
{
Array.Resize(ref output, outputIndex + ArrayGrowthSize);
}
output[outputIndex++] = overlap;
2019-10-13 08:02:07 +02:00
}
}
return outputIndex;
2019-10-13 08:02:07 +02:00
}
/// <summary>
/// Performs binary search on the internal list of items.
/// </summary>
/// <param name="address">Address to find</param>
/// <returns>List index of the item, or complement index of nearest item with lower value on the list</returns>
2019-10-13 08:02:07 +02:00
private int BinarySearch(ulong address)
{
int left = 0;
int right = _items.Count - 1;
while (left <= right)
{
int range = right - left;
int middle = left + (range >> 1);
T item = _items[middle];
if (item.Address == address)
{
return middle;
}
if (address < item.Address)
{
right = middle - 1;
}
else
{
left = middle + 1;
}
}
return ~left;
}
/// <summary>
/// Performs binary search for items overlapping a given memory range.
/// </summary>
/// <param name="address">Start address of the range</param>
/// <param name="size">Size in bytes of the range</param>
/// <returns>List index of the item, or complement index of nearest item with lower value on the list</returns>
2019-10-13 08:02:07 +02:00
private int BinarySearch(ulong address, ulong size)
{
int left = 0;
int right = _items.Count - 1;
while (left <= right)
{
int range = right - left;
int middle = left + (range >> 1);
T item = _items[middle];
if (item.OverlapsWith(address, size))
{
return middle;
}
if (address < item.Address)
{
right = middle - 1;
}
else
{
left = middle + 1;
}
}
return ~left;
}
2019-12-31 23:09:49 +01:00
public IEnumerator<T> GetEnumerator()
{
return _items.GetEnumerator();
}
IEnumerator IEnumerable.GetEnumerator()
{
return _items.GetEnumerator();
}
2019-10-13 08:02:07 +02:00
}
}