aboutsummaryrefslogtreecommitdiff
path: root/Ryujinx.Graphics/Gal/OpenGL/OGLCachedResource.cs
blob: 06d76b8bdd57c204946d8872924963d192a2d015 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
using System;
using System.Collections.Generic;

namespace Ryujinx.Graphics.Gal.OpenGL
{
    class OGLCachedResource<T>
    {
        public delegate void DeleteValue(T Value);

        private const int MaxTimeDelta      = 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 int Timestamp { get; private set; }

            public CacheBucket(T Value, long DataSize, LinkedListNode<long> Node)
            {
                this.Value     = Value;
                this.DataSize  = DataSize;
                this.Node      = Node;

                Timestamp = Environment.TickCount;
            }
        }

        private Dictionary<long, CacheBucket> Cache;

        private LinkedList<long> SortedCache;

        private DeleteValue DeleteValueCallback;

        public OGLCachedResource(DeleteValue DeleteValueCallback)
        {
            if (DeleteValueCallback == null)
            {
                throw new ArgumentNullException(nameof(DeleteValueCallback));
            }

            this.DeleteValueCallback = DeleteValueCallback;

            Cache = new Dictionary<long, CacheBucket>();

            SortedCache = new LinkedList<long>();
        }

        public void AddOrUpdate(long Key, T Value, long Size)
        {
            ClearCacheIfNeeded();

            LinkedListNode<long> Node = SortedCache.AddLast(Key);

            CacheBucket NewBucket = new CacheBucket(Value, Size, Node);

            if (Cache.TryGetValue(Key, out CacheBucket Bucket))
            {
                DeleteValueCallback(Bucket.Value);

                SortedCache.Remove(Bucket.Node);

                Cache[Key] = NewBucket;
            }
            else
            {
                Cache.Add(Key, NewBucket);
            }
        }

        public bool TryGetValue(long Key, out T Value)
        {
            if (Cache.TryGetValue(Key, out CacheBucket Bucket))
            {
                Value = Bucket.Value;

                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()
        {
            int Timestamp = Environment.TickCount;

            int Count = 0;

            while (Count++ < MaxRemovalsPerRun)
            {
                LinkedListNode<long> Node = SortedCache.First;

                if (Node == null)
                {
                    break;
                }

                CacheBucket Bucket = Cache[Node.Value];

                int TimeDelta = RingDelta(Bucket.Timestamp, Timestamp);

                if ((uint)TimeDelta <= (uint)MaxTimeDelta)
                {
                    break;
                }

                SortedCache.Remove(Node);

                Cache.Remove(Node.Value);

                DeleteValueCallback(Bucket.Value);
            }
        }

        private int RingDelta(int Old, int New)
        {
            if ((uint)New < (uint)Old)
            {
                return New + (~Old + 1);
            }
            else
            {
                return New - Old;
            }
        }
    }
}