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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
|
/*
* Copyright (c) 2023 Vaughn Nugent
*
* Library: VNLib
* Package: VNLib.Data.Caching.ObjectCache
* File: BlobCache.cs
*
* BlobCache.cs is part of VNLib.Data.Caching.ObjectCache which is part of the larger
* VNLib collection of libraries and utilities.
*
* VNLib.Data.Caching.ObjectCache is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* VNLib.Data.Caching.ObjectCache is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see https://www.gnu.org/licenses/.
*/
using System;
using System.Collections.Generic;
using System.Diagnostics;
using VNLib.Utils.Memory;
using VNLib.Utils.Memory.Caching;
namespace VNLib.Data.Caching.ObjectCache
{
/// <summary>
/// A general purpose binary data storage
/// </summary>
public sealed class BlobCache : LRUCache<string, CacheEntry>, IBlobCache
{
private bool disposedValue;
///<inheritdoc/>
public override bool IsReadOnly { get; }
///<inheritdoc/>
protected override int MaxCapacity { get; }
///<inheritdoc/>
public IUnmangedHeap CacheHeap { get; }
/// <summary>
/// Initializes a new <see cref="BlobCache"/> store
/// </summary>
/// <param name="maxCapacity">The maximum number of items to keep in memory</param>
/// <param name="heap">The unmanaged heap used to allocate cache entry buffers from</param>
/// <exception cref="ArgumentException"></exception>
public BlobCache(int maxCapacity, IUnmangedHeap heap)
:base(StringComparer.Ordinal)
{
if(maxCapacity < 1)
{
throw new ArgumentException("The maxium capacity of the store must be a positive integer larger than 0", nameof(maxCapacity));
}
CacheHeap = heap;
MaxCapacity = maxCapacity;
//Update the lookup table size
LookupTable.EnsureCapacity(maxCapacity);
}
///<inheritdoc/>
protected override bool CacheMiss(string key, out CacheEntry value)
{
value = default;
return false;
}
///<inheritdoc/>
protected override void Evicted(ref KeyValuePair<string, CacheEntry> evicted)
{
//Dispose the cache item
evicted.Value.Dispose();
}
///<inheritdoc/>
public bool TryChangeKey(string objectId, string newId, out CacheEntry blob)
{
//Try to get the node at the current key
if (LookupTable.Remove(objectId, out LinkedListNode<KeyValuePair<string, CacheEntry>> ? node))
{
//Remove the node from the ll
List.Remove(node);
//Get the stored blob
blob = node.ValueRef.Value;
//Update the
node.Value = new KeyValuePair<string, CacheEntry>(newId, blob);
//Add to end of list
List.AddLast(node);
//Re-add to lookup table with new key
LookupTable.Add(newId, node);
return true;
}
blob = default;
return false;
}
///<inheritdoc/>
public override bool Remove(string key)
{
//Remove the item from the lookup table and if it exists, remove the node from the list
if (!LookupTable.Remove(key, out LinkedListNode<KeyValuePair<string, CacheEntry>>? node))
{
return false;
}
//always dispose blob
using (node.ValueRef.Value)
{
//Remove the node from the list
List.Remove(node);
}
return true;
}
/// <summary>
/// Removes all cache entires and disposes their held resources
/// </summary>
public override void Clear()
{
//Start from first node
LinkedListNode<KeyValuePair<string, CacheEntry>>? node = List.First;
//Classic ll node itteration
while(node != null)
{
//Dispose the cache entry
node.ValueRef.Value.Dispose();
//Move to next node
node = node.Next;
}
//empty all cache entires in the store
base.Clear();
}
///<inheritdoc/>
public bool Remove(string objectId, out CacheEntry entry)
{
//Try to get the stored object
if(TryGetValue(objectId, out entry))
{
//remove the entry and bypass the disposal
bool result = base.Remove(objectId);
#if DEBUG
Debug.Assert(result == true);
#endif
return true;
}
entry = default;
return false;
}
///<inheritdoc/>
void Dispose(bool disposing)
{
if (!disposedValue)
{
if (disposing)
{
Clear();
}
disposedValue = true;
}
}
///<inheritdoc/>
public void Dispose()
{
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
Dispose(disposing: true);
GC.SuppressFinalize(this);
}
}
}
|
