aboutsummaryrefslogtreecommitdiff
path: root/plugins/ObjectCacheServer/src/Cache/PeerEventQueueManager.cs
blob: 4b76a9b5d12acd0f59707d541b4052e3cd63b5d8 (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
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
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
/*
* Copyright (c) 2024 Vaughn Nugent
* 
* Library: VNLib
* Package: ObjectCacheServer
* File: PeerEventQueueManager.cs 
*
* PeerEventQueueManager.cs is part of ObjectCacheServer which is 
* part of the larger VNLib collection of libraries and utilities.
*
* ObjectCacheServer 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.
*
* ObjectCacheServer 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.Linq;
using System.Threading;
using System.Threading.Tasks;
using System.Threading.Channels;
using System.Collections.Generic;

using VNLib.Plugins;
using VNLib.Utils.Async;
using VNLib.Utils.Logging;
using VNLib.Plugins.Extensions.Loading;
using VNLib.Plugins.Extensions.Loading.Events;


namespace VNLib.Data.Caching.ObjectCache.Server.Cache
{
    internal sealed class PeerEventQueueManager : ICacheEventQueueManager, IIntervalScheduleable
    {
        private readonly int MaxQueueDepth;

        private readonly object SubLock = new();
        private readonly LinkedList<PeerEventListenerQueue> Subscribers = [];

        private readonly object StoreLock = new();
        private readonly Dictionary<string, PeerEventListenerQueue> QueueStore = new(StringComparer.OrdinalIgnoreCase);

        public PeerEventQueueManager(PluginBase plugin, ServerClusterConfig config)
        {
            MaxQueueDepth = config.MaxQueueDepth;

            /*
           * Schedule purge interval to clean up stale queues
           */
            plugin.ScheduleInterval(this, config.EventQueuePurgeInterval);
            
            //Cleanup disposeables on unload
            _ = plugin.RegisterForUnload(() =>
            {
                QueueStore.Clear();
                Subscribers.Clear();
            });
        }

        ///<inheritdoc/>
        public IPeerEventQueue Subscribe(ICachePeer peer)
        {
            PeerEventListenerQueue? nq;

            bool isNew = false;

            //Enter sync lock
            lock (StoreLock)
            {
                //Try to recover the queue for the node
                if (!QueueStore.TryGetValue(peer.NodeId, out nq))
                {
                    //Create new queue since an existing queue was not found
                    nq = new(peer.NodeId, MaxQueueDepth);
                    QueueStore.Add(peer.NodeId, nq);
                    isNew = true;
                }

                //Increment listener count since a new listener has attached
                nq.Listeners++;
            }

            //Publish new peer to subscribers list
            if (isNew)
            {
                lock (SubLock)
                {
                    //Add peer to subscribers list
                    Subscribers.AddLast(nq);
                }
            }

            //Return the node's queue
            return nq;
        }

        ///<inheritdoc/>
        public void Unsubscribe(ICachePeer peer)
        {
            /*
             * The reason I am not purging queues that no longer have listeners
             * now is because it is possible that a listener needed to detach because of 
             * a network issue and will be reconnecting shortly. If the node doesnt 
             * come back before the next purge interval, it's events will be purged.
             * 
             * Point is: there is a reason for the garbage collection style purging
             */

            //Detach a listener for a node
            lock (StoreLock)
            {
                //Get the queue and decrement the listener count
                PeerEventListenerQueue nq = QueueStore[peer.NodeId];
                nq.Listeners--;
            }
        }

        ///<inheritdoc/>
        public void PublishSingle(ChangeEvent change)
        {
            //Wait to enter the sub lock
            lock (SubLock)
            {
                //Loop through ll the fast way
                LinkedListNode<PeerEventListenerQueue>? q = Subscribers.First;

                while (q != null)
                {
                    //Pub single event node
                    q.Value.PublishChange(change);

                    //Get next queue
                    q = q.Next;
                }
            }
        }

        ///<inheritdoc/>
        public void PublishMultiple(Span<ChangeEvent> changes)
        {
            //Wait to enter the sub lock
            lock (SubLock)
            {
                //Loop through ll the fast way
                LinkedListNode<PeerEventListenerQueue>? q = Subscribers.First;

                while (q != null)
                {
                    //Publish multiple
                    q.Value.PublishChanges(changes);

                    //Get next queue
                    q = q.Next;
                }
            }
        }

        ///<inheritdoc/>
        public void PurgeStaleSubscribers()
        {
            //Enter locks
            lock (SubLock)
            {
                lock (StoreLock)
                {
                    //Get all stale queues (queues without listeners)
                    PeerEventListenerQueue[] staleQueues = QueueStore.Values.Where(static nq => nq.Listeners == 0).ToArray();

                    foreach (PeerEventListenerQueue nq in staleQueues)
                    {
                        //Remove from store
                        QueueStore.Remove(nq.NodeId);

                        //remove from subscribers
                        Subscribers.Remove(nq);
                    }
                }
            }
        }

        //Interval to purge stale subscribers
        Task IIntervalScheduleable.OnIntervalAsync(ILogProvider log, CancellationToken cancellationToken)
        {
            log.Debug("Purging stale peer event queues");

            PurgeStaleSubscribers();

            return Task.CompletedTask;
        }


        /*
         * Holds queues for each node and keeps track of the number of listeners
         * attached to the queue
         * 
         * The role of this class is to store change events for a given peer node,
         * and return them when the peer requests them. It also keeps track of the
         * number of active listeners (server connections) to the queue.
         */

        private sealed class PeerEventListenerQueue(string nodeId, int maxDepth) : IPeerEventQueue
        {
            public int Listeners;

            public string NodeId => nodeId;

            /*
             * Create a bounded channel that acts as a lru and evicts 
             * the oldest item when the queue is full
             * 
             * There will also only ever be a single thread writing events 
             * to the queue
             */
            private readonly AsyncQueue<ChangeEvent> Queue = new(new BoundedChannelOptions(maxDepth)
            {
                AllowSynchronousContinuations = true,
                SingleReader = false,
                SingleWriter = true,
                //Drop oldest item in queue if full
                FullMode = BoundedChannelFullMode.DropOldest,
            });

            public void PublishChange(ChangeEvent change) => Queue.TryEnque(change);

            public void PublishChanges(Span<ChangeEvent> changes)
            {
                for (int i = 0; i < changes.Length; i++)
                {
                    Queue.TryEnque(changes[i]);
                }
            }

            ///<inheritdoc/>
            public ValueTask<ChangeEvent> DequeueAsync(CancellationToken cancellation) => Queue.DequeueAsync(cancellation);

            ///<inheritdoc/>
            public bool TryDequeue(out ChangeEvent change) => Queue.TryDequeue(out change);
        }
    }
}