1 #![allow(non_snake_case)]
3 use rustc::hir::{ExprKind, Node};
4 use rustc::hir::lowering::is_range_literal;
5 use rustc::ty::subst::SubstsRef;
6 use rustc::ty::{self, AdtKind, ParamEnv, Ty, TyCtxt};
7 use rustc::ty::layout::{self, IntegerExt, LayoutOf, VariantIdx};
8 use rustc::{lint, util};
9 use rustc_data_structures::indexed_vec::Idx;
10 use util::nodemap::FxHashSet;
11 use lint::{LateContext, LintContext, LintArray};
12 use lint::{LintPass, LateLintPass};
15 use std::{i8, i16, i32, i64, u8, u16, u32, u64, f32, f64};
17 use syntax::{ast, attr};
18 use syntax::errors::Applicability;
19 use rustc_target::spec::abi::Abi;
21 use syntax::source_map;
25 use rustc::mir::interpret::{sign_extend, truncate};
32 "comparisons made useless by limits of the types involved"
38 "literal out of range for its type"
42 VARIANT_SIZE_DIFFERENCES,
44 "detects enums with widely varying variant sizes"
47 #[derive(Copy, Clone)]
48 pub struct TypeLimits {
49 /// Id of the last visited negated expression
50 negated_expr_id: hir::HirId,
53 impl_lint_pass!(TypeLimits => [UNUSED_COMPARISONS, OVERFLOWING_LITERALS]);
56 pub fn new() -> TypeLimits {
57 TypeLimits { negated_expr_id: hir::DUMMY_HIR_ID }
61 /// Attempts to special-case the overflowing literal lint when it occurs as a range endpoint.
62 /// Returns `true` iff the lint was overridden.
63 fn lint_overflowing_range_endpoint<'a, 'tcx>(
64 cx: &LateContext<'a, 'tcx>,
68 expr: &'tcx hir::Expr,
69 parent_expr: &'tcx hir::Expr,
70 ty: impl std::fmt::Debug,
72 // We only want to handle exclusive (`..`) ranges,
73 // which are represented as `ExprKind::Struct`.
74 if let ExprKind::Struct(_, eps, _) = &parent_expr.node {
75 debug_assert_eq!(eps.len(), 2);
76 // We can suggest using an inclusive range
77 // (`..=`) instead only if it is the `end` that is
78 // overflowing and only by 1.
79 if eps[1].expr.hir_id == expr.hir_id && lit_val - 1 == max {
80 let mut err = cx.struct_span_lint(
83 &format!("range endpoint is out of range for `{:?}`", ty),
85 if let Ok(start) = cx.sess().source_map().span_to_snippet(eps[0].span) {
86 use ast::{LitKind, LitIntType};
87 // We need to preserve the literal's suffix,
88 // as it may determine typing information.
89 let suffix = match lit.node {
90 LitKind::Int(_, LitIntType::Signed(s)) => format!("{}", s),
91 LitKind::Int(_, LitIntType::Unsigned(s)) => format!("{}", s),
92 LitKind::Int(_, LitIntType::Unsuffixed) => "".to_owned(),
95 let suggestion = format!("{}..={}{}", start, lit_val - 1, suffix);
98 &"use an inclusive range instead",
100 Applicability::MachineApplicable,
111 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for TypeLimits {
112 fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, e: &'tcx hir::Expr) {
114 hir::ExprKind::Unary(hir::UnNeg, ref expr) => {
115 // propagate negation, if the negation itself isn't negated
116 if self.negated_expr_id != e.hir_id {
117 self.negated_expr_id = expr.hir_id;
120 hir::ExprKind::Binary(binop, ref l, ref r) => {
121 if is_comparison(binop) && !check_limits(cx, binop, &l, &r) {
122 cx.span_lint(UNUSED_COMPARISONS,
124 "comparison is useless due to type limits");
127 hir::ExprKind::Lit(ref lit) => {
128 match cx.tables.node_type(e.hir_id).sty {
131 ast::LitKind::Int(v, ast::LitIntType::Signed(_)) |
132 ast::LitKind::Int(v, ast::LitIntType::Unsuffixed) => {
133 let int_type = if let ast::IntTy::Isize = t {
134 cx.sess().target.isize_ty
138 let (_, max) = int_ty_range(int_type);
139 let max = max as u128;
140 let negative = self.negated_expr_id == e.hir_id;
142 // Detect literal value out of range [min, max] inclusive
143 // avoiding use of -min to prevent overflow/panic
144 if (negative && v > max + 1) || (!negative && v > max) {
145 if let Some(repr_str) = get_bin_hex_repr(cx, lit) {
146 report_bin_hex_error(
149 attr::IntType::SignedInt(t),
157 let par_id = cx.tcx.hir().get_parent_node_by_hir_id(e.hir_id);
158 if let Node::Expr(par_e) = cx.tcx.hir().get_by_hir_id(par_id) {
159 if let hir::ExprKind::Struct(..) = par_e.node {
160 if is_range_literal(cx.sess(), par_e)
161 && lint_overflowing_range_endpoint(
171 // The overflowing literal lint was overridden.
178 OVERFLOWING_LITERALS,
180 &format!("literal out of range for `{:?}`", t),
189 let uint_type = if let ast::UintTy::Usize = t {
190 cx.sess().target.usize_ty
194 let (min, max) = uint_ty_range(uint_type);
195 let lit_val: u128 = match lit.node {
196 // _v is u8, within range by definition
197 ast::LitKind::Byte(_v) => return,
198 ast::LitKind::Int(v, _) => v,
201 if lit_val < min || lit_val > max {
202 let parent_id = cx.tcx.hir().get_parent_node_by_hir_id(e.hir_id);
203 if let Node::Expr(parent_expr) = cx.tcx.hir().get_by_hir_id(parent_id) {
204 match parent_expr.node {
205 hir::ExprKind::Cast(..) => {
206 if let ty::Char = cx.tables.expr_ty(parent_expr).sty {
207 let mut err = cx.struct_span_lint(
208 OVERFLOWING_LITERALS,
210 "only `u8` can be cast into `char`",
214 &"use a `char` literal instead",
215 format!("'\\u{{{:X}}}'", lit_val),
216 Applicability::MachineApplicable,
222 hir::ExprKind::Struct(..)
223 if is_range_literal(cx.sess(), parent_expr) => {
224 if lint_overflowing_range_endpoint(
233 // The overflowing literal lint was overridden.
240 if let Some(repr_str) = get_bin_hex_repr(cx, lit) {
241 report_bin_hex_error(
244 attr::IntType::UnsignedInt(t),
252 OVERFLOWING_LITERALS,
254 &format!("literal out of range for `{:?}`", t),
259 let is_infinite = match lit.node {
260 ast::LitKind::Float(v, _) |
261 ast::LitKind::FloatUnsuffixed(v) => {
263 ast::FloatTy::F32 => v.as_str().parse().map(f32::is_infinite),
264 ast::FloatTy::F64 => v.as_str().parse().map(f64::is_infinite),
269 if is_infinite == Ok(true) {
270 cx.span_lint(OVERFLOWING_LITERALS,
272 &format!("literal out of range for `{:?}`", t));
281 fn is_valid<T: cmp::PartialOrd>(binop: hir::BinOp, v: T, min: T, max: T) -> bool {
283 hir::BinOpKind::Lt => v > min && v <= max,
284 hir::BinOpKind::Le => v >= min && v < max,
285 hir::BinOpKind::Gt => v >= min && v < max,
286 hir::BinOpKind::Ge => v > min && v <= max,
287 hir::BinOpKind::Eq | hir::BinOpKind::Ne => v >= min && v <= max,
292 fn rev_binop(binop: hir::BinOp) -> hir::BinOp {
293 source_map::respan(binop.span,
295 hir::BinOpKind::Lt => hir::BinOpKind::Gt,
296 hir::BinOpKind::Le => hir::BinOpKind::Ge,
297 hir::BinOpKind::Gt => hir::BinOpKind::Lt,
298 hir::BinOpKind::Ge => hir::BinOpKind::Le,
303 // for isize & usize, be conservative with the warnings, so that the
304 // warnings are consistent between 32- and 64-bit platforms
305 fn int_ty_range(int_ty: ast::IntTy) -> (i128, i128) {
307 ast::IntTy::Isize => (i64::min_value() as i128, i64::max_value() as i128),
308 ast::IntTy::I8 => (i8::min_value() as i64 as i128, i8::max_value() as i128),
309 ast::IntTy::I16 => (i16::min_value() as i64 as i128, i16::max_value() as i128),
310 ast::IntTy::I32 => (i32::min_value() as i64 as i128, i32::max_value() as i128),
311 ast::IntTy::I64 => (i64::min_value() as i128, i64::max_value() as i128),
312 ast::IntTy::I128 =>(i128::min_value() as i128, i128::max_value()),
316 fn uint_ty_range(uint_ty: ast::UintTy) -> (u128, u128) {
318 ast::UintTy::Usize => (u64::min_value() as u128, u64::max_value() as u128),
319 ast::UintTy::U8 => (u8::min_value() as u128, u8::max_value() as u128),
320 ast::UintTy::U16 => (u16::min_value() as u128, u16::max_value() as u128),
321 ast::UintTy::U32 => (u32::min_value() as u128, u32::max_value() as u128),
322 ast::UintTy::U64 => (u64::min_value() as u128, u64::max_value() as u128),
323 ast::UintTy::U128 => (u128::min_value(), u128::max_value()),
327 fn check_limits(cx: &LateContext<'_, '_>,
332 let (lit, expr, swap) = match (&l.node, &r.node) {
333 (&hir::ExprKind::Lit(_), _) => (l, r, true),
334 (_, &hir::ExprKind::Lit(_)) => (r, l, false),
337 // Normalize the binop so that the literal is always on the RHS in
339 let norm_binop = if swap { rev_binop(binop) } else { binop };
340 match cx.tables.node_type(expr.hir_id).sty {
342 let (min, max) = int_ty_range(int_ty);
343 let lit_val: i128 = match lit.node {
344 hir::ExprKind::Lit(ref li) => {
346 ast::LitKind::Int(v, ast::LitIntType::Signed(_)) |
347 ast::LitKind::Int(v, ast::LitIntType::Unsuffixed) => v as i128,
353 is_valid(norm_binop, lit_val, min, max)
355 ty::Uint(uint_ty) => {
356 let (min, max) :(u128, u128) = uint_ty_range(uint_ty);
357 let lit_val: u128 = match lit.node {
358 hir::ExprKind::Lit(ref li) => {
360 ast::LitKind::Int(v, _) => v,
366 is_valid(norm_binop, lit_val, min, max)
372 fn is_comparison(binop: hir::BinOp) -> bool {
379 hir::BinOpKind::Gt => true,
384 fn get_bin_hex_repr(cx: &LateContext<'_, '_>, lit: &ast::Lit) -> Option<String> {
385 let src = cx.sess().source_map().span_to_snippet(lit.span).ok()?;
386 let firstch = src.chars().next()?;
389 match src.chars().nth(1) {
390 Some('x') | Some('b') => return Some(src),
398 // This function finds the next fitting type and generates a suggestion string.
399 // It searches for fitting types in the following way (`X < Y`):
400 // - `iX`: if literal fits in `uX` => `uX`, else => `iY`
404 // No suggestion for: `isize`, `usize`.
405 fn get_type_suggestion<'a>(
409 ) -> Option<String> {
410 use syntax::ast::IntTy::*;
411 use syntax::ast::UintTy::*;
412 macro_rules! find_fit {
413 ($ty:expr, $val:expr, $negative:expr,
414 $($type:ident => [$($utypes:expr),*] => [$($itypes:expr),*]),+) => {
416 let _neg = if negative { 1 } else { 0 };
419 $(if !negative && val <= uint_ty_range($utypes).1 {
420 return Some(format!("{:?}", $utypes))
422 $(if val <= int_ty_range($itypes).1 as u128 + _neg {
423 return Some(format!("{:?}", $itypes))
433 ty::Int(i) => find_fit!(i, val, negative,
434 I8 => [U8] => [I16, I32, I64, I128],
435 I16 => [U16] => [I32, I64, I128],
436 I32 => [U32] => [I64, I128],
437 I64 => [U64] => [I128],
438 I128 => [U128] => []),
439 ty::Uint(u) => find_fit!(u, val, negative,
440 U8 => [U8, U16, U32, U64, U128] => [],
441 U16 => [U16, U32, U64, U128] => [],
442 U32 => [U32, U64, U128] => [],
443 U64 => [U64, U128] => [],
444 U128 => [U128] => []),
449 fn report_bin_hex_error(
450 cx: &LateContext<'_, '_>,
457 let size = layout::Integer::from_attr(&cx.tcx, ty).size();
458 let (t, actually) = match ty {
459 attr::IntType::SignedInt(t) => {
460 let actually = sign_extend(val, size) as i128;
461 (format!("{:?}", t), actually.to_string())
463 attr::IntType::UnsignedInt(t) => {
464 let actually = truncate(val, size);
465 (format!("{:?}", t), actually.to_string())
468 let mut err = cx.struct_span_lint(
469 OVERFLOWING_LITERALS,
471 &format!("literal out of range for {}", t),
474 "the literal `{}` (decimal `{}`) does not fit into \
475 an `{}` and will become `{}{}`",
476 repr_str, val, t, actually, t
478 if let Some(sugg_ty) =
479 get_type_suggestion(&cx.tables.node_type(expr.hir_id), val, negative)
481 if let Some(pos) = repr_str.chars().position(|c| c == 'i' || c == 'u') {
482 let (sans_suffix, _) = repr_str.split_at(pos);
485 &format!("consider using `{}` instead", sugg_ty),
486 format!("{}{}", sans_suffix, sugg_ty),
487 Applicability::MachineApplicable
490 err.help(&format!("consider using `{}` instead", sugg_ty));
502 "proper use of libc types in foreign modules"
505 declare_lint_pass!(ImproperCTypes => [IMPROPER_CTYPES]);
507 struct ImproperCTypesVisitor<'a, 'tcx: 'a> {
508 cx: &'a LateContext<'a, 'tcx>,
511 enum FfiResult<'tcx> {
513 FfiPhantom(Ty<'tcx>),
516 reason: &'static str,
517 help: Option<&'static str>,
521 /// Check if this enum can be safely exported based on the
522 /// "nullable pointer optimization". Currently restricted
523 /// to function pointers and references, but could be
524 /// expanded to cover NonZero raw pointers and newtypes.
525 /// FIXME: This duplicates code in codegen.
526 fn is_repr_nullable_ptr<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
527 def: &'tcx ty::AdtDef,
528 substs: SubstsRef<'tcx>)
530 if def.variants.len() == 2 {
533 let zero = VariantIdx::new(0);
534 let one = VariantIdx::new(1);
536 if def.variants[zero].fields.is_empty() {
538 } else if def.variants[one].fields.is_empty() {
544 if def.variants[data_idx].fields.len() == 1 {
545 match def.variants[data_idx].fields[0].ty(tcx, substs).sty {
559 impl<'a, 'tcx> ImproperCTypesVisitor<'a, 'tcx> {
560 /// Checks if the given type is "ffi-safe" (has a stable, well-defined
561 /// representation which can be exported to C code).
562 fn check_type_for_ffi(&self,
563 cache: &mut FxHashSet<Ty<'tcx>>,
564 ty: Ty<'tcx>) -> FfiResult<'tcx> {
567 let cx = self.cx.tcx;
569 // Protect against infinite recursion, for example
570 // `struct S(*mut S);`.
571 // FIXME: A recursion limit is necessary as well, for irregular
573 if !cache.insert(ty) {
578 ty::Adt(def, substs) => {
579 if def.is_phantom_data() {
580 return FfiPhantom(ty);
582 match def.adt_kind() {
584 if !def.repr.c() && !def.repr.transparent() {
587 reason: "this struct has unspecified layout",
588 help: Some("consider adding a #[repr(C)] or #[repr(transparent)] \
589 attribute to this struct"),
593 if def.non_enum_variant().fields.is_empty() {
596 reason: "this struct has no fields",
597 help: Some("consider adding a member to this struct"),
601 // We can't completely trust repr(C) and repr(transparent) markings;
602 // make sure the fields are actually safe.
603 let mut all_phantom = true;
604 for field in &def.non_enum_variant().fields {
605 let field_ty = cx.normalize_erasing_regions(
606 ParamEnv::reveal_all(),
607 field.ty(cx, substs),
609 // repr(transparent) types are allowed to have arbitrary ZSTs, not just
610 // PhantomData -- skip checking all ZST fields
611 if def.repr.transparent() {
613 .layout_of(cx.param_env(field.did).and(field_ty))
614 .map(|layout| layout.is_zst())
620 let r = self.check_type_for_ffi(cache, field_ty);
626 FfiUnsafe { .. } => {
632 if all_phantom { FfiPhantom(ty) } else { FfiSafe }
638 reason: "this union has unspecified layout",
639 help: Some("consider adding a #[repr(C)] attribute to this union"),
643 if def.non_enum_variant().fields.is_empty() {
646 reason: "this union has no fields",
647 help: Some("consider adding a field to this union"),
651 let mut all_phantom = true;
652 for field in &def.non_enum_variant().fields {
653 let field_ty = cx.normalize_erasing_regions(
654 ParamEnv::reveal_all(),
655 field.ty(cx, substs),
657 let r = self.check_type_for_ffi(cache, field_ty);
663 FfiUnsafe { .. } => {
669 if all_phantom { FfiPhantom(ty) } else { FfiSafe }
672 if def.variants.is_empty() {
673 // Empty enums are okay... although sort of useless.
677 // Check for a repr() attribute to specify the size of the
679 if !def.repr.c() && def.repr.int.is_none() {
680 // Special-case types like `Option<extern fn()>`.
681 if !is_repr_nullable_ptr(cx, def, substs) {
684 reason: "enum has no representation hint",
685 help: Some("consider adding a #[repr(...)] attribute \
691 // Check the contained variants.
692 for variant in &def.variants {
693 for field in &variant.fields {
694 let arg = cx.normalize_erasing_regions(
695 ParamEnv::reveal_all(),
696 field.ty(cx, substs),
698 let r = self.check_type_for_ffi(cache, arg);
701 FfiUnsafe { .. } => {
707 reason: "this enum contains a PhantomData field",
719 ty::Char => FfiUnsafe {
721 reason: "the `char` type has no C equivalent",
722 help: Some("consider using `u32` or `libc::wchar_t` instead"),
725 ty::Int(ast::IntTy::I128) | ty::Uint(ast::UintTy::U128) => FfiUnsafe {
727 reason: "128-bit integers don't currently have a known stable ABI",
731 // Primitive types with a stable representation.
732 ty::Bool | ty::Int(..) | ty::Uint(..) | ty::Float(..) | ty::Never => FfiSafe,
734 ty::Slice(_) => FfiUnsafe {
736 reason: "slices have no C equivalent",
737 help: Some("consider using a raw pointer instead"),
740 ty::Dynamic(..) => FfiUnsafe {
742 reason: "trait objects have no C equivalent",
746 ty::Str => FfiUnsafe {
748 reason: "string slices have no C equivalent",
749 help: Some("consider using `*const u8` and a length instead"),
752 ty::Tuple(..) => FfiUnsafe {
754 reason: "tuples have unspecified layout",
755 help: Some("consider using a struct instead"),
758 ty::RawPtr(ty::TypeAndMut { ty, .. }) |
759 ty::Ref(_, ty, _) => self.check_type_for_ffi(cache, ty),
761 ty::Array(ty, _) => self.check_type_for_ffi(cache, ty),
765 Abi::Rust | Abi::RustIntrinsic | Abi::PlatformIntrinsic | Abi::RustCall => {
768 reason: "this function pointer has Rust-specific calling convention",
769 help: Some("consider using an `extern fn(...) -> ...` \
770 function pointer instead"),
776 let sig = cx.erase_late_bound_regions(&sig);
777 if !sig.output().is_unit() {
778 let r = self.check_type_for_ffi(cache, sig.output());
786 for arg in sig.inputs() {
787 let r = self.check_type_for_ffi(cache, arg);
798 ty::Foreign(..) => FfiSafe,
806 ty::GeneratorWitness(..) |
807 ty::Placeholder(..) |
808 ty::UnnormalizedProjection(..) |
811 ty::FnDef(..) => bug!("Unexpected type in foreign function"),
815 fn check_type_for_ffi_and_report_errors(&mut self, sp: Span, ty: Ty<'tcx>) {
816 // it is only OK to use this function because extern fns cannot have
817 // any generic types right now:
818 let ty = self.cx.tcx.normalize_erasing_regions(ParamEnv::reveal_all(), ty);
820 match self.check_type_for_ffi(&mut FxHashSet::default(), ty) {
821 FfiResult::FfiSafe => {}
822 FfiResult::FfiPhantom(ty) => {
823 self.cx.span_lint(IMPROPER_CTYPES,
825 &format!("`extern` block uses type `{}` which is not FFI-safe: \
826 composed only of PhantomData", ty));
828 FfiResult::FfiUnsafe { ty: unsafe_ty, reason, help } => {
829 let msg = format!("`extern` block uses type `{}` which is not FFI-safe: {}",
831 let mut diag = self.cx.struct_span_lint(IMPROPER_CTYPES, sp, &msg);
832 if let Some(s) = help {
835 if let ty::Adt(def, _) = unsafe_ty.sty {
836 if let Some(sp) = self.cx.tcx.hir().span_if_local(def.did) {
837 diag.span_note(sp, "type defined here");
845 fn check_foreign_fn(&mut self, id: hir::HirId, decl: &hir::FnDecl) {
846 let def_id = self.cx.tcx.hir().local_def_id_from_hir_id(id);
847 let sig = self.cx.tcx.fn_sig(def_id);
848 let sig = self.cx.tcx.erase_late_bound_regions(&sig);
849 let inputs = if sig.c_variadic {
850 // Don't include the spoofed `VaList` in the functions list
852 &sig.inputs()[..sig.inputs().len() - 1]
857 for (input_ty, input_hir) in inputs.iter().zip(&decl.inputs) {
858 self.check_type_for_ffi_and_report_errors(input_hir.span, input_ty);
861 if let hir::Return(ref ret_hir) = decl.output {
862 let ret_ty = sig.output();
863 if !ret_ty.is_unit() {
864 self.check_type_for_ffi_and_report_errors(ret_hir.span, ret_ty);
869 fn check_foreign_static(&mut self, id: hir::HirId, span: Span) {
870 let def_id = self.cx.tcx.hir().local_def_id_from_hir_id(id);
871 let ty = self.cx.tcx.type_of(def_id);
872 self.check_type_for_ffi_and_report_errors(span, ty);
876 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for ImproperCTypes {
877 fn check_foreign_item(&mut self, cx: &LateContext<'_, '_>, it: &hir::ForeignItem) {
878 let mut vis = ImproperCTypesVisitor { cx };
879 let abi = cx.tcx.hir().get_foreign_abi_by_hir_id(it.hir_id);
880 if abi != Abi::RustIntrinsic && abi != Abi::PlatformIntrinsic {
882 hir::ForeignItemKind::Fn(ref decl, _, _) => {
883 vis.check_foreign_fn(it.hir_id, decl);
885 hir::ForeignItemKind::Static(ref ty, _) => {
886 vis.check_foreign_static(it.hir_id, ty.span);
888 hir::ForeignItemKind::Type => ()
894 declare_lint_pass!(VariantSizeDifferences => [VARIANT_SIZE_DIFFERENCES]);
896 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for VariantSizeDifferences {
897 fn check_item(&mut self, cx: &LateContext<'_, '_>, it: &hir::Item) {
898 if let hir::ItemKind::Enum(ref enum_definition, _) = it.node {
899 let item_def_id = cx.tcx.hir().local_def_id_from_hir_id(it.hir_id);
900 let t = cx.tcx.type_of(item_def_id);
901 let ty = cx.tcx.erase_regions(&t);
902 let layout = match cx.layout_of(ty) {
903 Ok(layout) => layout,
904 Err(ty::layout::LayoutError::Unknown(_)) => return,
905 Err(err @ ty::layout::LayoutError::SizeOverflow(_)) => {
906 bug!("failed to get layout for `{}`: {}", t, err);
909 let (variants, tag) = match layout.variants {
910 layout::Variants::Multiple {
911 discr_kind: layout::DiscriminantKind::Tag,
915 } => (variants, discr),
919 let discr_size = tag.value.size(&cx.tcx).bytes();
921 debug!("enum `{}` is {} bytes large with layout:\n{:#?}",
922 t, layout.size.bytes(), layout);
924 let (largest, slargest, largest_index) = enum_definition.variants
927 .map(|(variant, variant_layout)| {
928 // Subtract the size of the enum discriminant.
929 let bytes = variant_layout.size.bytes().saturating_sub(discr_size);
931 debug!("- variant `{}` is {} bytes large",
937 .fold((0, 0, 0), |(l, s, li), (idx, size)| if size > l {
945 // We only warn if the largest variant is at least thrice as large as
946 // the second-largest.
947 if largest > slargest * 3 && slargest > 0 {
948 cx.span_lint(VARIANT_SIZE_DIFFERENCES,
949 enum_definition.variants[largest_index].span,
950 &format!("enum variant is more than three times \
951 larger ({} bytes) than the next largest",