1 #![allow(rustc::default_hash_types)]
4 use std::cmp::Ordering;
5 use std::collections::BTreeMap;
7 use if_chain::if_chain;
8 use rustc_ast::{FloatTy, IntTy, LitFloatType, LitIntType, LitKind, UintTy};
9 use rustc_errors::{Applicability, DiagnosticBuilder};
11 use rustc_hir::intravisit::{walk_body, walk_expr, walk_ty, FnKind, NestedVisitorMap, Visitor};
13 BinOpKind, Block, Body, Expr, ExprKind, FnDecl, FnRetTy, FnSig, GenericArg, GenericBounds, GenericParamKind, HirId,
14 ImplItem, ImplItemKind, Item, ItemKind, Lifetime, Lit, Local, MatchSource, MutTy, Mutability, Node, QPath, Stmt,
15 StmtKind, SyntheticTyParamKind, TraitFn, TraitItem, TraitItemKind, TyKind, UnOp,
17 use rustc_lint::{LateContext, LateLintPass, LintContext};
18 use rustc_middle::hir::map::Map;
19 use rustc_middle::lint::in_external_macro;
20 use rustc_middle::ty::TypeFoldable;
21 use rustc_middle::ty::{self, InferTy, Ty, TyCtxt, TyS, TypeckResults};
22 use rustc_session::{declare_lint_pass, declare_tool_lint, impl_lint_pass};
23 use rustc_span::hygiene::{ExpnKind, MacroKind};
24 use rustc_span::source_map::Span;
25 use rustc_span::symbol::sym;
26 use rustc_target::abi::LayoutOf;
27 use rustc_target::spec::abi::Abi;
28 use rustc_typeck::hir_ty_to_ty;
30 use crate::consts::{constant, Constant};
31 use crate::utils::paths;
33 clip, comparisons, differing_macro_contexts, higher, in_constant, indent_of, int_bits, is_type_diagnostic_item,
34 last_path_segment, match_def_path, match_path, method_chain_args, multispan_sugg, numeric_literal::NumericLiteral,
35 qpath_res, reindent_multiline, sext, snippet, snippet_opt, snippet_with_applicability, snippet_with_macro_callsite,
36 span_lint, span_lint_and_help, span_lint_and_sugg, span_lint_and_then, unsext,
39 declare_clippy_lint! {
40 /// **What it does:** Checks for use of `Box<Vec<_>>` anywhere in the code.
41 /// Check the [Box documentation](https://doc.rust-lang.org/std/boxed/index.html) for more information.
43 /// **Why is this bad?** `Vec` already keeps its contents in a separate area on
44 /// the heap. So if you `Box` it, you just add another level of indirection
45 /// without any benefit whatsoever.
47 /// **Known problems:** None.
52 /// values: Box<Vec<Foo>>,
65 "usage of `Box<Vec<T>>`, vector elements are already on the heap"
68 declare_clippy_lint! {
69 /// **What it does:** Checks for use of `Vec<Box<T>>` where T: Sized anywhere in the code.
70 /// Check the [Box documentation](https://doc.rust-lang.org/std/boxed/index.html) for more information.
72 /// **Why is this bad?** `Vec` already keeps its contents in a separate area on
73 /// the heap. So if you `Box` its contents, you just add another level of indirection.
75 /// **Known problems:** Vec<Box<T: Sized>> makes sense if T is a large type (see #3530,
81 /// values: Vec<Box<i32>>,
94 "usage of `Vec<Box<T>>` where T: Sized, vector elements are already on the heap"
97 declare_clippy_lint! {
98 /// **What it does:** Checks for use of `Option<Option<_>>` in function signatures and type
101 /// **Why is this bad?** `Option<_>` represents an optional value. `Option<Option<_>>`
102 /// represents an optional optional value which is logically the same thing as an optional
103 /// value but has an unneeded extra level of wrapping.
105 /// If you have a case where `Some(Some(_))`, `Some(None)` and `None` are distinct cases,
106 /// consider a custom `enum` instead, with clear names for each case.
108 /// **Known problems:** None.
112 /// fn get_data() -> Option<Option<u32>> {
120 /// pub enum Contents {
121 /// Data(Vec<u8>), // Was Some(Some(Vec<u8>))
122 /// NotYetFetched, // Was Some(None)
123 /// None, // Was None
126 /// fn get_data() -> Contents {
132 "usage of `Option<Option<T>>`"
135 declare_clippy_lint! {
136 /// **What it does:** Checks for usage of any `LinkedList`, suggesting to use a
137 /// `Vec` or a `VecDeque` (formerly called `RingBuf`).
139 /// **Why is this bad?** Gankro says:
141 /// > The TL;DR of `LinkedList` is that it's built on a massive amount of
142 /// pointers and indirection.
143 /// > It wastes memory, it has terrible cache locality, and is all-around slow.
145 /// > "only" amortized for push/pop, should be faster in the general case for
146 /// almost every possible
147 /// > workload, and isn't even amortized at all if you can predict the capacity
150 /// > `LinkedList`s are only really good if you're doing a lot of merging or
151 /// splitting of lists.
152 /// > This is because they can just mangle some pointers instead of actually
153 /// copying the data. Even
154 /// > if you're doing a lot of insertion in the middle of the list, `RingBuf`
155 /// can still be better
156 /// > because of how expensive it is to seek to the middle of a `LinkedList`.
158 /// **Known problems:** False positives – the instances where using a
159 /// `LinkedList` makes sense are few and far between, but they can still happen.
163 /// # use std::collections::LinkedList;
164 /// let x: LinkedList<usize> = LinkedList::new();
168 "usage of LinkedList, usually a vector is faster, or a more specialized data structure like a `VecDeque`"
171 declare_clippy_lint! {
172 /// **What it does:** Checks for use of `&Box<T>` anywhere in the code.
173 /// Check the [Box documentation](https://doc.rust-lang.org/std/boxed/index.html) for more information.
175 /// **Why is this bad?** Any `&Box<T>` can also be a `&T`, which is more
178 /// **Known problems:** None.
182 /// fn foo(bar: &Box<T>) { ... }
188 /// fn foo(bar: &T) { ... }
192 "a borrow of a boxed type"
195 declare_clippy_lint! {
196 /// **What it does:** Checks for use of redundant allocations anywhere in the code.
198 /// **Why is this bad?** Expressions such as `Rc<&T>`, `Rc<Rc<T>>`, `Rc<Box<T>>`, `Box<&T>`
199 /// add an unnecessary level of indirection.
201 /// **Known problems:** None.
205 /// # use std::rc::Rc;
206 /// fn foo(bar: Rc<&usize>) {}
212 /// fn foo(bar: &usize) {}
214 pub REDUNDANT_ALLOCATION,
216 "redundant allocation"
219 declare_clippy_lint! {
220 /// **What it does:** Checks for `Rc<T>` and `Arc<T>` when `T` is a mutable buffer type such as `String` or `Vec`.
222 /// **Why is this bad?** Expressions such as `Rc<String>` usually have no advantage over `Rc<str>`, since
223 /// it is larger and involves an extra level of indirection, and doesn't implement `Borrow<str>`.
225 /// While mutating a buffer type would still be possible with `Rc::get_mut()`, it only
226 /// works if there are no additional references yet, which usually defeats the purpose of
227 /// enclosing it in a shared ownership type. Instead, additionally wrapping the inner
228 /// type with an interior mutable container (such as `RefCell` or `Mutex`) would normally
231 /// **Known problems:** This pattern can be desirable to avoid the overhead of a `RefCell` or `Mutex` for
232 /// cases where mutation only happens before there are any additional references.
236 /// # use std::rc::Rc;
237 /// fn foo(interned: Rc<String>) { ... }
243 /// fn foo(interned: Rc<str>) { ... }
247 "shared ownership of a buffer type"
251 vec_box_size_threshold: u64,
254 impl_lint_pass!(Types => [BOX_VEC, VEC_BOX, OPTION_OPTION, LINKEDLIST, BORROWED_BOX, REDUNDANT_ALLOCATION, RC_BUFFER]);
256 impl<'tcx> LateLintPass<'tcx> for Types {
257 fn check_fn(&mut self, cx: &LateContext<'_>, _: FnKind<'_>, decl: &FnDecl<'_>, _: &Body<'_>, _: Span, id: HirId) {
258 // Skip trait implementations; see issue #605.
259 if let Some(hir::Node::Item(item)) = cx.tcx.hir().find(cx.tcx.hir().get_parent_item(id)) {
260 if let ItemKind::Impl { of_trait: Some(_), .. } = item.kind {
265 self.check_fn_decl(cx, decl);
268 fn check_struct_field(&mut self, cx: &LateContext<'_>, field: &hir::StructField<'_>) {
269 self.check_ty(cx, &field.ty, false);
272 fn check_trait_item(&mut self, cx: &LateContext<'_>, item: &TraitItem<'_>) {
274 TraitItemKind::Const(ref ty, _) | TraitItemKind::Type(_, Some(ref ty)) => self.check_ty(cx, ty, false),
275 TraitItemKind::Fn(ref sig, _) => self.check_fn_decl(cx, &sig.decl),
280 fn check_local(&mut self, cx: &LateContext<'_>, local: &Local<'_>) {
281 if let Some(ref ty) = local.ty {
282 self.check_ty(cx, ty, true);
287 /// Checks if `qpath` has last segment with type parameter matching `path`
288 fn match_type_parameter(cx: &LateContext<'_>, qpath: &QPath<'_>, path: &[&str]) -> Option<Span> {
289 let last = last_path_segment(qpath);
291 if let Some(ref params) = last.args;
292 if !params.parenthesized;
293 if let Some(ty) = params.args.iter().find_map(|arg| match arg {
294 GenericArg::Type(ty) => Some(ty),
297 if let TyKind::Path(ref qpath) = ty.kind;
298 if let Some(did) = qpath_res(cx, qpath, ty.hir_id).opt_def_id();
299 if match_def_path(cx, did, path);
301 return Some(ty.span);
307 fn match_buffer_type(cx: &LateContext<'_>, qpath: &QPath<'_>) -> Option<&'static str> {
308 if match_type_parameter(cx, qpath, &paths::STRING).is_some() {
311 if match_type_parameter(cx, qpath, &paths::OS_STRING).is_some() {
312 return Some("std::ffi::OsStr");
314 if match_type_parameter(cx, qpath, &paths::PATH_BUF).is_some() {
315 return Some("std::path::Path");
320 fn match_borrows_parameter(_cx: &LateContext<'_>, qpath: &QPath<'_>) -> Option<Span> {
321 let last = last_path_segment(qpath);
323 if let Some(ref params) = last.args;
324 if !params.parenthesized;
325 if let Some(ty) = params.args.iter().find_map(|arg| match arg {
326 GenericArg::Type(ty) => Some(ty),
329 if let TyKind::Rptr(..) = ty.kind;
331 return Some(ty.span);
338 pub fn new(vec_box_size_threshold: u64) -> Self {
339 Self { vec_box_size_threshold }
342 fn check_fn_decl(&mut self, cx: &LateContext<'_>, decl: &FnDecl<'_>) {
343 for input in decl.inputs {
344 self.check_ty(cx, input, false);
347 if let FnRetTy::Return(ref ty) = decl.output {
348 self.check_ty(cx, ty, false);
352 /// Recursively check for `TypePass` lints in the given type. Stop at the first
355 /// The parameter `is_local` distinguishes the context of the type; types from
356 /// local bindings should only be checked for the `BORROWED_BOX` lint.
357 #[allow(clippy::too_many_lines)]
358 fn check_ty(&mut self, cx: &LateContext<'_>, hir_ty: &hir::Ty<'_>, is_local: bool) {
359 if hir_ty.span.from_expansion() {
363 TyKind::Path(ref qpath) if !is_local => {
364 let hir_id = hir_ty.hir_id;
365 let res = qpath_res(cx, qpath, hir_id);
366 if let Some(def_id) = res.opt_def_id() {
367 if Some(def_id) == cx.tcx.lang_items().owned_box() {
368 if let Some(span) = match_borrows_parameter(cx, qpath) {
369 let mut applicability = Applicability::MachineApplicable;
372 REDUNDANT_ALLOCATION,
374 "usage of `Box<&T>`",
376 snippet_with_applicability(cx, span, "..", &mut applicability).to_string(),
379 return; // don't recurse into the type
381 if match_type_parameter(cx, qpath, &paths::VEC).is_some() {
386 "you seem to be trying to use `Box<Vec<T>>`. Consider using just `Vec<T>`",
388 "`Vec<T>` is already on the heap, `Box<Vec<T>>` makes an extra allocation.",
390 return; // don't recurse into the type
392 } else if cx.tcx.is_diagnostic_item(sym::Rc, def_id) {
393 if let Some(span) = match_type_parameter(cx, qpath, &paths::RC) {
394 let mut applicability = Applicability::MachineApplicable;
397 REDUNDANT_ALLOCATION,
399 "usage of `Rc<Rc<T>>`",
401 snippet_with_applicability(cx, span, "..", &mut applicability).to_string(),
404 return; // don't recurse into the type
406 if match_type_parameter(cx, qpath, &paths::BOX).is_some() {
407 let box_ty = match &last_path_segment(qpath).args.unwrap().args[0] {
408 GenericArg::Type(ty) => match &ty.kind {
409 TyKind::Path(qpath) => qpath,
414 let inner_span = match &last_path_segment(&box_ty).args.unwrap().args[0] {
415 GenericArg::Type(ty) => ty.span,
418 let mut applicability = Applicability::MachineApplicable;
421 REDUNDANT_ALLOCATION,
423 "usage of `Rc<Box<T>>`",
427 snippet_with_applicability(cx, inner_span, "..", &mut applicability)
431 return; // don't recurse into the type
433 if let Some(alternate) = match_buffer_type(cx, qpath) {
438 "usage of `Rc<T>` when T is a buffer type",
440 format!("Rc<{}>", alternate),
441 Applicability::MachineApplicable,
443 return; // don't recurse into the type
445 if match_type_parameter(cx, qpath, &paths::VEC).is_some() {
446 let vec_ty = match &last_path_segment(qpath).args.unwrap().args[0] {
447 GenericArg::Type(ty) => match &ty.kind {
448 TyKind::Path(qpath) => qpath,
453 let inner_span = match &last_path_segment(&vec_ty).args.unwrap().args[0] {
454 GenericArg::Type(ty) => ty.span,
457 let mut applicability = Applicability::MachineApplicable;
462 "usage of `Rc<T>` when T is a buffer type",
466 snippet_with_applicability(cx, inner_span, "..", &mut applicability)
468 Applicability::MachineApplicable,
470 return; // don't recurse into the type
472 if let Some(span) = match_borrows_parameter(cx, qpath) {
473 let mut applicability = Applicability::MachineApplicable;
476 REDUNDANT_ALLOCATION,
480 snippet_with_applicability(cx, span, "..", &mut applicability).to_string(),
483 return; // don't recurse into the type
485 } else if cx.tcx.is_diagnostic_item(sym::Arc, def_id) {
486 if let Some(alternate) = match_buffer_type(cx, qpath) {
491 "usage of `Arc<T>` when T is a buffer type",
493 format!("Arc<{}>", alternate),
494 Applicability::MachineApplicable,
496 return; // don't recurse into the type
498 if match_type_parameter(cx, qpath, &paths::VEC).is_some() {
499 let vec_ty = match &last_path_segment(qpath).args.unwrap().args[0] {
500 GenericArg::Type(ty) => match &ty.kind {
501 TyKind::Path(qpath) => qpath,
506 let inner_span = match &last_path_segment(&vec_ty).args.unwrap().args[0] {
507 GenericArg::Type(ty) => ty.span,
510 let mut applicability = Applicability::MachineApplicable;
515 "usage of `Arc<T>` when T is a buffer type",
519 snippet_with_applicability(cx, inner_span, "..", &mut applicability)
521 Applicability::MachineApplicable,
523 return; // don't recurse into the type
525 } else if cx.tcx.is_diagnostic_item(sym::vec_type, def_id) {
527 // Get the _ part of Vec<_>
528 if let Some(ref last) = last_path_segment(qpath).args;
529 if let Some(ty) = last.args.iter().find_map(|arg| match arg {
530 GenericArg::Type(ty) => Some(ty),
533 // ty is now _ at this point
534 if let TyKind::Path(ref ty_qpath) = ty.kind;
535 let res = qpath_res(cx, ty_qpath, ty.hir_id);
536 if let Some(def_id) = res.opt_def_id();
537 if Some(def_id) == cx.tcx.lang_items().owned_box();
538 // At this point, we know ty is Box<T>, now get T
539 if let Some(ref last) = last_path_segment(ty_qpath).args;
540 if let Some(boxed_ty) = last.args.iter().find_map(|arg| match arg {
541 GenericArg::Type(ty) => Some(ty),
544 let ty_ty = hir_ty_to_ty(cx.tcx, boxed_ty);
545 if !ty_ty.has_escaping_bound_vars();
546 if ty_ty.is_sized(cx.tcx.at(ty.span), cx.param_env);
547 if let Ok(ty_ty_size) = cx.layout_of(ty_ty).map(|l| l.size.bytes());
548 if ty_ty_size <= self.vec_box_size_threshold;
554 "`Vec<T>` is already on the heap, the boxing is unnecessary.",
556 format!("Vec<{}>", snippet(cx, boxed_ty.span, "..")),
557 Applicability::MachineApplicable,
559 return; // don't recurse into the type
562 } else if cx.tcx.is_diagnostic_item(sym::option_type, def_id) {
563 if match_type_parameter(cx, qpath, &paths::OPTION).is_some() {
568 "consider using `Option<T>` instead of `Option<Option<T>>` or a custom \
569 enum if you need to distinguish all 3 cases",
571 return; // don't recurse into the type
573 } else if match_def_path(cx, def_id, &paths::LINKED_LIST) {
578 "I see you're using a LinkedList! Perhaps you meant some other data structure?",
580 "a `VecDeque` might work",
582 return; // don't recurse into the type
586 QPath::Resolved(Some(ref ty), ref p) => {
587 self.check_ty(cx, ty, is_local);
588 for ty in p.segments.iter().flat_map(|seg| {
591 .map_or_else(|| [].iter(), |params| params.args.iter())
592 .filter_map(|arg| match arg {
593 GenericArg::Type(ty) => Some(ty),
597 self.check_ty(cx, ty, is_local);
600 QPath::Resolved(None, ref p) => {
601 for ty in p.segments.iter().flat_map(|seg| {
604 .map_or_else(|| [].iter(), |params| params.args.iter())
605 .filter_map(|arg| match arg {
606 GenericArg::Type(ty) => Some(ty),
610 self.check_ty(cx, ty, is_local);
613 QPath::TypeRelative(ref ty, ref seg) => {
614 self.check_ty(cx, ty, is_local);
615 if let Some(ref params) = seg.args {
616 for ty in params.args.iter().filter_map(|arg| match arg {
617 GenericArg::Type(ty) => Some(ty),
620 self.check_ty(cx, ty, is_local);
624 QPath::LangItem(..) => {},
627 TyKind::Rptr(ref lt, ref mut_ty) => self.check_ty_rptr(cx, hir_ty, is_local, lt, mut_ty),
629 TyKind::Slice(ref ty) | TyKind::Array(ref ty, _) | TyKind::Ptr(MutTy { ref ty, .. }) => {
630 self.check_ty(cx, ty, is_local)
632 TyKind::Tup(tys) => {
634 self.check_ty(cx, ty, is_local);
643 cx: &LateContext<'_>,
644 hir_ty: &hir::Ty<'_>,
649 match mut_ty.ty.kind {
650 TyKind::Path(ref qpath) => {
651 let hir_id = mut_ty.ty.hir_id;
652 let def = qpath_res(cx, qpath, hir_id);
654 if let Some(def_id) = def.opt_def_id();
655 if Some(def_id) == cx.tcx.lang_items().owned_box();
656 if let QPath::Resolved(None, ref path) = *qpath;
657 if let [ref bx] = *path.segments;
658 if let Some(ref params) = bx.args;
659 if !params.parenthesized;
660 if let Some(inner) = params.args.iter().find_map(|arg| match arg {
661 GenericArg::Type(ty) => Some(ty),
665 if is_any_trait(inner) {
666 // Ignore `Box<Any>` types; see issue #1884 for details.
670 let ltopt = if lt.is_elided() {
673 format!("{} ", lt.name.ident().as_str())
676 if mut_ty.mutbl == Mutability::Mut {
677 // Ignore `&mut Box<T>` types; see issue #2907 for
682 // When trait objects or opaque types have lifetime or auto-trait bounds,
683 // we need to add parentheses to avoid a syntax error due to its ambiguity.
684 // Originally reported as the issue #3128.
685 let inner_snippet = snippet(cx, inner.span, "..");
686 let suggestion = match &inner.kind {
687 TyKind::TraitObject(bounds, lt_bound) if bounds.len() > 1 || !lt_bound.is_elided() => {
688 format!("&{}({})", ltopt, &inner_snippet)
691 if get_bounds_if_impl_trait(cx, qpath, inner.hir_id)
692 .map_or(false, |bounds| bounds.len() > 1) =>
694 format!("&{}({})", ltopt, &inner_snippet)
696 _ => format!("&{}{}", ltopt, &inner_snippet),
702 "you seem to be trying to use `&Box<T>`. Consider using just `&T`",
705 // To make this `MachineApplicable`, at least one needs to check if it isn't a trait item
706 // because the trait impls of it will break otherwise;
707 // and there may be other cases that result in invalid code.
708 // For example, type coercion doesn't work nicely.
709 Applicability::Unspecified,
711 return; // don't recurse into the type
714 self.check_ty(cx, &mut_ty.ty, is_local);
716 _ => self.check_ty(cx, &mut_ty.ty, is_local),
721 // Returns true if given type is `Any` trait.
722 fn is_any_trait(t: &hir::Ty<'_>) -> bool {
724 if let TyKind::TraitObject(ref traits, _) = t.kind;
725 if !traits.is_empty();
726 // Only Send/Sync can be used as additional traits, so it is enough to
727 // check only the first trait.
728 if match_path(&traits[0].trait_ref.path, &paths::ANY_TRAIT);
737 fn get_bounds_if_impl_trait<'tcx>(cx: &LateContext<'tcx>, qpath: &QPath<'_>, id: HirId) -> Option<GenericBounds<'tcx>> {
739 if let Some(did) = qpath_res(cx, qpath, id).opt_def_id();
740 if let Some(node) = cx.tcx.hir().get_if_local(did);
741 if let Node::GenericParam(generic_param) = node;
742 if let GenericParamKind::Type { synthetic, .. } = generic_param.kind;
743 if synthetic == Some(SyntheticTyParamKind::ImplTrait);
745 Some(generic_param.bounds)
752 declare_clippy_lint! {
753 /// **What it does:** Checks for binding a unit value.
755 /// **Why is this bad?** A unit value cannot usefully be used anywhere. So
756 /// binding one is kind of pointless.
758 /// **Known problems:** None.
768 "creating a `let` binding to a value of unit type, which usually can't be used afterwards"
771 declare_lint_pass!(LetUnitValue => [LET_UNIT_VALUE]);
773 impl<'tcx> LateLintPass<'tcx> for LetUnitValue {
774 fn check_stmt(&mut self, cx: &LateContext<'tcx>, stmt: &'tcx Stmt<'_>) {
775 if let StmtKind::Local(ref local) = stmt.kind {
776 if is_unit(cx.typeck_results().pat_ty(&local.pat)) {
777 if in_external_macro(cx.sess(), stmt.span) || local.pat.span.from_expansion() {
780 if higher::is_from_for_desugar(local) {
787 "this let-binding has unit value",
789 if let Some(expr) = &local.init {
790 let snip = snippet_with_macro_callsite(cx, expr.span, "()");
791 diag.span_suggestion(
793 "omit the `let` binding",
794 format!("{};", snip),
795 Applicability::MachineApplicable, // snippet
805 declare_clippy_lint! {
806 /// **What it does:** Checks for comparisons to unit. This includes all binary
807 /// comparisons (like `==` and `<`) and asserts.
809 /// **Why is this bad?** Unit is always equal to itself, and thus is just a
810 /// clumsily written constant. Mostly this happens when someone accidentally
811 /// adds semicolons at the end of the operands.
813 /// **Known problems:** None.
844 /// assert_eq!({ foo(); }, { bar(); });
846 /// will always succeed
849 "comparing unit values"
852 declare_lint_pass!(UnitCmp => [UNIT_CMP]);
854 impl<'tcx> LateLintPass<'tcx> for UnitCmp {
855 fn check_expr(&mut self, cx: &LateContext<'tcx>, expr: &'tcx Expr<'tcx>) {
856 if expr.span.from_expansion() {
857 if let Some(callee) = expr.span.source_callee() {
858 if let ExpnKind::Macro(MacroKind::Bang, symbol) = callee.kind {
859 if let ExprKind::Binary(ref cmp, ref left, _) = expr.kind {
861 if op.is_comparison() && is_unit(cx.typeck_results().expr_ty(left)) {
862 let result = match &*symbol.as_str() {
863 "assert_eq" | "debug_assert_eq" => "succeed",
864 "assert_ne" | "debug_assert_ne" => "fail",
872 "`{}` of unit values detected. This will always {}",
883 if let ExprKind::Binary(ref cmp, ref left, _) = expr.kind {
885 if op.is_comparison() && is_unit(cx.typeck_results().expr_ty(left)) {
886 let result = match op {
887 BinOpKind::Eq | BinOpKind::Le | BinOpKind::Ge => "true",
895 "{}-comparison of unit values detected. This will always be {}",
905 declare_clippy_lint! {
906 /// **What it does:** Checks for passing a unit value as an argument to a function without using a
907 /// unit literal (`()`).
909 /// **Why is this bad?** This is likely the result of an accidental semicolon.
911 /// **Known problems:** None.
922 "passing unit to a function"
925 declare_lint_pass!(UnitArg => [UNIT_ARG]);
927 impl<'tcx> LateLintPass<'tcx> for UnitArg {
928 fn check_expr(&mut self, cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) {
929 if expr.span.from_expansion() {
933 // apparently stuff in the desugaring of `?` can trigger this
934 // so check for that here
935 // only the calls to `Try::from_error` is marked as desugared,
936 // so we need to check both the current Expr and its parent.
937 if is_questionmark_desugar_marked_call(expr) {
941 let map = &cx.tcx.hir();
942 let opt_parent_node = map.find(map.get_parent_node(expr.hir_id));
943 if let Some(hir::Node::Expr(parent_expr)) = opt_parent_node;
944 if is_questionmark_desugar_marked_call(parent_expr);
951 ExprKind::Call(_, args) | ExprKind::MethodCall(_, _, args, _) => {
952 let args_to_recover = args
955 if is_unit(cx.typeck_results().expr_ty(arg)) && !is_unit_literal(arg) {
956 !matches!(&arg.kind, ExprKind::Match(.., MatchSource::TryDesugar))
961 .collect::<Vec<_>>();
962 if !args_to_recover.is_empty() {
963 lint_unit_args(cx, expr, &args_to_recover);
971 fn fmt_stmts_and_call(
972 cx: &LateContext<'_>,
973 call_expr: &Expr<'_>,
975 args_snippets: &[impl AsRef<str>],
976 non_empty_block_args_snippets: &[impl AsRef<str>],
978 let call_expr_indent = indent_of(cx, call_expr.span).unwrap_or(0);
979 let call_snippet_with_replacements = args_snippets
981 .fold(call_snippet.to_owned(), |acc, arg| acc.replacen(arg.as_ref(), "()", 1));
983 let mut stmts_and_call = non_empty_block_args_snippets
985 .map(|it| it.as_ref().to_owned())
986 .collect::<Vec<_>>();
987 stmts_and_call.push(call_snippet_with_replacements);
988 stmts_and_call = stmts_and_call
990 .map(|v| reindent_multiline(v.into(), true, Some(call_expr_indent)).into_owned())
993 let mut stmts_and_call_snippet = stmts_and_call.join(&format!("{}{}", ";\n", " ".repeat(call_expr_indent)));
994 // expr is not in a block statement or result expression position, wrap in a block
995 let parent_node = cx.tcx.hir().find(cx.tcx.hir().get_parent_node(call_expr.hir_id));
996 if !matches!(parent_node, Some(Node::Block(_))) && !matches!(parent_node, Some(Node::Stmt(_))) {
997 let block_indent = call_expr_indent + 4;
998 stmts_and_call_snippet =
999 reindent_multiline(stmts_and_call_snippet.into(), true, Some(block_indent)).into_owned();
1000 stmts_and_call_snippet = format!(
1002 " ".repeat(block_indent),
1003 &stmts_and_call_snippet,
1004 " ".repeat(call_expr_indent)
1007 stmts_and_call_snippet
1010 fn lint_unit_args(cx: &LateContext<'_>, expr: &Expr<'_>, args_to_recover: &[&Expr<'_>]) {
1011 let mut applicability = Applicability::MachineApplicable;
1012 let (singular, plural) = if args_to_recover.len() > 1 {
1021 &format!("passing {}unit value{} to a function", singular, plural),
1028 if let ExprKind::Block(block, _) = arg.kind;
1029 if block.expr.is_none();
1030 if let Some(last_stmt) = block.stmts.iter().last();
1031 if let StmtKind::Semi(last_expr) = last_stmt.kind;
1032 if let Some(snip) = snippet_opt(cx, last_expr.span);
1044 .for_each(|(span, sugg)| {
1047 "remove the semicolon from the last statement in the block",
1049 Applicability::MaybeIncorrect,
1052 applicability = Applicability::MaybeIncorrect;
1055 let arg_snippets: Vec<String> = args_to_recover
1057 .filter_map(|arg| snippet_opt(cx, arg.span))
1059 let arg_snippets_without_empty_blocks: Vec<String> = args_to_recover
1061 .filter(|arg| !is_empty_block(arg))
1062 .filter_map(|arg| snippet_opt(cx, arg.span))
1065 if let Some(call_snippet) = snippet_opt(cx, expr.span) {
1066 let sugg = fmt_stmts_and_call(
1071 &arg_snippets_without_empty_blocks,
1074 if arg_snippets_without_empty_blocks.is_empty() {
1075 db.multipart_suggestion(
1076 &format!("use {}unit literal{} instead", singular, plural),
1079 .map(|arg| (arg.span, "()".to_string()))
1080 .collect::<Vec<_>>(),
1084 let plural = arg_snippets_without_empty_blocks.len() > 1;
1085 let empty_or_s = if plural { "s" } else { "" };
1086 let it_or_them = if plural { "them" } else { "it" };
1090 "{}move the expression{} in front of the call and replace {} with the unit literal `()`",
1091 or, empty_or_s, it_or_them
1102 fn is_empty_block(expr: &Expr<'_>) -> bool {
1107 stmts: &[], expr: None, ..
1114 fn is_questionmark_desugar_marked_call(expr: &Expr<'_>) -> bool {
1115 use rustc_span::hygiene::DesugaringKind;
1116 if let ExprKind::Call(ref callee, _) = expr.kind {
1117 callee.span.is_desugaring(DesugaringKind::QuestionMark)
1123 fn is_unit(ty: Ty<'_>) -> bool {
1124 matches!(ty.kind(), ty::Tuple(slice) if slice.is_empty())
1127 fn is_unit_literal(expr: &Expr<'_>) -> bool {
1128 matches!(expr.kind, ExprKind::Tup(ref slice) if slice.is_empty())
1131 declare_clippy_lint! {
1132 /// **What it does:** Checks for casts from any numerical to a float type where
1133 /// the receiving type cannot store all values from the original type without
1134 /// rounding errors. This possible rounding is to be expected, so this lint is
1135 /// `Allow` by default.
1137 /// Basically, this warns on casting any integer with 32 or more bits to `f32`
1138 /// or any 64-bit integer to `f64`.
1140 /// **Why is this bad?** It's not bad at all. But in some applications it can be
1141 /// helpful to know where precision loss can take place. This lint can help find
1142 /// those places in the code.
1144 /// **Known problems:** None.
1148 /// let x = u64::MAX;
1151 pub CAST_PRECISION_LOSS,
1153 "casts that cause loss of precision, e.g., `x as f32` where `x: u64`"
1156 declare_clippy_lint! {
1157 /// **What it does:** Checks for casts from a signed to an unsigned numerical
1158 /// type. In this case, negative values wrap around to large positive values,
1159 /// which can be quite surprising in practice. However, as the cast works as
1160 /// defined, this lint is `Allow` by default.
1162 /// **Why is this bad?** Possibly surprising results. You can activate this lint
1163 /// as a one-time check to see where numerical wrapping can arise.
1165 /// **Known problems:** None.
1170 /// y as u128; // will return 18446744073709551615
1174 "casts from signed types to unsigned types, e.g., `x as u32` where `x: i32`"
1177 declare_clippy_lint! {
1178 /// **What it does:** Checks for casts between numerical types that may
1179 /// truncate large values. This is expected behavior, so the cast is `Allow` by
1182 /// **Why is this bad?** In some problem domains, it is good practice to avoid
1183 /// truncation. This lint can be activated to help assess where additional
1184 /// checks could be beneficial.
1186 /// **Known problems:** None.
1190 /// fn as_u8(x: u64) -> u8 {
1194 pub CAST_POSSIBLE_TRUNCATION,
1196 "casts that may cause truncation of the value, e.g., `x as u8` where `x: u32`, or `x as i32` where `x: f32`"
1199 declare_clippy_lint! {
1200 /// **What it does:** Checks for casts from an unsigned type to a signed type of
1201 /// the same size. Performing such a cast is a 'no-op' for the compiler,
1202 /// i.e., nothing is changed at the bit level, and the binary representation of
1203 /// the value is reinterpreted. This can cause wrapping if the value is too big
1204 /// for the target signed type. However, the cast works as defined, so this lint
1205 /// is `Allow` by default.
1207 /// **Why is this bad?** While such a cast is not bad in itself, the results can
1208 /// be surprising when this is not the intended behavior, as demonstrated by the
1211 /// **Known problems:** None.
1215 /// u32::MAX as i32; // will yield a value of `-1`
1217 pub CAST_POSSIBLE_WRAP,
1219 "casts that may cause wrapping around the value, e.g., `x as i32` where `x: u32` and `x > i32::MAX`"
1222 declare_clippy_lint! {
1223 /// **What it does:** Checks for casts between numerical types that may
1224 /// be replaced by safe conversion functions.
1226 /// **Why is this bad?** Rust's `as` keyword will perform many kinds of
1227 /// conversions, including silently lossy conversions. Conversion functions such
1228 /// as `i32::from` will only perform lossless conversions. Using the conversion
1229 /// functions prevents conversions from turning into silent lossy conversions if
1230 /// the types of the input expressions ever change, and make it easier for
1231 /// people reading the code to know that the conversion is lossless.
1233 /// **Known problems:** None.
1237 /// fn as_u64(x: u8) -> u64 {
1242 /// Using `::from` would look like this:
1245 /// fn as_u64(x: u8) -> u64 {
1251 "casts using `as` that are known to be lossless, e.g., `x as u64` where `x: u8`"
1254 declare_clippy_lint! {
1255 /// **What it does:** Checks for casts to the same type, casts of int literals to integer types
1256 /// and casts of float literals to float types.
1258 /// **Why is this bad?** It's just unnecessary.
1260 /// **Known problems:** None.
1264 /// let _ = 2i32 as i32;
1265 /// let _ = 0.5 as f32;
1272 /// let _ = 0.5_f32;
1274 pub UNNECESSARY_CAST,
1276 "cast to the same type, e.g., `x as i32` where `x: i32`"
1279 declare_clippy_lint! {
1280 /// **What it does:** Checks for casts from a less-strictly-aligned pointer to a
1281 /// more-strictly-aligned pointer
1283 /// **Why is this bad?** Dereferencing the resulting pointer may be undefined
1286 /// **Known problems:** Using `std::ptr::read_unaligned` and `std::ptr::write_unaligned` or similar
1287 /// on the resulting pointer is fine. Is over-zealous: Casts with manual alignment checks or casts like
1288 /// u64-> u8 -> u16 can be fine. Miri is able to do a more in-depth analysis.
1292 /// let _ = (&1u8 as *const u8) as *const u16;
1293 /// let _ = (&mut 1u8 as *mut u8) as *mut u16;
1295 pub CAST_PTR_ALIGNMENT,
1297 "cast from a pointer to a more-strictly-aligned pointer"
1300 declare_clippy_lint! {
1301 /// **What it does:** Checks for casts of function pointers to something other than usize
1303 /// **Why is this bad?**
1304 /// Casting a function pointer to anything other than usize/isize is not portable across
1305 /// architectures, because you end up losing bits if the target type is too small or end up with a
1306 /// bunch of extra bits that waste space and add more instructions to the final binary than
1307 /// strictly necessary for the problem
1309 /// Casting to isize also doesn't make sense since there are no signed addresses.
1315 /// fn fun() -> i32 { 1 }
1316 /// let a = fun as i64;
1319 /// fn fun2() -> i32 { 1 }
1320 /// let a = fun2 as usize;
1322 pub FN_TO_NUMERIC_CAST,
1324 "casting a function pointer to a numeric type other than usize"
1327 declare_clippy_lint! {
1328 /// **What it does:** Checks for casts of a function pointer to a numeric type not wide enough to
1331 /// **Why is this bad?**
1332 /// Such a cast discards some bits of the function's address. If this is intended, it would be more
1333 /// clearly expressed by casting to usize first, then casting the usize to the intended type (with
1334 /// a comment) to perform the truncation.
1340 /// fn fn1() -> i16 {
1343 /// let _ = fn1 as i32;
1345 /// // Better: Cast to usize first, then comment with the reason for the truncation
1346 /// fn fn2() -> i16 {
1349 /// let fn_ptr = fn2 as usize;
1350 /// let fn_ptr_truncated = fn_ptr as i32;
1352 pub FN_TO_NUMERIC_CAST_WITH_TRUNCATION,
1354 "casting a function pointer to a numeric type not wide enough to store the address"
1357 /// Returns the size in bits of an integral type.
1358 /// Will return 0 if the type is not an int or uint variant
1359 fn int_ty_to_nbits(typ: Ty<'_>, tcx: TyCtxt<'_>) -> u64 {
1361 ty::Int(i) => match i {
1362 IntTy::Isize => tcx.data_layout.pointer_size.bits(),
1369 ty::Uint(i) => match i {
1370 UintTy::Usize => tcx.data_layout.pointer_size.bits(),
1375 UintTy::U128 => 128,
1381 fn is_isize_or_usize(typ: Ty<'_>) -> bool {
1382 matches!(typ.kind(), ty::Int(IntTy::Isize) | ty::Uint(UintTy::Usize))
1385 fn span_precision_loss_lint(cx: &LateContext<'_>, expr: &Expr<'_>, cast_from: Ty<'_>, cast_to_f64: bool) {
1386 let mantissa_nbits = if cast_to_f64 { 52 } else { 23 };
1387 let arch_dependent = is_isize_or_usize(cast_from) && cast_to_f64;
1388 let arch_dependent_str = "on targets with 64-bit wide pointers ";
1389 let from_nbits_str = if arch_dependent {
1391 } else if is_isize_or_usize(cast_from) {
1392 "32 or 64".to_owned()
1394 int_ty_to_nbits(cast_from, cx.tcx).to_string()
1398 CAST_PRECISION_LOSS,
1401 "casting `{0}` to `{1}` causes a loss of precision {2}(`{0}` is {3} bits wide, \
1402 but `{1}`'s mantissa is only {4} bits wide)",
1404 if cast_to_f64 { "f64" } else { "f32" },
1405 if arch_dependent { arch_dependent_str } else { "" },
1412 fn should_strip_parens(op: &Expr<'_>, snip: &str) -> bool {
1413 if let ExprKind::Binary(_, _, _) = op.kind {
1414 if snip.starts_with('(') && snip.ends_with(')') {
1421 fn span_lossless_lint(cx: &LateContext<'_>, expr: &Expr<'_>, op: &Expr<'_>, cast_from: Ty<'_>, cast_to: Ty<'_>) {
1422 // Do not suggest using From in consts/statics until it is valid to do so (see #2267).
1423 if in_constant(cx, expr.hir_id) {
1426 // The suggestion is to use a function call, so if the original expression
1427 // has parens on the outside, they are no longer needed.
1428 let mut applicability = Applicability::MachineApplicable;
1429 let opt = snippet_opt(cx, op.span);
1430 let sugg = opt.as_ref().map_or_else(
1432 applicability = Applicability::HasPlaceholders;
1436 if should_strip_parens(op, snip) {
1437 &snip[1..snip.len() - 1]
1449 "casting `{}` to `{}` may become silently lossy if you later change the type",
1453 format!("{}::from({})", cast_to, sugg),
1464 fn check_loss_of_sign(cx: &LateContext<'_>, expr: &Expr<'_>, op: &Expr<'_>, cast_from: Ty<'_>, cast_to: Ty<'_>) {
1465 if !cast_from.is_signed() || cast_to.is_signed() {
1469 // don't lint for positive constants
1470 let const_val = constant(cx, &cx.typeck_results(), op);
1472 if let Some((const_val, _)) = const_val;
1473 if let Constant::Int(n) = const_val;
1474 if let ty::Int(ity) = *cast_from.kind();
1475 if sext(cx.tcx, n, ity) >= 0;
1481 // don't lint for the result of methods that always return non-negative values
1482 if let ExprKind::MethodCall(ref path, _, _, _) = op.kind {
1483 let mut method_name = path.ident.name.as_str();
1484 let allowed_methods = ["abs", "checked_abs", "rem_euclid", "checked_rem_euclid"];
1487 if method_name == "unwrap";
1488 if let Some(arglist) = method_chain_args(op, &["unwrap"]);
1489 if let ExprKind::MethodCall(ref inner_path, _, _, _) = &arglist[0][0].kind;
1491 method_name = inner_path.ident.name.as_str();
1495 if allowed_methods.iter().any(|&name| method_name == name) {
1505 "casting `{}` to `{}` may lose the sign of the value",
1511 fn check_truncation_and_wrapping(cx: &LateContext<'_>, expr: &Expr<'_>, cast_from: Ty<'_>, cast_to: Ty<'_>) {
1512 let arch_64_suffix = " on targets with 64-bit wide pointers";
1513 let arch_32_suffix = " on targets with 32-bit wide pointers";
1514 let cast_unsigned_to_signed = !cast_from.is_signed() && cast_to.is_signed();
1515 let from_nbits = int_ty_to_nbits(cast_from, cx.tcx);
1516 let to_nbits = int_ty_to_nbits(cast_to, cx.tcx);
1517 let (span_truncation, suffix_truncation, span_wrap, suffix_wrap) =
1518 match (is_isize_or_usize(cast_from), is_isize_or_usize(cast_to)) {
1519 (true, true) | (false, false) => (
1520 to_nbits < from_nbits,
1522 to_nbits == from_nbits && cast_unsigned_to_signed,
1532 to_nbits <= 32 && cast_unsigned_to_signed,
1538 cast_unsigned_to_signed,
1539 if from_nbits == 64 {
1546 if span_truncation {
1549 CAST_POSSIBLE_TRUNCATION,
1552 "casting `{}` to `{}` may truncate the value{}",
1555 match suffix_truncation {
1556 ArchSuffix::_32 => arch_32_suffix,
1557 ArchSuffix::_64 => arch_64_suffix,
1558 ArchSuffix::None => "",
1569 "casting `{}` to `{}` may wrap around the value{}",
1573 ArchSuffix::_32 => arch_32_suffix,
1574 ArchSuffix::_64 => arch_64_suffix,
1575 ArchSuffix::None => "",
1582 fn check_lossless(cx: &LateContext<'_>, expr: &Expr<'_>, op: &Expr<'_>, cast_from: Ty<'_>, cast_to: Ty<'_>) {
1583 let cast_signed_to_unsigned = cast_from.is_signed() && !cast_to.is_signed();
1584 let from_nbits = int_ty_to_nbits(cast_from, cx.tcx);
1585 let to_nbits = int_ty_to_nbits(cast_to, cx.tcx);
1586 if !is_isize_or_usize(cast_from) && !is_isize_or_usize(cast_to) && from_nbits < to_nbits && !cast_signed_to_unsigned
1588 span_lossless_lint(cx, expr, op, cast_from, cast_to);
1592 declare_lint_pass!(Casts => [
1593 CAST_PRECISION_LOSS,
1595 CAST_POSSIBLE_TRUNCATION,
1601 FN_TO_NUMERIC_CAST_WITH_TRUNCATION,
1604 // Check if the given type is either `core::ffi::c_void` or
1605 // one of the platform specific `libc::<platform>::c_void` of libc.
1606 fn is_c_void(cx: &LateContext<'_>, ty: Ty<'_>) -> bool {
1607 if let ty::Adt(adt, _) = ty.kind() {
1608 let names = cx.get_def_path(adt.did);
1610 if names.is_empty() {
1613 if names[0] == sym::libc || names[0] == sym::core && *names.last().unwrap() == sym!(c_void) {
1620 /// Returns the mantissa bits wide of a fp type.
1621 /// Will return 0 if the type is not a fp
1622 fn fp_ty_mantissa_nbits(typ: Ty<'_>) -> u32 {
1624 ty::Float(FloatTy::F32) => 23,
1625 ty::Float(FloatTy::F64) | ty::Infer(InferTy::FloatVar(_)) => 52,
1630 impl<'tcx> LateLintPass<'tcx> for Casts {
1631 fn check_expr(&mut self, cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) {
1632 if expr.span.from_expansion() {
1635 if let ExprKind::Cast(ref ex, _) = expr.kind {
1636 let (cast_from, cast_to) = (cx.typeck_results().expr_ty(ex), cx.typeck_results().expr_ty(expr));
1637 lint_fn_to_numeric_cast(cx, expr, ex, cast_from, cast_to);
1638 if let Some(lit) = get_numeric_literal(ex) {
1639 let literal_str = snippet_opt(cx, ex.span).unwrap_or_default();
1642 if let LitKind::Int(n, _) = lit.node;
1643 if let Some(src) = snippet_opt(cx, lit.span);
1644 if cast_to.is_floating_point();
1645 if let Some(num_lit) = NumericLiteral::from_lit_kind(&src, &lit.node);
1646 let from_nbits = 128 - n.leading_zeros();
1647 let to_nbits = fp_ty_mantissa_nbits(cast_to);
1648 if from_nbits != 0 && to_nbits != 0 && from_nbits <= to_nbits && num_lit.is_decimal();
1650 let literal_str = if is_unary_neg(ex) { format!("-{}", num_lit.integer) } else { num_lit.integer.into() };
1651 show_unnecessary_cast(cx, expr, &literal_str, cast_from, cast_to);
1657 LitKind::Int(_, LitIntType::Unsuffixed) if cast_to.is_integral() => {
1658 show_unnecessary_cast(cx, expr, &literal_str, cast_from, cast_to);
1660 LitKind::Float(_, LitFloatType::Unsuffixed) if cast_to.is_floating_point() => {
1661 show_unnecessary_cast(cx, expr, &literal_str, cast_from, cast_to);
1663 LitKind::Int(_, LitIntType::Unsuffixed) | LitKind::Float(_, LitFloatType::Unsuffixed) => {},
1665 if cast_from.kind() == cast_to.kind() && !in_external_macro(cx.sess(), expr.span) {
1671 "casting to the same type is unnecessary (`{}` -> `{}`)",
1679 if cast_from.is_numeric() && cast_to.is_numeric() && !in_external_macro(cx.sess(), expr.span) {
1680 lint_numeric_casts(cx, expr, ex, cast_from, cast_to);
1683 lint_cast_ptr_alignment(cx, expr, cast_from, cast_to);
1688 fn is_unary_neg(expr: &Expr<'_>) -> bool {
1689 matches!(expr.kind, ExprKind::Unary(UnOp::UnNeg, _))
1692 fn get_numeric_literal<'e>(expr: &'e Expr<'e>) -> Option<&'e Lit> {
1694 ExprKind::Lit(ref lit) => Some(lit),
1695 ExprKind::Unary(UnOp::UnNeg, e) => {
1696 if let ExprKind::Lit(ref lit) = e.kind {
1706 fn show_unnecessary_cast(cx: &LateContext<'_>, expr: &Expr<'_>, literal_str: &str, cast_from: Ty<'_>, cast_to: Ty<'_>) {
1707 let literal_kind_name = if cast_from.is_integral() { "integer" } else { "float" };
1712 &format!("casting {} literal to `{}` is unnecessary", literal_kind_name, cast_to),
1714 format!("{}_{}", literal_str, cast_to),
1715 Applicability::MachineApplicable,
1719 fn lint_numeric_casts<'tcx>(
1720 cx: &LateContext<'tcx>,
1722 cast_expr: &Expr<'_>,
1723 cast_from: Ty<'tcx>,
1726 match (cast_from.is_integral(), cast_to.is_integral()) {
1728 let from_nbits = int_ty_to_nbits(cast_from, cx.tcx);
1729 let to_nbits = if let ty::Float(FloatTy::F32) = cast_to.kind() {
1734 if is_isize_or_usize(cast_from) || from_nbits >= to_nbits {
1735 span_precision_loss_lint(cx, expr, cast_from, to_nbits == 64);
1737 if from_nbits < to_nbits {
1738 span_lossless_lint(cx, expr, cast_expr, cast_from, cast_to);
1744 CAST_POSSIBLE_TRUNCATION,
1746 &format!("casting `{}` to `{}` may truncate the value", cast_from, cast_to),
1748 if !cast_to.is_signed() {
1754 "casting `{}` to `{}` may lose the sign of the value",
1761 check_loss_of_sign(cx, expr, cast_expr, cast_from, cast_to);
1762 check_truncation_and_wrapping(cx, expr, cast_from, cast_to);
1763 check_lossless(cx, expr, cast_expr, cast_from, cast_to);
1766 if let (&ty::Float(FloatTy::F64), &ty::Float(FloatTy::F32)) = (&cast_from.kind(), &cast_to.kind()) {
1769 CAST_POSSIBLE_TRUNCATION,
1771 "casting `f64` to `f32` may truncate the value",
1774 if let (&ty::Float(FloatTy::F32), &ty::Float(FloatTy::F64)) = (&cast_from.kind(), &cast_to.kind()) {
1775 span_lossless_lint(cx, expr, cast_expr, cast_from, cast_to);
1781 fn lint_cast_ptr_alignment<'tcx>(cx: &LateContext<'tcx>, expr: &Expr<'_>, cast_from: Ty<'tcx>, cast_to: Ty<'tcx>) {
1783 if let ty::RawPtr(from_ptr_ty) = &cast_from.kind();
1784 if let ty::RawPtr(to_ptr_ty) = &cast_to.kind();
1785 if let Ok(from_layout) = cx.layout_of(from_ptr_ty.ty);
1786 if let Ok(to_layout) = cx.layout_of(to_ptr_ty.ty);
1787 if from_layout.align.abi < to_layout.align.abi;
1788 // with c_void, we inherently need to trust the user
1789 if !is_c_void(cx, from_ptr_ty.ty);
1790 // when casting from a ZST, we don't know enough to properly lint
1791 if !from_layout.is_zst();
1798 "casting from `{}` to a more-strictly-aligned pointer (`{}`) ({} < {} bytes)",
1801 from_layout.align.abi.bytes(),
1802 to_layout.align.abi.bytes(),
1809 fn lint_fn_to_numeric_cast(
1810 cx: &LateContext<'_>,
1812 cast_expr: &Expr<'_>,
1816 // We only want to check casts to `ty::Uint` or `ty::Int`
1817 match cast_to.kind() {
1818 ty::Uint(_) | ty::Int(..) => { /* continue on */ },
1821 match cast_from.kind() {
1822 ty::FnDef(..) | ty::FnPtr(_) => {
1823 let mut applicability = Applicability::MaybeIncorrect;
1824 let from_snippet = snippet_with_applicability(cx, cast_expr.span, "x", &mut applicability);
1826 let to_nbits = int_ty_to_nbits(cast_to, cx.tcx);
1827 if to_nbits < cx.tcx.data_layout.pointer_size.bits() {
1830 FN_TO_NUMERIC_CAST_WITH_TRUNCATION,
1833 "casting function pointer `{}` to `{}`, which truncates the value",
1834 from_snippet, cast_to
1837 format!("{} as usize", from_snippet),
1840 } else if *cast_to.kind() != ty::Uint(UintTy::Usize) {
1845 &format!("casting function pointer `{}` to `{}`", from_snippet, cast_to),
1847 format!("{} as usize", from_snippet),
1856 declare_clippy_lint! {
1857 /// **What it does:** Checks for types used in structs, parameters and `let`
1858 /// declarations above a certain complexity threshold.
1860 /// **Why is this bad?** Too complex types make the code less readable. Consider
1861 /// using a `type` definition to simplify them.
1863 /// **Known problems:** None.
1867 /// # use std::rc::Rc;
1869 /// inner: Rc<Vec<Vec<Box<(u32, u32, u32, u32)>>>>,
1872 pub TYPE_COMPLEXITY,
1874 "usage of very complex types that might be better factored into `type` definitions"
1877 pub struct TypeComplexity {
1881 impl TypeComplexity {
1883 pub fn new(threshold: u64) -> Self {
1888 impl_lint_pass!(TypeComplexity => [TYPE_COMPLEXITY]);
1890 impl<'tcx> LateLintPass<'tcx> for TypeComplexity {
1893 cx: &LateContext<'tcx>,
1895 decl: &'tcx FnDecl<'_>,
1900 self.check_fndecl(cx, decl);
1903 fn check_struct_field(&mut self, cx: &LateContext<'tcx>, field: &'tcx hir::StructField<'_>) {
1904 // enum variants are also struct fields now
1905 self.check_type(cx, &field.ty);
1908 fn check_item(&mut self, cx: &LateContext<'tcx>, item: &'tcx Item<'_>) {
1910 ItemKind::Static(ref ty, _, _) | ItemKind::Const(ref ty, _) => self.check_type(cx, ty),
1911 // functions, enums, structs, impls and traits are covered
1916 fn check_trait_item(&mut self, cx: &LateContext<'tcx>, item: &'tcx TraitItem<'_>) {
1918 TraitItemKind::Const(ref ty, _) | TraitItemKind::Type(_, Some(ref ty)) => self.check_type(cx, ty),
1919 TraitItemKind::Fn(FnSig { ref decl, .. }, TraitFn::Required(_)) => self.check_fndecl(cx, decl),
1920 // methods with default impl are covered by check_fn
1925 fn check_impl_item(&mut self, cx: &LateContext<'tcx>, item: &'tcx ImplItem<'_>) {
1927 ImplItemKind::Const(ref ty, _) | ImplItemKind::TyAlias(ref ty) => self.check_type(cx, ty),
1928 // methods are covered by check_fn
1933 fn check_local(&mut self, cx: &LateContext<'tcx>, local: &'tcx Local<'_>) {
1934 if let Some(ref ty) = local.ty {
1935 self.check_type(cx, ty);
1940 impl<'tcx> TypeComplexity {
1941 fn check_fndecl(&self, cx: &LateContext<'tcx>, decl: &'tcx FnDecl<'_>) {
1942 for arg in decl.inputs {
1943 self.check_type(cx, arg);
1945 if let FnRetTy::Return(ref ty) = decl.output {
1946 self.check_type(cx, ty);
1950 fn check_type(&self, cx: &LateContext<'_>, ty: &hir::Ty<'_>) {
1951 if ty.span.from_expansion() {
1955 let mut visitor = TypeComplexityVisitor { score: 0, nest: 1 };
1956 visitor.visit_ty(ty);
1960 if score > self.threshold {
1965 "very complex type used. Consider factoring parts into `type` definitions",
1971 /// Walks a type and assigns a complexity score to it.
1972 struct TypeComplexityVisitor {
1973 /// total complexity score of the type
1975 /// current nesting level
1979 impl<'tcx> Visitor<'tcx> for TypeComplexityVisitor {
1980 type Map = Map<'tcx>;
1982 fn visit_ty(&mut self, ty: &'tcx hir::Ty<'_>) {
1983 let (add_score, sub_nest) = match ty.kind {
1984 // _, &x and *x have only small overhead; don't mess with nesting level
1985 TyKind::Infer | TyKind::Ptr(..) | TyKind::Rptr(..) => (1, 0),
1987 // the "normal" components of a type: named types, arrays/tuples
1988 TyKind::Path(..) | TyKind::Slice(..) | TyKind::Tup(..) | TyKind::Array(..) => (10 * self.nest, 1),
1990 // function types bring a lot of overhead
1991 TyKind::BareFn(ref bare) if bare.abi == Abi::Rust => (50 * self.nest, 1),
1993 TyKind::TraitObject(ref param_bounds, _) => {
1994 let has_lifetime_parameters = param_bounds.iter().any(|bound| {
1996 .bound_generic_params
1998 .any(|gen| matches!(gen.kind, GenericParamKind::Lifetime { .. }))
2000 if has_lifetime_parameters {
2001 // complex trait bounds like A<'a, 'b>
2004 // simple trait bounds like A + B
2011 self.score += add_score;
2012 self.nest += sub_nest;
2014 self.nest -= sub_nest;
2016 fn nested_visit_map(&mut self) -> NestedVisitorMap<Self::Map> {
2017 NestedVisitorMap::None
2021 declare_clippy_lint! {
2022 /// **What it does:** Checks for expressions where a character literal is cast
2023 /// to `u8` and suggests using a byte literal instead.
2025 /// **Why is this bad?** In general, casting values to smaller types is
2026 /// error-prone and should be avoided where possible. In the particular case of
2027 /// converting a character literal to u8, it is easy to avoid by just using a
2028 /// byte literal instead. As an added bonus, `b'a'` is even slightly shorter
2029 /// than `'a' as u8`.
2031 /// **Known problems:** None.
2038 /// A better version, using the byte literal:
2045 "casting a character literal to `u8` truncates"
2048 declare_lint_pass!(CharLitAsU8 => [CHAR_LIT_AS_U8]);
2050 impl<'tcx> LateLintPass<'tcx> for CharLitAsU8 {
2051 fn check_expr(&mut self, cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) {
2053 if !expr.span.from_expansion();
2054 if let ExprKind::Cast(e, _) = &expr.kind;
2055 if let ExprKind::Lit(l) = &e.kind;
2056 if let LitKind::Char(c) = l.node;
2057 if ty::Uint(UintTy::U8) == *cx.typeck_results().expr_ty(expr).kind();
2059 let mut applicability = Applicability::MachineApplicable;
2060 let snippet = snippet_with_applicability(cx, e.span, "'x'", &mut applicability);
2066 "casting a character literal to `u8` truncates",
2068 diag.note("`char` is four bytes wide, but `u8` is a single byte");
2071 diag.span_suggestion(
2073 "use a byte literal instead",
2074 format!("b{}", snippet),
2084 declare_clippy_lint! {
2085 /// **What it does:** Checks for comparisons where one side of the relation is
2086 /// either the minimum or maximum value for its type and warns if it involves a
2087 /// case that is always true or always false. Only integer and boolean types are
2090 /// **Why is this bad?** An expression like `min <= x` may misleadingly imply
2091 /// that it is possible for `x` to be less than the minimum. Expressions like
2092 /// `max < x` are probably mistakes.
2094 /// **Known problems:** For `usize` the size of the current compile target will
2095 /// be assumed (e.g., 64 bits on 64 bit systems). This means code that uses such
2096 /// a comparison to detect target pointer width will trigger this lint. One can
2097 /// use `mem::sizeof` and compare its value or conditional compilation
2099 /// like `#[cfg(target_pointer_width = "64")] ..` instead.
2104 /// let vec: Vec<isize> = Vec::new();
2105 /// if vec.len() <= 0 {}
2106 /// if 100 > i32::MAX {}
2108 pub ABSURD_EXTREME_COMPARISONS,
2110 "a comparison with a maximum or minimum value that is always true or false"
2113 declare_lint_pass!(AbsurdExtremeComparisons => [ABSURD_EXTREME_COMPARISONS]);
2120 struct ExtremeExpr<'a> {
2125 enum AbsurdComparisonResult {
2128 InequalityImpossible,
2131 fn is_cast_between_fixed_and_target<'tcx>(cx: &LateContext<'tcx>, expr: &'tcx Expr<'tcx>) -> bool {
2132 if let ExprKind::Cast(ref cast_exp, _) = expr.kind {
2133 let precast_ty = cx.typeck_results().expr_ty(cast_exp);
2134 let cast_ty = cx.typeck_results().expr_ty(expr);
2136 return is_isize_or_usize(precast_ty) != is_isize_or_usize(cast_ty);
2142 fn detect_absurd_comparison<'tcx>(
2143 cx: &LateContext<'tcx>,
2145 lhs: &'tcx Expr<'_>,
2146 rhs: &'tcx Expr<'_>,
2147 ) -> Option<(ExtremeExpr<'tcx>, AbsurdComparisonResult)> {
2148 use crate::types::AbsurdComparisonResult::{AlwaysFalse, AlwaysTrue, InequalityImpossible};
2149 use crate::types::ExtremeType::{Maximum, Minimum};
2150 use crate::utils::comparisons::{normalize_comparison, Rel};
2152 // absurd comparison only makes sense on primitive types
2153 // primitive types don't implement comparison operators with each other
2154 if cx.typeck_results().expr_ty(lhs) != cx.typeck_results().expr_ty(rhs) {
2158 // comparisons between fix sized types and target sized types are considered unanalyzable
2159 if is_cast_between_fixed_and_target(cx, lhs) || is_cast_between_fixed_and_target(cx, rhs) {
2163 let (rel, normalized_lhs, normalized_rhs) = normalize_comparison(op, lhs, rhs)?;
2165 let lx = detect_extreme_expr(cx, normalized_lhs);
2166 let rx = detect_extreme_expr(cx, normalized_rhs);
2171 (Some(l @ ExtremeExpr { which: Maximum, .. }), _) => (l, AlwaysFalse), // max < x
2172 (_, Some(r @ ExtremeExpr { which: Minimum, .. })) => (r, AlwaysFalse), // x < min
2178 (Some(l @ ExtremeExpr { which: Minimum, .. }), _) => (l, AlwaysTrue), // min <= x
2179 (Some(l @ ExtremeExpr { which: Maximum, .. }), _) => (l, InequalityImpossible), // max <= x
2180 (_, Some(r @ ExtremeExpr { which: Minimum, .. })) => (r, InequalityImpossible), // x <= min
2181 (_, Some(r @ ExtremeExpr { which: Maximum, .. })) => (r, AlwaysTrue), // x <= max
2185 Rel::Ne | Rel::Eq => return None,
2189 fn detect_extreme_expr<'tcx>(cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) -> Option<ExtremeExpr<'tcx>> {
2190 use crate::types::ExtremeType::{Maximum, Minimum};
2192 let ty = cx.typeck_results().expr_ty(expr);
2194 let cv = constant(cx, cx.typeck_results(), expr)?.0;
2196 let which = match (ty.kind(), cv) {
2197 (&ty::Bool, Constant::Bool(false)) | (&ty::Uint(_), Constant::Int(0)) => Minimum,
2198 (&ty::Int(ity), Constant::Int(i)) if i == unsext(cx.tcx, i128::MIN >> (128 - int_bits(cx.tcx, ity)), ity) => {
2202 (&ty::Bool, Constant::Bool(true)) => Maximum,
2203 (&ty::Int(ity), Constant::Int(i)) if i == unsext(cx.tcx, i128::MAX >> (128 - int_bits(cx.tcx, ity)), ity) => {
2206 (&ty::Uint(uty), Constant::Int(i)) if clip(cx.tcx, u128::MAX, uty) == i => Maximum,
2210 Some(ExtremeExpr { which, expr })
2213 impl<'tcx> LateLintPass<'tcx> for AbsurdExtremeComparisons {
2214 fn check_expr(&mut self, cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) {
2215 use crate::types::AbsurdComparisonResult::{AlwaysFalse, AlwaysTrue, InequalityImpossible};
2216 use crate::types::ExtremeType::{Maximum, Minimum};
2218 if let ExprKind::Binary(ref cmp, ref lhs, ref rhs) = expr.kind {
2219 if let Some((culprit, result)) = detect_absurd_comparison(cx, cmp.node, lhs, rhs) {
2220 if !expr.span.from_expansion() {
2221 let msg = "this comparison involving the minimum or maximum element for this \
2222 type contains a case that is always true or always false";
2224 let conclusion = match result {
2225 AlwaysFalse => "this comparison is always false".to_owned(),
2226 AlwaysTrue => "this comparison is always true".to_owned(),
2227 InequalityImpossible => format!(
2228 "the case where the two sides are not equal never occurs, consider using `{} == {}` \
2230 snippet(cx, lhs.span, "lhs"),
2231 snippet(cx, rhs.span, "rhs")
2236 "because `{}` is the {} value for this type, {}",
2237 snippet(cx, culprit.expr.span, "x"),
2238 match culprit.which {
2239 Minimum => "minimum",
2240 Maximum => "maximum",
2245 span_lint_and_help(cx, ABSURD_EXTREME_COMPARISONS, expr.span, msg, None, &help);
2252 declare_clippy_lint! {
2253 /// **What it does:** Checks for comparisons where the relation is always either
2254 /// true or false, but where one side has been upcast so that the comparison is
2255 /// necessary. Only integer types are checked.
2257 /// **Why is this bad?** An expression like `let x : u8 = ...; (x as u32) > 300`
2258 /// will mistakenly imply that it is possible for `x` to be outside the range of
2261 /// **Known problems:**
2262 /// https://github.com/rust-lang/rust-clippy/issues/886
2267 /// (x as u32) > 300;
2269 pub INVALID_UPCAST_COMPARISONS,
2271 "a comparison involving an upcast which is always true or false"
2274 declare_lint_pass!(InvalidUpcastComparisons => [INVALID_UPCAST_COMPARISONS]);
2276 #[derive(Copy, Clone, Debug, Eq)]
2283 #[allow(clippy::cast_sign_loss)]
2285 fn cmp_s_u(s: i128, u: u128) -> Ordering {
2288 } else if u > (i128::MAX as u128) {
2296 impl PartialEq for FullInt {
2298 fn eq(&self, other: &Self) -> bool {
2299 self.partial_cmp(other).expect("`partial_cmp` only returns `Some(_)`") == Ordering::Equal
2303 impl PartialOrd for FullInt {
2305 fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
2306 Some(match (self, other) {
2307 (&Self::S(s), &Self::S(o)) => s.cmp(&o),
2308 (&Self::U(s), &Self::U(o)) => s.cmp(&o),
2309 (&Self::S(s), &Self::U(o)) => Self::cmp_s_u(s, o),
2310 (&Self::U(s), &Self::S(o)) => Self::cmp_s_u(o, s).reverse(),
2315 impl Ord for FullInt {
2317 fn cmp(&self, other: &Self) -> Ordering {
2318 self.partial_cmp(other)
2319 .expect("`partial_cmp` for FullInt can never return `None`")
2323 fn numeric_cast_precast_bounds<'a>(cx: &LateContext<'_>, expr: &'a Expr<'_>) -> Option<(FullInt, FullInt)> {
2324 if let ExprKind::Cast(ref cast_exp, _) = expr.kind {
2325 let pre_cast_ty = cx.typeck_results().expr_ty(cast_exp);
2326 let cast_ty = cx.typeck_results().expr_ty(expr);
2327 // if it's a cast from i32 to u32 wrapping will invalidate all these checks
2328 if cx.layout_of(pre_cast_ty).ok().map(|l| l.size) == cx.layout_of(cast_ty).ok().map(|l| l.size) {
2331 match pre_cast_ty.kind() {
2332 ty::Int(int_ty) => Some(match int_ty {
2333 IntTy::I8 => (FullInt::S(i128::from(i8::MIN)), FullInt::S(i128::from(i8::MAX))),
2334 IntTy::I16 => (FullInt::S(i128::from(i16::MIN)), FullInt::S(i128::from(i16::MAX))),
2335 IntTy::I32 => (FullInt::S(i128::from(i32::MIN)), FullInt::S(i128::from(i32::MAX))),
2336 IntTy::I64 => (FullInt::S(i128::from(i64::MIN)), FullInt::S(i128::from(i64::MAX))),
2337 IntTy::I128 => (FullInt::S(i128::MIN), FullInt::S(i128::MAX)),
2338 IntTy::Isize => (FullInt::S(isize::MIN as i128), FullInt::S(isize::MAX as i128)),
2340 ty::Uint(uint_ty) => Some(match uint_ty {
2341 UintTy::U8 => (FullInt::U(u128::from(u8::MIN)), FullInt::U(u128::from(u8::MAX))),
2342 UintTy::U16 => (FullInt::U(u128::from(u16::MIN)), FullInt::U(u128::from(u16::MAX))),
2343 UintTy::U32 => (FullInt::U(u128::from(u32::MIN)), FullInt::U(u128::from(u32::MAX))),
2344 UintTy::U64 => (FullInt::U(u128::from(u64::MIN)), FullInt::U(u128::from(u64::MAX))),
2345 UintTy::U128 => (FullInt::U(u128::MIN), FullInt::U(u128::MAX)),
2346 UintTy::Usize => (FullInt::U(usize::MIN as u128), FullInt::U(usize::MAX as u128)),
2355 fn node_as_const_fullint<'tcx>(cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) -> Option<FullInt> {
2356 let val = constant(cx, cx.typeck_results(), expr)?.0;
2357 if let Constant::Int(const_int) = val {
2358 match *cx.typeck_results().expr_ty(expr).kind() {
2359 ty::Int(ity) => Some(FullInt::S(sext(cx.tcx, const_int, ity))),
2360 ty::Uint(_) => Some(FullInt::U(const_int)),
2368 fn err_upcast_comparison(cx: &LateContext<'_>, span: Span, expr: &Expr<'_>, always: bool) {
2369 if let ExprKind::Cast(ref cast_val, _) = expr.kind {
2372 INVALID_UPCAST_COMPARISONS,
2375 "because of the numeric bounds on `{}` prior to casting, this expression is always {}",
2376 snippet(cx, cast_val.span, "the expression"),
2377 if always { "true" } else { "false" },
2383 fn upcast_comparison_bounds_err<'tcx>(
2384 cx: &LateContext<'tcx>,
2386 rel: comparisons::Rel,
2387 lhs_bounds: Option<(FullInt, FullInt)>,
2388 lhs: &'tcx Expr<'_>,
2389 rhs: &'tcx Expr<'_>,
2392 use crate::utils::comparisons::Rel;
2394 if let Some((lb, ub)) = lhs_bounds {
2395 if let Some(norm_rhs_val) = node_as_const_fullint(cx, rhs) {
2396 if rel == Rel::Eq || rel == Rel::Ne {
2397 if norm_rhs_val < lb || norm_rhs_val > ub {
2398 err_upcast_comparison(cx, span, lhs, rel == Rel::Ne);
2400 } else if match rel {
2415 Rel::Eq | Rel::Ne => unreachable!(),
2417 err_upcast_comparison(cx, span, lhs, true)
2418 } else if match rel {
2433 Rel::Eq | Rel::Ne => unreachable!(),
2435 err_upcast_comparison(cx, span, lhs, false)
2441 impl<'tcx> LateLintPass<'tcx> for InvalidUpcastComparisons {
2442 fn check_expr(&mut self, cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) {
2443 if let ExprKind::Binary(ref cmp, ref lhs, ref rhs) = expr.kind {
2444 let normalized = comparisons::normalize_comparison(cmp.node, lhs, rhs);
2445 let (rel, normalized_lhs, normalized_rhs) = if let Some(val) = normalized {
2451 let lhs_bounds = numeric_cast_precast_bounds(cx, normalized_lhs);
2452 let rhs_bounds = numeric_cast_precast_bounds(cx, normalized_rhs);
2454 upcast_comparison_bounds_err(cx, expr.span, rel, lhs_bounds, normalized_lhs, normalized_rhs, false);
2455 upcast_comparison_bounds_err(cx, expr.span, rel, rhs_bounds, normalized_rhs, normalized_lhs, true);
2460 declare_clippy_lint! {
2461 /// **What it does:** Checks for public `impl` or `fn` missing generalization
2462 /// over different hashers and implicitly defaulting to the default hashing
2463 /// algorithm (`SipHash`).
2465 /// **Why is this bad?** `HashMap` or `HashSet` with custom hashers cannot be
2468 /// **Known problems:** Suggestions for replacing constructors can contain
2469 /// false-positives. Also applying suggestions can require modification of other
2470 /// pieces of code, possibly including external crates.
2474 /// # use std::collections::HashMap;
2475 /// # use std::hash::{Hash, BuildHasher};
2476 /// # trait Serialize {};
2477 /// impl<K: Hash + Eq, V> Serialize for HashMap<K, V> { }
2479 /// pub fn foo(map: &mut HashMap<i32, i32>) { }
2481 /// could be rewritten as
2483 /// # use std::collections::HashMap;
2484 /// # use std::hash::{Hash, BuildHasher};
2485 /// # trait Serialize {};
2486 /// impl<K: Hash + Eq, V, S: BuildHasher> Serialize for HashMap<K, V, S> { }
2488 /// pub fn foo<S: BuildHasher>(map: &mut HashMap<i32, i32, S>) { }
2490 pub IMPLICIT_HASHER,
2492 "missing generalization over different hashers"
2495 declare_lint_pass!(ImplicitHasher => [IMPLICIT_HASHER]);
2497 impl<'tcx> LateLintPass<'tcx> for ImplicitHasher {
2498 #[allow(clippy::cast_possible_truncation, clippy::too_many_lines)]
2499 fn check_item(&mut self, cx: &LateContext<'tcx>, item: &'tcx Item<'_>) {
2500 use rustc_span::BytePos;
2502 fn suggestion<'tcx>(
2503 cx: &LateContext<'tcx>,
2504 diag: &mut DiagnosticBuilder<'_>,
2505 generics_span: Span,
2506 generics_suggestion_span: Span,
2507 target: &ImplicitHasherType<'_>,
2508 vis: ImplicitHasherConstructorVisitor<'_, '_, '_>,
2510 let generics_snip = snippet(cx, generics_span, "");
2512 let generics_snip = if generics_snip.is_empty() {
2515 &generics_snip[1..generics_snip.len() - 1]
2520 "consider adding a type parameter",
2523 generics_suggestion_span,
2525 "<{}{}S: ::std::hash::BuildHasher{}>",
2527 if generics_snip.is_empty() { "" } else { ", " },
2528 if vis.suggestions.is_empty() {
2531 // request users to add `Default` bound so that generic constructors can be used
2538 format!("{}<{}, S>", target.type_name(), target.type_arguments(),),
2543 if !vis.suggestions.is_empty() {
2544 multispan_sugg(diag, "...and use generic constructor", vis.suggestions);
2548 if !cx.access_levels.is_exported(item.hir_id) {
2559 let mut vis = ImplicitHasherTypeVisitor::new(cx);
2562 for target in &vis.found {
2563 if differing_macro_contexts(item.span, target.span()) {
2567 let generics_suggestion_span = generics.span.substitute_dummy({
2568 let pos = snippet_opt(cx, item.span.until(target.span()))
2569 .and_then(|snip| Some(item.span.lo() + BytePos(snip.find("impl")? as u32 + 4)));
2570 if let Some(pos) = pos {
2571 Span::new(pos, pos, item.span.data().ctxt)
2577 let mut ctr_vis = ImplicitHasherConstructorVisitor::new(cx, target);
2578 for item in items.iter().map(|item| cx.tcx.hir().impl_item(item.id)) {
2579 ctr_vis.visit_impl_item(item);
2587 "impl for `{}` should be generalized over different hashers",
2591 suggestion(cx, diag, generics.span, generics_suggestion_span, target, ctr_vis);
2596 ItemKind::Fn(ref sig, ref generics, body_id) => {
2597 let body = cx.tcx.hir().body(body_id);
2599 for ty in sig.decl.inputs {
2600 let mut vis = ImplicitHasherTypeVisitor::new(cx);
2603 for target in &vis.found {
2604 if in_external_macro(cx.sess(), generics.span) {
2607 let generics_suggestion_span = generics.span.substitute_dummy({
2608 let pos = snippet_opt(cx, item.span.until(body.params[0].pat.span))
2610 let i = snip.find("fn")?;
2611 Some(item.span.lo() + BytePos((i + (&snip[i..]).find('(')?) as u32))
2613 .expect("failed to create span for type parameters");
2614 Span::new(pos, pos, item.span.data().ctxt)
2617 let mut ctr_vis = ImplicitHasherConstructorVisitor::new(cx, target);
2618 ctr_vis.visit_body(body);
2625 "parameter of type `{}` should be generalized over different hashers",
2629 suggestion(cx, diag, generics.span, generics_suggestion_span, target, ctr_vis);
2640 enum ImplicitHasherType<'tcx> {
2641 HashMap(Span, Ty<'tcx>, Cow<'static, str>, Cow<'static, str>),
2642 HashSet(Span, Ty<'tcx>, Cow<'static, str>),
2645 impl<'tcx> ImplicitHasherType<'tcx> {
2646 /// Checks that `ty` is a target type without a `BuildHasher`.
2647 fn new(cx: &LateContext<'tcx>, hir_ty: &hir::Ty<'_>) -> Option<Self> {
2648 if let TyKind::Path(QPath::Resolved(None, ref path)) = hir_ty.kind {
2649 let params: Vec<_> = path
2657 .filter_map(|arg| match arg {
2658 GenericArg::Type(ty) => Some(ty),
2662 let params_len = params.len();
2664 let ty = hir_ty_to_ty(cx.tcx, hir_ty);
2666 if is_type_diagnostic_item(cx, ty, sym!(hashmap_type)) && params_len == 2 {
2667 Some(ImplicitHasherType::HashMap(
2670 snippet(cx, params[0].span, "K"),
2671 snippet(cx, params[1].span, "V"),
2673 } else if is_type_diagnostic_item(cx, ty, sym!(hashset_type)) && params_len == 1 {
2674 Some(ImplicitHasherType::HashSet(
2677 snippet(cx, params[0].span, "T"),
2687 fn type_name(&self) -> &'static str {
2689 ImplicitHasherType::HashMap(..) => "HashMap",
2690 ImplicitHasherType::HashSet(..) => "HashSet",
2694 fn type_arguments(&self) -> String {
2696 ImplicitHasherType::HashMap(.., ref k, ref v) => format!("{}, {}", k, v),
2697 ImplicitHasherType::HashSet(.., ref t) => format!("{}", t),
2701 fn ty(&self) -> Ty<'tcx> {
2703 ImplicitHasherType::HashMap(_, ty, ..) | ImplicitHasherType::HashSet(_, ty, ..) => ty,
2707 fn span(&self) -> Span {
2709 ImplicitHasherType::HashMap(span, ..) | ImplicitHasherType::HashSet(span, ..) => span,
2714 struct ImplicitHasherTypeVisitor<'a, 'tcx> {
2715 cx: &'a LateContext<'tcx>,
2716 found: Vec<ImplicitHasherType<'tcx>>,
2719 impl<'a, 'tcx> ImplicitHasherTypeVisitor<'a, 'tcx> {
2720 fn new(cx: &'a LateContext<'tcx>) -> Self {
2721 Self { cx, found: vec![] }
2725 impl<'a, 'tcx> Visitor<'tcx> for ImplicitHasherTypeVisitor<'a, 'tcx> {
2726 type Map = Map<'tcx>;
2728 fn visit_ty(&mut self, t: &'tcx hir::Ty<'_>) {
2729 if let Some(target) = ImplicitHasherType::new(self.cx, t) {
2730 self.found.push(target);
2736 fn nested_visit_map(&mut self) -> NestedVisitorMap<Self::Map> {
2737 NestedVisitorMap::None
2741 /// Looks for default-hasher-dependent constructors like `HashMap::new`.
2742 struct ImplicitHasherConstructorVisitor<'a, 'b, 'tcx> {
2743 cx: &'a LateContext<'tcx>,
2744 maybe_typeck_results: Option<&'tcx TypeckResults<'tcx>>,
2745 target: &'b ImplicitHasherType<'tcx>,
2746 suggestions: BTreeMap<Span, String>,
2749 impl<'a, 'b, 'tcx> ImplicitHasherConstructorVisitor<'a, 'b, 'tcx> {
2750 fn new(cx: &'a LateContext<'tcx>, target: &'b ImplicitHasherType<'tcx>) -> Self {
2753 maybe_typeck_results: cx.maybe_typeck_results(),
2755 suggestions: BTreeMap::new(),
2760 impl<'a, 'b, 'tcx> Visitor<'tcx> for ImplicitHasherConstructorVisitor<'a, 'b, 'tcx> {
2761 type Map = Map<'tcx>;
2763 fn visit_body(&mut self, body: &'tcx Body<'_>) {
2764 let old_maybe_typeck_results = self.maybe_typeck_results.replace(self.cx.tcx.typeck_body(body.id()));
2765 walk_body(self, body);
2766 self.maybe_typeck_results = old_maybe_typeck_results;
2769 fn visit_expr(&mut self, e: &'tcx Expr<'_>) {
2771 if let ExprKind::Call(ref fun, ref args) = e.kind;
2772 if let ExprKind::Path(QPath::TypeRelative(ref ty, ref method)) = fun.kind;
2773 if let TyKind::Path(QPath::Resolved(None, ty_path)) = ty.kind;
2775 if !TyS::same_type(self.target.ty(), self.maybe_typeck_results.unwrap().expr_ty(e)) {
2779 if match_path(ty_path, &paths::HASHMAP) {
2780 if method.ident.name == sym::new {
2782 .insert(e.span, "HashMap::default()".to_string());
2783 } else if method.ident.name == sym!(with_capacity) {
2784 self.suggestions.insert(
2787 "HashMap::with_capacity_and_hasher({}, Default::default())",
2788 snippet(self.cx, args[0].span, "capacity"),
2792 } else if match_path(ty_path, &paths::HASHSET) {
2793 if method.ident.name == sym::new {
2795 .insert(e.span, "HashSet::default()".to_string());
2796 } else if method.ident.name == sym!(with_capacity) {
2797 self.suggestions.insert(
2800 "HashSet::with_capacity_and_hasher({}, Default::default())",
2801 snippet(self.cx, args[0].span, "capacity"),
2812 fn nested_visit_map(&mut self) -> NestedVisitorMap<Self::Map> {
2813 NestedVisitorMap::OnlyBodies(self.cx.tcx.hir())
2817 declare_clippy_lint! {
2818 /// **What it does:** Checks for casts of `&T` to `&mut T` anywhere in the code.
2820 /// **Why is this bad?** It’s basically guaranteed to be undefined behaviour.
2821 /// `UnsafeCell` is the only way to obtain aliasable data that is considered
2824 /// **Known problems:** None.
2830 /// *(r as *const _ as *mut _) += 1;
2835 /// Instead consider using interior mutability types.
2838 /// use std::cell::UnsafeCell;
2840 /// fn x(r: &UnsafeCell<i32>) {
2846 pub CAST_REF_TO_MUT,
2848 "a cast of reference to a mutable pointer"
2851 declare_lint_pass!(RefToMut => [CAST_REF_TO_MUT]);
2853 impl<'tcx> LateLintPass<'tcx> for RefToMut {
2854 fn check_expr(&mut self, cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) {
2856 if let ExprKind::Unary(UnOp::UnDeref, e) = &expr.kind;
2857 if let ExprKind::Cast(e, t) = &e.kind;
2858 if let TyKind::Ptr(MutTy { mutbl: Mutability::Mut, .. }) = t.kind;
2859 if let ExprKind::Cast(e, t) = &e.kind;
2860 if let TyKind::Ptr(MutTy { mutbl: Mutability::Not, .. }) = t.kind;
2861 if let ty::Ref(..) = cx.typeck_results().node_type(e.hir_id).kind();
2867 "casting `&T` to `&mut T` may cause undefined behavior, consider instead using an `UnsafeCell`",