wasmtime 11.0.0 → 12.0.0

data/ext/cargo-vendor/wit-parser-0.9.2/src/abi.rs

@@ -0,0 +1,2199 @@
+use crate::sizealign::align_to;
+use crate::{
+    Enum, Flags, FlagsRepr, Function, Handle, Int, Record, Resolve, Result_, Results, Tuple, Type,
+    TypeDefKind, TypeId, Union, Variant,
+};
+
+/// A raw WebAssembly signature with params and results.
+#[derive(Clone, Debug, Hash, Eq, PartialEq, PartialOrd, Ord)]
+pub struct WasmSignature {
+    /// The WebAssembly parameters of this function.
+    pub params: Vec<WasmType>,
+
+    /// The WebAssembly results of this function.
+    pub results: Vec<WasmType>,
+
+    /// Whether or not this signature is passing all of its parameters
+    /// indirectly through a pointer within `params`.
+    ///
+    /// Note that `params` still reflects the true wasm paramters of this
+    /// function, this is auxiliary information for code generators if
+    /// necessary.
+    pub indirect_params: bool,
+
+    /// Whether or not this signature is using a return pointer to store the
+    /// result of the function, which is reflected either in `params` or
+    /// `results` depending on the context this function is used (e.g. an import
+    /// or an export).
+    pub retptr: bool,
+}
+
+/// Enumerates wasm types used by interface types when lowering/lifting.
+#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash, PartialOrd, Ord)]
+pub enum WasmType {
+    I32,
+    I64,
+    F32,
+    F64,
+    // NOTE: we don't lower interface types to any other Wasm type,
+    // e.g. externref, so we don't need to define them here.
+}
+
+fn join(a: WasmType, b: WasmType) -> WasmType {
+    use WasmType::*;
+
+    match (a, b) {
+        (I32, I32) | (I64, I64) | (F32, F32) | (F64, F64) => a,
+
+        (I32, F32) | (F32, I32) => I32,
+
+        (_, I64 | F64) | (I64 | F64, _) => I64,
+    }
+}
+
+impl From<Int> for WasmType {
+    fn from(i: Int) -> WasmType {
+        match i {
+            Int::U8 | Int::U16 | Int::U32 => WasmType::I32,
+            Int::U64 => WasmType::I64,
+        }
+    }
+}
+
+// Helper macro for defining instructions without having to have tons of
+// exhaustive `match` statements to update
+macro_rules! def_instruction {
+    (
+        $( #[$enum_attr:meta] )*
+        pub enum $name:ident<'a> {
+            $(
+                $( #[$attr:meta] )*
+                $variant:ident $( {
+                    $($field:ident : $field_ty:ty $(,)* )*
+                } )?
+                    :
+                [$num_popped:expr] => [$num_pushed:expr],
+            )*
+        }
+    ) => {
+        $( #[$enum_attr] )*
+        pub enum $name<'a> {
+            $(
+                $( #[$attr] )*
+                $variant $( {
+                    $(
+                        $field : $field_ty,
+                    )*
+                } )? ,
+            )*
+        }
+
+        impl $name<'_> {
+            /// How many operands does this instruction pop from the stack?
+            #[allow(unused_variables)]
+            pub fn operands_len(&self) -> usize {
+                match self {
+                    $(
+                        Self::$variant $( {
+                            $(
+                                $field,
+                            )*
+                        } )? => $num_popped,
+                    )*
+                }
+            }
+
+            /// How many results does this instruction push onto the stack?
+            #[allow(unused_variables)]
+            pub fn results_len(&self) -> usize {
+                match self {
+                    $(
+                        Self::$variant $( {
+                            $(
+                                $field,
+                            )*
+                        } )? => $num_pushed,
+                    )*
+                }
+            }
+        }
+    };
+}
+
+def_instruction! {
+    #[derive(Debug)]
+    pub enum Instruction<'a> {
+        /// Acquires the specified parameter and places it on the stack.
+        /// Depending on the context this may refer to wasm parameters or
+        /// interface types parameters.
+        GetArg { nth: usize } : [0] => [1],
+
+        // Integer const/manipulation instructions
+
+        /// Pushes the constant `val` onto the stack.
+        I32Const { val: i32 } : [0] => [1],
+        /// Casts the top N items on the stack using the `Bitcast` enum
+        /// provided. Consumes the same number of operands that this produces.
+        Bitcasts { casts: &'a [Bitcast] } : [casts.len()] => [casts.len()],
+        /// Pushes a number of constant zeros for each wasm type on the stack.
+        ConstZero { tys: &'a [WasmType] } : [0] => [tys.len()],
+
+        // Memory load/store instructions
+
+        /// Pops an `i32` from the stack and loads a little-endian `i32` from
+        /// it, using the specified constant offset.
+        I32Load { offset: i32 } : [1] => [1],
+        /// Pops an `i32` from the stack and loads a little-endian `i8` from
+        /// it, using the specified constant offset. The value loaded is the
+        /// zero-extended to 32-bits
+        I32Load8U { offset: i32 } : [1] => [1],
+        /// Pops an `i32` from the stack and loads a little-endian `i8` from
+        /// it, using the specified constant offset. The value loaded is the
+        /// sign-extended to 32-bits
+        I32Load8S { offset: i32 } : [1] => [1],
+        /// Pops an `i32` from the stack and loads a little-endian `i16` from
+        /// it, using the specified constant offset. The value loaded is the
+        /// zero-extended to 32-bits
+        I32Load16U { offset: i32 } : [1] => [1],
+        /// Pops an `i32` from the stack and loads a little-endian `i16` from
+        /// it, using the specified constant offset. The value loaded is the
+        /// sign-extended to 32-bits
+        I32Load16S { offset: i32 } : [1] => [1],
+        /// Pops an `i32` from the stack and loads a little-endian `i64` from
+        /// it, using the specified constant offset.
+        I64Load { offset: i32 } : [1] => [1],
+        /// Pops an `i32` from the stack and loads a little-endian `f32` from
+        /// it, using the specified constant offset.
+        F32Load { offset: i32 } : [1] => [1],
+        /// Pops an `i32` from the stack and loads a little-endian `f64` from
+        /// it, using the specified constant offset.
+        F64Load { offset: i32 } : [1] => [1],
+
+        /// Pops an `i32` address from the stack and then an `i32` value.
+        /// Stores the value in little-endian at the pointer specified plus the
+        /// constant `offset`.
+        I32Store { offset: i32 } : [2] => [0],
+        /// Pops an `i32` address from the stack and then an `i32` value.
+        /// Stores the low 8 bits of the value in little-endian at the pointer
+        /// specified plus the constant `offset`.
+        I32Store8 { offset: i32 } : [2] => [0],
+        /// Pops an `i32` address from the stack and then an `i32` value.
+        /// Stores the low 16 bits of the value in little-endian at the pointer
+        /// specified plus the constant `offset`.
+        I32Store16 { offset: i32 } : [2] => [0],
+        /// Pops an `i32` address from the stack and then an `i64` value.
+        /// Stores the value in little-endian at the pointer specified plus the
+        /// constant `offset`.
+        I64Store { offset: i32 } : [2] => [0],
+        /// Pops an `i32` address from the stack and then an `f32` value.
+        /// Stores the value in little-endian at the pointer specified plus the
+        /// constant `offset`.
+        F32Store { offset: i32 } : [2] => [0],
+        /// Pops an `i32` address from the stack and then an `f64` value.
+        /// Stores the value in little-endian at the pointer specified plus the
+        /// constant `offset`.
+        F64Store { offset: i32 } : [2] => [0],
+
+        // Scalar lifting/lowering
+
+        /// Converts an interface type `char` value to a 32-bit integer
+        /// representing the unicode scalar value.
+        I32FromChar : [1] => [1],
+        /// Converts an interface type `u64` value to a wasm `i64`.
+        I64FromU64 : [1] => [1],
+        /// Converts an interface type `s64` value to a wasm `i64`.
+        I64FromS64 : [1] => [1],
+        /// Converts an interface type `u32` value to a wasm `i32`.
+        I32FromU32 : [1] => [1],
+        /// Converts an interface type `s32` value to a wasm `i32`.
+        I32FromS32 : [1] => [1],
+        /// Converts an interface type `u16` value to a wasm `i32`.
+        I32FromU16 : [1] => [1],
+        /// Converts an interface type `s16` value to a wasm `i32`.
+        I32FromS16 : [1] => [1],
+        /// Converts an interface type `u8` value to a wasm `i32`.
+        I32FromU8 : [1] => [1],
+        /// Converts an interface type `s8` value to a wasm `i32`.
+        I32FromS8 : [1] => [1],
+        /// Conversion an interface type `f32` value to a wasm `f32`.
+        ///
+        /// This may be a noop for some implementations, but it's here in case the
+        /// native language representation of `f32` is different than the wasm
+        /// representation of `f32`.
+        F32FromFloat32 : [1] => [1],
+        /// Conversion an interface type `f64` value to a wasm `f64`.
+        ///
+        /// This may be a noop for some implementations, but it's here in case the
+        /// native language representation of `f64` is different than the wasm
+        /// representation of `f64`.
+        F64FromFloat64 : [1] => [1],
+
+        /// Converts a native wasm `i32` to an interface type `s8`.
+        ///
+        /// This will truncate the upper bits of the `i32`.
+        S8FromI32 : [1] => [1],
+        /// Converts a native wasm `i32` to an interface type `u8`.
+        ///
+        /// This will truncate the upper bits of the `i32`.
+        U8FromI32 : [1] => [1],
+        /// Converts a native wasm `i32` to an interface type `s16`.
+        ///
+        /// This will truncate the upper bits of the `i32`.
+        S16FromI32 : [1] => [1],
+        /// Converts a native wasm `i32` to an interface type `u16`.
+        ///
+        /// This will truncate the upper bits of the `i32`.
+        U16FromI32 : [1] => [1],
+        /// Converts a native wasm `i32` to an interface type `s32`.
+        S32FromI32 : [1] => [1],
+        /// Converts a native wasm `i32` to an interface type `u32`.
+        U32FromI32 : [1] => [1],
+        /// Converts a native wasm `i64` to an interface type `s64`.
+        S64FromI64 : [1] => [1],
+        /// Converts a native wasm `i64` to an interface type `u64`.
+        U64FromI64 : [1] => [1],
+        /// Converts a native wasm `i32` to an interface type `char`.
+        ///
+        /// It's safe to assume that the `i32` is indeed a valid unicode code point.
+        CharFromI32 : [1] => [1],
+        /// Converts a native wasm `f32` to an interface type `f32`.
+        Float32FromF32 : [1] => [1],
+        /// Converts a native wasm `f64` to an interface type `f64`.
+        Float64FromF64 : [1] => [1],
+
+        /// Creates a `bool` from an `i32` input, trapping if the `i32` isn't
+        /// zero or one.
+        BoolFromI32 : [1] => [1],
+        /// Creates an `i32` from a `bool` input, must return 0 or 1.
+        I32FromBool : [1] => [1],
+
+        // lists
+
+        /// Lowers a list where the element's layout in the native language is
+        /// expected to match the canonical ABI definition of interface types.
+        ///
+        /// Pops a list value from the stack and pushes the pointer/length onto
+        /// the stack. If `realloc` is set to `Some` then this is expected to
+        /// *consume* the list which means that the data needs to be copied. An
+        /// allocation/copy is expected when:
+        ///
+        /// * A host is calling a wasm export with a list (it needs to copy the
+        ///   list in to the callee's module, allocating space with `realloc`)
+        /// * A wasm export is returning a list (it's expected to use `realloc`
+        ///   to give ownership of the list to the caller.
+        /// * A host is returning a list in a import definition, meaning that
+        ///   space needs to be allocated in the caller with `realloc`).
+        ///
+        /// A copy does not happen (e.g. `realloc` is `None`) when:
+        ///
+        /// * A wasm module calls an import with the list. In this situation
+        ///   it's expected the caller will know how to access this module's
+        ///   memory (e.g. the host has raw access or wasm-to-wasm communication
+        ///   would copy the list).
+        ///
+        /// If `realloc` is `Some` then the adapter is not responsible for
+        /// cleaning up this list because the other end is receiving the
+        /// allocation. If `realloc` is `None` then the adapter is responsible
+        /// for cleaning up any temporary allocation it created, if any.
+        ListCanonLower {
+            element: &'a Type,
+            realloc: Option<&'a str>,
+        } : [1] => [2],
+
+        /// Same as `ListCanonLower`, but used for strings
+        StringLower {
+            realloc: Option<&'a str>,
+        } : [1] => [2],
+
+        /// Lowers a list where the element's layout in the native language is
+        /// not expected to match the canonical ABI definition of interface
+        /// types.
+        ///
+        /// Pops a list value from the stack and pushes the pointer/length onto
+        /// the stack. This operation also pops a block from the block stack
+        /// which is used as the iteration body of writing each element of the
+        /// list consumed.
+        ///
+        /// The `realloc` field here behaves the same way as `ListCanonLower`.
+        /// It's only set to `None` when a wasm module calls a declared import.
+        /// Otherwise lowering in other contexts requires allocating memory for
+        /// the receiver to own.
+        ListLower {
+            element: &'a Type,
+            realloc: Option<&'a str>,
+        } : [1] => [2],
+
+        /// Lifts a list which has a canonical representation into an interface
+        /// types value.
+        ///
+        /// The term "canonical" representation here means that the
+        /// representation of the interface types value in the native language
+        /// exactly matches the canonical ABI definition of the type.
+        ///
+        /// This will consume two `i32` values from the stack, a pointer and a
+        /// length, and then produces an interface value list.
+        ListCanonLift {
+            element: &'a Type,
+            ty: TypeId,
+        } : [2] => [1],
+
+        /// Same as `ListCanonLift`, but used for strings
+        StringLift : [2] => [1],
+
+        /// Lifts a list which into an interface types value.
+        ///
+        /// This will consume two `i32` values from the stack, a pointer and a
+        /// length, and then produces an interface value list.
+        ///
+        /// This will also pop a block from the block stack which is how to
+        /// read each individual element from the list.
+        ListLift {
+            element: &'a Type,
+            ty: TypeId,
+        } : [2] => [1],
+
+        /// Pushes an operand onto the stack representing the list item from
+        /// each iteration of the list.
+        ///
+        /// This is only used inside of blocks related to lowering lists.
+        IterElem { element: &'a Type } : [0] => [1],
+
+        /// Pushes an operand onto the stack representing the base pointer of
+        /// the next element in a list.
+        ///
+        /// This is used for both lifting and lowering lists.
+        IterBasePointer : [0] => [1],
+
+        // records and tuples
+
+        /// Pops a record value off the stack, decomposes the record to all of
+        /// its fields, and then pushes the fields onto the stack.
+        RecordLower {
+            record: &'a Record,
+            name: &'a str,
+            ty: TypeId,
+        } : [1] => [record.fields.len()],
+
+        /// Pops all fields for a record off the stack and then composes them
+        /// into a record.
+        RecordLift {
+            record: &'a Record,
+            name: &'a str,
+            ty: TypeId,
+        } : [record.fields.len()] => [1],
+
+        /// Create an `i32` from a handle.
+        HandleLower {
+            handle: &'a Handle,
+            name: &'a str,
+            ty: TypeId,
+        } : [1] => [1],
+
+        /// Create a handle from an `i32`.
+        HandleLift {
+            handle: &'a Handle,
+            name: &'a str,
+            ty: TypeId,
+        } : [1] => [1],
+
+        /// Pops a tuple value off the stack, decomposes the tuple to all of
+        /// its fields, and then pushes the fields onto the stack.
+        TupleLower {
+            tuple: &'a Tuple,
+            ty: TypeId,
+        } : [1] => [tuple.types.len()],
+
+        /// Pops all fields for a tuple off the stack and then composes them
+        /// into a tuple.
+        TupleLift {
+            tuple: &'a Tuple,
+            ty: TypeId,
+        } : [tuple.types.len()] => [1],
+
+        /// Converts a language-specific record-of-bools to a list of `i32`.
+        FlagsLower {
+            flags: &'a Flags,
+            name: &'a str,
+            ty: TypeId,
+        } : [1] => [flags.repr().count()],
+        /// Converts a list of native wasm `i32` to a language-specific
+        /// record-of-bools.
+        FlagsLift {
+            flags: &'a Flags,
+            name: &'a str,
+            ty: TypeId,
+        } : [flags.repr().count()] => [1],
+
+        // variants
+
+        /// This is a special instruction used for `VariantLower`
+        /// instruction to determine the name of the payload, if present, to use
+        /// within each block.
+        ///
+        /// Each sub-block will have this be the first instruction, and if it
+        /// lowers a payload it will expect something bound to this name.
+        VariantPayloadName : [0] => [1],
+
+        /// Pops a variant off the stack as well as `ty.cases.len()` blocks
+        /// from the code generator. Uses each of those blocks and the value
+        /// from the stack to produce `nresults` of items.
+        VariantLower {
+            variant: &'a Variant,
+            name: &'a str,
+            ty: TypeId,
+            results: &'a [WasmType],
+        } : [1] => [results.len()],
+
+        /// Pops an `i32` off the stack as well as `ty.cases.len()` blocks
+        /// from the code generator. Uses each of those blocks and the value
+        /// from the stack to produce a final variant.
+        VariantLift {
+            variant: &'a Variant,
+            name: &'a str,
+            ty: TypeId,
+        } : [1] => [1],
+
+        /// Same as `VariantLower`, except used for unions.
+        UnionLower {
+            union: &'a Union,
+            name: &'a str,
+            ty: TypeId,
+            results: &'a [WasmType],
+        } : [1] => [results.len()],
+
+        /// Same as `VariantLift`, except used for unions.
+        UnionLift {
+            union: &'a Union,
+            name: &'a str,
+            ty: TypeId,
+        } : [1] => [1],
+
+        /// Pops an enum off the stack and pushes the `i32` representation.
+        EnumLower {
+            enum_: &'a Enum,
+            name: &'a str,
+            ty: TypeId,
+        } : [1] => [1],
+
+        /// Pops an `i32` off the stack and lifts it into the `enum` specified.
+        EnumLift {
+            enum_: &'a Enum,
+            name: &'a str,
+            ty: TypeId,
+        } : [1] => [1],
+
+        /// Specialization of `VariantLower` for specifically `option<T>` types,
+        /// otherwise behaves the same as `VariantLower` (e.g. two blocks for
+        /// the two cases.
+        OptionLower {
+            payload: &'a Type,
+            ty: TypeId,
+            results: &'a [WasmType],
+        } : [1] => [results.len()],
+
+        /// Specialization of `VariantLift` for specifically the `option<T>`
+        /// type. Otherwise behaves the same as the `VariantLift` instruction
+        /// with two blocks for the lift.
+        OptionLift {
+            payload: &'a Type,
+            ty: TypeId,
+        } : [1] => [1],
+
+        /// Specialization of `VariantLower` for specifically `result<T, E>`
+        /// types, otherwise behaves the same as `VariantLower` (e.g. two blocks
+        /// for the two cases.
+        ResultLower {
+            result: &'a Result_
+            ty: TypeId,
+            results: &'a [WasmType],
+        } : [1] => [results.len()],
+
+        /// Specialization of `VariantLift` for specifically the `result<T,
+        /// E>` type. Otherwise behaves the same as the `VariantLift`
+        /// instruction with two blocks for the lift.
+        ResultLift {
+            result: &'a Result_,
+            ty: TypeId,
+        } : [1] => [1],
+
+        // calling/control flow
+
+        /// Represents a call to a raw WebAssembly API. The module/name are
+        /// provided inline as well as the types if necessary.
+        CallWasm {
+            name: &'a str,
+            sig: &'a WasmSignature,
+        } : [sig.params.len()] => [sig.results.len()],
+
+        /// Same as `CallWasm`, except the dual where an interface is being
+        /// called rather than a raw wasm function.
+        ///
+        /// Note that this will be used for async functions.
+        CallInterface {
+            func: &'a Function,
+        } : [func.params.len()] => [func.results.len()],
+
+        /// Returns `amt` values on the stack. This is always the last
+        /// instruction.
+        Return { amt: usize, func: &'a Function } : [*amt] => [0],
+
+        /// Calls the `realloc` function specified in a malloc-like fashion
+        /// allocating `size` bytes with alignment `align`.
+        ///
+        /// Pushes the returned pointer onto the stack.
+        Malloc {
+            realloc: &'static str,
+            size: usize,
+            align: usize,
+        } : [0] => [1],
+
+        /// Used exclusively for guest-code generation this indicates that
+        /// the standard memory deallocation function needs to be invoked with
+        /// the specified parameters.
+        ///
+        /// This will pop a pointer from the stack and push nothing.
+        GuestDeallocate {
+            size: usize,
+            align: usize,
+        } : [1] => [0],
+
+        /// Used exclusively for guest-code generation this indicates that
+        /// a string is being deallocated. The ptr/length are on the stack and
+        /// are poppped off and used to deallocate the string.
+        GuestDeallocateString : [2] => [0],
+
+        /// Used exclusively for guest-code generation this indicates that
+        /// a list is being deallocated. The ptr/length are on the stack and
+        /// are poppped off and used to deallocate the list.
+        ///
+        /// This variant also pops a block off the block stack to be used as the
+        /// body of the deallocation loop.
+        GuestDeallocateList {
+            element: &'a Type,
+        } : [2] => [0],
+
+        /// Used exclusively for guest-code generation this indicates that
+        /// a variant is being deallocated. The integer discriminant is popped
+        /// off the stack as well as `blocks` number of blocks popped from the
+        /// blocks stack. The variant is used to select, at runtime, which of
+        /// the blocks is executed to deallocate the variant.
+        GuestDeallocateVariant {
+            blocks: usize,
+        } : [1] => [0],
+    }
+}
+
+#[derive(Debug, PartialEq)]
+pub enum Bitcast {
+    // Upcasts
+    F32ToI32,
+    F64ToI64,
+    I32ToI64,
+    F32ToI64,
+
+    // Downcasts
+    I32ToF32,
+    I64ToF64,
+    I64ToI32,
+    I64ToF32,
+
+    None,
+}
+
+/// Whether the glue code surrounding a call is lifting arguments and lowering
+/// results or vice versa.
+#[derive(Clone, Copy, PartialEq, Eq)]
+pub enum LiftLower {
+    /// When the glue code lifts arguments and lowers results.
+    ///
+    /// ```text
+    /// Wasm --lift-args--> SourceLanguage; call; SourceLanguage --lower-results--> Wasm
+    /// ```
+    LiftArgsLowerResults,
+    /// When the glue code lowers arguments and lifts results.
+    ///
+    /// ```text
+    /// SourceLanguage --lower-args--> Wasm; call; Wasm --lift-results--> SourceLanguage
+    /// ```
+    LowerArgsLiftResults,
+}
+
+/// We use a different ABI for wasm importing functions exported by the host
+/// than for wasm exporting functions imported by the host.
+///
+/// Note that this reflects the flavor of ABI we generate, and not necessarily
+/// the way the resulting bindings will be used by end users. See the comments
+/// on the `Direction` enum in gen-core for details.
+///
+/// The bindings ABI has a concept of a "guest" and a "host". There are two
+/// variants of the ABI, one specialized for the "guest" importing and calling
+/// a function defined and exported in the "host", and the other specialized for
+/// the "host" importing and calling a function defined and exported in the "guest".
+#[derive(Clone, Copy, PartialEq, Eq, Debug)]
+pub enum AbiVariant {
+    /// The guest is importing and calling the function.
+    GuestImport,
+    /// The guest is defining and exporting the function.
+    GuestExport,
+}
+
+/// Trait for language implementors to use to generate glue code between native
+/// WebAssembly signatures and interface types signatures.
+///
+/// This is used as an implementation detail in interpreting the ABI between
+/// interface types and wasm types. Eventually this will be driven by interface
+/// types adapters themselves, but for now the ABI of a function dictates what
+/// instructions are fed in.
+///
+/// Types implementing `Bindgen` are incrementally fed `Instruction` values to
+/// generate code for. Instructions operate like a stack machine where each
+/// instruction has a list of inputs and a list of outputs (provided by the
+/// `emit` function).
+pub trait Bindgen {
+    /// The intermediate type for fragments of code for this type.
+    ///
+    /// For most languages `String` is a suitable intermediate type.
+    type Operand: Clone;
+
+    /// Emit code to implement the given instruction.
+    ///
+    /// Each operand is given in `operands` and can be popped off if ownership
+    /// is required. It's guaranteed that `operands` has the appropriate length
+    /// for the `inst` given, as specified with [`Instruction`].
+    ///
+    /// Each result variable should be pushed onto `results`. This function must
+    /// push the appropriate number of results or binding generation will panic.
+    fn emit(
+        &mut self,
+        resolve: &Resolve,
+        inst: &Instruction<'_>,
+        operands: &mut Vec<Self::Operand>,
+        results: &mut Vec<Self::Operand>,
+    );
+
+    /// Gets a operand reference to the return pointer area.
+    ///
+    /// The provided size and alignment is for the function's return type.
+    fn return_pointer(&mut self, size: usize, align: usize) -> Self::Operand;
+
+    /// Enters a new block of code to generate code for.
+    ///
+    /// This is currently exclusively used for constructing variants. When a
+    /// variant is constructed a block here will be pushed for each case of a
+    /// variant, generating the code necessary to translate a variant case.
+    ///
+    /// Blocks are completed with `finish_block` below. It's expected that `emit`
+    /// will always push code (if necessary) into the "current block", which is
+    /// updated by calling this method and `finish_block` below.
+    fn push_block(&mut self);
+
+    /// Indicates to the code generator that a block is completed, and the
+    /// `operand` specified was the resulting value of the block.
+    ///
+    /// This method will be used to compute the value of each arm of lifting a
+    /// variant. The `operand` will be `None` if the variant case didn't
+    /// actually have any type associated with it. Otherwise it will be `Some`
+    /// as the last value remaining on the stack representing the value
+    /// associated with a variant's `case`.
+    ///
+    /// It's expected that this will resume code generation in the previous
+    /// block before `push_block` was called. This must also save the results
+    /// of the current block internally for instructions like `ResultLift` to
+    /// use later.
+    fn finish_block(&mut self, operand: &mut Vec<Self::Operand>);
+
+    /// Returns size information that was previously calculated for all types.
+    fn sizes(&self) -> &crate::sizealign::SizeAlign;
+
+    /// Returns whether or not the specified element type is represented in a
+    /// "canonical" form for lists. This dictates whether the `ListCanonLower`
+    /// and `ListCanonLift` instructions are used or not.
+    fn is_list_canonical(&self, resolve: &Resolve, element: &Type) -> bool;
+}
+
+impl Resolve {
+    /// Get the WebAssembly type signature for this interface function
+    ///
+    /// The first entry returned is the list of parameters and the second entry
+    /// is the list of results for the wasm function signature.
+    pub fn wasm_signature(&self, variant: AbiVariant, func: &Function) -> WasmSignature {
+        const MAX_FLAT_PARAMS: usize = 16;
+        const MAX_FLAT_RESULTS: usize = 1;
+
+        let mut params = Vec::new();
+        let mut indirect_params = false;
+        for (_, param) in func.params.iter() {
+            self.push_wasm(variant, param, &mut params);
+        }
+
+        if params.len() > MAX_FLAT_PARAMS {
+            params.truncate(0);
+            params.push(WasmType::I32);
+            indirect_params = true;
+        }
+
+        let mut results = Vec::new();
+        for ty in func.results.iter_types() {
+            self.push_wasm(variant, ty, &mut results)
+        }
+
+        let mut retptr = false;
+
+        // Rust/C don't support multi-value well right now, so if a function
+        // would have multiple results then instead truncate it. Imports take a
+        // return pointer to write into and exports return a pointer they wrote
+        // into.
+        if results.len() > MAX_FLAT_RESULTS {
+            retptr = true;
+            results.truncate(0);
+            match variant {
+                AbiVariant::GuestImport => {
+                    params.push(WasmType::I32);
+                }
+                AbiVariant::GuestExport => {
+                    results.push(WasmType::I32);
+                }
+            }
+        }
+
+        WasmSignature {
+            params,
+            indirect_params,
+            results,
+            retptr,
+        }
+    }
+
+    fn push_wasm(&self, variant: AbiVariant, ty: &Type, result: &mut Vec<WasmType>) {
+        match ty {
+            Type::Bool
+            | Type::S8
+            | Type::U8
+            | Type::S16
+            | Type::U16
+            | Type::S32
+            | Type::U32
+            | Type::Char => result.push(WasmType::I32),
+
+            Type::U64 | Type::S64 => result.push(WasmType::I64),
+            Type::Float32 => result.push(WasmType::F32),
+            Type::Float64 => result.push(WasmType::F64),
+            Type::String => {
+                result.push(WasmType::I32);
+                result.push(WasmType::I32);
+            }
+
+            Type::Id(id) => match &self.types[*id].kind {
+                TypeDefKind::Type(t) => self.push_wasm(variant, t, result),
+
+                TypeDefKind::Handle(Handle::Own(_) | Handle::Borrow(_)) => {
+                    result.push(WasmType::I32);
+                }
+
+                TypeDefKind::Resource => todo!(),
+
+                TypeDefKind::Record(r) => {
+                    for field in r.fields.iter() {
+                        self.push_wasm(variant, &field.ty, result);
+                    }
+                }
+
+                TypeDefKind::Tuple(t) => {
+                    for ty in t.types.iter() {
+                        self.push_wasm(variant, ty, result);
+                    }
+                }
+
+                TypeDefKind::Flags(r) => {
+                    for _ in 0..r.repr().count() {
+                        result.push(WasmType::I32);
+                    }
+                }
+
+                TypeDefKind::List(_) => {
+                    result.push(WasmType::I32);
+                    result.push(WasmType::I32);
+                }
+
+                TypeDefKind::Variant(v) => {
+                    result.push(v.tag().into());
+                    self.push_wasm_variants(variant, v.cases.iter().map(|c| c.ty.as_ref()), result);
+                }
+
+                TypeDefKind::Enum(e) => result.push(e.tag().into()),
+
+                TypeDefKind::Option(t) => {
+                    result.push(WasmType::I32);
+                    self.push_wasm_variants(variant, [None, Some(t)], result);
+                }
+
+                TypeDefKind::Result(r) => {
+                    result.push(WasmType::I32);
+                    self.push_wasm_variants(variant, [r.ok.as_ref(), r.err.as_ref()], result);
+                }
+
+                TypeDefKind::Union(u) => {
+                    result.push(WasmType::I32);
+                    self.push_wasm_variants(variant, u.cases.iter().map(|c| Some(&c.ty)), result);
+                }
+
+                TypeDefKind::Future(_) => {
+                    result.push(WasmType::I32);
+                }
+
+                TypeDefKind::Stream(_) => {
+                    result.push(WasmType::I32);
+                }
+
+                TypeDefKind::Unknown => unreachable!(),
+            },
+        }
+    }
+
+    fn push_wasm_variants<'a>(
+        &self,
+        variant: AbiVariant,
+        tys: impl IntoIterator<Item = Option<&'a Type>>,
+        result: &mut Vec<WasmType>,
+    ) {
+        let mut temp = Vec::new();
+        let start = result.len();
+
+        // Push each case's type onto a temporary vector, and then
+        // merge that vector into our final list starting at
+        // `start`. Note that this requires some degree of
+        // "unification" so we can handle things like `Result<i32,
+        // f32>` where that turns into `[i32 i32]` where the second
+        // `i32` might be the `f32` bitcasted.
+        for ty in tys {
+            if let Some(ty) = ty {
+                self.push_wasm(variant, ty, &mut temp);
+
+                for (i, ty) in temp.drain(..).enumerate() {
+                    match result.get_mut(start + i) {
+                        Some(prev) => *prev = join(*prev, ty),
+                        None => result.push(ty),
+                    }
+                }
+            }
+        }
+    }
+
+    /// Generates an abstract sequence of instructions which represents this
+    /// function being adapted as an imported function.
+    ///
+    /// The instructions here, when executed, will emulate a language with
+    /// interface types calling the concrete wasm implementation. The parameters
+    /// for the returned instruction sequence are the language's own
+    /// interface-types parameters. One instruction in the instruction stream
+    /// will be a `Call` which represents calling the actual raw wasm function
+    /// signature.
+    ///
+    /// This function is useful, for example, if you're building a language
+    /// generator for WASI bindings. This will document how to translate
+    /// language-specific values into the wasm types to call a WASI function,
+    /// and it will also automatically convert the results of the WASI function
+    /// back to a language-specific value.
+    pub fn call(
+        &self,
+        variant: AbiVariant,
+        lift_lower: LiftLower,
+        func: &Function,
+        bindgen: &mut impl Bindgen,
+    ) {
+        Generator::new(self, variant, lift_lower, bindgen).call(func);
+    }
+
+    /// Returns whether the `Function` specified needs a post-return function to
+    /// be generated in guest code.
+    ///
+    /// This is used when the return value contains a memory allocation such as
+    /// a list or a string primarily.
+    pub fn guest_export_needs_post_return(&self, func: &Function) -> bool {
+        func.results.iter_types().any(|t| self.needs_post_return(t))
+    }
+
+    fn needs_post_return(&self, ty: &Type) -> bool {
+        match ty {
+            Type::String => true,
+            Type::Id(id) => match &self.types[*id].kind {
+                TypeDefKind::List(_) => true,
+                TypeDefKind::Type(t) => self.needs_post_return(t),
+                TypeDefKind::Handle(_) => false,
+                TypeDefKind::Resource => false,
+                TypeDefKind::Record(r) => r.fields.iter().any(|f| self.needs_post_return(&f.ty)),
+                TypeDefKind::Tuple(t) => t.types.iter().any(|t| self.needs_post_return(t)),
+                TypeDefKind::Union(t) => t.cases.iter().any(|t| self.needs_post_return(&t.ty)),
+                TypeDefKind::Variant(t) => t
+                    .cases
+                    .iter()
+                    .filter_map(|t| t.ty.as_ref())
+                    .any(|t| self.needs_post_return(t)),
+                TypeDefKind::Option(t) => self.needs_post_return(t),
+                TypeDefKind::Result(t) => [&t.ok, &t.err]
+                    .iter()
+                    .filter_map(|t| t.as_ref())
+                    .any(|t| self.needs_post_return(t)),
+                TypeDefKind::Flags(_) | TypeDefKind::Enum(_) => false,
+                TypeDefKind::Future(_) | TypeDefKind::Stream(_) => unimplemented!(),
+                TypeDefKind::Unknown => unreachable!(),
+            },
+
+            Type::Bool
+            | Type::U8
+            | Type::S8
+            | Type::U16
+            | Type::S16
+            | Type::U32
+            | Type::S32
+            | Type::U64
+            | Type::S64
+            | Type::Float32
+            | Type::Float64
+            | Type::Char => false,
+        }
+    }
+
+    /// Used in a similar manner as the `Interface::call` function except is
+    /// used to generate the `post-return` callback for `func`.
+    ///
+    /// This is only intended to be used in guest generators for exported
+    /// functions and will primarily generate `GuestDeallocate*` instructions,
+    /// plus others used as input to those instructions.
+    pub fn post_return(&self, func: &Function, bindgen: &mut impl Bindgen) {
+        Generator::new(
+            self,
+            AbiVariant::GuestExport,
+            LiftLower::LiftArgsLowerResults,
+            bindgen,
+        )
+        .post_return(func);
+    }
+}
+
+struct Generator<'a, B: Bindgen> {
+    variant: AbiVariant,
+    lift_lower: LiftLower,
+    bindgen: &'a mut B,
+    resolve: &'a Resolve,
+    operands: Vec<B::Operand>,
+    results: Vec<B::Operand>,
+    stack: Vec<B::Operand>,
+    return_pointer: Option<B::Operand>,
+}
+
+impl<'a, B: Bindgen> Generator<'a, B> {
+    fn new(
+        resolve: &'a Resolve,
+        variant: AbiVariant,
+        lift_lower: LiftLower,
+        bindgen: &'a mut B,
+    ) -> Generator<'a, B> {
+        Generator {
+            resolve,
+            variant,
+            lift_lower,
+            bindgen,
+            operands: Vec::new(),
+            results: Vec::new(),
+            stack: Vec::new(),
+            return_pointer: None,
+        }
+    }
+
+    fn call(&mut self, func: &Function) {
+        let sig = self.resolve.wasm_signature(self.variant, func);
+
+        match self.lift_lower {
+            LiftLower::LowerArgsLiftResults => {
+                if !sig.indirect_params {
+                    // If the parameters for this function aren't indirect
+                    // (there aren't too many) then we simply do a normal lower
+                    // operation for them all.
+                    for (nth, (_, ty)) in func.params.iter().enumerate() {
+                        self.emit(&Instruction::GetArg { nth });
+                        self.lower(ty);
+                    }
+                } else {
+                    // ... otherwise if parameters are indirect space is
+                    // allocated from them and each argument is lowered
+                    // individually into memory.
+                    let (size, align) = self
+                        .bindgen
+                        .sizes()
+                        .record(func.params.iter().map(|t| &t.1));
+                    let ptr = match self.variant {
+                        // When a wasm module calls an import it will provide
+                        // space that isn't explicitly deallocated.
+                        AbiVariant::GuestImport => self.bindgen.return_pointer(size, align),
+                        // When calling a wasm module from the outside, though,
+                        // malloc needs to be called.
+                        AbiVariant::GuestExport => {
+                            self.emit(&Instruction::Malloc {
+                                realloc: "cabi_realloc",
+                                size,
+                                align,
+                            });
+                            self.stack.pop().unwrap()
+                        }
+                    };
+                    let mut offset = 0usize;
+                    for (nth, (_, ty)) in func.params.iter().enumerate() {
+                        self.emit(&Instruction::GetArg { nth });
+                        offset = align_to(offset, self.bindgen.sizes().align(ty));
+                        self.write_to_memory(ty, ptr.clone(), offset as i32);
+                        offset += self.bindgen.sizes().size(ty);
+                    }
+
+                    self.stack.push(ptr);
+                }
+
+                // If necessary we may need to prepare a return pointer for
+                // this ABI.
+                if self.variant == AbiVariant::GuestImport && sig.retptr {
+                    let (size, align) = self.bindgen.sizes().params(func.results.iter_types());
+                    let ptr = self.bindgen.return_pointer(size, align);
+                    self.return_pointer = Some(ptr.clone());
+                    self.stack.push(ptr);
+                }
+
+                // Now that all the wasm args are prepared we can call the
+                // actual wasm function.
+                assert_eq!(self.stack.len(), sig.params.len());
+                self.emit(&Instruction::CallWasm {
+                    name: &func.name,
+                    sig: &sig,
+                });
+
+                if !sig.retptr {
+                    // With no return pointer in use we can simply lift the
+                    // result(s) of the function from the result of the core
+                    // wasm function.
+                    for ty in func.results.iter_types() {
+                        self.lift(ty)
+                    }
+                } else {
+                    let ptr = match self.variant {
+                        // imports into guests means it's a wasm module
+                        // calling an imported function. We supplied the
+                        // return poitner as the last argument (saved in
+                        // `self.return_pointer`) so we use that to read
+                        // the result of the function from memory.
+                        AbiVariant::GuestImport => {
+                            assert!(sig.results.len() == 0);
+                            self.return_pointer.take().unwrap()
+                        }
+
+                        // guest exports means that this is a host
+                        // calling wasm so wasm returned a pointer to where
+                        // the result is stored
+                        AbiVariant::GuestExport => self.stack.pop().unwrap(),
+                    };
+
+                    self.read_results_from_memory(&func.results, ptr, 0);
+                }
+
+                self.emit(&Instruction::Return {
+                    func,
+                    amt: func.results.len(),
+                });
+            }
+            LiftLower::LiftArgsLowerResults => {
+                if !sig.indirect_params {
+                    // If parameters are not passed indirectly then we lift each
+                    // argument in succession from the component wasm types that
+                    // make-up the type.
+                    let mut offset = 0;
+                    let mut temp = Vec::new();
+                    for (_, ty) in func.params.iter() {
+                        temp.truncate(0);
+                        self.resolve.push_wasm(self.variant, ty, &mut temp);
+                        for _ in 0..temp.len() {
+                            self.emit(&Instruction::GetArg { nth: offset });
+                            offset += 1;
+                        }
+                        self.lift(ty);
+                    }
+                } else {
+                    // ... otherwise argument is read in succession from memory
+                    // where the pointer to the arguments is the first argument
+                    // to the function.
+                    let mut offset = 0usize;
+                    self.emit(&Instruction::GetArg { nth: 0 });
+                    let ptr = self.stack.pop().unwrap();
+                    for (_, ty) in func.params.iter() {
+                        offset = align_to(offset, self.bindgen.sizes().align(ty));
+                        self.read_from_memory(ty, ptr.clone(), offset as i32);
+                        offset += self.bindgen.sizes().size(ty);
+                    }
+                }
+
+                // ... and that allows us to call the interface types function
+                self.emit(&Instruction::CallInterface { func });
+
+                // This was dynamically allocated by the caller so after
+                // it's been read by the guest we need to deallocate it.
+                if let AbiVariant::GuestExport = self.variant {
+                    if sig.indirect_params {
+                        let (size, align) = self
+                            .bindgen
+                            .sizes()
+                            .record(func.params.iter().map(|t| &t.1));
+                        self.emit(&Instruction::GetArg { nth: 0 });
+                        self.emit(&Instruction::GuestDeallocate { size, align });
+                    }
+                }
+
+                if !sig.retptr {
+                    // With no return pointer in use we simply lower the
+                    // result(s) and return that directly from the function.
+                    let results = self
+                        .stack
+                        .drain(self.stack.len() - func.results.len()..)
+                        .collect::<Vec<_>>();
+                    for (ty, result) in func.results.iter_types().zip(results) {
+                        self.stack.push(result);
+                        self.lower(ty);
+                    }
+                } else {
+                    match self.variant {
+                        // When a function is imported to a guest this means
+                        // it's a host providing the implementation of the
+                        // import. The result is stored in the pointer
+                        // specified in the last argument, so we get the
+                        // pointer here and then write the return value into
+                        // it.
+                        AbiVariant::GuestImport => {
+                            self.emit(&Instruction::GetArg {
+                                nth: sig.params.len() - 1,
+                            });
+                            let ptr = self.stack.pop().unwrap();
+                            self.write_params_to_memory(func.results.iter_types(), ptr, 0);
+                        }
+
+                        // For a guest import this is a function defined in
+                        // wasm, so we're returning a pointer where the
+                        // value was stored at. Allocate some space here
+                        // (statically) and then write the result into that
+                        // memory, returning the pointer at the end.
+                        AbiVariant::GuestExport => {
+                            let (size, align) =
+                                self.bindgen.sizes().params(func.results.iter_types());
+                            let ptr = self.bindgen.return_pointer(size, align);
+                            self.write_params_to_memory(func.results.iter_types(), ptr.clone(), 0);
+                            self.stack.push(ptr);
+                        }
+                    }
+                }
+
+                self.emit(&Instruction::Return {
+                    func,
+                    amt: sig.results.len(),
+                });
+            }
+        }
+
+        assert!(
+            self.stack.is_empty(),
+            "stack has {} items remaining",
+            self.stack.len()
+        );
+    }
+
+    fn post_return(&mut self, func: &Function) {
+        let sig = self.resolve.wasm_signature(self.variant, func);
+
+        // Currently post-return is only used for lists and lists are always
+        // returned indirectly through memory due to their flat representation
+        // having more than one type. Assert that a return pointer is used,
+        // though, in case this ever changes.
+        assert!(sig.retptr);
+
+        self.emit(&Instruction::GetArg { nth: 0 });
+        let addr = self.stack.pop().unwrap();
+        for (offset, ty) in self
+            .bindgen
+            .sizes()
+            .field_offsets(func.results.iter_types())
+        {
+            let offset = i32::try_from(offset).unwrap();
+            self.deallocate(ty, addr.clone(), offset);
+        }
+        self.emit(&Instruction::Return { func, amt: 0 });
+
+        assert!(
+            self.stack.is_empty(),
+            "stack has {} items remaining",
+            self.stack.len()
+        );
+    }
+
+    fn emit(&mut self, inst: &Instruction<'_>) {
+        self.operands.clear();
+        self.results.clear();
+
+        let operands_len = inst.operands_len();
+        assert!(
+            self.stack.len() >= operands_len,
+            "not enough operands on stack for {:?}",
+            inst
+        );
+        self.operands
+            .extend(self.stack.drain((self.stack.len() - operands_len)..));
+        self.results.reserve(inst.results_len());
+
+        self.bindgen
+            .emit(self.resolve, inst, &mut self.operands, &mut self.results);
+
+        assert_eq!(
+            self.results.len(),
+            inst.results_len(),
+            "{:?} expected {} results, got {}",
+            inst,
+            inst.results_len(),
+            self.results.len()
+        );
+        self.stack.append(&mut self.results);
+    }
+
+    fn push_block(&mut self) {
+        self.bindgen.push_block();
+    }
+
+    fn finish_block(&mut self, size: usize) {
+        self.operands.clear();
+        assert!(
+            size <= self.stack.len(),
+            "not enough operands on stack for finishing block",
+        );
+        self.operands
+            .extend(self.stack.drain((self.stack.len() - size)..));
+        self.bindgen.finish_block(&mut self.operands);
+    }
+
+    fn lower(&mut self, ty: &Type) {
+        use Instruction::*;
+
+        match *ty {
+            Type::Bool => self.emit(&I32FromBool),
+            Type::S8 => self.emit(&I32FromS8),
+            Type::U8 => self.emit(&I32FromU8),
+            Type::S16 => self.emit(&I32FromS16),
+            Type::U16 => self.emit(&I32FromU16),
+            Type::S32 => self.emit(&I32FromS32),
+            Type::U32 => self.emit(&I32FromU32),
+            Type::S64 => self.emit(&I64FromS64),
+            Type::U64 => self.emit(&I64FromU64),
+            Type::Char => self.emit(&I32FromChar),
+            Type::Float32 => self.emit(&F32FromFloat32),
+            Type::Float64 => self.emit(&F64FromFloat64),
+            Type::String => {
+                let realloc = self.list_realloc();
+                self.emit(&StringLower { realloc });
+            }
+            Type::Id(id) => match &self.resolve.types[id].kind {
+                TypeDefKind::Type(t) => self.lower(t),
+                TypeDefKind::List(element) => {
+                    let realloc = self.list_realloc();
+                    if self.bindgen.is_list_canonical(self.resolve, element) {
+                        self.emit(&ListCanonLower { element, realloc });
+                    } else {
+                        self.push_block();
+                        self.emit(&IterElem { element });
+                        self.emit(&IterBasePointer);
+                        let addr = self.stack.pop().unwrap();
+                        self.write_to_memory(element, addr, 0);
+                        self.finish_block(0);
+                        self.emit(&ListLower { element, realloc });
+                    }
+                }
+                TypeDefKind::Handle(handle) => {
+                    let (Handle::Own(ty) | Handle::Borrow(ty)) = handle;
+                    self.emit(&HandleLower {
+                        handle,
+                        ty: id,
+                        name: self.resolve.types[*ty].name.as_deref().unwrap(),
+                    });
+                }
+                TypeDefKind::Resource => {
+                    todo!();
+                }
+                TypeDefKind::Record(record) => {
+                    self.emit(&RecordLower {
+                        record,
+                        ty: id,
+                        name: self.resolve.types[id].name.as_deref().unwrap(),
+                    });
+                    let values = self
+                        .stack
+                        .drain(self.stack.len() - record.fields.len()..)
+                        .collect::<Vec<_>>();
+                    for (field, value) in record.fields.iter().zip(values) {
+                        self.stack.push(value);
+                        self.lower(&field.ty);
+                    }
+                }
+                TypeDefKind::Tuple(tuple) => {
+                    self.emit(&TupleLower { tuple, ty: id });
+                    let values = self
+                        .stack
+                        .drain(self.stack.len() - tuple.types.len()..)
+                        .collect::<Vec<_>>();
+                    for (ty, value) in tuple.types.iter().zip(values) {
+                        self.stack.push(value);
+                        self.lower(ty);
+                    }
+                }
+
+                TypeDefKind::Flags(flags) => {
+                    self.emit(&FlagsLower {
+                        flags,
+                        ty: id,
+                        name: self.resolve.types[id].name.as_ref().unwrap(),
+                    });
+                }
+
+                TypeDefKind::Variant(v) => {
+                    let results =
+                        self.lower_variant_arms(ty, v.cases.iter().map(|c| c.ty.as_ref()));
+                    self.emit(&VariantLower {
+                        variant: v,
+                        ty: id,
+                        results: &results,
+                        name: self.resolve.types[id].name.as_deref().unwrap(),
+                    });
+                }
+                TypeDefKind::Enum(enum_) => {
+                    self.emit(&EnumLower {
+                        enum_,
+                        ty: id,
+                        name: self.resolve.types[id].name.as_deref().unwrap(),
+                    });
+                }
+                TypeDefKind::Option(t) => {
+                    let results = self.lower_variant_arms(ty, [None, Some(t)]);
+                    self.emit(&OptionLower {
+                        payload: t,
+                        ty: id,
+                        results: &results,
+                    });
+                }
+                TypeDefKind::Result(r) => {
+                    let results = self.lower_variant_arms(ty, [r.ok.as_ref(), r.err.as_ref()]);
+                    self.emit(&ResultLower {
+                        result: r,
+                        ty: id,
+                        results: &results,
+                    });
+                }
+                TypeDefKind::Union(union) => {
+                    let results =
+                        self.lower_variant_arms(ty, union.cases.iter().map(|c| Some(&c.ty)));
+                    self.emit(&UnionLower {
+                        union,
+                        ty: id,
+                        results: &results,
+                        name: self.resolve.types[id].name.as_deref().unwrap(),
+                    });
+                }
+                TypeDefKind::Future(_) => todo!("lower future"),
+                TypeDefKind::Stream(_) => todo!("lower stream"),
+                TypeDefKind::Unknown => unreachable!(),
+            },
+        }
+    }
+
+    fn lower_variant_arms<'b>(
+        &mut self,
+        ty: &Type,
+        cases: impl IntoIterator<Item = Option<&'b Type>>,
+    ) -> Vec<WasmType> {
+        use Instruction::*;
+        let mut results = Vec::new();
+        let mut temp = Vec::new();
+        let mut casts = Vec::new();
+        self.resolve.push_wasm(self.variant, ty, &mut results);
+        for (i, ty) in cases.into_iter().enumerate() {
+            self.push_block();
+            self.emit(&VariantPayloadName);
+            let payload_name = self.stack.pop().unwrap();
+            self.emit(&I32Const { val: i as i32 });
+            let mut pushed = 1;
+            if let Some(ty) = ty {
+                // Using the payload of this block we lower the type to
+                // raw wasm values.
+                self.stack.push(payload_name);
+                self.lower(ty);
+
+                // Determine the types of all the wasm values we just
+                // pushed, and record how many. If we pushed too few
+                // then we'll need to push some zeros after this.
+                temp.truncate(0);
+                self.resolve.push_wasm(self.variant, ty, &mut temp);
+                pushed += temp.len();
+
+                // For all the types pushed we may need to insert some
+                // bitcasts. This will go through and cast everything
+                // to the right type to ensure all blocks produce the
+                // same set of results.
+                casts.truncate(0);
+                for (actual, expected) in temp.iter().zip(&results[1..]) {
+                    casts.push(cast(*actual, *expected));
+                }
+                if casts.iter().any(|c| *c != Bitcast::None) {
+                    self.emit(&Bitcasts { casts: &casts });
+                }
+            }
+
+            // If we haven't pushed enough items in this block to match
+            // what other variants are pushing then we need to push
+            // some zeros.
+            if pushed < results.len() {
+                self.emit(&ConstZero {
+                    tys: &results[pushed..],
+                });
+            }
+            self.finish_block(results.len());
+        }
+        results
+    }
+
+    fn list_realloc(&self) -> Option<&'static str> {
+        // Lowering parameters calling a wasm import means
+        // we don't need to pass ownership, but we pass
+        // ownership in all other cases.
+        match (self.variant, self.lift_lower) {
+            (AbiVariant::GuestImport, LiftLower::LowerArgsLiftResults) => None,
+            _ => Some("cabi_realloc"),
+        }
+    }
+
+    /// Note that in general everything in this function is the opposite of the
+    /// `lower` function above. This is intentional and should be kept this way!
+    fn lift(&mut self, ty: &Type) {
+        use Instruction::*;
+
+        match *ty {
+            Type::Bool => self.emit(&BoolFromI32),
+            Type::S8 => self.emit(&S8FromI32),
+            Type::U8 => self.emit(&U8FromI32),
+            Type::S16 => self.emit(&S16FromI32),
+            Type::U16 => self.emit(&U16FromI32),
+            Type::S32 => self.emit(&S32FromI32),
+            Type::U32 => self.emit(&U32FromI32),
+            Type::S64 => self.emit(&S64FromI64),
+            Type::U64 => self.emit(&U64FromI64),
+            Type::Char => self.emit(&CharFromI32),
+            Type::Float32 => self.emit(&Float32FromF32),
+            Type::Float64 => self.emit(&Float64FromF64),
+            Type::String => self.emit(&StringLift),
+            Type::Id(id) => match &self.resolve.types[id].kind {
+                TypeDefKind::Type(t) => self.lift(t),
+                TypeDefKind::List(element) => {
+                    if self.bindgen.is_list_canonical(self.resolve, element) {
+                        self.emit(&ListCanonLift { element, ty: id });
+                    } else {
+                        self.push_block();
+                        self.emit(&IterBasePointer);
+                        let addr = self.stack.pop().unwrap();
+                        self.read_from_memory(element, addr, 0);
+                        self.finish_block(1);
+                        self.emit(&ListLift { element, ty: id });
+                    }
+                }
+                TypeDefKind::Handle(handle) => {
+                    let (Handle::Own(ty) | Handle::Borrow(ty)) = handle;
+                    self.emit(&HandleLift {
+                        handle,
+                        ty: id,
+                        name: self.resolve.types[*ty].name.as_deref().unwrap(),
+                    });
+                }
+                TypeDefKind::Resource => {
+                    todo!();
+                }
+                TypeDefKind::Record(record) => {
+                    let mut temp = Vec::new();
+                    self.resolve.push_wasm(self.variant, ty, &mut temp);
+                    let mut args = self
+                        .stack
+                        .drain(self.stack.len() - temp.len()..)
+                        .collect::<Vec<_>>();
+                    for field in record.fields.iter() {
+                        temp.truncate(0);
+                        self.resolve.push_wasm(self.variant, &field.ty, &mut temp);
+                        self.stack.extend(args.drain(..temp.len()));
+                        self.lift(&field.ty);
+                    }
+                    self.emit(&RecordLift {
+                        record,
+                        ty: id,
+                        name: self.resolve.types[id].name.as_deref().unwrap(),
+                    });
+                }
+                TypeDefKind::Tuple(tuple) => {
+                    let mut temp = Vec::new();
+                    self.resolve.push_wasm(self.variant, ty, &mut temp);
+                    let mut args = self
+                        .stack
+                        .drain(self.stack.len() - temp.len()..)
+                        .collect::<Vec<_>>();
+                    for ty in tuple.types.iter() {
+                        temp.truncate(0);
+                        self.resolve.push_wasm(self.variant, ty, &mut temp);
+                        self.stack.extend(args.drain(..temp.len()));
+                        self.lift(ty);
+                    }
+                    self.emit(&TupleLift { tuple, ty: id });
+                }
+                TypeDefKind::Flags(flags) => {
+                    self.emit(&FlagsLift {
+                        flags,
+                        ty: id,
+                        name: self.resolve.types[id].name.as_ref().unwrap(),
+                    });
+                }
+
+                TypeDefKind::Variant(v) => {
+                    self.lift_variant_arms(ty, v.cases.iter().map(|c| c.ty.as_ref()));
+                    self.emit(&VariantLift {
+                        variant: v,
+                        ty: id,
+                        name: self.resolve.types[id].name.as_deref().unwrap(),
+                    });
+                }
+
+                TypeDefKind::Enum(enum_) => {
+                    self.emit(&EnumLift {
+                        enum_,
+                        ty: id,
+                        name: self.resolve.types[id].name.as_deref().unwrap(),
+                    });
+                }
+
+                TypeDefKind::Option(t) => {
+                    self.lift_variant_arms(ty, [None, Some(t)]);
+                    self.emit(&OptionLift { payload: t, ty: id });
+                }
+
+                TypeDefKind::Result(r) => {
+                    self.lift_variant_arms(ty, [r.ok.as_ref(), r.err.as_ref()]);
+                    self.emit(&ResultLift { result: r, ty: id });
+                }
+
+                TypeDefKind::Union(union) => {
+                    self.lift_variant_arms(ty, union.cases.iter().map(|c| Some(&c.ty)));
+                    self.emit(&UnionLift {
+                        union,
+                        ty: id,
+                        name: self.resolve.types[id].name.as_deref().unwrap(),
+                    });
+                }
+
+                TypeDefKind::Future(_) => todo!("lift future"),
+                TypeDefKind::Stream(_) => todo!("lift stream"),
+                TypeDefKind::Unknown => unreachable!(),
+            },
+        }
+    }
+
+    fn lift_variant_arms<'b>(
+        &mut self,
+        ty: &Type,
+        cases: impl IntoIterator<Item = Option<&'b Type>>,
+    ) {
+        let mut params = Vec::new();
+        let mut temp = Vec::new();
+        let mut casts = Vec::new();
+        self.resolve.push_wasm(self.variant, ty, &mut params);
+        let block_inputs = self
+            .stack
+            .drain(self.stack.len() + 1 - params.len()..)
+            .collect::<Vec<_>>();
+        for ty in cases {
+            self.push_block();
+            if let Some(ty) = ty {
+                // Push only the values we need for this variant onto
+                // the stack.
+                temp.truncate(0);
+                self.resolve.push_wasm(self.variant, ty, &mut temp);
+                self.stack
+                    .extend(block_inputs[..temp.len()].iter().cloned());
+
+                // Cast all the types we have on the stack to the actual
+                // types needed for this variant, if necessary.
+                casts.truncate(0);
+                for (actual, expected) in temp.iter().zip(&params[1..]) {
+                    casts.push(cast(*expected, *actual));
+                }
+                if casts.iter().any(|c| *c != Bitcast::None) {
+                    self.emit(&Instruction::Bitcasts { casts: &casts });
+                }
+
+                // Then recursively lift this variant's payload.
+                self.lift(ty);
+            }
+            self.finish_block(ty.is_some() as usize);
+        }
+    }
+
+    fn write_to_memory(&mut self, ty: &Type, addr: B::Operand, offset: i32) {
+        use Instruction::*;
+
+        match *ty {
+            // Builtin types need different flavors of storage instructions
+            // depending on the size of the value written.
+            Type::Bool | Type::U8 | Type::S8 => {
+                self.lower_and_emit(ty, addr, &I32Store8 { offset })
+            }
+            Type::U16 | Type::S16 => self.lower_and_emit(ty, addr, &I32Store16 { offset }),
+            Type::U32 | Type::S32 | Type::Char => {
+                self.lower_and_emit(ty, addr, &I32Store { offset })
+            }
+            Type::U64 | Type::S64 => self.lower_and_emit(ty, addr, &I64Store { offset }),
+            Type::Float32 => self.lower_and_emit(ty, addr, &F32Store { offset }),
+            Type::Float64 => self.lower_and_emit(ty, addr, &F64Store { offset }),
+            Type::String => self.write_list_to_memory(ty, addr, offset),
+
+            Type::Id(id) => match &self.resolve.types[id].kind {
+                TypeDefKind::Type(t) => self.write_to_memory(t, addr, offset),
+                TypeDefKind::List(_) => self.write_list_to_memory(ty, addr, offset),
+
+                TypeDefKind::Handle(_) => self.lower_and_emit(ty, addr, &I32Store { offset }),
+
+                // Decompose the record into its components and then write all
+                // the components into memory one-by-one.
+                TypeDefKind::Record(record) => {
+                    self.emit(&RecordLower {
+                        record,
+                        ty: id,
+                        name: self.resolve.types[id].name.as_deref().unwrap(),
+                    });
+                    self.write_fields_to_memory(record.fields.iter().map(|f| &f.ty), addr, offset);
+                }
+                TypeDefKind::Resource => {
+                    todo!()
+                }
+                TypeDefKind::Tuple(tuple) => {
+                    self.emit(&TupleLower { tuple, ty: id });
+                    self.write_fields_to_memory(tuple.types.iter(), addr, offset);
+                }
+
+                TypeDefKind::Flags(f) => {
+                    self.lower(ty);
+                    match f.repr() {
+                        FlagsRepr::U8 => {
+                            self.stack.push(addr);
+                            self.store_intrepr(offset, Int::U8);
+                        }
+                        FlagsRepr::U16 => {
+                            self.stack.push(addr);
+                            self.store_intrepr(offset, Int::U16);
+                        }
+                        FlagsRepr::U32(n) => {
+                            for i in (0..n).rev() {
+                                self.stack.push(addr.clone());
+                                self.emit(&I32Store {
+                                    offset: offset + (i as i32) * 4,
+                                });
+                            }
+                        }
+                    }
+                }
+
+                // Each case will get its own block, and the first item in each
+                // case is writing the discriminant. After that if we have a
+                // payload we write the payload after the discriminant, aligned up
+                // to the type's alignment.
+                TypeDefKind::Variant(v) => {
+                    self.write_variant_arms_to_memory(
+                        offset,
+                        addr,
+                        v.tag(),
+                        v.cases.iter().map(|c| c.ty.as_ref()),
+                    );
+                    self.emit(&VariantLower {
+                        variant: v,
+                        ty: id,
+                        results: &[],
+                        name: self.resolve.types[id].name.as_deref().unwrap(),
+                    });
+                }
+
+                TypeDefKind::Option(t) => {
+                    self.write_variant_arms_to_memory(offset, addr, Int::U8, [None, Some(t)]);
+                    self.emit(&OptionLower {
+                        payload: t,
+                        ty: id,
+                        results: &[],
+                    });
+                }
+
+                TypeDefKind::Result(r) => {
+                    self.write_variant_arms_to_memory(
+                        offset,
+                        addr,
+                        Int::U8,
+                        [r.ok.as_ref(), r.err.as_ref()],
+                    );
+                    self.emit(&ResultLower {
+                        result: r,
+                        ty: id,
+                        results: &[],
+                    });
+                }
+
+                TypeDefKind::Enum(e) => {
+                    self.lower(ty);
+                    self.stack.push(addr);
+                    self.store_intrepr(offset, e.tag());
+                }
+
+                TypeDefKind::Union(union) => {
+                    self.write_variant_arms_to_memory(
+                        offset,
+                        addr,
+                        union.tag(),
+                        union.cases.iter().map(|c| Some(&c.ty)),
+                    );
+                    self.emit(&UnionLower {
+                        union,
+                        ty: id,
+                        results: &[],
+                        name: self.resolve.types[id].name.as_deref().unwrap(),
+                    });
+                }
+
+                TypeDefKind::Future(_) => todo!("write future to memory"),
+                TypeDefKind::Stream(_) => todo!("write stream to memory"),
+                TypeDefKind::Unknown => unreachable!(),
+            },
+        }
+    }
+
+    fn write_params_to_memory<'b>(
+        &mut self,
+        params: impl IntoIterator<Item = &'b Type> + ExactSizeIterator,
+        addr: B::Operand,
+        offset: i32,
+    ) {
+        self.write_fields_to_memory(params, addr, offset);
+    }
+
+    fn write_variant_arms_to_memory<'b>(
+        &mut self,
+        offset: i32,
+        addr: B::Operand,
+        tag: Int,
+        cases: impl IntoIterator<Item = Option<&'b Type>> + Clone,
+    ) {
+        let payload_offset =
+            offset + (self.bindgen.sizes().payload_offset(tag, cases.clone()) as i32);
+        for (i, ty) in cases.into_iter().enumerate() {
+            self.push_block();
+            self.emit(&Instruction::VariantPayloadName);
+            let payload_name = self.stack.pop().unwrap();
+            self.emit(&Instruction::I32Const { val: i as i32 });
+            self.stack.push(addr.clone());
+            self.store_intrepr(offset, tag);
+            if let Some(ty) = ty {
+                self.stack.push(payload_name.clone());
+                self.write_to_memory(ty, addr.clone(), payload_offset);
+            }
+            self.finish_block(0);
+        }
+    }
+
+    fn write_list_to_memory(&mut self, ty: &Type, addr: B::Operand, offset: i32) {
+        // After lowering the list there's two i32 values on the stack
+        // which we write into memory, writing the pointer into the low address
+        // and the length into the high address.
+        self.lower(ty);
+        self.stack.push(addr.clone());
+        self.emit(&Instruction::I32Store { offset: offset + 4 });
+        self.stack.push(addr);
+        self.emit(&Instruction::I32Store { offset });
+    }
+
+    fn write_fields_to_memory<'b>(
+        &mut self,
+        tys: impl IntoIterator<Item = &'b Type> + ExactSizeIterator,
+        addr: B::Operand,
+        offset: i32,
+    ) {
+        let fields = self
+            .stack
+            .drain(self.stack.len() - tys.len()..)
+            .collect::<Vec<_>>();
+        for ((field_offset, ty), op) in self
+            .bindgen
+            .sizes()
+            .field_offsets(tys)
+            .into_iter()
+            .zip(fields)
+        {
+            self.stack.push(op);
+            self.write_to_memory(ty, addr.clone(), offset + (field_offset as i32));
+        }
+    }
+
+    fn lower_and_emit(&mut self, ty: &Type, addr: B::Operand, instr: &Instruction) {
+        self.lower(ty);
+        self.stack.push(addr);
+        self.emit(instr);
+    }
+
+    fn read_from_memory(&mut self, ty: &Type, addr: B::Operand, offset: i32) {
+        use Instruction::*;
+
+        match *ty {
+            Type::Bool => self.emit_and_lift(ty, addr, &I32Load8U { offset }),
+            Type::U8 => self.emit_and_lift(ty, addr, &I32Load8U { offset }),
+            Type::S8 => self.emit_and_lift(ty, addr, &I32Load8S { offset }),
+            Type::U16 => self.emit_and_lift(ty, addr, &I32Load16U { offset }),
+            Type::S16 => self.emit_and_lift(ty, addr, &I32Load16S { offset }),
+            Type::U32 | Type::S32 | Type::Char => self.emit_and_lift(ty, addr, &I32Load { offset }),
+            Type::U64 | Type::S64 => self.emit_and_lift(ty, addr, &I64Load { offset }),
+            Type::Float32 => self.emit_and_lift(ty, addr, &F32Load { offset }),
+            Type::Float64 => self.emit_and_lift(ty, addr, &F64Load { offset }),
+            Type::String => self.read_list_from_memory(ty, addr, offset),
+
+            Type::Id(id) => match &self.resolve.types[id].kind {
+                TypeDefKind::Type(t) => self.read_from_memory(t, addr, offset),
+
+                TypeDefKind::List(_) => self.read_list_from_memory(ty, addr, offset),
+
+                TypeDefKind::Handle(_) => self.emit_and_lift(ty, addr, &I32Load { offset }),
+
+                TypeDefKind::Resource => {
+                    todo!();
+                }
+
+                // Read and lift each field individually, adjusting the offset
+                // as we go along, then aggregate all the fields into the
+                // record.
+                TypeDefKind::Record(record) => {
+                    self.read_fields_from_memory(record.fields.iter().map(|f| &f.ty), addr, offset);
+                    self.emit(&RecordLift {
+                        record,
+                        ty: id,
+                        name: self.resolve.types[id].name.as_deref().unwrap(),
+                    });
+                }
+
+                TypeDefKind::Tuple(tuple) => {
+                    self.read_fields_from_memory(&tuple.types, addr, offset);
+                    self.emit(&TupleLift { tuple, ty: id });
+                }
+
+                TypeDefKind::Flags(f) => {
+                    match f.repr() {
+                        FlagsRepr::U8 => {
+                            self.stack.push(addr);
+                            self.load_intrepr(offset, Int::U8);
+                        }
+                        FlagsRepr::U16 => {
+                            self.stack.push(addr);
+                            self.load_intrepr(offset, Int::U16);
+                        }
+                        FlagsRepr::U32(n) => {
+                            for i in 0..n {
+                                self.stack.push(addr.clone());
+                                self.emit(&I32Load {
+                                    offset: offset + (i as i32) * 4,
+                                });
+                            }
+                        }
+                    }
+                    self.lift(ty);
+                }
+
+                // Each case will get its own block, and we'll dispatch to the
+                // right block based on the `i32.load` we initially perform. Each
+                // individual block is pretty simple and just reads the payload type
+                // from the corresponding offset if one is available.
+                TypeDefKind::Variant(variant) => {
+                    self.read_variant_arms_from_memory(
+                        offset,
+                        addr,
+                        variant.tag(),
+                        variant.cases.iter().map(|c| c.ty.as_ref()),
+                    );
+                    self.emit(&VariantLift {
+                        variant,
+                        ty: id,
+                        name: self.resolve.types[id].name.as_deref().unwrap(),
+                    });
+                }
+
+                TypeDefKind::Option(t) => {
+                    self.read_variant_arms_from_memory(offset, addr, Int::U8, [None, Some(t)]);
+                    self.emit(&OptionLift { payload: t, ty: id });
+                }
+
+                TypeDefKind::Result(r) => {
+                    self.read_variant_arms_from_memory(
+                        offset,
+                        addr,
+                        Int::U8,
+                        [r.ok.as_ref(), r.err.as_ref()],
+                    );
+                    self.emit(&ResultLift { result: r, ty: id });
+                }
+
+                TypeDefKind::Enum(e) => {
+                    self.stack.push(addr.clone());
+                    self.load_intrepr(offset, e.tag());
+                    self.lift(ty);
+                }
+
+                TypeDefKind::Union(union) => {
+                    self.read_variant_arms_from_memory(
+                        offset,
+                        addr,
+                        union.tag(),
+                        union.cases.iter().map(|c| Some(&c.ty)),
+                    );
+                    self.emit(&UnionLift {
+                        union,
+                        ty: id,
+                        name: self.resolve.types[id].name.as_deref().unwrap(),
+                    });
+                }
+
+                TypeDefKind::Future(_) => todo!("read future from memory"),
+                TypeDefKind::Stream(_) => todo!("read stream from memory"),
+                TypeDefKind::Unknown => unreachable!(),
+            },
+        }
+    }
+
+    fn read_results_from_memory(&mut self, results: &Results, addr: B::Operand, offset: i32) {
+        self.read_fields_from_memory(results.iter_types(), addr, offset)
+    }
+
+    fn read_variant_arms_from_memory<'b>(
+        &mut self,
+        offset: i32,
+        addr: B::Operand,
+        tag: Int,
+        cases: impl IntoIterator<Item = Option<&'b Type>> + Clone,
+    ) {
+        self.stack.push(addr.clone());
+        self.load_intrepr(offset, tag);
+        let payload_offset =
+            offset + (self.bindgen.sizes().payload_offset(tag, cases.clone()) as i32);
+        for ty in cases {
+            self.push_block();
+            if let Some(ty) = ty {
+                self.read_from_memory(ty, addr.clone(), payload_offset);
+            }
+            self.finish_block(ty.is_some() as usize);
+        }
+    }
+
+    fn read_list_from_memory(&mut self, ty: &Type, addr: B::Operand, offset: i32) {
+        // Read the pointer/len and then perform the standard lifting
+        // proceses.
+        self.stack.push(addr.clone());
+        self.emit(&Instruction::I32Load { offset });
+        self.stack.push(addr);
+        self.emit(&Instruction::I32Load { offset: offset + 4 });
+        self.lift(ty);
+    }
+
+    fn read_fields_from_memory<'b>(
+        &mut self,
+        tys: impl IntoIterator<Item = &'b Type>,
+        addr: B::Operand,
+        offset: i32,
+    ) {
+        for (field_offset, ty) in self.bindgen.sizes().field_offsets(tys).iter() {
+            self.read_from_memory(ty, addr.clone(), offset + (*field_offset as i32));
+        }
+    }
+
+    fn emit_and_lift(&mut self, ty: &Type, addr: B::Operand, instr: &Instruction) {
+        self.stack.push(addr);
+        self.emit(instr);
+        self.lift(ty);
+    }
+
+    fn load_intrepr(&mut self, offset: i32, repr: Int) {
+        self.emit(&match repr {
+            Int::U64 => Instruction::I64Load { offset },
+            Int::U32 => Instruction::I32Load { offset },
+            Int::U16 => Instruction::I32Load16U { offset },
+            Int::U8 => Instruction::I32Load8U { offset },
+        });
+    }
+
+    fn store_intrepr(&mut self, offset: i32, repr: Int) {
+        self.emit(&match repr {
+            Int::U64 => Instruction::I64Store { offset },
+            Int::U32 => Instruction::I32Store { offset },
+            Int::U16 => Instruction::I32Store16 { offset },
+            Int::U8 => Instruction::I32Store8 { offset },
+        });
+    }
+
+    fn deallocate(&mut self, ty: &Type, addr: B::Operand, offset: i32) {
+        use Instruction::*;
+
+        // No need to execute any instructions if this type itself doesn't
+        // require any form of post-return.
+        if !self.resolve.needs_post_return(ty) {
+            return;
+        }
+
+        match *ty {
+            Type::String => {
+                self.stack.push(addr.clone());
+                self.emit(&Instruction::I32Load { offset });
+                self.stack.push(addr);
+                self.emit(&Instruction::I32Load { offset: offset + 4 });
+                self.emit(&Instruction::GuestDeallocateString);
+            }
+
+            Type::Bool
+            | Type::U8
+            | Type::S8
+            | Type::U16
+            | Type::S16
+            | Type::U32
+            | Type::S32
+            | Type::Char
+            | Type::U64
+            | Type::S64
+            | Type::Float32
+            | Type::Float64 => {}
+
+            Type::Id(id) => match &self.resolve.types[id].kind {
+                TypeDefKind::Type(t) => self.deallocate(t, addr, offset),
+
+                TypeDefKind::List(element) => {
+                    self.push_block();
+                    self.emit(&IterBasePointer);
+                    let elemaddr = self.stack.pop().unwrap();
+                    self.deallocate(element, elemaddr, 0);
+                    self.finish_block(0);
+
+                    self.stack.push(addr.clone());
+                    self.emit(&Instruction::I32Load { offset });
+                    self.stack.push(addr);
+                    self.emit(&Instruction::I32Load { offset: offset + 4 });
+                    self.emit(&Instruction::GuestDeallocateList { element });
+                }
+
+                TypeDefKind::Handle(_) => {
+                    todo!()
+                }
+
+                TypeDefKind::Resource => {
+                    todo!()
+                }
+
+                TypeDefKind::Record(record) => {
+                    self.deallocate_fields(
+                        &record.fields.iter().map(|f| f.ty).collect::<Vec<_>>(),
+                        addr,
+                        offset,
+                    );
+                }
+
+                TypeDefKind::Tuple(tuple) => {
+                    self.deallocate_fields(&tuple.types, addr, offset);
+                }
+
+                TypeDefKind::Flags(_) => {}
+
+                TypeDefKind::Variant(variant) => {
+                    self.deallocate_variant(
+                        offset,
+                        addr,
+                        variant.tag(),
+                        variant.cases.iter().map(|c| c.ty.as_ref()),
+                    );
+                    self.emit(&GuestDeallocateVariant {
+                        blocks: variant.cases.len(),
+                    });
+                }
+
+                TypeDefKind::Option(t) => {
+                    self.deallocate_variant(offset, addr, Int::U8, [None, Some(t)]);
+                    self.emit(&GuestDeallocateVariant { blocks: 2 });
+                }
+
+                TypeDefKind::Result(e) => {
+                    self.deallocate_variant(offset, addr, Int::U8, [e.ok.as_ref(), e.err.as_ref()]);
+                    self.emit(&GuestDeallocateVariant { blocks: 2 });
+                }
+
+                TypeDefKind::Enum(_) => {}
+
+                TypeDefKind::Union(union) => {
+                    self.deallocate_variant(
+                        offset,
+                        addr,
+                        union.tag(),
+                        union.cases.iter().map(|c| Some(&c.ty)),
+                    );
+                    self.emit(&GuestDeallocateVariant {
+                        blocks: union.cases.len(),
+                    });
+                }
+
+                TypeDefKind::Future(_) => todo!("read future from memory"),
+                TypeDefKind::Stream(_) => todo!("read stream from memory"),
+                TypeDefKind::Unknown => unreachable!(),
+            },
+        }
+    }
+
+    fn deallocate_variant<'b>(
+        &mut self,
+        offset: i32,
+        addr: B::Operand,
+        tag: Int,
+        cases: impl IntoIterator<Item = Option<&'b Type>> + Clone,
+    ) {
+        self.stack.push(addr.clone());
+        self.load_intrepr(offset, tag);
+        let payload_offset =
+            offset + (self.bindgen.sizes().payload_offset(tag, cases.clone()) as i32);
+        for ty in cases {
+            self.push_block();
+            if let Some(ty) = ty {
+                self.deallocate(ty, addr.clone(), payload_offset);
+            }
+            self.finish_block(0);
+        }
+    }
+
+    fn deallocate_fields(&mut self, tys: &[Type], addr: B::Operand, offset: i32) {
+        for (field_offset, ty) in self.bindgen.sizes().field_offsets(tys) {
+            self.deallocate(ty, addr.clone(), offset + (field_offset as i32));
+        }
+    }
+}
+
+fn cast(from: WasmType, to: WasmType) -> Bitcast {
+    use WasmType::*;
+
+    match (from, to) {
+        (I32, I32) | (I64, I64) | (F32, F32) | (F64, F64) => Bitcast::None,
+
+        (I32, I64) => Bitcast::I32ToI64,
+        (F32, I32) => Bitcast::F32ToI32,
+        (F64, I64) => Bitcast::F64ToI64,
+
+        (I64, I32) => Bitcast::I64ToI32,
+        (I32, F32) => Bitcast::I32ToF32,
+        (I64, F64) => Bitcast::I64ToF64,
+
+        (F32, I64) => Bitcast::F32ToI64,
+        (I64, F32) => Bitcast::I64ToF32,
+
+        (F32, F64) | (F64, F32) | (F64, I32) | (I32, F64) => unreachable!(),
+    }
+}