Struct Rooted
pub struct Rooted<T>where
T: GcRef,{ /* private fields */ }
Expand description
A scoped, rooted reference to a garbage-collected T
.
A Rooted<T>
is a strong handle to a garbage-collected T
, preventing its
referent (and anything else transitively referenced) from being collected by
the GC during the scope within which this Rooted<T>
was created.
When the context exits this Rooted<T>
’s scope, the underlying GC object is
automatically unrooted and any further attempts to use access the underlying
object will return errors or otherwise fail.
Rooted<T>
dereferences to its underlying T
, allowing you to call T
’s
methods.
§Example
let mut store = Store::<()>::default();
// Allocating a GC object returns a `Rooted<T>`.
let hello: Rooted<ExternRef> = ExternRef::new(&mut store, "hello")?;
// Because `Rooted<T>` derefs to `T`, we can call `T` methods on a
// `Rooted<T>`. For example, we can call the `ExternRef::data` method when we
// have a `Rooted<ExternRef>`.
let data = hello
.data(&store)?
.ok_or_else(|| Error::msg("externref has no host data"))?
.downcast_ref::<&str>()
.ok_or_else(|| Error::msg("not a str"))?;
assert_eq!(*data, "hello");
// A `Rooted<T>` roots its underlying GC object for the duration of the
// scope of the store/caller/context that was passed to the method that created
// it. If we only want to keep a GC reference rooted and alive temporarily, we
// can introduce new scopes with `RootScope`.
{
let mut scope = RootScope::new(&mut store);
// This `Rooted<T>` is automatically unrooted after `scope` is dropped,
// allowing the collector to reclaim its GC object in the next GC.
let scoped_ref = ExternRef::new(&mut scope, "goodbye");
}
let module = Module::new(store.engine(), r#"
(module
(global (export "global") (mut externref) (ref.null extern))
(table (export "table") 10 externref)
(func (export "func") (param externref) (result externref)
local.get 0
)
)
"#)?;
let instance = Instance::new(&mut store, &module, &[])?;
// GC references returned from calls into Wasm also return (optional, if the
// Wasm type is nullable) `Rooted<T>`s.
let result: Option<Rooted<_>> = instance
.get_typed_func::<Option<Rooted<ExternRef>>, Option<Rooted<ExternRef>>>(&mut store, "func")?
.call(&mut store, Some(hello))?;
// Similarly, getting a GC reference from a Wasm instance's exported global
// or table yields a `Rooted<T>`.
let global = instance
.get_global(&mut store, "global")
.ok_or_else(|| Error::msg("missing `global` export"))?;
let global_val = global.get(&mut store);
let global_ref: Option<&Rooted<_>> = global_val
.externref()
.ok_or_else(|| Error::msg("not an externref"))?;
let table = instance.get_table(&mut store, "table").unwrap();
let table_elem = table
.get(&mut store, 3)
.ok_or_else(|| Error::msg("table out of bounds"))?;
let table_elem_ref: Option<&Rooted<_>> = table_elem
.as_extern()
.ok_or_else(|| Error::msg("not an externref"))?;
§Differences Between Rooted<T>
and ManuallyRooted<T>
While Rooted<T>
is automatically unrooted when its scope is exited, this
means that Rooted<T>
is only valid for strictly last-in-first-out (LIFO,
aka stack order) lifetimes. This is in contrast to
ManuallyRooted<T>
, which supports rooting GC
objects for arbitrary lifetimes, but requires manual unrooting.
Type | Supported Lifetimes | Unrooting |
---|---|---|
Rooted<T> | Strictly LIFO / stack order | Automatic |
ManuallyRooted<T> | Arbitrary | Manual |
Rooted<T>
should suffice for most use cases, and provides better
ergonomics, but ManuallyRooted<T>
exists as a fully-general escape hatch.
§Scopes
Wasmtime automatically creates two kinds of scopes:
-
A
Store
is the outermost rooting scope. Creating aRoot<T>
directly inside aStore
permanently roots the underlying object, similar to dropping aManuallyRooted<T>
without unrooting it. -
A
Caller
provides a rooting scope for the duration of a call from Wasm into a host function. Any objects rooted in aCaller
will be unrooted after the host function returns. Note that there can be nestedCaller
scopes in the case where Wasm calls a host function, creating the firstCaller
and its rooting scope , and then the host function calls a Wasm function which then calls another host function, creating a secondCaller
and a second rooting scope. This nesting can be arbitrarily deep.
Additionally, if you would like to define finer-grained rooting scopes,
Wasmtime provides the RootScope
type.
Scopes are always nested in a last-in-first-out (LIFO) order. An outer scope
is never exited (and the Rooted<T>
s defined within it are never
automatically unrooted) while an inner scope is still active. All inner
scopes are exited before their outer scopes.
The following diagram illustrates various rooting scopes over time, how they
nest, and when their Rooted<T>
s are automatically unrooted:
----- new Store
|
|
| let a: Rooted<T> = ...;
|
|
| ----- call into Wasm
| |
| |
| | ----- Wasm calls host function F
| | |
| | |
| | | let b: Rooted<T> = ...;
| | |
| | |
| | | ----- F calls into Wasm
| | | |
| | | |
| | | | ----- Wasm call host function G
| | | | |
| | | | |
| | | | | let c: Rooted<T> = ...;
| | | | |
| | | | |
| | | | ----- return to Wasm from host function G (unroots `c`)
| | | |
| | | |
| | | ----- Wasm returns to F
| | |
| | |
| | ----- return from host function F (unroots `b`)
| |
| |
| ----- return from Wasm
|
|
| ----- let scope1 = RootScope::new(...);
| |
| |
| | let d: Rooted<T> = ...;
| |
| |
| | ----- let scope2 = RootScope::new(...);
| | |
| | |
| | | let e: Rooted<T> = ...;
| | |
| | |
| | ----- drop `scope2` (unroots `e`)
| |
| |
| ----- drop `scope1` (unroots `d`)
|
|
----- drop Store (unroots `a`)
A Rooted<T>
can be used successfully as long as it is still rooted so, in
the above diagram, d
is valid inside scope2
because scope2
is wholly
contained within the scope d
was rooted within (scope1
).
See also the documentation for RootScope
.
Implementations§
§impl<T> Rooted<T>where
T: GcRef,
impl<T> Rooted<T>where
T: GcRef,
pub fn to_manually_rooted(
&self,
store: impl AsContextMut,
) -> Result<ManuallyRooted<T>, Error>
pub fn to_manually_rooted( &self, store: impl AsContextMut, ) -> Result<ManuallyRooted<T>, Error>
Create a ManuallyRooted<T>
holding onto the
same GC object as self
.
Returns None
if self
is used outside of its scope and has therefore
been unrooted.
This does not unroot self
, and self
remains valid until its
associated scope is exited.
§Panics
Panics if this object is not associate with the given store.
§Example
let mut store = Store::<()>::default();
let y: ManuallyRooted<_> = {
// Create a nested rooting scope.
let mut scope = RootScope::new(&mut store);
// `x` is only rooted within this nested scope.
let x: Rooted<_> = ExternRef::new(&mut scope, "hello!")?;
// Extend `x`'s rooting past its scope's lifetime by converting it
// to a `ManuallyRooted`.
x.to_manually_rooted(&mut scope)?
};
// Now we can still access the reference outside the scope it was
// originally defined within.
let data = y.data(&store)?.expect("should have host data");
let data = data.downcast_ref::<&str>().expect("host data should be str");
assert_eq!(*data, "hello!");
// But we have to manually unroot `y`.
y.unroot(&mut store);
pub fn rooted_eq(a: Rooted<T>, b: Rooted<T>) -> bool
pub fn rooted_eq(a: Rooted<T>, b: Rooted<T>) -> bool
Are these two Rooted<T>
s the same GC root?
Note that this function can return false
even when a
and b
are
rooting the same underlying GC object, but the object was rooted
multiple times (for example in different scopes). Use
Rooted::ref_eq
to test whether these are
references to the same underlying GC object or not.
§Example
let mut store = Store::<()>::default();
let a = ExternRef::new(&mut store, "hello")?;
let b = a;
// `a` and `b` are the same GC root.
assert!(Rooted::rooted_eq(a, b));
{
let mut scope = RootScope::new(&mut store);
// `c` is a different GC root, in a different scope, even though it
// is rooting the same object.
let c = a.to_manually_rooted(&mut scope)?.into_rooted(&mut scope);
assert!(!Rooted::rooted_eq(a, c));
}
let x = ExternRef::new(&mut store, "goodbye")?;
// `a` and `x` are different GC roots, rooting different objects.
assert!(!Rooted::rooted_eq(a, x));
pub fn ref_eq(
store: impl AsContext,
a: &impl RootedGcRef<T>,
b: &impl RootedGcRef<T>,
) -> Result<bool, Error>
pub fn ref_eq( store: impl AsContext, a: &impl RootedGcRef<T>, b: &impl RootedGcRef<T>, ) -> Result<bool, Error>
Are these two GC roots referencing the same underlying GC object?
This function will return true
even when a
and b
are different GC
roots (for example because they were rooted in different scopes) if they
are rooting the same underlying GC object. To only test whether they are
the same GC root, and not whether they are rooting the same GC object,
use Rooted::rooted_eq
.
Returns an error if either a
or b
has been unrooted, for example
because the scope it was rooted within has been exited.
Because this method takes any impl RootedGcRef<T>
arguments, it can be
used to compare, for example, a Rooted<T>
and a ManuallyRooted<T>
.
§Panics
Panics if either a
or b
is not associated with the given store
.
§Example
let mut store = Store::<()>::default();
let a = ExternRef::new(&mut store, "hello")?;
let b = a;
// `a` and `b` are rooting the same object.
assert!(Rooted::ref_eq(&store, &a, &b)?);
{
let mut scope = RootScope::new(&mut store);
// `c` is a different GC root, in a different scope, but still
// rooting the same object.
let c = a.to_manually_rooted(&mut scope)?.into_rooted(&mut scope);
assert!(!Rooted::ref_eq(&scope, &a, &c)?);
}
let x = ExternRef::new(&mut store, "goodbye")?;
// `a` and `x` are rooting different objects.
assert!(!Rooted::ref_eq(&store, &a, &x)?);
// You can also compare `Rooted<T>`s and `ManuallyRooted<T>`s with this
// function.
let d = a.to_manually_rooted(&mut store)?;
assert!(Rooted::ref_eq(&store, &a, &d)?);
d.unroot(&mut store);
pub fn rooted_hash<H>(&self, state: &mut H)where
H: Hasher,
pub fn rooted_hash<H>(&self, state: &mut H)where
H: Hasher,
Hash this root.
Note that, similar to Rooted::rooted_eq
, this only operates on the
root and not the underlying GC reference. That means that two
different rootings of the same object will hash to different values
(modulo hash collisions). If this is undesirable, use the
ref_hash
method instead.
pub fn ref_hash<H>(
&self,
store: impl AsContext,
state: &mut H,
) -> Result<(), Error>where
H: Hasher,
pub fn ref_hash<H>(
&self,
store: impl AsContext,
state: &mut H,
) -> Result<(), Error>where
H: Hasher,
Hash the underlying rooted object reference.
Note that, similar to Rooted::ref_eq
, and operates on the underlying
rooted GC object reference, not the root. That means that two
different rootings of the same object will hash to the same
value. If this is undesirable, use the
rooted_hash
method instead.
Trait Implementations§
impl<T> Copy for Rooted<T>where
T: GcRef,
impl WasmTy for Rooted<AnyRef>
impl WasmTy for Rooted<ArrayRef>
impl WasmTy for Rooted<EqRef>
impl WasmTy for Rooted<ExternRef>
impl WasmTy for Rooted<StructRef>
Auto Trait Implementations§
impl<T> Freeze for Rooted<T>
impl<T> RefUnwindSafe for Rooted<T>where
T: RefUnwindSafe,
impl<T> Send for Rooted<T>where
T: Send,
impl<T> Sync for Rooted<T>where
T: Sync,
impl<T> Unpin for Rooted<T>where
T: Unpin,
impl<T> UnwindSafe for Rooted<T>where
T: UnwindSafe,
Blanket Implementations§
§impl<T> AnySync for T
impl<T> AnySync for T
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> Conv for T
impl<T> Conv for T
Source§impl<T, U> DefensiveTruncateInto<U> for Twhere
U: DefensiveTruncateFrom<T>,
impl<T, U> DefensiveTruncateInto<U> for Twhere
U: DefensiveTruncateFrom<T>,
Source§fn defensive_truncate_into(self) -> U
fn defensive_truncate_into(self) -> U
§impl<T> FmtForward for T
impl<T> FmtForward for T
§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
self
to use its Binary
implementation when Debug
-formatted.§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
self
to use its Display
implementation when
Debug
-formatted.§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
self
to use its LowerExp
implementation when
Debug
-formatted.§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
self
to use its LowerHex
implementation when
Debug
-formatted.§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
self
to use its Octal
implementation when Debug
-formatted.§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
self
to use its Pointer
implementation when
Debug
-formatted.§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
self
to use its UpperExp
implementation when
Debug
-formatted.§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
self
to use its UpperHex
implementation when
Debug
-formatted.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<Src, Dest> IntoTuple<Dest> for Srcwhere
Dest: FromTuple<Src>,
impl<Src, Dest> IntoTuple<Dest> for Srcwhere
Dest: FromTuple<Src>,
fn into_tuple(self) -> Dest
Source§impl<T, Outer> IsWrappedBy<Outer> for T
impl<T, Outer> IsWrappedBy<Outer> for T
§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
self
and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
self
and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
self
, then passes self.as_ref()
into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
self
, then passes self.as_mut()
into the pipe
function.§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
self
, then passes self.deref()
into the pipe function.§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
Source§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
Source§fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
T
. Read more§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self
to the equivalent element of its superset.§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Borrow<B>
of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
BorrowMut<B>
of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
AsRef<R>
view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
AsMut<R>
view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Deref::Target
of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Deref::Target
of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap()
only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut()
only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.tap_borrow()
only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
.tap_borrow_mut()
only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
.tap_ref()
only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
.tap_ref_mut()
only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
.tap_deref()
only in debug builds, and is erased in release
builds.§impl<T> TryConv for T
impl<T> TryConv for T
Source§impl<T, U> TryIntoKey<U> for Twhere
U: TryFromKey<T>,
impl<T, U> TryIntoKey<U> for Twhere
U: TryFromKey<T>,
type Error = <U as TryFromKey<T>>::Error
fn try_into_key(self) -> Result<U, <U as TryFromKey<T>>::Error>
Source§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
Source§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
unchecked_from
.Source§impl<T, S> UniqueSaturatedInto<T> for S
impl<T, S> UniqueSaturatedInto<T> for S
Source§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
T
.