//! Transformation for wasm-bindgen to enable usage of `anyref` in a wasm
//! module.
//!
//! This crate is in charge of enabling code using `wasm-bindgen` to use the
//! `anyref` type inside of the wasm module. This transformation pass primarily
//! wraps exports and imports in shims which use `anyref`, but quickly turn them
//! into `i32` value types. This is all largely a stopgap until Rust has
//! first-class support for the `anyref` type, but that's thought to be in the
//! far future and will take quite some time to implement. In the meantime, we
//! have this!
//!
//! The pass here works by collecting information during binding generation
//! about imports and exports. Afterwards this pass runs in one go against a
//! wasm module, updating exports, imports, calls to these functions, etc. The
//! goal at least is to have valid wasm modules coming in that don't use
//! `anyref` and valid wasm modules going out which use `anyref` at the fringes.

use failure::{bail, format_err, Error};
use std::cmp;
use std::collections::{BTreeMap, HashMap, HashSet};
use std::mem;
use walrus::ir::*;
use walrus::{FunctionId, GlobalId, InitExpr, Module, TableId, ValType};

// must be kept in sync with src/lib.rs and ANYREF_HEAP_START
const DEFAULT_MIN: u32 = 32;

/// State of the anyref pass, used to collect information while bindings are
/// generated and used eventually to actually execute the entire pass.
#[derive(Default)]
pub struct Context {
    // Functions within the module that we're gonna be wrapping, organized by
    // type. The `Function` contains information about what arguments/return
    // values in the function signature should turn into anyref.
    imports: HashMap<String, HashMap<String, Function>>,
    exports: HashMap<String, Function>,
    elements: BTreeMap<u32, (u32, Function)>,

    // When wrapping closures with new shims, this is the index of the next
    // table entry that we'll be handing out.
    next_element: u32,

    // The anyref table we'll be using, injected after construction
    table: Option<TableId>,

    // Whether or not the transformation will actually be run at the end
    pub enabled: bool,
}

struct Transform<'a> {
    cx: &'a mut Context,

    // A map of functions to intrinsics that they represent
    intrinsic_map: HashMap<FunctionId, Intrinsic>,
    // A map of old import functions to the new internally-defined shims which
    // call the correct new import functions
    import_map: HashMap<FunctionId, FunctionId>,
    // A set of all shims we've created
    shims: HashSet<FunctionId>,

    // Indices of items that we have injected or found. This state is maintained
    // during the pass execution.
    table: TableId,
    clone_ref: FunctionId,
    heap_alloc: FunctionId,
    heap_dealloc: FunctionId,
    stack_pointer: GlobalId,
}

struct Function {
    name: String,
    // A map of argument index to whether it's an owned or borrowed anyref
    // (owned = true)
    args: HashMap<usize, bool>,
    ret_anyref: bool,
}

enum Intrinsic {
    TableGrow,
    TableSetNull,
    DropRef,
    CloneRef,
}

impl Context {
    /// Executed first very early over a wasm module, used to learn about how
    /// large the function table is so we know what indexes to hand out when
    /// we're appending entries.
    pub fn prepare(&mut self, module: &mut Module) -> Result<(), Error> {
        if !self.enabled {
            return Ok(());
        }

        // Figure out what the maximum index of functions pointers are. We'll
        // be adding new entries to the function table later (maybe) so
        // precalculate this ahead of time.
        let mut tables = module.tables.iter().filter_map(|t| match &t.kind {
            walrus::TableKind::Function(f) => Some(f),
            _ => None,
        });
        if let Some(t) = tables.next() {
            if tables.next().is_some() {
                bail!("more than one function table present")
            }
            self.next_element = t.elements.len() as u32;
        }
        drop(tables);

        // Add in an anyref table to the module, which we'll be using for
        // our transform below.
        let kind = walrus::TableKind::Anyref(Default::default());
        self.table = Some(module.tables.add_local(DEFAULT_MIN, None, kind));

        Ok(())
    }

