import driver::session::session;
import lib::llvm::llvm;
import lib::llvm::{ValueRef, BasicBlockRef};
import pat_util::*;
import build::*;
import base::*;
import syntax::ast;
import syntax::ast_util;
import syntax::ast_util::{dummy_sp, path_to_ident};
import syntax::ast::def_id;
import syntax::codemap::span;
import syntax::print::pprust::pat_to_str;
import back::abi;
import resolve::def_map;
import std::map::hashmap;
import dvec::{dvec, extensions};

import common::*;

// An option identifying a branch (either a literal, a enum variant or a
// range)
enum opt {
    lit(@ast::expr),
    var(/* disr val */int, /* variant dids */{enm: def_id, var: def_id}),
    range(@ast::expr, @ast::expr)
}
fn opt_eq(tcx: ty::ctxt, a: opt, b: opt) -> bool {
    alt (a, b) {
      (lit(a), lit(b)) { const_eval::compare_lit_exprs(tcx, a, b) == 0 }
      (range(a1, a2), range(b1, b2)) {
        const_eval::compare_lit_exprs(tcx, a1, b1) == 0 &&
        const_eval::compare_lit_exprs(tcx, a2, b2) == 0
      }
      (var(a, _), var(b, _)) { a == b }
      _ { false }
    }
}

enum opt_result {
    single_result(result),
    range_result(result, result),
}
fn trans_opt(bcx: block, o: opt) -> opt_result {
    let _icx = bcx.insn_ctxt("alt::trans_opt");
    let ccx = bcx.ccx();
    let mut bcx = bcx;
    alt o {
      lit(l) {
        alt l.node {
          ast::expr_lit(@{node: ast::lit_str(s), _}) {
            let strty = ty::mk_str(bcx.tcx());
            let cell = empty_dest_cell();
            bcx = tvec::trans_estr(bcx, s, ast::vstore_uniq, by_val(cell));
            add_clean_temp(bcx, *cell, strty);
            ret single_result(rslt(bcx, *cell));
          }
          _ {
            ret single_result(
                rslt(bcx, trans_const_expr(ccx, l)));
          }
        }
      }
      var(disr_val, _) { ret single_result(rslt(bcx, C_int(ccx, disr_val))); }
      range(l1, l2) {
        ret range_result(rslt(bcx, trans_const_expr(ccx, l1)),
                         rslt(bcx, trans_const_expr(ccx, l2)));
      }
    }
}

fn variant_opt(tcx: ty::ctxt, pat_id: ast::node_id) -> opt {
    let vdef = ast_util::variant_def_ids(tcx.def_map.get(pat_id));
    let variants = ty::enum_variants(tcx, vdef.enm);
    for vec::each(*variants) {|v|
        if vdef.var == v.id { ret var(v.disr_val, vdef); }
    }
    core::unreachable();
}

type bind_map = [{ident: ast::ident, val: ValueRef}];
fn assoc(key: str, list: bind_map) -> option<ValueRef> {
    for vec::each(list) {|elt|
        if str::eq(elt.ident, key) { ret some(elt.val); }
    }
    ret none;
}

type match_branch =
    @{pats: [@ast::pat],
      bound: bind_map,
      data: @{bodycx: block,
              guard: option<@ast::expr>,
              id_map: pat_id_map}};
type match = [match_branch];

fn has_nested_bindings(m: match, col: uint) -> bool {
    for vec::each(m) {|br|
        alt br.pats[col].node {
          ast::pat_ident(_, some(_)) { ret true; }
          _ {}
        }
    }
    ret false;
}

fn expand_nested_bindings(m: match, col: uint, val: ValueRef) -> match {
    let mut result = [];
    for vec::each(m) {|br|
      alt br.pats[col].node {
          ast::pat_ident(name, some(inner)) {
            let pats = vec::slice(br.pats, 0u, col) + [inner] +
                vec::slice(br.pats, col + 1u, br.pats.len());
            result += [@{pats: pats,
                        bound: br.bound + [{ident: path_to_ident(name),
                                val: val}]
                         with *br}];
          }
          _ { result += [br]; }
        }
    }
    result
}

