ordinary-storage 0.11.0

Storage for Ordinary
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
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
// Copyright (C) 2026 The Ordinary Authors.
//
// SPDX-License-Identifier: BSD-3-Clause

use bytes::{BufMut, Bytes, BytesMut};
use hashbrown::{DefaultHashBuilder, HashMap, HashSet};
use ordinary_config::{
    CacheLimits, StoredCache as StoredCacheConfig, StoredCache, StoredCachePolicy,
};
use parking_lot::Mutex;
use quick_cache::sync::Cache;
use quick_cache::{Lifecycle, UnitWeighter};
use saferlmdb::{
    self as lmdb, Database, DatabaseOptions, Environment, ReadTransaction, WriteTransaction, put,
};
use smallvec::SmallVec;
use std::sync::Arc;
use tracing::instrument;
use uuid::Uuid;

pub struct Lookup<'a> {
    pub base: Bytes,
    pub checks: &'a [Bytes],
}

impl<'a> Lookup<'a> {
    pub fn new(base: Bytes, checks: &'a [Bytes]) -> Self {
        Lookup { base, checks }
    }

    pub fn set(&self, prefix: &mut BytesMut) -> HashSet<Bytes> {
        let prefix_len = prefix.len();

        let mut set = HashSet::new();

        for check in self.checks {
            prefix.put_slice(check.as_ref());
            set.insert(prefix.clone().into());
            prefix.truncate(prefix_len);
        }

        set
    }
}

#[derive(Clone)]
struct EvictionHandler {
    env: Arc<Environment>,
    cache_db: Arc<Database<'static>>,
    inventory: Arc<Mutex<(u64, usize)>>,
}

impl Lifecycle<Bytes, Option<Bytes>> for EvictionHandler {
    type RequestState = ();

    fn on_evict(&self, _state: &mut Self::RequestState, key: Bytes, _val: Option<Bytes>) {
        if let Ok(txn) = WriteTransaction::new(self.env.clone()) {
            {
                let mut access = txn.access();

                match access.get::<[u8], [u8]>(&self.cache_db, key.as_ref()) {
                    Ok(val) => {
                        let mut lock = self.inventory.lock();

                        lock.0 -= key.len() as u64;
                        lock.0 -= val.len() as u64;
                        lock.1 -= 1;
                    }
                    Err(err) => {
                        tracing::warn!(%err);
                    }
                }

                if let Err(err) = access.del_key::<[u8]>(&self.cache_db, key.as_ref()) {
                    tracing::warn!(%err);
                }
            }

            if let Err(err) = txn.commit() {
                tracing::error!(%err);
            }
        }
    }
}

pub enum CacheKind {
    Http,
    Function,
}

impl CacheKind {
    fn as_u8(&self) -> u8 {
        match self {
            CacheKind::Http => 0,
            CacheKind::Function => 1,
        }
    }
}

#[derive(Debug, Clone, Eq, Hash, PartialEq)]
pub enum CacheDependency {
    DatabaseModel([u8; 16]),
}

/// `(cache_kind, service_idx, cache_key)`
type DependencyMap = Arc<Mutex<HashMap<CacheDependency, HashSet<Bytes>>>>;

pub struct CacheStore {
    /// `(service_kind, service_idx, key_bytes) -> ()`
    ///
    /// in the case of templates the `key_bytes` will likely
    /// be `host|method|matched_path|path_params?|query_params?|incoming_body_hash?|(etag OR content_type|compression) -> Option<last_modified>`.
    quick_cache:
        Arc<Cache<Bytes, Option<Bytes>, UnitWeighter, DefaultHashBuilder, EvictionHandler>>,

    pub limits: CacheLimits,
    env: Arc<Environment>,

    /// `key_bytes -> val_bytes`
    ///
    /// in the case of templates the `val_bytes` will likely be a flexbuffer
    /// with an `etag`, `last-modified` and `response-body`.
    ///
    /// and the `key_bytes` will be `[host, segments, params, compression]`.
    cache_db: Arc<Database<'static>>,

    log_sizes: bool,

    dependency_map: DependencyMap,

    inventory: Arc<Mutex<(u64, usize)>>,
}

