]> git.proxmox.com Git - rustc.git/blob - compiler/rustc_hir_typeck/src/expr.rs
New upstream version 1.71.1+dfsg1
[rustc.git] / compiler / rustc_hir_typeck / src / expr.rs
1 //! Type checking expressions.
2 //!
3 //! See `mod.rs` for more context on type checking in general.
4
5 use crate::cast;
6 use crate::coercion::CoerceMany;
7 use crate::coercion::DynamicCoerceMany;
8 use crate::errors::TypeMismatchFruTypo;
9 use crate::errors::{AddressOfTemporaryTaken, ReturnStmtOutsideOfFnBody, StructExprNonExhaustive};
10 use crate::errors::{
11 FieldMultiplySpecifiedInInitializer, FunctionalRecordUpdateOnNonStruct, HelpUseLatestEdition,
12 YieldExprOutsideOfGenerator,
13 };
14 use crate::fatally_break_rust;
15 use crate::method::SelfSource;
16 use crate::type_error_struct;
17 use crate::Expectation::{self, ExpectCastableToType, ExpectHasType, NoExpectation};
18 use crate::{
19 report_unexpected_variant_res, BreakableCtxt, Diverges, FnCtxt, Needs,
20 TupleArgumentsFlag::DontTupleArguments,
21 };
22 use rustc_ast as ast;
23 use rustc_data_structures::fx::FxHashMap;
24 use rustc_data_structures::stack::ensure_sufficient_stack;
25 use rustc_errors::{
26 pluralize, struct_span_err, AddToDiagnostic, Applicability, Diagnostic, DiagnosticBuilder,
27 DiagnosticId, ErrorGuaranteed, StashKey,
28 };
29 use rustc_hir as hir;
30 use rustc_hir::def::{CtorKind, DefKind, Res};
31 use rustc_hir::def_id::DefId;
32 use rustc_hir::intravisit::Visitor;
33 use rustc_hir::lang_items::LangItem;
34 use rustc_hir::{ExprKind, HirId, QPath};
35 use rustc_hir_analysis::astconv::AstConv as _;
36 use rustc_hir_analysis::check::ty_kind_suggestion;
37 use rustc_infer::infer;
38 use rustc_infer::infer::type_variable::{TypeVariableOrigin, TypeVariableOriginKind};
39 use rustc_infer::infer::DefineOpaqueTypes;
40 use rustc_infer::infer::InferOk;
41 use rustc_infer::traits::query::NoSolution;
42 use rustc_infer::traits::ObligationCause;
43 use rustc_middle::middle::stability;
44 use rustc_middle::ty::adjustment::{Adjust, Adjustment, AllowTwoPhase};
45 use rustc_middle::ty::error::TypeError::FieldMisMatch;
46 use rustc_middle::ty::subst::SubstsRef;
47 use rustc_middle::ty::{self, AdtKind, Ty, TypeVisitableExt};
48 use rustc_session::errors::ExprParenthesesNeeded;
49 use rustc_session::parse::feature_err;
50 use rustc_span::edit_distance::find_best_match_for_name;
51 use rustc_span::hygiene::DesugaringKind;
52 use rustc_span::source_map::{Span, Spanned};
53 use rustc_span::symbol::{kw, sym, Ident, Symbol};
54 use rustc_target::abi::FieldIdx;
55 use rustc_target::spec::abi::Abi::RustIntrinsic;
56 use rustc_trait_selection::infer::InferCtxtExt;
57 use rustc_trait_selection::traits::error_reporting::TypeErrCtxtExt;
58 use rustc_trait_selection::traits::ObligationCtxt;
59 use rustc_trait_selection::traits::{self, ObligationCauseCode};
60
61 impl<'a, 'tcx> FnCtxt<'a, 'tcx> {
62 fn check_expr_eq_type(&self, expr: &'tcx hir::Expr<'tcx>, expected: Ty<'tcx>) {
63 let ty = self.check_expr_with_hint(expr, expected);
64 self.demand_eqtype(expr.span, expected, ty);
65 }
66
67 pub fn check_expr_has_type_or_error(
68 &self,
69 expr: &'tcx hir::Expr<'tcx>,
70 expected: Ty<'tcx>,
71 extend_err: impl FnMut(&mut Diagnostic),
72 ) -> Ty<'tcx> {
73 self.check_expr_meets_expectation_or_error(expr, ExpectHasType(expected), extend_err)
74 }
75
76 fn check_expr_meets_expectation_or_error(
77 &self,
78 expr: &'tcx hir::Expr<'tcx>,
79 expected: Expectation<'tcx>,
80 mut extend_err: impl FnMut(&mut Diagnostic),
81 ) -> Ty<'tcx> {
82 let expected_ty = expected.to_option(&self).unwrap_or(self.tcx.types.bool);
83 let mut ty = self.check_expr_with_expectation(expr, expected);
84
85 // While we don't allow *arbitrary* coercions here, we *do* allow
86 // coercions from ! to `expected`.
87 if ty.is_never() {
88 if let Some(adjustments) = self.typeck_results.borrow().adjustments().get(expr.hir_id) {
89 let reported = self.tcx().sess.delay_span_bug(
90 expr.span,
91 "expression with never type wound up being adjusted",
92 );
93 return if let [Adjustment { kind: Adjust::NeverToAny, target }] = &adjustments[..] {
94 target.to_owned()
95 } else {
96 self.tcx().ty_error(reported)
97 };
98 }
99
100 let adj_ty = self.next_ty_var(TypeVariableOrigin {
101 kind: TypeVariableOriginKind::AdjustmentType,
102 span: expr.span,
103 });
104 self.apply_adjustments(
105 expr,
106 vec![Adjustment { kind: Adjust::NeverToAny, target: adj_ty }],
107 );
108 ty = adj_ty;
109 }
110
111 if let Some(mut err) = self.demand_suptype_diag(expr.span, expected_ty, ty) {
112 let _ = self.emit_type_mismatch_suggestions(
113 &mut err,
114 expr.peel_drop_temps(),
115 ty,
116 expected_ty,
117 None,
118 None,
119 );
120 extend_err(&mut err);
121 err.emit();
122 }
123 ty
124 }
125
126 pub(super) fn check_expr_coercible_to_type(
127 &self,
128 expr: &'tcx hir::Expr<'tcx>,
129 expected: Ty<'tcx>,
130 expected_ty_expr: Option<&'tcx hir::Expr<'tcx>>,
131 ) -> Ty<'tcx> {
132 let ty = self.check_expr_with_hint(expr, expected);
133 // checks don't need two phase
134 self.demand_coerce(expr, ty, expected, expected_ty_expr, AllowTwoPhase::No)
135 }
136
137 pub(super) fn check_expr_with_hint(
138 &self,
139 expr: &'tcx hir::Expr<'tcx>,
140 expected: Ty<'tcx>,
141 ) -> Ty<'tcx> {
142 self.check_expr_with_expectation(expr, ExpectHasType(expected))
143 }
144
145 fn check_expr_with_expectation_and_needs(
146 &self,
147 expr: &'tcx hir::Expr<'tcx>,
148 expected: Expectation<'tcx>,
149 needs: Needs,
150 ) -> Ty<'tcx> {
151 let ty = self.check_expr_with_expectation(expr, expected);
152
153 // If the expression is used in a place whether mutable place is required
154 // e.g. LHS of assignment, perform the conversion.
155 if let Needs::MutPlace = needs {
156 self.convert_place_derefs_to_mutable(expr);
157 }
158
159 ty
160 }
161
162 pub(super) fn check_expr(&self, expr: &'tcx hir::Expr<'tcx>) -> Ty<'tcx> {
163 self.check_expr_with_expectation(expr, NoExpectation)
164 }
165
166 pub(super) fn check_expr_with_needs(
167 &self,
168 expr: &'tcx hir::Expr<'tcx>,
169 needs: Needs,
170 ) -> Ty<'tcx> {
171 self.check_expr_with_expectation_and_needs(expr, NoExpectation, needs)
172 }
173
174 /// Invariant:
175 /// If an expression has any sub-expressions that result in a type error,
176 /// inspecting that expression's type with `ty.references_error()` will return
177 /// true. Likewise, if an expression is known to diverge, inspecting its
178 /// type with `ty::type_is_bot` will return true (n.b.: since Rust is
179 /// strict, _|_ can appear in the type of an expression that does not,
180 /// itself, diverge: for example, fn() -> _|_.)
181 /// Note that inspecting a type's structure *directly* may expose the fact
182 /// that there are actually multiple representations for `Error`, so avoid
183 /// that when err needs to be handled differently.
184 #[instrument(skip(self, expr), level = "debug")]
185 pub(super) fn check_expr_with_expectation(
186 &self,
187 expr: &'tcx hir::Expr<'tcx>,
188 expected: Expectation<'tcx>,
189 ) -> Ty<'tcx> {
190 self.check_expr_with_expectation_and_args(expr, expected, &[])
191 }
192
193 /// Same as `check_expr_with_expectation`, but allows us to pass in the arguments of a
194 /// `ExprKind::Call` when evaluating its callee when it is an `ExprKind::Path`.
195 pub(super) fn check_expr_with_expectation_and_args(
196 &self,
197 expr: &'tcx hir::Expr<'tcx>,
198 expected: Expectation<'tcx>,
199 args: &'tcx [hir::Expr<'tcx>],
200 ) -> Ty<'tcx> {
201 if self.tcx().sess.verbose() {
202 // make this code only run with -Zverbose because it is probably slow
203 if let Ok(lint_str) = self.tcx.sess.source_map().span_to_snippet(expr.span) {
204 if !lint_str.contains('\n') {
205 debug!("expr text: {lint_str}");
206 } else {
207 let mut lines = lint_str.lines();
208 if let Some(line0) = lines.next() {
209 let remaining_lines = lines.count();
210 debug!("expr text: {line0}");
211 debug!("expr text: ...(and {remaining_lines} more lines)");
212 }
213 }
214 }
215 }
216
217 // True if `expr` is a `Try::from_ok(())` that is a result of desugaring a try block
218 // without the final expr (e.g. `try { return; }`). We don't want to generate an
219 // unreachable_code lint for it since warnings for autogenerated code are confusing.
220 let is_try_block_generated_unit_expr = match expr.kind {
221 ExprKind::Call(_, args) if expr.span.is_desugaring(DesugaringKind::TryBlock) => {
222 args.len() == 1 && args[0].span.is_desugaring(DesugaringKind::TryBlock)
223 }
224
225 _ => false,
226 };
227
228 // Warn for expressions after diverging siblings.
229 if !is_try_block_generated_unit_expr {
230 self.warn_if_unreachable(expr.hir_id, expr.span, "expression");
231 }
232
233 // Hide the outer diverging and has_errors flags.
234 let old_diverges = self.diverges.replace(Diverges::Maybe);
235
236 let ty = ensure_sufficient_stack(|| match &expr.kind {
237 hir::ExprKind::Path(
238 qpath @ (hir::QPath::Resolved(..) | hir::QPath::TypeRelative(..)),
239 ) => self.check_expr_path(qpath, expr, args),
240 _ => self.check_expr_kind(expr, expected),
241 });
242 let ty = self.resolve_vars_if_possible(ty);
243
244 // Warn for non-block expressions with diverging children.
245 match expr.kind {
246 ExprKind::Block(..)
247 | ExprKind::If(..)
248 | ExprKind::Let(..)
249 | ExprKind::Loop(..)
250 | ExprKind::Match(..) => {}
251 // If `expr` is a result of desugaring the try block and is an ok-wrapped
252 // diverging expression (e.g. it arose from desugaring of `try { return }`),
253 // we skip issuing a warning because it is autogenerated code.
254 ExprKind::Call(..) if expr.span.is_desugaring(DesugaringKind::TryBlock) => {}
255 ExprKind::Call(callee, _) => self.warn_if_unreachable(expr.hir_id, callee.span, "call"),
256 ExprKind::MethodCall(segment, ..) => {
257 self.warn_if_unreachable(expr.hir_id, segment.ident.span, "call")
258 }
259 _ => self.warn_if_unreachable(expr.hir_id, expr.span, "expression"),
260 }
261
262 // Any expression that produces a value of type `!` must have diverged
263 if ty.is_never() {
264 self.diverges.set(self.diverges.get() | Diverges::always(expr.span));
265 }
266
267 // Record the type, which applies it effects.
268 // We need to do this after the warning above, so that
269 // we don't warn for the diverging expression itself.
270 self.write_ty(expr.hir_id, ty);
271
272 // Combine the diverging and has_error flags.
273 self.diverges.set(self.diverges.get() | old_diverges);
274
275 debug!("type of {} is...", self.tcx.hir().node_to_string(expr.hir_id));
276 debug!("... {:?}, expected is {:?}", ty, expected);
277
278 ty
279 }
280
281 #[instrument(skip(self, expr), level = "debug")]
282 fn check_expr_kind(
283 &self,
284 expr: &'tcx hir::Expr<'tcx>,
285 expected: Expectation<'tcx>,
286 ) -> Ty<'tcx> {
287 trace!("expr={:#?}", expr);
288
289 let tcx = self.tcx;
290 match expr.kind {
291 ExprKind::Lit(ref lit) => self.check_lit(&lit, expected),
292 ExprKind::Binary(op, lhs, rhs) => self.check_binop(expr, op, lhs, rhs, expected),
293 ExprKind::Assign(lhs, rhs, span) => {
294 self.check_expr_assign(expr, expected, lhs, rhs, span)
295 }
296 ExprKind::AssignOp(op, lhs, rhs) => {
297 self.check_binop_assign(expr, op, lhs, rhs, expected)
298 }
299 ExprKind::Unary(unop, oprnd) => self.check_expr_unary(unop, oprnd, expected, expr),
300 ExprKind::AddrOf(kind, mutbl, oprnd) => {
301 self.check_expr_addr_of(kind, mutbl, oprnd, expected, expr)
302 }
303 ExprKind::Path(QPath::LangItem(lang_item, _, hir_id)) => {
304 self.check_lang_item_path(lang_item, expr, hir_id)
305 }
306 ExprKind::Path(ref qpath) => self.check_expr_path(qpath, expr, &[]),
307 ExprKind::InlineAsm(asm) => {
308 // We defer some asm checks as we may not have resolved the input and output types yet (they may still be infer vars).
309 self.deferred_asm_checks.borrow_mut().push((asm, expr.hir_id));
310 self.check_expr_asm(asm)
311 }
312 ExprKind::OffsetOf(container, ref fields) => {
313 self.check_offset_of(container, fields, expr)
314 }
315 ExprKind::Break(destination, ref expr_opt) => {
316 self.check_expr_break(destination, expr_opt.as_deref(), expr)
317 }
318 ExprKind::Continue(destination) => {
319 if destination.target_id.is_ok() {
320 tcx.types.never
321 } else {
322 // There was an error; make type-check fail.
323 tcx.ty_error_misc()
324 }
325 }
326 ExprKind::Ret(ref expr_opt) => self.check_expr_return(expr_opt.as_deref(), expr),
327 ExprKind::Let(let_expr) => self.check_expr_let(let_expr),
328 ExprKind::Loop(body, _, source, _) => {
329 self.check_expr_loop(body, source, expected, expr)
330 }
331 ExprKind::Match(discrim, arms, match_src) => {
332 self.check_match(expr, &discrim, arms, expected, match_src)
333 }
334 ExprKind::Closure(closure) => self.check_expr_closure(closure, expr.span, expected),
335 ExprKind::Block(body, _) => self.check_block_with_expected(&body, expected),
336 ExprKind::Call(callee, args) => self.check_call(expr, &callee, args, expected),
337 ExprKind::MethodCall(segment, receiver, args, _) => {
338 self.check_method_call(expr, segment, receiver, args, expected)
339 }
340 ExprKind::Cast(e, t) => self.check_expr_cast(e, t, expr),
341 ExprKind::Type(e, t) => {
342 let ty = self.to_ty_saving_user_provided_ty(&t);
343 self.check_expr_eq_type(&e, ty);
344 ty
345 }
346 ExprKind::If(cond, then_expr, opt_else_expr) => {
347 self.check_then_else(cond, then_expr, opt_else_expr, expr.span, expected)
348 }
349 ExprKind::DropTemps(e) => self.check_expr_with_expectation(e, expected),
350 ExprKind::Array(args) => self.check_expr_array(args, expected, expr),
351 ExprKind::ConstBlock(ref anon_const) => {
352 self.check_expr_const_block(anon_const, expected, expr)
353 }
354 ExprKind::Repeat(element, ref count) => {
355 self.check_expr_repeat(element, count, expected, expr)
356 }
357 ExprKind::Tup(elts) => self.check_expr_tuple(elts, expected, expr),
358 ExprKind::Struct(qpath, fields, ref base_expr) => {
359 self.check_expr_struct(expr, expected, qpath, fields, base_expr)
360 }
361 ExprKind::Field(base, field) => self.check_field(expr, &base, field, expected),
362 ExprKind::Index(base, idx) => self.check_expr_index(base, idx, expr),
363 ExprKind::Yield(value, ref src) => self.check_expr_yield(value, expr, src),
364 hir::ExprKind::Err(guar) => tcx.ty_error(guar),
365 }
366 }
367
368 fn check_expr_unary(
369 &self,
370 unop: hir::UnOp,
371 oprnd: &'tcx hir::Expr<'tcx>,
372 expected: Expectation<'tcx>,
373 expr: &'tcx hir::Expr<'tcx>,
374 ) -> Ty<'tcx> {
375 let tcx = self.tcx;
376 let expected_inner = match unop {
377 hir::UnOp::Not | hir::UnOp::Neg => expected,
378 hir::UnOp::Deref => NoExpectation,
379 };
380 let mut oprnd_t = self.check_expr_with_expectation(&oprnd, expected_inner);
381
382 if !oprnd_t.references_error() {
383 oprnd_t = self.structurally_resolved_type(expr.span, oprnd_t);
384 match unop {
385 hir::UnOp::Deref => {
386 if let Some(ty) = self.lookup_derefing(expr, oprnd, oprnd_t) {
387 oprnd_t = ty;
388 } else {
389 let mut err = type_error_struct!(
390 tcx.sess,
391 expr.span,
392 oprnd_t,
393 E0614,
394 "type `{oprnd_t}` cannot be dereferenced",
395 );
396 let sp = tcx.sess.source_map().start_point(expr.span).with_parent(None);
397 if let Some(sp) =
398 tcx.sess.parse_sess.ambiguous_block_expr_parse.borrow().get(&sp)
399 {
400 err.subdiagnostic(ExprParenthesesNeeded::surrounding(*sp));
401 }
402 oprnd_t = tcx.ty_error(err.emit());
403 }
404 }
405 hir::UnOp::Not => {
406 let result = self.check_user_unop(expr, oprnd_t, unop, expected_inner);
407 // If it's builtin, we can reuse the type, this helps inference.
408 if !(oprnd_t.is_integral() || *oprnd_t.kind() == ty::Bool) {
409 oprnd_t = result;
410 }
411 }
412 hir::UnOp::Neg => {
413 let result = self.check_user_unop(expr, oprnd_t, unop, expected_inner);
414 // If it's builtin, we can reuse the type, this helps inference.
415 if !oprnd_t.is_numeric() {
416 oprnd_t = result;
417 }
418 }
419 }
420 }
421 oprnd_t
422 }
423
424 fn check_expr_addr_of(
425 &self,
426 kind: hir::BorrowKind,
427 mutbl: hir::Mutability,
428 oprnd: &'tcx hir::Expr<'tcx>,
429 expected: Expectation<'tcx>,
430 expr: &'tcx hir::Expr<'tcx>,
431 ) -> Ty<'tcx> {
432 let hint = expected.only_has_type(self).map_or(NoExpectation, |ty| {
433 match ty.kind() {
434 ty::Ref(_, ty, _) | ty::RawPtr(ty::TypeAndMut { ty, .. }) => {
435 if oprnd.is_syntactic_place_expr() {
436 // Places may legitimately have unsized types.
437 // For example, dereferences of a fat pointer and
438 // the last field of a struct can be unsized.
439 ExpectHasType(*ty)
440 } else {
441 Expectation::rvalue_hint(self, *ty)
442 }
443 }
444 _ => NoExpectation,
445 }
446 });
447 let ty =
448 self.check_expr_with_expectation_and_needs(&oprnd, hint, Needs::maybe_mut_place(mutbl));
449
450 let tm = ty::TypeAndMut { ty, mutbl };
451 match kind {
452 _ if tm.ty.references_error() => self.tcx.ty_error_misc(),
453 hir::BorrowKind::Raw => {
454 self.check_named_place_expr(oprnd);
455 self.tcx.mk_ptr(tm)
456 }
457 hir::BorrowKind::Ref => {
458 // Note: at this point, we cannot say what the best lifetime
459 // is to use for resulting pointer. We want to use the
460 // shortest lifetime possible so as to avoid spurious borrowck
461 // errors. Moreover, the longest lifetime will depend on the
462 // precise details of the value whose address is being taken
463 // (and how long it is valid), which we don't know yet until
464 // type inference is complete.
465 //
466 // Therefore, here we simply generate a region variable. The
467 // region inferencer will then select a suitable value.
468 // Finally, borrowck will infer the value of the region again,
469 // this time with enough precision to check that the value
470 // whose address was taken can actually be made to live as long
471 // as it needs to live.
472 let region = self.next_region_var(infer::AddrOfRegion(expr.span));
473 self.tcx.mk_ref(region, tm)
474 }
475 }
476 }
477
478 /// Does this expression refer to a place that either:
479 /// * Is based on a local or static.
480 /// * Contains a dereference
481 /// Note that the adjustments for the children of `expr` should already
482 /// have been resolved.
483 fn check_named_place_expr(&self, oprnd: &'tcx hir::Expr<'tcx>) {
484 let is_named = oprnd.is_place_expr(|base| {
485 // Allow raw borrows if there are any deref adjustments.
486 //
487 // const VAL: (i32,) = (0,);
488 // const REF: &(i32,) = &(0,);
489 //
490 // &raw const VAL.0; // ERROR
491 // &raw const REF.0; // OK, same as &raw const (*REF).0;
492 //
493 // This is maybe too permissive, since it allows
494 // `let u = &raw const Box::new((1,)).0`, which creates an
495 // immediately dangling raw pointer.
496 self.typeck_results
497 .borrow()
498 .adjustments()
499 .get(base.hir_id)
500 .is_some_and(|x| x.iter().any(|adj| matches!(adj.kind, Adjust::Deref(_))))
501 });
502 if !is_named {
503 self.tcx.sess.emit_err(AddressOfTemporaryTaken { span: oprnd.span });
504 }
505 }
506
507 fn check_lang_item_path(
508 &self,
509 lang_item: hir::LangItem,
510 expr: &'tcx hir::Expr<'tcx>,
511 hir_id: Option<hir::HirId>,
512 ) -> Ty<'tcx> {
513 self.resolve_lang_item_path(lang_item, expr.span, expr.hir_id, hir_id).1
514 }
515
516 pub(crate) fn check_expr_path(
517 &self,
518 qpath: &'tcx hir::QPath<'tcx>,
519 expr: &'tcx hir::Expr<'tcx>,
520 args: &'tcx [hir::Expr<'tcx>],
521 ) -> Ty<'tcx> {
522 let tcx = self.tcx;
523 let (res, opt_ty, segs) =
524 self.resolve_ty_and_res_fully_qualified_call(qpath, expr.hir_id, expr.span);
525 let ty = match res {
526 Res::Err => {
527 self.suggest_assoc_method_call(segs);
528 let e =
529 self.tcx.sess.delay_span_bug(qpath.span(), "`Res::Err` but no error emitted");
530 self.set_tainted_by_errors(e);
531 tcx.ty_error(e)
532 }
533 Res::Def(DefKind::Variant, _) => {
534 let e = report_unexpected_variant_res(tcx, res, qpath, expr.span, "E0533", "value");
535 tcx.ty_error(e)
536 }
537 _ => self.instantiate_value_path(segs, opt_ty, res, expr.span, expr.hir_id).0,
538 };
539
540 if let ty::FnDef(did, ..) = *ty.kind() {
541 let fn_sig = ty.fn_sig(tcx);
542 if tcx.fn_sig(did).skip_binder().abi() == RustIntrinsic
543 && tcx.item_name(did) == sym::transmute
544 {
545 let from = fn_sig.inputs().skip_binder()[0];
546 let to = fn_sig.output().skip_binder();
547 // We defer the transmute to the end of typeck, once all inference vars have
548 // been resolved or we errored. This is important as we can only check transmute
549 // on concrete types, but the output type may not be known yet (it would only
550 // be known if explicitly specified via turbofish).
551 self.deferred_transmute_checks.borrow_mut().push((from, to, expr.hir_id));
552 }
553 if !tcx.features().unsized_fn_params {
554 // We want to remove some Sized bounds from std functions,
555 // but don't want to expose the removal to stable Rust.
556 // i.e., we don't want to allow
557 //
558 // ```rust
559 // drop as fn(str);
560 // ```
561 //
562 // to work in stable even if the Sized bound on `drop` is relaxed.
563 for i in 0..fn_sig.inputs().skip_binder().len() {
564 // We just want to check sizedness, so instead of introducing
565 // placeholder lifetimes with probing, we just replace higher lifetimes
566 // with fresh vars.
567 let span = args.get(i).map(|a| a.span).unwrap_or(expr.span);
568 let input = self.instantiate_binder_with_fresh_vars(
569 span,
570 infer::LateBoundRegionConversionTime::FnCall,
571 fn_sig.input(i),
572 );
573 self.require_type_is_sized_deferred(
574 input,
575 span,
576 traits::SizedArgumentType(None),
577 );
578 }
579 }
580 // Here we want to prevent struct constructors from returning unsized types.
581 // There were two cases this happened: fn pointer coercion in stable
582 // and usual function call in presence of unsized_locals.
583 // Also, as we just want to check sizedness, instead of introducing
584 // placeholder lifetimes with probing, we just replace higher lifetimes
585 // with fresh vars.
586 let output = self.instantiate_binder_with_fresh_vars(
587 expr.span,
588 infer::LateBoundRegionConversionTime::FnCall,
589 fn_sig.output(),
590 );
591 self.require_type_is_sized_deferred(output, expr.span, traits::SizedReturnType);
592 }
593
594 // We always require that the type provided as the value for
595 // a type parameter outlives the moment of instantiation.
596 let substs = self.typeck_results.borrow().node_substs(expr.hir_id);
597 self.add_wf_bounds(substs, expr);
598
599 ty
600 }
601
602 fn check_expr_break(
603 &self,
604 destination: hir::Destination,
605 expr_opt: Option<&'tcx hir::Expr<'tcx>>,
606 expr: &'tcx hir::Expr<'tcx>,
607 ) -> Ty<'tcx> {
608 let tcx = self.tcx;
609 if let Ok(target_id) = destination.target_id {
610 let (e_ty, cause);
611 if let Some(e) = expr_opt {
612 // If this is a break with a value, we need to type-check
613 // the expression. Get an expected type from the loop context.
614 let opt_coerce_to = {
615 // We should release `enclosing_breakables` before the `check_expr_with_hint`
616 // below, so can't move this block of code to the enclosing scope and share
617 // `ctxt` with the second `enclosing_breakables` borrow below.
618 let mut enclosing_breakables = self.enclosing_breakables.borrow_mut();
619 match enclosing_breakables.opt_find_breakable(target_id) {
620 Some(ctxt) => ctxt.coerce.as_ref().map(|coerce| coerce.expected_ty()),
621 None => {
622 // Avoid ICE when `break` is inside a closure (#65383).
623 return tcx.ty_error_with_message(
624 expr.span,
625 "break was outside loop, but no error was emitted",
626 );
627 }
628 }
629 };
630
631 // If the loop context is not a `loop { }`, then break with
632 // a value is illegal, and `opt_coerce_to` will be `None`.
633 // Just set expectation to error in that case.
634 let coerce_to = opt_coerce_to.unwrap_or_else(|| tcx.ty_error_misc());
635
636 // Recurse without `enclosing_breakables` borrowed.
637 e_ty = self.check_expr_with_hint(e, coerce_to);
638 cause = self.misc(e.span);
639 } else {
640 // Otherwise, this is a break *without* a value. That's
641 // always legal, and is equivalent to `break ()`.
642 e_ty = tcx.mk_unit();
643 cause = self.misc(expr.span);
644 }
645
646 // Now that we have type-checked `expr_opt`, borrow
647 // the `enclosing_loops` field and let's coerce the
648 // type of `expr_opt` into what is expected.
649 let mut enclosing_breakables = self.enclosing_breakables.borrow_mut();
650 let Some(ctxt) = enclosing_breakables.opt_find_breakable(target_id) else {
651 // Avoid ICE when `break` is inside a closure (#65383).
652 return tcx.ty_error_with_message(
653 expr.span,
654 "break was outside loop, but no error was emitted",
655 );
656 };
657
658 if let Some(ref mut coerce) = ctxt.coerce {
659 if let Some(ref e) = expr_opt {
660 coerce.coerce(self, &cause, e, e_ty);
661 } else {
662 assert!(e_ty.is_unit());
663 let ty = coerce.expected_ty();
664 coerce.coerce_forced_unit(
665 self,
666 &cause,
667 &mut |mut err| {
668 self.suggest_mismatched_types_on_tail(
669 &mut err, expr, ty, e_ty, target_id,
670 );
671 if let Some(val) = ty_kind_suggestion(ty) {
672 let label = destination
673 .label
674 .map(|l| format!(" {}", l.ident))
675 .unwrap_or_else(String::new);
676 err.span_suggestion(
677 expr.span,
678 "give it a value of the expected type",
679 format!("break{label} {val}"),
680 Applicability::HasPlaceholders,
681 );
682 }
683 },
684 false,
685 );
686 }
687 } else {
688 // If `ctxt.coerce` is `None`, we can just ignore
689 // the type of the expression. This is because
690 // either this was a break *without* a value, in
691 // which case it is always a legal type (`()`), or
692 // else an error would have been flagged by the
693 // `loops` pass for using break with an expression
694 // where you are not supposed to.
695 assert!(expr_opt.is_none() || self.tcx.sess.has_errors().is_some());
696 }
697
698 // If we encountered a `break`, then (no surprise) it may be possible to break from the
699 // loop... unless the value being returned from the loop diverges itself, e.g.
700 // `break return 5` or `break loop {}`.
701 ctxt.may_break |= !self.diverges.get().is_always();
702
703 // the type of a `break` is always `!`, since it diverges
704 tcx.types.never
705 } else {
706 // Otherwise, we failed to find the enclosing loop;
707 // this can only happen if the `break` was not
708 // inside a loop at all, which is caught by the
709 // loop-checking pass.
710 let err = self.tcx.ty_error_with_message(
711 expr.span,
712 "break was outside loop, but no error was emitted",
713 );
714
715 // We still need to assign a type to the inner expression to
716 // prevent the ICE in #43162.
717 if let Some(e) = expr_opt {
718 self.check_expr_with_hint(e, err);
719
720 // ... except when we try to 'break rust;'.
721 // ICE this expression in particular (see #43162).
722 if let ExprKind::Path(QPath::Resolved(_, path)) = e.kind {
723 if path.segments.len() == 1 && path.segments[0].ident.name == sym::rust {
724 fatally_break_rust(self.tcx);
725 }
726 }
727 }
728
729 // There was an error; make type-check fail.
730 err
731 }
732 }
733
734 fn check_expr_return(
735 &self,
736 expr_opt: Option<&'tcx hir::Expr<'tcx>>,
737 expr: &'tcx hir::Expr<'tcx>,
738 ) -> Ty<'tcx> {
739 if self.ret_coercion.is_none() {
740 let mut err = ReturnStmtOutsideOfFnBody {
741 span: expr.span,
742 encl_body_span: None,
743 encl_fn_span: None,
744 };
745
746 let encl_item_id = self.tcx.hir().get_parent_item(expr.hir_id);
747
748 if let Some(hir::Node::Item(hir::Item {
749 kind: hir::ItemKind::Fn(..),
750 span: encl_fn_span,
751 ..
752 }))
753 | Some(hir::Node::TraitItem(hir::TraitItem {
754 kind: hir::TraitItemKind::Fn(_, hir::TraitFn::Provided(_)),
755 span: encl_fn_span,
756 ..
757 }))
758 | Some(hir::Node::ImplItem(hir::ImplItem {
759 kind: hir::ImplItemKind::Fn(..),
760 span: encl_fn_span,
761 ..
762 })) = self.tcx.hir().find_by_def_id(encl_item_id.def_id)
763 {
764 // We are inside a function body, so reporting "return statement
765 // outside of function body" needs an explanation.
766
767 let encl_body_owner_id = self.tcx.hir().enclosing_body_owner(expr.hir_id);
768
769 // If this didn't hold, we would not have to report an error in
770 // the first place.
771 assert_ne!(encl_item_id.def_id, encl_body_owner_id);
772
773 let encl_body_id = self.tcx.hir().body_owned_by(encl_body_owner_id);
774 let encl_body = self.tcx.hir().body(encl_body_id);
775
776 err.encl_body_span = Some(encl_body.value.span);
777 err.encl_fn_span = Some(*encl_fn_span);
778 }
779
780 self.tcx.sess.emit_err(err);
781
782 if let Some(e) = expr_opt {
783 // We still have to type-check `e` (issue #86188), but calling
784 // `check_return_expr` only works inside fn bodies.
785 self.check_expr(e);
786 }
787 } else if let Some(e) = expr_opt {
788 if self.ret_coercion_span.get().is_none() {
789 self.ret_coercion_span.set(Some(e.span));
790 }
791 self.check_return_expr(e, true);
792 } else {
793 let mut coercion = self.ret_coercion.as_ref().unwrap().borrow_mut();
794 if self.ret_coercion_span.get().is_none() {
795 self.ret_coercion_span.set(Some(expr.span));
796 }
797 let cause = self.cause(expr.span, ObligationCauseCode::ReturnNoExpression);
798 if let Some((_, fn_decl, _)) = self.get_fn_decl(expr.hir_id) {
799 coercion.coerce_forced_unit(
800 self,
801 &cause,
802 &mut |db| {
803 let span = fn_decl.output.span();
804 if let Ok(snippet) = self.tcx.sess.source_map().span_to_snippet(span) {
805 db.span_label(
806 span,
807 format!("expected `{snippet}` because of this return type"),
808 );
809 }
810 },
811 true,
812 );
813 } else {
814 coercion.coerce_forced_unit(self, &cause, &mut |_| (), true);
815 }
816 }
817 self.tcx.types.never
818 }
819
820 /// `explicit_return` is `true` if we're checking an explicit `return expr`,
821 /// and `false` if we're checking a trailing expression.
822 pub(super) fn check_return_expr(
823 &self,
824 return_expr: &'tcx hir::Expr<'tcx>,
825 explicit_return: bool,
826 ) {
827 let ret_coercion = self.ret_coercion.as_ref().unwrap_or_else(|| {
828 span_bug!(return_expr.span, "check_return_expr called outside fn body")
829 });
830
831 let ret_ty = ret_coercion.borrow().expected_ty();
832 let return_expr_ty = self.check_expr_with_hint(return_expr, ret_ty);
833 let mut span = return_expr.span;
834 // Use the span of the trailing expression for our cause,
835 // not the span of the entire function
836 if !explicit_return {
837 if let ExprKind::Block(body, _) = return_expr.kind && let Some(last_expr) = body.expr {
838 span = last_expr.span;
839 }
840 }
841 ret_coercion.borrow_mut().coerce(
842 self,
843 &self.cause(span, ObligationCauseCode::ReturnValue(return_expr.hir_id)),
844 return_expr,
845 return_expr_ty,
846 );
847
848 if let Some(fn_sig) = self.body_fn_sig()
849 && fn_sig.output().has_opaque_types()
850 {
851 // Point any obligations that were registered due to opaque type
852 // inference at the return expression.
853 self.select_obligations_where_possible(|errors| {
854 self.point_at_return_for_opaque_ty_error(errors, span, return_expr_ty, return_expr.span);
855 });
856 }
857 }
858
859 fn point_at_return_for_opaque_ty_error(
860 &self,
861 errors: &mut Vec<traits::FulfillmentError<'tcx>>,
862 span: Span,
863 return_expr_ty: Ty<'tcx>,
864 return_span: Span,
865 ) {
866 // Don't point at the whole block if it's empty
867 if span == return_span {
868 return;
869 }
870 for err in errors {
871 let cause = &mut err.obligation.cause;
872 if let ObligationCauseCode::OpaqueReturnType(None) = cause.code() {
873 let new_cause = ObligationCause::new(
874 cause.span,
875 cause.body_id,
876 ObligationCauseCode::OpaqueReturnType(Some((return_expr_ty, span))),
877 );
878 *cause = new_cause;
879 }
880 }
881 }
882
883 pub(crate) fn check_lhs_assignable(
884 &self,
885 lhs: &'tcx hir::Expr<'tcx>,
886 err_code: &'static str,
887 op_span: Span,
888 adjust_err: impl FnOnce(&mut Diagnostic),
889 ) {
890 if lhs.is_syntactic_place_expr() {
891 return;
892 }
893
894 // FIXME: Make this use Diagnostic once error codes can be dynamically set.
895 let mut err = self.tcx.sess.struct_span_err_with_code(
896 op_span,
897 "invalid left-hand side of assignment",
898 DiagnosticId::Error(err_code.into()),
899 );
900 err.span_label(lhs.span, "cannot assign to this expression");
901
902 self.comes_from_while_condition(lhs.hir_id, |expr| {
903 err.span_suggestion_verbose(
904 expr.span.shrink_to_lo(),
905 "you might have meant to use pattern destructuring",
906 "let ",
907 Applicability::MachineApplicable,
908 );
909 });
910
911 adjust_err(&mut err);
912
913 err.emit();
914 }
915
916 // Check if an expression `original_expr_id` comes from the condition of a while loop,
917 /// as opposed from the body of a while loop, which we can naively check by iterating
918 /// parents until we find a loop...
919 pub(super) fn comes_from_while_condition(
920 &self,
921 original_expr_id: HirId,
922 then: impl FnOnce(&hir::Expr<'_>),
923 ) {
924 let mut parent = self.tcx.hir().parent_id(original_expr_id);
925 while let Some(node) = self.tcx.hir().find(parent) {
926 match node {
927 hir::Node::Expr(hir::Expr {
928 kind:
929 hir::ExprKind::Loop(
930 hir::Block {
931 expr:
932 Some(hir::Expr {
933 kind:
934 hir::ExprKind::Match(expr, ..) | hir::ExprKind::If(expr, ..),
935 ..
936 }),
937 ..
938 },
939 _,
940 hir::LoopSource::While,
941 _,
942 ),
943 ..
944 }) => {
945 // Check if our original expression is a child of the condition of a while loop
946 let expr_is_ancestor = std::iter::successors(Some(original_expr_id), |id| {
947 self.tcx.hir().opt_parent_id(*id)
948 })
949 .take_while(|id| *id != parent)
950 .any(|id| id == expr.hir_id);
951 // if it is, then we have a situation like `while Some(0) = value.get(0) {`,
952 // where `while let` was more likely intended.
953 if expr_is_ancestor {
954 then(expr);
955 }
956 break;
957 }
958 hir::Node::Item(_)
959 | hir::Node::ImplItem(_)
960 | hir::Node::TraitItem(_)
961 | hir::Node::Crate(_) => break,
962 _ => {
963 parent = self.tcx.hir().parent_id(parent);
964 }
965 }
966 }
967 }
968
969 // A generic function for checking the 'then' and 'else' clauses in an 'if'
970 // or 'if-else' expression.
971 fn check_then_else(
972 &self,
973 cond_expr: &'tcx hir::Expr<'tcx>,
974 then_expr: &'tcx hir::Expr<'tcx>,
975 opt_else_expr: Option<&'tcx hir::Expr<'tcx>>,
976 sp: Span,
977 orig_expected: Expectation<'tcx>,
978 ) -> Ty<'tcx> {
979 let cond_ty = self.check_expr_has_type_or_error(cond_expr, self.tcx.types.bool, |_| {});
980
981 self.warn_if_unreachable(
982 cond_expr.hir_id,
983 then_expr.span,
984 "block in `if` or `while` expression",
985 );
986
987 let cond_diverges = self.diverges.get();
988 self.diverges.set(Diverges::Maybe);
989
990 let expected = orig_expected.adjust_for_branches(self);
991 let then_ty = self.check_expr_with_expectation(then_expr, expected);
992 let then_diverges = self.diverges.get();
993 self.diverges.set(Diverges::Maybe);
994
995 // We've already taken the expected type's preferences
996 // into account when typing the `then` branch. To figure
997 // out the initial shot at a LUB, we thus only consider
998 // `expected` if it represents a *hard* constraint
999 // (`only_has_type`); otherwise, we just go with a
1000 // fresh type variable.
1001 let coerce_to_ty = expected.coercion_target_type(self, sp);
1002 let mut coerce: DynamicCoerceMany<'_> = CoerceMany::new(coerce_to_ty);
1003
1004 coerce.coerce(self, &self.misc(sp), then_expr, then_ty);
1005
1006 if let Some(else_expr) = opt_else_expr {
1007 let else_ty = self.check_expr_with_expectation(else_expr, expected);
1008 let else_diverges = self.diverges.get();
1009
1010 let opt_suggest_box_span = self.opt_suggest_box_span(then_ty, else_ty, orig_expected);
1011 let if_cause = self.if_cause(
1012 sp,
1013 cond_expr.span,
1014 then_expr,
1015 else_expr,
1016 then_ty,
1017 else_ty,
1018 opt_suggest_box_span,
1019 );
1020
1021 coerce.coerce(self, &if_cause, else_expr, else_ty);
1022
1023 // We won't diverge unless both branches do (or the condition does).
1024 self.diverges.set(cond_diverges | then_diverges & else_diverges);
1025 } else {
1026 self.if_fallback_coercion(sp, then_expr, &mut coerce);
1027
1028 // If the condition is false we can't diverge.
1029 self.diverges.set(cond_diverges);
1030 }
1031
1032 let result_ty = coerce.complete(self);
1033 if let Err(guar) = cond_ty.error_reported() { self.tcx.ty_error(guar) } else { result_ty }
1034 }
1035
1036 /// Type check assignment expression `expr` of form `lhs = rhs`.
1037 /// The expected type is `()` and is passed to the function for the purposes of diagnostics.
1038 fn check_expr_assign(
1039 &self,
1040 expr: &'tcx hir::Expr<'tcx>,
1041 expected: Expectation<'tcx>,
1042 lhs: &'tcx hir::Expr<'tcx>,
1043 rhs: &'tcx hir::Expr<'tcx>,
1044 span: Span,
1045 ) -> Ty<'tcx> {
1046 let expected_ty = expected.coercion_target_type(self, expr.span);
1047 if expected_ty == self.tcx.types.bool {
1048 // The expected type is `bool` but this will result in `()` so we can reasonably
1049 // say that the user intended to write `lhs == rhs` instead of `lhs = rhs`.
1050 // The likely cause of this is `if foo = bar { .. }`.
1051 let actual_ty = self.tcx.mk_unit();
1052 let mut err = self.demand_suptype_diag(expr.span, expected_ty, actual_ty).unwrap();
1053 let lhs_ty = self.check_expr(&lhs);
1054 let rhs_ty = self.check_expr(&rhs);
1055 let (applicability, eq) = if self.can_coerce(rhs_ty, lhs_ty) {
1056 (Applicability::MachineApplicable, true)
1057 } else if let ExprKind::Binary(
1058 Spanned { node: hir::BinOpKind::And | hir::BinOpKind::Or, .. },
1059 _,
1060 rhs_expr,
1061 ) = lhs.kind
1062 {
1063 // if x == 1 && y == 2 { .. }
1064 // +
1065 let actual_lhs_ty = self.check_expr(&rhs_expr);
1066 (Applicability::MaybeIncorrect, self.can_coerce(rhs_ty, actual_lhs_ty))
1067 } else if let ExprKind::Binary(
1068 Spanned { node: hir::BinOpKind::And | hir::BinOpKind::Or, .. },
1069 lhs_expr,
1070 _,
1071 ) = rhs.kind
1072 {
1073 // if x == 1 && y == 2 { .. }
1074 // +
1075 let actual_rhs_ty = self.check_expr(&lhs_expr);
1076 (Applicability::MaybeIncorrect, self.can_coerce(actual_rhs_ty, lhs_ty))
1077 } else {
1078 (Applicability::MaybeIncorrect, false)
1079 };
1080 if !lhs.is_syntactic_place_expr()
1081 && lhs.is_approximately_pattern()
1082 && !matches!(lhs.kind, hir::ExprKind::Lit(_))
1083 {
1084 // Do not suggest `if let x = y` as `==` is way more likely to be the intention.
1085 let hir = self.tcx.hir();
1086 if let hir::Node::Expr(hir::Expr { kind: ExprKind::If { .. }, .. }) =
1087 hir.get_parent(hir.parent_id(expr.hir_id))
1088 {
1089 err.span_suggestion_verbose(
1090 expr.span.shrink_to_lo(),
1091 "you might have meant to use pattern matching",
1092 "let ",
1093 applicability,
1094 );
1095 };
1096 }
1097 if eq {
1098 err.span_suggestion_verbose(
1099 span.shrink_to_hi(),
1100 "you might have meant to compare for equality",
1101 '=',
1102 applicability,
1103 );
1104 }
1105
1106 // If the assignment expression itself is ill-formed, don't
1107 // bother emitting another error
1108 let reported = err.emit_unless(lhs_ty.references_error() || rhs_ty.references_error());
1109 return self.tcx.ty_error(reported);
1110 }
1111
1112 let lhs_ty = self.check_expr_with_needs(&lhs, Needs::MutPlace);
1113
1114 let suggest_deref_binop = |err: &mut Diagnostic, rhs_ty: Ty<'tcx>| {
1115 if let Some(lhs_deref_ty) = self.deref_once_mutably_for_diagnostic(lhs_ty) {
1116 // Can only assign if the type is sized, so if `DerefMut` yields a type that is
1117 // unsized, do not suggest dereferencing it.
1118 let lhs_deref_ty_is_sized = self
1119 .infcx
1120 .type_implements_trait(
1121 self.tcx.require_lang_item(LangItem::Sized, None),
1122 [lhs_deref_ty],
1123 self.param_env,
1124 )
1125 .may_apply();
1126 if lhs_deref_ty_is_sized && self.can_coerce(rhs_ty, lhs_deref_ty) {
1127 err.span_suggestion_verbose(
1128 lhs.span.shrink_to_lo(),
1129 "consider dereferencing here to assign to the mutably borrowed value",
1130 "*",
1131 Applicability::MachineApplicable,
1132 );
1133 }
1134 }
1135 };
1136
1137 // This is (basically) inlined `check_expr_coercible_to_type`, but we want
1138 // to suggest an additional fixup here in `suggest_deref_binop`.
1139 let rhs_ty = self.check_expr_with_hint(&rhs, lhs_ty);
1140 if let (_, Some(mut diag)) =
1141 self.demand_coerce_diag(rhs, rhs_ty, lhs_ty, Some(lhs), AllowTwoPhase::No)
1142 {
1143 suggest_deref_binop(&mut diag, rhs_ty);
1144 diag.emit();
1145 }
1146
1147 self.check_lhs_assignable(lhs, "E0070", span, |err| {
1148 if let Some(rhs_ty) = self.typeck_results.borrow().expr_ty_opt(rhs) {
1149 suggest_deref_binop(err, rhs_ty);
1150 }
1151 });
1152
1153 self.require_type_is_sized(lhs_ty, lhs.span, traits::AssignmentLhsSized);
1154
1155 if let Err(guar) = (lhs_ty, rhs_ty).error_reported() {
1156 self.tcx.ty_error(guar)
1157 } else {
1158 self.tcx.mk_unit()
1159 }
1160 }
1161
1162 pub(super) fn check_expr_let(&self, let_expr: &'tcx hir::Let<'tcx>) -> Ty<'tcx> {
1163 // for let statements, this is done in check_stmt
1164 let init = let_expr.init;
1165 self.warn_if_unreachable(init.hir_id, init.span, "block in `let` expression");
1166 // otherwise check exactly as a let statement
1167 self.check_decl(let_expr.into());
1168 // but return a bool, for this is a boolean expression
1169 self.tcx.types.bool
1170 }
1171
1172 fn check_expr_loop(
1173 &self,
1174 body: &'tcx hir::Block<'tcx>,
1175 source: hir::LoopSource,
1176 expected: Expectation<'tcx>,
1177 expr: &'tcx hir::Expr<'tcx>,
1178 ) -> Ty<'tcx> {
1179 let coerce = match source {
1180 // you can only use break with a value from a normal `loop { }`
1181 hir::LoopSource::Loop => {
1182 let coerce_to = expected.coercion_target_type(self, body.span);
1183 Some(CoerceMany::new(coerce_to))
1184 }
1185
1186 hir::LoopSource::While | hir::LoopSource::ForLoop => None,
1187 };
1188
1189 let ctxt = BreakableCtxt {
1190 coerce,
1191 may_break: false, // Will get updated if/when we find a `break`.
1192 };
1193
1194 let (ctxt, ()) = self.with_breakable_ctxt(expr.hir_id, ctxt, || {
1195 self.check_block_no_value(&body);
1196 });
1197
1198 if ctxt.may_break {
1199 // No way to know whether it's diverging because
1200 // of a `break` or an outer `break` or `return`.
1201 self.diverges.set(Diverges::Maybe);
1202 }
1203
1204 // If we permit break with a value, then result type is
1205 // the LUB of the breaks (possibly ! if none); else, it
1206 // is nil. This makes sense because infinite loops
1207 // (which would have type !) are only possible iff we
1208 // permit break with a value [1].
1209 if ctxt.coerce.is_none() && !ctxt.may_break {
1210 // [1]
1211 self.tcx.sess.delay_span_bug(body.span, "no coercion, but loop may not break");
1212 }
1213 ctxt.coerce.map(|c| c.complete(self)).unwrap_or_else(|| self.tcx.mk_unit())
1214 }
1215
1216 /// Checks a method call.
1217 fn check_method_call(
1218 &self,
1219 expr: &'tcx hir::Expr<'tcx>,
1220 segment: &hir::PathSegment<'_>,
1221 rcvr: &'tcx hir::Expr<'tcx>,
1222 args: &'tcx [hir::Expr<'tcx>],
1223 expected: Expectation<'tcx>,
1224 ) -> Ty<'tcx> {
1225 let rcvr_t = self.check_expr(&rcvr);
1226 // no need to check for bot/err -- callee does that
1227 let rcvr_t = self.structurally_resolved_type(rcvr.span, rcvr_t);
1228 let span = segment.ident.span;
1229
1230 let method = match self.lookup_method(rcvr_t, segment, span, expr, rcvr, args) {
1231 Ok(method) => {
1232 // We could add a "consider `foo::<params>`" suggestion here, but I wasn't able to
1233 // trigger this codepath causing `structurally_resolved_type` to emit an error.
1234
1235 self.write_method_call(expr.hir_id, method);
1236 Ok(method)
1237 }
1238 Err(error) => {
1239 if segment.ident.name != kw::Empty {
1240 if let Some(mut err) = self.report_method_error(
1241 span,
1242 rcvr_t,
1243 segment.ident,
1244 SelfSource::MethodCall(rcvr),
1245 error,
1246 Some((rcvr, args)),
1247 expected,
1248 false,
1249 ) {
1250 err.emit();
1251 }
1252 }
1253 Err(())
1254 }
1255 };
1256
1257 // Call the generic checker.
1258 self.check_method_argument_types(span, expr, method, &args, DontTupleArguments, expected)
1259 }
1260
1261 fn check_expr_cast(
1262 &self,
1263 e: &'tcx hir::Expr<'tcx>,
1264 t: &'tcx hir::Ty<'tcx>,
1265 expr: &'tcx hir::Expr<'tcx>,
1266 ) -> Ty<'tcx> {
1267 // Find the type of `e`. Supply hints based on the type we are casting to,
1268 // if appropriate.
1269 let t_cast = self.to_ty_saving_user_provided_ty(t);
1270 let t_cast = self.resolve_vars_if_possible(t_cast);
1271 let t_expr = self.check_expr_with_expectation(e, ExpectCastableToType(t_cast));
1272 let t_expr = self.resolve_vars_if_possible(t_expr);
1273
1274 // Eagerly check for some obvious errors.
1275 if let Err(guar) = (t_expr, t_cast).error_reported() {
1276 self.tcx.ty_error(guar)
1277 } else {
1278 // Defer other checks until we're done type checking.
1279 let mut deferred_cast_checks = self.deferred_cast_checks.borrow_mut();
1280 match cast::CastCheck::new(
1281 self,
1282 e,
1283 t_expr,
1284 t_cast,
1285 t.span,
1286 expr.span,
1287 self.param_env.constness(),
1288 ) {
1289 Ok(cast_check) => {
1290 debug!(
1291 "check_expr_cast: deferring cast from {:?} to {:?}: {:?}",
1292 t_cast, t_expr, cast_check,
1293 );
1294 deferred_cast_checks.push(cast_check);
1295 t_cast
1296 }
1297 Err(guar) => self.tcx.ty_error(guar),
1298 }
1299 }
1300 }
1301
1302 fn check_expr_array(
1303 &self,
1304 args: &'tcx [hir::Expr<'tcx>],
1305 expected: Expectation<'tcx>,
1306 expr: &'tcx hir::Expr<'tcx>,
1307 ) -> Ty<'tcx> {
1308 let element_ty = if !args.is_empty() {
1309 let coerce_to = expected
1310 .to_option(self)
1311 .and_then(|uty| match *uty.kind() {
1312 ty::Array(ty, _) | ty::Slice(ty) => Some(ty),
1313 _ => None,
1314 })
1315 .unwrap_or_else(|| {
1316 self.next_ty_var(TypeVariableOrigin {
1317 kind: TypeVariableOriginKind::TypeInference,
1318 span: expr.span,
1319 })
1320 });
1321 let mut coerce = CoerceMany::with_coercion_sites(coerce_to, args);
1322 assert_eq!(self.diverges.get(), Diverges::Maybe);
1323 for e in args {
1324 let e_ty = self.check_expr_with_hint(e, coerce_to);
1325 let cause = self.misc(e.span);
1326 coerce.coerce(self, &cause, e, e_ty);
1327 }
1328 coerce.complete(self)
1329 } else {
1330 self.next_ty_var(TypeVariableOrigin {
1331 kind: TypeVariableOriginKind::TypeInference,
1332 span: expr.span,
1333 })
1334 };
1335 let array_len = args.len() as u64;
1336 self.suggest_array_len(expr, array_len);
1337 self.tcx.mk_array(element_ty, array_len)
1338 }
1339
1340 fn suggest_array_len(&self, expr: &'tcx hir::Expr<'tcx>, array_len: u64) {
1341 let parent_node = self.tcx.hir().parent_iter(expr.hir_id).find(|(_, node)| {
1342 !matches!(node, hir::Node::Expr(hir::Expr { kind: hir::ExprKind::AddrOf(..), .. }))
1343 });
1344 let Some((_,
1345 hir::Node::Local(hir::Local { ty: Some(ty), .. })
1346 | hir::Node::Item(hir::Item { kind: hir::ItemKind::Const(ty, _), .. }))
1347 ) = parent_node else {
1348 return
1349 };
1350 if let hir::TyKind::Array(_, length) = ty.peel_refs().kind
1351 && let hir::ArrayLen::Body(hir::AnonConst { hir_id, .. }) = length
1352 && let Some(span) = self.tcx.hir().opt_span(hir_id)
1353 {
1354 match self.tcx.sess.diagnostic().steal_diagnostic(span, StashKey::UnderscoreForArrayLengths) {
1355 Some(mut err) => {
1356 err.span_suggestion(
1357 span,
1358 "consider specifying the array length",
1359 array_len,
1360 Applicability::MaybeIncorrect,
1361 );
1362 err.emit();
1363 }
1364 None => ()
1365 }
1366 }
1367 }
1368
1369 fn check_expr_const_block(
1370 &self,
1371 anon_const: &'tcx hir::AnonConst,
1372 expected: Expectation<'tcx>,
1373 _expr: &'tcx hir::Expr<'tcx>,
1374 ) -> Ty<'tcx> {
1375 let body = self.tcx.hir().body(anon_const.body);
1376
1377 // Create a new function context.
1378 let def_id = anon_const.def_id;
1379 let fcx = FnCtxt::new(self, self.param_env.with_const(), def_id);
1380 crate::GatherLocalsVisitor::new(&fcx).visit_body(body);
1381
1382 let ty = fcx.check_expr_with_expectation(&body.value, expected);
1383 fcx.require_type_is_sized(ty, body.value.span, traits::ConstSized);
1384 fcx.write_ty(anon_const.hir_id, ty);
1385 ty
1386 }
1387
1388 fn check_expr_repeat(
1389 &self,
1390 element: &'tcx hir::Expr<'tcx>,
1391 count: &'tcx hir::ArrayLen,
1392 expected: Expectation<'tcx>,
1393 expr: &'tcx hir::Expr<'tcx>,
1394 ) -> Ty<'tcx> {
1395 let tcx = self.tcx;
1396 let count = self.array_length_to_const(count);
1397 if let Some(count) = count.try_eval_target_usize(tcx, self.param_env) {
1398 self.suggest_array_len(expr, count);
1399 }
1400
1401 let uty = match expected {
1402 ExpectHasType(uty) => match *uty.kind() {
1403 ty::Array(ty, _) | ty::Slice(ty) => Some(ty),
1404 _ => None,
1405 },
1406 _ => None,
1407 };
1408
1409 let (element_ty, t) = match uty {
1410 Some(uty) => {
1411 self.check_expr_coercible_to_type(&element, uty, None);
1412 (uty, uty)
1413 }
1414 None => {
1415 let ty = self.next_ty_var(TypeVariableOrigin {
1416 kind: TypeVariableOriginKind::MiscVariable,
1417 span: element.span,
1418 });
1419 let element_ty = self.check_expr_has_type_or_error(&element, ty, |_| {});
1420 (element_ty, ty)
1421 }
1422 };
1423
1424 if let Err(guar) = element_ty.error_reported() {
1425 return tcx.ty_error(guar);
1426 }
1427
1428 self.check_repeat_element_needs_copy_bound(element, count, element_ty);
1429
1430 self.register_wf_obligation(
1431 tcx.mk_array_with_const_len(t, count).into(),
1432 expr.span,
1433 traits::WellFormed(None),
1434 );
1435
1436 tcx.mk_array_with_const_len(t, count)
1437 }
1438
1439 fn check_repeat_element_needs_copy_bound(
1440 &self,
1441 element: &hir::Expr<'_>,
1442 count: ty::Const<'tcx>,
1443 element_ty: Ty<'tcx>,
1444 ) {
1445 let tcx = self.tcx;
1446 // Actual constants as the repeat element get inserted repeatedly instead of getting copied via Copy.
1447 match &element.kind {
1448 hir::ExprKind::ConstBlock(..) => return,
1449 hir::ExprKind::Path(qpath) => {
1450 let res = self.typeck_results.borrow().qpath_res(qpath, element.hir_id);
1451 if let Res::Def(DefKind::Const | DefKind::AssocConst | DefKind::AnonConst, _) = res
1452 {
1453 return;
1454 }
1455 }
1456 _ => {}
1457 }
1458 // If someone calls a const fn, they can extract that call out into a separate constant (or a const
1459 // block in the future), so we check that to tell them that in the diagnostic. Does not affect typeck.
1460 let is_const_fn = match element.kind {
1461 hir::ExprKind::Call(func, _args) => match *self.node_ty(func.hir_id).kind() {
1462 ty::FnDef(def_id, _) => tcx.is_const_fn(def_id),
1463 _ => false,
1464 },
1465 _ => false,
1466 };
1467
1468 // If the length is 0, we don't create any elements, so we don't copy any. If the length is 1, we
1469 // don't copy that one element, we move it. Only check for Copy if the length is larger.
1470 if count.try_eval_target_usize(tcx, self.param_env).map_or(true, |len| len > 1) {
1471 let lang_item = self.tcx.require_lang_item(LangItem::Copy, None);
1472 let code = traits::ObligationCauseCode::RepeatElementCopy { is_const_fn };
1473 self.require_type_meets(element_ty, element.span, code, lang_item);
1474 }
1475 }
1476
1477 fn check_expr_tuple(
1478 &self,
1479 elts: &'tcx [hir::Expr<'tcx>],
1480 expected: Expectation<'tcx>,
1481 expr: &'tcx hir::Expr<'tcx>,
1482 ) -> Ty<'tcx> {
1483 let flds = expected.only_has_type(self).and_then(|ty| {
1484 let ty = self.resolve_vars_with_obligations(ty);
1485 match ty.kind() {
1486 ty::Tuple(flds) => Some(&flds[..]),
1487 _ => None,
1488 }
1489 });
1490
1491 let elt_ts_iter = elts.iter().enumerate().map(|(i, e)| match flds {
1492 Some(fs) if i < fs.len() => {
1493 let ety = fs[i];
1494 self.check_expr_coercible_to_type(&e, ety, None);
1495 ety
1496 }
1497 _ => self.check_expr_with_expectation(&e, NoExpectation),
1498 });
1499 let tuple = self.tcx.mk_tup_from_iter(elt_ts_iter);
1500 if let Err(guar) = tuple.error_reported() {
1501 self.tcx.ty_error(guar)
1502 } else {
1503 self.require_type_is_sized(tuple, expr.span, traits::TupleInitializerSized);
1504 tuple
1505 }
1506 }
1507
1508 fn check_expr_struct(
1509 &self,
1510 expr: &hir::Expr<'_>,
1511 expected: Expectation<'tcx>,
1512 qpath: &QPath<'_>,
1513 fields: &'tcx [hir::ExprField<'tcx>],
1514 base_expr: &'tcx Option<&'tcx hir::Expr<'tcx>>,
1515 ) -> Ty<'tcx> {
1516 // Find the relevant variant
1517 let (variant, adt_ty) = match self.check_struct_path(qpath, expr.hir_id) {
1518 Ok(data) => data,
1519 Err(guar) => {
1520 self.check_struct_fields_on_error(fields, base_expr);
1521 return self.tcx.ty_error(guar);
1522 }
1523 };
1524
1525 // Prohibit struct expressions when non-exhaustive flag is set.
1526 let adt = adt_ty.ty_adt_def().expect("`check_struct_path` returned non-ADT type");
1527 if !adt.did().is_local() && variant.is_field_list_non_exhaustive() {
1528 self.tcx
1529 .sess
1530 .emit_err(StructExprNonExhaustive { span: expr.span, what: adt.variant_descr() });
1531 }
1532
1533 self.check_expr_struct_fields(
1534 adt_ty,
1535 expected,
1536 expr.hir_id,
1537 qpath.span(),
1538 variant,
1539 fields,
1540 base_expr,
1541 expr.span,
1542 );
1543
1544 self.require_type_is_sized(adt_ty, expr.span, traits::StructInitializerSized);
1545 adt_ty
1546 }
1547
1548 fn check_expr_struct_fields(
1549 &self,
1550 adt_ty: Ty<'tcx>,
1551 expected: Expectation<'tcx>,
1552 expr_id: hir::HirId,
1553 span: Span,
1554 variant: &'tcx ty::VariantDef,
1555 ast_fields: &'tcx [hir::ExprField<'tcx>],
1556 base_expr: &'tcx Option<&'tcx hir::Expr<'tcx>>,
1557 expr_span: Span,
1558 ) {
1559 let tcx = self.tcx;
1560
1561 let expected_inputs =
1562 self.expected_inputs_for_expected_output(span, expected, adt_ty, &[adt_ty]);
1563 let adt_ty_hint = if let Some(expected_inputs) = expected_inputs {
1564 expected_inputs.get(0).cloned().unwrap_or(adt_ty)
1565 } else {
1566 adt_ty
1567 };
1568 // re-link the regions that EIfEO can erase.
1569 self.demand_eqtype(span, adt_ty_hint, adt_ty);
1570
1571 let ty::Adt(adt, substs) = adt_ty.kind() else {
1572 span_bug!(span, "non-ADT passed to check_expr_struct_fields");
1573 };
1574 let adt_kind = adt.adt_kind();
1575
1576 let mut remaining_fields = variant
1577 .fields
1578 .iter_enumerated()
1579 .map(|(i, field)| (field.ident(tcx).normalize_to_macros_2_0(), (i, field)))
1580 .collect::<FxHashMap<_, _>>();
1581
1582 let mut seen_fields = FxHashMap::default();
1583
1584 let mut error_happened = false;
1585
1586 // Type-check each field.
1587 for (idx, field) in ast_fields.iter().enumerate() {
1588 let ident = tcx.adjust_ident(field.ident, variant.def_id);
1589 let field_type = if let Some((i, v_field)) = remaining_fields.remove(&ident) {
1590 seen_fields.insert(ident, field.span);
1591 self.write_field_index(field.hir_id, i);
1592
1593 // We don't look at stability attributes on
1594 // struct-like enums (yet...), but it's definitely not
1595 // a bug to have constructed one.
1596 if adt_kind != AdtKind::Enum {
1597 tcx.check_stability(v_field.did, Some(expr_id), field.span, None);
1598 }
1599
1600 self.field_ty(field.span, v_field, substs)
1601 } else {
1602 error_happened = true;
1603 let guar = if let Some(prev_span) = seen_fields.get(&ident) {
1604 tcx.sess.emit_err(FieldMultiplySpecifiedInInitializer {
1605 span: field.ident.span,
1606 prev_span: *prev_span,
1607 ident,
1608 })
1609 } else {
1610 self.report_unknown_field(
1611 adt_ty,
1612 variant,
1613 field,
1614 ast_fields,
1615 adt.variant_descr(),
1616 expr_span,
1617 )
1618 };
1619
1620 tcx.ty_error(guar)
1621 };
1622
1623 // Make sure to give a type to the field even if there's
1624 // an error, so we can continue type-checking.
1625 let ty = self.check_expr_with_hint(&field.expr, field_type);
1626 let (_, diag) =
1627 self.demand_coerce_diag(&field.expr, ty, field_type, None, AllowTwoPhase::No);
1628
1629 if let Some(mut diag) = diag {
1630 if idx == ast_fields.len() - 1 {
1631 if remaining_fields.is_empty() {
1632 self.suggest_fru_from_range(field, variant, substs, &mut diag);
1633 diag.emit();
1634 } else {
1635 diag.stash(field.span, StashKey::MaybeFruTypo);
1636 }
1637 } else {
1638 diag.emit();
1639 }
1640 }
1641 }
1642
1643 // Make sure the programmer specified correct number of fields.
1644 if adt_kind == AdtKind::Union {
1645 if ast_fields.len() != 1 {
1646 struct_span_err!(
1647 tcx.sess,
1648 span,
1649 E0784,
1650 "union expressions should have exactly one field",
1651 )
1652 .emit();
1653 }
1654 }
1655
1656 // If check_expr_struct_fields hit an error, do not attempt to populate
1657 // the fields with the base_expr. This could cause us to hit errors later
1658 // when certain fields are assumed to exist that in fact do not.
1659 if error_happened {
1660 if let Some(base_expr) = base_expr {
1661 self.check_expr(base_expr);
1662 }
1663 return;
1664 }
1665
1666 if let Some(base_expr) = base_expr {
1667 // FIXME: We are currently creating two branches here in order to maintain
1668 // consistency. But they should be merged as much as possible.
1669 let fru_tys = if self.tcx.features().type_changing_struct_update {
1670 if adt.is_struct() {
1671 // Make some fresh substitutions for our ADT type.
1672 let fresh_substs = self.fresh_substs_for_item(base_expr.span, adt.did());
1673 // We do subtyping on the FRU fields first, so we can
1674 // learn exactly what types we expect the base expr
1675 // needs constrained to be compatible with the struct
1676 // type we expect from the expectation value.
1677 let fru_tys = variant
1678 .fields
1679 .iter()
1680 .map(|f| {
1681 let fru_ty = self.normalize(
1682 expr_span,
1683 self.field_ty(base_expr.span, f, fresh_substs),
1684 );
1685 let ident = self.tcx.adjust_ident(f.ident(self.tcx), variant.def_id);
1686 if let Some(_) = remaining_fields.remove(&ident) {
1687 let target_ty = self.field_ty(base_expr.span, f, substs);
1688 let cause = self.misc(base_expr.span);
1689 match self.at(&cause, self.param_env).sup(
1690 DefineOpaqueTypes::No,
1691 target_ty,
1692 fru_ty,
1693 ) {
1694 Ok(InferOk { obligations, value: () }) => {
1695 self.register_predicates(obligations)
1696 }
1697 Err(_) => {
1698 // This should never happen, since we're just subtyping the
1699 // remaining_fields, but it's fine to emit this, I guess.
1700 self.err_ctxt()
1701 .report_mismatched_types(
1702 &cause,
1703 target_ty,
1704 fru_ty,
1705 FieldMisMatch(variant.name, ident.name),
1706 )
1707 .emit();
1708 }
1709 }
1710 }
1711 self.resolve_vars_if_possible(fru_ty)
1712 })
1713 .collect();
1714 // The use of fresh substs that we have subtyped against
1715 // our base ADT type's fields allows us to guide inference
1716 // along so that, e.g.
1717 // ```
1718 // MyStruct<'a, F1, F2, const C: usize> {
1719 // f: F1,
1720 // // Other fields that reference `'a`, `F2`, and `C`
1721 // }
1722 //
1723 // let x = MyStruct {
1724 // f: 1usize,
1725 // ..other_struct
1726 // };
1727 // ```
1728 // will have the `other_struct` expression constrained to
1729 // `MyStruct<'a, _, F2, C>`, as opposed to just `_`...
1730 // This is important to allow coercions to happen in
1731 // `other_struct` itself. See `coerce-in-base-expr.rs`.
1732 let fresh_base_ty = self.tcx.mk_adt(*adt, fresh_substs);
1733 self.check_expr_has_type_or_error(
1734 base_expr,
1735 self.resolve_vars_if_possible(fresh_base_ty),
1736 |_| {},
1737 );
1738 fru_tys
1739 } else {
1740 // Check the base_expr, regardless of a bad expected adt_ty, so we can get
1741 // type errors on that expression, too.
1742 self.check_expr(base_expr);
1743 self.tcx
1744 .sess
1745 .emit_err(FunctionalRecordUpdateOnNonStruct { span: base_expr.span });
1746 return;
1747 }
1748 } else {
1749 self.check_expr_has_type_or_error(base_expr, adt_ty, |_| {
1750 let base_ty = self.typeck_results.borrow().expr_ty(*base_expr);
1751 let same_adt = matches!((adt_ty.kind(), base_ty.kind()),
1752 (ty::Adt(adt, _), ty::Adt(base_adt, _)) if adt == base_adt);
1753 if self.tcx.sess.is_nightly_build() && same_adt {
1754 feature_err(
1755 &self.tcx.sess.parse_sess,
1756 sym::type_changing_struct_update,
1757 base_expr.span,
1758 "type changing struct updating is experimental",
1759 )
1760 .emit();
1761 }
1762 });
1763 match adt_ty.kind() {
1764 ty::Adt(adt, substs) if adt.is_struct() => variant
1765 .fields
1766 .iter()
1767 .map(|f| self.normalize(expr_span, f.ty(self.tcx, substs)))
1768 .collect(),
1769 _ => {
1770 self.tcx
1771 .sess
1772 .emit_err(FunctionalRecordUpdateOnNonStruct { span: base_expr.span });
1773 return;
1774 }
1775 }
1776 };
1777 self.typeck_results.borrow_mut().fru_field_types_mut().insert(expr_id, fru_tys);
1778 } else if adt_kind != AdtKind::Union && !remaining_fields.is_empty() {
1779 debug!(?remaining_fields);
1780 let private_fields: Vec<&ty::FieldDef> = variant
1781 .fields
1782 .iter()
1783 .filter(|field| !field.vis.is_accessible_from(tcx.parent_module(expr_id), tcx))
1784 .collect();
1785
1786 if !private_fields.is_empty() {
1787 self.report_private_fields(adt_ty, span, private_fields, ast_fields);
1788 } else {
1789 self.report_missing_fields(
1790 adt_ty,
1791 span,
1792 remaining_fields,
1793 variant,
1794 ast_fields,
1795 substs,
1796 );
1797 }
1798 }
1799 }
1800
1801 fn check_struct_fields_on_error(
1802 &self,
1803 fields: &'tcx [hir::ExprField<'tcx>],
1804 base_expr: &'tcx Option<&'tcx hir::Expr<'tcx>>,
1805 ) {
1806 for field in fields {
1807 self.check_expr(&field.expr);
1808 }
1809 if let Some(base) = *base_expr {
1810 self.check_expr(&base);
1811 }
1812 }
1813
1814 /// Report an error for a struct field expression when there are fields which aren't provided.
1815 ///
1816 /// ```text
1817 /// error: missing field `you_can_use_this_field` in initializer of `foo::Foo`
1818 /// --> src/main.rs:8:5
1819 /// |
1820 /// 8 | foo::Foo {};
1821 /// | ^^^^^^^^ missing `you_can_use_this_field`
1822 ///
1823 /// error: aborting due to previous error
1824 /// ```
1825 fn report_missing_fields(
1826 &self,
1827 adt_ty: Ty<'tcx>,
1828 span: Span,
1829 remaining_fields: FxHashMap<Ident, (FieldIdx, &ty::FieldDef)>,
1830 variant: &'tcx ty::VariantDef,
1831 ast_fields: &'tcx [hir::ExprField<'tcx>],
1832 substs: SubstsRef<'tcx>,
1833 ) {
1834 let len = remaining_fields.len();
1835
1836 let mut displayable_field_names: Vec<&str> =
1837 remaining_fields.keys().map(|ident| ident.as_str()).collect();
1838 // sorting &str primitives here, sort_unstable is ok
1839 displayable_field_names.sort_unstable();
1840
1841 let mut truncated_fields_error = String::new();
1842 let remaining_fields_names = match &displayable_field_names[..] {
1843 [field1] => format!("`{}`", field1),
1844 [field1, field2] => format!("`{field1}` and `{field2}`"),
1845 [field1, field2, field3] => format!("`{field1}`, `{field2}` and `{field3}`"),
1846 _ => {
1847 truncated_fields_error =
1848 format!(" and {} other field{}", len - 3, pluralize!(len - 3));
1849 displayable_field_names
1850 .iter()
1851 .take(3)
1852 .map(|n| format!("`{n}`"))
1853 .collect::<Vec<_>>()
1854 .join(", ")
1855 }
1856 };
1857
1858 let mut err = struct_span_err!(
1859 self.tcx.sess,
1860 span,
1861 E0063,
1862 "missing field{} {}{} in initializer of `{}`",
1863 pluralize!(len),
1864 remaining_fields_names,
1865 truncated_fields_error,
1866 adt_ty
1867 );
1868 err.span_label(span, format!("missing {remaining_fields_names}{truncated_fields_error}"));
1869
1870 if let Some(last) = ast_fields.last() {
1871 self.suggest_fru_from_range(last, variant, substs, &mut err);
1872 }
1873
1874 err.emit();
1875 }
1876
1877 /// If the last field is a range literal, but it isn't supposed to be, then they probably
1878 /// meant to use functional update syntax.
1879 fn suggest_fru_from_range(
1880 &self,
1881 last_expr_field: &hir::ExprField<'tcx>,
1882 variant: &ty::VariantDef,
1883 substs: SubstsRef<'tcx>,
1884 err: &mut Diagnostic,
1885 ) {
1886 // I don't use 'is_range_literal' because only double-sided, half-open ranges count.
1887 if let ExprKind::Struct(
1888 QPath::LangItem(LangItem::Range, ..),
1889 [range_start, range_end],
1890 _,
1891 ) = last_expr_field.expr.kind
1892 && let variant_field =
1893 variant.fields.iter().find(|field| field.ident(self.tcx) == last_expr_field.ident)
1894 && let range_def_id = self.tcx.lang_items().range_struct()
1895 && variant_field
1896 .and_then(|field| field.ty(self.tcx, substs).ty_adt_def())
1897 .map(|adt| adt.did())
1898 != range_def_id
1899 {
1900 // Suppress any range expr type mismatches
1901 if let Some(mut diag) = self
1902 .tcx
1903 .sess
1904 .diagnostic()
1905 .steal_diagnostic(last_expr_field.span, StashKey::MaybeFruTypo)
1906 {
1907 diag.delay_as_bug();
1908 }
1909
1910 // Use a (somewhat arbitrary) filtering heuristic to avoid printing
1911 // expressions that are either too long, or have control character
1912 //such as newlines in them.
1913 let expr = self
1914 .tcx
1915 .sess
1916 .source_map()
1917 .span_to_snippet(range_end.expr.span)
1918 .ok()
1919 .filter(|s| s.len() < 25 && !s.contains(|c: char| c.is_control()));
1920
1921 let fru_span = self
1922 .tcx
1923 .sess
1924 .source_map()
1925 .span_extend_while(range_start.span, |c| c.is_whitespace())
1926 .unwrap_or(range_start.span).shrink_to_hi().to(range_end.span);
1927
1928 err.subdiagnostic(TypeMismatchFruTypo {
1929 expr_span: range_start.span,
1930 fru_span,
1931 expr,
1932 });
1933 }
1934 }
1935
1936 /// Report an error for a struct field expression when there are invisible fields.
1937 ///
1938 /// ```text
1939 /// error: cannot construct `Foo` with struct literal syntax due to private fields
1940 /// --> src/main.rs:8:5
1941 /// |
1942 /// 8 | foo::Foo {};
1943 /// | ^^^^^^^^
1944 ///
1945 /// error: aborting due to previous error
1946 /// ```
1947 fn report_private_fields(
1948 &self,
1949 adt_ty: Ty<'tcx>,
1950 span: Span,
1951 private_fields: Vec<&ty::FieldDef>,
1952 used_fields: &'tcx [hir::ExprField<'tcx>],
1953 ) {
1954 let mut err =
1955 self.tcx.sess.struct_span_err(
1956 span,
1957 format!(
1958 "cannot construct `{adt_ty}` with struct literal syntax due to private fields",
1959 ),
1960 );
1961 let (used_private_fields, remaining_private_fields): (
1962 Vec<(Symbol, Span, bool)>,
1963 Vec<(Symbol, Span, bool)>,
1964 ) = private_fields
1965 .iter()
1966 .map(|field| {
1967 match used_fields.iter().find(|used_field| field.name == used_field.ident.name) {
1968 Some(used_field) => (field.name, used_field.span, true),
1969 None => (field.name, self.tcx.def_span(field.did), false),
1970 }
1971 })
1972 .partition(|field| field.2);
1973 err.span_labels(used_private_fields.iter().map(|(_, span, _)| *span), "private field");
1974 if !remaining_private_fields.is_empty() {
1975 let remaining_private_fields_len = remaining_private_fields.len();
1976 let names = match &remaining_private_fields
1977 .iter()
1978 .map(|(name, _, _)| name)
1979 .collect::<Vec<_>>()[..]
1980 {
1981 _ if remaining_private_fields_len > 6 => String::new(),
1982 [name] => format!("`{name}` "),
1983 [names @ .., last] => {
1984 let names = names.iter().map(|name| format!("`{name}`")).collect::<Vec<_>>();
1985 format!("{} and `{last}` ", names.join(", "))
1986 }
1987 [] => unreachable!(),
1988 };
1989 err.note(format!(
1990 "... and other private field{s} {names}that {were} not provided",
1991 s = pluralize!(remaining_private_fields_len),
1992 were = pluralize!("was", remaining_private_fields_len),
1993 ));
1994 }
1995 err.emit();
1996 }
1997
1998 fn report_unknown_field(
1999 &self,
2000 ty: Ty<'tcx>,
2001 variant: &'tcx ty::VariantDef,
2002 field: &hir::ExprField<'_>,
2003 skip_fields: &[hir::ExprField<'_>],
2004 kind_name: &str,
2005 expr_span: Span,
2006 ) -> ErrorGuaranteed {
2007 if variant.is_recovered() {
2008 let guar = self
2009 .tcx
2010 .sess
2011 .delay_span_bug(expr_span, "parser recovered but no error was emitted");
2012 self.set_tainted_by_errors(guar);
2013 return guar;
2014 }
2015 let mut err = self.err_ctxt().type_error_struct_with_diag(
2016 field.ident.span,
2017 |actual| match ty.kind() {
2018 ty::Adt(adt, ..) if adt.is_enum() => struct_span_err!(
2019 self.tcx.sess,
2020 field.ident.span,
2021 E0559,
2022 "{} `{}::{}` has no field named `{}`",
2023 kind_name,
2024 actual,
2025 variant.name,
2026 field.ident
2027 ),
2028 _ => struct_span_err!(
2029 self.tcx.sess,
2030 field.ident.span,
2031 E0560,
2032 "{} `{}` has no field named `{}`",
2033 kind_name,
2034 actual,
2035 field.ident
2036 ),
2037 },
2038 ty,
2039 );
2040
2041 let variant_ident_span = self.tcx.def_ident_span(variant.def_id).unwrap();
2042 match variant.ctor_kind() {
2043 Some(CtorKind::Fn) => match ty.kind() {
2044 ty::Adt(adt, ..) if adt.is_enum() => {
2045 err.span_label(
2046 variant_ident_span,
2047 format!(
2048 "`{adt}::{variant}` defined here",
2049 adt = ty,
2050 variant = variant.name,
2051 ),
2052 );
2053 err.span_label(field.ident.span, "field does not exist");
2054 err.span_suggestion_verbose(
2055 expr_span,
2056 format!(
2057 "`{adt}::{variant}` is a tuple {kind_name}, use the appropriate syntax",
2058 adt = ty,
2059 variant = variant.name,
2060 ),
2061 format!(
2062 "{adt}::{variant}(/* fields */)",
2063 adt = ty,
2064 variant = variant.name,
2065 ),
2066 Applicability::HasPlaceholders,
2067 );
2068 }
2069 _ => {
2070 err.span_label(variant_ident_span, format!("`{adt}` defined here", adt = ty));
2071 err.span_label(field.ident.span, "field does not exist");
2072 err.span_suggestion_verbose(
2073 expr_span,
2074 format!(
2075 "`{adt}` is a tuple {kind_name}, use the appropriate syntax",
2076 adt = ty,
2077 kind_name = kind_name,
2078 ),
2079 format!("{adt}(/* fields */)", adt = ty),
2080 Applicability::HasPlaceholders,
2081 );
2082 }
2083 },
2084 _ => {
2085 // prevent all specified fields from being suggested
2086 let skip_fields = skip_fields.iter().map(|x| x.ident.name);
2087 if let Some(field_name) = self.suggest_field_name(
2088 variant,
2089 field.ident.name,
2090 skip_fields.collect(),
2091 expr_span,
2092 ) {
2093 err.span_suggestion(
2094 field.ident.span,
2095 "a field with a similar name exists",
2096 field_name,
2097 Applicability::MaybeIncorrect,
2098 );
2099 } else {
2100 match ty.kind() {
2101 ty::Adt(adt, ..) => {
2102 if adt.is_enum() {
2103 err.span_label(
2104 field.ident.span,
2105 format!("`{}::{}` does not have this field", ty, variant.name),
2106 );
2107 } else {
2108 err.span_label(
2109 field.ident.span,
2110 format!("`{ty}` does not have this field"),
2111 );
2112 }
2113 let available_field_names =
2114 self.available_field_names(variant, expr_span);
2115 if !available_field_names.is_empty() {
2116 err.note(format!(
2117 "available fields are: {}",
2118 self.name_series_display(available_field_names)
2119 ));
2120 }
2121 }
2122 _ => bug!("non-ADT passed to report_unknown_field"),
2123 }
2124 };
2125 }
2126 }
2127 err.emit()
2128 }
2129
2130 // Return a hint about the closest match in field names
2131 fn suggest_field_name(
2132 &self,
2133 variant: &'tcx ty::VariantDef,
2134 field: Symbol,
2135 skip: Vec<Symbol>,
2136 // The span where stability will be checked
2137 span: Span,
2138 ) -> Option<Symbol> {
2139 let names = variant
2140 .fields
2141 .iter()
2142 .filter_map(|field| {
2143 // ignore already set fields and private fields from non-local crates
2144 // and unstable fields.
2145 if skip.iter().any(|&x| x == field.name)
2146 || (!variant.def_id.is_local() && !field.vis.is_public())
2147 || matches!(
2148 self.tcx.eval_stability(field.did, None, span, None),
2149 stability::EvalResult::Deny { .. }
2150 )
2151 {
2152 None
2153 } else {
2154 Some(field.name)
2155 }
2156 })
2157 .collect::<Vec<Symbol>>();
2158
2159 find_best_match_for_name(&names, field, None)
2160 }
2161
2162 fn available_field_names(
2163 &self,
2164 variant: &'tcx ty::VariantDef,
2165 access_span: Span,
2166 ) -> Vec<Symbol> {
2167 let body_owner_hir_id = self.tcx.hir().local_def_id_to_hir_id(self.body_id);
2168 variant
2169 .fields
2170 .iter()
2171 .filter(|field| {
2172 let def_scope = self
2173 .tcx
2174 .adjust_ident_and_get_scope(
2175 field.ident(self.tcx),
2176 variant.def_id,
2177 body_owner_hir_id,
2178 )
2179 .1;
2180 field.vis.is_accessible_from(def_scope, self.tcx)
2181 && !matches!(
2182 self.tcx.eval_stability(field.did, None, access_span, None),
2183 stability::EvalResult::Deny { .. }
2184 )
2185 })
2186 .filter(|field| !self.tcx.is_doc_hidden(field.did))
2187 .map(|field| field.name)
2188 .collect()
2189 }
2190
2191 fn name_series_display(&self, names: Vec<Symbol>) -> String {
2192 // dynamic limit, to never omit just one field
2193 let limit = if names.len() == 6 { 6 } else { 5 };
2194 let mut display =
2195 names.iter().take(limit).map(|n| format!("`{}`", n)).collect::<Vec<_>>().join(", ");
2196 if names.len() > limit {
2197 display = format!("{} ... and {} others", display, names.len() - limit);
2198 }
2199 display
2200 }
2201
2202 // Check field access expressions
2203 fn check_field(
2204 &self,
2205 expr: &'tcx hir::Expr<'tcx>,
2206 base: &'tcx hir::Expr<'tcx>,
2207 field: Ident,
2208 expected: Expectation<'tcx>,
2209 ) -> Ty<'tcx> {
2210 debug!("check_field(expr: {:?}, base: {:?}, field: {:?})", expr, base, field);
2211 let base_ty = self.check_expr(base);
2212 let base_ty = self.structurally_resolved_type(base.span, base_ty);
2213 let mut private_candidate = None;
2214 let mut autoderef = self.autoderef(expr.span, base_ty);
2215 while let Some((deref_base_ty, _)) = autoderef.next() {
2216 debug!("deref_base_ty: {:?}", deref_base_ty);
2217 match deref_base_ty.kind() {
2218 ty::Adt(base_def, substs) if !base_def.is_enum() => {
2219 debug!("struct named {:?}", deref_base_ty);
2220 let body_hir_id = self.tcx.hir().local_def_id_to_hir_id(self.body_id);
2221 let (ident, def_scope) =
2222 self.tcx.adjust_ident_and_get_scope(field, base_def.did(), body_hir_id);
2223 let fields = &base_def.non_enum_variant().fields;
2224 if let Some((index, field)) = fields
2225 .iter_enumerated()
2226 .find(|(_, f)| f.ident(self.tcx).normalize_to_macros_2_0() == ident)
2227 {
2228 let field_ty = self.field_ty(expr.span, field, substs);
2229 // Save the index of all fields regardless of their visibility in case
2230 // of error recovery.
2231 self.write_field_index(expr.hir_id, index);
2232 let adjustments = self.adjust_steps(&autoderef);
2233 if field.vis.is_accessible_from(def_scope, self.tcx) {
2234 self.apply_adjustments(base, adjustments);
2235 self.register_predicates(autoderef.into_obligations());
2236
2237 self.tcx.check_stability(field.did, Some(expr.hir_id), expr.span, None);
2238 return field_ty;
2239 }
2240 private_candidate = Some((adjustments, base_def.did()));
2241 }
2242 }
2243 ty::Tuple(tys) => {
2244 if let Ok(index) = field.as_str().parse::<usize>() {
2245 if field.name == sym::integer(index) {
2246 if let Some(&field_ty) = tys.get(index) {
2247 let adjustments = self.adjust_steps(&autoderef);
2248 self.apply_adjustments(base, adjustments);
2249 self.register_predicates(autoderef.into_obligations());
2250
2251 self.write_field_index(expr.hir_id, FieldIdx::from_usize(index));
2252 return field_ty;
2253 }
2254 }
2255 }
2256 }
2257 _ => {}
2258 }
2259 }
2260 self.structurally_resolved_type(autoderef.span(), autoderef.final_ty(false));
2261
2262 if let Some((adjustments, did)) = private_candidate {
2263 // (#90483) apply adjustments to avoid ExprUseVisitor from
2264 // creating erroneous projection.
2265 self.apply_adjustments(base, adjustments);
2266 let guar = self.ban_private_field_access(
2267 expr,
2268 base_ty,
2269 field,
2270 did,
2271 expected.only_has_type(self),
2272 );
2273 return self.tcx().ty_error(guar);
2274 }
2275
2276 let guar = if field.name == kw::Empty {
2277 self.tcx.sess.delay_span_bug(field.span, "field name with no name")
2278 } else if self.method_exists(
2279 field,
2280 base_ty,
2281 expr.hir_id,
2282 true,
2283 expected.only_has_type(self),
2284 ) {
2285 self.ban_take_value_of_method(expr, base_ty, field)
2286 } else if !base_ty.is_primitive_ty() {
2287 self.ban_nonexisting_field(field, base, expr, base_ty)
2288 } else {
2289 let field_name = field.to_string();
2290 let mut err = type_error_struct!(
2291 self.tcx().sess,
2292 field.span,
2293 base_ty,
2294 E0610,
2295 "`{base_ty}` is a primitive type and therefore doesn't have fields",
2296 );
2297 let is_valid_suffix = |field: &str| {
2298 if field == "f32" || field == "f64" {
2299 return true;
2300 }
2301 let mut chars = field.chars().peekable();
2302 match chars.peek() {
2303 Some('e') | Some('E') => {
2304 chars.next();
2305 if let Some(c) = chars.peek()
2306 && !c.is_numeric() && *c != '-' && *c != '+'
2307 {
2308 return false;
2309 }
2310 while let Some(c) = chars.peek() {
2311 if !c.is_numeric() {
2312 break;
2313 }
2314 chars.next();
2315 }
2316 }
2317 _ => (),
2318 }
2319 let suffix = chars.collect::<String>();
2320 suffix.is_empty() || suffix == "f32" || suffix == "f64"
2321 };
2322 let maybe_partial_suffix = |field: &str| -> Option<&str> {
2323 let first_chars = ['f', 'l'];
2324 if field.len() >= 1
2325 && field.to_lowercase().starts_with(first_chars)
2326 && field[1..].chars().all(|c| c.is_ascii_digit())
2327 {
2328 if field.to_lowercase().starts_with(['f']) { Some("f32") } else { Some("f64") }
2329 } else {
2330 None
2331 }
2332 };
2333 if let ty::Infer(ty::IntVar(_)) = base_ty.kind()
2334 && let ExprKind::Lit(Spanned {
2335 node: ast::LitKind::Int(_, ast::LitIntType::Unsuffixed),
2336 ..
2337 }) = base.kind
2338 && !base.span.from_expansion()
2339 {
2340 if is_valid_suffix(&field_name) {
2341 err.span_suggestion_verbose(
2342 field.span.shrink_to_lo(),
2343 "if intended to be a floating point literal, consider adding a `0` after the period",
2344 '0',
2345 Applicability::MaybeIncorrect,
2346 );
2347 } else if let Some(correct_suffix) = maybe_partial_suffix(&field_name) {
2348 err.span_suggestion_verbose(
2349 field.span,
2350 format!("if intended to be a floating point literal, consider adding a `0` after the period and a `{correct_suffix}` suffix"),
2351 format!("0{correct_suffix}"),
2352 Applicability::MaybeIncorrect,
2353 );
2354 }
2355 }
2356 err.emit()
2357 };
2358
2359 self.tcx().ty_error(guar)
2360 }
2361
2362 fn suggest_await_on_field_access(
2363 &self,
2364 err: &mut Diagnostic,
2365 field_ident: Ident,
2366 base: &'tcx hir::Expr<'tcx>,
2367 ty: Ty<'tcx>,
2368 ) {
2369 let Some(output_ty) = self.get_impl_future_output_ty(ty) else { return; };
2370 let mut add_label = true;
2371 if let ty::Adt(def, _) = output_ty.kind() {
2372 // no field access on enum type
2373 if !def.is_enum() {
2374 if def
2375 .non_enum_variant()
2376 .fields
2377 .iter()
2378 .any(|field| field.ident(self.tcx) == field_ident)
2379 {
2380 add_label = false;
2381 err.span_label(
2382 field_ident.span,
2383 "field not available in `impl Future`, but it is available in its `Output`",
2384 );
2385 err.span_suggestion_verbose(
2386 base.span.shrink_to_hi(),
2387 "consider `await`ing on the `Future` and access the field of its `Output`",
2388 ".await",
2389 Applicability::MaybeIncorrect,
2390 );
2391 }
2392 }
2393 }
2394 if add_label {
2395 err.span_label(field_ident.span, format!("field not found in `{ty}`"));
2396 }
2397 }
2398
2399 fn ban_nonexisting_field(
2400 &self,
2401 ident: Ident,
2402 base: &'tcx hir::Expr<'tcx>,
2403 expr: &'tcx hir::Expr<'tcx>,
2404 base_ty: Ty<'tcx>,
2405 ) -> ErrorGuaranteed {
2406 debug!(
2407 "ban_nonexisting_field: field={:?}, base={:?}, expr={:?}, base_ty={:?}",
2408 ident, base, expr, base_ty
2409 );
2410 let mut err = self.no_such_field_err(ident, base_ty, base.hir_id);
2411
2412 match *base_ty.peel_refs().kind() {
2413 ty::Array(_, len) => {
2414 self.maybe_suggest_array_indexing(&mut err, expr, base, ident, len);
2415 }
2416 ty::RawPtr(..) => {
2417 self.suggest_first_deref_field(&mut err, expr, base, ident);
2418 }
2419 ty::Adt(def, _) if !def.is_enum() => {
2420 self.suggest_fields_on_recordish(&mut err, def, ident, expr.span);
2421 }
2422 ty::Param(param_ty) => {
2423 self.point_at_param_definition(&mut err, param_ty);
2424 }
2425 ty::Alias(ty::Opaque, _) => {
2426 self.suggest_await_on_field_access(&mut err, ident, base, base_ty.peel_refs());
2427 }
2428 _ => {}
2429 }
2430
2431 self.suggest_fn_call(&mut err, base, base_ty, |output_ty| {
2432 if let ty::Adt(def, _) = output_ty.kind() && !def.is_enum() {
2433 def.non_enum_variant().fields.iter().any(|field| {
2434 field.ident(self.tcx) == ident
2435 && field.vis.is_accessible_from(expr.hir_id.owner.def_id, self.tcx)
2436 })
2437 } else if let ty::Tuple(tys) = output_ty.kind()
2438 && let Ok(idx) = ident.as_str().parse::<usize>()
2439 {
2440 idx < tys.len()
2441 } else {
2442 false
2443 }
2444 });
2445
2446 if ident.name == kw::Await {
2447 // We know by construction that `<expr>.await` is either on Rust 2015
2448 // or results in `ExprKind::Await`. Suggest switching the edition to 2018.
2449 err.note("to `.await` a `Future`, switch to Rust 2018 or later");
2450 HelpUseLatestEdition::new().add_to_diagnostic(&mut err);
2451 }
2452
2453 err.emit()
2454 }
2455
2456 fn ban_private_field_access(
2457 &self,
2458 expr: &hir::Expr<'tcx>,
2459 expr_t: Ty<'tcx>,
2460 field: Ident,
2461 base_did: DefId,
2462 return_ty: Option<Ty<'tcx>>,
2463 ) -> ErrorGuaranteed {
2464 let mut err = self.private_field_err(field, base_did);
2465
2466 // Also check if an accessible method exists, which is often what is meant.
2467 if self.method_exists(field, expr_t, expr.hir_id, false, return_ty)
2468 && !self.expr_in_place(expr.hir_id)
2469 {
2470 self.suggest_method_call(
2471 &mut err,
2472 format!("a method `{field}` also exists, call it with parentheses"),
2473 field,
2474 expr_t,
2475 expr,
2476 None,
2477 );
2478 }
2479 err.emit()
2480 }
2481
2482 fn ban_take_value_of_method(
2483 &self,
2484 expr: &hir::Expr<'tcx>,
2485 expr_t: Ty<'tcx>,
2486 field: Ident,
2487 ) -> ErrorGuaranteed {
2488 let mut err = type_error_struct!(
2489 self.tcx().sess,
2490 field.span,
2491 expr_t,
2492 E0615,
2493 "attempted to take value of method `{field}` on type `{expr_t}`",
2494 );
2495 err.span_label(field.span, "method, not a field");
2496 let expr_is_call =
2497 if let hir::Node::Expr(hir::Expr { kind: ExprKind::Call(callee, _args), .. }) =
2498 self.tcx.hir().get_parent(expr.hir_id)
2499 {
2500 expr.hir_id == callee.hir_id
2501 } else {
2502 false
2503 };
2504 let expr_snippet =
2505 self.tcx.sess.source_map().span_to_snippet(expr.span).unwrap_or_default();
2506 let is_wrapped = expr_snippet.starts_with('(') && expr_snippet.ends_with(')');
2507 let after_open = expr.span.lo() + rustc_span::BytePos(1);
2508 let before_close = expr.span.hi() - rustc_span::BytePos(1);
2509
2510 if expr_is_call && is_wrapped {
2511 err.multipart_suggestion(
2512 "remove wrapping parentheses to call the method",
2513 vec![
2514 (expr.span.with_hi(after_open), String::new()),
2515 (expr.span.with_lo(before_close), String::new()),
2516 ],
2517 Applicability::MachineApplicable,
2518 );
2519 } else if !self.expr_in_place(expr.hir_id) {
2520 // Suggest call parentheses inside the wrapping parentheses
2521 let span = if is_wrapped {
2522 expr.span.with_lo(after_open).with_hi(before_close)
2523 } else {
2524 expr.span
2525 };
2526 self.suggest_method_call(
2527 &mut err,
2528 "use parentheses to call the method",
2529 field,
2530 expr_t,
2531 expr,
2532 Some(span),
2533 );
2534 } else if let ty::RawPtr(ty_and_mut) = expr_t.kind()
2535 && let ty::Adt(adt_def, _) = ty_and_mut.ty.kind()
2536 && let ExprKind::Field(base_expr, _) = expr.kind
2537 && adt_def.variants().len() == 1
2538 && adt_def
2539 .variants()
2540 .iter()
2541 .next()
2542 .unwrap()
2543 .fields
2544 .iter()
2545 .any(|f| f.ident(self.tcx) == field)
2546 {
2547 err.multipart_suggestion(
2548 "to access the field, dereference first",
2549 vec![
2550 (base_expr.span.shrink_to_lo(), "(*".to_string()),
2551 (base_expr.span.shrink_to_hi(), ")".to_string()),
2552 ],
2553 Applicability::MaybeIncorrect,
2554 );
2555 } else {
2556 err.help("methods are immutable and cannot be assigned to");
2557 }
2558
2559 err.emit()
2560 }
2561
2562 fn point_at_param_definition(&self, err: &mut Diagnostic, param: ty::ParamTy) {
2563 let generics = self.tcx.generics_of(self.body_id);
2564 let generic_param = generics.type_param(&param, self.tcx);
2565 if let ty::GenericParamDefKind::Type { synthetic: true, .. } = generic_param.kind {
2566 return;
2567 }
2568 let param_def_id = generic_param.def_id;
2569 let param_hir_id = match param_def_id.as_local() {
2570 Some(x) => self.tcx.hir().local_def_id_to_hir_id(x),
2571 None => return,
2572 };
2573 let param_span = self.tcx.hir().span(param_hir_id);
2574 let param_name = self.tcx.hir().ty_param_name(param_def_id.expect_local());
2575
2576 err.span_label(param_span, format!("type parameter '{param_name}' declared here"));
2577 }
2578
2579 fn suggest_fields_on_recordish(
2580 &self,
2581 err: &mut Diagnostic,
2582 def: ty::AdtDef<'tcx>,
2583 field: Ident,
2584 access_span: Span,
2585 ) {
2586 if let Some(suggested_field_name) =
2587 self.suggest_field_name(def.non_enum_variant(), field.name, vec![], access_span)
2588 {
2589 err.span_suggestion(
2590 field.span,
2591 "a field with a similar name exists",
2592 suggested_field_name,
2593 Applicability::MaybeIncorrect,
2594 );
2595 } else {
2596 err.span_label(field.span, "unknown field");
2597 let struct_variant_def = def.non_enum_variant();
2598 let field_names = self.available_field_names(struct_variant_def, access_span);
2599 if !field_names.is_empty() {
2600 err.note(format!(
2601 "available fields are: {}",
2602 self.name_series_display(field_names),
2603 ));
2604 }
2605 }
2606 }
2607
2608 fn maybe_suggest_array_indexing(
2609 &self,
2610 err: &mut Diagnostic,
2611 expr: &hir::Expr<'_>,
2612 base: &hir::Expr<'_>,
2613 field: Ident,
2614 len: ty::Const<'tcx>,
2615 ) {
2616 if let (Some(len), Ok(user_index)) =
2617 (len.try_eval_target_usize(self.tcx, self.param_env), field.as_str().parse::<u64>())
2618 && let Ok(base) = self.tcx.sess.source_map().span_to_snippet(base.span)
2619 {
2620 let help = "instead of using tuple indexing, use array indexing";
2621 let suggestion = format!("{base}[{field}]");
2622 let applicability = if len < user_index {
2623 Applicability::MachineApplicable
2624 } else {
2625 Applicability::MaybeIncorrect
2626 };
2627 err.span_suggestion(expr.span, help, suggestion, applicability);
2628 }
2629 }
2630
2631 fn suggest_first_deref_field(
2632 &self,
2633 err: &mut Diagnostic,
2634 expr: &hir::Expr<'_>,
2635 base: &hir::Expr<'_>,
2636 field: Ident,
2637 ) {
2638 if let Ok(base) = self.tcx.sess.source_map().span_to_snippet(base.span) {
2639 let msg = format!("`{base}` is a raw pointer; try dereferencing it");
2640 let suggestion = format!("(*{base}).{field}");
2641 err.span_suggestion(expr.span, msg, suggestion, Applicability::MaybeIncorrect);
2642 }
2643 }
2644
2645 fn no_such_field_err(
2646 &self,
2647 field: Ident,
2648 expr_t: Ty<'tcx>,
2649 id: HirId,
2650 ) -> DiagnosticBuilder<'_, ErrorGuaranteed> {
2651 let span = field.span;
2652 debug!("no_such_field_err(span: {:?}, field: {:?}, expr_t: {:?})", span, field, expr_t);
2653
2654 let mut err = type_error_struct!(
2655 self.tcx().sess,
2656 field.span,
2657 expr_t,
2658 E0609,
2659 "no field `{field}` on type `{expr_t}`",
2660 );
2661
2662 // try to add a suggestion in case the field is a nested field of a field of the Adt
2663 let mod_id = self.tcx.parent_module(id).to_def_id();
2664 if let Some((fields, substs)) =
2665 self.get_field_candidates_considering_privacy(span, expr_t, mod_id)
2666 {
2667 let candidate_fields: Vec<_> = fields
2668 .filter_map(|candidate_field| {
2669 self.check_for_nested_field_satisfying(
2670 span,
2671 &|candidate_field, _| candidate_field.ident(self.tcx()) == field,
2672 candidate_field,
2673 substs,
2674 vec![],
2675 mod_id,
2676 )
2677 })
2678 .map(|mut field_path| {
2679 field_path.pop();
2680 field_path
2681 .iter()
2682 .map(|id| id.name.to_ident_string())
2683 .collect::<Vec<String>>()
2684 .join(".")
2685 })
2686 .collect::<Vec<_>>();
2687
2688 let len = candidate_fields.len();
2689 if len > 0 {
2690 err.span_suggestions(
2691 field.span.shrink_to_lo(),
2692 format!(
2693 "{} of the expressions' fields {} a field of the same name",
2694 if len > 1 { "some" } else { "one" },
2695 if len > 1 { "have" } else { "has" },
2696 ),
2697 candidate_fields.iter().map(|path| format!("{path}.")),
2698 Applicability::MaybeIncorrect,
2699 );
2700 }
2701 }
2702 err
2703 }
2704
2705 fn private_field_err(
2706 &self,
2707 field: Ident,
2708 base_did: DefId,
2709 ) -> DiagnosticBuilder<'_, ErrorGuaranteed> {
2710 let struct_path = self.tcx().def_path_str(base_did);
2711 let kind_name = self.tcx().def_descr(base_did);
2712 let mut err = struct_span_err!(
2713 self.tcx().sess,
2714 field.span,
2715 E0616,
2716 "field `{field}` of {kind_name} `{struct_path}` is private",
2717 );
2718 err.span_label(field.span, "private field");
2719
2720 err
2721 }
2722
2723 pub(crate) fn get_field_candidates_considering_privacy(
2724 &self,
2725 span: Span,
2726 base_ty: Ty<'tcx>,
2727 mod_id: DefId,
2728 ) -> Option<(impl Iterator<Item = &'tcx ty::FieldDef> + 'tcx, SubstsRef<'tcx>)> {
2729 debug!("get_field_candidates(span: {:?}, base_t: {:?}", span, base_ty);
2730
2731 for (base_t, _) in self.autoderef(span, base_ty) {
2732 match base_t.kind() {
2733 ty::Adt(base_def, substs) if !base_def.is_enum() => {
2734 let tcx = self.tcx;
2735 let fields = &base_def.non_enum_variant().fields;
2736 // Some struct, e.g. some that impl `Deref`, have all private fields
2737 // because you're expected to deref them to access the _real_ fields.
2738 // This, for example, will help us suggest accessing a field through a `Box<T>`.
2739 if fields.iter().all(|field| !field.vis.is_accessible_from(mod_id, tcx)) {
2740 continue;
2741 }
2742 return Some((
2743 fields
2744 .iter()
2745 .filter(move |field| field.vis.is_accessible_from(mod_id, tcx))
2746 // For compile-time reasons put a limit on number of fields we search
2747 .take(100),
2748 substs,
2749 ));
2750 }
2751 _ => {}
2752 }
2753 }
2754 None
2755 }
2756
2757 /// This method is called after we have encountered a missing field error to recursively
2758 /// search for the field
2759 pub(crate) fn check_for_nested_field_satisfying(
2760 &self,
2761 span: Span,
2762 matches: &impl Fn(&ty::FieldDef, Ty<'tcx>) -> bool,
2763 candidate_field: &ty::FieldDef,
2764 subst: SubstsRef<'tcx>,
2765 mut field_path: Vec<Ident>,
2766 mod_id: DefId,
2767 ) -> Option<Vec<Ident>> {
2768 debug!(
2769 "check_for_nested_field_satisfying(span: {:?}, candidate_field: {:?}, field_path: {:?}",
2770 span, candidate_field, field_path
2771 );
2772
2773 if field_path.len() > 3 {
2774 // For compile-time reasons and to avoid infinite recursion we only check for fields
2775 // up to a depth of three
2776 None
2777 } else {
2778 field_path.push(candidate_field.ident(self.tcx).normalize_to_macros_2_0());
2779 let field_ty = candidate_field.ty(self.tcx, subst);
2780 if matches(candidate_field, field_ty) {
2781 return Some(field_path);
2782 } else if let Some((nested_fields, subst)) =
2783 self.get_field_candidates_considering_privacy(span, field_ty, mod_id)
2784 {
2785 // recursively search fields of `candidate_field` if it's a ty::Adt
2786 for field in nested_fields {
2787 if let Some(field_path) = self.check_for_nested_field_satisfying(
2788 span,
2789 matches,
2790 field,
2791 subst,
2792 field_path.clone(),
2793 mod_id,
2794 ) {
2795 return Some(field_path);
2796 }
2797 }
2798 }
2799 None
2800 }
2801 }
2802
2803 fn check_expr_index(
2804 &self,
2805 base: &'tcx hir::Expr<'tcx>,
2806 idx: &'tcx hir::Expr<'tcx>,
2807 expr: &'tcx hir::Expr<'tcx>,
2808 ) -> Ty<'tcx> {
2809 let base_t = self.check_expr(&base);
2810 let idx_t = self.check_expr(&idx);
2811
2812 if base_t.references_error() {
2813 base_t
2814 } else if idx_t.references_error() {
2815 idx_t
2816 } else {
2817 let base_t = self.structurally_resolved_type(base.span, base_t);
2818 match self.lookup_indexing(expr, base, base_t, idx, idx_t) {
2819 Some((index_ty, element_ty)) => {
2820 // two-phase not needed because index_ty is never mutable
2821 self.demand_coerce(idx, idx_t, index_ty, None, AllowTwoPhase::No);
2822 self.select_obligations_where_possible(|errors| {
2823 self.point_at_index_if_possible(errors, idx.span)
2824 });
2825 element_ty
2826 }
2827 None => {
2828 // Attempt to *shallowly* search for an impl which matches,
2829 // but has nested obligations which are unsatisfied.
2830 for (base_t, _) in self.autoderef(base.span, base_t).silence_errors() {
2831 if let Some((_, index_ty, element_ty)) =
2832 self.find_and_report_unsatisfied_index_impl(base, base_t)
2833 {
2834 self.demand_coerce(idx, idx_t, index_ty, None, AllowTwoPhase::No);
2835 return element_ty;
2836 }
2837 }
2838
2839 let mut err = type_error_struct!(
2840 self.tcx.sess,
2841 expr.span,
2842 base_t,
2843 E0608,
2844 "cannot index into a value of type `{base_t}`",
2845 );
2846 // Try to give some advice about indexing tuples.
2847 if let ty::Tuple(types) = base_t.kind() {
2848 let mut needs_note = true;
2849 // If the index is an integer, we can show the actual
2850 // fixed expression:
2851 if let ExprKind::Lit(ref lit) = idx.kind
2852 && let ast::LitKind::Int(i, ast::LitIntType::Unsuffixed) = lit.node
2853 && i < types.len().try_into().expect("expected tuple index to be < usize length")
2854 {
2855 let snip = self.tcx.sess.source_map().span_to_snippet(base.span);
2856 if let Ok(snip) = snip {
2857 err.span_suggestion(
2858 expr.span,
2859 "to access tuple elements, use",
2860 format!("{snip}.{i}"),
2861 Applicability::MachineApplicable,
2862 );
2863 needs_note = false;
2864 }
2865 } else if let ExprKind::Path(..) = idx.peel_borrows().kind {
2866 err.span_label(idx.span, "cannot access tuple elements at a variable index");
2867 }
2868 if needs_note {
2869 err.help(
2870 "to access tuple elements, use tuple indexing \
2871 syntax (e.g., `tuple.0`)",
2872 );
2873 }
2874 }
2875 let reported = err.emit();
2876 self.tcx.ty_error(reported)
2877 }
2878 }
2879 }
2880 }
2881
2882 /// Try to match an implementation of `Index` against a self type, and report
2883 /// the unsatisfied predicates that result from confirming this impl.
2884 ///
2885 /// Given an index expression, sometimes the `Self` type shallowly but does not
2886 /// deeply satisfy an impl predicate. Instead of simply saying that the type
2887 /// does not support being indexed, we want to point out exactly what nested
2888 /// predicates cause this to be, so that the user can add them to fix their code.
2889 fn find_and_report_unsatisfied_index_impl(
2890 &self,
2891 base_expr: &hir::Expr<'_>,
2892 base_ty: Ty<'tcx>,
2893 ) -> Option<(ErrorGuaranteed, Ty<'tcx>, Ty<'tcx>)> {
2894 let index_trait_def_id = self.tcx.lang_items().index_trait()?;
2895 let index_trait_output_def_id = self.tcx.get_diagnostic_item(sym::IndexOutput)?;
2896
2897 let mut relevant_impls = vec![];
2898 self.tcx.for_each_relevant_impl(index_trait_def_id, base_ty, |impl_def_id| {
2899 relevant_impls.push(impl_def_id);
2900 });
2901 let [impl_def_id] = relevant_impls[..] else {
2902 // Only report unsatisfied impl predicates if there's one impl
2903 return None;
2904 };
2905
2906 self.commit_if_ok(|_| {
2907 let ocx = ObligationCtxt::new_in_snapshot(self);
2908 let impl_substs = self.fresh_substs_for_item(base_expr.span, impl_def_id);
2909 let impl_trait_ref =
2910 self.tcx.impl_trait_ref(impl_def_id).unwrap().subst(self.tcx, impl_substs);
2911 let cause = self.misc(base_expr.span);
2912
2913 // Match the impl self type against the base ty. If this fails,
2914 // we just skip this impl, since it's not particularly useful.
2915 let impl_trait_ref = ocx.normalize(&cause, self.param_env, impl_trait_ref);
2916 ocx.eq(&cause, self.param_env, impl_trait_ref.self_ty(), base_ty)?;
2917
2918 // Register the impl's predicates. One of these predicates
2919 // must be unsatisfied, or else we wouldn't have gotten here
2920 // in the first place.
2921 ocx.register_obligations(traits::predicates_for_generics(
2922 |idx, span| {
2923 cause.clone().derived_cause(
2924 ty::Binder::dummy(ty::TraitPredicate {
2925 trait_ref: impl_trait_ref,
2926 polarity: ty::ImplPolarity::Positive,
2927 constness: ty::BoundConstness::NotConst,
2928 }),
2929 |derived| {
2930 traits::ImplDerivedObligation(Box::new(
2931 traits::ImplDerivedObligationCause {
2932 derived,
2933 impl_or_alias_def_id: impl_def_id,
2934 impl_def_predicate_index: Some(idx),
2935 span,
2936 },
2937 ))
2938 },
2939 )
2940 },
2941 self.param_env,
2942 self.tcx.predicates_of(impl_def_id).instantiate(self.tcx, impl_substs),
2943 ));
2944
2945 // Normalize the output type, which we can use later on as the
2946 // return type of the index expression...
2947 let element_ty = ocx.normalize(
2948 &cause,
2949 self.param_env,
2950 self.tcx.mk_projection(index_trait_output_def_id, impl_trait_ref.substs),
2951 );
2952
2953 let errors = ocx.select_where_possible();
2954 // There should be at least one error reported. If not, we
2955 // will still delay a span bug in `report_fulfillment_errors`.
2956 Ok::<_, NoSolution>((
2957 self.err_ctxt().report_fulfillment_errors(&errors),
2958 impl_trait_ref.substs.type_at(1),
2959 element_ty,
2960 ))
2961 })
2962 .ok()
2963 }
2964
2965 fn point_at_index_if_possible(
2966 &self,
2967 errors: &mut Vec<traits::FulfillmentError<'tcx>>,
2968 span: Span,
2969 ) {
2970 for error in errors {
2971 match error.obligation.predicate.kind().skip_binder() {
2972 ty::PredicateKind::Clause(ty::Clause::Trait(predicate))
2973 if self.tcx.is_diagnostic_item(sym::SliceIndex, predicate.trait_ref.def_id) => {
2974 }
2975 _ => continue,
2976 }
2977 error.obligation.cause.span = span;
2978 }
2979 }
2980
2981 fn check_expr_yield(
2982 &self,
2983 value: &'tcx hir::Expr<'tcx>,
2984 expr: &'tcx hir::Expr<'tcx>,
2985 src: &'tcx hir::YieldSource,
2986 ) -> Ty<'tcx> {
2987 match self.resume_yield_tys {
2988 Some((resume_ty, yield_ty)) => {
2989 self.check_expr_coercible_to_type(&value, yield_ty, None);
2990
2991 resume_ty
2992 }
2993 // Given that this `yield` expression was generated as a result of lowering a `.await`,
2994 // we know that the yield type must be `()`; however, the context won't contain this
2995 // information. Hence, we check the source of the yield expression here and check its
2996 // value's type against `()` (this check should always hold).
2997 None if src.is_await() => {
2998 self.check_expr_coercible_to_type(&value, self.tcx.mk_unit(), None);
2999 self.tcx.mk_unit()
3000 }
3001 _ => {
3002 self.tcx.sess.emit_err(YieldExprOutsideOfGenerator { span: expr.span });
3003 // Avoid expressions without types during writeback (#78653).
3004 self.check_expr(value);
3005 self.tcx.mk_unit()
3006 }
3007 }
3008 }
3009
3010 fn check_expr_asm_operand(&self, expr: &'tcx hir::Expr<'tcx>, is_input: bool) {
3011 let needs = if is_input { Needs::None } else { Needs::MutPlace };
3012 let ty = self.check_expr_with_needs(expr, needs);
3013 self.require_type_is_sized(ty, expr.span, traits::InlineAsmSized);
3014
3015 if !is_input && !expr.is_syntactic_place_expr() {
3016 let mut err = self.tcx.sess.struct_span_err(expr.span, "invalid asm output");
3017 err.span_label(expr.span, "cannot assign to this expression");
3018 err.emit();
3019 }
3020
3021 // If this is an input value, we require its type to be fully resolved
3022 // at this point. This allows us to provide helpful coercions which help
3023 // pass the type candidate list in a later pass.
3024 //
3025 // We don't require output types to be resolved at this point, which
3026 // allows them to be inferred based on how they are used later in the
3027 // function.
3028 if is_input {
3029 let ty = self.structurally_resolved_type(expr.span, ty);
3030 match *ty.kind() {
3031 ty::FnDef(..) => {
3032 let fnptr_ty = self.tcx.mk_fn_ptr(ty.fn_sig(self.tcx));
3033 self.demand_coerce(expr, ty, fnptr_ty, None, AllowTwoPhase::No);
3034 }
3035 ty::Ref(_, base_ty, mutbl) => {
3036 let ptr_ty = self.tcx.mk_ptr(ty::TypeAndMut { ty: base_ty, mutbl });
3037 self.demand_coerce(expr, ty, ptr_ty, None, AllowTwoPhase::No);
3038 }
3039 _ => {}
3040 }
3041 }
3042 }
3043
3044 fn check_expr_asm(&self, asm: &'tcx hir::InlineAsm<'tcx>) -> Ty<'tcx> {
3045 for (op, _op_sp) in asm.operands {
3046 match op {
3047 hir::InlineAsmOperand::In { expr, .. } => {
3048 self.check_expr_asm_operand(expr, true);
3049 }
3050 hir::InlineAsmOperand::Out { expr: Some(expr), .. }
3051 | hir::InlineAsmOperand::InOut { expr, .. } => {
3052 self.check_expr_asm_operand(expr, false);
3053 }
3054 hir::InlineAsmOperand::Out { expr: None, .. } => {}
3055 hir::InlineAsmOperand::SplitInOut { in_expr, out_expr, .. } => {
3056 self.check_expr_asm_operand(in_expr, true);
3057 if let Some(out_expr) = out_expr {
3058 self.check_expr_asm_operand(out_expr, false);
3059 }
3060 }
3061 // `AnonConst`s have their own body and is type-checked separately.
3062 // As they don't flow into the type system we don't need them to
3063 // be well-formed.
3064 hir::InlineAsmOperand::Const { .. } | hir::InlineAsmOperand::SymFn { .. } => {}
3065 hir::InlineAsmOperand::SymStatic { .. } => {}
3066 }
3067 }
3068 if asm.options.contains(ast::InlineAsmOptions::NORETURN) {
3069 self.tcx.types.never
3070 } else {
3071 self.tcx.mk_unit()
3072 }
3073 }
3074
3075 fn check_offset_of(
3076 &self,
3077 container: &'tcx hir::Ty<'tcx>,
3078 fields: &[Ident],
3079 expr: &'tcx hir::Expr<'tcx>,
3080 ) -> Ty<'tcx> {
3081 let container = self.to_ty(container).normalized;
3082
3083 let mut field_indices = Vec::with_capacity(fields.len());
3084 let mut current_container = container;
3085
3086 for &field in fields {
3087 let container = self.structurally_resolved_type(expr.span, current_container);
3088
3089 match container.kind() {
3090 ty::Adt(container_def, substs) if !container_def.is_enum() => {
3091 let block = self.tcx.hir().local_def_id_to_hir_id(self.body_id);
3092 let (ident, def_scope) =
3093 self.tcx.adjust_ident_and_get_scope(field, container_def.did(), block);
3094
3095 let fields = &container_def.non_enum_variant().fields;
3096 if let Some((index, field)) = fields
3097 .iter_enumerated()
3098 .find(|(_, f)| f.ident(self.tcx).normalize_to_macros_2_0() == ident)
3099 {
3100 let field_ty = self.field_ty(expr.span, field, substs);
3101
3102 // FIXME: DSTs with static alignment should be allowed
3103 self.require_type_is_sized(field_ty, expr.span, traits::MiscObligation);
3104
3105 if field.vis.is_accessible_from(def_scope, self.tcx) {
3106 self.tcx.check_stability(field.did, Some(expr.hir_id), expr.span, None);
3107 } else {
3108 self.private_field_err(ident, container_def.did()).emit();
3109 }
3110
3111 // Save the index of all fields regardless of their visibility in case
3112 // of error recovery.
3113 field_indices.push(index);
3114 current_container = field_ty;
3115
3116 continue;
3117 }
3118 }
3119 ty::Tuple(tys) => {
3120 let fstr = field.as_str();
3121
3122 if let Ok(index) = fstr.parse::<usize>() {
3123 if fstr == index.to_string() {
3124 if let Some(&field_ty) = tys.get(index) {
3125 field_indices.push(index.into());
3126 current_container = field_ty;
3127
3128 continue;
3129 }
3130 }
3131 }
3132 }
3133 _ => (),
3134 };
3135
3136 self.no_such_field_err(field, container, expr.hir_id).emit();
3137
3138 break;
3139 }
3140
3141 self.typeck_results
3142 .borrow_mut()
3143 .offset_of_data_mut()
3144 .insert(expr.hir_id, (container, field_indices));
3145
3146 self.tcx.types.usize
3147 }
3148 }