type enter_pat = fn(@ast::pat) -> option<[@ast::pat]>;

fn enter_match(dm: def_map, m: match, col: uint, val: ValueRef,
               e: enter_pat) -> match {
    let mut result = [];
    for vec::each(m) {|br|
        alt e(br.pats[col]) {
          some(sub) {
            let pats = sub + vec::slice(br.pats, 0u, col) +
                vec::slice(br.pats, col + 1u, br.pats.len());
            let self = br.pats[col];
            let bound = alt self.node {
              ast::pat_ident(name, none) if !pat_is_variant(dm, self) {
                br.bound + [{ident: path_to_ident(name), val: val}]
              }
              _ { br.bound }
            };
            result += [@{pats: pats, bound: bound with *br}];
          }
          none { }
        }
    }
    ret result;
}

fn enter_default(dm: def_map, m: match, col: uint, val: ValueRef) -> match {
    enter_match(dm, m, col, val) {|p|
        alt p.node {
          ast::pat_wild | ast::pat_rec(_, _) | ast::pat_tup(_) { some([]) }
          ast::pat_ident(_, none) if !pat_is_variant(dm, p) {
            some([])
          }
          _ { none }
        }
    }
}

fn enter_opt(tcx: ty::ctxt, m: match, opt: opt, col: uint,
             variant_size: uint, val: ValueRef) -> match {
    let dummy = @{id: 0, node: ast::pat_wild, span: dummy_sp()};
    enter_match(tcx.def_map, m, col, val) {|p|
        alt p.node {
          ast::pat_enum(_, subpats) {
            if opt_eq(tcx, variant_opt(tcx, p.id), opt) {
              some(option::get_default(subpats,
                     vec::from_elem(variant_size, dummy))) }
            else { none }
          }
          ast::pat_ident(_, none) if pat_is_variant(tcx.def_map, p) {
            if opt_eq(tcx, variant_opt(tcx, p.id), opt) { some([]) }
            else { none }
          }
          ast::pat_lit(l) {
            if opt_eq(tcx, lit(l), opt) { some([]) } else { none }
          }
          ast::pat_range(l1, l2) {
            if opt_eq(tcx, range(l1, l2), opt) { some([]) } else { none }
          }
          _ { some(vec::from_elem(variant_size, dummy)) }
        }
    }
}

fn enter_rec(dm: def_map, m: match, col: uint, fields: [ast::ident],
             val: ValueRef) -> match {
    let dummy = @{id: 0, node: ast::pat_wild, span: dummy_sp()};
    enter_match(dm, m, col, val) {|p|
        alt p.node {
          ast::pat_rec(fpats, _) {
            let mut pats = [];
            for vec::each(fields) {|fname|
                let mut pat = dummy;
                for vec::each(fpats) {|fpat|
                    if str::eq(fpat.ident, fname) { pat = fpat.pat; break; }
                }
                pats += [pat];
            }
            some(pats)
          }
          _ { some(vec::from_elem(fields.len(), dummy)) }
        }
    }
}

fn enter_tup(dm: def_map, m: match, col: uint, val: ValueRef,
             n_elts: uint) -> match {
    let dummy = @{id: 0, node: ast::pat_wild, span: dummy_sp()};
    enter_match(dm, m, col, val) {|p|
        alt p.node {
          ast::pat_tup(elts) { some(elts) }
          _ { some(vec::from_elem(n_elts, dummy)) }
        }
    }
}

fn enter_box(dm: def_map, m: match, col: uint, val: ValueRef) -> match {
    let dummy = @{id: 0, node: ast::pat_wild, span: dummy_sp()};
    enter_match(dm, m, col, val) {|p|
        alt p.node {
          ast::pat_box(sub) { some([sub]) }
          _ { some([dummy]) }
        }
    }
}

fn enter_uniq(dm: def_map, m: match, col: uint, val: ValueRef) -> match {
    let dummy = @{id: 0, node: ast::pat_wild, span: dummy_sp()};
    enter_match(dm, m, col, val) {|p|
        alt p.node {
          ast::pat_uniq(sub) { some([sub]) }
          _ { some([dummy]) }
        }
    }
}

