//! A different sort of visitor for walking fn bodies. Unlike the //! normal visitor, which just walks the entire body in one shot, the //! `ExprUseVisitor` determines how expressions are being used. pub use self::LoanCause::*; pub use self::ConsumeMode::*; pub use self::MoveReason::*; pub use self::MatchMode::*; use self::TrackMatchMode::*; use self::OverloadedCallType::*; use crate::hir::def::{CtorOf, Def}; use crate::hir::def_id::DefId; use crate::infer::InferCtxt; use crate::middle::mem_categorization as mc; use crate::middle::region; use crate::ty::{self, DefIdTree, TyCtxt, adjustment}; use crate::hir::{self, PatKind}; use std::rc::Rc; use syntax::ptr::P; use syntax_pos::Span; use crate::util::nodemap::ItemLocalSet; /////////////////////////////////////////////////////////////////////////// // The Delegate trait /// This trait defines the callbacks you can expect to receive when /// employing the ExprUseVisitor. pub trait Delegate<'tcx> { // The value found at `cmt` is either copied or moved, depending // on mode. fn consume(&mut self, consume_id: hir::HirId, consume_span: Span, cmt: &mc::cmt_<'tcx>, mode: ConsumeMode); // The value found at `cmt` has been determined to match the // pattern binding `matched_pat`, and its subparts are being // copied or moved depending on `mode`. Note that `matched_pat` // is called on all variant/structs in the pattern (i.e., the // interior nodes of the pattern's tree structure) while // consume_pat is called on the binding identifiers in the pattern // (which are leaves of the pattern's tree structure). // // Note that variants/structs and identifiers are disjoint; thus // `matched_pat` and `consume_pat` are never both called on the // same input pattern structure (though of `consume_pat` can be // called on a subpart of an input passed to `matched_pat). fn matched_pat(&mut self, matched_pat: &hir::Pat, cmt: &mc::cmt_<'tcx>, mode: MatchMode); // The value found at `cmt` is either copied or moved via the // pattern binding `consume_pat`, depending on mode. fn consume_pat(&mut self, consume_pat: &hir::Pat, cmt: &mc::cmt_<'tcx>, mode: ConsumeMode); // The value found at `borrow` is being borrowed at the point // `borrow_id` for the region `loan_region` with kind `bk`. fn borrow(&mut self, borrow_id: hir::HirId, borrow_span: Span, cmt: &mc::cmt_<'tcx>, loan_region: ty::Region<'tcx>, bk: ty::BorrowKind, loan_cause: LoanCause); // The local variable `id` is declared but not initialized. fn decl_without_init(&mut self, id: hir::HirId, span: Span); // The path at `cmt` is being assigned to. fn mutate(&mut self, assignment_id: hir::HirId, assignment_span: Span, assignee_cmt: &mc::cmt_<'tcx>, mode: MutateMode); // A nested closure or generator - only one layer deep. fn nested_body(&mut self, _body_id: hir::BodyId) {} } #[derive(Copy, Clone, PartialEq, Debug)] pub enum LoanCause { ClosureCapture(Span), AddrOf, AutoRef, AutoUnsafe, RefBinding, OverloadedOperator, ClosureInvocation, ForLoop, MatchDiscriminant } #[derive(Copy, Clone, PartialEq, Debug)] pub enum ConsumeMode { Copy, // reference to x where x has a type that copies Move(MoveReason), // reference to x where x has a type that moves } #[derive(Copy, Clone, PartialEq, Debug)] pub enum MoveReason { DirectRefMove, PatBindingMove, CaptureMove, } #[derive(Copy, Clone, PartialEq, Debug)] pub enum MatchMode { NonBindingMatch, BorrowingMatch, CopyingMatch, MovingMatch, } #[derive(Copy, Clone, PartialEq, Debug)] enum TrackMatchMode { Unknown, Definite(MatchMode), Conflicting, } impl TrackMatchMode { // Builds up the whole match mode for a pattern from its constituent // parts. The lattice looks like this: // // Conflicting // / \ // / \ // Borrowing Moving // \ / // \ / // Copying // | // NonBinding // | // Unknown // // examples: // // * `(_, some_int)` pattern is Copying, since // NonBinding + Copying => Copying // // * `(some_int, some_box)` pattern is Moving, since // Copying + Moving => Moving // // * `(ref x, some_box)` pattern is Conflicting, since // Borrowing + Moving => Conflicting // // Note that the `Unknown` and `Conflicting` states are // represented separately from the other more interesting // `Definite` states, which simplifies logic here somewhat. fn lub(&mut self, mode: MatchMode) { *self = match (*self, mode) { // Note that clause order below is very significant. (Unknown, new) => Definite(new), (Definite(old), new) if old == new => Definite(old), (Definite(old), NonBindingMatch) => Definite(old), (Definite(NonBindingMatch), new) => Definite(new), (Definite(old), CopyingMatch) => Definite(old), (Definite(CopyingMatch), new) => Definite(new), (Definite(_), _) => Conflicting, (Conflicting, _) => *self, }; } fn match_mode(&self) -> MatchMode { match *self { Unknown => NonBindingMatch, Definite(mode) => mode, Conflicting => { // Conservatively return MovingMatch to let the // compiler continue to make progress. MovingMatch } } } } #[derive(Copy, Clone, PartialEq, Debug)] pub enum MutateMode { Init, JustWrite, // x = y WriteAndRead, // x += y } #[derive(Copy, Clone)] enum OverloadedCallType { FnOverloadedCall, FnMutOverloadedCall, FnOnceOverloadedCall, } impl OverloadedCallType { fn from_trait_id(tcx: TyCtxt<'_, '_, '_>, trait_id: DefId) -> OverloadedCallType { for &(maybe_function_trait, overloaded_call_type) in &[ (tcx.lang_items().fn_once_trait(), FnOnceOverloadedCall), (tcx.lang_items().fn_mut_trait(), FnMutOverloadedCall), (tcx.lang_items().fn_trait(), FnOverloadedCall) ] { match maybe_function_trait { Some(function_trait) if function_trait == trait_id => { return overloaded_call_type } _ => continue, } } bug!("overloaded call didn't map to known function trait") } fn from_method_id(tcx: TyCtxt<'_, '_, '_>, method_id: DefId) -> OverloadedCallType { let method = tcx.associated_item(method_id); OverloadedCallType::from_trait_id(tcx, method.container.id()) } } /////////////////////////////////////////////////////////////////////////// // The ExprUseVisitor type // // This is the code that actually walks the tree. pub struct ExprUseVisitor<'a, 'gcx: 'a+'tcx, 'tcx: 'a> { mc: mc::MemCategorizationContext<'a, 'gcx, 'tcx>, delegate: &'a mut dyn Delegate<'tcx>, param_env: ty::ParamEnv<'tcx>, } // If the MC results in an error, it's because the type check // failed (or will fail, when the error is uncovered and reported // during writeback). In this case, we just ignore this part of the // code. // // Note that this macro appears similar to try!(), but, unlike try!(), // it does not propagate the error. macro_rules! return_if_err { ($inp: expr) => ( match $inp { Ok(v) => v, Err(()) => { debug!("mc reported err"); return } } ) } impl<'a, 'tcx> ExprUseVisitor<'a, 'tcx, 'tcx> { /// Creates the ExprUseVisitor, configuring it with the various options provided: /// /// - `delegate` -- who receives the callbacks /// - `param_env` --- parameter environment for trait lookups (esp. pertaining to `Copy`) /// - `region_scope_tree` --- region scope tree for the code being analyzed /// - `tables` --- typeck results for the code being analyzed /// - `rvalue_promotable_map` --- if you care about rvalue promotion, then provide /// the map here (it can be computed with `tcx.rvalue_promotable_map(def_id)`). /// `None` means that rvalues will be given more conservative lifetimes. /// /// See also `with_infer`, which is used *during* typeck. pub fn new(delegate: &'a mut (dyn Delegate<'tcx>+'a), tcx: TyCtxt<'a, 'tcx, 'tcx>, param_env: ty::ParamEnv<'tcx>, region_scope_tree: &'a region::ScopeTree, tables: &'a ty::TypeckTables<'tcx>, rvalue_promotable_map: Option<&'tcx ItemLocalSet>) -> Self { ExprUseVisitor { mc: mc::MemCategorizationContext::new(tcx, region_scope_tree, tables, rvalue_promotable_map), delegate, param_env, } } } impl<'a, 'gcx, 'tcx> ExprUseVisitor<'a, 'gcx, 'tcx> { pub fn with_infer(delegate: &'a mut (dyn Delegate<'tcx>+'a), infcx: &'a InferCtxt<'a, 'gcx, 'tcx>, param_env: ty::ParamEnv<'tcx>, region_scope_tree: &'a region::ScopeTree, tables: &'a ty::TypeckTables<'tcx>) -> Self { ExprUseVisitor { mc: mc::MemCategorizationContext::with_infer(infcx, region_scope_tree, tables), delegate, param_env, } } pub fn consume_body(&mut self, body: &hir::Body) { debug!("consume_body(body={:?})", body); for arg in &body.arguments { let arg_ty = return_if_err!(self.mc.pat_ty_adjusted(&arg.pat)); debug!("consume_body: arg_ty = {:?}", arg_ty); let fn_body_scope_r = self.tcx().mk_region(ty::ReScope( region::Scope { id: body.value.hir_id.local_id, data: region::ScopeData::Node })); let arg_cmt = Rc::new(self.mc.cat_rvalue( arg.hir_id, arg.pat.span, fn_body_scope_r, // Args live only as long as the fn body. arg_ty)); self.walk_irrefutable_pat(arg_cmt, &arg.pat); } self.consume_expr(&body.value); } fn tcx(&self) -> TyCtxt<'a, 'gcx, 'tcx> { self.mc.tcx } fn delegate_consume(&mut self, consume_id: hir::HirId, consume_span: Span, cmt: &mc::cmt_<'tcx>) { debug!("delegate_consume(consume_id={}, cmt={:?})", consume_id, cmt); let mode = copy_or_move(&self.mc, self.param_env, cmt, DirectRefMove); self.delegate.consume(consume_id, consume_span, cmt, mode); } fn consume_exprs(&mut self, exprs: &[hir::Expr]) { for expr in exprs { self.consume_expr(&expr); } } pub fn consume_expr(&mut self, expr: &hir::Expr) { debug!("consume_expr(expr={:?})", expr); let cmt = return_if_err!(self.mc.cat_expr(expr)); self.delegate_consume(expr.hir_id, expr.span, &cmt); self.walk_expr(expr); } fn mutate_expr(&mut self, span: Span, assignment_expr: &hir::Expr, expr: &hir::Expr, mode: MutateMode) { let cmt = return_if_err!(self.mc.cat_expr(expr)); self.delegate.mutate(assignment_expr.hir_id, span, &cmt, mode); self.walk_expr(expr); } fn borrow_expr(&mut self, expr: &hir::Expr, r: ty::Region<'tcx>, bk: ty::BorrowKind, cause: LoanCause) { debug!("borrow_expr(expr={:?}, r={:?}, bk={:?})", expr, r, bk); let cmt = return_if_err!(self.mc.cat_expr(expr)); self.delegate.borrow(expr.hir_id, expr.span, &cmt, r, bk, cause); self.walk_expr(expr) } fn select_from_expr(&mut self, expr: &hir::Expr) { self.walk_expr(expr) } pub fn walk_expr(&mut self, expr: &hir::Expr) { debug!("walk_expr(expr={:?})", expr); self.walk_adjustment(expr); match expr.node { hir::ExprKind::Path(_) => { } hir::ExprKind::Type(ref subexpr, _) => { self.walk_expr(&subexpr) } hir::ExprKind::Unary(hir::UnDeref, ref base) => { // *base self.select_from_expr(&base); } hir::ExprKind::Field(ref base, _) => { // base.f self.select_from_expr(&base); } hir::ExprKind::Index(ref lhs, ref rhs) => { // lhs[rhs] self.select_from_expr(&lhs); self.consume_expr(&rhs); } hir::ExprKind::Call(ref callee, ref args) => { // callee(args) self.walk_callee(expr, &callee); self.consume_exprs(args); } hir::ExprKind::MethodCall(.., ref args) => { // callee.m(args) self.consume_exprs(args); } hir::ExprKind::Struct(_, ref fields, ref opt_with) => { self.walk_struct_expr(fields, opt_with); } hir::ExprKind::Tup(ref exprs) => { self.consume_exprs(exprs); } hir::ExprKind::If(ref cond_expr, ref then_expr, ref opt_else_expr) => { self.consume_expr(&cond_expr); self.walk_expr(&then_expr); if let Some(ref else_expr) = *opt_else_expr { self.consume_expr(&else_expr); } } hir::ExprKind::Match(ref discr, ref arms, _) => { let discr_cmt = Rc::new(return_if_err!(self.mc.cat_expr(&discr))); let r = self.tcx().types.re_empty; self.borrow_expr(&discr, r, ty::ImmBorrow, MatchDiscriminant); // treatment of the discriminant is handled while walking the arms. for arm in arms { let mode = self.arm_move_mode(discr_cmt.clone(), arm); let mode = mode.match_mode(); self.walk_arm(discr_cmt.clone(), arm, mode); } } hir::ExprKind::Array(ref exprs) => { self.consume_exprs(exprs); } hir::ExprKind::AddrOf(m, ref base) => { // &base // make sure that the thing we are pointing out stays valid // for the lifetime `scope_r` of the resulting ptr: let expr_ty = return_if_err!(self.mc.expr_ty(expr)); if let ty::Ref(r, _, _) = expr_ty.sty { let bk = ty::BorrowKind::from_mutbl(m); self.borrow_expr(&base, r, bk, AddrOf); } } hir::ExprKind::InlineAsm(ref ia, ref outputs, ref inputs) => { for (o, output) in ia.outputs.iter().zip(outputs) { if o.is_indirect { self.consume_expr(output); } else { self.mutate_expr( output.span, expr, output, if o.is_rw { MutateMode::WriteAndRead } else { MutateMode::JustWrite }, ); } } self.consume_exprs(inputs); } hir::ExprKind::Continue(..) | hir::ExprKind::Lit(..) | hir::ExprKind::Err => {} hir::ExprKind::Loop(ref blk, _, _) => { self.walk_block(&blk); } hir::ExprKind::While(ref cond_expr, ref blk, _) => { self.consume_expr(&cond_expr); self.walk_block(&blk); } hir::ExprKind::Unary(_, ref lhs) => { self.consume_expr(&lhs); } hir::ExprKind::Binary(_, ref lhs, ref rhs) => { self.consume_expr(&lhs); self.consume_expr(&rhs); } hir::ExprKind::Block(ref blk, _) => { self.walk_block(&blk); } hir::ExprKind::Break(_, ref opt_expr) | hir::ExprKind::Ret(ref opt_expr) => { if let Some(ref expr) = *opt_expr { self.consume_expr(&expr); } } hir::ExprKind::Assign(ref lhs, ref rhs) => { self.mutate_expr(expr.span, expr, &lhs, MutateMode::JustWrite); self.consume_expr(&rhs); } hir::ExprKind::Cast(ref base, _) => { self.consume_expr(&base); } hir::ExprKind::Use(ref expr) => { self.consume_expr(&expr); } hir::ExprKind::AssignOp(_, ref lhs, ref rhs) => { if self.mc.tables.is_method_call(expr) { self.consume_expr(lhs); } else { self.mutate_expr(expr.span, expr, &lhs, MutateMode::WriteAndRead); } self.consume_expr(&rhs); } hir::ExprKind::Repeat(ref base, _) => { self.consume_expr(&base); } hir::ExprKind::Closure(_, _, body_id, fn_decl_span, _) => { self.delegate.nested_body(body_id); self.walk_captures(expr, fn_decl_span); } hir::ExprKind::Box(ref base) => { self.consume_expr(&base); } hir::ExprKind::Yield(ref value) => { self.consume_expr(&value); } } } fn walk_callee(&mut self, call: &hir::Expr, callee: &hir::Expr) { let callee_ty = return_if_err!(self.mc.expr_ty_adjusted(callee)); debug!("walk_callee: callee={:?} callee_ty={:?}", callee, callee_ty); match callee_ty.sty { ty::FnDef(..) | ty::FnPtr(_) => { self.consume_expr(callee); } ty::Error => { } _ => { if let Some(def_id) = self.mc.tables.type_dependent_def_id(call.hir_id) { let call_scope = region::Scope { id: call.hir_id.local_id, data: region::ScopeData::Node }; match OverloadedCallType::from_method_id(self.tcx(), def_id) { FnMutOverloadedCall => { let call_scope_r = self.tcx().mk_region(ty::ReScope(call_scope)); self.borrow_expr(callee, call_scope_r, ty::MutBorrow, ClosureInvocation); } FnOverloadedCall => { let call_scope_r = self.tcx().mk_region(ty::ReScope(call_scope)); self.borrow_expr(callee, call_scope_r, ty::ImmBorrow, ClosureInvocation); } FnOnceOverloadedCall => self.consume_expr(callee), } } else { self.tcx().sess.delay_span_bug(call.span, "no type-dependent def for overloaded call"); } } } } fn walk_stmt(&mut self, stmt: &hir::Stmt) { match stmt.node { hir::StmtKind::Local(ref local) => { self.walk_local(&local); } hir::StmtKind::Item(_) => { // we don't visit nested items in this visitor, // only the fn body we were given. } hir::StmtKind::Expr(ref expr) | hir::StmtKind::Semi(ref expr) => { self.consume_expr(&expr); } } } fn walk_local(&mut self, local: &hir::Local) { match local.init { None => { local.pat.each_binding(|_, hir_id, span, _| { self.delegate.decl_without_init(hir_id, span); }) } Some(ref expr) => { // Variable declarations with // initializers are considered // "assigns", which is handled by // `walk_pat`: self.walk_expr(&expr); let init_cmt = Rc::new(return_if_err!(self.mc.cat_expr(&expr))); self.walk_irrefutable_pat(init_cmt, &local.pat); } } } /// Indicates that the value of `blk` will be consumed, meaning either copied or moved /// depending on its type. fn walk_block(&mut self, blk: &hir::Block) { debug!("walk_block(blk.hir_id={})", blk.hir_id); for stmt in &blk.stmts { self.walk_stmt(stmt); } if let Some(ref tail_expr) = blk.expr { self.consume_expr(&tail_expr); } } fn walk_struct_expr(&mut self, fields: &[hir::Field], opt_with: &Option
>) {
// Consume the expressions supplying values for each field.
for field in fields {
self.consume_expr(&field.expr);
}
let with_expr = match *opt_with {
Some(ref w) => &**w,
None => { return; }
};
let with_cmt = Rc::new(return_if_err!(self.mc.cat_expr(&with_expr)));
// Select just those fields of the `with`
// expression that will actually be used
match with_cmt.ty.sty {
ty::Adt(adt, substs) if adt.is_struct() => {
// Consume those fields of the with expression that are needed.
for (f_index, with_field) in adt.non_enum_variant().fields.iter().enumerate() {
let is_mentioned = fields.iter().any(|f| {
self.tcx().field_index(f.hir_id, self.mc.tables) == f_index
});
if !is_mentioned {
let cmt_field = self.mc.cat_field(
&*with_expr,
with_cmt.clone(),
f_index,
with_field.ident,
with_field.ty(self.tcx(), substs)
);
self.delegate_consume(with_expr.hir_id, with_expr.span, &cmt_field);
}
}
}
_ => {
// the base expression should always evaluate to a
// struct; however, when EUV is run during typeck, it
// may not. This will generate an error earlier in typeck,
// so we can just ignore it.
if !self.tcx().sess.has_errors() {
span_bug!(
with_expr.span,
"with expression doesn't evaluate to a struct");
}
}
}
// walk the with expression so that complex expressions
// are properly handled.
self.walk_expr(with_expr);
}
// Invoke the appropriate delegate calls for anything that gets
// consumed or borrowed as part of the automatic adjustment
// process.
fn walk_adjustment(&mut self, expr: &hir::Expr) {
let adjustments = self.mc.tables.expr_adjustments(expr);
let mut cmt = return_if_err!(self.mc.cat_expr_unadjusted(expr));
for adjustment in adjustments {
debug!("walk_adjustment expr={:?} adj={:?}", expr, adjustment);
match adjustment.kind {
adjustment::Adjust::NeverToAny |
adjustment::Adjust::Pointer(_) => {
// Creating a closure/fn-pointer or unsizing consumes
// the input and stores it into the resulting rvalue.
self.delegate_consume(expr.hir_id, expr.span, &cmt);
}
adjustment::Adjust::Deref(None) => {}
// Autoderefs for overloaded Deref calls in fact reference
// their receiver. That is, if we have `(*x)` where `x`
// is of type `Rc