impl CacheStore {
    #[allow(clippy::too_many_lines, clippy::missing_panics_doc)]
    pub fn new(
        limits: CacheLimits,
        env: &Arc<Environment>,
        log_sizes: bool,
    ) -> anyhow::Result<Self> {
        let inventory = Arc::new(Mutex::new((0, 0)));

        let cache_db = Arc::new(Database::open(
            env.clone(),
            Some("cache"),
            &DatabaseOptions::new(lmdb::db::Flags::CREATE),
        )?);

        let quick_cache = Arc::new(Cache::with(
            2000,
            2000,
            UnitWeighter,
            DefaultHashBuilder::default(),
            EvictionHandler {
                env: env.clone(),
                cache_db: cache_db.clone(),
                inventory: inventory.clone(),
            },
        ));

        // !! [start] clean out the whole lmdb cache
        let txn = WriteTransaction::new(env.clone())?;

        {
            let mut access = txn.access();
            let mut cursor = txn.cursor(cache_db.clone())?;

            let mut keys = vec![];

            if let Ok((key, _val)) = cursor.first::<[u8], [u8]>(&access) {
                keys.push(key.to_vec());
            }

            while let Ok((key, _val)) = cursor.next::<[u8], [u8]>(&access) {
                keys.push(key.to_vec());
            }

            for key in keys {
                access.del_key(&cache_db, key.as_slice())?;
            }
        }

        txn.commit()?;
        // !! [end] clean out the whole lmdb cache

        let mut dep_map: HashMap<CacheDependency, HashSet<Bytes>> = HashMap::new();

        let mut inventory_lock = inventory.lock();

        let txn = ReadTransaction::new(env.clone())?;

        let access = txn.access();
        let mut cursor = txn.cursor(cache_db.clone())?;

        if let Ok((key, val)) = cursor.first::<[u8], [u8]>(&access) {
            inventory_lock.0 += key.len() as u64;
            inventory_lock.0 += val.len() as u64;
            inventory_lock.1 += 1;

            Self::seed_from_lmdb_entry(&quick_cache, &mut dep_map, key, val)?;
        }

        while let Ok((key, val)) = cursor.next::<[u8], [u8]>(&access) {
            inventory_lock.0 += key.len() as u64;
            inventory_lock.0 += val.len() as u64;
            inventory_lock.1 += 1;

            Self::seed_from_lmdb_entry(&quick_cache, &mut dep_map, key, val)?;
        }

        tracing::info!(
            entries = inventory_lock.1,
            size = log_sizes.then_some(display(
                bytesize::ByteSize(inventory_lock.0).display().si_short()
            ))
        );

        drop(inventory_lock);

        Ok(Self {
            quick_cache,
            limits,
            env: env.clone(),
            cache_db,
            log_sizes,
            dependency_map: Arc::new(Mutex::new(dep_map)),
            inventory,
        })
    }

    #[allow(clippy::similar_names)]
    fn seed_from_lmdb_entry(
        quick_cache: &Arc<
            Cache<Bytes, Option<Bytes>, UnitWeighter, DefaultHashBuilder, EvictionHandler>,
        >,
        dependency_map: &mut HashMap<CacheDependency, HashSet<Bytes>>,
        key: &[u8],
        val: &[u8],
    ) -> anyhow::Result<()> {
        let root = flexbuffers::Reader::get_root(val)?;
        let root_vec = root.as_vector();

        let internal = root_vec.idx(0).as_vector();

        let deps_vec = internal.idx(0).as_vector();

        for dep in &deps_vec {
            let dep_vec = dep.as_vector();

            let dep_kind = dep_vec.idx(0).as_u8();

            let dep = if dep_kind == 0 {
                let uuid = Uuid::from_slice(dep_vec.idx(1).as_blob().0)?;
                CacheDependency::DatabaseModel(*uuid.as_bytes())
            } else {
                continue;
            };

            if let Some(inverse_set) = dependency_map.get_mut(&dep) {
                inverse_set.insert(Bytes::copy_from_slice(key));
            } else {
                let mut inverse_set = HashSet::new();
                inverse_set.insert(Bytes::copy_from_slice(key));

                dependency_map.insert(dep, inverse_set);
            }
        }

        let is_quick_cache = internal.idx(1).as_bool();

        if is_quick_cache {
            let keep_in_memory = internal.idx(2).as_bool();

            if keep_in_memory {
                quick_cache.insert(
                    Bytes::copy_from_slice(key),
                    Some(Bytes::copy_from_slice(root_vec.idx(1).as_blob().0)),
                );
            } else {
                quick_cache.insert(Bytes::copy_from_slice(key), None);
            }
        }
        Ok(())
    }