fn get_options(ccx: @crate_ctxt, m: match, col: uint) -> [opt] {
    fn add_to_set(tcx: ty::ctxt, &&set: dvec<opt>, val: opt) {
        if set.any({|l| opt_eq(tcx, l, val)}) {ret;}
        set.push(val);
    }

    let found = dvec();
    for vec::each(m) {|br|
        let cur = br.pats[col];
        if pat_is_variant(ccx.tcx.def_map, cur) {
            add_to_set(ccx.tcx, found, variant_opt(ccx.tcx, br.pats[col].id));
        } else {
            alt cur.node {
              ast::pat_lit(l) { add_to_set(ccx.tcx, found, lit(l)); }
              ast::pat_range(l1, l2) {
                add_to_set(ccx.tcx, found, range(l1, l2));
              }
              _ {}
            }
        }
    }
    ret vec::from_mut(dvec::unwrap(found));
}

fn extract_variant_args(bcx: block, pat_id: ast::node_id,
                        vdefs: {enm: def_id, var: def_id}, val: ValueRef) ->
   {vals: [ValueRef], bcx: block} {
    let _icx = bcx.insn_ctxt("alt::extract_variant_args");
    let ccx = bcx.fcx.ccx;
    let enum_ty_substs = alt check ty::get(node_id_type(bcx, pat_id)).struct {
      ty::ty_enum(id, substs) { assert id == vdefs.enm; substs.tps }
    };
    let mut blobptr = val;
    let variants = ty::enum_variants(ccx.tcx, vdefs.enm);
    let size = ty::enum_variant_with_id(ccx.tcx, vdefs.enm,
                                        vdefs.var).args.len();
    if size > 0u && (*variants).len() != 1u {
        let enumptr =
            PointerCast(bcx, val, T_opaque_enum_ptr(ccx));
        blobptr = GEPi(bcx, enumptr, [0u, 1u]);
    }
    let vdefs_tg = vdefs.enm;
    let vdefs_var = vdefs.var;
    let args = vec::from_fn(size) { |i|
        GEP_enum(bcx, blobptr, vdefs_tg, vdefs_var,
                 enum_ty_substs, i)
    };
    ret {vals: args, bcx: bcx};
}

fn collect_record_fields(m: match, col: uint) -> [ast::ident] {
    let mut fields = [];
    for vec::each(m) {|br|
        alt br.pats[col].node {
          ast::pat_rec(fs, _) {
            for vec::each(fs) {|f|
                if !vec::any(fields, bind str::eq(f.ident, _)) {
                    fields += [f.ident];
                }
            }
          }
          _ { }
        }
    }
    ret fields;
}

fn root_pats_as_necessary(bcx: block, m: match, col: uint, val: ValueRef) {
    for vec::each(m) {|br|
        let pat_id = br.pats[col].id;

        alt bcx.ccx().maps.root_map.find({id:pat_id, derefs:0u}) {
          none {}
          some(scope_id) {
            // Note: the scope_id will always be the id of the alt.  See the
            // extended comment in rustc::middle::borrowck::preserve() for
            // details (look for the case covering cat_discr).

            let ty = node_id_type(bcx, pat_id);
            let val = load_if_immediate(bcx, val, ty);
            root_value(bcx, val, ty, scope_id);
            ret; // if we kept going, we'd only be rooting same value again
          }
        }
    }
}

fn any_box_pat(m: match, col: uint) -> bool {
    for vec::each(m) {|br|
        alt br.pats[col].node { ast::pat_box(_) { ret true; } _ { } }
    }
    ret false;
}

fn any_uniq_pat(m: match, col: uint) -> bool {
    for vec::each(m) {|br|
        alt br.pats[col].node { ast::pat_uniq(_) { ret true; } _ { } }
    }
    ret false;
}

fn any_tup_pat(m: match, col: uint) -> bool {
    for vec::each(m) {|br|
        alt br.pats[col].node { ast::pat_tup(_) { ret true; } _ { } }
    }
    ret false;
}

