Optimize Func::call and its C API (#3319)

* Optimize `Func::call` and its C API

This commit is an alternative to #3298 which achieves effectively the
same goal of optimizing the `Func::call` API as well as its C API
sibling of `wasmtime_func_call`. The strategy taken here is different
than #3298 though where a new API isn't created, rather a small tweak to
an existing API is done. Specifically this commit handles the major
sources of slowness with `Func::call` with:

* Looking up the type of a function, to typecheck the arguments with and
  use to guide how the results should be loaded, no longer hits the
  rwlock in the `Engine` but instead each `Func` contains its own
  `FuncType`. This can be an unnecessary allocation for funcs not used
  with `Func::call`, so this is a downside of this implementation
  relative to #3298. A mitigating factor, though, is that instance
  exports are loaded lazily into the `Store` and in theory not too many
  funcs are active in the store as `Func` objects.

* Temporary storage is amortized with a long-lived `Vec` in the `Store`
  rather than allocating a new vector on each call. This is basically
  the same strategy as #3294 only applied to different types in
  different places. Specifically `wasmtime::Store` now retains a
  `Vec<u128>` for `Func::call`, and the C API retains a `Vec<Val>` for
  calling `Func::call`.

* Finally, an API breaking change is made to `Func::call` and its type
  signature (as well as `Func::call_async`). Instead of returning
  `Box<[Val]>` as it did before this function now takes a
  `results: &mut [Val]` parameter. This allows the caller to manage the
  allocation and we can amortize-remove it in `wasmtime_func_call` by
  using space after the parameters in the `Vec<Val>` we're passing in.
  This change is naturally a breaking change and we'll want to consider
  it carefully, but mitigating factors are that most embeddings are
  likely using `TypedFunc::call` instead and this signature taking a
  mutable slice better aligns with `Func::new` which receives a mutable
  slice for the results.

Overall this change, in the benchmark of "call a nop function from the C
API" is not quite as good as #3298. It's still a bit slower, on the
order of 15ns, because there's lots of capacity checks around vectors
and the type checks are slightly less optimized than before. Overall
though this is still significantly better than today because allocations
and the rwlock to acquire the type information are both avoided. I
personally feel that this change is the best to do because it has less
of an API impact than #3298.

* Rebase issues

tests/all/funcref.rs

@@ -20,8 +20,12 @@ fn pass_funcref_in_and_out_of_wasm() -> anyhow::Result<()> {
 
     // Pass in a non-null funcref.
     {
-        let results = func.call(&mut store, &[Val::FuncRef(Some(func.clone()))])?;
-        assert_eq!(results.len(), 1);
+        let mut results = [Val::I32(0)];
+        func.call(
+            &mut store,
+            &[Val::FuncRef(Some(func.clone()))],
+            &mut results,
+        )?;
 
         // Can't compare `Func` for equality, so this is the best we can do here.
         let result_func = results[0].unwrap_funcref().unwrap();
@@ -30,9 +34,8 @@ fn pass_funcref_in_and_out_of_wasm() -> anyhow::Result<()> {
 
     // Pass in a null funcref.
     {
-        let results = func.call(&mut store, &[Val::FuncRef(None)])?;
-        assert_eq!(results.len(), 1);
-
+        let mut results = [Val::I32(0)];
+        func.call(&mut store, &[Val::FuncRef(None)], &mut results)?;
         let result_func = results[0].unwrap_funcref();
         assert!(result_func.is_none());
     }
@@ -42,9 +45,11 @@ fn pass_funcref_in_and_out_of_wasm() -> anyhow::Result<()> {
         let other_instance = Instance::new(&mut store, &module, &[])?;
         let other_instance_func = other_instance.get_func(&mut store, "func").unwrap();
 
-        let results = func.call(
+        let mut results = [Val::I32(0)];
+        func.call(
             &mut store,
             &[Val::FuncRef(Some(other_instance_func.clone()))],
+            &mut results,
         )?;
         assert_eq!(results.len(), 1);
 
@@ -61,7 +66,9 @@ fn pass_funcref_in_and_out_of_wasm() -> anyhow::Result<()> {
             .get_func(&mut other_store, "f")
             .unwrap();
 
-        assert!(func.call(&mut store, &[Val::FuncRef(Some(f))]).is_err());
+        assert!(func
+            .call(&mut store, &[Val::FuncRef(Some(f))], &mut [Val::I32(0)])
+            .is_err());
     }
 
     Ok(())
@@ -82,9 +89,8 @@ fn receive_null_funcref_from_wasm() -> anyhow::Result<()> {
     let instance = Instance::new(&mut store, &module, &[])?;
     let get_null = instance.get_func(&mut store, "get-null").unwrap();
 
-    let results = get_null.call(&mut store, &[])?;
-    assert_eq!(results.len(), 1);
-
+    let mut results = [Val::I32(0)];
+    get_null.call(&mut store, &[], &mut results)?;
     let result_func = results[0].unwrap_funcref();
     assert!(result_func.is_none());
 
@@ -101,7 +107,7 @@ fn wrong_store() -> anyhow::Result<()> {
         let set = SetOnDrop(dropped.clone());
         let f1 = Func::wrap(&mut store1, move || drop(&set));
         let f2 = Func::wrap(&mut store2, move || Some(f1.clone()));
-        assert!(f2.call(&mut store2, &[]).is_err());
+        assert!(f2.call(&mut store2, &[], &mut []).is_err());
     }
     assert!(dropped.load(SeqCst));
 
@@ -133,7 +139,7 @@ fn func_new_returns_wrong_store() -> anyhow::Result<()> {
                 Ok(())
             },
         );
-        assert!(f2.call(&mut store2, &[]).is_err());
+        assert!(f2.call(&mut store2, &[], &mut [Val::I32(0)]).is_err());
     }
     assert!(dropped.load(SeqCst));