dynamo-runtime 1.5.0

Dynamo Runtime Library
Documentation
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
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
// SPDX-FileCopyrightText: Copyright (c) 2024-2026 NVIDIA CORPORATION & AFFILIATES. All rights reserved.
// SPDX-License-Identifier: Apache-2.0

use std::collections::HashMap;
use std::collections::hash_map::Entry;
use std::pin::Pin;
use std::sync::Arc;
use std::time::Duration;

use async_trait::async_trait;
use rand::Rng as _;
use tokio::sync::broadcast;

use super::{Bucket, Key, KeyValue, Store, StoreError, StoreOutcome, WatchEvent};

const MEMORY_EVENT_BUFFER_CAPACITY: usize = 16_384;

#[derive(Clone, Debug)]
enum MemoryEvent {
    Put {
        bucket: String,
        key: String,
        value: bytes::Bytes,
    },
    Delete {
        bucket: String,
        key: String,
    },
}

#[derive(Clone)]
pub struct MemoryStore {
    inner: Arc<MemoryStoreInner>,
    connection_id: u64,
}

impl Default for MemoryStore {
    fn default() -> Self {
        Self::new()
    }
}

struct MemoryStoreInner {
    data: parking_lot::Mutex<HashMap<String, MemoryBucket>>,
    change_sender: broadcast::Sender<MemoryEvent>,
}

pub struct MemoryBucketRef {
    name: String,
    inner: Arc<MemoryStoreInner>,
}

struct MemoryBucket {
    data: HashMap<String, (u64, bytes::Bytes)>,
}

impl MemoryBucket {
    fn new() -> Self {
        MemoryBucket {
            data: HashMap::new(),
        }
    }
}

impl MemoryStore {
    pub(super) fn new() -> Self {
        let (tx, _) = broadcast::channel(MEMORY_EVENT_BUFFER_CAPACITY);
        MemoryStore {
            inner: Arc::new(MemoryStoreInner {
                data: parking_lot::Mutex::new(HashMap::new()),
                change_sender: tx,
            }),
            connection_id: rand::rng().random(),
        }
    }
}

#[async_trait]
impl Store for MemoryStore {
    type Bucket = MemoryBucketRef;

    async fn get_or_create_bucket(
        &self,
        bucket_name: &str,
        // MemoryStore doesn't respect TTL yet
        _ttl: Option<Duration>,
    ) -> Result<Self::Bucket, StoreError> {
        let mut locked_data = self.inner.data.lock();
        // Ensure the bucket exists
        locked_data
            .entry(bucket_name.to_string())
            .or_insert_with(MemoryBucket::new);
        // Return an object able to access it
        Ok(MemoryBucketRef {
            name: bucket_name.to_string(),
            inner: self.inner.clone(),
        })
    }

    /// This operation cannot fail on MemoryStore. Always returns Ok.
    async fn get_bucket(&self, bucket_name: &str) -> Result<Option<Self::Bucket>, StoreError> {
        let locked_data = self.inner.data.lock();
        match locked_data.get(bucket_name) {
            Some(_) => Ok(Some(MemoryBucketRef {
                name: bucket_name.to_string(),
                inner: self.inner.clone(),
            })),
            None => Ok(None),
        }
    }

    fn connection_id(&self) -> u64 {
        self.connection_id
    }

    fn shutdown(&self) {}
}