type exit_node = {bound: bind_map, from: BasicBlockRef, to: BasicBlockRef};
type mk_fail = fn@() -> BasicBlockRef;

fn pick_col(m: match) -> uint {
    fn score(p: @ast::pat) -> uint {
        alt p.node {
          ast::pat_lit(_) | ast::pat_enum(_, _) | ast::pat_range(_, _) { 1u }
          ast::pat_ident(_, some(p)) { score(p) }
          _ { 0u }
        }
    }
    let scores = vec::to_mut(vec::from_elem(m[0].pats.len(), 0u));
    for vec::each(m) {|br|
        let mut i = 0u;
        for vec::each(br.pats) {|p| scores[i] += score(p); i += 1u; }
    }
    let mut max_score = 0u;
    let mut best_col = 0u;
    let mut i = 0u;
    for vec::each(scores) {|score|
        // Irrefutable columns always go first, they'd only be duplicated in
        // the branches.
        if score == 0u { ret i; }
        // If no irrefutable ones are found, we pick the one with the biggest
        // branching factor.
        if score > max_score { max_score = score; best_col = i; }
        i += 1u;
    }
    ret best_col;
}

fn compile_submatch(bcx: block, m: match, vals: [ValueRef],
                    chk: option<mk_fail>, &exits: [exit_node]) {
    let _icx = bcx.insn_ctxt("alt::compile_submatch");
    let mut bcx = bcx;
    let tcx = bcx.tcx(), dm = tcx.def_map;
    if m.len() == 0u { Br(bcx, option::get(chk)()); ret; }
    if m[0].pats.len() == 0u {
        let data = m[0].data;
        alt data.guard {
          some(e) {
            // Temporarily set bindings. They'll be rewritten to PHI nodes
            // for the actual arm block.
            for data.id_map.each {|key, val|
                let loc = local_mem(option::get(assoc(key, m[0].bound)));
                bcx.fcx.lllocals.insert(val, loc);
            };
            let {bcx: guard_cx, val} = {
                with_scope_result(bcx, e.info(), "guard") {|bcx|
                    trans_temp_expr(bcx, e)
                }
            };
            bcx = with_cond(guard_cx, Not(guard_cx, val)) {|bcx|
                compile_submatch(bcx, vec::tail(m), vals, chk, exits);
                bcx
            };
          }
          _ { }
        }
        if !bcx.unreachable {
            exits += [{bound: m[0].bound, from: bcx.llbb,
                       to: data.bodycx.llbb}];
        }
        Br(bcx, data.bodycx.llbb);
        ret;
    }

    let col = pick_col(m);
    let val = vals[col];
    let m = if has_nested_bindings(m, col) {
                expand_nested_bindings(m, col, val)
            } else { m };

    let vals_left = vec::slice(vals, 0u, col) +
        vec::slice(vals, col + 1u, vals.len());
    let ccx = bcx.fcx.ccx;
    let mut pat_id = 0;
    for vec::each(m) {|br|
        // Find a real id (we're adding placeholder wildcard patterns, but
        // each column is guaranteed to have at least one real pattern)
        if pat_id == 0 { pat_id = br.pats[col].id; }
    }

    root_pats_as_necessary(bcx, m, col, val);

    let rec_fields = collect_record_fields(m, col);
    // Separate path for extracting and binding record fields
    if rec_fields.len() > 0u {
        let fields = ty::get_fields(node_id_type(bcx, pat_id));
        let mut rec_vals = [];
        for vec::each(rec_fields) {|field_name|
            let ix = option::get(ty::field_idx(field_name, fields));
            rec_vals += [GEPi(bcx, val, [0u, ix])];
        }
        compile_submatch(bcx, enter_rec(dm, m, col, rec_fields, val),
                         rec_vals + vals_left, chk, exits);
        ret;
    }

    if any_tup_pat(m, col) {
        let tup_ty = node_id_type(bcx, pat_id);
        let n_tup_elts = alt ty::get(tup_ty).struct {
          ty::ty_tup(elts) { elts.len() }
          _ { ccx.sess.bug("non-tuple type in tuple pattern"); }
        };
        let mut tup_vals = [], i = 0u;
        while i < n_tup_elts {
            tup_vals += [GEPi(bcx, val, [0u, i])];
            i += 1u;
        }
        compile_submatch(bcx, enter_tup(dm, m, col, val, n_tup_elts),
                         tup_vals + vals_left, chk, exits);
        ret;
    }

    // Unbox in case of a box field
    if any_box_pat(m, col) {
        let box = Load(bcx, val);
        let box_ty = node_id_type(bcx, pat_id);
        let box_no_addrspace = non_gc_box_cast(bcx, box, box_ty);
        let unboxed = GEPi(bcx, box_no_addrspace, [0u, abi::box_field_body]);
        compile_submatch(bcx, enter_box(dm, m, col, val), [unboxed]
                         + vals_left, chk, exits);
        ret;
    }

    if any_uniq_pat(m, col) {
        let box = Load(bcx, val);
        let box_ty = node_id_type(bcx, pat_id);
        let box_no_addrspace = non_gc_box_cast(bcx, box, box_ty);
        let unboxed = GEPi(bcx, box_no_addrspace, [0u, abi::box_field_body]);
        compile_submatch(bcx, enter_uniq(dm, m, col, val),
                         [unboxed] + vals_left, chk, exits);
        ret;
    }

    // Decide what kind of branch we need
    let opts = get_options(ccx, m, col);
    enum branch_kind { no_branch, single, switch, compare, }
    let mut kind = no_branch;
    let mut test_val = val;
    if opts.len() > 0u {
        alt opts[0] {
          var(_, vdef) {
            if (*ty::enum_variants(tcx, vdef.enm)).len() == 1u {
                kind = single;
            } else {
                let enumptr =
                    PointerCast(bcx, val, T_opaque_enum_ptr(ccx));
                let discrimptr = GEPi(bcx, enumptr, [0u, 0u]);
                test_val = Load(bcx, discrimptr);
                kind = switch;
            }
          }
          lit(l) {
            test_val = Load(bcx, val);
            let pty = node_id_type(bcx, pat_id);
            kind = if ty::type_is_integral(pty) { switch }
                   else { compare };
          }
          range(_, _) {
            test_val = Load(bcx, val);
            kind = compare;
          }
        }
    }
    for vec::each(opts) {|o|
        alt o {
          range(_, _) { kind = compare; break; }
          _ { }
        }
    }
    let else_cx = alt kind {
      no_branch | single { bcx }
      _ { sub_block(bcx, "match_else") }
    };
    let sw = if kind == switch {
        Switch(bcx, test_val, else_cx.llbb, opts.len())
    } else { C_int(ccx, 0) }; // Placeholder for when not using a switch

    let defaults = enter_default(dm, m, col, val);
    let exhaustive = option::is_none(chk) && defaults.len() == 0u;
    let len = opts.len();
    let mut i = 0u;
    // Compile subtrees for each option
    for vec::each(opts) {|opt|
        i += 1u;
        let mut opt_cx = else_cx;
        if !exhaustive || i < len {
            opt_cx = sub_block(bcx, "match_case");
            alt kind {
              single { Br(bcx, opt_cx.llbb); }
              switch {
                alt check trans_opt(bcx, opt) {
                  single_result(r) {
                    llvm::LLVMAddCase(sw, r.val, opt_cx.llbb);
                    bcx = r.bcx;
                  }
                }
              }
              compare {
                let t = node_id_type(bcx, pat_id);
                let {bcx: after_cx, val: matches} = {
                    with_scope_result(bcx, none, "compare_scope") {|bcx|
                        alt trans_opt(bcx, opt) {
                          single_result({bcx, val}) {
                            trans_compare(bcx, ast::eq, test_val, t, val, t)
                          }
                          range_result({val: vbegin, _}, {bcx, val: vend}) {
                            let {bcx, val: ge} = trans_compare(
                                bcx, ast::ge, test_val, t, vbegin, t);
                            let {bcx, val: le} = trans_compare(
                                bcx, ast::le, test_val, t, vend, t);
                            {bcx: bcx, val: And(bcx, ge, le)}
                          }
                        }
                    }
                };
                bcx = sub_block(after_cx, "compare_next");
                CondBr(after_cx, matches, opt_cx.llbb, bcx.llbb);
              }
              _ { }
            }
        } else if kind == compare { Br(bcx, else_cx.llbb); }
        let mut size = 0u;
        let mut unpacked = [];
        alt opt {
          var(_, vdef) {
            let args = extract_variant_args(opt_cx, pat_id, vdef, val);
            size = args.vals.len();
            unpacked = args.vals;
            opt_cx = args.bcx;
          }
          lit(_) | range(_, _) { }
        }
        compile_submatch(opt_cx, enter_opt(tcx, m, opt, col, size, val),
                         unpacked + vals_left, chk, exits);
    }

    // Compile the fall-through case, if any
    if !exhaustive {
        if kind == compare { Br(bcx, else_cx.llbb); }
        if kind != single {
            compile_submatch(else_cx, defaults, vals_left, chk, exits);
        }
    }
}

