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::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, GenericParamKind, HirId, ImplItem,
14 ImplItemKind, Item, ItemKind, Lifetime, Local, MatchSource, MutTy, Mutability, QPath, Stmt, StmtKind, TraitFn,
15 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::{self, InferTy, Ty, TyCtxt, TyS, TypeckTables};
21 use rustc_session::{declare_lint_pass, declare_tool_lint, impl_lint_pass};
22 use rustc_span::hygiene::{ExpnKind, MacroKind};
23 use rustc_span::source_map::Span;
24 use rustc_span::symbol::sym;
25 use rustc_target::abi::LayoutOf;
26 use rustc_target::spec::abi::Abi;
27 use rustc_typeck::hir_ty_to_ty;
29 use crate::consts::{constant, Constant};
30 use crate::utils::paths;
32 clip, comparisons, differing_macro_contexts, higher, in_constant, indent_of, int_bits, is_type_diagnostic_item,
33 last_path_segment, match_def_path, match_path, method_chain_args, multispan_sugg, numeric_literal::NumericLiteral,
34 qpath_res, sext, snippet, snippet_block_with_applicability, snippet_opt, snippet_with_applicability,
35 snippet_with_macro_callsite, span_lint, span_lint_and_help, span_lint_and_sugg, span_lint_and_then, unsext,
38 declare_clippy_lint! {
39 /// **What it does:** Checks for use of `Box<Vec<_>>` anywhere in the code.
41 /// **Why is this bad?** `Vec` already keeps its contents in a separate area on
42 /// the heap. So if you `Box` it, you just add another level of indirection
43 /// without any benefit whatsoever.
45 /// **Known problems:** None.
50 /// values: Box<Vec<Foo>>,
63 "usage of `Box<Vec<T>>`, vector elements are already on the heap"
66 declare_clippy_lint! {
67 /// **What it does:** Checks for use of `Vec<Box<T>>` where T: Sized anywhere in the code.
69 /// **Why is this bad?** `Vec` already keeps its contents in a separate area on
70 /// the heap. So if you `Box` its contents, you just add another level of indirection.
72 /// **Known problems:** Vec<Box<T: Sized>> makes sense if T is a large type (see #3530,
78 /// values: Vec<Box<i32>>,
91 "usage of `Vec<Box<T>>` where T: Sized, vector elements are already on the heap"
94 declare_clippy_lint! {
95 /// **What it does:** Checks for use of `Option<Option<_>>` in function signatures and type
98 /// **Why is this bad?** `Option<_>` represents an optional value. `Option<Option<_>>`
99 /// represents an optional optional value which is logically the same thing as an optional
100 /// value but has an unneeded extra level of wrapping.
102 /// If you have a case where `Some(Some(_))`, `Some(None)` and `None` are distinct cases,
103 /// consider a custom `enum` instead, with clear names for each case.
105 /// **Known problems:** None.
109 /// fn get_data() -> Option<Option<u32>> {
117 /// pub enum Contents {
118 /// Data(Vec<u8>), // Was Some(Some(Vec<u8>))
119 /// NotYetFetched, // Was Some(None)
120 /// None, // Was None
123 /// fn get_data() -> Contents {
129 "usage of `Option<Option<T>>`"
132 declare_clippy_lint! {
133 /// **What it does:** Checks for usage of any `LinkedList`, suggesting to use a
134 /// `Vec` or a `VecDeque` (formerly called `RingBuf`).
136 /// **Why is this bad?** Gankro says:
138 /// > The TL;DR of `LinkedList` is that it's built on a massive amount of
139 /// pointers and indirection.
140 /// > It wastes memory, it has terrible cache locality, and is all-around slow.
142 /// > "only" amortized for push/pop, should be faster in the general case for
143 /// almost every possible
144 /// > workload, and isn't even amortized at all if you can predict the capacity
147 /// > `LinkedList`s are only really good if you're doing a lot of merging or
148 /// splitting of lists.
149 /// > This is because they can just mangle some pointers instead of actually
150 /// copying the data. Even
151 /// > if you're doing a lot of insertion in the middle of the list, `RingBuf`
152 /// can still be better
153 /// > because of how expensive it is to seek to the middle of a `LinkedList`.
155 /// **Known problems:** False positives – the instances where using a
156 /// `LinkedList` makes sense are few and far between, but they can still happen.
160 /// # use std::collections::LinkedList;
161 /// let x: LinkedList<usize> = LinkedList::new();
165 "usage of LinkedList, usually a vector is faster, or a more specialized data structure like a `VecDeque`"
168 declare_clippy_lint! {
169 /// **What it does:** Checks for use of `&Box<T>` anywhere in the code.
171 /// **Why is this bad?** Any `&Box<T>` can also be a `&T`, which is more
174 /// **Known problems:** None.
178 /// fn foo(bar: &Box<T>) { ... }
184 /// fn foo(bar: &T) { ... }
188 "a borrow of a boxed type"
191 declare_clippy_lint! {
192 /// **What it does:** Checks for use of redundant allocations anywhere in the code.
194 /// **Why is this bad?** Expressions such as `Rc<&T>`, `Rc<Rc<T>>`, `Rc<Box<T>>`, `Box<&T>`
195 /// add an unnecessary level of indirection.
197 /// **Known problems:** None.
201 /// # use std::rc::Rc;
202 /// fn foo(bar: Rc<&usize>) {}
208 /// fn foo(bar: &usize) {}
210 pub REDUNDANT_ALLOCATION,
212 "redundant allocation"
216 vec_box_size_threshold: u64,
219 impl_lint_pass!(Types => [BOX_VEC, VEC_BOX, OPTION_OPTION, LINKEDLIST, BORROWED_BOX, REDUNDANT_ALLOCATION]);
221 impl<'tcx> LateLintPass<'tcx> for Types {
222 fn check_fn(&mut self, cx: &LateContext<'_>, _: FnKind<'_>, decl: &FnDecl<'_>, _: &Body<'_>, _: Span, id: HirId) {
223 // Skip trait implementations; see issue #605.
224 if let Some(hir::Node::Item(item)) = cx.tcx.hir().find(cx.tcx.hir().get_parent_item(id)) {
225 if let ItemKind::Impl { of_trait: Some(_), .. } = item.kind {
230 self.check_fn_decl(cx, decl);
233 fn check_struct_field(&mut self, cx: &LateContext<'_>, field: &hir::StructField<'_>) {
234 self.check_ty(cx, &field.ty, false);
237 fn check_trait_item(&mut self, cx: &LateContext<'_>, item: &TraitItem<'_>) {
239 TraitItemKind::Const(ref ty, _) | TraitItemKind::Type(_, Some(ref ty)) => self.check_ty(cx, ty, false),
240 TraitItemKind::Fn(ref sig, _) => self.check_fn_decl(cx, &sig.decl),
245 fn check_local(&mut self, cx: &LateContext<'_>, local: &Local<'_>) {
246 if let Some(ref ty) = local.ty {
247 self.check_ty(cx, ty, true);
252 /// Checks if `qpath` has last segment with type parameter matching `path`
253 fn match_type_parameter(cx: &LateContext<'_>, qpath: &QPath<'_>, path: &[&str]) -> Option<Span> {
254 let last = last_path_segment(qpath);
256 if let Some(ref params) = last.args;
257 if !params.parenthesized;
258 if let Some(ty) = params.args.iter().find_map(|arg| match arg {
259 GenericArg::Type(ty) => Some(ty),
262 if let TyKind::Path(ref qpath) = ty.kind;
263 if let Some(did) = qpath_res(cx, qpath, ty.hir_id).opt_def_id();
264 if match_def_path(cx, did, path);
266 return Some(ty.span);
272 fn match_borrows_parameter(_cx: &LateContext<'_>, qpath: &QPath<'_>) -> Option<Span> {
273 let last = last_path_segment(qpath);
275 if let Some(ref params) = last.args;
276 if !params.parenthesized;
277 if let Some(ty) = params.args.iter().find_map(|arg| match arg {
278 GenericArg::Type(ty) => Some(ty),
281 if let TyKind::Rptr(..) = ty.kind;
283 return Some(ty.span);
290 pub fn new(vec_box_size_threshold: u64) -> Self {
291 Self { vec_box_size_threshold }
294 fn check_fn_decl(&mut self, cx: &LateContext<'_>, decl: &FnDecl<'_>) {
295 for input in decl.inputs {
296 self.check_ty(cx, input, false);
299 if let FnRetTy::Return(ref ty) = decl.output {
300 self.check_ty(cx, ty, false);
304 /// Recursively check for `TypePass` lints in the given type. Stop at the first
307 /// The parameter `is_local` distinguishes the context of the type; types from
308 /// local bindings should only be checked for the `BORROWED_BOX` lint.
309 #[allow(clippy::too_many_lines)]
310 fn check_ty(&mut self, cx: &LateContext<'_>, hir_ty: &hir::Ty<'_>, is_local: bool) {
311 if hir_ty.span.from_expansion() {
315 TyKind::Path(ref qpath) if !is_local => {
316 let hir_id = hir_ty.hir_id;
317 let res = qpath_res(cx, qpath, hir_id);
318 if let Some(def_id) = res.opt_def_id() {
319 if Some(def_id) == cx.tcx.lang_items().owned_box() {
320 if let Some(span) = match_borrows_parameter(cx, qpath) {
323 REDUNDANT_ALLOCATION,
325 "usage of `Box<&T>`",
327 snippet(cx, span, "..").to_string(),
328 Applicability::MachineApplicable,
330 return; // don't recurse into the type
332 if match_type_parameter(cx, qpath, &paths::VEC).is_some() {
337 "you seem to be trying to use `Box<Vec<T>>`. Consider using just `Vec<T>`",
339 "`Vec<T>` is already on the heap, `Box<Vec<T>>` makes an extra allocation.",
341 return; // don't recurse into the type
343 } else if cx.tcx.is_diagnostic_item(sym::Rc, def_id) {
344 if let Some(span) = match_type_parameter(cx, qpath, &paths::RC) {
347 REDUNDANT_ALLOCATION,
349 "usage of `Rc<Rc<T>>`",
351 snippet(cx, span, "..").to_string(),
352 Applicability::MachineApplicable,
354 return; // don't recurse into the type
356 if let Some(span) = match_type_parameter(cx, qpath, &paths::BOX) {
359 REDUNDANT_ALLOCATION,
361 "usage of `Rc<Box<T>>`",
363 snippet(cx, span, "..").to_string(),
364 Applicability::MachineApplicable,
366 return; // don't recurse into the type
368 if let Some(span) = match_borrows_parameter(cx, qpath) {
371 REDUNDANT_ALLOCATION,
375 snippet(cx, span, "..").to_string(),
376 Applicability::MachineApplicable,
378 return; // don't recurse into the type
380 } else if cx.tcx.is_diagnostic_item(sym!(vec_type), def_id) {
382 // Get the _ part of Vec<_>
383 if let Some(ref last) = last_path_segment(qpath).args;
384 if let Some(ty) = last.args.iter().find_map(|arg| match arg {
385 GenericArg::Type(ty) => Some(ty),
388 // ty is now _ at this point
389 if let TyKind::Path(ref ty_qpath) = ty.kind;
390 let res = qpath_res(cx, ty_qpath, ty.hir_id);
391 if let Some(def_id) = res.opt_def_id();
392 if Some(def_id) == cx.tcx.lang_items().owned_box();
393 // At this point, we know ty is Box<T>, now get T
394 if let Some(ref last) = last_path_segment(ty_qpath).args;
395 if let Some(boxed_ty) = last.args.iter().find_map(|arg| match arg {
396 GenericArg::Type(ty) => Some(ty),
399 let ty_ty = hir_ty_to_ty(cx.tcx, boxed_ty);
400 if ty_ty.is_sized(cx.tcx.at(ty.span), cx.param_env);
401 if let Ok(ty_ty_size) = cx.layout_of(ty_ty).map(|l| l.size.bytes());
402 if ty_ty_size <= self.vec_box_size_threshold;
408 "`Vec<T>` is already on the heap, the boxing is unnecessary.",
410 format!("Vec<{}>", ty_ty),
411 Applicability::MachineApplicable,
413 return; // don't recurse into the type
416 } else if cx.tcx.is_diagnostic_item(sym!(option_type), def_id) {
417 if match_type_parameter(cx, qpath, &paths::OPTION).is_some() {
422 "consider using `Option<T>` instead of `Option<Option<T>>` or a custom \
423 enum if you need to distinguish all 3 cases",
425 return; // don't recurse into the type
427 } else if match_def_path(cx, def_id, &paths::LINKED_LIST) {
432 "I see you're using a LinkedList! Perhaps you meant some other data structure?",
434 "a `VecDeque` might work",
436 return; // don't recurse into the type
440 QPath::Resolved(Some(ref ty), ref p) => {
441 self.check_ty(cx, ty, is_local);
442 for ty in p.segments.iter().flat_map(|seg| {
445 .map_or_else(|| [].iter(), |params| params.args.iter())
446 .filter_map(|arg| match arg {
447 GenericArg::Type(ty) => Some(ty),
451 self.check_ty(cx, ty, is_local);
454 QPath::Resolved(None, ref p) => {
455 for ty in p.segments.iter().flat_map(|seg| {
458 .map_or_else(|| [].iter(), |params| params.args.iter())
459 .filter_map(|arg| match arg {
460 GenericArg::Type(ty) => Some(ty),
464 self.check_ty(cx, ty, is_local);
467 QPath::TypeRelative(ref ty, ref seg) => {
468 self.check_ty(cx, ty, is_local);
469 if let Some(ref params) = seg.args {
470 for ty in params.args.iter().filter_map(|arg| match arg {
471 GenericArg::Type(ty) => Some(ty),
474 self.check_ty(cx, ty, is_local);
480 TyKind::Rptr(ref lt, ref mut_ty) => self.check_ty_rptr(cx, hir_ty, is_local, lt, mut_ty),
482 TyKind::Slice(ref ty) | TyKind::Array(ref ty, _) | TyKind::Ptr(MutTy { ref ty, .. }) => {
483 self.check_ty(cx, ty, is_local)
485 TyKind::Tup(tys) => {
487 self.check_ty(cx, ty, is_local);
496 cx: &LateContext<'_>,
497 hir_ty: &hir::Ty<'_>,
502 match mut_ty.ty.kind {
503 TyKind::Path(ref qpath) => {
504 let hir_id = mut_ty.ty.hir_id;
505 let def = qpath_res(cx, qpath, hir_id);
507 if let Some(def_id) = def.opt_def_id();
508 if Some(def_id) == cx.tcx.lang_items().owned_box();
509 if let QPath::Resolved(None, ref path) = *qpath;
510 if let [ref bx] = *path.segments;
511 if let Some(ref params) = bx.args;
512 if !params.parenthesized;
513 if let Some(inner) = params.args.iter().find_map(|arg| match arg {
514 GenericArg::Type(ty) => Some(ty),
518 if is_any_trait(inner) {
519 // Ignore `Box<Any>` types; see issue #1884 for details.
523 let ltopt = if lt.is_elided() {
526 format!("{} ", lt.name.ident().as_str())
529 if mut_ty.mutbl == Mutability::Mut {
530 // Ignore `&mut Box<T>` types; see issue #2907 for
534 let mut applicability = Applicability::MachineApplicable;
539 "you seem to be trying to use `&Box<T>`. Consider using just `&T`",
544 &snippet_with_applicability(cx, inner.span, "..", &mut applicability)
546 Applicability::Unspecified,
548 return; // don't recurse into the type
551 self.check_ty(cx, &mut_ty.ty, is_local);
553 _ => self.check_ty(cx, &mut_ty.ty, is_local),
558 // Returns true if given type is `Any` trait.
559 fn is_any_trait(t: &hir::Ty<'_>) -> bool {
561 if let TyKind::TraitObject(ref traits, _) = t.kind;
562 if !traits.is_empty();
563 // Only Send/Sync can be used as additional traits, so it is enough to
564 // check only the first trait.
565 if match_path(&traits[0].trait_ref.path, &paths::ANY_TRAIT);
574 declare_clippy_lint! {
575 /// **What it does:** Checks for binding a unit value.
577 /// **Why is this bad?** A unit value cannot usefully be used anywhere. So
578 /// binding one is kind of pointless.
580 /// **Known problems:** None.
590 "creating a `let` binding to a value of unit type, which usually can't be used afterwards"
593 declare_lint_pass!(LetUnitValue => [LET_UNIT_VALUE]);
595 impl<'tcx> LateLintPass<'tcx> for LetUnitValue {
596 fn check_stmt(&mut self, cx: &LateContext<'tcx>, stmt: &'tcx Stmt<'_>) {
597 if let StmtKind::Local(ref local) = stmt.kind {
598 if is_unit(cx.tables().pat_ty(&local.pat)) {
599 if in_external_macro(cx.sess(), stmt.span) || local.pat.span.from_expansion() {
602 if higher::is_from_for_desugar(local) {
609 "this let-binding has unit value",
611 if let Some(expr) = &local.init {
612 let snip = snippet_with_macro_callsite(cx, expr.span, "()");
613 diag.span_suggestion(
615 "omit the `let` binding",
616 format!("{};", snip),
617 Applicability::MachineApplicable, // snippet
627 declare_clippy_lint! {
628 /// **What it does:** Checks for comparisons to unit. This includes all binary
629 /// comparisons (like `==` and `<`) and asserts.
631 /// **Why is this bad?** Unit is always equal to itself, and thus is just a
632 /// clumsily written constant. Mostly this happens when someone accidentally
633 /// adds semicolons at the end of the operands.
635 /// **Known problems:** None.
666 /// assert_eq!({ foo(); }, { bar(); });
668 /// will always succeed
671 "comparing unit values"
674 declare_lint_pass!(UnitCmp => [UNIT_CMP]);
676 impl<'tcx> LateLintPass<'tcx> for UnitCmp {
677 fn check_expr(&mut self, cx: &LateContext<'tcx>, expr: &'tcx Expr<'tcx>) {
678 if expr.span.from_expansion() {
679 if let Some(callee) = expr.span.source_callee() {
680 if let ExpnKind::Macro(MacroKind::Bang, symbol) = callee.kind {
681 if let ExprKind::Binary(ref cmp, ref left, _) = expr.kind {
683 if op.is_comparison() && is_unit(cx.tables().expr_ty(left)) {
684 let result = match &*symbol.as_str() {
685 "assert_eq" | "debug_assert_eq" => "succeed",
686 "assert_ne" | "debug_assert_ne" => "fail",
694 "`{}` of unit values detected. This will always {}",
705 if let ExprKind::Binary(ref cmp, ref left, _) = expr.kind {
707 if op.is_comparison() && is_unit(cx.tables().expr_ty(left)) {
708 let result = match op {
709 BinOpKind::Eq | BinOpKind::Le | BinOpKind::Ge => "true",
717 "{}-comparison of unit values detected. This will always be {}",
727 declare_clippy_lint! {
728 /// **What it does:** Checks for passing a unit value as an argument to a function without using a
729 /// unit literal (`()`).
731 /// **Why is this bad?** This is likely the result of an accidental semicolon.
733 /// **Known problems:** None.
744 "passing unit to a function"
747 declare_lint_pass!(UnitArg => [UNIT_ARG]);
749 impl<'tcx> LateLintPass<'tcx> for UnitArg {
750 fn check_expr(&mut self, cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) {
751 if expr.span.from_expansion() {
755 // apparently stuff in the desugaring of `?` can trigger this
756 // so check for that here
757 // only the calls to `Try::from_error` is marked as desugared,
758 // so we need to check both the current Expr and its parent.
759 if is_questionmark_desugar_marked_call(expr) {
763 let map = &cx.tcx.hir();
764 let opt_parent_node = map.find(map.get_parent_node(expr.hir_id));
765 if let Some(hir::Node::Expr(parent_expr)) = opt_parent_node;
766 if is_questionmark_desugar_marked_call(parent_expr);
773 ExprKind::Call(_, args) | ExprKind::MethodCall(_, _, args, _) => {
774 let args_to_recover = args
777 if is_unit(cx.tables().expr_ty(arg)) && !is_unit_literal(arg) {
778 if let ExprKind::Match(.., MatchSource::TryDesugar) = &arg.kind {
787 .collect::<Vec<_>>();
788 if !args_to_recover.is_empty() {
789 lint_unit_args(cx, expr, &args_to_recover);
797 fn lint_unit_args(cx: &LateContext<'_>, expr: &Expr<'_>, args_to_recover: &[&Expr<'_>]) {
798 let mut applicability = Applicability::MachineApplicable;
799 let (singular, plural) = if args_to_recover.len() > 1 {
808 &format!("passing {}unit value{} to a function", singular, plural),
815 if let ExprKind::Block(block, _) = arg.kind;
816 if block.expr.is_none();
817 if let Some(last_stmt) = block.stmts.iter().last();
818 if let StmtKind::Semi(last_expr) = last_stmt.kind;
819 if let Some(snip) = snippet_opt(cx, last_expr.span);
831 .for_each(|(span, sugg)| {
834 "remove the semicolon from the last statement in the block",
836 Applicability::MaybeIncorrect,
840 let sugg = args_to_recover
842 .filter(|arg| !is_empty_block(arg))
845 let indent = if i == 0 {
848 indent_of(cx, expr.span).unwrap_or(0)
853 snippet_block_with_applicability(cx, arg.span, "..", Some(expr.span), &mut applicability)
856 .collect::<Vec<String>>();
858 if !sugg.is_empty() {
859 let plural = if sugg.len() > 1 { "s" } else { "" };
861 expr.span.with_hi(expr.span.lo()),
862 &format!("{}move the expression{} in front of the call...", or, plural),
863 format!("{}\n", sugg.join("\n")),
868 db.multipart_suggestion(
869 &format!("{}use {}unit literal{} instead", and, singular, plural),
872 .map(|arg| (arg.span, "()".to_string()))
873 .collect::<Vec<_>>(),
880 fn is_empty_block(expr: &Expr<'_>) -> bool {
885 stmts: &[], expr: None, ..
892 fn is_questionmark_desugar_marked_call(expr: &Expr<'_>) -> bool {
893 use rustc_span::hygiene::DesugaringKind;
894 if let ExprKind::Call(ref callee, _) = expr.kind {
895 callee.span.is_desugaring(DesugaringKind::QuestionMark)
901 fn is_unit(ty: Ty<'_>) -> bool {
903 ty::Tuple(slice) if slice.is_empty() => true,
908 fn is_unit_literal(expr: &Expr<'_>) -> bool {
910 ExprKind::Tup(ref slice) if slice.is_empty() => true,
915 declare_clippy_lint! {
916 /// **What it does:** Checks for casts from any numerical to a float type where
917 /// the receiving type cannot store all values from the original type without
918 /// rounding errors. This possible rounding is to be expected, so this lint is
919 /// `Allow` by default.
921 /// Basically, this warns on casting any integer with 32 or more bits to `f32`
922 /// or any 64-bit integer to `f64`.
924 /// **Why is this bad?** It's not bad at all. But in some applications it can be
925 /// helpful to know where precision loss can take place. This lint can help find
926 /// those places in the code.
928 /// **Known problems:** None.
932 /// let x = u64::MAX;
935 pub CAST_PRECISION_LOSS,
937 "casts that cause loss of precision, e.g., `x as f32` where `x: u64`"
940 declare_clippy_lint! {
941 /// **What it does:** Checks for casts from a signed to an unsigned numerical
942 /// type. In this case, negative values wrap around to large positive values,
943 /// which can be quite surprising in practice. However, as the cast works as
944 /// defined, this lint is `Allow` by default.
946 /// **Why is this bad?** Possibly surprising results. You can activate this lint
947 /// as a one-time check to see where numerical wrapping can arise.
949 /// **Known problems:** None.
954 /// y as u128; // will return 18446744073709551615
958 "casts from signed types to unsigned types, e.g., `x as u32` where `x: i32`"
961 declare_clippy_lint! {
962 /// **What it does:** Checks for casts between numerical types that may
963 /// truncate large values. This is expected behavior, so the cast is `Allow` by
966 /// **Why is this bad?** In some problem domains, it is good practice to avoid
967 /// truncation. This lint can be activated to help assess where additional
968 /// checks could be beneficial.
970 /// **Known problems:** None.
974 /// fn as_u8(x: u64) -> u8 {
978 pub CAST_POSSIBLE_TRUNCATION,
980 "casts that may cause truncation of the value, e.g., `x as u8` where `x: u32`, or `x as i32` where `x: f32`"
983 declare_clippy_lint! {
984 /// **What it does:** Checks for casts from an unsigned type to a signed type of
985 /// the same size. Performing such a cast is a 'no-op' for the compiler,
986 /// i.e., nothing is changed at the bit level, and the binary representation of
987 /// the value is reinterpreted. This can cause wrapping if the value is too big
988 /// for the target signed type. However, the cast works as defined, so this lint
989 /// is `Allow` by default.
991 /// **Why is this bad?** While such a cast is not bad in itself, the results can
992 /// be surprising when this is not the intended behavior, as demonstrated by the
995 /// **Known problems:** None.
999 /// u32::MAX as i32; // will yield a value of `-1`
1001 pub CAST_POSSIBLE_WRAP,
1003 "casts that may cause wrapping around the value, e.g., `x as i32` where `x: u32` and `x > i32::MAX`"
1006 declare_clippy_lint! {
1007 /// **What it does:** Checks for casts between numerical types that may
1008 /// be replaced by safe conversion functions.
1010 /// **Why is this bad?** Rust's `as` keyword will perform many kinds of
1011 /// conversions, including silently lossy conversions. Conversion functions such
1012 /// as `i32::from` will only perform lossless conversions. Using the conversion
1013 /// functions prevents conversions from turning into silent lossy conversions if
1014 /// the types of the input expressions ever change, and make it easier for
1015 /// people reading the code to know that the conversion is lossless.
1017 /// **Known problems:** None.
1021 /// fn as_u64(x: u8) -> u64 {
1026 /// Using `::from` would look like this:
1029 /// fn as_u64(x: u8) -> u64 {
1035 "casts using `as` that are known to be lossless, e.g., `x as u64` where `x: u8`"
1038 declare_clippy_lint! {
1039 /// **What it does:** Checks for casts to the same type.
1041 /// **Why is this bad?** It's just unnecessary.
1043 /// **Known problems:** None.
1047 /// let _ = 2i32 as i32;
1049 pub UNNECESSARY_CAST,
1051 "cast to the same type, e.g., `x as i32` where `x: i32`"
1054 declare_clippy_lint! {
1055 /// **What it does:** Checks for casts from a less-strictly-aligned pointer to a
1056 /// more-strictly-aligned pointer
1058 /// **Why is this bad?** Dereferencing the resulting pointer may be undefined
1061 /// **Known problems:** Using `std::ptr::read_unaligned` and `std::ptr::write_unaligned` or similar
1062 /// on the resulting pointer is fine. Is over-zealous: Casts with manual alignment checks or casts like
1063 /// u64-> u8 -> u16 can be fine. Miri is able to do a more in-depth analysis.
1067 /// let _ = (&1u8 as *const u8) as *const u16;
1068 /// let _ = (&mut 1u8 as *mut u8) as *mut u16;
1070 pub CAST_PTR_ALIGNMENT,
1072 "cast from a pointer to a more-strictly-aligned pointer"
1075 declare_clippy_lint! {
1076 /// **What it does:** Checks for casts of function pointers to something other than usize
1078 /// **Why is this bad?**
1079 /// Casting a function pointer to anything other than usize/isize is not portable across
1080 /// architectures, because you end up losing bits if the target type is too small or end up with a
1081 /// bunch of extra bits that waste space and add more instructions to the final binary than
1082 /// strictly necessary for the problem
1084 /// Casting to isize also doesn't make sense since there are no signed addresses.
1090 /// fn fun() -> i32 { 1 }
1091 /// let a = fun as i64;
1094 /// fn fun2() -> i32 { 1 }
1095 /// let a = fun2 as usize;
1097 pub FN_TO_NUMERIC_CAST,
1099 "casting a function pointer to a numeric type other than usize"
1102 declare_clippy_lint! {
1103 /// **What it does:** Checks for casts of a function pointer to a numeric type not wide enough to
1106 /// **Why is this bad?**
1107 /// Such a cast discards some bits of the function's address. If this is intended, it would be more
1108 /// clearly expressed by casting to usize first, then casting the usize to the intended type (with
1109 /// a comment) to perform the truncation.
1115 /// fn fn1() -> i16 {
1118 /// let _ = fn1 as i32;
1120 /// // Better: Cast to usize first, then comment with the reason for the truncation
1121 /// fn fn2() -> i16 {
1124 /// let fn_ptr = fn2 as usize;
1125 /// let fn_ptr_truncated = fn_ptr as i32;
1127 pub FN_TO_NUMERIC_CAST_WITH_TRUNCATION,
1129 "casting a function pointer to a numeric type not wide enough to store the address"
1132 /// Returns the size in bits of an integral type.
1133 /// Will return 0 if the type is not an int or uint variant
1134 fn int_ty_to_nbits(typ: Ty<'_>, tcx: TyCtxt<'_>) -> u64 {
1136 ty::Int(i) => match i {
1137 IntTy::Isize => tcx.data_layout.pointer_size.bits(),
1144 ty::Uint(i) => match i {
1145 UintTy::Usize => tcx.data_layout.pointer_size.bits(),
1150 UintTy::U128 => 128,
1156 fn is_isize_or_usize(typ: Ty<'_>) -> bool {
1158 ty::Int(IntTy::Isize) | ty::Uint(UintTy::Usize) => true,
1163 fn span_precision_loss_lint(cx: &LateContext<'_>, expr: &Expr<'_>, cast_from: Ty<'_>, cast_to_f64: bool) {
1164 let mantissa_nbits = if cast_to_f64 { 52 } else { 23 };
1165 let arch_dependent = is_isize_or_usize(cast_from) && cast_to_f64;
1166 let arch_dependent_str = "on targets with 64-bit wide pointers ";
1167 let from_nbits_str = if arch_dependent {
1169 } else if is_isize_or_usize(cast_from) {
1170 "32 or 64".to_owned()
1172 int_ty_to_nbits(cast_from, cx.tcx).to_string()
1176 CAST_PRECISION_LOSS,
1179 "casting `{0}` to `{1}` causes a loss of precision {2}(`{0}` is {3} bits wide, \
1180 but `{1}`'s mantissa is only {4} bits wide)",
1182 if cast_to_f64 { "f64" } else { "f32" },
1183 if arch_dependent { arch_dependent_str } else { "" },
1190 fn should_strip_parens(op: &Expr<'_>, snip: &str) -> bool {
1191 if let ExprKind::Binary(_, _, _) = op.kind {
1192 if snip.starts_with('(') && snip.ends_with(')') {
1199 fn span_lossless_lint(cx: &LateContext<'_>, expr: &Expr<'_>, op: &Expr<'_>, cast_from: Ty<'_>, cast_to: Ty<'_>) {
1200 // Do not suggest using From in consts/statics until it is valid to do so (see #2267).
1201 if in_constant(cx, expr.hir_id) {
1204 // The suggestion is to use a function call, so if the original expression
1205 // has parens on the outside, they are no longer needed.
1206 let mut applicability = Applicability::MachineApplicable;
1207 let opt = snippet_opt(cx, op.span);
1208 let sugg = opt.as_ref().map_or_else(
1210 applicability = Applicability::HasPlaceholders;
1214 if should_strip_parens(op, snip) {
1215 &snip[1..snip.len() - 1]
1227 "casting `{}` to `{}` may become silently lossy if you later change the type",
1231 format!("{}::from({})", cast_to, sugg),
1242 fn check_loss_of_sign(cx: &LateContext<'_>, expr: &Expr<'_>, op: &Expr<'_>, cast_from: Ty<'_>, cast_to: Ty<'_>) {
1243 if !cast_from.is_signed() || cast_to.is_signed() {
1247 // don't lint for positive constants
1248 let const_val = constant(cx, &cx.tables(), op);
1250 if let Some((const_val, _)) = const_val;
1251 if let Constant::Int(n) = const_val;
1252 if let ty::Int(ity) = cast_from.kind;
1253 if sext(cx.tcx, n, ity) >= 0;
1259 // don't lint for the result of methods that always return non-negative values
1260 if let ExprKind::MethodCall(ref path, _, _, _) = op.kind {
1261 let mut method_name = path.ident.name.as_str();
1262 let whitelisted_methods = ["abs", "checked_abs", "rem_euclid", "checked_rem_euclid"];
1265 if method_name == "unwrap";
1266 if let Some(arglist) = method_chain_args(op, &["unwrap"]);
1267 if let ExprKind::MethodCall(ref inner_path, _, _, _) = &arglist[0][0].kind;
1269 method_name = inner_path.ident.name.as_str();
1273 if whitelisted_methods.iter().any(|&name| method_name == name) {
1283 "casting `{}` to `{}` may lose the sign of the value",
1289 fn check_truncation_and_wrapping(cx: &LateContext<'_>, expr: &Expr<'_>, cast_from: Ty<'_>, cast_to: Ty<'_>) {
1290 let arch_64_suffix = " on targets with 64-bit wide pointers";
1291 let arch_32_suffix = " on targets with 32-bit wide pointers";
1292 let cast_unsigned_to_signed = !cast_from.is_signed() && cast_to.is_signed();
1293 let from_nbits = int_ty_to_nbits(cast_from, cx.tcx);
1294 let to_nbits = int_ty_to_nbits(cast_to, cx.tcx);
1295 let (span_truncation, suffix_truncation, span_wrap, suffix_wrap) =
1296 match (is_isize_or_usize(cast_from), is_isize_or_usize(cast_to)) {
1297 (true, true) | (false, false) => (
1298 to_nbits < from_nbits,
1300 to_nbits == from_nbits && cast_unsigned_to_signed,
1310 to_nbits <= 32 && cast_unsigned_to_signed,
1316 cast_unsigned_to_signed,
1317 if from_nbits == 64 {
1324 if span_truncation {
1327 CAST_POSSIBLE_TRUNCATION,
1330 "casting `{}` to `{}` may truncate the value{}",
1333 match suffix_truncation {
1334 ArchSuffix::_32 => arch_32_suffix,
1335 ArchSuffix::_64 => arch_64_suffix,
1336 ArchSuffix::None => "",
1347 "casting `{}` to `{}` may wrap around the value{}",
1351 ArchSuffix::_32 => arch_32_suffix,
1352 ArchSuffix::_64 => arch_64_suffix,
1353 ArchSuffix::None => "",
1360 fn check_lossless(cx: &LateContext<'_>, expr: &Expr<'_>, op: &Expr<'_>, cast_from: Ty<'_>, cast_to: Ty<'_>) {
1361 let cast_signed_to_unsigned = cast_from.is_signed() && !cast_to.is_signed();
1362 let from_nbits = int_ty_to_nbits(cast_from, cx.tcx);
1363 let to_nbits = int_ty_to_nbits(cast_to, cx.tcx);
1364 if !is_isize_or_usize(cast_from) && !is_isize_or_usize(cast_to) && from_nbits < to_nbits && !cast_signed_to_unsigned
1366 span_lossless_lint(cx, expr, op, cast_from, cast_to);
1370 declare_lint_pass!(Casts => [
1371 CAST_PRECISION_LOSS,
1373 CAST_POSSIBLE_TRUNCATION,
1379 FN_TO_NUMERIC_CAST_WITH_TRUNCATION,
1382 // Check if the given type is either `core::ffi::c_void` or
1383 // one of the platform specific `libc::<platform>::c_void` of libc.
1384 fn is_c_void(cx: &LateContext<'_>, ty: Ty<'_>) -> bool {
1385 if let ty::Adt(adt, _) = ty.kind {
1386 let names = cx.get_def_path(adt.did);
1388 if names.is_empty() {
1391 if names[0] == sym!(libc) || names[0] == sym::core && *names.last().unwrap() == sym!(c_void) {
1398 /// Returns the mantissa bits wide of a fp type.
1399 /// Will return 0 if the type is not a fp
1400 fn fp_ty_mantissa_nbits(typ: Ty<'_>) -> u32 {
1402 ty::Float(FloatTy::F32) => 23,
1403 ty::Float(FloatTy::F64) | ty::Infer(InferTy::FloatVar(_)) => 52,
1408 impl<'tcx> LateLintPass<'tcx> for Casts {
1409 fn check_expr(&mut self, cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) {
1410 if expr.span.from_expansion() {
1413 if let ExprKind::Cast(ref ex, _) = expr.kind {
1414 let (cast_from, cast_to) = (cx.tables().expr_ty(ex), cx.tables().expr_ty(expr));
1415 lint_fn_to_numeric_cast(cx, expr, ex, cast_from, cast_to);
1416 if let ExprKind::Lit(ref lit) = ex.kind {
1418 if let LitKind::Int(n, _) = lit.node;
1419 if let Some(src) = snippet_opt(cx, lit.span);
1420 if cast_to.is_floating_point();
1421 if let Some(num_lit) = NumericLiteral::from_lit_kind(&src, &lit.node);
1422 let from_nbits = 128 - n.leading_zeros();
1423 let to_nbits = fp_ty_mantissa_nbits(cast_to);
1424 if from_nbits != 0 && to_nbits != 0 && from_nbits <= to_nbits && num_lit.is_decimal();
1430 &format!("casting integer literal to `{}` is unnecessary", cast_to),
1432 format!("{}_{}", n, cast_to),
1433 Applicability::MachineApplicable,
1439 LitKind::Int(_, LitIntType::Unsuffixed) | LitKind::Float(_, LitFloatType::Unsuffixed) => {},
1441 if cast_from.kind == cast_to.kind && !in_external_macro(cx.sess(), expr.span) {
1447 "casting to the same type is unnecessary (`{}` -> `{}`)",
1455 if cast_from.is_numeric() && cast_to.is_numeric() && !in_external_macro(cx.sess(), expr.span) {
1456 lint_numeric_casts(cx, expr, ex, cast_from, cast_to);
1459 lint_cast_ptr_alignment(cx, expr, cast_from, cast_to);
1464 fn lint_numeric_casts<'tcx>(
1465 cx: &LateContext<'tcx>,
1467 cast_expr: &Expr<'_>,
1468 cast_from: Ty<'tcx>,
1471 match (cast_from.is_integral(), cast_to.is_integral()) {
1473 let from_nbits = int_ty_to_nbits(cast_from, cx.tcx);
1474 let to_nbits = if let ty::Float(FloatTy::F32) = cast_to.kind {
1479 if is_isize_or_usize(cast_from) || from_nbits >= to_nbits {
1480 span_precision_loss_lint(cx, expr, cast_from, to_nbits == 64);
1482 if from_nbits < to_nbits {
1483 span_lossless_lint(cx, expr, cast_expr, cast_from, cast_to);
1489 CAST_POSSIBLE_TRUNCATION,
1491 &format!("casting `{}` to `{}` may truncate the value", cast_from, cast_to),
1493 if !cast_to.is_signed() {
1499 "casting `{}` to `{}` may lose the sign of the value",
1506 check_loss_of_sign(cx, expr, cast_expr, cast_from, cast_to);
1507 check_truncation_and_wrapping(cx, expr, cast_from, cast_to);
1508 check_lossless(cx, expr, cast_expr, cast_from, cast_to);
1511 if let (&ty::Float(FloatTy::F64), &ty::Float(FloatTy::F32)) = (&cast_from.kind, &cast_to.kind) {
1514 CAST_POSSIBLE_TRUNCATION,
1516 "casting `f64` to `f32` may truncate the value",
1519 if let (&ty::Float(FloatTy::F32), &ty::Float(FloatTy::F64)) = (&cast_from.kind, &cast_to.kind) {
1520 span_lossless_lint(cx, expr, cast_expr, cast_from, cast_to);
1526 fn lint_cast_ptr_alignment<'tcx>(cx: &LateContext<'tcx>, expr: &Expr<'_>, cast_from: Ty<'tcx>, cast_to: Ty<'tcx>) {
1528 if let ty::RawPtr(from_ptr_ty) = &cast_from.kind;
1529 if let ty::RawPtr(to_ptr_ty) = &cast_to.kind;
1530 if let Ok(from_layout) = cx.layout_of(from_ptr_ty.ty);
1531 if let Ok(to_layout) = cx.layout_of(to_ptr_ty.ty);
1532 if from_layout.align.abi < to_layout.align.abi;
1533 // with c_void, we inherently need to trust the user
1534 if !is_c_void(cx, from_ptr_ty.ty);
1535 // when casting from a ZST, we don't know enough to properly lint
1536 if !from_layout.is_zst();
1543 "casting from `{}` to a more-strictly-aligned pointer (`{}`) ({} < {} bytes)",
1546 from_layout.align.abi.bytes(),
1547 to_layout.align.abi.bytes(),
1554 fn lint_fn_to_numeric_cast(
1555 cx: &LateContext<'_>,
1557 cast_expr: &Expr<'_>,
1561 // We only want to check casts to `ty::Uint` or `ty::Int`
1562 match cast_to.kind {
1563 ty::Uint(_) | ty::Int(..) => { /* continue on */ },
1566 match cast_from.kind {
1567 ty::FnDef(..) | ty::FnPtr(_) => {
1568 let mut applicability = Applicability::MaybeIncorrect;
1569 let from_snippet = snippet_with_applicability(cx, cast_expr.span, "x", &mut applicability);
1571 let to_nbits = int_ty_to_nbits(cast_to, cx.tcx);
1572 if to_nbits < cx.tcx.data_layout.pointer_size.bits() {
1575 FN_TO_NUMERIC_CAST_WITH_TRUNCATION,
1578 "casting function pointer `{}` to `{}`, which truncates the value",
1579 from_snippet, cast_to
1582 format!("{} as usize", from_snippet),
1585 } else if cast_to.kind != ty::Uint(UintTy::Usize) {
1590 &format!("casting function pointer `{}` to `{}`", from_snippet, cast_to),
1592 format!("{} as usize", from_snippet),
1601 declare_clippy_lint! {
1602 /// **What it does:** Checks for types used in structs, parameters and `let`
1603 /// declarations above a certain complexity threshold.
1605 /// **Why is this bad?** Too complex types make the code less readable. Consider
1606 /// using a `type` definition to simplify them.
1608 /// **Known problems:** None.
1612 /// # use std::rc::Rc;
1614 /// inner: Rc<Vec<Vec<Box<(u32, u32, u32, u32)>>>>,
1617 pub TYPE_COMPLEXITY,
1619 "usage of very complex types that might be better factored into `type` definitions"
1622 pub struct TypeComplexity {
1626 impl TypeComplexity {
1628 pub fn new(threshold: u64) -> Self {
1633 impl_lint_pass!(TypeComplexity => [TYPE_COMPLEXITY]);
1635 impl<'tcx> LateLintPass<'tcx> for TypeComplexity {
1638 cx: &LateContext<'tcx>,
1640 decl: &'tcx FnDecl<'_>,
1645 self.check_fndecl(cx, decl);
1648 fn check_struct_field(&mut self, cx: &LateContext<'tcx>, field: &'tcx hir::StructField<'_>) {
1649 // enum variants are also struct fields now
1650 self.check_type(cx, &field.ty);
1653 fn check_item(&mut self, cx: &LateContext<'tcx>, item: &'tcx Item<'_>) {
1655 ItemKind::Static(ref ty, _, _) | ItemKind::Const(ref ty, _) => self.check_type(cx, ty),
1656 // functions, enums, structs, impls and traits are covered
1661 fn check_trait_item(&mut self, cx: &LateContext<'tcx>, item: &'tcx TraitItem<'_>) {
1663 TraitItemKind::Const(ref ty, _) | TraitItemKind::Type(_, Some(ref ty)) => self.check_type(cx, ty),
1664 TraitItemKind::Fn(FnSig { ref decl, .. }, TraitFn::Required(_)) => self.check_fndecl(cx, decl),
1665 // methods with default impl are covered by check_fn
1670 fn check_impl_item(&mut self, cx: &LateContext<'tcx>, item: &'tcx ImplItem<'_>) {
1672 ImplItemKind::Const(ref ty, _) | ImplItemKind::TyAlias(ref ty) => self.check_type(cx, ty),
1673 // methods are covered by check_fn
1678 fn check_local(&mut self, cx: &LateContext<'tcx>, local: &'tcx Local<'_>) {
1679 if let Some(ref ty) = local.ty {
1680 self.check_type(cx, ty);
1685 impl<'tcx> TypeComplexity {
1686 fn check_fndecl(&self, cx: &LateContext<'tcx>, decl: &'tcx FnDecl<'_>) {
1687 for arg in decl.inputs {
1688 self.check_type(cx, arg);
1690 if let FnRetTy::Return(ref ty) = decl.output {
1691 self.check_type(cx, ty);
1695 fn check_type(&self, cx: &LateContext<'_>, ty: &hir::Ty<'_>) {
1696 if ty.span.from_expansion() {
1700 let mut visitor = TypeComplexityVisitor { score: 0, nest: 1 };
1701 visitor.visit_ty(ty);
1705 if score > self.threshold {
1710 "very complex type used. Consider factoring parts into `type` definitions",
1716 /// Walks a type and assigns a complexity score to it.
1717 struct TypeComplexityVisitor {
1718 /// total complexity score of the type
1720 /// current nesting level
1724 impl<'tcx> Visitor<'tcx> for TypeComplexityVisitor {
1725 type Map = Map<'tcx>;
1727 fn visit_ty(&mut self, ty: &'tcx hir::Ty<'_>) {
1728 let (add_score, sub_nest) = match ty.kind {
1729 // _, &x and *x have only small overhead; don't mess with nesting level
1730 TyKind::Infer | TyKind::Ptr(..) | TyKind::Rptr(..) => (1, 0),
1732 // the "normal" components of a type: named types, arrays/tuples
1733 TyKind::Path(..) | TyKind::Slice(..) | TyKind::Tup(..) | TyKind::Array(..) => (10 * self.nest, 1),
1735 // function types bring a lot of overhead
1736 TyKind::BareFn(ref bare) if bare.abi == Abi::Rust => (50 * self.nest, 1),
1738 TyKind::TraitObject(ref param_bounds, _) => {
1739 let has_lifetime_parameters = param_bounds.iter().any(|bound| {
1740 bound.bound_generic_params.iter().any(|gen| match gen.kind {
1741 GenericParamKind::Lifetime { .. } => true,
1745 if has_lifetime_parameters {
1746 // complex trait bounds like A<'a, 'b>
1749 // simple trait bounds like A + B
1756 self.score += add_score;
1757 self.nest += sub_nest;
1759 self.nest -= sub_nest;
1761 fn nested_visit_map(&mut self) -> NestedVisitorMap<Self::Map> {
1762 NestedVisitorMap::None
1766 declare_clippy_lint! {
1767 /// **What it does:** Checks for expressions where a character literal is cast
1768 /// to `u8` and suggests using a byte literal instead.
1770 /// **Why is this bad?** In general, casting values to smaller types is
1771 /// error-prone and should be avoided where possible. In the particular case of
1772 /// converting a character literal to u8, it is easy to avoid by just using a
1773 /// byte literal instead. As an added bonus, `b'a'` is even slightly shorter
1774 /// than `'a' as u8`.
1776 /// **Known problems:** None.
1783 /// A better version, using the byte literal:
1790 "casting a character literal to `u8` truncates"
1793 declare_lint_pass!(CharLitAsU8 => [CHAR_LIT_AS_U8]);
1795 impl<'tcx> LateLintPass<'tcx> for CharLitAsU8 {
1796 fn check_expr(&mut self, cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) {
1798 if !expr.span.from_expansion();
1799 if let ExprKind::Cast(e, _) = &expr.kind;
1800 if let ExprKind::Lit(l) = &e.kind;
1801 if let LitKind::Char(c) = l.node;
1802 if ty::Uint(UintTy::U8) == cx.tables().expr_ty(expr).kind;
1804 let mut applicability = Applicability::MachineApplicable;
1805 let snippet = snippet_with_applicability(cx, e.span, "'x'", &mut applicability);
1811 "casting a character literal to `u8` truncates",
1813 diag.note("`char` is four bytes wide, but `u8` is a single byte");
1816 diag.span_suggestion(
1818 "use a byte literal instead",
1819 format!("b{}", snippet),
1829 declare_clippy_lint! {
1830 /// **What it does:** Checks for comparisons where one side of the relation is
1831 /// either the minimum or maximum value for its type and warns if it involves a
1832 /// case that is always true or always false. Only integer and boolean types are
1835 /// **Why is this bad?** An expression like `min <= x` may misleadingly imply
1836 /// that it is possible for `x` to be less than the minimum. Expressions like
1837 /// `max < x` are probably mistakes.
1839 /// **Known problems:** For `usize` the size of the current compile target will
1840 /// be assumed (e.g., 64 bits on 64 bit systems). This means code that uses such
1841 /// a comparison to detect target pointer width will trigger this lint. One can
1842 /// use `mem::sizeof` and compare its value or conditional compilation
1844 /// like `#[cfg(target_pointer_width = "64")] ..` instead.
1849 /// let vec: Vec<isize> = Vec::new();
1850 /// if vec.len() <= 0 {}
1851 /// if 100 > i32::MAX {}
1853 pub ABSURD_EXTREME_COMPARISONS,
1855 "a comparison with a maximum or minimum value that is always true or false"
1858 declare_lint_pass!(AbsurdExtremeComparisons => [ABSURD_EXTREME_COMPARISONS]);
1865 struct ExtremeExpr<'a> {
1870 enum AbsurdComparisonResult {
1873 InequalityImpossible,
1876 fn is_cast_between_fixed_and_target<'tcx>(cx: &LateContext<'tcx>, expr: &'tcx Expr<'tcx>) -> bool {
1877 if let ExprKind::Cast(ref cast_exp, _) = expr.kind {
1878 let precast_ty = cx.tables().expr_ty(cast_exp);
1879 let cast_ty = cx.tables().expr_ty(expr);
1881 return is_isize_or_usize(precast_ty) != is_isize_or_usize(cast_ty);
1887 fn detect_absurd_comparison<'tcx>(
1888 cx: &LateContext<'tcx>,
1890 lhs: &'tcx Expr<'_>,
1891 rhs: &'tcx Expr<'_>,
1892 ) -> Option<(ExtremeExpr<'tcx>, AbsurdComparisonResult)> {
1893 use crate::types::AbsurdComparisonResult::{AlwaysFalse, AlwaysTrue, InequalityImpossible};
1894 use crate::types::ExtremeType::{Maximum, Minimum};
1895 use crate::utils::comparisons::{normalize_comparison, Rel};
1897 // absurd comparison only makes sense on primitive types
1898 // primitive types don't implement comparison operators with each other
1899 if cx.tables().expr_ty(lhs) != cx.tables().expr_ty(rhs) {
1903 // comparisons between fix sized types and target sized types are considered unanalyzable
1904 if is_cast_between_fixed_and_target(cx, lhs) || is_cast_between_fixed_and_target(cx, rhs) {
1908 let (rel, normalized_lhs, normalized_rhs) = normalize_comparison(op, lhs, rhs)?;
1910 let lx = detect_extreme_expr(cx, normalized_lhs);
1911 let rx = detect_extreme_expr(cx, normalized_rhs);
1916 (Some(l @ ExtremeExpr { which: Maximum, .. }), _) => (l, AlwaysFalse), // max < x
1917 (_, Some(r @ ExtremeExpr { which: Minimum, .. })) => (r, AlwaysFalse), // x < min
1923 (Some(l @ ExtremeExpr { which: Minimum, .. }), _) => (l, AlwaysTrue), // min <= x
1924 (Some(l @ ExtremeExpr { which: Maximum, .. }), _) => (l, InequalityImpossible), // max <= x
1925 (_, Some(r @ ExtremeExpr { which: Minimum, .. })) => (r, InequalityImpossible), // x <= min
1926 (_, Some(r @ ExtremeExpr { which: Maximum, .. })) => (r, AlwaysTrue), // x <= max
1930 Rel::Ne | Rel::Eq => return None,
1934 fn detect_extreme_expr<'tcx>(cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) -> Option<ExtremeExpr<'tcx>> {
1935 use crate::types::ExtremeType::{Maximum, Minimum};
1937 let ty = cx.tables().expr_ty(expr);
1939 let cv = constant(cx, cx.tables(), expr)?.0;
1941 let which = match (&ty.kind, cv) {
1942 (&ty::Bool, Constant::Bool(false)) | (&ty::Uint(_), Constant::Int(0)) => Minimum,
1943 (&ty::Int(ity), Constant::Int(i)) if i == unsext(cx.tcx, i128::MIN >> (128 - int_bits(cx.tcx, ity)), ity) => {
1947 (&ty::Bool, Constant::Bool(true)) => Maximum,
1948 (&ty::Int(ity), Constant::Int(i)) if i == unsext(cx.tcx, i128::MAX >> (128 - int_bits(cx.tcx, ity)), ity) => {
1951 (&ty::Uint(uty), Constant::Int(i)) if clip(cx.tcx, u128::MAX, uty) == i => Maximum,
1955 Some(ExtremeExpr { which, expr })
1958 impl<'tcx> LateLintPass<'tcx> for AbsurdExtremeComparisons {
1959 fn check_expr(&mut self, cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) {
1960 use crate::types::AbsurdComparisonResult::{AlwaysFalse, AlwaysTrue, InequalityImpossible};
1961 use crate::types::ExtremeType::{Maximum, Minimum};
1963 if let ExprKind::Binary(ref cmp, ref lhs, ref rhs) = expr.kind {
1964 if let Some((culprit, result)) = detect_absurd_comparison(cx, cmp.node, lhs, rhs) {
1965 if !expr.span.from_expansion() {
1966 let msg = "this comparison involving the minimum or maximum element for this \
1967 type contains a case that is always true or always false";
1969 let conclusion = match result {
1970 AlwaysFalse => "this comparison is always false".to_owned(),
1971 AlwaysTrue => "this comparison is always true".to_owned(),
1972 InequalityImpossible => format!(
1973 "the case where the two sides are not equal never occurs, consider using `{} == {}` \
1975 snippet(cx, lhs.span, "lhs"),
1976 snippet(cx, rhs.span, "rhs")
1981 "because `{}` is the {} value for this type, {}",
1982 snippet(cx, culprit.expr.span, "x"),
1983 match culprit.which {
1984 Minimum => "minimum",
1985 Maximum => "maximum",
1990 span_lint_and_help(cx, ABSURD_EXTREME_COMPARISONS, expr.span, msg, None, &help);
1997 declare_clippy_lint! {
1998 /// **What it does:** Checks for comparisons where the relation is always either
1999 /// true or false, but where one side has been upcast so that the comparison is
2000 /// necessary. Only integer types are checked.
2002 /// **Why is this bad?** An expression like `let x : u8 = ...; (x as u32) > 300`
2003 /// will mistakenly imply that it is possible for `x` to be outside the range of
2006 /// **Known problems:**
2007 /// https://github.com/rust-lang/rust-clippy/issues/886
2012 /// (x as u32) > 300;
2014 pub INVALID_UPCAST_COMPARISONS,
2016 "a comparison involving an upcast which is always true or false"
2019 declare_lint_pass!(InvalidUpcastComparisons => [INVALID_UPCAST_COMPARISONS]);
2021 #[derive(Copy, Clone, Debug, Eq)]
2028 #[allow(clippy::cast_sign_loss)]
2030 fn cmp_s_u(s: i128, u: u128) -> Ordering {
2033 } else if u > (i128::MAX as u128) {
2041 impl PartialEq for FullInt {
2043 fn eq(&self, other: &Self) -> bool {
2044 self.partial_cmp(other).expect("`partial_cmp` only returns `Some(_)`") == Ordering::Equal
2048 impl PartialOrd for FullInt {
2050 fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
2051 Some(match (self, other) {
2052 (&Self::S(s), &Self::S(o)) => s.cmp(&o),
2053 (&Self::U(s), &Self::U(o)) => s.cmp(&o),
2054 (&Self::S(s), &Self::U(o)) => Self::cmp_s_u(s, o),
2055 (&Self::U(s), &Self::S(o)) => Self::cmp_s_u(o, s).reverse(),
2059 impl Ord for FullInt {
2061 fn cmp(&self, other: &Self) -> Ordering {
2062 self.partial_cmp(other)
2063 .expect("`partial_cmp` for FullInt can never return `None`")
2067 fn numeric_cast_precast_bounds<'a>(cx: &LateContext<'_>, expr: &'a Expr<'_>) -> Option<(FullInt, FullInt)> {
2068 if let ExprKind::Cast(ref cast_exp, _) = expr.kind {
2069 let pre_cast_ty = cx.tables().expr_ty(cast_exp);
2070 let cast_ty = cx.tables().expr_ty(expr);
2071 // if it's a cast from i32 to u32 wrapping will invalidate all these checks
2072 if cx.layout_of(pre_cast_ty).ok().map(|l| l.size) == cx.layout_of(cast_ty).ok().map(|l| l.size) {
2075 match pre_cast_ty.kind {
2076 ty::Int(int_ty) => Some(match int_ty {
2077 IntTy::I8 => (FullInt::S(i128::from(i8::MIN)), FullInt::S(i128::from(i8::MAX))),
2078 IntTy::I16 => (FullInt::S(i128::from(i16::MIN)), FullInt::S(i128::from(i16::MAX))),
2079 IntTy::I32 => (FullInt::S(i128::from(i32::MIN)), FullInt::S(i128::from(i32::MAX))),
2080 IntTy::I64 => (FullInt::S(i128::from(i64::MIN)), FullInt::S(i128::from(i64::MAX))),
2081 IntTy::I128 => (FullInt::S(i128::MIN), FullInt::S(i128::MAX)),
2082 IntTy::Isize => (FullInt::S(isize::MIN as i128), FullInt::S(isize::MAX as i128)),
2084 ty::Uint(uint_ty) => Some(match uint_ty {
2085 UintTy::U8 => (FullInt::U(u128::from(u8::MIN)), FullInt::U(u128::from(u8::MAX))),
2086 UintTy::U16 => (FullInt::U(u128::from(u16::MIN)), FullInt::U(u128::from(u16::MAX))),
2087 UintTy::U32 => (FullInt::U(u128::from(u32::MIN)), FullInt::U(u128::from(u32::MAX))),
2088 UintTy::U64 => (FullInt::U(u128::from(u64::MIN)), FullInt::U(u128::from(u64::MAX))),
2089 UintTy::U128 => (FullInt::U(u128::MIN), FullInt::U(u128::MAX)),
2090 UintTy::Usize => (FullInt::U(usize::MIN as u128), FullInt::U(usize::MAX as u128)),
2099 fn node_as_const_fullint<'tcx>(cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) -> Option<FullInt> {
2100 let val = constant(cx, cx.tables(), expr)?.0;
2101 if let Constant::Int(const_int) = val {
2102 match cx.tables().expr_ty(expr).kind {
2103 ty::Int(ity) => Some(FullInt::S(sext(cx.tcx, const_int, ity))),
2104 ty::Uint(_) => Some(FullInt::U(const_int)),
2112 fn err_upcast_comparison(cx: &LateContext<'_>, span: Span, expr: &Expr<'_>, always: bool) {
2113 if let ExprKind::Cast(ref cast_val, _) = expr.kind {
2116 INVALID_UPCAST_COMPARISONS,
2119 "because of the numeric bounds on `{}` prior to casting, this expression is always {}",
2120 snippet(cx, cast_val.span, "the expression"),
2121 if always { "true" } else { "false" },
2127 fn upcast_comparison_bounds_err<'tcx>(
2128 cx: &LateContext<'tcx>,
2130 rel: comparisons::Rel,
2131 lhs_bounds: Option<(FullInt, FullInt)>,
2132 lhs: &'tcx Expr<'_>,
2133 rhs: &'tcx Expr<'_>,
2136 use crate::utils::comparisons::Rel;
2138 if let Some((lb, ub)) = lhs_bounds {
2139 if let Some(norm_rhs_val) = node_as_const_fullint(cx, rhs) {
2140 if rel == Rel::Eq || rel == Rel::Ne {
2141 if norm_rhs_val < lb || norm_rhs_val > ub {
2142 err_upcast_comparison(cx, span, lhs, rel == Rel::Ne);
2144 } else if match rel {
2159 Rel::Eq | Rel::Ne => unreachable!(),
2161 err_upcast_comparison(cx, span, lhs, true)
2162 } else if match rel {
2177 Rel::Eq | Rel::Ne => unreachable!(),
2179 err_upcast_comparison(cx, span, lhs, false)
2185 impl<'tcx> LateLintPass<'tcx> for InvalidUpcastComparisons {
2186 fn check_expr(&mut self, cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) {
2187 if let ExprKind::Binary(ref cmp, ref lhs, ref rhs) = expr.kind {
2188 let normalized = comparisons::normalize_comparison(cmp.node, lhs, rhs);
2189 let (rel, normalized_lhs, normalized_rhs) = if let Some(val) = normalized {
2195 let lhs_bounds = numeric_cast_precast_bounds(cx, normalized_lhs);
2196 let rhs_bounds = numeric_cast_precast_bounds(cx, normalized_rhs);
2198 upcast_comparison_bounds_err(cx, expr.span, rel, lhs_bounds, normalized_lhs, normalized_rhs, false);
2199 upcast_comparison_bounds_err(cx, expr.span, rel, rhs_bounds, normalized_rhs, normalized_lhs, true);
2204 declare_clippy_lint! {
2205 /// **What it does:** Checks for public `impl` or `fn` missing generalization
2206 /// over different hashers and implicitly defaulting to the default hashing
2207 /// algorithm (`SipHash`).
2209 /// **Why is this bad?** `HashMap` or `HashSet` with custom hashers cannot be
2212 /// **Known problems:** Suggestions for replacing constructors can contain
2213 /// false-positives. Also applying suggestions can require modification of other
2214 /// pieces of code, possibly including external crates.
2218 /// # use std::collections::HashMap;
2219 /// # use std::hash::{Hash, BuildHasher};
2220 /// # trait Serialize {};
2221 /// impl<K: Hash + Eq, V> Serialize for HashMap<K, V> { }
2223 /// pub fn foo(map: &mut HashMap<i32, i32>) { }
2225 /// could be rewritten as
2227 /// # use std::collections::HashMap;
2228 /// # use std::hash::{Hash, BuildHasher};
2229 /// # trait Serialize {};
2230 /// impl<K: Hash + Eq, V, S: BuildHasher> Serialize for HashMap<K, V, S> { }
2232 /// pub fn foo<S: BuildHasher>(map: &mut HashMap<i32, i32, S>) { }
2234 pub IMPLICIT_HASHER,
2236 "missing generalization over different hashers"
2239 declare_lint_pass!(ImplicitHasher => [IMPLICIT_HASHER]);
2241 impl<'tcx> LateLintPass<'tcx> for ImplicitHasher {
2242 #[allow(clippy::cast_possible_truncation, clippy::too_many_lines)]
2243 fn check_item(&mut self, cx: &LateContext<'tcx>, item: &'tcx Item<'_>) {
2244 use rustc_span::BytePos;
2246 fn suggestion<'tcx>(
2247 cx: &LateContext<'tcx>,
2248 diag: &mut DiagnosticBuilder<'_>,
2249 generics_span: Span,
2250 generics_suggestion_span: Span,
2251 target: &ImplicitHasherType<'_>,
2252 vis: ImplicitHasherConstructorVisitor<'_, '_, '_>,
2254 let generics_snip = snippet(cx, generics_span, "");
2256 let generics_snip = if generics_snip.is_empty() {
2259 &generics_snip[1..generics_snip.len() - 1]
2264 "consider adding a type parameter",
2267 generics_suggestion_span,
2269 "<{}{}S: ::std::hash::BuildHasher{}>",
2271 if generics_snip.is_empty() { "" } else { ", " },
2272 if vis.suggestions.is_empty() {
2275 // request users to add `Default` bound so that generic constructors can be used
2282 format!("{}<{}, S>", target.type_name(), target.type_arguments(),),
2287 if !vis.suggestions.is_empty() {
2288 multispan_sugg(diag, "...and use generic constructor", vis.suggestions);
2292 if !cx.access_levels.is_exported(item.hir_id) {
2303 let mut vis = ImplicitHasherTypeVisitor::new(cx);
2306 for target in &vis.found {
2307 if differing_macro_contexts(item.span, target.span()) {
2311 let generics_suggestion_span = generics.span.substitute_dummy({
2312 let pos = snippet_opt(cx, item.span.until(target.span()))
2313 .and_then(|snip| Some(item.span.lo() + BytePos(snip.find("impl")? as u32 + 4)));
2314 if let Some(pos) = pos {
2315 Span::new(pos, pos, item.span.data().ctxt)
2321 let mut ctr_vis = ImplicitHasherConstructorVisitor::new(cx, target);
2322 for item in items.iter().map(|item| cx.tcx.hir().impl_item(item.id)) {
2323 ctr_vis.visit_impl_item(item);
2331 "impl for `{}` should be generalized over different hashers",
2335 suggestion(cx, diag, generics.span, generics_suggestion_span, target, ctr_vis);
2340 ItemKind::Fn(ref sig, ref generics, body_id) => {
2341 let body = cx.tcx.hir().body(body_id);
2343 for ty in sig.decl.inputs {
2344 let mut vis = ImplicitHasherTypeVisitor::new(cx);
2347 for target in &vis.found {
2348 if in_external_macro(cx.sess(), generics.span) {
2351 let generics_suggestion_span = generics.span.substitute_dummy({
2352 let pos = snippet_opt(cx, item.span.until(body.params[0].pat.span))
2354 let i = snip.find("fn")?;
2355 Some(item.span.lo() + BytePos((i + (&snip[i..]).find('(')?) as u32))
2357 .expect("failed to create span for type parameters");
2358 Span::new(pos, pos, item.span.data().ctxt)
2361 let mut ctr_vis = ImplicitHasherConstructorVisitor::new(cx, target);
2362 ctr_vis.visit_body(body);
2369 "parameter of type `{}` should be generalized over different hashers",
2373 suggestion(cx, diag, generics.span, generics_suggestion_span, target, ctr_vis);
2384 enum ImplicitHasherType<'tcx> {
2385 HashMap(Span, Ty<'tcx>, Cow<'static, str>, Cow<'static, str>),
2386 HashSet(Span, Ty<'tcx>, Cow<'static, str>),
2389 impl<'tcx> ImplicitHasherType<'tcx> {
2390 /// Checks that `ty` is a target type without a `BuildHasher`.
2391 fn new(cx: &LateContext<'tcx>, hir_ty: &hir::Ty<'_>) -> Option<Self> {
2392 if let TyKind::Path(QPath::Resolved(None, ref path)) = hir_ty.kind {
2393 let params: Vec<_> = path
2401 .filter_map(|arg| match arg {
2402 GenericArg::Type(ty) => Some(ty),
2406 let params_len = params.len();
2408 let ty = hir_ty_to_ty(cx.tcx, hir_ty);
2410 if is_type_diagnostic_item(cx, ty, sym!(hashmap_type)) && params_len == 2 {
2411 Some(ImplicitHasherType::HashMap(
2414 snippet(cx, params[0].span, "K"),
2415 snippet(cx, params[1].span, "V"),
2417 } else if is_type_diagnostic_item(cx, ty, sym!(hashset_type)) && params_len == 1 {
2418 Some(ImplicitHasherType::HashSet(
2421 snippet(cx, params[0].span, "T"),
2431 fn type_name(&self) -> &'static str {
2433 ImplicitHasherType::HashMap(..) => "HashMap",
2434 ImplicitHasherType::HashSet(..) => "HashSet",
2438 fn type_arguments(&self) -> String {
2440 ImplicitHasherType::HashMap(.., ref k, ref v) => format!("{}, {}", k, v),
2441 ImplicitHasherType::HashSet(.., ref t) => format!("{}", t),
2445 fn ty(&self) -> Ty<'tcx> {
2447 ImplicitHasherType::HashMap(_, ty, ..) | ImplicitHasherType::HashSet(_, ty, ..) => ty,
2451 fn span(&self) -> Span {
2453 ImplicitHasherType::HashMap(span, ..) | ImplicitHasherType::HashSet(span, ..) => span,
2458 struct ImplicitHasherTypeVisitor<'a, 'tcx> {
2459 cx: &'a LateContext<'tcx>,
2460 found: Vec<ImplicitHasherType<'tcx>>,
2463 impl<'a, 'tcx> ImplicitHasherTypeVisitor<'a, 'tcx> {
2464 fn new(cx: &'a LateContext<'tcx>) -> Self {
2465 Self { cx, found: vec![] }
2469 impl<'a, 'tcx> Visitor<'tcx> for ImplicitHasherTypeVisitor<'a, 'tcx> {
2470 type Map = Map<'tcx>;
2472 fn visit_ty(&mut self, t: &'tcx hir::Ty<'_>) {
2473 if let Some(target) = ImplicitHasherType::new(self.cx, t) {
2474 self.found.push(target);
2480 fn nested_visit_map(&mut self) -> NestedVisitorMap<Self::Map> {
2481 NestedVisitorMap::None
2485 /// Looks for default-hasher-dependent constructors like `HashMap::new`.
2486 struct ImplicitHasherConstructorVisitor<'a, 'b, 'tcx> {
2487 cx: &'a LateContext<'tcx>,
2488 maybe_typeck_tables: Option<&'tcx TypeckTables<'tcx>>,
2489 target: &'b ImplicitHasherType<'tcx>,
2490 suggestions: BTreeMap<Span, String>,
2493 impl<'a, 'b, 'tcx> ImplicitHasherConstructorVisitor<'a, 'b, 'tcx> {
2494 fn new(cx: &'a LateContext<'tcx>, target: &'b ImplicitHasherType<'tcx>) -> Self {
2497 maybe_typeck_tables: cx.maybe_typeck_tables(),
2499 suggestions: BTreeMap::new(),
2504 impl<'a, 'b, 'tcx> Visitor<'tcx> for ImplicitHasherConstructorVisitor<'a, 'b, 'tcx> {
2505 type Map = Map<'tcx>;
2507 fn visit_body(&mut self, body: &'tcx Body<'_>) {
2508 let old_maybe_typeck_tables = self.maybe_typeck_tables.replace(self.cx.tcx.body_tables(body.id()));
2509 walk_body(self, body);
2510 self.maybe_typeck_tables = old_maybe_typeck_tables;
2513 fn visit_expr(&mut self, e: &'tcx Expr<'_>) {
2515 if let ExprKind::Call(ref fun, ref args) = e.kind;
2516 if let ExprKind::Path(QPath::TypeRelative(ref ty, ref method)) = fun.kind;
2517 if let TyKind::Path(QPath::Resolved(None, ty_path)) = ty.kind;
2519 if !TyS::same_type(self.target.ty(), self.maybe_typeck_tables.unwrap().expr_ty(e)) {
2523 if match_path(ty_path, &paths::HASHMAP) {
2524 if method.ident.name == sym!(new) {
2526 .insert(e.span, "HashMap::default()".to_string());
2527 } else if method.ident.name == sym!(with_capacity) {
2528 self.suggestions.insert(
2531 "HashMap::with_capacity_and_hasher({}, Default::default())",
2532 snippet(self.cx, args[0].span, "capacity"),
2536 } else if match_path(ty_path, &paths::HASHSET) {
2537 if method.ident.name == sym!(new) {
2539 .insert(e.span, "HashSet::default()".to_string());
2540 } else if method.ident.name == sym!(with_capacity) {
2541 self.suggestions.insert(
2544 "HashSet::with_capacity_and_hasher({}, Default::default())",
2545 snippet(self.cx, args[0].span, "capacity"),
2556 fn nested_visit_map(&mut self) -> NestedVisitorMap<Self::Map> {
2557 NestedVisitorMap::OnlyBodies(self.cx.tcx.hir())
2561 declare_clippy_lint! {
2562 /// **What it does:** Checks for casts of `&T` to `&mut T` anywhere in the code.
2564 /// **Why is this bad?** It’s basically guaranteed to be undefined behaviour.
2565 /// `UnsafeCell` is the only way to obtain aliasable data that is considered
2568 /// **Known problems:** None.
2574 /// *(r as *const _ as *mut _) += 1;
2579 /// Instead consider using interior mutability types.
2582 /// use std::cell::UnsafeCell;
2584 /// fn x(r: &UnsafeCell<i32>) {
2590 pub CAST_REF_TO_MUT,
2592 "a cast of reference to a mutable pointer"
2595 declare_lint_pass!(RefToMut => [CAST_REF_TO_MUT]);
2597 impl<'tcx> LateLintPass<'tcx> for RefToMut {
2598 fn check_expr(&mut self, cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) {
2600 if let ExprKind::Unary(UnOp::UnDeref, e) = &expr.kind;
2601 if let ExprKind::Cast(e, t) = &e.kind;
2602 if let TyKind::Ptr(MutTy { mutbl: Mutability::Mut, .. }) = t.kind;
2603 if let ExprKind::Cast(e, t) = &e.kind;
2604 if let TyKind::Ptr(MutTy { mutbl: Mutability::Not, .. }) = t.kind;
2605 if let ty::Ref(..) = cx.tables().node_type(e.hir_id).kind;
2611 "casting `&T` to `&mut T` may cause undefined behavior, consider instead using an `UnsafeCell`",