#[repr(u16)]pub enum LibCall {
Show 37 variants
CeilF32 = 0,
CeilF64 = 1,
FloorF32 = 2,
FloorF64 = 3,
NearestF32 = 4,
NearestF64 = 5,
TruncF32 = 6,
TruncF64 = 7,
Memory32Size = 8,
ImportedMemory32Size = 9,
TableCopy = 10,
TableInit = 11,
TableFill = 12,
TableSize = 13,
ImportedTableSize = 14,
TableGet = 15,
ImportedTableGet = 16,
TableSet = 17,
ImportedTableSet = 18,
TableGrow = 19,
ImportedTableGrow = 20,
FuncRef = 21,
ElemDrop = 22,
Memory32Copy = 23,
ImportedMemory32Copy = 24,
Memory32Fill = 25,
ImportedMemory32Fill = 26,
Memory32Init = 27,
DataDrop = 28,
RaiseTrap = 29,
Probestack = 30,
Memory32AtomicWait32 = 31,
ImportedMemory32AtomicWait32 = 32,
Memory32AtomicWait64 = 33,
ImportedMemory32AtomicWait64 = 34,
Memory32AtomicNotify = 35,
ImportedMemory32AtomicNotify = 36,
}
Expand description
The name of a runtime library routine.
This list is likely to grow over time.
Variants§
CeilF32 = 0
ceil.f32
CeilF64 = 1
ceil.f64
FloorF32 = 2
floor.f32
FloorF64 = 3
floor.f64
NearestF32 = 4
nearest.f32
NearestF64 = 5
nearest.f64
TruncF32 = 6
trunc.f32
TruncF64 = 7
trunc.f64
Memory32Size = 8
memory.size for local functions
ImportedMemory32Size = 9
memory.size for imported functions
TableCopy = 10
table.copy
TableInit = 11
table.init
TableFill = 12
table.fill
TableSize = 13
table.size for local tables
ImportedTableSize = 14
table.size for imported tables
TableGet = 15
table.get for local tables
ImportedTableGet = 16
table.get for imported tables
TableSet = 17
table.set for local tables
ImportedTableSet = 18
table.set for imported tables
TableGrow = 19
table.grow for local tables
ImportedTableGrow = 20
table.grow for imported tables
FuncRef = 21
ref.func
ElemDrop = 22
elem.drop
Memory32Copy = 23
memory.copy for local memories
ImportedMemory32Copy = 24
memory.copy for imported memories
Memory32Fill = 25
memory.fill for local memories
ImportedMemory32Fill = 26
memory.fill for imported memories
Memory32Init = 27
memory.init
DataDrop = 28
data.drop
RaiseTrap = 29
A custom trap
Probestack = 30
probe for stack overflow. These are emitted for functions which need
when the enable_probestack
setting is true.
Memory32AtomicWait32 = 31
memory.atomic.wait32 for local memories
ImportedMemory32AtomicWait32 = 32
memory.atomic.wait32 for imported memories
Memory32AtomicWait64 = 33
memory.atomic.wait64 for local memories
ImportedMemory32AtomicWait64 = 34
memory.atomic.wait64 for imported memories
Memory32AtomicNotify = 35
memory.atomic.notify for local memories
ImportedMemory32AtomicNotify = 36
memory.atomic.botify for imported memories
Implementations§
§impl LibCall
impl LibCall
pub fn to_function_name(&self) -> &str
pub fn to_function_name(&self) -> &str
Return the function name associated to the libcall.
Trait Implementations§
§impl Archive for LibCall
impl Archive for LibCall
§type Resolver = LibCallResolver
type Resolver = LibCallResolver
§fn resolve(
&self,
resolver: <LibCall as Archive>::Resolver,
out: Place<<LibCall as Archive>::Archived>,
)
fn resolve( &self, resolver: <LibCall as Archive>::Resolver, out: Place<<LibCall as Archive>::Archived>, )
§const COPY_OPTIMIZATION: CopyOptimization<Self> = _
const COPY_OPTIMIZATION: CopyOptimization<Self> = _
serialize
. Read more§impl<'de> Deserialize<'de> for LibCall
impl<'de> Deserialize<'de> for LibCall
§fn deserialize<__D>(
__deserializer: __D,
) -> Result<LibCall, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D,
) -> Result<LibCall, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
§impl<__D> Deserialize<LibCall, __D> for <LibCall as Archive>::Archivedwhere
__D: Fallible + ?Sized,
impl<__D> Deserialize<LibCall, __D> for <LibCall as Archive>::Archivedwhere
__D: Fallible + ?Sized,
§fn deserialize(
&self,
deserializer: &mut __D,
) -> Result<LibCall, <__D as Fallible>::Error>
fn deserialize( &self, deserializer: &mut __D, ) -> Result<LibCall, <__D as Fallible>::Error>
§impl IntoEnumIterator for LibCall
impl IntoEnumIterator for LibCall
§const VARIANT_COUNT: usize = 37usize
const VARIANT_COUNT: usize = 37usize
§fn into_enum_iter() -> <LibCall as IntoEnumIterator>::Iterator
fn into_enum_iter() -> <LibCall as IntoEnumIterator>::Iterator
§impl PartialEq<ArchivedLibCall> for LibCall
impl PartialEq<ArchivedLibCall> for LibCall
§impl Serialize for LibCall
impl Serialize for LibCall
§fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
impl Copy for LibCall
impl Eq for LibCall
impl StructuralPartialEq for LibCall
Auto Trait Implementations§
impl Freeze for LibCall
impl RefUnwindSafe for LibCall
impl Send for LibCall
impl Sync for LibCall
impl Unpin for LibCall
impl UnwindSafe for LibCall
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
§impl<T> ArchiveUnsized for Twhere
T: Archive,
impl<T> ArchiveUnsized for Twhere
T: Archive,
§type Archived = <T as Archive>::Archived
type Archived = <T as Archive>::Archived
Archive
, it may be
unsized. Read more§fn archived_metadata(
&self,
) -> <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata
fn archived_metadata( &self, ) -> <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata
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> CloneToUninit for Twhere
T: Copy,
impl<T> CloneToUninit for Twhere
T: Copy,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.