wasmtime 22.0.0 → 23.0.2

data/ext/cargo-vendor/wasmtime-22.0.0/src/runtime/vm/instance/allocator/pooling/index_allocator.rs

@@ -1,707 +0,0 @@
-//! Index/slot allocator policies for the pooling allocator.
-
-use crate::prelude::*;
-use crate::runtime::vm::CompiledModuleId;
-use std::collections::hash_map::{Entry, HashMap};
-use std::mem;
-use std::sync::Mutex;
-use wasmtime_environ::DefinedMemoryIndex;
-
-/// A slot index.
-#[derive(Hash, Clone, Copy, Debug, PartialEq, Eq)]
-pub struct SlotId(pub u32);
-
-impl SlotId {
-    /// The index of this slot.
-    pub fn index(self) -> usize {
-        self.0 as usize
-    }
-}
-
-/// A simple index allocator.
-///
-/// This index allocator doesn't do any module affinity or anything like that,
-/// however it is built on top of the `ModuleAffinityIndexAllocator` to save
-/// code (and code size).
-#[derive(Debug)]
-pub struct SimpleIndexAllocator(ModuleAffinityIndexAllocator);
-
-impl SimpleIndexAllocator {
-    pub fn new(capacity: u32) -> Self {
-        SimpleIndexAllocator(ModuleAffinityIndexAllocator::new(capacity, 0))
-    }
-
-    #[allow(unused)] // some cfgs don't use this
-    pub fn is_empty(&self) -> bool {
-        self.0.is_empty()
-    }
-
-    pub fn alloc(&self) -> Option<SlotId> {
-        self.0.alloc(None)
-    }
-
-    pub(crate) fn free(&self, index: SlotId) {
-        self.0.free(index);
-    }
-
-    #[cfg(test)]
-    #[allow(unused)]
-    pub(crate) fn testing_freelist(&self) -> Vec<SlotId> {
-        self.0.testing_freelist()
-    }
-}
-
-/// A particular defined memory within a particular module.
-#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]
-pub struct MemoryInModule(pub CompiledModuleId, pub DefinedMemoryIndex);
-
-/// An index allocator that has configurable affinity between slots and modules
-/// so that slots are often reused for the same module again.
-#[derive(Debug)]
-pub struct ModuleAffinityIndexAllocator(Mutex<Inner>);
-
-#[derive(Debug)]
-struct Inner {
-    /// Maximum number of "unused warm slots" which will be allowed during
-    /// allocation.
-    ///
-    /// This is a user-configurable knob which can be used to influence the
-    /// maximum number of unused slots at any one point in time. A "warm slot"
-    /// is one that's considered having been previously allocated.
-    max_unused_warm_slots: u32,
-
-    /// Current count of "warm slots", or those that were previously allocated
-    /// which are now no longer in use.
-    ///
-    /// This is the size of the `warm` list.
-    unused_warm_slots: u32,
-
-    /// A linked list (via indices) which enumerates all "warm and unused"
-    /// slots, or those which have previously been allocated and then free'd.
-    warm: List,
-
-    /// Last slot that was allocated for the first time ever.
-    ///
-    /// This is initially 0 and is incremented during `pick_cold`. If this
-    /// matches `max_cold`, there are no more cold slots left.
-    last_cold: u32,
-
-    /// The state of any given slot.
-    ///
-    /// Records indices in the above list (empty) or two lists (with affinity),
-    /// and these indices are kept up-to-date to allow fast removal.
-    slot_state: Vec<SlotState>,
-
-    /// Affine slot management which tracks which slots are free and were last
-    /// used with the specified `CompiledModuleId`.
-    ///
-    /// The `List` here is appended to during deallocation and removal happens
-    /// from the tail during allocation.
-    module_affine: HashMap<MemoryInModule, List>,
-}
-
-/// A helper "linked list" data structure which is based on indices.
-#[derive(Default, Debug)]
-struct List {
-    head: Option<SlotId>,
-    tail: Option<SlotId>,
-}
-
-/// A helper data structure for an intrusive linked list, coupled with the
-/// `List` type.
-#[derive(Default, Debug, Copy, Clone)]
-struct Link {
-    prev: Option<SlotId>,
-    next: Option<SlotId>,
-}
-
-#[derive(Clone, Debug)]
-enum SlotState {
-    /// This slot is currently in use and is affine to the specified module's memory.
-    Used(Option<MemoryInModule>),
-
-    /// This slot is not currently used, and has never been used.
-    UnusedCold,
-
-    /// This slot is not currently used, but was previously allocated.
-    ///
-    /// The payload here is metadata about the lists that this slot is contained
-    /// within.
-    UnusedWarm(Unused),
-}
-
-impl SlotState {
-    fn unwrap_unused(&mut self) -> &mut Unused {
-        match self {
-            SlotState::UnusedWarm(u) => u,
-            _ => unreachable!(),
-        }
-    }
-}
-
-#[derive(Default, Copy, Clone, Debug)]
-struct Unused {
-    /// Which module this slot was historically affine to, if any.
-    affinity: Option<MemoryInModule>,
-
-    /// Metadata about the linked list for all slots affine to `affinity`.
-    affine_list_link: Link,
-
-    /// Metadata within the `warm` list of the main allocator.
-    unused_list_link: Link,
-}
-
-enum AllocMode {
-    ForceAffineAndClear,
-    AnySlot,
-}
-
-impl ModuleAffinityIndexAllocator {
-    /// Create the default state for this strategy.
-    pub fn new(capacity: u32, max_unused_warm_slots: u32) -> Self {
-        ModuleAffinityIndexAllocator(Mutex::new(Inner {
-            last_cold: 0,
-            max_unused_warm_slots,
-            unused_warm_slots: 0,
-            module_affine: HashMap::new(),
-            slot_state: (0..capacity).map(|_| SlotState::UnusedCold).collect(),
-            warm: List::default(),
-        }))
-    }
-
-    /// How many slots can this allocator allocate?
-    pub fn len(&self) -> usize {
-        let inner = self.0.lock().unwrap();
-        inner.slot_state.len()
-    }
-
-    /// Are zero slots in use right now?
-    #[allow(unused)] // some cfgs don't use this
-    pub fn is_empty(&self) -> bool {
-        let inner = self.0.lock().unwrap();
-        !inner
-            .slot_state
-            .iter()
-            .any(|s| matches!(s, SlotState::Used(_)))
-    }
-
-    /// Allocate a new index from this allocator optionally using `id` as an
-    /// affinity request if the allocation strategy supports it.
-    ///
-    /// Returns `None` if no more slots are available.
-    pub fn alloc(&self, for_memory: Option<MemoryInModule>) -> Option<SlotId> {
-        self._alloc(for_memory, AllocMode::AnySlot)
-    }
-
-    /// Attempts to allocate a guaranteed-affine slot to the module `id`
-    /// specified.
-    ///
-    /// Returns `None` if there are no slots affine to `id`. The allocation of
-    /// this slot will not record the affinity to `id`, instead simply listing
-    /// it as taken. This is intended to be used for clearing out all affine
-    /// slots to a module.
-    pub fn alloc_affine_and_clear_affinity(
-        &self,
-        module_id: CompiledModuleId,
-        memory_index: DefinedMemoryIndex,
-    ) -> Option<SlotId> {
-        self._alloc(
-            Some(MemoryInModule(module_id, memory_index)),
-            AllocMode::ForceAffineAndClear,
-        )
-    }
-
-    fn _alloc(&self, for_memory: Option<MemoryInModule>, mode: AllocMode) -> Option<SlotId> {
-        let mut inner = self.0.lock().unwrap();
-        let inner = &mut *inner;
-
-        // As a first-pass always attempt an affine allocation. This will
-        // succeed if any slots are considered affine to `module_id` (if it's
-        // specified). Failing that something else is attempted to be chosen.
-        let slot_id = inner.pick_affine(for_memory).or_else(|| {
-            match mode {
-                // If any slot is requested then this is a normal instantiation
-                // looking for an index. Without any affine candidates there are
-                // two options here:
-                //
-                // 1. Pick a slot amongst previously allocated slots
-                // 2. Pick a slot that's never been used before
-                //
-                // The choice here is guided by the initial configuration of
-                // `max_unused_warm_slots`. If our unused warm slots, which are
-                // likely all affine, is below this threshold then the affinity
-                // of the warm slots isn't tampered with and first a cold slot
-                // is chosen. If the cold slot allocation fails, however, a warm
-                // slot is evicted.
-                //
-                // The opposite happens when we're above our threshold for the
-                // maximum number of warm slots, meaning that a warm slot is
-                // attempted to be picked from first with a cold slot following
-                // that. Note that the warm slot allocation in this case should
-                // only fail of `max_unused_warm_slots` is 0, otherwise
-                // `pick_warm` will always succeed.
-                AllocMode::AnySlot => {
-                    if inner.unused_warm_slots < inner.max_unused_warm_slots {
-                        inner.pick_cold().or_else(|| inner.pick_warm())
-                    } else {
-                        inner.pick_warm().or_else(|| {
-                            debug_assert!(inner.max_unused_warm_slots == 0);
-                            inner.pick_cold()
-                        })
-                    }
-                }
-
-                // In this mode an affinity-based allocation is always performed
-                // as the purpose here is to clear out slots relevant to
-                // `module_id` during module teardown. This means that there's
-                // no consulting non-affine slots in this path.
-                AllocMode::ForceAffineAndClear => None,
-            }
-        })?;
-
-        inner.slot_state[slot_id.index()] = SlotState::Used(match mode {
-            AllocMode::ForceAffineAndClear => None,
-            AllocMode::AnySlot => for_memory,
-        });
-
-        Some(slot_id)
-    }
-
-    pub(crate) fn free(&self, index: SlotId) {
-        let mut inner = self.0.lock().unwrap();
-        let inner = &mut *inner;
-        let module_memory = match inner.slot_state[index.index()] {
-            SlotState::Used(module_memory) => module_memory,
-            _ => unreachable!(),
-        };
-
-        // Bump the number of warm slots since this slot is now considered
-        // previously used. Afterwards append it to the linked list of all
-        // unused and warm slots.
-        inner.unused_warm_slots += 1;
-        let unused_list_link = inner
-            .warm
-            .append(index, &mut inner.slot_state, |s| &mut s.unused_list_link);
-
-        let affine_list_link = match module_memory {
-            // If this slot is affine to a particular module then append this
-            // index to the linked list for the affine module. Otherwise insert
-            // a new one-element linked list.
-            Some(module) => match inner.module_affine.entry(module) {
-                Entry::Occupied(mut e) => e
-                    .get_mut()
-                    .append(index, &mut inner.slot_state, |s| &mut s.affine_list_link),
-                Entry::Vacant(v) => {
-                    v.insert(List::new(index));
-                    Link::default()
-                }
-            },
-
-            // If this slot has no affinity then the affine link is empty.
-            None => Link::default(),
-        };
-
-        inner.slot_state[index.index()] = SlotState::UnusedWarm(Unused {
-            affinity: module_memory,
-            affine_list_link,
-            unused_list_link,
-        });
-    }
-
-    /// Return the number of empty slots available in this allocator.
-    #[cfg(test)]
-    pub fn num_empty_slots(&self) -> usize {
-        let inner = self.0.lock().unwrap();
-        let total_slots = inner.slot_state.len();
-        (total_slots - inner.last_cold as usize) + inner.unused_warm_slots as usize
-    }
-
-    /// For testing only, we want to be able to assert what is on the single
-    /// freelist, for the policies that keep just one.
-    #[cfg(test)]
-    #[allow(unused)]
-    pub(crate) fn testing_freelist(&self) -> Vec<SlotId> {
-        let inner = self.0.lock().unwrap();
-        inner
-            .warm
-            .iter(&inner.slot_state, |s| &s.unused_list_link)
-            .collect()
-    }
-
-    /// For testing only, get the list of all modules with at least one slot
-    /// with affinity for that module.
-    #[cfg(test)]
-    pub(crate) fn testing_module_affinity_list(&self) -> Vec<MemoryInModule> {
-        let inner = self.0.lock().unwrap();
-        inner.module_affine.keys().copied().collect()
-    }
-}
-
-impl Inner {
-    /// Attempts to allocate a slot already affine to `id`, returning `None` if
-    /// `id` is `None` or if there are no affine slots.
-    fn pick_affine(&mut self, for_memory: Option<MemoryInModule>) -> Option<SlotId> {
-        // Note that the `tail` is chosen here of the affine list as it's the
-        // most recently used, which for affine allocations is what we want --
-        // maximizing temporal reuse.
-        let ret = self.module_affine.get(&for_memory?)?.tail?;
-        self.remove(ret);
-        Some(ret)
-    }
-
-    fn pick_warm(&mut self) -> Option<SlotId> {
-        // Insertions into the `unused` list happen at the `tail`, so the
-        // least-recently-used item will be at the head. That's our goal here,
-        // pick the least-recently-used slot since something "warm" is being
-        // evicted anyway.
-        let head = self.warm.head?;
-        self.remove(head);
-        Some(head)
-    }
-
-    fn remove(&mut self, slot: SlotId) {
-        // Decrement the size of the warm list, and additionally remove it from
-        // the `warm` linked list.
-        self.unused_warm_slots -= 1;
-        self.warm
-            .remove(slot, &mut self.slot_state, |u| &mut u.unused_list_link);
-
-        // If this slot is affine to a module then additionally remove it from
-        // that module's affinity linked list. Note that if the module's affine
-        // list is empty then the module's entry in the map is completely
-        // removed as well.
-        let module = self.slot_state[slot.index()].unwrap_unused().affinity;
-        if let Some(module) = module {
-            let mut list = match self.module_affine.entry(module) {
-                Entry::Occupied(e) => e,
-                Entry::Vacant(_) => unreachable!(),
-            };
-            list.get_mut()
-                .remove(slot, &mut self.slot_state, |u| &mut u.affine_list_link);
-
-            if list.get_mut().head.is_none() {
-                list.remove();
-            }
-        }
-    }
-
-    fn pick_cold(&mut self) -> Option<SlotId> {
-        if (self.last_cold as usize) == self.slot_state.len() {
-            None
-        } else {
-            let ret = Some(SlotId(self.last_cold));
-            self.last_cold += 1;
-            ret
-        }
-    }
-}
-
-impl List {
-    /// Creates a new one-element list pointing at `id`.
-    fn new(id: SlotId) -> List {
-        List {
-            head: Some(id),
-            tail: Some(id),
-        }
-    }
-
-    /// Appends the `id` to this list whose links are determined by `link`.
-    fn append(
-        &mut self,
-        id: SlotId,
-        states: &mut [SlotState],
-        link: fn(&mut Unused) -> &mut Link,
-    ) -> Link {
-        // This `id` is the new tail...
-        let tail = mem::replace(&mut self.tail, Some(id));
-
-        // If the tail was present, then update its `next` field to ourselves as
-        // we've been appended, otherwise update the `head` since the list was
-        // previously empty.
-        match tail {
-            Some(tail) => link(states[tail.index()].unwrap_unused()).next = Some(id),
-            None => self.head = Some(id),
-        }
-        Link {
-            prev: tail,
-            next: None,
-        }
-    }
-
-    /// Removes `id` from this list whose links are determined by `link`.
-    fn remove(
-        &mut self,
-        id: SlotId,
-        slot_state: &mut [SlotState],
-        link: fn(&mut Unused) -> &mut Link,
-    ) -> Unused {
-        let mut state = *slot_state[id.index()].unwrap_unused();
-        let next = link(&mut state).next;
-        let prev = link(&mut state).prev;
-
-        // If a `next` node is present for this link, then its previous was our
-        // own previous now. Otherwise we are the tail so the new tail is our
-        // previous.
-        match next {
-            Some(next) => link(slot_state[next.index()].unwrap_unused()).prev = prev,
-            None => self.tail = prev,
-        }
-
-        // Same as the `next` node, except everything is in reverse.
-        match prev {
-            Some(prev) => link(slot_state[prev.index()].unwrap_unused()).next = next,
-            None => self.head = next,
-        }
-        state
-    }
-
-    #[cfg(test)]
-    #[allow(unused)]
-    fn iter<'a>(
-        &'a self,
-        states: &'a [SlotState],
-        link: fn(&Unused) -> &Link,
-    ) -> impl Iterator<Item = SlotId> + 'a {
-        let mut cur = self.head;
-        let mut prev = None;
-        std::iter::from_fn(move || {
-            if cur.is_none() {
-                assert_eq!(prev, self.tail);
-            }
-            let ret = cur?;
-            match &states[ret.index()] {
-                SlotState::UnusedWarm(u) => {
-                    assert_eq!(link(u).prev, prev);
-                    prev = Some(ret);
-                    cur = link(u).next
-                }
-                _ => unreachable!(),
-            }
-            Some(ret)
-        })
-    }
-}
-
-#[cfg(test)]
-mod test {
-    use super::*;
-    use crate::runtime::vm::CompiledModuleIdAllocator;
-    use wasmtime_environ::EntityRef;
-
-    #[test]
-    fn test_next_available_allocation_strategy() {
-        for size in 0..20 {
-            let state = ModuleAffinityIndexAllocator::new(size, 0);
-            assert_eq!(state.num_empty_slots() as u32, size);
-            for i in 0..size {
-                assert_eq!(state.num_empty_slots() as u32, size - i);
-                assert_eq!(state.alloc(None).unwrap().index(), i as usize);
-            }
-            assert!(state.alloc(None).is_none());
-        }
-    }
-
-    #[test]
-    fn test_affinity_allocation_strategy() {
-        let id_alloc = CompiledModuleIdAllocator::new();
-        let id1 = MemoryInModule(id_alloc.alloc(), DefinedMemoryIndex::new(0));
-        let id2 = MemoryInModule(id_alloc.alloc(), DefinedMemoryIndex::new(0));
-        let state = ModuleAffinityIndexAllocator::new(100, 100);
-
-        let index1 = state.alloc(Some(id1)).unwrap();
-        assert_eq!(index1.index(), 0);
-        let index2 = state.alloc(Some(id2)).unwrap();
-        assert_eq!(index2.index(), 1);
-        assert_ne!(index1, index2);
-
-        state.free(index1);
-        assert_eq!(state.num_empty_slots(), 99);
-
-        // Allocate to the same `index1` slot again.
-        let index3 = state.alloc(Some(id1)).unwrap();
-        assert_eq!(index3, index1);
-        state.free(index3);
-
-        state.free(index2);
-
-        // Both id1 and id2 should have some slots with affinity.
-        let affinity_modules = state.testing_module_affinity_list();
-        assert_eq!(2, affinity_modules.len());
-        assert!(affinity_modules.contains(&id1));
-        assert!(affinity_modules.contains(&id2));
-
-        // Now there is 1 free instance for id2 and 1 free instance
-        // for id1, and 98 empty. Allocate 100 for id2. The first
-        // should be equal to the one we know was previously used for
-        // id2. The next 99 are arbitrary.
-        assert_eq!(state.num_empty_slots(), 100);
-        let mut indices = vec![];
-        for _ in 0..100 {
-            indices.push(state.alloc(Some(id2)).unwrap());
-        }
-        assert!(state.alloc(None).is_none());
-        assert_eq!(indices[0], index2);
-        assert_eq!(state.num_empty_slots(), 0);
-
-        for i in indices {
-            state.free(i);
-        }
-
-        // Now there should be no slots left with affinity for id1.
-        let affinity_modules = state.testing_module_affinity_list();
-        assert_eq!(1, affinity_modules.len());
-        assert!(affinity_modules.contains(&id2));
-
-        // Allocate an index we know previously had an instance but
-        // now does not (list ran empty).
-        let index = state.alloc(Some(id1)).unwrap();
-        state.free(index);
-    }
-
-    #[test]
-    fn clear_affine() {
-        let id_alloc = CompiledModuleIdAllocator::new();
-        let id = id_alloc.alloc();
-        let memory_index = DefinedMemoryIndex::new(0);
-
-        for max_unused_warm_slots in [0, 1, 2] {
-            let state = ModuleAffinityIndexAllocator::new(100, max_unused_warm_slots);
-
-            let index1 = state.alloc(Some(MemoryInModule(id, memory_index))).unwrap();
-            let index2 = state.alloc(Some(MemoryInModule(id, memory_index))).unwrap();
-            state.free(index2);
-            state.free(index1);
-            assert!(state
-                .alloc_affine_and_clear_affinity(id, memory_index)
-                .is_some());
-            assert!(state
-                .alloc_affine_and_clear_affinity(id, memory_index)
-                .is_some());
-            assert_eq!(
-                state.alloc_affine_and_clear_affinity(id, memory_index),
-                None
-            );
-        }
-    }
-
-    #[test]
-    fn test_affinity_allocation_strategy_random() {
-        use rand::Rng;
-        let mut rng = rand::thread_rng();
-
-        let id_alloc = CompiledModuleIdAllocator::new();
-        let ids =
-            std::iter::repeat_with(|| MemoryInModule(id_alloc.alloc(), DefinedMemoryIndex::new(0)))
-                .take(10)
-                .collect::<Vec<_>>();
-        let state = ModuleAffinityIndexAllocator::new(1000, 1000);
-        let mut allocated: Vec<SlotId> = vec![];
-        let mut last_id = vec![None; 1000];
-
-        let mut hits = 0;
-        let amt = if cfg!(miri) { 100 } else { 100_000 };
-        for _ in 0..amt {
-            loop {
-                if !allocated.is_empty() && rng.gen_bool(0.5) {
-                    let i = rng.gen_range(0..allocated.len());
-                    let to_free_idx = allocated.swap_remove(i);
-                    state.free(to_free_idx);
-                } else {
-                    let id = ids[rng.gen_range(0..ids.len())];
-                    let index = match state.alloc(Some(id)) {
-                        Some(id) => id,
-                        None => continue,
-                    };
-                    if last_id[index.index()] == Some(id) {
-                        hits += 1;
-                    }
-                    last_id[index.index()] = Some(id);
-                    allocated.push(index);
-                }
-                break;
-            }
-        }
-
-        // 10% reuse would be random chance (because we have 10 module
-        // IDs). Check for at least double that to ensure some sort of
-        // affinity is occurring.
-        assert!(
-            hits > (amt / 5),
-            "expected at least 20000 (20%) ID-reuses but got {}",
-            hits
-        );
-    }
-
-    #[test]
-    fn test_affinity_threshold() {
-        let id_alloc = CompiledModuleIdAllocator::new();
-        let id1 = MemoryInModule(id_alloc.alloc(), DefinedMemoryIndex::new(0));
-        let id2 = MemoryInModule(id_alloc.alloc(), DefinedMemoryIndex::new(0));
-        let id3 = MemoryInModule(id_alloc.alloc(), DefinedMemoryIndex::new(0));
-        let state = ModuleAffinityIndexAllocator::new(10, 2);
-
-        // Set some slot affinities
-        assert_eq!(state.alloc(Some(id1)), Some(SlotId(0)));
-        state.free(SlotId(0));
-        assert_eq!(state.alloc(Some(id2)), Some(SlotId(1)));
-        state.free(SlotId(1));
-
-        // Only 2 slots are allowed to be unused and warm, so we're at our
-        // threshold, meaning one must now be evicted.
-        assert_eq!(state.alloc(Some(id3)), Some(SlotId(0)));
-        state.free(SlotId(0));
-
-        // pickup `id2` again, it should be affine.
-        assert_eq!(state.alloc(Some(id2)), Some(SlotId(1)));
-
-        // with only one warm slot available allocation for `id1` should pick a
-        // fresh slot
-        assert_eq!(state.alloc(Some(id1)), Some(SlotId(2)));
-
-        state.free(SlotId(1));
-        state.free(SlotId(2));
-
-        // ensure everything stays affine
-        assert_eq!(state.alloc(Some(id1)), Some(SlotId(2)));
-        assert_eq!(state.alloc(Some(id2)), Some(SlotId(1)));
-        assert_eq!(state.alloc(Some(id3)), Some(SlotId(0)));
-
-        state.free(SlotId(1));
-        state.free(SlotId(2));
-        state.free(SlotId(0));
-
-        // LRU is 1, so that should be picked
-        assert_eq!(
-            state.alloc(Some(MemoryInModule(
-                id_alloc.alloc(),
-                DefinedMemoryIndex::new(0)
-            ))),
-            Some(SlotId(1))
-        );
-
-        // Pick another LRU entry, this time 2
-        assert_eq!(
-            state.alloc(Some(MemoryInModule(
-                id_alloc.alloc(),
-                DefinedMemoryIndex::new(0)
-            ))),
-            Some(SlotId(2))
-        );
-
-        // This should preserve slot `0` and pick up something new
-        assert_eq!(
-            state.alloc(Some(MemoryInModule(
-                id_alloc.alloc(),
-                DefinedMemoryIndex::new(0)
-            ))),
-            Some(SlotId(3))
-        );
-
-        state.free(SlotId(1));
-        state.free(SlotId(2));
-        state.free(SlotId(3));
-
-        // for good measure make sure id3 is still affine
-        assert_eq!(state.alloc(Some(id3)), Some(SlotId(0)));
-    }
-}