rust-clippy/clippy_lints/src/bytecount.rs

95 lines
3.9 KiB
Rust
Raw Normal View History

use clippy_utils::diagnostics::span_lint_and_sugg;
use clippy_utils::source::snippet_with_applicability;
2021-03-13 23:01:03 +00:00
use clippy_utils::ty::match_type;
2021-06-09 14:17:34 +00:00
use clippy_utils::visitors::LocalUsedVisitor;
use clippy_utils::{path_to_local_id, paths, peel_ref_operators, remove_blocks, strip_pat_refs};
use if_chain::if_chain;
use rustc_errors::Applicability;
2021-06-09 14:17:34 +00:00
use rustc_hir::{BinOpKind, Expr, ExprKind, PatKind};
2020-01-12 06:08:41 +00:00
use rustc_lint::{LateContext, LateLintPass};
use rustc_middle::ty::{self, UintTy};
2020-01-11 11:37:08 +00:00
use rustc_session::{declare_lint_pass, declare_tool_lint};
use rustc_span::sym;
2017-08-22 21:45:08 +00:00
2018-03-28 13:24:26 +00:00
declare_clippy_lint! {
/// **What it does:** Checks for naive byte counts
///
/// **Why is this bad?** The [`bytecount`](https://crates.io/crates/bytecount)
/// crate has methods to count your bytes faster, especially for large slices.
///
/// **Known problems:** If you have predominantly small slices, the
/// `bytecount::count(..)` method may actually be slower. However, if you can
/// ensure that less than 2³²-1 matches arise, the `naive_count_32(..)` can be
/// faster in those cases.
///
/// **Example:**
///
/// ```rust
/// # let vec = vec![1_u8];
/// &vec.iter().filter(|x| **x == 0u8).count(); // use bytecount::count instead
/// ```
2017-08-22 21:45:08 +00:00
pub NAIVE_BYTECOUNT,
pedantic,
2017-08-22 21:45:08 +00:00
"use of naive `<slice>.filter(|&x| x == y).count()` to count byte values"
}
2019-04-08 20:43:55 +00:00
declare_lint_pass!(ByteCount => [NAIVE_BYTECOUNT]);
2017-08-22 21:45:08 +00:00
impl<'tcx> LateLintPass<'tcx> for ByteCount {
fn check_expr(&mut self, cx: &LateContext<'_>, expr: &Expr<'_>) {
if_chain! {
2021-06-09 14:17:34 +00:00
if let ExprKind::MethodCall(count, _, [count_recv], _) = expr.kind;
2019-05-17 21:53:54 +00:00
if count.ident.name == sym!(count);
2021-06-09 14:17:34 +00:00
if let ExprKind::MethodCall(filter, _, [filter_recv, filter_arg], _) = count_recv.kind;
2019-05-17 21:53:54 +00:00
if filter.ident.name == sym!(filter);
2021-06-09 14:17:34 +00:00
if let ExprKind::Closure(_, _, body_id, _, _) = filter_arg.kind;
2021-03-30 19:59:59 +00:00
let body = cx.tcx.hir().body(body_id);
2021-06-09 14:17:34 +00:00
if let [param] = body.params;
if let PatKind::Binding(_, arg_id, _, _) = strip_pat_refs(param.pat).kind;
if let ExprKind::Binary(ref op, l, r) = body.value.kind;
2021-03-30 19:59:59 +00:00
if op.node == BinOpKind::Eq;
if match_type(cx,
2021-06-09 14:17:34 +00:00
cx.typeck_results().expr_ty(filter_recv).peel_refs(),
2021-03-30 19:59:59 +00:00
&paths::SLICE_ITER);
2021-06-09 14:17:34 +00:00
let operand_is_arg = |expr| {
let expr = peel_ref_operators(cx, remove_blocks(expr));
path_to_local_id(expr, arg_id)
};
let needle = if operand_is_arg(l) {
r
} else if operand_is_arg(r) {
l
} else {
return;
};
if ty::Uint(UintTy::U8) == *cx.typeck_results().expr_ty(needle).peel_refs().kind();
if !LocalUsedVisitor::new(cx, arg_id).check_expr(needle);
then {
let haystack = if let ExprKind::MethodCall(path, _, args, _) =
2021-06-09 14:17:34 +00:00
filter_recv.kind {
2021-03-30 19:59:59 +00:00
let p = path.ident.name;
if (p == sym::iter || p == sym!(iter_mut)) && args.len() == 1 {
&args[0]
} else {
2021-06-09 14:17:34 +00:00
&filter_recv
2021-03-30 19:59:59 +00:00
}
} else {
2021-06-09 14:17:34 +00:00
&filter_recv
2021-03-30 19:59:59 +00:00
};
let mut applicability = Applicability::MaybeIncorrect;
span_lint_and_sugg(
cx,
NAIVE_BYTECOUNT,
expr.span,
"you appear to be counting bytes the naive way",
"consider using the bytecount crate",
format!("bytecount::count({}, {})",
snippet_with_applicability(cx, haystack.span, "..", &mut applicability),
snippet_with_applicability(cx, needle.span, "..", &mut applicability)),
applicability,
);
}
};
2017-08-22 21:45:08 +00:00
}
}