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, fail, 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.
106 use middle::mem_categorization::Typer;
107 use middle::pat_util;
110 use util::nodemap::NodeMap;
114 use std::mem::transmute;
120 use syntax::codemap::{BytePos, original_sp, Span};
121 use syntax::parse::token::special_idents;
122 use syntax::parse::token;
123 use syntax::print::pprust::{expr_to_string, block_to_string};
125 use syntax::{visit, ast_util};
126 use syntax::visit::{Visitor, FnKind};
128 /// For use with `propagate_through_loop`.
130 /// An endless `loop` loop.
132 /// A `while` loop, with the given expression as condition.
134 /// A `for` loop, with the given pattern to bind.
138 #[deriving(PartialEq)]
139 struct Variable(uint);
140 #[deriving(PartialEq)]
141 struct LiveNode(uint);
144 fn get(&self) -> uint { let Variable(v) = *self; v }
148 fn get(&self) -> uint { let LiveNode(v) = *self; v }
151 impl Clone for LiveNode {
152 fn clone(&self) -> LiveNode {
157 #[deriving(PartialEq)]
165 fn live_node_kind_to_string(lnk: LiveNodeKind, cx: &ty::ctxt) -> String {
166 let cm = cx.sess.codemap();
169 format!("Free var node [{}]", cm.span_to_string(s))
172 format!("Expr node [{}]", cm.span_to_string(s))
175 format!("Var def node [{}]", cm.span_to_string(s))
177 ExitNode => "Exit node".to_string(),
181 impl<'a, 'tcx, 'v> Visitor<'v> for IrMaps<'a, 'tcx> {
182 fn visit_fn(&mut self, fk: FnKind<'v>, fd: &'v FnDecl,
183 b: &'v Block, s: Span, n: NodeId) {
184 visit_fn(self, fk, fd, b, s, n);
186 fn visit_local(&mut self, l: &ast::Local) { visit_local(self, l); }
187 fn visit_expr(&mut self, ex: &Expr) { visit_expr(self, ex); }
188 fn visit_arm(&mut self, a: &Arm) { visit_arm(self, a); }
191 pub fn check_crate(tcx: &ty::ctxt) {
192 visit::walk_crate(&mut IrMaps::new(tcx), tcx.map.krate());
193 tcx.sess.abort_if_errors();
196 impl fmt::Show for LiveNode {
197 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
198 write!(f, "ln({})", self.get())
202 impl fmt::Show for Variable {
203 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
204 write!(f, "v({})", self.get())
208 // ______________________________________________________________________
211 // This is the first pass and the one that drives the main
212 // computation. It walks up and down the IR once. On the way down,
213 // we count for each function the number of variables as well as
214 // liveness nodes. A liveness node is basically an expression or
215 // capture clause that does something of interest: either it has
216 // interesting control flow or it uses/defines a local variable.
218 // On the way back up, at each function node we create liveness sets
219 // (we now know precisely how big to make our various vectors and so
220 // forth) and then do the data-flow propagation to compute the set
221 // of live variables at each program point.
223 // Finally, we run back over the IR one last time and, using the
224 // computed liveness, check various safety conditions. For example,
225 // there must be no live nodes at the definition site for a variable
226 // unless it has an initializer. Similarly, each non-mutable local
227 // variable must not be assigned if there is some successor
228 // assignment. And so forth.
231 fn is_valid(&self) -> bool {
232 self.get() != uint::MAX
236 fn invalid_node() -> LiveNode { LiveNode(uint::MAX) }
254 struct IrMaps<'a, 'tcx: 'a> {
255 tcx: &'a ty::ctxt<'tcx>,
257 num_live_nodes: uint,
259 live_node_map: NodeMap<LiveNode>,
260 variable_map: NodeMap<Variable>,
261 capture_info_map: NodeMap<Rc<Vec<CaptureInfo>>>,
262 var_kinds: Vec<VarKind>,
263 lnks: Vec<LiveNodeKind>,
266 impl<'a, 'tcx> IrMaps<'a, 'tcx> {
267 fn new(tcx: &'a ty::ctxt<'tcx>) -> IrMaps<'a, 'tcx> {
272 live_node_map: NodeMap::new(),
273 variable_map: NodeMap::new(),
274 capture_info_map: NodeMap::new(),
275 var_kinds: Vec::new(),
280 fn add_live_node(&mut self, lnk: LiveNodeKind) -> LiveNode {
281 let ln = LiveNode(self.num_live_nodes);
283 self.num_live_nodes += 1;
285 debug!("{} is of kind {}", ln.to_string(),
286 live_node_kind_to_string(lnk, self.tcx));
291 fn add_live_node_for_node(&mut self, node_id: NodeId, lnk: LiveNodeKind) {
292 let ln = self.add_live_node(lnk);
293 self.live_node_map.insert(node_id, ln);
295 debug!("{} is node {}", ln.to_string(), node_id);
298 fn add_variable(&mut self, vk: VarKind) -> Variable {
299 let v = Variable(self.num_vars);
300 self.var_kinds.push(vk);
304 Local(LocalInfo { id: node_id, .. }) | Arg(node_id, _) => {
305 self.variable_map.insert(node_id, v);
310 debug!("{} is {:?}", v.to_string(), vk);
315 fn variable(&self, node_id: NodeId, span: Span) -> Variable {
316 match self.variable_map.find(&node_id) {
321 .span_bug(span, format!("no variable registered for id {}",
322 node_id).as_slice());
327 fn variable_name(&self, var: Variable) -> String {
328 match self.var_kinds.get(var.get()) {
329 &Local(LocalInfo { ident: nm, .. }) | &Arg(_, nm) => {
330 token::get_ident(nm).get().to_string()
332 &ImplicitRet => "<implicit-ret>".to_string()
336 fn set_captures(&mut self, node_id: NodeId, cs: Vec<CaptureInfo>) {
337 self.capture_info_map.insert(node_id, Rc::new(cs));
340 fn lnk(&self, ln: LiveNode) -> LiveNodeKind {
341 *self.lnks.get(ln.get())
345 impl<'a, 'tcx, 'v> Visitor<'v> for Liveness<'a, 'tcx> {
346 fn visit_fn(&mut self, fk: FnKind<'v>, fd: &'v FnDecl, b: &'v Block, s: Span, n: NodeId) {
347 check_fn(self, fk, fd, b, s, n);
349 fn visit_local(&mut self, l: &ast::Local) {
350 check_local(self, l);
352 fn visit_expr(&mut self, ex: &Expr) {
353 check_expr(self, ex);
355 fn visit_arm(&mut self, a: &Arm) {
360 fn visit_fn(ir: &mut IrMaps,
366 debug!("visit_fn: id={}", id);
367 let _i = ::util::common::indenter();
369 // swap in a new set of IR maps for this function body:
370 let mut fn_maps = IrMaps::new(ir.tcx);
373 debug!("creating fn_maps: {}",
374 transmute::<&IrMaps, *const IrMaps>(&fn_maps));
377 for arg in decl.inputs.iter() {
378 pat_util::pat_bindings(&ir.tcx.def_map,
380 |_bm, arg_id, _x, path1| {
381 debug!("adding argument {}", arg_id);
382 let ident = path1.node;
383 fn_maps.add_variable(Arg(arg_id, ident));
387 // gather up the various local variables, significant expressions,
389 visit::walk_fn(&mut fn_maps, fk, decl, body, sp);
391 // Special nodes and variables:
392 // - exit_ln represents the end of the fn, either by return or fail
393 // - implicit_ret_var is a pseudo-variable that represents
394 // an implicit return
395 let specials = Specials {
396 exit_ln: fn_maps.add_live_node(ExitNode),
397 fallthrough_ln: fn_maps.add_live_node(ExitNode),
398 no_ret_var: fn_maps.add_variable(ImplicitRet)
402 let mut lsets = Liveness::new(&mut fn_maps, specials);
403 let entry_ln = lsets.compute(decl, body);
405 // check for various error conditions
406 lsets.visit_block(body);
407 lsets.check_ret(id, sp, fk, entry_ln, body);
408 lsets.warn_about_unused_args(decl, entry_ln);
411 fn visit_local(ir: &mut IrMaps, local: &ast::Local) {
412 pat_util::pat_bindings(&ir.tcx.def_map, &*local.pat, |_, p_id, sp, path1| {
413 debug!("adding local variable {}", p_id);
414 let name = path1.node;
415 ir.add_live_node_for_node(p_id, VarDefNode(sp));
416 ir.add_variable(Local(LocalInfo {
421 visit::walk_local(ir, local);
424 fn visit_arm(ir: &mut IrMaps, arm: &Arm) {
425 for pat in arm.pats.iter() {
426 pat_util::pat_bindings(&ir.tcx.def_map, &**pat, |bm, p_id, sp, path1| {
427 debug!("adding local variable {} from match with bm {:?}",
429 let name = path1.node;
430 ir.add_live_node_for_node(p_id, VarDefNode(sp));
431 ir.add_variable(Local(LocalInfo {
437 visit::walk_arm(ir, arm);
440 fn visit_expr(ir: &mut IrMaps, expr: &Expr) {
442 // live nodes required for uses or definitions of variables:
444 let def = ir.tcx.def_map.borrow().get_copy(&expr.id);
445 debug!("expr {}: path that leads to {:?}", expr.id, def);
447 DefLocal(..) => ir.add_live_node_for_node(expr.id, ExprNode(expr.span)),
450 visit::walk_expr(ir, expr);
452 ExprFnBlock(..) | ExprProc(..) | ExprUnboxedFn(..) => {
453 // Interesting control flow (for loops can contain labeled
454 // breaks or continues)
455 ir.add_live_node_for_node(expr.id, ExprNode(expr.span));
457 // Make a live_node for each captured variable, with the span
458 // being the location that the variable is used. This results
459 // in better error messages than just pointing at the closure
460 // construction site.
461 let mut call_caps = Vec::new();
462 ty::with_freevars(ir.tcx, expr.id, |freevars| {
463 for fv in freevars.iter() {
466 let fv_ln = ir.add_live_node(FreeVarNode(fv.span));
467 call_caps.push(CaptureInfo {ln: fv_ln,
474 ir.set_captures(expr.id, call_caps);
476 visit::walk_expr(ir, expr);
479 // live nodes required for interesting control flow:
480 ExprIf(..) | ExprMatch(..) | ExprWhile(..) | ExprLoop(..) => {
481 ir.add_live_node_for_node(expr.id, ExprNode(expr.span));
482 visit::walk_expr(ir, expr);
484 ExprIfLet(..) => fail!("non-desugared ExprIfLet"),
485 ExprForLoop(ref pat, _, _, _) => {
486 pat_util::pat_bindings(&ir.tcx.def_map, &**pat, |bm, p_id, sp, path1| {
487 debug!("adding local variable {} from for loop with bm {:?}",
489 let name = path1.node;
490 ir.add_live_node_for_node(p_id, VarDefNode(sp));
491 ir.add_variable(Local(LocalInfo {
496 ir.add_live_node_for_node(expr.id, ExprNode(expr.span));
497 visit::walk_expr(ir, expr);
499 ExprBinary(op, _, _) if ast_util::lazy_binop(op) => {
500 ir.add_live_node_for_node(expr.id, ExprNode(expr.span));
501 visit::walk_expr(ir, expr);
504 // otherwise, live nodes are not required:
505 ExprIndex(..) | ExprField(..) | ExprTupField(..) | ExprVec(..) |
506 ExprCall(..) | ExprMethodCall(..) | ExprTup(..) | ExprSlice(..) |
507 ExprBinary(..) | ExprAddrOf(..) |
508 ExprCast(..) | ExprUnary(..) | ExprBreak(_) |
509 ExprAgain(_) | ExprLit(_) | ExprRet(..) | ExprBlock(..) |
510 ExprAssign(..) | ExprAssignOp(..) | ExprMac(..) |
511 ExprStruct(..) | ExprRepeat(..) | ExprParen(..) |
512 ExprInlineAsm(..) | ExprBox(..) => {
513 visit::walk_expr(ir, expr);
518 // ______________________________________________________________________
519 // Computing liveness sets
521 // Actually we compute just a bit more than just liveness, but we use
522 // the same basic propagation framework in all cases.
531 fn invalid_users() -> Users {
533 reader: invalid_node(),
534 writer: invalid_node(),
541 fallthrough_ln: LiveNode,
545 static ACC_READ: uint = 1u;
546 static ACC_WRITE: uint = 2u;
547 static ACC_USE: uint = 4u;
549 struct Liveness<'a, 'tcx: 'a> {
550 ir: &'a mut IrMaps<'a, 'tcx>,
552 successors: Vec<LiveNode>,
554 // The list of node IDs for the nested loop scopes
556 loop_scope: Vec<NodeId>,
557 // mappings from loop node ID to LiveNode
558 // ("break" label should map to loop node ID,
559 // it probably doesn't now)
560 break_ln: NodeMap<LiveNode>,
561 cont_ln: NodeMap<LiveNode>
564 impl<'a, 'tcx> Liveness<'a, 'tcx> {
565 fn new(ir: &'a mut IrMaps<'a, 'tcx>, specials: Specials) -> Liveness<'a, 'tcx> {
566 let num_live_nodes = ir.num_live_nodes;
567 let num_vars = ir.num_vars;
571 successors: Vec::from_elem(num_live_nodes, invalid_node()),
572 users: Vec::from_elem(num_live_nodes * num_vars, invalid_users()),
573 loop_scope: Vec::new(),
574 break_ln: NodeMap::new(),
575 cont_ln: NodeMap::new(),
579 fn live_node(&self, node_id: NodeId, span: Span) -> LiveNode {
580 match self.ir.live_node_map.find(&node_id) {
583 // This must be a mismatch between the ir_map construction
584 // above and the propagation code below; the two sets of
585 // code have to agree about which AST nodes are worth
586 // creating liveness nodes for.
587 self.ir.tcx.sess.span_bug(
589 format!("no live node registered for node {}",
590 node_id).as_slice());
595 fn variable(&self, node_id: NodeId, span: Span) -> Variable {
596 self.ir.variable(node_id, span)
599 fn pat_bindings(&mut self,
601 f: |&mut Liveness<'a, 'tcx>, LiveNode, Variable, Span, NodeId|) {
602 pat_util::pat_bindings(&self.ir.tcx.def_map, pat, |_bm, p_id, sp, _n| {
603 let ln = self.live_node(p_id, sp);
604 let var = self.variable(p_id, sp);
605 f(self, ln, var, sp, p_id);
609 fn arm_pats_bindings(&mut self,
611 f: |&mut Liveness<'a, 'tcx>, LiveNode, Variable, Span, NodeId|) {
614 self.pat_bindings(pat, f);
620 fn define_bindings_in_pat(&mut self, pat: &Pat, succ: LiveNode)
622 self.define_bindings_in_arm_pats(Some(pat), succ)
625 fn define_bindings_in_arm_pats(&mut self, pat: Option<&Pat>, succ: LiveNode)
628 self.arm_pats_bindings(pat, |this, ln, var, _sp, _id| {
629 this.init_from_succ(ln, succ);
630 this.define(ln, var);
636 fn idx(&self, ln: LiveNode, var: Variable) -> uint {
637 ln.get() * self.ir.num_vars + var.get()
640 fn live_on_entry(&self, ln: LiveNode, var: Variable)
641 -> Option<LiveNodeKind> {
642 assert!(ln.is_valid());
643 let reader = self.users.get(self.idx(ln, var)).reader;
644 if reader.is_valid() {Some(self.ir.lnk(reader))} else {None}
648 Is this variable live on entry to any of its successor nodes?
650 fn live_on_exit(&self, ln: LiveNode, var: Variable)
651 -> Option<LiveNodeKind> {
652 let successor = *self.successors.get(ln.get());
653 self.live_on_entry(successor, var)
656 fn used_on_entry(&self, ln: LiveNode, var: Variable) -> bool {
657 assert!(ln.is_valid());
658 self.users.get(self.idx(ln, var)).used
661 fn assigned_on_entry(&self, ln: LiveNode, var: Variable)
662 -> Option<LiveNodeKind> {
663 assert!(ln.is_valid());
664 let writer = self.users.get(self.idx(ln, var)).writer;
665 if writer.is_valid() {Some(self.ir.lnk(writer))} else {None}
668 fn assigned_on_exit(&self, ln: LiveNode, var: Variable)
669 -> Option<LiveNodeKind> {
670 let successor = *self.successors.get(ln.get());
671 self.assigned_on_entry(successor, var)
674 fn indices2(&mut self,
677 op: |&mut Liveness<'a, 'tcx>, uint, uint|) {
678 let node_base_idx = self.idx(ln, Variable(0u));
679 let succ_base_idx = self.idx(succ_ln, Variable(0u));
680 for var_idx in range(0u, self.ir.num_vars) {
681 op(self, node_base_idx + var_idx, succ_base_idx + var_idx);
688 test: |uint| -> LiveNode) -> io::IoResult<()> {
689 let node_base_idx = self.idx(ln, Variable(0));
690 for var_idx in range(0u, self.ir.num_vars) {
691 let idx = node_base_idx + var_idx;
692 if test(idx).is_valid() {
693 try!(write!(wr, " {}", Variable(var_idx).to_string()));
699 fn find_loop_scope(&self,
700 opt_label: Option<Ident>,
706 // Refers to a labeled loop. Use the results of resolve
708 match self.ir.tcx.def_map.borrow().find(&id) {
709 Some(&DefLabel(loop_id)) => loop_id,
710 _ => self.ir.tcx.sess.span_bug(sp, "label on break/loop \
711 doesn't refer to a loop")
715 // Vanilla 'break' or 'loop', so use the enclosing
717 if self.loop_scope.len() == 0 {
718 self.ir.tcx.sess.span_bug(sp, "break outside loop");
720 *self.loop_scope.last().unwrap()
726 #[allow(unused_must_use)]
727 fn ln_str(&self, ln: LiveNode) -> String {
728 let mut wr = io::MemWriter::new();
730 let wr = &mut wr as &mut io::Writer;
731 write!(wr, "[ln({}) of kind {:?} reads", ln.get(), self.ir.lnk(ln));
732 self.write_vars(wr, ln, |idx| self.users.get(idx).reader);
733 write!(wr, " writes");
734 self.write_vars(wr, ln, |idx| self.users.get(idx).writer);
735 write!(wr, " precedes {}]", self.successors.get(ln.get()).to_string());
737 str::from_utf8(wr.unwrap().as_slice()).unwrap().to_string()
740 fn init_empty(&mut self, ln: LiveNode, succ_ln: LiveNode) {
741 *self.successors.get_mut(ln.get()) = succ_ln;
743 // It is not necessary to initialize the
744 // values to empty because this is the value
745 // they have when they are created, and the sets
746 // only grow during iterations.
748 // self.indices(ln) { |idx|
749 // self.users[idx] = invalid_users();
753 fn init_from_succ(&mut self, ln: LiveNode, succ_ln: LiveNode) {
754 // more efficient version of init_empty() / merge_from_succ()
755 *self.successors.get_mut(ln.get()) = succ_ln;
757 self.indices2(ln, succ_ln, |this, idx, succ_idx| {
758 *this.users.get_mut(idx) = *this.users.get(succ_idx)
760 debug!("init_from_succ(ln={}, succ={})",
761 self.ln_str(ln), self.ln_str(succ_ln));
764 fn merge_from_succ(&mut self,
769 if ln == succ_ln { return false; }
771 let mut changed = false;
772 self.indices2(ln, succ_ln, |this, idx, succ_idx| {
773 changed |= copy_if_invalid(this.users.get(succ_idx).reader,
774 &mut this.users.get_mut(idx).reader);
775 changed |= copy_if_invalid(this.users.get(succ_idx).writer,
776 &mut this.users.get_mut(idx).writer);
777 if this.users.get(succ_idx).used && !this.users.get(idx).used {
778 this.users.get_mut(idx).used = true;
783 debug!("merge_from_succ(ln={}, succ={}, first_merge={}, changed={})",
784 ln.to_string(), self.ln_str(succ_ln), first_merge, changed);
787 fn copy_if_invalid(src: LiveNode, dst: &mut LiveNode) -> bool {
788 if src.is_valid() && !dst.is_valid() {
797 // Indicates that a local variable was *defined*; we know that no
798 // uses of the variable can precede the definition (resolve checks
799 // this) so we just clear out all the data.
800 fn define(&mut self, writer: LiveNode, var: Variable) {
801 let idx = self.idx(writer, var);
802 self.users.get_mut(idx).reader = invalid_node();
803 self.users.get_mut(idx).writer = invalid_node();
805 debug!("{} defines {} (idx={}): {}", writer.to_string(), var.to_string(),
806 idx, self.ln_str(writer));
809 // Either read, write, or both depending on the acc bitset
810 fn acc(&mut self, ln: LiveNode, var: Variable, acc: uint) {
811 debug!("{} accesses[{:x}] {}: {}",
812 ln.to_string(), acc, var.to_string(), self.ln_str(ln));
814 let idx = self.idx(ln, var);
815 let user = self.users.get_mut(idx);
817 if (acc & ACC_WRITE) != 0 {
818 user.reader = invalid_node();
822 // Important: if we both read/write, must do read second
823 // or else the write will override.
824 if (acc & ACC_READ) != 0 {
828 if (acc & ACC_USE) != 0 {
833 // _______________________________________________________________________
835 fn compute(&mut self, decl: &FnDecl, body: &Block) -> LiveNode {
836 // if there is a `break` or `again` at the top level, then it's
837 // effectively a return---this only occurs in `for` loops,
838 // where the body is really a closure.
840 debug!("compute: using id for block, {}", block_to_string(body));
842 let exit_ln = self.s.exit_ln;
843 let entry_ln: LiveNode =
844 self.with_loop_nodes(body.id, exit_ln, exit_ln,
845 |this| this.propagate_through_fn_block(decl, body));
847 // hack to skip the loop unless debug! is enabled:
848 debug!("^^ liveness computation results for body {} (entry={})",
850 for ln_idx in range(0u, self.ir.num_live_nodes) {
851 debug!("{}", self.ln_str(LiveNode(ln_idx)));
855 entry_ln.to_string());
860 fn propagate_through_fn_block(&mut self, _: &FnDecl, blk: &Block)
862 // the fallthrough exit is only for those cases where we do not
863 // explicitly return:
865 self.init_from_succ(s.fallthrough_ln, s.exit_ln);
866 if blk.expr.is_none() {
867 self.acc(s.fallthrough_ln, s.no_ret_var, ACC_READ)
870 self.propagate_through_block(blk, s.fallthrough_ln)
873 fn propagate_through_block(&mut self, blk: &Block, succ: LiveNode)
875 let succ = self.propagate_through_opt_expr(blk.expr.as_ref().map(|e| &**e), succ);
876 blk.stmts.iter().rev().fold(succ, |succ, stmt| {
877 self.propagate_through_stmt(&**stmt, succ)
881 fn propagate_through_stmt(&mut self, stmt: &Stmt, succ: LiveNode)
884 StmtDecl(ref decl, _) => {
885 self.propagate_through_decl(&**decl, succ)
888 StmtExpr(ref expr, _) | StmtSemi(ref expr, _) => {
889 self.propagate_through_expr(&**expr, succ)
893 self.ir.tcx.sess.span_bug(stmt.span, "unexpanded macro");
898 fn propagate_through_decl(&mut self, decl: &Decl, succ: LiveNode)
901 DeclLocal(ref local) => {
902 self.propagate_through_local(&**local, succ)
908 fn propagate_through_local(&mut self, local: &ast::Local, succ: LiveNode)
910 // Note: we mark the variable as defined regardless of whether
911 // there is an initializer. Initially I had thought to only mark
912 // the live variable as defined if it was initialized, and then we
913 // could check for uninit variables just by scanning what is live
914 // at the start of the function. But that doesn't work so well for
915 // immutable variables defined in a loop:
916 // loop { let x; x = 5; }
917 // because the "assignment" loops back around and generates an error.
919 // So now we just check that variables defined w/o an
920 // initializer are not live at the point of their
921 // initialization, which is mildly more complex than checking
922 // once at the func header but otherwise equivalent.
924 let succ = self.propagate_through_opt_expr(local.init.as_ref().map(|e| &**e), succ);
925 self.define_bindings_in_pat(&*local.pat, succ)
928 fn propagate_through_exprs(&mut self, exprs: &[P<Expr>], succ: LiveNode)
930 exprs.iter().rev().fold(succ, |succ, expr| {
931 self.propagate_through_expr(&**expr, succ)
935 fn propagate_through_opt_expr(&mut self,
936 opt_expr: Option<&Expr>,
939 opt_expr.iter().fold(succ, |succ, expr| {
940 self.propagate_through_expr(&**expr, succ)
944 fn propagate_through_expr(&mut self, expr: &Expr, succ: LiveNode)
946 debug!("propagate_through_expr: {}", expr_to_string(expr));
949 // Interesting cases with control flow or which gen/kill
952 self.access_path(expr, succ, ACC_READ | ACC_USE)
955 ExprField(ref e, _, _) => {
956 self.propagate_through_expr(&**e, succ)
959 ExprTupField(ref e, _, _) => {
960 self.propagate_through_expr(&**e, succ)
963 ExprFnBlock(_, _, ref blk) |
964 ExprProc(_, ref blk) |
965 ExprUnboxedFn(_, _, _, ref blk) => {
966 debug!("{} is an ExprFnBlock, ExprProc, or ExprUnboxedFn",
967 expr_to_string(expr));
970 The next-node for a break is the successor of the entire
971 loop. The next-node for a continue is the top of this loop.
973 let node = self.live_node(expr.id, expr.span);
974 self.with_loop_nodes(blk.id, succ, node, |this| {
976 // the construction of a closure itself is not important,
977 // but we have to consider the closed over variables.
978 let caps = match this.ir.capture_info_map.find(&expr.id) {
979 Some(caps) => caps.clone(),
981 this.ir.tcx.sess.span_bug(expr.span, "no registered caps");
984 caps.iter().rev().fold(succ, |succ, cap| {
985 this.init_from_succ(cap.ln, succ);
986 let var = this.variable(cap.var_nid, expr.span);
987 this.acc(cap.ln, var, ACC_READ | ACC_USE);
993 ExprIf(ref cond, ref then, ref els) => {
1007 let else_ln = self.propagate_through_opt_expr(els.as_ref().map(|e| &**e), succ);
1008 let then_ln = self.propagate_through_block(&**then, succ);
1009 let ln = self.live_node(expr.id, expr.span);
1010 self.init_from_succ(ln, else_ln);
1011 self.merge_from_succ(ln, then_ln, false);
1012 self.propagate_through_expr(&**cond, ln)
1015 ExprIfLet(..) => fail!("non-desugared ExprIfLet"),
1017 ExprWhile(ref cond, ref blk, _) => {
1018 self.propagate_through_loop(expr, WhileLoop(&**cond), &**blk, succ)
1021 ExprForLoop(ref pat, ref head, ref blk, _) => {
1022 let ln = self.propagate_through_loop(expr, ForLoop(&**pat), &**blk, succ);
1023 self.propagate_through_expr(&**head, ln)
1026 // Note that labels have been resolved, so we don't need to look
1027 // at the label ident
1028 ExprLoop(ref blk, _) => {
1029 self.propagate_through_loop(expr, LoopLoop, &**blk, succ)
1032 ExprMatch(ref e, ref arms) => {
1047 let ln = self.live_node(expr.id, expr.span);
1048 self.init_empty(ln, succ);
1049 let mut first_merge = true;
1050 for arm in arms.iter() {
1052 self.propagate_through_expr(&*arm.body, succ);
1054 self.propagate_through_opt_expr(arm.guard.as_ref().map(|e| &**e), body_succ);
1055 // only consider the first pattern; any later patterns must have
1056 // the same bindings, and we also consider the first pattern to be
1057 // the "authoritative" set of ids
1059 self.define_bindings_in_arm_pats(arm.pats.as_slice().head().map(|p| &**p),
1061 self.merge_from_succ(ln, arm_succ, first_merge);
1062 first_merge = false;
1064 self.propagate_through_expr(&**e, ln)
1067 ExprRet(ref o_e) => {
1068 // ignore succ and subst exit_ln:
1069 let exit_ln = self.s.exit_ln;
1070 self.propagate_through_opt_expr(o_e.as_ref().map(|e| &**e), exit_ln)
1073 ExprBreak(opt_label) => {
1074 // Find which label this break jumps to
1075 let sc = self.find_loop_scope(opt_label, expr.id, expr.span);
1077 // Now that we know the label we're going to,
1078 // look it up in the break loop nodes table
1080 match self.break_ln.find(&sc) {
1082 None => self.ir.tcx.sess.span_bug(expr.span,
1083 "break to unknown label")
1087 ExprAgain(opt_label) => {
1088 // Find which label this expr continues to
1089 let sc = self.find_loop_scope(opt_label, expr.id, expr.span);
1091 // Now that we know the label we're going to,
1092 // look it up in the continue loop nodes table
1094 match self.cont_ln.find(&sc) {
1096 None => self.ir.tcx.sess.span_bug(expr.span,
1097 "loop to unknown label")
1101 ExprAssign(ref l, ref r) => {
1102 // see comment on lvalues in
1103 // propagate_through_lvalue_components()
1104 let succ = self.write_lvalue(&**l, succ, ACC_WRITE);
1105 let succ = self.propagate_through_lvalue_components(&**l, succ);
1106 self.propagate_through_expr(&**r, succ)
1109 ExprAssignOp(_, ref l, ref r) => {
1110 // see comment on lvalues in
1111 // propagate_through_lvalue_components()
1112 let succ = self.write_lvalue(&**l, succ, ACC_WRITE|ACC_READ);
1113 let succ = self.propagate_through_expr(&**r, succ);
1114 self.propagate_through_lvalue_components(&**l, succ)
1117 // Uninteresting cases: just propagate in rev exec order
1119 ExprVec(ref exprs) => {
1120 self.propagate_through_exprs(exprs.as_slice(), succ)
1123 ExprRepeat(ref element, ref count) => {
1124 let succ = self.propagate_through_expr(&**count, succ);
1125 self.propagate_through_expr(&**element, succ)
1128 ExprStruct(_, ref fields, ref with_expr) => {
1129 let succ = self.propagate_through_opt_expr(with_expr.as_ref().map(|e| &**e), succ);
1130 fields.iter().rev().fold(succ, |succ, field| {
1131 self.propagate_through_expr(&*field.expr, succ)
1135 ExprCall(ref f, ref args) => {
1136 // calling a fn with bot return type means that the fn
1137 // will fail, and hence the successors can be ignored
1138 let is_bot = !self.ir.tcx.is_method_call(expr.id) && {
1139 let t_ret = ty::ty_fn_ret(ty::expr_ty(self.ir.tcx, &**f));
1140 ty::type_is_bot(t_ret)
1142 let succ = if is_bot {
1147 let succ = self.propagate_through_exprs(args.as_slice(), succ);
1148 self.propagate_through_expr(&**f, succ)
1151 ExprMethodCall(_, _, ref args) => {
1152 // calling a method with bot return type means that the method
1153 // will fail, and hence the successors can be ignored
1154 let t_ret = ty::node_id_to_type(self.ir.tcx, expr.id);
1155 let succ = if ty::type_is_bot(t_ret) {self.s.exit_ln}
1157 self.propagate_through_exprs(args.as_slice(), succ)
1160 ExprTup(ref exprs) => {
1161 self.propagate_through_exprs(exprs.as_slice(), succ)
1164 ExprBinary(op, ref l, ref r) if ast_util::lazy_binop(op) => {
1165 let r_succ = self.propagate_through_expr(&**r, succ);
1167 let ln = self.live_node(expr.id, expr.span);
1168 self.init_from_succ(ln, succ);
1169 self.merge_from_succ(ln, r_succ, false);
1171 self.propagate_through_expr(&**l, ln)
1174 ExprIndex(ref l, ref r) |
1175 ExprBinary(_, ref l, ref r) |
1176 ExprBox(ref l, ref r) => {
1177 let r_succ = self.propagate_through_expr(&**r, succ);
1178 self.propagate_through_expr(&**l, r_succ)
1181 ExprSlice(ref e1, ref e2, ref e3, _) => {
1182 let succ = e3.as_ref().map_or(succ, |e| self.propagate_through_expr(&**e, succ));
1183 let succ = e2.as_ref().map_or(succ, |e| self.propagate_through_expr(&**e, succ));
1184 self.propagate_through_expr(&**e1, succ)
1187 ExprAddrOf(_, ref e) |
1188 ExprCast(ref e, _) |
1189 ExprUnary(_, ref e) |
1190 ExprParen(ref e) => {
1191 self.propagate_through_expr(&**e, succ)
1194 ExprInlineAsm(ref ia) => {
1196 let succ = ia.outputs.iter().rev().fold(succ, |succ, &(_, ref expr, _)| {
1197 // see comment on lvalues
1198 // in propagate_through_lvalue_components()
1199 let succ = self.write_lvalue(&**expr, succ, ACC_WRITE);
1200 self.propagate_through_lvalue_components(&**expr, succ)
1202 // Inputs are executed first. Propagate last because of rev order
1203 ia.inputs.iter().rev().fold(succ, |succ, &(_, ref expr)| {
1204 self.propagate_through_expr(&**expr, succ)
1212 ExprBlock(ref blk) => {
1213 self.propagate_through_block(&**blk, succ)
1217 self.ir.tcx.sess.span_bug(expr.span, "unexpanded macro");
1222 fn propagate_through_lvalue_components(&mut self,
1228 // In general, the full flow graph structure for an
1229 // assignment/move/etc can be handled in one of two ways,
1230 // depending on whether what is being assigned is a "tracked
1231 // value" or not. A tracked value is basically a local
1232 // variable or argument.
1234 // The two kinds of graphs are:
1236 // Tracked lvalue Untracked lvalue
1237 // ----------------------++-----------------------
1241 // (rvalue) || (rvalue)
1244 // (write of lvalue) || (lvalue components)
1249 // ----------------------++-----------------------
1251 // I will cover the two cases in turn:
1253 // # Tracked lvalues
1255 // A tracked lvalue is a local variable/argument `x`. In
1256 // these cases, the link_node where the write occurs is linked
1257 // to node id of `x`. The `write_lvalue()` routine generates
1258 // the contents of this node. There are no subcomponents to
1261 // # Non-tracked lvalues
1263 // These are lvalues like `x[5]` or `x.f`. In that case, we
1264 // basically ignore the value which is written to but generate
1265 // reads for the components---`x` in these two examples. The
1266 // components reads are generated by
1267 // `propagate_through_lvalue_components()` (this fn).
1269 // # Illegal lvalues
1271 // It is still possible to observe assignments to non-lvalues;
1272 // these errors are detected in the later pass borrowck. We
1273 // just ignore such cases and treat them as reads.
1276 ExprPath(_) => succ,
1277 ExprField(ref e, _, _) => self.propagate_through_expr(&**e, succ),
1278 ExprTupField(ref e, _, _) => self.propagate_through_expr(&**e, succ),
1279 _ => self.propagate_through_expr(expr, succ)
1283 // see comment on propagate_through_lvalue()
1284 fn write_lvalue(&mut self, expr: &Expr, succ: LiveNode, acc: uint)
1287 ExprPath(_) => self.access_path(expr, succ, acc),
1289 // We do not track other lvalues, so just propagate through
1290 // to their subcomponents. Also, it may happen that
1291 // non-lvalues occur here, because those are detected in the
1292 // later pass borrowck.
1297 fn access_path(&mut self, expr: &Expr, succ: LiveNode, acc: uint)
1299 match self.ir.tcx.def_map.borrow().get_copy(&expr.id) {
1301 let ln = self.live_node(expr.id, expr.span);
1303 self.init_from_succ(ln, succ);
1304 let var = self.variable(nid, expr.span);
1305 self.acc(ln, var, acc);
1313 fn propagate_through_loop(&mut self,
1322 We model control flow like this:
1340 let mut first_merge = true;
1341 let ln = self.live_node(expr.id, expr.span);
1342 self.init_empty(ln, succ);
1346 // If this is not a `loop` loop, then it's possible we bypass
1347 // the body altogether. Otherwise, the only way is via a `break`
1348 // in the loop body.
1349 self.merge_from_succ(ln, succ, first_merge);
1350 first_merge = false;
1353 debug!("propagate_through_loop: using id for loop body {} {}",
1354 expr.id, block_to_string(body));
1356 let cond_ln = match kind {
1358 ForLoop(ref pat) => self.define_bindings_in_pat(*pat, ln),
1359 WhileLoop(ref cond) => self.propagate_through_expr(&**cond, ln),
1361 let body_ln = self.with_loop_nodes(expr.id, succ, ln, |this| {
1362 this.propagate_through_block(body, cond_ln)
1365 // repeat until fixed point is reached:
1366 while self.merge_from_succ(ln, body_ln, first_merge) {
1367 first_merge = false;
1369 let new_cond_ln = match kind {
1371 ForLoop(ref pat) => {
1372 self.define_bindings_in_pat(*pat, ln)
1374 WhileLoop(ref cond) => {
1375 self.propagate_through_expr(&**cond, ln)
1378 assert!(cond_ln == new_cond_ln);
1379 assert!(body_ln == self.with_loop_nodes(expr.id, succ, ln,
1380 |this| this.propagate_through_block(body, cond_ln)));
1386 fn with_loop_nodes<R>(&mut self,
1387 loop_node_id: NodeId,
1390 f: |&mut Liveness<'a, 'tcx>| -> R)
1392 debug!("with_loop_nodes: {} {}", loop_node_id, break_ln.get());
1393 self.loop_scope.push(loop_node_id);
1394 self.break_ln.insert(loop_node_id, break_ln);
1395 self.cont_ln.insert(loop_node_id, cont_ln);
1397 self.loop_scope.pop();
1402 // _______________________________________________________________________
1403 // Checking for error conditions
1405 fn check_local(this: &mut Liveness, local: &ast::Local) {
1408 this.warn_about_unused_or_dead_vars_in_pat(&*local.pat);
1411 this.pat_bindings(&*local.pat, |this, ln, var, sp, id| {
1412 this.warn_about_unused(sp, id, ln, var);
1417 visit::walk_local(this, local);
1420 fn check_arm(this: &mut Liveness, arm: &Arm) {
1421 // only consider the first pattern; any later patterns must have
1422 // the same bindings, and we also consider the first pattern to be
1423 // the "authoritative" set of ids
1424 this.arm_pats_bindings(arm.pats.as_slice().head().map(|p| &**p), |this, ln, var, sp, id| {
1425 this.warn_about_unused(sp, id, ln, var);
1427 visit::walk_arm(this, arm);
1430 fn check_expr(this: &mut Liveness, expr: &Expr) {
1432 ExprAssign(ref l, ref r) => {
1433 this.check_lvalue(&**l);
1434 this.visit_expr(&**r);
1436 visit::walk_expr(this, expr);
1439 ExprAssignOp(_, ref l, _) => {
1440 this.check_lvalue(&**l);
1442 visit::walk_expr(this, expr);
1445 ExprInlineAsm(ref ia) => {
1446 for &(_, ref input) in ia.inputs.iter() {
1447 this.visit_expr(&**input);
1450 // Output operands must be lvalues
1451 for &(_, ref out, _) in ia.outputs.iter() {
1452 this.check_lvalue(&**out);
1453 this.visit_expr(&**out);
1456 visit::walk_expr(this, expr);
1459 ExprForLoop(ref pat, _, _, _) => {
1460 this.pat_bindings(&**pat, |this, ln, var, sp, id| {
1461 this.warn_about_unused(sp, id, ln, var);
1465 // no correctness conditions related to liveness
1466 ExprCall(..) | ExprMethodCall(..) | ExprIf(..) | ExprMatch(..) |
1467 ExprWhile(..) | ExprLoop(..) | ExprIndex(..) | ExprField(..) |
1468 ExprTupField(..) | ExprVec(..) | ExprTup(..) | ExprBinary(..) |
1469 ExprCast(..) | ExprUnary(..) | ExprRet(..) | ExprBreak(..) |
1470 ExprAgain(..) | ExprLit(_) | ExprBlock(..) | ExprSlice(..) |
1471 ExprMac(..) | ExprAddrOf(..) | ExprStruct(..) | ExprRepeat(..) |
1472 ExprParen(..) | ExprFnBlock(..) | ExprProc(..) | ExprUnboxedFn(..) |
1473 ExprPath(..) | ExprBox(..) => {
1474 visit::walk_expr(this, expr);
1476 ExprIfLet(..) => fail!("non-desugared ExprIfLet")
1480 fn check_fn(_v: &Liveness,
1486 // do not check contents of nested fns
1489 impl<'a, 'tcx> Liveness<'a, 'tcx> {
1496 if self.live_on_entry(entry_ln, self.s.no_ret_var).is_some() {
1497 // if no_ret_var is live, then we fall off the end of the
1498 // function without any kind of return expression:
1500 let t_ret = ty::ty_fn_ret(ty::node_id_to_type(self.ir.tcx, id));
1501 if ty::type_is_nil(t_ret) {
1502 // for nil return types, it is ok to not return a value expl.
1503 } else if ty::type_is_bot(t_ret) {
1504 // for bot return types, not ok. Function should fail.
1505 self.ir.tcx.sess.span_err(
1506 sp, "some control paths may return");
1508 let ends_with_stmt = match body.expr {
1509 None if body.stmts.len() > 0 =>
1510 match body.stmts.last().unwrap().node {
1511 StmtSemi(ref e, _) => {
1512 let t_stmt = ty::expr_ty(self.ir.tcx, &**e);
1513 ty::get(t_stmt).sty == ty::get(t_ret).sty
1519 self.ir.tcx.sess.span_err(
1520 sp, "not all control paths return a value");
1522 let last_stmt = body.stmts.last().unwrap();
1523 let original_span = original_sp(self.ir.tcx.sess.codemap(),
1524 last_stmt.span, sp);
1525 let span_semicolon = Span {
1526 lo: original_span.hi - BytePos(1),
1527 hi: original_span.hi,
1528 expn_id: original_span.expn_id
1530 self.ir.tcx.sess.span_note(
1531 span_semicolon, "consider removing this semicolon:");
1537 fn check_lvalue(&mut self, expr: &Expr) {
1540 match self.ir.tcx.def_map.borrow().get_copy(&expr.id) {
1542 // Assignment to an immutable variable or argument: only legal
1543 // if there is no later assignment. If this local is actually
1544 // mutable, then check for a reassignment to flag the mutability
1546 let ln = self.live_node(expr.id, expr.span);
1547 let var = self.variable(nid, expr.span);
1548 self.warn_about_dead_assign(expr.span, expr.id, ln, var);
1555 // For other kinds of lvalues, no checks are required,
1556 // and any embedded expressions are actually rvalues
1557 visit::walk_expr(self, expr);
1562 fn should_warn(&self, var: Variable) -> Option<String> {
1563 let name = self.ir.variable_name(var);
1564 if name.len() == 0 || name.as_bytes()[0] == ('_' as u8) {
1571 fn warn_about_unused_args(&self, decl: &FnDecl, entry_ln: LiveNode) {
1572 for arg in decl.inputs.iter() {
1573 pat_util::pat_bindings(&self.ir.tcx.def_map,
1575 |_bm, p_id, sp, path1| {
1576 let var = self.variable(p_id, sp);
1577 // Ignore unused self.
1578 let ident = path1.node;
1579 if ident.name != special_idents::self_.name {
1580 self.warn_about_unused(sp, p_id, entry_ln, var);
1586 fn warn_about_unused_or_dead_vars_in_pat(&mut self, pat: &Pat) {
1587 self.pat_bindings(pat, |this, ln, var, sp, id| {
1588 if !this.warn_about_unused(sp, id, ln, var) {
1589 this.warn_about_dead_assign(sp, id, ln, var);
1594 fn warn_about_unused(&self,
1600 if !self.used_on_entry(ln, var) {
1601 let r = self.should_warn(var);
1602 for name in r.iter() {
1604 // annoying: for parameters in funcs like `fn(x: int)
1605 // {ret}`, there is only one node, so asking about
1606 // assigned_on_exit() is not meaningful.
1607 let is_assigned = if ln == self.s.exit_ln {
1610 self.assigned_on_exit(ln, var).is_some()
1614 self.ir.tcx.sess.add_lint(lint::builtin::UNUSED_VARIABLE, id, sp,
1615 format!("variable `{}` is assigned to, but never used",
1618 self.ir.tcx.sess.add_lint(lint::builtin::UNUSED_VARIABLE, id, sp,
1619 format!("unused variable: `{}`", *name));
1628 fn warn_about_dead_assign(&self,
1633 if self.live_on_exit(ln, var).is_none() {
1634 let r = self.should_warn(var);
1635 for name in r.iter() {
1636 self.ir.tcx.sess.add_lint(lint::builtin::DEAD_ASSIGNMENT, id, sp,
1637 format!("value assigned to `{}` is never read", *name));