// Copyright 2012 The Rust Project Developers. See the COPYRIGHT // file at the top-level directory of this distribution and at // http://rust-lang.org/COPYRIGHT. // // Licensed under the Apache License, Version 2.0 or the MIT license // , at your // option. This file may not be copied, modified, or distributed // except according to those terms. /*! # Moves Computation The goal of this file is to compute which expressions/patterns/captures correspond to *moves*. This is generally a function of the context in which the expression appears as well as the expression's type. ## Examples We will use the following fragment of code to explain the various considerations. Note that in this code `x` is used after it has been moved here. This is not relevant to this pass, though the information we compute would later be used to detect this error (see the section Enforcement of Moves, below). struct Foo { a: int, b: ~int } let x: Foo = ...; let w = (x {Read}).a; // Read let y = (x {Move}).b; // Move let z = copy (x {Read}).b; // Read Let's look at these examples one by one. In the first case, `w`, the expression being assigned is `x.a`, which has `int` type. In that case, the value is read, and the container (`x`) is also read. In the second case, `y`, `x.b` is being assigned which has type `~int`. Because this type moves by default, that will be a move reference. Whenever we move from a compound expression like `x.b` (or `x[b]` or `*x` or `{x)[b].c`, etc), this invalidates all containing expressions since we do not currently permit "incomplete" variables where part of them has been moved and part has not. In this case, this means that the reference to `x` is also a move. We'll see later, though, that these kind of "partial moves", where part of the expression has been moved, are classified and stored somewhat differently. The final example (`z`) is `copy x.b`: in this case, although the expression being assigned has type `~int`, there are no moves involved. ### Patterns For each binding in a match or let pattern, we also compute a read or move designation. A move binding means that the value will be moved from the value being matched. As a result, the expression being matched (aka, the 'discriminant') is either moved or read depending on whethe the bindings move the value they bind to out of the discriminant. For examples, consider this match expression: match x {Move} { Foo { a: a {Read}, b: b {Move} } => {...} } Here, the binding `b` is value (not ref) mode, and `b` has type `~int`, and therefore the discriminant expression `x` would be incomplete so it also considered moved. In the following two examples, in contrast, the mode of `b` is either `copy` or `ref` and hence the overall result is a read: match x {Read} { Foo { a: a {Read}, b: copy b {Read} } => {...} } match x {Read} { Foo { a: a {Read}, b: ref b {Read} } => {...} } Similar reasoning can be applied to `let` expressions: let Foo { a: a {Read}, b: b {Move} } = x {Move}; let Foo { a: a {Read}, b: copy b {Read} } = x {Read}; let Foo { a: a {Read}, b: ref b {Read} } = x {Read}; ## Output The pass results in the struct `MoveMaps` which contains several maps: `moves_map` is a set containing the id of every *outermost expression* or *binding* that causes a move. Note that `moves_map` only contains the *outermost expressions* that are moved. Therefore, if you have a use of `x.b`, as in the example `y` above, the expression `x.b` would be in the `moves_map` but not `x`. The reason for this is that, for most purposes, it's only the outermost expression that is needed. The borrow checker and trans, for example, only care about the outermost expressions that are moved. It is more efficient therefore just to store those entries. Sometimes though we want to know the variables that are moved (in particular in the borrow checker). For these cases, the set `moved_variables_set` just collects the ids of variables that are moved. Finally, the `capture_map` maps from the node_id of a closure expression to an array of `CaptureVar` structs detailing which variables are captured and how (by ref, by copy, by move). ## Enforcement of Moves The enforcement of moves is done by the borrow checker. Please see the section "Moves and initialization" in `middle/borrowck/doc.rs`. ## Distributive property Copies are "distributive" over parenthesization, but blocks are considered rvalues. What this means is that, for example, neither `a.clone()` nor `(a).clone()` will move `a` (presuming that `a` has a linear type and `clone()` takes its self by reference), but `{a}.clone()` will move `a`, as would `(if cond {a} else {b}).clone()` and so on. */ use middle::pat_util::{pat_bindings}; use middle::freevars; use middle::ty; use middle::typeck::{method_map}; use util::ppaux; use util::ppaux::Repr; use util::common::indenter; use std::at_vec; use std::hashmap::{HashSet, HashMap}; use syntax::ast::*; use syntax::ast_util; use syntax::visit; use syntax::visit::vt; use syntax::codemap::span; #[deriving(Encodable, Decodable)] pub enum CaptureMode { CapCopy, // Copy the value into the closure. CapMove, // Move the value into the closure. CapRef, // Reference directly from parent stack frame (used by `&fn()`). } #[deriving(Encodable, Decodable)] pub struct CaptureVar { def: def, // Variable being accessed free span: span, // Location of an access to this variable mode: CaptureMode // How variable is being accessed } pub type CaptureMap = @mut HashMap; pub type MovesMap = @mut HashSet; /** * Set of variable node-ids that are moved. * * Note: The `VariableMovesMap` stores expression ids that * are moves, whereas this set stores the ids of the variables * that are moved at some point */ pub type MovedVariablesSet = @mut HashSet; /** See the section Output on the module comment for explanation. */ #[deriving(Clone)] pub struct MoveMaps { moves_map: MovesMap, moved_variables_set: MovedVariablesSet, capture_map: CaptureMap } #[deriving(Clone)] struct VisitContext { tcx: ty::ctxt, method_map: method_map, move_maps: MoveMaps } #[deriving(Eq)] enum UseMode { Move, // This value or something owned by it is moved. Read // Read no matter what the type. } pub fn compute_moves(tcx: ty::ctxt, method_map: method_map, crate: &Crate) -> MoveMaps { let visitor = visit::mk_vt(@visit::Visitor { visit_fn: compute_modes_for_fn, visit_expr: compute_modes_for_expr, visit_local: compute_modes_for_local, .. *visit::default_visitor() }); let visit_cx = VisitContext { tcx: tcx, method_map: method_map, move_maps: MoveMaps { moves_map: @mut HashSet::new(), capture_map: @mut HashMap::new(), moved_variables_set: @mut HashSet::new() } }; visit::visit_crate(crate, (visit_cx, visitor)); return visit_cx.move_maps; } pub fn moved_variable_node_id_from_def(def: def) -> Option { match def { def_binding(nid, _) | def_arg(nid, _) | def_local(nid, _) | def_self(nid, _) => Some(nid), _ => None } } /////////////////////////////////////////////////////////////////////////// // Expressions fn compute_modes_for_local<'a>(local: @Local, (cx, v): (VisitContext, vt)) { cx.use_pat(local.pat); for local.init.iter().advance |&init| { cx.use_expr(init, Read, v); } } fn compute_modes_for_fn(fk: &visit::fn_kind, decl: &fn_decl, body: &Block, span: span, id: NodeId, (cx, v): (VisitContext, vt)) { for decl.inputs.iter().advance |a| { cx.use_pat(a.pat); } visit::visit_fn(fk, decl, body, span, id, (cx, v)); } fn compute_modes_for_expr(expr: @expr, (cx, v): (VisitContext, vt)) { cx.consume_expr(expr, v); } impl VisitContext { pub fn consume_exprs(&self, exprs: &[@expr], visitor: vt) { for exprs.iter().advance |expr| { self.consume_expr(*expr, visitor); } } pub fn consume_expr(&self, expr: @expr, visitor: vt) { /*! * Indicates that the value of `expr` will be consumed, * meaning either copied or moved depending on its type. */ debug!("consume_expr(expr=%s)", expr.repr(self.tcx)); let expr_ty = ty::expr_ty_adjusted(self.tcx, expr); if ty::type_moves_by_default(self.tcx, expr_ty) { self.move_maps.moves_map.insert(expr.id); self.use_expr(expr, Move, visitor); } else { self.use_expr(expr, Read, visitor); }; } pub fn consume_block(&self, blk: &Block, visitor: vt) { /*! * Indicates that the value of `blk` will be consumed, * meaning either copied or moved depending on its type. */ debug!("consume_block(blk.id=%?)", blk.id); for blk.stmts.iter().advance |stmt| { (visitor.visit_stmt)(*stmt, (*self, visitor)); } for blk.expr.iter().advance |tail_expr| { self.consume_expr(*tail_expr, visitor); } } pub fn use_expr(&self, expr: @expr, expr_mode: UseMode, visitor: vt) { /*! * Indicates that `expr` is used with a given mode. This will * in turn trigger calls to the subcomponents of `expr`. */ debug!("use_expr(expr=%s, mode=%?)", expr.repr(self.tcx), expr_mode); // `expr_mode` refers to the post-adjustment value. If one of // those adjustments is to take a reference, then it's only // reading the underlying expression, not moving it. let comp_mode = match self.tcx.adjustments.find(&expr.id) { Some(&@ty::AutoDerefRef( ty::AutoDerefRef { autoref: Some(_), _})) => Read, _ => expr_mode }; debug!("comp_mode = %?", comp_mode); match expr.node { expr_path(*) | expr_self => { match comp_mode { Move => { let def = self.tcx.def_map.get_copy(&expr.id); let r = moved_variable_node_id_from_def(def); for r.iter().advance |&id| { self.move_maps.moved_variables_set.insert(id); } } Read => {} } } expr_unary(_, deref, base) => { // *base if !self.use_overloaded_operator( expr, base, [], visitor) { // Moving out of *base moves out of base. self.use_expr(base, comp_mode, visitor); } } expr_field(base, _, _) => { // base.f // Moving out of base.f moves out of base. self.use_expr(base, comp_mode, visitor); } expr_index(_, lhs, rhs) => { // lhs[rhs] if !self.use_overloaded_operator( expr, lhs, [rhs], visitor) { self.use_expr(lhs, comp_mode, visitor); self.consume_expr(rhs, visitor); } } expr_call(callee, ref args, _) => { // callee(args) // Figure out whether the called function is consumed. let mode = match ty::get(ty::expr_ty(self.tcx, callee)).sty { ty::ty_closure(ref cty) => { match cty.onceness { Once => Move, Many => Read, } }, ty::ty_bare_fn(*) => Read, ref x => self.tcx.sess.span_bug(callee.span, fmt!("non-function type in moves for expr_call: %?", x)), }; // Note we're not using consume_expr, which uses type_moves_by_default // to determine the mode, for this. The reason is that while stack // closures should be noncopyable, they shouldn't move by default; // calling a closure should only consume it if it's once. if mode == Move { self.move_maps.moves_map.insert(callee.id); } self.use_expr(callee, mode, visitor); self.use_fn_args(callee.id, *args, visitor); } expr_method_call(callee_id, rcvr, _, _, ref args, _) => { // callee.m(args) // Implicit self is equivalent to & mode, but every // other kind should be + mode. self.use_receiver(rcvr, visitor); self.use_fn_args(callee_id, *args, visitor); } expr_struct(_, ref fields, opt_with) => { for fields.iter().advance |field| { self.consume_expr(field.expr, visitor); } for opt_with.iter().advance |with_expr| { // If there are any fields whose type is move-by-default, // then `with` is consumed, otherwise it is only read let with_ty = ty::expr_ty(self.tcx, *with_expr); let with_fields = match ty::get(with_ty).sty { ty::ty_struct(did, ref substs) => { ty::struct_fields(self.tcx, did, substs) } ref r => { self.tcx.sess.span_bug( with_expr.span, fmt!("bad base expr type in record: %?", r)) } }; // The `with` expr must be consumed if it contains // any fields which (1) were not explicitly // specified and (2) have a type that // moves-by-default: let consume_with = with_fields.iter().any(|tf| { !fields.iter().any(|f| f.ident == tf.ident) && ty::type_moves_by_default(self.tcx, tf.mt.ty) }); if consume_with { self.consume_expr(*with_expr, visitor); } else { self.use_expr(*with_expr, Read, visitor); } } } expr_tup(ref exprs) => { self.consume_exprs(*exprs, visitor); } expr_if(cond_expr, ref then_blk, opt_else_expr) => { self.consume_expr(cond_expr, visitor); self.consume_block(then_blk, visitor); for opt_else_expr.iter().advance |else_expr| { self.consume_expr(*else_expr, visitor); } } expr_match(discr, ref arms) => { // We must do this first so that `arms_have_by_move_bindings` // below knows which bindings are moves. for arms.iter().advance |arm| { self.consume_arm(arm, visitor); } // The discriminant may, in fact, be partially moved // if there are by-move bindings, but borrowck deals // with that itself. self.use_expr(discr, Read, visitor); } expr_paren(base) => { // Note: base is not considered a *component* here, so // use `expr_mode` not `comp_mode`. self.use_expr(base, expr_mode, visitor); } expr_vec(ref exprs, _) => { self.consume_exprs(*exprs, visitor); } expr_addr_of(_, base) => { // &base self.use_expr(base, Read, visitor); } expr_inline_asm(*) | expr_break(*) | expr_again(*) | expr_lit(*) => {} expr_loop(ref blk, _) => { self.consume_block(blk, visitor); } expr_log(a_expr, b_expr) => { self.consume_expr(a_expr, visitor); self.use_expr(b_expr, Read, visitor); } expr_while(cond_expr, ref blk) => { self.consume_expr(cond_expr, visitor); self.consume_block(blk, visitor); } expr_unary(_, _, lhs) => { if !self.use_overloaded_operator( expr, lhs, [], visitor) { self.consume_expr(lhs, visitor); } } expr_binary(_, _, lhs, rhs) => { if !self.use_overloaded_operator( expr, lhs, [rhs], visitor) { self.consume_expr(lhs, visitor); self.consume_expr(rhs, visitor); } } expr_block(ref blk) => { self.consume_block(blk, visitor); } expr_ret(ref opt_expr) => { for opt_expr.iter().advance |expr| { self.consume_expr(*expr, visitor); } } expr_assign(lhs, rhs) => { self.use_expr(lhs, Read, visitor); self.consume_expr(rhs, visitor); } expr_cast(base, _) => { self.consume_expr(base, visitor); } expr_assign_op(_, _, lhs, rhs) => { // FIXME(#4712) --- Overloaded operators? // // if !self.use_overloaded_operator( // expr, DoDerefArgs, lhs, [rhs], visitor) // { self.consume_expr(lhs, visitor); self.consume_expr(rhs, visitor); // } } expr_repeat(base, count, _) => { self.consume_expr(base, visitor); self.consume_expr(count, visitor); } expr_loop_body(base) | expr_do_body(base) => { self.use_expr(base, comp_mode, visitor); } expr_fn_block(ref decl, ref body) => { for decl.inputs.iter().advance |a| { self.use_pat(a.pat); } let cap_vars = self.compute_captures(expr.id); self.move_maps.capture_map.insert(expr.id, cap_vars); self.consume_block(body, visitor); } expr_vstore(base, _) => { self.use_expr(base, comp_mode, visitor); } expr_mac(*) => { self.tcx.sess.span_bug( expr.span, "macro expression remains after expansion"); } } } pub fn use_overloaded_operator(&self, expr: &expr, receiver_expr: @expr, arg_exprs: &[@expr], visitor: vt) -> bool { if !self.method_map.contains_key(&expr.id) { return false; } self.use_receiver(receiver_expr, visitor); // for overloaded operatrs, we are always passing in a // borrowed pointer, so it's always read mode: for arg_exprs.iter().advance |arg_expr| { self.use_expr(*arg_expr, Read, visitor); } return true; } pub fn consume_arm(&self, arm: &arm, visitor: vt) { for arm.pats.iter().advance |pat| { self.use_pat(*pat); } for arm.guard.iter().advance |guard| { self.consume_expr(*guard, visitor); } self.consume_block(&arm.body, visitor); } pub fn use_pat(&self, pat: @pat) { /*! * * Decides whether each binding in a pattern moves the value * into itself or not based on its type and annotation. */ do pat_bindings(self.tcx.def_map, pat) |bm, id, _span, path| { let binding_moves = match bm { bind_by_ref(_) => false, bind_infer => { let pat_ty = ty::node_id_to_type(self.tcx, id); debug!("pattern %? %s type is %s", id, ast_util::path_to_ident(path).repr(self.tcx), pat_ty.repr(self.tcx)); ty::type_moves_by_default(self.tcx, pat_ty) } }; debug!("pattern binding %?: bm=%?, binding_moves=%b", id, bm, binding_moves); if binding_moves { self.move_maps.moves_map.insert(id); } } } pub fn use_receiver(&self, receiver_expr: @expr, visitor: vt) { self.use_fn_arg(receiver_expr, visitor); } pub fn use_fn_args(&self, _: NodeId, arg_exprs: &[@expr], visitor: vt) { //! Uses the argument expressions. for arg_exprs.iter().advance |arg_expr| { self.use_fn_arg(*arg_expr, visitor); } } pub fn use_fn_arg(&self, arg_expr: @expr, visitor: vt) { //! Uses the argument. self.consume_expr(arg_expr, visitor) } pub fn arms_have_by_move_bindings(&self, moves_map: MovesMap, arms: &[arm]) -> Option<@pat> { for arms.iter().advance |arm| { for arm.pats.iter().advance |&pat| { for ast_util::walk_pat(pat) |p| { if moves_map.contains(&p.id) { return Some(p); } } } } return None; } pub fn compute_captures(&self, fn_expr_id: NodeId) -> @[CaptureVar] { debug!("compute_capture_vars(fn_expr_id=%?)", fn_expr_id); let _indenter = indenter(); let fn_ty = ty::node_id_to_type(self.tcx, fn_expr_id); let sigil = ty::ty_closure_sigil(fn_ty); let freevars = freevars::get_freevars(self.tcx, fn_expr_id); if sigil == BorrowedSigil { // &fn() captures everything by ref at_vec::from_fn(freevars.len(), |i| { let fvar = &freevars[i]; CaptureVar {def: fvar.def, span: fvar.span, mode: CapRef} }) } else { // @fn() and ~fn() capture by copy or by move depending on type at_vec::from_fn(freevars.len(), |i| { let fvar = &freevars[i]; let fvar_def_id = ast_util::def_id_of_def(fvar.def).node; let fvar_ty = ty::node_id_to_type(self.tcx, fvar_def_id); debug!("fvar_def_id=%? fvar_ty=%s", fvar_def_id, ppaux::ty_to_str(self.tcx, fvar_ty)); let mode = if ty::type_moves_by_default(self.tcx, fvar_ty) { CapMove } else { CapCopy }; CaptureVar {def: fvar.def, span: fvar.span, mode:mode} }) } } }