1 use crate::check::intrinsicck::InlineAsmCtxt;
3 use super::coercion::CoerceMany;
4 use super::compare_method::check_type_bounds;
5 use super::compare_method::{compare_const_impl, compare_impl_method, compare_ty_impl};
7 use rustc_attr as attr;
8 use rustc_errors::{Applicability, ErrorGuaranteed, MultiSpan};
10 use rustc_hir::def::{DefKind, Res};
11 use rustc_hir::def_id::{DefId, LocalDefId};
12 use rustc_hir::intravisit::Visitor;
13 use rustc_hir::lang_items::LangItem;
14 use rustc_hir::{ItemKind, Node, PathSegment};
15 use rustc_infer::infer::outlives::env::OutlivesEnvironment;
16 use rustc_infer::infer::type_variable::{TypeVariableOrigin, TypeVariableOriginKind};
17 use rustc_infer::infer::{DefiningAnchor, RegionVariableOrigin, TyCtxtInferExt};
18 use rustc_infer::traits::Obligation;
19 use rustc_lint::builtin::REPR_TRANSPARENT_EXTERNAL_PRIVATE_FIELDS;
20 use rustc_middle::hir::nested_filter;
21 use rustc_middle::middle::stability::EvalResult;
22 use rustc_middle::ty::layout::{LayoutError, MAX_SIMD_LANES};
23 use rustc_middle::ty::subst::GenericArgKind;
24 use rustc_middle::ty::util::{Discr, IntTypeExt};
25 use rustc_middle::ty::{
26 self, ParamEnv, ToPredicate, Ty, TyCtxt, TypeSuperVisitable, TypeVisitable,
28 use rustc_session::lint::builtin::{UNINHABITED_STATIC, UNSUPPORTED_CALLING_CONVENTIONS};
29 use rustc_span::symbol::sym;
30 use rustc_span::{self, Span};
31 use rustc_target::spec::abi::Abi;
32 use rustc_trait_selection::traits::error_reporting::InferCtxtExt as _;
33 use rustc_trait_selection::traits::{self, ObligationCtxt};
34 use rustc_ty_utils::representability::{self, Representability};
36 use std::ops::ControlFlow;
38 pub(super) fn check_abi(tcx: TyCtxt<'_>, hir_id: hir::HirId, span: Span, abi: Abi) {
39 match tcx.sess.target.is_abi_supported(abi) {
46 "`{abi}` is not a supported ABI for the current target",
51 tcx.struct_span_lint_hir(UNSUPPORTED_CALLING_CONVENTIONS, hir_id, span, |lint| {
52 lint.build("use of calling convention not supported on this target").emit();
57 // This ABI is only allowed on function pointers
58 if abi == Abi::CCmseNonSecureCall {
63 "the `\"C-cmse-nonsecure-call\"` ABI is only allowed on function pointers"
69 /// Helper used for fns and closures. Does the grungy work of checking a function
70 /// body and returns the function context used for that purpose, since in the case of a fn item
71 /// there is still a bit more to do.
74 /// * inherited: other fields inherited from the enclosing fn (if any)
75 #[instrument(skip(inherited, body), level = "debug")]
76 pub(super) fn check_fn<'a, 'tcx>(
77 inherited: &'a Inherited<'a, 'tcx>,
78 param_env: ty::ParamEnv<'tcx>,
79 fn_sig: ty::FnSig<'tcx>,
80 decl: &'tcx hir::FnDecl<'tcx>,
82 body: &'tcx hir::Body<'tcx>,
83 can_be_generator: Option<hir::Movability>,
84 return_type_pre_known: bool,
85 ) -> (FnCtxt<'a, 'tcx>, Option<GeneratorTypes<'tcx>>) {
86 // Create the function context. This is either derived from scratch or,
87 // in the case of closures, based on the outer context.
88 let mut fcx = FnCtxt::new(inherited, param_env, body.value.hir_id);
89 fcx.ps.set(UnsafetyState::function(fn_sig.unsafety, fn_id));
90 fcx.return_type_pre_known = return_type_pre_known;
95 let declared_ret_ty = fn_sig.output();
98 fcx.register_infer_ok_obligations(fcx.infcx.replace_opaque_types_with_inference_vars(
104 // If we replaced declared_ret_ty with infer vars, then we must be inferring
105 // an opaque type, so set a flag so we can improve diagnostics.
106 fcx.return_type_has_opaque = ret_ty != declared_ret_ty;
108 fcx.ret_coercion = Some(RefCell::new(CoerceMany::new(ret_ty)));
109 fcx.ret_type_span = Some(decl.output.span());
111 let span = body.value.span;
113 fn_maybe_err(tcx, span, fn_sig.abi);
115 if fn_sig.abi == Abi::RustCall {
116 let expected_args = if let ImplicitSelfKind::None = decl.implicit_self { 1 } else { 2 };
119 let item = match tcx.hir().get(fn_id) {
120 Node::Item(hir::Item { kind: ItemKind::Fn(header, ..), .. }) => Some(header),
121 Node::ImplItem(hir::ImplItem {
122 kind: hir::ImplItemKind::Fn(header, ..), ..
124 Node::TraitItem(hir::TraitItem {
125 kind: hir::TraitItemKind::Fn(header, ..),
128 // Closures are RustCall, but they tuple their arguments, so shouldn't be checked
129 Node::Expr(hir::Expr { kind: hir::ExprKind::Closure { .. }, .. }) => None,
130 node => bug!("Item being checked wasn't a function/closure: {:?}", node),
133 if let Some(header) = item {
134 tcx.sess.span_err(header.span, "functions with the \"rust-call\" ABI must take a single non-self argument that is a tuple");
138 if fn_sig.inputs().len() != expected_args {
141 // FIXME(CraftSpider) Add a check on parameter expansion, so we don't just make the ICE happen later on
142 // This will probably require wide-scale changes to support a TupleKind obligation
143 // We can't resolve this without knowing the type of the param
144 if !matches!(fn_sig.inputs()[expected_args - 1].kind(), ty::Tuple(_) | ty::Param(_)) {
150 if body.generator_kind.is_some() && can_be_generator.is_some() {
152 .next_ty_var(TypeVariableOrigin { kind: TypeVariableOriginKind::TypeInference, span });
153 fcx.require_type_is_sized(yield_ty, span, traits::SizedYieldType);
155 // Resume type defaults to `()` if the generator has no argument.
156 let resume_ty = fn_sig.inputs().get(0).copied().unwrap_or_else(|| tcx.mk_unit());
158 fcx.resume_yield_tys = Some((resume_ty, yield_ty));
161 GatherLocalsVisitor::new(&fcx).visit_body(body);
163 // C-variadic fns also have a `VaList` input that's not listed in `fn_sig`
164 // (as it's created inside the body itself, not passed in from outside).
165 let maybe_va_list = if fn_sig.c_variadic {
166 let span = body.params.last().unwrap().span;
167 let va_list_did = tcx.require_lang_item(LangItem::VaList, Some(span));
168 let region = fcx.next_region_var(RegionVariableOrigin::MiscVariable(span));
170 Some(tcx.bound_type_of(va_list_did).subst(tcx, &[region.into()]))
175 // Add formal parameters.
176 let inputs_hir = hir.fn_decl_by_hir_id(fn_id).map(|decl| &decl.inputs);
177 let inputs_fn = fn_sig.inputs().iter().copied();
178 for (idx, (param_ty, param)) in inputs_fn.chain(maybe_va_list).zip(body.params).enumerate() {
179 // Check the pattern.
180 let ty_span = try { inputs_hir?.get(idx)?.span };
181 fcx.check_pat_top(¶m.pat, param_ty, ty_span, false);
183 // Check that argument is Sized.
184 // The check for a non-trivial pattern is a hack to avoid duplicate warnings
185 // for simple cases like `fn foo(x: Trait)`,
186 // where we would error once on the parameter as a whole, and once on the binding `x`.
187 if param.pat.simple_ident().is_none() && !tcx.features().unsized_fn_params {
188 fcx.require_type_is_sized(param_ty, param.pat.span, traits::SizedArgumentType(ty_span));
191 fcx.write_ty(param.hir_id, param_ty);
194 inherited.typeck_results.borrow_mut().liberated_fn_sigs_mut().insert(fn_id, fn_sig);
196 fcx.in_tail_expr = true;
197 if let ty::Dynamic(..) = declared_ret_ty.kind() {
198 // FIXME: We need to verify that the return type is `Sized` after the return expression has
199 // been evaluated so that we have types available for all the nodes being returned, but that
200 // requires the coerced evaluated type to be stored. Moving `check_return_expr` before this
201 // causes unsized errors caused by the `declared_ret_ty` to point at the return expression,
202 // while keeping the current ordering we will ignore the tail expression's type because we
203 // don't know it yet. We can't do `check_expr_kind` while keeping `check_return_expr`
204 // because we will trigger "unreachable expression" lints unconditionally.
205 // Because of all of this, we perform a crude check to know whether the simplest `!Sized`
206 // case that a newcomer might make, returning a bare trait, and in that case we populate
207 // the tail expression's type so that the suggestion will be correct, but ignore all other
209 fcx.check_expr(&body.value);
210 fcx.require_type_is_sized(declared_ret_ty, decl.output.span(), traits::SizedReturnType);
212 fcx.require_type_is_sized(declared_ret_ty, decl.output.span(), traits::SizedReturnType);
213 fcx.check_return_expr(&body.value, false);
215 fcx.in_tail_expr = false;
217 // We insert the deferred_generator_interiors entry after visiting the body.
218 // This ensures that all nested generators appear before the entry of this generator.
219 // resolve_generator_interiors relies on this property.
220 let gen_ty = if let (Some(_), Some(gen_kind)) = (can_be_generator, body.generator_kind) {
222 .next_ty_var(TypeVariableOrigin { kind: TypeVariableOriginKind::MiscVariable, span });
223 fcx.deferred_generator_interiors.borrow_mut().push((body.id(), interior, gen_kind));
225 let (resume_ty, yield_ty) = fcx.resume_yield_tys.unwrap();
226 Some(GeneratorTypes {
230 movability: can_be_generator.unwrap(),
236 // Finalize the return check by taking the LUB of the return types
237 // we saw and assigning it to the expected return type. This isn't
238 // really expected to fail, since the coercions would have failed
239 // earlier when trying to find a LUB.
240 let coercion = fcx.ret_coercion.take().unwrap().into_inner();
241 let mut actual_return_ty = coercion.complete(&fcx);
242 debug!("actual_return_ty = {:?}", actual_return_ty);
243 if let ty::Dynamic(..) = declared_ret_ty.kind() {
244 // We have special-cased the case where the function is declared
245 // `-> dyn Foo` and we don't actually relate it to the
246 // `fcx.ret_coercion`, so just substitute a type variable.
248 fcx.next_ty_var(TypeVariableOrigin { kind: TypeVariableOriginKind::DynReturnFn, span });
249 debug!("actual_return_ty replaced with {:?}", actual_return_ty);
252 // HACK(oli-obk, compiler-errors): We should be comparing this against
253 // `declared_ret_ty`, but then anything uninferred would be inferred to
254 // the opaque type itself. That again would cause writeback to assume
255 // we have a recursive call site and do the sadly stabilized fallback to `()`.
256 fcx.demand_suptype(span, ret_ty, actual_return_ty);
258 // Check that a function marked as `#[panic_handler]` has signature `fn(&PanicInfo) -> !`
259 if let Some(panic_impl_did) = tcx.lang_items().panic_impl()
260 && panic_impl_did == hir.local_def_id(fn_id).to_def_id()
262 check_panic_info_fn(tcx, panic_impl_did.expect_local(), fn_sig, decl, declared_ret_ty);
265 // Check that a function marked as `#[alloc_error_handler]` has signature `fn(Layout) -> !`
266 if let Some(alloc_error_handler_did) = tcx.lang_items().oom()
267 && alloc_error_handler_did == hir.local_def_id(fn_id).to_def_id()
269 check_alloc_error_fn(tcx, alloc_error_handler_did.expect_local(), fn_sig, decl, declared_ret_ty);
275 fn check_panic_info_fn(
278 fn_sig: ty::FnSig<'_>,
279 decl: &hir::FnDecl<'_>,
280 declared_ret_ty: Ty<'_>,
282 let Some(panic_info_did) = tcx.lang_items().panic_info() else {
283 tcx.sess.err("language item required, but not found: `panic_info`");
287 if *declared_ret_ty.kind() != ty::Never {
288 tcx.sess.span_err(decl.output.span(), "return type should be `!`");
291 let inputs = fn_sig.inputs();
292 if inputs.len() != 1 {
293 tcx.sess.span_err(tcx.def_span(fn_id), "function should have one argument");
297 let arg_is_panic_info = match *inputs[0].kind() {
298 ty::Ref(region, ty, mutbl) => match *ty.kind() {
299 ty::Adt(ref adt, _) => {
300 adt.did() == panic_info_did && mutbl == hir::Mutability::Not && !region.is_static()
307 if !arg_is_panic_info {
308 tcx.sess.span_err(decl.inputs[0].span, "argument should be `&PanicInfo`");
311 let DefKind::Fn = tcx.def_kind(fn_id) else {
312 let span = tcx.def_span(fn_id);
313 tcx.sess.span_err(span, "should be a function");
317 let generic_counts = tcx.generics_of(fn_id).own_counts();
318 if generic_counts.types != 0 {
319 let span = tcx.def_span(fn_id);
320 tcx.sess.span_err(span, "should have no type parameters");
322 if generic_counts.consts != 0 {
323 let span = tcx.def_span(fn_id);
324 tcx.sess.span_err(span, "should have no const parameters");
328 fn check_alloc_error_fn(
331 fn_sig: ty::FnSig<'_>,
332 decl: &hir::FnDecl<'_>,
333 declared_ret_ty: Ty<'_>,
335 let Some(alloc_layout_did) = tcx.lang_items().alloc_layout() else {
336 tcx.sess.err("language item required, but not found: `alloc_layout`");
340 if *declared_ret_ty.kind() != ty::Never {
341 tcx.sess.span_err(decl.output.span(), "return type should be `!`");
344 let inputs = fn_sig.inputs();
345 if inputs.len() != 1 {
346 tcx.sess.span_err(tcx.def_span(fn_id), "function should have one argument");
350 let arg_is_alloc_layout = match inputs[0].kind() {
351 ty::Adt(ref adt, _) => adt.did() == alloc_layout_did,
355 if !arg_is_alloc_layout {
356 tcx.sess.span_err(decl.inputs[0].span, "argument should be `Layout`");
359 let DefKind::Fn = tcx.def_kind(fn_id) else {
360 let span = tcx.def_span(fn_id);
361 tcx.sess.span_err(span, "`#[alloc_error_handler]` should be a function");
365 let generic_counts = tcx.generics_of(fn_id).own_counts();
366 if generic_counts.types != 0 {
367 let span = tcx.def_span(fn_id);
368 tcx.sess.span_err(span, "`#[alloc_error_handler]` function should have no type parameters");
370 if generic_counts.consts != 0 {
371 let span = tcx.def_span(fn_id);
373 .span_err(span, "`#[alloc_error_handler]` function should have no const parameters");
377 fn check_struct(tcx: TyCtxt<'_>, def_id: LocalDefId) {
378 let def = tcx.adt_def(def_id);
379 let span = tcx.def_span(def_id);
380 def.destructor(tcx); // force the destructor to be evaluated
381 check_representable(tcx, span, def_id);
383 if def.repr().simd() {
384 check_simd(tcx, span, def_id);
387 check_transparent(tcx, span, def);
388 check_packed(tcx, span, def);
391 fn check_union(tcx: TyCtxt<'_>, def_id: LocalDefId) {
392 let def = tcx.adt_def(def_id);
393 let span = tcx.def_span(def_id);
394 def.destructor(tcx); // force the destructor to be evaluated
395 check_representable(tcx, span, def_id);
396 check_transparent(tcx, span, def);
397 check_union_fields(tcx, span, def_id);
398 check_packed(tcx, span, def);
401 /// Check that the fields of the `union` do not need dropping.
402 fn check_union_fields(tcx: TyCtxt<'_>, span: Span, item_def_id: LocalDefId) -> bool {
403 let item_type = tcx.type_of(item_def_id);
404 if let ty::Adt(def, substs) = item_type.kind() {
405 assert!(def.is_union());
407 fn allowed_union_field<'tcx>(
410 param_env: ty::ParamEnv<'tcx>,
413 // We don't just accept all !needs_drop fields, due to semver concerns.
415 ty::Ref(..) => true, // references never drop (even mutable refs, which are non-Copy and hence fail the later check)
417 // allow tuples of allowed types
418 tys.iter().all(|ty| allowed_union_field(ty, tcx, param_env, span))
420 ty::Array(elem, _len) => {
421 // Like `Copy`, we do *not* special-case length 0.
422 allowed_union_field(*elem, tcx, param_env, span)
425 // Fallback case: allow `ManuallyDrop` and things that are `Copy`.
426 ty.ty_adt_def().is_some_and(|adt_def| adt_def.is_manually_drop())
427 || ty.is_copy_modulo_regions(tcx.at(span), param_env)
432 let param_env = tcx.param_env(item_def_id);
433 for field in &def.non_enum_variant().fields {
434 let field_ty = field.ty(tcx, substs);
436 if !allowed_union_field(field_ty, tcx, param_env, span) {
437 let (field_span, ty_span) = match tcx.hir().get_if_local(field.did) {
438 // We are currently checking the type this field came from, so it must be local.
439 Some(Node::Field(field)) => (field.span, field.ty.span),
440 _ => unreachable!("mir field has to correspond to hir field"),
446 "unions cannot contain fields that may need dropping"
449 "a type is guaranteed not to need dropping \
450 when it implements `Copy`, or when it is the special `ManuallyDrop<_>` type",
452 .multipart_suggestion_verbose(
453 "when the type does not implement `Copy`, \
454 wrap it inside a `ManuallyDrop<_>` and ensure it is manually dropped",
456 (ty_span.shrink_to_lo(), "std::mem::ManuallyDrop<".into()),
457 (ty_span.shrink_to_hi(), ">".into()),
459 Applicability::MaybeIncorrect,
463 } else if field_ty.needs_drop(tcx, param_env) {
464 // This should never happen. But we can get here e.g. in case of name resolution errors.
465 tcx.sess.delay_span_bug(span, "we should never accept maybe-dropping union fields");
469 span_bug!(span, "unions must be ty::Adt, but got {:?}", item_type.kind());
474 /// Check that a `static` is inhabited.
475 fn check_static_inhabited<'tcx>(tcx: TyCtxt<'tcx>, def_id: LocalDefId) {
476 // Make sure statics are inhabited.
477 // Other parts of the compiler assume that there are no uninhabited places. In principle it
478 // would be enough to check this for `extern` statics, as statics with an initializer will
479 // have UB during initialization if they are uninhabited, but there also seems to be no good
480 // reason to allow any statics to be uninhabited.
481 let ty = tcx.type_of(def_id);
482 let span = tcx.def_span(def_id);
483 let layout = match tcx.layout_of(ParamEnv::reveal_all().and(ty)) {
485 // Foreign statics that overflow their allowed size should emit an error
486 Err(LayoutError::SizeOverflow(_))
488 let node = tcx.hir().get_by_def_id(def_id);
491 hir::Node::ForeignItem(hir::ForeignItem {
492 kind: hir::ForeignItemKind::Static(..),
499 .struct_span_err(span, "extern static is too large for the current architecture")
503 // Generic statics are rejected, but we still reach this case.
505 tcx.sess.delay_span_bug(span, &e.to_string());
509 if layout.abi.is_uninhabited() {
510 tcx.struct_span_lint_hir(
512 tcx.hir().local_def_id_to_hir_id(def_id),
515 lint.build("static of uninhabited type")
516 .note("uninhabited statics cannot be initialized, and any access would be an immediate error")
523 /// Checks that an opaque type does not contain cycles and does not use `Self` or `T::Foo`
524 /// projections that would result in "inheriting lifetimes".
525 pub(super) fn check_opaque<'tcx>(
528 substs: SubstsRef<'tcx>,
529 origin: &hir::OpaqueTyOrigin,
531 let span = tcx.def_span(def_id);
532 check_opaque_for_inheriting_lifetimes(tcx, def_id, span);
533 if tcx.type_of(def_id).references_error() {
536 if check_opaque_for_cycles(tcx, def_id, substs, span, origin).is_err() {
539 check_opaque_meets_bounds(tcx, def_id, substs, span, origin);
542 /// Checks that an opaque type does not use `Self` or `T::Foo` projections that would result
543 /// in "inheriting lifetimes".
544 #[instrument(level = "debug", skip(tcx, span))]
545 pub(super) fn check_opaque_for_inheriting_lifetimes<'tcx>(
550 let item = tcx.hir().expect_item(def_id);
551 debug!(?item, ?span);
553 struct FoundParentLifetime;
554 struct FindParentLifetimeVisitor<'tcx>(&'tcx ty::Generics);
555 impl<'tcx> ty::visit::TypeVisitor<'tcx> for FindParentLifetimeVisitor<'tcx> {
556 type BreakTy = FoundParentLifetime;
558 fn visit_region(&mut self, r: ty::Region<'tcx>) -> ControlFlow<Self::BreakTy> {
559 debug!("FindParentLifetimeVisitor: r={:?}", r);
560 if let ty::ReEarlyBound(ty::EarlyBoundRegion { index, .. }) = *r {
561 if index < self.0.parent_count as u32 {
562 return ControlFlow::Break(FoundParentLifetime);
564 return ControlFlow::CONTINUE;
568 r.super_visit_with(self)
571 fn visit_const(&mut self, c: ty::Const<'tcx>) -> ControlFlow<Self::BreakTy> {
572 if let ty::ConstKind::Unevaluated(..) = c.kind() {
573 // FIXME(#72219) We currently don't detect lifetimes within substs
574 // which would violate this check. Even though the particular substitution is not used
575 // within the const, this should still be fixed.
576 return ControlFlow::CONTINUE;
578 c.super_visit_with(self)
582 struct ProhibitOpaqueVisitor<'tcx> {
584 opaque_identity_ty: Ty<'tcx>,
585 generics: &'tcx ty::Generics,
586 selftys: Vec<(Span, Option<String>)>,
589 impl<'tcx> ty::visit::TypeVisitor<'tcx> for ProhibitOpaqueVisitor<'tcx> {
590 type BreakTy = Ty<'tcx>;
592 fn visit_ty(&mut self, t: Ty<'tcx>) -> ControlFlow<Self::BreakTy> {
593 debug!("check_opaque_for_inheriting_lifetimes: (visit_ty) t={:?}", t);
594 if t == self.opaque_identity_ty {
595 ControlFlow::CONTINUE
597 t.super_visit_with(&mut FindParentLifetimeVisitor(self.generics))
598 .map_break(|FoundParentLifetime| t)
603 impl<'tcx> Visitor<'tcx> for ProhibitOpaqueVisitor<'tcx> {
604 type NestedFilter = nested_filter::OnlyBodies;
606 fn nested_visit_map(&mut self) -> Self::Map {
610 fn visit_ty(&mut self, arg: &'tcx hir::Ty<'tcx>) {
612 hir::TyKind::Path(hir::QPath::Resolved(None, path)) => match &path.segments {
613 [PathSegment { res: Res::SelfTy { trait_: _, alias_to: impl_ref }, .. }] => {
615 impl_ref.map(|(def_id, _)| self.tcx.def_path_str(def_id));
616 self.selftys.push((path.span, impl_ty_name));
622 hir::intravisit::walk_ty(self, arg);
626 if let ItemKind::OpaqueTy(hir::OpaqueTy {
627 origin: hir::OpaqueTyOrigin::AsyncFn(..) | hir::OpaqueTyOrigin::FnReturn(..),
631 let mut visitor = ProhibitOpaqueVisitor {
632 opaque_identity_ty: tcx.mk_opaque(
634 InternalSubsts::identity_for_item(tcx, def_id.to_def_id()),
636 generics: tcx.generics_of(def_id),
640 let prohibit_opaque = tcx
641 .explicit_item_bounds(def_id)
643 .try_for_each(|(predicate, _)| predicate.visit_with(&mut visitor));
645 "check_opaque_for_inheriting_lifetimes: prohibit_opaque={:?}, visitor.opaque_identity_ty={:?}, visitor.generics={:?}",
646 prohibit_opaque, visitor.opaque_identity_ty, visitor.generics
649 if let Some(ty) = prohibit_opaque.break_value() {
650 visitor.visit_item(&item);
651 let is_async = match item.kind {
652 ItemKind::OpaqueTy(hir::OpaqueTy { origin, .. }) => {
653 matches!(origin, hir::OpaqueTyOrigin::AsyncFn(..))
658 let mut err = struct_span_err!(
662 "`{}` return type cannot contain a projection or `Self` that references lifetimes from \
664 if is_async { "async fn" } else { "impl Trait" },
667 for (span, name) in visitor.selftys {
670 "consider spelling out the type instead",
671 name.unwrap_or_else(|| format!("{:?}", ty)),
672 Applicability::MaybeIncorrect,
680 /// Checks that an opaque type does not contain cycles.
681 pub(super) fn check_opaque_for_cycles<'tcx>(
684 substs: SubstsRef<'tcx>,
686 origin: &hir::OpaqueTyOrigin,
687 ) -> Result<(), ErrorGuaranteed> {
688 if tcx.try_expand_impl_trait_type(def_id.to_def_id(), substs).is_err() {
689 let reported = match origin {
690 hir::OpaqueTyOrigin::AsyncFn(..) => async_opaque_type_cycle_error(tcx, span),
691 _ => opaque_type_cycle_error(tcx, def_id, span),
699 /// Check that the concrete type behind `impl Trait` actually implements `Trait`.
701 /// This is mostly checked at the places that specify the opaque type, but we
702 /// check those cases in the `param_env` of that function, which may have
703 /// bounds not on this opaque type:
705 /// type X<T> = impl Clone
706 /// fn f<T: Clone>(t: T) -> X<T> {
710 /// Without this check the above code is incorrectly accepted: we would ICE if
711 /// some tried, for example, to clone an `Option<X<&mut ()>>`.
712 #[instrument(level = "debug", skip(tcx))]
713 fn check_opaque_meets_bounds<'tcx>(
716 substs: SubstsRef<'tcx>,
718 origin: &hir::OpaqueTyOrigin,
720 let hidden_type = tcx.bound_type_of(def_id.to_def_id()).subst(tcx, substs);
722 let hir_id = tcx.hir().local_def_id_to_hir_id(def_id);
723 let defining_use_anchor = match *origin {
724 hir::OpaqueTyOrigin::FnReturn(did) | hir::OpaqueTyOrigin::AsyncFn(did) => did,
725 hir::OpaqueTyOrigin::TyAlias => def_id,
727 let param_env = tcx.param_env(defining_use_anchor);
729 tcx.infer_ctxt().with_opaque_type_inference(DefiningAnchor::Bind(defining_use_anchor)).enter(
731 let ocx = ObligationCtxt::new(&infcx);
732 let opaque_ty = tcx.mk_opaque(def_id.to_def_id(), substs);
734 let misc_cause = traits::ObligationCause::misc(span, hir_id);
736 match infcx.at(&misc_cause, param_env).eq(opaque_ty, hidden_type) {
737 Ok(infer_ok) => ocx.register_infer_ok_obligations(infer_ok),
739 tcx.sess.delay_span_bug(
741 &format!("could not unify `{hidden_type}` with revealed type:\n{ty_err}"),
746 // Additionally require the hidden type to be well-formed with only the generics of the opaque type.
747 // Defining use functions may have more bounds than the opaque type, which is ok, as long as the
748 // hidden type is well formed even without those bounds.
749 let predicate = ty::Binder::dummy(ty::PredicateKind::WellFormed(hidden_type.into()))
751 ocx.register_obligation(Obligation::new(misc_cause, param_env, predicate));
753 // Check that all obligations are satisfied by the implementation's
755 let errors = ocx.select_all_or_error();
756 if !errors.is_empty() {
757 infcx.report_fulfillment_errors(&errors, None, false);
760 // Checked when type checking the function containing them.
761 hir::OpaqueTyOrigin::FnReturn(..) | hir::OpaqueTyOrigin::AsyncFn(..) => {}
762 // Can have different predicates to their defining use
763 hir::OpaqueTyOrigin::TyAlias => {
764 let outlives_environment = OutlivesEnvironment::new(param_env);
765 infcx.check_region_obligations_and_report_errors(
767 &outlives_environment,
771 // Clean up after ourselves
772 let _ = infcx.inner.borrow_mut().opaque_type_storage.take_opaque_types();
777 fn check_item_type<'tcx>(tcx: TyCtxt<'tcx>, id: hir::ItemId) {
779 "check_item_type(it.def_id={:?}, it.name={})",
781 tcx.def_path_str(id.def_id.to_def_id())
783 let _indenter = indenter();
784 match tcx.def_kind(id.def_id) {
785 DefKind::Static(..) => {
786 tcx.ensure().typeck(id.def_id);
787 maybe_check_static_with_link_section(tcx, id.def_id);
788 check_static_inhabited(tcx, id.def_id);
791 tcx.ensure().typeck(id.def_id);
794 let item = tcx.hir().item(id);
795 let hir::ItemKind::Enum(ref enum_definition, _) = item.kind else {
798 check_enum(tcx, &enum_definition.variants, item.def_id);
800 DefKind::Fn => {} // entirely within check_item_body
802 let it = tcx.hir().item(id);
803 let hir::ItemKind::Impl(ref impl_) = it.kind else {
806 debug!("ItemKind::Impl {} with id {:?}", it.ident, it.def_id);
807 if let Some(impl_trait_ref) = tcx.impl_trait_ref(it.def_id) {
808 check_impl_items_against_trait(
815 check_on_unimplemented(tcx, it);
819 let it = tcx.hir().item(id);
820 let hir::ItemKind::Trait(_, _, _, _, ref items) = it.kind else {
823 check_on_unimplemented(tcx, it);
825 for item in items.iter() {
826 let item = tcx.hir().trait_item(item.id);
828 hir::TraitItemKind::Fn(ref sig, _) => {
829 let abi = sig.header.abi;
830 fn_maybe_err(tcx, item.ident.span, abi);
832 hir::TraitItemKind::Type(.., Some(default)) => {
833 let assoc_item = tcx.associated_item(item.def_id);
835 InternalSubsts::identity_for_item(tcx, it.def_id.to_def_id());
836 let _: Result<_, rustc_errors::ErrorGuaranteed> = check_type_bounds(
841 ty::TraitRef { def_id: it.def_id.to_def_id(), substs: trait_substs },
849 check_struct(tcx, id.def_id);
852 check_union(tcx, id.def_id);
854 DefKind::OpaqueTy => {
855 let item = tcx.hir().item(id);
856 let hir::ItemKind::OpaqueTy(hir::OpaqueTy { origin, .. }) = item.kind else {
859 // HACK(jynelson): trying to infer the type of `impl trait` breaks documenting
860 // `async-std` (and `pub async fn` in general).
861 // Since rustdoc doesn't care about the concrete type behind `impl Trait`, just don't look at it!
862 // See https://github.com/rust-lang/rust/issues/75100
863 if !tcx.sess.opts.actually_rustdoc {
864 let substs = InternalSubsts::identity_for_item(tcx, item.def_id.to_def_id());
865 check_opaque(tcx, item.def_id, substs, &origin);
868 DefKind::TyAlias => {
869 let pty_ty = tcx.type_of(id.def_id);
870 let generics = tcx.generics_of(id.def_id);
871 check_type_params_are_used(tcx, &generics, pty_ty);
873 DefKind::ForeignMod => {
874 let it = tcx.hir().item(id);
875 let hir::ItemKind::ForeignMod { abi, items } = it.kind else {
878 check_abi(tcx, it.hir_id(), it.span, abi);
880 if abi == Abi::RustIntrinsic {
882 let item = tcx.hir().foreign_item(item.id);
883 intrinsic::check_intrinsic_type(tcx, item);
885 } else if abi == Abi::PlatformIntrinsic {
887 let item = tcx.hir().foreign_item(item.id);
888 intrinsic::check_platform_intrinsic_type(tcx, item);
892 let def_id = item.id.def_id;
893 let generics = tcx.generics_of(def_id);
894 let own_counts = generics.own_counts();
895 if generics.params.len() - own_counts.lifetimes != 0 {
896 let (kinds, kinds_pl, egs) = match (own_counts.types, own_counts.consts) {
897 (_, 0) => ("type", "types", Some("u32")),
898 // We don't specify an example value, because we can't generate
899 // a valid value for any type.
900 (0, _) => ("const", "consts", None),
901 _ => ("type or const", "types or consts", None),
907 "foreign items may not have {kinds} parameters",
909 .span_label(item.span, &format!("can't have {kinds} parameters"))
911 // FIXME: once we start storing spans for type arguments, turn this
912 // into a suggestion.
914 "replace the {} parameters with concrete {}{}",
917 egs.map(|egs| format!(" like `{}`", egs)).unwrap_or_default(),
923 let item = tcx.hir().foreign_item(item.id);
925 hir::ForeignItemKind::Fn(ref fn_decl, _, _) => {
926 require_c_abi_if_c_variadic(tcx, fn_decl, abi, item.span);
928 hir::ForeignItemKind::Static(..) => {
929 check_static_inhabited(tcx, def_id);
936 DefKind::GlobalAsm => {
937 let it = tcx.hir().item(id);
938 let hir::ItemKind::GlobalAsm(asm) = it.kind else { span_bug!(it.span, "DefKind::GlobalAsm but got {:#?}", it) };
939 InlineAsmCtxt::new_global_asm(tcx).check_asm(asm, id.hir_id());
945 pub(super) fn check_on_unimplemented(tcx: TyCtxt<'_>, item: &hir::Item<'_>) {
946 // an error would be reported if this fails.
947 let _ = traits::OnUnimplementedDirective::of_item(tcx, item.def_id.to_def_id());
950 pub(super) fn check_specialization_validity<'tcx>(
952 trait_def: &ty::TraitDef,
953 trait_item: &ty::AssocItem,
955 impl_item: &hir::ImplItemRef,
957 let Ok(ancestors) = trait_def.ancestors(tcx, impl_id) else { return };
958 let mut ancestor_impls = ancestors.skip(1).filter_map(|parent| {
959 if parent.is_from_trait() {
962 Some((parent, parent.item(tcx, trait_item.def_id)))
966 let opt_result = ancestor_impls.find_map(|(parent_impl, parent_item)| {
968 // Parent impl exists, and contains the parent item we're trying to specialize, but
969 // doesn't mark it `default`.
970 Some(parent_item) if traits::impl_item_is_final(tcx, &parent_item) => {
971 Some(Err(parent_impl.def_id()))
974 // Parent impl contains item and makes it specializable.
975 Some(_) => Some(Ok(())),
977 // Parent impl doesn't mention the item. This means it's inherited from the
978 // grandparent. In that case, if parent is a `default impl`, inherited items use the
979 // "defaultness" from the grandparent, else they are final.
981 if tcx.impl_defaultness(parent_impl.def_id()).is_default() {
984 Some(Err(parent_impl.def_id()))
990 // If `opt_result` is `None`, we have only encountered `default impl`s that don't contain the
991 // item. This is allowed, the item isn't actually getting specialized here.
992 let result = opt_result.unwrap_or(Ok(()));
994 if let Err(parent_impl) = result {
995 report_forbidden_specialization(tcx, impl_item, parent_impl);
999 fn check_impl_items_against_trait<'tcx>(
1001 full_impl_span: Span,
1002 impl_id: LocalDefId,
1003 impl_trait_ref: ty::TraitRef<'tcx>,
1004 impl_item_refs: &[hir::ImplItemRef],
1006 // If the trait reference itself is erroneous (so the compilation is going
1007 // to fail), skip checking the items here -- the `impl_item` table in `tcx`
1008 // isn't populated for such impls.
1009 if impl_trait_ref.references_error() {
1013 // Negative impls are not expected to have any items
1014 match tcx.impl_polarity(impl_id) {
1015 ty::ImplPolarity::Reservation | ty::ImplPolarity::Positive => {}
1016 ty::ImplPolarity::Negative => {
1017 if let [first_item_ref, ..] = impl_item_refs {
1018 let first_item_span = tcx.hir().impl_item(first_item_ref.id).span;
1023 "negative impls cannot have any items"
1031 let trait_def = tcx.trait_def(impl_trait_ref.def_id);
1033 for impl_item in impl_item_refs {
1034 let ty_impl_item = tcx.associated_item(impl_item.id.def_id);
1035 let ty_trait_item = if let Some(trait_item_id) = ty_impl_item.trait_item_def_id {
1036 tcx.associated_item(trait_item_id)
1038 // Checked in `associated_item`.
1039 tcx.sess.delay_span_bug(impl_item.span, "missing associated item in trait");
1042 let impl_item_full = tcx.hir().impl_item(impl_item.id);
1043 match impl_item_full.kind {
1044 hir::ImplItemKind::Const(..) => {
1045 // Find associated const definition.
1054 hir::ImplItemKind::Fn(..) => {
1055 let opt_trait_span = tcx.hir().span_if_local(ty_trait_item.def_id);
1056 compare_impl_method(
1064 hir::ImplItemKind::TyAlias(impl_ty) => {
1065 let opt_trait_span = tcx.hir().span_if_local(ty_trait_item.def_id);
1077 check_specialization_validity(
1081 impl_id.to_def_id(),
1086 if let Ok(ancestors) = trait_def.ancestors(tcx, impl_id.to_def_id()) {
1087 // Check for missing items from trait
1088 let mut missing_items = Vec::new();
1090 let mut must_implement_one_of: Option<&[Ident]> =
1091 trait_def.must_implement_one_of.as_deref();
1093 for &trait_item_id in tcx.associated_item_def_ids(impl_trait_ref.def_id) {
1094 let is_implemented = ancestors
1095 .leaf_def(tcx, trait_item_id)
1096 .map_or(false, |node_item| node_item.item.defaultness(tcx).has_value());
1098 if !is_implemented && tcx.impl_defaultness(impl_id).is_final() {
1099 missing_items.push(tcx.associated_item(trait_item_id));
1102 // true if this item is specifically implemented in this impl
1103 let is_implemented_here = ancestors
1104 .leaf_def(tcx, trait_item_id)
1105 .map_or(false, |node_item| !node_item.defining_node.is_from_trait());
1107 if !is_implemented_here {
1108 match tcx.eval_default_body_stability(trait_item_id, full_impl_span) {
1109 EvalResult::Deny { feature, reason, issue, .. } => default_body_is_unstable(
1118 // Unmarked default bodies are considered stable (at least for now).
1119 EvalResult::Allow | EvalResult::Unmarked => {}
1123 if let Some(required_items) = &must_implement_one_of {
1124 if is_implemented_here {
1125 let trait_item = tcx.associated_item(trait_item_id);
1126 if required_items.contains(&trait_item.ident(tcx)) {
1127 must_implement_one_of = None;
1133 if !missing_items.is_empty() {
1134 missing_items_err(tcx, tcx.def_span(impl_id), &missing_items, full_impl_span);
1137 if let Some(missing_items) = must_implement_one_of {
1139 .get_attr(impl_trait_ref.def_id, sym::rustc_must_implement_one_of)
1140 .map(|attr| attr.span);
1142 missing_items_must_implement_one_of_err(
1144 tcx.def_span(impl_id),
1152 /// Checks whether a type can be represented in memory. In particular, it
1153 /// identifies types that contain themselves without indirection through a
1154 /// pointer, which would mean their size is unbounded.
1155 pub(super) fn check_representable(tcx: TyCtxt<'_>, sp: Span, item_def_id: LocalDefId) -> bool {
1156 let rty = tcx.type_of(item_def_id);
1158 // Check that it is possible to represent this type. This call identifies
1159 // (1) types that contain themselves and (2) types that contain a different
1160 // recursive type. It is only necessary to throw an error on those that
1161 // contain themselves. For case 2, there must be an inner type that will be
1162 // caught by case 1.
1163 match representability::ty_is_representable(tcx, rty, sp, None) {
1164 Representability::SelfRecursive(spans) => {
1165 recursive_type_with_infinite_size_error(tcx, item_def_id.to_def_id(), spans);
1168 Representability::Representable | Representability::ContainsRecursive => (),
1173 pub fn check_simd(tcx: TyCtxt<'_>, sp: Span, def_id: LocalDefId) {
1174 let t = tcx.type_of(def_id);
1175 if let ty::Adt(def, substs) = t.kind()
1178 let fields = &def.non_enum_variant().fields;
1179 if fields.is_empty() {
1180 struct_span_err!(tcx.sess, sp, E0075, "SIMD vector cannot be empty").emit();
1183 let e = fields[0].ty(tcx, substs);
1184 if !fields.iter().all(|f| f.ty(tcx, substs) == e) {
1185 struct_span_err!(tcx.sess, sp, E0076, "SIMD vector should be homogeneous")
1186 .span_label(sp, "SIMD elements must have the same type")
1191 let len = if let ty::Array(_ty, c) = e.kind() {
1192 c.try_eval_usize(tcx, tcx.param_env(def.did()))
1194 Some(fields.len() as u64)
1196 if let Some(len) = len {
1198 struct_span_err!(tcx.sess, sp, E0075, "SIMD vector cannot be empty").emit();
1200 } else if len > MAX_SIMD_LANES {
1205 "SIMD vector cannot have more than {MAX_SIMD_LANES} elements",
1212 // Check that we use types valid for use in the lanes of a SIMD "vector register"
1213 // These are scalar types which directly match a "machine" type
1214 // Yes: Integers, floats, "thin" pointers
1215 // No: char, "fat" pointers, compound types
1217 ty::Param(_) => (), // pass struct<T>(T, T, T, T) through, let monomorphization catch errors
1218 ty::Int(_) | ty::Uint(_) | ty::Float(_) | ty::RawPtr(_) => (), // struct(u8, u8, u8, u8) is ok
1219 ty::Array(t, _) if matches!(t.kind(), ty::Param(_)) => (), // pass struct<T>([T; N]) through, let monomorphization catch errors
1223 ty::Int(_) | ty::Uint(_) | ty::Float(_) | ty::RawPtr(_)
1225 { /* struct([f32; 4]) is ok */ }
1231 "SIMD vector element type should be a \
1232 primitive scalar (integer/float/pointer) type"
1241 pub(super) fn check_packed(tcx: TyCtxt<'_>, sp: Span, def: ty::AdtDef<'_>) {
1242 let repr = def.repr();
1244 for attr in tcx.get_attrs(def.did(), sym::repr) {
1245 for r in attr::parse_repr_attr(&tcx.sess, attr) {
1246 if let attr::ReprPacked(pack) = r
1247 && let Some(repr_pack) = repr.pack
1248 && pack as u64 != repr_pack.bytes()
1254 "type has conflicting packed representation hints"
1260 if repr.align.is_some() {
1265 "type has conflicting packed and align representation hints"
1269 if let Some(def_spans) = check_packed_inner(tcx, def.did(), &mut vec![]) {
1270 let mut err = struct_span_err!(
1274 "packed type cannot transitively contain a `#[repr(align)]` type"
1278 tcx.def_span(def_spans[0].0),
1280 "`{}` has a `#[repr(align)]` attribute",
1281 tcx.item_name(def_spans[0].0)
1285 if def_spans.len() > 2 {
1286 let mut first = true;
1287 for (adt_def, span) in def_spans.iter().skip(1).rev() {
1288 let ident = tcx.item_name(*adt_def);
1293 "`{}` contains a field of type `{}`",
1294 tcx.type_of(def.did()),
1298 format!("...which contains a field of type `{ident}`")
1311 pub(super) fn check_packed_inner(
1314 stack: &mut Vec<DefId>,
1315 ) -> Option<Vec<(DefId, Span)>> {
1316 if let ty::Adt(def, substs) = tcx.type_of(def_id).kind() {
1317 if def.is_struct() || def.is_union() {
1318 if def.repr().align.is_some() {
1319 return Some(vec![(def.did(), DUMMY_SP)]);
1323 for field in &def.non_enum_variant().fields {
1324 if let ty::Adt(def, _) = field.ty(tcx, substs).kind()
1325 && !stack.contains(&def.did())
1326 && let Some(mut defs) = check_packed_inner(tcx, def.did(), stack)
1328 defs.push((def.did(), field.ident(tcx).span));
1339 pub(super) fn check_transparent<'tcx>(tcx: TyCtxt<'tcx>, sp: Span, adt: ty::AdtDef<'tcx>) {
1340 if !adt.repr().transparent() {
1344 if adt.is_union() && !tcx.features().transparent_unions {
1346 &tcx.sess.parse_sess,
1347 sym::transparent_unions,
1349 "transparent unions are unstable",
1354 if adt.variants().len() != 1 {
1355 bad_variant_count(tcx, adt, sp, adt.did());
1356 if adt.variants().is_empty() {
1357 // Don't bother checking the fields. No variants (and thus no fields) exist.
1362 // For each field, figure out if it's known to be a ZST and align(1), with "known"
1363 // respecting #[non_exhaustive] attributes.
1364 let field_infos = adt.all_fields().map(|field| {
1365 let ty = field.ty(tcx, InternalSubsts::identity_for_item(tcx, field.did));
1366 let param_env = tcx.param_env(field.did);
1367 let layout = tcx.layout_of(param_env.and(ty));
1368 // We are currently checking the type this field came from, so it must be local
1369 let span = tcx.hir().span_if_local(field.did).unwrap();
1370 let zst = layout.map_or(false, |layout| layout.is_zst());
1371 let align1 = layout.map_or(false, |layout| layout.align.abi.bytes() == 1);
1373 return (span, zst, align1, None);
1376 fn check_non_exhaustive<'tcx>(
1379 ) -> ControlFlow<(&'static str, DefId, SubstsRef<'tcx>, bool)> {
1381 ty::Tuple(list) => list.iter().try_for_each(|t| check_non_exhaustive(tcx, t)),
1382 ty::Array(ty, _) => check_non_exhaustive(tcx, *ty),
1383 ty::Adt(def, subst) => {
1384 if !def.did().is_local() {
1385 let non_exhaustive = def.is_variant_list_non_exhaustive()
1389 .any(ty::VariantDef::is_field_list_non_exhaustive);
1390 let has_priv = def.all_fields().any(|f| !f.vis.is_public());
1391 if non_exhaustive || has_priv {
1392 return ControlFlow::Break((
1401 .map(|field| field.ty(tcx, subst))
1402 .try_for_each(|t| check_non_exhaustive(tcx, t))
1404 _ => ControlFlow::Continue(()),
1408 (span, zst, align1, check_non_exhaustive(tcx, ty).break_value())
1411 let non_zst_fields = field_infos
1413 .filter_map(|(span, zst, _align1, _non_exhaustive)| if !zst { Some(span) } else { None });
1414 let non_zst_count = non_zst_fields.clone().count();
1415 if non_zst_count >= 2 {
1416 bad_non_zero_sized_fields(tcx, adt, non_zst_count, non_zst_fields, sp);
1418 let incompatible_zst_fields =
1419 field_infos.clone().filter(|(_, _, _, opt)| opt.is_some()).count();
1420 let incompat = incompatible_zst_fields + non_zst_count >= 2 && non_zst_count < 2;
1421 for (span, zst, align1, non_exhaustive) in field_infos {
1427 "zero-sized field in transparent {} has alignment larger than 1",
1430 .span_label(span, "has alignment larger than 1")
1433 if incompat && let Some((descr, def_id, substs, non_exhaustive)) = non_exhaustive {
1434 tcx.struct_span_lint_hir(
1435 REPR_TRANSPARENT_EXTERNAL_PRIVATE_FIELDS,
1436 tcx.hir().local_def_id_to_hir_id(adt.did().expect_local()),
1439 let note = if non_exhaustive {
1440 "is marked with `#[non_exhaustive]`"
1442 "contains private fields"
1444 let field_ty = tcx.def_path_str_with_substs(def_id, substs);
1445 lint.build("zero-sized fields in repr(transparent) cannot contain external non-exhaustive types")
1446 .note(format!("this {descr} contains `{field_ty}`, which {note}, \
1447 and makes it not a breaking change to become non-zero-sized in the future."))
1455 #[allow(trivial_numeric_casts)]
1456 fn check_enum<'tcx>(tcx: TyCtxt<'tcx>, vs: &'tcx [hir::Variant<'tcx>], def_id: LocalDefId) {
1457 let def = tcx.adt_def(def_id);
1458 let sp = tcx.def_span(def_id);
1459 def.destructor(tcx); // force the destructor to be evaluated
1462 if let Some(attr) = tcx.get_attrs(def_id.to_def_id(), sym::repr).next() {
1467 "unsupported representation for zero-variant enum"
1469 .span_label(sp, "zero-variant enum")
1474 let repr_type_ty = def.repr().discr_type().to_ty(tcx);
1475 if repr_type_ty == tcx.types.i128 || repr_type_ty == tcx.types.u128 {
1476 if !tcx.features().repr128 {
1478 &tcx.sess.parse_sess,
1481 "repr with 128-bit type is unstable",
1488 if let Some(ref e) = v.disr_expr {
1489 tcx.ensure().typeck(tcx.hir().local_def_id(e.hir_id));
1493 if tcx.adt_def(def_id).repr().int.is_none() && tcx.features().arbitrary_enum_discriminant {
1494 let is_unit = |var: &hir::Variant<'_>| matches!(var.data, hir::VariantData::Unit(..));
1496 let has_disr = |var: &hir::Variant<'_>| var.disr_expr.is_some();
1497 let has_non_units = vs.iter().any(|var| !is_unit(var));
1498 let disr_units = vs.iter().any(|var| is_unit(&var) && has_disr(&var));
1499 let disr_non_unit = vs.iter().any(|var| !is_unit(&var) && has_disr(&var));
1501 if disr_non_unit || (disr_units && has_non_units) {
1503 struct_span_err!(tcx.sess, sp, E0732, "`#[repr(inttype)]` must be specified");
1508 detect_discriminant_duplicate(tcx, def.discriminants(tcx).collect(), vs, sp);
1510 check_representable(tcx, sp, def_id);
1511 check_transparent(tcx, sp, def);
1514 /// Part of enum check. Given the discriminants of an enum, errors if two or more discriminants are equal
1515 fn detect_discriminant_duplicate<'tcx>(
1517 mut discrs: Vec<(VariantIdx, Discr<'tcx>)>,
1518 vs: &'tcx [hir::Variant<'tcx>],
1521 // Helper closure to reduce duplicate code. This gets called everytime we detect a duplicate.
1522 // Here `idx` refers to the order of which the discriminant appears, and its index in `vs`
1523 let report = |dis: Discr<'tcx>, idx: usize, err: &mut Diagnostic| {
1524 let var = &vs[idx]; // HIR for the duplicate discriminant
1525 let (span, display_discr) = match var.disr_expr {
1527 // In the case the discriminant is both a duplicate and overflowed, let the user know
1528 if let hir::ExprKind::Lit(lit) = &tcx.hir().body(expr.body).value.kind
1529 && let rustc_ast::LitKind::Int(lit_value, _int_kind) = &lit.node
1530 && *lit_value != dis.val
1532 (tcx.hir().span(expr.hir_id), format!("`{dis}` (overflowed from `{lit_value}`)"))
1533 // Otherwise, format the value as-is
1535 (tcx.hir().span(expr.hir_id), format!("`{dis}`"))
1539 // At this point we know this discriminant is a duplicate, and was not explicitly
1540 // assigned by the user. Here we iterate backwards to fetch the HIR for the last
1541 // explicitly assigned discriminant, and letting the user know that this was the
1542 // increment startpoint, and how many steps from there leading to the duplicate
1543 if let Some((n, hir::Variant { span, ident, .. })) =
1544 vs[..idx].iter().rev().enumerate().find(|v| v.1.disr_expr.is_some())
1546 let ve_ident = var.ident;
1548 let sp = if n > 1 { "variants" } else { "variant" };
1552 format!("discriminant for `{ve_ident}` incremented from this startpoint (`{ident}` + {n} {sp} later => `{ve_ident}` = {dis})"),
1556 (vs[idx].span, format!("`{dis}`"))
1560 err.span_label(span, format!("{display_discr} assigned here"));
1563 // Here we loop through the discriminants, comparing each discriminant to another.
1564 // When a duplicate is detected, we instantiate an error and point to both
1565 // initial and duplicate value. The duplicate discriminant is then discarded by swapping
1566 // it with the last element and decrementing the `vec.len` (which is why we have to evaluate
1567 // `discrs.len()` anew every iteration, and why this could be tricky to do in a functional
1568 // style as we are mutating `discrs` on the fly).
1570 while i < discrs.len() {
1571 let hir_var_i_idx = discrs[i].0.index();
1572 let mut error: Option<DiagnosticBuilder<'_, _>> = None;
1575 while o < discrs.len() {
1576 let hir_var_o_idx = discrs[o].0.index();
1578 if discrs[i].1.val == discrs[o].1.val {
1579 let err = error.get_or_insert_with(|| {
1580 let mut ret = struct_span_err!(
1584 "discriminant value `{}` assigned more than once",
1588 report(discrs[i].1, hir_var_i_idx, &mut ret);
1593 report(discrs[o].1, hir_var_o_idx, err);
1595 // Safe to unwrap here, as we wouldn't reach this point if `discrs` was empty
1596 discrs[o] = *discrs.last().unwrap();
1603 if let Some(mut e) = error {
1611 pub(super) fn check_type_params_are_used<'tcx>(
1613 generics: &ty::Generics,
1616 debug!("check_type_params_are_used(generics={:?}, ty={:?})", generics, ty);
1618 assert_eq!(generics.parent, None);
1620 if generics.own_counts().types == 0 {
1624 let mut params_used = BitSet::new_empty(generics.params.len());
1626 if ty.references_error() {
1627 // If there is already another error, do not emit
1628 // an error for not using a type parameter.
1629 assert!(tcx.sess.has_errors().is_some());
1633 for leaf in ty.walk() {
1634 if let GenericArgKind::Type(leaf_ty) = leaf.unpack()
1635 && let ty::Param(param) = leaf_ty.kind()
1637 debug!("found use of ty param {:?}", param);
1638 params_used.insert(param.index);
1642 for param in &generics.params {
1643 if !params_used.contains(param.index)
1644 && let ty::GenericParamDefKind::Type { .. } = param.kind
1646 let span = tcx.def_span(param.def_id);
1651 "type parameter `{}` is unused",
1654 .span_label(span, "unused type parameter")
1660 pub(super) fn check_mod_item_types(tcx: TyCtxt<'_>, module_def_id: LocalDefId) {
1661 let module = tcx.hir_module_items(module_def_id);
1662 for id in module.items() {
1663 check_item_type(tcx, id);
1667 fn async_opaque_type_cycle_error(tcx: TyCtxt<'_>, span: Span) -> ErrorGuaranteed {
1668 struct_span_err!(tcx.sess, span, E0733, "recursion in an `async fn` requires boxing")
1669 .span_label(span, "recursive `async fn`")
1670 .note("a recursive `async fn` must be rewritten to return a boxed `dyn Future`")
1672 "consider using the `async_recursion` crate: https://crates.io/crates/async_recursion",
1677 /// Emit an error for recursive opaque types.
1679 /// If this is a return `impl Trait`, find the item's return expressions and point at them. For
1680 /// direct recursion this is enough, but for indirect recursion also point at the last intermediary
1683 /// If all the return expressions evaluate to `!`, then we explain that the error will go away
1684 /// after changing it. This can happen when a user uses `panic!()` or similar as a placeholder.
1685 fn opaque_type_cycle_error(tcx: TyCtxt<'_>, def_id: LocalDefId, span: Span) -> ErrorGuaranteed {
1686 let mut err = struct_span_err!(tcx.sess, span, E0720, "cannot resolve opaque type");
1688 let mut label = false;
1689 if let Some((def_id, visitor)) = get_owner_return_paths(tcx, def_id) {
1690 let typeck_results = tcx.typeck(def_id);
1694 .filter_map(|expr| typeck_results.node_type_opt(expr.hir_id))
1695 .all(|ty| matches!(ty.kind(), ty::Never))
1700 .filter(|expr| typeck_results.node_type_opt(expr.hir_id).is_some())
1701 .map(|expr| expr.span)
1702 .collect::<Vec<Span>>();
1703 let span_len = spans.len();
1705 err.span_label(spans[0], "this returned value is of `!` type");
1707 let mut multispan: MultiSpan = spans.clone().into();
1709 multispan.push_span_label(span, "this returned value is of `!` type");
1711 err.span_note(multispan, "these returned values have a concrete \"never\" type");
1713 err.help("this error will resolve once the item's body returns a concrete type");
1715 let mut seen = FxHashSet::default();
1717 err.span_label(span, "recursive opaque type");
1719 for (sp, ty) in visitor
1722 .filter_map(|e| typeck_results.node_type_opt(e.hir_id).map(|t| (e.span, t)))
1723 .filter(|(_, ty)| !matches!(ty.kind(), ty::Never))
1725 struct OpaqueTypeCollector(Vec<DefId>);
1726 impl<'tcx> ty::visit::TypeVisitor<'tcx> for OpaqueTypeCollector {
1727 fn visit_ty(&mut self, t: Ty<'tcx>) -> ControlFlow<Self::BreakTy> {
1729 ty::Opaque(def, _) => {
1731 ControlFlow::CONTINUE
1733 _ => t.super_visit_with(self),
1737 let mut visitor = OpaqueTypeCollector(vec![]);
1738 ty.visit_with(&mut visitor);
1739 for def_id in visitor.0 {
1740 let ty_span = tcx.def_span(def_id);
1741 if !seen.contains(&ty_span) {
1742 err.span_label(ty_span, &format!("returning this opaque type `{ty}`"));
1743 seen.insert(ty_span);
1745 err.span_label(sp, &format!("returning here with type `{ty}`"));
1751 err.span_label(span, "cannot resolve opaque type");