rs_ecs/

archetype.rs

use std::alloc::{alloc, dealloc, handle_alloc_error, Layout};
use std::any::TypeId;
use std::cmp::Reverse;
use std::mem::{align_of, needs_drop, transmute};
use std::ptr::{copy_nonoverlapping, drop_in_place, slice_from_raw_parts_mut};

use crate::{resources::TypeIdMap, world::Entity};

pub struct Archetype {
    types: Box<[TypeMetadata]>,
    layout: Layout,
    len: u32,
    cap: u32,
    ptr: *mut u8,
}

unsafe impl Send for Archetype {}

impl Archetype {
    pub fn new(types: TypeMetadataSet) -> Self {
        assert!(types.0.len() <= u16::MAX as usize);

        let max_align = types
            .0
            .iter()
            .map(|ty| ty.layout.align())
            .max()
            .unwrap_or(1);

        let layout = Layout::from_size_align(0, max_align).unwrap();
        let ptr = invalid_ptr(max_align);

        Self {
            types: types.0.into(),
            layout,
            len: 0,
            cap: 0,
            ptr,
        }
    }
}

impl Archetype {
    pub fn len(&self) -> u32 {
        self.len
    }

    pub unsafe fn alloc(&mut self) -> u32 {
        if self.len == self.cap {
            self.grow();
        }

        let idx = self.len;
        self.len += 1;
        idx
    }

    #[must_use]
    pub unsafe fn free<const DROP: bool>(&mut self, idx: u32) -> bool {
        if DROP {
            for ty in &*self.types {
                if let Some(drop) = ty.drop {
                    let ptr = ty.base_pointer.add(ty.layout.size() * idx as usize);

                    drop(ptr, 1);
                }
            }
        }

        self.len -= 1;

        if idx != self.len {
            for ty in &*self.types {
                let size = ty.layout.size();

                let src_ptr = ty.base_pointer.add(size * self.len as usize);
                let dst_ptr = ty.base_pointer.add(size * idx as usize);

                copy_nonoverlapping(src_ptr, dst_ptr, size);
            }

            true
        } else {
            false
        }
    }

    pub fn clear(&mut self) {
        let len = self.len;
        self.len = 0;

        for ty in &*self.types {
            if let Some(drop) = ty.drop {
                unsafe {
                    drop(ty.base_pointer, len as usize);
                }
            }
        }
    }

    #[cold]
    #[inline(never)]
    fn grow(&mut self) {
        let new_cap = self.cap.checked_add(self.cap.max(8)).unwrap() as usize;

        struct SortOnDrop<'a>(&'a mut [TypeMetadata]);

        impl Drop for SortOnDrop<'_> {
            fn drop(&mut self) {
                self.0.sort_unstable_by_key(|ty| ty.id);
            }
        }

        let types = SortOnDrop(&mut self.types);

        types
            .0
            .sort_unstable_by_key(|ty| Reverse(ty.layout.align()));

        let mut new_offsets = Vec::<usize>::with_capacity(types.0.len());
        let mut new_size = 0;

        for ty in types.0.iter() {
            new_offsets.push(new_size);

            new_size = new_size
                .checked_add(ty.layout.size().checked_mul(new_cap).unwrap())
                .unwrap();
        }

        let new_layout = Layout::from_size_align(new_size, self.layout.align()).unwrap();

        let new_ptr = alloc_ptr(new_layout);

        unsafe {
            for (ty, new_offset) in types.0.iter_mut().zip(&new_offsets) {
                let new_base_pointer = new_ptr.add(*new_offset);

                copy_nonoverlapping(
                    ty.base_pointer,
                    new_base_pointer,
                    ty.layout.size() * self.cap as usize,
                );

                ty.base_pointer = new_base_pointer;
            }

            if self.layout.size() != 0 {
                dealloc(self.ptr, self.layout);
            }
        }

        self.layout = new_layout;
        self.ptr = new_ptr;

        self.cap = new_cap as u32;
    }
}

impl Drop for Archetype {
    fn drop(&mut self) {
        self.clear();

        unsafe {
            if self.layout.size() != 0 {
                dealloc(self.ptr, self.layout);
            }
        }
    }
}

impl Archetype {
    pub fn types(&self) -> TypeMetadataSet {
        TypeMetadataSet(self.types.to_vec())
    }

    pub fn match_(&self, types: &TypeMetadataSet) -> bool {
        let lhs = self.types.iter().map(|ty| ty.id);
        let rhs = types.0.iter().map(|ty| ty.id);

        lhs.eq(rhs)
    }

    pub fn find<C>(&self) -> Option<u16>
    where
        C: 'static,
    {
        self.find_impl(&TypeId::of::<C>())
    }

