2021-05-02 16:42:28 +00:00
|
|
|
use clippy_utils::diagnostics::{span_lint_and_sugg, span_lint_and_then};
|
2021-03-14 23:17:44 +00:00
|
|
|
use clippy_utils::source::snippet_with_applicability;
|
2021-03-16 16:06:34 +00:00
|
|
|
use clippy_utils::sugg::Sugg;
|
2021-03-13 23:01:03 +00:00
|
|
|
use clippy_utils::ty::is_type_diagnostic_item;
|
2021-03-16 16:06:34 +00:00
|
|
|
use clippy_utils::{differing_macro_contexts, eq_expr_value};
|
2018-11-27 20:14:15 +00:00
|
|
|
use if_chain::if_chain;
|
2018-12-29 15:04:45 +00:00
|
|
|
use rustc_errors::Applicability;
|
2021-05-02 16:42:28 +00:00
|
|
|
use rustc_hir::{BinOpKind, Block, Expr, ExprKind, PatKind, QPath, Stmt, StmtKind};
|
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;
|
2020-01-11 11:37:08 +00:00
|
|
|
use rustc_session::{declare_lint_pass, declare_tool_lint};
|
2021-05-02 16:42:28 +00:00
|
|
|
use rustc_span::source_map::Spanned;
|
2020-11-05 13:29:48 +00:00
|
|
|
use rustc_span::sym;
|
2016-02-27 23:46:02 +00:00
|
|
|
|
2018-03-28 13:24:26 +00:00
|
|
|
declare_clippy_lint! {
|
2021-07-02 18:37:11 +00:00
|
|
|
/// ### What it does
|
|
|
|
/// Checks for manual swapping.
|
2019-03-05 16:50:33 +00:00
|
|
|
///
|
2021-07-02 18:37:11 +00:00
|
|
|
/// ### Why is this bad?
|
|
|
|
/// The `std::mem::swap` function exposes the intent better
|
2019-03-05 16:50:33 +00:00
|
|
|
/// without deinitializing or copying either variable.
|
|
|
|
///
|
2021-07-02 18:37:11 +00:00
|
|
|
/// ### Example
|
2019-03-09 07:51:23 +00:00
|
|
|
/// ```rust
|
2019-08-02 06:13:54 +00:00
|
|
|
/// let mut a = 42;
|
|
|
|
/// let mut b = 1337;
|
|
|
|
///
|
2019-03-05 16:50:33 +00:00
|
|
|
/// let t = b;
|
|
|
|
/// b = a;
|
|
|
|
/// a = t;
|
|
|
|
/// ```
|
|
|
|
/// Use std::mem::swap():
|
|
|
|
/// ```rust
|
2019-08-02 06:13:54 +00:00
|
|
|
/// let mut a = 1;
|
|
|
|
/// let mut b = 2;
|
2019-03-05 16:50:33 +00:00
|
|
|
/// std::mem::swap(&mut a, &mut b);
|
|
|
|
/// ```
|
2016-02-27 23:46:02 +00:00
|
|
|
pub MANUAL_SWAP,
|
2018-03-28 13:24:26 +00:00
|
|
|
complexity,
|
2016-08-06 08:18:36 +00:00
|
|
|
"manual swap of two variables"
|
2016-02-27 23:46:02 +00:00
|
|
|
}
|
2016-02-27 23:01:15 +00:00
|
|
|
|
2018-03-28 13:24:26 +00:00
|
|
|
declare_clippy_lint! {
|
2021-07-02 18:37:11 +00:00
|
|
|
/// ### What it does
|
|
|
|
/// Checks for `foo = bar; bar = foo` sequences.
|
2019-03-05 16:50:33 +00:00
|
|
|
///
|
2021-07-02 18:37:11 +00:00
|
|
|
/// ### Why is this bad?
|
|
|
|
/// This looks like a failed attempt to swap.
|
2019-03-05 16:50:33 +00:00
|
|
|
///
|
2021-07-02 18:37:11 +00:00
|
|
|
/// ### Example
|
2019-03-09 07:51:23 +00:00
|
|
|
/// ```rust
|
|
|
|
/// # let mut a = 1;
|
|
|
|
/// # let mut b = 2;
|
2019-03-05 16:50:33 +00:00
|
|
|
/// a = b;
|
|
|
|
/// b = a;
|
|
|
|
/// ```
|
2020-03-18 01:50:39 +00:00
|
|
|
/// If swapping is intended, use `swap()` instead:
|
2019-08-18 19:37:47 +00:00
|
|
|
/// ```rust
|
|
|
|
/// # let mut a = 1;
|
|
|
|
/// # let mut b = 2;
|
|
|
|
/// std::mem::swap(&mut a, &mut b);
|
|
|
|
/// ```
|
2016-02-27 23:46:02 +00:00
|
|
|
pub ALMOST_SWAPPED,
|
2018-03-28 13:24:26 +00:00
|
|
|
correctness,
|
2016-02-27 23:01:15 +00:00
|
|
|
"`foo = bar; bar = foo` sequence"
|
|
|
|
}
|
|
|
|
|
2021-05-02 16:42:28 +00:00
|
|
|
declare_clippy_lint! {
|
|
|
|
/// **What it does:** Checks for uses of xor-based swaps.
|
|
|
|
///
|
|
|
|
/// **Why is this bad?** The `std::mem::swap` function exposes the intent better
|
|
|
|
/// without deinitializing or copying either variable.
|
|
|
|
///
|
|
|
|
/// **Known problems:** None.
|
|
|
|
///
|
|
|
|
/// **Example:**
|
|
|
|
///
|
|
|
|
/// ```rust
|
|
|
|
/// let mut a = 1;
|
|
|
|
/// let mut b = 2;
|
|
|
|
///
|
|
|
|
/// a ^= b;
|
|
|
|
/// b ^= a;
|
|
|
|
/// a ^= b;
|
|
|
|
/// ```
|
|
|
|
///
|
|
|
|
/// Use std::mem::swap() instead:
|
|
|
|
/// ```rust
|
|
|
|
/// let mut a = 1;
|
|
|
|
/// let mut b = 2;
|
|
|
|
/// std::mem::swap(&mut a, &mut b);
|
|
|
|
/// ```
|
|
|
|
pub XOR_SWAP,
|
|
|
|
complexity,
|
|
|
|
"xor-based swap of two variables"
|
|
|
|
}
|
|
|
|
|
|
|
|
declare_lint_pass!(Swap => [MANUAL_SWAP, ALMOST_SWAPPED, XOR_SWAP]);
|
2016-02-27 23:01:15 +00:00
|
|
|
|
2020-06-25 20:41:36 +00:00
|
|
|
impl<'tcx> LateLintPass<'tcx> for Swap {
|
|
|
|
fn check_block(&mut self, cx: &LateContext<'tcx>, block: &'tcx Block<'_>) {
|
2016-02-27 23:46:02 +00:00
|
|
|
check_manual_swap(cx, block);
|
|
|
|
check_suspicious_swap(cx, block);
|
2021-05-02 16:42:28 +00:00
|
|
|
check_xor_swap(cx, block);
|
2016-02-27 23:46:02 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Implementation of the `MANUAL_SWAP` lint.
|
2020-06-25 20:41:36 +00:00
|
|
|
fn check_manual_swap(cx: &LateContext<'_>, block: &Block<'_>) {
|
2016-02-27 23:46:02 +00:00
|
|
|
for w in block.stmts.windows(3) {
|
2017-10-23 19:18:02 +00:00
|
|
|
if_chain! {
|
2016-02-27 23:46:02 +00:00
|
|
|
// let t = foo();
|
2021-04-02 21:35:32 +00:00
|
|
|
if let StmtKind::Local(tmp) = w[0].kind;
|
|
|
|
if let Some(tmp_init) = tmp.init;
|
2019-09-27 15:16:06 +00:00
|
|
|
if let PatKind::Binding(.., ident, None) = tmp.pat.kind;
|
2016-02-27 23:46:02 +00:00
|
|
|
|
|
|
|
// foo() = bar();
|
2021-04-02 21:35:32 +00:00
|
|
|
if let StmtKind::Semi(first) = w[1].kind;
|
|
|
|
if let ExprKind::Assign(lhs1, rhs1, _) = first.kind;
|
2016-02-27 23:46:02 +00:00
|
|
|
|
|
|
|
// bar() = t;
|
2021-04-02 21:35:32 +00:00
|
|
|
if let StmtKind::Semi(second) = w[2].kind;
|
|
|
|
if let ExprKind::Assign(lhs2, rhs2, _) = second.kind;
|
|
|
|
if let ExprKind::Path(QPath::Resolved(None, rhs2)) = rhs2.kind;
|
2017-10-23 19:18:02 +00:00
|
|
|
if rhs2.segments.len() == 1;
|
|
|
|
|
2021-01-15 09:56:44 +00:00
|
|
|
if ident.name == rhs2.segments[0].ident.name;
|
2020-08-28 14:10:16 +00:00
|
|
|
if eq_expr_value(cx, tmp_init, lhs1);
|
|
|
|
if eq_expr_value(cx, rhs1, lhs2);
|
2017-10-23 19:18:02 +00:00
|
|
|
then {
|
2021-04-02 21:35:32 +00:00
|
|
|
if let ExprKind::Field(lhs1, _) = lhs1.kind {
|
|
|
|
if let ExprKind::Field(lhs2, _) = lhs2.kind {
|
2020-03-19 13:33:10 +00:00
|
|
|
if lhs1.hir_id.owner == lhs2.hir_id.owner {
|
2019-08-31 16:50:22 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-12-03 12:42:05 +00:00
|
|
|
let mut applicability = Applicability::MachineApplicable;
|
2019-12-03 12:20:42 +00:00
|
|
|
|
2019-12-03 12:42:05 +00:00
|
|
|
let slice = check_for_slice(cx, lhs1, lhs2);
|
2019-12-03 12:20:42 +00:00
|
|
|
let (replace, what, sugg) = if let Slice::NotSwappable = slice {
|
|
|
|
return;
|
|
|
|
} else if let Slice::Swappable(slice, idx1, idx2) = slice {
|
2017-10-23 19:18:02 +00:00
|
|
|
if let Some(slice) = Sugg::hir_opt(cx, slice) {
|
2019-12-03 12:21:00 +00:00
|
|
|
(
|
|
|
|
false,
|
|
|
|
format!(" elements of `{}`", slice),
|
|
|
|
format!(
|
|
|
|
"{}.swap({}, {})",
|
|
|
|
slice.maybe_par(),
|
2019-12-03 12:42:05 +00:00
|
|
|
snippet_with_applicability(cx, idx1.span, "..", &mut applicability),
|
|
|
|
snippet_with_applicability(cx, idx2.span, "..", &mut applicability),
|
2019-12-03 12:21:00 +00:00
|
|
|
),
|
|
|
|
)
|
2017-10-23 19:18:02 +00:00
|
|
|
} else {
|
2018-08-21 10:46:18 +00:00
|
|
|
(false, String::new(), String::new())
|
2017-10-23 19:18:02 +00:00
|
|
|
}
|
|
|
|
} else if let (Some(first), Some(second)) = (Sugg::hir_opt(cx, lhs1), Sugg::hir_opt(cx, rhs1)) {
|
2019-12-03 12:21:00 +00:00
|
|
|
(
|
|
|
|
true,
|
|
|
|
format!(" `{}` and `{}`", first, second),
|
|
|
|
format!("std::mem::swap({}, {})", first.mut_addr(), second.mut_addr()),
|
|
|
|
)
|
2016-06-05 18:19:00 +00:00
|
|
|
} else {
|
2018-09-15 09:25:40 +00:00
|
|
|
(true, String::new(), String::new())
|
2017-10-23 19:18:02 +00:00
|
|
|
};
|
2017-11-04 19:55:56 +00:00
|
|
|
|
2017-10-23 19:18:02 +00:00
|
|
|
let span = w[0].span.to(second.span);
|
2017-11-04 19:55:56 +00:00
|
|
|
|
2019-12-03 12:21:00 +00:00
|
|
|
span_lint_and_then(
|
|
|
|
cx,
|
|
|
|
MANUAL_SWAP,
|
|
|
|
span,
|
|
|
|
&format!("this looks like you are swapping{} manually", what),
|
2020-04-17 06:08:00 +00:00
|
|
|
|diag| {
|
2019-12-03 12:21:00 +00:00
|
|
|
if !sugg.is_empty() {
|
2020-04-17 06:08:00 +00:00
|
|
|
diag.span_suggestion(
|
2019-12-03 12:21:00 +00:00
|
|
|
span,
|
|
|
|
"try",
|
|
|
|
sugg,
|
2019-12-03 12:42:05 +00:00
|
|
|
applicability,
|
2019-12-03 12:21:00 +00:00
|
|
|
);
|
2017-11-04 19:55:56 +00:00
|
|
|
|
2019-12-03 12:21:00 +00:00
|
|
|
if replace {
|
2020-04-17 06:08:00 +00:00
|
|
|
diag.note("or maybe you should use `std::mem::replace`?");
|
2019-12-03 12:21:00 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
);
|
2017-10-23 19:18:02 +00:00
|
|
|
}
|
|
|
|
}
|
2016-02-27 23:46:02 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-12-03 12:20:42 +00:00
|
|
|
enum Slice<'a> {
|
|
|
|
/// `slice.swap(idx1, idx2)` can be used
|
|
|
|
///
|
|
|
|
/// ## Example
|
|
|
|
///
|
|
|
|
/// ```rust
|
2019-12-03 15:29:05 +00:00
|
|
|
/// # let mut a = vec![0, 1];
|
2019-12-03 12:20:42 +00:00
|
|
|
/// let t = a[1];
|
|
|
|
/// a[1] = a[0];
|
|
|
|
/// a[0] = t;
|
|
|
|
/// // can be written as
|
|
|
|
/// a.swap(0, 1);
|
|
|
|
/// ```
|
2019-12-27 07:12:26 +00:00
|
|
|
Swappable(&'a Expr<'a>, &'a Expr<'a>, &'a Expr<'a>),
|
2019-12-03 12:20:42 +00:00
|
|
|
/// The `swap` function cannot be used.
|
|
|
|
///
|
|
|
|
/// ## Example
|
|
|
|
///
|
|
|
|
/// ```rust
|
2019-12-03 15:29:05 +00:00
|
|
|
/// # let mut a = [vec![1, 2], vec![3, 4]];
|
2019-12-03 12:20:42 +00:00
|
|
|
/// let t = a[0][1];
|
|
|
|
/// a[0][1] = a[1][0];
|
|
|
|
/// a[1][0] = t;
|
|
|
|
/// ```
|
|
|
|
NotSwappable,
|
|
|
|
/// Not a slice
|
|
|
|
None,
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Checks if both expressions are index operations into "slice-like" types.
|
2020-06-25 20:41:36 +00:00
|
|
|
fn check_for_slice<'a>(cx: &LateContext<'_>, lhs1: &'a Expr<'_>, lhs2: &'a Expr<'_>) -> Slice<'a> {
|
2021-04-02 21:35:32 +00:00
|
|
|
if let ExprKind::Index(lhs1, idx1) = lhs1.kind {
|
|
|
|
if let ExprKind::Index(lhs2, idx2) = lhs2.kind {
|
2020-08-28 14:10:16 +00:00
|
|
|
if eq_expr_value(cx, lhs1, lhs2) {
|
2020-09-24 12:49:22 +00:00
|
|
|
let ty = cx.typeck_results().expr_ty(lhs1).peel_refs();
|
2019-12-03 12:20:42 +00:00
|
|
|
|
2020-08-03 22:18:29 +00:00
|
|
|
if matches!(ty.kind(), ty::Slice(_))
|
|
|
|
|| matches!(ty.kind(), ty::Array(_, _))
|
2020-11-05 13:29:48 +00:00
|
|
|
|| is_type_diagnostic_item(cx, ty, sym::vec_type)
|
2021-02-27 04:04:02 +00:00
|
|
|
|| is_type_diagnostic_item(cx, ty, sym::vecdeque_type)
|
2019-12-03 12:20:42 +00:00
|
|
|
{
|
|
|
|
return Slice::Swappable(lhs1, idx1, idx2);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
return Slice::NotSwappable;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Slice::None
|
|
|
|
}
|
|
|
|
|
2016-02-27 23:46:02 +00:00
|
|
|
/// Implementation of the `ALMOST_SWAPPED` lint.
|
2020-06-25 20:41:36 +00:00
|
|
|
fn check_suspicious_swap(cx: &LateContext<'_>, block: &Block<'_>) {
|
2016-02-27 23:46:02 +00:00
|
|
|
for w in block.stmts.windows(2) {
|
2017-10-23 19:18:02 +00:00
|
|
|
if_chain! {
|
2021-04-02 21:35:32 +00:00
|
|
|
if let StmtKind::Semi(first) = w[0].kind;
|
|
|
|
if let StmtKind::Semi(second) = w[1].kind;
|
2017-10-23 19:18:02 +00:00
|
|
|
if !differing_macro_contexts(first.span, second.span);
|
2021-04-02 21:35:32 +00:00
|
|
|
if let ExprKind::Assign(lhs0, rhs0, _) = first.kind;
|
|
|
|
if let ExprKind::Assign(lhs1, rhs1, _) = second.kind;
|
2020-08-28 14:10:16 +00:00
|
|
|
if eq_expr_value(cx, lhs0, rhs1);
|
|
|
|
if eq_expr_value(cx, lhs1, rhs0);
|
2017-10-23 19:18:02 +00:00
|
|
|
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) {
|
2017-11-04 19:56:05 +00:00
|
|
|
(
|
|
|
|
format!(" `{}` and `{}`", first, second),
|
|
|
|
first.mut_addr().to_string(),
|
|
|
|
second.mut_addr().to_string(),
|
|
|
|
)
|
2017-10-23 19:18:02 +00:00
|
|
|
} else {
|
2018-08-21 10:46:18 +00:00
|
|
|
(String::new(), String::new(), String::new())
|
2017-10-23 19:18:02 +00:00
|
|
|
};
|
2017-11-04 19:55:56 +00:00
|
|
|
|
2017-10-23 19:18:02 +00:00
|
|
|
let span = first.span.to(second.span);
|
2017-11-04 19:55:56 +00:00
|
|
|
|
2017-10-23 19:18:02 +00:00
|
|
|
span_lint_and_then(cx,
|
|
|
|
ALMOST_SWAPPED,
|
|
|
|
span,
|
|
|
|
&format!("this looks like you are trying to swap{}", what),
|
2020-04-17 06:08:00 +00:00
|
|
|
|diag| {
|
2017-10-23 19:18:02 +00:00
|
|
|
if !what.is_empty() {
|
2020-04-17 06:08:00 +00:00
|
|
|
diag.span_suggestion(
|
2018-09-18 15:07:54 +00:00
|
|
|
span,
|
|
|
|
"try",
|
|
|
|
format!(
|
|
|
|
"std::mem::swap({}, {})",
|
|
|
|
lhs,
|
|
|
|
rhs,
|
|
|
|
),
|
2018-09-18 17:01:17 +00:00
|
|
|
Applicability::MaybeIncorrect,
|
2018-09-18 15:07:54 +00:00
|
|
|
);
|
2020-04-17 06:08:00 +00:00
|
|
|
diag.note("or maybe you should use `std::mem::replace`?");
|
2017-10-23 19:18:02 +00:00
|
|
|
}
|
|
|
|
});
|
|
|
|
}
|
|
|
|
}
|
2016-02-27 23:01:15 +00:00
|
|
|
}
|
|
|
|
}
|
2021-05-02 16:42:28 +00:00
|
|
|
|
|
|
|
/// Implementation of the `XOR_SWAP` lint.
|
|
|
|
fn check_xor_swap(cx: &LateContext<'_>, block: &Block<'_>) {
|
|
|
|
for window in block.stmts.windows(3) {
|
|
|
|
if_chain! {
|
|
|
|
if let Some((lhs0, rhs0)) = extract_sides_of_xor_assign(&window[0]);
|
|
|
|
if let Some((lhs1, rhs1)) = extract_sides_of_xor_assign(&window[1]);
|
|
|
|
if let Some((lhs2, rhs2)) = extract_sides_of_xor_assign(&window[2]);
|
|
|
|
if eq_expr_value(cx, lhs0, rhs1)
|
|
|
|
&& eq_expr_value(cx, rhs1, lhs2)
|
|
|
|
&& eq_expr_value(cx, rhs0, lhs1)
|
|
|
|
&& eq_expr_value(cx, lhs1, rhs2);
|
|
|
|
then {
|
|
|
|
let span = window[0].span.to(window[2].span);
|
|
|
|
let mut applicability = Applicability::MachineApplicable;
|
|
|
|
match check_for_slice(cx, lhs0, rhs0) {
|
|
|
|
Slice::Swappable(slice, idx0, idx1) => {
|
|
|
|
if let Some(slice) = Sugg::hir_opt(cx, slice) {
|
|
|
|
span_lint_and_sugg(
|
|
|
|
cx,
|
|
|
|
XOR_SWAP,
|
|
|
|
span,
|
|
|
|
&format!(
|
|
|
|
"this xor-based swap of the elements of `{}` can be \
|
|
|
|
more clearly expressed using `.swap`",
|
|
|
|
slice
|
|
|
|
),
|
|
|
|
"try",
|
|
|
|
format!(
|
|
|
|
"{}.swap({}, {})",
|
|
|
|
slice.maybe_par(),
|
|
|
|
snippet_with_applicability(cx, idx0.span, "..", &mut applicability),
|
|
|
|
snippet_with_applicability(cx, idx1.span, "..", &mut applicability)
|
|
|
|
),
|
|
|
|
applicability
|
|
|
|
)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
Slice::None => {
|
|
|
|
if let (Some(first), Some(second)) = (Sugg::hir_opt(cx, lhs0), Sugg::hir_opt(cx, rhs0)) {
|
|
|
|
span_lint_and_sugg(
|
|
|
|
cx,
|
|
|
|
XOR_SWAP,
|
|
|
|
span,
|
|
|
|
&format!(
|
|
|
|
"this xor-based swap of `{}` and `{}` can be \
|
|
|
|
more clearly expressed using `std::mem::swap`",
|
|
|
|
first, second
|
|
|
|
),
|
|
|
|
"try",
|
|
|
|
format!("std::mem::swap({}, {})", first.mut_addr(), second.mut_addr()),
|
|
|
|
applicability,
|
|
|
|
);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
Slice::NotSwappable => {}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Returns the lhs and rhs of an xor assignment statement.
|
|
|
|
fn extract_sides_of_xor_assign<'a, 'hir>(stmt: &'a Stmt<'hir>) -> Option<(&'a Expr<'hir>, &'a Expr<'hir>)> {
|
|
|
|
if let StmtKind::Semi(expr) = stmt.kind {
|
|
|
|
if let ExprKind::AssignOp(
|
|
|
|
Spanned {
|
|
|
|
node: BinOpKind::BitXor,
|
|
|
|
..
|
|
|
|
},
|
|
|
|
lhs,
|
|
|
|
rhs,
|
|
|
|
) = expr.kind
|
|
|
|
{
|
|
|
|
return Some((lhs, rhs));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
None
|
|
|
|
}
|