2016-03-16 11:38:26 +00:00
|
|
|
use consts::{constant_simple, Constant};
|
2015-05-15 16:46:43 +00:00
|
|
|
use rustc::lint::*;
|
2016-04-07 15:46:48 +00:00
|
|
|
use rustc::hir::*;
|
2015-05-15 16:46:43 +00:00
|
|
|
use syntax::codemap::Span;
|
2015-09-06 08:53:55 +00:00
|
|
|
use utils::{span_lint, snippet, in_macro};
|
2016-03-31 15:05:43 +00:00
|
|
|
use rustc_const_math::ConstInt;
|
2015-07-09 15:02:21 +00:00
|
|
|
|
2016-08-06 07:55:04 +00:00
|
|
|
/// **What it does:** Checks for identity operations, e.g. `x + 0`.
|
2015-12-11 00:22:27 +00:00
|
|
|
///
|
2016-08-06 07:55:04 +00:00
|
|
|
/// **Why is this bad?** This code can be removed without changing the
|
|
|
|
/// meaning. So it just obscures what's going on. Delete it mercilessly.
|
2015-12-11 00:22:27 +00:00
|
|
|
///
|
2016-08-06 07:55:04 +00:00
|
|
|
/// **Known problems:** None.
|
2015-12-11 00:22:27 +00:00
|
|
|
///
|
2016-07-15 22:25:44 +00:00
|
|
|
/// **Example:**
|
|
|
|
/// ```rust
|
|
|
|
/// x / 1 + 0 * 1 - 0 | 0
|
|
|
|
/// ```
|
2016-02-05 23:13:29 +00:00
|
|
|
declare_lint! {
|
2016-08-06 08:18:36 +00:00
|
|
|
pub IDENTITY_OP,
|
|
|
|
Warn,
|
2016-02-05 23:13:29 +00:00
|
|
|
"using identity operations, e.g. `x + 0` or `y / 1`"
|
|
|
|
}
|
2015-08-11 18:22:20 +00:00
|
|
|
|
2015-05-15 16:46:43 +00:00
|
|
|
#[derive(Copy,Clone)]
|
|
|
|
pub struct IdentityOp;
|
|
|
|
|
|
|
|
impl LintPass for IdentityOp {
|
|
|
|
fn get_lints(&self) -> LintArray {
|
|
|
|
lint_array!(IDENTITY_OP)
|
|
|
|
}
|
2015-09-19 02:53:04 +00:00
|
|
|
}
|
2015-05-22 22:49:13 +00:00
|
|
|
|
2016-12-07 12:13:40 +00:00
|
|
|
impl<'a, 'tcx> LateLintPass<'a, 'tcx> for IdentityOp {
|
|
|
|
fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, e: &'tcx Expr) {
|
2016-01-04 04:26:12 +00:00
|
|
|
if in_macro(cx, e.span) {
|
|
|
|
return;
|
|
|
|
}
|
2015-05-22 22:49:13 +00:00
|
|
|
if let ExprBinary(ref cmp, ref left, ref right) = e.node {
|
|
|
|
match cmp.node {
|
|
|
|
BiAdd | BiBitOr | BiBitXor => {
|
|
|
|
check(cx, left, 0, e.span, right.span);
|
|
|
|
check(cx, right, 0, e.span, left.span);
|
2016-12-20 17:21:30 +00:00
|
|
|
},
|
2016-01-04 04:26:12 +00:00
|
|
|
BiShl | BiShr | BiSub => check(cx, right, 0, e.span, left.span),
|
2015-05-22 22:49:13 +00:00
|
|
|
BiMul => {
|
|
|
|
check(cx, left, 1, e.span, right.span);
|
|
|
|
check(cx, right, 1, e.span, left.span);
|
2016-12-20 17:21:30 +00:00
|
|
|
},
|
2016-01-04 04:26:12 +00:00
|
|
|
BiDiv => check(cx, right, 1, e.span, left.span),
|
2015-05-22 22:49:13 +00:00
|
|
|
BiBitAnd => {
|
|
|
|
check(cx, left, -1, e.span, right.span);
|
|
|
|
check(cx, right, -1, e.span, left.span);
|
2016-12-20 17:21:30 +00:00
|
|
|
},
|
2016-01-04 04:26:12 +00:00
|
|
|
_ => (),
|
2015-05-22 22:49:13 +00:00
|
|
|
}
|
|
|
|
}
|
2015-05-15 16:46:43 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-09-19 02:53:04 +00:00
|
|
|
fn check(cx: &LateContext, e: &Expr, m: i8, span: Span, arg: Span) {
|
2016-03-16 15:28:31 +00:00
|
|
|
if let Some(v @ Constant::Int(_)) = constant_simple(e) {
|
2015-09-06 08:53:55 +00:00
|
|
|
if match m {
|
2017-03-01 12:24:19 +00:00
|
|
|
0 => v == Constant::Int(ConstInt::U8(0)),
|
|
|
|
-1 => v == Constant::Int(ConstInt::I8(-1)),
|
|
|
|
1 => v == Constant::Int(ConstInt::U8(1)),
|
2015-09-06 08:53:55 +00:00
|
|
|
_ => unreachable!(),
|
|
|
|
} {
|
2016-01-04 04:26:12 +00:00
|
|
|
span_lint(cx,
|
|
|
|
IDENTITY_OP,
|
|
|
|
span,
|
|
|
|
&format!("the operation is ineffective. Consider reducing it to `{}`",
|
|
|
|
snippet(cx, arg, "..")));
|
2015-08-16 21:09:56 +00:00
|
|
|
}
|
2015-05-22 22:49:13 +00:00
|
|
|
}
|
2015-05-15 16:46:43 +00:00
|
|
|
}
|