    fn find_impl(&self, key: &TypeId) -> Option<u16> {
        self.types
            .binary_search_by_key(key, |ty| ty.id)
            .map(|idx| idx as u16)
            .ok()
    }
}

impl Archetype {
    #[allow(clippy::needless_pass_by_ref_mut)]
    pub unsafe fn move_(src: &mut Self, dst: &mut Self, src_idx: u32, dst_idx: u32) {
        debug_assert!(src_idx < src.len);
        debug_assert!(dst_idx < dst.len);

        let mut dst_types = &*dst.types;

        for src_ty in &*src.types {
            let dst_ty = match dst_types.iter().position(|ty| ty.id == src_ty.id) {
                Some(dst_ty) => {
                    dst_types = &dst_types[dst_ty..];
                    &dst_types[0]
                }
                None => continue,
            };

            let size = src_ty.layout.size();

            let src_ptr = src_ty.base_pointer.add(size * src_idx as usize);
            let dst_ptr = dst_ty.base_pointer.add(size * dst_idx as usize);

            copy_nonoverlapping(src_ptr, dst_ptr, size);
        }
    }
}

impl Archetype {
    #[cfg(debug_assertions)]
    fn type_metadata<C>(&self, ty: u16) -> &TypeMetadata
    where
        C: 'static,
    {
        let ty = &self.types[ty as usize];
        assert_eq!(ty.id, TypeId::of::<C>());
        ty
    }

    #[cfg(not(debug_assertions))]
    unsafe fn type_metadata_unchecked(&self, ty: u16) -> &TypeMetadata {
        self.types.get_unchecked(ty as usize)
    }

    pub unsafe fn base_pointer<C>(&self, ty: u16) -> *mut C
    where
        C: 'static,
    {
        #[cfg(debug_assertions)]
        let ty = self.type_metadata::<C>(ty);
        #[cfg(not(debug_assertions))]
        let ty = self.type_metadata_unchecked(ty);

        ty.base_pointer.cast::<C>()
    }

    pub unsafe fn pointer<C>(&self, ty: u16, idx: u32) -> *mut C
    where
        C: 'static,
    {
        let ptr = self.base_pointer::<C>(ty);

        debug_assert!(idx < self.len);
        ptr.add(idx as usize)
    }
}

impl Archetype {
    pub unsafe fn get<C>(&self, idx: u32) -> *mut C
    where
        C: 'static,
    {
        let ty = self.find::<C>().unwrap();
        self.pointer::<C>(ty, idx)
    }

    pub unsafe fn drop<C>(&mut self, idx: u32)
    where
        C: 'static,
    {
        if needs_drop::<C>() {
            if let Some(ty) = self.find::<C>() {
                let ty = self.types.get_unchecked(ty as usize);

                let ptr = ty.base_pointer.add(ty.layout.size() * idx as usize);

                (ty.drop.unwrap())(ptr, 1);
            }
        }
    }
}

impl Archetype {
    pub fn clone(&mut self, cloner: &Cloner) -> Self {
        let ptr = alloc_ptr(self.layout);

        let mut types = self.types.clone();

        unsafe {
            for ty in &mut *types {
                let clone = cloner
                    .clone
                    .get(&ty.id)
                    .expect("Component type missing from cloner");

                let offset = ty.base_pointer.offset_from(self.ptr);
                let new_base_pointer = ptr.offset(offset);

                clone(ty.base_pointer, new_base_pointer, self.len as usize);

                ty.base_pointer = new_base_pointer;
            }
        }

        Self {
            types,
            layout: self.layout,
            len: self.len,
            cap: self.cap,
            ptr,
        }
    }
}

#[derive(Clone, Copy)]
struct TypeMetadata {
    id: TypeId,
    layout: Layout,
    drop: Option<unsafe fn(*mut u8, usize)>,
    base_pointer: *mut u8,
}

impl TypeMetadata {
    fn new<C>() -> Self
    where
        C: 'static,
    {
        unsafe fn drop<C>(ptr: *mut u8, len: usize) {
            drop_in_place(slice_from_raw_parts_mut(ptr.cast::<C>(), len))
        }

        Self {
            id: TypeId::of::<C>(),
            layout: Layout::new::<C>(),
            drop: if needs_drop::<C>() {
                Some(drop::<C>)
            } else {
                None
            },
            base_pointer: invalid_ptr(align_of::<C>()),
        }
    }
}

#[derive(Default)]
pub struct TypeMetadataSet(Vec<TypeMetadata>);

impl TypeMetadataSet {
    pub fn ids(&self) -> impl ExactSizeIterator<Item = TypeId> + '_ {
        self.0.iter().map(|ty| ty.id)
    }

    pub fn insert<C>(&mut self)
    where
        C: 'static,
    {
        if let Err(ty) = self.0.binary_search_by_key(&TypeId::of::<C>(), |ty| ty.id) {
            self.0.insert(ty, TypeMetadata::new::<C>());
        }
    }

    #[must_use]
    pub fn remove<C>(&mut self) -> Option<()>
    where
        C: 'static,
    {
        let ty = self
            .0
            .binary_search_by_key(&TypeId::of::<C>(), |ty| ty.id)
            .ok()?;

        self.0.remove(ty);

        Some(())
    }
}

