2021-03-25 18:29:11 +00:00
|
|
|
use clippy_utils::diagnostics::span_lint;
|
|
|
|
use clippy_utils::SpanlessEq;
|
2018-11-27 20:14:15 +00:00
|
|
|
use if_chain::if_chain;
|
2020-02-21 08:39:38 +00:00
|
|
|
use rustc_hir::{BinOpKind, Expr, ExprKind, QPath};
|
2020-01-12 06:08:41 +00:00
|
|
|
use rustc_lint::{LateContext, LateLintPass};
|
2020-01-11 11:37:08 +00:00
|
|
|
use rustc_session::{declare_lint_pass, declare_tool_lint};
|
2016-03-06 15:01:17 +00:00
|
|
|
|
2018-03-28 13:24:26 +00:00
|
|
|
declare_clippy_lint! {
|
2021-07-29 10:16:06 +00:00
|
|
|
/// ### What it does
|
|
|
|
/// Detects classic underflow/overflow checks.
|
2019-03-05 16:50:33 +00:00
|
|
|
///
|
2021-07-29 10:16:06 +00:00
|
|
|
/// ### Why is this bad?
|
|
|
|
/// Most classic C underflow/overflow checks will fail in
|
2019-03-05 16:50:33 +00:00
|
|
|
/// Rust. Users can use functions like `overflowing_*` and `wrapping_*` instead.
|
|
|
|
///
|
2021-07-29 10:16:06 +00:00
|
|
|
/// ### Example
|
2019-03-05 16:50:33 +00:00
|
|
|
/// ```rust
|
2019-08-02 06:13:54 +00:00
|
|
|
/// # let a = 1;
|
|
|
|
/// # let b = 2;
|
|
|
|
/// a + b < a;
|
2019-03-05 16:50:33 +00:00
|
|
|
/// ```
|
2016-08-06 08:18:36 +00:00
|
|
|
pub OVERFLOW_CHECK_CONDITIONAL,
|
2018-03-28 13:24:26 +00:00
|
|
|
complexity,
|
2016-08-06 08:18:36 +00:00
|
|
|
"overflow checks inspired by C which are likely to panic"
|
|
|
|
}
|
2016-03-06 15:01:17 +00:00
|
|
|
|
2019-04-08 20:43:55 +00:00
|
|
|
declare_lint_pass!(OverflowCheckConditional => [OVERFLOW_CHECK_CONDITIONAL]);
|
2016-03-06 15:01:17 +00:00
|
|
|
|
2020-06-25 20:41:36 +00:00
|
|
|
impl<'tcx> LateLintPass<'tcx> for OverflowCheckConditional {
|
2016-03-08 05:33:30 +00:00
|
|
|
// a + b < a, a > a + b, a < a - b, a - b > a
|
2020-06-25 20:41:36 +00:00
|
|
|
fn check_expr(&mut self, cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) {
|
2018-07-14 22:00:27 +00:00
|
|
|
let eq = |l, r| SpanlessEq::new(cx).eq_path_segment(l, r);
|
2017-10-23 19:18:02 +00:00
|
|
|
if_chain! {
|
2021-04-08 15:50:13 +00:00
|
|
|
if let ExprKind::Binary(ref op, first, second) = expr.kind;
|
|
|
|
if let ExprKind::Binary(ref op2, ident1, ident2) = first.kind;
|
|
|
|
if let ExprKind::Path(QPath::Resolved(_, path1)) = ident1.kind;
|
|
|
|
if let ExprKind::Path(QPath::Resolved(_, path2)) = ident2.kind;
|
|
|
|
if let ExprKind::Path(QPath::Resolved(_, path3)) = second.kind;
|
2018-07-14 22:00:27 +00:00
|
|
|
if eq(&path1.segments[0], &path3.segments[0]) || eq(&path2.segments[0], &path3.segments[0]);
|
2020-07-17 08:47:04 +00:00
|
|
|
if cx.typeck_results().expr_ty(ident1).is_integral();
|
|
|
|
if cx.typeck_results().expr_ty(ident2).is_integral();
|
2017-10-23 19:18:02 +00:00
|
|
|
then {
|
2018-07-12 07:50:09 +00:00
|
|
|
if let BinOpKind::Lt = op.node {
|
2018-07-16 13:07:39 +00:00
|
|
|
if let BinOpKind::Add = op2.node {
|
2017-10-23 19:18:02 +00:00
|
|
|
span_lint(cx, OVERFLOW_CHECK_CONDITIONAL, expr.span,
|
2020-08-11 13:43:21 +00:00
|
|
|
"you are trying to use classic C overflow conditions that will fail in Rust");
|
2017-10-23 19:18:02 +00:00
|
|
|
}
|
2016-03-08 05:33:30 +00:00
|
|
|
}
|
2018-07-12 07:50:09 +00:00
|
|
|
if let BinOpKind::Gt = op.node {
|
|
|
|
if let BinOpKind::Sub = op2.node {
|
2017-10-23 19:18:02 +00:00
|
|
|
span_lint(cx, OVERFLOW_CHECK_CONDITIONAL, expr.span,
|
2020-08-11 13:43:21 +00:00
|
|
|
"you are trying to use classic C underflow conditions that will fail in Rust");
|
2017-10-23 19:18:02 +00:00
|
|
|
}
|
2016-03-08 05:33:30 +00:00
|
|
|
}
|
|
|
|
}
|
2017-10-23 19:18:02 +00:00
|
|
|
}
|
2016-03-07 21:27:45 +00:00
|
|
|
|
2017-10-23 19:18:02 +00:00
|
|
|
if_chain! {
|
2021-04-08 15:50:13 +00:00
|
|
|
if let ExprKind::Binary(ref op, first, second) = expr.kind;
|
|
|
|
if let ExprKind::Binary(ref op2, ident1, ident2) = second.kind;
|
|
|
|
if let ExprKind::Path(QPath::Resolved(_, path1)) = ident1.kind;
|
|
|
|
if let ExprKind::Path(QPath::Resolved(_, path2)) = ident2.kind;
|
|
|
|
if let ExprKind::Path(QPath::Resolved(_, path3)) = first.kind;
|
2018-07-14 22:00:27 +00:00
|
|
|
if eq(&path1.segments[0], &path3.segments[0]) || eq(&path2.segments[0], &path3.segments[0]);
|
2020-07-17 08:47:04 +00:00
|
|
|
if cx.typeck_results().expr_ty(ident1).is_integral();
|
|
|
|
if cx.typeck_results().expr_ty(ident2).is_integral();
|
2017-10-23 19:18:02 +00:00
|
|
|
then {
|
2018-07-12 07:50:09 +00:00
|
|
|
if let BinOpKind::Gt = op.node {
|
2018-07-16 13:07:39 +00:00
|
|
|
if let BinOpKind::Add = op2.node {
|
2017-10-23 19:18:02 +00:00
|
|
|
span_lint(cx, OVERFLOW_CHECK_CONDITIONAL, expr.span,
|
2020-08-11 13:43:21 +00:00
|
|
|
"you are trying to use classic C overflow conditions that will fail in Rust");
|
2017-10-23 19:18:02 +00:00
|
|
|
}
|
2016-03-08 05:33:30 +00:00
|
|
|
}
|
2018-07-12 07:50:09 +00:00
|
|
|
if let BinOpKind::Lt = op.node {
|
|
|
|
if let BinOpKind::Sub = op2.node {
|
2017-10-23 19:18:02 +00:00
|
|
|
span_lint(cx, OVERFLOW_CHECK_CONDITIONAL, expr.span,
|
2020-08-11 13:43:21 +00:00
|
|
|
"you are trying to use classic C underflow conditions that will fail in Rust");
|
2017-10-23 19:18:02 +00:00
|
|
|
}
|
2016-03-08 05:33:30 +00:00
|
|
|
}
|
|
|
|
}
|
2017-10-23 19:18:02 +00:00
|
|
|
}
|
2016-03-06 15:01:17 +00:00
|
|
|
}
|
|
|
|
}
|