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

Use a more efficient range list on the buffer manager

Browse source
This commit is contained in:
gdk 2019-11-08 16:39:12 -03:00 • committed by Thog
parent a31fced221
commit 1e8bc29f32
4 changed files with 309 additions and 63 deletions
Download patch file Download diff file Expand all files Collapse all files

156
Ryujinx.Graphics.Gpu/Memory/RangeList.cs
View file

@ -6,6 +6,8 @@ namespace Ryujinx.Graphics.Gpu.Memory
{
private List<T> _items;
public int Count => _items.Count;
public RangeList()
{
_items = new List<T>();
@ -13,49 +15,57 @@ namespace Ryujinx.Graphics.Gpu.Memory
public void Add(T item)
{
lock (_items)
int index = BinarySearch(item.Address);
if (index < 0)
{
int index = BinarySearch(item.Address);
if (index < 0)
{
index = ~index;
}
_items.Insert(index, item);
index = ~index;
}
_items.Insert(index, item);
}
public bool Remove(T item)
{
lock (_items)
int index = BinarySearch(item.Address);
if (index >= 0)
{
int index = BinarySearch(item.Address);
if (index >= 0)
while (index > 0 && _items[index - 1].Address == item.Address)
{
while (index > 0 && _items[index - 1].Address == item.Address)
{
index--;
}
while (index < _items.Count)
{
if (_items[index].Equals(item))
{
_items.RemoveAt(index);
return true;
}
if (_items[index].Address > item.Address)
{
break;
}
index++;
}
index--;
}
while (index < _items.Count)
{
if (_items[index].Equals(item))
{
_items.RemoveAt(index);
return true;
}
if (_items[index].Address > item.Address)
{
break;
}
index++;
}
}
return false;
}
public bool CanExitEarly(ulong address, ulong size)
{
int index = BinarySearch(address, size);
if (index >= 0)
{
T item = _items[index];
return address >= item.Address && address + size <= item.Address + item.Size;
}
return false;
@ -68,17 +78,14 @@ namespace Ryujinx.Graphics.Gpu.Memory
public T FindFirstOverlap(ulong address, ulong size)
{
lock (_items)
int index = BinarySearch(address, size);
if (index < 0)
{
int index = BinarySearch(address, size);
if (index < 0)
{
return default(T);
}
return _items[index];
return default(T);
}
return _items[index];
}
public T[] FindOverlaps(T item)
@ -111,32 +118,61 @@ namespace Ryujinx.Graphics.Gpu.Memory
return overlapsList.ToArray();
}
public T[] FindOverlapsNonOverlapping(T item)
{
return FindOverlapsNonOverlapping(item.Address, item.Size);
}
public T[] FindOverlapsNonOverlapping(ulong address, ulong size)
{
// This is a bit faster than FindOverlaps, but only works
// when none of the items on the list overlaps with each other.
List<T> overlapsList = new List<T>();
ulong endAddress = address + size;
int index = BinarySearch(address, size);
if (index >= 0)
{
while (index > 0 && _items[index - 1].OverlapsWith(address, size))
{
index--;
}
do
{
overlapsList.Add(_items[index++]);
}
while (index < _items.Count && _items[index].OverlapsWith(address, size));
}
return overlapsList.ToArray();
}
public T[] FindOverlaps(ulong address)
{
List<T> overlapsList = new List<T>();
lock (_items)
int index = BinarySearch(address);
if (index >= 0)
{
int index = BinarySearch(address);
if (index >= 0)
while (index > 0 && _items[index - 1].Address == address)
{
while (index > 0 && _items[index - 1].Address == address)
index--;
}
while (index < _items.Count)
{
T overlap = _items[index++];
if (overlap.Address != address)
{
index--;
break;
}
while (index < _items.Count)
{
T overlap = _items[index++];
if (overlap.Address != address)
{
break;
}
overlapsList.Add(overlap);
}
overlapsList.Add(overlap);
}
}