1 use crate::reexport::*;
2 use if_chain::if_chain;
3 use itertools::Itertools;
4 use rustc::hir::def::{DefKind, Res};
5 use rustc::hir::def_id;
6 use rustc::hir::intravisit::{walk_block, walk_expr, walk_pat, walk_stmt, NestedVisitorMap, Visitor};
8 use rustc::lint::{in_external_macro, LateContext, LateLintPass, LintArray, LintContext, LintPass};
9 use rustc::middle::region;
10 use rustc::{declare_lint_pass, declare_tool_lint};
11 // use rustc::middle::region::CodeExtent;
12 use crate::consts::{constant, Constant};
13 use crate::utils::usage::mutated_variables;
14 use crate::utils::{sext, sugg};
15 use rustc::middle::expr_use_visitor::*;
16 use rustc::middle::mem_categorization::cmt_;
17 use rustc::middle::mem_categorization::Categorization;
18 use rustc::ty::subst::Subst;
19 use rustc::ty::{self, Ty};
20 use rustc_data_structures::fx::{FxHashMap, FxHashSet};
21 use rustc_errors::Applicability;
22 use std::iter::{once, Iterator};
25 use syntax::source_map::Span;
26 use syntax_pos::BytePos;
28 use crate::utils::paths;
30 get_enclosing_block, get_parent_expr, has_iter_method, higher, is_integer_literal, is_refutable, last_path_segment,
31 match_trait_method, match_type, match_var, multispan_sugg, snippet, snippet_opt, snippet_with_applicability,
32 span_help_and_lint, span_lint, span_lint_and_sugg, span_lint_and_then, SpanlessEq,
35 declare_clippy_lint! {
36 /// **What it does:** Checks for for-loops that manually copy items between
37 /// slices that could be optimized by having a memcpy.
39 /// **Why is this bad?** It is not as fast as a memcpy.
41 /// **Known problems:** None.
45 /// # let src = vec![1];
46 /// # let mut dst = vec![0; 65];
47 /// for i in 0..src.len() {
48 /// dst[i + 64] = src[i];
51 /// Could be written as:
53 /// # let src = vec![1];
54 /// # let mut dst = vec![0; 65];
55 /// dst[64..(src.len() + 64)].clone_from_slice(&src[..]);
59 "manually copying items between slices"
62 declare_clippy_lint! {
63 /// **What it does:** Checks for looping over the range of `0..len` of some
64 /// collection just to get the values by index.
66 /// **Why is this bad?** Just iterating the collection itself makes the intent
67 /// more clear and is probably faster.
69 /// **Known problems:** None.
73 /// let vec = vec!['a', 'b', 'c'];
74 /// for i in 0..vec.len() {
75 /// println!("{}", vec[i]);
78 /// Could be written as:
80 /// let vec = vec!['a', 'b', 'c'];
82 /// println!("{}", i);
85 pub NEEDLESS_RANGE_LOOP,
87 "for-looping over a range of indices where an iterator over items would do"
90 declare_clippy_lint! {
91 /// **What it does:** Checks for loops on `x.iter()` where `&x` will do, and
92 /// suggests the latter.
94 /// **Why is this bad?** Readability.
96 /// **Known problems:** False negatives. We currently only warn on some known
101 /// // with `y` a `Vec` or slice:
102 /// # let y = vec![1];
103 /// for x in y.iter() {
107 /// can be rewritten to
109 /// # let y = vec![1];
114 pub EXPLICIT_ITER_LOOP,
116 "for-looping over `_.iter()` or `_.iter_mut()` when `&_` or `&mut _` would do"
119 declare_clippy_lint! {
120 /// **What it does:** Checks for loops on `y.into_iter()` where `y` will do, and
121 /// suggests the latter.
123 /// **Why is this bad?** Readability.
125 /// **Known problems:** None
129 /// # let y = vec![1];
130 /// // with `y` a `Vec` or slice:
131 /// for x in y.into_iter() {
135 /// can be rewritten to
137 /// # let y = vec![1];
142 pub EXPLICIT_INTO_ITER_LOOP,
144 "for-looping over `_.into_iter()` when `_` would do"
147 declare_clippy_lint! {
148 /// **What it does:** Checks for loops on `x.next()`.
150 /// **Why is this bad?** `next()` returns either `Some(value)` if there was a
151 /// value, or `None` otherwise. The insidious thing is that `Option<_>`
152 /// implements `IntoIterator`, so that possibly one value will be iterated,
153 /// leading to some hard to find bugs. No one will want to write such code
154 /// [except to win an Underhanded Rust
155 /// Contest](https://www.reddit.com/r/rust/comments/3hb0wm/underhanded_rust_contest/cu5yuhr).
157 /// **Known problems:** None.
161 /// for x in y.next() {
167 "for-looping over `_.next()` which is probably not intended"
170 declare_clippy_lint! {
171 /// **What it does:** Checks for `for` loops over `Option` values.
173 /// **Why is this bad?** Readability. This is more clearly expressed as an `if
176 /// **Known problems:** None.
180 /// for x in option {
187 /// if let Some(x) = option {
191 pub FOR_LOOP_OVER_OPTION,
193 "for-looping over an `Option`, which is more clearly expressed as an `if let`"
196 declare_clippy_lint! {
197 /// **What it does:** Checks for `for` loops over `Result` values.
199 /// **Why is this bad?** Readability. This is more clearly expressed as an `if
202 /// **Known problems:** None.
206 /// for x in result {
213 /// if let Ok(x) = result {
217 pub FOR_LOOP_OVER_RESULT,
219 "for-looping over a `Result`, which is more clearly expressed as an `if let`"
222 declare_clippy_lint! {
223 /// **What it does:** Detects `loop + match` combinations that are easier
224 /// written as a `while let` loop.
226 /// **Why is this bad?** The `while let` loop is usually shorter and more
229 /// **Known problems:** Sometimes the wrong binding is displayed (#383).
233 /// # let y = Some(1);
235 /// let x = match y {
239 /// // .. do something with x
241 /// // is easier written as
242 /// while let Some(x) = y {
243 /// // .. do something with x
248 "`loop { if let { ... } else break }`, which can be written as a `while let` loop"
251 declare_clippy_lint! {
252 /// **What it does:** Checks for functions collecting an iterator when collect
255 /// **Why is this bad?** `collect` causes the allocation of a new data structure,
256 /// when this allocation may not be needed.
258 /// **Known problems:**
263 /// # let iterator = vec![1].into_iter();
264 /// let len = iterator.clone().collect::<Vec<_>>().len();
266 /// let len = iterator.count();
268 pub NEEDLESS_COLLECT,
270 "collecting an iterator when collect is not needed"
273 declare_clippy_lint! {
274 /// **What it does:** Checks for loops over ranges `x..y` where both `x` and `y`
275 /// are constant and `x` is greater or equal to `y`, unless the range is
276 /// reversed or has a negative `.step_by(_)`.
278 /// **Why is it bad?** Such loops will either be skipped or loop until
279 /// wrap-around (in debug code, this may `panic!()`). Both options are probably
282 /// **Known problems:** The lint cannot catch loops over dynamically defined
283 /// ranges. Doing this would require simulating all possible inputs and code
284 /// paths through the program, which would be complex and error-prone.
288 /// for x in 5..10 - 5 {
290 /// } // oops, stray `-`
292 pub REVERSE_RANGE_LOOP,
294 "iteration over an empty range, such as `10..0` or `5..5`"
297 declare_clippy_lint! {
298 /// **What it does:** Checks `for` loops over slices with an explicit counter
299 /// and suggests the use of `.enumerate()`.
301 /// **Why is it bad?** Not only is the version using `.enumerate()` more
302 /// readable, the compiler is able to remove bounds checks which can lead to
303 /// faster code in some instances.
305 /// **Known problems:** None.
309 /// # let v = vec![1];
310 /// # fn foo(bar: usize) {}
311 /// # fn bar(bar: usize, baz: usize) {}
312 /// for i in 0..v.len() { foo(v[i]); }
313 /// for i in 0..v.len() { bar(i, v[i]); }
315 pub EXPLICIT_COUNTER_LOOP,
317 "for-looping with an explicit counter when `_.enumerate()` would do"
320 declare_clippy_lint! {
321 /// **What it does:** Checks for empty `loop` expressions.
323 /// **Why is this bad?** Those busy loops burn CPU cycles without doing
324 /// anything. Think of the environment and either block on something or at least
325 /// make the thread sleep for some microseconds.
327 /// **Known problems:** None.
335 "empty `loop {}`, which should block or sleep"
338 declare_clippy_lint! {
339 /// **What it does:** Checks for `while let` expressions on iterators.
341 /// **Why is this bad?** Readability. A simple `for` loop is shorter and conveys
342 /// the intent better.
344 /// **Known problems:** None.
348 /// while let Some(val) = iter() {
352 pub WHILE_LET_ON_ITERATOR,
354 "using a while-let loop instead of a for loop on an iterator"
357 declare_clippy_lint! {
358 /// **What it does:** Checks for iterating a map (`HashMap` or `BTreeMap`) and
359 /// ignoring either the keys or values.
361 /// **Why is this bad?** Readability. There are `keys` and `values` methods that
362 /// can be used to express that don't need the values or keys.
364 /// **Known problems:** None.
368 /// for (k, _) in &map {
373 /// could be replaced by
376 /// for k in map.keys() {
382 "looping on a map using `iter` when `keys` or `values` would do"
385 declare_clippy_lint! {
386 /// **What it does:** Checks for loops that will always `break`, `return` or
387 /// `continue` an outer loop.
389 /// **Why is this bad?** This loop never loops, all it does is obfuscating the
392 /// **Known problems:** None
403 "any loop that will always `break` or `return`"
406 declare_clippy_lint! {
407 /// **What it does:** Checks for loops which have a range bound that is a mutable variable
409 /// **Why is this bad?** One might think that modifying the mutable variable changes the loop bounds
411 /// **Known problems:** None
415 /// let mut foo = 42;
416 /// for i in 0..foo {
418 /// println!("{}", i); // prints numbers from 0 to 42, not 0 to 21
423 "for loop over a range where one of the bounds is a mutable variable"
426 declare_clippy_lint! {
427 /// **What it does:** Checks whether variables used within while loop condition
428 /// can be (and are) mutated in the body.
430 /// **Why is this bad?** If the condition is unchanged, entering the body of the loop
431 /// will lead to an infinite loop.
433 /// **Known problems:** If the `while`-loop is in a closure, the check for mutation of the
434 /// condition variables in the body can cause false negatives. For example when only `Upvar` `a` is
435 /// in the condition and only `Upvar` `b` gets mutated in the body, the lint will not trigger.
441 /// println!("let me loop forever!");
444 pub WHILE_IMMUTABLE_CONDITION,
446 "variables used within while expression are not mutated in the body"
449 declare_lint_pass!(Loops => [
453 EXPLICIT_INTO_ITER_LOOP,
455 FOR_LOOP_OVER_RESULT,
456 FOR_LOOP_OVER_OPTION,
460 EXPLICIT_COUNTER_LOOP,
462 WHILE_LET_ON_ITERATOR,
466 WHILE_IMMUTABLE_CONDITION,
469 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for Loops {
470 #[allow(clippy::too_many_lines)]
471 fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, expr: &'tcx Expr) {
472 // we don't want to check expanded macros
473 if expr.span.from_expansion() {
477 if let Some((pat, arg, body)) = higher::for_loop(expr) {
478 check_for_loop(cx, pat, arg, body, expr);
481 // check for never_loop
482 if let ExprKind::Loop(ref block, _, _) = expr.node {
483 match never_loop_block(block, expr.hir_id) {
484 NeverLoopResult::AlwaysBreak => span_lint(cx, NEVER_LOOP, expr.span, "this loop never actually loops"),
485 NeverLoopResult::MayContinueMainLoop | NeverLoopResult::Otherwise => (),
489 // check for `loop { if let {} else break }` that could be `while let`
490 // (also matches an explicit "match" instead of "if let")
491 // (even if the "match" or "if let" is used for declaration)
492 if let ExprKind::Loop(ref block, _, LoopSource::Loop) = expr.node {
493 // also check for empty `loop {}` statements
494 if block.stmts.is_empty() && block.expr.is_none() {
499 "empty `loop {}` detected. You may want to either use `panic!()` or add \
500 `std::thread::sleep(..);` to the loop body.",
504 // extract the expression from the first statement (if any) in a block
505 let inner_stmt_expr = extract_expr_from_first_stmt(block);
506 // or extract the first expression (if any) from the block
507 if let Some(inner) = inner_stmt_expr.or_else(|| extract_first_expr(block)) {
508 if let ExprKind::Match(ref matchexpr, ref arms, ref source) = inner.node {
509 // ensure "if let" compatible match structure
511 MatchSource::Normal | MatchSource::IfLetDesugar { .. } => {
513 && arms[0].pats.len() == 1
514 && arms[0].guard.is_none()
515 && arms[1].pats.len() == 1
516 && arms[1].guard.is_none()
517 && is_simple_break_expr(&arms[1].body)
519 if in_external_macro(cx.sess(), expr.span) {
523 // NOTE: we used to build a body here instead of using
524 // ellipsis, this was removed because:
525 // 1) it was ugly with big bodies;
526 // 2) it was not indented properly;
527 // 3) it wasn’t very smart (see #675).
528 let mut applicability = Applicability::HasPlaceholders;
533 "this loop could be written as a `while let` loop",
536 "while let {} = {} {{ .. }}",
537 snippet_with_applicability(cx, arms[0].pats[0].span, "..", &mut applicability),
538 snippet_with_applicability(cx, matchexpr.span, "..", &mut applicability),
549 if let ExprKind::Match(ref match_expr, ref arms, MatchSource::WhileLetDesugar) = expr.node {
550 let pat = &arms[0].pats[0].node;
552 &PatKind::TupleStruct(ref qpath, ref pat_args, _),
553 &ExprKind::MethodCall(ref method_path, _, ref method_args),
554 ) = (pat, &match_expr.node)
556 let iter_expr = &method_args[0];
557 let lhs_constructor = last_path_segment(qpath);
558 if method_path.ident.name == sym!(next)
559 && match_trait_method(cx, match_expr, &paths::ITERATOR)
560 && lhs_constructor.ident.name == sym!(Some)
561 && (pat_args.is_empty()
562 || !is_refutable(cx, &pat_args[0])
563 && !is_used_inside(cx, iter_expr, &arms[0].body)
564 && !is_iterator_used_after_while_let(cx, iter_expr)
565 && !is_nested(cx, expr, &method_args[0]))
567 let iterator = snippet(cx, method_args[0].span, "_");
568 let loop_var = if pat_args.is_empty() {
571 snippet(cx, pat_args[0].span, "_").into_owned()
575 WHILE_LET_ON_ITERATOR,
577 "this loop could be written as a `for` loop",
579 format!("for {} in {} {{ .. }}", loop_var, iterator),
580 Applicability::HasPlaceholders,
586 if let Some((cond, body)) = higher::while_loop(&expr) {
587 check_infinite_loop(cx, cond, body);
590 check_needless_collect(expr, cx);
594 enum NeverLoopResult {
595 // A break/return always get triggered but not necessarily for the main loop.
597 // A continue may occur for the main loop.
602 fn absorb_break(arg: &NeverLoopResult) -> NeverLoopResult {
604 NeverLoopResult::AlwaysBreak | NeverLoopResult::Otherwise => NeverLoopResult::Otherwise,
605 NeverLoopResult::MayContinueMainLoop => NeverLoopResult::MayContinueMainLoop,
609 // Combine two results for parts that are called in order.
610 fn combine_seq(first: NeverLoopResult, second: NeverLoopResult) -> NeverLoopResult {
612 NeverLoopResult::AlwaysBreak | NeverLoopResult::MayContinueMainLoop => first,
613 NeverLoopResult::Otherwise => second,
617 // Combine two results where both parts are called but not necessarily in order.
618 fn combine_both(left: NeverLoopResult, right: NeverLoopResult) -> NeverLoopResult {
619 match (left, right) {
620 (NeverLoopResult::MayContinueMainLoop, _) | (_, NeverLoopResult::MayContinueMainLoop) => {
621 NeverLoopResult::MayContinueMainLoop
623 (NeverLoopResult::AlwaysBreak, _) | (_, NeverLoopResult::AlwaysBreak) => NeverLoopResult::AlwaysBreak,
624 (NeverLoopResult::Otherwise, NeverLoopResult::Otherwise) => NeverLoopResult::Otherwise,
628 // Combine two results where only one of the part may have been executed.
629 fn combine_branches(b1: NeverLoopResult, b2: NeverLoopResult) -> NeverLoopResult {
631 (NeverLoopResult::AlwaysBreak, NeverLoopResult::AlwaysBreak) => NeverLoopResult::AlwaysBreak,
632 (NeverLoopResult::MayContinueMainLoop, _) | (_, NeverLoopResult::MayContinueMainLoop) => {
633 NeverLoopResult::MayContinueMainLoop
635 (NeverLoopResult::Otherwise, _) | (_, NeverLoopResult::Otherwise) => NeverLoopResult::Otherwise,
639 fn never_loop_block(block: &Block, main_loop_id: HirId) -> NeverLoopResult {
640 let stmts = block.stmts.iter().map(stmt_to_expr);
641 let expr = once(block.expr.as_ref().map(|p| &**p));
642 let mut iter = stmts.chain(expr).filter_map(|e| e);
643 never_loop_expr_seq(&mut iter, main_loop_id)
646 fn stmt_to_expr(stmt: &Stmt) -> Option<&Expr> {
648 StmtKind::Semi(ref e, ..) | StmtKind::Expr(ref e, ..) => Some(e),
649 StmtKind::Local(ref local) => local.init.as_ref().map(|p| &**p),
654 fn never_loop_expr(expr: &Expr, main_loop_id: HirId) -> NeverLoopResult {
657 | ExprKind::Unary(_, ref e)
658 | ExprKind::Cast(ref e, _)
659 | ExprKind::Type(ref e, _)
660 | ExprKind::Field(ref e, _)
661 | ExprKind::AddrOf(_, ref e)
662 | ExprKind::Struct(_, _, Some(ref e))
663 | ExprKind::Repeat(ref e, _)
664 | ExprKind::DropTemps(ref e) => never_loop_expr(e, main_loop_id),
665 ExprKind::Array(ref es) | ExprKind::MethodCall(_, _, ref es) | ExprKind::Tup(ref es) => {
666 never_loop_expr_all(&mut es.iter(), main_loop_id)
668 ExprKind::Call(ref e, ref es) => never_loop_expr_all(&mut once(&**e).chain(es.iter()), main_loop_id),
669 ExprKind::Binary(_, ref e1, ref e2)
670 | ExprKind::Assign(ref e1, ref e2)
671 | ExprKind::AssignOp(_, ref e1, ref e2)
672 | ExprKind::Index(ref e1, ref e2) => never_loop_expr_all(&mut [&**e1, &**e2].iter().cloned(), main_loop_id),
673 ExprKind::Loop(ref b, _, _) => {
674 // Break can come from the inner loop so remove them.
675 absorb_break(&never_loop_block(b, main_loop_id))
677 ExprKind::Match(ref e, ref arms, _) => {
678 let e = never_loop_expr(e, main_loop_id);
682 let arms = never_loop_expr_branch(&mut arms.iter().map(|a| &*a.body), main_loop_id);
686 ExprKind::Block(ref b, _) => never_loop_block(b, main_loop_id),
687 ExprKind::Continue(d) => {
690 .expect("target ID can only be missing in the presence of compilation errors");
691 if id == main_loop_id {
692 NeverLoopResult::MayContinueMainLoop
694 NeverLoopResult::AlwaysBreak
697 ExprKind::Break(_, ref e) | ExprKind::Ret(ref e) => {
698 if let Some(ref e) = *e {
699 combine_seq(never_loop_expr(e, main_loop_id), NeverLoopResult::AlwaysBreak)
701 NeverLoopResult::AlwaysBreak
704 ExprKind::Struct(_, _, None)
705 | ExprKind::Yield(_, _)
706 | ExprKind::Closure(_, _, _, _, _)
707 | ExprKind::InlineAsm(_, _, _)
710 | ExprKind::Err => NeverLoopResult::Otherwise,
714 fn never_loop_expr_seq<'a, T: Iterator<Item = &'a Expr>>(es: &mut T, main_loop_id: HirId) -> NeverLoopResult {
715 es.map(|e| never_loop_expr(e, main_loop_id))
716 .fold(NeverLoopResult::Otherwise, combine_seq)
719 fn never_loop_expr_all<'a, T: Iterator<Item = &'a Expr>>(es: &mut T, main_loop_id: HirId) -> NeverLoopResult {
720 es.map(|e| never_loop_expr(e, main_loop_id))
721 .fold(NeverLoopResult::Otherwise, combine_both)
724 fn never_loop_expr_branch<'a, T: Iterator<Item = &'a Expr>>(e: &mut T, main_loop_id: HirId) -> NeverLoopResult {
725 e.map(|e| never_loop_expr(e, main_loop_id))
726 .fold(NeverLoopResult::AlwaysBreak, combine_branches)
729 fn check_for_loop<'a, 'tcx>(
730 cx: &LateContext<'a, 'tcx>,
736 check_for_loop_range(cx, pat, arg, body, expr);
737 check_for_loop_reverse_range(cx, arg, expr);
738 check_for_loop_arg(cx, pat, arg, expr);
739 check_for_loop_explicit_counter(cx, pat, arg, body, expr);
740 check_for_loop_over_map_kv(cx, pat, arg, body, expr);
741 check_for_mut_range_bound(cx, arg, body);
742 detect_manual_memcpy(cx, pat, arg, body, expr);
745 fn same_var<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, expr: &Expr, var: HirId) -> bool {
747 if let ExprKind::Path(ref qpath) = expr.node;
748 if let QPath::Resolved(None, ref path) = *qpath;
749 if path.segments.len() == 1;
750 if let Res::Local(local_id) = cx.tables.qpath_res(qpath, expr.hir_id);
767 fn negative(s: String) -> Self {
768 Self { value: s, negate: true }
771 fn positive(s: String) -> Self {
779 struct FixedOffsetVar {
784 fn is_slice_like<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, ty: Ty<'_>) -> bool {
785 let is_slice = match ty.sty {
786 ty::Ref(_, subty, _) => is_slice_like(cx, subty),
787 ty::Slice(..) | ty::Array(..) => true,
791 is_slice || match_type(cx, ty, &paths::VEC) || match_type(cx, ty, &paths::VEC_DEQUE)
794 fn get_fixed_offset_var<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, expr: &Expr, var: HirId) -> Option<FixedOffsetVar> {
795 fn extract_offset<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, e: &Expr, var: HirId) -> Option<String> {
797 ExprKind::Lit(ref l) => match l.node {
798 ast::LitKind::Int(x, _ty) => Some(x.to_string()),
801 ExprKind::Path(..) if !same_var(cx, e, var) => Some(snippet_opt(cx, e.span).unwrap_or_else(|| "??".into())),
806 if let ExprKind::Index(ref seqexpr, ref idx) = expr.node {
807 let ty = cx.tables.expr_ty(seqexpr);
808 if !is_slice_like(cx, ty) {
812 let offset = match idx.node {
813 ExprKind::Binary(op, ref lhs, ref rhs) => match op.node {
815 let offset_opt = if same_var(cx, lhs, var) {
816 extract_offset(cx, rhs, var)
817 } else if same_var(cx, rhs, var) {
818 extract_offset(cx, lhs, var)
823 offset_opt.map(Offset::positive)
825 BinOpKind::Sub if same_var(cx, lhs, var) => extract_offset(cx, rhs, var).map(Offset::negative),
828 ExprKind::Path(..) => {
829 if same_var(cx, idx, var) {
830 Some(Offset::positive("0".into()))
838 offset.map(|o| FixedOffsetVar {
839 var_name: snippet_opt(cx, seqexpr.span).unwrap_or_else(|| "???".into()),
847 fn fetch_cloned_fixed_offset_var<'a, 'tcx>(
848 cx: &LateContext<'a, 'tcx>,
851 ) -> Option<FixedOffsetVar> {
853 if let ExprKind::MethodCall(ref method, _, ref args) = expr.node;
854 if method.ident.name == sym!(clone);
856 if let Some(arg) = args.get(0);
858 return get_fixed_offset_var(cx, arg, var);
862 get_fixed_offset_var(cx, expr, var)
865 fn get_indexed_assignments<'a, 'tcx>(
866 cx: &LateContext<'a, 'tcx>,
869 ) -> Vec<(FixedOffsetVar, FixedOffsetVar)> {
870 fn get_assignment<'a, 'tcx>(
871 cx: &LateContext<'a, 'tcx>,
874 ) -> Option<(FixedOffsetVar, FixedOffsetVar)> {
875 if let ExprKind::Assign(ref lhs, ref rhs) = e.node {
877 get_fixed_offset_var(cx, lhs, var),
878 fetch_cloned_fixed_offset_var(cx, rhs, var),
880 (Some(offset_left), Some(offset_right)) => {
881 // Source and destination must be different
882 if offset_left.var_name == offset_right.var_name {
885 Some((offset_left, offset_right))
895 if let ExprKind::Block(ref b, _) = body.node {
897 ref stmts, ref expr, ..
902 .map(|stmt| match stmt.node {
903 StmtKind::Local(..) | StmtKind::Item(..) => None,
904 StmtKind::Expr(ref e) | StmtKind::Semi(ref e) => Some(get_assignment(cx, e, var)),
906 .chain(expr.as_ref().into_iter().map(|e| Some(get_assignment(cx, &*e, var))))
908 .collect::<Option<Vec<_>>>()
909 .unwrap_or_else(|| vec![])
911 get_assignment(cx, body, var).into_iter().collect()
915 /// Checks for for loops that sequentially copy items from one slice-like
916 /// object to another.
917 fn detect_manual_memcpy<'a, 'tcx>(
918 cx: &LateContext<'a, 'tcx>,
924 if let Some(higher::Range {
928 }) = higher::range(cx, arg)
930 // the var must be a single name
931 if let PatKind::Binding(_, canonical_id, _, _) = pat.node {
932 let print_sum = |arg1: &Offset, arg2: &Offset| -> String {
933 match (&arg1.value[..], arg1.negate, &arg2.value[..], arg2.negate) {
934 ("0", _, "0", _) => "".into(),
935 ("0", _, x, false) | (x, false, "0", false) => x.into(),
936 ("0", _, x, true) | (x, false, "0", true) => format!("-{}", x),
937 (x, false, y, false) => format!("({} + {})", x, y),
938 (x, false, y, true) => {
942 format!("({} - {})", x, y)
945 (x, true, y, false) => {
949 format!("({} - {})", y, x)
952 (x, true, y, true) => format!("-({} + {})", x, y),
956 let print_limit = |end: &Option<&Expr>, offset: Offset, var_name: &str| {
957 if let Some(end) = *end {
959 if let ExprKind::MethodCall(ref method, _, ref len_args) = end.node;
960 if method.ident.name == sym!(len);
961 if len_args.len() == 1;
962 if let Some(arg) = len_args.get(0);
963 if snippet(cx, arg.span, "??") == var_name;
965 return if offset.negate {
966 format!("({} - {})", snippet(cx, end.span, "<src>.len()"), offset.value)
973 let end_str = match limits {
974 ast::RangeLimits::Closed => {
975 let end = sugg::Sugg::hir(cx, end, "<count>");
976 format!("{}", end + sugg::ONE)
978 ast::RangeLimits::HalfOpen => format!("{}", snippet(cx, end.span, "..")),
981 print_sum(&Offset::positive(end_str), &offset)
987 // The only statements in the for loops can be indexed assignments from
988 // indexed retrievals.
989 let manual_copies = get_indexed_assignments(cx, body, canonical_id);
991 let big_sugg = manual_copies
993 .map(|(dst_var, src_var)| {
994 let start_str = Offset::positive(snippet(cx, start.span, "").to_string());
995 let dst_offset = print_sum(&start_str, &dst_var.offset);
996 let dst_limit = print_limit(end, dst_var.offset, &dst_var.var_name);
997 let src_offset = print_sum(&start_str, &src_var.offset);
998 let src_limit = print_limit(end, src_var.offset, &src_var.var_name);
999 let dst = if dst_offset == "" && dst_limit == "" {
1002 format!("{}[{}..{}]", dst_var.var_name, dst_offset, dst_limit)
1006 "{}.clone_from_slice(&{}[{}..{}])",
1007 dst, src_var.var_name, src_offset, src_limit
1012 if !big_sugg.is_empty() {
1017 "it looks like you're manually copying between slices",
1018 "try replacing the loop by",
1020 Applicability::Unspecified,
1027 /// Checks for looping over a range and then indexing a sequence with it.
1028 /// The iteratee must be a range literal.
1029 #[allow(clippy::too_many_lines)]
1030 fn check_for_loop_range<'a, 'tcx>(
1031 cx: &LateContext<'a, 'tcx>,
1037 if expr.span.from_expansion() {
1041 if let Some(higher::Range {
1045 }) = higher::range(cx, arg)
1047 // the var must be a single name
1048 if let PatKind::Binding(_, canonical_id, ident, _) = pat.node {
1049 let mut visitor = VarVisitor {
1052 indexed_mut: FxHashSet::default(),
1053 indexed_indirectly: FxHashMap::default(),
1054 indexed_directly: FxHashMap::default(),
1055 referenced: FxHashSet::default(),
1057 prefer_mutable: false,
1059 walk_expr(&mut visitor, body);
1061 // linting condition: we only indexed one variable, and indexed it directly
1062 if visitor.indexed_indirectly.is_empty() && visitor.indexed_directly.len() == 1 {
1063 let (indexed, (indexed_extent, indexed_ty)) = visitor
1067 .expect("already checked that we have exactly 1 element");
1069 // ensure that the indexed variable was declared before the loop, see #601
1070 if let Some(indexed_extent) = indexed_extent {
1071 let parent_id = cx.tcx.hir().get_parent_item(expr.hir_id);
1072 let parent_def_id = cx.tcx.hir().local_def_id(parent_id);
1073 let region_scope_tree = cx.tcx.region_scope_tree(parent_def_id);
1074 let pat_extent = region_scope_tree.var_scope(pat.hir_id.local_id);
1075 if region_scope_tree.is_subscope_of(indexed_extent, pat_extent) {
1080 // don't lint if the container that is indexed does not have .iter() method
1081 let has_iter = has_iter_method(cx, indexed_ty);
1082 if has_iter.is_none() {
1086 // don't lint if the container that is indexed into is also used without
1088 if visitor.referenced.contains(&indexed) {
1092 let starts_at_zero = is_integer_literal(start, 0);
1094 let skip = if starts_at_zero {
1097 format!(".skip({})", snippet(cx, start.span, ".."))
1100 let mut end_is_start_plus_val = false;
1102 let take = if let Some(end) = *end {
1103 let mut take_expr = end;
1105 if let ExprKind::Binary(ref op, ref left, ref right) = end.node {
1106 if let BinOpKind::Add = op.node {
1107 let start_equal_left = SpanlessEq::new(cx).eq_expr(start, left);
1108 let start_equal_right = SpanlessEq::new(cx).eq_expr(start, right);
1110 if start_equal_left {
1112 } else if start_equal_right {
1116 end_is_start_plus_val = start_equal_left | start_equal_right;
1120 if is_len_call(end, indexed) || is_end_eq_array_len(cx, end, limits, indexed_ty) {
1124 ast::RangeLimits::Closed => {
1125 let take_expr = sugg::Sugg::hir(cx, take_expr, "<count>");
1126 format!(".take({})", take_expr + sugg::ONE)
1128 ast::RangeLimits::HalfOpen => format!(".take({})", snippet(cx, take_expr.span, "..")),
1135 let (ref_mut, method) = if visitor.indexed_mut.contains(&indexed) {
1136 ("mut ", "iter_mut")
1141 let take_is_empty = take.is_empty();
1142 let mut method_1 = take;
1143 let mut method_2 = skip;
1145 if end_is_start_plus_val {
1146 mem::swap(&mut method_1, &mut method_2);
1149 if visitor.nonindex {
1152 NEEDLESS_RANGE_LOOP,
1154 &format!("the loop variable `{}` is used to index `{}`", ident.name, indexed),
1158 "consider using an iterator".to_string(),
1160 (pat.span, format!("({}, <item>)", ident.name)),
1163 format!("{}.{}().enumerate(){}{}", indexed, method, method_1, method_2),
1170 let repl = if starts_at_zero && take_is_empty {
1171 format!("&{}{}", ref_mut, indexed)
1173 format!("{}.{}(){}{}", indexed, method, method_1, method_2)
1178 NEEDLESS_RANGE_LOOP,
1181 "the loop variable `{}` is only used to index `{}`.",
1187 "consider using an iterator".to_string(),
1188 vec![(pat.span, "<item>".to_string()), (arg.span, repl)],
1198 fn is_len_call(expr: &Expr, var: Name) -> bool {
1200 if let ExprKind::MethodCall(ref method, _, ref len_args) = expr.node;
1201 if len_args.len() == 1;
1202 if method.ident.name == sym!(len);
1203 if let ExprKind::Path(QPath::Resolved(_, ref path)) = len_args[0].node;
1204 if path.segments.len() == 1;
1205 if path.segments[0].ident.name == var;
1214 fn is_end_eq_array_len<'tcx>(
1215 cx: &LateContext<'_, 'tcx>,
1217 limits: ast::RangeLimits,
1218 indexed_ty: Ty<'tcx>,
1221 if let ExprKind::Lit(ref lit) = end.node;
1222 if let ast::LitKind::Int(end_int, _) = lit.node;
1223 if let ty::Array(_, arr_len_const) = indexed_ty.sty;
1224 if let Some(arr_len) = arr_len_const.try_eval_usize(cx.tcx, cx.param_env);
1226 return match limits {
1227 ast::RangeLimits::Closed => end_int + 1 >= arr_len.into(),
1228 ast::RangeLimits::HalfOpen => end_int >= arr_len.into(),
1236 fn check_for_loop_reverse_range<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, arg: &'tcx Expr, expr: &'tcx Expr) {
1237 // if this for loop is iterating over a two-sided range...
1238 if let Some(higher::Range {
1242 }) = higher::range(cx, arg)
1244 // ...and both sides are compile-time constant integers...
1245 if let Some((start_idx, _)) = constant(cx, cx.tables, start) {
1246 if let Some((end_idx, _)) = constant(cx, cx.tables, end) {
1247 // ...and the start index is greater than the end index,
1248 // this loop will never run. This is often confusing for developers
1249 // who think that this will iterate from the larger value to the
1251 let ty = cx.tables.expr_ty(start);
1252 let (sup, eq) = match (start_idx, end_idx) {
1253 (Constant::Int(start_idx), Constant::Int(end_idx)) => (
1255 ty::Int(ity) => sext(cx.tcx, start_idx, ity) > sext(cx.tcx, end_idx, ity),
1256 ty::Uint(_) => start_idx > end_idx,
1259 start_idx == end_idx,
1261 _ => (false, false),
1265 let start_snippet = snippet(cx, start.span, "_");
1266 let end_snippet = snippet(cx, end.span, "_");
1267 let dots = if limits == ast::RangeLimits::Closed {
1277 "this range is empty so this for loop will never run",
1281 "consider using the following if you are attempting to iterate over this \
1284 "({end}{dots}{start}).rev()",
1287 start = start_snippet
1289 Applicability::MaybeIncorrect,
1293 } else if eq && limits != ast::RangeLimits::Closed {
1294 // if they are equal, it's also problematic - this loop
1300 "this range is empty so this for loop will never run",
1308 fn lint_iter_method(cx: &LateContext<'_, '_>, args: &[Expr], arg: &Expr, method_name: &str) {
1309 let mut applicability = Applicability::MachineApplicable;
1310 let object = snippet_with_applicability(cx, args[0].span, "_", &mut applicability);
1311 let muta = if method_name == "iter_mut" { "mut " } else { "" };
1316 "it is more concise to loop over references to containers instead of using explicit \
1318 "to write this more concisely, try",
1319 format!("&{}{}", muta, object),
1324 fn check_for_loop_arg(cx: &LateContext<'_, '_>, pat: &Pat, arg: &Expr, expr: &Expr) {
1325 let mut next_loop_linted = false; // whether or not ITER_NEXT_LOOP lint was used
1326 if let ExprKind::MethodCall(ref method, _, ref args) = arg.node {
1327 // just the receiver, no arguments
1328 if args.len() == 1 {
1329 let method_name = &*method.ident.as_str();
1330 // check for looping over x.iter() or x.iter_mut(), could use &x or &mut x
1331 if method_name == "iter" || method_name == "iter_mut" {
1332 if is_ref_iterable_type(cx, &args[0]) {
1333 lint_iter_method(cx, args, arg, method_name);
1335 } else if method_name == "into_iter" && match_trait_method(cx, arg, &paths::INTO_ITERATOR) {
1336 let def_id = cx.tables.type_dependent_def_id(arg.hir_id).unwrap();
1337 let substs = cx.tables.node_substs(arg.hir_id);
1338 let method_type = cx.tcx.type_of(def_id).subst(cx.tcx, substs);
1340 let fn_arg_tys = method_type.fn_sig(cx.tcx).inputs();
1341 assert_eq!(fn_arg_tys.skip_binder().len(), 1);
1342 if fn_arg_tys.skip_binder()[0].is_region_ptr() {
1343 match cx.tables.expr_ty(&args[0]).sty {
1344 // If the length is greater than 32 no traits are implemented for array and
1345 // therefore we cannot use `&`.
1346 ty::Array(_, size) if size.eval_usize(cx.tcx, cx.param_env) > 32 => {},
1347 _ => lint_iter_method(cx, args, arg, method_name),
1350 let mut applicability = Applicability::MachineApplicable;
1351 let object = snippet_with_applicability(cx, args[0].span, "_", &mut applicability);
1354 EXPLICIT_INTO_ITER_LOOP,
1356 "it is more concise to loop over containers instead of using explicit \
1357 iteration methods`",
1358 "to write this more concisely, try",
1363 } else if method_name == "next" && match_trait_method(cx, arg, &paths::ITERATOR) {
1368 "you are iterating over `Iterator::next()` which is an Option; this will compile but is \
1369 probably not what you want",
1371 next_loop_linted = true;
1375 if !next_loop_linted {
1376 check_arg_type(cx, pat, arg);
1380 /// Checks for `for` loops over `Option`s and `Result`s.
1381 fn check_arg_type(cx: &LateContext<'_, '_>, pat: &Pat, arg: &Expr) {
1382 let ty = cx.tables.expr_ty(arg);
1383 if match_type(cx, ty, &paths::OPTION) {
1386 FOR_LOOP_OVER_OPTION,
1389 "for loop over `{0}`, which is an `Option`. This is more readably written as an \
1390 `if let` statement.",
1391 snippet(cx, arg.span, "_")
1394 "consider replacing `for {0} in {1}` with `if let Some({0}) = {1}`",
1395 snippet(cx, pat.span, "_"),
1396 snippet(cx, arg.span, "_")
1399 } else if match_type(cx, ty, &paths::RESULT) {
1402 FOR_LOOP_OVER_RESULT,
1405 "for loop over `{0}`, which is a `Result`. This is more readably written as an \
1406 `if let` statement.",
1407 snippet(cx, arg.span, "_")
1410 "consider replacing `for {0} in {1}` with `if let Ok({0}) = {1}`",
1411 snippet(cx, pat.span, "_"),
1412 snippet(cx, arg.span, "_")
1418 fn check_for_loop_explicit_counter<'a, 'tcx>(
1419 cx: &LateContext<'a, 'tcx>,
1425 // Look for variables that are incremented once per loop iteration.
1426 let mut visitor = IncrementVisitor {
1428 states: FxHashMap::default(),
1432 walk_expr(&mut visitor, body);
1434 // For each candidate, check the parent block to see if
1435 // it's initialized to zero at the start of the loop.
1436 if let Some(block) = get_enclosing_block(&cx, expr.hir_id) {
1437 for (id, _) in visitor.states.iter().filter(|&(_, v)| *v == VarState::IncrOnce) {
1438 let mut visitor2 = InitializeVisitor {
1442 state: VarState::IncrOnce,
1447 walk_block(&mut visitor2, block);
1449 if visitor2.state == VarState::Warn {
1450 if let Some(name) = visitor2.name {
1451 let mut applicability = Applicability::MachineApplicable;
1454 EXPLICIT_COUNTER_LOOP,
1456 &format!("the variable `{}` is used as a loop counter.", name),
1459 "for ({}, {}) in {}.enumerate()",
1461 snippet_with_applicability(cx, pat.span, "item", &mut applicability),
1462 if higher::range(cx, arg).is_some() {
1465 snippet_with_applicability(cx, arg.span, "_", &mut applicability)
1470 sugg::Sugg::hir_with_applicability(cx, arg, "_", &mut applicability).maybe_par()
1482 /// Checks for the `FOR_KV_MAP` lint.
1483 fn check_for_loop_over_map_kv<'a, 'tcx>(
1484 cx: &LateContext<'a, 'tcx>,
1490 let pat_span = pat.span;
1492 if let PatKind::Tuple(ref pat, _) = pat.node {
1494 let arg_span = arg.span;
1495 let (new_pat_span, kind, ty, mutbl) = match cx.tables.expr_ty(arg).sty {
1496 ty::Ref(_, ty, mutbl) => match (&pat[0].node, &pat[1].node) {
1497 (key, _) if pat_is_wild(key, body) => (pat[1].span, "value", ty, mutbl),
1498 (_, value) if pat_is_wild(value, body) => (pat[0].span, "key", ty, MutImmutable),
1503 let mutbl = match mutbl {
1505 MutMutable => "_mut",
1507 let arg = match arg.node {
1508 ExprKind::AddrOf(_, ref expr) => &**expr,
1512 if match_type(cx, ty, &paths::HASHMAP) || match_type(cx, ty, &paths::BTREEMAP) {
1517 &format!("you seem to want to iterate on a map's {}s", kind),
1519 let map = sugg::Sugg::hir(cx, arg, "map");
1522 "use the corresponding method".into(),
1524 (pat_span, snippet(cx, new_pat_span, kind).into_owned()),
1525 (arg_span, format!("{}.{}s{}()", map.maybe_par(), kind, mutbl)),
1535 struct MutatePairDelegate {
1536 hir_id_low: Option<HirId>,
1537 hir_id_high: Option<HirId>,
1538 span_low: Option<Span>,
1539 span_high: Option<Span>,
1542 impl<'tcx> Delegate<'tcx> for MutatePairDelegate {
1543 fn consume(&mut self, _: HirId, _: Span, _: &cmt_<'tcx>, _: ConsumeMode) {}
1545 fn matched_pat(&mut self, _: &Pat, _: &cmt_<'tcx>, _: MatchMode) {}
1547 fn consume_pat(&mut self, _: &Pat, _: &cmt_<'tcx>, _: ConsumeMode) {}
1549 fn borrow(&mut self, _: HirId, sp: Span, cmt: &cmt_<'tcx>, _: ty::Region<'_>, bk: ty::BorrowKind, _: LoanCause) {
1550 if let ty::BorrowKind::MutBorrow = bk {
1551 if let Categorization::Local(id) = cmt.cat {
1552 if Some(id) == self.hir_id_low {
1553 self.span_low = Some(sp)
1555 if Some(id) == self.hir_id_high {
1556 self.span_high = Some(sp)
1562 fn mutate(&mut self, _: HirId, sp: Span, cmt: &cmt_<'tcx>, _: MutateMode) {
1563 if let Categorization::Local(id) = cmt.cat {
1564 if Some(id) == self.hir_id_low {
1565 self.span_low = Some(sp)
1567 if Some(id) == self.hir_id_high {
1568 self.span_high = Some(sp)
1573 fn decl_without_init(&mut self, _: HirId, _: Span) {}
1576 impl<'tcx> MutatePairDelegate {
1577 fn mutation_span(&self) -> (Option<Span>, Option<Span>) {
1578 (self.span_low, self.span_high)
1582 fn check_for_mut_range_bound(cx: &LateContext<'_, '_>, arg: &Expr, body: &Expr) {
1583 if let Some(higher::Range {
1587 }) = higher::range(cx, arg)
1589 let mut_ids = vec![check_for_mutability(cx, start), check_for_mutability(cx, end)];
1590 if mut_ids[0].is_some() || mut_ids[1].is_some() {
1591 let (span_low, span_high) = check_for_mutation(cx, body, &mut_ids);
1592 mut_warn_with_span(cx, span_low);
1593 mut_warn_with_span(cx, span_high);
1598 fn mut_warn_with_span(cx: &LateContext<'_, '_>, span: Option<Span>) {
1599 if let Some(sp) = span {
1604 "attempt to mutate range bound within loop; note that the range of the loop is unchanged",
1609 fn check_for_mutability(cx: &LateContext<'_, '_>, bound: &Expr) -> Option<HirId> {
1611 if let ExprKind::Path(ref qpath) = bound.node;
1612 if let QPath::Resolved(None, _) = *qpath;
1614 let res = cx.tables.qpath_res(qpath, bound.hir_id);
1615 if let Res::Local(node_id) = res {
1616 let node_str = cx.tcx.hir().get(node_id);
1618 if let Node::Binding(pat) = node_str;
1619 if let PatKind::Binding(bind_ann, ..) = pat.node;
1620 if let BindingAnnotation::Mutable = bind_ann;
1622 return Some(node_id);
1631 fn check_for_mutation(
1632 cx: &LateContext<'_, '_>,
1634 bound_ids: &[Option<HirId>],
1635 ) -> (Option<Span>, Option<Span>) {
1636 let mut delegate = MutatePairDelegate {
1637 hir_id_low: bound_ids[0],
1638 hir_id_high: bound_ids[1],
1642 let def_id = def_id::DefId::local(body.hir_id.owner);
1643 let region_scope_tree = &cx.tcx.region_scope_tree(def_id);
1644 ExprUseVisitor::new(
1654 delegate.mutation_span()
1657 /// Returns `true` if the pattern is a `PatWild` or an ident prefixed with `_`.
1658 fn pat_is_wild<'tcx>(pat: &'tcx PatKind, body: &'tcx Expr) -> bool {
1660 PatKind::Wild => true,
1661 PatKind::Binding(.., ident, None) if ident.as_str().starts_with('_') => {
1662 let mut visitor = UsedVisitor {
1666 walk_expr(&mut visitor, body);
1673 struct UsedVisitor {
1674 var: ast::Name, // var to look for
1675 used: bool, // has the var been used otherwise?
1678 impl<'tcx> Visitor<'tcx> for UsedVisitor {
1679 fn visit_expr(&mut self, expr: &'tcx Expr) {
1680 if match_var(expr, self.var) {
1683 walk_expr(self, expr);
1687 fn nested_visit_map<'this>(&'this mut self) -> NestedVisitorMap<'this, 'tcx> {
1688 NestedVisitorMap::None
1692 struct LocalUsedVisitor<'a, 'tcx> {
1693 cx: &'a LateContext<'a, 'tcx>,
1698 impl<'a, 'tcx> Visitor<'tcx> for LocalUsedVisitor<'a, 'tcx> {
1699 fn visit_expr(&mut self, expr: &'tcx Expr) {
1700 if same_var(self.cx, expr, self.local) {
1703 walk_expr(self, expr);
1707 fn nested_visit_map<'this>(&'this mut self) -> NestedVisitorMap<'this, 'tcx> {
1708 NestedVisitorMap::None
1712 struct VarVisitor<'a, 'tcx> {
1713 /// context reference
1714 cx: &'a LateContext<'a, 'tcx>,
1715 /// var name to look for as index
1717 /// indexed variables that are used mutably
1718 indexed_mut: FxHashSet<Name>,
1719 /// indirectly indexed variables (`v[(i + 4) % N]`), the extend is `None` for global
1720 indexed_indirectly: FxHashMap<Name, Option<region::Scope>>,
1721 /// subset of `indexed` of vars that are indexed directly: `v[i]`
1722 /// this will not contain cases like `v[calc_index(i)]` or `v[(i + 4) % N]`
1723 indexed_directly: FxHashMap<Name, (Option<region::Scope>, Ty<'tcx>)>,
1724 /// Any names that are used outside an index operation.
1725 /// Used to detect things like `&mut vec` used together with `vec[i]`
1726 referenced: FxHashSet<Name>,
1727 /// has the loop variable been used in expressions other than the index of
1730 /// Whether we are inside the `$` in `&mut $` or `$ = foo` or `$.bar`, where bar
1731 /// takes `&mut self`
1732 prefer_mutable: bool,
1735 impl<'a, 'tcx> VarVisitor<'a, 'tcx> {
1736 fn check(&mut self, idx: &'tcx Expr, seqexpr: &'tcx Expr, expr: &'tcx Expr) -> bool {
1738 // the indexed container is referenced by a name
1739 if let ExprKind::Path(ref seqpath) = seqexpr.node;
1740 if let QPath::Resolved(None, ref seqvar) = *seqpath;
1741 if seqvar.segments.len() == 1;
1743 let index_used_directly = same_var(self.cx, idx, self.var);
1744 let indexed_indirectly = {
1745 let mut used_visitor = LocalUsedVisitor {
1750 walk_expr(&mut used_visitor, idx);
1754 if indexed_indirectly || index_used_directly {
1755 if self.prefer_mutable {
1756 self.indexed_mut.insert(seqvar.segments[0].ident.name);
1758 let res = self.cx.tables.qpath_res(seqpath, seqexpr.hir_id);
1760 Res::Local(hir_id) => {
1761 let parent_id = self.cx.tcx.hir().get_parent_item(expr.hir_id);
1762 let parent_def_id = self.cx.tcx.hir().local_def_id(parent_id);
1763 let extent = self.cx.tcx.region_scope_tree(parent_def_id).var_scope(hir_id.local_id);
1764 if indexed_indirectly {
1765 self.indexed_indirectly.insert(seqvar.segments[0].ident.name, Some(extent));
1767 if index_used_directly {
1768 self.indexed_directly.insert(
1769 seqvar.segments[0].ident.name,
1770 (Some(extent), self.cx.tables.node_type(seqexpr.hir_id)),
1773 return false; // no need to walk further *on the variable*
1775 Res::Def(DefKind::Static, ..) | Res::Def(DefKind::Const, ..) => {
1776 if indexed_indirectly {
1777 self.indexed_indirectly.insert(seqvar.segments[0].ident.name, None);
1779 if index_used_directly {
1780 self.indexed_directly.insert(
1781 seqvar.segments[0].ident.name,
1782 (None, self.cx.tables.node_type(seqexpr.hir_id)),
1785 return false; // no need to walk further *on the variable*
1796 impl<'a, 'tcx> Visitor<'tcx> for VarVisitor<'a, 'tcx> {
1797 fn visit_expr(&mut self, expr: &'tcx Expr) {
1800 if let ExprKind::MethodCall(ref meth, _, ref args) = expr.node;
1801 if (meth.ident.name == sym!(index) && match_trait_method(self.cx, expr, &paths::INDEX))
1802 || (meth.ident.name == sym!(index_mut) && match_trait_method(self.cx, expr, &paths::INDEX_MUT));
1803 if !self.check(&args[1], &args[0], expr);
1809 if let ExprKind::Index(ref seqexpr, ref idx) = expr.node;
1810 if !self.check(idx, seqexpr, expr);
1815 // directly using a variable
1816 if let ExprKind::Path(ref qpath) = expr.node;
1817 if let QPath::Resolved(None, ref path) = *qpath;
1818 if path.segments.len() == 1;
1820 if let Res::Local(local_id) = self.cx.tables.qpath_res(qpath, expr.hir_id) {
1821 if local_id == self.var {
1822 self.nonindex = true;
1824 // not the correct variable, but still a variable
1825 self.referenced.insert(path.segments[0].ident.name);
1831 let old = self.prefer_mutable;
1833 ExprKind::AssignOp(_, ref lhs, ref rhs) | ExprKind::Assign(ref lhs, ref rhs) => {
1834 self.prefer_mutable = true;
1835 self.visit_expr(lhs);
1836 self.prefer_mutable = false;
1837 self.visit_expr(rhs);
1839 ExprKind::AddrOf(mutbl, ref expr) => {
1840 if mutbl == MutMutable {
1841 self.prefer_mutable = true;
1843 self.visit_expr(expr);
1845 ExprKind::Call(ref f, ref args) => {
1848 let ty = self.cx.tables.expr_ty_adjusted(expr);
1849 self.prefer_mutable = false;
1850 if let ty::Ref(_, _, mutbl) = ty.sty {
1851 if mutbl == MutMutable {
1852 self.prefer_mutable = true;
1855 self.visit_expr(expr);
1858 ExprKind::MethodCall(_, _, ref args) => {
1859 let def_id = self.cx.tables.type_dependent_def_id(expr.hir_id).unwrap();
1860 for (ty, expr) in self.cx.tcx.fn_sig(def_id).inputs().skip_binder().iter().zip(args) {
1861 self.prefer_mutable = false;
1862 if let ty::Ref(_, _, mutbl) = ty.sty {
1863 if mutbl == MutMutable {
1864 self.prefer_mutable = true;
1867 self.visit_expr(expr);
1870 ExprKind::Closure(_, _, body_id, ..) => {
1871 let body = self.cx.tcx.hir().body(body_id);
1872 self.visit_expr(&body.value);
1874 _ => walk_expr(self, expr),
1876 self.prefer_mutable = old;
1878 fn nested_visit_map<'this>(&'this mut self) -> NestedVisitorMap<'this, 'tcx> {
1879 NestedVisitorMap::None
1883 fn is_used_inside<'a, 'tcx>(cx: &'a LateContext<'a, 'tcx>, expr: &'tcx Expr, container: &'tcx Expr) -> bool {
1884 let def_id = match var_def_id(cx, expr) {
1886 None => return false,
1888 if let Some(used_mutably) = mutated_variables(container, cx) {
1889 if used_mutably.contains(&def_id) {
1896 fn is_iterator_used_after_while_let<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, iter_expr: &'tcx Expr) -> bool {
1897 let def_id = match var_def_id(cx, iter_expr) {
1899 None => return false,
1901 let mut visitor = VarUsedAfterLoopVisitor {
1904 iter_expr_id: iter_expr.hir_id,
1905 past_while_let: false,
1906 var_used_after_while_let: false,
1908 if let Some(enclosing_block) = get_enclosing_block(cx, def_id) {
1909 walk_block(&mut visitor, enclosing_block);
1911 visitor.var_used_after_while_let
1914 struct VarUsedAfterLoopVisitor<'a, 'tcx> {
1915 cx: &'a LateContext<'a, 'tcx>,
1917 iter_expr_id: HirId,
1918 past_while_let: bool,
1919 var_used_after_while_let: bool,
1922 impl<'a, 'tcx> Visitor<'tcx> for VarUsedAfterLoopVisitor<'a, 'tcx> {
1923 fn visit_expr(&mut self, expr: &'tcx Expr) {
1924 if self.past_while_let {
1925 if Some(self.def_id) == var_def_id(self.cx, expr) {
1926 self.var_used_after_while_let = true;
1928 } else if self.iter_expr_id == expr.hir_id {
1929 self.past_while_let = true;
1931 walk_expr(self, expr);
1933 fn nested_visit_map<'this>(&'this mut self) -> NestedVisitorMap<'this, 'tcx> {
1934 NestedVisitorMap::None
1938 /// Returns `true` if the type of expr is one that provides `IntoIterator` impls
1939 /// for `&T` and `&mut T`, such as `Vec`.
1941 fn is_ref_iterable_type(cx: &LateContext<'_, '_>, e: &Expr) -> bool {
1942 // no walk_ptrs_ty: calling iter() on a reference can make sense because it
1943 // will allow further borrows afterwards
1944 let ty = cx.tables.expr_ty(e);
1945 is_iterable_array(ty, cx) ||
1946 match_type(cx, ty, &paths::VEC) ||
1947 match_type(cx, ty, &paths::LINKED_LIST) ||
1948 match_type(cx, ty, &paths::HASHMAP) ||
1949 match_type(cx, ty, &paths::HASHSET) ||
1950 match_type(cx, ty, &paths::VEC_DEQUE) ||
1951 match_type(cx, ty, &paths::BINARY_HEAP) ||
1952 match_type(cx, ty, &paths::BTREEMAP) ||
1953 match_type(cx, ty, &paths::BTREESET)
1956 fn is_iterable_array<'tcx>(ty: Ty<'tcx>, cx: &LateContext<'_, 'tcx>) -> bool {
1957 // IntoIterator is currently only implemented for array sizes <= 32 in rustc
1959 ty::Array(_, n) => (0..=32).contains(&n.eval_usize(cx.tcx, cx.param_env)),
1964 /// If a block begins with a statement (possibly a `let` binding) and has an
1965 /// expression, return it.
1966 fn extract_expr_from_first_stmt(block: &Block) -> Option<&Expr> {
1967 if block.stmts.is_empty() {
1970 if let StmtKind::Local(ref local) = block.stmts[0].node {
1971 if let Some(ref expr) = local.init {
1981 /// If a block begins with an expression (with or without semicolon), return it.
1982 fn extract_first_expr(block: &Block) -> Option<&Expr> {
1984 Some(ref expr) if block.stmts.is_empty() => Some(expr),
1985 None if !block.stmts.is_empty() => match block.stmts[0].node {
1986 StmtKind::Expr(ref expr) | StmtKind::Semi(ref expr) => Some(expr),
1987 StmtKind::Local(..) | StmtKind::Item(..) => None,
1993 /// Returns `true` if expr contains a single break expr without destination label
1995 /// passed expression. The expression may be within a block.
1996 fn is_simple_break_expr(expr: &Expr) -> bool {
1998 ExprKind::Break(dest, ref passed_expr) if dest.label.is_none() && passed_expr.is_none() => true,
1999 ExprKind::Block(ref b, _) => match extract_first_expr(b) {
2000 Some(subexpr) => is_simple_break_expr(subexpr),
2007 // To trigger the EXPLICIT_COUNTER_LOOP lint, a variable must be
2008 // incremented exactly once in the loop body, and initialized to zero
2009 // at the start of the loop.
2010 #[derive(Debug, PartialEq)]
2012 Initial, // Not examined yet
2013 IncrOnce, // Incremented exactly once, may be a loop counter
2014 Declared, // Declared but not (yet) initialized to zero
2019 /// Scan a for loop for variables that are incremented exactly once.
2020 struct IncrementVisitor<'a, 'tcx> {
2021 cx: &'a LateContext<'a, 'tcx>, // context reference
2022 states: FxHashMap<HirId, VarState>, // incremented variables
2023 depth: u32, // depth of conditional expressions
2027 impl<'a, 'tcx> Visitor<'tcx> for IncrementVisitor<'a, 'tcx> {
2028 fn visit_expr(&mut self, expr: &'tcx Expr) {
2033 // If node is a variable
2034 if let Some(def_id) = var_def_id(self.cx, expr) {
2035 if let Some(parent) = get_parent_expr(self.cx, expr) {
2036 let state = self.states.entry(def_id).or_insert(VarState::Initial);
2039 ExprKind::AssignOp(op, ref lhs, ref rhs) => {
2040 if lhs.hir_id == expr.hir_id {
2041 if op.node == BinOpKind::Add && is_integer_literal(rhs, 1) {
2042 *state = match *state {
2043 VarState::Initial if self.depth == 0 => VarState::IncrOnce,
2044 _ => VarState::DontWarn,
2047 // Assigned some other value
2048 *state = VarState::DontWarn;
2052 ExprKind::Assign(ref lhs, _) if lhs.hir_id == expr.hir_id => *state = VarState::DontWarn,
2053 ExprKind::AddrOf(mutability, _) if mutability == MutMutable => *state = VarState::DontWarn,
2057 } else if is_loop(expr) || is_conditional(expr) {
2059 walk_expr(self, expr);
2062 } else if let ExprKind::Continue(_) = expr.node {
2066 walk_expr(self, expr);
2068 fn nested_visit_map<'this>(&'this mut self) -> NestedVisitorMap<'this, 'tcx> {
2069 NestedVisitorMap::None
2073 /// Checks whether a variable is initialized to zero at the start of a loop.
2074 struct InitializeVisitor<'a, 'tcx> {
2075 cx: &'a LateContext<'a, 'tcx>, // context reference
2076 end_expr: &'tcx Expr, // the for loop. Stop scanning here.
2080 depth: u32, // depth of conditional expressions
2084 impl<'a, 'tcx> Visitor<'tcx> for InitializeVisitor<'a, 'tcx> {
2085 fn visit_stmt(&mut self, stmt: &'tcx Stmt) {
2086 // Look for declarations of the variable
2087 if let StmtKind::Local(ref local) = stmt.node {
2088 if local.pat.hir_id == self.var_id {
2089 if let PatKind::Binding(.., ident, _) = local.pat.node {
2090 self.name = Some(ident.name);
2092 self.state = if let Some(ref init) = local.init {
2093 if is_integer_literal(init, 0) {
2104 walk_stmt(self, stmt);
2107 fn visit_expr(&mut self, expr: &'tcx Expr) {
2108 if self.state == VarState::DontWarn {
2111 if SpanlessEq::new(self.cx).eq_expr(&expr, self.end_expr) {
2112 self.past_loop = true;
2115 // No need to visit expressions before the variable is
2117 if self.state == VarState::IncrOnce {
2121 // If node is the desired variable, see how it's used
2122 if var_def_id(self.cx, expr) == Some(self.var_id) {
2123 if let Some(parent) = get_parent_expr(self.cx, expr) {
2125 ExprKind::AssignOp(_, ref lhs, _) if lhs.hir_id == expr.hir_id => {
2126 self.state = VarState::DontWarn;
2128 ExprKind::Assign(ref lhs, ref rhs) if lhs.hir_id == expr.hir_id => {
2129 self.state = if is_integer_literal(rhs, 0) && self.depth == 0 {
2135 ExprKind::AddrOf(mutability, _) if mutability == MutMutable => self.state = VarState::DontWarn,
2141 self.state = VarState::DontWarn;
2144 } else if !self.past_loop && is_loop(expr) {
2145 self.state = VarState::DontWarn;
2147 } else if is_conditional(expr) {
2149 walk_expr(self, expr);
2153 walk_expr(self, expr);
2155 fn nested_visit_map<'this>(&'this mut self) -> NestedVisitorMap<'this, 'tcx> {
2156 NestedVisitorMap::None
2160 fn var_def_id(cx: &LateContext<'_, '_>, expr: &Expr) -> Option<HirId> {
2161 if let ExprKind::Path(ref qpath) = expr.node {
2162 let path_res = cx.tables.qpath_res(qpath, expr.hir_id);
2163 if let Res::Local(node_id) = path_res {
2164 return Some(node_id);
2170 fn is_loop(expr: &Expr) -> bool {
2172 ExprKind::Loop(..) => true,
2177 fn is_conditional(expr: &Expr) -> bool {
2179 ExprKind::Match(..) => true,
2184 fn is_nested(cx: &LateContext<'_, '_>, match_expr: &Expr, iter_expr: &Expr) -> bool {
2186 if let Some(loop_block) = get_enclosing_block(cx, match_expr.hir_id);
2187 let parent_node = cx.tcx.hir().get_parent_node(loop_block.hir_id);
2188 if let Some(Node::Expr(loop_expr)) = cx.tcx.hir().find(parent_node);
2190 return is_loop_nested(cx, loop_expr, iter_expr)
2196 fn is_loop_nested(cx: &LateContext<'_, '_>, loop_expr: &Expr, iter_expr: &Expr) -> bool {
2197 let mut id = loop_expr.hir_id;
2198 let iter_name = if let Some(name) = path_name(iter_expr) {
2204 let parent = cx.tcx.hir().get_parent_node(id);
2208 match cx.tcx.hir().find(parent) {
2209 Some(Node::Expr(expr)) => {
2210 if let ExprKind::Loop(..) = expr.node {
2214 Some(Node::Block(block)) => {
2215 let mut block_visitor = LoopNestVisitor {
2217 iterator: iter_name,
2220 walk_block(&mut block_visitor, block);
2221 if block_visitor.nesting == RuledOut {
2225 Some(Node::Stmt(_)) => (),
2234 #[derive(PartialEq, Eq)]
2236 Unknown, // no nesting detected yet
2237 RuledOut, // the iterator is initialized or assigned within scope
2238 LookFurther, // no nesting detected, no further walk required
2241 use self::Nesting::{LookFurther, RuledOut, Unknown};
2243 struct LoopNestVisitor {
2249 impl<'tcx> Visitor<'tcx> for LoopNestVisitor {
2250 fn visit_stmt(&mut self, stmt: &'tcx Stmt) {
2251 if stmt.hir_id == self.hir_id {
2252 self.nesting = LookFurther;
2253 } else if self.nesting == Unknown {
2254 walk_stmt(self, stmt);
2258 fn visit_expr(&mut self, expr: &'tcx Expr) {
2259 if self.nesting != Unknown {
2262 if expr.hir_id == self.hir_id {
2263 self.nesting = LookFurther;
2267 ExprKind::Assign(ref path, _) | ExprKind::AssignOp(_, ref path, _) => {
2268 if match_var(path, self.iterator) {
2269 self.nesting = RuledOut;
2272 _ => walk_expr(self, expr),
2276 fn visit_pat(&mut self, pat: &'tcx Pat) {
2277 if self.nesting != Unknown {
2280 if let PatKind::Binding(.., span_name, _) = pat.node {
2281 if self.iterator == span_name.name {
2282 self.nesting = RuledOut;
2289 fn nested_visit_map<'this>(&'this mut self) -> NestedVisitorMap<'this, 'tcx> {
2290 NestedVisitorMap::None
2294 fn path_name(e: &Expr) -> Option<Name> {
2295 if let ExprKind::Path(QPath::Resolved(_, ref path)) = e.node {
2296 let segments = &path.segments;
2297 if segments.len() == 1 {
2298 return Some(segments[0].ident.name);
2304 fn check_infinite_loop<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, cond: &'tcx Expr, expr: &'tcx Expr) {
2305 if constant(cx, cx.tables, cond).is_some() {
2306 // A pure constant condition (e.g., `while false`) is not linted.
2310 let mut var_visitor = VarCollectorVisitor {
2312 ids: FxHashSet::default(),
2313 def_ids: FxHashMap::default(),
2316 var_visitor.visit_expr(cond);
2317 if var_visitor.skip {
2320 let used_in_condition = &var_visitor.ids;
2321 let no_cond_variable_mutated = if let Some(used_mutably) = mutated_variables(expr, cx) {
2322 used_in_condition.is_disjoint(&used_mutably)
2326 let mutable_static_in_cond = var_visitor.def_ids.iter().any(|(_, v)| *v);
2327 if no_cond_variable_mutated && !mutable_static_in_cond {
2330 WHILE_IMMUTABLE_CONDITION,
2332 "Variable in the condition are not mutated in the loop body. \
2333 This either leads to an infinite or to a never running loop.",
2338 /// Collects the set of variables in an expression
2339 /// Stops analysis if a function call is found
2340 /// Note: In some cases such as `self`, there are no mutable annotation,
2341 /// All variables definition IDs are collected
2342 struct VarCollectorVisitor<'a, 'tcx> {
2343 cx: &'a LateContext<'a, 'tcx>,
2344 ids: FxHashSet<HirId>,
2345 def_ids: FxHashMap<def_id::DefId, bool>,
2349 impl<'a, 'tcx> VarCollectorVisitor<'a, 'tcx> {
2350 fn insert_def_id(&mut self, ex: &'tcx Expr) {
2352 if let ExprKind::Path(ref qpath) = ex.node;
2353 if let QPath::Resolved(None, _) = *qpath;
2354 let res = self.cx.tables.qpath_res(qpath, ex.hir_id);
2357 Res::Local(node_id) => {
2358 self.ids.insert(node_id);
2360 Res::Def(DefKind::Static, def_id) => {
2361 let mutable = self.cx.tcx.is_mutable_static(def_id);
2362 self.def_ids.insert(def_id, mutable);
2371 impl<'a, 'tcx> Visitor<'tcx> for VarCollectorVisitor<'a, 'tcx> {
2372 fn visit_expr(&mut self, ex: &'tcx Expr) {
2374 ExprKind::Path(_) => self.insert_def_id(ex),
2375 // If there is any function/method call… we just stop analysis
2376 ExprKind::Call(..) | ExprKind::MethodCall(..) => self.skip = true,
2378 _ => walk_expr(self, ex),
2382 fn nested_visit_map<'this>(&'this mut self) -> NestedVisitorMap<'this, 'tcx> {
2383 NestedVisitorMap::None
2387 const NEEDLESS_COLLECT_MSG: &str = "avoid using `collect()` when not needed";
2389 fn check_needless_collect<'a, 'tcx>(expr: &'tcx Expr, cx: &LateContext<'a, 'tcx>) {
2391 if let ExprKind::MethodCall(ref method, _, ref args) = expr.node;
2392 if let ExprKind::MethodCall(ref chain_method, _, _) = args[0].node;
2393 if chain_method.ident.name == sym!(collect) && match_trait_method(cx, &args[0], &paths::ITERATOR);
2394 if let Some(ref generic_args) = chain_method.args;
2395 if let Some(GenericArg::Type(ref ty)) = generic_args.args.get(0);
2397 let ty = cx.tables.node_type(ty.hir_id);
2398 if match_type(cx, ty, &paths::VEC) ||
2399 match_type(cx, ty, &paths::VEC_DEQUE) ||
2400 match_type(cx, ty, &paths::BTREEMAP) ||
2401 match_type(cx, ty, &paths::HASHMAP) {
2402 if method.ident.name == sym!(len) {
2403 let span = shorten_needless_collect_span(expr);
2404 span_lint_and_then(cx, NEEDLESS_COLLECT, span, NEEDLESS_COLLECT_MSG, |db| {
2408 ".count()".to_string(),
2409 Applicability::MachineApplicable,
2413 if method.ident.name == sym!(is_empty) {
2414 let span = shorten_needless_collect_span(expr);
2415 span_lint_and_then(cx, NEEDLESS_COLLECT, span, NEEDLESS_COLLECT_MSG, |db| {
2419 ".next().is_none()".to_string(),
2420 Applicability::MachineApplicable,
2424 if method.ident.name == sym!(contains) {
2425 let contains_arg = snippet(cx, args[1].span, "??");
2426 let span = shorten_needless_collect_span(expr);
2427 span_lint_and_then(cx, NEEDLESS_COLLECT, span, NEEDLESS_COLLECT_MSG, |db| {
2432 ".any(|&x| x == {})",
2433 if contains_arg.starts_with('&') { &contains_arg[1..] } else { &contains_arg }
2435 Applicability::MachineApplicable,
2444 fn shorten_needless_collect_span(expr: &Expr) -> Span {
2446 if let ExprKind::MethodCall(_, _, ref args) = expr.node;
2447 if let ExprKind::MethodCall(_, ref span, _) = args[0].node;
2449 return expr.span.with_lo(span.lo() - BytePos(1));