2018-05-30 03:15:50 -05:00
|
|
|
|
use crate::reexport::*;
|
2016-04-07 10:46:48 -05:00
|
|
|
|
use rustc::hir::*;
|
|
|
|
|
use rustc::hir::intravisit::FnKind;
|
2015-08-16 01:54:43 -05:00
|
|
|
|
use rustc::lint::*;
|
2016-03-27 13:59:02 -05:00
|
|
|
|
use rustc::ty;
|
2017-09-05 04:33:04 -05:00
|
|
|
|
use syntax::codemap::{ExpnFormat, Span};
|
2018-05-30 03:15:50 -05:00
|
|
|
|
use crate::utils::{get_item_name, get_parent_expr, implements_trait, in_constant, in_macro, is_integer_literal,
|
2017-09-05 04:33:04 -05:00
|
|
|
|
iter_input_pats, last_path_segment, match_qpath, match_trait_method, paths, snippet, span_lint,
|
|
|
|
|
span_lint_and_then, walk_ptrs_ty};
|
2018-05-30 03:15:50 -05:00
|
|
|
|
use crate::utils::sugg::Sugg;
|
2018-03-13 05:38:11 -05:00
|
|
|
|
use syntax::ast::{LitKind, CRATE_NODE_ID};
|
2018-05-30 03:15:50 -05:00
|
|
|
|
use crate::consts::{constant, Constant};
|
2015-05-06 03:01:49 -05:00
|
|
|
|
|
2017-08-09 02:30:56 -05:00
|
|
|
|
/// **What it does:** Checks for function arguments and let bindings denoted as
|
|
|
|
|
/// `ref`.
|
2015-12-10 18:22:27 -06:00
|
|
|
|
///
|
2016-08-06 02:55:04 -05:00
|
|
|
|
/// **Why is this bad?** The `ref` declaration makes the function take an owned
|
|
|
|
|
/// value, but turns the argument into a reference (which means that the value
|
|
|
|
|
/// is destroyed when exiting the function). This adds not much value: either
|
|
|
|
|
/// take a reference type, or take an owned value and create references in the
|
|
|
|
|
/// body.
|
2015-12-10 18:22:27 -06:00
|
|
|
|
///
|
2016-08-06 02:55:04 -05:00
|
|
|
|
/// For let bindings, `let x = &foo;` is preferred over `let ref x = foo`. The
|
|
|
|
|
/// type of `x` is more obvious with the former.
|
2015-12-10 18:22:27 -06:00
|
|
|
|
///
|
2016-08-06 02:55:04 -05:00
|
|
|
|
/// **Known problems:** If the argument is dereferenced within the function,
|
|
|
|
|
/// removing the `ref` will lead to errors. This can be fixed by removing the
|
|
|
|
|
/// dereferences, e.g. changing `*x` to `x` within the function.
|
2015-12-10 18:22:27 -06:00
|
|
|
|
///
|
2016-07-15 17:25:44 -05:00
|
|
|
|
/// **Example:**
|
|
|
|
|
/// ```rust
|
|
|
|
|
/// fn foo(ref x: u8) -> bool { .. }
|
|
|
|
|
/// ```
|
2018-03-28 08:24:26 -05:00
|
|
|
|
declare_clippy_lint! {
|
2016-08-06 03:18:36 -05:00
|
|
|
|
pub TOPLEVEL_REF_ARG,
|
2018-03-28 08:24:26 -05:00
|
|
|
|
style,
|
2016-08-06 03:18:36 -05:00
|
|
|
|
"an entire binding declared as `ref`, in a function argument or a `let` statement"
|
2016-02-05 17:13:29 -06:00
|
|
|
|
}
|
2014-12-24 17:15:22 -06:00
|
|
|
|
|
2016-08-24 14:47:46 -05:00
|
|
|
|
/// **What it does:** Checks for comparisons to NaN.
|
|
|
|
|
///
|
|
|
|
|
/// **Why is this bad?** NaN does not compare meaningfully to anything – not
|
|
|
|
|
/// even itself – so those comparisons are simply wrong.
|
|
|
|
|
///
|
|
|
|
|
/// **Known problems:** None.
|
|
|
|
|
///
|
|
|
|
|
/// **Example:**
|
|
|
|
|
/// ```rust
|
|
|
|
|
/// x == NAN
|
|
|
|
|
/// ```
|
2018-03-28 08:24:26 -05:00
|
|
|
|
declare_clippy_lint! {
|
2016-08-24 14:47:46 -05:00
|
|
|
|
pub CMP_NAN,
|
2018-03-28 08:24:26 -05:00
|
|
|
|
correctness,
|
2016-08-24 14:47:46 -05:00
|
|
|
|
"comparisons to NAN, which will always return false, probably not intended"
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// **What it does:** Checks for (in-)equality comparisons on floating-point
|
|
|
|
|
/// values (apart from zero), except in functions called `*eq*` (which probably
|
|
|
|
|
/// implement equality for a type involving floats).
|
|
|
|
|
///
|
|
|
|
|
/// **Why is this bad?** Floating point calculations are usually imprecise, so
|
|
|
|
|
/// asking if two values are *exactly* equal is asking for trouble. For a good
|
|
|
|
|
/// guide on what to do, see [the floating point
|
|
|
|
|
/// guide](http://www.floating-point-gui.de/errors/comparison).
|
|
|
|
|
///
|
|
|
|
|
/// **Known problems:** None.
|
|
|
|
|
///
|
|
|
|
|
/// **Example:**
|
|
|
|
|
/// ```rust
|
|
|
|
|
/// y == 1.23f64
|
|
|
|
|
/// y != x // where both are floats
|
|
|
|
|
/// ```
|
2018-03-28 08:24:26 -05:00
|
|
|
|
declare_clippy_lint! {
|
2016-08-24 14:47:46 -05:00
|
|
|
|
pub FLOAT_CMP,
|
2018-03-29 06:41:53 -05:00
|
|
|
|
correctness,
|
2016-08-24 14:47:46 -05:00
|
|
|
|
"using `==` or `!=` on float values instead of comparing difference with an epsilon"
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// **What it does:** Checks for conversions to owned values just for the sake
|
|
|
|
|
/// of a comparison.
|
|
|
|
|
///
|
|
|
|
|
/// **Why is this bad?** The comparison can operate on a reference, so creating
|
|
|
|
|
/// an owned value effectively throws it away directly afterwards, which is
|
|
|
|
|
/// needlessly consuming code and heap space.
|
|
|
|
|
///
|
|
|
|
|
/// **Known problems:** None.
|
|
|
|
|
///
|
|
|
|
|
/// **Example:**
|
|
|
|
|
/// ```rust
|
|
|
|
|
/// x.to_owned() == y
|
|
|
|
|
/// ```
|
2018-03-28 08:24:26 -05:00
|
|
|
|
declare_clippy_lint! {
|
2016-08-24 14:47:46 -05:00
|
|
|
|
pub CMP_OWNED,
|
2018-03-28 08:24:26 -05:00
|
|
|
|
perf,
|
2016-08-24 14:47:46 -05:00
|
|
|
|
"creating owned instances for comparing with others, e.g. `x == \"foo\".to_string()`"
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// **What it does:** Checks for getting the remainder of a division by one.
|
|
|
|
|
///
|
|
|
|
|
/// **Why is this bad?** The result can only ever be zero. No one will write
|
|
|
|
|
/// such code deliberately, unless trying to win an Underhanded Rust
|
|
|
|
|
/// Contest. Even for that contest, it's probably a bad idea. Use something more
|
|
|
|
|
/// underhanded.
|
|
|
|
|
///
|
|
|
|
|
/// **Known problems:** None.
|
|
|
|
|
///
|
|
|
|
|
/// **Example:**
|
|
|
|
|
/// ```rust
|
|
|
|
|
/// x % 1
|
|
|
|
|
/// ```
|
2018-03-28 08:24:26 -05:00
|
|
|
|
declare_clippy_lint! {
|
2016-08-24 14:47:46 -05:00
|
|
|
|
pub MODULO_ONE,
|
2018-03-28 08:24:26 -05:00
|
|
|
|
correctness,
|
2016-08-24 14:47:46 -05:00
|
|
|
|
"taking a number modulo 1, which always returns 0"
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// **What it does:** Checks for patterns in the form `name @ _`.
|
|
|
|
|
///
|
2017-08-09 02:30:56 -05:00
|
|
|
|
/// **Why is this bad?** It's almost always more readable to just use direct
|
|
|
|
|
/// bindings.
|
2016-08-24 14:47:46 -05:00
|
|
|
|
///
|
|
|
|
|
/// **Known problems:** None.
|
|
|
|
|
///
|
|
|
|
|
/// **Example:**
|
|
|
|
|
/// ```rust
|
|
|
|
|
/// match v {
|
|
|
|
|
/// Some(x) => (),
|
|
|
|
|
/// y @ _ => (), // easier written as `y`,
|
|
|
|
|
/// }
|
|
|
|
|
/// ```
|
2018-03-28 08:24:26 -05:00
|
|
|
|
declare_clippy_lint! {
|
2016-08-24 14:47:46 -05:00
|
|
|
|
pub REDUNDANT_PATTERN,
|
2018-03-28 08:24:26 -05:00
|
|
|
|
style,
|
2016-08-24 14:47:46 -05:00
|
|
|
|
"using `name @ _` in a pattern"
|
|
|
|
|
}
|
|
|
|
|
|
2017-08-09 02:30:56 -05:00
|
|
|
|
/// **What it does:** Checks for the use of bindings with a single leading
|
|
|
|
|
/// underscore.
|
2016-08-24 14:47:46 -05:00
|
|
|
|
///
|
|
|
|
|
/// **Why is this bad?** A single leading underscore is usually used to indicate
|
|
|
|
|
/// that a binding will not be used. Using such a binding breaks this
|
|
|
|
|
/// expectation.
|
|
|
|
|
///
|
|
|
|
|
/// **Known problems:** The lint does not work properly with desugaring and
|
|
|
|
|
/// macro, it has been allowed in the mean time.
|
|
|
|
|
///
|
|
|
|
|
/// **Example:**
|
|
|
|
|
/// ```rust
|
|
|
|
|
/// let _x = 0;
|
2017-08-09 02:30:56 -05:00
|
|
|
|
/// let y = _x + 1; // Here we are using `_x`, even though it has a leading
|
2018-01-20 16:32:02 -06:00
|
|
|
|
/// // underscore. We should rename `_x` to `x`
|
2016-08-24 14:47:46 -05:00
|
|
|
|
/// ```
|
2018-03-28 08:24:26 -05:00
|
|
|
|
declare_clippy_lint! {
|
2016-08-24 14:47:46 -05:00
|
|
|
|
pub USED_UNDERSCORE_BINDING,
|
2018-03-28 08:24:26 -05:00
|
|
|
|
pedantic,
|
2016-08-24 14:47:46 -05:00
|
|
|
|
"using a binding which is prefixed with an underscore"
|
|
|
|
|
}
|
|
|
|
|
|
2017-08-09 02:30:56 -05:00
|
|
|
|
/// **What it does:** Checks for the use of short circuit boolean conditions as
|
|
|
|
|
/// a
|
2016-12-29 17:00:55 -06:00
|
|
|
|
/// statement.
|
|
|
|
|
///
|
2017-08-09 02:30:56 -05:00
|
|
|
|
/// **Why is this bad?** Using a short circuit boolean condition as a statement
|
2018-01-20 16:32:02 -06:00
|
|
|
|
/// may hide the fact that the second part is executed or not depending on the
|
|
|
|
|
/// outcome of the first part.
|
2016-12-29 17:00:55 -06:00
|
|
|
|
///
|
|
|
|
|
/// **Known problems:** None.
|
|
|
|
|
///
|
|
|
|
|
/// **Example:**
|
|
|
|
|
/// ```rust
|
|
|
|
|
/// f() && g(); // We should write `if f() { g(); }`.
|
|
|
|
|
/// ```
|
2018-03-28 08:24:26 -05:00
|
|
|
|
declare_clippy_lint! {
|
2016-12-29 17:00:55 -06:00
|
|
|
|
pub SHORT_CIRCUIT_STATEMENT,
|
2018-03-28 08:24:26 -05:00
|
|
|
|
complexity,
|
2016-12-29 17:00:55 -06:00
|
|
|
|
"using a short circuit boolean condition as a statement"
|
|
|
|
|
}
|
|
|
|
|
|
2017-03-07 05:58:07 -06:00
|
|
|
|
/// **What it does:** Catch casts from `0` to some pointer type
|
|
|
|
|
///
|
|
|
|
|
/// **Why is this bad?** This generally means `null` and is better expressed as
|
|
|
|
|
/// {`std`, `core`}`::ptr::`{`null`, `null_mut`}.
|
|
|
|
|
///
|
|
|
|
|
/// **Known problems:** None.
|
|
|
|
|
///
|
|
|
|
|
/// **Example:**
|
|
|
|
|
///
|
|
|
|
|
/// ```rust
|
|
|
|
|
/// 0 as *const u32
|
|
|
|
|
/// ```
|
2018-03-28 08:24:26 -05:00
|
|
|
|
declare_clippy_lint! {
|
2017-03-07 05:58:07 -06:00
|
|
|
|
pub ZERO_PTR,
|
2018-03-28 08:24:26 -05:00
|
|
|
|
style,
|
2017-03-07 05:58:07 -06:00
|
|
|
|
"using 0 as *{const, mut} T"
|
|
|
|
|
}
|
|
|
|
|
|
2017-11-04 03:32:58 -05:00
|
|
|
|
/// **What it does:** Checks for (in-)equality comparisons on floating-point
|
|
|
|
|
/// value and constant, except in functions called `*eq*` (which probably
|
|
|
|
|
/// implement equality for a type involving floats).
|
|
|
|
|
///
|
|
|
|
|
/// **Why is this bad?** Floating point calculations are usually imprecise, so
|
|
|
|
|
/// asking if two values are *exactly* equal is asking for trouble. For a good
|
|
|
|
|
/// guide on what to do, see [the floating point
|
|
|
|
|
/// guide](http://www.floating-point-gui.de/errors/comparison).
|
|
|
|
|
///
|
|
|
|
|
/// **Known problems:** None.
|
|
|
|
|
///
|
|
|
|
|
/// **Example:**
|
|
|
|
|
/// ```rust
|
|
|
|
|
/// const ONE == 1.00f64
|
|
|
|
|
/// x == ONE // where both are floats
|
|
|
|
|
/// ```
|
2018-03-28 08:24:26 -05:00
|
|
|
|
declare_clippy_lint! {
|
2017-11-04 03:32:58 -05:00
|
|
|
|
pub FLOAT_CMP_CONST,
|
2018-03-28 08:24:26 -05:00
|
|
|
|
restriction,
|
2017-11-04 03:32:58 -05:00
|
|
|
|
"using `==` or `!=` on float constants instead of comparing difference with an epsilon"
|
|
|
|
|
}
|
|
|
|
|
|
2016-08-24 14:47:46 -05:00
|
|
|
|
#[derive(Copy, Clone)]
|
|
|
|
|
pub struct Pass;
|
2014-12-24 17:15:22 -06:00
|
|
|
|
|
2016-08-24 14:47:46 -05:00
|
|
|
|
impl LintPass for Pass {
|
2014-12-24 17:15:22 -06:00
|
|
|
|
fn get_lints(&self) -> LintArray {
|
2017-08-09 02:30:56 -05:00
|
|
|
|
lint_array!(
|
|
|
|
|
TOPLEVEL_REF_ARG,
|
|
|
|
|
CMP_NAN,
|
|
|
|
|
FLOAT_CMP,
|
|
|
|
|
CMP_OWNED,
|
|
|
|
|
MODULO_ONE,
|
|
|
|
|
REDUNDANT_PATTERN,
|
|
|
|
|
USED_UNDERSCORE_BINDING,
|
|
|
|
|
SHORT_CIRCUIT_STATEMENT,
|
2017-11-04 03:32:58 -05:00
|
|
|
|
ZERO_PTR,
|
|
|
|
|
FLOAT_CMP_CONST
|
2017-08-09 02:30:56 -05:00
|
|
|
|
)
|
2014-12-24 17:15:22 -06:00
|
|
|
|
}
|
2015-09-18 21:53:04 -05:00
|
|
|
|
}
|
2014-12-24 17:15:22 -06:00
|
|
|
|
|
2016-12-07 06:13:40 -06:00
|
|
|
|
impl<'a, 'tcx> LateLintPass<'a, 'tcx> for Pass {
|
2016-12-21 05:14:54 -06:00
|
|
|
|
fn check_fn(
|
|
|
|
|
&mut self,
|
|
|
|
|
cx: &LateContext<'a, 'tcx>,
|
|
|
|
|
k: FnKind<'tcx>,
|
|
|
|
|
decl: &'tcx FnDecl,
|
2017-01-04 15:46:41 -06:00
|
|
|
|
body: &'tcx Body,
|
2016-12-21 05:14:54 -06:00
|
|
|
|
_: Span,
|
2017-08-09 02:30:56 -05:00
|
|
|
|
_: NodeId,
|
2016-12-21 05:14:54 -06:00
|
|
|
|
) {
|
2016-03-23 10:11:24 -05:00
|
|
|
|
if let FnKind::Closure(_) = k {
|
2015-08-16 06:54:03 -05:00
|
|
|
|
// Does not apply to closures
|
2016-01-03 22:26:12 -06:00
|
|
|
|
return;
|
2015-08-16 06:54:03 -05:00
|
|
|
|
}
|
2017-01-04 15:46:41 -06:00
|
|
|
|
for arg in iter_input_pats(decl, body) {
|
2017-08-01 02:11:05 -05:00
|
|
|
|
match arg.pat.node {
|
2017-08-01 03:19:49 -05:00
|
|
|
|
PatKind::Binding(BindingAnnotation::Ref, _, _, _) |
|
|
|
|
|
PatKind::Binding(BindingAnnotation::RefMut, _, _, _) => {
|
2017-08-09 02:30:56 -05:00
|
|
|
|
span_lint(
|
|
|
|
|
cx,
|
|
|
|
|
TOPLEVEL_REF_ARG,
|
|
|
|
|
arg.pat.span,
|
|
|
|
|
"`ref` directly on a function argument is ignored. Consider using a reference type \
|
2017-09-05 04:33:04 -05:00
|
|
|
|
instead.",
|
2017-08-09 02:30:56 -05:00
|
|
|
|
);
|
2017-08-01 02:11:05 -05:00
|
|
|
|
},
|
2017-08-01 03:19:49 -05:00
|
|
|
|
_ => {},
|
2014-12-24 17:15:22 -06:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2016-08-24 14:47:46 -05:00
|
|
|
|
|
2016-12-07 06:13:40 -06:00
|
|
|
|
fn check_stmt(&mut self, cx: &LateContext<'a, 'tcx>, s: &'tcx Stmt) {
|
2017-10-23 14:18:02 -05:00
|
|
|
|
if_chain! {
|
|
|
|
|
if let StmtDecl(ref d, _) = s.node;
|
|
|
|
|
if let DeclLocal(ref l) = d.node;
|
|
|
|
|
if let PatKind::Binding(an, _, i, None) = l.pat.node;
|
|
|
|
|
if let Some(ref init) = l.init;
|
|
|
|
|
then {
|
|
|
|
|
if an == BindingAnnotation::Ref || an == BindingAnnotation::RefMut {
|
|
|
|
|
let init = Sugg::hir(cx, init, "..");
|
|
|
|
|
let (mutopt,initref) = if an == BindingAnnotation::RefMut {
|
|
|
|
|
("mut ", init.mut_addr())
|
|
|
|
|
} else {
|
|
|
|
|
("", init.addr())
|
|
|
|
|
};
|
|
|
|
|
let tyopt = if let Some(ref ty) = l.ty {
|
|
|
|
|
format!(": &{mutopt}{ty}", mutopt=mutopt, ty=snippet(cx, ty.span, "_"))
|
|
|
|
|
} else {
|
|
|
|
|
"".to_owned()
|
|
|
|
|
};
|
|
|
|
|
span_lint_and_then(cx,
|
|
|
|
|
TOPLEVEL_REF_ARG,
|
|
|
|
|
l.pat.span,
|
|
|
|
|
"`ref` on an entire `let` pattern is discouraged, take a reference with `&` instead",
|
|
|
|
|
|db| {
|
|
|
|
|
db.span_suggestion(s.span,
|
|
|
|
|
"try",
|
|
|
|
|
format!("let {name}{tyopt} = {initref};",
|
|
|
|
|
name=snippet(cx, i.span, "_"),
|
|
|
|
|
tyopt=tyopt,
|
|
|
|
|
initref=initref));
|
|
|
|
|
}
|
|
|
|
|
);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
if_chain! {
|
|
|
|
|
if let StmtSemi(ref expr, _) = s.node;
|
|
|
|
|
if let Expr_::ExprBinary(ref binop, ref a, ref b) = expr.node;
|
|
|
|
|
if binop.node == BiAnd || binop.node == BiOr;
|
|
|
|
|
if let Some(sugg) = Sugg::hir_opt(cx, a);
|
|
|
|
|
then {
|
2017-08-01 02:11:05 -05:00
|
|
|
|
span_lint_and_then(cx,
|
2017-10-23 14:18:02 -05:00
|
|
|
|
SHORT_CIRCUIT_STATEMENT,
|
|
|
|
|
s.span,
|
|
|
|
|
"boolean short circuit operator in statement may be clearer using an explicit test",
|
2017-08-01 02:11:05 -05:00
|
|
|
|
|db| {
|
2017-10-23 14:18:02 -05:00
|
|
|
|
let sugg = if binop.node == BiOr { !sugg } else { sugg };
|
|
|
|
|
db.span_suggestion(s.span, "replace it with",
|
|
|
|
|
format!("if {} {{ {}; }}", sugg, &snippet(cx, b.span, "..")));
|
|
|
|
|
});
|
2017-08-01 02:11:05 -05:00
|
|
|
|
}
|
2017-10-23 14:18:02 -05:00
|
|
|
|
};
|
2015-09-22 02:08:42 -05:00
|
|
|
|
}
|
2015-05-04 07:11:15 -05:00
|
|
|
|
|
2016-12-07 06:13:40 -06:00
|
|
|
|
fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, expr: &'tcx Expr) {
|
2017-03-07 05:58:07 -06:00
|
|
|
|
match expr.node {
|
|
|
|
|
ExprCast(ref e, ref ty) => {
|
|
|
|
|
check_cast(cx, expr.span, e, ty);
|
|
|
|
|
return;
|
|
|
|
|
},
|
|
|
|
|
ExprBinary(ref cmp, ref left, ref right) => {
|
|
|
|
|
let op = cmp.node;
|
|
|
|
|
if op.is_comparison() {
|
|
|
|
|
if let ExprPath(QPath::Resolved(_, ref path)) = left.node {
|
|
|
|
|
check_nan(cx, path, expr);
|
|
|
|
|
}
|
|
|
|
|
if let ExprPath(QPath::Resolved(_, ref path)) = right.node {
|
|
|
|
|
check_nan(cx, path, expr);
|
|
|
|
|
}
|
2017-05-11 11:59:36 -05:00
|
|
|
|
check_to_owned(cx, left, right);
|
|
|
|
|
check_to_owned(cx, right, left);
|
2016-01-03 22:26:12 -06:00
|
|
|
|
}
|
2017-03-07 05:58:07 -06:00
|
|
|
|
if (op == BiEq || op == BiNe) && (is_float(cx, left) || is_float(cx, right)) {
|
|
|
|
|
if is_allowed(cx, left) || is_allowed(cx, right) {
|
2015-09-06 14:03:09 -05:00
|
|
|
|
return;
|
|
|
|
|
}
|
2017-03-07 05:58:07 -06:00
|
|
|
|
if let Some(name) = get_item_name(cx, expr) {
|
2017-03-30 03:21:13 -05:00
|
|
|
|
let name = name.as_str();
|
2017-11-04 14:55:56 -05:00
|
|
|
|
if name == "eq" || name == "ne" || name == "is_nan" || name.starts_with("eq_")
|
|
|
|
|
|| name.ends_with("_eq")
|
2017-08-09 02:30:56 -05:00
|
|
|
|
{
|
2017-03-07 05:58:07 -06:00
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
}
|
2017-11-04 03:32:58 -05:00
|
|
|
|
let (lint, msg) = if is_named_constant(cx, left) || is_named_constant(cx, right) {
|
|
|
|
|
(FLOAT_CMP_CONST, "strict comparison of f32 or f64 constant")
|
|
|
|
|
} else {
|
|
|
|
|
(FLOAT_CMP, "strict comparison of f32 or f64")
|
|
|
|
|
};
|
|
|
|
|
span_lint_and_then(cx, lint, expr.span, msg, |db| {
|
2017-03-07 05:58:07 -06:00
|
|
|
|
let lhs = Sugg::hir(cx, left, "..");
|
|
|
|
|
let rhs = Sugg::hir(cx, right, "..");
|
|
|
|
|
|
2017-08-09 02:30:56 -05:00
|
|
|
|
db.span_suggestion(
|
|
|
|
|
expr.span,
|
|
|
|
|
"consider comparing them within some error",
|
|
|
|
|
format!("({}).abs() < error", lhs - rhs),
|
|
|
|
|
);
|
2017-03-07 05:58:07 -06:00
|
|
|
|
db.span_note(expr.span, "std::f32::EPSILON and std::f64::EPSILON are available.");
|
|
|
|
|
});
|
|
|
|
|
} else if op == BiRem && is_integer_literal(right, 1) {
|
|
|
|
|
span_lint(cx, MODULO_ONE, expr.span, "any number modulo 1 will be 0");
|
2015-09-02 03:30:11 -05:00
|
|
|
|
}
|
2017-03-07 05:58:07 -06:00
|
|
|
|
},
|
2017-03-13 05:32:58 -05:00
|
|
|
|
_ => {},
|
2016-08-24 14:47:46 -05:00
|
|
|
|
}
|
2017-03-31 17:14:04 -05:00
|
|
|
|
if in_attributes_expansion(expr) {
|
2016-08-24 14:47:46 -05:00
|
|
|
|
// Don't lint things expanded by #[derive(...)], etc
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
let binding = match expr.node {
|
2016-12-01 15:31:56 -06:00
|
|
|
|
ExprPath(ref qpath) => {
|
2016-12-02 10:38:31 -06:00
|
|
|
|
let binding = last_path_segment(qpath).name.as_str();
|
|
|
|
|
if binding.starts_with('_') &&
|
|
|
|
|
!binding.starts_with("__") &&
|
2017-03-09 03:58:31 -06:00
|
|
|
|
binding != "_result" && // FIXME: #944
|
2016-12-02 10:38:31 -06:00
|
|
|
|
is_used(cx, expr) &&
|
|
|
|
|
// don't lint if the declaration is in a macro
|
2017-08-15 04:10:49 -05:00
|
|
|
|
non_macro_local(cx, &cx.tables.qpath_def(qpath, expr.hir_id))
|
2017-08-09 02:30:56 -05:00
|
|
|
|
{
|
2016-12-02 10:38:31 -06:00
|
|
|
|
Some(binding)
|
2016-08-24 14:47:46 -05:00
|
|
|
|
} else {
|
|
|
|
|
None
|
|
|
|
|
}
|
2016-12-20 11:21:30 -06:00
|
|
|
|
},
|
2018-05-29 03:56:58 -05:00
|
|
|
|
ExprField(_, ident) => {
|
|
|
|
|
let name = ident.as_str();
|
2016-08-24 14:47:46 -05:00
|
|
|
|
if name.starts_with('_') && !name.starts_with("__") {
|
|
|
|
|
Some(name)
|
|
|
|
|
} else {
|
|
|
|
|
None
|
|
|
|
|
}
|
2016-12-20 11:21:30 -06:00
|
|
|
|
},
|
2016-08-24 14:47:46 -05:00
|
|
|
|
_ => None,
|
|
|
|
|
};
|
|
|
|
|
if let Some(binding) = binding {
|
2017-08-09 02:30:56 -05:00
|
|
|
|
span_lint(
|
|
|
|
|
cx,
|
|
|
|
|
USED_UNDERSCORE_BINDING,
|
|
|
|
|
expr.span,
|
|
|
|
|
&format!(
|
|
|
|
|
"used binding `{}` which is prefixed with an underscore. A leading \
|
2017-09-05 04:33:04 -05:00
|
|
|
|
underscore signals that a binding will not be used.",
|
2017-08-09 02:30:56 -05:00
|
|
|
|
binding
|
|
|
|
|
),
|
|
|
|
|
);
|
2016-08-24 14:47:46 -05:00
|
|
|
|
}
|
|
|
|
|
}
|
2016-06-29 14:25:23 -05:00
|
|
|
|
|
2016-12-07 06:13:40 -06:00
|
|
|
|
fn check_pat(&mut self, cx: &LateContext<'a, 'tcx>, pat: &'tcx Pat) {
|
2016-12-01 15:31:56 -06:00
|
|
|
|
if let PatKind::Binding(_, _, ref ident, Some(ref right)) = pat.node {
|
2016-08-24 14:47:46 -05:00
|
|
|
|
if right.node == PatKind::Wild {
|
2017-08-09 02:30:56 -05:00
|
|
|
|
span_lint(
|
|
|
|
|
cx,
|
|
|
|
|
REDUNDANT_PATTERN,
|
|
|
|
|
pat.span,
|
|
|
|
|
&format!("the `{} @ _` pattern can be written as just `{}`", ident.node, ident.node),
|
|
|
|
|
);
|
2015-08-11 08:07:21 -05:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2015-05-06 03:01:49 -05:00
|
|
|
|
}
|
|
|
|
|
|
2017-03-07 05:58:07 -06:00
|
|
|
|
fn check_nan(cx: &LateContext, path: &Path, expr: &Expr) {
|
|
|
|
|
if !in_constant(cx, expr.id) {
|
2017-01-22 19:57:17 -06:00
|
|
|
|
if let Some(seg) = path.segments.last() {
|
2018-04-08 03:41:51 -05:00
|
|
|
|
if seg.name == "NAN" {
|
|
|
|
|
span_lint(
|
|
|
|
|
cx,
|
|
|
|
|
CMP_NAN,
|
|
|
|
|
expr.span,
|
|
|
|
|
"doomed comparison with NAN, use `std::{f32,f64}::is_nan()` instead",
|
2017-01-22 19:57:17 -06:00
|
|
|
|
);
|
2018-04-08 03:41:51 -05:00
|
|
|
|
}
|
2017-01-22 19:57:17 -06:00
|
|
|
|
}
|
2017-03-07 05:58:07 -06:00
|
|
|
|
}
|
2016-08-24 14:47:46 -05:00
|
|
|
|
}
|
|
|
|
|
|
2017-11-04 03:32:58 -05:00
|
|
|
|
fn is_named_constant<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, expr: &'tcx Expr) -> bool {
|
2018-05-13 06:16:31 -05:00
|
|
|
|
if let Some((_, res)) = constant(cx, cx.tables, expr) {
|
2017-11-04 03:32:58 -05:00
|
|
|
|
res
|
|
|
|
|
} else {
|
|
|
|
|
false
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2017-09-13 08:34:04 -05:00
|
|
|
|
fn is_allowed<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, expr: &'tcx Expr) -> bool {
|
2018-05-13 06:16:31 -05:00
|
|
|
|
match constant(cx, cx.tables, expr) {
|
2018-03-13 05:38:11 -05:00
|
|
|
|
Some((Constant::F32(f), _)) => f == 0.0 || f.is_infinite(),
|
|
|
|
|
Some((Constant::F64(f), _)) => f == 0.0 || f.is_infinite(),
|
|
|
|
|
_ => false,
|
2016-01-03 22:26:12 -06:00
|
|
|
|
}
|
2015-11-10 04:19:33 -06:00
|
|
|
|
}
|
|
|
|
|
|
2015-09-18 21:53:04 -05:00
|
|
|
|
fn is_float(cx: &LateContext, expr: &Expr) -> bool {
|
2017-01-13 10:04:56 -06:00
|
|
|
|
matches!(walk_ptrs_ty(cx.tables.expr_ty(expr)).sty, ty::TyFloat(_))
|
2015-05-06 03:01:49 -05:00
|
|
|
|
}
|
2015-05-06 05:59:08 -05:00
|
|
|
|
|
2017-05-11 11:59:36 -05:00
|
|
|
|
fn check_to_owned(cx: &LateContext, expr: &Expr, other: &Expr) {
|
2016-01-18 08:35:50 -06:00
|
|
|
|
let (arg_ty, snip) = match expr.node {
|
2017-05-11 11:59:36 -05:00
|
|
|
|
ExprMethodCall(.., ref args) if args.len() == 1 => {
|
|
|
|
|
if match_trait_method(cx, expr, &paths::TO_STRING) || match_trait_method(cx, expr, &paths::TO_OWNED) {
|
|
|
|
|
(cx.tables.expr_ty_adjusted(&args[0]), snippet(cx, args[0].span, ".."))
|
2016-01-03 22:26:12 -06:00
|
|
|
|
} else {
|
|
|
|
|
return;
|
|
|
|
|
}
|
2016-12-20 11:21:30 -06:00
|
|
|
|
},
|
2017-09-05 04:33:04 -05:00
|
|
|
|
ExprCall(ref path, ref v) if v.len() == 1 => if let ExprPath(ref path) = path.node {
|
|
|
|
|
if match_qpath(path, &["String", "from_str"]) || match_qpath(path, &["String", "from"]) {
|
|
|
|
|
(cx.tables.expr_ty_adjusted(&v[0]), snippet(cx, v[0].span, ".."))
|
2015-10-12 17:46:05 -05:00
|
|
|
|
} else {
|
2016-01-03 22:26:12 -06:00
|
|
|
|
return;
|
2015-08-11 10:02:04 -05:00
|
|
|
|
}
|
2017-09-05 04:33:04 -05:00
|
|
|
|
} else {
|
|
|
|
|
return;
|
2016-12-20 11:21:30 -06:00
|
|
|
|
},
|
2016-01-03 22:26:12 -06:00
|
|
|
|
_ => return,
|
2015-10-12 17:46:05 -05:00
|
|
|
|
};
|
2016-01-18 08:35:50 -06:00
|
|
|
|
|
2017-05-11 11:59:36 -05:00
|
|
|
|
let other_ty = cx.tables.expr_ty_adjusted(other);
|
2017-09-09 00:23:08 -05:00
|
|
|
|
let partial_eq_trait_id = match cx.tcx.lang_items().eq_trait() {
|
2016-01-18 08:35:50 -06:00
|
|
|
|
Some(id) => id,
|
|
|
|
|
None => return,
|
|
|
|
|
};
|
|
|
|
|
|
2017-05-11 11:59:36 -05:00
|
|
|
|
// *arg impls PartialEq<other>
|
|
|
|
|
if !arg_ty
|
2018-01-29 19:35:22 -06:00
|
|
|
|
.builtin_deref(true)
|
2018-05-22 08:45:14 -05:00
|
|
|
|
.map_or(false, |tam| implements_trait(cx, tam.ty, partial_eq_trait_id, &[other_ty.into()]))
|
2017-05-11 11:59:36 -05:00
|
|
|
|
// arg impls PartialEq<*other>
|
|
|
|
|
&& !other_ty
|
2018-01-29 19:35:22 -06:00
|
|
|
|
.builtin_deref(true)
|
2018-05-22 08:45:14 -05:00
|
|
|
|
.map_or(false, |tam| implements_trait(cx, arg_ty, partial_eq_trait_id, &[tam.ty.into()]))
|
2017-05-11 11:59:36 -05:00
|
|
|
|
// arg impls PartialEq<other>
|
2018-05-22 08:45:14 -05:00
|
|
|
|
&& !implements_trait(cx, arg_ty, partial_eq_trait_id, &[other_ty.into()])
|
2017-08-09 02:30:56 -05:00
|
|
|
|
{
|
2016-01-18 08:35:50 -06:00
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
2017-08-09 02:30:56 -05:00
|
|
|
|
span_lint_and_then(
|
|
|
|
|
cx,
|
|
|
|
|
CMP_OWNED,
|
|
|
|
|
expr.span,
|
|
|
|
|
"this creates an owned instance just for comparison",
|
|
|
|
|
|db| {
|
|
|
|
|
// this is as good as our recursion check can get, we can't prove that the
|
|
|
|
|
// current function is
|
|
|
|
|
// called by
|
|
|
|
|
// PartialEq::eq, but we can at least ensure that this code is not part of it
|
|
|
|
|
let parent_fn = cx.tcx.hir.get_parent(expr.id);
|
|
|
|
|
let parent_impl = cx.tcx.hir.get_parent(parent_fn);
|
|
|
|
|
if parent_impl != CRATE_NODE_ID {
|
|
|
|
|
if let map::NodeItem(item) = cx.tcx.hir.get(parent_impl) {
|
|
|
|
|
if let ItemImpl(.., Some(ref trait_ref), _, _) = item.node {
|
|
|
|
|
if trait_ref.path.def.def_id() == partial_eq_trait_id {
|
|
|
|
|
// we are implementing PartialEq, don't suggest not doing `to_owned`, otherwise
|
|
|
|
|
// we go into
|
|
|
|
|
// recursion
|
|
|
|
|
db.span_label(expr.span, "try calling implementing the comparison without allocating");
|
|
|
|
|
return;
|
|
|
|
|
}
|
2017-05-11 11:59:36 -05:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2017-08-09 02:30:56 -05:00
|
|
|
|
db.span_suggestion(expr.span, "try", snip.to_string());
|
|
|
|
|
},
|
|
|
|
|
);
|
2015-05-21 09:37:38 -05:00
|
|
|
|
}
|
2015-08-11 11:55:07 -05:00
|
|
|
|
|
2017-08-09 02:30:56 -05:00
|
|
|
|
/// Heuristic to see if an expression is used. Should be compatible with
|
|
|
|
|
/// `unused_variables`'s idea
|
2015-12-21 03:03:12 -06:00
|
|
|
|
/// of what it means for an expression to be "used".
|
2015-12-18 18:04:33 -06:00
|
|
|
|
fn is_used(cx: &LateContext, expr: &Expr) -> bool {
|
2016-08-01 09:59:14 -05:00
|
|
|
|
if let Some(parent) = get_parent_expr(cx, expr) {
|
2015-12-18 18:04:33 -06:00
|
|
|
|
match parent.node {
|
2017-09-05 04:33:04 -05:00
|
|
|
|
ExprAssign(_, ref rhs) | ExprAssignOp(_, _, ref rhs) => **rhs == *expr,
|
2016-04-26 10:05:39 -05:00
|
|
|
|
_ => is_used(cx, parent),
|
2015-12-18 18:04:33 -06:00
|
|
|
|
}
|
2016-01-03 22:26:12 -06:00
|
|
|
|
} else {
|
2015-12-18 18:04:33 -06:00
|
|
|
|
true
|
|
|
|
|
}
|
|
|
|
|
}
|
2015-12-21 03:03:12 -06:00
|
|
|
|
|
2017-08-09 02:30:56 -05:00
|
|
|
|
/// Test whether an expression is in a macro expansion (e.g. something
|
|
|
|
|
/// generated by
|
2016-05-19 16:14:34 -05:00
|
|
|
|
/// `#[derive(...)`] or the like).
|
2017-03-31 17:14:04 -05:00
|
|
|
|
fn in_attributes_expansion(expr: &Expr) -> bool {
|
2017-09-05 04:33:04 -05:00
|
|
|
|
expr.span
|
|
|
|
|
.ctxt()
|
|
|
|
|
.outer()
|
|
|
|
|
.expn_info()
|
|
|
|
|
.map_or(false, |info| matches!(info.callee.format, ExpnFormat::MacroAttribute(_)))
|
2015-12-21 03:03:12 -06:00
|
|
|
|
}
|
2016-06-15 09:27:56 -05:00
|
|
|
|
|
|
|
|
|
/// Test whether `def` is a variable defined outside a macro.
|
|
|
|
|
fn non_macro_local(cx: &LateContext, def: &def::Def) -> bool {
|
|
|
|
|
match *def {
|
2017-11-04 14:55:56 -05:00
|
|
|
|
def::Def::Local(id) | def::Def::Upvar(id, _, _) => !in_macro(cx.tcx.hir.span(id)),
|
2016-06-15 09:27:56 -05:00
|
|
|
|
_ => false,
|
|
|
|
|
}
|
|
|
|
|
}
|
2017-03-07 05:58:07 -06:00
|
|
|
|
|
|
|
|
|
fn check_cast(cx: &LateContext, span: Span, e: &Expr, ty: &Ty) {
|
2017-10-23 14:18:02 -05:00
|
|
|
|
if_chain! {
|
|
|
|
|
if let TyPtr(MutTy { mutbl, .. }) = ty.node;
|
|
|
|
|
if let ExprLit(ref lit) = e.node;
|
|
|
|
|
if let LitKind::Int(value, ..) = lit.node;
|
|
|
|
|
if value == 0;
|
|
|
|
|
if !in_constant(cx, e.id);
|
|
|
|
|
then {
|
|
|
|
|
let msg = match mutbl {
|
|
|
|
|
Mutability::MutMutable => "`0 as *mut _` detected. Consider using `ptr::null_mut()`",
|
|
|
|
|
Mutability::MutImmutable => "`0 as *const _` detected. Consider using `ptr::null()`",
|
|
|
|
|
};
|
|
|
|
|
span_lint(cx, ZERO_PTR, span, msg);
|
|
|
|
|
}
|
|
|
|
|
}
|
2017-03-07 05:58:07 -06:00
|
|
|
|
}
|