1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84

use rustc::lint::*;
use syntax::codemap::Spanned;
use syntax::ast::*;
use syntax::ast_util::binop_to_string;

use utils::{span_lint, snippet};

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)
    }
}

impl EarlyLintPass for Precedence {
    fn check_expr(&mut self, cx: &EarlyContext, expr: &Expr) {
        if let ExprBinary(Spanned { node: op, ..}, ref left, ref right) = expr.node {
            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, ".."))),
                _ => (),
            }
        }

        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(..) =>
                                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, ".."))),
                                _ => ()
                        }
                    }
                }
            }
        }
    }
}

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
    }
}