fn alloc_ptr(layout: Layout) -> *mut u8 {
    if layout.size() == 0 {
        return invalid_ptr(layout.align());
    }

    let ptr = unsafe { alloc(layout) };
    if ptr.is_null() {
        handle_alloc_error(layout);
    }
    ptr
}

fn invalid_ptr(addr: usize) -> *mut u8 {
    unsafe {
        #[allow(integer_to_ptr_transmutes)]
        transmute(addr)
    }
}

/// Collects component types which can be cloned or copied
///
/// Populating such an object with all used component types is required to use [`World::clone`][crate::World::clone].
pub struct Cloner {
    clone: TypeIdMap<unsafe fn(*const u8, *mut u8, usize)>,
}

impl Cloner {
    /// Creates a new cloner which contains only the [`Entity`] component type
    pub fn new() -> Self {
        let mut _self = Self {
            clone: Default::default(),
        };

        _self.add_copyable::<Entity>();

        _self
    }
}

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

impl Cloner {
    /// Adds a component type which is cloneable
    ///
    /// If `C` is actually copyable, using [`add_copyable`][Self::add_copyable] is more efficient.
    pub fn add_cloneable<C>(&mut self)
    where
        C: Clone + 'static,
    {
        unsafe fn clone<C>(src: *const u8, dst: *mut u8, len: usize)
        where
            C: Clone,
        {
            let src = src.cast::<C>();
            let dst = dst.cast::<C>();

            for idx in 0..len {
                let val = (*src.add(idx)).clone();
                dst.add(idx).write(val);
            }
        }

        self.clone.insert(TypeId::of::<C>(), clone::<C>);
    }

    /// Adds a component type which is copyable
    pub fn add_copyable<C>(&mut self)
    where
        C: Copy + 'static,
    {
        unsafe fn clone<C>(src: *const u8, dst: *mut u8, len: usize)
        where
            C: Copy,
        {
            let src = src.cast::<C>();
            let dst = dst.cast::<C>();

            copy_nonoverlapping(src, dst, len);
        }

        self.clone.insert(TypeId::of::<C>(), clone::<C>);
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    use std::cell::Cell;
    use std::rc::Rc;

    #[test]
    fn reverse_sorting_by_alignment_avoids_padding() {
        let mut types = TypeMetadataSet::default();
        types.insert::<u64>();
        types.insert::<u32>();
        types.insert::<u16>();
        types.insert::<u8>();

        let mut archetype = Archetype::new(types);
        let _ent = unsafe { archetype.alloc() };

        assert_eq!(archetype.layout.size(), 8 * (8 + 4 + 2 + 1));
        assert_eq!(archetype.layout.align(), 8);

        assert_eq!(archetype.len, 1);
        assert_eq!(archetype.cap, 8);

        assert_eq!(archetype.types.len(), 4);

        unsafe {
            let ty = archetype.find::<u64>().unwrap();
            let base_pointer = archetype.base_pointer::<u64>(ty);
            assert_eq!(base_pointer, archetype.ptr.add(0).cast());

            let ty = archetype.find::<u32>().unwrap();
            let base_pointer = archetype.base_pointer::<u32>(ty);
            assert_eq!(base_pointer, archetype.ptr.add(8 * 8).cast());

            let ty = archetype.find::<u16>().unwrap();
            let base_pointer = archetype.base_pointer::<u16>(ty);
            assert_eq!(base_pointer, archetype.ptr.add(8 * (8 + 4)).cast());

            let ty = archetype.find::<u8>().unwrap();
            let base_pointer = archetype.base_pointer::<u8>(ty);
            assert_eq!(base_pointer, archetype.ptr.add(8 * (8 + 4 + 2)).cast());
        }
    }

    #[test]
    fn drops_all_component_values() {
        struct CountDrops(Rc<Cell<usize>>);

        impl Drop for CountDrops {
            fn drop(&mut self) {
                let drops = &self.0;

                drops.set(drops.get() + 1);
            }
        }

        let drops = Rc::new(Cell::new(0));

        let mut types = TypeMetadataSet::default();
        types.insert::<CountDrops>();

        let mut archetype = Archetype::new(types);

        unsafe {
            for _ in 0..32 {
                let ent = archetype.alloc();

                archetype
                    .get::<CountDrops>(ent)
                    .write(CountDrops(drops.clone()));
            }
        }

        drop(archetype);

        assert_eq!(drops.get(), 32);
    }
}