rust/clippy_lints/src/large_enum_variant.rs

129 lines
4.5 KiB
Rust
Raw Normal View History

//! lint when there is a large size difference between variants on an enum
2018-11-27 14:14:15 -06:00
use crate::utils::{snippet_opt, span_lint_and_then};
use rustc::hir::*;
use rustc::lint::{LateContext, LateLintPass, LintArray, LintPass};
use rustc::ty::layout::LayoutOf;
2019-04-08 15:43:55 -05:00
use rustc::{declare_tool_lint, impl_lint_pass};
use rustc_errors::Applicability;
2018-03-28 08:24:26 -05:00
declare_clippy_lint! {
/// **What it does:** Checks for large size differences between variants on
/// `enum`s.
///
/// **Why is this bad?** Enum size is bounded by the largest variant. Having a
/// large variant
/// can penalize the memory layout of that enum.
///
/// **Known problems:** None.
///
/// **Example:**
/// ```rust
/// enum Test {
/// A(i32),
/// B([i32; 8000]),
/// }
/// ```
pub LARGE_ENUM_VARIANT,
2018-03-28 08:24:26 -05:00
perf,
"large size difference between variants on an enum"
}
2017-08-09 02:30:56 -05:00
#[derive(Copy, Clone)]
pub struct LargeEnumVariant {
maximum_size_difference_allowed: u64,
}
impl LargeEnumVariant {
pub fn new(maximum_size_difference_allowed: u64) -> Self {
2017-09-05 04:33:04 -05:00
Self {
maximum_size_difference_allowed,
2017-09-05 04:33:04 -05:00
}
}
}
2019-04-08 15:43:55 -05:00
impl_lint_pass!(LargeEnumVariant => [LARGE_ENUM_VARIANT]);
impl<'a, 'tcx> LateLintPass<'a, 'tcx> for LargeEnumVariant {
2018-07-23 06:01:12 -05:00
fn check_item(&mut self, cx: &LateContext<'_, '_>, item: &Item) {
let did = cx.tcx.hir().local_def_id(item.hir_id);
2019-09-27 10:16:06 -05:00
if let ItemKind::Enum(ref def, _) = item.kind {
2017-04-27 07:00:35 -05:00
let ty = cx.tcx.type_of(did);
2018-11-27 14:14:15 -06:00
let adt = ty.ty_adt_def().expect("already checked whether this is an enum");
let mut smallest_variant: Option<(_, _)> = None;
let mut largest_variant: Option<(_, _)> = None;
for (i, variant) in adt.variants.iter().enumerate() {
2017-08-09 02:30:56 -05:00
let size: u64 = variant
.fields
.iter()
.filter_map(|f| {
2017-04-27 07:00:35 -05:00
let ty = cx.tcx.type_of(f.did);
// don't count generics by filtering out everything
// that does not have a layout
cx.layout_of(ty).ok().map(|l| l.size.bytes())
})
.sum();
let grouped = (size, (i, variant));
update_if(&mut smallest_variant, grouped, |a, b| b.0 <= a.0);
update_if(&mut largest_variant, grouped, |a, b| b.0 >= a.0);
}
if let (Some(smallest), Some(largest)) = (smallest_variant, largest_variant) {
let difference = largest.0 - smallest.0;
if difference > self.maximum_size_difference_allowed {
let (i, variant) = largest.1;
2017-08-09 02:30:56 -05:00
span_lint_and_then(
cx,
LARGE_ENUM_VARIANT,
def.variants[i].span,
"large size difference between variants",
|db| {
if variant.fields.len() == 1 {
2019-08-15 02:59:08 -05:00
let span = match def.variants[i].data {
VariantData::Struct(ref fields, ..) | VariantData::Tuple(ref fields, ..) => {
2017-09-05 04:33:04 -05:00
fields[0].ty.span
},
VariantData::Unit(..) => unreachable!(),
2017-08-09 02:30:56 -05:00
};
if let Some(snip) = snippet_opt(cx, span) {
db.span_suggestion(
2017-08-09 02:30:56 -05:00
span,
"consider boxing the large fields to reduce the total size of the \
2017-09-05 04:33:04 -05:00
enum",
2017-08-09 02:30:56 -05:00
format!("Box<{}>", snip),
2018-09-20 07:38:13 -05:00
Applicability::MaybeIncorrect,
2017-08-09 02:30:56 -05:00
);
return;
}
}
2017-08-09 02:30:56 -05:00
db.span_help(
def.variants[i].span,
"consider boxing the large fields to reduce the total size of the enum",
);
},
);
}
}
}
}
}
2017-02-10 22:08:50 -06:00
fn update_if<T, F>(old: &mut Option<T>, new: T, f: F)
2017-08-09 02:30:56 -05:00
where
F: Fn(&T, &T) -> bool,
2017-02-10 22:08:50 -06:00
{
if let Some(ref mut val) = *old {
if f(val, &new) {
*val = new;
}
} else {
*old = Some(new);
}
}