rust/clippy_lints/src/swap.rs

216 lines
8.5 KiB
Rust
Raw Normal View History

2018-10-06 11:18:06 -05:00
// Copyright 2014-2018 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
2018-07-19 02:24:19 -05:00
use matches::matches;
use crate::rustc::hir::*;
use crate::rustc::lint::{LateContext, LateLintPass, LintArray, LintPass};
use crate::rustc::{declare_tool_lint, lint_array};
2018-07-19 03:00:54 -05:00
use if_chain::if_chain;
use crate::rustc::ty;
2018-05-30 03:15:50 -05:00
use crate::utils::{differing_macro_contexts, match_type, paths, snippet, span_lint_and_then, walk_ptrs_ty, SpanlessEq};
use crate::utils::sugg::Sugg;
use crate::rustc_errors::Applicability;
2016-02-27 17:46:02 -06:00
/// **What it does:** Checks for manual swapping.
2016-02-27 17:46:02 -06:00
///
/// **Why is this bad?** The `std::mem::swap` function exposes the intent better
/// without deinitializing or copying either variable.
2016-02-27 17:46:02 -06:00
///
/// **Known problems:** None.
///
/// **Example:**
/// ```rust,ignore
/// let t = b;
/// b = a;
/// a = t;
/// ```
/// Use std::mem::swap():
/// ```rust
/// std::mem::swap(&mut a, &mut b);
/// ```
2018-03-28 08:24:26 -05:00
declare_clippy_lint! {
2016-02-27 17:46:02 -06:00
pub MANUAL_SWAP,
2018-03-28 08:24:26 -05:00
complexity,
"manual swap of two variables"
2016-02-27 17:46:02 -06:00
}
2016-02-27 17:01:15 -06:00
/// **What it does:** Checks for `foo = bar; bar = foo` sequences.
2016-02-27 17:01:15 -06:00
///
/// **Why is this bad?** This looks like a failed attempt to swap.
///
/// **Known problems:** None.
///
/// **Example:**
/// ```rust,ignore
/// a = b;
/// b = a;
/// ```
2018-03-28 08:24:26 -05:00
declare_clippy_lint! {
2016-02-27 17:46:02 -06:00
pub ALMOST_SWAPPED,
2018-03-28 08:24:26 -05:00
correctness,
2016-02-27 17:01:15 -06:00
"`foo = bar; bar = foo` sequence"
}
2017-08-09 02:30:56 -05:00
#[derive(Copy, Clone)]
2016-02-27 17:01:15 -06:00
pub struct Swap;
impl LintPass for Swap {
fn get_lints(&self) -> LintArray {
2016-02-27 17:46:02 -06:00
lint_array![MANUAL_SWAP, ALMOST_SWAPPED]
2016-02-27 17:01:15 -06:00
}
}
impl<'a, 'tcx> LateLintPass<'a, 'tcx> for Swap {
fn check_block(&mut self, cx: &LateContext<'a, 'tcx>, block: &'tcx Block) {
2016-02-27 17:46:02 -06:00
check_manual_swap(cx, block);
check_suspicious_swap(cx, block);
}
}
/// Implementation of the `MANUAL_SWAP` lint.
2018-07-23 06:01:12 -05:00
fn check_manual_swap(cx: &LateContext<'_, '_>, block: &Block) {
2016-02-27 17:46:02 -06:00
for w in block.stmts.windows(3) {
if_chain! {
2016-02-27 17:46:02 -06:00
// let t = foo();
2018-07-12 03:53:53 -05:00
if let StmtKind::Decl(ref tmp, _) = w[0].node;
2018-07-16 08:07:39 -05:00
if let DeclKind::Local(ref tmp) = tmp.node;
if let Some(ref tmp_init) = tmp.init;
2018-06-28 08:46:58 -05:00
if let PatKind::Binding(_, _, ident, None) = tmp.pat.node;
2016-02-27 17:46:02 -06:00
// foo() = bar();
2018-07-12 03:53:53 -05:00
if let StmtKind::Semi(ref first, _) = w[1].node;
2018-07-12 02:30:57 -05:00
if let ExprKind::Assign(ref lhs1, ref rhs1) = first.node;
2016-02-27 17:46:02 -06:00
// bar() = t;
2018-07-12 03:53:53 -05:00
if let StmtKind::Semi(ref second, _) = w[2].node;
2018-07-12 02:30:57 -05:00
if let ExprKind::Assign(ref lhs2, ref rhs2) = second.node;
if let ExprKind::Path(QPath::Resolved(None, ref rhs2)) = rhs2.node;
if rhs2.segments.len() == 1;
2018-06-28 08:46:58 -05:00
if ident.as_str() == rhs2.segments[0].ident.as_str();
if SpanlessEq::new(cx).ignore_fn().eq_expr(tmp_init, lhs1);
if SpanlessEq::new(cx).ignore_fn().eq_expr(rhs1, lhs2);
then {
fn check_for_slice<'a>(
2018-07-23 06:01:12 -05:00
cx: &LateContext<'_, '_>,
lhs1: &'a Expr,
lhs2: &'a Expr,
) -> Option<(&'a Expr, &'a Expr, &'a Expr)> {
2018-07-12 02:30:57 -05:00
if let ExprKind::Index(ref lhs1, ref idx1) = lhs1.node {
if let ExprKind::Index(ref lhs2, ref idx2) = lhs2.node {
if SpanlessEq::new(cx).ignore_fn().eq_expr(lhs1, lhs2) {
let ty = walk_ptrs_ty(cx.tables.expr_ty(lhs1));
2017-11-04 14:55:56 -05:00
if matches!(ty.sty, ty::Slice(_)) ||
matches!(ty.sty, ty::Array(_, _)) ||
match_type(cx, ty, &paths::VEC) ||
match_type(cx, ty, &paths::VEC_DEQUE) {
return Some((lhs1, idx1, idx2));
}
}
}
}
2017-11-04 14:55:56 -05:00
None
}
2017-11-04 14:55:56 -05:00
let (replace, what, sugg) = if let Some((slice, idx1, idx2)) = check_for_slice(cx, lhs1, lhs2) {
if let Some(slice) = Sugg::hir_opt(cx, slice) {
(false,
format!(" elements of `{}`", slice),
format!("{}.swap({}, {})",
slice.maybe_par(),
snippet(cx, idx1.span, ".."),
snippet(cx, idx2.span, "..")))
} else {
(false, String::new(), String::new())
}
} else if let (Some(first), Some(second)) = (Sugg::hir_opt(cx, lhs1), Sugg::hir_opt(cx, rhs1)) {
(true, format!(" `{}` and `{}`", first, second),
format!("std::mem::swap({}, {})", first.mut_addr(), second.mut_addr()))
} else {
(true, String::new(), String::new())
};
2017-11-04 14:55:56 -05:00
let span = w[0].span.to(second.span);
2017-11-04 14:55:56 -05:00
span_lint_and_then(cx,
MANUAL_SWAP,
span,
&format!("this looks like you are swapping{} manually", what),
|db| {
if !sugg.is_empty() {
db.span_suggestion_with_applicability(
2018-09-18 10:07:54 -05:00
span,
"try",
sugg,
Applicability::Unspecified,
);
2017-11-04 14:55:56 -05:00
if replace {
db.note("or maybe you should use `std::mem::replace`?");
}
}
});
}
}
2016-02-27 17:46:02 -06:00
}
}
/// Implementation of the `ALMOST_SWAPPED` lint.
2018-07-23 06:01:12 -05:00
fn check_suspicious_swap(cx: &LateContext<'_, '_>, block: &Block) {
2016-02-27 17:46:02 -06:00
for w in block.stmts.windows(2) {
if_chain! {
2018-07-12 03:53:53 -05:00
if let StmtKind::Semi(ref first, _) = w[0].node;
if let StmtKind::Semi(ref second, _) = w[1].node;
if !differing_macro_contexts(first.span, second.span);
2018-07-12 02:30:57 -05:00
if let ExprKind::Assign(ref lhs0, ref rhs0) = first.node;
if let ExprKind::Assign(ref lhs1, ref rhs1) = second.node;
if SpanlessEq::new(cx).ignore_fn().eq_expr(lhs0, rhs1);
if SpanlessEq::new(cx).ignore_fn().eq_expr(lhs1, rhs0);
then {
let lhs0 = Sugg::hir_opt(cx, lhs0);
let rhs0 = Sugg::hir_opt(cx, rhs0);
let (what, lhs, rhs) = if let (Some(first), Some(second)) = (lhs0, rhs0) {
(
format!(" `{}` and `{}`", first, second),
first.mut_addr().to_string(),
second.mut_addr().to_string(),
)
} else {
(String::new(), String::new(), String::new())
};
2017-11-04 14:55:56 -05:00
let span = first.span.to(second.span);
2017-11-04 14:55:56 -05:00
span_lint_and_then(cx,
ALMOST_SWAPPED,
span,
&format!("this looks like you are trying to swap{}", what),
|db| {
if !what.is_empty() {
db.span_suggestion_with_applicability(
2018-09-18 10:07:54 -05:00
span,
"try",
format!(
"std::mem::swap({}, {})",
lhs,
rhs,
),
Applicability::MaybeIncorrect,
2018-09-18 10:07:54 -05:00
);
db.note("or maybe you should use `std::mem::replace`?");
}
});
}
}
2016-02-27 17:01:15 -06:00
}
}