1 //! Type checking expressions.
3 //! See `mod.rs` for more context on type checking in general.
6 use crate::coercion::CoerceMany;
7 use crate::coercion::DynamicCoerceMany;
8 use crate::errors::{AddressOfTemporaryTaken, ReturnStmtOutsideOfFnBody, StructExprNonExhaustive};
10 FieldMultiplySpecifiedInInitializer, FunctionalRecordUpdateOnNonStruct,
11 YieldExprOutsideOfGenerator,
13 use crate::fatally_break_rust;
14 use crate::method::SelfSource;
15 use crate::type_error_struct;
16 use crate::Expectation::{self, ExpectCastableToType, ExpectHasType, NoExpectation};
18 report_unexpected_variant_res, BreakableCtxt, Diverges, FnCtxt, Needs,
19 TupleArgumentsFlag::DontTupleArguments,
22 use rustc_data_structures::fx::FxHashMap;
23 use rustc_data_structures::stack::ensure_sufficient_stack;
25 pluralize, struct_span_err, Applicability, Diagnostic, DiagnosticBuilder, DiagnosticId,
26 ErrorGuaranteed, StashKey,
29 use rustc_hir::def::{CtorKind, DefKind, Res};
30 use rustc_hir::def_id::DefId;
31 use rustc_hir::intravisit::Visitor;
32 use rustc_hir::lang_items::LangItem;
33 use rustc_hir::{Closure, ExprKind, HirId, QPath};
34 use rustc_hir_analysis::astconv::AstConv as _;
35 use rustc_hir_analysis::check::ty_kind_suggestion;
36 use rustc_infer::infer;
37 use rustc_infer::infer::type_variable::{TypeVariableOrigin, TypeVariableOriginKind};
38 use rustc_infer::infer::InferOk;
39 use rustc_infer::traits::ObligationCause;
40 use rustc_middle::middle::stability;
41 use rustc_middle::ty::adjustment::{Adjust, Adjustment, AllowTwoPhase};
42 use rustc_middle::ty::error::TypeError::FieldMisMatch;
43 use rustc_middle::ty::subst::SubstsRef;
44 use rustc_middle::ty::{self, AdtKind, Ty, TypeVisitable};
45 use rustc_session::errors::ExprParenthesesNeeded;
46 use rustc_session::parse::feature_err;
47 use rustc_span::hygiene::DesugaringKind;
48 use rustc_span::lev_distance::find_best_match_for_name;
49 use rustc_span::source_map::{Span, Spanned};
50 use rustc_span::symbol::{kw, sym, Ident, Symbol};
51 use rustc_target::spec::abi::Abi::RustIntrinsic;
52 use rustc_trait_selection::infer::InferCtxtExt;
53 use rustc_trait_selection::traits::{self, ObligationCauseCode};
55 impl<'a, 'tcx> FnCtxt<'a, 'tcx> {
56 fn check_expr_eq_type(&self, expr: &'tcx hir::Expr<'tcx>, expected: Ty<'tcx>) {
57 let ty = self.check_expr_with_hint(expr, expected);
58 self.demand_eqtype(expr.span, expected, ty);
61 pub fn check_expr_has_type_or_error(
63 expr: &'tcx hir::Expr<'tcx>,
65 extend_err: impl FnMut(&mut Diagnostic),
67 self.check_expr_meets_expectation_or_error(expr, ExpectHasType(expected), extend_err)
70 fn check_expr_meets_expectation_or_error(
72 expr: &'tcx hir::Expr<'tcx>,
73 expected: Expectation<'tcx>,
74 mut extend_err: impl FnMut(&mut Diagnostic),
76 let expected_ty = expected.to_option(&self).unwrap_or(self.tcx.types.bool);
77 let mut ty = self.check_expr_with_expectation(expr, expected);
79 // While we don't allow *arbitrary* coercions here, we *do* allow
80 // coercions from ! to `expected`.
82 if let Some(adjustments) = self.typeck_results.borrow().adjustments().get(expr.hir_id) {
83 self.tcx().sess.delay_span_bug(
85 "expression with never type wound up being adjusted",
87 return if let [Adjustment { kind: Adjust::NeverToAny, target }] = &adjustments[..] {
94 let adj_ty = self.next_ty_var(TypeVariableOrigin {
95 kind: TypeVariableOriginKind::AdjustmentType,
98 self.apply_adjustments(
100 vec![Adjustment { kind: Adjust::NeverToAny, target: adj_ty }],
105 if let Some(mut err) = self.demand_suptype_diag(expr.span, expected_ty, ty) {
106 let expr = expr.peel_drop_temps();
107 self.suggest_deref_ref_or_into(&mut err, expr, expected_ty, ty, None);
108 extend_err(&mut err);
114 pub(super) fn check_expr_coercable_to_type(
116 expr: &'tcx hir::Expr<'tcx>,
118 expected_ty_expr: Option<&'tcx hir::Expr<'tcx>>,
120 let ty = self.check_expr_with_hint(expr, expected);
121 // checks don't need two phase
122 self.demand_coerce(expr, ty, expected, expected_ty_expr, AllowTwoPhase::No)
125 pub(super) fn check_expr_with_hint(
127 expr: &'tcx hir::Expr<'tcx>,
130 self.check_expr_with_expectation(expr, ExpectHasType(expected))
133 fn check_expr_with_expectation_and_needs(
135 expr: &'tcx hir::Expr<'tcx>,
136 expected: Expectation<'tcx>,
139 let ty = self.check_expr_with_expectation(expr, expected);
141 // If the expression is used in a place whether mutable place is required
142 // e.g. LHS of assignment, perform the conversion.
143 if let Needs::MutPlace = needs {
144 self.convert_place_derefs_to_mutable(expr);
150 pub(super) fn check_expr(&self, expr: &'tcx hir::Expr<'tcx>) -> Ty<'tcx> {
151 self.check_expr_with_expectation(expr, NoExpectation)
154 pub(super) fn check_expr_with_needs(
156 expr: &'tcx hir::Expr<'tcx>,
159 self.check_expr_with_expectation_and_needs(expr, NoExpectation, needs)
163 /// If an expression has any sub-expressions that result in a type error,
164 /// inspecting that expression's type with `ty.references_error()` will return
165 /// true. Likewise, if an expression is known to diverge, inspecting its
166 /// type with `ty::type_is_bot` will return true (n.b.: since Rust is
167 /// strict, _|_ can appear in the type of an expression that does not,
168 /// itself, diverge: for example, fn() -> _|_.)
169 /// Note that inspecting a type's structure *directly* may expose the fact
170 /// that there are actually multiple representations for `Error`, so avoid
171 /// that when err needs to be handled differently.
172 #[instrument(skip(self, expr), level = "debug")]
173 pub(super) fn check_expr_with_expectation(
175 expr: &'tcx hir::Expr<'tcx>,
176 expected: Expectation<'tcx>,
178 self.check_expr_with_expectation_and_args(expr, expected, &[])
181 /// Same as `check_expr_with_expectation`, but allows us to pass in the arguments of a
182 /// `ExprKind::Call` when evaluating its callee when it is an `ExprKind::Path`.
183 pub(super) fn check_expr_with_expectation_and_args(
185 expr: &'tcx hir::Expr<'tcx>,
186 expected: Expectation<'tcx>,
187 args: &'tcx [hir::Expr<'tcx>],
189 if self.tcx().sess.verbose() {
190 // make this code only run with -Zverbose because it is probably slow
191 if let Ok(lint_str) = self.tcx.sess.source_map().span_to_snippet(expr.span) {
192 if !lint_str.contains('\n') {
193 debug!("expr text: {lint_str}");
195 let mut lines = lint_str.lines();
196 if let Some(line0) = lines.next() {
197 let remaining_lines = lines.count();
198 debug!("expr text: {line0}");
199 debug!("expr text: ...(and {remaining_lines} more lines)");
205 // True if `expr` is a `Try::from_ok(())` that is a result of desugaring a try block
206 // without the final expr (e.g. `try { return; }`). We don't want to generate an
207 // unreachable_code lint for it since warnings for autogenerated code are confusing.
208 let is_try_block_generated_unit_expr = match expr.kind {
209 ExprKind::Call(_, args) if expr.span.is_desugaring(DesugaringKind::TryBlock) => {
210 args.len() == 1 && args[0].span.is_desugaring(DesugaringKind::TryBlock)
216 // Warn for expressions after diverging siblings.
217 if !is_try_block_generated_unit_expr {
218 self.warn_if_unreachable(expr.hir_id, expr.span, "expression");
221 // Hide the outer diverging and has_errors flags.
222 let old_diverges = self.diverges.replace(Diverges::Maybe);
224 let ty = ensure_sufficient_stack(|| match &expr.kind {
226 qpath @ hir::QPath::Resolved(..) | qpath @ hir::QPath::TypeRelative(..),
227 ) => self.check_expr_path(qpath, expr, args),
228 _ => self.check_expr_kind(expr, expected),
231 // Warn for non-block expressions with diverging children.
237 | ExprKind::Match(..) => {}
238 // If `expr` is a result of desugaring the try block and is an ok-wrapped
239 // diverging expression (e.g. it arose from desugaring of `try { return }`),
240 // we skip issuing a warning because it is autogenerated code.
241 ExprKind::Call(..) if expr.span.is_desugaring(DesugaringKind::TryBlock) => {}
242 ExprKind::Call(callee, _) => self.warn_if_unreachable(expr.hir_id, callee.span, "call"),
243 ExprKind::MethodCall(segment, ..) => {
244 self.warn_if_unreachable(expr.hir_id, segment.ident.span, "call")
246 _ => self.warn_if_unreachable(expr.hir_id, expr.span, "expression"),
249 // Any expression that produces a value of type `!` must have diverged
251 self.diverges.set(self.diverges.get() | Diverges::always(expr.span));
254 // Record the type, which applies it effects.
255 // We need to do this after the warning above, so that
256 // we don't warn for the diverging expression itself.
257 self.write_ty(expr.hir_id, ty);
259 // Combine the diverging and has_error flags.
260 self.diverges.set(self.diverges.get() | old_diverges);
262 debug!("type of {} is...", self.tcx.hir().node_to_string(expr.hir_id));
263 debug!("... {:?}, expected is {:?}", ty, expected);
268 #[instrument(skip(self, expr), level = "debug")]
271 expr: &'tcx hir::Expr<'tcx>,
272 expected: Expectation<'tcx>,
274 trace!("expr={:#?}", expr);
278 ExprKind::Box(subexpr) => self.check_expr_box(subexpr, expected),
279 ExprKind::Lit(ref lit) => self.check_lit(&lit, expected),
280 ExprKind::Binary(op, lhs, rhs) => self.check_binop(expr, op, lhs, rhs, expected),
281 ExprKind::Assign(lhs, rhs, span) => {
282 self.check_expr_assign(expr, expected, lhs, rhs, span)
284 ExprKind::AssignOp(op, lhs, rhs) => {
285 self.check_binop_assign(expr, op, lhs, rhs, expected)
287 ExprKind::Unary(unop, oprnd) => self.check_expr_unary(unop, oprnd, expected, expr),
288 ExprKind::AddrOf(kind, mutbl, oprnd) => {
289 self.check_expr_addr_of(kind, mutbl, oprnd, expected, expr)
291 ExprKind::Path(QPath::LangItem(lang_item, _, hir_id)) => {
292 self.check_lang_item_path(lang_item, expr, hir_id)
294 ExprKind::Path(ref qpath) => self.check_expr_path(qpath, expr, &[]),
295 ExprKind::InlineAsm(asm) => {
296 // We defer some asm checks as we may not have resolved the input and output types yet (they may still be infer vars).
297 self.deferred_asm_checks.borrow_mut().push((asm, expr.hir_id));
298 self.check_expr_asm(asm)
300 ExprKind::Break(destination, ref expr_opt) => {
301 self.check_expr_break(destination, expr_opt.as_deref(), expr)
303 ExprKind::Continue(destination) => {
304 if destination.target_id.is_ok() {
307 // There was an error; make type-check fail.
311 ExprKind::Ret(ref expr_opt) => self.check_expr_return(expr_opt.as_deref(), expr),
312 ExprKind::Let(let_expr) => self.check_expr_let(let_expr),
313 ExprKind::Loop(body, _, source, _) => {
314 self.check_expr_loop(body, source, expected, expr)
316 ExprKind::Match(discrim, arms, match_src) => {
317 self.check_match(expr, &discrim, arms, expected, match_src)
319 ExprKind::Closure(&Closure { capture_clause, fn_decl, body, movability, .. }) => {
320 self.check_expr_closure(expr, capture_clause, &fn_decl, body, movability, expected)
322 ExprKind::Block(body, _) => self.check_block_with_expected(&body, expected),
323 ExprKind::Call(callee, args) => self.check_call(expr, &callee, args, expected),
324 ExprKind::MethodCall(segment, receiver, args, _) => {
325 self.check_method_call(expr, segment, receiver, args, expected)
327 ExprKind::Cast(e, t) => self.check_expr_cast(e, t, expr),
328 ExprKind::Type(e, t) => {
329 let ty = self.to_ty_saving_user_provided_ty(&t);
330 self.check_expr_eq_type(&e, ty);
333 ExprKind::If(cond, then_expr, opt_else_expr) => {
334 self.check_then_else(cond, then_expr, opt_else_expr, expr.span, expected)
336 ExprKind::DropTemps(e) => self.check_expr_with_expectation(e, expected),
337 ExprKind::Array(args) => self.check_expr_array(args, expected, expr),
338 ExprKind::ConstBlock(ref anon_const) => {
339 self.check_expr_const_block(anon_const, expected, expr)
341 ExprKind::Repeat(element, ref count) => {
342 self.check_expr_repeat(element, count, expected, expr)
344 ExprKind::Tup(elts) => self.check_expr_tuple(elts, expected, expr),
345 ExprKind::Struct(qpath, fields, ref base_expr) => {
346 self.check_expr_struct(expr, expected, qpath, fields, base_expr)
348 ExprKind::Field(base, field) => self.check_field(expr, &base, field),
349 ExprKind::Index(base, idx) => self.check_expr_index(base, idx, expr),
350 ExprKind::Yield(value, ref src) => self.check_expr_yield(value, expr, src),
351 hir::ExprKind::Err => tcx.ty_error(),
355 fn check_expr_box(&self, expr: &'tcx hir::Expr<'tcx>, expected: Expectation<'tcx>) -> Ty<'tcx> {
356 let expected_inner = expected.to_option(self).map_or(NoExpectation, |ty| match ty.kind() {
357 ty::Adt(def, _) if def.is_box() => Expectation::rvalue_hint(self, ty.boxed_ty()),
360 let referent_ty = self.check_expr_with_expectation(expr, expected_inner);
361 self.require_type_is_sized(referent_ty, expr.span, traits::SizedBoxType);
362 self.tcx.mk_box(referent_ty)
368 oprnd: &'tcx hir::Expr<'tcx>,
369 expected: Expectation<'tcx>,
370 expr: &'tcx hir::Expr<'tcx>,
373 let expected_inner = match unop {
374 hir::UnOp::Not | hir::UnOp::Neg => expected,
375 hir::UnOp::Deref => NoExpectation,
377 let mut oprnd_t = self.check_expr_with_expectation(&oprnd, expected_inner);
379 if !oprnd_t.references_error() {
380 oprnd_t = self.structurally_resolved_type(expr.span, oprnd_t);
382 hir::UnOp::Deref => {
383 if let Some(ty) = self.lookup_derefing(expr, oprnd, oprnd_t) {
386 let mut err = type_error_struct!(
391 "type `{oprnd_t}` cannot be dereferenced",
393 let sp = tcx.sess.source_map().start_point(expr.span);
395 tcx.sess.parse_sess.ambiguous_block_expr_parse.borrow().get(&sp)
397 err.subdiagnostic(ExprParenthesesNeeded::surrounding(*sp));
400 oprnd_t = tcx.ty_error();
404 let result = self.check_user_unop(expr, oprnd_t, unop, expected_inner);
405 // If it's builtin, we can reuse the type, this helps inference.
406 if !(oprnd_t.is_integral() || *oprnd_t.kind() == ty::Bool) {
411 let result = self.check_user_unop(expr, oprnd_t, unop, expected_inner);
412 // If it's builtin, we can reuse the type, this helps inference.
413 if !oprnd_t.is_numeric() {
422 fn check_expr_addr_of(
424 kind: hir::BorrowKind,
425 mutbl: hir::Mutability,
426 oprnd: &'tcx hir::Expr<'tcx>,
427 expected: Expectation<'tcx>,
428 expr: &'tcx hir::Expr<'tcx>,
430 let hint = expected.only_has_type(self).map_or(NoExpectation, |ty| {
432 ty::Ref(_, ty, _) | ty::RawPtr(ty::TypeAndMut { ty, .. }) => {
433 if oprnd.is_syntactic_place_expr() {
434 // Places may legitimately have unsized types.
435 // For example, dereferences of a fat pointer and
436 // the last field of a struct can be unsized.
439 Expectation::rvalue_hint(self, *ty)
446 self.check_expr_with_expectation_and_needs(&oprnd, hint, Needs::maybe_mut_place(mutbl));
448 let tm = ty::TypeAndMut { ty, mutbl };
450 _ if tm.ty.references_error() => self.tcx.ty_error(),
451 hir::BorrowKind::Raw => {
452 self.check_named_place_expr(oprnd);
455 hir::BorrowKind::Ref => {
456 // Note: at this point, we cannot say what the best lifetime
457 // is to use for resulting pointer. We want to use the
458 // shortest lifetime possible so as to avoid spurious borrowck
459 // errors. Moreover, the longest lifetime will depend on the
460 // precise details of the value whose address is being taken
461 // (and how long it is valid), which we don't know yet until
462 // type inference is complete.
464 // Therefore, here we simply generate a region variable. The
465 // region inferencer will then select a suitable value.
466 // Finally, borrowck will infer the value of the region again,
467 // this time with enough precision to check that the value
468 // whose address was taken can actually be made to live as long
469 // as it needs to live.
470 let region = self.next_region_var(infer::AddrOfRegion(expr.span));
471 self.tcx.mk_ref(region, tm)
476 /// Does this expression refer to a place that either:
477 /// * Is based on a local or static.
478 /// * Contains a dereference
479 /// Note that the adjustments for the children of `expr` should already
480 /// have been resolved.
481 fn check_named_place_expr(&self, oprnd: &'tcx hir::Expr<'tcx>) {
482 let is_named = oprnd.is_place_expr(|base| {
483 // Allow raw borrows if there are any deref adjustments.
485 // const VAL: (i32,) = (0,);
486 // const REF: &(i32,) = &(0,);
488 // &raw const VAL.0; // ERROR
489 // &raw const REF.0; // OK, same as &raw const (*REF).0;
491 // This is maybe too permissive, since it allows
492 // `let u = &raw const Box::new((1,)).0`, which creates an
493 // immediately dangling raw pointer.
498 .map_or(false, |x| x.iter().any(|adj| matches!(adj.kind, Adjust::Deref(_))))
501 self.tcx.sess.emit_err(AddressOfTemporaryTaken { span: oprnd.span });
505 fn check_lang_item_path(
507 lang_item: hir::LangItem,
508 expr: &'tcx hir::Expr<'tcx>,
509 hir_id: Option<hir::HirId>,
511 self.resolve_lang_item_path(lang_item, expr.span, expr.hir_id, hir_id).1
514 pub(crate) fn check_expr_path(
516 qpath: &'tcx hir::QPath<'tcx>,
517 expr: &'tcx hir::Expr<'tcx>,
518 args: &'tcx [hir::Expr<'tcx>],
521 let (res, opt_ty, segs) =
522 self.resolve_ty_and_res_fully_qualified_call(qpath, expr.hir_id, expr.span);
525 self.set_tainted_by_errors();
528 Res::Def(DefKind::Ctor(_, CtorKind::Fictive), _) => {
529 report_unexpected_variant_res(tcx, res, qpath, expr.span);
532 _ => self.instantiate_value_path(segs, opt_ty, res, expr.span, expr.hir_id).0,
535 if let ty::FnDef(did, ..) = *ty.kind() {
536 let fn_sig = ty.fn_sig(tcx);
537 if tcx.fn_sig(did).abi() == RustIntrinsic && tcx.item_name(did) == sym::transmute {
538 let from = fn_sig.inputs().skip_binder()[0];
539 let to = fn_sig.output().skip_binder();
540 // We defer the transmute to the end of typeck, once all inference vars have
541 // been resolved or we errored. This is important as we can only check transmute
542 // on concrete types, but the output type may not be known yet (it would only
543 // be known if explicitly specified via turbofish).
544 self.deferred_transmute_checks.borrow_mut().push((from, to, expr.hir_id));
546 if !tcx.features().unsized_fn_params {
547 // We want to remove some Sized bounds from std functions,
548 // but don't want to expose the removal to stable Rust.
549 // i.e., we don't want to allow
555 // to work in stable even if the Sized bound on `drop` is relaxed.
556 for i in 0..fn_sig.inputs().skip_binder().len() {
557 // We just want to check sizedness, so instead of introducing
558 // placeholder lifetimes with probing, we just replace higher lifetimes
560 let span = args.get(i).map(|a| a.span).unwrap_or(expr.span);
561 let input = self.replace_bound_vars_with_fresh_vars(
563 infer::LateBoundRegionConversionTime::FnCall,
566 self.require_type_is_sized_deferred(
569 traits::SizedArgumentType(None),
573 // Here we want to prevent struct constructors from returning unsized types.
574 // There were two cases this happened: fn pointer coercion in stable
575 // and usual function call in presence of unsized_locals.
576 // Also, as we just want to check sizedness, instead of introducing
577 // placeholder lifetimes with probing, we just replace higher lifetimes
579 let output = self.replace_bound_vars_with_fresh_vars(
581 infer::LateBoundRegionConversionTime::FnCall,
584 self.require_type_is_sized_deferred(output, expr.span, traits::SizedReturnType);
587 // We always require that the type provided as the value for
588 // a type parameter outlives the moment of instantiation.
589 let substs = self.typeck_results.borrow().node_substs(expr.hir_id);
590 self.add_wf_bounds(substs, expr);
597 destination: hir::Destination,
598 expr_opt: Option<&'tcx hir::Expr<'tcx>>,
599 expr: &'tcx hir::Expr<'tcx>,
602 if let Ok(target_id) = destination.target_id {
604 if let Some(e) = expr_opt {
605 // If this is a break with a value, we need to type-check
606 // the expression. Get an expected type from the loop context.
607 let opt_coerce_to = {
608 // We should release `enclosing_breakables` before the `check_expr_with_hint`
609 // below, so can't move this block of code to the enclosing scope and share
610 // `ctxt` with the second `enclosing_breakables` borrow below.
611 let mut enclosing_breakables = self.enclosing_breakables.borrow_mut();
612 match enclosing_breakables.opt_find_breakable(target_id) {
613 Some(ctxt) => ctxt.coerce.as_ref().map(|coerce| coerce.expected_ty()),
615 // Avoid ICE when `break` is inside a closure (#65383).
616 return tcx.ty_error_with_message(
618 "break was outside loop, but no error was emitted",
624 // If the loop context is not a `loop { }`, then break with
625 // a value is illegal, and `opt_coerce_to` will be `None`.
626 // Just set expectation to error in that case.
627 let coerce_to = opt_coerce_to.unwrap_or_else(|| tcx.ty_error());
629 // Recurse without `enclosing_breakables` borrowed.
630 e_ty = self.check_expr_with_hint(e, coerce_to);
631 cause = self.misc(e.span);
633 // Otherwise, this is a break *without* a value. That's
634 // always legal, and is equivalent to `break ()`.
635 e_ty = tcx.mk_unit();
636 cause = self.misc(expr.span);
639 // Now that we have type-checked `expr_opt`, borrow
640 // the `enclosing_loops` field and let's coerce the
641 // type of `expr_opt` into what is expected.
642 let mut enclosing_breakables = self.enclosing_breakables.borrow_mut();
643 let Some(ctxt) = enclosing_breakables.opt_find_breakable(target_id) else {
644 // Avoid ICE when `break` is inside a closure (#65383).
645 return tcx.ty_error_with_message(
647 "break was outside loop, but no error was emitted",
651 if let Some(ref mut coerce) = ctxt.coerce {
652 if let Some(ref e) = expr_opt {
653 coerce.coerce(self, &cause, e, e_ty);
655 assert!(e_ty.is_unit());
656 let ty = coerce.expected_ty();
657 coerce.coerce_forced_unit(
661 self.suggest_mismatched_types_on_tail(
662 &mut err, expr, ty, e_ty, target_id,
664 if let Some(val) = ty_kind_suggestion(ty) {
665 let label = destination
667 .map(|l| format!(" {}", l.ident))
668 .unwrap_or_else(String::new);
671 "give it a value of the expected type",
672 format!("break{label} {val}"),
673 Applicability::HasPlaceholders,
681 // If `ctxt.coerce` is `None`, we can just ignore
682 // the type of the expression. This is because
683 // either this was a break *without* a value, in
684 // which case it is always a legal type (`()`), or
685 // else an error would have been flagged by the
686 // `loops` pass for using break with an expression
687 // where you are not supposed to.
688 assert!(expr_opt.is_none() || self.tcx.sess.has_errors().is_some());
691 // If we encountered a `break`, then (no surprise) it may be possible to break from the
692 // loop... unless the value being returned from the loop diverges itself, e.g.
693 // `break return 5` or `break loop {}`.
694 ctxt.may_break |= !self.diverges.get().is_always();
696 // the type of a `break` is always `!`, since it diverges
699 // Otherwise, we failed to find the enclosing loop;
700 // this can only happen if the `break` was not
701 // inside a loop at all, which is caught by the
702 // loop-checking pass.
703 let err = self.tcx.ty_error_with_message(
705 "break was outside loop, but no error was emitted",
708 // We still need to assign a type to the inner expression to
709 // prevent the ICE in #43162.
710 if let Some(e) = expr_opt {
711 self.check_expr_with_hint(e, err);
713 // ... except when we try to 'break rust;'.
714 // ICE this expression in particular (see #43162).
715 if let ExprKind::Path(QPath::Resolved(_, path)) = e.kind {
716 if path.segments.len() == 1 && path.segments[0].ident.name == sym::rust {
717 fatally_break_rust(self.tcx.sess);
722 // There was an error; make type-check fail.
727 fn check_expr_return(
729 expr_opt: Option<&'tcx hir::Expr<'tcx>>,
730 expr: &'tcx hir::Expr<'tcx>,
732 if self.ret_coercion.is_none() {
733 let mut err = ReturnStmtOutsideOfFnBody {
735 encl_body_span: None,
739 let encl_item_id = self.tcx.hir().get_parent_item(expr.hir_id);
741 if let Some(hir::Node::Item(hir::Item {
742 kind: hir::ItemKind::Fn(..),
746 | Some(hir::Node::TraitItem(hir::TraitItem {
747 kind: hir::TraitItemKind::Fn(_, hir::TraitFn::Provided(_)),
751 | Some(hir::Node::ImplItem(hir::ImplItem {
752 kind: hir::ImplItemKind::Fn(..),
755 })) = self.tcx.hir().find_by_def_id(encl_item_id.def_id)
757 // We are inside a function body, so reporting "return statement
758 // outside of function body" needs an explanation.
760 let encl_body_owner_id = self.tcx.hir().enclosing_body_owner(expr.hir_id);
762 // If this didn't hold, we would not have to report an error in
764 assert_ne!(encl_item_id.def_id, encl_body_owner_id);
766 let encl_body_id = self.tcx.hir().body_owned_by(encl_body_owner_id);
767 let encl_body = self.tcx.hir().body(encl_body_id);
769 err.encl_body_span = Some(encl_body.value.span);
770 err.encl_fn_span = Some(*encl_fn_span);
773 self.tcx.sess.emit_err(err);
775 if let Some(e) = expr_opt {
776 // We still have to type-check `e` (issue #86188), but calling
777 // `check_return_expr` only works inside fn bodies.
780 } else if let Some(e) = expr_opt {
781 if self.ret_coercion_span.get().is_none() {
782 self.ret_coercion_span.set(Some(e.span));
784 self.check_return_expr(e, true);
786 let mut coercion = self.ret_coercion.as_ref().unwrap().borrow_mut();
787 if self.ret_coercion_span.get().is_none() {
788 self.ret_coercion_span.set(Some(expr.span));
790 let cause = self.cause(expr.span, ObligationCauseCode::ReturnNoExpression);
791 if let Some((fn_decl, _)) = self.get_fn_decl(expr.hir_id) {
792 coercion.coerce_forced_unit(
796 let span = fn_decl.output.span();
797 if let Ok(snippet) = self.tcx.sess.source_map().span_to_snippet(span) {
800 format!("expected `{snippet}` because of this return type"),
807 coercion.coerce_forced_unit(self, &cause, &mut |_| (), true);
813 /// `explicit_return` is `true` if we're checking an explicit `return expr`,
814 /// and `false` if we're checking a trailing expression.
815 pub(super) fn check_return_expr(
817 return_expr: &'tcx hir::Expr<'tcx>,
818 explicit_return: bool,
820 let ret_coercion = self.ret_coercion.as_ref().unwrap_or_else(|| {
821 span_bug!(return_expr.span, "check_return_expr called outside fn body")
824 let ret_ty = ret_coercion.borrow().expected_ty();
825 let return_expr_ty = self.check_expr_with_hint(return_expr, ret_ty);
826 let mut span = return_expr.span;
827 // Use the span of the trailing expression for our cause,
828 // not the span of the entire function
829 if !explicit_return {
830 if let ExprKind::Block(body, _) = return_expr.kind && let Some(last_expr) = body.expr {
831 span = last_expr.span;
834 ret_coercion.borrow_mut().coerce(
836 &self.cause(span, ObligationCauseCode::ReturnValue(return_expr.hir_id)),
841 if let Some(fn_sig) = self.body_fn_sig()
842 && fn_sig.output().has_opaque_types()
844 // Point any obligations that were registered due to opaque type
845 // inference at the return expression.
846 self.select_obligations_where_possible(false, |errors| {
847 self.point_at_return_for_opaque_ty_error(errors, span, return_expr_ty);
852 fn point_at_return_for_opaque_ty_error(
854 errors: &mut Vec<traits::FulfillmentError<'tcx>>,
856 return_expr_ty: Ty<'tcx>,
858 // Don't point at the whole block if it's empty
859 if span == self.tcx.hir().span(self.body_id) {
863 let cause = &mut err.obligation.cause;
864 if let ObligationCauseCode::OpaqueReturnType(None) = cause.code() {
865 let new_cause = ObligationCause::new(
868 ObligationCauseCode::OpaqueReturnType(Some((return_expr_ty, span))),
875 pub(crate) fn check_lhs_assignable(
877 lhs: &'tcx hir::Expr<'tcx>,
878 err_code: &'static str,
880 adjust_err: impl FnOnce(&mut Diagnostic),
882 if lhs.is_syntactic_place_expr() {
886 // FIXME: Make this use Diagnostic once error codes can be dynamically set.
887 let mut err = self.tcx.sess.struct_span_err_with_code(
889 "invalid left-hand side of assignment",
890 DiagnosticId::Error(err_code.into()),
892 err.span_label(lhs.span, "cannot assign to this expression");
894 self.comes_from_while_condition(lhs.hir_id, |expr| {
895 err.span_suggestion_verbose(
896 expr.span.shrink_to_lo(),
897 "you might have meant to use pattern destructuring",
899 Applicability::MachineApplicable,
903 adjust_err(&mut err);
908 // Check if an expression `original_expr_id` comes from the condition of a while loop,
909 // as opposed from the body of a while loop, which we can naively check by iterating
910 // parents until we find a loop...
911 pub(super) fn comes_from_while_condition(
913 original_expr_id: HirId,
914 then: impl FnOnce(&hir::Expr<'_>),
916 let mut parent = self.tcx.hir().get_parent_node(original_expr_id);
917 while let Some(node) = self.tcx.hir().find(parent) {
919 hir::Node::Expr(hir::Expr {
926 hir::ExprKind::Match(expr, ..) | hir::ExprKind::If(expr, ..),
932 hir::LoopSource::While,
937 // Check if our original expression is a child of the condition of a while loop
938 let expr_is_ancestor = std::iter::successors(Some(original_expr_id), |id| {
939 self.tcx.hir().find_parent_node(*id)
941 .take_while(|id| *id != parent)
942 .any(|id| id == expr.hir_id);
943 // if it is, then we have a situation like `while Some(0) = value.get(0) {`,
944 // where `while let` was more likely intended.
945 if expr_is_ancestor {
951 | hir::Node::ImplItem(_)
952 | hir::Node::TraitItem(_)
953 | hir::Node::Crate(_) => break,
955 parent = self.tcx.hir().get_parent_node(parent);
961 // A generic function for checking the 'then' and 'else' clauses in an 'if'
962 // or 'if-else' expression.
965 cond_expr: &'tcx hir::Expr<'tcx>,
966 then_expr: &'tcx hir::Expr<'tcx>,
967 opt_else_expr: Option<&'tcx hir::Expr<'tcx>>,
969 orig_expected: Expectation<'tcx>,
971 let cond_ty = self.check_expr_has_type_or_error(cond_expr, self.tcx.types.bool, |_| {});
973 self.warn_if_unreachable(
976 "block in `if` or `while` expression",
979 let cond_diverges = self.diverges.get();
980 self.diverges.set(Diverges::Maybe);
982 let expected = orig_expected.adjust_for_branches(self);
983 let then_ty = self.check_expr_with_expectation(then_expr, expected);
984 let then_diverges = self.diverges.get();
985 self.diverges.set(Diverges::Maybe);
987 // We've already taken the expected type's preferences
988 // into account when typing the `then` branch. To figure
989 // out the initial shot at a LUB, we thus only consider
990 // `expected` if it represents a *hard* constraint
991 // (`only_has_type`); otherwise, we just go with a
992 // fresh type variable.
993 let coerce_to_ty = expected.coercion_target_type(self, sp);
994 let mut coerce: DynamicCoerceMany<'_> = CoerceMany::new(coerce_to_ty);
996 coerce.coerce(self, &self.misc(sp), then_expr, then_ty);
998 if let Some(else_expr) = opt_else_expr {
999 let else_ty = self.check_expr_with_expectation(else_expr, expected);
1000 let else_diverges = self.diverges.get();
1002 let opt_suggest_box_span = self.opt_suggest_box_span(then_ty, else_ty, orig_expected);
1003 let if_cause = self.if_cause(
1010 opt_suggest_box_span,
1013 coerce.coerce(self, &if_cause, else_expr, else_ty);
1015 // We won't diverge unless both branches do (or the condition does).
1016 self.diverges.set(cond_diverges | then_diverges & else_diverges);
1018 self.if_fallback_coercion(sp, then_expr, &mut coerce);
1020 // If the condition is false we can't diverge.
1021 self.diverges.set(cond_diverges);
1024 let result_ty = coerce.complete(self);
1025 if cond_ty.references_error() { self.tcx.ty_error() } else { result_ty }
1028 /// Type check assignment expression `expr` of form `lhs = rhs`.
1029 /// The expected type is `()` and is passed to the function for the purposes of diagnostics.
1030 fn check_expr_assign(
1032 expr: &'tcx hir::Expr<'tcx>,
1033 expected: Expectation<'tcx>,
1034 lhs: &'tcx hir::Expr<'tcx>,
1035 rhs: &'tcx hir::Expr<'tcx>,
1038 let expected_ty = expected.coercion_target_type(self, expr.span);
1039 if expected_ty == self.tcx.types.bool {
1040 // The expected type is `bool` but this will result in `()` so we can reasonably
1041 // say that the user intended to write `lhs == rhs` instead of `lhs = rhs`.
1042 // The likely cause of this is `if foo = bar { .. }`.
1043 let actual_ty = self.tcx.mk_unit();
1044 let mut err = self.demand_suptype_diag(expr.span, expected_ty, actual_ty).unwrap();
1045 let lhs_ty = self.check_expr(&lhs);
1046 let rhs_ty = self.check_expr(&rhs);
1047 let (applicability, eq) = if self.can_coerce(rhs_ty, lhs_ty) {
1048 (Applicability::MachineApplicable, true)
1049 } else if let ExprKind::Binary(
1050 Spanned { node: hir::BinOpKind::And | hir::BinOpKind::Or, .. },
1055 // if x == 1 && y == 2 { .. }
1057 let actual_lhs_ty = self.check_expr(&rhs_expr);
1058 (Applicability::MaybeIncorrect, self.can_coerce(rhs_ty, actual_lhs_ty))
1059 } else if let ExprKind::Binary(
1060 Spanned { node: hir::BinOpKind::And | hir::BinOpKind::Or, .. },
1065 // if x == 1 && y == 2 { .. }
1067 let actual_rhs_ty = self.check_expr(&lhs_expr);
1068 (Applicability::MaybeIncorrect, self.can_coerce(actual_rhs_ty, lhs_ty))
1070 (Applicability::MaybeIncorrect, false)
1072 if !lhs.is_syntactic_place_expr()
1073 && lhs.is_approximately_pattern()
1074 && !matches!(lhs.kind, hir::ExprKind::Lit(_))
1076 // Do not suggest `if let x = y` as `==` is way more likely to be the intention.
1077 let hir = self.tcx.hir();
1078 if let hir::Node::Expr(hir::Expr { kind: ExprKind::If { .. }, .. }) =
1079 hir.get(hir.get_parent_node(hir.get_parent_node(expr.hir_id)))
1081 err.span_suggestion_verbose(
1082 expr.span.shrink_to_lo(),
1083 "you might have meant to use pattern matching",
1090 err.span_suggestion_verbose(
1091 span.shrink_to_hi(),
1092 "you might have meant to compare for equality",
1098 // If the assignment expression itself is ill-formed, don't
1099 // bother emitting another error
1100 if lhs_ty.references_error() || rhs_ty.references_error() {
1105 return self.tcx.ty_error();
1108 let lhs_ty = self.check_expr_with_needs(&lhs, Needs::MutPlace);
1110 let suggest_deref_binop = |err: &mut Diagnostic, rhs_ty: Ty<'tcx>| {
1111 if let Some(lhs_deref_ty) = self.deref_once_mutably_for_diagnostic(lhs_ty) {
1112 // Can only assign if the type is sized, so if `DerefMut` yields a type that is
1113 // unsized, do not suggest dereferencing it.
1114 let lhs_deref_ty_is_sized = self
1116 .type_implements_trait(
1117 self.tcx.lang_items().sized_trait().unwrap(),
1123 if lhs_deref_ty_is_sized && self.can_coerce(rhs_ty, lhs_deref_ty) {
1124 err.span_suggestion_verbose(
1125 lhs.span.shrink_to_lo(),
1126 "consider dereferencing here to assign to the mutably borrowed value",
1128 Applicability::MachineApplicable,
1134 // This is (basically) inlined `check_expr_coercable_to_type`, but we want
1135 // to suggest an additional fixup here in `suggest_deref_binop`.
1136 let rhs_ty = self.check_expr_with_hint(&rhs, lhs_ty);
1137 if let (_, Some(mut diag)) =
1138 self.demand_coerce_diag(rhs, rhs_ty, lhs_ty, Some(lhs), AllowTwoPhase::No)
1140 suggest_deref_binop(&mut diag, rhs_ty);
1144 self.check_lhs_assignable(lhs, "E0070", span, |err| {
1145 if let Some(rhs_ty) = self.typeck_results.borrow().expr_ty_opt(rhs) {
1146 suggest_deref_binop(err, rhs_ty);
1150 self.require_type_is_sized(lhs_ty, lhs.span, traits::AssignmentLhsSized);
1152 if lhs_ty.references_error() || rhs_ty.references_error() {
1159 pub(super) fn check_expr_let(&self, let_expr: &'tcx hir::Let<'tcx>) -> Ty<'tcx> {
1160 // for let statements, this is done in check_stmt
1161 let init = let_expr.init;
1162 self.warn_if_unreachable(init.hir_id, init.span, "block in `let` expression");
1163 // otherwise check exactly as a let statement
1164 self.check_decl(let_expr.into());
1165 // but return a bool, for this is a boolean expression
1171 body: &'tcx hir::Block<'tcx>,
1172 source: hir::LoopSource,
1173 expected: Expectation<'tcx>,
1174 expr: &'tcx hir::Expr<'tcx>,
1176 let coerce = match source {
1177 // you can only use break with a value from a normal `loop { }`
1178 hir::LoopSource::Loop => {
1179 let coerce_to = expected.coercion_target_type(self, body.span);
1180 Some(CoerceMany::new(coerce_to))
1183 hir::LoopSource::While | hir::LoopSource::ForLoop => None,
1186 let ctxt = BreakableCtxt {
1188 may_break: false, // Will get updated if/when we find a `break`.
1191 let (ctxt, ()) = self.with_breakable_ctxt(expr.hir_id, ctxt, || {
1192 self.check_block_no_value(&body);
1196 // No way to know whether it's diverging because
1197 // of a `break` or an outer `break` or `return`.
1198 self.diverges.set(Diverges::Maybe);
1201 // If we permit break with a value, then result type is
1202 // the LUB of the breaks (possibly ! if none); else, it
1203 // is nil. This makes sense because infinite loops
1204 // (which would have type !) are only possible iff we
1205 // permit break with a value [1].
1206 if ctxt.coerce.is_none() && !ctxt.may_break {
1208 self.tcx.sess.delay_span_bug(body.span, "no coercion, but loop may not break");
1210 ctxt.coerce.map(|c| c.complete(self)).unwrap_or_else(|| self.tcx.mk_unit())
1213 /// Checks a method call.
1214 fn check_method_call(
1216 expr: &'tcx hir::Expr<'tcx>,
1217 segment: &hir::PathSegment<'_>,
1218 rcvr: &'tcx hir::Expr<'tcx>,
1219 args: &'tcx [hir::Expr<'tcx>],
1220 expected: Expectation<'tcx>,
1222 let rcvr_t = self.check_expr(&rcvr);
1223 // no need to check for bot/err -- callee does that
1224 let rcvr_t = self.structurally_resolved_type(rcvr.span, rcvr_t);
1225 let span = segment.ident.span;
1227 let method = match self.lookup_method(rcvr_t, segment, span, expr, rcvr, args) {
1229 // We could add a "consider `foo::<params>`" suggestion here, but I wasn't able to
1230 // trigger this codepath causing `structurally_resolved_type` to emit an error.
1232 self.write_method_call(expr.hir_id, method);
1236 if segment.ident.name != kw::Empty {
1237 if let Some(mut err) = self.report_method_error(
1241 SelfSource::MethodCall(rcvr),
1252 // Call the generic checker.
1253 self.check_method_argument_types(span, expr, method, &args, DontTupleArguments, expected)
1258 e: &'tcx hir::Expr<'tcx>,
1259 t: &'tcx hir::Ty<'tcx>,
1260 expr: &'tcx hir::Expr<'tcx>,
1262 // Find the type of `e`. Supply hints based on the type we are casting to,
1264 let t_cast = self.to_ty_saving_user_provided_ty(t);
1265 let t_cast = self.resolve_vars_if_possible(t_cast);
1266 let t_expr = self.check_expr_with_expectation(e, ExpectCastableToType(t_cast));
1267 let t_expr = self.resolve_vars_if_possible(t_expr);
1269 // Eagerly check for some obvious errors.
1270 if t_expr.references_error() || t_cast.references_error() {
1273 // Defer other checks until we're done type checking.
1274 let mut deferred_cast_checks = self.deferred_cast_checks.borrow_mut();
1275 match cast::CastCheck::new(
1282 self.param_env.constness(),
1286 "check_expr_cast: deferring cast from {:?} to {:?}: {:?}",
1287 t_cast, t_expr, cast_check,
1289 deferred_cast_checks.push(cast_check);
1292 Err(_) => self.tcx.ty_error(),
1297 fn check_expr_array(
1299 args: &'tcx [hir::Expr<'tcx>],
1300 expected: Expectation<'tcx>,
1301 expr: &'tcx hir::Expr<'tcx>,
1303 let element_ty = if !args.is_empty() {
1304 let coerce_to = expected
1306 .and_then(|uty| match *uty.kind() {
1307 ty::Array(ty, _) | ty::Slice(ty) => Some(ty),
1310 .unwrap_or_else(|| {
1311 self.next_ty_var(TypeVariableOrigin {
1312 kind: TypeVariableOriginKind::TypeInference,
1316 let mut coerce = CoerceMany::with_coercion_sites(coerce_to, args);
1317 assert_eq!(self.diverges.get(), Diverges::Maybe);
1319 let e_ty = self.check_expr_with_hint(e, coerce_to);
1320 let cause = self.misc(e.span);
1321 coerce.coerce(self, &cause, e, e_ty);
1323 coerce.complete(self)
1325 self.next_ty_var(TypeVariableOrigin {
1326 kind: TypeVariableOriginKind::TypeInference,
1330 let array_len = args.len() as u64;
1331 self.suggest_array_len(expr, array_len);
1332 self.tcx.mk_array(element_ty, array_len)
1335 fn suggest_array_len(&self, expr: &'tcx hir::Expr<'tcx>, array_len: u64) {
1336 let parent_node = self.tcx.hir().parent_iter(expr.hir_id).find(|(_, node)| {
1337 !matches!(node, hir::Node::Expr(hir::Expr { kind: hir::ExprKind::AddrOf(..), .. }))
1340 hir::Node::Local(hir::Local { ty: Some(ty), .. })
1341 | hir::Node::Item(hir::Item { kind: hir::ItemKind::Const(ty, _), .. }))
1342 ) = parent_node else {
1345 if let hir::TyKind::Array(_, length) = ty.peel_refs().kind
1346 && let hir::ArrayLen::Body(hir::AnonConst { hir_id, .. }) = length
1347 && let Some(span) = self.tcx.hir().opt_span(hir_id)
1349 match self.tcx.sess.diagnostic().steal_diagnostic(span, StashKey::UnderscoreForArrayLengths) {
1351 err.span_suggestion(
1353 "consider specifying the array length",
1355 Applicability::MaybeIncorrect,
1364 fn check_expr_const_block(
1366 anon_const: &'tcx hir::AnonConst,
1367 expected: Expectation<'tcx>,
1368 _expr: &'tcx hir::Expr<'tcx>,
1370 let body = self.tcx.hir().body(anon_const.body);
1372 // Create a new function context.
1373 let fcx = FnCtxt::new(self, self.param_env.with_const(), body.value.hir_id);
1374 crate::GatherLocalsVisitor::new(&fcx).visit_body(body);
1376 let ty = fcx.check_expr_with_expectation(&body.value, expected);
1377 fcx.require_type_is_sized(ty, body.value.span, traits::ConstSized);
1378 fcx.write_ty(anon_const.hir_id, ty);
1382 fn check_expr_repeat(
1384 element: &'tcx hir::Expr<'tcx>,
1385 count: &'tcx hir::ArrayLen,
1386 expected: Expectation<'tcx>,
1387 expr: &'tcx hir::Expr<'tcx>,
1390 let count = self.array_length_to_const(count);
1391 if let Some(count) = count.try_eval_usize(tcx, self.param_env) {
1392 self.suggest_array_len(expr, count);
1395 let uty = match expected {
1396 ExpectHasType(uty) => match *uty.kind() {
1397 ty::Array(ty, _) | ty::Slice(ty) => Some(ty),
1403 let (element_ty, t) = match uty {
1405 self.check_expr_coercable_to_type(&element, uty, None);
1409 let ty = self.next_ty_var(TypeVariableOrigin {
1410 kind: TypeVariableOriginKind::MiscVariable,
1413 let element_ty = self.check_expr_has_type_or_error(&element, ty, |_| {});
1418 if element_ty.references_error() {
1419 return tcx.ty_error();
1422 self.check_repeat_element_needs_copy_bound(element, count, element_ty);
1424 tcx.mk_ty(ty::Array(t, count))
1427 fn check_repeat_element_needs_copy_bound(
1429 element: &hir::Expr<'_>,
1430 count: ty::Const<'tcx>,
1431 element_ty: Ty<'tcx>,
1434 // Actual constants as the repeat element get inserted repeatedly instead of getting copied via Copy.
1435 match &element.kind {
1436 hir::ExprKind::ConstBlock(..) => return,
1437 hir::ExprKind::Path(qpath) => {
1438 let res = self.typeck_results.borrow().qpath_res(qpath, element.hir_id);
1439 if let Res::Def(DefKind::Const | DefKind::AssocConst | DefKind::AnonConst, _) = res
1446 // If someone calls a const fn, they can extract that call out into a separate constant (or a const
1447 // block in the future), so we check that to tell them that in the diagnostic. Does not affect typeck.
1448 let is_const_fn = match element.kind {
1449 hir::ExprKind::Call(func, _args) => match *self.node_ty(func.hir_id).kind() {
1450 ty::FnDef(def_id, _) => tcx.is_const_fn(def_id),
1456 // If the length is 0, we don't create any elements, so we don't copy any. If the length is 1, we
1457 // don't copy that one element, we move it. Only check for Copy if the length is larger.
1458 if count.try_eval_usize(tcx, self.param_env).map_or(true, |len| len > 1) {
1459 let lang_item = self.tcx.require_lang_item(LangItem::Copy, None);
1460 let code = traits::ObligationCauseCode::RepeatElementCopy { is_const_fn };
1461 self.require_type_meets(element_ty, element.span, code, lang_item);
1465 fn check_expr_tuple(
1467 elts: &'tcx [hir::Expr<'tcx>],
1468 expected: Expectation<'tcx>,
1469 expr: &'tcx hir::Expr<'tcx>,
1471 let flds = expected.only_has_type(self).and_then(|ty| {
1472 let ty = self.resolve_vars_with_obligations(ty);
1474 ty::Tuple(flds) => Some(&flds[..]),
1479 let elt_ts_iter = elts.iter().enumerate().map(|(i, e)| match flds {
1480 Some(fs) if i < fs.len() => {
1482 self.check_expr_coercable_to_type(&e, ety, None);
1485 _ => self.check_expr_with_expectation(&e, NoExpectation),
1487 let tuple = self.tcx.mk_tup(elt_ts_iter);
1488 if tuple.references_error() {
1491 self.require_type_is_sized(tuple, expr.span, traits::TupleInitializerSized);
1496 fn check_expr_struct(
1498 expr: &hir::Expr<'_>,
1499 expected: Expectation<'tcx>,
1501 fields: &'tcx [hir::ExprField<'tcx>],
1502 base_expr: &'tcx Option<&'tcx hir::Expr<'tcx>>,
1504 // Find the relevant variant
1505 let Some((variant, adt_ty)) = self.check_struct_path(qpath, expr.hir_id) else {
1506 self.check_struct_fields_on_error(fields, base_expr);
1507 return self.tcx.ty_error();
1510 // Prohibit struct expressions when non-exhaustive flag is set.
1511 let adt = adt_ty.ty_adt_def().expect("`check_struct_path` returned non-ADT type");
1512 if !adt.did().is_local() && variant.is_field_list_non_exhaustive() {
1515 .emit_err(StructExprNonExhaustive { span: expr.span, what: adt.variant_descr() });
1518 self.check_expr_struct_fields(
1529 self.require_type_is_sized(adt_ty, expr.span, traits::StructInitializerSized);
1533 fn check_expr_struct_fields(
1536 expected: Expectation<'tcx>,
1537 expr_id: hir::HirId,
1539 variant: &'tcx ty::VariantDef,
1540 ast_fields: &'tcx [hir::ExprField<'tcx>],
1541 base_expr: &'tcx Option<&'tcx hir::Expr<'tcx>>,
1546 let expected_inputs =
1547 self.expected_inputs_for_expected_output(span, expected, adt_ty, &[adt_ty]);
1548 let adt_ty_hint = if let Some(expected_inputs) = expected_inputs {
1549 expected_inputs.get(0).cloned().unwrap_or(adt_ty)
1553 // re-link the regions that EIfEO can erase.
1554 self.demand_eqtype(span, adt_ty_hint, adt_ty);
1556 let ty::Adt(adt, substs) = adt_ty.kind() else {
1557 span_bug!(span, "non-ADT passed to check_expr_struct_fields");
1559 let adt_kind = adt.adt_kind();
1561 let mut remaining_fields = variant
1565 .map(|(i, field)| (field.ident(tcx).normalize_to_macros_2_0(), (i, field)))
1566 .collect::<FxHashMap<_, _>>();
1568 let mut seen_fields = FxHashMap::default();
1570 let mut error_happened = false;
1572 // Type-check each field.
1573 for (idx, field) in ast_fields.iter().enumerate() {
1574 let ident = tcx.adjust_ident(field.ident, variant.def_id);
1575 let field_type = if let Some((i, v_field)) = remaining_fields.remove(&ident) {
1576 seen_fields.insert(ident, field.span);
1577 self.write_field_index(field.hir_id, i);
1579 // We don't look at stability attributes on
1580 // struct-like enums (yet...), but it's definitely not
1581 // a bug to have constructed one.
1582 if adt_kind != AdtKind::Enum {
1583 tcx.check_stability(v_field.did, Some(expr_id), field.span, None);
1586 self.field_ty(field.span, v_field, substs)
1588 error_happened = true;
1589 if let Some(prev_span) = seen_fields.get(&ident) {
1590 tcx.sess.emit_err(FieldMultiplySpecifiedInInitializer {
1591 span: field.ident.span,
1592 prev_span: *prev_span,
1596 self.report_unknown_field(
1601 adt.variant_descr(),
1609 // Make sure to give a type to the field even if there's
1610 // an error, so we can continue type-checking.
1611 let ty = self.check_expr_with_hint(&field.expr, field_type);
1613 self.demand_coerce_diag(&field.expr, ty, field_type, None, AllowTwoPhase::No);
1615 if let Some(mut diag) = diag {
1616 if idx == ast_fields.len() - 1 && remaining_fields.is_empty() {
1617 self.suggest_fru_from_range(field, variant, substs, &mut diag);
1623 // Make sure the programmer specified correct number of fields.
1624 if adt_kind == AdtKind::Union {
1625 if ast_fields.len() != 1 {
1630 "union expressions should have exactly one field",
1636 // If check_expr_struct_fields hit an error, do not attempt to populate
1637 // the fields with the base_expr. This could cause us to hit errors later
1638 // when certain fields are assumed to exist that in fact do not.
1643 if let Some(base_expr) = base_expr {
1644 // FIXME: We are currently creating two branches here in order to maintain
1645 // consistency. But they should be merged as much as possible.
1646 let fru_tys = if self.tcx.features().type_changing_struct_update {
1647 if adt.is_struct() {
1648 // Make some fresh substitutions for our ADT type.
1649 let fresh_substs = self.fresh_substs_for_item(base_expr.span, adt.did());
1650 // We do subtyping on the FRU fields first, so we can
1651 // learn exactly what types we expect the base expr
1652 // needs constrained to be compatible with the struct
1653 // type we expect from the expectation value.
1654 let fru_tys = variant
1658 let fru_ty = self.normalize_associated_types_in(
1660 self.field_ty(base_expr.span, f, fresh_substs),
1662 let ident = self.tcx.adjust_ident(f.ident(self.tcx), variant.def_id);
1663 if let Some(_) = remaining_fields.remove(&ident) {
1664 let target_ty = self.field_ty(base_expr.span, f, substs);
1665 let cause = self.misc(base_expr.span);
1666 match self.at(&cause, self.param_env).sup(target_ty, fru_ty) {
1667 Ok(InferOk { obligations, value: () }) => {
1668 self.register_predicates(obligations)
1671 // This should never happen, since we're just subtyping the
1672 // remaining_fields, but it's fine to emit this, I guess.
1674 .report_mismatched_types(
1678 FieldMisMatch(variant.name, ident.name),
1684 self.resolve_vars_if_possible(fru_ty)
1687 // The use of fresh substs that we have subtyped against
1688 // our base ADT type's fields allows us to guide inference
1689 // along so that, e.g.
1691 // MyStruct<'a, F1, F2, const C: usize> {
1693 // // Other fields that reference `'a`, `F2`, and `C`
1696 // let x = MyStruct {
1701 // will have the `other_struct` expression constrained to
1702 // `MyStruct<'a, _, F2, C>`, as opposed to just `_`...
1703 // This is important to allow coercions to happen in
1704 // `other_struct` itself. See `coerce-in-base-expr.rs`.
1705 let fresh_base_ty = self.tcx.mk_adt(*adt, fresh_substs);
1706 self.check_expr_has_type_or_error(
1708 self.resolve_vars_if_possible(fresh_base_ty),
1713 // Check the base_expr, regardless of a bad expected adt_ty, so we can get
1714 // type errors on that expression, too.
1715 self.check_expr(base_expr);
1718 .emit_err(FunctionalRecordUpdateOnNonStruct { span: base_expr.span });
1722 self.check_expr_has_type_or_error(base_expr, adt_ty, |_| {
1723 let base_ty = self.typeck_results.borrow().expr_ty(*base_expr);
1724 let same_adt = match (adt_ty.kind(), base_ty.kind()) {
1725 (ty::Adt(adt, _), ty::Adt(base_adt, _)) if adt == base_adt => true,
1728 if self.tcx.sess.is_nightly_build() && same_adt {
1730 &self.tcx.sess.parse_sess,
1731 sym::type_changing_struct_update,
1733 "type changing struct updating is experimental",
1738 match adt_ty.kind() {
1739 ty::Adt(adt, substs) if adt.is_struct() => variant
1743 self.normalize_associated_types_in(expr_span, f.ty(self.tcx, substs))
1749 .emit_err(FunctionalRecordUpdateOnNonStruct { span: base_expr.span });
1754 self.typeck_results.borrow_mut().fru_field_types_mut().insert(expr_id, fru_tys);
1755 } else if adt_kind != AdtKind::Union && !remaining_fields.is_empty() {
1756 debug!(?remaining_fields);
1757 let private_fields: Vec<&ty::FieldDef> = variant
1760 .filter(|field| !field.vis.is_accessible_from(tcx.parent_module(expr_id), tcx))
1763 if !private_fields.is_empty() {
1764 self.report_private_fields(adt_ty, span, private_fields, ast_fields);
1766 self.report_missing_fields(
1778 fn check_struct_fields_on_error(
1780 fields: &'tcx [hir::ExprField<'tcx>],
1781 base_expr: &'tcx Option<&'tcx hir::Expr<'tcx>>,
1783 for field in fields {
1784 self.check_expr(&field.expr);
1786 if let Some(base) = *base_expr {
1787 self.check_expr(&base);
1791 /// Report an error for a struct field expression when there are fields which aren't provided.
1794 /// error: missing field `you_can_use_this_field` in initializer of `foo::Foo`
1795 /// --> src/main.rs:8:5
1797 /// 8 | foo::Foo {};
1798 /// | ^^^^^^^^ missing `you_can_use_this_field`
1800 /// error: aborting due to previous error
1802 fn report_missing_fields(
1806 remaining_fields: FxHashMap<Ident, (usize, &ty::FieldDef)>,
1807 variant: &'tcx ty::VariantDef,
1808 ast_fields: &'tcx [hir::ExprField<'tcx>],
1809 substs: SubstsRef<'tcx>,
1811 let len = remaining_fields.len();
1813 let mut displayable_field_names: Vec<&str> =
1814 remaining_fields.keys().map(|ident| ident.as_str()).collect();
1815 // sorting &str primitives here, sort_unstable is ok
1816 displayable_field_names.sort_unstable();
1818 let mut truncated_fields_error = String::new();
1819 let remaining_fields_names = match &displayable_field_names[..] {
1820 [field1] => format!("`{}`", field1),
1821 [field1, field2] => format!("`{field1}` and `{field2}`"),
1822 [field1, field2, field3] => format!("`{field1}`, `{field2}` and `{field3}`"),
1824 truncated_fields_error =
1825 format!(" and {} other field{}", len - 3, pluralize!(len - 3));
1826 displayable_field_names
1829 .map(|n| format!("`{n}`"))
1830 .collect::<Vec<_>>()
1835 let mut err = struct_span_err!(
1839 "missing field{} {}{} in initializer of `{}`",
1841 remaining_fields_names,
1842 truncated_fields_error,
1845 err.span_label(span, format!("missing {remaining_fields_names}{truncated_fields_error}"));
1847 if let Some(last) = ast_fields.last() {
1848 self.suggest_fru_from_range(last, variant, substs, &mut err);
1854 /// If the last field is a range literal, but it isn't supposed to be, then they probably
1855 /// meant to use functional update syntax.
1856 fn suggest_fru_from_range(
1858 last_expr_field: &hir::ExprField<'tcx>,
1859 variant: &ty::VariantDef,
1860 substs: SubstsRef<'tcx>,
1861 err: &mut Diagnostic,
1863 // I don't use 'is_range_literal' because only double-sided, half-open ranges count.
1864 if let ExprKind::Struct(
1865 QPath::LangItem(LangItem::Range, ..),
1866 &[ref range_start, ref range_end],
1868 ) = last_expr_field.expr.kind
1869 && let variant_field =
1870 variant.fields.iter().find(|field| field.ident(self.tcx) == last_expr_field.ident)
1871 && let range_def_id = self.tcx.lang_items().range_struct()
1873 .and_then(|field| field.ty(self.tcx, substs).ty_adt_def())
1874 .map(|adt| adt.did())
1881 .span_to_snippet(range_end.expr.span)
1882 .map(|s| format!(" from `{s}`"))
1883 .unwrap_or_default();
1884 err.span_suggestion(
1885 range_start.span.shrink_to_hi(),
1886 &format!("to set the remaining fields{instead}, separate the last named field with a comma"),
1888 Applicability::MaybeIncorrect,
1893 /// Report an error for a struct field expression when there are invisible fields.
1896 /// error: cannot construct `Foo` with struct literal syntax due to private fields
1897 /// --> src/main.rs:8:5
1899 /// 8 | foo::Foo {};
1902 /// error: aborting due to previous error
1904 fn report_private_fields(
1908 private_fields: Vec<&ty::FieldDef>,
1909 used_fields: &'tcx [hir::ExprField<'tcx>],
1911 let mut err = self.tcx.sess.struct_span_err(
1914 "cannot construct `{adt_ty}` with struct literal syntax due to private fields",
1917 let (used_private_fields, remaining_private_fields): (
1918 Vec<(Symbol, Span, bool)>,
1919 Vec<(Symbol, Span, bool)>,
1923 match used_fields.iter().find(|used_field| field.name == used_field.ident.name) {
1924 Some(used_field) => (field.name, used_field.span, true),
1925 None => (field.name, self.tcx.def_span(field.did), false),
1928 .partition(|field| field.2);
1929 err.span_labels(used_private_fields.iter().map(|(_, span, _)| *span), "private field");
1930 if !remaining_private_fields.is_empty() {
1931 let remaining_private_fields_len = remaining_private_fields.len();
1932 let names = match &remaining_private_fields
1934 .map(|(name, _, _)| name)
1935 .collect::<Vec<_>>()[..]
1937 _ if remaining_private_fields_len > 6 => String::new(),
1938 [name] => format!("`{name}` "),
1939 [names @ .., last] => {
1940 let names = names.iter().map(|name| format!("`{name}`")).collect::<Vec<_>>();
1941 format!("{} and `{last}` ", names.join(", "))
1943 [] => unreachable!(),
1946 "... and other private field{s} {names}that {were} not provided",
1947 s = pluralize!(remaining_private_fields_len),
1948 were = pluralize!("was", remaining_private_fields_len),
1954 fn report_unknown_field(
1957 variant: &'tcx ty::VariantDef,
1958 field: &hir::ExprField<'_>,
1959 skip_fields: &[hir::ExprField<'_>],
1963 if variant.is_recovered() {
1964 self.set_tainted_by_errors();
1967 let mut err = self.err_ctxt().type_error_struct_with_diag(
1969 |actual| match ty.kind() {
1970 ty::Adt(adt, ..) if adt.is_enum() => struct_span_err!(
1974 "{} `{}::{}` has no field named `{}`",
1980 _ => struct_span_err!(
1984 "{} `{}` has no field named `{}`",
1993 let variant_ident_span = self.tcx.def_ident_span(variant.def_id).unwrap();
1994 match variant.ctor_kind {
1995 CtorKind::Fn => match ty.kind() {
1996 ty::Adt(adt, ..) if adt.is_enum() => {
2000 "`{adt}::{variant}` defined here",
2002 variant = variant.name,
2005 err.span_label(field.ident.span, "field does not exist");
2006 err.span_suggestion_verbose(
2009 "`{adt}::{variant}` is a tuple {kind_name}, use the appropriate syntax",
2011 variant = variant.name,
2014 "{adt}::{variant}(/* fields */)",
2016 variant = variant.name,
2018 Applicability::HasPlaceholders,
2022 err.span_label(variant_ident_span, format!("`{adt}` defined here", adt = ty));
2023 err.span_label(field.ident.span, "field does not exist");
2024 err.span_suggestion_verbose(
2027 "`{adt}` is a tuple {kind_name}, use the appropriate syntax",
2029 kind_name = kind_name,
2031 format!("{adt}(/* fields */)", adt = ty),
2032 Applicability::HasPlaceholders,
2037 // prevent all specified fields from being suggested
2038 let skip_fields = skip_fields.iter().map(|x| x.ident.name);
2039 if let Some(field_name) = self.suggest_field_name(
2042 skip_fields.collect(),
2045 err.span_suggestion(
2047 "a field with a similar name exists",
2049 Applicability::MaybeIncorrect,
2053 ty::Adt(adt, ..) => {
2057 format!("`{}::{}` does not have this field", ty, variant.name),
2062 format!("`{ty}` does not have this field"),
2065 let available_field_names =
2066 self.available_field_names(variant, expr_span);
2067 if !available_field_names.is_empty() {
2069 "available fields are: {}",
2070 self.name_series_display(available_field_names)
2074 _ => bug!("non-ADT passed to report_unknown_field"),
2082 // Return a hint about the closest match in field names
2083 fn suggest_field_name(
2085 variant: &'tcx ty::VariantDef,
2088 // The span where stability will be checked
2090 ) -> Option<Symbol> {
2094 .filter_map(|field| {
2095 // ignore already set fields and private fields from non-local crates
2096 // and unstable fields.
2097 if skip.iter().any(|&x| x == field.name)
2098 || (!variant.def_id.is_local() && !field.vis.is_public())
2100 self.tcx.eval_stability(field.did, None, span, None),
2101 stability::EvalResult::Deny { .. }
2109 .collect::<Vec<Symbol>>();
2111 find_best_match_for_name(&names, field, None)
2114 fn available_field_names(
2116 variant: &'tcx ty::VariantDef,
2123 let def_scope = self
2125 .adjust_ident_and_get_scope(field.ident(self.tcx), variant.def_id, self.body_id)
2127 field.vis.is_accessible_from(def_scope, self.tcx)
2129 self.tcx.eval_stability(field.did, None, access_span, None),
2130 stability::EvalResult::Deny { .. }
2133 .filter(|field| !self.tcx.is_doc_hidden(field.did))
2134 .map(|field| field.name)
2138 fn name_series_display(&self, names: Vec<Symbol>) -> String {
2139 // dynamic limit, to never omit just one field
2140 let limit = if names.len() == 6 { 6 } else { 5 };
2142 names.iter().take(limit).map(|n| format!("`{}`", n)).collect::<Vec<_>>().join(", ");
2143 if names.len() > limit {
2144 display = format!("{} ... and {} others", display, names.len() - limit);
2149 // Check field access expressions
2152 expr: &'tcx hir::Expr<'tcx>,
2153 base: &'tcx hir::Expr<'tcx>,
2156 debug!("check_field(expr: {:?}, base: {:?}, field: {:?})", expr, base, field);
2157 let base_ty = self.check_expr(base);
2158 let base_ty = self.structurally_resolved_type(base.span, base_ty);
2159 let mut private_candidate = None;
2160 let mut autoderef = self.autoderef(expr.span, base_ty);
2161 while let Some((deref_base_ty, _)) = autoderef.next() {
2162 debug!("deref_base_ty: {:?}", deref_base_ty);
2163 match deref_base_ty.kind() {
2164 ty::Adt(base_def, substs) if !base_def.is_enum() => {
2165 debug!("struct named {:?}", deref_base_ty);
2166 let (ident, def_scope) =
2167 self.tcx.adjust_ident_and_get_scope(field, base_def.did(), self.body_id);
2168 let fields = &base_def.non_enum_variant().fields;
2169 if let Some(index) = fields
2171 .position(|f| f.ident(self.tcx).normalize_to_macros_2_0() == ident)
2173 let field = &fields[index];
2174 let field_ty = self.field_ty(expr.span, field, substs);
2175 // Save the index of all fields regardless of their visibility in case
2176 // of error recovery.
2177 self.write_field_index(expr.hir_id, index);
2178 let adjustments = self.adjust_steps(&autoderef);
2179 if field.vis.is_accessible_from(def_scope, self.tcx) {
2180 self.apply_adjustments(base, adjustments);
2181 self.register_predicates(autoderef.into_obligations());
2183 self.tcx.check_stability(field.did, Some(expr.hir_id), expr.span, None);
2186 private_candidate = Some((adjustments, base_def.did(), field_ty));
2190 let fstr = field.as_str();
2191 if let Ok(index) = fstr.parse::<usize>() {
2192 if fstr == index.to_string() {
2193 if let Some(&field_ty) = tys.get(index) {
2194 let adjustments = self.adjust_steps(&autoderef);
2195 self.apply_adjustments(base, adjustments);
2196 self.register_predicates(autoderef.into_obligations());
2198 self.write_field_index(expr.hir_id, index);
2207 self.structurally_resolved_type(autoderef.span(), autoderef.final_ty(false));
2209 if let Some((adjustments, did, field_ty)) = private_candidate {
2210 // (#90483) apply adjustments to avoid ExprUseVisitor from
2211 // creating erroneous projection.
2212 self.apply_adjustments(base, adjustments);
2213 self.ban_private_field_access(expr, base_ty, field, did);
2217 if field.name == kw::Empty {
2218 } else if self.method_exists(field, base_ty, expr.hir_id, true) {
2219 self.ban_take_value_of_method(expr, base_ty, field);
2220 } else if !base_ty.is_primitive_ty() {
2221 self.ban_nonexisting_field(field, base, expr, base_ty);
2223 let field_name = field.to_string();
2224 let mut err = type_error_struct!(
2229 "`{base_ty}` is a primitive type and therefore doesn't have fields",
2231 let is_valid_suffix = |field: &str| {
2232 if field == "f32" || field == "f64" {
2235 let mut chars = field.chars().peekable();
2236 match chars.peek() {
2237 Some('e') | Some('E') => {
2239 if let Some(c) = chars.peek()
2240 && !c.is_numeric() && *c != '-' && *c != '+'
2244 while let Some(c) = chars.peek() {
2245 if !c.is_numeric() {
2253 let suffix = chars.collect::<String>();
2254 suffix.is_empty() || suffix == "f32" || suffix == "f64"
2256 let maybe_partial_suffix = |field: &str| -> Option<&str> {
2257 let first_chars = ['f', 'l'];
2259 && field.to_lowercase().starts_with(first_chars)
2260 && field[1..].chars().all(|c| c.is_ascii_digit())
2262 if field.to_lowercase().starts_with(['f']) { Some("f32") } else { Some("f64") }
2267 if let ty::Infer(ty::IntVar(_)) = base_ty.kind()
2268 && let ExprKind::Lit(Spanned {
2269 node: ast::LitKind::Int(_, ast::LitIntType::Unsuffixed),
2272 && !base.span.from_expansion()
2274 if is_valid_suffix(&field_name) {
2275 err.span_suggestion_verbose(
2276 field.span.shrink_to_lo(),
2277 "if intended to be a floating point literal, consider adding a `0` after the period",
2279 Applicability::MaybeIncorrect,
2281 } else if let Some(correct_suffix) = maybe_partial_suffix(&field_name) {
2282 err.span_suggestion_verbose(
2284 format!("if intended to be a floating point literal, consider adding a `0` after the period and a `{correct_suffix}` suffix"),
2285 format!("0{correct_suffix}"),
2286 Applicability::MaybeIncorrect,
2293 self.tcx().ty_error()
2296 fn suggest_await_on_field_access(
2298 err: &mut Diagnostic,
2300 base: &'tcx hir::Expr<'tcx>,
2303 let output_ty = match self.get_impl_future_output_ty(ty) {
2304 Some(output_ty) => self.resolve_vars_if_possible(output_ty),
2307 let mut add_label = true;
2308 if let ty::Adt(def, _) = output_ty.skip_binder().kind() {
2309 // no field access on enum type
2315 .any(|field| field.ident(self.tcx) == field_ident)
2320 "field not available in `impl Future`, but it is available in its `Output`",
2322 err.span_suggestion_verbose(
2323 base.span.shrink_to_hi(),
2324 "consider `await`ing on the `Future` and access the field of its `Output`",
2326 Applicability::MaybeIncorrect,
2332 err.span_label(field_ident.span, &format!("field not found in `{ty}`"));
2336 fn ban_nonexisting_field(
2339 base: &'tcx hir::Expr<'tcx>,
2340 expr: &'tcx hir::Expr<'tcx>,
2344 "ban_nonexisting_field: field={:?}, base={:?}, expr={:?}, base_ty={:?}",
2345 ident, base, expr, base_ty
2347 let mut err = self.no_such_field_err(ident, base_ty, base.hir_id);
2349 match *base_ty.peel_refs().kind() {
2350 ty::Array(_, len) => {
2351 self.maybe_suggest_array_indexing(&mut err, expr, base, ident, len);
2354 self.suggest_first_deref_field(&mut err, expr, base, ident);
2356 ty::Adt(def, _) if !def.is_enum() => {
2357 self.suggest_fields_on_recordish(&mut err, def, ident, expr.span);
2359 ty::Param(param_ty) => {
2360 self.point_at_param_definition(&mut err, param_ty);
2362 ty::Opaque(_, _) => {
2363 self.suggest_await_on_field_access(&mut err, ident, base, base_ty.peel_refs());
2368 self.suggest_fn_call(&mut err, base, base_ty, |output_ty| {
2369 if let ty::Adt(def, _) = output_ty.kind() && !def.is_enum() {
2370 def.non_enum_variant().fields.iter().any(|field| {
2371 field.ident(self.tcx) == ident
2372 && field.vis.is_accessible_from(expr.hir_id.owner.def_id, self.tcx)
2374 } else if let ty::Tuple(tys) = output_ty.kind()
2375 && let Ok(idx) = ident.as_str().parse::<usize>()
2383 if ident.name == kw::Await {
2384 // We know by construction that `<expr>.await` is either on Rust 2015
2385 // or results in `ExprKind::Await`. Suggest switching the edition to 2018.
2386 err.note("to `.await` a `Future`, switch to Rust 2018 or later");
2387 err.help_use_latest_edition();
2393 fn ban_private_field_access(
2395 expr: &hir::Expr<'_>,
2400 let struct_path = self.tcx().def_path_str(base_did);
2401 let kind_name = self.tcx().def_kind(base_did).descr(base_did);
2402 let mut err = struct_span_err!(
2406 "field `{field}` of {kind_name} `{struct_path}` is private",
2408 err.span_label(field.span, "private field");
2409 // Also check if an accessible method exists, which is often what is meant.
2410 if self.method_exists(field, expr_t, expr.hir_id, false) && !self.expr_in_place(expr.hir_id)
2412 self.suggest_method_call(
2414 &format!("a method `{field}` also exists, call it with parentheses"),
2424 fn ban_take_value_of_method(&self, expr: &hir::Expr<'_>, expr_t: Ty<'tcx>, field: Ident) {
2425 let mut err = type_error_struct!(
2430 "attempted to take value of method `{field}` on type `{expr_t}`",
2432 err.span_label(field.span, "method, not a field");
2434 if let hir::Node::Expr(hir::Expr { kind: ExprKind::Call(callee, _args), .. }) =
2435 self.tcx.hir().get(self.tcx.hir().get_parent_node(expr.hir_id))
2437 expr.hir_id == callee.hir_id
2442 self.tcx.sess.source_map().span_to_snippet(expr.span).unwrap_or_default();
2443 let is_wrapped = expr_snippet.starts_with('(') && expr_snippet.ends_with(')');
2444 let after_open = expr.span.lo() + rustc_span::BytePos(1);
2445 let before_close = expr.span.hi() - rustc_span::BytePos(1);
2447 if expr_is_call && is_wrapped {
2448 err.multipart_suggestion(
2449 "remove wrapping parentheses to call the method",
2451 (expr.span.with_hi(after_open), String::new()),
2452 (expr.span.with_lo(before_close), String::new()),
2454 Applicability::MachineApplicable,
2456 } else if !self.expr_in_place(expr.hir_id) {
2457 // Suggest call parentheses inside the wrapping parentheses
2458 let span = if is_wrapped {
2459 expr.span.with_lo(after_open).with_hi(before_close)
2463 self.suggest_method_call(
2465 "use parentheses to call the method",
2471 } else if let ty::RawPtr(ty_and_mut) = expr_t.kind()
2472 && let ty::Adt(adt_def, _) = ty_and_mut.ty.kind()
2473 && let ExprKind::Field(base_expr, _) = expr.kind
2474 && adt_def.variants().len() == 1
2482 .any(|f| f.ident(self.tcx) == field)
2484 err.multipart_suggestion(
2485 "to access the field, dereference first",
2487 (base_expr.span.shrink_to_lo(), "(*".to_string()),
2488 (base_expr.span.shrink_to_hi(), ")".to_string()),
2490 Applicability::MaybeIncorrect,
2493 err.help("methods are immutable and cannot be assigned to");
2499 fn point_at_param_definition(&self, err: &mut Diagnostic, param: ty::ParamTy) {
2500 let generics = self.tcx.generics_of(self.body_id.owner.to_def_id());
2501 let generic_param = generics.type_param(¶m, self.tcx);
2502 if let ty::GenericParamDefKind::Type { synthetic: true, .. } = generic_param.kind {
2505 let param_def_id = generic_param.def_id;
2506 let param_hir_id = match param_def_id.as_local() {
2507 Some(x) => self.tcx.hir().local_def_id_to_hir_id(x),
2510 let param_span = self.tcx.hir().span(param_hir_id);
2511 let param_name = self.tcx.hir().ty_param_name(param_def_id.expect_local());
2513 err.span_label(param_span, &format!("type parameter '{param_name}' declared here"));
2516 fn suggest_fields_on_recordish(
2518 err: &mut Diagnostic,
2519 def: ty::AdtDef<'tcx>,
2523 if let Some(suggested_field_name) =
2524 self.suggest_field_name(def.non_enum_variant(), field.name, vec![], access_span)
2526 err.span_suggestion(
2528 "a field with a similar name exists",
2529 suggested_field_name,
2530 Applicability::MaybeIncorrect,
2533 err.span_label(field.span, "unknown field");
2534 let struct_variant_def = def.non_enum_variant();
2535 let field_names = self.available_field_names(struct_variant_def, access_span);
2536 if !field_names.is_empty() {
2538 "available fields are: {}",
2539 self.name_series_display(field_names),
2545 fn maybe_suggest_array_indexing(
2547 err: &mut Diagnostic,
2548 expr: &hir::Expr<'_>,
2549 base: &hir::Expr<'_>,
2551 len: ty::Const<'tcx>,
2553 if let (Some(len), Ok(user_index)) =
2554 (len.try_eval_usize(self.tcx, self.param_env), field.as_str().parse::<u64>())
2555 && let Ok(base) = self.tcx.sess.source_map().span_to_snippet(base.span)
2557 let help = "instead of using tuple indexing, use array indexing";
2558 let suggestion = format!("{base}[{field}]");
2559 let applicability = if len < user_index {
2560 Applicability::MachineApplicable
2562 Applicability::MaybeIncorrect
2564 err.span_suggestion(expr.span, help, suggestion, applicability);
2568 fn suggest_first_deref_field(
2570 err: &mut Diagnostic,
2571 expr: &hir::Expr<'_>,
2572 base: &hir::Expr<'_>,
2575 if let Ok(base) = self.tcx.sess.source_map().span_to_snippet(base.span) {
2576 let msg = format!("`{base}` is a raw pointer; try dereferencing it");
2577 let suggestion = format!("(*{base}).{field}");
2578 err.span_suggestion(expr.span, &msg, suggestion, Applicability::MaybeIncorrect);
2582 fn no_such_field_err(
2587 ) -> DiagnosticBuilder<'_, ErrorGuaranteed> {
2588 let span = field.span;
2589 debug!("no_such_field_err(span: {:?}, field: {:?}, expr_t: {:?})", span, field, expr_t);
2591 let mut err = type_error_struct!(
2596 "no field `{field}` on type `{expr_t}`",
2599 // try to add a suggestion in case the field is a nested field of a field of the Adt
2600 let mod_id = self.tcx.parent_module(id).to_def_id();
2601 if let Some((fields, substs)) =
2602 self.get_field_candidates_considering_privacy(span, expr_t, mod_id)
2604 let candidate_fields: Vec<_> = fields
2605 .filter_map(|candidate_field| {
2606 self.check_for_nested_field_satisfying(
2608 &|candidate_field, _| candidate_field.ident(self.tcx()) == field,
2615 .map(|mut field_path| {
2619 .map(|id| id.name.to_ident_string())
2620 .collect::<Vec<String>>()
2623 .collect::<Vec<_>>();
2625 let len = candidate_fields.len();
2627 err.span_suggestions(
2628 field.span.shrink_to_lo(),
2630 "{} of the expressions' fields {} a field of the same name",
2631 if len > 1 { "some" } else { "one" },
2632 if len > 1 { "have" } else { "has" },
2634 candidate_fields.iter().map(|path| format!("{path}.")),
2635 Applicability::MaybeIncorrect,
2642 pub(crate) fn get_field_candidates_considering_privacy(
2647 ) -> Option<(impl Iterator<Item = &'tcx ty::FieldDef> + 'tcx, SubstsRef<'tcx>)> {
2648 debug!("get_field_candidates(span: {:?}, base_t: {:?}", span, base_ty);
2650 for (base_t, _) in self.autoderef(span, base_ty) {
2651 match base_t.kind() {
2652 ty::Adt(base_def, substs) if !base_def.is_enum() => {
2654 let fields = &base_def.non_enum_variant().fields;
2655 // Some struct, e.g. some that impl `Deref`, have all private fields
2656 // because you're expected to deref them to access the _real_ fields.
2657 // This, for example, will help us suggest accessing a field through a `Box<T>`.
2658 if fields.iter().all(|field| !field.vis.is_accessible_from(mod_id, tcx)) {
2664 .filter(move |field| field.vis.is_accessible_from(mod_id, tcx))
2665 // For compile-time reasons put a limit on number of fields we search
2676 /// This method is called after we have encountered a missing field error to recursively
2677 /// search for the field
2678 pub(crate) fn check_for_nested_field_satisfying(
2681 matches: &impl Fn(&ty::FieldDef, Ty<'tcx>) -> bool,
2682 candidate_field: &ty::FieldDef,
2683 subst: SubstsRef<'tcx>,
2684 mut field_path: Vec<Ident>,
2686 ) -> Option<Vec<Ident>> {
2688 "check_for_nested_field_satisfying(span: {:?}, candidate_field: {:?}, field_path: {:?}",
2689 span, candidate_field, field_path
2692 if field_path.len() > 3 {
2693 // For compile-time reasons and to avoid infinite recursion we only check for fields
2694 // up to a depth of three
2697 field_path.push(candidate_field.ident(self.tcx).normalize_to_macros_2_0());
2698 let field_ty = candidate_field.ty(self.tcx, subst);
2699 if matches(candidate_field, field_ty) {
2700 return Some(field_path);
2701 } else if let Some((nested_fields, subst)) =
2702 self.get_field_candidates_considering_privacy(span, field_ty, mod_id)
2704 // recursively search fields of `candidate_field` if it's a ty::Adt
2705 for field in nested_fields {
2706 if let Some(field_path) = self.check_for_nested_field_satisfying(
2714 return Some(field_path);
2722 fn check_expr_index(
2724 base: &'tcx hir::Expr<'tcx>,
2725 idx: &'tcx hir::Expr<'tcx>,
2726 expr: &'tcx hir::Expr<'tcx>,
2728 let base_t = self.check_expr(&base);
2729 let idx_t = self.check_expr(&idx);
2731 if base_t.references_error() {
2733 } else if idx_t.references_error() {
2736 let base_t = self.structurally_resolved_type(base.span, base_t);
2737 match self.lookup_indexing(expr, base, base_t, idx, idx_t) {
2738 Some((index_ty, element_ty)) => {
2739 // two-phase not needed because index_ty is never mutable
2740 self.demand_coerce(idx, idx_t, index_ty, None, AllowTwoPhase::No);
2741 self.select_obligations_where_possible(false, |errors| {
2742 self.point_at_index_if_possible(errors, idx.span)
2747 let mut err = type_error_struct!(
2752 "cannot index into a value of type `{base_t}`",
2754 // Try to give some advice about indexing tuples.
2755 if let ty::Tuple(..) = base_t.kind() {
2756 let mut needs_note = true;
2757 // If the index is an integer, we can show the actual
2758 // fixed expression:
2759 if let ExprKind::Lit(ref lit) = idx.kind {
2760 if let ast::LitKind::Int(i, ast::LitIntType::Unsuffixed) = lit.node {
2761 let snip = self.tcx.sess.source_map().span_to_snippet(base.span);
2762 if let Ok(snip) = snip {
2763 err.span_suggestion(
2765 "to access tuple elements, use",
2766 format!("{snip}.{i}"),
2767 Applicability::MachineApplicable,
2775 "to access tuple elements, use tuple indexing \
2776 syntax (e.g., `tuple.0`)",
2787 fn point_at_index_if_possible(
2789 errors: &mut Vec<traits::FulfillmentError<'tcx>>,
2792 for error in errors {
2793 match error.obligation.predicate.kind().skip_binder() {
2794 ty::PredicateKind::Trait(predicate)
2795 if self.tcx.is_diagnostic_item(sym::SliceIndex, predicate.trait_ref.def_id) => {
2799 error.obligation.cause.span = span;
2803 fn check_expr_yield(
2805 value: &'tcx hir::Expr<'tcx>,
2806 expr: &'tcx hir::Expr<'tcx>,
2807 src: &'tcx hir::YieldSource,
2809 match self.resume_yield_tys {
2810 Some((resume_ty, yield_ty)) => {
2811 self.check_expr_coercable_to_type(&value, yield_ty, None);
2815 // Given that this `yield` expression was generated as a result of lowering a `.await`,
2816 // we know that the yield type must be `()`; however, the context won't contain this
2817 // information. Hence, we check the source of the yield expression here and check its
2818 // value's type against `()` (this check should always hold).
2819 None if src.is_await() => {
2820 self.check_expr_coercable_to_type(&value, self.tcx.mk_unit(), None);
2824 self.tcx.sess.emit_err(YieldExprOutsideOfGenerator { span: expr.span });
2825 // Avoid expressions without types during writeback (#78653).
2826 self.check_expr(value);
2832 fn check_expr_asm_operand(&self, expr: &'tcx hir::Expr<'tcx>, is_input: bool) {
2833 let needs = if is_input { Needs::None } else { Needs::MutPlace };
2834 let ty = self.check_expr_with_needs(expr, needs);
2835 self.require_type_is_sized(ty, expr.span, traits::InlineAsmSized);
2837 if !is_input && !expr.is_syntactic_place_expr() {
2838 let mut err = self.tcx.sess.struct_span_err(expr.span, "invalid asm output");
2839 err.span_label(expr.span, "cannot assign to this expression");
2843 // If this is an input value, we require its type to be fully resolved
2844 // at this point. This allows us to provide helpful coercions which help
2845 // pass the type candidate list in a later pass.
2847 // We don't require output types to be resolved at this point, which
2848 // allows them to be inferred based on how they are used later in the
2851 let ty = self.structurally_resolved_type(expr.span, ty);
2854 let fnptr_ty = self.tcx.mk_fn_ptr(ty.fn_sig(self.tcx));
2855 self.demand_coerce(expr, ty, fnptr_ty, None, AllowTwoPhase::No);
2857 ty::Ref(_, base_ty, mutbl) => {
2858 let ptr_ty = self.tcx.mk_ptr(ty::TypeAndMut { ty: base_ty, mutbl });
2859 self.demand_coerce(expr, ty, ptr_ty, None, AllowTwoPhase::No);
2866 fn check_expr_asm(&self, asm: &'tcx hir::InlineAsm<'tcx>) -> Ty<'tcx> {
2867 for (op, _op_sp) in asm.operands {
2869 hir::InlineAsmOperand::In { expr, .. } => {
2870 self.check_expr_asm_operand(expr, true);
2872 hir::InlineAsmOperand::Out { expr: Some(expr), .. }
2873 | hir::InlineAsmOperand::InOut { expr, .. } => {
2874 self.check_expr_asm_operand(expr, false);
2876 hir::InlineAsmOperand::Out { expr: None, .. } => {}
2877 hir::InlineAsmOperand::SplitInOut { in_expr, out_expr, .. } => {
2878 self.check_expr_asm_operand(in_expr, true);
2879 if let Some(out_expr) = out_expr {
2880 self.check_expr_asm_operand(out_expr, false);
2883 // `AnonConst`s have their own body and is type-checked separately.
2884 // As they don't flow into the type system we don't need them to
2886 hir::InlineAsmOperand::Const { .. } | hir::InlineAsmOperand::SymFn { .. } => {}
2887 hir::InlineAsmOperand::SymStatic { .. } => {}
2890 if asm.options.contains(ast::InlineAsmOptions::NORETURN) {
2891 self.tcx.types.never