Add manual_checked_div lint

CHANGELOG.md

@@ -6607,6 +6607,7 @@ Released 2018-09-13
 [`manual_async_fn`]: https://rust-lang.github.io/rust-clippy/master/index.html#manual_async_fn
 [`manual_bits`]: https://rust-lang.github.io/rust-clippy/master/index.html#manual_bits
 [`manual_c_str_literals`]: https://rust-lang.github.io/rust-clippy/master/index.html#manual_c_str_literals
+[`manual_checked_div`]: https://rust-lang.github.io/rust-clippy/master/index.html#manual_checked_div
 [`manual_clamp`]: https://rust-lang.github.io/rust-clippy/master/index.html#manual_clamp
 [`manual_contains`]: https://rust-lang.github.io/rust-clippy/master/index.html#manual_contains
 [`manual_dangling_ptr`]: https://rust-lang.github.io/rust-clippy/master/index.html#manual_dangling_ptr

clippy_lints/src/declared_lints.rs

@@ -296,6 +296,7 @@ pub static LINTS: &[&::declare_clippy_lint::LintInfo] = &[
     crate::manual_assert::MANUAL_ASSERT_INFO,
     crate::manual_async_fn::MANUAL_ASYNC_FN_INFO,
     crate::manual_bits::MANUAL_BITS_INFO,
+    crate::manual_checked_div::MANUAL_CHECKED_DIV_INFO,
     crate::manual_clamp::MANUAL_CLAMP_INFO,
     crate::manual_float_methods::MANUAL_IS_FINITE_INFO,
     crate::manual_float_methods::MANUAL_IS_INFINITE_INFO,

clippy_lints/src/lib.rs

@@ -198,6 +198,7 @@ mod manual_abs_diff;
 mod manual_assert;
 mod manual_async_fn;
 mod manual_bits;
+mod manual_checked_div;
 mod manual_clamp;
 mod manual_float_methods;
 mod manual_hash_one;
@@ -857,6 +858,7 @@ pub fn register_lint_passes(store: &mut rustc_lint::LintStore, conf: &'static Co
         Box::new(|_| Box::<replace_box::ReplaceBox>::default()),
         Box::new(move |_| Box::new(manual_ilog2::ManualIlog2::new(conf))),
         Box::new(|_| Box::new(same_length_and_capacity::SameLengthAndCapacity)),
+        Box::new(|_| Box::new(manual_checked_div::ManualCheckedDiv)),
         // add late passes here, used by `cargo dev new_lint`
     ];
     store.late_passes.extend(late_lints);

clippy_lints/src/manual_checked_div.rs

@@ -0,0 +1,234 @@
+use clippy_utils::consts::{ConstEvalCtxt, FullInt};
+use clippy_utils::diagnostics::span_lint_and_then;
+use clippy_utils::sugg::Sugg;
+use clippy_utils::visitors::{Descend, for_each_expr_without_closures};
+use clippy_utils::{SpanlessEq, is_integer_literal};
+use rustc_ast::{LitIntType, LitKind};
+use rustc_errors::{Applicability, MultiSpan};
+use rustc_hir::{BinOpKind, Block, Expr, ExprKind, UnOp};
+use rustc_lint::{LateContext, LateLintPass};
+use rustc_middle::ty;
+use rustc_session::declare_lint_pass;
+use rustc_span::source_map::Spanned;
+use std::ops::ControlFlow;
+
+declare_clippy_lint! {
+    /// ### What it does
+    /// Detects manual zero checks before dividing integers, such as `if x != 0 { y / x }`.
+    ///
+    /// ### Why is this bad?
+    /// `checked_div` already handles the zero case and makes the intent clearer while avoiding a
+    /// panic from a manual division.
+    ///
+    /// ### Example
+    /// ```no_run
+    /// # let (a, b) = (10u32, 5u32);
+    /// if b != 0 {
+    ///     let result = a / b;
+    ///     println!("{result}");
+    /// }
+    /// ```
+    /// Use instead:
+    /// ```no_run
+    /// # let (a, b) = (10u32, 5u32);
+    /// if let Some(result) = a.checked_div(b) {
+    ///     println!("{result}");
+    /// }
+    /// ```
+    #[clippy::version = "1.93.0"]
+    pub MANUAL_CHECKED_DIV,
+    nursery,
+    "manual zero checks before dividing integers"
+}
+declare_lint_pass!(ManualCheckedDiv => [MANUAL_CHECKED_DIV]);
+
+#[derive(Copy, Clone)]
+enum NonZeroBranch {
+    Then,
+    Else,
+}
+
+impl LateLintPass<'_> for ManualCheckedDiv {
+    fn check_expr(&mut self, cx: &LateContext<'_>, expr: &Expr<'_>) {
+        if let ExprKind::If(cond, then, r#else) = expr.kind
+            && !expr.span.from_expansion()
+            && let Some((divisor, branch)) = divisor_from_condition(cond)
+            && is_integer(cx, divisor)
+            && let Some(block) = branch_block(then, r#else, branch)
+        {
+            let divisor_excludes_minus_one = excludes_minus_one(cx, cond, divisor);
+            let mut eq = SpanlessEq::new(cx).deny_side_effects().paths_by_resolution();
+            if !eq.eq_expr(divisor, divisor) {
+                return;
+            }
+
+            let mut applicability = Applicability::MaybeIncorrect;
+            let mut divisions = Vec::new();
+            let mut first_use = None;
+
+            let found_early_use = for_each_expr_without_closures(block, |e| {
+                if let ExprKind::Binary(binop, lhs, rhs) = e.kind
+                    && binop.node == BinOpKind::Div
+                    && eq.eq_expr(rhs, divisor)
+                    && is_integer(cx, lhs)
+                {
+                    let lhs_ty = cx.typeck_results().expr_ty(lhs);
+                    if let ty::Int(int_ty) = lhs_ty.peel_refs().kind()
+                        && !divisor_excludes_minus_one
+                        && min_and_minus_one(cx, lhs, rhs, *int_ty)
+                    {
+                        return ControlFlow::Break(());
+                    }
+
+                    match first_use {
+                        None => first_use = Some(UseKind::Division),
+                        Some(UseKind::Other) => return ControlFlow::Break(()),
+                        Some(UseKind::Division) => {},
+                    }
+
+                    let lhs_snip = Sugg::hir_with_applicability(cx, lhs, "_", &mut applicability);
+                    let rhs_snip = Sugg::hir_with_applicability(cx, rhs, "_", &mut applicability);
+                    let lhs_sugg = lhs_snip.maybe_paren().to_string();
+                    let type_suffix = if matches!(
+                        lhs.kind,
+                        ExprKind::Lit(Spanned {
+                            node: LitKind::Int(_, LitIntType::Unsuffixed),
+                            ..
+                        }) | ExprKind::Unary(
+                            UnOp::Neg,
+                            Expr {
+                                kind: ExprKind::Lit(Spanned {
+                                    node: LitKind::Int(_, LitIntType::Unsuffixed),
+                                    ..
+                                }),
+                                ..
+                            }
+                        )
+                    ) {
+                        format!("_{lhs_ty}")
+                    } else {
+                        String::new()
+                    };
+                    let suggestion = format!("{lhs_sugg}{type_suffix}.checked_div({rhs_snip})");
+                    divisions.push((e.span, suggestion));
+
+                    ControlFlow::<(), _>::Continue(Descend::No)
+                } else if eq.eq_expr(e, divisor) {
+                    if first_use.is_none() {
+                        first_use = Some(UseKind::Other);
+                    }
+                    ControlFlow::<(), _>::Continue(Descend::Yes)
+                } else {
+                    ControlFlow::<(), _>::Continue(Descend::Yes)
+                }
+            });
+
+            if found_early_use.is_some() || first_use != Some(UseKind::Division) || divisions.is_empty() {
+                return;
+            }
+
+            let mut spans: Vec<_> = divisions.iter().map(|(span, _)| *span).collect();
+            spans.push(cond.span);
+            span_lint_and_then(
+                cx,
+                MANUAL_CHECKED_DIV,
+                MultiSpan::from_spans(spans),
+                "manual checked division",
+                |diag| {
+                    diag.multipart_suggestion("consider using `checked_div`", divisions, applicability);
+                },
+            );
+        }
+    }
+}
+
+#[derive(Copy, Clone, Eq, PartialEq)]
+enum UseKind {
+    Division,
+    Other,
+}
+
+fn divisor_from_condition<'tcx>(cond: &'tcx Expr<'tcx>) -> Option<(&'tcx Expr<'tcx>, NonZeroBranch)> {
+    let ExprKind::Binary(binop, lhs, rhs) = cond.kind else {
+        return None;
+    };
+
+    match binop.node {
+        BinOpKind::Ne | BinOpKind::Lt if is_zero(lhs) => Some((rhs, NonZeroBranch::Then)),
+        BinOpKind::Ne | BinOpKind::Gt if is_zero(rhs) => Some((lhs, NonZeroBranch::Then)),
+        BinOpKind::Eq if is_zero(lhs) => Some((rhs, NonZeroBranch::Else)),
+        BinOpKind::Eq if is_zero(rhs) => Some((lhs, NonZeroBranch::Else)),
+        _ => None,
+    }
+}
+
+fn branch_block<'tcx>(
+    then: &'tcx Expr<'tcx>,
+    r#else: Option<&'tcx Expr<'tcx>>,
+    branch: NonZeroBranch,
+) -> Option<&'tcx Block<'tcx>> {
+    match branch {
+        NonZeroBranch::Then => match then.kind {
+            ExprKind::Block(block, _) => Some(block),
+            _ => None,
+        },
+        NonZeroBranch::Else => match r#else?.kind {
+            ExprKind::Block(block, _) => Some(block),
+            _ => None,
+        },
+    }
+}
+
+fn is_zero(expr: &Expr<'_>) -> bool {
+    is_integer_literal(expr, 0)
+}
+
+fn min_and_minus_one(cx: &LateContext<'_>, lhs: &Expr<'_>, rhs: &Expr<'_>, int_ty: ty::IntTy) -> bool {
+    let lhs_val = int_value(cx, lhs);
+    let rhs_val = int_value(cx, rhs);
+
+    let lhs_maybe_min = lhs_val.is_none_or(|val| match val {
+        FullInt::S(signed) => signed == int_min_value(int_ty, cx),
+        FullInt::U(_) => false,
+    });
+    let rhs_maybe_minus_one = rhs_val.is_none_or(|val| matches!(val, FullInt::S(-1)));
+
+    lhs_maybe_min && rhs_maybe_minus_one
+}
+
+fn int_min_value(int_ty: ty::IntTy, cx: &LateContext<'_>) -> i128 {
+    let bits = match int_ty {
+        ty::IntTy::Isize => cx.tcx.data_layout.pointer_size().bits(),
+        ty::IntTy::I8 => 8,
+        ty::IntTy::I16 => 16,
+        ty::IntTy::I32 => 32,
+        ty::IntTy::I64 => 64,
+        ty::IntTy::I128 => 128,
+    };
+    -(1_i128 << (bits - 1))
+}
+
+fn int_value(cx: &LateContext<'_>, expr: &Expr<'_>) -> Option<FullInt> {
+    let ecx = ConstEvalCtxt::new(cx);
+    ecx.eval_full_int(expr, expr.span.ctxt())
+}
+
+fn excludes_minus_one(cx: &LateContext<'_>, cond: &Expr<'_>, divisor: &Expr<'_>) -> bool {
+    let ExprKind::Binary(binop, lhs, rhs) = cond.kind else {
+        return false;
+    };
+
+    let mut eq = SpanlessEq::new(cx).deny_side_effects().paths_by_resolution();
+    match binop.node {
+        BinOpKind::Gt if is_zero(rhs) && eq.eq_expr(lhs, divisor) => true,
+        BinOpKind::Lt if is_zero(lhs) && eq.eq_expr(rhs, divisor) => true,
+        _ => false,
+    }
+}
+
+fn is_integer(cx: &LateContext<'_>, expr: &Expr<'_>) -> bool {
+    matches!(
+        cx.typeck_results().expr_ty(expr).peel_refs().kind(),
+        ty::Uint(_) | ty::Int(_)
+    )
+}

