rust/clippy_lints/src/precedence.rs

141 lines
5.2 KiB
Rust
Raw Normal View History

2019-08-19 11:30:32 -05:00
use crate::utils::{snippet_with_applicability, span_lint_and_sugg};
2020-01-11 05:37:08 -06:00
use rustc::lint::{EarlyContext, EarlyLintPass};
use rustc_errors::Applicability;
2020-01-11 05:37:08 -06:00
use rustc_session::{declare_lint_pass, declare_tool_lint};
use rustc_span::source_map::Spanned;
use syntax::ast::*;
2015-08-30 10:32:35 -05:00
2018-03-28 08:24:26 -05:00
declare_clippy_lint! {
/// **What it does:** Checks for operations where precedence may be unclear
/// and suggests to add parentheses. Currently it catches the following:
/// * mixed usage of arithmetic and bit shifting/combining operators without
/// parentheses
/// * a "negative" numeric literal (which is really a unary `-` followed by a
/// numeric literal)
/// followed by a method call
///
/// **Why is this bad?** Not everyone knows the precedence of those operators by
/// heart, so expressions like these may trip others trying to reason about the
/// code.
///
/// **Known problems:** None.
///
/// **Example:**
/// * `1 << 2 + 3` equals 32, while `(1 << 2) + 3` equals 7
/// * `-1i32.abs()` equals -1, while `(-1i32).abs()` equals 1
pub PRECEDENCE,
2018-03-28 08:24:26 -05:00
complexity,
"operations where precedence may be unclear"
}
2015-08-30 10:32:35 -05:00
2019-04-08 15:43:55 -05:00
declare_lint_pass!(Precedence => [PRECEDENCE]);
2015-08-30 10:32:35 -05:00
impl EarlyLintPass for Precedence {
2018-07-23 06:01:12 -05:00
fn check_expr(&mut self, cx: &EarlyContext<'_>, expr: &Expr) {
2019-08-19 11:30:32 -05:00
if expr.span.from_expansion() {
2018-01-16 08:52:16 -06:00
return;
}
2019-09-27 10:16:06 -05:00
if let ExprKind::Binary(Spanned { node: op, .. }, ref left, ref right) = expr.kind {
let span_sugg = |expr: &Expr, sugg, appl| {
2017-08-09 02:30:56 -05:00
span_lint_and_sugg(
cx,
PRECEDENCE,
expr.span,
"operator precedence can trip the unwary",
"consider parenthesizing your expression",
sugg,
appl,
2017-08-09 02:30:56 -05:00
);
2017-06-29 09:07:43 -05:00
};
2016-01-03 22:26:12 -06:00
if !is_bit_op(op) {
return;
}
let mut applicability = Applicability::MachineApplicable;
match (is_arith_expr(left), is_arith_expr(right)) {
2015-12-31 14:39:03 -06:00
(true, true) => {
2017-08-09 02:30:56 -05:00
let sugg = format!(
"({}) {} ({})",
snippet_with_applicability(cx, left.span, "..", &mut applicability),
2017-08-09 02:30:56 -05:00
op.to_string(),
snippet_with_applicability(cx, right.span, "..", &mut applicability)
2017-08-09 02:30:56 -05:00
);
span_sugg(expr, sugg, applicability);
2016-12-20 11:21:30 -06:00
},
2015-12-31 14:39:03 -06:00
(true, false) => {
2017-08-09 02:30:56 -05:00
let sugg = format!(
"({}) {} {}",
snippet_with_applicability(cx, left.span, "..", &mut applicability),
2017-08-09 02:30:56 -05:00
op.to_string(),
snippet_with_applicability(cx, right.span, "..", &mut applicability)
2017-08-09 02:30:56 -05:00
);
span_sugg(expr, sugg, applicability);
2016-12-20 11:21:30 -06:00
},
2015-12-31 14:39:03 -06:00
(false, true) => {
2017-08-09 02:30:56 -05:00
let sugg = format!(
"{} {} ({})",
snippet_with_applicability(cx, left.span, "..", &mut applicability),
2017-08-09 02:30:56 -05:00
op.to_string(),
snippet_with_applicability(cx, right.span, "..", &mut applicability)
2017-08-09 02:30:56 -05:00
);
span_sugg(expr, sugg, applicability);
2016-12-20 11:21:30 -06:00
},
(false, false) => (),
2015-08-30 10:32:35 -05:00
}
}
2019-09-27 10:16:06 -05:00
if let ExprKind::Unary(UnOp::Neg, ref rhs) = expr.kind {
if let ExprKind::MethodCall(_, ref args) = rhs.kind {
2015-08-30 10:32:35 -05:00
if let Some(slf) = args.first() {
2019-09-27 10:16:06 -05:00
if let ExprKind::Lit(ref lit) = slf.kind {
match lit.kind {
2019-11-07 06:27:00 -06:00
LitKind::Int(..) | LitKind::Float(..) => {
let mut applicability = Applicability::MachineApplicable;
2017-08-09 02:30:56 -05:00
span_lint_and_sugg(
cx,
PRECEDENCE,
expr.span,
"unary minus has lower precedence than method call",
"consider adding parentheses to clarify your intent",
2018-11-27 14:14:15 -06:00
format!(
"-({})",
snippet_with_applicability(cx, rhs.span, "..", &mut applicability)
),
applicability,
2017-08-09 02:30:56 -05:00
);
2016-12-20 11:21:30 -06:00
},
2016-01-03 22:26:12 -06:00
_ => (),
2015-08-30 10:32:35 -05:00
}
}
}
}
}
}
}
2015-11-16 23:22:57 -06:00
fn is_arith_expr(expr: &Expr) -> bool {
2019-09-27 10:16:06 -05:00
match expr.kind {
2016-04-14 13:14:03 -05:00
ExprKind::Binary(Spanned { node: op, .. }, _, _) => is_arith_op(op),
2016-01-03 22:26:12 -06:00
_ => false,
2015-08-30 10:32:35 -05:00
}
}
#[must_use]
2016-02-12 11:35:44 -06:00
fn is_bit_op(op: BinOpKind) -> bool {
use syntax::ast::BinOpKind::*;
2015-08-30 10:32:35 -05:00
match op {
2016-02-12 11:35:44 -06:00
BitXor | BitAnd | BitOr | Shl | Shr => true,
2016-01-03 22:26:12 -06:00
_ => false,
2015-08-30 10:32:35 -05:00
}
}
#[must_use]
2016-02-12 11:35:44 -06:00
fn is_arith_op(op: BinOpKind) -> bool {
use syntax::ast::BinOpKind::*;
2015-08-30 10:32:35 -05:00
match op {
2016-02-12 11:35:44 -06:00
Add | Sub | Mul | Div | Rem => true,
2016-01-03 22:26:12 -06:00
_ => false,
2015-08-30 10:32:35 -05:00
}
}