// Returns false for unreachable blocks
fn make_phi_bindings(bcx: block, map: [exit_node],
                     ids: pat_util::pat_id_map) -> bool {
    let _icx = bcx.insn_ctxt("alt::make_phi_bindings");
    let our_block = bcx.llbb as uint;
    let mut success = true, bcx = bcx;
    for ids.each {|name, node_id|
        let mut llbbs = [];
        let mut vals = [];
        for vec::each(map) {|ex|
            if ex.to as uint == our_block {
                alt assoc(name, ex.bound) {
                  some(val) { llbbs += [ex.from]; vals += [val]; }
                  none { }
                }
            }
        }
        if vals.len() > 0u {
            let local = Phi(bcx, val_ty(vals[0]), vals, llbbs);
            bcx.fcx.lllocals.insert(node_id, local_mem(local));
        } else { success = false; }
    };
    if !success {
        Unreachable(bcx);
    }
    ret success;
}

fn trans_alt(bcx: block,
             alt_expr: @ast::expr,
             expr: @ast::expr,
             arms: [ast::arm],
             mode: ast::alt_mode,
             dest: dest) -> block {
    let _icx = bcx.insn_ctxt("alt::trans_alt");
    with_scope(bcx, alt_expr.info(), "alt") {|bcx|
        trans_alt_inner(bcx, expr, arms, mode, dest)
    }
}