tests/ui/manual_checked_div.fixed

@@ -0,0 +1,81 @@
+#![warn(clippy::manual_checked_div)]
+
+fn main() {
+    let a = 10u32;
+    let mut b = 5u32;
+
+    // Should trigger lint
+    if b != 0 {
+        //~^ manual_checked_div
+        let _result = a.checked_div(b);
+        let _another = (a + 1).checked_div(b);
+    }
+
+    if b > 0 {
+        //~^ manual_checked_div
+        let _result = a.checked_div(b);
+    }
+
+    if b == 0 {
+        //~^ manual_checked_div
+        println!("zero");
+    } else {
+        let _result = a.checked_div(b);
+    }
+
+    // Should NOT trigger (already using checked_div)
+    if let Some(result) = b.checked_div(a) {
+        println!("{result}");
+    }
+
+    let c = -5i32;
+    if c != 0 {
+        //~^ manual_checked_div
+        let _result = 10_i32.checked_div(c);
+    }
+
+    // Should NOT trigger (side effects in divisor)
+    if counter() > 0 {
+        let _ = 32 / counter();
+    }
+
+    // Should NOT trigger (divisor used before division)
+    if b > 0 {
+        use_value(b);
+        let _ = a / b;
+    }
+
+    let signed_min = i32::MIN;
+    let mut signed_div: i32 = -1;
+
+    // Should NOT trigger (would change behavior for MIN / -1)
+    if signed_div != 0 {
+        let _ = signed_min / signed_div;
+    }
+
+    signed_div = 2;
+
+    if signed_div > 0 {
+        //~^ manual_checked_div
+        let _ = signed_min.checked_div(signed_div);
+    }
+
+    // Should NOT trigger (divisor may change during evaluation)
+    if b > 0 {
+        g(inc_and_return_value(&mut b), a / b);
+    }
+}
+
+fn counter() -> u32 {
+    println!("counter");
+    1
+}
+
+fn use_value(_v: u32) {}
+
+fn inc_and_return_value(x: &mut u32) -> u32 {
+    *x += 1;
+    *x
+}
+
+fn g(_lhs: u32, _rhs: u32) {}