#[async_trait]
impl Bucket for MemoryBucketRef {
    async fn insert(
        &self,
        key: &Key,
        value: bytes::Bytes,
        revision: u64,
    ) -> Result<StoreOutcome, StoreError> {
        let mut locked_data = self.inner.data.lock();
        let mut b = locked_data.get_mut(&self.name);
        let Some(bucket) = b.as_mut() else {
            return Err(StoreError::MissingBucket(self.name.to_string()));
        };
        let outcome = match bucket.data.entry(key.to_string()) {
            Entry::Vacant(e) => {
                e.insert((revision, value.clone()));
                let _ = self.inner.change_sender.send(MemoryEvent::Put {
                    bucket: self.name.clone(),
                    key: key.to_string(),
                    value,
                });
                StoreOutcome::Created(revision)
            }
            Entry::Occupied(mut entry) => {
                let (rev, _v) = entry.get();
                if revision == 0 || *rev == revision {
                    StoreOutcome::Exists(*rev)
                } else {
                    entry.insert((revision, value.clone()));
                    let _ = self.inner.change_sender.send(MemoryEvent::Put {
                        bucket: self.name.clone(),
                        key: key.to_string(),
                        value,
                    });
                    StoreOutcome::Created(revision)
                }
            }
        };
        Ok(outcome)
    }

    async fn compare_and_replace(
        &self,
        key: &Key,
        expected: bytes::Bytes,
        value: bytes::Bytes,
    ) -> Result<StoreOutcome, StoreError> {
        let mut locked_data = self.inner.data.lock();
        let bucket = locked_data
            .get_mut(&self.name)
            .ok_or_else(|| StoreError::MissingBucket(self.name.to_string()))?;
        let entry = bucket
            .data
            .get_mut(&key.0)
            .ok_or_else(|| StoreError::MissingKey(key.to_string()))?;
        if entry.1 != expected {
            return Err(StoreError::Retry);
        }
        let next_revision = entry.0.saturating_add(1).max(1);
        *entry = (next_revision, value.clone());
        let _ = self.inner.change_sender.send(MemoryEvent::Put {
            bucket: self.name.clone(),
            key: key.to_string(),
            value,
        });
        Ok(StoreOutcome::Created(next_revision))
    }

    async fn get(&self, key: &Key) -> Result<Option<bytes::Bytes>, StoreError> {
        let locked_data = self.inner.data.lock();
        let Some(bucket) = locked_data.get(&self.name) else {
            return Ok(None);
        };
        Ok(bucket.data.get(&key.0).map(|(_, v)| v.clone()))
    }

    async fn delete(&self, key: &Key) -> Result<(), StoreError> {
        let mut locked_data = self.inner.data.lock();
        let Some(bucket) = locked_data.get_mut(&self.name) else {
            return Err(StoreError::MissingBucket(self.name.to_string()));
        };
        if bucket.data.remove(&key.0).is_some() {
            let _ = self.inner.change_sender.send(MemoryEvent::Delete {
                bucket: self.name.clone(),
                key: key.to_string(),
            });
        }
        Ok(())
    }

    /// All current values in the bucket first, then block waiting for new
    /// values to be published.
    async fn watch(
        &self,
    ) -> Result<Pin<Box<dyn futures::Stream<Item = WatchEvent> + Send + 'life0>>, StoreError> {
        // Subscribe while holding the data lock so the snapshot and incremental stream have no
        // race: mutations take the same lock before broadcasting their update.
        let data_lock = self.inner.data.lock();
        let Some(bucket) = data_lock.get(&self.name) else {
            return Err(StoreError::MissingBucket(self.name.to_string()));
        };
        let mut changes = self.inner.change_sender.subscribe();
        let existing_items: Vec<_> = bucket
            .data
            .iter()
            .map(|(key, (_revision, value))| {
                WatchEvent::Put(KeyValue::new(Key::new(key.clone()), value.clone()))
            })
            .collect();
        drop(data_lock);
        let bucket_name = self.name.clone();
        let inner = self.inner.clone();

