2018-05-28 19:17:55 -05:00
|
|
|
//! lint on inherent implementations
|
|
|
|
|
2018-08-28 06:13:42 -05:00
|
|
|
use crate::utils::span_lint_and_then;
|
2018-12-29 09:04:45 -06:00
|
|
|
use rustc::hir::*;
|
|
|
|
use rustc::lint::{LateContext, LateLintPass, LintArray, LintPass};
|
|
|
|
use rustc::{declare_tool_lint, lint_array};
|
|
|
|
use rustc_data_structures::fx::FxHashMap;
|
2018-11-27 14:14:15 -06:00
|
|
|
use std::default::Default;
|
2018-12-29 09:04:45 -06:00
|
|
|
use syntax_pos::Span;
|
2018-05-28 19:17:55 -05:00
|
|
|
|
|
|
|
/// **What it does:** Checks for multiple inherent implementations of a struct
|
|
|
|
///
|
|
|
|
/// **Why is this bad?** Splitting the implementation of a type makes the code harder to navigate.
|
|
|
|
///
|
|
|
|
/// **Known problems:** None.
|
|
|
|
///
|
|
|
|
/// **Example:**
|
|
|
|
/// ```rust
|
|
|
|
/// struct X;
|
|
|
|
/// impl X {
|
|
|
|
/// fn one() {}
|
|
|
|
/// }
|
|
|
|
/// impl X {
|
|
|
|
/// fn other() {}
|
|
|
|
/// }
|
|
|
|
/// ```
|
|
|
|
///
|
|
|
|
/// Could be written:
|
|
|
|
///
|
|
|
|
/// ```rust
|
|
|
|
/// struct X;
|
|
|
|
/// impl X {
|
|
|
|
/// fn one() {}
|
|
|
|
/// fn other() {}
|
|
|
|
/// }
|
|
|
|
/// ```
|
|
|
|
declare_clippy_lint! {
|
|
|
|
pub MULTIPLE_INHERENT_IMPL,
|
2018-05-29 03:19:16 -05:00
|
|
|
restriction,
|
2018-05-28 19:17:55 -05:00
|
|
|
"Multiple inherent impl that could be grouped"
|
|
|
|
}
|
|
|
|
|
|
|
|
pub struct Pass {
|
2018-09-11 18:34:52 -05:00
|
|
|
impls: FxHashMap<def_id::DefId, (Span, Generics)>,
|
2018-05-28 19:17:55 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
impl Default for Pass {
|
|
|
|
fn default() -> Self {
|
2018-11-27 14:14:15 -06:00
|
|
|
Self {
|
|
|
|
impls: FxHashMap::default(),
|
|
|
|
}
|
2018-05-28 19:17:55 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl LintPass for Pass {
|
|
|
|
fn get_lints(&self) -> LintArray {
|
|
|
|
lint_array!(MULTIPLE_INHERENT_IMPL)
|
|
|
|
}
|
2019-01-26 13:40:55 -06:00
|
|
|
|
|
|
|
fn name(&self) -> &'static str {
|
|
|
|
"MultipleInherientImpl"
|
|
|
|
}
|
2018-05-28 19:17:55 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
impl<'a, 'tcx> LateLintPass<'a, 'tcx> for Pass {
|
|
|
|
fn check_item(&mut self, _: &LateContext<'a, 'tcx>, item: &'tcx Item) {
|
2018-07-16 08:07:39 -05:00
|
|
|
if let ItemKind::Impl(_, _, _, ref generics, None, _, _) = item.node {
|
2018-05-28 19:17:55 -05:00
|
|
|
// Remember for each inherent implementation encoutered its span and generics
|
|
|
|
self.impls
|
|
|
|
.insert(item.hir_id.owner_def_id(), (item.span, generics.clone()));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn check_crate_post(&mut self, cx: &LateContext<'a, 'tcx>, krate: &'tcx Crate) {
|
|
|
|
if let Some(item) = krate.items.values().nth(0) {
|
|
|
|
// Retrieve all inherent implementations from the crate, grouped by type
|
|
|
|
for impls in cx
|
|
|
|
.tcx
|
|
|
|
.crate_inherent_impls(item.hir_id.owner_def_id().krate)
|
|
|
|
.inherent_impls
|
|
|
|
.values()
|
|
|
|
{
|
|
|
|
// Filter out implementations that have generic params (type or lifetime)
|
|
|
|
let mut impl_spans = impls
|
|
|
|
.iter()
|
|
|
|
.filter_map(|impl_def| self.impls.get(impl_def))
|
2018-11-27 14:14:15 -06:00
|
|
|
.filter_map(|(span, generics)| if generics.params.len() == 0 { Some(span) } else { None });
|
2018-05-28 19:17:55 -05:00
|
|
|
if let Some(initial_span) = impl_spans.nth(0) {
|
|
|
|
impl_spans.for_each(|additional_span| {
|
2018-08-28 06:13:42 -05:00
|
|
|
span_lint_and_then(
|
|
|
|
cx,
|
2018-05-28 19:17:55 -05:00
|
|
|
MULTIPLE_INHERENT_IMPL,
|
|
|
|
*additional_span,
|
|
|
|
"Multiple implementations of this structure",
|
2018-08-28 06:13:42 -05:00
|
|
|
|db| {
|
2018-11-27 14:14:15 -06:00
|
|
|
db.span_note(*initial_span, "First implementation here");
|
2018-08-28 06:13:42 -05:00
|
|
|
},
|
2018-05-28 19:17:55 -05:00
|
|
|
)
|
|
|
|
})
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|