rust-clippy/clippy_lints/src/no_effect.rs

217 lines
8.1 KiB
Rust
Raw Normal View History

use clippy_utils::diagnostics::{span_lint_hir, span_lint_hir_and_then};
use clippy_utils::source::snippet_opt;
use clippy_utils::ty::has_drop;
use rustc_errors::Applicability;
2020-01-06 16:39:50 +00:00
use rustc_hir::def::{DefKind, Res};
use rustc_hir::{is_range_literal, BinOpKind, BlockCheckMode, Expr, ExprKind, Stmt, StmtKind, UnsafeSource};
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};
use std::ops::Deref;
2015-10-28 16:50:00 +00:00
2018-03-28 13:24:26 +00:00
declare_clippy_lint! {
/// ### What it does
/// Checks for statements which have no effect.
///
/// ### Why is this bad?
/// Similar to dead code, these statements are actually
/// executed. However, as they have no effect, all they do is make the code less
/// readable.
///
/// ### Example
/// ```rust
/// 0;
/// ```
2015-10-28 16:50:00 +00:00
pub NO_EFFECT,
2018-03-28 13:24:26 +00:00
complexity,
2015-10-28 16:50:00 +00:00
"statements with no effect"
}
2018-03-28 13:24:26 +00:00
declare_clippy_lint! {
/// ### What it does
/// Checks for expression statements that can be reduced to a
/// sub-expression.
///
/// ### Why is this bad?
/// Expressions by themselves often have no side-effects.
/// Having such expressions reduces readability.
///
/// ### Example
/// ```rust,ignore
/// compute_array()[0];
/// ```
pub UNNECESSARY_OPERATION,
2018-03-28 13:24:26 +00:00
complexity,
"outer expressions with no effect"
}
fn has_no_effect(cx: &LateContext<'_>, expr: &Expr<'_>) -> bool {
2019-08-19 16:30:32 +00:00
if expr.span.from_expansion() {
2015-10-28 16:50:00 +00:00
return false;
}
2019-09-27 15:16:06 +00:00
match expr.kind {
2019-09-12 06:36:05 +00:00
ExprKind::Lit(..) | ExprKind::Closure(..) => true,
2020-07-17 08:47:04 +00:00
ExprKind::Path(..) => !has_drop(cx, cx.typeck_results().expr_ty(expr)),
ExprKind::Index(a, b) | ExprKind::Binary(_, a, b) => has_no_effect(cx, a) && has_no_effect(cx, b),
ExprKind::Array(v) | ExprKind::Tup(v) => v.iter().all(|val| has_no_effect(cx, val)),
ExprKind::Repeat(inner, _)
| ExprKind::Cast(inner, _)
| ExprKind::Type(inner, _)
| ExprKind::Unary(_, inner)
| ExprKind::Field(inner, _)
| ExprKind::AddrOf(_, _, inner)
| ExprKind::Box(inner) => has_no_effect(cx, inner),
ExprKind::Struct(_, fields, ref base) => {
2020-07-17 08:47:04 +00:00
!has_drop(cx, cx.typeck_results().expr_ty(expr))
&& fields.iter().all(|field| has_no_effect(cx, field.expr))
2019-09-04 14:19:59 +00:00
&& base.as_ref().map_or(true, |base| has_no_effect(cx, base))
2016-12-20 17:21:30 +00:00
},
ExprKind::Call(callee, args) => {
2019-09-27 15:16:06 +00:00
if let ExprKind::Path(ref qpath) = callee.kind {
2021-01-18 19:36:32 +00:00
let res = cx.qpath_res(qpath, callee.hir_id);
let def_matched = matches!(
res,
Res::Def(DefKind::Struct | DefKind::Variant | DefKind::Ctor(..), ..)
);
if def_matched || is_range_literal(expr) {
!has_drop(cx, cx.typeck_results().expr_ty(expr)) && args.iter().all(|arg| has_no_effect(cx, arg))
} else {
false
2018-11-27 20:14:15 +00:00
}
2017-09-05 09:33:04 +00:00
} else {
false
}
2016-12-20 17:21:30 +00:00
},
ExprKind::Block(block, _) => {
2019-09-04 14:19:59 +00:00
block.stmts.is_empty() && block.expr.as_ref().map_or(false, |expr| has_no_effect(cx, expr))
2018-11-27 20:14:15 +00:00
},
2015-10-28 16:50:00 +00:00
_ => false,
}
}
2019-04-08 20:43:55 +00:00
declare_lint_pass!(NoEffect => [NO_EFFECT, UNNECESSARY_OPERATION]);
2015-10-28 16:50:00 +00:00
impl<'tcx> LateLintPass<'tcx> for NoEffect {
fn check_stmt(&mut self, cx: &LateContext<'tcx>, stmt: &'tcx Stmt<'_>) {
if let StmtKind::Semi(expr) = stmt.kind {
2015-10-28 16:50:00 +00:00
if has_no_effect(cx, expr) {
span_lint_hir(cx, NO_EFFECT, expr.hir_id, stmt.span, "statement with no effect");
} else if let Some(reduced) = reduce_expression(cx, expr) {
for e in &reduced {
2019-08-19 16:30:32 +00:00
if e.span.from_expansion() {
return;
}
}
if let ExprKind::Index(..) = &expr.kind {
let snippet;
if_chain! {
if let Some(arr) = snippet_opt(cx, reduced[0].span);
if let Some(func) = snippet_opt(cx, reduced[1].span);
then {
snippet = format!("assert!({}.len() > {});", &arr, &func);
} else {
return;
}
}
span_lint_hir_and_then(
cx,
UNNECESSARY_OPERATION,
expr.hir_id,
stmt.span,
"unnecessary operation",
|diag| {
diag.span_suggestion(
stmt.span,
"statement can be written as",
snippet,
Applicability::MaybeIncorrect,
);
},
);
} else {
let mut snippet = String::new();
for e in reduced {
if let Some(snip) = snippet_opt(cx, e.span) {
snippet.push_str(&snip);
snippet.push(';');
} else {
return;
}
}
span_lint_hir_and_then(
cx,
UNNECESSARY_OPERATION,
expr.hir_id,
stmt.span,
"unnecessary operation",
|diag| {
diag.span_suggestion(
stmt.span,
"statement can be reduced to",
snippet,
Applicability::MachineApplicable,
);
},
);
}
}
}
}
}
fn reduce_expression<'a>(cx: &LateContext<'_>, expr: &'a Expr<'a>) -> Option<Vec<&'a Expr<'a>>> {
2019-08-19 16:30:32 +00:00
if expr.span.from_expansion() {
return None;
}
2019-09-27 15:16:06 +00:00
match expr.kind {
ExprKind::Index(a, b) => Some(vec![a, b]),
ExprKind::Binary(ref binop, a, b) if binop.node != BinOpKind::And && binop.node != BinOpKind::Or => {
Some(vec![a, b])
},
ExprKind::Array(v) | ExprKind::Tup(v) => Some(v.iter().collect()),
ExprKind::Repeat(inner, _)
| ExprKind::Cast(inner, _)
| ExprKind::Type(inner, _)
| ExprKind::Unary(_, inner)
| ExprKind::Field(inner, _)
| ExprKind::AddrOf(_, _, inner)
| ExprKind::Box(inner) => reduce_expression(cx, inner).or_else(|| Some(vec![inner])),
ExprKind::Struct(_, fields, ref base) => {
2020-07-17 08:47:04 +00:00
if has_drop(cx, cx.typeck_results().expr_ty(expr)) {
2018-11-27 20:14:15 +00:00
None
} else {
Some(fields.iter().map(|f| &f.expr).chain(base).map(Deref::deref).collect())
}
},
ExprKind::Call(callee, args) => {
2019-09-27 15:16:06 +00:00
if let ExprKind::Path(ref qpath) = callee.kind {
2021-01-18 19:36:32 +00:00
let res = cx.qpath_res(qpath, callee.hir_id);
match res {
Res::Def(DefKind::Struct | DefKind::Variant | DefKind::Ctor(..), ..)
2020-07-17 08:47:04 +00:00
if !has_drop(cx, cx.typeck_results().expr_ty(expr)) =>
{
2018-11-27 20:14:15 +00:00
Some(args.iter().collect())
},
_ => None,
}
} else {
None
}
2016-12-20 17:21:30 +00:00
},
ExprKind::Block(block, _) => {
if block.stmts.is_empty() {
block.expr.as_ref().and_then(|e| {
match block.rules {
BlockCheckMode::UnsafeBlock(UnsafeSource::UserProvided) => None,
BlockCheckMode::DefaultBlock => Some(vec![&**e]),
// in case of compiler-inserted signaling blocks
BlockCheckMode::UnsafeBlock(_) => reduce_expression(cx, e),
}
})
} else {
None
2015-10-28 16:50:00 +00:00
}
2016-12-20 17:21:30 +00:00
},
_ => None,
2015-10-28 16:50:00 +00:00
}
}