2015-04-30 09:48:43 +00:00
use rustc ::lint ::* ;
2015-09-03 14:42:17 +00:00
use rustc_front ::hir ::* ;
use rustc_front ::util as ast_util ;
2015-08-16 06:54:43 +00:00
2016-01-03 14:49:25 +00:00
use utils ::{ is_exp_equal , span_lint } ;
2015-04-30 09:48:43 +00:00
2016-02-05 23:41:54 +00:00
/// **What it does:** This lint checks for equal operands to comparisons and bitwise binary operators (`&`, `|` and `^`).
2015-12-11 00:22:27 +00:00
///
/// **Why is this bad?** This is usually just a typo.
///
/// **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.
///
/// **Example:** `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
}
#[ derive(Copy,Clone) ]
pub struct EqOp ;
impl LintPass for EqOp {
fn get_lints ( & self ) -> LintArray {
lint_array! ( EQ_OP )
}
2015-09-19 02:53:04 +00:00
}
2015-08-11 18:22:20 +00:00
2015-09-19 02:53:04 +00:00
impl LateLintPass for EqOp {
fn check_expr ( & mut self , cx : & LateContext , e : & Expr ) {
2015-04-30 09:48:43 +00:00
if let ExprBinary ( ref op , ref left , ref right ) = e . node {
2015-08-21 10:19:07 +00:00
if is_cmp_or_bit ( op ) & & is_exp_equal ( cx , left , right ) {
2016-01-04 04:26:12 +00:00
span_lint ( cx ,
EQ_OP ,
e . span ,
& format! ( " equal expressions as operands to {} " , ast_util ::binop_to_string ( op . node ) ) ) ;
2015-04-30 09:48:43 +00:00
}
}
}
}
2016-01-04 04:26:12 +00:00
fn is_cmp_or_bit ( op : & BinOp ) -> bool {
2015-04-30 09:48:43 +00:00
match op . node {
2016-01-04 04:26:12 +00:00
BiEq |
BiLt |
BiLe |
BiGt |
BiGe |
BiNe |
BiAnd |
BiOr |
BiBitXor |
BiBitAnd |
BiBitOr = > true ,
_ = > false ,
2015-04-30 09:48:43 +00:00
}
}