fn trans_alt_inner(scope_cx: block, expr: @ast::expr, arms: [ast::arm],
                   mode: ast::alt_mode, dest: dest) -> block {
    let _icx = scope_cx.insn_ctxt("alt::trans_alt_inner");
    let bcx = scope_cx, tcx = bcx.tcx();
    let mut bodies = [], match = [];

    let {bcx, val, _} = trans_temp_expr(bcx, expr);
    if bcx.unreachable { ret bcx; }

    for vec::each(arms) {|a|
        let body = scope_block(bcx, a.body.info(), "case_body");
        let id_map = pat_util::pat_id_map(tcx.def_map, a.pats[0]);
        bodies += [body];
        for vec::each(a.pats) {|p|
            match += [@{pats: [p],
                        bound: [],
                        data: @{bodycx: body, guard: a.guard,
                                id_map: id_map}}];
        }
    }

    let mk_fail = alt mode {
      ast::alt_check {
        // Cached fail-on-fallthrough block
        let fail_cx = @mut none;
        fn mk_fail(bcx: block, sp: span,
                   done: @mut option<BasicBlockRef>) -> BasicBlockRef {
            alt *done { some(bb) { ret bb; } _ { } }
            let fail_cx = sub_block(bcx, "case_fallthrough");
            trans_fail(fail_cx, some(sp), "non-exhaustive match failure");;
            *done = some(fail_cx.llbb);
            ret fail_cx.llbb;
        }
        some(bind mk_fail(scope_cx, expr.span, fail_cx))
      }
      ast::alt_exhaustive { none }
    };
    let mut exit_map = [];
    let t = node_id_type(bcx, expr.id);
    let spilled = spill_if_immediate(bcx, val, t);
    compile_submatch(bcx, match, [spilled], mk_fail, exit_map);

    let mut arm_cxs = [], arm_dests = [], i = 0u;
    for vec::each(arms) {|a|
        let body_cx = bodies[i];
        let id_map = pat_util::pat_id_map(tcx.def_map, a.pats[0]);
        if make_phi_bindings(body_cx, exit_map, id_map) {
            let arm_dest = dup_for_join(dest);
            arm_dests += [arm_dest];
            let mut arm_cx = trans_block(body_cx, a.body, arm_dest);
            arm_cx = trans_block_cleanups(arm_cx, body_cx);
            arm_cxs += [arm_cx];
        }
        i += 1u;
    }
    join_returns(scope_cx, arm_cxs, arm_dests, dest)
}

