2019-12-26 12:34:18 +00:00
|
|
|
use crate::consts::{constant, Constant};
|
2021-03-25 18:29:11 +00:00
|
|
|
use clippy_utils::diagnostics::span_lint_and_then;
|
|
|
|
use clippy_utils::sext;
|
2019-12-26 12:34:18 +00:00
|
|
|
use if_chain::if_chain;
|
2020-02-21 08:39:38 +00:00
|
|
|
use rustc_hir::{BinOpKind, Expr, ExprKind};
|
2020-01-12 06:08:41 +00:00
|
|
|
use rustc_lint::{LateContext, LateLintPass};
|
2020-03-30 09:02:14 +00:00
|
|
|
use rustc_middle::ty::{self};
|
2020-01-11 11:37:08 +00:00
|
|
|
use rustc_session::{declare_lint_pass, declare_tool_lint};
|
2019-12-26 12:34:18 +00:00
|
|
|
use std::fmt::Display;
|
|
|
|
|
|
|
|
declare_clippy_lint! {
|
2020-07-26 19:07:07 +00:00
|
|
|
/// **What it does:** Checks for modulo arithmetic.
|
2019-12-26 12:34:18 +00:00
|
|
|
///
|
|
|
|
/// **Why is this bad?** The results of modulo (%) operation might differ
|
|
|
|
/// depending on the language, when negative numbers are involved.
|
|
|
|
/// If you interop with different languages it might be beneficial
|
|
|
|
/// to double check all places that use modulo arithmetic.
|
|
|
|
///
|
|
|
|
/// For example, in Rust `17 % -3 = 2`, but in Python `17 % -3 = -1`.
|
|
|
|
///
|
|
|
|
/// **Known problems:** None.
|
|
|
|
///
|
|
|
|
/// **Example:**
|
|
|
|
/// ```rust
|
|
|
|
/// let x = -17 % 3;
|
|
|
|
/// ```
|
|
|
|
pub MODULO_ARITHMETIC,
|
|
|
|
restriction,
|
|
|
|
"any modulo arithmetic statement"
|
|
|
|
}
|
|
|
|
|
|
|
|
declare_lint_pass!(ModuloArithmetic => [MODULO_ARITHMETIC]);
|
|
|
|
|
|
|
|
struct OperandInfo {
|
|
|
|
string_representation: Option<String>,
|
|
|
|
is_negative: bool,
|
|
|
|
is_integral: bool,
|
|
|
|
}
|
|
|
|
|
2020-06-25 20:41:36 +00:00
|
|
|
fn analyze_operand(operand: &Expr<'_>, cx: &LateContext<'_>, expr: &Expr<'_>) -> Option<OperandInfo> {
|
2020-07-17 08:47:04 +00:00
|
|
|
match constant(cx, cx.typeck_results(), operand) {
|
2020-08-03 22:18:29 +00:00
|
|
|
Some((Constant::Int(v), _)) => match *cx.typeck_results().expr_ty(expr).kind() {
|
2019-12-26 12:34:18 +00:00
|
|
|
ty::Int(ity) => {
|
|
|
|
let value = sext(cx.tcx, v, ity);
|
|
|
|
return Some(OperandInfo {
|
|
|
|
string_representation: Some(value.to_string()),
|
|
|
|
is_negative: value < 0,
|
|
|
|
is_integral: true,
|
|
|
|
});
|
|
|
|
},
|
|
|
|
ty::Uint(_) => {
|
|
|
|
return Some(OperandInfo {
|
|
|
|
string_representation: None,
|
|
|
|
is_negative: false,
|
|
|
|
is_integral: true,
|
|
|
|
});
|
|
|
|
},
|
|
|
|
_ => {},
|
|
|
|
},
|
|
|
|
Some((Constant::F32(f), _)) => {
|
|
|
|
return Some(floating_point_operand_info(&f));
|
|
|
|
},
|
|
|
|
Some((Constant::F64(f), _)) => {
|
|
|
|
return Some(floating_point_operand_info(&f));
|
|
|
|
},
|
|
|
|
_ => {},
|
|
|
|
}
|
|
|
|
None
|
|
|
|
}
|
|
|
|
|
|
|
|
fn floating_point_operand_info<T: Display + PartialOrd + From<f32>>(f: &T) -> OperandInfo {
|
|
|
|
OperandInfo {
|
|
|
|
string_representation: Some(format!("{:.3}", *f)),
|
|
|
|
is_negative: *f < 0.0.into(),
|
|
|
|
is_integral: false,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn might_have_negative_value(t: &ty::TyS<'_>) -> bool {
|
|
|
|
t.is_signed() || t.is_floating_point()
|
|
|
|
}
|
|
|
|
|
2020-06-25 20:41:36 +00:00
|
|
|
fn check_const_operands<'tcx>(
|
|
|
|
cx: &LateContext<'tcx>,
|
2019-12-28 16:14:19 +00:00
|
|
|
expr: &'tcx Expr<'_>,
|
2019-12-26 12:34:18 +00:00
|
|
|
lhs_operand: &OperandInfo,
|
|
|
|
rhs_operand: &OperandInfo,
|
|
|
|
) {
|
|
|
|
if lhs_operand.is_negative ^ rhs_operand.is_negative {
|
|
|
|
span_lint_and_then(
|
|
|
|
cx,
|
|
|
|
MODULO_ARITHMETIC,
|
|
|
|
expr.span,
|
|
|
|
&format!(
|
|
|
|
"you are using modulo operator on constants with different signs: `{} % {}`",
|
|
|
|
lhs_operand.string_representation.as_ref().unwrap(),
|
|
|
|
rhs_operand.string_representation.as_ref().unwrap()
|
|
|
|
),
|
2020-04-17 06:08:00 +00:00
|
|
|
|diag| {
|
|
|
|
diag.note("double check for expected result especially when interoperating with different languages");
|
2019-12-26 12:34:18 +00:00
|
|
|
if lhs_operand.is_integral {
|
2020-04-17 06:08:00 +00:00
|
|
|
diag.note("or consider using `rem_euclid` or similar function");
|
2019-12-26 12:34:18 +00:00
|
|
|
}
|
|
|
|
},
|
|
|
|
);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-06-25 20:41:36 +00:00
|
|
|
fn check_non_const_operands<'tcx>(cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>, operand: &Expr<'_>) {
|
2020-07-17 08:47:04 +00:00
|
|
|
let operand_type = cx.typeck_results().expr_ty(operand);
|
2019-12-26 12:34:18 +00:00
|
|
|
if might_have_negative_value(operand_type) {
|
|
|
|
span_lint_and_then(
|
|
|
|
cx,
|
|
|
|
MODULO_ARITHMETIC,
|
|
|
|
expr.span,
|
|
|
|
"you are using modulo operator on types that might have different signs",
|
2020-04-17 06:08:00 +00:00
|
|
|
|diag| {
|
|
|
|
diag.note("double check for expected result especially when interoperating with different languages");
|
2019-12-26 12:34:18 +00:00
|
|
|
if operand_type.is_integral() {
|
2020-04-17 06:08:00 +00:00
|
|
|
diag.note("or consider using `rem_euclid` or similar function");
|
2019-12-26 12:34:18 +00:00
|
|
|
}
|
|
|
|
},
|
|
|
|
);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-06-25 20:41:36 +00:00
|
|
|
impl<'tcx> LateLintPass<'tcx> for ModuloArithmetic {
|
|
|
|
fn check_expr(&mut self, cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) {
|
2019-12-26 12:34:18 +00:00
|
|
|
match &expr.kind {
|
|
|
|
ExprKind::Binary(op, lhs, rhs) | ExprKind::AssignOp(op, lhs, rhs) => {
|
|
|
|
if let BinOpKind::Rem = op.node {
|
|
|
|
let lhs_operand = analyze_operand(lhs, cx, expr);
|
|
|
|
let rhs_operand = analyze_operand(rhs, cx, expr);
|
|
|
|
if_chain! {
|
|
|
|
if let Some(lhs_operand) = lhs_operand;
|
|
|
|
if let Some(rhs_operand) = rhs_operand;
|
|
|
|
then {
|
|
|
|
check_const_operands(cx, expr, &lhs_operand, &rhs_operand);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
check_non_const_operands(cx, expr, lhs);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
},
|
|
|
|
_ => {},
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|