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.
12 * A classic liveness analysis based on dataflow over the AST. Computes,
13 * for each local variable in a function, whether that variable is live
14 * at a given point. Program execution points are identified by their
19 * The basic model is that each local variable is assigned an index. We
20 * represent sets of local variables using a vector indexed by this
21 * index. The value in the vector is either 0, indicating the variable
22 * is dead, or the id of an expression that uses the variable.
24 * We conceptually walk over the AST in reverse execution order. If we
25 * find a use of a variable, we add it to the set of live variables. If
26 * we find an assignment to a variable, we remove it from the set of live
27 * variables. When we have to merge two flows, we take the union of
28 * those two flows---if the variable is live on both paths, we simply
29 * pick one id. In the event of loops, we continue doing this until a
30 * fixed point is reached.
32 * ## Checking initialization
34 * At the function entry point, all variables must be dead. If this is
35 * not the case, we can report an error using the id found in the set of
36 * live variables, which identifies a use of the variable which is not
37 * dominated by an assignment.
41 * After each explicit move, the variable must be dead.
43 * ## Computing last uses
45 * Any use of the variable where the variable is dead afterwards is a
48 * # Implementation details
50 * The actual implementation contains two (nested) walks over the AST.
51 * The outer walk has the job of building up the ir_maps instance for the
52 * enclosing function. On the way down the tree, it identifies those AST
53 * nodes and variable IDs that will be needed for the liveness analysis
54 * and assigns them contiguous IDs. The liveness id for an AST node is
55 * called a `live_node` (it's a newtype'd uint) and the id for a variable
56 * is called a `variable` (another newtype'd uint).
58 * On the way back up the tree, as we are about to exit from a function
59 * declaration we allocate a `liveness` instance. Now that we know
60 * precisely how many nodes and variables we need, we can allocate all
61 * the various arrays that we will need to precisely the right size. We then
62 * perform the actual propagation on the `liveness` instance.
64 * This propagation is encoded in the various `propagate_through_*()`
65 * methods. It effectively does a reverse walk of the AST; whenever we
66 * reach a loop node, we iterate until a fixed point is reached.
68 * ## The `Users` struct
70 * At each live node `N`, we track three pieces of information for each
71 * variable `V` (these are encapsulated in the `Users` struct):
73 * - `reader`: the `LiveNode` ID of some node which will read the value
74 * that `V` holds on entry to `N`. Formally: a node `M` such
75 * that there exists a path `P` from `N` to `M` where `P` does not
76 * write `V`. If the `reader` is `invalid_node()`, then the current
77 * value will never be read (the variable is dead, essentially).
79 * - `writer`: the `LiveNode` ID of some node which will write the
80 * variable `V` and which is reachable from `N`. Formally: a node `M`
81 * such that there exists a path `P` from `N` to `M` and `M` writes
82 * `V`. If the `writer` is `invalid_node()`, then there is no writer
83 * of `V` that follows `N`.
85 * - `used`: a boolean value indicating whether `V` is *used*. We
86 * distinguish a *read* from a *use* in that a *use* is some read that
87 * is not just used to generate a new value. For example, `x += 1` is
88 * a read but not a use. This is used to generate better warnings.
90 * ## Special Variables
92 * We generate various special variables for various, well, special purposes.
93 * These are described in the `specials` struct:
95 * - `exit_ln`: a live node that is generated to represent every 'exit' from
96 * the function, whether it be by explicit return, panic, or other means.
98 * - `fallthrough_ln`: a live node that represents a fallthrough
100 * - `no_ret_var`: a synthetic variable that is only 'read' from, the
101 * fallthrough node. This allows us to detect functions where we fail
102 * to return explicitly.
103 * - `clean_exit_var`: a synthetic variable that is only 'read' from the
104 * fallthrough node. It is only live if the function could converge
105 * via means other than an explicit `return` expression. That is, it is
106 * only dead if the end of the function's block can never be reached.
107 * It is the responsibility of typeck to ensure that there are no
108 * `return` expressions in a function declared as diverging.
110 use self::LoopKind::*;
111 use self::LiveNodeKind::*;
112 use self::VarKind::*;
115 use middle::mem_categorization::Typer;
116 use middle::{pat_util, typeck, ty};
118 use util::nodemap::NodeMap;
120 use std::{fmt, io, uint};
122 use syntax::ast::{mod, NodeId, Expr};
123 use syntax::codemap::{BytePos, original_sp, Span};
124 use syntax::parse::token::{mod, special_idents};
125 use syntax::print::pprust::{expr_to_string, block_to_string};
127 use syntax::ast_util;
128 use syntax::visit::{mod, Visitor, FnKind};
130 /// For use with `propagate_through_loop`.
132 /// An endless `loop` loop.
134 /// A `while` loop, with the given expression as condition.
136 /// A `for` loop, with the given pattern to bind.
137 ForLoop(&'a ast::Pat),
140 #[deriving(PartialEq)]
141 struct Variable(uint);
142 #[deriving(PartialEq)]
143 struct LiveNode(uint);
146 fn get(&self) -> uint { let Variable(v) = *self; v }
150 fn get(&self) -> uint { let LiveNode(v) = *self; v }
153 impl Clone for LiveNode {
154 fn clone(&self) -> LiveNode {
159 #[deriving(PartialEq, Show)]
167 fn live_node_kind_to_string(lnk: LiveNodeKind, cx: &ty::ctxt) -> String {
168 let cm = cx.sess.codemap();
171 format!("Free var node [{}]", cm.span_to_string(s))
174 format!("Expr node [{}]", cm.span_to_string(s))
177 format!("Var def node [{}]", cm.span_to_string(s))
179 ExitNode => "Exit node".to_string(),
183 impl<'a, 'tcx, 'v> Visitor<'v> for IrMaps<'a, 'tcx> {
184 fn visit_fn(&mut self, fk: FnKind<'v>, fd: &'v ast::FnDecl,
185 b: &'v ast::Block, s: Span, id: NodeId) {
186 visit_fn(self, fk, fd, b, s, id);
188 fn visit_local(&mut self, l: &ast::Local) { visit_local(self, l); }
189 fn visit_expr(&mut self, ex: &Expr) { visit_expr(self, ex); }
190 fn visit_arm(&mut self, a: &ast::Arm) { visit_arm(self, a); }
193 pub fn check_crate(tcx: &ty::ctxt) {
194 visit::walk_crate(&mut IrMaps::new(tcx), tcx.map.krate());
195 tcx.sess.abort_if_errors();
198 impl fmt::Show for LiveNode {
199 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
200 write!(f, "ln({})", self.get())
204 impl fmt::Show for Variable {
205 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
206 write!(f, "v({})", self.get())
210 // ______________________________________________________________________
213 // This is the first pass and the one that drives the main
214 // computation. It walks up and down the IR once. On the way down,
215 // we count for each function the number of variables as well as
216 // liveness nodes. A liveness node is basically an expression or
217 // capture clause that does something of interest: either it has
218 // interesting control flow or it uses/defines a local variable.
220 // On the way back up, at each function node we create liveness sets
221 // (we now know precisely how big to make our various vectors and so
222 // forth) and then do the data-flow propagation to compute the set
223 // of live variables at each program point.
225 // Finally, we run back over the IR one last time and, using the
226 // computed liveness, check various safety conditions. For example,
227 // there must be no live nodes at the definition site for a variable
228 // unless it has an initializer. Similarly, each non-mutable local
229 // variable must not be assigned if there is some successor
230 // assignment. And so forth.
233 fn is_valid(&self) -> bool {
234 self.get() != uint::MAX
238 fn invalid_node() -> LiveNode { LiveNode(uint::MAX) }
253 Arg(NodeId, ast::Ident),
259 struct IrMaps<'a, 'tcx: 'a> {
260 tcx: &'a ty::ctxt<'tcx>,
262 num_live_nodes: uint,
264 live_node_map: NodeMap<LiveNode>,
265 variable_map: NodeMap<Variable>,
266 capture_info_map: NodeMap<Rc<Vec<CaptureInfo>>>,
267 var_kinds: Vec<VarKind>,
268 lnks: Vec<LiveNodeKind>,
271 impl<'a, 'tcx> IrMaps<'a, 'tcx> {
272 fn new(tcx: &'a ty::ctxt<'tcx>) -> IrMaps<'a, 'tcx> {
277 live_node_map: NodeMap::new(),
278 variable_map: NodeMap::new(),
279 capture_info_map: NodeMap::new(),
280 var_kinds: Vec::new(),
285 fn add_live_node(&mut self, lnk: LiveNodeKind) -> LiveNode {
286 let ln = LiveNode(self.num_live_nodes);
288 self.num_live_nodes += 1;
290 debug!("{} is of kind {}", ln.to_string(),
291 live_node_kind_to_string(lnk, self.tcx));
296 fn add_live_node_for_node(&mut self, node_id: NodeId, lnk: LiveNodeKind) {
297 let ln = self.add_live_node(lnk);
298 self.live_node_map.insert(node_id, ln);
300 debug!("{} is node {}", ln.to_string(), node_id);
303 fn add_variable(&mut self, vk: VarKind) -> Variable {
304 let v = Variable(self.num_vars);
305 self.var_kinds.push(vk);
309 Local(LocalInfo { id: node_id, .. }) | Arg(node_id, _) => {
310 self.variable_map.insert(node_id, v);
312 ImplicitRet | CleanExit => {}
315 debug!("{} is {}", v.to_string(), vk);
320 fn variable(&self, node_id: NodeId, span: Span) -> Variable {
321 match self.variable_map.get(&node_id) {
326 .span_bug(span, format!("no variable registered for id {}",
327 node_id).as_slice());
332 fn variable_name(&self, var: Variable) -> String {
333 match self.var_kinds[var.get()] {
334 Local(LocalInfo { ident: nm, .. }) | Arg(_, nm) => {
335 token::get_ident(nm).get().to_string()
337 ImplicitRet => "<implicit-ret>".to_string(),
338 CleanExit => "<clean-exit>".to_string()
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 impl<'a, 'tcx, 'v> Visitor<'v> for Liveness<'a, 'tcx> {
352 fn visit_fn(&mut self, fk: FnKind<'v>, fd: &'v ast::FnDecl,
353 b: &'v ast::Block, s: Span, n: NodeId) {
354 check_fn(self, fk, fd, b, s, n);
356 fn visit_local(&mut self, l: &ast::Local) {
357 check_local(self, l);
359 fn visit_expr(&mut self, ex: &Expr) {
360 check_expr(self, ex);
362 fn visit_arm(&mut self, a: &ast::Arm) {
367 fn visit_fn(ir: &mut IrMaps,
375 // swap in a new set of IR maps for this function body:
376 let mut fn_maps = IrMaps::new(ir.tcx);
378 debug!("creating fn_maps: {}", &fn_maps as *const IrMaps);
380 for arg in decl.inputs.iter() {
381 pat_util::pat_bindings(&ir.tcx.def_map,
383 |_bm, arg_id, _x, path1| {
384 debug!("adding argument {}", arg_id);
385 let ident = path1.node;
386 fn_maps.add_variable(Arg(arg_id, ident));
390 // gather up the various local variables, significant expressions,
392 visit::walk_fn(&mut fn_maps, fk, decl, body, sp);
394 // Special nodes and variables:
395 // - exit_ln represents the end of the fn, either by return or panic
396 // - implicit_ret_var is a pseudo-variable that represents
397 // an implicit return
398 let specials = Specials {
399 exit_ln: fn_maps.add_live_node(ExitNode),
400 fallthrough_ln: fn_maps.add_live_node(ExitNode),
401 no_ret_var: fn_maps.add_variable(ImplicitRet),
402 clean_exit_var: fn_maps.add_variable(CleanExit)
406 let mut lsets = Liveness::new(&mut fn_maps, specials);
407 let entry_ln = lsets.compute(decl, body);
409 // check for various error conditions
410 lsets.visit_block(body);
411 lsets.check_ret(id, sp, fk, entry_ln, body);
412 lsets.warn_about_unused_args(decl, entry_ln);
415 fn visit_local(ir: &mut IrMaps, local: &ast::Local) {
416 pat_util::pat_bindings(&ir.tcx.def_map, &*local.pat, |_, p_id, sp, path1| {
417 debug!("adding local variable {}", p_id);
418 let name = path1.node;
419 ir.add_live_node_for_node(p_id, VarDefNode(sp));
420 ir.add_variable(Local(LocalInfo {
425 visit::walk_local(ir, local);
428 fn visit_arm(ir: &mut IrMaps, arm: &ast::Arm) {
429 for pat in arm.pats.iter() {
430 pat_util::pat_bindings(&ir.tcx.def_map, &**pat, |bm, p_id, sp, path1| {
431 debug!("adding local variable {} from match with bm {}",
433 let name = path1.node;
434 ir.add_live_node_for_node(p_id, VarDefNode(sp));
435 ir.add_variable(Local(LocalInfo {
441 visit::walk_arm(ir, arm);
444 fn visit_expr(ir: &mut IrMaps, expr: &Expr) {
446 // live nodes required for uses or definitions of variables:
447 ast::ExprPath(_) => {
448 let def = ir.tcx.def_map.borrow()[expr.id].clone();
449 debug!("expr {}: path that leads to {}", expr.id, def);
451 DefLocal(..) => ir.add_live_node_for_node(expr.id, ExprNode(expr.span)),
454 visit::walk_expr(ir, expr);
456 ast::ExprClosure(..) | ast::ExprProc(..) => {
457 // Interesting control flow (for loops can contain labeled
458 // breaks or continues)
459 ir.add_live_node_for_node(expr.id, ExprNode(expr.span));
461 // Make a live_node for each captured variable, with the span
462 // being the location that the variable is used. This results
463 // in better error messages than just pointing at the closure
464 // construction site.
465 let mut call_caps = Vec::new();
466 ty::with_freevars(ir.tcx, expr.id, |freevars| {
467 for fv in freevars.iter() {
470 let fv_ln = ir.add_live_node(FreeVarNode(fv.span));
471 call_caps.push(CaptureInfo {ln: fv_ln,
478 ir.set_captures(expr.id, call_caps);
480 visit::walk_expr(ir, expr);
483 // live nodes required for interesting control flow:
484 ast::ExprIf(..) | ast::ExprMatch(..) | ast::ExprWhile(..) | ast::ExprLoop(..) => {
485 ir.add_live_node_for_node(expr.id, ExprNode(expr.span));
486 visit::walk_expr(ir, expr);
488 ast::ExprIfLet(..) => {
489 ir.tcx.sess.span_bug(expr.span, "non-desugared ExprIfLet");
491 ast::ExprWhileLet(..) => {
492 ir.tcx.sess.span_bug(expr.span, "non-desugared ExprWhileLet");
494 ast::ExprForLoop(ref pat, _, _, _) => {
495 pat_util::pat_bindings(&ir.tcx.def_map, &**pat, |bm, p_id, sp, path1| {
496 debug!("adding local variable {} from for loop with bm {}",
498 let name = path1.node;
499 ir.add_live_node_for_node(p_id, VarDefNode(sp));
500 ir.add_variable(Local(LocalInfo {
505 ir.add_live_node_for_node(expr.id, ExprNode(expr.span));
506 visit::walk_expr(ir, expr);
508 ast::ExprBinary(op, _, _) if ast_util::lazy_binop(op) => {
509 ir.add_live_node_for_node(expr.id, ExprNode(expr.span));
510 visit::walk_expr(ir, expr);
513 // otherwise, live nodes are not required:
514 ast::ExprIndex(..) | ast::ExprField(..) | ast::ExprTupField(..) |
515 ast::ExprVec(..) | ast::ExprCall(..) | ast::ExprMethodCall(..) |
516 ast::ExprTup(..) | ast::ExprBinary(..) | ast::ExprAddrOf(..) |
517 ast::ExprCast(..) | ast::ExprUnary(..) | ast::ExprBreak(_) |
518 ast::ExprAgain(_) | ast::ExprLit(_) | ast::ExprRet(..) |
519 ast::ExprBlock(..) | ast::ExprAssign(..) | ast::ExprAssignOp(..) |
520 ast::ExprMac(..) | ast::ExprStruct(..) | ast::ExprRepeat(..) |
521 ast::ExprParen(..) | ast::ExprInlineAsm(..) | ast::ExprBox(..) |
522 ast::ExprSlice(..) => {
523 visit::walk_expr(ir, expr);
528 // ______________________________________________________________________
529 // Computing liveness sets
531 // Actually we compute just a bit more than just liveness, but we use
532 // the same basic propagation framework in all cases.
541 fn invalid_users() -> Users {
543 reader: invalid_node(),
544 writer: invalid_node(),
551 fallthrough_ln: LiveNode,
552 no_ret_var: Variable,
553 clean_exit_var: Variable
556 static ACC_READ: uint = 1u;
557 static ACC_WRITE: uint = 2u;
558 static ACC_USE: uint = 4u;
560 struct Liveness<'a, 'tcx: 'a> {
561 ir: &'a mut IrMaps<'a, 'tcx>,
563 successors: Vec<LiveNode>,
565 // The list of node IDs for the nested loop scopes
567 loop_scope: Vec<NodeId>,
568 // mappings from loop node ID to LiveNode
569 // ("break" label should map to loop node ID,
570 // it probably doesn't now)
571 break_ln: NodeMap<LiveNode>,
572 cont_ln: NodeMap<LiveNode>
575 impl<'a, 'tcx> Liveness<'a, 'tcx> {
576 fn new(ir: &'a mut IrMaps<'a, 'tcx>, specials: Specials) -> Liveness<'a, 'tcx> {
577 let num_live_nodes = ir.num_live_nodes;
578 let num_vars = ir.num_vars;
582 successors: Vec::from_elem(num_live_nodes, invalid_node()),
583 users: Vec::from_elem(num_live_nodes * num_vars, invalid_users()),
584 loop_scope: Vec::new(),
585 break_ln: NodeMap::new(),
586 cont_ln: NodeMap::new(),
590 fn live_node(&self, node_id: NodeId, span: Span) -> LiveNode {
591 match self.ir.live_node_map.get(&node_id) {
594 // This must be a mismatch between the ir_map construction
595 // above and the propagation code below; the two sets of
596 // code have to agree about which AST nodes are worth
597 // creating liveness nodes for.
598 self.ir.tcx.sess.span_bug(
600 format!("no live node registered for node {}",
601 node_id).as_slice());
606 fn variable(&self, node_id: NodeId, span: Span) -> Variable {
607 self.ir.variable(node_id, span)
610 fn pat_bindings(&mut self,
612 f: |&mut Liveness<'a, 'tcx>, LiveNode, Variable, Span, NodeId|) {
613 pat_util::pat_bindings(&self.ir.tcx.def_map, pat, |_bm, p_id, sp, _n| {
614 let ln = self.live_node(p_id, sp);
615 let var = self.variable(p_id, sp);
616 f(self, ln, var, sp, p_id);
620 fn arm_pats_bindings(&mut self,
621 pat: Option<&ast::Pat>,
622 f: |&mut Liveness<'a, 'tcx>, LiveNode, Variable, Span, NodeId|) {
625 self.pat_bindings(pat, f);
631 fn define_bindings_in_pat(&mut self, pat: &ast::Pat, succ: LiveNode)
633 self.define_bindings_in_arm_pats(Some(pat), succ)
636 fn define_bindings_in_arm_pats(&mut self, pat: Option<&ast::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) -> uint {
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(&mut self,
688 op: |&mut Liveness<'a, 'tcx>, uint, uint|) {
689 let node_base_idx = self.idx(ln, Variable(0u));
690 let succ_base_idx = self.idx(succ_ln, Variable(0u));
691 for var_idx in range(0u, self.ir.num_vars) {
692 op(self, node_base_idx + var_idx, succ_base_idx + var_idx);
699 test: |uint| -> LiveNode) -> io::IoResult<()> {
700 let node_base_idx = self.idx(ln, Variable(0));
701 for var_idx in range(0u, self.ir.num_vars) {
702 let idx = node_base_idx + var_idx;
703 if test(idx).is_valid() {
704 try!(write!(wr, " {}", Variable(var_idx).to_string()));
710 fn find_loop_scope(&self,
711 opt_label: Option<ast::Ident>,
717 // Refers to a labeled loop. Use the results of resolve
719 match self.ir.tcx.def_map.borrow().get(&id) {
720 Some(&DefLabel(loop_id)) => loop_id,
721 _ => self.ir.tcx.sess.span_bug(sp, "label on break/loop \
722 doesn't refer to a loop")
726 // Vanilla 'break' or 'loop', so use the enclosing
728 if self.loop_scope.len() == 0 {
729 self.ir.tcx.sess.span_bug(sp, "break outside loop");
731 *self.loop_scope.last().unwrap()
737 #[allow(unused_must_use)]
738 fn ln_str(&self, ln: LiveNode) -> String {
739 let mut wr = Vec::new();
741 let wr = &mut wr as &mut io::Writer;
742 write!(wr, "[ln({}) of kind {} reads", ln.get(), self.ir.lnk(ln));
743 self.write_vars(wr, ln, |idx| self.users[idx].reader);
744 write!(wr, " writes");
745 self.write_vars(wr, ln, |idx| self.users[idx].writer);
746 write!(wr, " precedes {}]", self.successors[ln.get()].to_string());
748 String::from_utf8(wr).unwrap()
751 fn init_empty(&mut self, ln: LiveNode, succ_ln: LiveNode) {
752 self.successors[ln.get()] = succ_ln;
754 // It is not necessary to initialize the
755 // values to empty because this is the value
756 // they have when they are created, and the sets
757 // only grow during iterations.
759 // self.indices(ln) { |idx|
760 // self.users[idx] = invalid_users();
764 fn init_from_succ(&mut self, ln: LiveNode, succ_ln: LiveNode) {
765 // more efficient version of init_empty() / merge_from_succ()
766 self.successors[ln.get()] = succ_ln;
768 self.indices2(ln, succ_ln, |this, idx, succ_idx| {
769 this.users[idx] = this.users[succ_idx]
771 debug!("init_from_succ(ln={}, succ={})",
772 self.ln_str(ln), self.ln_str(succ_ln));
775 fn merge_from_succ(&mut self,
780 if ln == succ_ln { return false; }
782 let mut changed = false;
783 self.indices2(ln, succ_ln, |this, idx, succ_idx| {
784 changed |= copy_if_invalid(this.users[succ_idx].reader,
785 &mut this.users[idx].reader);
786 changed |= copy_if_invalid(this.users[succ_idx].writer,
787 &mut this.users[idx].writer);
788 if this.users[succ_idx].used && !this.users[idx].used {
789 this.users[idx].used = true;
794 debug!("merge_from_succ(ln={}, succ={}, first_merge={}, changed={})",
795 ln.to_string(), self.ln_str(succ_ln), first_merge, changed);
798 fn copy_if_invalid(src: LiveNode, dst: &mut LiveNode) -> bool {
799 if src.is_valid() && !dst.is_valid() {
808 // Indicates that a local variable was *defined*; we know that no
809 // uses of the variable can precede the definition (resolve checks
810 // this) so we just clear out all the data.
811 fn define(&mut self, writer: LiveNode, var: Variable) {
812 let idx = self.idx(writer, var);
813 self.users[idx].reader = invalid_node();
814 self.users[idx].writer = invalid_node();
816 debug!("{} defines {} (idx={}): {}", writer.to_string(), var.to_string(),
817 idx, self.ln_str(writer));
820 // Either read, write, or both depending on the acc bitset
821 fn acc(&mut self, ln: LiveNode, var: Variable, acc: uint) {
822 debug!("{} accesses[{:x}] {}: {}",
823 ln.to_string(), acc, var.to_string(), self.ln_str(ln));
825 let idx = self.idx(ln, var);
826 let user = &mut self.users[idx];
828 if (acc & ACC_WRITE) != 0 {
829 user.reader = invalid_node();
833 // Important: if we both read/write, must do read second
834 // or else the write will override.
835 if (acc & ACC_READ) != 0 {
839 if (acc & ACC_USE) != 0 {
844 // _______________________________________________________________________
846 fn compute(&mut self, decl: &ast::FnDecl, body: &ast::Block) -> LiveNode {
847 // if there is a `break` or `again` at the top level, then it's
848 // effectively a return---this only occurs in `for` loops,
849 // where the body is really a closure.
851 debug!("compute: using id for block, {}", block_to_string(body));
853 let exit_ln = self.s.exit_ln;
854 let entry_ln: LiveNode =
855 self.with_loop_nodes(body.id, exit_ln, exit_ln,
856 |this| this.propagate_through_fn_block(decl, body));
858 // hack to skip the loop unless debug! is enabled:
859 debug!("^^ liveness computation results for body {} (entry={})",
861 for ln_idx in range(0u, self.ir.num_live_nodes) {
862 debug!("{}", self.ln_str(LiveNode(ln_idx)));
866 entry_ln.to_string());
871 fn propagate_through_fn_block(&mut self, _: &ast::FnDecl, blk: &ast::Block)
873 // the fallthrough exit is only for those cases where we do not
874 // explicitly return:
876 self.init_from_succ(s.fallthrough_ln, s.exit_ln);
877 if blk.expr.is_none() {
878 self.acc(s.fallthrough_ln, s.no_ret_var, ACC_READ)
880 self.acc(s.fallthrough_ln, s.clean_exit_var, ACC_READ);
882 self.propagate_through_block(blk, s.fallthrough_ln)
885 fn propagate_through_block(&mut self, blk: &ast::Block, succ: LiveNode)
887 let succ = self.propagate_through_opt_expr(blk.expr.as_ref().map(|e| &**e), succ);
888 blk.stmts.iter().rev().fold(succ, |succ, stmt| {
889 self.propagate_through_stmt(&**stmt, succ)
893 fn propagate_through_stmt(&mut self, stmt: &ast::Stmt, succ: LiveNode)
896 ast::StmtDecl(ref decl, _) => {
897 self.propagate_through_decl(&**decl, succ)
900 ast::StmtExpr(ref expr, _) | ast::StmtSemi(ref expr, _) => {
901 self.propagate_through_expr(&**expr, succ)
904 ast::StmtMac(..) => {
905 self.ir.tcx.sess.span_bug(stmt.span, "unexpanded macro");
910 fn propagate_through_decl(&mut self, decl: &ast::Decl, succ: LiveNode)
913 ast::DeclLocal(ref local) => {
914 self.propagate_through_local(&**local, succ)
916 ast::DeclItem(_) => succ,
920 fn propagate_through_local(&mut self, local: &ast::Local, succ: LiveNode)
922 // Note: we mark the variable as defined regardless of whether
923 // there is an initializer. Initially I had thought to only mark
924 // the live variable as defined if it was initialized, and then we
925 // could check for uninit variables just by scanning what is live
926 // at the start of the function. But that doesn't work so well for
927 // immutable variables defined in a loop:
928 // loop { let x; x = 5; }
929 // because the "assignment" loops back around and generates an error.
931 // So now we just check that variables defined w/o an
932 // initializer are not live at the point of their
933 // initialization, which is mildly more complex than checking
934 // once at the func header but otherwise equivalent.
936 let succ = self.propagate_through_opt_expr(local.init.as_ref().map(|e| &**e), succ);
937 self.define_bindings_in_pat(&*local.pat, succ)
940 fn propagate_through_exprs(&mut self, exprs: &[P<Expr>], succ: LiveNode)
942 exprs.iter().rev().fold(succ, |succ, expr| {
943 self.propagate_through_expr(&**expr, succ)
947 fn propagate_through_opt_expr(&mut self,
948 opt_expr: Option<&Expr>,
951 opt_expr.map_or(succ, |expr| self.propagate_through_expr(expr, succ))
954 fn propagate_through_expr(&mut self, expr: &Expr, succ: LiveNode)
956 debug!("propagate_through_expr: {}", expr_to_string(expr));
959 // Interesting cases with control flow or which gen/kill
961 ast::ExprPath(_) => {
962 self.access_path(expr, succ, ACC_READ | ACC_USE)
965 ast::ExprField(ref e, _) => {
966 self.propagate_through_expr(&**e, succ)
969 ast::ExprTupField(ref e, _) => {
970 self.propagate_through_expr(&**e, succ)
973 ast::ExprClosure(_, _, _, ref blk) |
974 ast::ExprProc(_, ref blk) => {
975 debug!("{} is an ExprClosure or ExprProc",
976 expr_to_string(expr));
979 The next-node for a break is the successor of the entire
980 loop. The next-node for a continue is the top of this loop.
982 let node = self.live_node(expr.id, expr.span);
983 self.with_loop_nodes(blk.id, succ, node, |this| {
985 // the construction of a closure itself is not important,
986 // but we have to consider the closed over variables.
987 let caps = match this.ir.capture_info_map.get(&expr.id) {
988 Some(caps) => caps.clone(),
990 this.ir.tcx.sess.span_bug(expr.span, "no registered caps");
993 caps.iter().rev().fold(succ, |succ, cap| {
994 this.init_from_succ(cap.ln, succ);
995 let var = this.variable(cap.var_nid, expr.span);
996 this.acc(cap.ln, var, ACC_READ | ACC_USE);
1002 ast::ExprIf(ref cond, ref then, ref els) => {
1016 let else_ln = self.propagate_through_opt_expr(els.as_ref().map(|e| &**e), succ);
1017 let then_ln = self.propagate_through_block(&**then, succ);
1018 let ln = self.live_node(expr.id, expr.span);
1019 self.init_from_succ(ln, else_ln);
1020 self.merge_from_succ(ln, then_ln, false);
1021 self.propagate_through_expr(&**cond, ln)
1024 ast::ExprIfLet(..) => {
1025 self.ir.tcx.sess.span_bug(expr.span, "non-desugared ExprIfLet");
1028 ast::ExprWhile(ref cond, ref blk, _) => {
1029 self.propagate_through_loop(expr, WhileLoop(&**cond), &**blk, succ)
1032 ast::ExprWhileLet(..) => {
1033 self.ir.tcx.sess.span_bug(expr.span, "non-desugared ExprWhileLet");
1036 ast::ExprForLoop(ref pat, ref head, ref blk, _) => {
1037 let ln = self.propagate_through_loop(expr, ForLoop(&**pat), &**blk, succ);
1038 self.propagate_through_expr(&**head, ln)
1041 // Note that labels have been resolved, so we don't need to look
1042 // at the label ident
1043 ast::ExprLoop(ref blk, _) => {
1044 self.propagate_through_loop(expr, LoopLoop, &**blk, succ)
1047 ast::ExprMatch(ref e, ref arms, _) => {
1062 let ln = self.live_node(expr.id, expr.span);
1063 self.init_empty(ln, succ);
1064 let mut first_merge = true;
1065 for arm in arms.iter() {
1067 self.propagate_through_expr(&*arm.body, succ);
1069 self.propagate_through_opt_expr(arm.guard.as_ref().map(|e| &**e), body_succ);
1070 // only consider the first pattern; any later patterns must have
1071 // the same bindings, and we also consider the first pattern to be
1072 // the "authoritative" set of ids
1074 self.define_bindings_in_arm_pats(arm.pats.as_slice().head().map(|p| &**p),
1076 self.merge_from_succ(ln, arm_succ, first_merge);
1077 first_merge = false;
1079 self.propagate_through_expr(&**e, ln)
1082 ast::ExprRet(ref o_e) => {
1083 // ignore succ and subst exit_ln:
1084 let exit_ln = self.s.exit_ln;
1085 self.propagate_through_opt_expr(o_e.as_ref().map(|e| &**e), exit_ln)
1088 ast::ExprBreak(opt_label) => {
1089 // Find which label this break jumps to
1090 let sc = self.find_loop_scope(opt_label, expr.id, expr.span);
1092 // Now that we know the label we're going to,
1093 // look it up in the break loop nodes table
1095 match self.break_ln.get(&sc) {
1097 None => self.ir.tcx.sess.span_bug(expr.span,
1098 "break to unknown label")
1102 ast::ExprAgain(opt_label) => {
1103 // Find which label this expr continues to
1104 let sc = self.find_loop_scope(opt_label, expr.id, expr.span);
1106 // Now that we know the label we're going to,
1107 // look it up in the continue loop nodes table
1109 match self.cont_ln.get(&sc) {
1111 None => self.ir.tcx.sess.span_bug(expr.span,
1112 "loop to unknown label")
1116 ast::ExprAssign(ref l, ref r) => {
1117 // see comment on lvalues in
1118 // propagate_through_lvalue_components()
1119 let succ = self.write_lvalue(&**l, succ, ACC_WRITE);
1120 let succ = self.propagate_through_lvalue_components(&**l, succ);
1121 self.propagate_through_expr(&**r, succ)
1124 ast::ExprAssignOp(_, ref l, ref r) => {
1125 // see comment on lvalues in
1126 // propagate_through_lvalue_components()
1127 let succ = self.write_lvalue(&**l, succ, ACC_WRITE|ACC_READ);
1128 let succ = self.propagate_through_expr(&**r, succ);
1129 self.propagate_through_lvalue_components(&**l, succ)
1132 // Uninteresting cases: just propagate in rev exec order
1134 ast::ExprVec(ref exprs) => {
1135 self.propagate_through_exprs(exprs.as_slice(), succ)
1138 ast::ExprRepeat(ref element, ref count) => {
1139 let succ = self.propagate_through_expr(&**count, succ);
1140 self.propagate_through_expr(&**element, succ)
1143 ast::ExprStruct(_, ref fields, ref with_expr) => {
1144 let succ = self.propagate_through_opt_expr(with_expr.as_ref().map(|e| &**e), succ);
1145 fields.iter().rev().fold(succ, |succ, field| {
1146 self.propagate_through_expr(&*field.expr, succ)
1150 ast::ExprCall(ref f, ref args) => {
1151 let diverges = !self.ir.tcx.is_method_call(expr.id) && {
1152 let t_ret = ty::ty_fn_ret(ty::expr_ty(self.ir.tcx, &**f));
1153 t_ret == ty::FnDiverging
1155 let succ = if diverges {
1160 let succ = self.propagate_through_exprs(args.as_slice(), succ);
1161 self.propagate_through_expr(&**f, succ)
1164 ast::ExprMethodCall(_, _, ref args) => {
1165 let method_call = typeck::MethodCall::expr(expr.id);
1166 let method_ty = self.ir.tcx.method_map.borrow().get(&method_call).unwrap().ty;
1167 let diverges = ty::ty_fn_ret(method_ty) == ty::FnDiverging;
1168 let succ = if diverges {
1173 self.propagate_through_exprs(args.as_slice(), succ)
1176 ast::ExprTup(ref exprs) => {
1177 self.propagate_through_exprs(exprs.as_slice(), succ)
1180 ast::ExprBinary(op, ref l, ref r) if ast_util::lazy_binop(op) => {
1181 let r_succ = self.propagate_through_expr(&**r, succ);
1183 let ln = self.live_node(expr.id, expr.span);
1184 self.init_from_succ(ln, succ);
1185 self.merge_from_succ(ln, r_succ, false);
1187 self.propagate_through_expr(&**l, ln)
1190 ast::ExprIndex(ref l, ref r) |
1191 ast::ExprBinary(_, ref l, ref r) |
1192 ast::ExprBox(ref l, ref r) => {
1193 let r_succ = self.propagate_through_expr(&**r, succ);
1194 self.propagate_through_expr(&**l, r_succ)
1197 ast::ExprSlice(ref e1, ref e2, ref e3, _) => {
1198 let succ = e3.as_ref().map_or(succ, |e| self.propagate_through_expr(&**e, succ));
1199 let succ = e2.as_ref().map_or(succ, |e| self.propagate_through_expr(&**e, succ));
1200 self.propagate_through_expr(&**e1, succ)
1203 ast::ExprAddrOf(_, ref e) |
1204 ast::ExprCast(ref e, _) |
1205 ast::ExprUnary(_, ref e) |
1206 ast::ExprParen(ref e) => {
1207 self.propagate_through_expr(&**e, succ)
1210 ast::ExprInlineAsm(ref ia) => {
1212 let succ = ia.outputs.iter().rev().fold(succ, |succ, &(_, ref expr, _)| {
1213 // see comment on lvalues
1214 // in propagate_through_lvalue_components()
1215 let succ = self.write_lvalue(&**expr, succ, ACC_WRITE);
1216 self.propagate_through_lvalue_components(&**expr, succ)
1218 // Inputs are executed first. Propagate last because of rev order
1219 ia.inputs.iter().rev().fold(succ, |succ, &(_, ref expr)| {
1220 self.propagate_through_expr(&**expr, succ)
1224 ast::ExprLit(..) => {
1228 ast::ExprBlock(ref blk) => {
1229 self.propagate_through_block(&**blk, succ)
1232 ast::ExprMac(..) => {
1233 self.ir.tcx.sess.span_bug(expr.span, "unexpanded macro");
1238 fn propagate_through_lvalue_components(&mut self,
1244 // In general, the full flow graph structure for an
1245 // assignment/move/etc can be handled in one of two ways,
1246 // depending on whether what is being assigned is a "tracked
1247 // value" or not. A tracked value is basically a local
1248 // variable or argument.
1250 // The two kinds of graphs are:
1252 // Tracked lvalue Untracked lvalue
1253 // ----------------------++-----------------------
1257 // (rvalue) || (rvalue)
1260 // (write of lvalue) || (lvalue components)
1265 // ----------------------++-----------------------
1267 // I will cover the two cases in turn:
1269 // # Tracked lvalues
1271 // A tracked lvalue is a local variable/argument `x`. In
1272 // these cases, the link_node where the write occurs is linked
1273 // to node id of `x`. The `write_lvalue()` routine generates
1274 // the contents of this node. There are no subcomponents to
1277 // # Non-tracked lvalues
1279 // These are lvalues like `x[5]` or `x.f`. In that case, we
1280 // basically ignore the value which is written to but generate
1281 // reads for the components---`x` in these two examples. The
1282 // components reads are generated by
1283 // `propagate_through_lvalue_components()` (this fn).
1285 // # Illegal lvalues
1287 // It is still possible to observe assignments to non-lvalues;
1288 // these errors are detected in the later pass borrowck. We
1289 // just ignore such cases and treat them as reads.
1292 ast::ExprPath(_) => succ,
1293 ast::ExprField(ref e, _) => self.propagate_through_expr(&**e, succ),
1294 ast::ExprTupField(ref e, _) => self.propagate_through_expr(&**e, succ),
1295 _ => self.propagate_through_expr(expr, succ)
1299 // see comment on propagate_through_lvalue()
1300 fn write_lvalue(&mut self, expr: &Expr, succ: LiveNode, acc: uint)
1303 ast::ExprPath(_) => self.access_path(expr, succ, acc),
1305 // We do not track other lvalues, so just propagate through
1306 // to their subcomponents. Also, it may happen that
1307 // non-lvalues occur here, because those are detected in the
1308 // later pass borrowck.
1313 fn access_path(&mut self, expr: &Expr, succ: LiveNode, acc: uint)
1315 match self.ir.tcx.def_map.borrow()[expr.id].clone() {
1317 let ln = self.live_node(expr.id, expr.span);
1319 self.init_from_succ(ln, succ);
1320 let var = self.variable(nid, expr.span);
1321 self.acc(ln, var, acc);
1329 fn propagate_through_loop(&mut self,
1338 We model control flow like this:
1356 let mut first_merge = true;
1357 let ln = self.live_node(expr.id, expr.span);
1358 self.init_empty(ln, succ);
1362 // If this is not a `loop` loop, then it's possible we bypass
1363 // the body altogether. Otherwise, the only way is via a `break`
1364 // in the loop body.
1365 self.merge_from_succ(ln, succ, first_merge);
1366 first_merge = false;
1369 debug!("propagate_through_loop: using id for loop body {} {}",
1370 expr.id, block_to_string(body));
1372 let cond_ln = match kind {
1374 ForLoop(ref pat) => self.define_bindings_in_pat(*pat, ln),
1375 WhileLoop(ref cond) => self.propagate_through_expr(&**cond, ln),
1377 let body_ln = self.with_loop_nodes(expr.id, succ, ln, |this| {
1378 this.propagate_through_block(body, cond_ln)
1381 // repeat until fixed point is reached:
1382 while self.merge_from_succ(ln, body_ln, first_merge) {
1383 first_merge = false;
1385 let new_cond_ln = match kind {
1387 ForLoop(ref pat) => {
1388 self.define_bindings_in_pat(*pat, ln)
1390 WhileLoop(ref cond) => {
1391 self.propagate_through_expr(&**cond, ln)
1394 assert!(cond_ln == new_cond_ln);
1395 assert!(body_ln == self.with_loop_nodes(expr.id, succ, ln,
1396 |this| this.propagate_through_block(body, cond_ln)));
1402 fn with_loop_nodes<R>(&mut self,
1403 loop_node_id: NodeId,
1406 f: |&mut Liveness<'a, 'tcx>| -> R)
1408 debug!("with_loop_nodes: {} {}", loop_node_id, break_ln.get());
1409 self.loop_scope.push(loop_node_id);
1410 self.break_ln.insert(loop_node_id, break_ln);
1411 self.cont_ln.insert(loop_node_id, cont_ln);
1413 self.loop_scope.pop();
1418 // _______________________________________________________________________
1419 // Checking for error conditions
1421 fn check_local(this: &mut Liveness, local: &ast::Local) {
1424 this.warn_about_unused_or_dead_vars_in_pat(&*local.pat);
1427 this.pat_bindings(&*local.pat, |this, ln, var, sp, id| {
1428 this.warn_about_unused(sp, id, ln, var);
1433 visit::walk_local(this, local);
1436 fn check_arm(this: &mut Liveness, arm: &ast::Arm) {
1437 // only consider the first pattern; any later patterns must have
1438 // the same bindings, and we also consider the first pattern to be
1439 // the "authoritative" set of ids
1440 this.arm_pats_bindings(arm.pats.as_slice().head().map(|p| &**p), |this, ln, var, sp, id| {
1441 this.warn_about_unused(sp, id, ln, var);
1443 visit::walk_arm(this, arm);
1446 fn check_expr(this: &mut Liveness, expr: &Expr) {
1448 ast::ExprAssign(ref l, ref r) => {
1449 this.check_lvalue(&**l);
1450 this.visit_expr(&**r);
1452 visit::walk_expr(this, expr);
1455 ast::ExprAssignOp(_, ref l, _) => {
1456 this.check_lvalue(&**l);
1458 visit::walk_expr(this, expr);
1461 ast::ExprInlineAsm(ref ia) => {
1462 for &(_, ref input) in ia.inputs.iter() {
1463 this.visit_expr(&**input);
1466 // Output operands must be lvalues
1467 for &(_, ref out, _) in ia.outputs.iter() {
1468 this.check_lvalue(&**out);
1469 this.visit_expr(&**out);
1472 visit::walk_expr(this, expr);
1475 ast::ExprForLoop(ref pat, _, _, _) => {
1476 this.pat_bindings(&**pat, |this, ln, var, sp, id| {
1477 this.warn_about_unused(sp, id, ln, var);
1480 visit::walk_expr(this, expr);
1483 // no correctness conditions related to liveness
1484 ast::ExprCall(..) | ast::ExprMethodCall(..) | ast::ExprIf(..) |
1485 ast::ExprMatch(..) | ast::ExprWhile(..) | ast::ExprLoop(..) |
1486 ast::ExprIndex(..) | ast::ExprField(..) | ast::ExprTupField(..) |
1487 ast::ExprVec(..) | ast::ExprTup(..) | ast::ExprBinary(..) |
1488 ast::ExprCast(..) | ast::ExprUnary(..) | ast::ExprRet(..) |
1489 ast::ExprBreak(..) | ast::ExprAgain(..) | ast::ExprLit(_) |
1490 ast::ExprBlock(..) | ast::ExprMac(..) | ast::ExprAddrOf(..) |
1491 ast::ExprStruct(..) | ast::ExprRepeat(..) | ast::ExprParen(..) |
1492 ast::ExprClosure(..) | ast::ExprProc(..) |
1493 ast::ExprPath(..) | ast::ExprBox(..) | ast::ExprSlice(..) => {
1494 visit::walk_expr(this, expr);
1496 ast::ExprIfLet(..) => {
1497 this.ir.tcx.sess.span_bug(expr.span, "non-desugared ExprIfLet");
1499 ast::ExprWhileLet(..) => {
1500 this.ir.tcx.sess.span_bug(expr.span, "non-desugared ExprWhileLet");
1505 fn check_fn(_v: &Liveness,
1507 _decl: &ast::FnDecl,
1511 // do not check contents of nested fns
1514 impl<'a, 'tcx> Liveness<'a, 'tcx> {
1515 fn fn_ret(&self, id: NodeId) -> ty::FnOutput<'tcx> {
1516 let fn_ty = ty::node_id_to_type(self.ir.tcx, id);
1518 ty::ty_unboxed_closure(closure_def_id, _, _) =>
1519 self.ir.tcx.unboxed_closures()
1521 .get(&closure_def_id)
1526 _ => ty::ty_fn_ret(fn_ty)
1535 body: &ast::Block) {
1536 match self.fn_ret(id) {
1537 ty::FnConverging(t_ret)
1538 if self.live_on_entry(entry_ln, self.s.no_ret_var).is_some() => {
1540 if ty::type_is_nil(t_ret) {
1541 // for nil return types, it is ok to not return a value expl.
1543 let ends_with_stmt = match body.expr {
1544 None if body.stmts.len() > 0 =>
1545 match body.stmts.last().unwrap().node {
1546 ast::StmtSemi(ref e, _) => {
1547 ty::expr_ty(self.ir.tcx, &**e) == t_ret
1553 self.ir.tcx.sess.span_err(
1554 sp, "not all control paths return a value");
1556 let last_stmt = body.stmts.last().unwrap();
1557 let original_span = original_sp(self.ir.tcx.sess.codemap(),
1558 last_stmt.span, sp);
1559 let span_semicolon = Span {
1560 lo: original_span.hi - BytePos(1),
1561 hi: original_span.hi,
1562 expn_id: original_span.expn_id
1564 self.ir.tcx.sess.span_help(
1565 span_semicolon, "consider removing this semicolon:");
1570 if self.live_on_entry(entry_ln, self.s.clean_exit_var).is_some() => {
1571 self.ir.tcx.sess.span_err(sp,
1572 "computation may converge in a function marked as diverging");
1579 fn check_lvalue(&mut self, expr: &Expr) {
1581 ast::ExprPath(_) => {
1582 match self.ir.tcx.def_map.borrow()[expr.id].clone() {
1584 // Assignment to an immutable variable or argument: only legal
1585 // if there is no later assignment. If this local is actually
1586 // mutable, then check for a reassignment to flag the mutability
1588 let ln = self.live_node(expr.id, expr.span);
1589 let var = self.variable(nid, expr.span);
1590 self.warn_about_dead_assign(expr.span, expr.id, ln, var);
1597 // For other kinds of lvalues, no checks are required,
1598 // and any embedded expressions are actually rvalues
1599 visit::walk_expr(self, expr);
1604 fn should_warn(&self, var: Variable) -> Option<String> {
1605 let name = self.ir.variable_name(var);
1606 if name.len() == 0 || name.as_bytes()[0] == ('_' as u8) {
1613 fn warn_about_unused_args(&self, decl: &ast::FnDecl, entry_ln: LiveNode) {
1614 for arg in decl.inputs.iter() {
1615 pat_util::pat_bindings(&self.ir.tcx.def_map,
1617 |_bm, p_id, sp, path1| {
1618 let var = self.variable(p_id, sp);
1619 // Ignore unused self.
1620 let ident = path1.node;
1621 if ident.name != special_idents::self_.name {
1622 self.warn_about_unused(sp, p_id, entry_ln, var);
1628 fn warn_about_unused_or_dead_vars_in_pat(&mut self, pat: &ast::Pat) {
1629 self.pat_bindings(pat, |this, ln, var, sp, id| {
1630 if !this.warn_about_unused(sp, id, ln, var) {
1631 this.warn_about_dead_assign(sp, id, ln, var);
1636 fn warn_about_unused(&self,
1642 if !self.used_on_entry(ln, var) {
1643 let r = self.should_warn(var);
1644 for name in r.iter() {
1646 // annoying: for parameters in funcs like `fn(x: int)
1647 // {ret}`, there is only one node, so asking about
1648 // assigned_on_exit() is not meaningful.
1649 let is_assigned = if ln == self.s.exit_ln {
1652 self.assigned_on_exit(ln, var).is_some()
1656 self.ir.tcx.sess.add_lint(lint::builtin::UNUSED_VARIABLES, id, sp,
1657 format!("variable `{}` is assigned to, but never used",
1660 self.ir.tcx.sess.add_lint(lint::builtin::UNUSED_VARIABLES, id, sp,
1661 format!("unused variable: `{}`", *name));
1670 fn warn_about_dead_assign(&self,
1675 if self.live_on_exit(ln, var).is_none() {
1676 let r = self.should_warn(var);
1677 for name in r.iter() {
1678 self.ir.tcx.sess.add_lint(lint::builtin::UNUSED_ASSIGNMENTS, id, sp,
1679 format!("value assigned to `{}` is never read", *name));