    /// Store information about an imported function that needs to be
    /// transformed. The actual transformation happens later during `run`.
    pub fn import_xform(
        &mut self,
        module: &str,
        name: &str,
        anyref: &[(usize, bool)],
        ret_anyref: bool,
    ) -> &mut Self {
        if !self.enabled {
            return self;
        }
        let f = self.function(name, anyref, ret_anyref);
        self.imports
            .entry(module.to_string())
            .or_insert_with(Default::default)
            .insert(name.to_string(), f);
        self
    }

    /// Store information about an exported function that needs to be
    /// transformed. The actual transformation happens later during `run`.
    pub fn export_xform(
        &mut self,
        name: &str,
        anyref: &[(usize, bool)],
        ret_anyref: bool,
    ) -> &mut Self {
        if !self.enabled {
            return self;
        }
        let f = self.function(name, anyref, ret_anyref);
        self.exports.insert(name.to_string(), f);
        self
    }

    /// Store information about a function pointer that needs to be transformed.
    /// The actual transformation happens later during `run`. Returns an index
    /// that the new wrapped function pointer will be injected at.
    pub fn table_element_xform(
        &mut self,
        idx: u32,
        anyref: &[(usize, bool)],
        ret_anyref: bool,
    ) -> u32 {
        if !self.enabled {
            return idx;
        }
        let name = format!("closure{}", idx);
        let f = self.function(&name, anyref, ret_anyref);
        let ret = self.next_element;
        self.next_element += 1;
        self.elements.insert(ret, (idx, f));
        ret
    }

    fn function(&self, name: &str, anyref: &[(usize, bool)], ret_anyref: bool) -> Function {
        Function {
            name: name.to_string(),
            args: anyref.iter().cloned().collect(),
            ret_anyref,
        }
    }

    pub fn anyref_table_id(&self) -> TableId {
        self.table.unwrap()
    }

    pub fn run(&mut self, module: &mut Module) -> Result<(), Error> {
        if !self.enabled {
            return Ok(());
        }
        let table = self.table.unwrap();

        // Inject a stack pointer global which will be used for managing the
        // stack on the anyref table.
        let init = InitExpr::Value(Value::I32(DEFAULT_MIN as i32));
        let stack_pointer = module.globals.add_local(ValType::I32, true, init);

        let mut heap_alloc = None;
        let mut heap_dealloc = None;

        // Find exports of some intrinsics which we only need for a runtime
        // implementation.
        for export in module.exports.iter() {
            let f = match export.item {
                walrus::ExportItem::Function(f) => f,
                _ => continue,
            };
            match export.name.as_str() {
                "__wbindgen_anyref_table_alloc" => heap_alloc = Some(f),
                "__wbindgen_anyref_table_dealloc" => heap_dealloc = Some(f),
                _ => {}
            }
        }
        let heap_alloc = heap_alloc.ok_or_else(|| format_err!("failed to find heap alloc"))?;
        let heap_dealloc =
            heap_dealloc.ok_or_else(|| format_err!("failed to find heap dealloc"))?;

        // Create a shim function that looks like:
        //
        // (func __wbindgen_object_clone_ref (param i32) (result i32)
        //      (local i32)
        //      (table.set
        //          (tee_local 1 (call $heap_alloc))
        //          (table.get (local.get 0)))
        //      (local.get 1))
        let mut builder = walrus::FunctionBuilder::new();
        let arg = module.locals.add(ValType::I32);
        let local = module.locals.add(ValType::I32);

        let alloc = builder.call(heap_alloc, Box::new([]));
        let tee = builder.local_tee(local, alloc);
        let get_arg = builder.local_get(arg);
        let get_table = builder.table_get(table, get_arg);
        let set_table = builder.table_set(table, tee, get_table);
        let get_local = builder.local_get(local);

        let ty = module.types.add(&[ValType::I32], &[ValType::I32]);
        let clone_ref = builder.finish(ty, vec![arg], vec![set_table, get_local], module);
        let name = "__wbindgen_object_clone_ref".to_string();
        module.funcs.get_mut(clone_ref).name = Some(name);

        // And run the transformation!
        Transform {
            cx: self,
            intrinsic_map: HashMap::new(),
            import_map: HashMap::new(),
            shims: HashSet::new(),
            table,
            clone_ref,
            heap_alloc,
            heap_dealloc,
            stack_pointer,
        }
        .run(module)
    }
}

