2016-04-07 15:46:48 +00:00
|
|
|
use rustc::hir::*;
|
2015-04-30 09:48:43 +00:00
|
|
|
use rustc::lint::*;
|
2017-04-10 13:10:19 +00:00
|
|
|
use utils::{SpanlessEq, span_lint, span_lint_and_then, multispan_sugg, snippet, implements_trait};
|
2017-03-09 09:56:17 +00:00
|
|
|
use utils::sugg::Sugg;
|
2015-04-30 09:48:43 +00:00
|
|
|
|
2016-08-06 07:55:04 +00:00
|
|
|
/// **What it does:** Checks for equal operands to comparison, logical and
|
|
|
|
/// bitwise, difference and division binary operators (`==`, `>`, etc., `&&`,
|
|
|
|
/// `||`, `&`, `|`, `^`, `-` and `/`).
|
2015-12-11 00:22:27 +00:00
|
|
|
///
|
2016-02-03 19:42:05 +00:00
|
|
|
/// **Why is this bad?** This is usually just a typo or a copy and paste error.
|
2015-12-11 00:22:27 +00:00
|
|
|
///
|
2016-08-06 07:55:04 +00:00
|
|
|
/// **Known problems:** False negatives: We had some false positives regarding
|
|
|
|
/// calls (notably [racer](https://github.com/phildawes/racer) had one instance
|
|
|
|
/// of `x.pop() && x.pop()`), so we removed matching any function or method
|
|
|
|
/// calls. We may introduce a whitelist of known pure functions in the future.
|
2015-12-11 00:22:27 +00:00
|
|
|
///
|
2016-07-15 22:25:44 +00:00
|
|
|
/// **Example:**
|
|
|
|
/// ```rust
|
|
|
|
/// x + 1 == x + 1
|
|
|
|
/// ```
|
2015-04-30 09:48:43 +00:00
|
|
|
declare_lint! {
|
|
|
|
pub EQ_OP,
|
|
|
|
Warn,
|
2015-08-13 08:32:35 +00:00
|
|
|
"equal operands on both sides of a comparison or bitwise combination (e.g. `x == x`)"
|
2015-04-30 09:48:43 +00:00
|
|
|
}
|
|
|
|
|
2017-03-09 09:56:17 +00:00
|
|
|
/// **What it does:** Checks for arguments to `==` which have their address taken to satisfy a bound
|
|
|
|
/// and suggests to dereference the other argument instead
|
|
|
|
///
|
|
|
|
/// **Why is this bad?** It is more idiomatic to dereference the other argument.
|
|
|
|
///
|
|
|
|
/// **Known problems:** None
|
|
|
|
///
|
|
|
|
/// **Example:**
|
|
|
|
/// ```rust
|
|
|
|
/// &x == y
|
|
|
|
/// ```
|
|
|
|
declare_lint! {
|
|
|
|
pub OP_REF,
|
|
|
|
Warn,
|
|
|
|
"taking a reference to satisfy the type constraints on `==`"
|
|
|
|
}
|
|
|
|
|
2015-04-30 09:48:43 +00:00
|
|
|
#[derive(Copy,Clone)]
|
|
|
|
pub struct EqOp;
|
|
|
|
|
|
|
|
impl LintPass for EqOp {
|
|
|
|
fn get_lints(&self) -> LintArray {
|
2017-03-09 09:56:17 +00:00
|
|
|
lint_array!(EQ_OP, OP_REF)
|
2015-04-30 09:48:43 +00:00
|
|
|
}
|
2015-09-19 02:53:04 +00:00
|
|
|
}
|
2015-08-11 18:22:20 +00:00
|
|
|
|
2016-12-07 12:13:40 +00:00
|
|
|
impl<'a, 'tcx> LateLintPass<'a, 'tcx> for EqOp {
|
|
|
|
fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, e: &'tcx Expr) {
|
2015-04-30 09:48:43 +00:00
|
|
|
if let ExprBinary(ref op, ref left, ref right) = e.node {
|
2017-03-09 09:56:17 +00:00
|
|
|
if is_valid_operator(op) {
|
|
|
|
if SpanlessEq::new(cx).ignore_fn().eq_expr(left, right) {
|
|
|
|
span_lint(cx,
|
2017-04-12 09:06:32 +00:00
|
|
|
EQ_OP,
|
|
|
|
e.span,
|
|
|
|
&format!("equal expressions as operands to `{}`", op.node.as_str()));
|
2017-03-09 09:56:17 +00:00
|
|
|
} else {
|
2017-04-10 13:10:19 +00:00
|
|
|
let trait_id = match op.node {
|
|
|
|
BiAdd => cx.tcx.lang_items.add_trait(),
|
|
|
|
BiSub => cx.tcx.lang_items.sub_trait(),
|
|
|
|
BiMul => cx.tcx.lang_items.mul_trait(),
|
|
|
|
BiDiv => cx.tcx.lang_items.div_trait(),
|
|
|
|
BiRem => cx.tcx.lang_items.rem_trait(),
|
2017-04-12 09:06:32 +00:00
|
|
|
BiAnd | BiOr => None,
|
2017-04-10 13:10:19 +00:00
|
|
|
BiBitXor => cx.tcx.lang_items.bitxor_trait(),
|
|
|
|
BiBitAnd => cx.tcx.lang_items.bitand_trait(),
|
|
|
|
BiBitOr => cx.tcx.lang_items.bitor_trait(),
|
|
|
|
BiShl => cx.tcx.lang_items.shl_trait(),
|
|
|
|
BiShr => cx.tcx.lang_items.shr_trait(),
|
2017-04-12 09:06:32 +00:00
|
|
|
BiNe | BiEq => cx.tcx.lang_items.eq_trait(),
|
|
|
|
BiLt | BiLe | BiGe | BiGt => cx.tcx.lang_items.ord_trait(),
|
2017-04-10 13:10:19 +00:00
|
|
|
};
|
|
|
|
if let Some(trait_id) = trait_id {
|
2017-04-10 13:14:54 +00:00
|
|
|
#[allow(match_same_arms)]
|
2017-04-10 13:10:19 +00:00
|
|
|
match (&left.node, &right.node) {
|
|
|
|
// do not suggest to dereference literals
|
|
|
|
(&ExprLit(..), _) |
|
|
|
|
(_, &ExprLit(..)) => {},
|
|
|
|
// &foo == &bar
|
|
|
|
(&ExprAddrOf(_, ref l), &ExprAddrOf(_, ref r)) => {
|
|
|
|
if implements_trait(cx, cx.tables.expr_ty(l), trait_id, &[cx.tables.expr_ty(r)], None) {
|
|
|
|
span_lint_and_then(cx,
|
2017-04-12 09:06:32 +00:00
|
|
|
OP_REF,
|
|
|
|
e.span,
|
|
|
|
"taken reference of both operands, which is done automatically \
|
|
|
|
by the operator anyway",
|
|
|
|
|db| {
|
|
|
|
let lsnip = snippet(cx, l.span, "...").to_string();
|
|
|
|
let rsnip = snippet(cx, r.span, "...").to_string();
|
|
|
|
multispan_sugg(db,
|
|
|
|
"use the values directly".to_string(),
|
|
|
|
vec![(left.span, lsnip),
|
2017-04-10 13:10:19 +00:00
|
|
|
(right.span, rsnip)]);
|
2017-04-12 09:06:32 +00:00
|
|
|
})
|
2017-03-09 09:56:17 +00:00
|
|
|
}
|
2017-04-12 09:06:32 +00:00
|
|
|
},
|
2017-04-10 13:10:19 +00:00
|
|
|
// &foo == bar
|
|
|
|
(&ExprAddrOf(_, ref l), _) => {
|
2017-04-12 09:06:32 +00:00
|
|
|
if implements_trait(cx,
|
|
|
|
cx.tables.expr_ty(l),
|
|
|
|
trait_id,
|
|
|
|
&[cx.tables.expr_ty(right)],
|
|
|
|
None) {
|
|
|
|
span_lint_and_then(cx, OP_REF, e.span, "taken reference of left operand", |db| {
|
|
|
|
let lsnip = snippet(cx, l.span, "...").to_string();
|
|
|
|
let rsnip = Sugg::hir(cx, right, "...").deref().to_string();
|
|
|
|
multispan_sugg(db,
|
|
|
|
"dereference the right operand instead".to_string(),
|
|
|
|
vec![(left.span, lsnip),
|
2017-04-10 13:10:19 +00:00
|
|
|
(right.span, rsnip)]);
|
2017-04-12 09:06:32 +00:00
|
|
|
})
|
2017-03-09 09:56:17 +00:00
|
|
|
}
|
2017-04-12 09:06:32 +00:00
|
|
|
},
|
2017-04-10 13:10:19 +00:00
|
|
|
// foo == &bar
|
|
|
|
(_, &ExprAddrOf(_, ref r)) => {
|
2017-04-12 09:06:32 +00:00
|
|
|
if implements_trait(cx,
|
|
|
|
cx.tables.expr_ty(left),
|
|
|
|
trait_id,
|
|
|
|
&[cx.tables.expr_ty(r)],
|
|
|
|
None) {
|
|
|
|
span_lint_and_then(cx, OP_REF, e.span, "taken reference of right operand", |db| {
|
|
|
|
let lsnip = Sugg::hir(cx, left, "...").deref().to_string();
|
|
|
|
let rsnip = snippet(cx, r.span, "...").to_string();
|
|
|
|
multispan_sugg(db,
|
|
|
|
"dereference the left operand instead".to_string(),
|
|
|
|
vec![(left.span, lsnip),
|
2017-04-10 13:10:19 +00:00
|
|
|
(right.span, rsnip)]);
|
2017-04-12 09:06:32 +00:00
|
|
|
})
|
2017-03-09 09:56:17 +00:00
|
|
|
}
|
2017-04-12 09:06:32 +00:00
|
|
|
},
|
|
|
|
_ => {},
|
2017-03-09 09:56:17 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2015-04-30 09:48:43 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2016-02-03 19:42:05 +00:00
|
|
|
fn is_valid_operator(op: &BinOp) -> bool {
|
2015-04-30 09:48:43 +00:00
|
|
|
match op.node {
|
2016-12-20 17:21:30 +00:00
|
|
|
BiSub | BiDiv | BiEq | BiLt | BiLe | BiGt | BiGe | BiNe | BiAnd | BiOr | BiBitXor | BiBitAnd | BiBitOr => true,
|
2016-01-04 04:26:12 +00:00
|
|
|
_ => false,
|
2015-04-30 09:48:43 +00:00
|
|
|
}
|
|
|
|
}
|