aboutsummaryrefslogtreecommitdiff
path: root/lib/VNLib.Data.Caching.ObjectCache/src/BlobCache.cs
blob: 26df351caa24c52ffcdcbc3e3dc12e49741f5cd0 (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
/*
* Copyright (c) 2022 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.IO;
using System.Linq;
using System.Collections.Generic;
using System.Diagnostics.CodeAnalysis;

using VNLib.Utils.IO;
using VNLib.Utils.Logging;
using VNLib.Utils.Memory;
using VNLib.Utils.Memory.Caching;

namespace VNLib.Data.Caching
{
    /// <summary>
    /// A general purpose binary data storage
    /// </summary>
    public class BlobCache : LRUCache<string, MemoryHandle<byte>>
    {
        readonly IUnmangedHeap Heap;
        readonly DirectoryInfo SwapDir;
        readonly ILogProvider Log;
        ///<inheritdoc/>
        public override bool IsReadOnly { get; }
        ///<inheritdoc/>
        protected override int MaxCapacity { get; }
       
          
        /// <summary>
        /// Initializes a new <see cref="BlobCache"/> store
        /// </summary>
        /// <param name="swapDir">The <see cref="IsolatedStorageDirectory"/> to swap blob data to when cache</param>
        /// <param name="maxCapacity">The maximum number of items to keep in memory</param>
        /// <param name="log">A <see cref="ILogProvider"/> to write log data to</param>
        /// <param name="heap">A <see cref="IUnmangedHeap"/> to allocate buffers and store <see cref="BlobItem"/> data in memory</param>
        public BlobCache(DirectoryInfo swapDir, int maxCapacity, ILogProvider log, IUnmangedHeap heap)
            :base(StringComparer.Ordinal)
        {
            IsReadOnly = false;
            MaxCapacity = maxCapacity;
            SwapDir = swapDir;
            //Update the lookup table size
            LookupTable.EnsureCapacity(maxCapacity);
            //Set default heap if not specified
            Heap = heap;
            Log = log;
        }
        ///<inheritdoc/>
        protected override bool CacheMiss(string key, [NotNullWhen(true)] out MemoryHandle<byte>? value)
        {
            value = null;
            return false;
        }
        ///<inheritdoc/>
        protected override void Evicted(KeyValuePair<string, MemoryHandle<byte>> evicted)
        {
            //Dispose the blob
            evicted.Value.Dispose();
        }
        /// <summary>
        /// If the <see cref="BlobItem"/> is found in the store, changes the key 
        /// that referrences the blob. 
        /// </summary>
        /// <param name="currentKey">The key that currently referrences the blob in the store</param>
        /// <param name="newKey">The new key that will referrence the blob</param>
        /// <param name="blob">The <see cref="BlobItem"/> if its found in the store</param>
        /// <returns>True if the record was found and the key was changes</returns>
        public bool TryChangeKey(string currentKey, string newKey, [NotNullWhen(true)] out MemoryHandle<byte>? blob)
        {
            if (LookupTable.Remove(currentKey, out LinkedListNode<KeyValuePair<string, MemoryHandle<byte>>>? node))
            {
                //Remove the node from the ll
                List.Remove(node);
                //Update the node kvp
                blob = node.Value.Value;
                node.Value = new KeyValuePair<string, MemoryHandle<byte>>(newKey, blob);
                //Add to end of list
                List.AddLast(node);
                //Re-add to lookup table with new key
                LookupTable.Add(newKey, node);
                return true;
            }
            blob = null;
            return false;
        }
        /// <summary>
        /// Removes the <see cref="BlobItem"/> from the store without disposing the blobl
        /// </summary>
        /// <param name="key">The key that referrences the <see cref="BlobItem"/> in the store</param>
        /// <returns>A value indicating if the blob was removed</returns>
        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, MemoryHandle<byte>>>? node))
            {
                //Remove the new from the list
                List.Remove(node);
                //dispose the buffer
                node.Value.Value.Dispose();
                return true;
            }
            return false;
        }
        /// <summary>
        /// Removes and disposes all blobl elements in cache (or in the backing store)
        /// </summary>
        public override void Clear()
        {
            foreach (MemoryHandle<byte> blob in List.Select(kp => kp.Value))
            {
                blob.Dispose();
            }
            base.Clear();
        }
    }
}