1 mod manual_saturating_arithmetic;
2 mod option_map_unwrap_or;
3 mod unnecessary_filter_map;
9 use if_chain::if_chain;
12 use rustc::hir::intravisit::{self, Visitor};
13 use rustc::lint::{in_external_macro, LateContext, LateLintPass, Lint, LintArray, LintContext, LintPass};
14 use rustc::ty::{self, Predicate, Ty};
15 use rustc::{declare_lint_pass, declare_tool_lint};
16 use rustc_errors::Applicability;
18 use syntax::source_map::Span;
19 use syntax::symbol::{sym, LocalInternedString};
21 use crate::utils::sugg;
22 use crate::utils::usage::mutated_variables;
24 get_arg_name, get_parent_expr, get_trait_def_id, has_iter_method, implements_trait, in_macro, is_copy,
25 is_ctor_function, is_expn_of, iter_input_pats, last_path_segment, match_def_path, match_qpath, match_trait_method,
26 match_type, match_var, method_calls, method_chain_args, remove_blocks, return_ty, same_tys, single_segment_path,
27 snippet, snippet_with_applicability, snippet_with_macro_callsite, span_lint, span_lint_and_sugg,
28 span_lint_and_then, span_note_and_lint, walk_ptrs_ty, walk_ptrs_ty_depth, SpanlessEq,
30 use crate::utils::{paths, span_help_and_lint};
32 declare_clippy_lint! {
33 /// **What it does:** Checks for `.unwrap()` calls on `Option`s.
35 /// **Why is this bad?** Usually it is better to handle the `None` case, or to
36 /// at least call `.expect(_)` with a more helpful message. Still, for a lot of
37 /// quick-and-dirty code, `unwrap` is a good choice, which is why this lint is
38 /// `Allow` by default.
40 /// **Known problems:** None.
44 /// Using unwrap on an `Option`:
47 /// let opt = Some(1);
54 /// let opt = Some(1);
55 /// opt.expect("more helpful message");
57 pub OPTION_UNWRAP_USED,
59 "using `Option.unwrap()`, which should at least get a better message using `expect()`"
62 declare_clippy_lint! {
63 /// **What it does:** Checks for `.unwrap()` calls on `Result`s.
65 /// **Why is this bad?** `result.unwrap()` will let the thread panic on `Err`
66 /// values. Normally, you want to implement more sophisticated error handling,
67 /// and propagate errors upwards with `try!`.
69 /// Even if you want to panic on errors, not all `Error`s implement good
70 /// messages on display. Therefore, it may be beneficial to look at the places
71 /// where they may get displayed. Activate this lint to do just that.
73 /// **Known problems:** None.
76 /// Using unwrap on an `Option`:
79 /// let res: Result<usize, ()> = Ok(1);
86 /// let res: Result<usize, ()> = Ok(1);
87 /// res.expect("more helpful message");
89 pub RESULT_UNWRAP_USED,
91 "using `Result.unwrap()`, which might be better handled"
94 declare_clippy_lint! {
95 /// **What it does:** Checks for methods that should live in a trait
96 /// implementation of a `std` trait (see [llogiq's blog
97 /// post](http://llogiq.github.io/2015/07/30/traits.html) for further
98 /// information) instead of an inherent implementation.
100 /// **Why is this bad?** Implementing the traits improve ergonomics for users of
101 /// the code, often with very little cost. Also people seeing a `mul(...)`
103 /// may expect `*` to work equally, so you should have good reason to disappoint
106 /// **Known problems:** None.
112 /// fn add(&self, other: &X) -> X {
117 pub SHOULD_IMPLEMENT_TRAIT,
119 "defining a method that should be implementing a std trait"
122 declare_clippy_lint! {
123 /// **What it does:** Checks for methods with certain name prefixes and which
124 /// doesn't match how self is taken. The actual rules are:
126 /// |Prefix |`self` taken |
127 /// |-------|----------------------|
128 /// |`as_` |`&self` or `&mut self`|
130 /// |`into_`|`self` |
131 /// |`is_` |`&self` or none |
132 /// |`to_` |`&self` |
134 /// **Why is this bad?** Consistency breeds readability. If you follow the
135 /// conventions, your users won't be surprised that they, e.g., need to supply a
136 /// mutable reference to a `as_..` function.
138 /// **Known problems:** None.
143 /// fn as_str(self) -> &str {
148 pub WRONG_SELF_CONVENTION,
150 "defining a method named with an established prefix (like \"into_\") that takes `self` with the wrong convention"
153 declare_clippy_lint! {
154 /// **What it does:** This is the same as
155 /// [`wrong_self_convention`](#wrong_self_convention), but for public items.
157 /// **Why is this bad?** See [`wrong_self_convention`](#wrong_self_convention).
159 /// **Known problems:** Actually *renaming* the function may break clients if
160 /// the function is part of the public interface. In that case, be mindful of
161 /// the stability guarantees you've given your users.
167 /// pub fn as_str(self) -> &'a str {
172 pub WRONG_PUB_SELF_CONVENTION,
174 "defining a public method named with an established prefix (like \"into_\") that takes `self` with the wrong convention"
177 declare_clippy_lint! {
178 /// **What it does:** Checks for usage of `ok().expect(..)`.
180 /// **Why is this bad?** Because you usually call `expect()` on the `Result`
181 /// directly to get a better error message.
183 /// **Known problems:** The error type needs to implement `Debug`
187 /// x.ok().expect("why did I do this again?")
191 "using `ok().expect()`, which gives worse error messages than calling `expect` directly on the Result"
194 declare_clippy_lint! {
195 /// **What it does:** Checks for usage of `_.map(_).unwrap_or(_)`.
197 /// **Why is this bad?** Readability, this can be written more concisely as
198 /// `_.map_or(_, _)`.
200 /// **Known problems:** The order of the arguments is not in execution order
204 /// # let x = Some(1);
205 /// x.map(|a| a + 1).unwrap_or(0);
207 pub OPTION_MAP_UNWRAP_OR,
209 "using `Option.map(f).unwrap_or(a)`, which is more succinctly expressed as `map_or(a, f)`"
212 declare_clippy_lint! {
213 /// **What it does:** Checks for usage of `_.map(_).unwrap_or_else(_)`.
215 /// **Why is this bad?** Readability, this can be written more concisely as
216 /// `_.map_or_else(_, _)`.
218 /// **Known problems:** The order of the arguments is not in execution order.
222 /// # let x = Some(1);
223 /// # fn some_function() -> usize { 1 }
224 /// x.map(|a| a + 1).unwrap_or_else(some_function);
226 pub OPTION_MAP_UNWRAP_OR_ELSE,
228 "using `Option.map(f).unwrap_or_else(g)`, which is more succinctly expressed as `map_or_else(g, f)`"
231 declare_clippy_lint! {
232 /// **What it does:** Checks for usage of `result.map(_).unwrap_or_else(_)`.
234 /// **Why is this bad?** Readability, this can be written more concisely as
235 /// `result.ok().map_or_else(_, _)`.
237 /// **Known problems:** None.
241 /// # let x: Result<usize, ()> = Ok(1);
242 /// # fn some_function(foo: ()) -> usize { 1 }
243 /// x.map(|a| a + 1).unwrap_or_else(some_function);
245 pub RESULT_MAP_UNWRAP_OR_ELSE,
247 "using `Result.map(f).unwrap_or_else(g)`, which is more succinctly expressed as `.ok().map_or_else(g, f)`"
250 declare_clippy_lint! {
251 /// **What it does:** Checks for usage of `_.map_or(None, _)`.
253 /// **Why is this bad?** Readability, this can be written more concisely as
256 /// **Known problems:** The order of the arguments is not in execution order.
260 /// opt.map_or(None, |a| a + 1)
262 pub OPTION_MAP_OR_NONE,
264 "using `Option.map_or(None, f)`, which is more succinctly expressed as `and_then(f)`"
267 declare_clippy_lint! {
268 /// **What it does:** Checks for usage of `_.and_then(|x| Some(y))`.
270 /// **Why is this bad?** Readability, this can be written more concisely as
273 /// **Known problems:** None
278 /// let x = Some("foo");
279 /// let _ = x.and_then(|s| Some(s.len()));
282 /// The correct use would be:
285 /// let x = Some("foo");
286 /// let _ = x.map(|s| s.len());
288 pub OPTION_AND_THEN_SOME,
290 "using `Option.and_then(|x| Some(y))`, which is more succinctly expressed as `map(|x| y)`"
293 declare_clippy_lint! {
294 /// **What it does:** Checks for usage of `_.filter(_).next()`.
296 /// **Why is this bad?** Readability, this can be written more concisely as
299 /// **Known problems:** None.
303 /// # let vec = vec![1];
304 /// vec.iter().filter(|x| **x == 0).next();
306 /// Could be written as
308 /// # let vec = vec![1];
309 /// vec.iter().find(|x| **x == 0);
313 "using `filter(p).next()`, which is more succinctly expressed as `.find(p)`"
316 declare_clippy_lint! {
317 /// **What it does:** Checks for usage of `_.map(_).flatten(_)`,
319 /// **Why is this bad?** Readability, this can be written more concisely as a
320 /// single method call.
322 /// **Known problems:**
326 /// let vec = vec![vec![1]];
327 /// vec.iter().map(|x| x.iter()).flatten();
331 "using combinations of `flatten` and `map` which can usually be written as a single method call"
334 declare_clippy_lint! {
335 /// **What it does:** Checks for usage of `_.filter(_).map(_)`,
336 /// `_.filter(_).flat_map(_)`, `_.filter_map(_).flat_map(_)` and similar.
338 /// **Why is this bad?** Readability, this can be written more concisely as a
339 /// single method call.
341 /// **Known problems:** Often requires a condition + Option/Iterator creation
342 /// inside the closure.
346 /// let vec = vec![1];
347 /// vec.iter().filter(|x| **x == 0).map(|x| *x * 2);
351 "using combinations of `filter`, `map`, `filter_map` and `flat_map` which can usually be written as a single method call"
354 declare_clippy_lint! {
355 /// **What it does:** Checks for usage of `_.filter_map(_).next()`.
357 /// **Why is this bad?** Readability, this can be written more concisely as a
358 /// single method call.
360 /// **Known problems:** None
364 /// (0..3).filter_map(|x| if x == 2 { Some(x) } else { None }).next();
366 /// Can be written as
369 /// (0..3).find_map(|x| if x == 2 { Some(x) } else { None });
373 "using combination of `filter_map` and `next` which can usually be written as a single method call"
376 declare_clippy_lint! {
377 /// **What it does:** Checks for usage of `flat_map(|x| x)`.
379 /// **Why is this bad?** Readability, this can be written more concisely by using `flatten`.
381 /// **Known problems:** None
385 /// # let iter = vec![vec![0]].into_iter();
386 /// iter.flat_map(|x| x);
388 /// Can be written as
390 /// # let iter = vec![vec![0]].into_iter();
393 pub FLAT_MAP_IDENTITY,
395 "call to `flat_map` where `flatten` is sufficient"
398 declare_clippy_lint! {
399 /// **What it does:** Checks for usage of `_.find(_).map(_)`.
401 /// **Why is this bad?** Readability, this can be written more concisely as a
402 /// single method call.
404 /// **Known problems:** Often requires a condition + Option/Iterator creation
405 /// inside the closure.
409 /// (0..3).find(|x| *x == 2).map(|x| x * 2);
411 /// Can be written as
413 /// (0..3).find_map(|x| if x == 2 { Some(x * 2) } else { None });
417 "using a combination of `find` and `map` can usually be written as a single method call"
420 declare_clippy_lint! {
421 /// **What it does:** Checks for an iterator search (such as `find()`,
422 /// `position()`, or `rposition()`) followed by a call to `is_some()`.
424 /// **Why is this bad?** Readability, this can be written more concisely as
427 /// **Known problems:** None.
431 /// # let vec = vec![1];
432 /// vec.iter().find(|x| **x == 0).is_some();
434 /// Could be written as
436 /// # let vec = vec![1];
437 /// vec.iter().any(|x| *x == 0);
441 "using an iterator search followed by `is_some()`, which is more succinctly expressed as a call to `any()`"
444 declare_clippy_lint! {
445 /// **What it does:** Checks for usage of `.chars().next()` on a `str` to check
446 /// if it starts with a given char.
448 /// **Why is this bad?** Readability, this can be written more concisely as
449 /// `_.starts_with(_)`.
451 /// **Known problems:** None.
455 /// let name = "foo";
456 /// if name.chars().next() == Some('_') {};
458 /// Could be written as
460 /// let name = "foo";
461 /// if name.starts_with('_') {};
465 "using `.chars().next()` to check if a string starts with a char"
468 declare_clippy_lint! {
469 /// **What it does:** Checks for calls to `.or(foo(..))`, `.unwrap_or(foo(..))`,
470 /// etc., and suggests to use `or_else`, `unwrap_or_else`, etc., or
471 /// `unwrap_or_default` instead.
473 /// **Why is this bad?** The function will always be called and potentially
474 /// allocate an object acting as the default.
476 /// **Known problems:** If the function has side-effects, not calling it will
477 /// change the semantic of the program, but you shouldn't rely on that anyway.
481 /// # let foo = Some(String::new());
482 /// foo.unwrap_or(String::new());
484 /// this can instead be written:
486 /// # let foo = Some(String::new());
487 /// foo.unwrap_or_else(String::new);
491 /// # let foo = Some(String::new());
492 /// foo.unwrap_or_default();
496 "using any `*or` method with a function call, which suggests `*or_else`"
499 declare_clippy_lint! {
500 /// **What it does:** Checks for calls to `.expect(&format!(...))`, `.expect(foo(..))`,
501 /// etc., and suggests to use `unwrap_or_else` instead
503 /// **Why is this bad?** The function will always be called.
505 /// **Known problems:** If the function has side-effects, not calling it will
506 /// change the semantics of the program, but you shouldn't rely on that anyway.
510 /// # let foo = Some(String::new());
511 /// # let err_code = "418";
512 /// # let err_msg = "I'm a teapot";
513 /// foo.expect(&format!("Err {}: {}", err_code, err_msg));
517 /// # let foo = Some(String::new());
518 /// # let err_code = "418";
519 /// # let err_msg = "I'm a teapot";
520 /// foo.expect(format!("Err {}: {}", err_code, err_msg).as_str());
522 /// this can instead be written:
524 /// # let foo = Some(String::new());
525 /// # let err_code = "418";
526 /// # let err_msg = "I'm a teapot";
527 /// foo.unwrap_or_else(|| panic!("Err {}: {}", err_code, err_msg));
531 "using any `expect` method with a function call"
534 declare_clippy_lint! {
535 /// **What it does:** Checks for usage of `.clone()` on a `Copy` type.
537 /// **Why is this bad?** The only reason `Copy` types implement `Clone` is for
538 /// generics, not for using the `clone` method on a concrete type.
540 /// **Known problems:** None.
548 "using `clone` on a `Copy` type"
551 declare_clippy_lint! {
552 /// **What it does:** Checks for usage of `.clone()` on a ref-counted pointer,
553 /// (`Rc`, `Arc`, `rc::Weak`, or `sync::Weak`), and suggests calling Clone via unified
554 /// function syntax instead (e.g., `Rc::clone(foo)`).
556 /// **Why is this bad?** Calling '.clone()' on an Rc, Arc, or Weak
557 /// can obscure the fact that only the pointer is being cloned, not the underlying
562 /// # use std::rc::Rc;
563 /// let x = Rc::new(1);
566 pub CLONE_ON_REF_PTR,
568 "using 'clone' on a ref-counted pointer"
571 declare_clippy_lint! {
572 /// **What it does:** Checks for usage of `.clone()` on an `&&T`.
574 /// **Why is this bad?** Cloning an `&&T` copies the inner `&T`, instead of
575 /// cloning the underlying `T`.
577 /// **Known problems:** None.
584 /// let z = y.clone();
585 /// println!("{:p} {:p}", *y, z); // prints out the same pointer
588 pub CLONE_DOUBLE_REF,
590 "using `clone` on `&&T`"
593 declare_clippy_lint! {
594 /// **What it does:** Checks for `new` not returning `Self`.
596 /// **Why is this bad?** As a convention, `new` methods are used to make a new
597 /// instance of a type.
599 /// **Known problems:** None.
604 /// fn new(..) -> NotAFoo {
610 "not returning `Self` in a `new` method"
613 declare_clippy_lint! {
614 /// **What it does:** Checks for string methods that receive a single-character
615 /// `str` as an argument, e.g., `_.split("x")`.
617 /// **Why is this bad?** Performing these methods using a `char` is faster than
620 /// **Known problems:** Does not catch multi-byte unicode characters.
623 /// `_.split("x")` could be `_.split('x')`
624 pub SINGLE_CHAR_PATTERN,
626 "using a single-character str where a char could be used, e.g., `_.split(\"x\")`"
629 declare_clippy_lint! {
630 /// **What it does:** Checks for getting the inner pointer of a temporary
633 /// **Why is this bad?** The inner pointer of a `CString` is only valid as long
634 /// as the `CString` is alive.
636 /// **Known problems:** None.
640 /// let c_str = CString::new("foo").unwrap().as_ptr();
642 /// call_some_ffi_func(c_str);
645 /// Here `c_str` point to a freed address. The correct use would be:
647 /// let c_str = CString::new("foo").unwrap();
649 /// call_some_ffi_func(c_str.as_ptr());
652 pub TEMPORARY_CSTRING_AS_PTR,
654 "getting the inner pointer of a temporary `CString`"
657 declare_clippy_lint! {
658 /// **What it does:** Checks for use of `.iter().nth()` (and the related
659 /// `.iter_mut().nth()`) on standard library types with O(1) element access.
661 /// **Why is this bad?** `.get()` and `.get_mut()` are more efficient and more
664 /// **Known problems:** None.
668 /// let some_vec = vec![0, 1, 2, 3];
669 /// let bad_vec = some_vec.iter().nth(3);
670 /// let bad_slice = &some_vec[..].iter().nth(3);
672 /// The correct use would be:
674 /// let some_vec = vec![0, 1, 2, 3];
675 /// let bad_vec = some_vec.get(3);
676 /// let bad_slice = &some_vec[..].get(3);
680 "using `.iter().nth()` on a standard library type with O(1) element access"
683 declare_clippy_lint! {
684 /// **What it does:** Checks for use of `.skip(x).next()` on iterators.
686 /// **Why is this bad?** `.nth(x)` is cleaner
688 /// **Known problems:** None.
692 /// let some_vec = vec![0, 1, 2, 3];
693 /// let bad_vec = some_vec.iter().skip(3).next();
694 /// let bad_slice = &some_vec[..].iter().skip(3).next();
696 /// The correct use would be:
698 /// let some_vec = vec![0, 1, 2, 3];
699 /// let bad_vec = some_vec.iter().nth(3);
700 /// let bad_slice = &some_vec[..].iter().nth(3);
704 "using `.skip(x).next()` on an iterator"
707 declare_clippy_lint! {
708 /// **What it does:** Checks for use of `.get().unwrap()` (or
709 /// `.get_mut().unwrap`) on a standard library type which implements `Index`
711 /// **Why is this bad?** Using the Index trait (`[]`) is more clear and more
714 /// **Known problems:** Not a replacement for error handling: Using either
715 /// `.unwrap()` or the Index trait (`[]`) carries the risk of causing a `panic`
716 /// if the value being accessed is `None`. If the use of `.get().unwrap()` is a
717 /// temporary placeholder for dealing with the `Option` type, then this does
718 /// not mitigate the need for error handling. If there is a chance that `.get()`
719 /// will be `None` in your program, then it is advisable that the `None` case
720 /// is handled in a future refactor instead of using `.unwrap()` or the Index
725 /// let mut some_vec = vec![0, 1, 2, 3];
726 /// let last = some_vec.get(3).unwrap();
727 /// *some_vec.get_mut(0).unwrap() = 1;
729 /// The correct use would be:
731 /// let mut some_vec = vec![0, 1, 2, 3];
732 /// let last = some_vec[3];
737 "using `.get().unwrap()` or `.get_mut().unwrap()` when using `[]` would work instead"
740 declare_clippy_lint! {
741 /// **What it does:** Checks for the use of `.extend(s.chars())` where s is a
742 /// `&str` or `String`.
744 /// **Why is this bad?** `.push_str(s)` is clearer
746 /// **Known problems:** None.
751 /// let def = String::from("def");
752 /// let mut s = String::new();
753 /// s.extend(abc.chars());
754 /// s.extend(def.chars());
756 /// The correct use would be:
759 /// let def = String::from("def");
760 /// let mut s = String::new();
762 /// s.push_str(&def);
764 pub STRING_EXTEND_CHARS,
766 "using `x.extend(s.chars())` where s is a `&str` or `String`"
769 declare_clippy_lint! {
770 /// **What it does:** Checks for the use of `.cloned().collect()` on slice to
773 /// **Why is this bad?** `.to_vec()` is clearer
775 /// **Known problems:** None.
779 /// let s = [1, 2, 3, 4, 5];
780 /// let s2: Vec<isize> = s[..].iter().cloned().collect();
782 /// The better use would be:
784 /// let s = [1, 2, 3, 4, 5];
785 /// let s2: Vec<isize> = s.to_vec();
787 pub ITER_CLONED_COLLECT,
789 "using `.cloned().collect()` on slice to create a `Vec`"
792 declare_clippy_lint! {
793 /// **What it does:** Checks for usage of `.chars().last()` or
794 /// `.chars().next_back()` on a `str` to check if it ends with a given char.
796 /// **Why is this bad?** Readability, this can be written more concisely as
797 /// `_.ends_with(_)`.
799 /// **Known problems:** None.
803 /// name.chars().last() == Some('_') || name.chars().next_back() == Some('-')
807 "using `.chars().last()` or `.chars().next_back()` to check if a string ends with a char"
810 declare_clippy_lint! {
811 /// **What it does:** Checks for usage of `.as_ref()` or `.as_mut()` where the
812 /// types before and after the call are the same.
814 /// **Why is this bad?** The call is unnecessary.
816 /// **Known problems:** None.
820 /// # fn do_stuff(x: &[i32]) {}
821 /// let x: &[i32] = &[1, 2, 3, 4, 5];
822 /// do_stuff(x.as_ref());
824 /// The correct use would be:
826 /// # fn do_stuff(x: &[i32]) {}
827 /// let x: &[i32] = &[1, 2, 3, 4, 5];
832 "using `as_ref` where the types before and after the call are the same"
835 declare_clippy_lint! {
836 /// **What it does:** Checks for using `fold` when a more succinct alternative exists.
837 /// Specifically, this checks for `fold`s which could be replaced by `any`, `all`,
838 /// `sum` or `product`.
840 /// **Why is this bad?** Readability.
842 /// **Known problems:** False positive in pattern guards. Will be resolved once
843 /// non-lexical lifetimes are stable.
847 /// let _ = (0..3).fold(false, |acc, x| acc || x > 2);
849 /// This could be written as:
851 /// let _ = (0..3).any(|x| x > 2);
853 pub UNNECESSARY_FOLD,
855 "using `fold` when a more succinct alternative exists"
858 declare_clippy_lint! {
859 /// **What it does:** Checks for `filter_map` calls which could be replaced by `filter` or `map`.
860 /// More specifically it checks if the closure provided is only performing one of the
861 /// filter or map operations and suggests the appropriate option.
863 /// **Why is this bad?** Complexity. The intent is also clearer if only a single
864 /// operation is being performed.
866 /// **Known problems:** None
870 /// let _ = (0..3).filter_map(|x| if x > 2 { Some(x) } else { None });
872 /// As there is no transformation of the argument this could be written as:
874 /// let _ = (0..3).filter(|&x| x > 2);
878 /// let _ = (0..4).filter_map(i32::checked_abs);
880 /// As there is no conditional check on the argument this could be written as:
882 /// let _ = (0..4).map(i32::checked_abs);
884 pub UNNECESSARY_FILTER_MAP,
886 "using `filter_map` when a more succinct alternative exists"
889 declare_clippy_lint! {
890 /// **What it does:** Checks for `into_iter` calls on types which should be replaced by `iter` or
893 /// **Why is this bad?** Arrays and `PathBuf` do not yet have an `into_iter` method which move out
894 /// their content into an iterator. Auto-referencing resolves the `into_iter` call to its reference
895 /// instead, like `<&[T; N] as IntoIterator>::into_iter`, which just iterates over item references
896 /// like calling `iter` would. Furthermore, when the standard library actually
897 /// [implements the `into_iter` method](https://github.com/rust-lang/rust/issues/25725) which moves
898 /// the content out of the array, the original use of `into_iter` got inferred with the wrong type
899 /// and the code will be broken.
901 /// **Known problems:** None
906 /// let _ = [1, 2, 3].into_iter().map(|x| *x).collect::<Vec<u32>>();
908 /// Could be written as:
910 /// let _ = [1, 2, 3].iter().map(|x| *x).collect::<Vec<u32>>();
912 pub INTO_ITER_ON_ARRAY,
914 "using `.into_iter()` on an array"
917 declare_clippy_lint! {
918 /// **What it does:** Checks for `into_iter` calls on references which should be replaced by `iter`
921 /// **Why is this bad?** Readability. Calling `into_iter` on a reference will not move out its
922 /// content into the resulting iterator, which is confusing. It is better just call `iter` or
923 /// `iter_mut` directly.
925 /// **Known problems:** None
930 /// let _ = (&vec![3, 4, 5]).into_iter();
932 pub INTO_ITER_ON_REF,
934 "using `.into_iter()` on a reference"
937 declare_clippy_lint! {
938 /// **What it does:** Checks for calls to `map` followed by a `count`.
940 /// **Why is this bad?** It looks suspicious. Maybe `map` was confused with `filter`.
941 /// If the `map` call is intentional, this should be rewritten.
943 /// **Known problems:** None
948 /// let _ = (0..3).map(|x| x + 2).count();
952 "suspicious usage of map"
955 declare_clippy_lint! {
956 /// **What it does:** Checks for `MaybeUninit::uninit().assume_init()`.
958 /// **Why is this bad?** For most types, this is undefined behavior.
960 /// **Known problems:** For now, we accept empty tuples and tuples / arrays
961 /// of `MaybeUninit`. There may be other types that allow uninitialized
962 /// data, but those are not yet rigorously defined.
968 /// use std::mem::MaybeUninit;
970 /// let _: usize = unsafe { MaybeUninit::uninit().assume_init() };
973 /// Note that the following is OK:
976 /// use std::mem::MaybeUninit;
978 /// let _: [MaybeUninit<bool>; 5] = unsafe {
979 /// MaybeUninit::uninit().assume_init()
982 pub UNINIT_ASSUMED_INIT,
984 "`MaybeUninit::uninit().assume_init()`"
987 declare_clippy_lint! {
988 /// **What it does:** Checks for `.checked_add/sub(x).unwrap_or(MAX/MIN)`.
990 /// **Why is this bad?** These can be written simply with `saturating_add/sub` methods.
995 /// # let y: u32 = 0;
996 /// # let x: u32 = 100;
997 /// let add = x.checked_add(y).unwrap_or(u32::max_value());
998 /// let sub = x.checked_sub(y).unwrap_or(u32::min_value());
1001 /// can be written using dedicated methods for saturating addition/subtraction as:
1004 /// # let y: u32 = 0;
1005 /// # let x: u32 = 100;
1006 /// let add = x.saturating_add(y);
1007 /// let sub = x.saturating_sub(y);
1009 pub MANUAL_SATURATING_ARITHMETIC,
1011 "`.chcked_add/sub(x).unwrap_or(MAX/MIN)`"
1014 declare_lint_pass!(Methods => [
1017 SHOULD_IMPLEMENT_TRAIT,
1018 WRONG_SELF_CONVENTION,
1019 WRONG_PUB_SELF_CONVENTION,
1021 OPTION_MAP_UNWRAP_OR,
1022 OPTION_MAP_UNWRAP_OR_ELSE,
1023 RESULT_MAP_UNWRAP_OR_ELSE,
1025 OPTION_AND_THEN_SOME,
1034 SINGLE_CHAR_PATTERN,
1036 TEMPORARY_CSTRING_AS_PTR,
1046 STRING_EXTEND_CHARS,
1047 ITER_CLONED_COLLECT,
1050 UNNECESSARY_FILTER_MAP,
1054 UNINIT_ASSUMED_INIT,
1055 MANUAL_SATURATING_ARITHMETIC,
1058 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for Methods {
1059 #[allow(clippy::cognitive_complexity)]
1060 fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, expr: &'tcx hir::Expr) {
1061 if in_macro(expr.span) {
1065 let (method_names, arg_lists, method_spans) = method_calls(expr, 2);
1066 let method_names: Vec<LocalInternedString> = method_names.iter().map(|s| s.as_str()).collect();
1067 let method_names: Vec<&str> = method_names.iter().map(std::convert::AsRef::as_ref).collect();
1069 match method_names.as_slice() {
1070 ["unwrap", "get"] => lint_get_unwrap(cx, expr, arg_lists[1], false),
1071 ["unwrap", "get_mut"] => lint_get_unwrap(cx, expr, arg_lists[1], true),
1072 ["unwrap", ..] => lint_unwrap(cx, expr, arg_lists[0]),
1073 ["expect", "ok"] => lint_ok_expect(cx, expr, arg_lists[1]),
1074 ["unwrap_or", "map"] => option_map_unwrap_or::lint(cx, expr, arg_lists[1], arg_lists[0]),
1075 ["unwrap_or_else", "map"] => lint_map_unwrap_or_else(cx, expr, arg_lists[1], arg_lists[0]),
1076 ["map_or", ..] => lint_map_or_none(cx, expr, arg_lists[0]),
1077 ["and_then", ..] => lint_option_and_then_some(cx, expr, arg_lists[0]),
1078 ["next", "filter"] => lint_filter_next(cx, expr, arg_lists[1]),
1079 ["map", "filter"] => lint_filter_map(cx, expr, arg_lists[1], arg_lists[0]),
1080 ["map", "filter_map"] => lint_filter_map_map(cx, expr, arg_lists[1], arg_lists[0]),
1081 ["next", "filter_map"] => lint_filter_map_next(cx, expr, arg_lists[1]),
1082 ["map", "find"] => lint_find_map(cx, expr, arg_lists[1], arg_lists[0]),
1083 ["flat_map", "filter"] => lint_filter_flat_map(cx, expr, arg_lists[1], arg_lists[0]),
1084 ["flat_map", "filter_map"] => lint_filter_map_flat_map(cx, expr, arg_lists[1], arg_lists[0]),
1085 ["flat_map", ..] => lint_flat_map_identity(cx, expr, arg_lists[0], method_spans[0]),
1086 ["flatten", "map"] => lint_map_flatten(cx, expr, arg_lists[1]),
1087 ["is_some", "find"] => lint_search_is_some(cx, expr, "find", arg_lists[1], arg_lists[0], method_spans[1]),
1088 ["is_some", "position"] => {
1089 lint_search_is_some(cx, expr, "position", arg_lists[1], arg_lists[0], method_spans[1])
1091 ["is_some", "rposition"] => {
1092 lint_search_is_some(cx, expr, "rposition", arg_lists[1], arg_lists[0], method_spans[1])
1094 ["extend", ..] => lint_extend(cx, expr, arg_lists[0]),
1095 ["as_ptr", "unwrap"] | ["as_ptr", "expect"] => {
1096 lint_cstring_as_ptr(cx, expr, &arg_lists[1][0], &arg_lists[0][0])
1098 ["nth", "iter"] => lint_iter_nth(cx, expr, arg_lists[1], false),
1099 ["nth", "iter_mut"] => lint_iter_nth(cx, expr, arg_lists[1], true),
1100 ["next", "skip"] => lint_iter_skip_next(cx, expr),
1101 ["collect", "cloned"] => lint_iter_cloned_collect(cx, expr, arg_lists[1]),
1102 ["as_ref"] => lint_asref(cx, expr, "as_ref", arg_lists[0]),
1103 ["as_mut"] => lint_asref(cx, expr, "as_mut", arg_lists[0]),
1104 ["fold", ..] => lint_unnecessary_fold(cx, expr, arg_lists[0], method_spans[0]),
1105 ["filter_map", ..] => unnecessary_filter_map::lint(cx, expr, arg_lists[0]),
1106 ["count", "map"] => lint_suspicious_map(cx, expr),
1107 ["assume_init"] => lint_maybe_uninit(cx, &arg_lists[0][0], expr),
1108 ["unwrap_or", arith @ "checked_add"]
1109 | ["unwrap_or", arith @ "checked_sub"]
1110 | ["unwrap_or", arith @ "checked_mul"] => {
1111 manual_saturating_arithmetic::lint(cx, expr, &arg_lists, &arith["checked_".len()..])
1117 hir::ExprKind::MethodCall(ref method_call, ref method_span, ref args) => {
1118 lint_or_fun_call(cx, expr, *method_span, &method_call.ident.as_str(), args);
1119 lint_expect_fun_call(cx, expr, *method_span, &method_call.ident.as_str(), args);
1121 let self_ty = cx.tables.expr_ty_adjusted(&args[0]);
1122 if args.len() == 1 && method_call.ident.name == sym!(clone) {
1123 lint_clone_on_copy(cx, expr, &args[0], self_ty);
1124 lint_clone_on_ref_ptr(cx, expr, &args[0]);
1128 ty::Ref(_, ty, _) if ty.sty == ty::Str => {
1129 for &(method, pos) in &PATTERN_METHODS {
1130 if method_call.ident.name.as_str() == method && args.len() > pos {
1131 lint_single_char_pattern(cx, expr, &args[pos]);
1135 ty::Ref(..) if method_call.ident.name == sym!(into_iter) => {
1136 lint_into_iter(cx, expr, self_ty, *method_span);
1141 hir::ExprKind::Binary(op, ref lhs, ref rhs)
1142 if op.node == hir::BinOpKind::Eq || op.node == hir::BinOpKind::Ne =>
1144 let mut info = BinaryExprInfo {
1148 eq: op.node == hir::BinOpKind::Eq,
1150 lint_binary_expr_with_method_call(cx, &mut info);
1156 fn check_impl_item(&mut self, cx: &LateContext<'a, 'tcx>, impl_item: &'tcx hir::ImplItem) {
1157 if in_external_macro(cx.sess(), impl_item.span) {
1160 let name = impl_item.ident.name.as_str();
1161 let parent = cx.tcx.hir().get_parent_item(impl_item.hir_id);
1162 let item = cx.tcx.hir().expect_item(parent);
1163 let def_id = cx.tcx.hir().local_def_id(item.hir_id);
1164 let ty = cx.tcx.type_of(def_id);
1166 if let hir::ImplItemKind::Method(ref sig, id) = impl_item.node;
1167 if let Some(first_arg) = iter_input_pats(&sig.decl, cx.tcx.hir().body(id)).next();
1168 if let hir::ItemKind::Impl(_, _, _, _, None, _, _) = item.node;
1170 let method_def_id = cx.tcx.hir().local_def_id(impl_item.hir_id);
1171 let method_sig = cx.tcx.fn_sig(method_def_id);
1172 let method_sig = cx.tcx.erase_late_bound_regions(&method_sig);
1174 let first_arg_ty = &method_sig.inputs().iter().next();
1176 // check conventions w.r.t. conversion method names and predicates
1177 if let Some(first_arg_ty) = first_arg_ty;
1180 if cx.access_levels.is_exported(impl_item.hir_id) {
1181 // check missing trait implementations
1182 for &(method_name, n_args, self_kind, out_type, trait_name) in &TRAIT_METHODS {
1183 if name == method_name &&
1184 sig.decl.inputs.len() == n_args &&
1185 out_type.matches(cx, &sig.decl.output) &&
1186 self_kind.matches(cx, ty, first_arg_ty) {
1187 span_lint(cx, SHOULD_IMPLEMENT_TRAIT, impl_item.span, &format!(
1188 "defining a method called `{}` on this type; consider implementing \
1189 the `{}` trait or choosing a less ambiguous name", name, trait_name));
1194 if let Some((ref conv, self_kinds)) = &CONVENTIONS
1196 .find(|(ref conv, _)| conv.check(&name))
1198 if !self_kinds.iter().any(|k| k.matches(cx, ty, first_arg_ty)) {
1199 let lint = if item.vis.node.is_pub() {
1200 WRONG_PUB_SELF_CONVENTION
1202 WRONG_SELF_CONVENTION
1210 "methods called `{}` usually take {}; consider choosing a less \
1215 .map(|k| k.description())
1216 .collect::<Vec<_>>()
1225 if let hir::ImplItemKind::Method(_, _) = impl_item.node {
1226 let ret_ty = return_ty(cx, impl_item.hir_id);
1228 // walk the return type and check for Self (this does not check associated types)
1229 if ret_ty.walk().any(|inner_type| same_tys(cx, ty, inner_type)) {
1233 // if return type is impl trait, check the associated types
1234 if let ty::Opaque(def_id, _) = ret_ty.sty {
1235 // one of the associated types must be Self
1236 for predicate in &cx.tcx.predicates_of(def_id).predicates {
1238 (Predicate::Projection(poly_projection_predicate), _) => {
1239 let binder = poly_projection_predicate.ty();
1240 let associated_type = binder.skip_binder();
1242 // walk the associated type and check for Self
1243 for inner_type in associated_type.walk() {
1244 if same_tys(cx, ty, inner_type) {
1254 if name == "new" && !same_tys(cx, ret_ty, ty) {
1259 "methods called `new` usually return `Self`",
1266 /// Checks for the `OR_FUN_CALL` lint.
1267 #[allow(clippy::too_many_lines)]
1268 fn lint_or_fun_call<'a, 'tcx>(
1269 cx: &LateContext<'a, 'tcx>,
1273 args: &'tcx [hir::Expr],
1275 // Searches an expression for method calls or function calls that aren't ctors
1276 struct FunCallFinder<'a, 'tcx> {
1277 cx: &'a LateContext<'a, 'tcx>,
1281 impl<'a, 'tcx> intravisit::Visitor<'tcx> for FunCallFinder<'a, 'tcx> {
1282 fn visit_expr(&mut self, expr: &'tcx hir::Expr) {
1283 let call_found = match &expr.node {
1284 // ignore enum and struct constructors
1285 hir::ExprKind::Call(..) => !is_ctor_function(self.cx, expr),
1286 hir::ExprKind::MethodCall(..) => true,
1291 // don't lint for constant values
1292 let owner_def = self.cx.tcx.hir().get_parent_did(expr.hir_id);
1293 let promotable = self
1296 .rvalue_promotable_map(owner_def)
1297 .contains(&expr.hir_id.local_id);
1304 intravisit::walk_expr(self, expr);
1308 fn nested_visit_map<'this>(&'this mut self) -> intravisit::NestedVisitorMap<'this, 'tcx> {
1309 intravisit::NestedVisitorMap::None
1313 /// Checks for `unwrap_or(T::new())` or `unwrap_or(T::default())`.
1314 fn check_unwrap_or_default(
1315 cx: &LateContext<'_, '_>,
1318 self_expr: &hir::Expr,
1325 if name == "unwrap_or";
1326 if let hir::ExprKind::Path(ref qpath) = fun.node;
1327 let path = &*last_path_segment(qpath).ident.as_str();
1328 if ["default", "new"].contains(&path);
1329 let arg_ty = cx.tables.expr_ty(arg);
1330 if let Some(default_trait_id) = get_trait_def_id(cx, &paths::DEFAULT_TRAIT);
1331 if implements_trait(cx, arg_ty, default_trait_id, &[]);
1334 let mut applicability = Applicability::MachineApplicable;
1339 &format!("use of `{}` followed by a call to `{}`", name, path),
1342 "{}.unwrap_or_default()",
1343 snippet_with_applicability(cx, self_expr.span, "_", &mut applicability)
1355 /// Checks for `*or(foo())`.
1356 #[allow(clippy::too_many_arguments)]
1357 fn check_general_case<'a, 'tcx>(
1358 cx: &LateContext<'a, 'tcx>,
1362 self_expr: &hir::Expr,
1363 arg: &'tcx hir::Expr,
1367 // (path, fn_has_argument, methods, suffix)
1368 let know_types: &[(&[_], _, &[_], _)] = &[
1369 (&paths::BTREEMAP_ENTRY, false, &["or_insert"], "with"),
1370 (&paths::HASHMAP_ENTRY, false, &["or_insert"], "with"),
1371 (&paths::OPTION, false, &["map_or", "ok_or", "or", "unwrap_or"], "else"),
1372 (&paths::RESULT, true, &["or", "unwrap_or"], "else"),
1376 if know_types.iter().any(|k| k.2.contains(&name));
1378 let mut finder = FunCallFinder { cx: &cx, found: false };
1379 if { finder.visit_expr(&arg); finder.found };
1381 let self_ty = cx.tables.expr_ty(self_expr);
1383 if let Some(&(_, fn_has_arguments, poss, suffix)) =
1384 know_types.iter().find(|&&i| match_type(cx, self_ty, i.0));
1386 if poss.contains(&name);
1389 let sugg: Cow<'_, _> = match (fn_has_arguments, !or_has_args) {
1390 (true, _) => format!("|_| {}", snippet_with_macro_callsite(cx, arg.span, "..")).into(),
1391 (false, false) => format!("|| {}", snippet_with_macro_callsite(cx, arg.span, "..")).into(),
1392 (false, true) => snippet_with_macro_callsite(cx, fun_span, ".."),
1394 let span_replace_word = method_span.with_hi(span.hi());
1399 &format!("use of `{}` followed by a function call", name),
1401 format!("{}_{}({})", name, suffix, sugg),
1402 Applicability::HasPlaceholders,
1408 if args.len() == 2 {
1409 match args[1].node {
1410 hir::ExprKind::Call(ref fun, ref or_args) => {
1411 let or_has_args = !or_args.is_empty();
1412 if !check_unwrap_or_default(cx, name, fun, &args[0], &args[1], or_has_args, expr.span) {
1425 hir::ExprKind::MethodCall(_, span, ref or_args) => check_general_case(
1432 !or_args.is_empty(),
1440 /// Checks for the `EXPECT_FUN_CALL` lint.
1441 #[allow(clippy::too_many_lines)]
1442 fn lint_expect_fun_call(cx: &LateContext<'_, '_>, expr: &hir::Expr, method_span: Span, name: &str, args: &[hir::Expr]) {
1443 // Strip `&`, `as_ref()` and `as_str()` off `arg` until we're left with either a `String` or
1445 fn get_arg_root<'a>(cx: &LateContext<'_, '_>, arg: &'a hir::Expr) -> &'a hir::Expr {
1446 let mut arg_root = arg;
1448 arg_root = match &arg_root.node {
1449 hir::ExprKind::AddrOf(_, expr) => expr,
1450 hir::ExprKind::MethodCall(method_name, _, call_args) => {
1451 if call_args.len() == 1
1452 && (method_name.ident.name == sym!(as_str) || method_name.ident.name == sym!(as_ref))
1454 let arg_type = cx.tables.expr_ty(&call_args[0]);
1455 let base_type = walk_ptrs_ty(arg_type);
1456 base_type.sty == ty::Str || match_type(cx, base_type, &paths::STRING)
1470 // Only `&'static str` or `String` can be used directly in the `panic!`. Other types should be
1471 // converted to string.
1472 fn requires_to_string(cx: &LateContext<'_, '_>, arg: &hir::Expr) -> bool {
1473 let arg_ty = cx.tables.expr_ty(arg);
1474 if match_type(cx, arg_ty, &paths::STRING) {
1477 if let ty::Ref(ty::ReStatic, ty, ..) = arg_ty.sty {
1478 if ty.sty == ty::Str {
1485 fn generate_format_arg_snippet(
1486 cx: &LateContext<'_, '_>,
1488 applicability: &mut Applicability,
1491 if let hir::ExprKind::AddrOf(_, ref format_arg) = a.node;
1492 if let hir::ExprKind::Match(ref format_arg_expr, _, _) = format_arg.node;
1493 if let hir::ExprKind::Tup(ref format_arg_expr_tup) = format_arg_expr.node;
1498 .map(|a| snippet_with_applicability(cx, a.span, "..", applicability).into_owned())
1506 fn is_call(node: &hir::ExprKind) -> bool {
1508 hir::ExprKind::AddrOf(_, expr) => {
1511 hir::ExprKind::Call(..)
1512 | hir::ExprKind::MethodCall(..)
1513 // These variants are debatable or require further examination
1514 | hir::ExprKind::Match(..)
1515 | hir::ExprKind::Block{ .. } => true,
1520 if args.len() != 2 || name != "expect" || !is_call(&args[1].node) {
1524 let receiver_type = cx.tables.expr_ty(&args[0]);
1525 let closure_args = if match_type(cx, receiver_type, &paths::OPTION) {
1527 } else if match_type(cx, receiver_type, &paths::RESULT) {
1533 let arg_root = get_arg_root(cx, &args[1]);
1535 let span_replace_word = method_span.with_hi(expr.span.hi());
1537 let mut applicability = Applicability::MachineApplicable;
1539 //Special handling for `format!` as arg_root
1540 if let hir::ExprKind::Call(ref inner_fun, ref inner_args) = arg_root.node {
1541 if is_expn_of(inner_fun.span, "format").is_some() && inner_args.len() == 1 {
1542 if let hir::ExprKind::Call(_, format_args) = &inner_args[0].node {
1543 let fmt_spec = &format_args[0];
1544 let fmt_args = &format_args[1];
1546 let mut args = vec![snippet(cx, fmt_spec.span, "..").into_owned()];
1548 args.extend(generate_format_arg_snippet(cx, fmt_args, &mut applicability));
1550 let sugg = args.join(", ");
1556 &format!("use of `{}` followed by a function call", name),
1558 format!("unwrap_or_else({} panic!({}))", closure_args, sugg),
1567 let mut arg_root_snippet: Cow<'_, _> = snippet_with_applicability(cx, arg_root.span, "..", &mut applicability);
1568 if requires_to_string(cx, arg_root) {
1569 arg_root_snippet.to_mut().push_str(".to_string()");
1576 &format!("use of `{}` followed by a function call", name),
1578 format!("unwrap_or_else({} {{ panic!({}) }})", closure_args, arg_root_snippet),
1583 /// Checks for the `CLONE_ON_COPY` lint.
1584 fn lint_clone_on_copy(cx: &LateContext<'_, '_>, expr: &hir::Expr, arg: &hir::Expr, arg_ty: Ty<'_>) {
1585 let ty = cx.tables.expr_ty(expr);
1586 if let ty::Ref(_, inner, _) = arg_ty.sty {
1587 if let ty::Ref(_, innermost, _) = inner.sty {
1592 "using `clone` on a double-reference; \
1593 this will copy the reference instead of cloning the inner type",
1595 if let Some(snip) = sugg::Sugg::hir_opt(cx, arg) {
1596 let mut ty = innermost;
1598 while let ty::Ref(_, inner, _) = ty.sty {
1602 let refs: String = iter::repeat('&').take(n + 1).collect();
1603 let derefs: String = iter::repeat('*').take(n).collect();
1604 let explicit = format!("{}{}::clone({})", refs, ty, snip);
1607 "try dereferencing it",
1608 format!("{}({}{}).clone()", refs, derefs, snip.deref()),
1609 Applicability::MaybeIncorrect,
1613 "or try being explicit about what type to clone",
1615 Applicability::MaybeIncorrect,
1620 return; // don't report clone_on_copy
1624 if is_copy(cx, ty) {
1626 if let Some(snippet) = sugg::Sugg::hir_opt(cx, arg) {
1627 let parent = cx.tcx.hir().get_parent_node(expr.hir_id);
1628 match &cx.tcx.hir().get(parent) {
1629 hir::Node::Expr(parent) => match parent.node {
1630 // &*x is a nop, &x.clone() is not
1631 hir::ExprKind::AddrOf(..) |
1632 // (*x).func() is useless, x.clone().func() can work in case func borrows mutably
1633 hir::ExprKind::MethodCall(..) => return,
1636 hir::Node::Stmt(stmt) => {
1637 if let hir::StmtKind::Local(ref loc) = stmt.node {
1638 if let hir::PatKind::Ref(..) = loc.pat.node {
1639 // let ref y = *x borrows x, let ref y = x.clone() does not
1647 // x.clone() might have dereferenced x, possibly through Deref impls
1648 if cx.tables.expr_ty(arg) == ty {
1649 snip = Some(("try removing the `clone` call", format!("{}", snippet)));
1651 let deref_count = cx
1653 .expr_adjustments(arg)
1656 if let ty::adjustment::Adjust::Deref(_) = adj.kind {
1663 let derefs: String = iter::repeat('*').take(deref_count).collect();
1664 snip = Some(("try dereferencing it", format!("{}{}", derefs, snippet)));
1669 span_lint_and_then(cx, CLONE_ON_COPY, expr.span, "using `clone` on a `Copy` type", |db| {
1670 if let Some((text, snip)) = snip {
1671 db.span_suggestion(expr.span, text, snip, Applicability::Unspecified);
1677 fn lint_clone_on_ref_ptr(cx: &LateContext<'_, '_>, expr: &hir::Expr, arg: &hir::Expr) {
1678 let obj_ty = walk_ptrs_ty(cx.tables.expr_ty(arg));
1680 if let ty::Adt(_, subst) = obj_ty.sty {
1681 let caller_type = if match_type(cx, obj_ty, &paths::RC) {
1683 } else if match_type(cx, obj_ty, &paths::ARC) {
1685 } else if match_type(cx, obj_ty, &paths::WEAK_RC) || match_type(cx, obj_ty, &paths::WEAK_ARC) {
1695 "using '.clone()' on a ref-counted pointer",
1698 "{}::<{}>::clone(&{})",
1701 snippet(cx, arg.span, "_")
1703 Applicability::Unspecified, // Sometimes unnecessary ::<_> after Rc/Arc/Weak
1708 fn lint_string_extend(cx: &LateContext<'_, '_>, expr: &hir::Expr, args: &[hir::Expr]) {
1710 if let Some(arglists) = method_chain_args(arg, &["chars"]) {
1711 let target = &arglists[0][0];
1712 let self_ty = walk_ptrs_ty(cx.tables.expr_ty(target));
1713 let ref_str = if self_ty.sty == ty::Str {
1715 } else if match_type(cx, self_ty, &paths::STRING) {
1721 let mut applicability = Applicability::MachineApplicable;
1724 STRING_EXTEND_CHARS,
1726 "calling `.extend(_.chars())`",
1729 "{}.push_str({}{})",
1730 snippet_with_applicability(cx, args[0].span, "_", &mut applicability),
1732 snippet_with_applicability(cx, target.span, "_", &mut applicability)
1739 fn lint_extend(cx: &LateContext<'_, '_>, expr: &hir::Expr, args: &[hir::Expr]) {
1740 let obj_ty = walk_ptrs_ty(cx.tables.expr_ty(&args[0]));
1741 if match_type(cx, obj_ty, &paths::STRING) {
1742 lint_string_extend(cx, expr, args);
1746 fn lint_cstring_as_ptr(cx: &LateContext<'_, '_>, expr: &hir::Expr, source: &hir::Expr, unwrap: &hir::Expr) {
1748 let source_type = cx.tables.expr_ty(source);
1749 if let ty::Adt(def, substs) = source_type.sty;
1750 if match_def_path(cx, def.did, &paths::RESULT);
1751 if match_type(cx, substs.type_at(0), &paths::CSTRING);
1755 TEMPORARY_CSTRING_AS_PTR,
1757 "you are getting the inner pointer of a temporary `CString`",
1759 db.note("that pointer will be invalid outside this expression");
1760 db.span_help(unwrap.span, "assign the `CString` to a variable to extend its lifetime");
1766 fn lint_iter_cloned_collect<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, expr: &hir::Expr, iter_args: &'tcx [hir::Expr]) {
1768 if match_type(cx, cx.tables.expr_ty(expr), &paths::VEC);
1769 if let Some(slice) = derefs_to_slice(cx, &iter_args[0], cx.tables.expr_ty(&iter_args[0]));
1770 if let Some(to_replace) = expr.span.trim_start(slice.span.source_callsite());
1775 ITER_CLONED_COLLECT,
1777 "called `iter().cloned().collect()` on a slice to create a `Vec`. Calling `to_vec()` is both faster and \
1780 ".to_vec()".to_string(),
1781 Applicability::MachineApplicable,
1787 fn lint_unnecessary_fold(cx: &LateContext<'_, '_>, expr: &hir::Expr, fold_args: &[hir::Expr], fold_span: Span) {
1788 fn check_fold_with_op(
1789 cx: &LateContext<'_, '_>,
1791 fold_args: &[hir::Expr],
1794 replacement_method_name: &str,
1795 replacement_has_args: bool,
1798 // Extract the body of the closure passed to fold
1799 if let hir::ExprKind::Closure(_, _, body_id, _, _) = fold_args[2].node;
1800 let closure_body = cx.tcx.hir().body(body_id);
1801 let closure_expr = remove_blocks(&closure_body.value);
1803 // Check if the closure body is of the form `acc <op> some_expr(x)`
1804 if let hir::ExprKind::Binary(ref bin_op, ref left_expr, ref right_expr) = closure_expr.node;
1805 if bin_op.node == op;
1807 // Extract the names of the two arguments to the closure
1808 if let Some(first_arg_ident) = get_arg_name(&closure_body.params[0].pat);
1809 if let Some(second_arg_ident) = get_arg_name(&closure_body.params[1].pat);
1811 if match_var(&*left_expr, first_arg_ident);
1812 if replacement_has_args || match_var(&*right_expr, second_arg_ident);
1815 let mut applicability = Applicability::MachineApplicable;
1816 let sugg = if replacement_has_args {
1818 "{replacement}(|{s}| {r})",
1819 replacement = replacement_method_name,
1820 s = second_arg_ident,
1821 r = snippet_with_applicability(cx, right_expr.span, "EXPR", &mut applicability),
1826 replacement = replacement_method_name,
1833 fold_span.with_hi(expr.span.hi()),
1834 // TODO #2371 don't suggest e.g., .any(|x| f(x)) if we can suggest .any(f)
1835 "this `.fold` can be written more succinctly using another method",
1844 // Check that this is a call to Iterator::fold rather than just some function called fold
1845 if !match_trait_method(cx, expr, &paths::ITERATOR) {
1850 fold_args.len() == 3,
1851 "Expected fold_args to have three entries - the receiver, the initial value and the closure"
1854 // Check if the first argument to .fold is a suitable literal
1855 if let hir::ExprKind::Lit(ref lit) = fold_args[1].node {
1857 ast::LitKind::Bool(false) => {
1858 check_fold_with_op(cx, expr, fold_args, fold_span, hir::BinOpKind::Or, "any", true)
1860 ast::LitKind::Bool(true) => {
1861 check_fold_with_op(cx, expr, fold_args, fold_span, hir::BinOpKind::And, "all", true)
1863 ast::LitKind::Int(0, _) => {
1864 check_fold_with_op(cx, expr, fold_args, fold_span, hir::BinOpKind::Add, "sum", false)
1866 ast::LitKind::Int(1, _) => {
1867 check_fold_with_op(cx, expr, fold_args, fold_span, hir::BinOpKind::Mul, "product", false)
1874 fn lint_iter_nth<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, expr: &hir::Expr, iter_args: &'tcx [hir::Expr], is_mut: bool) {
1875 let mut_str = if is_mut { "_mut" } else { "" };
1876 let caller_type = if derefs_to_slice(cx, &iter_args[0], cx.tables.expr_ty(&iter_args[0])).is_some() {
1878 } else if match_type(cx, cx.tables.expr_ty(&iter_args[0]), &paths::VEC) {
1880 } else if match_type(cx, cx.tables.expr_ty(&iter_args[0]), &paths::VEC_DEQUE) {
1883 return; // caller is not a type that we want to lint
1891 "called `.iter{0}().nth()` on a {1}. Calling `.get{0}()` is both faster and more readable",
1892 mut_str, caller_type
1897 fn lint_get_unwrap<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, expr: &hir::Expr, get_args: &'tcx [hir::Expr], is_mut: bool) {
1898 // Note: we don't want to lint `get_mut().unwrap` for HashMap or BTreeMap,
1899 // because they do not implement `IndexMut`
1900 let mut applicability = Applicability::MachineApplicable;
1901 let expr_ty = cx.tables.expr_ty(&get_args[0]);
1902 let get_args_str = if get_args.len() > 1 {
1903 snippet_with_applicability(cx, get_args[1].span, "_", &mut applicability)
1905 return; // not linting on a .get().unwrap() chain or variant
1908 let caller_type = if derefs_to_slice(cx, &get_args[0], expr_ty).is_some() {
1909 needs_ref = get_args_str.parse::<usize>().is_ok();
1911 } else if match_type(cx, expr_ty, &paths::VEC) {
1912 needs_ref = get_args_str.parse::<usize>().is_ok();
1914 } else if match_type(cx, expr_ty, &paths::VEC_DEQUE) {
1915 needs_ref = get_args_str.parse::<usize>().is_ok();
1917 } else if !is_mut && match_type(cx, expr_ty, &paths::HASHMAP) {
1920 } else if !is_mut && match_type(cx, expr_ty, &paths::BTREEMAP) {
1924 return; // caller is not a type that we want to lint
1927 let mut span = expr.span;
1929 // Handle the case where the result is immediately dereferenced
1930 // by not requiring ref and pulling the dereference into the
1934 if let Some(parent) = get_parent_expr(cx, expr);
1935 if let hir::ExprKind::Unary(hir::UnOp::UnDeref, _) = parent.node;
1942 let mut_str = if is_mut { "_mut" } else { "" };
1943 let borrow_str = if !needs_ref {
1956 "called `.get{0}().unwrap()` on a {1}. Using `[]` is more clear and more concise",
1957 mut_str, caller_type
1963 snippet_with_applicability(cx, get_args[0].span, "_", &mut applicability),
1970 fn lint_iter_skip_next(cx: &LateContext<'_, '_>, expr: &hir::Expr) {
1971 // lint if caller of skip is an Iterator
1972 if match_trait_method(cx, expr, &paths::ITERATOR) {
1977 "called `skip(x).next()` on an iterator. This is more succinctly expressed by calling `nth(x)`",
1982 fn derefs_to_slice<'a, 'tcx>(
1983 cx: &LateContext<'a, 'tcx>,
1984 expr: &'tcx hir::Expr,
1986 ) -> Option<&'tcx hir::Expr> {
1987 fn may_slice<'a>(cx: &LateContext<'_, 'a>, ty: Ty<'a>) -> bool {
1989 ty::Slice(_) => true,
1990 ty::Adt(def, _) if def.is_box() => may_slice(cx, ty.boxed_ty()),
1991 ty::Adt(..) => match_type(cx, ty, &paths::VEC),
1992 ty::Array(_, size) => size.eval_usize(cx.tcx, cx.param_env) < 32,
1993 ty::Ref(_, inner, _) => may_slice(cx, inner),
1998 if let hir::ExprKind::MethodCall(ref path, _, ref args) = expr.node {
1999 if path.ident.name == sym!(iter) && may_slice(cx, cx.tables.expr_ty(&args[0])) {
2006 ty::Slice(_) => Some(expr),
2007 ty::Adt(def, _) if def.is_box() && may_slice(cx, ty.boxed_ty()) => Some(expr),
2008 ty::Ref(_, inner, _) => {
2009 if may_slice(cx, inner) {
2020 /// lint use of `unwrap()` for `Option`s and `Result`s
2021 fn lint_unwrap(cx: &LateContext<'_, '_>, expr: &hir::Expr, unwrap_args: &[hir::Expr]) {
2022 let obj_ty = walk_ptrs_ty(cx.tables.expr_ty(&unwrap_args[0]));
2024 let mess = if match_type(cx, obj_ty, &paths::OPTION) {
2025 Some((OPTION_UNWRAP_USED, "an Option", "None"))
2026 } else if match_type(cx, obj_ty, &paths::RESULT) {
2027 Some((RESULT_UNWRAP_USED, "a Result", "Err"))
2032 if let Some((lint, kind, none_value)) = mess {
2038 "used unwrap() on {} value. If you don't want to handle the {} case gracefully, consider \
2039 using expect() to provide a better panic \
2047 /// lint use of `ok().expect()` for `Result`s
2048 fn lint_ok_expect(cx: &LateContext<'_, '_>, expr: &hir::Expr, ok_args: &[hir::Expr]) {
2050 // lint if the caller of `ok()` is a `Result`
2051 if match_type(cx, cx.tables.expr_ty(&ok_args[0]), &paths::RESULT);
2052 let result_type = cx.tables.expr_ty(&ok_args[0]);
2053 if let Some(error_type) = get_error_type(cx, result_type);
2054 if has_debug_impl(error_type, cx);
2061 "called `ok().expect()` on a Result value. You can call `expect` directly on the `Result`",
2067 /// lint use of `map().flatten()` for `Iterators`
2068 fn lint_map_flatten<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, expr: &'tcx hir::Expr, map_args: &'tcx [hir::Expr]) {
2069 // lint if caller of `.map().flatten()` is an Iterator
2070 if match_trait_method(cx, expr, &paths::ITERATOR) {
2071 let msg = "called `map(..).flatten()` on an `Iterator`. \
2072 This is more succinctly expressed by calling `.flat_map(..)`";
2073 let self_snippet = snippet(cx, map_args[0].span, "..");
2074 let func_snippet = snippet(cx, map_args[1].span, "..");
2075 let hint = format!("{0}.flat_map({1})", self_snippet, func_snippet);
2076 span_lint_and_then(cx, MAP_FLATTEN, expr.span, msg, |db| {
2079 "try using flat_map instead",
2081 Applicability::MachineApplicable,
2087 /// lint use of `map().unwrap_or_else()` for `Option`s and `Result`s
2088 fn lint_map_unwrap_or_else<'a, 'tcx>(
2089 cx: &LateContext<'a, 'tcx>,
2090 expr: &'tcx hir::Expr,
2091 map_args: &'tcx [hir::Expr],
2092 unwrap_args: &'tcx [hir::Expr],
2094 // lint if the caller of `map()` is an `Option`
2095 let is_option = match_type(cx, cx.tables.expr_ty(&map_args[0]), &paths::OPTION);
2096 let is_result = match_type(cx, cx.tables.expr_ty(&map_args[0]), &paths::RESULT);
2098 if is_option || is_result {
2099 // Don't make a suggestion that may fail to compile due to mutably borrowing
2100 // the same variable twice.
2101 let map_mutated_vars = mutated_variables(&map_args[0], cx);
2102 let unwrap_mutated_vars = mutated_variables(&unwrap_args[1], cx);
2103 if let (Some(map_mutated_vars), Some(unwrap_mutated_vars)) = (map_mutated_vars, unwrap_mutated_vars) {
2104 if map_mutated_vars.intersection(&unwrap_mutated_vars).next().is_some() {
2112 let msg = if is_option {
2113 "called `map(f).unwrap_or_else(g)` on an Option value. This can be done more directly by calling \
2114 `map_or_else(g, f)` instead"
2116 "called `map(f).unwrap_or_else(g)` on a Result value. This can be done more directly by calling \
2117 `ok().map_or_else(g, f)` instead"
2119 // get snippets for args to map() and unwrap_or_else()
2120 let map_snippet = snippet(cx, map_args[1].span, "..");
2121 let unwrap_snippet = snippet(cx, unwrap_args[1].span, "..");
2122 // lint, with note if neither arg is > 1 line and both map() and
2123 // unwrap_or_else() have the same span
2124 let multiline = map_snippet.lines().count() > 1 || unwrap_snippet.lines().count() > 1;
2125 let same_span = map_args[1].span.ctxt() == unwrap_args[1].span.ctxt();
2126 if same_span && !multiline {
2130 OPTION_MAP_UNWRAP_OR_ELSE
2132 RESULT_MAP_UNWRAP_OR_ELSE
2138 "replace `map({0}).unwrap_or_else({1})` with `{2}map_or_else({1}, {0})`",
2141 if is_result { "ok()." } else { "" }
2144 } else if same_span && multiline {
2148 OPTION_MAP_UNWRAP_OR_ELSE
2150 RESULT_MAP_UNWRAP_OR_ELSE
2159 /// lint use of `_.map_or(None, _)` for `Option`s
2160 fn lint_map_or_none<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, expr: &'tcx hir::Expr, map_or_args: &'tcx [hir::Expr]) {
2161 if match_type(cx, cx.tables.expr_ty(&map_or_args[0]), &paths::OPTION) {
2162 // check if the first non-self argument to map_or() is None
2163 let map_or_arg_is_none = if let hir::ExprKind::Path(ref qpath) = map_or_args[1].node {
2164 match_qpath(qpath, &paths::OPTION_NONE)
2169 if map_or_arg_is_none {
2171 let msg = "called `map_or(None, f)` on an Option value. This can be done more directly by calling \
2172 `and_then(f)` instead";
2173 let map_or_self_snippet = snippet(cx, map_or_args[0].span, "..");
2174 let map_or_func_snippet = snippet(cx, map_or_args[2].span, "..");
2175 let hint = format!("{0}.and_then({1})", map_or_self_snippet, map_or_func_snippet);
2176 span_lint_and_then(cx, OPTION_MAP_OR_NONE, expr.span, msg, |db| {
2179 "try using and_then instead",
2181 Applicability::MachineApplicable, // snippet
2188 /// Lint use of `_.and_then(|x| Some(y))` for `Option`s
2189 fn lint_option_and_then_some(cx: &LateContext<'_, '_>, expr: &hir::Expr, args: &[hir::Expr]) {
2190 const LINT_MSG: &str = "using `Option.and_then(|x| Some(y))`, which is more succinctly expressed as `map(|x| y)`";
2191 const NO_OP_MSG: &str = "using `Option.and_then(Some)`, which is a no-op";
2193 // Searches an return expressions in `y` in `_.and_then(|x| Some(y))`, which we don't lint
2194 struct RetCallFinder {
2198 impl<'tcx> intravisit::Visitor<'tcx> for RetCallFinder {
2199 fn visit_expr(&mut self, expr: &'tcx hir::Expr) {
2203 if let hir::ExprKind::Ret(..) = &expr.node {
2206 intravisit::walk_expr(self, expr);
2210 fn nested_visit_map<'this>(&'this mut self) -> intravisit::NestedVisitorMap<'this, 'tcx> {
2211 intravisit::NestedVisitorMap::None
2215 let ty = cx.tables.expr_ty(&args[0]);
2216 if !match_type(cx, ty, &paths::OPTION) {
2220 match args[1].node {
2221 hir::ExprKind::Closure(_, _, body_id, closure_args_span, _) => {
2222 let closure_body = cx.tcx.hir().body(body_id);
2223 let closure_expr = remove_blocks(&closure_body.value);
2225 if let hir::ExprKind::Call(ref some_expr, ref some_args) = closure_expr.node;
2226 if let hir::ExprKind::Path(ref qpath) = some_expr.node;
2227 if match_qpath(qpath, &paths::OPTION_SOME);
2228 if some_args.len() == 1;
2230 let inner_expr = &some_args[0];
2232 let mut finder = RetCallFinder { found: false };
2233 finder.visit_expr(inner_expr);
2238 let some_inner_snip = if inner_expr.span.from_expansion() {
2239 snippet_with_macro_callsite(cx, inner_expr.span, "_")
2241 snippet(cx, inner_expr.span, "_")
2244 let closure_args_snip = snippet(cx, closure_args_span, "..");
2245 let option_snip = snippet(cx, args[0].span, "..");
2246 let note = format!("{}.map({} {})", option_snip, closure_args_snip, some_inner_snip);
2249 OPTION_AND_THEN_SOME,
2254 Applicability::MachineApplicable,
2259 // `_.and_then(Some)` case, which is no-op.
2260 hir::ExprKind::Path(ref qpath) => {
2261 if match_qpath(qpath, &paths::OPTION_SOME) {
2262 let option_snip = snippet(cx, args[0].span, "..");
2263 let note = format!("{}", option_snip);
2266 OPTION_AND_THEN_SOME,
2269 "use the expression directly",
2271 Applicability::MachineApplicable,
2279 /// lint use of `filter().next()` for `Iterators`
2280 fn lint_filter_next<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, expr: &'tcx hir::Expr, filter_args: &'tcx [hir::Expr]) {
2281 // lint if caller of `.filter().next()` is an Iterator
2282 if match_trait_method(cx, expr, &paths::ITERATOR) {
2283 let msg = "called `filter(p).next()` on an `Iterator`. This is more succinctly expressed by calling \
2284 `.find(p)` instead.";
2285 let filter_snippet = snippet(cx, filter_args[1].span, "..");
2286 if filter_snippet.lines().count() <= 1 {
2287 // add note if not multi-line
2294 &format!("replace `filter({0}).next()` with `find({0})`", filter_snippet),
2297 span_lint(cx, FILTER_NEXT, expr.span, msg);
2302 /// lint use of `filter().map()` for `Iterators`
2303 fn lint_filter_map<'a, 'tcx>(
2304 cx: &LateContext<'a, 'tcx>,
2305 expr: &'tcx hir::Expr,
2306 _filter_args: &'tcx [hir::Expr],
2307 _map_args: &'tcx [hir::Expr],
2309 // lint if caller of `.filter().map()` is an Iterator
2310 if match_trait_method(cx, expr, &paths::ITERATOR) {
2311 let msg = "called `filter(p).map(q)` on an `Iterator`. \
2312 This is more succinctly expressed by calling `.filter_map(..)` instead.";
2313 span_lint(cx, FILTER_MAP, expr.span, msg);
2317 /// lint use of `filter_map().next()` for `Iterators`
2318 fn lint_filter_map_next<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, expr: &'tcx hir::Expr, filter_args: &'tcx [hir::Expr]) {
2319 if match_trait_method(cx, expr, &paths::ITERATOR) {
2320 let msg = "called `filter_map(p).next()` on an `Iterator`. This is more succinctly expressed by calling \
2321 `.find_map(p)` instead.";
2322 let filter_snippet = snippet(cx, filter_args[1].span, "..");
2323 if filter_snippet.lines().count() <= 1 {
2330 &format!("replace `filter_map({0}).next()` with `find_map({0})`", filter_snippet),
2333 span_lint(cx, FILTER_MAP_NEXT, expr.span, msg);
2338 /// lint use of `find().map()` for `Iterators`
2339 fn lint_find_map<'a, 'tcx>(
2340 cx: &LateContext<'a, 'tcx>,
2341 expr: &'tcx hir::Expr,
2342 _find_args: &'tcx [hir::Expr],
2343 map_args: &'tcx [hir::Expr],
2345 // lint if caller of `.filter().map()` is an Iterator
2346 if match_trait_method(cx, &map_args[0], &paths::ITERATOR) {
2347 let msg = "called `find(p).map(q)` on an `Iterator`. \
2348 This is more succinctly expressed by calling `.find_map(..)` instead.";
2349 span_lint(cx, FIND_MAP, expr.span, msg);
2353 /// lint use of `filter().map()` for `Iterators`
2354 fn lint_filter_map_map<'a, 'tcx>(
2355 cx: &LateContext<'a, 'tcx>,
2356 expr: &'tcx hir::Expr,
2357 _filter_args: &'tcx [hir::Expr],
2358 _map_args: &'tcx [hir::Expr],
2360 // lint if caller of `.filter().map()` is an Iterator
2361 if match_trait_method(cx, expr, &paths::ITERATOR) {
2362 let msg = "called `filter_map(p).map(q)` on an `Iterator`. \
2363 This is more succinctly expressed by only calling `.filter_map(..)` instead.";
2364 span_lint(cx, FILTER_MAP, expr.span, msg);
2368 /// lint use of `filter().flat_map()` for `Iterators`
2369 fn lint_filter_flat_map<'a, 'tcx>(
2370 cx: &LateContext<'a, 'tcx>,
2371 expr: &'tcx hir::Expr,
2372 _filter_args: &'tcx [hir::Expr],
2373 _map_args: &'tcx [hir::Expr],
2375 // lint if caller of `.filter().flat_map()` is an Iterator
2376 if match_trait_method(cx, expr, &paths::ITERATOR) {
2377 let msg = "called `filter(p).flat_map(q)` on an `Iterator`. \
2378 This is more succinctly expressed by calling `.flat_map(..)` \
2379 and filtering by returning an empty Iterator.";
2380 span_lint(cx, FILTER_MAP, expr.span, msg);
2384 /// lint use of `filter_map().flat_map()` for `Iterators`
2385 fn lint_filter_map_flat_map<'a, 'tcx>(
2386 cx: &LateContext<'a, 'tcx>,
2387 expr: &'tcx hir::Expr,
2388 _filter_args: &'tcx [hir::Expr],
2389 _map_args: &'tcx [hir::Expr],
2391 // lint if caller of `.filter_map().flat_map()` is an Iterator
2392 if match_trait_method(cx, expr, &paths::ITERATOR) {
2393 let msg = "called `filter_map(p).flat_map(q)` on an `Iterator`. \
2394 This is more succinctly expressed by calling `.flat_map(..)` \
2395 and filtering by returning an empty Iterator.";
2396 span_lint(cx, FILTER_MAP, expr.span, msg);
2400 /// lint use of `flat_map` for `Iterators` where `flatten` would be sufficient
2401 fn lint_flat_map_identity<'a, 'tcx>(
2402 cx: &LateContext<'a, 'tcx>,
2403 expr: &'tcx hir::Expr,
2404 flat_map_args: &'tcx [hir::Expr],
2405 flat_map_span: Span,
2407 if match_trait_method(cx, expr, &paths::ITERATOR) {
2408 let arg_node = &flat_map_args[1].node;
2410 let apply_lint = |message: &str| {
2414 flat_map_span.with_hi(expr.span.hi()),
2417 "flatten()".to_string(),
2418 Applicability::MachineApplicable,
2423 if let hir::ExprKind::Closure(_, _, body_id, _, _) = arg_node;
2424 let body = cx.tcx.hir().body(*body_id);
2426 if let hir::PatKind::Binding(_, _, binding_ident, _) = body.params[0].pat.node;
2427 if let hir::ExprKind::Path(hir::QPath::Resolved(_, ref path)) = body.value.node;
2429 if path.segments.len() == 1;
2430 if path.segments[0].ident.as_str() == binding_ident.as_str();
2433 apply_lint("called `flat_map(|x| x)` on an `Iterator`");
2438 if let hir::ExprKind::Path(ref qpath) = arg_node;
2440 if match_qpath(qpath, &paths::STD_CONVERT_IDENTITY);
2443 apply_lint("called `flat_map(std::convert::identity)` on an `Iterator`");
2449 /// lint searching an Iterator followed by `is_some()`
2450 fn lint_search_is_some<'a, 'tcx>(
2451 cx: &LateContext<'a, 'tcx>,
2452 expr: &'tcx hir::Expr,
2453 search_method: &str,
2454 search_args: &'tcx [hir::Expr],
2455 is_some_args: &'tcx [hir::Expr],
2458 // lint if caller of search is an Iterator
2459 if match_trait_method(cx, &is_some_args[0], &paths::ITERATOR) {
2461 "called `is_some()` after searching an `Iterator` with {}. This is more succinctly \
2462 expressed by calling `any()`.",
2465 let search_snippet = snippet(cx, search_args[1].span, "..");
2466 if search_snippet.lines().count() <= 1 {
2467 // suggest `any(|x| ..)` instead of `any(|&x| ..)` for `find(|&x| ..).is_some()`
2468 // suggest `any(|..| *..)` instead of `any(|..| **..)` for `find(|..| **..).is_some()`
2469 let any_search_snippet = if_chain! {
2470 if search_method == "find";
2471 if let hir::ExprKind::Closure(_, _, body_id, ..) = search_args[1].node;
2472 let closure_body = cx.tcx.hir().body(body_id);
2473 if let Some(closure_arg) = closure_body.params.get(0);
2475 if let hir::PatKind::Ref(..) = closure_arg.pat.node {
2476 Some(search_snippet.replacen('&', "", 1))
2477 } else if let Some(name) = get_arg_name(&closure_arg.pat) {
2478 Some(search_snippet.replace(&format!("*{}", name), &name.as_str()))
2486 // add note if not multi-line
2490 method_span.with_hi(expr.span.hi()),
2495 any_search_snippet.as_ref().map_or(&*search_snippet, String::as_str)
2497 Applicability::MachineApplicable,
2500 span_lint(cx, SEARCH_IS_SOME, expr.span, &msg);
2505 /// Used for `lint_binary_expr_with_method_call`.
2506 #[derive(Copy, Clone)]
2507 struct BinaryExprInfo<'a> {
2508 expr: &'a hir::Expr,
2509 chain: &'a hir::Expr,
2510 other: &'a hir::Expr,
2514 /// Checks for the `CHARS_NEXT_CMP` and `CHARS_LAST_CMP` lints.
2515 fn lint_binary_expr_with_method_call(cx: &LateContext<'_, '_>, info: &mut BinaryExprInfo<'_>) {
2516 macro_rules! lint_with_both_lhs_and_rhs {
2517 ($func:ident, $cx:expr, $info:ident) => {
2518 if !$func($cx, $info) {
2519 ::std::mem::swap(&mut $info.chain, &mut $info.other);
2520 if $func($cx, $info) {
2527 lint_with_both_lhs_and_rhs!(lint_chars_next_cmp, cx, info);
2528 lint_with_both_lhs_and_rhs!(lint_chars_last_cmp, cx, info);
2529 lint_with_both_lhs_and_rhs!(lint_chars_next_cmp_with_unwrap, cx, info);
2530 lint_with_both_lhs_and_rhs!(lint_chars_last_cmp_with_unwrap, cx, info);
2533 /// Wrapper fn for `CHARS_NEXT_CMP` and `CHARS_LAST_CMP` lints.
2535 cx: &LateContext<'_, '_>,
2536 info: &BinaryExprInfo<'_>,
2537 chain_methods: &[&str],
2538 lint: &'static Lint,
2542 if let Some(args) = method_chain_args(info.chain, chain_methods);
2543 if let hir::ExprKind::Call(ref fun, ref arg_char) = info.other.node;
2544 if arg_char.len() == 1;
2545 if let hir::ExprKind::Path(ref qpath) = fun.node;
2546 if let Some(segment) = single_segment_path(qpath);
2547 if segment.ident.name == sym!(Some);
2549 let mut applicability = Applicability::MachineApplicable;
2550 let self_ty = walk_ptrs_ty(cx.tables.expr_ty_adjusted(&args[0][0]));
2552 if self_ty.sty != ty::Str {
2560 &format!("you should use the `{}` method", suggest),
2562 format!("{}{}.{}({})",
2563 if info.eq { "" } else { "!" },
2564 snippet_with_applicability(cx, args[0][0].span, "_", &mut applicability),
2566 snippet_with_applicability(cx, arg_char[0].span, "_", &mut applicability)),
2577 /// Checks for the `CHARS_NEXT_CMP` lint.
2578 fn lint_chars_next_cmp<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, info: &BinaryExprInfo<'_>) -> bool {
2579 lint_chars_cmp(cx, info, &["chars", "next"], CHARS_NEXT_CMP, "starts_with")
2582 /// Checks for the `CHARS_LAST_CMP` lint.
2583 fn lint_chars_last_cmp<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, info: &BinaryExprInfo<'_>) -> bool {
2584 if lint_chars_cmp(cx, info, &["chars", "last"], CHARS_LAST_CMP, "ends_with") {
2587 lint_chars_cmp(cx, info, &["chars", "next_back"], CHARS_LAST_CMP, "ends_with")
2591 /// Wrapper fn for `CHARS_NEXT_CMP` and `CHARS_LAST_CMP` lints with `unwrap()`.
2592 fn lint_chars_cmp_with_unwrap<'a, 'tcx>(
2593 cx: &LateContext<'a, 'tcx>,
2594 info: &BinaryExprInfo<'_>,
2595 chain_methods: &[&str],
2596 lint: &'static Lint,
2600 if let Some(args) = method_chain_args(info.chain, chain_methods);
2601 if let hir::ExprKind::Lit(ref lit) = info.other.node;
2602 if let ast::LitKind::Char(c) = lit.node;
2604 let mut applicability = Applicability::MachineApplicable;
2609 &format!("you should use the `{}` method", suggest),
2611 format!("{}{}.{}('{}')",
2612 if info.eq { "" } else { "!" },
2613 snippet_with_applicability(cx, args[0][0].span, "_", &mut applicability),
2626 /// Checks for the `CHARS_NEXT_CMP` lint with `unwrap()`.
2627 fn lint_chars_next_cmp_with_unwrap<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, info: &BinaryExprInfo<'_>) -> bool {
2628 lint_chars_cmp_with_unwrap(cx, info, &["chars", "next", "unwrap"], CHARS_NEXT_CMP, "starts_with")
2631 /// Checks for the `CHARS_LAST_CMP` lint with `unwrap()`.
2632 fn lint_chars_last_cmp_with_unwrap<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, info: &BinaryExprInfo<'_>) -> bool {
2633 if lint_chars_cmp_with_unwrap(cx, info, &["chars", "last", "unwrap"], CHARS_LAST_CMP, "ends_with") {
2636 lint_chars_cmp_with_unwrap(cx, info, &["chars", "next_back", "unwrap"], CHARS_LAST_CMP, "ends_with")
2640 /// lint for length-1 `str`s for methods in `PATTERN_METHODS`
2641 fn lint_single_char_pattern<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, _expr: &'tcx hir::Expr, arg: &'tcx hir::Expr) {
2643 if let hir::ExprKind::Lit(lit) = &arg.node;
2644 if let ast::LitKind::Str(r, style) = lit.node;
2645 if r.as_str().len() == 1;
2647 let mut applicability = Applicability::MachineApplicable;
2648 let snip = snippet_with_applicability(cx, arg.span, "..", &mut applicability);
2649 let ch = if let ast::StrStyle::Raw(nhash) = style {
2650 let nhash = nhash as usize;
2651 // for raw string: r##"a"##
2652 &snip[(nhash + 2)..(snip.len() - 1 - nhash)]
2654 // for regular string: "a"
2655 &snip[1..(snip.len() - 1)]
2657 let hint = format!("'{}'", if ch == "'" { "\\'" } else { ch });
2660 SINGLE_CHAR_PATTERN,
2662 "single-character string constant used as pattern",
2663 "try using a char instead",
2671 /// Checks for the `USELESS_ASREF` lint.
2672 fn lint_asref(cx: &LateContext<'_, '_>, expr: &hir::Expr, call_name: &str, as_ref_args: &[hir::Expr]) {
2673 // when we get here, we've already checked that the call name is "as_ref" or "as_mut"
2674 // check if the call is to the actual `AsRef` or `AsMut` trait
2675 if match_trait_method(cx, expr, &paths::ASREF_TRAIT) || match_trait_method(cx, expr, &paths::ASMUT_TRAIT) {
2676 // check if the type after `as_ref` or `as_mut` is the same as before
2677 let recvr = &as_ref_args[0];
2678 let rcv_ty = cx.tables.expr_ty(recvr);
2679 let res_ty = cx.tables.expr_ty(expr);
2680 let (base_res_ty, res_depth) = walk_ptrs_ty_depth(res_ty);
2681 let (base_rcv_ty, rcv_depth) = walk_ptrs_ty_depth(rcv_ty);
2682 if base_rcv_ty == base_res_ty && rcv_depth >= res_depth {
2683 // allow the `as_ref` or `as_mut` if it is followed by another method call
2685 if let Some(parent) = get_parent_expr(cx, expr);
2686 if let hir::ExprKind::MethodCall(_, ref span, _) = parent.node;
2687 if span != &expr.span;
2693 let mut applicability = Applicability::MachineApplicable;
2698 &format!("this call to `{}` does nothing", call_name),
2700 snippet_with_applicability(cx, recvr.span, "_", &mut applicability).to_string(),
2707 fn ty_has_iter_method(
2708 cx: &LateContext<'_, '_>,
2709 self_ref_ty: Ty<'_>,
2710 ) -> Option<(&'static Lint, &'static str, &'static str)> {
2711 has_iter_method(cx, self_ref_ty).map(|ty_name| {
2712 let lint = if ty_name == "array" || ty_name == "PathBuf" {
2717 let mutbl = match self_ref_ty.sty {
2718 ty::Ref(_, _, mutbl) => mutbl,
2719 _ => unreachable!(),
2721 let method_name = match mutbl {
2722 hir::MutImmutable => "iter",
2723 hir::MutMutable => "iter_mut",
2725 (lint, ty_name, method_name)
2729 fn lint_into_iter(cx: &LateContext<'_, '_>, expr: &hir::Expr, self_ref_ty: Ty<'_>, method_span: Span) {
2730 if !match_trait_method(cx, expr, &paths::INTO_ITERATOR) {
2733 if let Some((lint, kind, method_name)) = ty_has_iter_method(cx, self_ref_ty) {
2739 "this .into_iter() call is equivalent to .{}() and will not move the {}",
2743 method_name.to_string(),
2744 Applicability::MachineApplicable,
2749 /// lint for `MaybeUninit::uninit().assume_init()` (we already have the latter)
2750 fn lint_maybe_uninit(cx: &LateContext<'_, '_>, expr: &hir::Expr, outer: &hir::Expr) {
2752 if let hir::ExprKind::Call(ref callee, ref args) = expr.node;
2754 if let hir::ExprKind::Path(ref path) = callee.node;
2755 if match_qpath(path, &paths::MEM_MAYBEUNINIT_UNINIT);
2756 if !is_maybe_uninit_ty_valid(cx, cx.tables.expr_ty_adjusted(outer));
2760 UNINIT_ASSUMED_INIT,
2762 "this call for this type may be undefined behavior"
2768 fn is_maybe_uninit_ty_valid(cx: &LateContext<'_, '_>, ty: Ty<'_>) -> bool {
2770 ty::Array(ref component, _) => is_maybe_uninit_ty_valid(cx, component),
2771 ty::Tuple(ref types) => types.types().all(|ty| is_maybe_uninit_ty_valid(cx, ty)),
2772 ty::Adt(ref adt, _) => {
2773 // needs to be a MaybeUninit
2774 match_def_path(cx, adt.did, &paths::MEM_MAYBEUNINIT)
2780 fn lint_suspicious_map(cx: &LateContext<'_, '_>, expr: &hir::Expr) {
2785 "this call to `map()` won't have an effect on the call to `count()`",
2786 "make sure you did not confuse `map` with `filter`",
2790 /// Given a `Result<T, E>` type, return its error type (`E`).
2791 fn get_error_type<'a>(cx: &LateContext<'_, '_>, ty: Ty<'a>) -> Option<Ty<'a>> {
2793 ty::Adt(_, substs) if match_type(cx, ty, &paths::RESULT) => substs.types().nth(1),
2798 /// This checks whether a given type is known to implement Debug.
2799 fn has_debug_impl<'a, 'b>(ty: Ty<'a>, cx: &LateContext<'b, 'a>) -> bool {
2801 .get_diagnostic_item(sym::debug_trait)
2802 .map_or(false, |debug| implements_trait(cx, ty, debug, &[]))
2807 StartsWith(&'static str),
2811 const CONVENTIONS: [(Convention, &[SelfKind]); 7] = [
2812 (Convention::Eq("new"), &[SelfKind::No]),
2813 (Convention::StartsWith("as_"), &[SelfKind::Ref, SelfKind::RefMut]),
2814 (Convention::StartsWith("from_"), &[SelfKind::No]),
2815 (Convention::StartsWith("into_"), &[SelfKind::Value]),
2816 (Convention::StartsWith("is_"), &[SelfKind::Ref, SelfKind::No]),
2817 (Convention::Eq("to_mut"), &[SelfKind::RefMut]),
2818 (Convention::StartsWith("to_"), &[SelfKind::Ref]),
2822 const TRAIT_METHODS: [(&str, usize, SelfKind, OutType, &str); 30] = [
2823 ("add", 2, SelfKind::Value, OutType::Any, "std::ops::Add"),
2824 ("as_mut", 1, SelfKind::RefMut, OutType::Ref, "std::convert::AsMut"),
2825 ("as_ref", 1, SelfKind::Ref, OutType::Ref, "std::convert::AsRef"),
2826 ("bitand", 2, SelfKind::Value, OutType::Any, "std::ops::BitAnd"),
2827 ("bitor", 2, SelfKind::Value, OutType::Any, "std::ops::BitOr"),
2828 ("bitxor", 2, SelfKind::Value, OutType::Any, "std::ops::BitXor"),
2829 ("borrow", 1, SelfKind::Ref, OutType::Ref, "std::borrow::Borrow"),
2830 ("borrow_mut", 1, SelfKind::RefMut, OutType::Ref, "std::borrow::BorrowMut"),
2831 ("clone", 1, SelfKind::Ref, OutType::Any, "std::clone::Clone"),
2832 ("cmp", 2, SelfKind::Ref, OutType::Any, "std::cmp::Ord"),
2833 ("default", 0, SelfKind::No, OutType::Any, "std::default::Default"),
2834 ("deref", 1, SelfKind::Ref, OutType::Ref, "std::ops::Deref"),
2835 ("deref_mut", 1, SelfKind::RefMut, OutType::Ref, "std::ops::DerefMut"),
2836 ("div", 2, SelfKind::Value, OutType::Any, "std::ops::Div"),
2837 ("drop", 1, SelfKind::RefMut, OutType::Unit, "std::ops::Drop"),
2838 ("eq", 2, SelfKind::Ref, OutType::Bool, "std::cmp::PartialEq"),
2839 ("from_iter", 1, SelfKind::No, OutType::Any, "std::iter::FromIterator"),
2840 ("from_str", 1, SelfKind::No, OutType::Any, "std::str::FromStr"),
2841 ("hash", 2, SelfKind::Ref, OutType::Unit, "std::hash::Hash"),
2842 ("index", 2, SelfKind::Ref, OutType::Ref, "std::ops::Index"),
2843 ("index_mut", 2, SelfKind::RefMut, OutType::Ref, "std::ops::IndexMut"),
2844 ("into_iter", 1, SelfKind::Value, OutType::Any, "std::iter::IntoIterator"),
2845 ("mul", 2, SelfKind::Value, OutType::Any, "std::ops::Mul"),
2846 ("neg", 1, SelfKind::Value, OutType::Any, "std::ops::Neg"),
2847 ("next", 1, SelfKind::RefMut, OutType::Any, "std::iter::Iterator"),
2848 ("not", 1, SelfKind::Value, OutType::Any, "std::ops::Not"),
2849 ("rem", 2, SelfKind::Value, OutType::Any, "std::ops::Rem"),
2850 ("shl", 2, SelfKind::Value, OutType::Any, "std::ops::Shl"),
2851 ("shr", 2, SelfKind::Value, OutType::Any, "std::ops::Shr"),
2852 ("sub", 2, SelfKind::Value, OutType::Any, "std::ops::Sub"),
2856 const PATTERN_METHODS: [(&str, usize); 17] = [
2864 ("split_terminator", 1),
2865 ("rsplit_terminator", 1),
2870 ("match_indices", 1),
2871 ("rmatch_indices", 1),
2872 ("trim_start_matches", 1),
2873 ("trim_end_matches", 1),
2876 #[derive(Clone, Copy, PartialEq, Debug)]
2885 fn matches<'a>(self, cx: &LateContext<'_, 'a>, parent_ty: Ty<'a>, ty: Ty<'a>) -> bool {
2886 fn matches_value(parent_ty: Ty<'_>, ty: Ty<'_>) -> bool {
2887 if ty == parent_ty {
2889 } else if ty.is_box() {
2890 ty.boxed_ty() == parent_ty
2891 } else if ty.is_rc() || ty.is_arc() {
2892 if let ty::Adt(_, substs) = ty.sty {
2893 substs.types().next().map_or(false, |t| t == parent_ty)
2903 cx: &LateContext<'_, 'a>,
2904 mutability: hir::Mutability,
2908 if let ty::Ref(_, t, m) = ty.sty {
2909 return m == mutability && t == parent_ty;
2912 let trait_path = match mutability {
2913 hir::Mutability::MutImmutable => &paths::ASREF_TRAIT,
2914 hir::Mutability::MutMutable => &paths::ASMUT_TRAIT,
2917 let trait_def_id = match get_trait_def_id(cx, trait_path) {
2919 None => return false,
2921 implements_trait(cx, ty, trait_def_id, &[parent_ty.into()])
2925 Self::Value => matches_value(parent_ty, ty),
2927 matches_ref(cx, hir::Mutability::MutImmutable, parent_ty, ty) || ty == parent_ty && is_copy(cx, ty)
2929 Self::RefMut => matches_ref(cx, hir::Mutability::MutMutable, parent_ty, ty),
2930 Self::No => ty != parent_ty,
2934 fn description(self) -> &'static str {
2936 Self::Value => "self by value",
2937 Self::Ref => "self by reference",
2938 Self::RefMut => "self by mutable reference",
2939 Self::No => "no self",
2945 fn check(&self, other: &str) -> bool {
2947 Self::Eq(this) => this == other,
2948 Self::StartsWith(this) => other.starts_with(this) && this != other,
2953 impl fmt::Display for Convention {
2954 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> Result<(), fmt::Error> {
2956 Self::Eq(this) => this.fmt(f),
2957 Self::StartsWith(this) => this.fmt(f).and_then(|_| '*'.fmt(f)),
2962 #[derive(Clone, Copy)]
2971 fn matches(self, cx: &LateContext<'_, '_>, ty: &hir::FunctionRetTy) -> bool {
2972 let is_unit = |ty: &hir::Ty| SpanlessEq::new(cx).eq_ty_kind(&ty.node, &hir::TyKind::Tup(vec![].into()));
2974 (Self::Unit, &hir::DefaultReturn(_)) => true,
2975 (Self::Unit, &hir::Return(ref ty)) if is_unit(ty) => true,
2976 (Self::Bool, &hir::Return(ref ty)) if is_bool(ty) => true,
2977 (Self::Any, &hir::Return(ref ty)) if !is_unit(ty) => true,
2978 (Self::Ref, &hir::Return(ref ty)) => matches!(ty.node, hir::TyKind::Rptr(_, _)),
2984 fn is_bool(ty: &hir::Ty) -> bool {
2985 if let hir::TyKind::Path(ref p) = ty.node {
2986 match_qpath(p, &["bool"])