    /// Check the `cache_db` for a hit; returns `Ok(None)` if not.
    #[allow(clippy::type_complexity)]
    #[instrument(skip_all, err)]
    pub fn check(
        &self,
        config: &StoredCacheConfig,
        cache_kind: CacheKind,
        lookup: Lookup,
    ) -> anyhow::Result<Option<Bytes>> {
        let mut cache_key_mut = BytesMut::new();
        cache_key_mut.put_u8(cache_kind.as_u8());

        let mut rows = 0;

        match config.policy {
            StoredCachePolicy::Permanent => {
                let txn = ReadTransaction::new(self.env.clone())?;
                let access = txn.access();

                let mut cursor = txn.cursor(self.cache_db.clone())?;
                let checks_set = lookup.set(&mut cache_key_mut);
                cache_key_mut.put_slice(lookup.base.as_ref());

                if let Ok((key, val)) =
                    cursor.seek_range_k::<[u8], [u8]>(&access, cache_key_mut.as_ref())
                {
                    rows += 1;

                    if !key.starts_with(cache_key_mut.as_ref()) {
                        tracing::info!(hit = false, rows);
                        return Ok(None);
                    }

                    if checks_set.contains(key) {
                        let root = flexbuffers::Reader::get_root(val)?;
                        let val = root.as_vector().idx(1).as_blob();

                        tracing::info!(hit = true, rows);
                        return Ok(Some(Bytes::copy_from_slice(val.0)));
                    }
                } else {
                    tracing::info!(hit = false, rows);
                    return Ok(None);
                }

                while let Ok((key, val)) = cursor.next::<[u8], [u8]>(&access) {
                    rows += 1;

                    if !key.starts_with(cache_key_mut.as_ref()) {
                        tracing::info!(hit = false, rows);
                        return Ok(None);
                    }

                    if checks_set.contains(key) {
                        let root = flexbuffers::Reader::get_root(val)?;
                        let val = root.as_vector().idx(1).as_blob();

                        tracing::info!(hit = true, rows);
                        return Ok(Some(Bytes::copy_from_slice(val.0)));
                    }
                }

                tracing::info!(hit = false, rows);
                Ok(None)
            }
            StoredCachePolicy::QuickCache => {
                for check in lookup.checks {
                    rows += 1;

                    cache_key_mut.put_slice(check.as_ref());

                    if let Some(val) = self.quick_cache.get(cache_key_mut.as_ref()) {
                        if let Some(val) = val {
                            tracing::info!(hit = true, rows);
                            return Ok(Some(val));
                        }

                        let txn = ReadTransaction::new(self.env.clone())?;
                        let access = txn.access();

                        if let Ok(res) =
                            access.get::<[u8], [u8]>(&self.cache_db, cache_key_mut.as_ref())
                        {
                            let root = flexbuffers::Reader::get_root(res)?;
                            let val = root.as_vector().idx(1).as_blob();

                            tracing::info!(hit = true, rows);
                            return Ok(Some(Bytes::copy_from_slice(val.0)));
                        }
                    }

                    cache_key_mut.truncate(1);
                }

                tracing::info!(hit = false, rows);
                Ok(None)
            }
        }
    }

