3 use rustc::hir::intravisit::{FnKind, Visitor, walk_ty, NestedVisitorMap};
6 use std::cmp::Ordering;
7 use syntax::ast::{IntTy, UintTy, FloatTy};
8 use syntax::codemap::Span;
9 use utils::{comparisons, higher, in_external_macro, in_macro, match_def_path, snippet,
10 span_help_and_lint, span_lint, opt_def_id, last_path_segment};
13 /// Handles all the linting of funky types
14 #[allow(missing_copy_implementations)]
17 /// **What it does:** Checks for use of `Box<Vec<_>>` anywhere in the code.
19 /// **Why is this bad?** `Vec` already keeps its contents in a separate area on
20 /// the heap. So if you `Box` it, you just add another level of indirection
21 /// without any benefit whatsoever.
23 /// **Known problems:** None.
28 /// values: Box<Vec<Foo>>,
34 "usage of `Box<Vec<T>>`, vector elements are already on the heap"
37 /// **What it does:** Checks for usage of any `LinkedList`, suggesting to use a
38 /// `Vec` or a `VecDeque` (formerly called `RingBuf`).
40 /// **Why is this bad?** Gankro says:
42 /// > The TL;DR of `LinkedList` is that it's built on a massive amount of pointers and indirection.
43 /// > It wastes memory, it has terrible cache locality, and is all-around slow. `RingBuf`, while
44 /// > "only" amortized for push/pop, should be faster in the general case for almost every possible
45 /// > workload, and isn't even amortized at all if you can predict the capacity you need.
47 /// > `LinkedList`s are only really good if you're doing a lot of merging or splitting of lists.
48 /// > This is because they can just mangle some pointers instead of actually copying the data. Even
49 /// > if you're doing a lot of insertion in the middle of the list, `RingBuf` can still be better
50 /// > because of how expensive it is to seek to the middle of a `LinkedList`.
52 /// **Known problems:** False positives – the instances where using a
53 /// `LinkedList` makes sense are few and far between, but they can still happen.
57 /// let x = LinkedList::new();
62 "usage of LinkedList, usually a vector is faster, or a more specialized data \
63 structure like a VecDeque"
66 impl LintPass for TypePass {
67 fn get_lints(&self) -> LintArray {
68 lint_array!(BOX_VEC, LINKEDLIST)
72 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for TypePass {
73 fn check_ty(&mut self, cx: &LateContext<'a, 'tcx>, ast_ty: &'tcx Ty) {
74 if in_macro(cx, ast_ty.span) {
77 if let TyPath(ref qpath) = ast_ty.node {
78 let def = cx.tcx.tables().qpath_def(qpath, ast_ty.id);
79 if let Some(def_id) = opt_def_id(def) {
80 if Some(def_id) == cx.tcx.lang_items.owned_box() {
81 let last = last_path_segment(qpath);
83 let PathParameters::AngleBracketedParameters(ref ag) = last.parameters,
84 let Some(ref vec) = ag.types.get(0),
85 let TyPath(ref qpath) = vec.node,
86 let def::Def::Struct(..) = cx.tcx.tables().qpath_def(qpath, vec.id),
87 let Some(did) = opt_def_id(cx.tcx.tables().qpath_def(qpath, vec.id)),
88 match_def_path(cx, did, &paths::VEC),
90 span_help_and_lint(cx,
93 "you seem to be trying to use `Box<Vec<T>>`. Consider using just `Vec<T>`",
94 "`Vec<T>` is already on the heap, `Box<Vec<T>>` makes an extra allocation.");
96 } else if match_def_path(cx, def_id, &paths::LINKED_LIST) {
97 span_help_and_lint(cx,
100 "I see you're using a LinkedList! Perhaps you meant some other data structure?",
101 "a VecDeque might work");
108 #[allow(missing_copy_implementations)]
111 /// **What it does:** Checks for binding a unit value.
113 /// **Why is this bad?** A unit value cannot usefully be used anywhere. So
114 /// binding one is kind of pointless.
116 /// **Known problems:** None.
125 "creating a let binding to a value of unit type, which usually can't be used afterwards"
128 fn check_let_unit(cx: &LateContext, decl: &Decl) {
129 if let DeclLocal(ref local) = decl.node {
130 let bindtype = &cx.tcx.tables().pat_ty(&local.pat).sty;
132 ty::TyTuple(slice) if slice.is_empty() => {
133 if in_external_macro(cx, decl.span) || in_macro(cx, local.pat.span) {
136 if higher::is_from_for_desugar(decl) {
142 &format!("this let-binding has unit value. Consider omitting `let {} =`",
143 snippet(cx, local.pat.span, "..")));
150 impl LintPass for LetPass {
151 fn get_lints(&self) -> LintArray {
152 lint_array!(LET_UNIT_VALUE)
156 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for LetPass {
157 fn check_decl(&mut self, cx: &LateContext<'a, 'tcx>, decl: &'tcx Decl) {
158 check_let_unit(cx, decl)
162 /// **What it does:** Checks for comparisons to unit.
164 /// **Why is this bad?** Unit is always equal to itself, and thus is just a
165 /// clumsily written constant. Mostly this happens when someone accidentally
166 /// adds semicolons at the end of the operands.
168 /// **Known problems:** None.
172 /// if { foo(); } == { bar(); } { baz(); }
176 /// { foo(); bar(); baz(); }
181 "comparing unit values"
184 #[allow(missing_copy_implementations)]
187 impl LintPass for UnitCmp {
188 fn get_lints(&self) -> LintArray {
189 lint_array!(UNIT_CMP)
193 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for UnitCmp {
194 fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, expr: &'tcx Expr) {
195 if in_macro(cx, expr.span) {
198 if let ExprBinary(ref cmp, ref left, _) = expr.node {
200 if op.is_comparison() {
201 let sty = &cx.tcx.tables().expr_ty(left).sty;
203 ty::TyTuple(slice) if slice.is_empty() => {
204 let result = match op {
205 BiEq | BiLe | BiGe => "true",
211 &format!("{}-comparison of unit values detected. This will always be {}",
224 /// **What it does:** Checks for casts from any numerical to a float type where
225 /// the receiving type cannot store all values from the original type without
226 /// rounding errors. This possible rounding is to be expected, so this lint is
227 /// `Allow` by default.
229 /// Basically, this warns on casting any integer with 32 or more bits to `f32`
230 /// or any 64-bit integer to `f64`.
232 /// **Why is this bad?** It's not bad at all. But in some applications it can be
233 /// helpful to know where precision loss can take place. This lint can help find
234 /// those places in the code.
236 /// **Known problems:** None.
240 /// let x = u64::MAX; x as f64
243 pub CAST_PRECISION_LOSS,
245 "casts that cause loss of precision, e.g `x as f32` where `x: u64`"
248 /// **What it does:** Checks for casts from a signed to an unsigned numerical
249 /// type. In this case, negative values wrap around to large positive values,
250 /// which can be quite surprising in practice. However, as the cast works as
251 /// defined, this lint is `Allow` by default.
253 /// **Why is this bad?** Possibly surprising results. You can activate this lint
254 /// as a one-time check to see where numerical wrapping can arise.
256 /// **Known problems:** None.
261 /// y as u64 // will return 18446744073709551615
266 "casts from signed types to unsigned types, e.g `x as u32` where `x: i32`"
269 /// **What it does:** Checks for on casts between numerical types that may
270 /// truncate large values. This is expected behavior, so the cast is `Allow` by
273 /// **Why is this bad?** In some problem domains, it is good practice to avoid
274 /// truncation. This lint can be activated to help assess where additional
275 /// checks could be beneficial.
277 /// **Known problems:** None.
281 /// fn as_u8(x: u64) -> u8 { x as u8 }
284 pub CAST_POSSIBLE_TRUNCATION,
286 "casts that may cause truncation of the value, e.g `x as u8` where `x: u32`, \
287 or `x as i32` where `x: f32`"
290 /// **What it does:** Checks for casts from an unsigned type to a signed type of
291 /// the same size. Performing such a cast is a 'no-op' for the compiler,
292 /// i.e. nothing is changed at the bit level, and the binary representation of
293 /// the value is reinterpreted. This can cause wrapping if the value is too big
294 /// for the target signed type. However, the cast works as defined, so this lint
295 /// is `Allow` by default.
297 /// **Why is this bad?** While such a cast is not bad in itself, the results can
298 /// be surprising when this is not the intended behavior, as demonstrated by the
301 /// **Known problems:** None.
305 /// u32::MAX as i32 // will yield a value of `-1`
308 pub CAST_POSSIBLE_WRAP,
310 "casts that may cause wrapping around the value, e.g `x as i32` where `x: u32` \
314 /// Returns the size in bits of an integral type.
315 /// Will return 0 if the type is not an int or uint variant
316 fn int_ty_to_nbits(typ: &ty::TyS) -> usize {
317 let n = match typ.sty {
318 ty::TyInt(i) => 4 << (i as usize),
319 ty::TyUint(u) => 4 << (u as usize),
322 // n == 4 is the usize/isize case
324 ::std::mem::size_of::<usize>() * 8
330 fn is_isize_or_usize(typ: &ty::TyS) -> bool {
332 ty::TyInt(IntTy::Is) |
333 ty::TyUint(UintTy::Us) => true,
338 fn span_precision_loss_lint(cx: &LateContext, expr: &Expr, cast_from: &ty::TyS, cast_to_f64: bool) {
339 let mantissa_nbits = if cast_to_f64 {
344 let arch_dependent = is_isize_or_usize(cast_from) && cast_to_f64;
345 let arch_dependent_str = "on targets with 64-bit wide pointers ";
346 let from_nbits_str = if arch_dependent {
348 } else if is_isize_or_usize(cast_from) {
349 "32 or 64".to_owned()
351 int_ty_to_nbits(cast_from).to_string()
356 &format!("casting {0} to {1} causes a loss of precision {2}({0} is {3} bits wide, but {1}'s mantissa \
357 is only {4} bits wide)",
379 fn check_truncation_and_wrapping(cx: &LateContext, expr: &Expr, cast_from: &ty::TyS, cast_to: &ty::TyS) {
380 let arch_64_suffix = " on targets with 64-bit wide pointers";
381 let arch_32_suffix = " on targets with 32-bit wide pointers";
382 let cast_unsigned_to_signed = !cast_from.is_signed() && cast_to.is_signed();
383 let (from_nbits, to_nbits) = (int_ty_to_nbits(cast_from), int_ty_to_nbits(cast_to));
384 let (span_truncation, suffix_truncation, span_wrap, suffix_wrap) = match (is_isize_or_usize(cast_from),
385 is_isize_or_usize(cast_to)) {
386 (true, true) | (false, false) => {
387 (to_nbits < from_nbits,
389 to_nbits == from_nbits && cast_unsigned_to_signed,
399 to_nbits <= 32 && cast_unsigned_to_signed,
405 cast_unsigned_to_signed,
406 if from_nbits == 64 {
415 CAST_POSSIBLE_TRUNCATION,
417 &format!("casting {} to {} may truncate the value{}",
420 match suffix_truncation {
421 ArchSuffix::_32 => arch_32_suffix,
422 ArchSuffix::_64 => arch_64_suffix,
423 ArchSuffix::None => "",
430 &format!("casting {} to {} may wrap around the value{}",
434 ArchSuffix::_32 => arch_32_suffix,
435 ArchSuffix::_64 => arch_64_suffix,
436 ArchSuffix::None => "",
441 impl LintPass for CastPass {
442 fn get_lints(&self) -> LintArray {
443 lint_array!(CAST_PRECISION_LOSS,
445 CAST_POSSIBLE_TRUNCATION,
450 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for CastPass {
451 fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, expr: &'tcx Expr) {
452 if let ExprCast(ref ex, _) = expr.node {
453 let (cast_from, cast_to) = (cx.tcx.tables().expr_ty(ex), cx.tcx.tables().expr_ty(expr));
454 if cast_from.is_numeric() && cast_to.is_numeric() && !in_external_macro(cx, expr.span) {
455 match (cast_from.is_integral(), cast_to.is_integral()) {
457 let from_nbits = int_ty_to_nbits(cast_from);
458 let to_nbits = if let ty::TyFloat(FloatTy::F32) = cast_to.sty {
463 if is_isize_or_usize(cast_from) || from_nbits >= to_nbits {
464 span_precision_loss_lint(cx, expr, cast_from, to_nbits == 64);
469 CAST_POSSIBLE_TRUNCATION,
471 &format!("casting {} to {} may truncate the value", cast_from, cast_to));
472 if !cast_to.is_signed() {
476 &format!("casting {} to {} may lose the sign of the value", cast_from, cast_to));
480 if cast_from.is_signed() && !cast_to.is_signed() {
484 &format!("casting {} to {} may lose the sign of the value", cast_from, cast_to));
486 check_truncation_and_wrapping(cx, expr, cast_from, cast_to);
489 if let (&ty::TyFloat(FloatTy::F64), &ty::TyFloat(FloatTy::F32)) = (&cast_from.sty,
492 CAST_POSSIBLE_TRUNCATION,
494 "casting f64 to f32 may truncate the value");
503 /// **What it does:** Checks for types used in structs, parameters and `let`
504 /// declarations above a certain complexity threshold.
506 /// **Why is this bad?** Too complex types make the code less readable. Consider
507 /// using a `type` definition to simplify them.
509 /// **Known problems:** None.
513 /// struct Foo { inner: Rc<Vec<Vec<Box<(u32, u32, u32, u32)>>>> }
518 "usage of very complex types that might be better factored into `type` definitions"
521 #[allow(missing_copy_implementations)]
522 pub struct TypeComplexityPass {
526 impl TypeComplexityPass {
527 pub fn new(threshold: u64) -> Self {
528 TypeComplexityPass { threshold: threshold }
532 impl LintPass for TypeComplexityPass {
533 fn get_lints(&self) -> LintArray {
534 lint_array!(TYPE_COMPLEXITY)
538 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for TypeComplexityPass {
539 fn check_fn(&mut self, cx: &LateContext<'a, 'tcx>, _: FnKind<'tcx>, decl: &'tcx FnDecl, _: &'tcx Expr, _: Span, _: NodeId) {
540 self.check_fndecl(cx, decl);
543 fn check_struct_field(&mut self, cx: &LateContext<'a, 'tcx>, field: &'tcx StructField) {
544 // enum variants are also struct fields now
545 self.check_type(cx, &field.ty);
548 fn check_item(&mut self, cx: &LateContext<'a, 'tcx>, item: &'tcx Item) {
550 ItemStatic(ref ty, _, _) |
551 ItemConst(ref ty, _) => self.check_type(cx, ty),
552 // functions, enums, structs, impls and traits are covered
557 fn check_trait_item(&mut self, cx: &LateContext<'a, 'tcx>, item: &'tcx TraitItem) {
559 ConstTraitItem(ref ty, _) |
560 TypeTraitItem(_, Some(ref ty)) => self.check_type(cx, ty),
561 MethodTraitItem(MethodSig { ref decl, .. }, None) => self.check_fndecl(cx, decl),
562 // methods with default impl are covered by check_fn
567 fn check_impl_item(&mut self, cx: &LateContext<'a, 'tcx>, item: &'tcx ImplItem) {
569 ImplItemKind::Const(ref ty, _) |
570 ImplItemKind::Type(ref ty) => self.check_type(cx, ty),
571 // methods are covered by check_fn
576 fn check_local(&mut self, cx: &LateContext<'a, 'tcx>, local: &'tcx Local) {
577 if let Some(ref ty) = local.ty {
578 self.check_type(cx, ty);
583 impl<'a, 'tcx> TypeComplexityPass {
584 fn check_fndecl(&self, cx: &LateContext<'a, 'tcx>, decl: &'tcx FnDecl) {
585 for arg in &decl.inputs {
586 self.check_type(cx, &arg.ty);
588 if let Return(ref ty) = decl.output {
589 self.check_type(cx, ty);
593 fn check_type(&self, cx: &LateContext<'a, 'tcx>, ty: &'tcx Ty) {
594 if in_macro(cx, ty.span) {
598 let mut visitor = TypeComplexityVisitor {
603 visitor.visit_ty(ty);
607 if score > self.threshold {
611 "very complex type used. Consider factoring parts into `type` definitions");
616 /// Walks a type and assigns a complexity score to it.
617 struct TypeComplexityVisitor<'a, 'tcx: 'a> {
618 /// total complexity score of the type
620 /// current nesting level
622 cx: &'a LateContext<'a, 'tcx>,
625 impl<'a, 'tcx: 'a> Visitor<'tcx> for TypeComplexityVisitor<'a, 'tcx> {
626 fn visit_ty(&mut self, ty: &'tcx Ty) {
627 let (add_score, sub_nest) = match ty.node {
628 // _, &x and *x have only small overhead; don't mess with nesting level
629 TyInfer | TyPtr(..) | TyRptr(..) => (1, 0),
631 // the "normal" components of a type: named types, arrays/tuples
635 TyArray(..) => (10 * self.nest, 1),
637 // "Sum" of trait bounds
638 TyObjectSum(..) => (20 * self.nest, 0),
640 // function types and "for<...>" bring a lot of overhead
642 TyPolyTraitRef(..) => (50 * self.nest, 1),
646 self.score += add_score;
647 self.nest += sub_nest;
649 self.nest -= sub_nest;
651 fn nested_visit_map<'this>(&'this mut self) -> NestedVisitorMap<'this, 'tcx> {
652 NestedVisitorMap::All(&self.cx.tcx.map)
656 /// **What it does:** Checks for expressions where a character literal is cast
657 /// to `u8` and suggests using a byte literal instead.
659 /// **Why is this bad?** In general, casting values to smaller types is
660 /// error-prone and should be avoided where possible. In the particular case of
661 /// converting a character literal to u8, it is easy to avoid by just using a
662 /// byte literal instead. As an added bonus, `b'a'` is even slightly shorter
663 /// than `'a' as u8`.
665 /// **Known problems:** None.
674 "casting a character literal to u8"
677 pub struct CharLitAsU8;
679 impl LintPass for CharLitAsU8 {
680 fn get_lints(&self) -> LintArray {
681 lint_array!(CHAR_LIT_AS_U8)
685 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for CharLitAsU8 {
686 fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, expr: &'tcx Expr) {
687 use syntax::ast::{LitKind, UintTy};
689 if let ExprCast(ref e, _) = expr.node {
690 if let ExprLit(ref l) = e.node {
691 if let LitKind::Char(_) = l.node {
692 if ty::TyUint(UintTy::U8) == cx.tcx.tables().expr_ty(expr).sty && !in_macro(cx, expr.span) {
693 let msg = "casting character literal to u8. `char`s \
694 are 4 bytes wide in rust, so casting to u8 \
696 let help = format!("Consider using a byte literal \
698 snippet(cx, e.span, "'x'"));
699 span_help_and_lint(cx, CHAR_LIT_AS_U8, expr.span, msg, &help);
707 /// **What it does:** Checks for comparisons where one side of the relation is
708 /// either the minimum or maximum value for its type and warns if it involves a
709 /// case that is always true or always false. Only integer and boolean types are
712 /// **Why is this bad?** An expression like `min <= x` may misleadingly imply
713 /// that is is possible for `x` to be less than the minimum. Expressions like
714 /// `max < x` are probably mistakes.
716 /// **Known problems:** None.
721 /// 100 > std::i32::MAX
724 pub ABSURD_EXTREME_COMPARISONS,
726 "a comparison with a maximum or minimum value that is always true or false"
729 pub struct AbsurdExtremeComparisons;
731 impl LintPass for AbsurdExtremeComparisons {
732 fn get_lints(&self) -> LintArray {
733 lint_array!(ABSURD_EXTREME_COMPARISONS)
742 struct ExtremeExpr<'a> {
747 enum AbsurdComparisonResult {
750 InequalityImpossible,
755 fn detect_absurd_comparison<'a>(cx: &LateContext, op: BinOp_, lhs: &'a Expr, rhs: &'a Expr)
756 -> Option<(ExtremeExpr<'a>, AbsurdComparisonResult)> {
757 use types::ExtremeType::*;
758 use types::AbsurdComparisonResult::*;
759 use utils::comparisons::*;
761 let normalized = normalize_comparison(op, lhs, rhs);
762 let (rel, normalized_lhs, normalized_rhs) = if let Some(val) = normalized {
768 let lx = detect_extreme_expr(cx, normalized_lhs);
769 let rx = detect_extreme_expr(cx, normalized_rhs);
774 (Some(l @ ExtremeExpr { which: Maximum, .. }), _) => (l, AlwaysFalse), // max < x
775 (_, Some(r @ ExtremeExpr { which: Minimum, .. })) => (r, AlwaysFalse), // x < min
781 (Some(l @ ExtremeExpr { which: Minimum, .. }), _) => (l, AlwaysTrue), // min <= x
782 (Some(l @ ExtremeExpr { which: Maximum, .. }), _) => (l, InequalityImpossible), //max <= x
783 (_, Some(r @ ExtremeExpr { which: Minimum, .. })) => (r, InequalityImpossible), // x <= min
784 (_, Some(r @ ExtremeExpr { which: Maximum, .. })) => (r, AlwaysTrue), // x <= max
788 Rel::Ne | Rel::Eq => return None,
792 fn detect_extreme_expr<'a>(cx: &LateContext, expr: &'a Expr) -> Option<ExtremeExpr<'a>> {
793 use rustc::middle::const_val::ConstVal::*;
794 use rustc_const_math::*;
795 use rustc_const_eval::EvalHint::ExprTypeChecked;
796 use rustc_const_eval::*;
797 use types::ExtremeType::*;
799 let ty = &cx.tcx.tables().expr_ty(expr).sty;
802 ty::TyBool | ty::TyInt(_) | ty::TyUint(_) => (),
806 let cv = match eval_const_expr_partial(cx.tcx, expr, ExprTypeChecked, None) {
808 Err(_) => return None,
811 let which = match (ty, cv) {
812 (&ty::TyBool, Bool(false)) |
813 (&ty::TyInt(IntTy::Is), Integral(Isize(Is32(::std::i32::MIN)))) |
814 (&ty::TyInt(IntTy::Is), Integral(Isize(Is64(::std::i64::MIN)))) |
815 (&ty::TyInt(IntTy::I8), Integral(I8(::std::i8::MIN))) |
816 (&ty::TyInt(IntTy::I16), Integral(I16(::std::i16::MIN))) |
817 (&ty::TyInt(IntTy::I32), Integral(I32(::std::i32::MIN))) |
818 (&ty::TyInt(IntTy::I64), Integral(I64(::std::i64::MIN))) |
819 (&ty::TyUint(UintTy::Us), Integral(Usize(Us32(::std::u32::MIN)))) |
820 (&ty::TyUint(UintTy::Us), Integral(Usize(Us64(::std::u64::MIN)))) |
821 (&ty::TyUint(UintTy::U8), Integral(U8(::std::u8::MIN))) |
822 (&ty::TyUint(UintTy::U16), Integral(U16(::std::u16::MIN))) |
823 (&ty::TyUint(UintTy::U32), Integral(U32(::std::u32::MIN))) |
824 (&ty::TyUint(UintTy::U64), Integral(U64(::std::u64::MIN))) => Minimum,
826 (&ty::TyBool, Bool(true)) |
827 (&ty::TyInt(IntTy::Is), Integral(Isize(Is32(::std::i32::MAX)))) |
828 (&ty::TyInt(IntTy::Is), Integral(Isize(Is64(::std::i64::MAX)))) |
829 (&ty::TyInt(IntTy::I8), Integral(I8(::std::i8::MAX))) |
830 (&ty::TyInt(IntTy::I16), Integral(I16(::std::i16::MAX))) |
831 (&ty::TyInt(IntTy::I32), Integral(I32(::std::i32::MAX))) |
832 (&ty::TyInt(IntTy::I64), Integral(I64(::std::i64::MAX))) |
833 (&ty::TyUint(UintTy::Us), Integral(Usize(Us32(::std::u32::MAX)))) |
834 (&ty::TyUint(UintTy::Us), Integral(Usize(Us64(::std::u64::MAX)))) |
835 (&ty::TyUint(UintTy::U8), Integral(U8(::std::u8::MAX))) |
836 (&ty::TyUint(UintTy::U16), Integral(U16(::std::u16::MAX))) |
837 (&ty::TyUint(UintTy::U32), Integral(U32(::std::u32::MAX))) |
838 (&ty::TyUint(UintTy::U64), Integral(U64(::std::u64::MAX))) => Maximum,
848 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for AbsurdExtremeComparisons {
849 fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, expr: &'tcx Expr) {
850 use types::ExtremeType::*;
851 use types::AbsurdComparisonResult::*;
853 if let ExprBinary(ref cmp, ref lhs, ref rhs) = expr.node {
854 if let Some((culprit, result)) = detect_absurd_comparison(cx, cmp.node, lhs, rhs) {
855 if !in_macro(cx, expr.span) {
856 let msg = "this comparison involving the minimum or maximum element for this \
857 type contains a case that is always true or always false";
859 let conclusion = match result {
860 AlwaysFalse => "this comparison is always false".to_owned(),
861 AlwaysTrue => "this comparison is always true".to_owned(),
862 InequalityImpossible => {
863 format!("the case where the two sides are not equal never occurs, consider using {} == {} \
865 snippet(cx, lhs.span, "lhs"),
866 snippet(cx, rhs.span, "rhs"))
870 let help = format!("because {} is the {} value for this type, {}",
871 snippet(cx, culprit.expr.span, "x"),
872 match culprit.which {
873 Minimum => "minimum",
874 Maximum => "maximum",
878 span_help_and_lint(cx, ABSURD_EXTREME_COMPARISONS, expr.span, msg, &help);
885 /// **What it does:** Checks for comparisons where the relation is always either
886 /// true or false, but where one side has been upcast so that the comparison is
887 /// necessary. Only integer types are checked.
889 /// **Why is this bad?** An expression like `let x : u8 = ...; (x as u32) > 300`
890 /// will mistakenly imply that it is possible for `x` to be outside the range of
893 /// **Known problems:** https://github.com/Manishearth/rust-clippy/issues/886
897 /// let x : u8 = ...; (x as u32) > 300
900 pub INVALID_UPCAST_COMPARISONS,
902 "a comparison involving an upcast which is always true or false"
905 pub struct InvalidUpcastComparisons;
907 impl LintPass for InvalidUpcastComparisons {
908 fn get_lints(&self) -> LintArray {
909 lint_array!(INVALID_UPCAST_COMPARISONS)
913 #[derive(Copy, Clone, Debug, Eq)]
920 #[allow(cast_sign_loss)]
921 fn cmp_s_u(s: i64, u: u64) -> Ordering {
924 } else if u > (i64::max_value() as u64) {
932 impl PartialEq for FullInt {
933 fn eq(&self, other: &Self) -> bool {
934 self.partial_cmp(other).expect("partial_cmp only returns Some(_)") == Ordering::Equal
938 impl PartialOrd for FullInt {
939 fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
940 Some(match (self, other) {
941 (&FullInt::S(s), &FullInt::S(o)) => s.cmp(&o),
942 (&FullInt::U(s), &FullInt::U(o)) => s.cmp(&o),
943 (&FullInt::S(s), &FullInt::U(o)) => Self::cmp_s_u(s, o),
944 (&FullInt::U(s), &FullInt::S(o)) => Self::cmp_s_u(o, s).reverse(),
948 impl Ord for FullInt {
949 fn cmp(&self, other: &Self) -> Ordering {
950 self.partial_cmp(other).expect("partial_cmp for FullInt can never return None")
955 fn numeric_cast_precast_bounds<'a>(cx: &LateContext, expr: &'a Expr) -> Option<(FullInt, FullInt)> {
956 use rustc::ty::TypeVariants::{TyInt, TyUint};
957 use syntax::ast::{IntTy, UintTy};
960 if let ExprCast(ref cast_exp, _) = expr.node {
961 match cx.tcx.tables().expr_ty(cast_exp).sty {
964 IntTy::I8 => (FullInt::S(i8::min_value() as i64), FullInt::S(i8::max_value() as i64)),
965 IntTy::I16 => (FullInt::S(i16::min_value() as i64), FullInt::S(i16::max_value() as i64)),
966 IntTy::I32 => (FullInt::S(i32::min_value() as i64), FullInt::S(i32::max_value() as i64)),
967 IntTy::I64 => (FullInt::S(i64::min_value() as i64), FullInt::S(i64::max_value() as i64)),
968 IntTy::Is => (FullInt::S(isize::min_value() as i64), FullInt::S(isize::max_value() as i64)),
973 UintTy::U8 => (FullInt::U(u8::min_value() as u64), FullInt::U(u8::max_value() as u64)),
974 UintTy::U16 => (FullInt::U(u16::min_value() as u64), FullInt::U(u16::max_value() as u64)),
975 UintTy::U32 => (FullInt::U(u32::min_value() as u64), FullInt::U(u32::max_value() as u64)),
976 UintTy::U64 => (FullInt::U(u64::min_value() as u64), FullInt::U(u64::max_value() as u64)),
977 UintTy::Us => (FullInt::U(usize::min_value() as u64), FullInt::U(usize::max_value() as u64)),
987 fn node_as_const_fullint(cx: &LateContext, expr: &Expr) -> Option<FullInt> {
988 use rustc::middle::const_val::ConstVal::*;
989 use rustc_const_eval::EvalHint::ExprTypeChecked;
990 use rustc_const_eval::eval_const_expr_partial;
991 use rustc_const_math::ConstInt;
993 match eval_const_expr_partial(cx.tcx, expr, ExprTypeChecked, None) {
995 if let Integral(const_int) = val {
996 Some(match const_int.erase_type() {
997 ConstInt::InferSigned(x) => FullInt::S(x as i64),
998 ConstInt::Infer(x) => FullInt::U(x as u64),
1009 fn err_upcast_comparison(cx: &LateContext, span: &Span, expr: &Expr, always: bool) {
1010 if let ExprCast(ref cast_val, _) = expr.node {
1012 INVALID_UPCAST_COMPARISONS,
1015 "because of the numeric bounds on `{}` prior to casting, this expression is always {}",
1016 snippet(cx, cast_val.span, "the expression"),
1017 if always { "true" } else { "false" },
1022 fn upcast_comparison_bounds_err(cx: &LateContext, span: &Span, rel: comparisons::Rel,
1023 lhs_bounds: Option<(FullInt, FullInt)>, lhs: &Expr, rhs: &Expr, invert: bool) {
1024 use utils::comparisons::*;
1026 if let Some((lb, ub)) = lhs_bounds {
1027 if let Some(norm_rhs_val) = node_as_const_fullint(cx, rhs) {
1028 if rel == Rel::Eq || rel == Rel::Ne {
1029 if norm_rhs_val < lb || norm_rhs_val > ub {
1030 err_upcast_comparison(cx, span, lhs, rel == Rel::Ne);
1032 } else if match rel {
1047 Rel::Eq | Rel::Ne => unreachable!(),
1049 err_upcast_comparison(cx, span, lhs, true)
1050 } else if match rel {
1065 Rel::Eq | Rel::Ne => unreachable!(),
1067 err_upcast_comparison(cx, span, lhs, false)
1073 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for InvalidUpcastComparisons {
1074 fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, expr: &'tcx Expr) {
1075 if let ExprBinary(ref cmp, ref lhs, ref rhs) = expr.node {
1077 let normalized = comparisons::normalize_comparison(cmp.node, lhs, rhs);
1078 let (rel, normalized_lhs, normalized_rhs) = if let Some(val) = normalized {
1084 let lhs_bounds = numeric_cast_precast_bounds(cx, normalized_lhs);
1085 let rhs_bounds = numeric_cast_precast_bounds(cx, normalized_rhs);
1087 upcast_comparison_bounds_err(cx, &expr.span, rel, lhs_bounds, normalized_lhs, normalized_rhs, false);
1088 upcast_comparison_bounds_err(cx, &expr.span, rel, rhs_bounds, normalized_rhs, normalized_lhs, true);