impl Transform<'_> {
    fn run(&mut self, module: &mut Module) -> Result<(), Error> {
        // Detect all the various intrinsics and such. This will also along the
        // way inject an intrinsic for cloning an anyref.
        self.find_intrinsics(module)?;

        // Perform transformations of imports, exports, and function pointers.
        self.process_imports(module);
        for m in self.cx.imports.values() {
            assert!(m.is_empty());
        }
        self.process_exports(module);
        assert!(self.cx.exports.is_empty());
        self.process_elements(module)?;
        assert!(self.cx.elements.is_empty());

        // If we didn't actually transform anything, no need to inject or
        // rewrite anything from below.
        if self.shims.is_empty() {
            return Ok(());
        }

        // Perform all instruction transformations to rewrite calls between
        // functions and make sure everything is still hooked up right.
        self.rewrite_calls(module);

        // Inject initialization routine to set up default slots in the table
        // (things like null/undefined/true/false)
        self.inject_initialization(module);

        Ok(())
    }

    fn find_intrinsics(&mut self, module: &mut Module) -> Result<(), Error> {
        // Build up a map of various imported intrinsics to wire them up to
        // different implementations or different functions.
        for import in module.imports.iter_mut() {
            let f = match import.kind {
                walrus::ImportKind::Function(f) => f,
                _ => continue,
            };
            if import.module == "__wbindgen_anyref_xform__" {
                match import.name.as_str() {
                    "__wbindgen_anyref_table_grow" => {
                        self.intrinsic_map.insert(f, Intrinsic::TableGrow);
                    }
                    "__wbindgen_anyref_table_set_null" => {
                        self.intrinsic_map.insert(f, Intrinsic::TableSetNull);
                    }
                    n => bail!("unknown intrinsic: {}", n),
                }
            } else if import.module == "__wbindgen_placeholder__" {
                match import.name.as_str() {
                    "__wbindgen_object_drop_ref" => {
                        self.intrinsic_map.insert(f, Intrinsic::DropRef);
                    }
                    "__wbindgen_object_clone_ref" => {
                        self.intrinsic_map.insert(f, Intrinsic::CloneRef);
                    }
                    _ => continue,
                }
            } else {
                continue;
            }

            // Make sure we don't actually end up using the original import
            // because any invocation of them should be remapped to something
            // else.
            import.name = format!("{}_unused", import.name);
        }

        Ok(())
    }

    fn process_imports(&mut self, module: &mut Module) {
        for import in module.imports.iter_mut() {
            let f = match import.kind {
                walrus::ImportKind::Function(f) => f,
                _ => continue,
            };
            let import = {
                let entries = match self.cx.imports.get_mut(&import.module) {
                    Some(s) => s,
                    None => continue,
                };
                match entries.remove(&import.name) {
                    Some(s) => s,
                    None => continue,
                }
            };

            let shim = self.append_shim(
                f,
                import,
                &mut module.types,
                &mut module.funcs,
                &mut module.locals,
            );
            self.import_map.insert(f, shim);
        }
    }

    fn process_exports(&mut self, module: &mut Module) {
        let mut new_exports = Vec::new();
        for export in module.exports.iter() {
            let f = match export.item {
                walrus::ExportItem::Function(f) => f,
                _ => continue,
            };
            let function = match self.cx.exports.remove(&export.name) {
                Some(s) => s,
                None => continue,
            };
            let shim = self.append_shim(
                f,
                function,
                &mut module.types,
                &mut module.funcs,
                &mut module.locals,
            );
            new_exports.push((export.name.to_string(), shim, export.id()));
        }

        for (name, shim, old_id) in new_exports {
            module.exports.add(&name, shim);
            module.exports.delete(old_id);
        }
    }

    fn process_elements(&mut self, module: &mut Module) -> Result<(), Error> {
        let table = match module.tables.main_function_table()? {
            Some(t) => t,
            None => return Ok(()),
        };
        let table = module.tables.get_mut(table);
        let kind = match &mut table.kind {
            walrus::TableKind::Function(f) => f,
            _ => unreachable!(),
        };
        if kind.relative_elements.len() > 0 {
            bail!("not compatible with relative element initializers yet");
        }

        // Create shims for all our functions and append them all to the segment
        // which places elements at the end.
        while let Some((idx, function)) = self.cx.elements.remove(&(kind.elements.len() as u32)) {
            let target = kind.elements[idx as usize].unwrap();
            let shim = self.append_shim(
                target,
                function,
                &mut module.types,
                &mut module.funcs,
                &mut module.locals,
            );
            kind.elements.push(Some(shim));
        }

        // ... and next update the limits of the table in case any are listed.
        table.initial = cmp::max(table.initial, kind.elements.len() as u32);
        if let Some(max) = table.maximum {
            table.maximum = Some(cmp::max(max, kind.elements.len() as u32));
        }

        Ok(())
    }

    fn append_shim(
        &mut self,
        shim_target: FunctionId,
        mut func: Function,
        types: &mut walrus::ModuleTypes,
        funcs: &mut walrus::ModuleFunctions,
        locals: &mut walrus::ModuleLocals,
    ) -> FunctionId {
        let target = funcs.get_mut(shim_target);
        let (is_export, ty) = match &mut target.kind {
            walrus::FunctionKind::Import(f) => (false, &mut f.ty),
            walrus::FunctionKind::Local(f) => (true, &mut f.ty),
            _ => unreachable!()
        };

        let target_ty = types.get(*ty);

        // Learn about the various operations we're doing up front. Afterwards
        // we'll have a better idea bout what sort of code we're gonna be
        // generating.
        enum Convert {
            None,
            Store { owned: bool },
            Load { owned: bool },
        }
        let mut param_tys = Vec::new();
        let mut param_convert = Vec::new();
        let mut anyref_stack = 0;

        for (i, old_ty) in target_ty.params().iter().enumerate() {
            let is_owned = func.args.remove(&i);
            let new_ty = is_owned
                .map(|_which| ValType::Anyref)
                .unwrap_or(old_ty.clone());
            param_tys.push(new_ty.clone());
            if new_ty == *old_ty {
                param_convert.push(Convert::None);
            } else if is_export {
                // We're calling an export, so we need to push this anyref into
                // a table somehow.
                param_convert.push(Convert::Store {
                    owned: is_owned.unwrap(),
                });
                if is_owned == Some(false) {
                    anyref_stack += 1;
                }
            } else {
                // We're calling an import, so we just need to fetch our table
                // value.
                param_convert.push(Convert::Load {
                    owned: is_owned.unwrap(),
                });
            }
        }

        let new_ret = if func.ret_anyref {
            assert_eq!(target_ty.results(), &[ValType::I32]);
            vec![ValType::Anyref]
        } else {
            target_ty.results().to_vec()
        };
        let anyref_ty = types.add(&param_tys, &new_ret);

        // If we're an export then our shim is what's actually going to get
        // exported, and it's going to have the anyref signature.
        //
        // If we're an import, then our shim is what the Rust code calls, which
        // means it'll have the original signature. The existing import's
        // signature, however, is transformed to be an anyref signature.
        let shim_ty = if is_export {
            anyref_ty
        } else {
            mem::replace(ty, anyref_ty)
        };

        let mut builder = walrus::FunctionBuilder::new();
        let mut before = Vec::new();
        let params = types.get(shim_ty)
            .params()
            .iter()
            .cloned()
            .map(|ty| locals.add(ty))
            .collect::<Vec<_>>();

        // Unconditionally allocate some locals which get cleaned up in later
        // gc passes if we don't actually end up using them.
        let fp = locals.add(ValType::I32);
        let scratch_i32 = locals.add(ValType::I32);
        let scratch_anyref = locals.add(ValType::Anyref);

        // Update our stack pointer if there's any borrowed anyref objects.
        if anyref_stack > 0 {
            let sp = builder.global_get(self.stack_pointer);
            let size = builder.const_(Value::I32(anyref_stack));
            let new_sp = builder.binop(BinaryOp::I32Sub, sp, size);
            let tee = builder.local_tee(fp, new_sp);
            before.push(builder.global_set(self.stack_pointer, tee));
        }
        let mut next_stack_offset = 0;

        let mut args = Vec::new();
        for (i, convert) in param_convert.iter().enumerate() {
            let local = builder.local_get(params[i]);
            args.push(match *convert {
                Convert::None => local,
                Convert::Load { owned: true } => {
                    // load the anyref onto the stack, then afterwards
                    // deallocate our index, leaving the anyref on the stack.
                    let get = builder.table_get(self.table, local);
                    let free = builder.call(self.heap_dealloc, Box::new([local]));
                    builder.with_side_effects(Vec::new(), get, vec![free])
                }
                Convert::Load { owned: false } => builder.table_get(self.table, local),
                Convert::Store { owned: true } => {
                    // Allocate space for the anyref, store it, and then leave
                    // the index of the allocated anyref on the stack.
                    let alloc = builder.call(self.heap_alloc, Box::new([]));
                    let tee = builder.local_tee(scratch_i32, alloc);
                    let store = builder.table_set(self.table, tee, local);
                    let get = builder.local_get(scratch_i32);
                    builder.with_side_effects(vec![store], get, Vec::new())
                }
                Convert::Store { owned: false } => {
                    // Store an anyref at an offset from our function's stack
                    // pointer frame.
                    let get_fp = builder.local_get(fp);
                    next_stack_offset += 1;
                    let (index, idx_local) = if next_stack_offset == 1 {
                        (get_fp, fp)
                    } else {
                        let rhs = builder.i32_const(next_stack_offset);
                        let add = builder.binop(BinaryOp::I32Add, get_fp, rhs);
                        (builder.local_tee(scratch_i32, add), scratch_i32)
                    };
                    let store = builder.table_set(self.table, index, local);
                    let get = builder.local_get(idx_local);
                    builder.with_side_effects(vec![store], get, Vec::new())
                }
            });
        }

        // Now that we've converted all the arguments, call the original
        // function. This may be either an import or an export which we're
        // wrapping.
        let mut result = builder.call(shim_target, args.into_boxed_slice());
        let mut after = Vec::new();

        // If an anyref value is returned, then we need to be sure to apply
        // special treatment to convert it to an i32 as well. Note that only
        // owned anyref values can be returned, so that's all that's handled
        // here.
        if func.ret_anyref {
            if is_export {
                // We're an export so we have an i32 on the stack and need to
                // convert it to an anyref, basically by doing the same as an
                // owned load above: get the value then deallocate our slot.
                let tee = builder.local_tee(scratch_i32, result);
                result = builder.table_get(self.table, tee);
                let get_local = builder.local_get(scratch_i32);
                after.push(builder.call(self.heap_dealloc, Box::new([get_local])));
            } else {
                // Imports are the opposite, we have any anyref on the stack
                // and convert it to an i32 by allocating space for it and
                // storing it there.
                before.push(builder.local_set(scratch_anyref, result));
                let alloc = builder.call(self.heap_alloc, Box::new([]));
                let tee = builder.local_tee(scratch_i32, alloc);
                let get = builder.local_get(scratch_anyref);
                before.push(builder.table_set(self.table, tee, get));
                result = builder.local_get(scratch_i32);
            }
        }

        // On function exit restore our anyref stack pointer if we decremented
        // it to start off.
        //
        // Note that we pave over all our stack slots with `ref.null` to ensure
        // that the table doesn't accidentally hold a strong reference to items
        // no longer in use by our wasm instance.
        //
        // TODO: use `table.fill` once that's spec'd
        if anyref_stack > 0 {
            for i in 0..anyref_stack {
                let get_fp = builder.local_get(fp);
                let index = if i > 0 {
                    let offset = builder.i32_const(i);
                    builder.binop(BinaryOp::I32Add, get_fp, offset)
                } else {
                    get_fp
                };
                let null = builder.ref_null();
                after.push(builder.table_set(self.table, index, null));
            }

            let get_fp = builder.local_get(fp);
            let size = builder.i32_const(anyref_stack);
            let new_sp = builder.binop(BinaryOp::I32Add, get_fp, size);
            after.push(builder.global_set(self.stack_pointer, new_sp));
        }

        // Create the final expression node and then finish the function builder
        // with a fresh type we've been calculating so far. Give the function a
        // nice name for debugging and then we're good to go!
        let expr = builder.with_side_effects(before, result, after);
        let id = builder.finish_parts(shim_ty, params, vec![expr], types, funcs);
        let name = format!("{}_anyref_shim", func.name);
        funcs.get_mut(id).name = Some(name);
        self.shims.insert(id);
        return id;
    }

    fn rewrite_calls(&mut self, module: &mut Module) {
        for (id, func) in module.funcs.iter_local_mut() {
            if self.shims.contains(&id) {
                continue;
            }
            let mut entry = func.entry_block();
            Rewrite {
                func,
                xform: self,
                replace: None,
            }
            .visit_block_id_mut(&mut entry);
        }

        struct Rewrite<'a, 'b> {
            func: &'a mut walrus::LocalFunction,
            xform: &'a Transform<'b>,
            replace: Option<ExprId>,
        }

        impl VisitorMut for Rewrite<'_, '_> {
            fn local_function_mut(&mut self) -> &mut walrus::LocalFunction {
                self.func
            }

            fn visit_expr_id_mut(&mut self, expr: &mut ExprId) {
                expr.visit_mut(self);
                if let Some(id) = self.replace.take() {
                    *expr = id;
                }
            }

            fn visit_call_mut(&mut self, e: &mut Call) {
                e.visit_mut(self);
                let intrinsic = match self.xform.intrinsic_map.get(&e.func) {
                    Some(f) => f,
                    None => {
                        // If this wasn't a call of an intrinsic, but it was a
                        // call of one of our old import functions then we
                        // switch the functions we're calling here.
                        if let Some(f) = self.xform.import_map.get(&e.func) {
                            e.func = *f;
                        }
                        return;
                    }
                };

                let builder = self.func.builder_mut();

                match intrinsic {
                    Intrinsic::TableGrow => {
                        assert_eq!(e.args.len(), 1);
                        let delta = e.args[0];
                        let null = builder.ref_null();
                        let grow = builder.table_grow(self.xform.table, delta, null);
                        self.replace = Some(grow);
                    }
                    Intrinsic::TableSetNull => {
                        assert_eq!(e.args.len(), 1);
                        let index = e.args[0];
                        let null = builder.ref_null();
                        let set = builder.table_set(self.xform.table, index, null);
                        self.replace = Some(set);
                    }
                    Intrinsic::DropRef => e.func = self.xform.heap_dealloc,
                    Intrinsic::CloneRef => e.func = self.xform.clone_ref,
                }
            }
        }
    }

    // Ensure that the `start` function for this module calls the
    // `__wbindgen_init_anyref_table` function. This'll ensure that all
    // instances of this module have the initial slots of the anyref table
    // initialized correctly.
    fn inject_initialization(&mut self, module: &mut Module) {
        let ty = module.types.add(&[], &[]);
        let import = module.add_import_func(
            "__wbindgen_placeholder__",
            "__wbindgen_init_anyref_table",
            ty,
        );

        let prev_start = match module.start {
            Some(f) => f,
            None => {
                module.start = Some(import);
                return;
            }
        };

        let mut builder = walrus::FunctionBuilder::new();
        let call_init = builder.call(import, Box::new([]));
        let call_prev = builder.call(prev_start, Box::new([]));
        let new_start = builder.finish(ty, Vec::new(), vec![call_init, call_prev], module);
        module.start = Some(new_start);
    }
}