rspack_cacheable 0.100.0-rc.2

rspack_cacheable
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

use rkyv::bytecheck::CheckBytes;
use rustc_hash::FxHashMap as HashMap;

use super::VTablePtr;
use crate::{Result, Validator};

type CheckBytesDyn = unsafe fn(*const u8, &mut Validator<'_>) -> Result<()>;

/// # Safety
///
/// Run T::check_bytes
pub unsafe fn default_check_bytes_dyn<T>(
  bytes: *const u8,
  context: &mut Validator<'_>,
) -> Result<()>
where
  T: for<'a> CheckBytes<Validator<'a>>,
{
  unsafe { T::check_bytes(bytes.cast(), context) }
}

pub struct CheckBytesEntry {
  vtable: VTablePtr,
  check_bytes_dyn: CheckBytesDyn,
}

impl CheckBytesEntry {
  #[doc(hidden)]
  pub const fn new(vtable: VTablePtr, check_bytes_dyn: CheckBytesDyn) -> Self {
    Self {
      vtable,
      check_bytes_dyn,
    }
  }
}

inventory::collect!(CheckBytesEntry);

pub static CHECK_BYTES_REGISTRY: std::sync::LazyLock<HashMap<VTablePtr, CheckBytesDyn>> =
  std::sync::LazyLock::new(|| {
    let mut result = HashMap::default();
    for entry in inventory::iter::<CheckBytesEntry> {
      let old_value = result.insert(entry.vtable, entry.check_bytes_dyn);
      if old_value.is_some() {
        panic!(
          "vtable conflict, a trait implementation was likely added twice (but it's possible there was a hash collision)"
        )
      }
    }
    result.shrink_to_fit();
    result
  });