    /// Caches item for kind and index for specified cache key.
    ///
    /// LMDB format (`cache_db`)
    /// ```null
    /// uuid_v7 ->
    /// - internal 0 (vector)
    ///   - deps 0 (vector)
    ///   - quick_cache 1 (bool)
    ///   - value_in_memory 1 (bool)
    /// - value 1 (blob)
    /// ```
    #[allow(
        clippy::too_many_lines,
        clippy::too_many_arguments,
        clippy::similar_names
    )]
    #[instrument(skip_all, err)]
    pub fn write(
        &self,
        config: &StoredCacheConfig,
        cache_kind: CacheKind,
        cache_key: &[u8],
        cache_val: &[u8],
        dependencies: Option<SmallVec<[CacheDependency; 13]>>,
        value_in_memory: bool,
    ) -> anyhow::Result<()> {
        let mut cache_key_mut = BytesMut::new();

        cache_key_mut.put_u8(cache_kind.as_u8());
        cache_key_mut.put(cache_key);

        let cache_key: Bytes = cache_key_mut.into();

        let mut builder = flexbuffers::Builder::new(&flexbuffers::BuilderOptions::SHARE_NONE);
        let mut builder_vec = builder.start_vector();

        let mut internal_vec = builder_vec.start_vector();

        let mut deps_vec = internal_vec.start_vector();

        if config.evict_on_dependency_change == Some(true)
            && let Some(dependencies) = dependencies
        {
            let mut dep_lock = self.dependency_map.lock();

            for dep in dependencies {
                let mut dep_vec = deps_vec.start_vector();

                match dep {
                    CacheDependency::DatabaseModel(uuid) => {
                        dep_vec.push(0u8);
                        dep_vec.push(flexbuffers::Blob(uuid.as_ref()));
                    }
                }

                dep_vec.end_vector();

                if let Some(inverse_set) = dep_lock.get_mut(&dep) {
                    inverse_set.insert(cache_key.clone());
                } else {
                    let mut inverse_set = HashSet::new();
                    inverse_set.insert(cache_key.clone());

                    (*dep_lock).insert(dep, inverse_set);
                }
            }
        }

        deps_vec.end_vector();

        if let StoredCachePolicy::QuickCache = config.policy {
            internal_vec.push(true);
            internal_vec.push(value_in_memory);
        } else {
            internal_vec.push(false);
        }

        internal_vec.end_vector();

        builder_vec.push(flexbuffers::Blob(cache_val));
        builder_vec.end_vector();

        let val = builder.view();
        let size = (val.len() + cache_key.len()) as u64;

        let mut lock = self.inventory.lock();

        if let Some(max_size) = config.max_size
            && size + lock.0 > max_size
        {
            tracing::warn!("item causes 'max_size' to be exceeded");
            return Ok(());
        }

        if let Some(max_count) = config.max_count
            && 1 + lock.1 > max_count
        {
            tracing::warn!("item causes 'max_count' to be exceeded");
            return Ok(());
        }

        lock.0 += size;
        lock.1 += 1;

        let storage_size = lock.0;
        let entries = lock.1;

        drop(lock);

        let txn = WriteTransaction::new(self.env.clone())?;

        {
            let mut access = txn.access();
            access.put::<[u8], [u8]>(
                &self.cache_db,
                cache_key.as_ref(),
                val,
                &put::Flags::empty(),
            )?;
        }

        txn.commit()?;

        if let StoredCachePolicy::QuickCache = config.policy {
            self.quick_cache.insert(
                cache_key.clone(),
                value_in_memory.then_some(Bytes::copy_from_slice(cache_val)),
            );
        }

        tracing::info!(
            total.entries = entries,
            total.size = self.log_sizes.then_some(display(
                bytesize::ByteSize(storage_size).display().si_short()
            )),
            item.size = self
                .log_sizes
                .then_some(display(bytesize::ByteSize(size).display().si_short())),
            "stored"
        );

        Ok(())
    }

    #[instrument(skip_all, err)]
    pub async fn dependency_evict(&self, dependencies: Vec<CacheDependency>) -> anyhow::Result<()> {
        {
            let txn = WriteTransaction::new(self.env.clone())?;

            let mut lock_dep_map = self.dependency_map.lock();
            let mut lock_inventory = self.inventory.lock();

            {
                let mut access = txn.access();

                for dependency in dependencies {
                    if let Some(addrs) = lock_dep_map.get(&dependency) {
                        for cache_key in addrs {
                            {
                                tracing::debug!("evicting for dependency");

                                if self.quick_cache.remove(cache_key).is_none() {
                                    match access
                                        .get::<[u8], [u8]>(&self.cache_db, cache_key.as_ref())
                                    {
                                        Ok(val) => {
                                            lock_inventory.0 -= cache_key.len() as u64;
                                            lock_inventory.0 -= val.len() as u64;
                                            lock_inventory.1 -= 1;
                                        }
                                        Err(err) => {
                                            tracing::warn!(%err);
                                        }
                                    }

                                    if let Err(err) =
                                        access.del_key(&self.cache_db, cache_key.as_ref())
                                    {
                                        tracing::warn!(%err);
                                    }
                                }
                            }
                        }
                    }

                    lock_dep_map.remove(&dependency);
                }
            }

            txn.commit()?;
        }

        Ok(())
    }

    #[instrument(skip_all, err)]
    pub async fn artifact_evict(
        &self,
        config: &StoredCache,
        kind: CacheKind,
        idx: u8,
    ) -> anyhow::Result<()> {
        let mut key = BytesMut::new();

        key.put_u8(kind.as_u8());
        key.put_u8(idx);

        let mut lock_inventory = self.inventory.lock();

        let txn = WriteTransaction::new(self.env.clone())?;

        {
            let mut access = txn.access();
            let mut cursor = txn.cursor(self.cache_db.clone())?;

            let mut keys = vec![];

            if let Ok((key, val)) = cursor.seek_range_k::<[u8], [u8]>(&access, key.as_ref()) {
                lock_inventory.0 -= key.len() as u64;
                lock_inventory.0 -= val.len() as u64;
                lock_inventory.1 -= 1;

                keys.push(Bytes::copy_from_slice(key));
            }

            while let Ok((key, val)) = cursor.next::<[u8], [u8]>(&access) {
                lock_inventory.0 -= key.len() as u64;
                lock_inventory.0 -= val.len() as u64;
                lock_inventory.1 -= 1;

                keys.push(Bytes::copy_from_slice(key));
            }

            for key in keys {
                match config.policy {
                    StoredCachePolicy::Permanent => {
                        if let Err(err) = access.del_key::<[u8]>(&self.cache_db, key.as_ref()) {
                            tracing::error!(%err);
                        }
                    }
                    StoredCachePolicy::QuickCache => {
                        // lmdb cleanup happens in the eviction handler
                        self.quick_cache.remove(&key);
                    }
                }
            }
        }

        txn.commit()?;

        Ok(())
    }
}