1 // Copyright 2012-2014 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 //! A classic liveness analysis based on dataflow over the AST. Computes,
12 //! for each local variable in a function, whether that variable is live
13 //! at a given point. Program execution points are identified by their
18 //! The basic model is that each local variable is assigned an index. We
19 //! represent sets of local variables using a vector indexed by this
20 //! index. The value in the vector is either 0, indicating the variable
21 //! is dead, or the id of an expression that uses the variable.
23 //! We conceptually walk over the AST in reverse execution order. If we
24 //! find a use of a variable, we add it to the set of live variables. If
25 //! we find an assignment to a variable, we remove it from the set of live
26 //! variables. When we have to merge two flows, we take the union of
27 //! those two flows---if the variable is live on both paths, we simply
28 //! pick one id. In the event of loops, we continue doing this until a
29 //! fixed point is reached.
31 //! ## Checking initialization
33 //! At the function entry point, all variables must be dead. If this is
34 //! not the case, we can report an error using the id found in the set of
35 //! live variables, which identifies a use of the variable which is not
36 //! dominated by an assignment.
40 //! After each explicit move, the variable must be dead.
42 //! ## Computing last uses
44 //! Any use of the variable where the variable is dead afterwards is a
47 //! # Implementation details
49 //! The actual implementation contains two (nested) walks over the AST.
50 //! The outer walk has the job of building up the ir_maps instance for the
51 //! enclosing function. On the way down the tree, it identifies those AST
52 //! nodes and variable IDs that will be needed for the liveness analysis
53 //! and assigns them contiguous IDs. The liveness id for an AST node is
54 //! called a `live_node` (it's a newtype'd u32) and the id for a variable
55 //! is called a `variable` (another newtype'd u32).
57 //! On the way back up the tree, as we are about to exit from a function
58 //! declaration we allocate a `liveness` instance. Now that we know
59 //! precisely how many nodes and variables we need, we can allocate all
60 //! the various arrays that we will need to precisely the right size. We then
61 //! perform the actual propagation on the `liveness` instance.
63 //! This propagation is encoded in the various `propagate_through_*()`
64 //! methods. It effectively does a reverse walk of the AST; whenever we
65 //! reach a loop node, we iterate until a fixed point is reached.
67 //! ## The `Users` struct
69 //! At each live node `N`, we track three pieces of information for each
70 //! variable `V` (these are encapsulated in the `Users` struct):
72 //! - `reader`: the `LiveNode` ID of some node which will read the value
73 //! that `V` holds on entry to `N`. Formally: a node `M` such
74 //! that there exists a path `P` from `N` to `M` where `P` does not
75 //! write `V`. If the `reader` is `invalid_node()`, then the current
76 //! value will never be read (the variable is dead, essentially).
78 //! - `writer`: the `LiveNode` ID of some node which will write the
79 //! variable `V` and which is reachable from `N`. Formally: a node `M`
80 //! such that there exists a path `P` from `N` to `M` and `M` writes
81 //! `V`. If the `writer` is `invalid_node()`, then there is no writer
82 //! of `V` that follows `N`.
84 //! - `used`: a boolean value indicating whether `V` is *used*. We
85 //! distinguish a *read* from a *use* in that a *use* is some read that
86 //! is not just used to generate a new value. For example, `x += 1` is
87 //! a read but not a use. This is used to generate better warnings.
89 //! ## Special Variables
91 //! We generate various special variables for various, well, special purposes.
92 //! These are described in the `specials` struct:
94 //! - `exit_ln`: a live node that is generated to represent every 'exit' from
95 //! the function, whether it be by explicit return, panic, or other means.
97 //! - `fallthrough_ln`: a live node that represents a fallthrough
99 //! - `clean_exit_var`: a synthetic variable that is only 'read' from the
100 //! fallthrough node. It is only live if the function could converge
101 //! via means other than an explicit `return` expression. That is, it is
102 //! only dead if the end of the function's block can never be reached.
103 //! It is the responsibility of typeck to ensure that there are no
104 //! `return` expressions in a function declared as diverging.
105 use self::LoopKind::*;
106 use self::LiveNodeKind::*;
107 use self::VarKind::*;
110 use ty::{self, TyCtxt};
112 use errors::Applicability;
113 use util::nodemap::{NodeMap, NodeSet};
115 use std::collections::VecDeque;
117 use std::io::prelude::*;
120 use syntax::ast::{self, NodeId};
122 use syntax::symbol::keywords;
123 use syntax_pos::Span;
127 use hir::intravisit::{self, Visitor, FnKind, NestedVisitorMap};
129 /// For use with `propagate_through_loop`.
131 /// An endless `loop` loop.
133 /// A `while` loop, with the given expression as condition.
137 #[derive(Copy, Clone, PartialEq)]
138 struct Variable(u32);
140 #[derive(Copy, Clone, PartialEq)]
141 struct LiveNode(u32);
144 fn get(&self) -> usize { self.0 as usize }
148 fn get(&self) -> usize { self.0 as usize }
151 #[derive(Copy, Clone, PartialEq, Debug)]
159 fn live_node_kind_to_string(lnk: LiveNodeKind, tcx: TyCtxt) -> String {
160 let cm = tcx.sess.codemap();
163 format!("Free var node [{}]", cm.span_to_string(s))
166 format!("Expr node [{}]", cm.span_to_string(s))
169 format!("Var def node [{}]", cm.span_to_string(s))
171 ExitNode => "Exit node".to_string(),
175 impl<'a, 'tcx> Visitor<'tcx> for IrMaps<'a, 'tcx> {
176 fn nested_visit_map<'this>(&'this mut self) -> NestedVisitorMap<'this, 'tcx> {
177 NestedVisitorMap::OnlyBodies(&self.tcx.hir)
180 fn visit_fn(&mut self, fk: FnKind<'tcx>, fd: &'tcx hir::FnDecl,
181 b: hir::BodyId, s: Span, id: NodeId) {
182 visit_fn(self, fk, fd, b, s, id);
185 fn visit_local(&mut self, l: &'tcx hir::Local) { visit_local(self, l); }
186 fn visit_expr(&mut self, ex: &'tcx Expr) { visit_expr(self, ex); }
187 fn visit_arm(&mut self, a: &'tcx hir::Arm) { visit_arm(self, a); }
190 pub fn check_crate<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>) {
191 tcx.hir.krate().visit_all_item_likes(&mut IrMaps::new(tcx).as_deep_visitor());
192 tcx.sess.abort_if_errors();
195 impl fmt::Debug for LiveNode {
196 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
197 write!(f, "ln({})", self.get())
201 impl fmt::Debug for Variable {
202 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
203 write!(f, "v({})", self.get())
207 // ______________________________________________________________________
210 // This is the first pass and the one that drives the main
211 // computation. It walks up and down the IR once. On the way down,
212 // we count for each function the number of variables as well as
213 // liveness nodes. A liveness node is basically an expression or
214 // capture clause that does something of interest: either it has
215 // interesting control flow or it uses/defines a local variable.
217 // On the way back up, at each function node we create liveness sets
218 // (we now know precisely how big to make our various vectors and so
219 // forth) and then do the data-flow propagation to compute the set
220 // of live variables at each program point.
222 // Finally, we run back over the IR one last time and, using the
223 // computed liveness, check various safety conditions. For example,
224 // there must be no live nodes at the definition site for a variable
225 // unless it has an initializer. Similarly, each non-mutable local
226 // variable must not be assigned if there is some successor
227 // assignment. And so forth.
230 fn is_valid(&self) -> bool {
235 fn invalid_node() -> LiveNode { LiveNode(u32::MAX) }
242 #[derive(Copy, Clone, Debug)]
249 #[derive(Copy, Clone, Debug)]
251 Arg(NodeId, ast::Name),
256 struct IrMaps<'a, 'tcx: 'a> {
257 tcx: TyCtxt<'a, 'tcx, 'tcx>,
259 num_live_nodes: usize,
261 live_node_map: NodeMap<LiveNode>,
262 variable_map: NodeMap<Variable>,
263 capture_info_map: NodeMap<Rc<Vec<CaptureInfo>>>,
264 var_kinds: Vec<VarKind>,
265 lnks: Vec<LiveNodeKind>,
268 impl<'a, 'tcx> IrMaps<'a, 'tcx> {
269 fn new(tcx: TyCtxt<'a, 'tcx, 'tcx>) -> IrMaps<'a, 'tcx> {
274 live_node_map: NodeMap(),
275 variable_map: NodeMap(),
276 capture_info_map: NodeMap(),
277 var_kinds: Vec::new(),
282 fn add_live_node(&mut self, lnk: LiveNodeKind) -> LiveNode {
283 let ln = LiveNode(self.num_live_nodes as u32);
285 self.num_live_nodes += 1;
287 debug!("{:?} is of kind {}", ln,
288 live_node_kind_to_string(lnk, self.tcx));
293 fn add_live_node_for_node(&mut self, node_id: NodeId, lnk: LiveNodeKind) {
294 let ln = self.add_live_node(lnk);
295 self.live_node_map.insert(node_id, ln);
297 debug!("{:?} is node {}", ln, node_id);
300 fn add_variable(&mut self, vk: VarKind) -> Variable {
301 let v = Variable(self.num_vars as u32);
302 self.var_kinds.push(vk);
306 Local(LocalInfo { id: node_id, .. }) | Arg(node_id, _) => {
307 self.variable_map.insert(node_id, v);
312 debug!("{:?} is {:?}", v, vk);
317 fn variable(&self, node_id: NodeId, span: Span) -> Variable {
318 match self.variable_map.get(&node_id) {
321 span_bug!(span, "no variable registered for id {}", node_id);
326 fn variable_name(&self, var: Variable) -> String {
327 match self.var_kinds[var.get()] {
328 Local(LocalInfo { name, .. }) | Arg(_, name) => {
331 CleanExit => "<clean-exit>".to_string()
335 fn variable_is_shorthand(&self, var: Variable) -> bool {
336 match self.var_kinds[var.get()] {
337 Local(LocalInfo { is_shorthand, .. }) => is_shorthand,
338 Arg(..) | CleanExit => false
342 fn set_captures(&mut self, node_id: NodeId, cs: Vec<CaptureInfo>) {
343 self.capture_info_map.insert(node_id, Rc::new(cs));
346 fn lnk(&self, ln: LiveNode) -> LiveNodeKind {
351 fn visit_fn<'a, 'tcx: 'a>(ir: &mut IrMaps<'a, 'tcx>,
353 decl: &'tcx hir::FnDecl,
354 body_id: hir::BodyId,
359 // swap in a new set of IR maps for this function body:
360 let mut fn_maps = IrMaps::new(ir.tcx);
362 // Don't run unused pass for #[derive()]
363 if let FnKind::Method(..) = fk {
364 let parent = ir.tcx.hir.get_parent(id);
365 if let Some(hir::map::Node::NodeItem(i)) = ir.tcx.hir.find(parent) {
366 if i.attrs.iter().any(|a| a.check_name("automatically_derived")) {
372 debug!("creating fn_maps: {:?}", &fn_maps as *const IrMaps);
374 let body = ir.tcx.hir.body(body_id);
376 for arg in &body.arguments {
377 arg.pat.each_binding(|_bm, arg_id, _x, path1| {
378 debug!("adding argument {}", arg_id);
379 let name = path1.node;
380 fn_maps.add_variable(Arg(arg_id, name));
384 // gather up the various local variables, significant expressions,
386 intravisit::walk_fn(&mut fn_maps, fk, decl, body_id, sp, id);
389 let mut lsets = Liveness::new(&mut fn_maps, body_id);
390 let entry_ln = lsets.compute(&body.value);
392 // check for various error conditions
393 lsets.visit_body(body);
394 lsets.warn_about_unused_args(body, entry_ln);
397 fn add_from_pat<'a, 'tcx>(ir: &mut IrMaps<'a, 'tcx>, pat: &P<hir::Pat>) {
398 // For struct patterns, take note of which fields used shorthand
399 // (`x` rather than `x: x`).
401 // FIXME: according to the rust-lang-nursery/rustc-guide book, `NodeId`s are to be
402 // phased out in favor of `HirId`s; however, we need to match the signature of
403 // `each_binding`, which uses `NodeIds`.
404 let mut shorthand_field_ids = NodeSet();
405 let mut pats = VecDeque::new();
407 while let Some(pat) = pats.pop_front() {
410 Binding(_, _, _, ref inner_pat) => {
411 pats.extend(inner_pat.iter());
413 Struct(_, ref fields, _) => {
414 for field in fields {
415 if field.node.is_shorthand {
416 shorthand_field_ids.insert(field.node.pat.id);
420 Ref(ref inner_pat, _) |
421 Box(ref inner_pat) => {
422 pats.push_back(inner_pat);
424 TupleStruct(_, ref inner_pats, _) |
425 Tuple(ref inner_pats, _) => {
426 pats.extend(inner_pats.iter());
428 Slice(ref pre_pats, ref inner_pat, ref post_pats) => {
429 pats.extend(pre_pats.iter());
430 pats.extend(inner_pat.iter());
431 pats.extend(post_pats.iter());
437 pat.each_binding(|_bm, p_id, _sp, path1| {
438 let name = path1.node;
439 ir.add_live_node_for_node(p_id, VarDefNode(path1.span));
440 ir.add_variable(Local(LocalInfo {
443 is_shorthand: shorthand_field_ids.contains(&p_id)
448 fn visit_local<'a, 'tcx>(ir: &mut IrMaps<'a, 'tcx>, local: &'tcx hir::Local) {
449 add_from_pat(ir, &local.pat);
450 intravisit::walk_local(ir, local);
453 fn visit_arm<'a, 'tcx>(ir: &mut IrMaps<'a, 'tcx>, arm: &'tcx hir::Arm) {
454 for pat in &arm.pats {
455 add_from_pat(ir, pat);
457 intravisit::walk_arm(ir, arm);
460 fn visit_expr<'a, 'tcx>(ir: &mut IrMaps<'a, 'tcx>, expr: &'tcx Expr) {
462 // live nodes required for uses or definitions of variables:
463 hir::ExprPath(hir::QPath::Resolved(_, ref path)) => {
464 debug!("expr {}: path that leads to {:?}", expr.id, path.def);
465 if let Def::Local(..) = path.def {
466 ir.add_live_node_for_node(expr.id, ExprNode(expr.span));
468 intravisit::walk_expr(ir, expr);
470 hir::ExprClosure(..) => {
471 // Interesting control flow (for loops can contain labeled
472 // breaks or continues)
473 ir.add_live_node_for_node(expr.id, ExprNode(expr.span));
475 // Make a live_node for each captured variable, with the span
476 // being the location that the variable is used. This results
477 // in better error messages than just pointing at the closure
478 // construction site.
479 let mut call_caps = Vec::new();
480 ir.tcx.with_freevars(expr.id, |freevars| {
482 if let Def::Local(rv) = fv.def {
483 let fv_ln = ir.add_live_node(FreeVarNode(fv.span));
484 call_caps.push(CaptureInfo {ln: fv_ln,
489 ir.set_captures(expr.id, call_caps);
491 intravisit::walk_expr(ir, expr);
494 // live nodes required for interesting control flow:
495 hir::ExprIf(..) | hir::ExprMatch(..) | hir::ExprWhile(..) | hir::ExprLoop(..) => {
496 ir.add_live_node_for_node(expr.id, ExprNode(expr.span));
497 intravisit::walk_expr(ir, expr);
499 hir::ExprBinary(op, ..) if op.node.is_lazy() => {
500 ir.add_live_node_for_node(expr.id, ExprNode(expr.span));
501 intravisit::walk_expr(ir, expr);
504 // otherwise, live nodes are not required:
505 hir::ExprIndex(..) | hir::ExprField(..) |
506 hir::ExprArray(..) | hir::ExprCall(..) | hir::ExprMethodCall(..) |
507 hir::ExprTup(..) | hir::ExprBinary(..) | hir::ExprAddrOf(..) |
508 hir::ExprCast(..) | hir::ExprUnary(..) | hir::ExprBreak(..) |
509 hir::ExprAgain(_) | hir::ExprLit(_) | hir::ExprRet(..) |
510 hir::ExprBlock(..) | hir::ExprAssign(..) | hir::ExprAssignOp(..) |
511 hir::ExprStruct(..) | hir::ExprRepeat(..) |
512 hir::ExprInlineAsm(..) | hir::ExprBox(..) | hir::ExprYield(..) |
513 hir::ExprType(..) | hir::ExprPath(hir::QPath::TypeRelative(..)) => {
514 intravisit::walk_expr(ir, expr);
519 // ______________________________________________________________________
520 // Computing liveness sets
522 // Actually we compute just a bit more than just liveness, but we use
523 // the same basic propagation framework in all cases.
525 #[derive(Clone, Copy)]
532 fn invalid_users() -> Users {
534 reader: invalid_node(),
535 writer: invalid_node(),
540 #[derive(Copy, Clone)]
543 fallthrough_ln: LiveNode,
544 clean_exit_var: Variable
547 const ACC_READ: u32 = 1;
548 const ACC_WRITE: u32 = 2;
549 const ACC_USE: u32 = 4;
551 struct Liveness<'a, 'tcx: 'a> {
552 ir: &'a mut IrMaps<'a, 'tcx>,
553 tables: &'a ty::TypeckTables<'tcx>,
555 successors: Vec<LiveNode>,
558 // mappings from loop node ID to LiveNode
559 // ("break" label should map to loop node ID,
560 // it probably doesn't now)
561 break_ln: NodeMap<LiveNode>,
562 cont_ln: NodeMap<LiveNode>,
565 impl<'a, 'tcx> Liveness<'a, 'tcx> {
566 fn new(ir: &'a mut IrMaps<'a, 'tcx>, body: hir::BodyId) -> Liveness<'a, 'tcx> {
567 // Special nodes and variables:
568 // - exit_ln represents the end of the fn, either by return or panic
569 // - implicit_ret_var is a pseudo-variable that represents
570 // an implicit return
571 let specials = Specials {
572 exit_ln: ir.add_live_node(ExitNode),
573 fallthrough_ln: ir.add_live_node(ExitNode),
574 clean_exit_var: ir.add_variable(CleanExit)
577 let tables = ir.tcx.body_tables(body);
579 let num_live_nodes = ir.num_live_nodes;
580 let num_vars = ir.num_vars;
586 successors: vec![invalid_node(); num_live_nodes],
587 users: vec![invalid_users(); num_live_nodes * num_vars],
593 fn live_node(&self, node_id: NodeId, span: Span) -> LiveNode {
594 match self.ir.live_node_map.get(&node_id) {
597 // This must be a mismatch between the ir_map construction
598 // above and the propagation code below; the two sets of
599 // code have to agree about which AST nodes are worth
600 // creating liveness nodes for.
603 "no live node registered for node {}",
609 fn variable(&self, node_id: NodeId, span: Span) -> Variable {
610 self.ir.variable(node_id, span)
613 fn pat_bindings<F>(&mut self, pat: &hir::Pat, mut f: F) where
614 F: FnMut(&mut Liveness<'a, 'tcx>, LiveNode, Variable, Span, NodeId),
616 pat.each_binding(|_bm, p_id, sp, n| {
617 let ln = self.live_node(p_id, sp);
618 let var = self.variable(p_id, n.span);
619 f(self, ln, var, n.span, p_id);
623 fn arm_pats_bindings<F>(&mut self, pat: Option<&hir::Pat>, f: F) where
624 F: FnMut(&mut Liveness<'a, 'tcx>, LiveNode, Variable, Span, NodeId),
626 if let Some(pat) = pat {
627 self.pat_bindings(pat, f);
631 fn define_bindings_in_pat(&mut self, pat: &hir::Pat, succ: LiveNode)
633 self.define_bindings_in_arm_pats(Some(pat), succ)
636 fn define_bindings_in_arm_pats(&mut self, pat: Option<&hir::Pat>, succ: LiveNode)
639 self.arm_pats_bindings(pat, |this, ln, var, _sp, _id| {
640 this.init_from_succ(ln, succ);
641 this.define(ln, var);
647 fn idx(&self, ln: LiveNode, var: Variable) -> usize {
648 ln.get() * self.ir.num_vars + var.get()
651 fn live_on_entry(&self, ln: LiveNode, var: Variable)
652 -> Option<LiveNodeKind> {
653 assert!(ln.is_valid());
654 let reader = self.users[self.idx(ln, var)].reader;
655 if reader.is_valid() {Some(self.ir.lnk(reader))} else {None}
659 Is this variable live on entry to any of its successor nodes?
661 fn live_on_exit(&self, ln: LiveNode, var: Variable)
662 -> Option<LiveNodeKind> {
663 let successor = self.successors[ln.get()];
664 self.live_on_entry(successor, var)
667 fn used_on_entry(&self, ln: LiveNode, var: Variable) -> bool {
668 assert!(ln.is_valid());
669 self.users[self.idx(ln, var)].used
672 fn assigned_on_entry(&self, ln: LiveNode, var: Variable)
673 -> Option<LiveNodeKind> {
674 assert!(ln.is_valid());
675 let writer = self.users[self.idx(ln, var)].writer;
676 if writer.is_valid() {Some(self.ir.lnk(writer))} else {None}
679 fn assigned_on_exit(&self, ln: LiveNode, var: Variable)
680 -> Option<LiveNodeKind> {
681 let successor = self.successors[ln.get()];
682 self.assigned_on_entry(successor, var)
685 fn indices2<F>(&mut self, ln: LiveNode, succ_ln: LiveNode, mut op: F) where
686 F: FnMut(&mut Liveness<'a, 'tcx>, usize, usize),
688 let node_base_idx = self.idx(ln, Variable(0));
689 let succ_base_idx = self.idx(succ_ln, Variable(0));
690 for var_idx in 0..self.ir.num_vars {
691 op(self, node_base_idx + var_idx, succ_base_idx + var_idx);
695 fn write_vars<F>(&self,
699 -> io::Result<()> where
700 F: FnMut(usize) -> LiveNode,
702 let node_base_idx = self.idx(ln, Variable(0));
703 for var_idx in 0..self.ir.num_vars {
704 let idx = node_base_idx + var_idx;
705 if test(idx).is_valid() {
706 write!(wr, " {:?}", Variable(var_idx as u32))?;
713 #[allow(unused_must_use)]
714 fn ln_str(&self, ln: LiveNode) -> String {
715 let mut wr = Vec::new();
717 let wr = &mut wr as &mut dyn Write;
718 write!(wr, "[ln({:?}) of kind {:?} reads", ln.get(), self.ir.lnk(ln));
719 self.write_vars(wr, ln, |idx| self.users[idx].reader);
720 write!(wr, " writes");
721 self.write_vars(wr, ln, |idx| self.users[idx].writer);
722 write!(wr, " precedes {:?}]", self.successors[ln.get()]);
724 String::from_utf8(wr).unwrap()
727 fn init_empty(&mut self, ln: LiveNode, succ_ln: LiveNode) {
728 self.successors[ln.get()] = succ_ln;
730 // It is not necessary to initialize the
731 // values to empty because this is the value
732 // they have when they are created, and the sets
733 // only grow during iterations.
735 // self.indices(ln) { |idx|
736 // self.users[idx] = invalid_users();
740 fn init_from_succ(&mut self, ln: LiveNode, succ_ln: LiveNode) {
741 // more efficient version of init_empty() / merge_from_succ()
742 self.successors[ln.get()] = succ_ln;
744 self.indices2(ln, succ_ln, |this, idx, succ_idx| {
745 this.users[idx] = this.users[succ_idx]
747 debug!("init_from_succ(ln={}, succ={})",
748 self.ln_str(ln), self.ln_str(succ_ln));
751 fn merge_from_succ(&mut self,
756 if ln == succ_ln { return false; }
758 let mut changed = false;
759 self.indices2(ln, succ_ln, |this, idx, succ_idx| {
760 changed |= copy_if_invalid(this.users[succ_idx].reader,
761 &mut this.users[idx].reader);
762 changed |= copy_if_invalid(this.users[succ_idx].writer,
763 &mut this.users[idx].writer);
764 if this.users[succ_idx].used && !this.users[idx].used {
765 this.users[idx].used = true;
770 debug!("merge_from_succ(ln={:?}, succ={}, first_merge={}, changed={})",
771 ln, self.ln_str(succ_ln), first_merge, changed);
774 fn copy_if_invalid(src: LiveNode, dst: &mut LiveNode) -> bool {
775 if src.is_valid() && !dst.is_valid() {
784 // Indicates that a local variable was *defined*; we know that no
785 // uses of the variable can precede the definition (resolve checks
786 // this) so we just clear out all the data.
787 fn define(&mut self, writer: LiveNode, var: Variable) {
788 let idx = self.idx(writer, var);
789 self.users[idx].reader = invalid_node();
790 self.users[idx].writer = invalid_node();
792 debug!("{:?} defines {:?} (idx={}): {}", writer, var,
793 idx, self.ln_str(writer));
796 // Either read, write, or both depending on the acc bitset
797 fn acc(&mut self, ln: LiveNode, var: Variable, acc: u32) {
798 debug!("{:?} accesses[{:x}] {:?}: {}",
799 ln, acc, var, self.ln_str(ln));
801 let idx = self.idx(ln, var);
802 let user = &mut self.users[idx];
804 if (acc & ACC_WRITE) != 0 {
805 user.reader = invalid_node();
809 // Important: if we both read/write, must do read second
810 // or else the write will override.
811 if (acc & ACC_READ) != 0 {
815 if (acc & ACC_USE) != 0 {
820 // _______________________________________________________________________
822 fn compute(&mut self, body: &hir::Expr) -> LiveNode {
823 // if there is a `break` or `again` at the top level, then it's
824 // effectively a return---this only occurs in `for` loops,
825 // where the body is really a closure.
827 debug!("compute: using id for body, {}", self.ir.tcx.hir.node_to_pretty_string(body.id));
829 let exit_ln = self.s.exit_ln;
831 self.break_ln.insert(body.id, exit_ln);
832 self.cont_ln.insert(body.id, exit_ln);
834 // the fallthrough exit is only for those cases where we do not
835 // explicitly return:
837 self.init_from_succ(s.fallthrough_ln, s.exit_ln);
838 self.acc(s.fallthrough_ln, s.clean_exit_var, ACC_READ);
840 let entry_ln = self.propagate_through_expr(body, s.fallthrough_ln);
842 // hack to skip the loop unless debug! is enabled:
843 debug!("^^ liveness computation results for body {} (entry={:?})",
845 for ln_idx in 0..self.ir.num_live_nodes {
846 debug!("{:?}", self.ln_str(LiveNode(ln_idx as u32)));
855 fn propagate_through_block(&mut self, blk: &hir::Block, succ: LiveNode)
857 if blk.targeted_by_break {
858 self.break_ln.insert(blk.id, succ);
860 let succ = self.propagate_through_opt_expr(blk.expr.as_ref().map(|e| &**e), succ);
861 blk.stmts.iter().rev().fold(succ, |succ, stmt| {
862 self.propagate_through_stmt(stmt, succ)
866 fn propagate_through_stmt(&mut self, stmt: &hir::Stmt, succ: LiveNode)
869 hir::StmtDecl(ref decl, _) => {
870 self.propagate_through_decl(&decl, succ)
873 hir::StmtExpr(ref expr, _) | hir::StmtSemi(ref expr, _) => {
874 self.propagate_through_expr(&expr, succ)
879 fn propagate_through_decl(&mut self, decl: &hir::Decl, succ: LiveNode)
882 hir::DeclLocal(ref local) => {
883 self.propagate_through_local(&local, succ)
885 hir::DeclItem(_) => succ,
889 fn propagate_through_local(&mut self, local: &hir::Local, succ: LiveNode)
891 // Note: we mark the variable as defined regardless of whether
892 // there is an initializer. Initially I had thought to only mark
893 // the live variable as defined if it was initialized, and then we
894 // could check for uninit variables just by scanning what is live
895 // at the start of the function. But that doesn't work so well for
896 // immutable variables defined in a loop:
897 // loop { let x; x = 5; }
898 // because the "assignment" loops back around and generates an error.
900 // So now we just check that variables defined w/o an
901 // initializer are not live at the point of their
902 // initialization, which is mildly more complex than checking
903 // once at the func header but otherwise equivalent.
905 let succ = self.propagate_through_opt_expr(local.init.as_ref().map(|e| &**e), succ);
906 self.define_bindings_in_pat(&local.pat, succ)
909 fn propagate_through_exprs(&mut self, exprs: &[Expr], succ: LiveNode)
911 exprs.iter().rev().fold(succ, |succ, expr| {
912 self.propagate_through_expr(&expr, succ)
916 fn propagate_through_opt_expr(&mut self,
917 opt_expr: Option<&Expr>,
920 opt_expr.map_or(succ, |expr| self.propagate_through_expr(expr, succ))
923 fn propagate_through_expr(&mut self, expr: &Expr, succ: LiveNode)
925 debug!("propagate_through_expr: {}", self.ir.tcx.hir.node_to_pretty_string(expr.id));
928 // Interesting cases with control flow or which gen/kill
929 hir::ExprPath(hir::QPath::Resolved(_, ref path)) => {
930 self.access_path(expr.id, path, succ, ACC_READ | ACC_USE)
933 hir::ExprField(ref e, _) => {
934 self.propagate_through_expr(&e, succ)
937 hir::ExprClosure(.., blk_id, _, _) => {
938 debug!("{} is an ExprClosure", self.ir.tcx.hir.node_to_pretty_string(expr.id));
941 The next-node for a break is the successor of the entire
942 loop. The next-node for a continue is the top of this loop.
944 let node = self.live_node(expr.id, expr.span);
948 self.break_ln.insert(blk_id.node_id, break_ln);
949 self.cont_ln.insert(blk_id.node_id, cont_ln);
951 // the construction of a closure itself is not important,
952 // but we have to consider the closed over variables.
953 let caps = match self.ir.capture_info_map.get(&expr.id) {
954 Some(caps) => caps.clone(),
956 span_bug!(expr.span, "no registered caps");
959 caps.iter().rev().fold(succ, |succ, cap| {
960 self.init_from_succ(cap.ln, succ);
961 let var = self.variable(cap.var_nid, expr.span);
962 self.acc(cap.ln, var, ACC_READ | ACC_USE);
967 hir::ExprIf(ref cond, ref then, ref els) => {
981 let else_ln = self.propagate_through_opt_expr(els.as_ref().map(|e| &**e), succ);
982 let then_ln = self.propagate_through_expr(&then, succ);
983 let ln = self.live_node(expr.id, expr.span);
984 self.init_from_succ(ln, else_ln);
985 self.merge_from_succ(ln, then_ln, false);
986 self.propagate_through_expr(&cond, ln)
989 hir::ExprWhile(ref cond, ref blk, _) => {
990 self.propagate_through_loop(expr, WhileLoop(&cond), &blk, succ)
993 // Note that labels have been resolved, so we don't need to look
994 // at the label ident
995 hir::ExprLoop(ref blk, _, _) => {
996 self.propagate_through_loop(expr, LoopLoop, &blk, succ)
999 hir::ExprMatch(ref e, ref arms, _) => {
1014 let ln = self.live_node(expr.id, expr.span);
1015 self.init_empty(ln, succ);
1016 let mut first_merge = true;
1019 self.propagate_through_expr(&arm.body, succ);
1021 self.propagate_through_opt_expr(arm.guard.as_ref().map(|e| &**e), body_succ);
1022 // only consider the first pattern; any later patterns must have
1023 // the same bindings, and we also consider the first pattern to be
1024 // the "authoritative" set of ids
1026 self.define_bindings_in_arm_pats(arm.pats.first().map(|p| &**p),
1028 self.merge_from_succ(ln, arm_succ, first_merge);
1029 first_merge = false;
1031 self.propagate_through_expr(&e, ln)
1034 hir::ExprRet(ref o_e) => {
1035 // ignore succ and subst exit_ln:
1036 let exit_ln = self.s.exit_ln;
1037 self.propagate_through_opt_expr(o_e.as_ref().map(|e| &**e), exit_ln)
1040 hir::ExprBreak(label, ref opt_expr) => {
1041 // Find which label this break jumps to
1042 let target = match label.target_id {
1043 Ok(node_id) => self.break_ln.get(&node_id),
1044 Err(err) => span_bug!(expr.span, "loop scope error: {}", err),
1047 // Now that we know the label we're going to,
1048 // look it up in the break loop nodes table
1051 Some(b) => self.propagate_through_opt_expr(opt_expr.as_ref().map(|e| &**e), b),
1052 None => span_bug!(expr.span, "break to unknown label")
1056 hir::ExprAgain(label) => {
1057 // Find which label this expr continues to
1058 let sc = match label.target_id {
1059 Ok(node_id) => node_id,
1060 Err(err) => span_bug!(expr.span, "loop scope error: {}", err),
1063 // Now that we know the label we're going to,
1064 // look it up in the continue loop nodes table
1066 match self.cont_ln.get(&sc) {
1068 None => span_bug!(expr.span, "continue to unknown label")
1072 hir::ExprAssign(ref l, ref r) => {
1073 // see comment on places in
1074 // propagate_through_place_components()
1075 let succ = self.write_place(&l, succ, ACC_WRITE);
1076 let succ = self.propagate_through_place_components(&l, succ);
1077 self.propagate_through_expr(&r, succ)
1080 hir::ExprAssignOp(_, ref l, ref r) => {
1081 // an overloaded assign op is like a method call
1082 if self.tables.is_method_call(expr) {
1083 let succ = self.propagate_through_expr(&l, succ);
1084 self.propagate_through_expr(&r, succ)
1086 // see comment on places in
1087 // propagate_through_place_components()
1088 let succ = self.write_place(&l, succ, ACC_WRITE|ACC_READ);
1089 let succ = self.propagate_through_expr(&r, succ);
1090 self.propagate_through_place_components(&l, succ)
1094 // Uninteresting cases: just propagate in rev exec order
1096 hir::ExprArray(ref exprs) => {
1097 self.propagate_through_exprs(exprs, succ)
1100 hir::ExprStruct(_, ref fields, ref with_expr) => {
1101 let succ = self.propagate_through_opt_expr(with_expr.as_ref().map(|e| &**e), succ);
1102 fields.iter().rev().fold(succ, |succ, field| {
1103 self.propagate_through_expr(&field.expr, succ)
1107 hir::ExprCall(ref f, ref args) => {
1108 // FIXME(canndrew): This is_never should really be an is_uninhabited
1109 let succ = if self.tables.expr_ty(expr).is_never() {
1114 let succ = self.propagate_through_exprs(args, succ);
1115 self.propagate_through_expr(&f, succ)
1118 hir::ExprMethodCall(.., ref args) => {
1119 // FIXME(canndrew): This is_never should really be an is_uninhabited
1120 let succ = if self.tables.expr_ty(expr).is_never() {
1125 self.propagate_through_exprs(args, succ)
1128 hir::ExprTup(ref exprs) => {
1129 self.propagate_through_exprs(exprs, succ)
1132 hir::ExprBinary(op, ref l, ref r) if op.node.is_lazy() => {
1133 let r_succ = self.propagate_through_expr(&r, succ);
1135 let ln = self.live_node(expr.id, expr.span);
1136 self.init_from_succ(ln, succ);
1137 self.merge_from_succ(ln, r_succ, false);
1139 self.propagate_through_expr(&l, ln)
1142 hir::ExprIndex(ref l, ref r) |
1143 hir::ExprBinary(_, ref l, ref r) => {
1144 let r_succ = self.propagate_through_expr(&r, succ);
1145 self.propagate_through_expr(&l, r_succ)
1148 hir::ExprBox(ref e) |
1149 hir::ExprAddrOf(_, ref e) |
1150 hir::ExprCast(ref e, _) |
1151 hir::ExprType(ref e, _) |
1152 hir::ExprUnary(_, ref e) |
1153 hir::ExprYield(ref e) |
1154 hir::ExprRepeat(ref e, _) => {
1155 self.propagate_through_expr(&e, succ)
1158 hir::ExprInlineAsm(ref ia, ref outputs, ref inputs) => {
1159 let succ = ia.outputs.iter().zip(outputs).rev().fold(succ, |succ, (o, output)| {
1160 // see comment on places
1161 // in propagate_through_place_components()
1163 self.propagate_through_expr(output, succ)
1165 let acc = if o.is_rw { ACC_WRITE|ACC_READ } else { ACC_WRITE };
1166 let succ = self.write_place(output, succ, acc);
1167 self.propagate_through_place_components(output, succ)
1171 // Inputs are executed first. Propagate last because of rev order
1172 self.propagate_through_exprs(inputs, succ)
1175 hir::ExprLit(..) | hir::ExprPath(hir::QPath::TypeRelative(..)) => {
1179 // Note that labels have been resolved, so we don't need to look
1180 // at the label ident
1181 hir::ExprBlock(ref blk, _) => {
1182 self.propagate_through_block(&blk, succ)
1187 fn propagate_through_place_components(&mut self,
1193 // In general, the full flow graph structure for an
1194 // assignment/move/etc can be handled in one of two ways,
1195 // depending on whether what is being assigned is a "tracked
1196 // value" or not. A tracked value is basically a local
1197 // variable or argument.
1199 // The two kinds of graphs are:
1201 // Tracked place Untracked place
1202 // ----------------------++-----------------------
1206 // (rvalue) || (rvalue)
1209 // (write of place) || (place components)
1214 // ----------------------++-----------------------
1216 // I will cover the two cases in turn:
1220 // A tracked place is a local variable/argument `x`. In
1221 // these cases, the link_node where the write occurs is linked
1222 // to node id of `x`. The `write_place()` routine generates
1223 // the contents of this node. There are no subcomponents to
1226 // # Non-tracked places
1228 // These are places like `x[5]` or `x.f`. In that case, we
1229 // basically ignore the value which is written to but generate
1230 // reads for the components---`x` in these two examples. The
1231 // components reads are generated by
1232 // `propagate_through_place_components()` (this fn).
1236 // It is still possible to observe assignments to non-places;
1237 // these errors are detected in the later pass borrowck. We
1238 // just ignore such cases and treat them as reads.
1241 hir::ExprPath(_) => succ,
1242 hir::ExprField(ref e, _) => self.propagate_through_expr(&e, succ),
1243 _ => self.propagate_through_expr(expr, succ)
1247 // see comment on propagate_through_place()
1248 fn write_place(&mut self, expr: &Expr, succ: LiveNode, acc: u32)
1251 hir::ExprPath(hir::QPath::Resolved(_, ref path)) => {
1252 self.access_path(expr.id, path, succ, acc)
1255 // We do not track other places, so just propagate through
1256 // to their subcomponents. Also, it may happen that
1257 // non-places occur here, because those are detected in the
1258 // later pass borrowck.
1263 fn access_var(&mut self, id: NodeId, nid: NodeId, succ: LiveNode, acc: u32, span: Span)
1265 let ln = self.live_node(id, span);
1267 self.init_from_succ(ln, succ);
1268 let var = self.variable(nid, span);
1269 self.acc(ln, var, acc);
1274 fn access_path(&mut self, id: NodeId, path: &hir::Path, succ: LiveNode, acc: u32)
1277 Def::Local(nid) => {
1278 self.access_var(id, nid, succ, acc, path.span)
1284 fn propagate_through_loop(&mut self,
1293 We model control flow like this:
1311 let mut first_merge = true;
1312 let ln = self.live_node(expr.id, expr.span);
1313 self.init_empty(ln, succ);
1317 // If this is not a `loop` loop, then it's possible we bypass
1318 // the body altogether. Otherwise, the only way is via a `break`
1319 // in the loop body.
1320 self.merge_from_succ(ln, succ, first_merge);
1321 first_merge = false;
1324 debug!("propagate_through_loop: using id for loop body {} {}",
1325 expr.id, self.ir.tcx.hir.node_to_pretty_string(body.id));
1327 let break_ln = succ;
1329 self.break_ln.insert(expr.id, break_ln);
1330 self.cont_ln.insert(expr.id, cont_ln);
1332 let cond_ln = match kind {
1334 WhileLoop(ref cond) => self.propagate_through_expr(&cond, ln),
1336 let body_ln = self.propagate_through_block(body, cond_ln);
1338 // repeat until fixed point is reached:
1339 while self.merge_from_succ(ln, body_ln, first_merge) {
1340 first_merge = false;
1342 let new_cond_ln = match kind {
1344 WhileLoop(ref cond) => {
1345 self.propagate_through_expr(&cond, ln)
1348 assert!(cond_ln == new_cond_ln);
1349 assert!(body_ln == self.propagate_through_block(body, cond_ln));
1356 // _______________________________________________________________________
1357 // Checking for error conditions
1359 impl<'a, 'tcx> Visitor<'tcx> for Liveness<'a, 'tcx> {
1360 fn nested_visit_map<'this>(&'this mut self) -> NestedVisitorMap<'this, 'tcx> {
1361 NestedVisitorMap::None
1364 fn visit_local(&mut self, l: &'tcx hir::Local) {
1365 check_local(self, l);
1367 fn visit_expr(&mut self, ex: &'tcx Expr) {
1368 check_expr(self, ex);
1370 fn visit_arm(&mut self, a: &'tcx hir::Arm) {
1375 fn check_local<'a, 'tcx>(this: &mut Liveness<'a, 'tcx>, local: &'tcx hir::Local) {
1378 this.warn_about_unused_or_dead_vars_in_pat(&local.pat);
1381 this.pat_bindings(&local.pat, |this, ln, var, sp, id| {
1382 let span = local.pat.simple_span().unwrap_or(sp);
1383 this.warn_about_unused(span, id, ln, var);
1388 intravisit::walk_local(this, local);
1391 fn check_arm<'a, 'tcx>(this: &mut Liveness<'a, 'tcx>, arm: &'tcx hir::Arm) {
1392 // only consider the first pattern; any later patterns must have
1393 // the same bindings, and we also consider the first pattern to be
1394 // the "authoritative" set of ids
1395 this.arm_pats_bindings(arm.pats.first().map(|p| &**p), |this, ln, var, sp, id| {
1396 this.warn_about_unused(sp, id, ln, var);
1398 intravisit::walk_arm(this, arm);
1401 fn check_expr<'a, 'tcx>(this: &mut Liveness<'a, 'tcx>, expr: &'tcx Expr) {
1403 hir::ExprAssign(ref l, _) => {
1404 this.check_place(&l);
1406 intravisit::walk_expr(this, expr);
1409 hir::ExprAssignOp(_, ref l, _) => {
1410 if !this.tables.is_method_call(expr) {
1411 this.check_place(&l);
1414 intravisit::walk_expr(this, expr);
1417 hir::ExprInlineAsm(ref ia, ref outputs, ref inputs) => {
1418 for input in inputs {
1419 this.visit_expr(input);
1422 // Output operands must be places
1423 for (o, output) in ia.outputs.iter().zip(outputs) {
1425 this.check_place(output);
1427 this.visit_expr(output);
1430 intravisit::walk_expr(this, expr);
1433 // no correctness conditions related to liveness
1434 hir::ExprCall(..) | hir::ExprMethodCall(..) | hir::ExprIf(..) |
1435 hir::ExprMatch(..) | hir::ExprWhile(..) | hir::ExprLoop(..) |
1436 hir::ExprIndex(..) | hir::ExprField(..) |
1437 hir::ExprArray(..) | hir::ExprTup(..) | hir::ExprBinary(..) |
1438 hir::ExprCast(..) | hir::ExprUnary(..) | hir::ExprRet(..) |
1439 hir::ExprBreak(..) | hir::ExprAgain(..) | hir::ExprLit(_) |
1440 hir::ExprBlock(..) | hir::ExprAddrOf(..) |
1441 hir::ExprStruct(..) | hir::ExprRepeat(..) |
1442 hir::ExprClosure(..) | hir::ExprPath(_) | hir::ExprYield(..) |
1443 hir::ExprBox(..) | hir::ExprType(..) => {
1444 intravisit::walk_expr(this, expr);
1449 impl<'a, 'tcx> Liveness<'a, 'tcx> {
1450 fn check_place(&mut self, expr: &'tcx Expr) {
1452 hir::ExprPath(hir::QPath::Resolved(_, ref path)) => {
1453 if let Def::Local(nid) = path.def {
1454 // Assignment to an immutable variable or argument: only legal
1455 // if there is no later assignment. If this local is actually
1456 // mutable, then check for a reassignment to flag the mutability
1458 let ln = self.live_node(expr.id, expr.span);
1459 let var = self.variable(nid, expr.span);
1460 self.warn_about_dead_assign(expr.span, expr.id, ln, var);
1464 // For other kinds of places, no checks are required,
1465 // and any embedded expressions are actually rvalues
1466 intravisit::walk_expr(self, expr);
1471 fn should_warn(&self, var: Variable) -> Option<String> {
1472 let name = self.ir.variable_name(var);
1473 if name.is_empty() || name.as_bytes()[0] == ('_' as u8) {
1480 fn warn_about_unused_args(&self, body: &hir::Body, entry_ln: LiveNode) {
1481 for arg in &body.arguments {
1482 arg.pat.each_binding(|_bm, p_id, _, path1| {
1483 let sp = path1.span;
1484 let var = self.variable(p_id, sp);
1485 // Ignore unused self.
1486 let name = path1.node;
1487 if name != keywords::SelfValue.name() {
1488 if !self.warn_about_unused(sp, p_id, entry_ln, var) {
1489 if self.live_on_entry(entry_ln, var).is_none() {
1490 self.report_dead_assign(p_id, sp, var, true);
1498 fn warn_about_unused_or_dead_vars_in_pat(&mut self, pat: &hir::Pat) {
1499 self.pat_bindings(pat, |this, ln, var, sp, id| {
1500 if !this.warn_about_unused(sp, id, ln, var) {
1501 this.warn_about_dead_assign(sp, id, ln, var);
1506 fn warn_about_unused(&self,
1512 if !self.used_on_entry(ln, var) {
1513 let r = self.should_warn(var);
1514 if let Some(name) = r {
1516 // annoying: for parameters in funcs like `fn(x: i32)
1517 // {ret}`, there is only one node, so asking about
1518 // assigned_on_exit() is not meaningful.
1519 let is_assigned = if ln == self.s.exit_ln {
1522 self.assigned_on_exit(ln, var).is_some()
1525 let suggest_underscore_msg = format!("consider using `_{}` instead",
1530 .lint_node_note(lint::builtin::UNUSED_VARIABLES, id, sp,
1531 &format!("variable `{}` is assigned to, but never used",
1533 &suggest_underscore_msg);
1534 } else if name != "self" {
1535 let msg = format!("unused variable: `{}`", name);
1536 let mut err = self.ir.tcx
1537 .struct_span_lint_node(lint::builtin::UNUSED_VARIABLES, id, sp, &msg);
1538 if self.ir.variable_is_shorthand(var) {
1539 err.span_suggestion_with_applicability(sp, "try ignoring the field",
1540 format!("{}: _", name),
1541 Applicability::MachineApplicable);
1543 err.span_suggestion_short_with_applicability(
1544 sp, &suggest_underscore_msg,
1545 format!("_{}", name),
1546 Applicability::MachineApplicable,
1558 fn warn_about_dead_assign(&self,
1563 if self.live_on_exit(ln, var).is_none() {
1564 self.report_dead_assign(id, sp, var, false);
1568 fn report_dead_assign(&self, id: NodeId, sp: Span, var: Variable, is_argument: bool) {
1569 if let Some(name) = self.should_warn(var) {
1571 self.ir.tcx.lint_node(lint::builtin::UNUSED_ASSIGNMENTS, id, sp,
1572 &format!("value passed to `{}` is never read", name));
1574 self.ir.tcx.lint_node(lint::builtin::UNUSED_ASSIGNMENTS, id, sp,
1575 &format!("value assigned to `{}` is never read", name));