Enum LibCall

#[repr(u16)]
pub enum LibCall {
    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,
}

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

pub fn to_function_name(&self) -> &str

Return the function name associated to the libcall.

Trait Implementations

impl Archive for LibCall

type Archived = ArchivedLibCall

The archived representation of this type.

type Resolver = LibCallResolver

The resolver for this type. It must contain all the additional information from serializing needed to make the archived type from the normal type.

fn resolve( &self, resolver: <LibCall as Archive>::Resolver, out: Place<<LibCall as Archive>::Archived>, )

Creates the archived version of this value at the given position and writes it to the given output.

const COPY_OPTIMIZATION: CopyOptimization<Self> = _

An optimization flag that allows the bytes of this type to be copied directly to a writer instead of calling serialize.

impl Clone for LibCall

fn clone(&self) -> LibCall

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for LibCall

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<__D> Deserialize<LibCall, __D> for <LibCall as Archive>::Archived

where __D: Fallible + ?Sized,

fn deserialize( &self, deserializer: &mut __D, ) -> Result<LibCall, <__D as Fallible>::Error>

Deserializes using the given deserializer

impl Display for LibCall

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl Hash for LibCall

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl IntoEnumIterator for LibCall

const VARIANT_COUNT: usize = 37usize

Number of variants.

type Iterator = LibCallEnumIterator

Type of the iterator over the variants.

fn into_enum_iter() -> <LibCall as IntoEnumIterator>::Iterator

Returns an iterator over the variants.

impl PartialEq<ArchivedLibCall> for LibCall

fn eq(&self, other: &ArchivedLibCall) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq for LibCall

fn eq(&self, other: &LibCall) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<__S> Serialize<__S> for LibCall

where __S: Fallible + ?Sized,

fn serialize( &self, serializer: &mut __S, ) -> Result<<LibCall as Archive>::Resolver, <__S as Fallible>::Error>

Writes the dependencies for the object and returns a resolver that can create the archived type.

impl Copy for LibCall

impl Eq for LibCall

impl StructuralPartialEq for LibCall