use rustc::hir;
use rustc::lint::*;
+use syntax::ast;
use utils::{span_lint_and_then, snippet_opt, SpanlessEq, get_trait_def_id, implements_trait};
use utils::{higher, sugg};
if let hir::ExprBinary(binop, ref l, ref r) = rhs.node {
if op.node == binop.node {
let lint = |assignee: &hir::Expr, rhs: &hir::Expr| {
- let ty = cx.tcx.tables().expr_ty(assignee);
- if ty.walk_shallow().next().is_some() {
- return; // implements_trait does not work with generics
- }
- let rty = cx.tcx.tables().expr_ty(rhs);
- if rty.walk_shallow().next().is_some() {
- return; // implements_trait does not work with generics
- }
span_lint_and_then(cx,
MISREFACTORED_ASSIGN_OP,
expr.span,
"variable appears on both sides of an assignment operation",
- |db| {
- if let (Some(snip_a), Some(snip_r)) = (snippet_opt(cx, assignee.span),
- snippet_opt(cx, rhs.span)) {
- db.span_suggestion(expr.span,
- "replace it with",
- format!("{} {}= {}", snip_a, op.node.as_str(), snip_r));
- }
+ |db| if let (Some(snip_a), Some(snip_r)) =
+ (snippet_opt(cx, assignee.span), snippet_opt(cx, rhs.span)) {
+ db.span_suggestion(expr.span,
+ "replace it with",
+ format!("{} {}= {}",
+ snip_a,
+ op.node.as_str(),
+ snip_r));
});
};
// lhs op= l op r
}
}
}
- }
+ },
hir::ExprAssign(ref assignee, ref e) => {
if let hir::ExprBinary(op, ref l, ref r) = e.node {
+ #[allow(cyclomatic_complexity)]
let lint = |assignee: &hir::Expr, rhs: &hir::Expr| {
- let ty = cx.tcx.tables().expr_ty(assignee);
- if ty.walk_shallow().next().is_some() {
- return; // implements_trait does not work with generics
- }
- let rty = cx.tcx.tables().expr_ty(rhs);
- if rty.walk_shallow().next().is_some() {
- return; // implements_trait does not work with generics
- }
+ let ty = cx.tables.expr_ty(assignee);
+ let rty = cx.tables.expr_ty(rhs);
macro_rules! ops {
- ($op:expr, $cx:expr, $ty:expr, $rty:expr, $($trait_name:ident:$full_trait_name:ident),+) => {
+ ($op:expr,
+ $cx:expr,
+ $ty:expr,
+ $rty:expr,
+ $($trait_name:ident:$full_trait_name:ident),+) => {
match $op {
$(hir::$full_trait_name => {
let [krate, module] = ::utils::paths::OPS_MODULE;
} else {
return; // useless if the trait doesn't exist
};
- implements_trait($cx, $ty, trait_id, vec![$rty])
+ // check that we are not inside an `impl AssignOp` of this exact operation
+ let parent_fn = cx.tcx.hir.get_parent(e.id);
+ let parent_impl = cx.tcx.hir.get_parent(parent_fn);
+ // the crate node is the only one that is not in the map
+ if_let_chain!{[
+ parent_impl != ast::CRATE_NODE_ID,
+ let hir::map::Node::NodeItem(item) = cx.tcx.hir.get(parent_impl),
+ let hir::Item_::ItemImpl(_, _, _, _, Some(ref trait_ref), _, _) = item.node,
+ trait_ref.path.def.def_id() == trait_id
+ ], { return; }}
+ implements_trait($cx, $ty, trait_id, &[$rty])
},)*
_ => false,
}
ASSIGN_OP_PATTERN,
expr.span,
"manual implementation of an assign operation",
- |db| {
- if let (Some(snip_a), Some(snip_r)) = (snippet_opt(cx, assignee.span),
- snippet_opt(cx, rhs.span)) {
- db.span_suggestion(expr.span,
- "replace it with",
- format!("{} {}= {}", snip_a, op.node.as_str(), snip_r));
- }
+ |db| if let (Some(snip_a), Some(snip_r)) =
+ (snippet_opt(cx, assignee.span), snippet_opt(cx, rhs.span)) {
+ db.span_suggestion(expr.span,
+ "replace it with",
+ format!("{} {}= {}",
+ snip_a,
+ op.node.as_str(),
+ snip_r));
});
}
};
hir::BiAdd | hir::BiMul | hir::BiAnd | hir::BiOr | hir::BiBitXor | hir::BiBitAnd |
hir::BiBitOr => {
lint(assignee, l);
- }
- _ => {}
+ },
+ _ => {},
}
}
}
- }
- _ => {}
+ },
+ _ => {},
}
}
}
fn is_commutative(op: hir::BinOp_) -> bool {
use rustc::hir::BinOp_::*;
match op {
- BiAdd |
- BiMul |
- BiAnd |
- BiOr |
- BiBitXor |
- BiBitAnd |
- BiBitOr |
- BiEq |
- BiNe => true,
- BiSub |
- BiDiv |
- BiRem |
- BiShl |
- BiShr |
- BiLt |
- BiLe |
- BiGe |
- BiGt => false,
+ BiAdd | BiMul | BiAnd | BiOr | BiBitXor | BiBitAnd | BiBitOr | BiEq | BiNe => true,
+ BiSub | BiDiv | BiRem | BiShl | BiShr | BiLt | BiLe | BiGe | BiGt => false,
}
}