        Ok(Box::pin(async_stream::stream! {
            for event in existing_items {
                yield event;
            }
            loop {
                match changes.recv().await {
                    Ok(MemoryEvent::Put { bucket, key, value }) => {
                        if bucket != bucket_name {
                            continue;
                        }
                        let item = KeyValue::new(Key::new(key), value);
                        yield WatchEvent::Put(item);
                    },
                    Ok(MemoryEvent::Delete { bucket, key }) => {
                        if bucket != bucket_name {
                            continue;
                        }
                        yield WatchEvent::Delete(Key::new(key));
                    },
                    Err(broadcast::error::RecvError::Lagged(_)) => {
                        let snapshot = {
                            let data = inner.data.lock();
                            // Discard retained events that predate this authoritative snapshot.
                            // Mutations take the same lock before broadcasting, so the replacement
                            // receiver observes every update that follows the snapshot.
                            changes = inner.change_sender.subscribe();
                            data.get(&bucket_name)
                                .map(|bucket| {
                                    bucket.data
                                        .iter()
                                        .map(|(key, (_revision, value))| {
                                            (Key::new(key.clone()), value.clone())
                                        })
                                        .collect()
                                })
                                .unwrap_or_default()
                        };
                        yield WatchEvent::Resync(snapshot);
                    },
                    Err(broadcast::error::RecvError::Closed) => break,
                }
            }
        }))
    }

    async fn entries(&self) -> Result<HashMap<Key, bytes::Bytes>, StoreError> {
        let locked_data = self.inner.data.lock();
        match locked_data.get(&self.name) {
            Some(bucket) => {
                let mut out = HashMap::new();
                for (k, (_rev, v)) in bucket.data.iter() {
                    let key = Key::new([self.name.clone(), k.to_string()].join("/"));
                    let value = v.clone();
                    out.insert(key, value);
                }
                Ok(out)
            }
            None => Err(StoreError::MissingBucket(self.name.clone())),
        }
    }
}

#[cfg(test)]
mod tests {
    use super::MEMORY_EVENT_BUFFER_CAPACITY;
    use crate::storage::kv::{
        Bucket as _, Key, MemoryStore, Store as _, StoreError, StoreOutcome, WatchEvent,
    };
    use futures::StreamExt;
    use std::collections::HashSet;
    use std::sync::Arc;
    use std::time::Duration;
    use tokio::sync::Barrier;

    #[tokio::test]
    async fn delete_wins_race_with_compare_and_replace() {
        let store = MemoryStore::new();
        let bucket = Arc::new(store.get_or_create_bucket("bucket", None).await.unwrap());
        let key = Key::new("model".to_string());
        bucket.insert(&key, "old".into(), 0).await.unwrap();

        let barrier = Arc::new(Barrier::new(3));
        let update_bucket = bucket.clone();
        let update_key = key.clone();
        let update_barrier = barrier.clone();
        let update = tokio::spawn(async move {
            update_barrier.wait().await;
            update_bucket
                .compare_and_replace(&update_key, "old".into(), "new".into())
                .await
        });
        let delete_bucket = bucket.clone();
        let delete_key = key.clone();
        let delete_barrier = barrier.clone();
        let delete = tokio::spawn(async move {
            delete_barrier.wait().await;
            delete_bucket.delete(&delete_key).await
        });

        barrier.wait().await;
        let update_result = update.await.unwrap();
        delete.await.unwrap().unwrap();
        assert!(update_result.is_ok() || matches!(update_result, Err(StoreError::MissingKey(_))));
        assert_eq!(bucket.get(&key).await.unwrap(), None);
    }

    #[tokio::test]
    async fn revision_zero_replay_preserves_cas_update() {
        let store = MemoryStore::new();
        let bucket = store.get_or_create_bucket("bucket", None).await.unwrap();
        let key = Key::new("model".to_string());

        assert_eq!(
            bucket.insert(&key, "initial".into(), 0).await.unwrap(),
            StoreOutcome::Created(0)
        );
        assert_eq!(
            bucket
                .compare_and_replace(&key, "initial".into(), "updated".into())
                .await
                .unwrap(),
            StoreOutcome::Created(1)
        );
        assert_eq!(
            bucket.insert(&key, "initial".into(), 0).await.unwrap(),
            StoreOutcome::Exists(1)
        );
        assert_eq!(
            bucket.get(&key).await.unwrap().unwrap().as_ref(),
            b"updated"
        );
    }

