15bb0c6903
* Remove the `ModuleLimits` pooling configuration structure
This commit is an attempt to improve the usability of the pooling
allocator by removing the need to configure a `ModuleLimits` structure.
Internally this structure has limits on all forms of wasm constructs but
this largely bottoms out in the size of an allocation for an instance in
the instance pooling allocator. Maintaining this list of limits can be
cumbersome as modules may get tweaked over time and there's otherwise no
real reason to limit the number of globals in a module since the main
goal is to limit the memory consumption of a `VMContext` which can be
done with a memory allocation limit rather than fine-tuned control over
each maximum and minimum.
The new approach taken in this commit is to remove `ModuleLimits`. Some
fields, such as `tables`, `table_elements` , `memories`, and
`memory_pages` are moved to `InstanceLimits` since they're still
enforced at runtime. A new field `size` is added to `InstanceLimits`
which indicates, in bytes, the maximum size of the `VMContext`
allocation. If the size of a `VMContext` for a module exceeds this value
then instantiation will fail.
This involved adding a few more checks to `{Table, Memory}::new_static`
to ensure that the minimum size is able to fit in the allocation, since
previously modules were validated at compile time of the module that
everything fit and that validation no longer happens (it happens at
runtime).
A consequence of this commit is that Wasmtime will have no built-in way
to reject modules at compile time if they'll fail to be instantiated
within a particular pooling allocator configuration. Instead a module
must attempt instantiation see if a failure happens.
* Fix benchmark compiles
* Fix some doc links
* Fix a panic by ensuring modules have limited tables/memories
* Review comments
* Add back validation at `Module` time instantiation is possible
This allows for getting an early signal at compile time that a module
will never be instantiable in an engine with matching settings.
* Provide a better error message when sizes are exceeded
Improve the error message when an instance size exceeds the maximum by
providing a breakdown of where the bytes are all going and why the large
size is being requested.
* Try to fix test in qemu
* Flag new test as 64-bit only
Sizes are all specific to 64-bit right now
726 lines
22 KiB
Rust
726 lines
22 KiB
Rust
use anyhow::Result;
|
|
use std::future::Future;
|
|
use std::pin::Pin;
|
|
use std::task::{Context, Poll, RawWaker, RawWakerVTable, Waker};
|
|
use wasmtime::*;
|
|
|
|
fn async_store() -> Store<()> {
|
|
Store::new(&Engine::new(Config::new().async_support(true)).unwrap(), ())
|
|
}
|
|
|
|
fn run_smoke_test(store: &mut Store<()>, func: Func) {
|
|
run(func.call_async(&mut *store, &[], &mut [])).unwrap();
|
|
run(func.call_async(&mut *store, &[], &mut [])).unwrap();
|
|
}
|
|
|
|
fn run_smoke_typed_test(store: &mut Store<()>, func: Func) {
|
|
let func = func.typed::<(), (), _>(&store).unwrap();
|
|
run(func.call_async(&mut *store, ())).unwrap();
|
|
run(func.call_async(&mut *store, ())).unwrap();
|
|
}
|
|
|
|
#[test]
|
|
fn smoke() {
|
|
let mut store = async_store();
|
|
let func = Func::new_async(
|
|
&mut store,
|
|
FuncType::new(None, None),
|
|
move |_caller, _params, _results| Box::new(async { Ok(()) }),
|
|
);
|
|
run_smoke_test(&mut store, func);
|
|
run_smoke_typed_test(&mut store, func);
|
|
|
|
let func = Func::wrap0_async(&mut store, move |_caller| Box::new(async { Ok(()) }));
|
|
run_smoke_test(&mut store, func);
|
|
run_smoke_typed_test(&mut store, func);
|
|
}
|
|
|
|
#[test]
|
|
fn smoke_host_func() -> Result<()> {
|
|
let mut store = async_store();
|
|
let mut linker = Linker::new(store.engine());
|
|
|
|
linker.func_new_async(
|
|
"",
|
|
"first",
|
|
FuncType::new(None, None),
|
|
move |_caller, _params, _results| Box::new(async { Ok(()) }),
|
|
)?;
|
|
|
|
linker.func_wrap0_async("", "second", move |_caller| Box::new(async { Ok(()) }))?;
|
|
|
|
let func = linker
|
|
.get(&mut store, "", Some("first"))
|
|
.unwrap()
|
|
.into_func()
|
|
.unwrap();
|
|
run_smoke_test(&mut store, func);
|
|
run_smoke_typed_test(&mut store, func);
|
|
|
|
let func = linker
|
|
.get(&mut store, "", Some("second"))
|
|
.unwrap()
|
|
.into_func()
|
|
.unwrap();
|
|
run_smoke_test(&mut store, func);
|
|
run_smoke_typed_test(&mut store, func);
|
|
|
|
Ok(())
|
|
}
|
|
|
|
#[test]
|
|
fn smoke_with_suspension() {
|
|
let mut store = async_store();
|
|
let func = Func::new_async(
|
|
&mut store,
|
|
FuncType::new(None, None),
|
|
move |_caller, _params, _results| {
|
|
Box::new(async {
|
|
PendingOnce::default().await;
|
|
Ok(())
|
|
})
|
|
},
|
|
);
|
|
run_smoke_test(&mut store, func);
|
|
run_smoke_typed_test(&mut store, func);
|
|
|
|
let func = Func::wrap0_async(&mut store, move |_caller| {
|
|
Box::new(async {
|
|
PendingOnce::default().await;
|
|
Ok(())
|
|
})
|
|
});
|
|
run_smoke_test(&mut store, func);
|
|
run_smoke_typed_test(&mut store, func);
|
|
}
|
|
|
|
#[test]
|
|
fn smoke_host_func_with_suspension() -> Result<()> {
|
|
let mut store = async_store();
|
|
let mut linker = Linker::new(store.engine());
|
|
|
|
linker.func_new_async(
|
|
"",
|
|
"first",
|
|
FuncType::new(None, None),
|
|
move |_caller, _params, _results| {
|
|
Box::new(async {
|
|
PendingOnce::default().await;
|
|
Ok(())
|
|
})
|
|
},
|
|
)?;
|
|
|
|
linker.func_wrap0_async("", "second", move |_caller| {
|
|
Box::new(async {
|
|
PendingOnce::default().await;
|
|
Ok(())
|
|
})
|
|
})?;
|
|
|
|
let func = linker
|
|
.get(&mut store, "", Some("first"))
|
|
.unwrap()
|
|
.into_func()
|
|
.unwrap();
|
|
run_smoke_test(&mut store, func);
|
|
run_smoke_typed_test(&mut store, func);
|
|
|
|
let func = linker
|
|
.get(&mut store, "", Some("second"))
|
|
.unwrap()
|
|
.into_func()
|
|
.unwrap();
|
|
run_smoke_test(&mut store, func);
|
|
run_smoke_typed_test(&mut store, func);
|
|
|
|
Ok(())
|
|
}
|
|
|
|
#[test]
|
|
fn recursive_call() {
|
|
let mut store = async_store();
|
|
let async_wasm_func = Func::new_async(
|
|
&mut store,
|
|
FuncType::new(None, None),
|
|
|_caller, _params, _results| {
|
|
Box::new(async {
|
|
PendingOnce::default().await;
|
|
Ok(())
|
|
})
|
|
},
|
|
);
|
|
|
|
// Create an imported function which recursively invokes another wasm
|
|
// function asynchronously, although this one is just our own host function
|
|
// which suffices for this test.
|
|
let func2 = Func::new_async(
|
|
&mut store,
|
|
FuncType::new(None, None),
|
|
move |mut caller, _params, _results| {
|
|
Box::new(async move {
|
|
async_wasm_func
|
|
.call_async(&mut caller, &[], &mut [])
|
|
.await?;
|
|
Ok(())
|
|
})
|
|
},
|
|
);
|
|
|
|
// Create an instance which calls an async import twice.
|
|
let module = Module::new(
|
|
store.engine(),
|
|
"
|
|
(module
|
|
(import \"\" \"\" (func))
|
|
(func (export \"\")
|
|
;; call imported function which recursively does an async
|
|
;; call
|
|
call 0
|
|
;; do it again, and our various pointers all better align
|
|
call 0))
|
|
",
|
|
)
|
|
.unwrap();
|
|
|
|
run(async {
|
|
let instance = Instance::new_async(&mut store, &module, &[func2.into()]).await?;
|
|
let func = instance.get_func(&mut store, "").unwrap();
|
|
func.call_async(&mut store, &[], &mut []).await
|
|
})
|
|
.unwrap();
|
|
}
|
|
|
|
#[test]
|
|
fn suspend_while_suspending() {
|
|
let mut store = async_store();
|
|
|
|
// Create a synchronous function which calls our asynchronous function and
|
|
// runs it locally. This shouldn't generally happen but we know everything
|
|
// is synchronous in this test so it's fine for us to do this.
|
|
//
|
|
// The purpose of this test is intended to stress various cases in how
|
|
// we manage pointers in ways that are not necessarily common but are still
|
|
// possible in safe code.
|
|
let async_thunk = Func::new_async(
|
|
&mut store,
|
|
FuncType::new(None, None),
|
|
|_caller, _params, _results| Box::new(async { Ok(()) }),
|
|
);
|
|
let sync_call_async_thunk = Func::new(
|
|
&mut store,
|
|
FuncType::new(None, None),
|
|
move |mut caller, _params, _results| {
|
|
run(async_thunk.call_async(&mut caller, &[], &mut []))?;
|
|
Ok(())
|
|
},
|
|
);
|
|
|
|
// A small async function that simply awaits once to pump the loops and
|
|
// then finishes.
|
|
let async_import = Func::new_async(
|
|
&mut store,
|
|
FuncType::new(None, None),
|
|
move |_caller, _params, _results| {
|
|
Box::new(async move {
|
|
PendingOnce::default().await;
|
|
Ok(())
|
|
})
|
|
},
|
|
);
|
|
|
|
let module = Module::new(
|
|
store.engine(),
|
|
"
|
|
(module
|
|
(import \"\" \"\" (func $sync_call_async_thunk))
|
|
(import \"\" \"\" (func $async_import))
|
|
(func (export \"\")
|
|
;; Set some store-local state and pointers
|
|
call $sync_call_async_thunk
|
|
;; .. and hopefully it's all still configured correctly
|
|
call $async_import))
|
|
",
|
|
)
|
|
.unwrap();
|
|
run(async {
|
|
let instance = Instance::new_async(
|
|
&mut store,
|
|
&module,
|
|
&[sync_call_async_thunk.into(), async_import.into()],
|
|
)
|
|
.await?;
|
|
let func = instance.get_func(&mut store, "").unwrap();
|
|
func.call_async(&mut store, &[], &mut []).await
|
|
})
|
|
.unwrap();
|
|
}
|
|
|
|
#[test]
|
|
fn cancel_during_run() {
|
|
let mut store = Store::new(&Engine::new(Config::new().async_support(true)).unwrap(), 0);
|
|
|
|
let async_thunk = Func::new_async(
|
|
&mut store,
|
|
FuncType::new(None, None),
|
|
move |mut caller, _params, _results| {
|
|
assert_eq!(*caller.data(), 0);
|
|
*caller.data_mut() = 1;
|
|
let dtor = SetOnDrop(caller);
|
|
Box::new(async move {
|
|
drop(&dtor);
|
|
PendingOnce::default().await;
|
|
Ok(())
|
|
})
|
|
},
|
|
);
|
|
// Shouldn't have called anything yet...
|
|
assert_eq!(*store.data(), 0);
|
|
|
|
// Create our future, but as per async conventions this still doesn't
|
|
// actually do anything. No wasm or host function has been called yet.
|
|
let mut future = Pin::from(Box::new(async_thunk.call_async(&mut store, &[], &mut [])));
|
|
|
|
// Push the future forward one tick, which actually runs the host code in
|
|
// our async func. Our future is designed to be pending once, however.
|
|
let poll = future
|
|
.as_mut()
|
|
.poll(&mut Context::from_waker(&dummy_waker()));
|
|
assert!(poll.is_pending());
|
|
|
|
// Now that our future is running (on a separate, now-suspended fiber), drop
|
|
// the future and that should deallocate all the Rust bits as well.
|
|
drop(future);
|
|
assert_eq!(*store.data(), 2);
|
|
|
|
struct SetOnDrop<'a>(Caller<'a, usize>);
|
|
|
|
impl Drop for SetOnDrop<'_> {
|
|
fn drop(&mut self) {
|
|
assert_eq!(*self.0.data(), 1);
|
|
*self.0.data_mut() = 2;
|
|
}
|
|
}
|
|
}
|
|
|
|
#[derive(Default)]
|
|
struct PendingOnce {
|
|
already_polled: bool,
|
|
}
|
|
|
|
impl Future for PendingOnce {
|
|
type Output = ();
|
|
|
|
fn poll(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<()> {
|
|
if self.already_polled {
|
|
Poll::Ready(())
|
|
} else {
|
|
self.already_polled = true;
|
|
cx.waker().wake_by_ref();
|
|
Poll::Pending
|
|
}
|
|
}
|
|
}
|
|
|
|
fn run<F: Future>(future: F) -> F::Output {
|
|
let mut f = Pin::from(Box::new(future));
|
|
let waker = dummy_waker();
|
|
let mut cx = Context::from_waker(&waker);
|
|
loop {
|
|
match f.as_mut().poll(&mut cx) {
|
|
Poll::Ready(val) => break val,
|
|
Poll::Pending => {}
|
|
}
|
|
}
|
|
}
|
|
|
|
fn dummy_waker() -> Waker {
|
|
return unsafe { Waker::from_raw(clone(5 as *const _)) };
|
|
|
|
unsafe fn clone(ptr: *const ()) -> RawWaker {
|
|
assert_eq!(ptr as usize, 5);
|
|
const VTABLE: RawWakerVTable = RawWakerVTable::new(clone, wake, wake_by_ref, drop);
|
|
RawWaker::new(ptr, &VTABLE)
|
|
}
|
|
|
|
unsafe fn wake(ptr: *const ()) {
|
|
assert_eq!(ptr as usize, 5);
|
|
}
|
|
|
|
unsafe fn wake_by_ref(ptr: *const ()) {
|
|
assert_eq!(ptr as usize, 5);
|
|
}
|
|
|
|
unsafe fn drop(ptr: *const ()) {
|
|
assert_eq!(ptr as usize, 5);
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn iloop_with_fuel() {
|
|
let engine = Engine::new(Config::new().async_support(true).consume_fuel(true)).unwrap();
|
|
let mut store = Store::new(&engine, ());
|
|
store.out_of_fuel_async_yield(1_000, 10);
|
|
let module = Module::new(
|
|
&engine,
|
|
"
|
|
(module
|
|
(func (loop br 0))
|
|
(start 0)
|
|
)
|
|
",
|
|
)
|
|
.unwrap();
|
|
let instance = Instance::new_async(&mut store, &module, &[]);
|
|
let mut f = Pin::from(Box::new(instance));
|
|
let waker = dummy_waker();
|
|
let mut cx = Context::from_waker(&waker);
|
|
|
|
// This should yield a bunch of times...
|
|
for _ in 0..100 {
|
|
assert!(f.as_mut().poll(&mut cx).is_pending());
|
|
}
|
|
|
|
// ... but it should eventually also finish.
|
|
loop {
|
|
match f.as_mut().poll(&mut cx) {
|
|
Poll::Ready(_) => break,
|
|
Poll::Pending => {}
|
|
}
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn fuel_eventually_finishes() {
|
|
let engine = Engine::new(Config::new().async_support(true).consume_fuel(true)).unwrap();
|
|
let mut store = Store::new(&engine, ());
|
|
store.out_of_fuel_async_yield(u64::max_value(), 10);
|
|
let module = Module::new(
|
|
&engine,
|
|
"
|
|
(module
|
|
(func
|
|
(local i32)
|
|
i32.const 100
|
|
local.set 0
|
|
(loop
|
|
local.get 0
|
|
i32.const -1
|
|
i32.add
|
|
local.tee 0
|
|
br_if 0)
|
|
)
|
|
(start 0)
|
|
)
|
|
",
|
|
)
|
|
.unwrap();
|
|
let instance = Instance::new_async(&mut store, &module, &[]);
|
|
run(instance).unwrap();
|
|
}
|
|
|
|
#[test]
|
|
fn async_with_pooling_stacks() {
|
|
let mut config = Config::new();
|
|
config.async_support(true);
|
|
config.allocation_strategy(InstanceAllocationStrategy::Pooling {
|
|
strategy: PoolingAllocationStrategy::NextAvailable,
|
|
instance_limits: InstanceLimits {
|
|
count: 1,
|
|
memory_pages: 1,
|
|
table_elements: 0,
|
|
..Default::default()
|
|
},
|
|
});
|
|
config.dynamic_memory_guard_size(0);
|
|
config.static_memory_guard_size(0);
|
|
config.static_memory_maximum_size(65536);
|
|
|
|
let engine = Engine::new(&config).unwrap();
|
|
let mut store = Store::new(&engine, ());
|
|
let func = Func::new_async(
|
|
&mut store,
|
|
FuncType::new(None, None),
|
|
move |_caller, _params, _results| Box::new(async { Ok(()) }),
|
|
);
|
|
|
|
run_smoke_test(&mut store, func);
|
|
run_smoke_typed_test(&mut store, func);
|
|
}
|
|
|
|
#[test]
|
|
fn async_host_func_with_pooling_stacks() -> Result<()> {
|
|
let mut config = Config::new();
|
|
config.async_support(true);
|
|
config.allocation_strategy(InstanceAllocationStrategy::Pooling {
|
|
strategy: PoolingAllocationStrategy::NextAvailable,
|
|
instance_limits: InstanceLimits {
|
|
count: 1,
|
|
memory_pages: 1,
|
|
table_elements: 0,
|
|
..Default::default()
|
|
},
|
|
});
|
|
config.dynamic_memory_guard_size(0);
|
|
config.static_memory_guard_size(0);
|
|
config.static_memory_maximum_size(65536);
|
|
|
|
let mut store = Store::new(&Engine::new(&config)?, ());
|
|
let mut linker = Linker::new(store.engine());
|
|
linker.func_new_async(
|
|
"",
|
|
"",
|
|
FuncType::new(None, None),
|
|
move |_caller, _params, _results| Box::new(async { Ok(()) }),
|
|
)?;
|
|
|
|
let func = linker
|
|
.get(&mut store, "", Some(""))
|
|
.unwrap()
|
|
.into_func()
|
|
.unwrap();
|
|
run_smoke_test(&mut store, func);
|
|
run_smoke_typed_test(&mut store, func);
|
|
Ok(())
|
|
}
|
|
|
|
fn execute_across_threads<F: Future + Send + 'static>(future: F) {
|
|
let mut future = Pin::from(Box::new(future));
|
|
let poll = future
|
|
.as_mut()
|
|
.poll(&mut Context::from_waker(&dummy_waker()));
|
|
assert!(poll.is_pending());
|
|
|
|
std::thread::spawn(move || {
|
|
let poll = future
|
|
.as_mut()
|
|
.poll(&mut Context::from_waker(&dummy_waker()));
|
|
assert!(!poll.is_pending());
|
|
})
|
|
.join()
|
|
.unwrap();
|
|
}
|
|
|
|
#[test]
|
|
fn resume_separate_thread() {
|
|
// This test will poll the following future on two threads. Simulating a
|
|
// trap requires accessing TLS info, so that should be preserved correctly.
|
|
execute_across_threads(async {
|
|
let mut store = async_store();
|
|
let module = Module::new(
|
|
store.engine(),
|
|
"
|
|
(module
|
|
(import \"\" \"\" (func))
|
|
(start 0)
|
|
)
|
|
",
|
|
)
|
|
.unwrap();
|
|
let func = Func::wrap0_async(&mut store, |_| {
|
|
Box::new(async {
|
|
PendingOnce::default().await;
|
|
Err::<(), _>(wasmtime::Trap::new("test"))
|
|
})
|
|
});
|
|
let result = Instance::new_async(&mut store, &module, &[func.into()]).await;
|
|
assert!(result.is_err());
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn resume_separate_thread2() {
|
|
// This test will poll the following future on two threads. Catching a
|
|
// signal requires looking up TLS information to determine whether it's a
|
|
// trap to handle or not, so that must be preserved correctly across threads.
|
|
execute_across_threads(async {
|
|
let mut store = async_store();
|
|
let module = Module::new(
|
|
store.engine(),
|
|
"
|
|
(module
|
|
(import \"\" \"\" (func))
|
|
(func $start
|
|
call 0
|
|
unreachable)
|
|
(start $start)
|
|
)
|
|
",
|
|
)
|
|
.unwrap();
|
|
let func = Func::wrap0_async(&mut store, |_| {
|
|
Box::new(async { PendingOnce::default().await })
|
|
});
|
|
let result = Instance::new_async(&mut store, &module, &[func.into()]).await;
|
|
assert!(result.is_err());
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn resume_separate_thread3() {
|
|
// This test doesn't actually do anything with cross-thread polls, but
|
|
// instead it deals with scheduling futures at "odd" times.
|
|
//
|
|
// First we'll set up a *synchronous* call which will initialize TLS info.
|
|
// This call is simply to a host-defined function, but it still has the same
|
|
// "enter into wasm" semantics since it's just calling a trampoline. In this
|
|
// situation we'll set up the TLS info so it's in place while the body of
|
|
// the function executes...
|
|
let mut store = Store::new(&Engine::default(), None);
|
|
let f = Func::wrap(&mut store, move |mut caller: Caller<'_, _>| {
|
|
// ... and the execution of this host-defined function (while the TLS
|
|
// info is initialized), will set up a recursive call into wasm. This
|
|
// recursive call will be done asynchronously so we can suspend it
|
|
// halfway through.
|
|
let f = async {
|
|
let mut store = async_store();
|
|
let module = Module::new(
|
|
store.engine(),
|
|
"
|
|
(module
|
|
(import \"\" \"\" (func))
|
|
(start 0)
|
|
)
|
|
",
|
|
)
|
|
.unwrap();
|
|
let func = Func::wrap0_async(&mut store, |_| {
|
|
Box::new(async { PendingOnce::default().await })
|
|
});
|
|
drop(Instance::new_async(&mut store, &module, &[func.into()]).await);
|
|
unreachable!()
|
|
};
|
|
let mut future = Pin::from(Box::new(f));
|
|
let poll = future
|
|
.as_mut()
|
|
.poll(&mut Context::from_waker(&dummy_waker()));
|
|
assert!(poll.is_pending());
|
|
|
|
// ... so at this point our call into wasm is suspended. The call into
|
|
// wasm will have overwritten TLS info, and we sure hope that the
|
|
// information is restored at this point. Note that we squirrel away the
|
|
// future somewhere else to get dropped later. If we were to drop it
|
|
// here then we would reenter the future's suspended stack to clean it
|
|
// up, which would do more alterations of TLS information we're not
|
|
// testing here.
|
|
*caller.data_mut() = Some(future);
|
|
|
|
// ... all in all this function will need access to the original TLS
|
|
// information to raise the trap. This TLS information should be
|
|
// restored even though the asynchronous execution is suspended.
|
|
Err::<(), _>(wasmtime::Trap::new(""))
|
|
});
|
|
assert!(f.call(&mut store, &[], &mut []).is_err());
|
|
}
|
|
|
|
#[test]
|
|
fn recursive_async() -> Result<()> {
|
|
let mut store = async_store();
|
|
let m = Module::new(
|
|
store.engine(),
|
|
"(module
|
|
(func (export \"overflow\") call 0)
|
|
(func (export \"normal\"))
|
|
)",
|
|
)?;
|
|
let i = run(Instance::new_async(&mut store, &m, &[]))?;
|
|
let overflow = i.get_typed_func::<(), (), _>(&mut store, "overflow")?;
|
|
let normal = i.get_typed_func::<(), (), _>(&mut store, "normal")?;
|
|
let f2 = Func::wrap0_async(&mut store, move |mut caller| {
|
|
Box::new(async move {
|
|
// recursive async calls shouldn't immediately stack overflow...
|
|
normal.call_async(&mut caller, ()).await?;
|
|
|
|
// ... but calls that actually stack overflow should indeed stack
|
|
// overflow
|
|
let err = overflow.call_async(&mut caller, ()).await.unwrap_err();
|
|
assert_eq!(err.trap_code(), Some(TrapCode::StackOverflow));
|
|
Ok(())
|
|
})
|
|
});
|
|
run(f2.call_async(&mut store, &[], &mut []))?;
|
|
Ok(())
|
|
}
|
|
|
|
#[test]
|
|
fn linker_module_command() -> Result<()> {
|
|
run(async {
|
|
let mut store = async_store();
|
|
let mut linker = Linker::new(store.engine());
|
|
let module1 = Module::new(
|
|
store.engine(),
|
|
r#"
|
|
(module
|
|
(global $g (mut i32) (i32.const 0))
|
|
|
|
(func (export "_start"))
|
|
|
|
(func (export "g") (result i32)
|
|
global.get $g
|
|
i32.const 1
|
|
global.set $g)
|
|
)
|
|
"#,
|
|
)?;
|
|
let module2 = Module::new(
|
|
store.engine(),
|
|
r#"
|
|
(module
|
|
(import "" "g" (func (result i32)))
|
|
|
|
(func (export "get") (result i32)
|
|
call 0)
|
|
)
|
|
"#,
|
|
)?;
|
|
|
|
linker.module_async(&mut store, "", &module1).await?;
|
|
let instance = linker.instantiate_async(&mut store, &module2).await?;
|
|
let f = instance.get_typed_func::<(), i32, _>(&mut store, "get")?;
|
|
assert_eq!(f.call_async(&mut store, ()).await?, 0);
|
|
assert_eq!(f.call_async(&mut store, ()).await?, 0);
|
|
|
|
Ok(())
|
|
})
|
|
}
|
|
|
|
#[test]
|
|
fn linker_module_reactor() -> Result<()> {
|
|
run(async {
|
|
let mut store = async_store();
|
|
let mut linker = Linker::new(store.engine());
|
|
let module1 = Module::new(
|
|
store.engine(),
|
|
r#"
|
|
(module
|
|
(global $g (mut i32) (i32.const 0))
|
|
|
|
(func (export "g") (result i32)
|
|
global.get $g
|
|
i32.const 1
|
|
global.set $g)
|
|
)
|
|
"#,
|
|
)?;
|
|
let module2 = Module::new(
|
|
store.engine(),
|
|
r#"
|
|
(module
|
|
(import "" "g" (func (result i32)))
|
|
|
|
(func (export "get") (result i32)
|
|
call 0)
|
|
)
|
|
"#,
|
|
)?;
|
|
|
|
linker.module_async(&mut store, "", &module1).await?;
|
|
let instance = linker.instantiate_async(&mut store, &module2).await?;
|
|
let f = instance.get_typed_func::<(), i32, _>(&mut store, "get")?;
|
|
assert_eq!(f.call_async(&mut store, ()).await?, 0);
|
|
assert_eq!(f.call_async(&mut store, ()).await?, 1);
|
|
|
|
Ok(())
|
|
})
|
|
}
|