2015-08-30 15:32:35 +00:00
|
|
|
use rustc::lint::*;
|
|
|
|
use syntax::codemap::Spanned;
|
2015-09-19 02:53:04 +00:00
|
|
|
use syntax::ast::*;
|
2015-10-13 11:48:48 +00:00
|
|
|
use syntax::ast_util::binop_to_string;
|
|
|
|
|
|
|
|
use utils::{span_lint, snippet};
|
2015-08-30 15:32:35 +00:00
|
|
|
|
|
|
|
declare_lint!(pub PRECEDENCE, Warn,
|
|
|
|
"catches operations where precedence may be unclear. See the wiki for a \
|
|
|
|
list of cases caught");
|
|
|
|
|
|
|
|
#[derive(Copy,Clone)]
|
|
|
|
pub struct Precedence;
|
|
|
|
|
|
|
|
impl LintPass for Precedence {
|
|
|
|
fn get_lints(&self) -> LintArray {
|
|
|
|
lint_array!(PRECEDENCE)
|
|
|
|
}
|
2015-09-19 02:53:04 +00:00
|
|
|
}
|
2015-08-30 15:32:35 +00:00
|
|
|
|
2015-09-19 02:53:04 +00:00
|
|
|
impl EarlyLintPass for Precedence {
|
|
|
|
fn check_expr(&mut self, cx: &EarlyContext, expr: &Expr) {
|
2015-08-30 15:32:35 +00:00
|
|
|
if let ExprBinary(Spanned { node: op, ..}, ref left, ref right) = expr.node {
|
2015-10-13 11:48:48 +00:00
|
|
|
if !is_bit_op(op) { return; }
|
|
|
|
match (is_arith_expr(left), is_arith_expr(right)) {
|
|
|
|
(true, true) => span_lint(cx, PRECEDENCE, expr.span,
|
|
|
|
&format!("operator precedence can trip the unwary. \
|
|
|
|
Consider parenthesizing your expression:\
|
|
|
|
`({}) {} ({})`", snippet(cx, left.span, ".."),
|
|
|
|
binop_to_string(op), snippet(cx, right.span, ".."))),
|
|
|
|
(true, false) => span_lint(cx, PRECEDENCE, expr.span,
|
|
|
|
&format!("operator precedence can trip the unwary. \
|
|
|
|
Consider parenthesizing your expression:\
|
|
|
|
`({}) {} {}`", snippet(cx, left.span, ".."),
|
|
|
|
binop_to_string(op), snippet(cx, right.span, ".."))),
|
|
|
|
(false, true) => span_lint(cx, PRECEDENCE, expr.span,
|
|
|
|
&format!("operator precedence can trip the unwary. \
|
|
|
|
Consider parenthesizing your expression:\
|
|
|
|
`{} {} ({})`", snippet(cx, left.span, ".."),
|
|
|
|
binop_to_string(op), snippet(cx, right.span, ".."))),
|
|
|
|
_ => (),
|
2015-08-30 15:32:35 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if let ExprUnary(UnNeg, ref rhs) = expr.node {
|
|
|
|
if let ExprMethodCall(_, _, ref args) = rhs.node {
|
|
|
|
if let Some(slf) = args.first() {
|
|
|
|
if let ExprLit(ref lit) = slf.node {
|
|
|
|
match lit.node {
|
|
|
|
LitInt(..) | LitFloat(..) | LitFloatUnsuffixed(..) =>
|
2015-10-13 11:48:48 +00:00
|
|
|
span_lint(cx, PRECEDENCE, expr.span, &format!(
|
|
|
|
"unary minus has lower precedence than \
|
|
|
|
method call. Consider adding parentheses \
|
|
|
|
to clarify your intent: -({})",
|
|
|
|
snippet(cx, rhs.span, ".."))),
|
2015-08-30 15:32:35 +00:00
|
|
|
_ => ()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn is_arith_expr(expr : &Expr) -> bool {
|
|
|
|
match expr.node {
|
|
|
|
ExprBinary(Spanned { node: op, ..}, _, _) => is_arith_op(op),
|
|
|
|
_ => false
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn is_bit_op(op : BinOp_) -> bool {
|
|
|
|
match op {
|
|
|
|
BiBitXor | BiBitAnd | BiBitOr | BiShl | BiShr => true,
|
|
|
|
_ => false
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn is_arith_op(op : BinOp_) -> bool {
|
|
|
|
match op {
|
|
|
|
BiAdd | BiSub | BiMul | BiDiv | BiRem => true,
|
|
|
|
_ => false
|
|
|
|
}
|
|
|
|
}
|