mirror of
https://github.com/fluencelabs/wasmer
synced 2025-04-16 14:12:14 +00:00
cargo update to pick up latest inkwell branch commit. Add lifetime annotations to Module which now takes a lifetime, and more lifetime annotations across intrinsics.rs. Add <'ctx> to missing places in CtxType and Intrinsics. Remove it from reference bindings. Use ManuallyDrop to ensure that context's members are dropped before the Context. Co-authored-by: Mark McCaskey <mark@wasmer.io>
416 lines
12 KiB
Rust
416 lines
12 KiB
Rust
use inkwell::{
|
|
basic_block::BasicBlock,
|
|
values::{BasicValue, BasicValueEnum, PhiValue},
|
|
};
|
|
use smallvec::SmallVec;
|
|
use std::cell::Cell;
|
|
use std::ops::{BitAnd, BitOr, BitOrAssign};
|
|
use wasmparser::BinaryReaderError;
|
|
|
|
#[derive(Debug)]
|
|
pub enum ControlFrame<'ctx> {
|
|
Block {
|
|
next: BasicBlock,
|
|
phis: SmallVec<[PhiValue<'ctx>; 1]>,
|
|
stack_size_snapshot: usize,
|
|
},
|
|
Loop {
|
|
body: BasicBlock,
|
|
next: BasicBlock,
|
|
phis: SmallVec<[PhiValue<'ctx>; 1]>,
|
|
stack_size_snapshot: usize,
|
|
},
|
|
IfElse {
|
|
if_then: BasicBlock,
|
|
if_else: BasicBlock,
|
|
next: BasicBlock,
|
|
phis: SmallVec<[PhiValue<'ctx>; 1]>,
|
|
stack_size_snapshot: usize,
|
|
if_else_state: IfElseState,
|
|
},
|
|
}
|
|
|
|
#[derive(Debug)]
|
|
pub enum IfElseState {
|
|
If,
|
|
Else,
|
|
}
|
|
|
|
impl<'ctx> ControlFrame<'ctx> {
|
|
pub fn code_after(&self) -> &BasicBlock {
|
|
match self {
|
|
ControlFrame::Block { ref next, .. }
|
|
| ControlFrame::Loop { ref next, .. }
|
|
| ControlFrame::IfElse { ref next, .. } => next,
|
|
}
|
|
}
|
|
|
|
pub fn br_dest(&self) -> &BasicBlock {
|
|
match self {
|
|
ControlFrame::Block { ref next, .. } | ControlFrame::IfElse { ref next, .. } => next,
|
|
ControlFrame::Loop { ref body, .. } => body,
|
|
}
|
|
}
|
|
|
|
pub fn phis(&self) -> &[PhiValue<'ctx>] {
|
|
match self {
|
|
ControlFrame::Block { ref phis, .. }
|
|
| ControlFrame::Loop { ref phis, .. }
|
|
| ControlFrame::IfElse { ref phis, .. } => phis.as_slice(),
|
|
}
|
|
}
|
|
|
|
pub fn is_loop(&self) -> bool {
|
|
match self {
|
|
ControlFrame::Loop { .. } => true,
|
|
_ => false,
|
|
}
|
|
}
|
|
}
|
|
|
|
#[derive(Debug, Default, Eq, PartialEq, Copy, Clone, Hash)]
|
|
pub struct ExtraInfo {
|
|
state: u8,
|
|
}
|
|
impl ExtraInfo {
|
|
// This value is required to be arithmetic 32-bit NaN (or 32x4) by the WAsm
|
|
// machine, but which might not be in the LLVM value. The conversion to
|
|
// arithmetic NaN is pending. It is required for correctness.
|
|
//
|
|
// When applied to a 64-bit value, this flag has no meaning and must be
|
|
// ignored. It may be set in such cases to allow for common handling of
|
|
// 32 and 64-bit operations.
|
|
pub const fn pending_f32_nan() -> ExtraInfo {
|
|
ExtraInfo { state: 1 }
|
|
}
|
|
|
|
// This value is required to be arithmetic 64-bit NaN (or 64x2) by the WAsm
|
|
// machine, but which might not be in the LLVM value. The conversion to
|
|
// arithmetic NaN is pending. It is required for correctness.
|
|
//
|
|
// When applied to a 32-bit value, this flag has no meaning and must be
|
|
// ignored. It may be set in such cases to allow for common handling of
|
|
// 32 and 64-bit operations.
|
|
pub const fn pending_f64_nan() -> ExtraInfo {
|
|
ExtraInfo { state: 2 }
|
|
}
|
|
|
|
// This value either does not contain a 32-bit NaN, or it contains an
|
|
// arithmetic NaN. In SIMD, applies to all 4 lanes.
|
|
pub const fn arithmetic_f32() -> ExtraInfo {
|
|
ExtraInfo { state: 4 }
|
|
}
|
|
|
|
// This value either does not contain a 64-bit NaN, or it contains an
|
|
// arithmetic NaN. In SIMD, applies to both lanes.
|
|
pub const fn arithmetic_f64() -> ExtraInfo {
|
|
ExtraInfo { state: 8 }
|
|
}
|
|
|
|
pub const fn has_pending_f32_nan(&self) -> bool {
|
|
self.state & ExtraInfo::pending_f32_nan().state != 0
|
|
}
|
|
pub const fn has_pending_f64_nan(&self) -> bool {
|
|
self.state & ExtraInfo::pending_f64_nan().state != 0
|
|
}
|
|
pub const fn is_arithmetic_f32(&self) -> bool {
|
|
self.state & ExtraInfo::arithmetic_f32().state != 0
|
|
}
|
|
pub const fn is_arithmetic_f64(&self) -> bool {
|
|
self.state & ExtraInfo::arithmetic_f64().state != 0
|
|
}
|
|
|
|
pub const fn strip_pending(&self) -> ExtraInfo {
|
|
ExtraInfo {
|
|
state: self.state
|
|
& !(ExtraInfo::pending_f32_nan().state | ExtraInfo::pending_f64_nan().state),
|
|
}
|
|
}
|
|
}
|
|
|
|
// Union two ExtraInfos.
|
|
impl BitOr for ExtraInfo {
|
|
type Output = Self;
|
|
|
|
fn bitor(self, other: Self) -> Self {
|
|
debug_assert!(!(self.has_pending_f32_nan() && other.has_pending_f64_nan()));
|
|
debug_assert!(!(self.has_pending_f64_nan() && other.has_pending_f32_nan()));
|
|
ExtraInfo {
|
|
state: if self.is_arithmetic_f32() || other.is_arithmetic_f32() {
|
|
ExtraInfo::arithmetic_f32().state
|
|
} else if self.has_pending_f32_nan() || other.has_pending_f32_nan() {
|
|
ExtraInfo::pending_f32_nan().state
|
|
} else {
|
|
0
|
|
} + if self.is_arithmetic_f64() || other.is_arithmetic_f64() {
|
|
ExtraInfo::arithmetic_f64().state
|
|
} else if self.has_pending_f64_nan() || other.has_pending_f64_nan() {
|
|
ExtraInfo::pending_f64_nan().state
|
|
} else {
|
|
0
|
|
},
|
|
}
|
|
}
|
|
}
|
|
impl BitOrAssign for ExtraInfo {
|
|
fn bitor_assign(&mut self, other: Self) {
|
|
*self = *self | other;
|
|
}
|
|
}
|
|
|
|
// Intersection for ExtraInfo.
|
|
impl BitAnd for ExtraInfo {
|
|
type Output = Self;
|
|
fn bitand(self, other: Self) -> Self {
|
|
// Pending canonicalizations are not safe to discard, or even reorder.
|
|
debug_assert!(
|
|
self.has_pending_f32_nan() == other.has_pending_f32_nan()
|
|
|| self.is_arithmetic_f32()
|
|
|| other.is_arithmetic_f32()
|
|
);
|
|
debug_assert!(
|
|
self.has_pending_f64_nan() == other.has_pending_f64_nan()
|
|
|| self.is_arithmetic_f64()
|
|
|| other.is_arithmetic_f64()
|
|
);
|
|
let info = match (
|
|
self.is_arithmetic_f32() && other.is_arithmetic_f32(),
|
|
self.is_arithmetic_f64() && other.is_arithmetic_f64(),
|
|
) {
|
|
(false, false) => Default::default(),
|
|
(true, false) => ExtraInfo::arithmetic_f32(),
|
|
(false, true) => ExtraInfo::arithmetic_f64(),
|
|
(true, true) => ExtraInfo::arithmetic_f32() | ExtraInfo::arithmetic_f64(),
|
|
};
|
|
let info = match (self.has_pending_f32_nan(), self.has_pending_f64_nan()) {
|
|
(false, false) => info,
|
|
(true, false) => info | ExtraInfo::pending_f32_nan(),
|
|
(false, true) => info | ExtraInfo::pending_f64_nan(),
|
|
(true, true) => unreachable!("Can't form ExtraInfo with two pending canonicalizations"),
|
|
};
|
|
info
|
|
}
|
|
}
|
|
|
|
#[derive(Debug)]
|
|
pub struct State<'ctx> {
|
|
pub stack: Vec<(BasicValueEnum<'ctx>, ExtraInfo)>,
|
|
control_stack: Vec<ControlFrame<'ctx>>,
|
|
value_counter: Cell<usize>,
|
|
|
|
pub reachable: bool,
|
|
}
|
|
|
|
impl<'ctx> State<'ctx> {
|
|
pub fn new() -> Self {
|
|
Self {
|
|
stack: vec![],
|
|
control_stack: vec![],
|
|
value_counter: Cell::new(0),
|
|
reachable: true,
|
|
}
|
|
}
|
|
|
|
pub fn reset_stack(&mut self, frame: &ControlFrame<'ctx>) {
|
|
let stack_size_snapshot = match frame {
|
|
ControlFrame::Block {
|
|
stack_size_snapshot,
|
|
..
|
|
}
|
|
| ControlFrame::Loop {
|
|
stack_size_snapshot,
|
|
..
|
|
}
|
|
| ControlFrame::IfElse {
|
|
stack_size_snapshot,
|
|
..
|
|
} => *stack_size_snapshot,
|
|
};
|
|
self.stack.truncate(stack_size_snapshot);
|
|
}
|
|
|
|
pub fn outermost_frame(&self) -> Result<&ControlFrame<'ctx>, BinaryReaderError> {
|
|
self.control_stack.get(0).ok_or(BinaryReaderError {
|
|
message: "invalid control stack depth",
|
|
offset: -1isize as usize,
|
|
})
|
|
}
|
|
|
|
pub fn frame_at_depth(&self, depth: u32) -> Result<&ControlFrame<'ctx>, BinaryReaderError> {
|
|
let index = self.control_stack.len() - 1 - (depth as usize);
|
|
self.control_stack.get(index).ok_or(BinaryReaderError {
|
|
message: "invalid control stack depth",
|
|
offset: -1isize as usize,
|
|
})
|
|
}
|
|
|
|
pub fn frame_at_depth_mut(
|
|
&mut self,
|
|
depth: u32,
|
|
) -> Result<&mut ControlFrame<'ctx>, BinaryReaderError> {
|
|
let index = self.control_stack.len() - 1 - (depth as usize);
|
|
self.control_stack.get_mut(index).ok_or(BinaryReaderError {
|
|
message: "invalid control stack depth",
|
|
offset: -1isize as usize,
|
|
})
|
|
}
|
|
|
|
pub fn pop_frame(&mut self) -> Result<ControlFrame<'ctx>, BinaryReaderError> {
|
|
self.control_stack.pop().ok_or(BinaryReaderError {
|
|
message: "cannot pop from control stack",
|
|
offset: -1isize as usize,
|
|
})
|
|
}
|
|
|
|
pub fn var_name(&self) -> String {
|
|
let counter = self.value_counter.get();
|
|
let s = format!("s{}", counter);
|
|
self.value_counter.set(counter + 1);
|
|
s
|
|
}
|
|
|
|
pub fn push1<T: BasicValue<'ctx>>(&mut self, value: T) {
|
|
self.push1_extra(value, Default::default());
|
|
}
|
|
|
|
pub fn push1_extra<T: BasicValue<'ctx>>(&mut self, value: T, info: ExtraInfo) {
|
|
self.stack.push((value.as_basic_value_enum(), info));
|
|
}
|
|
|
|
pub fn pop1(&mut self) -> Result<BasicValueEnum<'ctx>, BinaryReaderError> {
|
|
Ok(self.pop1_extra()?.0)
|
|
}
|
|
|
|
pub fn pop1_extra(&mut self) -> Result<(BasicValueEnum<'ctx>, ExtraInfo), BinaryReaderError> {
|
|
self.stack.pop().ok_or(BinaryReaderError {
|
|
message: "invalid value stack",
|
|
offset: -1isize as usize,
|
|
})
|
|
}
|
|
|
|
pub fn pop2(
|
|
&mut self,
|
|
) -> Result<(BasicValueEnum<'ctx>, BasicValueEnum<'ctx>), BinaryReaderError> {
|
|
let v2 = self.pop1()?;
|
|
let v1 = self.pop1()?;
|
|
Ok((v1, v2))
|
|
}
|
|
|
|
pub fn pop2_extra(
|
|
&mut self,
|
|
) -> Result<
|
|
(
|
|
(BasicValueEnum<'ctx>, ExtraInfo),
|
|
(BasicValueEnum<'ctx>, ExtraInfo),
|
|
),
|
|
BinaryReaderError,
|
|
> {
|
|
let v2 = self.pop1_extra()?;
|
|
let v1 = self.pop1_extra()?;
|
|
Ok((v1, v2))
|
|
}
|
|
|
|
pub fn pop3_extra(
|
|
&mut self,
|
|
) -> Result<
|
|
(
|
|
(BasicValueEnum<'ctx>, ExtraInfo),
|
|
(BasicValueEnum<'ctx>, ExtraInfo),
|
|
(BasicValueEnum<'ctx>, ExtraInfo),
|
|
),
|
|
BinaryReaderError,
|
|
> {
|
|
let v3 = self.pop1_extra()?;
|
|
let v2 = self.pop1_extra()?;
|
|
let v1 = self.pop1_extra()?;
|
|
Ok((v1, v2, v3))
|
|
}
|
|
|
|
pub fn peek1_extra(&self) -> Result<(BasicValueEnum<'ctx>, ExtraInfo), BinaryReaderError> {
|
|
self.stack
|
|
.get(self.stack.len() - 1)
|
|
.ok_or(BinaryReaderError {
|
|
message: "invalid value stack",
|
|
offset: -1isize as usize,
|
|
})
|
|
.map(|v| *v)
|
|
}
|
|
|
|
pub fn peekn(&self, n: usize) -> Result<Vec<BasicValueEnum<'ctx>>, BinaryReaderError> {
|
|
Ok(self.peekn_extra(n)?.iter().map(|x| x.0).collect())
|
|
}
|
|
|
|
pub fn peekn_extra(
|
|
&self,
|
|
n: usize,
|
|
) -> Result<&[(BasicValueEnum<'ctx>, ExtraInfo)], BinaryReaderError> {
|
|
let new_len = self.stack.len().checked_sub(n).ok_or(BinaryReaderError {
|
|
message: "invalid value stack",
|
|
offset: -1isize as usize,
|
|
})?;
|
|
|
|
Ok(&self.stack[new_len..])
|
|
}
|
|
|
|
pub fn popn_save_extra(
|
|
&mut self,
|
|
n: usize,
|
|
) -> Result<Vec<(BasicValueEnum<'ctx>, ExtraInfo)>, BinaryReaderError> {
|
|
let v = self.peekn_extra(n)?.to_vec();
|
|
self.popn(n)?;
|
|
Ok(v)
|
|
}
|
|
|
|
pub fn popn(&mut self, n: usize) -> Result<(), BinaryReaderError> {
|
|
if self.stack.len() < n {
|
|
return Err(BinaryReaderError {
|
|
message: "invalid value stack",
|
|
offset: -1isize as usize,
|
|
});
|
|
}
|
|
|
|
let new_len = self.stack.len() - n;
|
|
self.stack.truncate(new_len);
|
|
Ok(())
|
|
}
|
|
|
|
pub fn push_block(&mut self, next: BasicBlock, phis: SmallVec<[PhiValue<'ctx>; 1]>) {
|
|
self.control_stack.push(ControlFrame::Block {
|
|
next,
|
|
phis,
|
|
stack_size_snapshot: self.stack.len(),
|
|
});
|
|
}
|
|
|
|
pub fn push_loop(
|
|
&mut self,
|
|
body: BasicBlock,
|
|
next: BasicBlock,
|
|
phis: SmallVec<[PhiValue<'ctx>; 1]>,
|
|
) {
|
|
self.control_stack.push(ControlFrame::Loop {
|
|
body,
|
|
next,
|
|
phis,
|
|
stack_size_snapshot: self.stack.len(),
|
|
});
|
|
}
|
|
|
|
pub fn push_if(
|
|
&mut self,
|
|
if_then: BasicBlock,
|
|
if_else: BasicBlock,
|
|
next: BasicBlock,
|
|
phis: SmallVec<[PhiValue<'ctx>; 1]>,
|
|
) {
|
|
self.control_stack.push(ControlFrame::IfElse {
|
|
if_then,
|
|
if_else,
|
|
next,
|
|
phis,
|
|
stack_size_snapshot: self.stack.len(),
|
|
if_else_state: IfElseState::If,
|
|
});
|
|
}
|
|
}
|