wasmi_ir/index.rs
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
//! Definitions for thin-wrapper index types.
use crate::Error;
macro_rules! for_each_index {
($mac:ident) => {
$mac! {
/// Used to query the [`Instruction`] of an [`InstrSequence`].
///
/// [`Instruction`]: crate::Instruction
/// [`InstrSequence`]: crate::InstrSequence
Instr(pub(crate) u32);
/// A Wasmi register.
Reg(pub(crate) i16);
/// A Wasm function index.
Func(pub(crate) u32);
/// A Wasm function type index.
FuncType(pub(crate) u32);
/// A Wasmi internal function index.
InternalFunc(pub(crate) u32);
/// A Wasm global variable index.
Global(pub(crate) u32);
/// A Wasm linear memory index.
Memory(pub(crate) u32);
/// A Wasm table index.
Table(pub(crate) u32);
/// A Wasm data segment index.
Data(pub(crate) u32);
/// A Wasm element segment index.
Elem(pub(crate) u32);
}
};
}
impl Memory {
/// Returns `true` if `self` refers to the default linear memory which always is at index 0.
pub fn is_default(&self) -> bool {
self.0 == 0
}
}
macro_rules! define_index {
(
$(
$( #[$docs:meta] )*
$name:ident($vis:vis $ty:ty)
);* $(;)?
) => {
$(
$( #[$docs] )*
#[derive(Debug, Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct $name($vis $ty);
impl From<$name> for $ty {
fn from(value: $name) -> $ty {
value.0
}
}
impl From<$ty> for $name {
fn from(value: $ty) -> Self {
Self(value)
}
}
)*
};
}
for_each_index!(define_index);
impl TryFrom<u32> for Reg {
type Error = Error;
fn try_from(local_index: u32) -> Result<Self, Self::Error> {
i16::try_from(local_index)
.map_err(|_| Error::RegisterOutOfBounds)
.map(Self::from)
}
}
impl Reg {
/// Returns the n-th next [`Reg`] from `self` with contigous index.
///
/// # Note
///
/// - Calling this with `n == 0` just returns `self`.
/// - This has wrapping semantics with respect to the underlying index.
pub fn next_n(self, n: u16) -> Self {
Self(self.0.wrapping_add_unsigned(n))
}
/// Returns the n-th previous [`Reg`] from `self` with contigous index.
///
/// # Note
///
/// - Calling this with `n == 0` just returns `self`.
/// - This has wrapping semantics with respect to the underlying index.
pub fn prev_n(self, n: u16) -> Self {
Self(self.0.wrapping_sub_unsigned(n))
}
/// Returns the [`Reg`] with the next contiguous index.
pub fn next(self) -> Self {
self.next_n(1)
}
/// Returns the [`Reg`] with the previous contiguous index.
pub fn prev(self) -> Self {
self.prev_n(1)
}
/// Returns `true` if `self` represents a function local constant value.
pub fn is_const(self) -> bool {
self.0.is_negative()
}
}
impl Instr {
/// Creates an [`Instr`] from the given `usize` value.
///
/// # Panics
///
/// If the `value` exceeds limitations for [`Instr`].
pub fn from_usize(index: usize) -> Self {
let index = index.try_into().unwrap_or_else(|error| {
panic!("invalid index {index} for instruction reference: {error}")
});
Self(index)
}
/// Returns the index underlying to `self` as `usize`.
pub fn into_usize(self) -> usize {
self.0 as usize
}
}