2 get_trait_def_id, implements_trait, snippet_opt, span_lint_and_then, trait_ref_of_method, SpanlessEq,
4 use crate::utils::{higher, sugg};
5 use if_chain::if_chain;
6 use rustc::declare_lint_pass;
7 use rustc::hir::map::Map;
8 use rustc::lint::{LateContext, LateLintPass, LintArray, LintPass};
9 use rustc_errors::Applicability;
11 use rustc_hir::intravisit::{walk_expr, NestedVisitorMap, Visitor};
12 use rustc_session::declare_tool_lint;
14 declare_clippy_lint! {
15 /// **What it does:** Checks for `a = a op b` or `a = b commutative_op a`
18 /// **Why is this bad?** These can be written as the shorter `a op= b`.
20 /// **Known problems:** While forbidden by the spec, `OpAssign` traits may have
21 /// implementations that differ from the regular `Op` impl.
30 pub ASSIGN_OP_PATTERN,
32 "assigning the result of an operation on a variable to that same variable"
35 declare_clippy_lint! {
36 /// **What it does:** Checks for `a op= a op b` or `a op= b op a` patterns.
38 /// **Why is this bad?** Most likely these are bugs where one meant to write `a
41 /// **Known problems:** Clippy cannot know for sure if `a op= a op b` should have
42 /// been `a = a op a op b` or `a = a op b`/`a op= b`. Therefore, it suggests both.
43 /// If `a op= a op b` is really the correct behaviour it should be
44 /// written as `a = a op a op b` as it's less confusing.
53 pub MISREFACTORED_ASSIGN_OP,
55 "having a variable on both sides of an assign op"
58 declare_lint_pass!(AssignOps => [ASSIGN_OP_PATTERN, MISREFACTORED_ASSIGN_OP]);
60 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for AssignOps {
61 #[allow(clippy::too_many_lines)]
62 fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, expr: &'tcx hir::Expr<'_>) {
64 hir::ExprKind::AssignOp(op, lhs, rhs) => {
65 if let hir::ExprKind::Binary(binop, l, r) = &rhs.kind {
66 if op.node != binop.node {
70 if SpanlessEq::new(cx).ignore_fn().eq_expr(lhs, l) {
71 lint_misrefactored_assign_op(cx, expr, *op, rhs, lhs, r);
73 // lhs op= l commutative_op r
74 if is_commutative(op.node) && SpanlessEq::new(cx).ignore_fn().eq_expr(lhs, r) {
75 lint_misrefactored_assign_op(cx, expr, *op, rhs, lhs, l);
79 hir::ExprKind::Assign(assignee, e, _) => {
80 if let hir::ExprKind::Binary(op, l, r) = &e.kind {
81 #[allow(clippy::cognitive_complexity)]
82 let lint = |assignee: &hir::Expr<'_>, rhs: &hir::Expr<'_>| {
83 let ty = cx.tables.expr_ty(assignee);
84 let rty = cx.tables.expr_ty(rhs);
90 $($trait_name:ident),+) => {
92 $(hir::BinOpKind::$trait_name => {
93 let [krate, module] = crate::utils::paths::OPS_MODULE;
94 let path: [&str; 3] = [krate, module, concat!(stringify!($trait_name), "Assign")];
95 let trait_id = if let Some(trait_id) = get_trait_def_id($cx, &path) {
98 return; // useless if the trait doesn't exist
100 // check that we are not inside an `impl AssignOp` of this exact operation
101 let parent_fn = cx.tcx.hir().get_parent_item(e.hir_id);
103 if let Some(trait_ref) = trait_ref_of_method(cx, parent_fn);
104 if trait_ref.path.res.def_id() == trait_id;
107 implements_trait($cx, $ty, trait_id, &[$rty])
135 "manual implementation of an assign operation",
137 if let (Some(snip_a), Some(snip_r)) =
138 (snippet_opt(cx, assignee.span), snippet_opt(cx, rhs.span))
143 format!("{} {}= {}", snip_a, op.node.as_str(), snip_r),
144 Applicability::MachineApplicable,
152 let mut visitor = ExprVisitor {
158 walk_expr(&mut visitor, e);
160 if visitor.counter == 1 {
162 if SpanlessEq::new(cx).ignore_fn().eq_expr(assignee, l) {
165 // a = b commutative_op a
166 // Limited to primitive type as these ops are know to be commutative
167 if SpanlessEq::new(cx).ignore_fn().eq_expr(assignee, r)
168 && cx.tables.expr_ty(assignee).is_primitive_ty()
172 | hir::BinOpKind::Mul
173 | hir::BinOpKind::And
175 | hir::BinOpKind::BitXor
176 | hir::BinOpKind::BitAnd
177 | hir::BinOpKind::BitOr => {
191 fn lint_misrefactored_assign_op(
192 cx: &LateContext<'_, '_>,
193 expr: &hir::Expr<'_>,
196 assignee: &hir::Expr<'_>,
197 rhs_other: &hir::Expr<'_>,
201 MISREFACTORED_ASSIGN_OP,
203 "variable appears on both sides of an assignment operation",
205 if let (Some(snip_a), Some(snip_r)) = (snippet_opt(cx, assignee.span), snippet_opt(cx, rhs_other.span)) {
206 let a = &sugg::Sugg::hir(cx, assignee, "..");
207 let r = &sugg::Sugg::hir(cx, rhs, "..");
208 let long = format!("{} = {}", snip_a, sugg::make_binop(higher::binop(op.node), a, r));
212 "Did you mean `{} = {} {} {}` or `{}`? Consider replacing it with",
219 format!("{} {}= {}", snip_a, op.node.as_str(), snip_r),
220 Applicability::MaybeIncorrect,
226 Applicability::MaybeIncorrect, // snippet
234 fn is_commutative(op: hir::BinOpKind) -> bool {
235 use rustc_hir::BinOpKind::*;
237 Add | Mul | And | Or | BitXor | BitAnd | BitOr | Eq | Ne => true,
238 Sub | Div | Rem | Shl | Shr | Lt | Le | Ge | Gt => false,
242 struct ExprVisitor<'a, 'tcx> {
243 assignee: &'a hir::Expr<'a>,
245 cx: &'a LateContext<'a, 'tcx>,
248 impl<'a, 'tcx> Visitor<'tcx> for ExprVisitor<'a, 'tcx> {
249 type Map = Map<'tcx>;
251 fn visit_expr(&mut self, expr: &'tcx hir::Expr<'_>) {
252 if SpanlessEq::new(self.cx).ignore_fn().eq_expr(self.assignee, expr) {
256 walk_expr(self, expr);
258 fn nested_visit_map(&mut self) -> NestedVisitorMap<'_, Self::Map> {
259 NestedVisitorMap::None