Struct wai_bindgen_wasmer::region::BorrowChecker

pub struct BorrowChecker<'a> {
    shared_borrows: HashSet<Region>,
    mut_borrows: HashSet<Region>,
    _marker: PhantomData<&'a mut [u8]>,
    ptr: *mut u8,
    len: usize,
}

Fields

shared_borrows: HashSet<Region>

Maps from handle to region borrowed. A HashMap is probably not ideal for this but it works. It would be more efficient if we could check is_borrowed without an O(n) iteration, by organizing borrows by an ordering of Region.

mut_borrows: HashSet<Region>

_marker: PhantomData<&'a mut [u8]>

ptr: *mut u8

len: usize

Implementations

impl<'a> BorrowChecker<'a>

pub fn new(data: &'a mut [u8]) -> BorrowChecker<'a>

pub fn slice<T: AllBytesValid>( &mut self, ptr: i32, len: i32, ) -> Result<&'a [T], RuntimeError>

pub fn slice_mut<T: AllBytesValid>( &mut self, ptr: i32, len: i32, ) -> Result<&'a mut [T], RuntimeError>

fn get_slice<T: AllBytesValid>( &self, ptr: i32, len: i32, ) -> Result<(&[T], Region), RuntimeError>

fn get_slice_mut<T>( &mut self, ptr: i32, len: i32, ) -> Result<(&mut [T], Region), RuntimeError>

fn region<T>(&self, ptr: i32, len: i32) -> Result<Region, RuntimeError>

pub fn slice_str(&mut self, ptr: i32, len: i32) -> Result<&'a str, RuntimeError>

fn validate_contains(&self, region: &Region) -> Result<(), RuntimeError>

fn is_shared_borrowed(&self, r: Region) -> bool

fn is_mut_borrowed(&self, r: Region) -> bool

pub fn raw(&self) -> *mut [u8]

Trait Implementations

impl Send for BorrowChecker<'_>

impl Sync for BorrowChecker<'_>