|
| 1 | +use clippy_utils::diagnostics::span_lint_and_then; |
| 2 | +use clippy_utils::in_macro; |
| 3 | +use clippy_utils::source::snippet_opt; |
| 4 | +use if_chain::if_chain; |
| 5 | +use rustc_errors::Applicability; |
| 6 | +use rustc_hir::{BinOpKind, Expr, ExprKind}; |
| 7 | +use rustc_lint::{LateContext, LateLintPass}; |
| 8 | +use rustc_middle::ty; |
| 9 | +use rustc_session::{declare_lint_pass, declare_tool_lint}; |
| 10 | + |
| 11 | +declare_clippy_lint! { |
| 12 | + /// **What it does:** |
| 13 | + /// Checks for uses of bitwise and/or operators between booleans, where performance may be improved by using |
| 14 | + /// a lazy and. |
| 15 | + /// |
| 16 | + /// **Why is this bad?** |
| 17 | + /// The bitwise operators do not support short-circuiting, so it may hinder code performance. |
| 18 | + /// Additionally, boolean logic "masked" as bitwise logic is not caught by lints like `unnecessary_fold` |
| 19 | + /// |
| 20 | + /// **Known problems:** |
| 21 | + /// This lint evaluates only when the right side is determined to have no side effects. At this time, that |
| 22 | + /// determination is quite conservative. |
| 23 | + /// |
| 24 | + /// **Example:** |
| 25 | + /// |
| 26 | + /// ```rust |
| 27 | + /// if x & !y {} // where both x and y are booleans |
| 28 | + /// ``` |
| 29 | + /// Use instead: |
| 30 | + /// ```rust |
| 31 | + /// if x && !y {} |
| 32 | + /// ``` |
| 33 | + pub NEEDLESS_BITWISE_BOOL, |
| 34 | + pedantic, |
| 35 | + "Boolean expressions that use bitwise rather than lazy operators" |
| 36 | +} |
| 37 | + |
| 38 | +declare_lint_pass!(NeedlessBitwiseBool => [NEEDLESS_BITWISE_BOOL]); |
| 39 | + |
| 40 | +fn is_bitwise_operation(cx: &LateContext<'_>, expr: &Expr<'_>) -> bool { |
| 41 | + let ty = cx.typeck_results().expr_ty(expr); |
| 42 | + if_chain! { |
| 43 | + if !in_macro(expr.span); |
| 44 | + if let (&ExprKind::Binary(ref op, _, right), &ty::Bool) = (&expr.kind, &ty.kind()); |
| 45 | + if op.node == BinOpKind::BitAnd || op.node == BinOpKind::BitOr; |
| 46 | + if let ExprKind::Call(..) | ExprKind::MethodCall(..) | ExprKind::Binary(..) | ExprKind::Unary(..) = right.kind; |
| 47 | + if !right.can_have_side_effects(); |
| 48 | + then { |
| 49 | + return true; |
| 50 | + } |
| 51 | + } |
| 52 | + false |
| 53 | +} |
| 54 | + |
| 55 | +fn suggession_snippet(cx: &LateContext<'_>, expr: &Expr<'_>) -> Option<String> { |
| 56 | + if let ExprKind::Binary(ref op, left, right) = expr.kind { |
| 57 | + if let (Some(l_snippet), Some(r_snippet)) = (snippet_opt(cx, left.span), snippet_opt(cx, right.span)) { |
| 58 | + let op_snippet = match op.node { |
| 59 | + BinOpKind::BitAnd => "&&", |
| 60 | + _ => "||", |
| 61 | + }; |
| 62 | + return Some(format!("{} {} {}", l_snippet, op_snippet, r_snippet)); |
| 63 | + } |
| 64 | + } |
| 65 | + None |
| 66 | +} |
| 67 | + |
| 68 | +impl LateLintPass<'_> for NeedlessBitwiseBool { |
| 69 | + fn check_expr(&mut self, cx: &LateContext<'_>, expr: &Expr<'_>) { |
| 70 | + if is_bitwise_operation(cx, expr) { |
| 71 | + span_lint_and_then( |
| 72 | + cx, |
| 73 | + NEEDLESS_BITWISE_BOOL, |
| 74 | + expr.span, |
| 75 | + "use of bitwise operator instead of lazy operator between booleans", |
| 76 | + |diag| { |
| 77 | + if let Some(sugg) = suggession_snippet(cx, expr) { |
| 78 | + diag.span_suggestion(expr.span, "try", sugg, Applicability::MachineApplicable); |
| 79 | + } |
| 80 | + }, |
| 81 | + ); |
| 82 | + } |
| 83 | + } |
| 84 | +} |
0 commit comments