    #[tokio::test]
    async fn multiple_watchers_receive_updates_without_cross_bucket_stealing() {
        let store = MemoryStore::new();
        let bucket_a = store.get_or_create_bucket("bucket-a", None).await.unwrap();
        let bucket_b = store.get_or_create_bucket("bucket-b", None).await.unwrap();
        let mut a_first = bucket_a.watch().await.unwrap();
        let mut a_second = bucket_a.watch().await.unwrap();
        let mut b = bucket_b.watch().await.unwrap();

        bucket_a
            .insert(&Key::new("shared-key".to_string()), "a".into(), 1)
            .await
            .unwrap();
        bucket_b
            .insert(&Key::new("shared-key".to_string()), "b".into(), 1)
            .await
            .unwrap();

        for watcher in [&mut a_first, &mut a_second] {
            let WatchEvent::Put(item) = watcher.next().await.unwrap() else {
                panic!("expected bucket-a put");
            };
            assert_eq!(item.value(), b"a");
        }
        let WatchEvent::Put(item) = b.next().await.unwrap() else {
            panic!("expected bucket-b put");
        };
        assert_eq!(item.value(), b"b");
    }

    #[tokio::test]
    async fn watcher_observes_updates_to_an_existing_key() {
        let store = MemoryStore::new();
        let bucket = store.get_or_create_bucket("bucket", None).await.unwrap();
        bucket
            .insert(&Key::new("key".to_string()), "old".into(), 1)
            .await
            .unwrap();
        let mut watcher = bucket.watch().await.unwrap();
        assert!(matches!(watcher.next().await, Some(WatchEvent::Put(_))));

        bucket
            .insert(&Key::new("key".to_string()), "new".into(), 2)
            .await
            .unwrap();
        let WatchEvent::Put(item) = watcher.next().await.unwrap() else {
            panic!("expected updated put");
        };
        assert_eq!(item.value(), b"new");
    }

    #[tokio::test]
    async fn lag_resync_discards_retained_pre_snapshot_events() {
        let store = MemoryStore::new();
        let bucket = store.get_or_create_bucket("bucket", None).await.unwrap();
        let mut watcher = bucket.watch().await.unwrap();
        let key = Key::new("key".to_string());

        for revision in 1..=MEMORY_EVENT_BUFFER_CAPACITY + 1 {
            bucket
                .insert(&key, format!("value-{revision}").into(), revision as u64)
                .await
                .unwrap();
        }

        let WatchEvent::Resync(snapshot) = watcher.next().await.unwrap() else {
            panic!("expected authoritative resync after lag");
        };
        assert_eq!(snapshot.len(), 1);
        let latest_value = format!("value-{}", MEMORY_EVENT_BUFFER_CAPACITY + 1);
        assert_eq!(snapshot.get(&key).unwrap(), latest_value.as_bytes());

        bucket
            .insert(
                &key,
                "post-resync".into(),
                (MEMORY_EVENT_BUFFER_CAPACITY + 2) as u64,
            )
            .await
            .unwrap();
        let next = tokio::time::timeout(Duration::from_secs(1), watcher.next())
            .await
            .expect("post-resync update timed out")
            .unwrap();
        let WatchEvent::Put(item) = next else {
            panic!("expected post-resync put");
        };
        assert_eq!(item.value(), b"post-resync");
    }

    #[tokio::test]
    async fn test_entries_full_path() {
        let m = MemoryStore::new();
        let bucket = m.get_or_create_bucket("bucket1", None).await.unwrap();
        let _ = bucket
            .insert(&Key::new("key1".to_string()), "value1".into(), 0)
            .await
            .unwrap();
        let _ = bucket
            .insert(&Key::new("key2".to_string()), "value2".into(), 0)
            .await
            .unwrap();
        let entries = bucket.entries().await.unwrap();
        let keys: HashSet<Key> = entries.into_keys().collect();
        assert!(keys.contains(&Key::new("bucket1/key1".to_string())));
        assert!(keys.contains(&Key::new("bucket1/key2".to_string())));
    }
}