2019-01-19 00:45:30 +00:00
|
|
|
use crate::call::HandlerData;
|
2019-01-09 02:57:28 +00:00
|
|
|
use crate::libcalls;
|
2019-01-19 00:45:30 +00:00
|
|
|
use crate::relocation::{
|
|
|
|
LocalTrapSink, Reloc, RelocSink, Relocation, RelocationType, TrapSink, VmCall,
|
|
|
|
};
|
2019-01-11 03:59:57 +00:00
|
|
|
use byteorder::{ByteOrder, LittleEndian};
|
2019-01-09 02:57:28 +00:00
|
|
|
use cranelift_codegen::{ir, isa, Context};
|
|
|
|
use std::mem;
|
|
|
|
use std::ptr::{write_unaligned, NonNull};
|
2019-01-08 21:04:03 +00:00
|
|
|
use wasmer_runtime::{
|
|
|
|
self,
|
2019-01-09 23:31:11 +00:00
|
|
|
backend::{self, Mmap, Protect},
|
2019-01-18 17:17:44 +00:00
|
|
|
error::{CompileError, CompileResult},
|
2019-01-17 01:59:12 +00:00
|
|
|
structures::Map,
|
|
|
|
types::LocalFuncIndex,
|
2019-01-09 02:57:28 +00:00
|
|
|
vm, vmcalls,
|
2019-01-08 21:04:03 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
#[allow(dead_code)]
|
|
|
|
pub struct FuncResolverBuilder {
|
|
|
|
resolver: FuncResolver,
|
2019-01-16 18:26:10 +00:00
|
|
|
relocations: Map<LocalFuncIndex, Vec<Relocation>>,
|
2019-01-08 21:04:03 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
impl FuncResolverBuilder {
|
2019-01-09 02:57:28 +00:00
|
|
|
pub fn new(
|
|
|
|
isa: &isa::TargetIsa,
|
2019-01-17 01:59:12 +00:00
|
|
|
function_bodies: Map<LocalFuncIndex, ir::Function>,
|
2019-01-19 00:45:30 +00:00
|
|
|
) -> CompileResult<(Self, HandlerData)> {
|
2019-01-08 21:04:03 +00:00
|
|
|
let mut compiled_functions: Vec<Vec<u8>> = Vec::with_capacity(function_bodies.len());
|
|
|
|
let mut relocations = Map::with_capacity(function_bodies.len());
|
2019-01-19 00:45:30 +00:00
|
|
|
|
|
|
|
let mut trap_sink = TrapSink::new();
|
|
|
|
let mut local_trap_sink = LocalTrapSink::new();
|
2019-01-08 21:04:03 +00:00
|
|
|
|
|
|
|
let mut ctx = Context::new();
|
|
|
|
let mut total_size = 0;
|
|
|
|
|
2019-01-17 01:59:12 +00:00
|
|
|
for (_, func) in function_bodies {
|
2019-01-08 21:04:03 +00:00
|
|
|
ctx.func = func;
|
|
|
|
let mut code_buf = Vec::new();
|
|
|
|
let mut reloc_sink = RelocSink::new();
|
|
|
|
|
2019-01-19 00:45:30 +00:00
|
|
|
ctx.compile_and_emit(isa, &mut code_buf, &mut reloc_sink, &mut local_trap_sink)
|
2019-01-18 17:17:44 +00:00
|
|
|
.map_err(|e| CompileError::InternalError { msg: e.to_string() })?;
|
2019-01-08 21:04:03 +00:00
|
|
|
ctx.clear();
|
2019-01-19 00:45:30 +00:00
|
|
|
|
|
|
|
// Clear the local trap sink and consolidate all trap info
|
|
|
|
// into a single location.
|
|
|
|
trap_sink.drain_local(total_size, &mut local_trap_sink);
|
|
|
|
|
2019-01-08 21:04:03 +00:00
|
|
|
// Round up each function's size to pointer alignment.
|
|
|
|
total_size += round_up(code_buf.len(), mem::size_of::<usize>());
|
|
|
|
|
|
|
|
compiled_functions.push(code_buf);
|
|
|
|
relocations.push(reloc_sink.func_relocs);
|
|
|
|
}
|
|
|
|
|
2019-01-18 17:17:44 +00:00
|
|
|
let mut memory = Mmap::with_size(total_size)
|
|
|
|
.map_err(|e| CompileError::InternalError { msg: e.to_string() })?;
|
2019-01-08 21:04:03 +00:00
|
|
|
unsafe {
|
2019-01-18 17:17:44 +00:00
|
|
|
memory
|
|
|
|
.protect(0..memory.size(), Protect::ReadWrite)
|
|
|
|
.map_err(|e| CompileError::InternalError { msg: e.to_string() })?;
|
2019-01-08 21:04:03 +00:00
|
|
|
}
|
|
|
|
|
2019-01-18 17:17:44 +00:00
|
|
|
// Normally, excess memory due to alignment and page-rounding would
|
|
|
|
// be filled with null-bytes. On x86 (and x86_64),
|
|
|
|
// "\x00\x00" disassembles to "add byte ptr [eax],al".
|
|
|
|
//
|
|
|
|
// If the instruction pointer falls out of its designated area,
|
|
|
|
// it would be better if it would immediately crash instead of
|
|
|
|
// continuing on and causing non-local issues.
|
|
|
|
//
|
|
|
|
// "\xCC" disassembles to "int3", which will immediately cause
|
|
|
|
// an interrupt that we can catch if we want.
|
2019-01-09 23:31:11 +00:00
|
|
|
for i in unsafe { memory.as_slice_mut() } {
|
|
|
|
*i = 0xCC;
|
|
|
|
}
|
|
|
|
|
2019-01-08 21:04:03 +00:00
|
|
|
let mut map = Map::with_capacity(compiled_functions.len());
|
|
|
|
|
|
|
|
let mut previous_end = 0;
|
|
|
|
for compiled in compiled_functions.iter() {
|
|
|
|
let new_end = previous_end + round_up(compiled.len(), mem::size_of::<usize>());
|
|
|
|
unsafe {
|
2019-01-09 02:57:28 +00:00
|
|
|
memory.as_slice_mut()[previous_end..previous_end + compiled.len()]
|
|
|
|
.copy_from_slice(&compiled[..]);
|
2019-01-08 21:04:03 +00:00
|
|
|
}
|
|
|
|
map.push(previous_end);
|
|
|
|
previous_end = new_end;
|
|
|
|
}
|
|
|
|
|
2019-01-19 00:45:30 +00:00
|
|
|
let handler_data = HandlerData::new(trap_sink, memory.as_ptr() as _, memory.size());
|
|
|
|
|
|
|
|
Ok((
|
|
|
|
Self {
|
|
|
|
resolver: FuncResolver { map, memory },
|
|
|
|
relocations,
|
|
|
|
},
|
|
|
|
handler_data,
|
|
|
|
))
|
2019-01-08 21:04:03 +00:00
|
|
|
}
|
|
|
|
|
2019-01-18 17:17:44 +00:00
|
|
|
pub fn finalize(mut self) -> CompileResult<FuncResolver> {
|
2019-01-08 21:04:03 +00:00
|
|
|
for (index, relocs) in self.relocations.iter() {
|
|
|
|
for ref reloc in relocs {
|
|
|
|
let target_func_address: isize = match reloc.target {
|
2019-01-17 01:59:12 +00:00
|
|
|
RelocationType::Normal(local_func_index) => {
|
2019-01-08 21:04:03 +00:00
|
|
|
// This will always be an internal function
|
|
|
|
// because imported functions are not
|
|
|
|
// called in this way.
|
2019-01-17 01:59:12 +00:00
|
|
|
self.resolver.lookup(local_func_index).unwrap().as_ptr() as isize
|
2019-01-08 21:04:03 +00:00
|
|
|
}
|
|
|
|
RelocationType::LibCall(libcall) => match libcall {
|
|
|
|
ir::LibCall::CeilF32 => libcalls::ceilf32 as isize,
|
|
|
|
ir::LibCall::FloorF32 => libcalls::floorf32 as isize,
|
|
|
|
ir::LibCall::TruncF32 => libcalls::truncf32 as isize,
|
|
|
|
ir::LibCall::NearestF32 => libcalls::nearbyintf32 as isize,
|
|
|
|
ir::LibCall::CeilF64 => libcalls::ceilf64 as isize,
|
|
|
|
ir::LibCall::FloorF64 => libcalls::floorf64 as isize,
|
|
|
|
ir::LibCall::TruncF64 => libcalls::truncf64 as isize,
|
|
|
|
ir::LibCall::NearestF64 => libcalls::nearbyintf64 as isize,
|
|
|
|
ir::LibCall::Probestack => libcalls::__rust_probestack as isize,
|
|
|
|
_ => {
|
2019-01-18 17:17:44 +00:00
|
|
|
Err(CompileError::InternalError {
|
|
|
|
msg: format!("unexpected libcall: {}", libcall),
|
|
|
|
})?
|
|
|
|
// panic!("unexpected libcall {}", libcall);
|
2019-01-08 21:04:03 +00:00
|
|
|
}
|
|
|
|
},
|
|
|
|
RelocationType::Intrinsic(ref name) => {
|
2019-01-18 17:17:44 +00:00
|
|
|
Err(CompileError::InternalError {
|
|
|
|
msg: format!("unexpected intrinsic: {}", name),
|
|
|
|
})?
|
|
|
|
// panic!("unexpected intrinsic {}", name);
|
2019-01-08 21:04:03 +00:00
|
|
|
}
|
2019-01-17 21:09:05 +00:00
|
|
|
RelocationType::VmCall(vmcall) => match vmcall {
|
|
|
|
VmCall::LocalStaticMemoryGrow => vmcalls::local_static_memory_grow as _,
|
|
|
|
VmCall::LocalStaticMemorySize => vmcalls::local_static_memory_size as _,
|
|
|
|
VmCall::ImportedStaticMemoryGrow => {
|
|
|
|
vmcalls::imported_static_memory_grow as _
|
|
|
|
}
|
|
|
|
VmCall::ImportedStaticMemorySize => {
|
|
|
|
vmcalls::imported_static_memory_size as _
|
|
|
|
}
|
|
|
|
},
|
2019-01-08 21:04:03 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
// We need the address of the current function
|
|
|
|
// because these calls are relative.
|
|
|
|
let func_addr = self.resolver.lookup(index).unwrap().as_ptr();
|
|
|
|
|
|
|
|
// Determine relocation type and apply relocation.
|
|
|
|
match reloc.reloc {
|
2019-01-10 01:32:02 +00:00
|
|
|
Reloc::Abs8 => {
|
|
|
|
let ptr_to_write = (target_func_address as u64)
|
|
|
|
.checked_add(reloc.addend as u64)
|
2019-01-09 23:31:11 +00:00
|
|
|
.unwrap();
|
2019-01-10 01:32:02 +00:00
|
|
|
let empty_space_offset = self.resolver.map[index] + reloc.offset as usize;
|
|
|
|
let ptr_slice = unsafe {
|
2019-01-11 03:59:57 +00:00
|
|
|
&mut self.resolver.memory.as_slice_mut()
|
|
|
|
[empty_space_offset..empty_space_offset + 8]
|
2019-01-10 01:32:02 +00:00
|
|
|
};
|
2019-01-11 03:59:57 +00:00
|
|
|
LittleEndian::write_u64(ptr_slice, ptr_to_write);
|
|
|
|
}
|
2019-01-08 21:04:03 +00:00
|
|
|
Reloc::X86PCRel4 => unsafe {
|
|
|
|
let reloc_address = func_addr.offset(reloc.offset as isize) as isize;
|
|
|
|
let reloc_addend = reloc.addend as isize;
|
|
|
|
// TODO: Handle overflow.
|
|
|
|
let reloc_delta_i32 =
|
|
|
|
(target_func_address - reloc_address + reloc_addend) as i32;
|
|
|
|
write_unaligned(reloc_address as *mut i32, reloc_delta_i32);
|
|
|
|
},
|
2019-01-18 17:17:44 +00:00
|
|
|
_ => Err(CompileError::InternalError {
|
|
|
|
msg: format!("unsupported reloc kind: {}", reloc.reloc),
|
|
|
|
})?,
|
2019-01-08 21:04:03 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
unsafe {
|
2019-01-09 02:57:28 +00:00
|
|
|
self.resolver
|
|
|
|
.memory
|
2019-01-18 17:17:44 +00:00
|
|
|
.protect(0..self.resolver.memory.size(), Protect::ReadExec)
|
|
|
|
.map_err(|e| CompileError::InternalError { msg: e.to_string() })?;;
|
2019-01-08 21:04:03 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Ok(self.resolver)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Resolves a function index to a function address.
|
|
|
|
pub struct FuncResolver {
|
2019-01-16 18:26:10 +00:00
|
|
|
map: Map<LocalFuncIndex, usize>,
|
2019-01-08 21:04:03 +00:00
|
|
|
memory: Mmap,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl FuncResolver {
|
2019-01-16 18:26:10 +00:00
|
|
|
fn lookup(&self, local_func_index: LocalFuncIndex) -> Option<NonNull<vm::Func>> {
|
|
|
|
let offset = *self.map.get(local_func_index)?;
|
2019-01-09 02:57:28 +00:00
|
|
|
let ptr = unsafe { self.memory.as_ptr().add(offset) };
|
2019-01-08 21:04:03 +00:00
|
|
|
|
|
|
|
NonNull::new(ptr).map(|nonnull| nonnull.cast())
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Implements FuncResolver trait.
|
2019-01-09 23:31:11 +00:00
|
|
|
impl backend::FuncResolver for FuncResolver {
|
2019-01-11 03:59:57 +00:00
|
|
|
fn get(
|
|
|
|
&self,
|
2019-01-13 03:02:19 +00:00
|
|
|
_module: &wasmer_runtime::module::ModuleInner,
|
2019-01-17 01:59:12 +00:00
|
|
|
index: LocalFuncIndex,
|
2019-01-11 03:59:57 +00:00
|
|
|
) -> Option<NonNull<vm::Func>> {
|
2019-01-08 21:04:03 +00:00
|
|
|
self.lookup(index)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[inline]
|
|
|
|
fn round_up(n: usize, multiple: usize) -> usize {
|
|
|
|
(n + multiple - 1) & !(multiple - 1)
|
2019-01-11 03:59:57 +00:00
|
|
|
}
|