mirror of
https://github.com/Ryujinx/Ryujinx.git
synced 2024-09-11 18:28:50 +02:00
* Renaming part 1 * Renaming part 2 * Renaming part 3 * Renaming part 4 * Renaming part 5 * Renaming part 6 * Renaming part 7 * Renaming part 8 * Renaming part 9 * Renaming part 10 * General cleanup * Thought I got all of these * Apply #595 * Additional renaming * Tweaks from feedback * Rename files
191 lines
No EOL
4.5 KiB
C#
191 lines
No EOL
4.5 KiB
C#
using Ryujinx.Common;
|
|
using System;
|
|
using System.Collections.Generic;
|
|
|
|
namespace Ryujinx.Graphics.Gal.OpenGL
|
|
{
|
|
class OglCachedResource<T>
|
|
{
|
|
public delegate void DeleteValue(T value);
|
|
|
|
private const int MinTimeDelta = 5 * 60000;
|
|
private const int MaxRemovalsPerRun = 10;
|
|
|
|
private struct CacheBucket
|
|
{
|
|
public T Value { get; private set; }
|
|
|
|
public LinkedListNode<long> Node { get; private set; }
|
|
|
|
public long DataSize { get; private set; }
|
|
|
|
public long Timestamp { get; private set; }
|
|
|
|
public CacheBucket(T value, long dataSize, LinkedListNode<long> node)
|
|
{
|
|
Value = value;
|
|
DataSize = dataSize;
|
|
Node = node;
|
|
|
|
Timestamp = PerformanceCounter.ElapsedMilliseconds;
|
|
}
|
|
}
|
|
|
|
private Dictionary<long, CacheBucket> _cache;
|
|
|
|
private LinkedList<long> _sortedCache;
|
|
|
|
private DeleteValue _deleteValueCallback;
|
|
|
|
private Queue<T> _deletePending;
|
|
|
|
private bool _locked;
|
|
|
|
private long _maxSize;
|
|
private long _totalSize;
|
|
|
|
public OglCachedResource(DeleteValue deleteValueCallback, long maxSize)
|
|
{
|
|
_maxSize = maxSize;
|
|
|
|
if (deleteValueCallback == null)
|
|
{
|
|
throw new ArgumentNullException(nameof(deleteValueCallback));
|
|
}
|
|
|
|
_deleteValueCallback = deleteValueCallback;
|
|
|
|
_cache = new Dictionary<long, CacheBucket>();
|
|
|
|
_sortedCache = new LinkedList<long>();
|
|
|
|
_deletePending = new Queue<T>();
|
|
}
|
|
|
|
public void Lock()
|
|
{
|
|
_locked = true;
|
|
}
|
|
|
|
public void Unlock()
|
|
{
|
|
_locked = false;
|
|
|
|
while (_deletePending.TryDequeue(out T value))
|
|
{
|
|
_deleteValueCallback(value);
|
|
}
|
|
|
|
ClearCacheIfNeeded();
|
|
}
|
|
|
|
public void AddOrUpdate(long key, T value, long size)
|
|
{
|
|
if (!_locked)
|
|
{
|
|
ClearCacheIfNeeded();
|
|
}
|
|
|
|
LinkedListNode<long> node = _sortedCache.AddLast(key);
|
|
|
|
CacheBucket newBucket = new CacheBucket(value, size, node);
|
|
|
|
if (_cache.TryGetValue(key, out CacheBucket bucket))
|
|
{
|
|
if (_locked)
|
|
{
|
|
_deletePending.Enqueue(bucket.Value);
|
|
}
|
|
else
|
|
{
|
|
_deleteValueCallback(bucket.Value);
|
|
}
|
|
|
|
_sortedCache.Remove(bucket.Node);
|
|
|
|
_totalSize -= bucket.DataSize;
|
|
|
|
_cache[key] = newBucket;
|
|
}
|
|
else
|
|
{
|
|
_cache.Add(key, newBucket);
|
|
}
|
|
|
|
_totalSize += size;
|
|
}
|
|
|
|
public bool TryGetValue(long key, out T value)
|
|
{
|
|
if (_cache.TryGetValue(key, out CacheBucket bucket))
|
|
{
|
|
value = bucket.Value;
|
|
|
|
_sortedCache.Remove(bucket.Node);
|
|
|
|
LinkedListNode<long> node = _sortedCache.AddLast(key);
|
|
|
|
_cache[key] = new CacheBucket(value, bucket.DataSize, node);
|
|
|
|
return true;
|
|
}
|
|
|
|
value = default(T);
|
|
|
|
return false;
|
|
}
|
|
|
|
public bool TryGetSize(long key, out long size)
|
|
{
|
|
if (_cache.TryGetValue(key, out CacheBucket bucket))
|
|
{
|
|
size = bucket.DataSize;
|
|
|
|
return true;
|
|
}
|
|
|
|
size = 0;
|
|
|
|
return false;
|
|
}
|
|
|
|
private void ClearCacheIfNeeded()
|
|
{
|
|
long timestamp = PerformanceCounter.ElapsedMilliseconds;
|
|
|
|
int count = 0;
|
|
|
|
while (count++ < MaxRemovalsPerRun)
|
|
{
|
|
LinkedListNode<long> node = _sortedCache.First;
|
|
|
|
if (node == null)
|
|
{
|
|
break;
|
|
}
|
|
|
|
CacheBucket bucket = _cache[node.Value];
|
|
|
|
long timeDelta = timestamp - bucket.Timestamp;
|
|
|
|
if (timeDelta <= MinTimeDelta && !UnderMemoryPressure())
|
|
{
|
|
break;
|
|
}
|
|
|
|
_sortedCache.Remove(node);
|
|
|
|
_cache.Remove(node.Value);
|
|
|
|
_deleteValueCallback(bucket.Value);
|
|
|
|
_totalSize -= bucket.DataSize;
|
|
}
|
|
}
|
|
|
|
private bool UnderMemoryPressure()
|
|
{
|
|
return _totalSize >= _maxSize;
|
|
}
|
|
}
|
|
} |