1 mod bind_instead_of_map;
2 mod inefficient_to_string;
3 mod manual_saturating_arithmetic;
4 mod option_map_unwrap_or;
5 mod unnecessary_filter_map;
11 use bind_instead_of_map::BindInsteadOfMap;
12 use if_chain::if_chain;
14 use rustc_errors::Applicability;
16 use rustc_hir::intravisit::{self, Visitor};
17 use rustc_lint::{LateContext, LateLintPass, Lint, LintContext};
18 use rustc_middle::hir::map::Map;
19 use rustc_middle::lint::in_external_macro;
20 use rustc_middle::ty::subst::GenericArgKind;
21 use rustc_middle::ty::{self, Ty, TyS};
22 use rustc_session::{declare_lint_pass, declare_tool_lint};
23 use rustc_span::source_map::Span;
24 use rustc_span::symbol::{sym, SymbolStr};
26 use crate::consts::{constant, Constant};
27 use crate::utils::usage::mutated_variables;
29 get_arg_name, get_parent_expr, get_trait_def_id, has_iter_method, higher, implements_trait, in_macro, is_copy,
30 is_ctor_or_promotable_const_function, is_expn_of, is_type_diagnostic_item, iter_input_pats, last_path_segment,
31 match_def_path, match_qpath, match_trait_method, match_type, match_var, method_calls, method_chain_args, paths,
32 remove_blocks, return_ty, single_segment_path, snippet, snippet_with_applicability, snippet_with_macro_callsite,
33 span_lint, span_lint_and_help, span_lint_and_note, span_lint_and_sugg, span_lint_and_then, sugg, walk_ptrs_ty,
34 walk_ptrs_ty_depth, SpanlessEq,
37 declare_clippy_lint! {
38 /// **What it does:** Checks for `.unwrap()` calls on `Option`s and on `Result`s.
40 /// **Why is this bad?** It is better to handle the `None` or `Err` case,
41 /// or at least call `.expect(_)` with a more helpful message. Still, for a lot of
42 /// quick-and-dirty code, `unwrap` is a good choice, which is why this lint is
43 /// `Allow` by default.
45 /// `result.unwrap()` will let the thread panic on `Err` values.
46 /// Normally, you want to implement more sophisticated error handling,
47 /// and propagate errors upwards with `?` operator.
49 /// Even if you want to panic on errors, not all `Error`s implement good
50 /// messages on display. Therefore, it may be beneficial to look at the places
51 /// where they may get displayed. Activate this lint to do just that.
53 /// **Known problems:** None.
57 /// # let opt = Some(1);
63 /// opt.expect("more helpful message");
69 /// # let res: Result<usize, ()> = Ok(1);
75 /// res.expect("more helpful message");
79 "using `.unwrap()` on `Result` or `Option`, which should at least get a better message using `expect()`"
82 declare_clippy_lint! {
83 /// **What it does:** Checks for `.expect()` calls on `Option`s and `Result`s.
85 /// **Why is this bad?** Usually it is better to handle the `None` or `Err` case.
86 /// Still, for a lot of quick-and-dirty code, `expect` is a good choice, which is why
87 /// this lint is `Allow` by default.
89 /// `result.expect()` will let the thread panic on `Err`
90 /// values. Normally, you want to implement more sophisticated error handling,
91 /// and propagate errors upwards with `?` operator.
93 /// **Known problems:** None.
97 /// # let opt = Some(1);
100 /// opt.expect("one");
103 /// let opt = Some(1);
110 /// # let res: Result<usize, ()> = Ok(1);
113 /// res.expect("one");
117 /// # Ok::<(), ()>(())
121 "using `.expect()` on `Result` or `Option`, which might be better handled"
124 declare_clippy_lint! {
125 /// **What it does:** Checks for methods that should live in a trait
126 /// implementation of a `std` trait (see [llogiq's blog
127 /// post](http://llogiq.github.io/2015/07/30/traits.html) for further
128 /// information) instead of an inherent implementation.
130 /// **Why is this bad?** Implementing the traits improve ergonomics for users of
131 /// the code, often with very little cost. Also people seeing a `mul(...)`
133 /// may expect `*` to work equally, so you should have good reason to disappoint
136 /// **Known problems:** None.
142 /// fn add(&self, other: &X) -> X {
148 pub SHOULD_IMPLEMENT_TRAIT,
150 "defining a method that should be implementing a std trait"
153 declare_clippy_lint! {
154 /// **What it does:** Checks for methods with certain name prefixes and which
155 /// doesn't match how self is taken. The actual rules are:
157 /// |Prefix |`self` taken |
158 /// |-------|----------------------|
159 /// |`as_` |`&self` or `&mut self`|
161 /// |`into_`|`self` |
162 /// |`is_` |`&self` or none |
163 /// |`to_` |`&self` |
165 /// **Why is this bad?** Consistency breeds readability. If you follow the
166 /// conventions, your users won't be surprised that they, e.g., need to supply a
167 /// mutable reference to a `as_..` function.
169 /// **Known problems:** None.
175 /// fn as_str(self) -> &'static str {
181 pub WRONG_SELF_CONVENTION,
183 "defining a method named with an established prefix (like \"into_\") that takes `self` with the wrong convention"
186 declare_clippy_lint! {
187 /// **What it does:** This is the same as
188 /// [`wrong_self_convention`](#wrong_self_convention), but for public items.
190 /// **Why is this bad?** See [`wrong_self_convention`](#wrong_self_convention).
192 /// **Known problems:** Actually *renaming* the function may break clients if
193 /// the function is part of the public interface. In that case, be mindful of
194 /// the stability guarantees you've given your users.
200 /// pub fn as_str(self) -> &'a str {
205 pub WRONG_PUB_SELF_CONVENTION,
207 "defining a public method named with an established prefix (like \"into_\") that takes `self` with the wrong convention"
210 declare_clippy_lint! {
211 /// **What it does:** Checks for usage of `ok().expect(..)`.
213 /// **Why is this bad?** Because you usually call `expect()` on the `Result`
214 /// directly to get a better error message.
216 /// **Known problems:** The error type needs to implement `Debug`
220 /// # let x = Ok::<_, ()>(());
223 /// x.ok().expect("why did I do this again?");
226 /// x.expect("why did I do this again?");
230 "using `ok().expect()`, which gives worse error messages than calling `expect` directly on the Result"
233 declare_clippy_lint! {
234 /// **What it does:** Checks for usage of `option.map(_).unwrap_or(_)` or `option.map(_).unwrap_or_else(_)` or
235 /// `result.map(_).unwrap_or_else(_)`.
237 /// **Why is this bad?** Readability, these can be written more concisely (resp.) as
238 /// `option.map_or(_, _)`, `option.map_or_else(_, _)` and `result.map_or_else(_, _)`.
240 /// **Known problems:** The order of the arguments is not in execution order
244 /// # let x = Some(1);
247 /// x.map(|a| a + 1).unwrap_or(0);
250 /// x.map_or(0, |a| a + 1);
256 /// # let x: Result<usize, ()> = Ok(1);
257 /// # fn some_function(foo: ()) -> usize { 1 }
260 /// x.map(|a| a + 1).unwrap_or_else(some_function);
263 /// x.map_or_else(some_function, |a| a + 1);
267 "using `.map(f).unwrap_or(a)` or `.map(f).unwrap_or_else(func)`, which are more succinctly expressed as `map_or(a, f)` or `map_or_else(a, f)`"
270 declare_clippy_lint! {
271 /// **What it does:** Checks for usage of `_.map_or(None, _)`.
273 /// **Why is this bad?** Readability, this can be written more concisely as
276 /// **Known problems:** The order of the arguments is not in execution order.
280 /// # let opt = Some(1);
283 /// opt.map_or(None, |a| Some(a + 1));
286 /// opt.and_then(|a| Some(a + 1));
288 pub OPTION_MAP_OR_NONE,
290 "using `Option.map_or(None, f)`, which is more succinctly expressed as `and_then(f)`"
293 declare_clippy_lint! {
294 /// **What it does:** Checks for usage of `_.map_or(None, Some)`.
296 /// **Why is this bad?** Readability, this can be written more concisely as
299 /// **Known problems:** None.
305 /// # let r: Result<u32, &str> = Ok(1);
306 /// assert_eq!(Some(1), r.map_or(None, Some));
311 /// # let r: Result<u32, &str> = Ok(1);
312 /// assert_eq!(Some(1), r.ok());
314 pub RESULT_MAP_OR_INTO_OPTION,
316 "using `Result.map_or(None, Some)`, which is more succinctly expressed as `ok()`"
319 declare_clippy_lint! {
320 /// **What it does:** Checks for usage of `_.and_then(|x| Some(y))`, `_.and_then(|x| Ok(y))` or
321 /// `_.or_else(|x| Err(y))`.
323 /// **Why is this bad?** Readability, this can be written more concisely as
324 /// `_.map(|x| y)` or `_.map_err(|x| y)`.
326 /// **Known problems:** None
331 /// # fn opt() -> Option<&'static str> { Some("42") }
332 /// # fn res() -> Result<&'static str, &'static str> { Ok("42") }
333 /// let _ = opt().and_then(|s| Some(s.len()));
334 /// let _ = res().and_then(|s| if s.len() == 42 { Ok(10) } else { Ok(20) });
335 /// let _ = res().or_else(|s| if s.len() == 42 { Err(10) } else { Err(20) });
338 /// The correct use would be:
341 /// # fn opt() -> Option<&'static str> { Some("42") }
342 /// # fn res() -> Result<&'static str, &'static str> { Ok("42") }
343 /// let _ = opt().map(|s| s.len());
344 /// let _ = res().map(|s| if s.len() == 42 { 10 } else { 20 });
345 /// let _ = res().map_err(|s| if s.len() == 42 { 10 } else { 20 });
347 pub BIND_INSTEAD_OF_MAP,
349 "using `Option.and_then(|x| Some(y))`, which is more succinctly expressed as `map(|x| y)`"
352 declare_clippy_lint! {
353 /// **What it does:** Checks for usage of `_.filter(_).next()`.
355 /// **Why is this bad?** Readability, this can be written more concisely as
358 /// **Known problems:** None.
362 /// # let vec = vec![1];
363 /// vec.iter().filter(|x| **x == 0).next();
365 /// Could be written as
367 /// # let vec = vec![1];
368 /// vec.iter().find(|x| **x == 0);
372 "using `filter(p).next()`, which is more succinctly expressed as `.find(p)`"
375 declare_clippy_lint! {
376 /// **What it does:** Checks for usage of `_.skip_while(condition).next()`.
378 /// **Why is this bad?** Readability, this can be written more concisely as
379 /// `_.find(!condition)`.
381 /// **Known problems:** None.
385 /// # let vec = vec![1];
386 /// vec.iter().skip_while(|x| **x == 0).next();
388 /// Could be written as
390 /// # let vec = vec![1];
391 /// vec.iter().find(|x| **x != 0);
395 "using `skip_while(p).next()`, which is more succinctly expressed as `.find(!p)`"
398 declare_clippy_lint! {
399 /// **What it does:** Checks for usage of `_.map(_).flatten(_)`,
401 /// **Why is this bad?** Readability, this can be written more concisely as a
402 /// single method call using `_.flat_map(_)`
404 /// **Known problems:**
408 /// let vec = vec![vec![1]];
411 /// vec.iter().map(|x| x.iter()).flatten();
414 /// vec.iter().flat_map(|x| x.iter());
418 "using combinations of `flatten` and `map` which can usually be written as a single method call"
421 declare_clippy_lint! {
422 /// **What it does:** Checks for usage of `_.filter(_).map(_)`,
423 /// `_.filter(_).flat_map(_)`, `_.filter_map(_).flat_map(_)` and similar.
425 /// **Why is this bad?** Readability, this can be written more concisely as a
426 /// single method call.
428 /// **Known problems:** Often requires a condition + Option/Iterator creation
429 /// inside the closure.
433 /// let vec = vec![1];
436 /// vec.iter().filter(|x| **x == 0).map(|x| *x * 2);
439 /// vec.iter().filter_map(|x| if *x == 0 {
447 "using combinations of `filter`, `map`, `filter_map` and `flat_map` which can usually be written as a single method call"
450 declare_clippy_lint! {
451 /// **What it does:** Checks for usage of `_.filter_map(_).next()`.
453 /// **Why is this bad?** Readability, this can be written more concisely as a
454 /// single method call.
456 /// **Known problems:** None
460 /// (0..3).filter_map(|x| if x == 2 { Some(x) } else { None }).next();
462 /// Can be written as
465 /// (0..3).find_map(|x| if x == 2 { Some(x) } else { None });
469 "using combination of `filter_map` and `next` which can usually be written as a single method call"
472 declare_clippy_lint! {
473 /// **What it does:** Checks for usage of `flat_map(|x| x)`.
475 /// **Why is this bad?** Readability, this can be written more concisely by using `flatten`.
477 /// **Known problems:** None
481 /// # let iter = vec![vec![0]].into_iter();
482 /// iter.flat_map(|x| x);
484 /// Can be written as
486 /// # let iter = vec![vec![0]].into_iter();
489 pub FLAT_MAP_IDENTITY,
491 "call to `flat_map` where `flatten` is sufficient"
494 declare_clippy_lint! {
495 /// **What it does:** Checks for usage of `_.find(_).map(_)`.
497 /// **Why is this bad?** Readability, this can be written more concisely as a
498 /// single method call.
500 /// **Known problems:** Often requires a condition + Option/Iterator creation
501 /// inside the closure.
505 /// (0..3).find(|x| *x == 2).map(|x| x * 2);
507 /// Can be written as
509 /// (0..3).find_map(|x| if x == 2 { Some(x * 2) } else { None });
513 "using a combination of `find` and `map` can usually be written as a single method call"
516 declare_clippy_lint! {
517 /// **What it does:** Checks for an iterator search (such as `find()`,
518 /// `position()`, or `rposition()`) followed by a call to `is_some()`.
520 /// **Why is this bad?** Readability, this can be written more concisely as
523 /// **Known problems:** None.
527 /// # let vec = vec![1];
528 /// vec.iter().find(|x| **x == 0).is_some();
530 /// Could be written as
532 /// # let vec = vec![1];
533 /// vec.iter().any(|x| *x == 0);
537 "using an iterator search followed by `is_some()`, which is more succinctly expressed as a call to `any()`"
540 declare_clippy_lint! {
541 /// **What it does:** Checks for usage of `.chars().next()` on a `str` to check
542 /// if it starts with a given char.
544 /// **Why is this bad?** Readability, this can be written more concisely as
545 /// `_.starts_with(_)`.
547 /// **Known problems:** None.
551 /// let name = "foo";
552 /// if name.chars().next() == Some('_') {};
554 /// Could be written as
556 /// let name = "foo";
557 /// if name.starts_with('_') {};
561 "using `.chars().next()` to check if a string starts with a char"
564 declare_clippy_lint! {
565 /// **What it does:** Checks for calls to `.or(foo(..))`, `.unwrap_or(foo(..))`,
566 /// etc., and suggests to use `or_else`, `unwrap_or_else`, etc., or
567 /// `unwrap_or_default` instead.
569 /// **Why is this bad?** The function will always be called and potentially
570 /// allocate an object acting as the default.
572 /// **Known problems:** If the function has side-effects, not calling it will
573 /// change the semantic of the program, but you shouldn't rely on that anyway.
577 /// # let foo = Some(String::new());
578 /// foo.unwrap_or(String::new());
580 /// this can instead be written:
582 /// # let foo = Some(String::new());
583 /// foo.unwrap_or_else(String::new);
587 /// # let foo = Some(String::new());
588 /// foo.unwrap_or_default();
592 "using any `*or` method with a function call, which suggests `*or_else`"
595 declare_clippy_lint! {
596 /// **What it does:** Checks for calls to `.expect(&format!(...))`, `.expect(foo(..))`,
597 /// etc., and suggests to use `unwrap_or_else` instead
599 /// **Why is this bad?** The function will always be called.
601 /// **Known problems:** If the function has side-effects, not calling it will
602 /// change the semantics of the program, but you shouldn't rely on that anyway.
606 /// # let foo = Some(String::new());
607 /// # let err_code = "418";
608 /// # let err_msg = "I'm a teapot";
609 /// foo.expect(&format!("Err {}: {}", err_code, err_msg));
613 /// # let foo = Some(String::new());
614 /// # let err_code = "418";
615 /// # let err_msg = "I'm a teapot";
616 /// foo.expect(format!("Err {}: {}", err_code, err_msg).as_str());
618 /// this can instead be written:
620 /// # let foo = Some(String::new());
621 /// # let err_code = "418";
622 /// # let err_msg = "I'm a teapot";
623 /// foo.unwrap_or_else(|| panic!("Err {}: {}", err_code, err_msg));
627 "using any `expect` method with a function call"
630 declare_clippy_lint! {
631 /// **What it does:** Checks for usage of `.clone()` on a `Copy` type.
633 /// **Why is this bad?** The only reason `Copy` types implement `Clone` is for
634 /// generics, not for using the `clone` method on a concrete type.
636 /// **Known problems:** None.
644 "using `clone` on a `Copy` type"
647 declare_clippy_lint! {
648 /// **What it does:** Checks for usage of `.clone()` on a ref-counted pointer,
649 /// (`Rc`, `Arc`, `rc::Weak`, or `sync::Weak`), and suggests calling Clone via unified
650 /// function syntax instead (e.g., `Rc::clone(foo)`).
652 /// **Why is this bad?** Calling '.clone()' on an Rc, Arc, or Weak
653 /// can obscure the fact that only the pointer is being cloned, not the underlying
658 /// # use std::rc::Rc;
659 /// let x = Rc::new(1);
667 pub CLONE_ON_REF_PTR,
669 "using 'clone' on a ref-counted pointer"
672 declare_clippy_lint! {
673 /// **What it does:** Checks for usage of `.clone()` on an `&&T`.
675 /// **Why is this bad?** Cloning an `&&T` copies the inner `&T`, instead of
676 /// cloning the underlying `T`.
678 /// **Known problems:** None.
685 /// let z = y.clone();
686 /// println!("{:p} {:p}", *y, z); // prints out the same pointer
689 pub CLONE_DOUBLE_REF,
691 "using `clone` on `&&T`"
694 declare_clippy_lint! {
695 /// **What it does:** Checks for usage of `.to_string()` on an `&&T` where
696 /// `T` implements `ToString` directly (like `&&str` or `&&String`).
698 /// **Why is this bad?** This bypasses the specialized implementation of
699 /// `ToString` and instead goes through the more expensive string formatting
702 /// **Known problems:** None.
706 /// // Generic implementation for `T: Display` is used (slow)
707 /// ["foo", "bar"].iter().map(|s| s.to_string());
709 /// // OK, the specialized impl is used
710 /// ["foo", "bar"].iter().map(|&s| s.to_string());
712 pub INEFFICIENT_TO_STRING,
714 "using `to_string` on `&&T` where `T: ToString`"
717 declare_clippy_lint! {
718 /// **What it does:** Checks for `new` not returning a type that contains `Self`.
720 /// **Why is this bad?** As a convention, `new` methods are used to make a new
721 /// instance of a type.
723 /// **Known problems:** None.
728 /// # struct NotAFoo;
730 /// fn new() -> NotAFoo {
738 /// # struct FooError;
740 /// // Good. Return type contains `Self`
741 /// fn new() -> Result<Foo, FooError> {
751 /// // Bad. The type name must contain `Self`.
752 /// fn new() -> Bar {
759 "not returning type containing `Self` in a `new` method"
762 declare_clippy_lint! {
763 /// **What it does:** Checks for string methods that receive a single-character
764 /// `str` as an argument, e.g., `_.split("x")`.
766 /// **Why is this bad?** Performing these methods using a `char` is faster than
769 /// **Known problems:** Does not catch multi-byte unicode characters.
778 pub SINGLE_CHAR_PATTERN,
780 "using a single-character str where a char could be used, e.g., `_.split(\"x\")`"
783 declare_clippy_lint! {
784 /// **What it does:** Checks for getting the inner pointer of a temporary
787 /// **Why is this bad?** The inner pointer of a `CString` is only valid as long
788 /// as the `CString` is alive.
790 /// **Known problems:** None.
794 /// # use std::ffi::CString;
795 /// # fn call_some_ffi_func(_: *const i8) {}
797 /// let c_str = CString::new("foo").unwrap().as_ptr();
799 /// call_some_ffi_func(c_str);
802 /// Here `c_str` point to a freed address. The correct use would be:
804 /// # use std::ffi::CString;
805 /// # fn call_some_ffi_func(_: *const i8) {}
807 /// let c_str = CString::new("foo").unwrap();
809 /// call_some_ffi_func(c_str.as_ptr());
812 pub TEMPORARY_CSTRING_AS_PTR,
814 "getting the inner pointer of a temporary `CString`"
817 declare_clippy_lint! {
818 /// **What it does:** Checks for calling `.step_by(0)` on iterators which panics.
820 /// **Why is this bad?** This very much looks like an oversight. Use `panic!()` instead if you
821 /// actually intend to panic.
823 /// **Known problems:** None.
826 /// ```rust,should_panic
827 /// for x in (0..100).step_by(0) {
831 pub ITERATOR_STEP_BY_ZERO,
833 "using `Iterator::step_by(0)`, which will panic at runtime"
836 declare_clippy_lint! {
837 /// **What it does:** Checks for the use of `iter.nth(0)`.
839 /// **Why is this bad?** `iter.next()` is equivalent to
840 /// `iter.nth(0)`, as they both consume the next element,
841 /// but is more readable.
843 /// **Known problems:** None.
848 /// # use std::collections::HashSet;
850 /// # let mut s = HashSet::new();
852 /// let x = s.iter().nth(0);
855 /// # let mut s = HashSet::new();
857 /// let x = s.iter().next();
861 "replace `iter.nth(0)` with `iter.next()`"
864 declare_clippy_lint! {
865 /// **What it does:** Checks for use of `.iter().nth()` (and the related
866 /// `.iter_mut().nth()`) on standard library types with O(1) element access.
868 /// **Why is this bad?** `.get()` and `.get_mut()` are more efficient and more
871 /// **Known problems:** None.
875 /// let some_vec = vec![0, 1, 2, 3];
876 /// let bad_vec = some_vec.iter().nth(3);
877 /// let bad_slice = &some_vec[..].iter().nth(3);
879 /// The correct use would be:
881 /// let some_vec = vec![0, 1, 2, 3];
882 /// let bad_vec = some_vec.get(3);
883 /// let bad_slice = &some_vec[..].get(3);
887 "using `.iter().nth()` on a standard library type with O(1) element access"
890 declare_clippy_lint! {
891 /// **What it does:** Checks for use of `.skip(x).next()` on iterators.
893 /// **Why is this bad?** `.nth(x)` is cleaner
895 /// **Known problems:** None.
899 /// let some_vec = vec![0, 1, 2, 3];
900 /// let bad_vec = some_vec.iter().skip(3).next();
901 /// let bad_slice = &some_vec[..].iter().skip(3).next();
903 /// The correct use would be:
905 /// let some_vec = vec![0, 1, 2, 3];
906 /// let bad_vec = some_vec.iter().nth(3);
907 /// let bad_slice = &some_vec[..].iter().nth(3);
911 "using `.skip(x).next()` on an iterator"
914 declare_clippy_lint! {
915 /// **What it does:** Checks for use of `.get().unwrap()` (or
916 /// `.get_mut().unwrap`) on a standard library type which implements `Index`
918 /// **Why is this bad?** Using the Index trait (`[]`) is more clear and more
921 /// **Known problems:** Not a replacement for error handling: Using either
922 /// `.unwrap()` or the Index trait (`[]`) carries the risk of causing a `panic`
923 /// if the value being accessed is `None`. If the use of `.get().unwrap()` is a
924 /// temporary placeholder for dealing with the `Option` type, then this does
925 /// not mitigate the need for error handling. If there is a chance that `.get()`
926 /// will be `None` in your program, then it is advisable that the `None` case
927 /// is handled in a future refactor instead of using `.unwrap()` or the Index
932 /// let mut some_vec = vec![0, 1, 2, 3];
933 /// let last = some_vec.get(3).unwrap();
934 /// *some_vec.get_mut(0).unwrap() = 1;
936 /// The correct use would be:
938 /// let mut some_vec = vec![0, 1, 2, 3];
939 /// let last = some_vec[3];
944 "using `.get().unwrap()` or `.get_mut().unwrap()` when using `[]` would work instead"
947 declare_clippy_lint! {
948 /// **What it does:** Checks for the use of `.extend(s.chars())` where s is a
949 /// `&str` or `String`.
951 /// **Why is this bad?** `.push_str(s)` is clearer
953 /// **Known problems:** None.
958 /// let def = String::from("def");
959 /// let mut s = String::new();
960 /// s.extend(abc.chars());
961 /// s.extend(def.chars());
963 /// The correct use would be:
966 /// let def = String::from("def");
967 /// let mut s = String::new();
969 /// s.push_str(&def);
971 pub STRING_EXTEND_CHARS,
973 "using `x.extend(s.chars())` where s is a `&str` or `String`"
976 declare_clippy_lint! {
977 /// **What it does:** Checks for the use of `.cloned().collect()` on slice to
980 /// **Why is this bad?** `.to_vec()` is clearer
982 /// **Known problems:** None.
986 /// let s = [1, 2, 3, 4, 5];
987 /// let s2: Vec<isize> = s[..].iter().cloned().collect();
989 /// The better use would be:
991 /// let s = [1, 2, 3, 4, 5];
992 /// let s2: Vec<isize> = s.to_vec();
994 pub ITER_CLONED_COLLECT,
996 "using `.cloned().collect()` on slice to create a `Vec`"
999 declare_clippy_lint! {
1000 /// **What it does:** Checks for usage of `_.chars().last()` or
1001 /// `_.chars().next_back()` on a `str` to check if it ends with a given char.
1003 /// **Why is this bad?** Readability, this can be written more concisely as
1004 /// `_.ends_with(_)`.
1006 /// **Known problems:** None.
1010 /// # let name = "_";
1013 /// name.chars().last() == Some('_') || name.chars().next_back() == Some('-');
1016 /// name.ends_with('_') || name.ends_with('-');
1020 "using `.chars().last()` or `.chars().next_back()` to check if a string ends with a char"
1023 declare_clippy_lint! {
1024 /// **What it does:** Checks for usage of `.as_ref()` or `.as_mut()` where the
1025 /// types before and after the call are the same.
1027 /// **Why is this bad?** The call is unnecessary.
1029 /// **Known problems:** None.
1033 /// # fn do_stuff(x: &[i32]) {}
1034 /// let x: &[i32] = &[1, 2, 3, 4, 5];
1035 /// do_stuff(x.as_ref());
1037 /// The correct use would be:
1039 /// # fn do_stuff(x: &[i32]) {}
1040 /// let x: &[i32] = &[1, 2, 3, 4, 5];
1045 "using `as_ref` where the types before and after the call are the same"
1048 declare_clippy_lint! {
1049 /// **What it does:** Checks for using `fold` when a more succinct alternative exists.
1050 /// Specifically, this checks for `fold`s which could be replaced by `any`, `all`,
1051 /// `sum` or `product`.
1053 /// **Why is this bad?** Readability.
1055 /// **Known problems:** False positive in pattern guards. Will be resolved once
1056 /// non-lexical lifetimes are stable.
1060 /// let _ = (0..3).fold(false, |acc, x| acc || x > 2);
1062 /// This could be written as:
1064 /// let _ = (0..3).any(|x| x > 2);
1066 pub UNNECESSARY_FOLD,
1068 "using `fold` when a more succinct alternative exists"
1071 declare_clippy_lint! {
1072 /// **What it does:** Checks for `filter_map` calls which could be replaced by `filter` or `map`.
1073 /// More specifically it checks if the closure provided is only performing one of the
1074 /// filter or map operations and suggests the appropriate option.
1076 /// **Why is this bad?** Complexity. The intent is also clearer if only a single
1077 /// operation is being performed.
1079 /// **Known problems:** None
1083 /// let _ = (0..3).filter_map(|x| if x > 2 { Some(x) } else { None });
1085 /// // As there is no transformation of the argument this could be written as:
1086 /// let _ = (0..3).filter(|&x| x > 2);
1090 /// let _ = (0..4).filter_map(|x| Some(x + 1));
1092 /// // As there is no conditional check on the argument this could be written as:
1093 /// let _ = (0..4).map(|x| x + 1);
1095 pub UNNECESSARY_FILTER_MAP,
1097 "using `filter_map` when a more succinct alternative exists"
1100 declare_clippy_lint! {
1101 /// **What it does:** Checks for `into_iter` calls on references which should be replaced by `iter`
1104 /// **Why is this bad?** Readability. Calling `into_iter` on a reference will not move out its
1105 /// content into the resulting iterator, which is confusing. It is better just call `iter` or
1106 /// `iter_mut` directly.
1108 /// **Known problems:** None
1114 /// let _ = (&vec![3, 4, 5]).into_iter();
1117 /// let _ = (&vec![3, 4, 5]).iter();
1119 pub INTO_ITER_ON_REF,
1121 "using `.into_iter()` on a reference"
1124 declare_clippy_lint! {
1125 /// **What it does:** Checks for calls to `map` followed by a `count`.
1127 /// **Why is this bad?** It looks suspicious. Maybe `map` was confused with `filter`.
1128 /// If the `map` call is intentional, this should be rewritten. Or, if you intend to
1129 /// drive the iterator to completion, you can just use `for_each` instead.
1131 /// **Known problems:** None
1136 /// let _ = (0..3).map(|x| x + 2).count();
1140 "suspicious usage of map"
1143 declare_clippy_lint! {
1144 /// **What it does:** Checks for `MaybeUninit::uninit().assume_init()`.
1146 /// **Why is this bad?** For most types, this is undefined behavior.
1148 /// **Known problems:** For now, we accept empty tuples and tuples / arrays
1149 /// of `MaybeUninit`. There may be other types that allow uninitialized
1150 /// data, but those are not yet rigorously defined.
1155 /// // Beware the UB
1156 /// use std::mem::MaybeUninit;
1158 /// let _: usize = unsafe { MaybeUninit::uninit().assume_init() };
1161 /// Note that the following is OK:
1164 /// use std::mem::MaybeUninit;
1166 /// let _: [MaybeUninit<bool>; 5] = unsafe {
1167 /// MaybeUninit::uninit().assume_init()
1170 pub UNINIT_ASSUMED_INIT,
1172 "`MaybeUninit::uninit().assume_init()`"
1175 declare_clippy_lint! {
1176 /// **What it does:** Checks for `.checked_add/sub(x).unwrap_or(MAX/MIN)`.
1178 /// **Why is this bad?** These can be written simply with `saturating_add/sub` methods.
1183 /// # let y: u32 = 0;
1184 /// # let x: u32 = 100;
1185 /// let add = x.checked_add(y).unwrap_or(u32::MAX);
1186 /// let sub = x.checked_sub(y).unwrap_or(u32::MIN);
1189 /// can be written using dedicated methods for saturating addition/subtraction as:
1192 /// # let y: u32 = 0;
1193 /// # let x: u32 = 100;
1194 /// let add = x.saturating_add(y);
1195 /// let sub = x.saturating_sub(y);
1197 pub MANUAL_SATURATING_ARITHMETIC,
1199 "`.chcked_add/sub(x).unwrap_or(MAX/MIN)`"
1202 declare_clippy_lint! {
1203 /// **What it does:** Checks for `offset(_)`, `wrapping_`{`add`, `sub`}, etc. on raw pointers to
1204 /// zero-sized types
1206 /// **Why is this bad?** This is a no-op, and likely unintended
1208 /// **Known problems:** None
1212 /// unsafe { (&() as *const ()).offset(1) };
1216 "Check for offset calculations on raw pointers to zero-sized types"
1219 declare_clippy_lint! {
1220 /// **What it does:** Checks for `FileType::is_file()`.
1222 /// **Why is this bad?** When people testing a file type with `FileType::is_file`
1223 /// they are testing whether a path is something they can get bytes from. But
1224 /// `is_file` doesn't cover special file types in unix-like systems, and doesn't cover
1225 /// symlink in windows. Using `!FileType::is_dir()` is a better way to that intention.
1231 /// let metadata = std::fs::metadata("foo.txt")?;
1232 /// let filetype = metadata.file_type();
1234 /// if filetype.is_file() {
1237 /// # Ok::<_, std::io::Error>(())
1241 /// should be written as:
1245 /// let metadata = std::fs::metadata("foo.txt")?;
1246 /// let filetype = metadata.file_type();
1248 /// if !filetype.is_dir() {
1251 /// # Ok::<_, std::io::Error>(())
1254 pub FILETYPE_IS_FILE,
1256 "`FileType::is_file` is not recommended to test for readable file type"
1259 declare_clippy_lint! {
1260 /// **What it does:** Checks for usage of `_.as_ref().map(Deref::deref)` or it's aliases (such as String::as_str).
1262 /// **Why is this bad?** Readability, this can be written more concisely as a
1263 /// single method call.
1265 /// **Known problems:** None.
1269 /// # let opt = Some("".to_string());
1270 /// opt.as_ref().map(String::as_str)
1273 /// Can be written as
1275 /// # let opt = Some("".to_string());
1279 pub OPTION_AS_REF_DEREF,
1281 "using `as_ref().map(Deref::deref)`, which is more succinctly expressed as `as_deref()`"
1284 declare_clippy_lint! {
1285 /// **What it does:** Checks for usage of `iter().next()` on a Slice or an Array
1287 /// **Why is this bad?** These can be shortened into `.get()`
1289 /// **Known problems:** None.
1293 /// # let a = [1, 2, 3];
1294 /// # let b = vec![1, 2, 3];
1295 /// a[2..].iter().next();
1296 /// b.iter().next();
1298 /// should be written as:
1300 /// # let a = [1, 2, 3];
1301 /// # let b = vec![1, 2, 3];
1305 pub ITER_NEXT_SLICE,
1307 "using `.iter().next()` on a sliced array, which can be shortened to just `.get()`"
1310 declare_lint_pass!(Methods => [
1313 SHOULD_IMPLEMENT_TRAIT,
1314 WRONG_SELF_CONVENTION,
1315 WRONG_PUB_SELF_CONVENTION,
1318 RESULT_MAP_OR_INTO_OPTION,
1320 BIND_INSTEAD_OF_MAP,
1328 INEFFICIENT_TO_STRING,
1330 SINGLE_CHAR_PATTERN,
1332 TEMPORARY_CSTRING_AS_PTR,
1340 ITERATOR_STEP_BY_ZERO,
1346 STRING_EXTEND_CHARS,
1347 ITER_CLONED_COLLECT,
1350 UNNECESSARY_FILTER_MAP,
1353 UNINIT_ASSUMED_INIT,
1354 MANUAL_SATURATING_ARITHMETIC,
1357 OPTION_AS_REF_DEREF,
1360 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for Methods {
1361 #[allow(clippy::too_many_lines)]
1362 fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, expr: &'tcx hir::Expr<'_>) {
1363 if in_macro(expr.span) {
1367 let (method_names, arg_lists, method_spans) = method_calls(expr, 2);
1368 let method_names: Vec<SymbolStr> = method_names.iter().map(|s| s.as_str()).collect();
1369 let method_names: Vec<&str> = method_names.iter().map(|s| &**s).collect();
1371 match method_names.as_slice() {
1372 ["unwrap", "get"] => lint_get_unwrap(cx, expr, arg_lists[1], false),
1373 ["unwrap", "get_mut"] => lint_get_unwrap(cx, expr, arg_lists[1], true),
1374 ["unwrap", ..] => lint_unwrap(cx, expr, arg_lists[0]),
1375 ["expect", "ok"] => lint_ok_expect(cx, expr, arg_lists[1]),
1376 ["expect", ..] => lint_expect(cx, expr, arg_lists[0]),
1377 ["unwrap_or", "map"] => option_map_unwrap_or::lint(cx, expr, arg_lists[1], arg_lists[0], method_spans[1]),
1378 ["unwrap_or_else", "map"] => lint_map_unwrap_or_else(cx, expr, arg_lists[1], arg_lists[0]),
1379 ["map_or", ..] => lint_map_or_none(cx, expr, arg_lists[0]),
1380 ["and_then", ..] => {
1381 bind_instead_of_map::OptionAndThenSome::lint(cx, expr, arg_lists[0]);
1382 bind_instead_of_map::ResultAndThenOk::lint(cx, expr, arg_lists[0]);
1384 ["or_else", ..] => {
1385 bind_instead_of_map::ResultOrElseErrInfo::lint(cx, expr, arg_lists[0]);
1387 ["next", "filter"] => lint_filter_next(cx, expr, arg_lists[1]),
1388 ["next", "skip_while"] => lint_skip_while_next(cx, expr, arg_lists[1]),
1389 ["next", "iter"] => lint_iter_next(cx, expr, arg_lists[1]),
1390 ["map", "filter"] => lint_filter_map(cx, expr, arg_lists[1], arg_lists[0]),
1391 ["map", "filter_map"] => lint_filter_map_map(cx, expr, arg_lists[1], arg_lists[0]),
1392 ["next", "filter_map"] => lint_filter_map_next(cx, expr, arg_lists[1]),
1393 ["map", "find"] => lint_find_map(cx, expr, arg_lists[1], arg_lists[0]),
1394 ["flat_map", "filter"] => lint_filter_flat_map(cx, expr, arg_lists[1], arg_lists[0]),
1395 ["flat_map", "filter_map"] => lint_filter_map_flat_map(cx, expr, arg_lists[1], arg_lists[0]),
1396 ["flat_map", ..] => lint_flat_map_identity(cx, expr, arg_lists[0], method_spans[0]),
1397 ["flatten", "map"] => lint_map_flatten(cx, expr, arg_lists[1]),
1398 ["is_some", "find"] => lint_search_is_some(cx, expr, "find", arg_lists[1], arg_lists[0], method_spans[1]),
1399 ["is_some", "position"] => {
1400 lint_search_is_some(cx, expr, "position", arg_lists[1], arg_lists[0], method_spans[1])
1402 ["is_some", "rposition"] => {
1403 lint_search_is_some(cx, expr, "rposition", arg_lists[1], arg_lists[0], method_spans[1])
1405 ["extend", ..] => lint_extend(cx, expr, arg_lists[0]),
1406 ["as_ptr", "unwrap" | "expect"] => lint_cstring_as_ptr(cx, expr, &arg_lists[1][0], &arg_lists[0][0]),
1407 ["nth", "iter"] => lint_iter_nth(cx, expr, &arg_lists, false),
1408 ["nth", "iter_mut"] => lint_iter_nth(cx, expr, &arg_lists, true),
1409 ["nth", ..] => lint_iter_nth_zero(cx, expr, arg_lists[0]),
1410 ["step_by", ..] => lint_step_by(cx, expr, arg_lists[0]),
1411 ["next", "skip"] => lint_iter_skip_next(cx, expr),
1412 ["collect", "cloned"] => lint_iter_cloned_collect(cx, expr, arg_lists[1]),
1413 ["as_ref"] => lint_asref(cx, expr, "as_ref", arg_lists[0]),
1414 ["as_mut"] => lint_asref(cx, expr, "as_mut", arg_lists[0]),
1415 ["fold", ..] => lint_unnecessary_fold(cx, expr, arg_lists[0], method_spans[0]),
1416 ["filter_map", ..] => unnecessary_filter_map::lint(cx, expr, arg_lists[0]),
1417 ["count", "map"] => lint_suspicious_map(cx, expr),
1418 ["assume_init"] => lint_maybe_uninit(cx, &arg_lists[0][0], expr),
1419 ["unwrap_or", arith @ ("checked_add" | "checked_sub" | "checked_mul")] => {
1420 manual_saturating_arithmetic::lint(cx, expr, &arg_lists, &arith["checked_".len()..])
1422 ["add" | "offset" | "sub" | "wrapping_offset" | "wrapping_add" | "wrapping_sub"] => {
1423 check_pointer_offset(cx, expr, arg_lists[0])
1425 ["is_file", ..] => lint_filetype_is_file(cx, expr, arg_lists[0]),
1426 ["map", "as_ref"] => lint_option_as_ref_deref(cx, expr, arg_lists[1], arg_lists[0], false),
1427 ["map", "as_mut"] => lint_option_as_ref_deref(cx, expr, arg_lists[1], arg_lists[0], true),
1432 hir::ExprKind::MethodCall(ref method_call, ref method_span, ref args, _) => {
1433 lint_or_fun_call(cx, expr, *method_span, &method_call.ident.as_str(), args);
1434 lint_expect_fun_call(cx, expr, *method_span, &method_call.ident.as_str(), args);
1436 let self_ty = cx.tables.expr_ty_adjusted(&args[0]);
1437 if args.len() == 1 && method_call.ident.name == sym!(clone) {
1438 lint_clone_on_copy(cx, expr, &args[0], self_ty);
1439 lint_clone_on_ref_ptr(cx, expr, &args[0]);
1441 if args.len() == 1 && method_call.ident.name == sym!(to_string) {
1442 inefficient_to_string::lint(cx, expr, &args[0], self_ty);
1445 match self_ty.kind {
1446 ty::Ref(_, ty, _) if ty.kind == ty::Str => {
1447 for &(method, pos) in &PATTERN_METHODS {
1448 if method_call.ident.name.as_str() == method && args.len() > pos {
1449 lint_single_char_pattern(cx, expr, &args[pos]);
1453 ty::Ref(..) if method_call.ident.name == sym!(into_iter) => {
1454 lint_into_iter(cx, expr, self_ty, *method_span);
1459 hir::ExprKind::Binary(op, ref lhs, ref rhs)
1460 if op.node == hir::BinOpKind::Eq || op.node == hir::BinOpKind::Ne =>
1462 let mut info = BinaryExprInfo {
1466 eq: op.node == hir::BinOpKind::Eq,
1468 lint_binary_expr_with_method_call(cx, &mut info);
1474 fn check_impl_item(&mut self, cx: &LateContext<'a, 'tcx>, impl_item: &'tcx hir::ImplItem<'_>) {
1475 if in_external_macro(cx.sess(), impl_item.span) {
1478 let name = impl_item.ident.name.as_str();
1479 let parent = cx.tcx.hir().get_parent_item(impl_item.hir_id);
1480 let item = cx.tcx.hir().expect_item(parent);
1481 let def_id = cx.tcx.hir().local_def_id(item.hir_id);
1482 let self_ty = cx.tcx.type_of(def_id);
1484 if let hir::ImplItemKind::Fn(ref sig, id) = impl_item.kind;
1485 if let Some(first_arg) = iter_input_pats(&sig.decl, cx.tcx.hir().body(id)).next();
1486 if let hir::ItemKind::Impl{ of_trait: None, .. } = item.kind;
1488 let method_def_id = cx.tcx.hir().local_def_id(impl_item.hir_id);
1489 let method_sig = cx.tcx.fn_sig(method_def_id);
1490 let method_sig = cx.tcx.erase_late_bound_regions(&method_sig);
1492 let first_arg_ty = &method_sig.inputs().iter().next();
1494 // check conventions w.r.t. conversion method names and predicates
1495 if let Some(first_arg_ty) = first_arg_ty;
1498 if cx.access_levels.is_exported(impl_item.hir_id) {
1499 // check missing trait implementations
1500 for &(method_name, n_args, fn_header, self_kind, out_type, trait_name) in &TRAIT_METHODS {
1501 if name == method_name &&
1502 sig.decl.inputs.len() == n_args &&
1503 out_type.matches(cx, &sig.decl.output) &&
1504 self_kind.matches(cx, self_ty, first_arg_ty) &&
1505 fn_header_equals(*fn_header, sig.header) {
1506 span_lint(cx, SHOULD_IMPLEMENT_TRAIT, impl_item.span, &format!(
1507 "defining a method called `{}` on this type; consider implementing \
1508 the `{}` trait or choosing a less ambiguous name", name, trait_name));
1513 if let Some((ref conv, self_kinds)) = &CONVENTIONS
1515 .find(|(ref conv, _)| conv.check(&name))
1517 if !self_kinds.iter().any(|k| k.matches(cx, self_ty, first_arg_ty)) {
1518 let lint = if item.vis.node.is_pub() {
1519 WRONG_PUB_SELF_CONVENTION
1521 WRONG_SELF_CONVENTION
1528 &format!("methods called `{}` usually take {}; consider choosing a less ambiguous name",
1532 .map(|k| k.description())
1533 .collect::<Vec<_>>()
1542 if let hir::ImplItemKind::Fn(_, _) = impl_item.kind {
1543 let ret_ty = return_ty(cx, impl_item.hir_id);
1545 let contains_self_ty = |ty: Ty<'tcx>| {
1546 ty.walk().any(|inner| match inner.unpack() {
1547 GenericArgKind::Type(inner_ty) => TyS::same_type(self_ty, inner_ty),
1549 GenericArgKind::Lifetime(_) | GenericArgKind::Const(_) => false,
1553 // walk the return type and check for Self (this does not check associated types)
1554 if contains_self_ty(ret_ty) {
1558 // if return type is impl trait, check the associated types
1559 if let ty::Opaque(def_id, _) = ret_ty.kind {
1560 // one of the associated types must be Self
1561 for predicate in cx.tcx.predicates_of(def_id).predicates {
1562 if let ty::PredicateKind::Projection(poly_projection_predicate) = predicate.0.kind() {
1563 let binder = poly_projection_predicate.ty();
1564 let associated_type = binder.skip_binder();
1566 // walk the associated type and check for Self
1567 if contains_self_ty(associated_type) {
1574 if name == "new" && !TyS::same_type(ret_ty, self_ty) {
1579 "methods called `new` usually return `Self`",
1586 /// Checks for the `OR_FUN_CALL` lint.
1587 #[allow(clippy::too_many_lines)]
1588 fn lint_or_fun_call<'a, 'tcx>(
1589 cx: &LateContext<'a, 'tcx>,
1590 expr: &hir::Expr<'_>,
1593 args: &'tcx [hir::Expr<'_>],
1595 // Searches an expression for method calls or function calls that aren't ctors
1596 struct FunCallFinder<'a, 'tcx> {
1597 cx: &'a LateContext<'a, 'tcx>,
1601 impl<'a, 'tcx> intravisit::Visitor<'tcx> for FunCallFinder<'a, 'tcx> {
1602 type Map = Map<'tcx>;
1604 fn visit_expr(&mut self, expr: &'tcx hir::Expr<'_>) {
1605 let call_found = match &expr.kind {
1606 // ignore enum and struct constructors
1607 hir::ExprKind::Call(..) => !is_ctor_or_promotable_const_function(self.cx, expr),
1608 hir::ExprKind::MethodCall(..) => true,
1617 intravisit::walk_expr(self, expr);
1621 fn nested_visit_map(&mut self) -> intravisit::NestedVisitorMap<Self::Map> {
1622 intravisit::NestedVisitorMap::None
1626 /// Checks for `unwrap_or(T::new())` or `unwrap_or(T::default())`.
1627 fn check_unwrap_or_default(
1628 cx: &LateContext<'_, '_>,
1630 fun: &hir::Expr<'_>,
1631 self_expr: &hir::Expr<'_>,
1632 arg: &hir::Expr<'_>,
1638 if name == "unwrap_or";
1639 if let hir::ExprKind::Path(ref qpath) = fun.kind;
1640 let path = &*last_path_segment(qpath).ident.as_str();
1641 if ["default", "new"].contains(&path);
1642 let arg_ty = cx.tables.expr_ty(arg);
1643 if let Some(default_trait_id) = get_trait_def_id(cx, &paths::DEFAULT_TRAIT);
1644 if implements_trait(cx, arg_ty, default_trait_id, &[]);
1647 let mut applicability = Applicability::MachineApplicable;
1652 &format!("use of `{}` followed by a call to `{}`", name, path),
1655 "{}.unwrap_or_default()",
1656 snippet_with_applicability(cx, self_expr.span, "_", &mut applicability)
1668 /// Checks for `*or(foo())`.
1669 #[allow(clippy::too_many_arguments)]
1670 fn check_general_case<'a, 'tcx>(
1671 cx: &LateContext<'a, 'tcx>,
1675 self_expr: &hir::Expr<'_>,
1676 arg: &'tcx hir::Expr<'_>,
1680 if let hir::ExprKind::MethodCall(ref path, _, ref args, _) = &arg.kind {
1681 if path.ident.as_str() == "len" {
1682 let ty = walk_ptrs_ty(cx.tables.expr_ty(&args[0]));
1685 ty::Slice(_) | ty::Array(_, _) => return,
1689 if match_type(cx, ty, &paths::VEC) {
1695 // (path, fn_has_argument, methods, suffix)
1696 let know_types: &[(&[_], _, &[_], _)] = &[
1697 (&paths::BTREEMAP_ENTRY, false, &["or_insert"], "with"),
1698 (&paths::HASHMAP_ENTRY, false, &["or_insert"], "with"),
1699 (&paths::OPTION, false, &["map_or", "ok_or", "or", "unwrap_or"], "else"),
1700 (&paths::RESULT, true, &["or", "unwrap_or"], "else"),
1704 if know_types.iter().any(|k| k.2.contains(&name));
1706 let mut finder = FunCallFinder { cx: &cx, found: false };
1707 if { finder.visit_expr(&arg); finder.found };
1708 if !contains_return(&arg);
1710 let self_ty = cx.tables.expr_ty(self_expr);
1712 if let Some(&(_, fn_has_arguments, poss, suffix)) =
1713 know_types.iter().find(|&&i| match_type(cx, self_ty, i.0));
1715 if poss.contains(&name);
1718 let sugg: Cow<'_, _> = match (fn_has_arguments, !or_has_args) {
1719 (true, _) => format!("|_| {}", snippet_with_macro_callsite(cx, arg.span, "..")).into(),
1720 (false, false) => format!("|| {}", snippet_with_macro_callsite(cx, arg.span, "..")).into(),
1721 (false, true) => snippet_with_macro_callsite(cx, fun_span, ".."),
1723 let span_replace_word = method_span.with_hi(span.hi());
1728 &format!("use of `{}` followed by a function call", name),
1730 format!("{}_{}({})", name, suffix, sugg),
1731 Applicability::HasPlaceholders,
1737 if args.len() == 2 {
1738 match args[1].kind {
1739 hir::ExprKind::Call(ref fun, ref or_args) => {
1740 let or_has_args = !or_args.is_empty();
1741 if !check_unwrap_or_default(cx, name, fun, &args[0], &args[1], or_has_args, expr.span) {
1754 hir::ExprKind::MethodCall(_, span, ref or_args, _) => check_general_case(
1761 !or_args.is_empty(),
1769 /// Checks for the `EXPECT_FUN_CALL` lint.
1770 #[allow(clippy::too_many_lines)]
1771 fn lint_expect_fun_call(
1772 cx: &LateContext<'_, '_>,
1773 expr: &hir::Expr<'_>,
1776 args: &[hir::Expr<'_>],
1778 // Strip `&`, `as_ref()` and `as_str()` off `arg` until we're left with either a `String` or
1780 fn get_arg_root<'a>(cx: &LateContext<'_, '_>, arg: &'a hir::Expr<'a>) -> &'a hir::Expr<'a> {
1781 let mut arg_root = arg;
1783 arg_root = match &arg_root.kind {
1784 hir::ExprKind::AddrOf(hir::BorrowKind::Ref, _, expr) => expr,
1785 hir::ExprKind::MethodCall(method_name, _, call_args, _) => {
1786 if call_args.len() == 1
1787 && (method_name.ident.name == sym!(as_str) || method_name.ident.name == sym!(as_ref))
1789 let arg_type = cx.tables.expr_ty(&call_args[0]);
1790 let base_type = walk_ptrs_ty(arg_type);
1791 base_type.kind == ty::Str || is_type_diagnostic_item(cx, base_type, sym!(string_type))
1805 // Only `&'static str` or `String` can be used directly in the `panic!`. Other types should be
1806 // converted to string.
1807 fn requires_to_string(cx: &LateContext<'_, '_>, arg: &hir::Expr<'_>) -> bool {
1808 let arg_ty = cx.tables.expr_ty(arg);
1809 if is_type_diagnostic_item(cx, arg_ty, sym!(string_type)) {
1812 if let ty::Ref(_, ty, ..) = arg_ty.kind {
1813 if ty.kind == ty::Str && can_be_static_str(cx, arg) {
1820 // Check if an expression could have type `&'static str`, knowing that it
1821 // has type `&str` for some lifetime.
1822 fn can_be_static_str(cx: &LateContext<'_, '_>, arg: &hir::Expr<'_>) -> bool {
1824 hir::ExprKind::Lit(_) => true,
1825 hir::ExprKind::Call(fun, _) => {
1826 if let hir::ExprKind::Path(ref p) = fun.kind {
1827 match cx.tables.qpath_res(p, fun.hir_id) {
1828 hir::def::Res::Def(hir::def::DefKind::Fn | hir::def::DefKind::AssocFn, def_id) => matches!(
1829 cx.tcx.fn_sig(def_id).output().skip_binder().kind,
1830 ty::Ref(ty::ReStatic, ..)
1838 hir::ExprKind::MethodCall(..) => cx.tables.type_dependent_def_id(arg.hir_id).map_or(false, |method_id| {
1840 cx.tcx.fn_sig(method_id).output().skip_binder().kind,
1841 ty::Ref(ty::ReStatic, ..)
1844 hir::ExprKind::Path(ref p) => match cx.tables.qpath_res(p, arg.hir_id) {
1845 hir::def::Res::Def(hir::def::DefKind::Const | hir::def::DefKind::Static, _) => true,
1852 fn generate_format_arg_snippet(
1853 cx: &LateContext<'_, '_>,
1855 applicability: &mut Applicability,
1858 if let hir::ExprKind::AddrOf(hir::BorrowKind::Ref, _, ref format_arg) = a.kind;
1859 if let hir::ExprKind::Match(ref format_arg_expr, _, _) = format_arg.kind;
1860 if let hir::ExprKind::Tup(ref format_arg_expr_tup) = format_arg_expr.kind;
1865 .map(|a| snippet_with_applicability(cx, a.span, "..", applicability).into_owned())
1873 fn is_call(node: &hir::ExprKind<'_>) -> bool {
1875 hir::ExprKind::AddrOf(hir::BorrowKind::Ref, _, expr) => {
1878 hir::ExprKind::Call(..)
1879 | hir::ExprKind::MethodCall(..)
1880 // These variants are debatable or require further examination
1881 | hir::ExprKind::Match(..)
1882 | hir::ExprKind::Block{ .. } => true,
1887 if args.len() != 2 || name != "expect" || !is_call(&args[1].kind) {
1891 let receiver_type = cx.tables.expr_ty_adjusted(&args[0]);
1892 let closure_args = if is_type_diagnostic_item(cx, receiver_type, sym!(option_type)) {
1894 } else if is_type_diagnostic_item(cx, receiver_type, sym!(result_type)) {
1900 let arg_root = get_arg_root(cx, &args[1]);
1902 let span_replace_word = method_span.with_hi(expr.span.hi());
1904 let mut applicability = Applicability::MachineApplicable;
1906 //Special handling for `format!` as arg_root
1908 if let hir::ExprKind::Block(block, None) = &arg_root.kind;
1909 if block.stmts.len() == 1;
1910 if let hir::StmtKind::Local(local) = &block.stmts[0].kind;
1911 if let Some(arg_root) = &local.init;
1912 if let hir::ExprKind::Call(ref inner_fun, ref inner_args) = arg_root.kind;
1913 if is_expn_of(inner_fun.span, "format").is_some() && inner_args.len() == 1;
1914 if let hir::ExprKind::Call(_, format_args) = &inner_args[0].kind;
1916 let fmt_spec = &format_args[0];
1917 let fmt_args = &format_args[1];
1919 let mut args = vec![snippet(cx, fmt_spec.span, "..").into_owned()];
1921 args.extend(generate_format_arg_snippet(cx, fmt_args, &mut applicability));
1923 let sugg = args.join(", ");
1929 &format!("use of `{}` followed by a function call", name),
1931 format!("unwrap_or_else({} panic!({}))", closure_args, sugg),
1939 let mut arg_root_snippet: Cow<'_, _> = snippet_with_applicability(cx, arg_root.span, "..", &mut applicability);
1940 if requires_to_string(cx, arg_root) {
1941 arg_root_snippet.to_mut().push_str(".to_string()");
1948 &format!("use of `{}` followed by a function call", name),
1950 format!("unwrap_or_else({} {{ panic!({}) }})", closure_args, arg_root_snippet),
1955 /// Checks for the `CLONE_ON_COPY` lint.
1956 fn lint_clone_on_copy(cx: &LateContext<'_, '_>, expr: &hir::Expr<'_>, arg: &hir::Expr<'_>, arg_ty: Ty<'_>) {
1957 let ty = cx.tables.expr_ty(expr);
1958 if let ty::Ref(_, inner, _) = arg_ty.kind {
1959 if let ty::Ref(_, innermost, _) = inner.kind {
1964 "using `clone` on a double-reference; \
1965 this will copy the reference instead of cloning the inner type",
1967 if let Some(snip) = sugg::Sugg::hir_opt(cx, arg) {
1968 let mut ty = innermost;
1970 while let ty::Ref(_, inner, _) = ty.kind {
1974 let refs: String = iter::repeat('&').take(n + 1).collect();
1975 let derefs: String = iter::repeat('*').take(n).collect();
1976 let explicit = format!("<{}{}>::clone({})", refs, ty, snip);
1977 diag.span_suggestion(
1979 "try dereferencing it",
1980 format!("{}({}{}).clone()", refs, derefs, snip.deref()),
1981 Applicability::MaybeIncorrect,
1983 diag.span_suggestion(
1985 "or try being explicit if you are sure, that you want to clone a reference",
1987 Applicability::MaybeIncorrect,
1992 return; // don't report clone_on_copy
1996 if is_copy(cx, ty) {
1998 if let Some(snippet) = sugg::Sugg::hir_opt(cx, arg) {
1999 let parent = cx.tcx.hir().get_parent_node(expr.hir_id);
2000 match &cx.tcx.hir().get(parent) {
2001 hir::Node::Expr(parent) => match parent.kind {
2002 // &*x is a nop, &x.clone() is not
2003 hir::ExprKind::AddrOf(..) => return,
2004 // (*x).func() is useless, x.clone().func() can work in case func borrows mutably
2005 hir::ExprKind::MethodCall(_, _, parent_args, _) if expr.hir_id == parent_args[0].hir_id => return,
2009 hir::Node::Stmt(stmt) => {
2010 if let hir::StmtKind::Local(ref loc) = stmt.kind {
2011 if let hir::PatKind::Ref(..) = loc.pat.kind {
2012 // let ref y = *x borrows x, let ref y = x.clone() does not
2020 // x.clone() might have dereferenced x, possibly through Deref impls
2021 if cx.tables.expr_ty(arg) == ty {
2022 snip = Some(("try removing the `clone` call", format!("{}", snippet)));
2024 let deref_count = cx
2026 .expr_adjustments(arg)
2029 if let ty::adjustment::Adjust::Deref(_) = adj.kind {
2036 let derefs: String = iter::repeat('*').take(deref_count).collect();
2037 snip = Some(("try dereferencing it", format!("{}{}", derefs, snippet)));
2042 span_lint_and_then(cx, CLONE_ON_COPY, expr.span, "using `clone` on a `Copy` type", |diag| {
2043 if let Some((text, snip)) = snip {
2044 diag.span_suggestion(expr.span, text, snip, Applicability::Unspecified);
2050 fn lint_clone_on_ref_ptr(cx: &LateContext<'_, '_>, expr: &hir::Expr<'_>, arg: &hir::Expr<'_>) {
2051 let obj_ty = walk_ptrs_ty(cx.tables.expr_ty(arg));
2053 if let ty::Adt(_, subst) = obj_ty.kind {
2054 let caller_type = if is_type_diagnostic_item(cx, obj_ty, sym::Rc) {
2056 } else if is_type_diagnostic_item(cx, obj_ty, sym::Arc) {
2058 } else if match_type(cx, obj_ty, &paths::WEAK_RC) || match_type(cx, obj_ty, &paths::WEAK_ARC) {
2068 "using `.clone()` on a ref-counted pointer",
2071 "{}::<{}>::clone(&{})",
2074 snippet(cx, arg.span, "_")
2076 Applicability::Unspecified, // Sometimes unnecessary ::<_> after Rc/Arc/Weak
2081 fn lint_string_extend(cx: &LateContext<'_, '_>, expr: &hir::Expr<'_>, args: &[hir::Expr<'_>]) {
2083 if let Some(arglists) = method_chain_args(arg, &["chars"]) {
2084 let target = &arglists[0][0];
2085 let self_ty = walk_ptrs_ty(cx.tables.expr_ty(target));
2086 let ref_str = if self_ty.kind == ty::Str {
2088 } else if is_type_diagnostic_item(cx, self_ty, sym!(string_type)) {
2094 let mut applicability = Applicability::MachineApplicable;
2097 STRING_EXTEND_CHARS,
2099 "calling `.extend(_.chars())`",
2102 "{}.push_str({}{})",
2103 snippet_with_applicability(cx, args[0].span, "_", &mut applicability),
2105 snippet_with_applicability(cx, target.span, "_", &mut applicability)
2112 fn lint_extend(cx: &LateContext<'_, '_>, expr: &hir::Expr<'_>, args: &[hir::Expr<'_>]) {
2113 let obj_ty = walk_ptrs_ty(cx.tables.expr_ty(&args[0]));
2114 if is_type_diagnostic_item(cx, obj_ty, sym!(string_type)) {
2115 lint_string_extend(cx, expr, args);
2119 fn lint_cstring_as_ptr(cx: &LateContext<'_, '_>, expr: &hir::Expr<'_>, source: &hir::Expr<'_>, unwrap: &hir::Expr<'_>) {
2121 let source_type = cx.tables.expr_ty(source);
2122 if let ty::Adt(def, substs) = source_type.kind;
2123 if cx.tcx.is_diagnostic_item(sym!(result_type), def.did);
2124 if match_type(cx, substs.type_at(0), &paths::CSTRING);
2128 TEMPORARY_CSTRING_AS_PTR,
2130 "you are getting the inner pointer of a temporary `CString`",
2132 diag.note("that pointer will be invalid outside this expression");
2133 diag.span_help(unwrap.span, "assign the `CString` to a variable to extend its lifetime");
2139 fn lint_iter_cloned_collect<'a, 'tcx>(
2140 cx: &LateContext<'a, 'tcx>,
2141 expr: &hir::Expr<'_>,
2142 iter_args: &'tcx [hir::Expr<'_>],
2145 if is_type_diagnostic_item(cx, cx.tables.expr_ty(expr), sym!(vec_type));
2146 if let Some(slice) = derefs_to_slice(cx, &iter_args[0], cx.tables.expr_ty(&iter_args[0]));
2147 if let Some(to_replace) = expr.span.trim_start(slice.span.source_callsite());
2152 ITER_CLONED_COLLECT,
2154 "called `iter().cloned().collect()` on a slice to create a `Vec`. Calling `to_vec()` is both faster and \
2157 ".to_vec()".to_string(),
2158 Applicability::MachineApplicable,
2164 fn lint_unnecessary_fold(cx: &LateContext<'_, '_>, expr: &hir::Expr<'_>, fold_args: &[hir::Expr<'_>], fold_span: Span) {
2165 fn check_fold_with_op(
2166 cx: &LateContext<'_, '_>,
2167 expr: &hir::Expr<'_>,
2168 fold_args: &[hir::Expr<'_>],
2171 replacement_method_name: &str,
2172 replacement_has_args: bool,
2175 // Extract the body of the closure passed to fold
2176 if let hir::ExprKind::Closure(_, _, body_id, _, _) = fold_args[2].kind;
2177 let closure_body = cx.tcx.hir().body(body_id);
2178 let closure_expr = remove_blocks(&closure_body.value);
2180 // Check if the closure body is of the form `acc <op> some_expr(x)`
2181 if let hir::ExprKind::Binary(ref bin_op, ref left_expr, ref right_expr) = closure_expr.kind;
2182 if bin_op.node == op;
2184 // Extract the names of the two arguments to the closure
2185 if let Some(first_arg_ident) = get_arg_name(&closure_body.params[0].pat);
2186 if let Some(second_arg_ident) = get_arg_name(&closure_body.params[1].pat);
2188 if match_var(&*left_expr, first_arg_ident);
2189 if replacement_has_args || match_var(&*right_expr, second_arg_ident);
2192 let mut applicability = Applicability::MachineApplicable;
2193 let sugg = if replacement_has_args {
2195 "{replacement}(|{s}| {r})",
2196 replacement = replacement_method_name,
2197 s = second_arg_ident,
2198 r = snippet_with_applicability(cx, right_expr.span, "EXPR", &mut applicability),
2203 replacement = replacement_method_name,
2210 fold_span.with_hi(expr.span.hi()),
2211 // TODO #2371 don't suggest e.g., .any(|x| f(x)) if we can suggest .any(f)
2212 "this `.fold` can be written more succinctly using another method",
2221 // Check that this is a call to Iterator::fold rather than just some function called fold
2222 if !match_trait_method(cx, expr, &paths::ITERATOR) {
2227 fold_args.len() == 3,
2228 "Expected fold_args to have three entries - the receiver, the initial value and the closure"
2231 // Check if the first argument to .fold is a suitable literal
2232 if let hir::ExprKind::Lit(ref lit) = fold_args[1].kind {
2234 ast::LitKind::Bool(false) => {
2235 check_fold_with_op(cx, expr, fold_args, fold_span, hir::BinOpKind::Or, "any", true)
2237 ast::LitKind::Bool(true) => {
2238 check_fold_with_op(cx, expr, fold_args, fold_span, hir::BinOpKind::And, "all", true)
2240 ast::LitKind::Int(0, _) => {
2241 check_fold_with_op(cx, expr, fold_args, fold_span, hir::BinOpKind::Add, "sum", false)
2243 ast::LitKind::Int(1, _) => {
2244 check_fold_with_op(cx, expr, fold_args, fold_span, hir::BinOpKind::Mul, "product", false)
2251 fn lint_step_by<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, expr: &hir::Expr<'_>, args: &'tcx [hir::Expr<'_>]) {
2252 if match_trait_method(cx, expr, &paths::ITERATOR) {
2253 if let Some((Constant::Int(0), _)) = constant(cx, cx.tables, &args[1]) {
2256 ITERATOR_STEP_BY_ZERO,
2258 "Iterator::step_by(0) will panic at runtime",
2264 fn lint_iter_next<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, expr: &'tcx hir::Expr<'_>, iter_args: &'tcx [hir::Expr<'_>]) {
2265 let caller_expr = &iter_args[0];
2267 // Skip lint if the `iter().next()` expression is a for loop argument,
2268 // since it is already covered by `&loops::ITER_NEXT_LOOP`
2269 let mut parent_expr_opt = get_parent_expr(cx, expr);
2270 while let Some(parent_expr) = parent_expr_opt {
2271 if higher::for_loop(parent_expr).is_some() {
2274 parent_expr_opt = get_parent_expr(cx, parent_expr);
2277 if derefs_to_slice(cx, caller_expr, cx.tables.expr_ty(caller_expr)).is_some() {
2278 // caller is a Slice
2280 if let hir::ExprKind::Index(ref caller_var, ref index_expr) = &caller_expr.kind;
2281 if let Some(higher::Range { start: Some(start_expr), end: None, limits: ast::RangeLimits::HalfOpen })
2282 = higher::range(cx, index_expr);
2283 if let hir::ExprKind::Lit(ref start_lit) = &start_expr.kind;
2284 if let ast::LitKind::Int(start_idx, _) = start_lit.node;
2286 let mut applicability = Applicability::MachineApplicable;
2291 "Using `.iter().next()` on a Slice without end index.",
2293 format!("{}.get({})", snippet_with_applicability(cx, caller_var.span, "..", &mut applicability), start_idx),
2298 } else if is_type_diagnostic_item(cx, cx.tables.expr_ty(caller_expr), sym!(vec_type))
2299 || matches!(&walk_ptrs_ty(cx.tables.expr_ty(caller_expr)).kind, ty::Array(_, _))
2301 // caller is a Vec or an Array
2302 let mut applicability = Applicability::MachineApplicable;
2307 "Using `.iter().next()` on an array",
2311 snippet_with_applicability(cx, caller_expr.span, "..", &mut applicability)
2318 fn lint_iter_nth<'a, 'tcx>(
2319 cx: &LateContext<'a, 'tcx>,
2320 expr: &hir::Expr<'_>,
2321 nth_and_iter_args: &[&'tcx [hir::Expr<'tcx>]],
2324 let iter_args = nth_and_iter_args[1];
2325 let mut_str = if is_mut { "_mut" } else { "" };
2326 let caller_type = if derefs_to_slice(cx, &iter_args[0], cx.tables.expr_ty(&iter_args[0])).is_some() {
2328 } else if is_type_diagnostic_item(cx, cx.tables.expr_ty(&iter_args[0]), sym!(vec_type)) {
2330 } else if is_type_diagnostic_item(cx, cx.tables.expr_ty(&iter_args[0]), sym!(vecdeque_type)) {
2333 let nth_args = nth_and_iter_args[0];
2334 lint_iter_nth_zero(cx, expr, &nth_args);
2335 return; // caller is not a type that we want to lint
2342 &format!("called `.iter{0}().nth()` on a {1}", mut_str, caller_type),
2344 &format!("calling `.get{}()` is both faster and more readable", mut_str),
2348 fn lint_iter_nth_zero<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, expr: &hir::Expr<'_>, nth_args: &'tcx [hir::Expr<'_>]) {
2350 if match_trait_method(cx, expr, &paths::ITERATOR);
2351 if let Some((Constant::Int(0), _)) = constant(cx, cx.tables, &nth_args[1]);
2353 let mut applicability = Applicability::MachineApplicable;
2358 "called `.nth(0)` on a `std::iter::Iterator`",
2360 format!("{}.next()", snippet_with_applicability(cx, nth_args[0].span, "..", &mut applicability)),
2367 fn lint_get_unwrap<'a, 'tcx>(
2368 cx: &LateContext<'a, 'tcx>,
2369 expr: &hir::Expr<'_>,
2370 get_args: &'tcx [hir::Expr<'_>],
2373 // Note: we don't want to lint `get_mut().unwrap` for `HashMap` or `BTreeMap`,
2374 // because they do not implement `IndexMut`
2375 let mut applicability = Applicability::MachineApplicable;
2376 let expr_ty = cx.tables.expr_ty(&get_args[0]);
2377 let get_args_str = if get_args.len() > 1 {
2378 snippet_with_applicability(cx, get_args[1].span, "_", &mut applicability)
2380 return; // not linting on a .get().unwrap() chain or variant
2383 let caller_type = if derefs_to_slice(cx, &get_args[0], expr_ty).is_some() {
2384 needs_ref = get_args_str.parse::<usize>().is_ok();
2386 } else if is_type_diagnostic_item(cx, expr_ty, sym!(vec_type)) {
2387 needs_ref = get_args_str.parse::<usize>().is_ok();
2389 } else if is_type_diagnostic_item(cx, expr_ty, sym!(vecdeque_type)) {
2390 needs_ref = get_args_str.parse::<usize>().is_ok();
2392 } else if !is_mut && is_type_diagnostic_item(cx, expr_ty, sym!(hashmap_type)) {
2395 } else if !is_mut && match_type(cx, expr_ty, &paths::BTREEMAP) {
2399 return; // caller is not a type that we want to lint
2402 let mut span = expr.span;
2404 // Handle the case where the result is immediately dereferenced
2405 // by not requiring ref and pulling the dereference into the
2409 if let Some(parent) = get_parent_expr(cx, expr);
2410 if let hir::ExprKind::Unary(hir::UnOp::UnDeref, _) = parent.kind;
2417 let mut_str = if is_mut { "_mut" } else { "" };
2418 let borrow_str = if !needs_ref {
2431 "called `.get{0}().unwrap()` on a {1}. Using `[]` is more clear and more concise",
2432 mut_str, caller_type
2438 snippet_with_applicability(cx, get_args[0].span, "_", &mut applicability),
2445 fn lint_iter_skip_next(cx: &LateContext<'_, '_>, expr: &hir::Expr<'_>) {
2446 // lint if caller of skip is an Iterator
2447 if match_trait_method(cx, expr, &paths::ITERATOR) {
2452 "called `skip(x).next()` on an iterator",
2454 "this is more succinctly expressed by calling `nth(x)`",
2459 fn derefs_to_slice<'a, 'tcx>(
2460 cx: &LateContext<'a, 'tcx>,
2461 expr: &'tcx hir::Expr<'tcx>,
2463 ) -> Option<&'tcx hir::Expr<'tcx>> {
2464 fn may_slice<'a>(cx: &LateContext<'_, 'a>, ty: Ty<'a>) -> bool {
2466 ty::Slice(_) => true,
2467 ty::Adt(def, _) if def.is_box() => may_slice(cx, ty.boxed_ty()),
2468 ty::Adt(..) => is_type_diagnostic_item(cx, ty, sym!(vec_type)),
2469 ty::Array(_, size) => {
2470 if let Some(size) = size.try_eval_usize(cx.tcx, cx.param_env) {
2476 ty::Ref(_, inner, _) => may_slice(cx, inner),
2481 if let hir::ExprKind::MethodCall(ref path, _, ref args, _) = expr.kind {
2482 if path.ident.name == sym!(iter) && may_slice(cx, cx.tables.expr_ty(&args[0])) {
2489 ty::Slice(_) => Some(expr),
2490 ty::Adt(def, _) if def.is_box() && may_slice(cx, ty.boxed_ty()) => Some(expr),
2491 ty::Ref(_, inner, _) => {
2492 if may_slice(cx, inner) {
2503 /// lint use of `unwrap()` for `Option`s and `Result`s
2504 fn lint_unwrap(cx: &LateContext<'_, '_>, expr: &hir::Expr<'_>, unwrap_args: &[hir::Expr<'_>]) {
2505 let obj_ty = walk_ptrs_ty(cx.tables.expr_ty(&unwrap_args[0]));
2507 let mess = if is_type_diagnostic_item(cx, obj_ty, sym!(option_type)) {
2508 Some((UNWRAP_USED, "an Option", "None"))
2509 } else if is_type_diagnostic_item(cx, obj_ty, sym!(result_type)) {
2510 Some((UNWRAP_USED, "a Result", "Err"))
2515 if let Some((lint, kind, none_value)) = mess {
2520 &format!("used `unwrap()` on `{}` value", kind,),
2523 "if you don't want to handle the `{}` case gracefully, consider \
2524 using `expect()` to provide a better panic message",
2531 /// lint use of `expect()` for `Option`s and `Result`s
2532 fn lint_expect(cx: &LateContext<'_, '_>, expr: &hir::Expr<'_>, expect_args: &[hir::Expr<'_>]) {
2533 let obj_ty = walk_ptrs_ty(cx.tables.expr_ty(&expect_args[0]));
2535 let mess = if is_type_diagnostic_item(cx, obj_ty, sym!(option_type)) {
2536 Some((EXPECT_USED, "an Option", "None"))
2537 } else if is_type_diagnostic_item(cx, obj_ty, sym!(result_type)) {
2538 Some((EXPECT_USED, "a Result", "Err"))
2543 if let Some((lint, kind, none_value)) = mess {
2548 &format!("used `expect()` on `{}` value", kind,),
2550 &format!("if this value is an `{}`, it will panic", none_value,),
2555 /// lint use of `ok().expect()` for `Result`s
2556 fn lint_ok_expect(cx: &LateContext<'_, '_>, expr: &hir::Expr<'_>, ok_args: &[hir::Expr<'_>]) {
2558 // lint if the caller of `ok()` is a `Result`
2559 if is_type_diagnostic_item(cx, cx.tables.expr_ty(&ok_args[0]), sym!(result_type));
2560 let result_type = cx.tables.expr_ty(&ok_args[0]);
2561 if let Some(error_type) = get_error_type(cx, result_type);
2562 if has_debug_impl(error_type, cx);
2569 "called `ok().expect()` on a `Result` value",
2571 "you can call `expect()` directly on the `Result`",
2577 /// lint use of `map().flatten()` for `Iterators` and 'Options'
2578 fn lint_map_flatten<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, expr: &'tcx hir::Expr<'_>, map_args: &'tcx [hir::Expr<'_>]) {
2579 // lint if caller of `.map().flatten()` is an Iterator
2580 if match_trait_method(cx, expr, &paths::ITERATOR) {
2581 let msg = "called `map(..).flatten()` on an `Iterator`. \
2582 This is more succinctly expressed by calling `.flat_map(..)`";
2583 let self_snippet = snippet(cx, map_args[0].span, "..");
2584 let func_snippet = snippet(cx, map_args[1].span, "..");
2585 let hint = format!("{0}.flat_map({1})", self_snippet, func_snippet);
2591 "try using `flat_map` instead",
2593 Applicability::MachineApplicable,
2597 // lint if caller of `.map().flatten()` is an Option
2598 if is_type_diagnostic_item(cx, cx.tables.expr_ty(&map_args[0]), sym!(option_type)) {
2599 let msg = "called `map(..).flatten()` on an `Option`. \
2600 This is more succinctly expressed by calling `.and_then(..)`";
2601 let self_snippet = snippet(cx, map_args[0].span, "..");
2602 let func_snippet = snippet(cx, map_args[1].span, "..");
2603 let hint = format!("{0}.and_then({1})", self_snippet, func_snippet);
2609 "try using `and_then` instead",
2611 Applicability::MachineApplicable,
2616 /// lint use of `map().unwrap_or_else()` for `Option`s and `Result`s
2617 fn lint_map_unwrap_or_else<'a, 'tcx>(
2618 cx: &LateContext<'a, 'tcx>,
2619 expr: &'tcx hir::Expr<'_>,
2620 map_args: &'tcx [hir::Expr<'_>],
2621 unwrap_args: &'tcx [hir::Expr<'_>],
2623 // lint if the caller of `map()` is an `Option`
2624 let is_option = is_type_diagnostic_item(cx, cx.tables.expr_ty(&map_args[0]), sym!(option_type));
2625 let is_result = is_type_diagnostic_item(cx, cx.tables.expr_ty(&map_args[0]), sym!(result_type));
2627 if is_option || is_result {
2628 // Don't make a suggestion that may fail to compile due to mutably borrowing
2629 // the same variable twice.
2630 let map_mutated_vars = mutated_variables(&map_args[0], cx);
2631 let unwrap_mutated_vars = mutated_variables(&unwrap_args[1], cx);
2632 if let (Some(map_mutated_vars), Some(unwrap_mutated_vars)) = (map_mutated_vars, unwrap_mutated_vars) {
2633 if map_mutated_vars.intersection(&unwrap_mutated_vars).next().is_some() {
2641 let msg = if is_option {
2642 "called `map(f).unwrap_or_else(g)` on an `Option` value. This can be done more directly by calling \
2643 `map_or_else(g, f)` instead"
2645 "called `map(f).unwrap_or_else(g)` on a `Result` value. This can be done more directly by calling \
2646 `.map_or_else(g, f)` instead"
2648 // get snippets for args to map() and unwrap_or_else()
2649 let map_snippet = snippet(cx, map_args[1].span, "..");
2650 let unwrap_snippet = snippet(cx, unwrap_args[1].span, "..");
2651 // lint, with note if neither arg is > 1 line and both map() and
2652 // unwrap_or_else() have the same span
2653 let multiline = map_snippet.lines().count() > 1 || unwrap_snippet.lines().count() > 1;
2654 let same_span = map_args[1].span.ctxt() == unwrap_args[1].span.ctxt();
2655 if same_span && !multiline {
2663 "replace `map({0}).unwrap_or_else({1})` with `map_or_else({1}, {0})`",
2664 map_snippet, unwrap_snippet,
2667 } else if same_span && multiline {
2668 span_lint(cx, MAP_UNWRAP_OR, expr.span, msg);
2673 /// lint use of `_.map_or(None, _)` for `Option`s and `Result`s
2674 fn lint_map_or_none<'a, 'tcx>(
2675 cx: &LateContext<'a, 'tcx>,
2676 expr: &'tcx hir::Expr<'_>,
2677 map_or_args: &'tcx [hir::Expr<'_>],
2679 let is_option = is_type_diagnostic_item(cx, cx.tables.expr_ty(&map_or_args[0]), sym!(option_type));
2680 let is_result = is_type_diagnostic_item(cx, cx.tables.expr_ty(&map_or_args[0]), sym!(result_type));
2682 // There are two variants of this `map_or` lint:
2683 // (1) using `map_or` as an adapter from `Result<T,E>` to `Option<T>`
2684 // (2) using `map_or` as a combinator instead of `and_then`
2686 // (For this lint) we don't care if any other type calls `map_or`
2687 if !is_option && !is_result {
2691 let (lint_name, msg, instead, hint) = {
2692 let default_arg_is_none = if let hir::ExprKind::Path(ref qpath) = map_or_args[1].kind {
2693 match_qpath(qpath, &paths::OPTION_NONE)
2698 if !default_arg_is_none {
2703 let f_arg_is_some = if let hir::ExprKind::Path(ref qpath) = map_or_args[2].kind {
2704 match_qpath(qpath, &paths::OPTION_SOME)
2710 let self_snippet = snippet(cx, map_or_args[0].span, "..");
2711 let func_snippet = snippet(cx, map_or_args[2].span, "..");
2712 let msg = "called `map_or(None, f)` on an `Option` value. This can be done more directly by calling \
2713 `and_then(f)` instead";
2717 "try using `and_then` instead",
2718 format!("{0}.and_then({1})", self_snippet, func_snippet),
2720 } else if f_arg_is_some {
2721 let msg = "called `map_or(None, Some)` on a `Result` value. This can be done more directly by calling \
2723 let self_snippet = snippet(cx, map_or_args[0].span, "..");
2725 RESULT_MAP_OR_INTO_OPTION,
2727 "try using `ok` instead",
2728 format!("{0}.ok()", self_snippet),
2743 Applicability::MachineApplicable,
2747 /// lint use of `filter().next()` for `Iterators`
2748 fn lint_filter_next<'a, 'tcx>(
2749 cx: &LateContext<'a, 'tcx>,
2750 expr: &'tcx hir::Expr<'_>,
2751 filter_args: &'tcx [hir::Expr<'_>],
2753 // lint if caller of `.filter().next()` is an Iterator
2754 if match_trait_method(cx, expr, &paths::ITERATOR) {
2755 let msg = "called `filter(p).next()` on an `Iterator`. This is more succinctly expressed by calling \
2756 `.find(p)` instead.";
2757 let filter_snippet = snippet(cx, filter_args[1].span, "..");
2758 if filter_snippet.lines().count() <= 1 {
2759 // add note if not multi-line
2766 &format!("replace `filter({0}).next()` with `find({0})`", filter_snippet),
2769 span_lint(cx, FILTER_NEXT, expr.span, msg);
2774 /// lint use of `skip_while().next()` for `Iterators`
2775 fn lint_skip_while_next<'a, 'tcx>(
2776 cx: &LateContext<'a, 'tcx>,
2777 expr: &'tcx hir::Expr<'_>,
2778 _skip_while_args: &'tcx [hir::Expr<'_>],
2780 // lint if caller of `.skip_while().next()` is an Iterator
2781 if match_trait_method(cx, expr, &paths::ITERATOR) {
2786 "called `skip_while(p).next()` on an `Iterator`",
2788 "this is more succinctly expressed by calling `.find(!p)` instead",
2793 /// lint use of `filter().map()` for `Iterators`
2794 fn lint_filter_map<'a, 'tcx>(
2795 cx: &LateContext<'a, 'tcx>,
2796 expr: &'tcx hir::Expr<'_>,
2797 _filter_args: &'tcx [hir::Expr<'_>],
2798 _map_args: &'tcx [hir::Expr<'_>],
2800 // lint if caller of `.filter().map()` is an Iterator
2801 if match_trait_method(cx, expr, &paths::ITERATOR) {
2802 let msg = "called `filter(p).map(q)` on an `Iterator`";
2803 let hint = "this is more succinctly expressed by calling `.filter_map(..)` instead";
2804 span_lint_and_help(cx, FILTER_MAP, expr.span, msg, None, hint);
2808 /// lint use of `filter_map().next()` for `Iterators`
2809 fn lint_filter_map_next<'a, 'tcx>(
2810 cx: &LateContext<'a, 'tcx>,
2811 expr: &'tcx hir::Expr<'_>,
2812 filter_args: &'tcx [hir::Expr<'_>],
2814 if match_trait_method(cx, expr, &paths::ITERATOR) {
2815 let msg = "called `filter_map(p).next()` on an `Iterator`. This is more succinctly expressed by calling \
2816 `.find_map(p)` instead.";
2817 let filter_snippet = snippet(cx, filter_args[1].span, "..");
2818 if filter_snippet.lines().count() <= 1 {
2825 &format!("replace `filter_map({0}).next()` with `find_map({0})`", filter_snippet),
2828 span_lint(cx, FILTER_MAP_NEXT, expr.span, msg);
2833 /// lint use of `find().map()` for `Iterators`
2834 fn lint_find_map<'a, 'tcx>(
2835 cx: &LateContext<'a, 'tcx>,
2836 expr: &'tcx hir::Expr<'_>,
2837 _find_args: &'tcx [hir::Expr<'_>],
2838 map_args: &'tcx [hir::Expr<'_>],
2840 // lint if caller of `.filter().map()` is an Iterator
2841 if match_trait_method(cx, &map_args[0], &paths::ITERATOR) {
2842 let msg = "called `find(p).map(q)` on an `Iterator`";
2843 let hint = "this is more succinctly expressed by calling `.find_map(..)` instead";
2844 span_lint_and_help(cx, FIND_MAP, expr.span, msg, None, hint);
2848 /// lint use of `filter_map().map()` for `Iterators`
2849 fn lint_filter_map_map<'a, 'tcx>(
2850 cx: &LateContext<'a, 'tcx>,
2851 expr: &'tcx hir::Expr<'_>,
2852 _filter_args: &'tcx [hir::Expr<'_>],
2853 _map_args: &'tcx [hir::Expr<'_>],
2855 // lint if caller of `.filter().map()` is an Iterator
2856 if match_trait_method(cx, expr, &paths::ITERATOR) {
2857 let msg = "called `filter_map(p).map(q)` on an `Iterator`";
2858 let hint = "this is more succinctly expressed by only calling `.filter_map(..)` instead";
2859 span_lint_and_help(cx, FILTER_MAP, expr.span, msg, None, hint);
2863 /// lint use of `filter().flat_map()` for `Iterators`
2864 fn lint_filter_flat_map<'a, 'tcx>(
2865 cx: &LateContext<'a, 'tcx>,
2866 expr: &'tcx hir::Expr<'_>,
2867 _filter_args: &'tcx [hir::Expr<'_>],
2868 _map_args: &'tcx [hir::Expr<'_>],
2870 // lint if caller of `.filter().flat_map()` is an Iterator
2871 if match_trait_method(cx, expr, &paths::ITERATOR) {
2872 let msg = "called `filter(p).flat_map(q)` on an `Iterator`";
2873 let hint = "this is more succinctly expressed by calling `.flat_map(..)` \
2874 and filtering by returning `iter::empty()`";
2875 span_lint_and_help(cx, FILTER_MAP, expr.span, msg, None, hint);
2879 /// lint use of `filter_map().flat_map()` for `Iterators`
2880 fn lint_filter_map_flat_map<'a, 'tcx>(
2881 cx: &LateContext<'a, 'tcx>,
2882 expr: &'tcx hir::Expr<'_>,
2883 _filter_args: &'tcx [hir::Expr<'_>],
2884 _map_args: &'tcx [hir::Expr<'_>],
2886 // lint if caller of `.filter_map().flat_map()` is an Iterator
2887 if match_trait_method(cx, expr, &paths::ITERATOR) {
2888 let msg = "called `filter_map(p).flat_map(q)` on an `Iterator`";
2889 let hint = "this is more succinctly expressed by calling `.flat_map(..)` \
2890 and filtering by returning `iter::empty()`";
2891 span_lint_and_help(cx, FILTER_MAP, expr.span, msg, None, hint);
2895 /// lint use of `flat_map` for `Iterators` where `flatten` would be sufficient
2896 fn lint_flat_map_identity<'a, 'tcx>(
2897 cx: &LateContext<'a, 'tcx>,
2898 expr: &'tcx hir::Expr<'_>,
2899 flat_map_args: &'tcx [hir::Expr<'_>],
2900 flat_map_span: Span,
2902 if match_trait_method(cx, expr, &paths::ITERATOR) {
2903 let arg_node = &flat_map_args[1].kind;
2905 let apply_lint = |message: &str| {
2909 flat_map_span.with_hi(expr.span.hi()),
2912 "flatten()".to_string(),
2913 Applicability::MachineApplicable,
2918 if let hir::ExprKind::Closure(_, _, body_id, _, _) = arg_node;
2919 let body = cx.tcx.hir().body(*body_id);
2921 if let hir::PatKind::Binding(_, _, binding_ident, _) = body.params[0].pat.kind;
2922 if let hir::ExprKind::Path(hir::QPath::Resolved(_, ref path)) = body.value.kind;
2924 if path.segments.len() == 1;
2925 if path.segments[0].ident.as_str() == binding_ident.as_str();
2928 apply_lint("called `flat_map(|x| x)` on an `Iterator`");
2933 if let hir::ExprKind::Path(ref qpath) = arg_node;
2935 if match_qpath(qpath, &paths::STD_CONVERT_IDENTITY);
2938 apply_lint("called `flat_map(std::convert::identity)` on an `Iterator`");
2944 /// lint searching an Iterator followed by `is_some()`
2945 fn lint_search_is_some<'a, 'tcx>(
2946 cx: &LateContext<'a, 'tcx>,
2947 expr: &'tcx hir::Expr<'_>,
2948 search_method: &str,
2949 search_args: &'tcx [hir::Expr<'_>],
2950 is_some_args: &'tcx [hir::Expr<'_>],
2953 // lint if caller of search is an Iterator
2954 if match_trait_method(cx, &is_some_args[0], &paths::ITERATOR) {
2956 "called `is_some()` after searching an `Iterator` with {}. This is more succinctly \
2957 expressed by calling `any()`.",
2960 let search_snippet = snippet(cx, search_args[1].span, "..");
2961 if search_snippet.lines().count() <= 1 {
2962 // suggest `any(|x| ..)` instead of `any(|&x| ..)` for `find(|&x| ..).is_some()`
2963 // suggest `any(|..| *..)` instead of `any(|..| **..)` for `find(|..| **..).is_some()`
2964 let any_search_snippet = if_chain! {
2965 if search_method == "find";
2966 if let hir::ExprKind::Closure(_, _, body_id, ..) = search_args[1].kind;
2967 let closure_body = cx.tcx.hir().body(body_id);
2968 if let Some(closure_arg) = closure_body.params.get(0);
2970 if let hir::PatKind::Ref(..) = closure_arg.pat.kind {
2971 Some(search_snippet.replacen('&', "", 1))
2972 } else if let Some(name) = get_arg_name(&closure_arg.pat) {
2973 Some(search_snippet.replace(&format!("*{}", name), &name.as_str()))
2981 // add note if not multi-line
2985 method_span.with_hi(expr.span.hi()),
2990 any_search_snippet.as_ref().map_or(&*search_snippet, String::as_str)
2992 Applicability::MachineApplicable,
2995 span_lint(cx, SEARCH_IS_SOME, expr.span, &msg);
3000 /// Used for `lint_binary_expr_with_method_call`.
3001 #[derive(Copy, Clone)]
3002 struct BinaryExprInfo<'a> {
3003 expr: &'a hir::Expr<'a>,
3004 chain: &'a hir::Expr<'a>,
3005 other: &'a hir::Expr<'a>,
3009 /// Checks for the `CHARS_NEXT_CMP` and `CHARS_LAST_CMP` lints.
3010 fn lint_binary_expr_with_method_call(cx: &LateContext<'_, '_>, info: &mut BinaryExprInfo<'_>) {
3011 macro_rules! lint_with_both_lhs_and_rhs {
3012 ($func:ident, $cx:expr, $info:ident) => {
3013 if !$func($cx, $info) {
3014 ::std::mem::swap(&mut $info.chain, &mut $info.other);
3015 if $func($cx, $info) {
3022 lint_with_both_lhs_and_rhs!(lint_chars_next_cmp, cx, info);
3023 lint_with_both_lhs_and_rhs!(lint_chars_last_cmp, cx, info);
3024 lint_with_both_lhs_and_rhs!(lint_chars_next_cmp_with_unwrap, cx, info);
3025 lint_with_both_lhs_and_rhs!(lint_chars_last_cmp_with_unwrap, cx, info);
3028 /// Wrapper fn for `CHARS_NEXT_CMP` and `CHARS_LAST_CMP` lints.
3030 cx: &LateContext<'_, '_>,
3031 info: &BinaryExprInfo<'_>,
3032 chain_methods: &[&str],
3033 lint: &'static Lint,
3037 if let Some(args) = method_chain_args(info.chain, chain_methods);
3038 if let hir::ExprKind::Call(ref fun, ref arg_char) = info.other.kind;
3039 if arg_char.len() == 1;
3040 if let hir::ExprKind::Path(ref qpath) = fun.kind;
3041 if let Some(segment) = single_segment_path(qpath);
3042 if segment.ident.name == sym!(Some);
3044 let mut applicability = Applicability::MachineApplicable;
3045 let self_ty = walk_ptrs_ty(cx.tables.expr_ty_adjusted(&args[0][0]));
3047 if self_ty.kind != ty::Str {
3055 &format!("you should use the `{}` method", suggest),
3057 format!("{}{}.{}({})",
3058 if info.eq { "" } else { "!" },
3059 snippet_with_applicability(cx, args[0][0].span, "_", &mut applicability),
3061 snippet_with_applicability(cx, arg_char[0].span, "_", &mut applicability)),
3072 /// Checks for the `CHARS_NEXT_CMP` lint.
3073 fn lint_chars_next_cmp<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, info: &BinaryExprInfo<'_>) -> bool {
3074 lint_chars_cmp(cx, info, &["chars", "next"], CHARS_NEXT_CMP, "starts_with")
3077 /// Checks for the `CHARS_LAST_CMP` lint.
3078 fn lint_chars_last_cmp<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, info: &BinaryExprInfo<'_>) -> bool {
3079 if lint_chars_cmp(cx, info, &["chars", "last"], CHARS_LAST_CMP, "ends_with") {
3082 lint_chars_cmp(cx, info, &["chars", "next_back"], CHARS_LAST_CMP, "ends_with")
3086 /// Wrapper fn for `CHARS_NEXT_CMP` and `CHARS_LAST_CMP` lints with `unwrap()`.
3087 fn lint_chars_cmp_with_unwrap<'a, 'tcx>(
3088 cx: &LateContext<'a, 'tcx>,
3089 info: &BinaryExprInfo<'_>,
3090 chain_methods: &[&str],
3091 lint: &'static Lint,
3095 if let Some(args) = method_chain_args(info.chain, chain_methods);
3096 if let hir::ExprKind::Lit(ref lit) = info.other.kind;
3097 if let ast::LitKind::Char(c) = lit.node;
3099 let mut applicability = Applicability::MachineApplicable;
3104 &format!("you should use the `{}` method", suggest),
3106 format!("{}{}.{}('{}')",
3107 if info.eq { "" } else { "!" },
3108 snippet_with_applicability(cx, args[0][0].span, "_", &mut applicability),
3121 /// Checks for the `CHARS_NEXT_CMP` lint with `unwrap()`.
3122 fn lint_chars_next_cmp_with_unwrap<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, info: &BinaryExprInfo<'_>) -> bool {
3123 lint_chars_cmp_with_unwrap(cx, info, &["chars", "next", "unwrap"], CHARS_NEXT_CMP, "starts_with")
3126 /// Checks for the `CHARS_LAST_CMP` lint with `unwrap()`.
3127 fn lint_chars_last_cmp_with_unwrap<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, info: &BinaryExprInfo<'_>) -> bool {
3128 if lint_chars_cmp_with_unwrap(cx, info, &["chars", "last", "unwrap"], CHARS_LAST_CMP, "ends_with") {
3131 lint_chars_cmp_with_unwrap(cx, info, &["chars", "next_back", "unwrap"], CHARS_LAST_CMP, "ends_with")
3135 /// lint for length-1 `str`s for methods in `PATTERN_METHODS`
3136 fn lint_single_char_pattern<'a, 'tcx>(
3137 cx: &LateContext<'a, 'tcx>,
3138 _expr: &'tcx hir::Expr<'_>,
3139 arg: &'tcx hir::Expr<'_>,
3142 if let hir::ExprKind::Lit(lit) = &arg.kind;
3143 if let ast::LitKind::Str(r, style) = lit.node;
3144 if r.as_str().len() == 1;
3146 let mut applicability = Applicability::MachineApplicable;
3147 let snip = snippet_with_applicability(cx, arg.span, "..", &mut applicability);
3148 let ch = if let ast::StrStyle::Raw(nhash) = style {
3149 let nhash = nhash as usize;
3150 // for raw string: r##"a"##
3151 &snip[(nhash + 2)..(snip.len() - 1 - nhash)]
3153 // for regular string: "a"
3154 &snip[1..(snip.len() - 1)]
3156 let hint = format!("'{}'", if ch == "'" { "\\'" } else { ch });
3159 SINGLE_CHAR_PATTERN,
3161 "single-character string constant used as pattern",
3162 "try using a `char` instead",
3170 /// Checks for the `USELESS_ASREF` lint.
3171 fn lint_asref(cx: &LateContext<'_, '_>, expr: &hir::Expr<'_>, call_name: &str, as_ref_args: &[hir::Expr<'_>]) {
3172 // when we get here, we've already checked that the call name is "as_ref" or "as_mut"
3173 // check if the call is to the actual `AsRef` or `AsMut` trait
3174 if match_trait_method(cx, expr, &paths::ASREF_TRAIT) || match_trait_method(cx, expr, &paths::ASMUT_TRAIT) {
3175 // check if the type after `as_ref` or `as_mut` is the same as before
3176 let recvr = &as_ref_args[0];
3177 let rcv_ty = cx.tables.expr_ty(recvr);
3178 let res_ty = cx.tables.expr_ty(expr);
3179 let (base_res_ty, res_depth) = walk_ptrs_ty_depth(res_ty);
3180 let (base_rcv_ty, rcv_depth) = walk_ptrs_ty_depth(rcv_ty);
3181 if base_rcv_ty == base_res_ty && rcv_depth >= res_depth {
3182 // allow the `as_ref` or `as_mut` if it is followed by another method call
3184 if let Some(parent) = get_parent_expr(cx, expr);
3185 if let hir::ExprKind::MethodCall(_, ref span, _, _) = parent.kind;
3186 if span != &expr.span;
3192 let mut applicability = Applicability::MachineApplicable;
3197 &format!("this call to `{}` does nothing", call_name),
3199 snippet_with_applicability(cx, recvr.span, "_", &mut applicability).to_string(),
3206 fn ty_has_iter_method(cx: &LateContext<'_, '_>, self_ref_ty: Ty<'_>) -> Option<(&'static str, &'static str)> {
3207 has_iter_method(cx, self_ref_ty).map(|ty_name| {
3208 let mutbl = match self_ref_ty.kind {
3209 ty::Ref(_, _, mutbl) => mutbl,
3210 _ => unreachable!(),
3212 let method_name = match mutbl {
3213 hir::Mutability::Not => "iter",
3214 hir::Mutability::Mut => "iter_mut",
3216 (ty_name, method_name)
3220 fn lint_into_iter(cx: &LateContext<'_, '_>, expr: &hir::Expr<'_>, self_ref_ty: Ty<'_>, method_span: Span) {
3221 if !match_trait_method(cx, expr, &paths::INTO_ITERATOR) {
3224 if let Some((kind, method_name)) = ty_has_iter_method(cx, self_ref_ty) {
3230 "this `.into_iter()` call is equivalent to `.{}()` and will not move the `{}`",
3234 method_name.to_string(),
3235 Applicability::MachineApplicable,
3240 /// lint for `MaybeUninit::uninit().assume_init()` (we already have the latter)
3241 fn lint_maybe_uninit(cx: &LateContext<'_, '_>, expr: &hir::Expr<'_>, outer: &hir::Expr<'_>) {
3243 if let hir::ExprKind::Call(ref callee, ref args) = expr.kind;
3245 if let hir::ExprKind::Path(ref path) = callee.kind;
3246 if match_qpath(path, &paths::MEM_MAYBEUNINIT_UNINIT);
3247 if !is_maybe_uninit_ty_valid(cx, cx.tables.expr_ty_adjusted(outer));
3251 UNINIT_ASSUMED_INIT,
3253 "this call for this type may be undefined behavior"
3259 fn is_maybe_uninit_ty_valid(cx: &LateContext<'_, '_>, ty: Ty<'_>) -> bool {
3261 ty::Array(ref component, _) => is_maybe_uninit_ty_valid(cx, component),
3262 ty::Tuple(ref types) => types.types().all(|ty| is_maybe_uninit_ty_valid(cx, ty)),
3263 ty::Adt(ref adt, _) => match_def_path(cx, adt.did, &paths::MEM_MAYBEUNINIT),
3268 fn lint_suspicious_map(cx: &LateContext<'_, '_>, expr: &hir::Expr<'_>) {
3273 "this call to `map()` won't have an effect on the call to `count()`",
3275 "make sure you did not confuse `map` with `filter` or `for_each`",
3279 /// lint use of `_.as_ref().map(Deref::deref)` for `Option`s
3280 fn lint_option_as_ref_deref<'a, 'tcx>(
3281 cx: &LateContext<'a, 'tcx>,
3282 expr: &hir::Expr<'_>,
3283 as_ref_args: &[hir::Expr<'_>],
3284 map_args: &[hir::Expr<'_>],
3287 let same_mutability = |m| (is_mut && m == &hir::Mutability::Mut) || (!is_mut && m == &hir::Mutability::Not);
3289 let option_ty = cx.tables.expr_ty(&as_ref_args[0]);
3290 if !is_type_diagnostic_item(cx, option_ty, sym!(option_type)) {
3294 let deref_aliases: [&[&str]; 9] = [
3295 &paths::DEREF_TRAIT_METHOD,
3296 &paths::DEREF_MUT_TRAIT_METHOD,
3297 &paths::CSTRING_AS_C_STR,
3298 &paths::OS_STRING_AS_OS_STR,
3299 &paths::PATH_BUF_AS_PATH,
3300 &paths::STRING_AS_STR,
3301 &paths::STRING_AS_MUT_STR,
3302 &paths::VEC_AS_SLICE,
3303 &paths::VEC_AS_MUT_SLICE,
3306 let is_deref = match map_args[1].kind {
3307 hir::ExprKind::Path(ref expr_qpath) => deref_aliases.iter().any(|path| match_qpath(expr_qpath, path)),
3308 hir::ExprKind::Closure(_, _, body_id, _, _) => {
3309 let closure_body = cx.tcx.hir().body(body_id);
3310 let closure_expr = remove_blocks(&closure_body.value);
3312 match &closure_expr.kind {
3313 hir::ExprKind::MethodCall(_, _, args, _) => {
3316 if let hir::ExprKind::Path(qpath) = &args[0].kind;
3317 if let hir::def::Res::Local(local_id) = cx.tables.qpath_res(qpath, args[0].hir_id);
3318 if closure_body.params[0].pat.hir_id == local_id;
3319 let adj = cx.tables.expr_adjustments(&args[0]).iter().map(|x| &x.kind).collect::<Box<[_]>>();
3320 if let [ty::adjustment::Adjust::Deref(None), ty::adjustment::Adjust::Borrow(_)] = *adj;
3322 let method_did = cx.tables.type_dependent_def_id(closure_expr.hir_id).unwrap();
3323 deref_aliases.iter().any(|path| match_def_path(cx, method_did, path))
3329 hir::ExprKind::AddrOf(hir::BorrowKind::Ref, m, ref inner) if same_mutability(m) => {
3331 if let hir::ExprKind::Unary(hir::UnOp::UnDeref, ref inner1) = inner.kind;
3332 if let hir::ExprKind::Unary(hir::UnOp::UnDeref, ref inner2) = inner1.kind;
3333 if let hir::ExprKind::Path(ref qpath) = inner2.kind;
3334 if let hir::def::Res::Local(local_id) = cx.tables.qpath_res(qpath, inner2.hir_id);
3336 closure_body.params[0].pat.hir_id == local_id
3349 let current_method = if is_mut {
3350 format!(".as_mut().map({})", snippet(cx, map_args[1].span, ".."))
3352 format!(".as_ref().map({})", snippet(cx, map_args[1].span, ".."))
3354 let method_hint = if is_mut { "as_deref_mut" } else { "as_deref" };
3355 let hint = format!("{}.{}()", snippet(cx, as_ref_args[0].span, ".."), method_hint);
3356 let suggestion = format!("try using {} instead", method_hint);
3359 "called `{0}` on an Option value. This can be done more directly \
3360 by calling `{1}` instead",
3361 current_method, hint
3365 OPTION_AS_REF_DEREF,
3370 Applicability::MachineApplicable,
3375 /// Given a `Result<T, E>` type, return its error type (`E`).
3376 fn get_error_type<'a>(cx: &LateContext<'_, '_>, ty: Ty<'a>) -> Option<Ty<'a>> {
3378 ty::Adt(_, substs) if is_type_diagnostic_item(cx, ty, sym!(result_type)) => substs.types().nth(1),
3383 /// This checks whether a given type is known to implement Debug.
3384 fn has_debug_impl<'a, 'b>(ty: Ty<'a>, cx: &LateContext<'b, 'a>) -> bool {
3386 .get_diagnostic_item(sym::debug_trait)
3387 .map_or(false, |debug| implements_trait(cx, ty, debug, &[]))
3392 StartsWith(&'static str),
3396 const CONVENTIONS: [(Convention, &[SelfKind]); 7] = [
3397 (Convention::Eq("new"), &[SelfKind::No]),
3398 (Convention::StartsWith("as_"), &[SelfKind::Ref, SelfKind::RefMut]),
3399 (Convention::StartsWith("from_"), &[SelfKind::No]),
3400 (Convention::StartsWith("into_"), &[SelfKind::Value]),
3401 (Convention::StartsWith("is_"), &[SelfKind::Ref, SelfKind::No]),
3402 (Convention::Eq("to_mut"), &[SelfKind::RefMut]),
3403 (Convention::StartsWith("to_"), &[SelfKind::Ref]),
3406 const FN_HEADER: hir::FnHeader = hir::FnHeader {
3407 unsafety: hir::Unsafety::Normal,
3408 constness: hir::Constness::NotConst,
3409 asyncness: hir::IsAsync::NotAsync,
3410 abi: rustc_target::spec::abi::Abi::Rust,
3414 const TRAIT_METHODS: [(&str, usize, &hir::FnHeader, SelfKind, OutType, &str); 30] = [
3415 ("add", 2, &FN_HEADER, SelfKind::Value, OutType::Any, "std::ops::Add"),
3416 ("as_mut", 1, &FN_HEADER, SelfKind::RefMut, OutType::Ref, "std::convert::AsMut"),
3417 ("as_ref", 1, &FN_HEADER, SelfKind::Ref, OutType::Ref, "std::convert::AsRef"),
3418 ("bitand", 2, &FN_HEADER, SelfKind::Value, OutType::Any, "std::ops::BitAnd"),
3419 ("bitor", 2, &FN_HEADER, SelfKind::Value, OutType::Any, "std::ops::BitOr"),
3420 ("bitxor", 2, &FN_HEADER, SelfKind::Value, OutType::Any, "std::ops::BitXor"),
3421 ("borrow", 1, &FN_HEADER, SelfKind::Ref, OutType::Ref, "std::borrow::Borrow"),
3422 ("borrow_mut", 1, &FN_HEADER, SelfKind::RefMut, OutType::Ref, "std::borrow::BorrowMut"),
3423 ("clone", 1, &FN_HEADER, SelfKind::Ref, OutType::Any, "std::clone::Clone"),
3424 ("cmp", 2, &FN_HEADER, SelfKind::Ref, OutType::Any, "std::cmp::Ord"),
3425 ("default", 0, &FN_HEADER, SelfKind::No, OutType::Any, "std::default::Default"),
3426 ("deref", 1, &FN_HEADER, SelfKind::Ref, OutType::Ref, "std::ops::Deref"),
3427 ("deref_mut", 1, &FN_HEADER, SelfKind::RefMut, OutType::Ref, "std::ops::DerefMut"),
3428 ("div", 2, &FN_HEADER, SelfKind::Value, OutType::Any, "std::ops::Div"),
3429 ("drop", 1, &FN_HEADER, SelfKind::RefMut, OutType::Unit, "std::ops::Drop"),
3430 ("eq", 2, &FN_HEADER, SelfKind::Ref, OutType::Bool, "std::cmp::PartialEq"),
3431 ("from_iter", 1, &FN_HEADER, SelfKind::No, OutType::Any, "std::iter::FromIterator"),
3432 ("from_str", 1, &FN_HEADER, SelfKind::No, OutType::Any, "std::str::FromStr"),
3433 ("hash", 2, &FN_HEADER, SelfKind::Ref, OutType::Unit, "std::hash::Hash"),
3434 ("index", 2, &FN_HEADER, SelfKind::Ref, OutType::Ref, "std::ops::Index"),
3435 ("index_mut", 2, &FN_HEADER, SelfKind::RefMut, OutType::Ref, "std::ops::IndexMut"),
3436 ("into_iter", 1, &FN_HEADER, SelfKind::Value, OutType::Any, "std::iter::IntoIterator"),
3437 ("mul", 2, &FN_HEADER, SelfKind::Value, OutType::Any, "std::ops::Mul"),
3438 ("neg", 1, &FN_HEADER, SelfKind::Value, OutType::Any, "std::ops::Neg"),
3439 ("next", 1, &FN_HEADER, SelfKind::RefMut, OutType::Any, "std::iter::Iterator"),
3440 ("not", 1, &FN_HEADER, SelfKind::Value, OutType::Any, "std::ops::Not"),
3441 ("rem", 2, &FN_HEADER, SelfKind::Value, OutType::Any, "std::ops::Rem"),
3442 ("shl", 2, &FN_HEADER, SelfKind::Value, OutType::Any, "std::ops::Shl"),
3443 ("shr", 2, &FN_HEADER, SelfKind::Value, OutType::Any, "std::ops::Shr"),
3444 ("sub", 2, &FN_HEADER, SelfKind::Value, OutType::Any, "std::ops::Sub"),
3448 const PATTERN_METHODS: [(&str, usize); 17] = [
3456 ("split_terminator", 1),
3457 ("rsplit_terminator", 1),
3462 ("match_indices", 1),
3463 ("rmatch_indices", 1),
3464 ("trim_start_matches", 1),
3465 ("trim_end_matches", 1),
3468 #[derive(Clone, Copy, PartialEq, Debug)]
3477 fn matches<'a>(self, cx: &LateContext<'_, 'a>, parent_ty: Ty<'a>, ty: Ty<'a>) -> bool {
3478 fn matches_value<'a>(cx: &LateContext<'_, 'a>, parent_ty: Ty<'_>, ty: Ty<'_>) -> bool {
3479 if ty == parent_ty {
3481 } else if ty.is_box() {
3482 ty.boxed_ty() == parent_ty
3483 } else if is_type_diagnostic_item(cx, ty, sym::Rc) || is_type_diagnostic_item(cx, ty, sym::Arc) {
3484 if let ty::Adt(_, substs) = ty.kind {
3485 substs.types().next().map_or(false, |t| t == parent_ty)
3495 cx: &LateContext<'_, 'a>,
3496 mutability: hir::Mutability,
3500 if let ty::Ref(_, t, m) = ty.kind {
3501 return m == mutability && t == parent_ty;
3504 let trait_path = match mutability {
3505 hir::Mutability::Not => &paths::ASREF_TRAIT,
3506 hir::Mutability::Mut => &paths::ASMUT_TRAIT,
3509 let trait_def_id = match get_trait_def_id(cx, trait_path) {
3511 None => return false,
3513 implements_trait(cx, ty, trait_def_id, &[parent_ty.into()])
3517 Self::Value => matches_value(cx, parent_ty, ty),
3518 Self::Ref => matches_ref(cx, hir::Mutability::Not, parent_ty, ty) || ty == parent_ty && is_copy(cx, ty),
3519 Self::RefMut => matches_ref(cx, hir::Mutability::Mut, parent_ty, ty),
3520 Self::No => ty != parent_ty,
3525 fn description(self) -> &'static str {
3527 Self::Value => "self by value",
3528 Self::Ref => "self by reference",
3529 Self::RefMut => "self by mutable reference",
3530 Self::No => "no self",
3537 fn check(&self, other: &str) -> bool {
3539 Self::Eq(this) => this == other,
3540 Self::StartsWith(this) => other.starts_with(this) && this != other,
3545 impl fmt::Display for Convention {
3546 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> Result<(), fmt::Error> {
3548 Self::Eq(this) => this.fmt(f),
3549 Self::StartsWith(this) => this.fmt(f).and_then(|_| '*'.fmt(f)),
3554 #[derive(Clone, Copy)]
3563 fn matches(self, cx: &LateContext<'_, '_>, ty: &hir::FnRetTy<'_>) -> bool {
3564 let is_unit = |ty: &hir::Ty<'_>| SpanlessEq::new(cx).eq_ty_kind(&ty.kind, &hir::TyKind::Tup(&[]));
3566 (Self::Unit, &hir::FnRetTy::DefaultReturn(_)) => true,
3567 (Self::Unit, &hir::FnRetTy::Return(ref ty)) if is_unit(ty) => true,
3568 (Self::Bool, &hir::FnRetTy::Return(ref ty)) if is_bool(ty) => true,
3569 (Self::Any, &hir::FnRetTy::Return(ref ty)) if !is_unit(ty) => true,
3570 (Self::Ref, &hir::FnRetTy::Return(ref ty)) => matches!(ty.kind, hir::TyKind::Rptr(_, _)),
3576 fn is_bool(ty: &hir::Ty<'_>) -> bool {
3577 if let hir::TyKind::Path(ref p) = ty.kind {
3578 match_qpath(p, &["bool"])
3584 // Returns `true` if `expr` contains a return expression
3585 fn contains_return(expr: &hir::Expr<'_>) -> bool {
3586 struct RetCallFinder {
3590 impl<'tcx> intravisit::Visitor<'tcx> for RetCallFinder {
3591 type Map = Map<'tcx>;
3593 fn visit_expr(&mut self, expr: &'tcx hir::Expr<'_>) {
3597 if let hir::ExprKind::Ret(..) = &expr.kind {
3600 intravisit::walk_expr(self, expr);
3604 fn nested_visit_map(&mut self) -> intravisit::NestedVisitorMap<Self::Map> {
3605 intravisit::NestedVisitorMap::None
3609 let mut visitor = RetCallFinder { found: false };
3610 visitor.visit_expr(expr);
3614 fn check_pointer_offset(cx: &LateContext<'_, '_>, expr: &hir::Expr<'_>, args: &[hir::Expr<'_>]) {
3617 if let ty::RawPtr(ty::TypeAndMut { ref ty, .. }) = cx.tables.expr_ty(&args[0]).kind;
3618 if let Ok(layout) = cx.tcx.layout_of(cx.param_env.and(ty));
3621 span_lint(cx, ZST_OFFSET, expr.span, "offset calculation on zero-sized value");
3626 fn lint_filetype_is_file(cx: &LateContext<'_, '_>, expr: &hir::Expr<'_>, args: &[hir::Expr<'_>]) {
3627 let ty = cx.tables.expr_ty(&args[0]);
3629 if !match_type(cx, ty, &paths::FILE_TYPE) {
3635 let lint_unary: &str;
3636 let help_unary: &str;
3638 if let Some(parent) = get_parent_expr(cx, expr);
3639 if let hir::ExprKind::Unary(op, _) = parent.kind;
3640 if op == hir::UnOp::UnNot;
3653 let lint_msg = format!("`{}FileType::is_file()` only {} regular files", lint_unary, verb);
3654 let help_msg = format!("use `{}FileType::is_dir()` instead", help_unary);
3655 span_lint_and_help(cx, FILETYPE_IS_FILE, span, &lint_msg, None, &help_msg);
3658 fn fn_header_equals(expected: hir::FnHeader, actual: hir::FnHeader) -> bool {
3659 expected.constness == actual.constness
3660 && expected.unsafety == actual.unsafety
3661 && expected.asyncness == actual.asyncness