1 #![allow(non_snake_case)]
3 use crate::{LateContext, LateLintPass, LintContext};
5 use rustc_attr as attr;
6 use rustc_data_structures::fx::FxHashSet;
7 use rustc_errors::Applicability;
9 use rustc_hir::def_id::DefId;
10 use rustc_hir::{is_range_literal, ExprKind, Node};
11 use rustc_index::vec::Idx;
12 use rustc_middle::mir::interpret::{sign_extend, truncate};
13 use rustc_middle::ty::layout::{IntegerExt, SizeSkeleton};
14 use rustc_middle::ty::subst::SubstsRef;
15 use rustc_middle::ty::{self, AdtKind, ParamEnv, Ty, TyCtxt};
16 use rustc_span::source_map;
17 use rustc_span::symbol::sym;
19 use rustc_target::abi::{DiscriminantKind, Integer, LayoutOf, VariantIdx, Variants};
20 use rustc_target::spec::abi::Abi;
28 "comparisons made useless by limits of the types involved"
34 "literal out of range for its type"
38 VARIANT_SIZE_DIFFERENCES,
40 "detects enums with widely varying variant sizes"
43 #[derive(Copy, Clone)]
44 pub struct TypeLimits {
45 /// Id of the last visited negated expression
46 negated_expr_id: Option<hir::HirId>,
49 impl_lint_pass!(TypeLimits => [UNUSED_COMPARISONS, OVERFLOWING_LITERALS]);
52 pub fn new() -> TypeLimits {
53 TypeLimits { negated_expr_id: None }
57 /// Attempts to special-case the overflowing literal lint when it occurs as a range endpoint.
58 /// Returns `true` iff the lint was overridden.
59 fn lint_overflowing_range_endpoint<'a, 'tcx>(
60 cx: &LateContext<'a, 'tcx>,
64 expr: &'tcx hir::Expr<'tcx>,
65 parent_expr: &'tcx hir::Expr<'tcx>,
68 // We only want to handle exclusive (`..`) ranges,
69 // which are represented as `ExprKind::Struct`.
70 let mut overwritten = false;
71 if let ExprKind::Struct(_, eps, _) = &parent_expr.kind {
75 // We can suggest using an inclusive range
76 // (`..=`) instead only if it is the `end` that is
77 // overflowing and only by 1.
78 if eps[1].expr.hir_id == expr.hir_id && lit_val - 1 == max {
79 cx.struct_span_lint(OVERFLOWING_LITERALS, parent_expr.span, |lint| {
80 let mut err = lint.build(&format!("range endpoint is out of range for `{}`", ty));
81 if let Ok(start) = cx.sess().source_map().span_to_snippet(eps[0].span) {
82 use ast::{LitIntType, LitKind};
83 // We need to preserve the literal's suffix,
84 // as it may determine typing information.
85 let suffix = match lit.node {
86 LitKind::Int(_, LitIntType::Signed(s)) => s.name_str().to_string(),
87 LitKind::Int(_, LitIntType::Unsigned(s)) => s.name_str().to_string(),
88 LitKind::Int(_, LitIntType::Unsuffixed) => "".to_string(),
91 let suggestion = format!("{}..={}{}", start, lit_val - 1, suffix);
94 &"use an inclusive range instead",
96 Applicability::MachineApplicable,
107 // For `isize` & `usize`, be conservative with the warnings, so that the
108 // warnings are consistent between 32- and 64-bit platforms.
109 fn int_ty_range(int_ty: ast::IntTy) -> (i128, i128) {
111 ast::IntTy::Isize => (i64::min_value() as i128, i64::max_value() as i128),
112 ast::IntTy::I8 => (i8::min_value() as i64 as i128, i8::max_value() as i128),
113 ast::IntTy::I16 => (i16::min_value() as i64 as i128, i16::max_value() as i128),
114 ast::IntTy::I32 => (i32::min_value() as i64 as i128, i32::max_value() as i128),
115 ast::IntTy::I64 => (i64::min_value() as i128, i64::max_value() as i128),
116 ast::IntTy::I128 => (i128::min_value() as i128, i128::max_value()),
120 fn uint_ty_range(uint_ty: ast::UintTy) -> (u128, u128) {
122 ast::UintTy::Usize => (u64::min_value() as u128, u64::max_value() as u128),
123 ast::UintTy::U8 => (u8::min_value() as u128, u8::max_value() as u128),
124 ast::UintTy::U16 => (u16::min_value() as u128, u16::max_value() as u128),
125 ast::UintTy::U32 => (u32::min_value() as u128, u32::max_value() as u128),
126 ast::UintTy::U64 => (u64::min_value() as u128, u64::max_value() as u128),
127 ast::UintTy::U128 => (u128::min_value(), u128::max_value()),
131 fn get_bin_hex_repr(cx: &LateContext<'_, '_>, lit: &hir::Lit) -> Option<String> {
132 let src = cx.sess().source_map().span_to_snippet(lit.span).ok()?;
133 let firstch = src.chars().next()?;
136 match src.chars().nth(1) {
137 Some('x' | 'b') => return Some(src),
145 fn report_bin_hex_error(
146 cx: &LateContext<'_, '_>,
147 expr: &hir::Expr<'_>,
153 let size = Integer::from_attr(&cx.tcx, ty).size();
154 cx.struct_span_lint(OVERFLOWING_LITERALS, expr.span, |lint| {
155 let (t, actually) = match ty {
156 attr::IntType::SignedInt(t) => {
157 let actually = sign_extend(val, size) as i128;
158 (t.name_str(), actually.to_string())
160 attr::IntType::UnsignedInt(t) => {
161 let actually = truncate(val, size);
162 (t.name_str(), actually.to_string())
165 let mut err = lint.build(&format!("literal out of range for {}", t));
167 "the literal `{}` (decimal `{}`) does not fit into \
168 the type `{}` and will become `{}{}`",
169 repr_str, val, t, actually, t
171 if let Some(sugg_ty) = get_type_suggestion(&cx.tables.node_type(expr.hir_id), val, negative)
173 if let Some(pos) = repr_str.chars().position(|c| c == 'i' || c == 'u') {
174 let (sans_suffix, _) = repr_str.split_at(pos);
177 &format!("consider using `{}` instead", sugg_ty),
178 format!("{}{}", sans_suffix, sugg_ty),
179 Applicability::MachineApplicable,
182 err.help(&format!("consider using `{}` instead", sugg_ty));
189 // This function finds the next fitting type and generates a suggestion string.
190 // It searches for fitting types in the following way (`X < Y`):
191 // - `iX`: if literal fits in `uX` => `uX`, else => `iY`
195 // No suggestion for: `isize`, `usize`.
196 fn get_type_suggestion(t: Ty<'_>, val: u128, negative: bool) -> Option<&'static str> {
197 use rustc_ast::ast::IntTy::*;
198 use rustc_ast::ast::UintTy::*;
199 macro_rules! find_fit {
200 ($ty:expr, $val:expr, $negative:expr,
201 $($type:ident => [$($utypes:expr),*] => [$($itypes:expr),*]),+) => {
203 let _neg = if negative { 1 } else { 0 };
206 $(if !negative && val <= uint_ty_range($utypes).1 {
207 return Some($utypes.name_str())
209 $(if val <= int_ty_range($itypes).1 as u128 + _neg {
210 return Some($itypes.name_str())
220 ty::Int(i) => find_fit!(i, val, negative,
221 I8 => [U8] => [I16, I32, I64, I128],
222 I16 => [U16] => [I32, I64, I128],
223 I32 => [U32] => [I64, I128],
224 I64 => [U64] => [I128],
225 I128 => [U128] => []),
226 ty::Uint(u) => find_fit!(u, val, negative,
227 U8 => [U8, U16, U32, U64, U128] => [],
228 U16 => [U16, U32, U64, U128] => [],
229 U32 => [U32, U64, U128] => [],
230 U64 => [U64, U128] => [],
231 U128 => [U128] => []),
236 fn lint_int_literal<'a, 'tcx>(
237 cx: &LateContext<'a, 'tcx>,
238 type_limits: &TypeLimits,
239 e: &'tcx hir::Expr<'tcx>,
244 let int_type = t.normalize(cx.sess().target.ptr_width);
245 let (min, max) = int_ty_range(int_type);
246 let max = max as u128;
247 let negative = type_limits.negated_expr_id == Some(e.hir_id);
249 // Detect literal value out of range [min, max] inclusive
250 // avoiding use of -min to prevent overflow/panic
251 if (negative && v > max + 1) || (!negative && v > max) {
252 if let Some(repr_str) = get_bin_hex_repr(cx, lit) {
253 report_bin_hex_error(cx, e, attr::IntType::SignedInt(t), repr_str, v, negative);
257 let par_id = cx.tcx.hir().get_parent_node(e.hir_id);
258 if let Node::Expr(par_e) = cx.tcx.hir().get(par_id) {
259 if let hir::ExprKind::Struct(..) = par_e.kind {
260 if is_range_literal(cx.sess().source_map(), par_e)
261 && lint_overflowing_range_endpoint(cx, lit, v, max, e, par_e, t.name_str())
263 // The overflowing literal lint was overridden.
269 cx.struct_span_lint(OVERFLOWING_LITERALS, e.span, |lint| {
270 lint.build(&format!("literal out of range for `{}`", t.name_str()))
272 "the literal `{}` does not fit into the type `{}` whose range is `{}..={}`",
275 .span_to_snippet(lit.span)
276 .expect("must get snippet from literal"),
286 fn lint_uint_literal<'a, 'tcx>(
287 cx: &LateContext<'a, 'tcx>,
288 e: &'tcx hir::Expr<'tcx>,
292 let uint_type = t.normalize(cx.sess().target.ptr_width);
293 let (min, max) = uint_ty_range(uint_type);
294 let lit_val: u128 = match lit.node {
295 // _v is u8, within range by definition
296 ast::LitKind::Byte(_v) => return,
297 ast::LitKind::Int(v, _) => v,
300 if lit_val < min || lit_val > max {
301 let parent_id = cx.tcx.hir().get_parent_node(e.hir_id);
302 if let Node::Expr(par_e) = cx.tcx.hir().get(parent_id) {
304 hir::ExprKind::Cast(..) => {
305 if let ty::Char = cx.tables.expr_ty(par_e).kind {
306 cx.struct_span_lint(OVERFLOWING_LITERALS, par_e.span, |lint| {
307 lint.build("only `u8` can be cast into `char`")
310 &"use a `char` literal instead",
311 format!("'\\u{{{:X}}}'", lit_val),
312 Applicability::MachineApplicable,
319 hir::ExprKind::Struct(..) if is_range_literal(cx.sess().source_map(), par_e) => {
320 let t = t.name_str();
321 if lint_overflowing_range_endpoint(cx, lit, lit_val, max, e, par_e, t) {
322 // The overflowing literal lint was overridden.
329 if let Some(repr_str) = get_bin_hex_repr(cx, lit) {
330 report_bin_hex_error(cx, e, attr::IntType::UnsignedInt(t), repr_str, lit_val, false);
333 cx.struct_span_lint(OVERFLOWING_LITERALS, e.span, |lint| {
334 lint.build(&format!("literal out of range for `{}`", t.name_str()))
336 "the literal `{}` does not fit into the type `{}` whose range is `{}..={}`",
339 .span_to_snippet(lit.span)
340 .expect("must get snippet from literal"),
350 fn lint_literal<'a, 'tcx>(
351 cx: &LateContext<'a, 'tcx>,
352 type_limits: &TypeLimits,
353 e: &'tcx hir::Expr<'tcx>,
356 match cx.tables.node_type(e.hir_id).kind {
359 ast::LitKind::Int(v, ast::LitIntType::Signed(_) | ast::LitIntType::Unsuffixed) => {
360 lint_int_literal(cx, type_limits, e, lit, t, v)
365 ty::Uint(t) => lint_uint_literal(cx, e, lit, t),
367 let is_infinite = match lit.node {
368 ast::LitKind::Float(v, _) => match t {
369 ast::FloatTy::F32 => v.as_str().parse().map(f32::is_infinite),
370 ast::FloatTy::F64 => v.as_str().parse().map(f64::is_infinite),
374 if is_infinite == Ok(true) {
375 cx.struct_span_lint(OVERFLOWING_LITERALS, e.span, |lint| {
376 lint.build(&format!("literal out of range for `{}`", t.name_str()))
378 "the literal `{}` does not fit into the type `{}` and will be converted to `std::{}::INFINITY`",
381 .span_to_snippet(lit.span)
382 .expect("must get snippet from literal"),
394 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for TypeLimits {
395 fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, e: &'tcx hir::Expr<'tcx>) {
397 hir::ExprKind::Unary(hir::UnOp::UnNeg, ref expr) => {
398 // propagate negation, if the negation itself isn't negated
399 if self.negated_expr_id != Some(e.hir_id) {
400 self.negated_expr_id = Some(expr.hir_id);
403 hir::ExprKind::Binary(binop, ref l, ref r) => {
404 if is_comparison(binop) && !check_limits(cx, binop, &l, &r) {
405 cx.struct_span_lint(UNUSED_COMPARISONS, e.span, |lint| {
406 lint.build("comparison is useless due to type limits").emit()
410 hir::ExprKind::Lit(ref lit) => lint_literal(cx, self, e, lit),
414 fn is_valid<T: cmp::PartialOrd>(binop: hir::BinOp, v: T, min: T, max: T) -> bool {
416 hir::BinOpKind::Lt => v > min && v <= max,
417 hir::BinOpKind::Le => v >= min && v < max,
418 hir::BinOpKind::Gt => v >= min && v < max,
419 hir::BinOpKind::Ge => v > min && v <= max,
420 hir::BinOpKind::Eq | hir::BinOpKind::Ne => v >= min && v <= max,
425 fn rev_binop(binop: hir::BinOp) -> hir::BinOp {
429 hir::BinOpKind::Lt => hir::BinOpKind::Gt,
430 hir::BinOpKind::Le => hir::BinOpKind::Ge,
431 hir::BinOpKind::Gt => hir::BinOpKind::Lt,
432 hir::BinOpKind::Ge => hir::BinOpKind::Le,
439 cx: &LateContext<'_, '_>,
444 let (lit, expr, swap) = match (&l.kind, &r.kind) {
445 (&hir::ExprKind::Lit(_), _) => (l, r, true),
446 (_, &hir::ExprKind::Lit(_)) => (r, l, false),
449 // Normalize the binop so that the literal is always on the RHS in
451 let norm_binop = if swap { rev_binop(binop) } else { binop };
452 match cx.tables.node_type(expr.hir_id).kind {
454 let (min, max) = int_ty_range(int_ty);
455 let lit_val: i128 = match lit.kind {
456 hir::ExprKind::Lit(ref li) => match li.node {
459 ast::LitIntType::Signed(_) | ast::LitIntType::Unsuffixed,
465 is_valid(norm_binop, lit_val, min, max)
467 ty::Uint(uint_ty) => {
468 let (min, max): (u128, u128) = uint_ty_range(uint_ty);
469 let lit_val: u128 = match lit.kind {
470 hir::ExprKind::Lit(ref li) => match li.node {
471 ast::LitKind::Int(v, _) => v,
476 is_valid(norm_binop, lit_val, min, max)
482 fn is_comparison(binop: hir::BinOp) -> bool {
489 | hir::BinOpKind::Gt => true,
499 "proper use of libc types in foreign modules"
502 declare_lint_pass!(ImproperCTypes => [IMPROPER_CTYPES]);
504 struct ImproperCTypesVisitor<'a, 'tcx> {
505 cx: &'a LateContext<'a, 'tcx>,
508 enum FfiResult<'tcx> {
510 FfiPhantom(Ty<'tcx>),
511 FfiUnsafe { ty: Ty<'tcx>, reason: &'static str, help: Option<&'static str> },
514 fn is_zst<'tcx>(tcx: TyCtxt<'tcx>, did: DefId, ty: Ty<'tcx>) -> bool {
515 tcx.layout_of(tcx.param_env(did).and(ty)).map(|layout| layout.is_zst()).unwrap_or(false)
518 fn ty_is_known_nonnull<'tcx>(tcx: TyCtxt<'tcx>, ty: Ty<'tcx>) -> bool {
520 ty::FnPtr(_) => true,
522 ty::Adt(field_def, substs) if field_def.repr.transparent() && !field_def.is_union() => {
523 for field in field_def.all_fields() {
525 tcx.normalize_erasing_regions(ParamEnv::reveal_all(), field.ty(tcx, substs));
526 if is_zst(tcx, field.did, field_ty) {
530 let attrs = tcx.get_attrs(field_def.did);
531 if attrs.iter().any(|a| a.check_name(sym::rustc_nonnull_optimization_guaranteed))
532 || ty_is_known_nonnull(tcx, field_ty)
544 /// Check if this enum can be safely exported based on the
545 /// "nullable pointer optimization". Currently restricted
546 /// to function pointers, references, core::num::NonZero*,
547 /// core::ptr::NonNull, and #[repr(transparent)] newtypes.
548 /// FIXME: This duplicates code in codegen.
549 fn is_repr_nullable_ptr<'tcx>(
552 ty_def: &'tcx ty::AdtDef,
553 substs: SubstsRef<'tcx>,
555 if ty_def.variants.len() != 2 {
559 let get_variant_fields = |index| &ty_def.variants[VariantIdx::new(index)].fields;
560 let variant_fields = [get_variant_fields(0), get_variant_fields(1)];
561 let fields = if variant_fields[0].is_empty() {
563 } else if variant_fields[1].is_empty() {
569 if fields.len() != 1 {
573 let field_ty = fields[0].ty(tcx, substs);
574 if !ty_is_known_nonnull(tcx, field_ty) {
578 // At this point, the field's type is known to be nonnull and the parent enum is Option-like.
579 // If the computed size for the field and the enum are different, the nonnull optimization isn't
580 // being applied (and we've got a problem somewhere).
581 let compute_size_skeleton = |t| SizeSkeleton::compute(t, tcx, ParamEnv::reveal_all()).unwrap();
582 if !compute_size_skeleton(ty).same_size(compute_size_skeleton(field_ty)) {
583 bug!("improper_ctypes: Option nonnull optimization not applied?");
589 impl<'a, 'tcx> ImproperCTypesVisitor<'a, 'tcx> {
590 /// Check if the type is array and emit an unsafe type lint.
591 fn check_for_array_ty(&mut self, sp: Span, ty: Ty<'tcx>) -> bool {
592 if let ty::Array(..) = ty.kind {
593 self.emit_ffi_unsafe_type_lint(
596 "passing raw arrays by value is not FFI-safe",
597 Some("consider passing a pointer to the array"),
605 /// Checks if the given type is "ffi-safe" (has a stable, well-defined
606 /// representation which can be exported to C code).
607 fn check_type_for_ffi(&self, cache: &mut FxHashSet<Ty<'tcx>>, ty: Ty<'tcx>) -> FfiResult<'tcx> {
610 let cx = self.cx.tcx;
612 // Protect against infinite recursion, for example
613 // `struct S(*mut S);`.
614 // FIXME: A recursion limit is necessary as well, for irregular
616 if !cache.insert(ty) {
621 ty::Adt(def, substs) => {
622 if def.is_phantom_data() {
623 return FfiPhantom(ty);
625 match def.adt_kind() {
627 if !def.repr.c() && !def.repr.transparent() {
630 reason: "this struct has unspecified layout",
632 "consider adding a `#[repr(C)]` or \
633 `#[repr(transparent)]` attribute to this struct",
638 let is_non_exhaustive =
639 def.non_enum_variant().is_field_list_non_exhaustive();
640 if is_non_exhaustive && !def.did.is_local() {
643 reason: "this struct is non-exhaustive",
648 if def.non_enum_variant().fields.is_empty() {
651 reason: "this struct has no fields",
652 help: Some("consider adding a member to this struct"),
656 // We can't completely trust repr(C) and repr(transparent) markings;
657 // make sure the fields are actually safe.
658 let mut all_phantom = true;
659 for field in &def.non_enum_variant().fields {
660 let field_ty = cx.normalize_erasing_regions(
661 ParamEnv::reveal_all(),
662 field.ty(cx, substs),
664 // repr(transparent) types are allowed to have arbitrary ZSTs, not just
665 // PhantomData -- skip checking all ZST fields
666 if def.repr.transparent() && is_zst(cx, field.did, field_ty) {
669 let r = self.check_type_for_ffi(cache, field_ty);
675 FfiUnsafe { .. } => {
681 if all_phantom { FfiPhantom(ty) } else { FfiSafe }
684 if !def.repr.c() && !def.repr.transparent() {
687 reason: "this union has unspecified layout",
689 "consider adding a `#[repr(C)]` or \
690 `#[repr(transparent)]` attribute to this union",
695 if def.non_enum_variant().fields.is_empty() {
698 reason: "this union has no fields",
699 help: Some("consider adding a field to this union"),
703 let mut all_phantom = true;
704 for field in &def.non_enum_variant().fields {
705 let field_ty = cx.normalize_erasing_regions(
706 ParamEnv::reveal_all(),
707 field.ty(cx, substs),
709 // repr(transparent) types are allowed to have arbitrary ZSTs, not just
710 // PhantomData -- skip checking all ZST fields.
711 if def.repr.transparent() && is_zst(cx, field.did, field_ty) {
714 let r = self.check_type_for_ffi(cache, field_ty);
720 FfiUnsafe { .. } => {
726 if all_phantom { FfiPhantom(ty) } else { FfiSafe }
729 if def.variants.is_empty() {
730 // Empty enums are okay... although sort of useless.
734 // Check for a repr() attribute to specify the size of the
736 if !def.repr.c() && !def.repr.transparent() && def.repr.int.is_none() {
737 // Special-case types like `Option<extern fn()>`.
738 if !is_repr_nullable_ptr(cx, ty, def, substs) {
741 reason: "enum has no representation hint",
743 "consider adding a `#[repr(C)]`, \
744 `#[repr(transparent)]`, or integer `#[repr(...)]` \
745 attribute to this enum",
751 if def.is_variant_list_non_exhaustive() && !def.did.is_local() {
754 reason: "this enum is non-exhaustive",
759 // Check the contained variants.
760 for variant in &def.variants {
761 let is_non_exhaustive = variant.is_field_list_non_exhaustive();
762 if is_non_exhaustive && !variant.def_id.is_local() {
765 reason: "this enum has non-exhaustive variants",
770 for field in &variant.fields {
771 let field_ty = cx.normalize_erasing_regions(
772 ParamEnv::reveal_all(),
773 field.ty(cx, substs),
775 // repr(transparent) types are allowed to have arbitrary ZSTs, not
776 // just PhantomData -- skip checking all ZST fields.
777 if def.repr.transparent() && is_zst(cx, field.did, field_ty) {
780 let r = self.check_type_for_ffi(cache, field_ty);
783 FfiUnsafe { .. } => {
789 reason: "this enum contains a PhantomData field",
801 ty::Char => FfiUnsafe {
803 reason: "the `char` type has no C equivalent",
804 help: Some("consider using `u32` or `libc::wchar_t` instead"),
807 ty::Int(ast::IntTy::I128) | ty::Uint(ast::UintTy::U128) => FfiUnsafe {
809 reason: "128-bit integers don't currently have a known stable ABI",
813 // Primitive types with a stable representation.
814 ty::Bool | ty::Int(..) | ty::Uint(..) | ty::Float(..) | ty::Never => FfiSafe,
816 ty::Slice(_) => FfiUnsafe {
818 reason: "slices have no C equivalent",
819 help: Some("consider using a raw pointer instead"),
823 FfiUnsafe { ty, reason: "trait objects have no C equivalent", help: None }
826 ty::Str => FfiUnsafe {
828 reason: "string slices have no C equivalent",
829 help: Some("consider using `*const u8` and a length instead"),
832 ty::Tuple(..) => FfiUnsafe {
834 reason: "tuples have unspecified layout",
835 help: Some("consider using a struct instead"),
838 ty::RawPtr(ty::TypeAndMut { ty, .. }) | ty::Ref(_, ty, _) => {
839 self.check_type_for_ffi(cache, ty)
842 ty::Array(inner_ty, _) => self.check_type_for_ffi(cache, inner_ty),
846 Abi::Rust | Abi::RustIntrinsic | Abi::PlatformIntrinsic | Abi::RustCall => {
849 reason: "this function pointer has Rust-specific calling convention",
851 "consider using an `extern fn(...) -> ...` \
852 function pointer instead",
859 let sig = cx.erase_late_bound_regions(&sig);
860 if !sig.output().is_unit() {
861 let r = self.check_type_for_ffi(cache, sig.output());
869 for arg in sig.inputs() {
870 let r = self.check_type_for_ffi(cache, arg);
881 ty::Foreign(..) => FfiSafe,
889 | ty::GeneratorWitness(..)
890 | ty::Placeholder(..)
893 | ty::FnDef(..) => bug!("unexpected type in foreign function: {:?}", ty),
897 fn emit_ffi_unsafe_type_lint(
904 self.cx.struct_span_lint(IMPROPER_CTYPES, sp, |lint| {
906 lint.build(&format!("`extern` block uses type `{}`, which is not FFI-safe", ty));
907 diag.span_label(sp, "not FFI-safe");
908 if let Some(help) = help {
912 if let ty::Adt(def, _) = ty.kind {
913 if let Some(sp) = self.cx.tcx.hir().span_if_local(def.did) {
914 diag.span_note(sp, "the type is defined here");
921 fn check_for_opaque_ty(&mut self, sp: Span, ty: Ty<'tcx>) -> bool {
922 use rustc_middle::ty::TypeFoldable;
924 struct ProhibitOpaqueTypes<'tcx> {
925 ty: Option<Ty<'tcx>>,
928 impl<'tcx> ty::fold::TypeVisitor<'tcx> for ProhibitOpaqueTypes<'tcx> {
929 fn visit_ty(&mut self, ty: Ty<'tcx>) -> bool {
930 if let ty::Opaque(..) = ty.kind {
934 ty.super_visit_with(self)
939 let mut visitor = ProhibitOpaqueTypes { ty: None };
940 ty.visit_with(&mut visitor);
941 if let Some(ty) = visitor.ty {
942 self.emit_ffi_unsafe_type_lint(ty, sp, "opaque types have no C equivalent", None);
949 fn check_type_for_ffi_and_report_errors(&mut self, sp: Span, ty: Ty<'tcx>, is_static: bool) {
950 // We have to check for opaque types before `normalize_erasing_regions`,
951 // which will replace opaque types with their underlying concrete type.
952 if self.check_for_opaque_ty(sp, ty) {
953 // We've already emitted an error due to an opaque type.
957 // it is only OK to use this function because extern fns cannot have
958 // any generic types right now:
959 let ty = self.cx.tcx.normalize_erasing_regions(ParamEnv::reveal_all(), ty);
960 // C doesn't really support passing arrays by value.
961 // The only way to pass an array by value is through a struct.
962 // So we first test that the top level isn't an array,
963 // and then recursively check the types inside.
964 if !is_static && self.check_for_array_ty(sp, ty) {
968 match self.check_type_for_ffi(&mut FxHashSet::default(), ty) {
969 FfiResult::FfiSafe => {}
970 FfiResult::FfiPhantom(ty) => {
971 self.emit_ffi_unsafe_type_lint(ty, sp, "composed only of `PhantomData`", None);
973 FfiResult::FfiUnsafe { ty, reason, help } => {
974 self.emit_ffi_unsafe_type_lint(ty, sp, reason, help);
979 fn check_foreign_fn(&mut self, id: hir::HirId, decl: &hir::FnDecl<'_>) {
980 let def_id = self.cx.tcx.hir().local_def_id(id);
981 let sig = self.cx.tcx.fn_sig(def_id);
982 let sig = self.cx.tcx.erase_late_bound_regions(&sig);
984 for (input_ty, input_hir) in sig.inputs().iter().zip(decl.inputs) {
985 self.check_type_for_ffi_and_report_errors(input_hir.span, input_ty, false);
988 if let hir::FnRetTy::Return(ref ret_hir) = decl.output {
989 let ret_ty = sig.output();
990 if !ret_ty.is_unit() {
991 self.check_type_for_ffi_and_report_errors(ret_hir.span, ret_ty, false);
996 fn check_foreign_static(&mut self, id: hir::HirId, span: Span) {
997 let def_id = self.cx.tcx.hir().local_def_id(id);
998 let ty = self.cx.tcx.type_of(def_id);
999 self.check_type_for_ffi_and_report_errors(span, ty, true);
1003 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for ImproperCTypes {
1004 fn check_foreign_item(&mut self, cx: &LateContext<'_, '_>, it: &hir::ForeignItem<'_>) {
1005 let mut vis = ImproperCTypesVisitor { cx };
1006 let abi = cx.tcx.hir().get_foreign_abi(it.hir_id);
1007 if let Abi::Rust | Abi::RustCall | Abi::RustIntrinsic | Abi::PlatformIntrinsic = abi {
1008 // Don't worry about types in internal ABIs.
1011 hir::ForeignItemKind::Fn(ref decl, _, _) => {
1012 vis.check_foreign_fn(it.hir_id, decl);
1014 hir::ForeignItemKind::Static(ref ty, _) => {
1015 vis.check_foreign_static(it.hir_id, ty.span);
1017 hir::ForeignItemKind::Type => (),
1023 declare_lint_pass!(VariantSizeDifferences => [VARIANT_SIZE_DIFFERENCES]);
1025 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for VariantSizeDifferences {
1026 fn check_item(&mut self, cx: &LateContext<'_, '_>, it: &hir::Item<'_>) {
1027 if let hir::ItemKind::Enum(ref enum_definition, _) = it.kind {
1028 let item_def_id = cx.tcx.hir().local_def_id(it.hir_id);
1029 let t = cx.tcx.type_of(item_def_id);
1030 let ty = cx.tcx.erase_regions(&t);
1031 let layout = match cx.layout_of(ty) {
1032 Ok(layout) => layout,
1034 ty::layout::LayoutError::Unknown(_) | ty::layout::LayoutError::SizeOverflow(_),
1037 let (variants, tag) = match layout.variants {
1038 Variants::Multiple {
1039 discr_kind: DiscriminantKind::Tag,
1043 } => (variants, discr),
1047 let discr_size = tag.value.size(&cx.tcx).bytes();
1050 "enum `{}` is {} bytes large with layout:\n{:#?}",
1052 layout.size.bytes(),
1056 let (largest, slargest, largest_index) = enum_definition
1060 .map(|(variant, variant_layout)| {
1061 // Subtract the size of the enum discriminant.
1062 let bytes = variant_layout.size.bytes().saturating_sub(discr_size);
1064 debug!("- variant `{}` is {} bytes large", variant.ident, bytes);
1068 .fold((0, 0, 0), |(l, s, li), (idx, size)| {
1071 } else if size > s {
1078 // We only warn if the largest variant is at least thrice as large as
1079 // the second-largest.
1080 if largest > slargest * 3 && slargest > 0 {
1081 cx.struct_span_lint(
1082 VARIANT_SIZE_DIFFERENCES,
1083 enum_definition.variants[largest_index].span,
1085 lint.build(&format!(
1086 "enum variant is more than three times \
1087 larger ({} bytes) than the next largest",