// Not alt-related, but similar to the pattern-munging code above
fn bind_irrefutable_pat(bcx: block, pat: @ast::pat, val: ValueRef,
                        make_copy: bool) -> block {
    let _icx = bcx.insn_ctxt("alt::bind_irrefutable_pat");
    let ccx = bcx.fcx.ccx;
    let mut bcx = bcx;

    // Necessary since bind_irrefutable_pat is called outside trans_alt
    alt pat.node {
      ast::pat_ident(_,inner) {
        if pat_is_variant(bcx.tcx().def_map, pat) { ret bcx; }
        if make_copy {
            let ty = node_id_type(bcx, pat.id);
            let llty = type_of::type_of(ccx, ty);
            let alloc = alloca(bcx, llty);
            bcx = copy_val(bcx, INIT, alloc,
                                  load_if_immediate(bcx, val, ty), ty);
            bcx.fcx.lllocals.insert(pat.id, local_mem(alloc));
            add_clean(bcx, alloc, ty);
        } else { bcx.fcx.lllocals.insert(pat.id, local_mem(val)); }
        alt inner {
          some(pat) { bcx = bind_irrefutable_pat(bcx, pat, val, true); }
          _ {}
        }
      }
      ast::pat_enum(_, sub) {
        let vdefs = ast_util::variant_def_ids(ccx.tcx.def_map.get(pat.id));
        let args = extract_variant_args(bcx, pat.id, vdefs, val);
        let mut i = 0;
        option::iter(sub) {|sub| for vec::each(args.vals) {|argval|
            bcx = bind_irrefutable_pat(bcx, sub[i], argval, make_copy);
            i += 1;
        }}
      }
      ast::pat_rec(fields, _) {
        let rec_fields = ty::get_fields(node_id_type(bcx, pat.id));
        for vec::each(fields) {|f|
            let ix = option::get(ty::field_idx(f.ident, rec_fields));
            let fldptr = GEPi(bcx, val, [0u, ix]);
            bcx = bind_irrefutable_pat(bcx, f.pat, fldptr, make_copy);
        }
      }
      ast::pat_tup(elems) {
        let mut i = 0u;
        for vec::each(elems) {|elem|
            let fldptr = GEPi(bcx, val, [0u, i]);
            bcx = bind_irrefutable_pat(bcx, elem, fldptr, make_copy);
            i += 1u;
        }
      }
      ast::pat_box(inner) {
        let box = Load(bcx, val);
        let unboxed =
            GEPi(bcx, box, [0u, abi::box_field_body]);
        bcx = bind_irrefutable_pat(bcx, inner, unboxed, true);
      }
      ast::pat_uniq(inner) {
        let box = Load(bcx, val);
        let unboxed =
            GEPi(bcx, box, [0u, abi::box_field_body]);
        bcx = bind_irrefutable_pat(bcx, inner, unboxed, true);
      }
      ast::pat_wild | ast::pat_lit(_) | ast::pat_range(_, _) { }
    }
    ret bcx;
}

// Local Variables:
// mode: rust
// fill-column: 78;
// indent-tabs-mode: nil
// c-basic-offset: 4
// buffer-file-coding-system: utf-8-unix
// End: