1 use crate::utils::{eq_expr_value, get_trait_def_id, snippet_opt, span_lint_and_then, trait_ref_of_method};
2 use crate::utils::{higher, sugg};
3 use clippy_utils::ty::implements_trait;
4 use if_chain::if_chain;
5 use rustc_errors::Applicability;
7 use rustc_hir::intravisit::{walk_expr, NestedVisitorMap, Visitor};
8 use rustc_lint::{LateContext, LateLintPass};
9 use rustc_middle::hir::map::Map;
10 use rustc_session::{declare_lint_pass, declare_tool_lint};
12 declare_clippy_lint! {
13 /// **What it does:** Checks for `a = a op b` or `a = b commutative_op a`
16 /// **Why is this bad?** These can be written as the shorter `a op= b`.
18 /// **Known problems:** While forbidden by the spec, `OpAssign` traits may have
19 /// implementations that differ from the regular `Op` impl.
32 pub ASSIGN_OP_PATTERN,
34 "assigning the result of an operation on a variable to that same variable"
37 declare_clippy_lint! {
38 /// **What it does:** Checks for `a op= a op b` or `a op= b op a` patterns.
40 /// **Why is this bad?** Most likely these are bugs where one meant to write `a
43 /// **Known problems:** Clippy cannot know for sure if `a op= a op b` should have
44 /// been `a = a op a op b` or `a = a op b`/`a op= b`. Therefore, it suggests both.
45 /// If `a op= a op b` is really the correct behaviour it should be
46 /// written as `a = a op a op b` as it's less confusing.
55 pub MISREFACTORED_ASSIGN_OP,
57 "having a variable on both sides of an assign op"
60 declare_lint_pass!(AssignOps => [ASSIGN_OP_PATTERN, MISREFACTORED_ASSIGN_OP]);
62 impl<'tcx> LateLintPass<'tcx> for AssignOps {
63 #[allow(clippy::too_many_lines)]
64 fn check_expr(&mut self, cx: &LateContext<'tcx>, expr: &'tcx hir::Expr<'_>) {
66 hir::ExprKind::AssignOp(op, lhs, rhs) => {
67 if let hir::ExprKind::Binary(binop, l, r) = &rhs.kind {
68 if op.node != binop.node {
72 if eq_expr_value(cx, lhs, l) {
73 lint_misrefactored_assign_op(cx, expr, *op, rhs, lhs, r);
75 // lhs op= l commutative_op r
76 if is_commutative(op.node) && eq_expr_value(cx, lhs, r) {
77 lint_misrefactored_assign_op(cx, expr, *op, rhs, lhs, l);
81 hir::ExprKind::Assign(assignee, e, _) => {
82 if let hir::ExprKind::Binary(op, l, r) = &e.kind {
83 let lint = |assignee: &hir::Expr<'_>, rhs: &hir::Expr<'_>| {
84 let ty = cx.typeck_results().expr_ty(assignee);
85 let rty = cx.typeck_results().expr_ty(rhs);
91 $($trait_name:ident),+) => {
93 $(hir::BinOpKind::$trait_name => {
94 let [krate, module] = crate::utils::paths::OPS_MODULE;
95 let path: [&str; 3] = [krate, module, concat!(stringify!($trait_name), "Assign")];
96 let trait_id = if let Some(trait_id) = get_trait_def_id($cx, &path) {
99 return; // useless if the trait doesn't exist
101 // check that we are not inside an `impl AssignOp` of this exact operation
102 let parent_fn = cx.tcx.hir().get_parent_item(e.hir_id);
104 if let Some(trait_ref) = trait_ref_of_method(cx, parent_fn);
105 if trait_ref.path.res.def_id() == trait_id;
108 implements_trait($cx, $ty, trait_id, &[$rty])
136 "manual implementation of an assign operation",
138 if let (Some(snip_a), Some(snip_r)) =
139 (snippet_opt(cx, assignee.span), snippet_opt(cx, rhs.span))
141 diag.span_suggestion(
144 format!("{} {}= {}", snip_a, op.node.as_str(), snip_r),
145 Applicability::MachineApplicable,
153 let mut visitor = ExprVisitor {
159 walk_expr(&mut visitor, e);
161 if visitor.counter == 1 {
163 if eq_expr_value(cx, assignee, l) {
166 // a = b commutative_op a
167 // Limited to primitive type as these ops are know to be commutative
168 if eq_expr_value(cx, assignee, r) && cx.typeck_results().expr_ty(assignee).is_primitive_ty() {
171 | hir::BinOpKind::Mul
172 | hir::BinOpKind::And
174 | hir::BinOpKind::BitXor
175 | hir::BinOpKind::BitAnd
176 | hir::BinOpKind::BitOr => {
190 fn lint_misrefactored_assign_op(
191 cx: &LateContext<'_>,
192 expr: &hir::Expr<'_>,
195 assignee: &hir::Expr<'_>,
196 rhs_other: &hir::Expr<'_>,
200 MISREFACTORED_ASSIGN_OP,
202 "variable appears on both sides of an assignment operation",
204 if let (Some(snip_a), Some(snip_r)) = (snippet_opt(cx, assignee.span), snippet_opt(cx, rhs_other.span)) {
205 let a = &sugg::Sugg::hir(cx, assignee, "..");
206 let r = &sugg::Sugg::hir(cx, rhs, "..");
207 let long = format!("{} = {}", snip_a, sugg::make_binop(higher::binop(op.node), a, r));
208 diag.span_suggestion(
211 "did you mean `{} = {} {} {}` or `{}`? Consider replacing it with",
218 format!("{} {}= {}", snip_a, op.node.as_str(), snip_r),
219 Applicability::MaybeIncorrect,
221 diag.span_suggestion(
225 Applicability::MaybeIncorrect, // snippet
233 fn is_commutative(op: hir::BinOpKind) -> bool {
234 use rustc_hir::BinOpKind::{
235 Add, And, BitAnd, BitOr, BitXor, Div, Eq, Ge, Gt, Le, Lt, Mul, Ne, Or, Rem, Shl, Shr, Sub,
238 Add | Mul | And | Or | BitXor | BitAnd | BitOr | Eq | Ne => true,
239 Sub | Div | Rem | Shl | Shr | Lt | Le | Ge | Gt => false,
243 struct ExprVisitor<'a, 'tcx> {
244 assignee: &'a hir::Expr<'a>,
246 cx: &'a LateContext<'tcx>,
249 impl<'a, 'tcx> Visitor<'tcx> for ExprVisitor<'a, 'tcx> {
250 type Map = Map<'tcx>;
252 fn visit_expr(&mut self, expr: &'tcx hir::Expr<'_>) {
253 if eq_expr_value(self.cx, self.assignee, expr) {
257 walk_expr(self, expr);
259 fn nested_visit_map(&mut self) -> NestedVisitorMap<Self::Map> {
260 NestedVisitorMap::None