1 use crate::{FnCtxt, RawTy}
;
3 use rustc_data_structures
::fx
::FxHashMap
;
5 pluralize
, struct_span_err
, Applicability
, Diagnostic
, DiagnosticBuilder
, ErrorGuaranteed
,
9 use rustc_hir
::def
::{CtorKind, DefKind, Res}
;
10 use rustc_hir
::pat_util
::EnumerateAndAdjustIterator
;
11 use rustc_hir
::{HirId, Pat, PatKind}
;
12 use rustc_infer
::infer
;
13 use rustc_infer
::infer
::type_variable
::{TypeVariableOrigin, TypeVariableOriginKind}
;
14 use rustc_middle
::middle
::stability
::EvalResult
;
15 use rustc_middle
::ty
::{self, Adt, BindingMode, Ty, TypeVisitableExt}
;
16 use rustc_session
::lint
::builtin
::NON_EXHAUSTIVE_OMITTED_PATTERNS
;
17 use rustc_span
::edit_distance
::find_best_match_for_name
;
18 use rustc_span
::hygiene
::DesugaringKind
;
19 use rustc_span
::source_map
::{Span, Spanned}
;
20 use rustc_span
::symbol
::{kw, sym, Ident}
;
21 use rustc_span
::{BytePos, DUMMY_SP}
;
22 use rustc_trait_selection
::traits
::{ObligationCause, Pattern}
;
26 use std
::collections
::hash_map
::Entry
::{Occupied, Vacant}
;
28 use super::report_unexpected_variant_res
;
30 const CANNOT_IMPLICITLY_DEREF_POINTER_TRAIT_OBJ
: &str = "\
31 This error indicates that a pointer to a trait type cannot be implicitly dereferenced by a \
32 pattern. Every trait defines a type, but because the size of trait implementors isn't fixed, \
33 this type has no compile-time size. Therefore, all accesses to trait types must be through \
34 pointers. If you encounter this error you should try to avoid dereferencing the pointer.
36 You can read more about trait objects in the Trait Objects section of the Reference: \
37 https://doc.rust-lang.org/reference/types.html#trait-objects";
39 /// Information about the expected type at the top level of type checking a pattern.
41 /// **NOTE:** This is only for use by diagnostics. Do NOT use for type checking logic!
42 #[derive(Copy, Clone)]
43 struct TopInfo
<'tcx
> {
44 /// The `expected` type at the top level of type checking a pattern.
46 /// Was the origin of the `span` from a scrutinee expression?
48 /// Otherwise there is no scrutinee and it could be e.g. from the type of a formal parameter.
49 origin_expr
: Option
<&'tcx hir
::Expr
<'tcx
>>,
50 /// The span giving rise to the `expected` type, if one could be provided.
52 /// If `origin_expr` is `true`, then this is the span of the scrutinee as in:
54 /// - `match scrutinee { ... }`
55 /// - `let _ = scrutinee;`
57 /// This is used to point to add context in type errors.
58 /// In the following example, `span` corresponds to the `a + b` expression:
61 /// error[E0308]: mismatched types
62 /// --> src/main.rs:L:C
64 /// L | let temp: usize = match a + b {
65 /// | ----- this expression has type `usize`
66 /// L | Ok(num) => num,
67 /// | ^^^^^^^ expected `usize`, found enum `std::result::Result`
69 /// = note: expected type `usize`
70 /// found type `std::result::Result<_, _>`
75 impl<'tcx
> FnCtxt
<'_
, 'tcx
> {
76 fn pattern_cause(&self, ti
: TopInfo
<'tcx
>, cause_span
: Span
) -> ObligationCause
<'tcx
> {
78 Pattern { span: ti.span, root_ty: ti.expected, origin_expr: ti.origin_expr.is_some() }
;
79 self.cause(cause_span
, code
)
82 fn demand_eqtype_pat_diag(
88 ) -> Option
<DiagnosticBuilder
<'tcx
, ErrorGuaranteed
>> {
90 self.demand_eqtype_with_origin(&self.pattern_cause(ti
, cause_span
), expected
, actual
)?
;
91 if let Some(expr
) = ti
.origin_expr
{
92 self.suggest_fn_call(&mut diag
, expr
, expected
, |output
| {
93 self.can_eq(self.param_env
, output
, actual
)
106 if let Some(mut err
) = self.demand_eqtype_pat_diag(cause_span
, expected
, actual
, ti
) {
112 const INITIAL_BM
: BindingMode
= BindingMode
::BindByValue(hir
::Mutability
::Not
);
114 /// Mode for adjusting the expected type and binding mode.
116 /// Peel off all immediate reference types.
118 /// Reset binding mode to the initial mode.
120 /// Pass on the input binding mode and expected type.
124 impl<'a
, 'tcx
> FnCtxt
<'a
, 'tcx
> {
125 /// Type check the given top level pattern against the `expected` type.
127 /// If a `Some(span)` is provided and `origin_expr` holds,
128 /// then the `span` represents the scrutinee's span.
129 /// The scrutinee is found in e.g. `match scrutinee { ... }` and `let pat = scrutinee;`.
131 /// Otherwise, `Some(span)` represents the span of a type expression
132 /// which originated the `expected` type.
133 pub fn check_pat_top(
135 pat
: &'tcx Pat
<'tcx
>,
138 origin_expr
: Option
<&'tcx hir
::Expr
<'tcx
>>,
140 let info
= TopInfo { expected, origin_expr, span }
;
141 self.check_pat(pat
, expected
, INITIAL_BM
, info
);
144 /// Type check the given `pat` against the `expected` type
145 /// with the provided `def_bm` (default binding mode).
147 /// Outside of this module, `check_pat_top` should always be used.
148 /// Conversely, inside this module, `check_pat_top` should never be used.
149 #[instrument(level = "debug", skip(self, ti))]
152 pat
: &'tcx Pat
<'tcx
>,
157 let path_res
= match &pat
.kind
{
158 PatKind
::Path(qpath
) => {
159 Some(self.resolve_ty_and_res_fully_qualified_call(qpath
, pat
.hir_id
, pat
.span
))
163 let adjust_mode
= self.calc_adjust_mode(pat
, path_res
.map(|(res
, ..)| res
));
164 let (expected
, def_bm
) = self.calc_default_binding_mode(pat
, expected
, def_bm
, adjust_mode
);
166 let ty
= match pat
.kind
{
167 PatKind
::Wild
=> expected
,
168 PatKind
::Lit(lt
) => self.check_pat_lit(pat
.span
, lt
, expected
, ti
),
169 PatKind
::Range(lhs
, rhs
, _
) => self.check_pat_range(pat
.span
, lhs
, rhs
, expected
, ti
),
170 PatKind
::Binding(ba
, var_id
, _
, sub
) => {
171 self.check_pat_ident(pat
, ba
, var_id
, sub
, expected
, def_bm
, ti
)
173 PatKind
::TupleStruct(ref qpath
, subpats
, ddpos
) => {
174 self.check_pat_tuple_struct(pat
, qpath
, subpats
, ddpos
, expected
, def_bm
, ti
)
176 PatKind
::Path(ref qpath
) => {
177 self.check_pat_path(pat
, qpath
, path_res
.unwrap(), expected
, ti
)
179 PatKind
::Struct(ref qpath
, fields
, has_rest_pat
) => {
180 self.check_pat_struct(pat
, qpath
, fields
, has_rest_pat
, expected
, def_bm
, ti
)
182 PatKind
::Or(pats
) => {
184 self.check_pat(pat
, expected
, def_bm
, ti
);
188 PatKind
::Tuple(elements
, ddpos
) => {
189 self.check_pat_tuple(pat
.span
, elements
, ddpos
, expected
, def_bm
, ti
)
191 PatKind
::Box(inner
) => self.check_pat_box(pat
.span
, inner
, expected
, def_bm
, ti
),
192 PatKind
::Ref(inner
, mutbl
) => {
193 self.check_pat_ref(pat
, inner
, mutbl
, expected
, def_bm
, ti
)
195 PatKind
::Slice(before
, slice
, after
) => {
196 self.check_pat_slice(pat
.span
, before
, slice
, after
, expected
, def_bm
, ti
)
200 self.write_ty(pat
.hir_id
, ty
);
202 // (note_1): In most of the cases where (note_1) is referenced
203 // (literals and constants being the exception), we relate types
204 // using strict equality, even though subtyping would be sufficient.
205 // There are a few reasons for this, some of which are fairly subtle
206 // and which cost me (nmatsakis) an hour or two debugging to remember,
207 // so I thought I'd write them down this time.
209 // 1. There is no loss of expressiveness here, though it does
210 // cause some inconvenience. What we are saying is that the type
211 // of `x` becomes *exactly* what is expected. This can cause unnecessary
212 // errors in some cases, such as this one:
215 // fn foo<'x>(x: &'x i32) {
222 // The reason we might get an error is that `z` might be
223 // assigned a type like `&'x i32`, and then we would have
224 // a problem when we try to assign `&a` to `z`, because
225 // the lifetime of `&a` (i.e., the enclosing block) is
226 // shorter than `'x`.
228 // HOWEVER, this code works fine. The reason is that the
229 // expected type here is whatever type the user wrote, not
230 // the initializer's type. In this case the user wrote
231 // nothing, so we are going to create a type variable `Z`.
232 // Then we will assign the type of the initializer (`&'x i32`)
233 // as a subtype of `Z`: `&'x i32 <: Z`. And hence we
234 // will instantiate `Z` as a type `&'0 i32` where `'0` is
235 // a fresh region variable, with the constraint that `'x : '0`.
236 // So basically we're all set.
238 // Note that there are two tests to check that this remains true
239 // (`regions-reassign-{match,let}-bound-pointer.rs`).
241 // 2. Things go horribly wrong if we use subtype. The reason for
242 // THIS is a fairly subtle case involving bound regions. See the
243 // `givens` field in `region_constraints`, as well as the test
244 // `regions-relate-bound-regions-on-closures-to-inference-variables.rs`,
245 // for details. Short version is that we must sometimes detect
246 // relationships between specific region variables and regions
247 // bound in a closure signature, and that detection gets thrown
248 // off when we substitute fresh region variables here to enable
252 /// Compute the new expected type and default binding mode from the old ones
253 /// as well as the pattern form we are currently checking.
254 fn calc_default_binding_mode(
256 pat
: &'tcx Pat
<'tcx
>,
259 adjust_mode
: AdjustMode
,
260 ) -> (Ty
<'tcx
>, BindingMode
) {
262 AdjustMode
::Pass
=> (expected
, def_bm
),
263 AdjustMode
::Reset
=> (expected
, INITIAL_BM
),
264 AdjustMode
::Peel
=> self.peel_off_references(pat
, expected
, def_bm
),
268 /// How should the binding mode and expected type be adjusted?
270 /// When the pattern is a path pattern, `opt_path_res` must be `Some(res)`.
271 fn calc_adjust_mode(&self, pat
: &'tcx Pat
<'tcx
>, opt_path_res
: Option
<Res
>) -> AdjustMode
{
272 // When we perform destructuring assignment, we disable default match bindings, which are
273 // unintuitive in this context.
274 if !pat
.default_binding_modes
{
275 return AdjustMode
::Reset
;
278 // Type checking these product-like types successfully always require
279 // that the expected type be of those types and not reference types.
281 | PatKind
::TupleStruct(..)
285 | PatKind
::Slice(..) => AdjustMode
::Peel
,
286 // String and byte-string literals result in types `&str` and `&[u8]` respectively.
287 // All other literals result in non-reference types.
288 // As a result, we allow `if let 0 = &&0 {}` but not `if let "foo" = &&"foo {}`.
290 // Call `resolve_vars_if_possible` here for inline const blocks.
291 PatKind
::Lit(lt
) => match self.resolve_vars_if_possible(self.check_expr(lt
)).kind() {
292 ty
::Ref(..) => AdjustMode
::Pass
,
293 _
=> AdjustMode
::Peel
,
295 PatKind
::Path(_
) => match opt_path_res
.unwrap() {
296 // These constants can be of a reference type, e.g. `const X: &u8 = &0;`.
297 // Peeling the reference types too early will cause type checking failures.
298 // Although it would be possible to *also* peel the types of the constants too.
299 Res
::Def(DefKind
::Const
| DefKind
::AssocConst
, _
) => AdjustMode
::Pass
,
300 // In the `ValueNS`, we have `SelfCtor(..) | Ctor(_, Const), _)` remaining which
301 // could successfully compile. The former being `Self` requires a unit struct.
302 // In either case, and unlike constants, the pattern itself cannot be
303 // a reference type wherefore peeling doesn't give up any expressiveness.
304 _
=> AdjustMode
::Peel
,
306 // When encountering a `& mut? pat` pattern, reset to "by value".
307 // This is so that `x` and `y` here are by value, as they appear to be:
310 // match &(&22, &44) {
316 PatKind
::Ref(..) => AdjustMode
::Reset
,
317 // A `_` pattern works with any expected type, so there's no need to do anything.
319 // Bindings also work with whatever the expected type is,
320 // and moreover if we peel references off, that will give us the wrong binding type.
321 // Also, we can have a subpattern `binding @ pat`.
322 // Each side of the `@` should be treated independently (like with OR-patterns).
323 | PatKind
::Binding(..)
324 // An OR-pattern just propagates to each individual alternative.
325 // This is maximally flexible, allowing e.g., `Some(mut x) | &Some(mut x)`.
326 // In that example, `Some(mut x)` results in `Peel` whereas `&Some(mut x)` in `Reset`.
327 | PatKind
::Or(_
) => AdjustMode
::Pass
,
331 /// Peel off as many immediately nested `& mut?` from the expected type as possible
332 /// and return the new expected type and binding default binding mode.
333 /// The adjustments vector, if non-empty is stored in a table.
334 fn peel_off_references(
336 pat
: &'tcx Pat
<'tcx
>,
338 mut def_bm
: BindingMode
,
339 ) -> (Ty
<'tcx
>, BindingMode
) {
340 let mut expected
= self.resolve_vars_with_obligations(expected
);
342 // Peel off as many `&` or `&mut` from the scrutinee type as possible. For example,
343 // for `match &&&mut Some(5)` the loop runs three times, aborting when it reaches
344 // the `Some(5)` which is not of type Ref.
346 // For each ampersand peeled off, update the binding mode and push the original
347 // type into the adjustments vector.
349 // See the examples in `ui/match-defbm*.rs`.
350 let mut pat_adjustments
= vec
![];
351 while let ty
::Ref(_
, inner_ty
, inner_mutability
) = *expected
.kind() {
352 debug
!("inspecting {:?}", expected
);
354 debug
!("current discriminant is Ref, inserting implicit deref");
355 // Preserve the reference type. We'll need it later during THIR lowering.
356 pat_adjustments
.push(expected
);
359 def_bm
= ty
::BindByReference(match def_bm
{
360 // If default binding mode is by value, make it `ref` or `ref mut`
361 // (depending on whether we observe `&` or `&mut`).
363 // When `ref mut`, stay a `ref mut` (on `&mut`) or downgrade to `ref` (on `&`).
364 ty
::BindByReference(hir
::Mutability
::Mut
) => inner_mutability
,
365 // Once a `ref`, always a `ref`.
366 // This is because a `& &mut` cannot mutate the underlying value.
367 ty
::BindByReference(m @ hir
::Mutability
::Not
) => m
,
371 if !pat_adjustments
.is_empty() {
372 debug
!("default binding mode is now {:?}", def_bm
);
376 .pat_adjustments_mut()
377 .insert(pat
.hir_id
, pat_adjustments
);
386 lt
: &hir
::Expr
<'tcx
>,
390 // We've already computed the type above (when checking for a non-ref pat),
391 // so avoid computing it again.
392 let ty
= self.node_ty(lt
.hir_id
);
394 // Byte string patterns behave the same way as array patterns
395 // They can denote both statically and dynamically-sized byte arrays.
397 if let hir
::ExprKind
::Lit(Spanned { node: ast::LitKind::ByteStr(..), .. }
) = lt
.kind
{
398 let expected
= self.structurally_resolved_type(span
, expected
);
399 if let ty
::Ref(_
, inner_ty
, _
) = expected
.kind()
400 && matches
!(inner_ty
.kind(), ty
::Slice(_
))
403 trace
!(?lt
.hir_id
.local_id
, "polymorphic byte string lit");
406 .treat_byte_string_as_slice
407 .insert(lt
.hir_id
.local_id
);
408 pat_ty
= tcx
.mk_imm_ref(tcx
.lifetimes
.re_static
, tcx
.mk_slice(tcx
.types
.u8));
412 if self.tcx
.features().string_deref_patterns
&& let hir
::ExprKind
::Lit(Spanned { node: ast::LitKind::Str(..), .. }
) = lt
.kind
{
414 let expected
= self.resolve_vars_if_possible(expected
);
415 pat_ty
= match expected
.kind() {
416 ty
::Adt(def
, _
) if Some(def
.did()) == tcx
.lang_items().string() => expected
,
417 ty
::Str
=> tcx
.mk_static_str(),
422 // Somewhat surprising: in this case, the subtyping relation goes the
423 // opposite way as the other cases. Actually what we really want is not
424 // a subtyping relation at all but rather that there exists a LUB
425 // (so that they can be compared). However, in practice, constants are
426 // always scalars or strings. For scalars subtyping is irrelevant,
427 // and for strings `ty` is type is `&'static str`, so if we say that
429 // &'static str <: expected
431 // then that's equivalent to there existing a LUB.
432 let cause
= self.pattern_cause(ti
, span
);
433 if let Some(mut err
) = self.demand_suptype_with_origin(&cause
, expected
, pat_ty
) {
437 // In the case of `if`- and `while`-expressions we've already checked
438 // that `scrutinee: bool`. We know that the pattern is `true`,
439 // so an error here would be a duplicate and from the wrong POV.
440 s
.is_desugaring(DesugaringKind
::CondTemporary
)
452 lhs
: Option
<&'tcx hir
::Expr
<'tcx
>>,
453 rhs
: Option
<&'tcx hir
::Expr
<'tcx
>>,
457 let calc_side
= |opt_expr
: Option
<&'tcx hir
::Expr
<'tcx
>>| match opt_expr
{
460 let ty
= self.check_expr(expr
);
461 // Check that the end-point is possibly of numeric or char type.
462 // The early check here is not for correctness, but rather better
463 // diagnostics (e.g. when `&str` is being matched, `expected` will
464 // be peeled to `str` while ty here is still `&str`, if we don't
465 // err early here, a rather confusing unification error will be
468 !(ty
.is_numeric() || ty
.is_char() || ty
.is_ty_var() || ty
.references_error());
469 Some((fail
, ty
, expr
.span
))
472 let mut lhs
= calc_side(lhs
);
473 let mut rhs
= calc_side(rhs
);
475 if let (Some((true, ..)), _
) | (_
, Some((true, ..))) = (lhs
, rhs
) {
476 // There exists a side that didn't meet our criteria that the end-point
477 // be of a numeric or char type, as checked in `calc_side` above.
478 let guar
= self.emit_err_pat_range(span
, lhs
, rhs
);
479 return self.tcx
.ty_error(guar
);
482 // Unify each side with `expected`.
483 // Subtyping doesn't matter here, as the value is some kind of scalar.
484 let demand_eqtype
= |x
: &mut _
, y
| {
485 if let Some((ref mut fail
, x_ty
, x_span
)) = *x
486 && let Some(mut err
) = self.demand_eqtype_pat_diag(x_span
, expected
, x_ty
, ti
)
488 if let Some((_
, y_ty
, y_span
)) = y
{
489 self.endpoint_has_type(&mut err
, y_span
, y_ty
);
495 demand_eqtype(&mut lhs
, rhs
);
496 demand_eqtype(&mut rhs
, lhs
);
498 if let (Some((true, ..)), _
) | (_
, Some((true, ..))) = (lhs
, rhs
) {
499 return self.tcx
.ty_error_misc();
502 // Find the unified type and check if it's of numeric or char type again.
503 // This check is needed if both sides are inference variables.
504 // We require types to be resolved here so that we emit inference failure
505 // rather than "_ is not a char or numeric".
506 let ty
= self.structurally_resolved_type(span
, expected
);
507 if !(ty
.is_numeric() || ty
.is_char() || ty
.references_error()) {
508 if let Some((ref mut fail
, _
, _
)) = lhs
{
511 if let Some((ref mut fail
, _
, _
)) = rhs
{
514 let guar
= self.emit_err_pat_range(span
, lhs
, rhs
);
515 return self.tcx
.ty_error(guar
);
520 fn endpoint_has_type(&self, err
: &mut Diagnostic
, span
: Span
, ty
: Ty
<'_
>) {
521 if !ty
.references_error() {
522 err
.span_label(span
, &format
!("this is of type `{}`", ty
));
526 fn emit_err_pat_range(
529 lhs
: Option
<(bool
, Ty
<'tcx
>, Span
)>,
530 rhs
: Option
<(bool
, Ty
<'tcx
>, Span
)>,
531 ) -> ErrorGuaranteed
{
532 let span
= match (lhs
, rhs
) {
533 (Some((true, ..)), Some((true, ..))) => span
,
534 (Some((true, _
, sp
)), _
) => sp
,
535 (_
, Some((true, _
, sp
))) => sp
,
536 _
=> span_bug
!(span
, "emit_err_pat_range: no side failed or exists but still error?"),
538 let mut err
= struct_span_err
!(
542 "only `char` and numeric types are allowed in range patterns"
545 let ty
= self.resolve_vars_if_possible(ty
);
546 format
!("this is of type `{}` but it should be `char` or numeric", ty
)
548 let mut one_side_err
= |first_span
, first_ty
, second
: Option
<(bool
, Ty
<'tcx
>, Span
)>| {
549 err
.span_label(first_span
, &msg(first_ty
));
550 if let Some((_
, ty
, sp
)) = second
{
551 let ty
= self.resolve_vars_if_possible(ty
);
552 self.endpoint_has_type(&mut err
, sp
, ty
);
556 (Some((true, lhs_ty
, lhs_sp
)), Some((true, rhs_ty
, rhs_sp
))) => {
557 err
.span_label(lhs_sp
, &msg(lhs_ty
));
558 err
.span_label(rhs_sp
, &msg(rhs_ty
));
560 (Some((true, lhs_ty
, lhs_sp
)), rhs
) => one_side_err(lhs_sp
, lhs_ty
, rhs
),
561 (lhs
, Some((true, rhs_ty
, rhs_sp
))) => one_side_err(rhs_sp
, rhs_ty
, lhs
),
562 _
=> span_bug
!(span
, "Impossible, verified above."),
564 if (lhs
, rhs
).references_error() {
565 err
.downgrade_to_delayed_bug();
567 if self.tcx
.sess
.teach(&err
.get_code().unwrap()) {
569 "In a match expression, only numbers and characters can be matched \
570 against a range. This is because the compiler checks that the range \
571 is non-empty at compile-time, and is unable to evaluate arbitrary \
572 comparison functions. If you want to capture values of an orderable \
573 type between two end-points, you can use a guard.",
581 pat
: &'tcx Pat
<'tcx
>,
582 ba
: hir
::BindingAnnotation
,
584 sub
: Option
<&'tcx Pat
<'tcx
>>,
589 // Determine the binding mode...
591 hir
::BindingAnnotation
::NONE
=> def_bm
,
592 _
=> BindingMode
::convert(ba
),
594 // ...and store it in a side table:
595 self.inh
.typeck_results
.borrow_mut().pat_binding_modes_mut().insert(pat
.hir_id
, bm
);
597 debug
!("check_pat_ident: pat.hir_id={:?} bm={:?}", pat
.hir_id
, bm
);
599 let local_ty
= self.local_ty(pat
.span
, pat
.hir_id
).decl_ty
;
600 let eq_ty
= match bm
{
601 ty
::BindByReference(mutbl
) => {
602 // If the binding is like `ref x | ref mut x`,
603 // then `x` is assigned a value of type `&M T` where M is the
604 // mutability and T is the expected type.
606 // `x` is assigned a value of type `&M T`, hence `&M T <: typeof(x)`
607 // is required. However, we use equality, which is stronger.
608 // See (note_1) for an explanation.
609 self.new_ref_ty(pat
.span
, mutbl
, expected
)
611 // Otherwise, the type of x is the expected type `T`.
612 ty
::BindByValue(_
) => {
613 // As above, `T <: typeof(x)` is required, but we use equality, see (note_1).
617 self.demand_eqtype_pat(pat
.span
, eq_ty
, local_ty
, ti
);
619 // If there are multiple arms, make sure they all agree on
620 // what the type of the binding `x` ought to be.
621 if var_id
!= pat
.hir_id
{
622 self.check_binding_alt_eq_ty(ba
, pat
.span
, var_id
, local_ty
, ti
);
625 if let Some(p
) = sub
{
626 self.check_pat(p
, expected
, def_bm
, ti
);
632 fn check_binding_alt_eq_ty(
634 ba
: hir
::BindingAnnotation
,
640 let var_ty
= self.local_ty(span
, var_id
).decl_ty
;
641 if let Some(mut err
) = self.demand_eqtype_pat_diag(span
, var_ty
, ty
, ti
) {
642 let hir
= self.tcx
.hir();
643 let var_ty
= self.resolve_vars_with_obligations(var_ty
);
644 let msg
= format
!("first introduced with type `{var_ty}` here");
645 err
.span_label(hir
.span(var_id
), msg
);
646 let in_match
= hir
.parent_iter(var_id
).any(|(_
, n
)| {
649 hir
::Node
::Expr(hir
::Expr
{
650 kind
: hir
::ExprKind
::Match(.., hir
::MatchSource
::Normal
),
655 let pre
= if in_match { "in the same arm, " }
else { "" }
;
656 err
.note(&format
!("{}a binding must have the same type in all alternatives", pre
));
657 self.suggest_adding_missing_ref_or_removing_ref(
661 self.resolve_vars_with_obligations(ty
),
668 fn suggest_adding_missing_ref_or_removing_ref(
670 err
: &mut Diagnostic
,
674 ba
: hir
::BindingAnnotation
,
676 match (expected
.kind(), actual
.kind(), ba
) {
677 (ty
::Ref(_
, inner_ty
, _
), _
, hir
::BindingAnnotation
::NONE
)
678 if self.can_eq(self.param_env
, *inner_ty
, actual
) =>
680 err
.span_suggestion_verbose(
682 "consider adding `ref`",
684 Applicability
::MaybeIncorrect
,
687 (_
, ty
::Ref(_
, inner_ty
, _
), hir
::BindingAnnotation
::REF
)
688 if self.can_eq(self.param_env
, expected
, *inner_ty
) =>
690 err
.span_suggestion_verbose(
691 span
.with_hi(span
.lo() + BytePos(4)),
692 "consider removing `ref`",
694 Applicability
::MaybeIncorrect
,
701 // Precondition: pat is a Ref(_) pattern
702 fn borrow_pat_suggestion(&self, err
: &mut Diagnostic
, pat
: &Pat
<'_
>) {
704 if let PatKind
::Ref(inner
, mutbl
) = pat
.kind
705 && let PatKind
::Binding(_
, _
, binding
, ..) = inner
.kind
{
706 let binding_parent_id
= tcx
.hir().parent_id(pat
.hir_id
);
707 let binding_parent
= tcx
.hir().get(binding_parent_id
);
708 debug
!(?inner
, ?pat
, ?binding_parent
);
710 let mutability
= match mutbl
{
711 ast
::Mutability
::Mut
=> "mut",
712 ast
::Mutability
::Not
=> "",
715 let mut_var_suggestion
= 'block
: {
720 let ident_kind
= match binding_parent
{
721 hir
::Node
::Param(_
) => "parameter",
722 hir
::Node
::Local(_
) => "variable",
723 hir
::Node
::Arm(_
) => "binding",
725 // Provide diagnostics only if the parent pattern is struct-like,
726 // i.e. where `mut binding` makes sense
727 hir
::Node
::Pat(Pat { kind, .. }
) => match kind
{
729 | PatKind
::TupleStruct(..)
732 | PatKind
::Slice(..) => "binding",
735 | PatKind
::Binding(..)
740 | PatKind
::Range(..) => break 'block None
,
743 // Don't provide suggestions in other cases
744 _
=> break 'block None
,
749 format
!("to declare a mutable {ident_kind} use"),
750 format
!("mut {binding}"),
755 match binding_parent
{
756 // Check that there is explicit type (ie this is not a closure param with inferred type)
757 // so we don't suggest moving something to the type that does not exist
758 hir
::Node
::Param(hir
::Param { ty_span, .. }
) if binding
.span
!= *ty_span
=> {
759 err
.multipart_suggestion_verbose(
760 format
!("to take parameter `{binding}` by reference, move `&{mutability}` to the type"),
762 (pat
.span
.until(inner
.span
), "".to_owned()),
763 (ty_span
.shrink_to_lo(), mutbl
.ref_prefix_str().to_owned()),
765 Applicability
::MachineApplicable
768 if let Some((sp
, msg
, sugg
)) = mut_var_suggestion
{
769 err
.span_note(sp
, format
!("{msg}: `{sugg}`"));
772 hir
::Node
::Pat(pt
) if let PatKind
::TupleStruct(_
, pat_arr
, _
) = pt
.kind
=> {
773 for i
in pat_arr
.iter() {
774 if let PatKind
::Ref(the_ref
, _
) = i
.kind
775 && let PatKind
::Binding(mt
, _
, ident
, _
) = the_ref
.kind
{
776 let hir
::BindingAnnotation(_
, mtblty
) = mt
;
777 err
.span_suggestion_verbose(
779 format
!("consider removing `&{mutability}` from the pattern"),
780 mtblty
.prefix_str().to_string() + &ident
.name
.to_string(),
781 Applicability
::MaybeIncorrect
,
785 if let Some((sp
, msg
, sugg
)) = mut_var_suggestion
{
786 err
.span_note(sp
, format
!("{msg}: `{sugg}`"));
789 hir
::Node
::Param(_
) | hir
::Node
::Arm(_
) | hir
::Node
::Pat(_
) => {
790 // rely on match ergonomics or it might be nested `&&pat`
791 err
.span_suggestion_verbose(
792 pat
.span
.until(inner
.span
),
793 format
!("consider removing `&{mutability}` from the pattern"),
795 Applicability
::MaybeIncorrect
,
798 if let Some((sp
, msg
, sugg
)) = mut_var_suggestion
{
799 err
.span_note(sp
, format
!("{msg}: `{sugg}`"));
802 _
if let Some((sp
, msg
, sugg
)) = mut_var_suggestion
=> {
803 err
.span_suggestion(sp
, msg
, sugg
, Applicability
::MachineApplicable
);
805 _
=> {}
// don't provide suggestions in other cases #55175
810 pub fn check_dereferenceable(
815 ) -> Result
<(), ErrorGuaranteed
> {
816 if let PatKind
::Binding(..) = inner
.kind
817 && let Some(mt
) = self.shallow_resolve(expected
).builtin_deref(true)
818 && let ty
::Dynamic(..) = mt
.ty
.kind()
820 // This is "x = SomeTrait" being reduced from
821 // "let &x = &SomeTrait" or "let box x = Box<SomeTrait>", an error.
822 let type_str
= self.ty_to_string(expected
);
823 let mut err
= struct_span_err
!(
827 "type `{}` cannot be dereferenced",
830 err
.span_label(span
, format
!("type `{type_str}` cannot be dereferenced"));
831 if self.tcx
.sess
.teach(&err
.get_code().unwrap()) {
832 err
.note(CANNOT_IMPLICITLY_DEREF_POINTER_TRAIT_OBJ
);
834 return Err(err
.emit());
841 pat
: &'tcx Pat
<'tcx
>,
842 qpath
: &hir
::QPath
<'_
>,
843 fields
: &'tcx
[hir
::PatField
<'tcx
>],
849 // Resolve the path and check the definition for errors.
850 let (variant
, pat_ty
) = match self.check_struct_path(qpath
, pat
.hir_id
) {
853 let err
= self.tcx
.ty_error(guar
);
854 for field
in fields
{
856 self.check_pat(field
.pat
, err
, def_bm
, ti
);
862 // Type-check the path.
863 self.demand_eqtype_pat(pat
.span
, expected
, pat_ty
, ti
);
865 // Type-check subpatterns.
866 if self.check_struct_pat_fields(pat_ty
, &pat
, variant
, fields
, has_rest_pat
, def_bm
, ti
) {
869 self.tcx
.ty_error_misc()
876 qpath
: &hir
::QPath
<'_
>,
877 path_resolution
: (Res
, Option
<RawTy
<'tcx
>>, &'tcx
[hir
::PathSegment
<'tcx
>]),
883 // We have already resolved the path.
884 let (res
, opt_ty
, segments
) = path_resolution
;
887 let e
= tcx
.sess
.delay_span_bug(qpath
.span(), "`Res::Err` but no error emitted");
888 self.set_tainted_by_errors(e
);
889 return tcx
.ty_error(e
);
891 Res
::Def(DefKind
::AssocFn
| DefKind
::Ctor(_
, CtorKind
::Fn
) | DefKind
::Variant
, _
) => {
892 let expected
= "unit struct, unit variant or constant";
893 let e
= report_unexpected_variant_res(tcx
, res
, qpath
, pat
.span
, "E0533", expected
);
894 return tcx
.ty_error(e
);
898 DefKind
::Ctor(_
, CtorKind
::Const
)
900 | DefKind
::AssocConst
901 | DefKind
::ConstParam
,
904 _
=> bug
!("unexpected pattern resolution: {:?}", res
),
907 // Type-check the path.
908 let (pat_ty
, pat_res
) =
909 self.instantiate_value_path(segments
, opt_ty
, res
, pat
.span
, pat
.hir_id
);
911 self.demand_suptype_with_origin(&self.pattern_cause(ti
, pat
.span
), expected
, pat_ty
)
913 self.emit_bad_pat_path(err
, pat
, res
, pat_res
, pat_ty
, segments
);
918 fn maybe_suggest_range_literal(
921 opt_def_id
: Option
<hir
::def_id
::DefId
>,
925 Some(def_id
) => match self.tcx
.hir().get_if_local(def_id
) {
926 Some(hir
::Node
::Item(hir
::Item
{
927 kind
: hir
::ItemKind
::Const(_
, body_id
), ..
928 })) => match self.tcx
.hir().get(body_id
.hir_id
) {
929 hir
::Node
::Expr(expr
) => {
930 if hir
::is_range_literal(expr
) {
931 let span
= self.tcx
.hir().span(body_id
.hir_id
);
932 if let Ok(snip
) = self.tcx
.sess
.source_map().span_to_snippet(span
) {
933 e
.span_suggestion_verbose(
935 "you may want to move the range into the match block",
937 Applicability
::MachineApplicable
,
952 fn emit_bad_pat_path(
954 mut e
: DiagnosticBuilder
<'_
, ErrorGuaranteed
>,
955 pat
: &hir
::Pat
<'tcx
>,
959 segments
: &'tcx
[hir
::PathSegment
<'tcx
>],
961 let pat_span
= pat
.span
;
962 if let Some(span
) = self.tcx
.hir().res_span(pat_res
) {
963 e
.span_label(span
, &format
!("{} defined here", res
.descr()));
964 if let [hir
::PathSegment { ident, .. }
] = &*segments
{
968 "`{}` is interpreted as {} {}, not a new binding",
974 match self.tcx
.hir().get_parent(pat
.hir_id
) {
975 hir
::Node
::PatField(..) => {
976 e
.span_suggestion_verbose(
977 ident
.span
.shrink_to_hi(),
978 "bind the struct field to a different name instead",
979 format
!(": other_{}", ident
.as_str().to_lowercase()),
980 Applicability
::HasPlaceholders
,
984 let (type_def_id
, item_def_id
) = match pat_ty
.kind() {
985 Adt(def
, _
) => match res
{
986 Res
::Def(DefKind
::Const
, def_id
) => (Some(def
.did()), Some(def_id
)),
993 self.tcx
.lang_items().range_struct(),
994 self.tcx
.lang_items().range_from_struct(),
995 self.tcx
.lang_items().range_to_struct(),
996 self.tcx
.lang_items().range_full_struct(),
997 self.tcx
.lang_items().range_inclusive_struct(),
998 self.tcx
.lang_items().range_to_inclusive_struct(),
1000 if type_def_id
!= None
&& ranges
.contains(&type_def_id
) {
1001 if !self.maybe_suggest_range_literal(&mut e
, item_def_id
, *ident
) {
1002 let msg
= "constants only support matching by type, \
1003 if you meant to match against a range of values, \
1004 consider using a range pattern like `min ..= max` in the match block";
1008 let msg
= "introduce a new binding instead";
1009 let sugg
= format
!("other_{}", ident
.as_str().to_lowercase());
1014 Applicability
::HasPlaceholders
,
1024 fn check_pat_tuple_struct(
1026 pat
: &'tcx Pat
<'tcx
>,
1027 qpath
: &'tcx hir
::QPath
<'tcx
>,
1028 subpats
: &'tcx
[Pat
<'tcx
>],
1029 ddpos
: hir
::DotDotPos
,
1031 def_bm
: BindingMode
,
1035 let on_error
= |e
| {
1036 for pat
in subpats
{
1037 self.check_pat(pat
, tcx
.ty_error(e
), def_bm
, ti
);
1040 let report_unexpected_res
= |res
: Res
| {
1041 let expected
= "tuple struct or tuple variant";
1042 let e
= report_unexpected_variant_res(tcx
, res
, qpath
, pat
.span
, "E0164", expected
);
1047 // Resolve the path and check the definition for errors.
1048 let (res
, opt_ty
, segments
) =
1049 self.resolve_ty_and_res_fully_qualified_call(qpath
, pat
.hir_id
, pat
.span
);
1050 if res
== Res
::Err
{
1051 let e
= tcx
.sess
.delay_span_bug(pat
.span
, "`Res::Err` but no error emitted");
1052 self.set_tainted_by_errors(e
);
1054 return tcx
.ty_error(e
);
1057 // Type-check the path.
1059 self.instantiate_value_path(segments
, opt_ty
, res
, pat
.span
, pat
.hir_id
);
1060 if !pat_ty
.is_fn() {
1061 let e
= report_unexpected_res(res
);
1062 return tcx
.ty_error(e
);
1065 let variant
= match res
{
1067 let e
= tcx
.sess
.delay_span_bug(pat
.span
, "`Res::Err` but no error emitted");
1068 self.set_tainted_by_errors(e
);
1070 return tcx
.ty_error(e
);
1072 Res
::Def(DefKind
::AssocConst
| DefKind
::AssocFn
, _
) => {
1073 let e
= report_unexpected_res(res
);
1074 return tcx
.ty_error(e
);
1076 Res
::Def(DefKind
::Ctor(_
, CtorKind
::Fn
), _
) => tcx
.expect_variant_res(res
),
1077 _
=> bug
!("unexpected pattern resolution: {:?}", res
),
1080 // Replace constructor type with constructed type for tuple struct patterns.
1081 let pat_ty
= pat_ty
.fn_sig(tcx
).output();
1082 let pat_ty
= pat_ty
.no_bound_vars().expect("expected fn type");
1084 // Type-check the tuple struct pattern against the expected type.
1085 let diag
= self.demand_eqtype_pat_diag(pat
.span
, expected
, pat_ty
, ti
);
1086 let had_err
= if let Some(mut err
) = diag
{
1093 // Type-check subpatterns.
1094 if subpats
.len() == variant
.fields
.len()
1095 || subpats
.len() < variant
.fields
.len() && ddpos
.as_opt_usize().is_some()
1097 let ty
::Adt(_
, substs
) = pat_ty
.kind() else {
1098 bug
!("unexpected pattern type {:?}", pat_ty
);
1100 for (i
, subpat
) in subpats
.iter().enumerate_and_adjust(variant
.fields
.len(), ddpos
) {
1101 let field_ty
= self.field_ty(subpat
.span
, &variant
.fields
[i
], substs
);
1102 self.check_pat(subpat
, field_ty
, def_bm
, ti
);
1104 self.tcx
.check_stability(
1105 variant
.fields
[i
].did
,
1112 // Pattern has wrong number of fields.
1113 let e
= self.e0023(pat
.span
, res
, qpath
, subpats
, &variant
.fields
, expected
, had_err
);
1115 return tcx
.ty_error(e
);
1124 qpath
: &hir
::QPath
<'_
>,
1125 subpats
: &'tcx
[Pat
<'tcx
>],
1126 fields
: &'tcx
[ty
::FieldDef
],
1129 ) -> ErrorGuaranteed
{
1130 let subpats_ending
= pluralize
!(subpats
.len());
1131 let fields_ending
= pluralize
!(fields
.len());
1133 let subpat_spans
= if subpats
.is_empty() {
1136 subpats
.iter().map(|p
| p
.span
).collect()
1138 let last_subpat_span
= *subpat_spans
.last().unwrap();
1139 let res_span
= self.tcx
.def_span(res
.def_id());
1140 let def_ident_span
= self.tcx
.def_ident_span(res
.def_id()).unwrap_or(res_span
);
1141 let field_def_spans
= if fields
.is_empty() {
1144 fields
.iter().map(|f
| f
.ident(self.tcx
).span
).collect()
1146 let last_field_def_span
= *field_def_spans
.last().unwrap();
1148 let mut err
= struct_span_err
!(
1150 MultiSpan
::from_spans(subpat_spans
),
1152 "this pattern has {} field{}, but the corresponding {} has {} field{}",
1161 &format
!("expected {} field{}, found {}", fields
.len(), fields_ending
, subpats
.len()),
1163 if self.tcx
.sess
.source_map().is_multiline(qpath
.span().between(last_subpat_span
)) {
1164 err
.span_label(qpath
.span(), "");
1166 if self.tcx
.sess
.source_map().is_multiline(def_ident_span
.between(last_field_def_span
)) {
1167 err
.span_label(def_ident_span
, format
!("{} defined here", res
.descr()));
1169 for span
in &field_def_spans
[..field_def_spans
.len() - 1] {
1170 err
.span_label(*span
, "");
1173 last_field_def_span
,
1174 &format
!("{} has {} field{}", res
.descr(), fields
.len(), fields_ending
),
1177 // Identify the case `Some(x, y)` where the expected type is e.g. `Option<(T, U)>`.
1178 // More generally, the expected type wants a tuple variant with one field of an
1179 // N-arity-tuple, e.g., `V_i((p_0, .., p_N))`. Meanwhile, the user supplied a pattern
1180 // with the subpatterns directly in the tuple variant pattern, e.g., `V_i(p_0, .., p_N)`.
1181 let missing_parentheses
= match (&expected
.kind(), fields
, had_err
) {
1182 // #67037: only do this if we could successfully type-check the expected type against
1183 // the tuple struct pattern. Otherwise the substs could get out of range on e.g.,
1184 // `let P() = U;` where `P != U` with `struct P<T>(T);`.
1185 (ty
::Adt(_
, substs
), [field
], false) => {
1186 let field_ty
= self.field_ty(pat_span
, field
, substs
);
1187 match field_ty
.kind() {
1188 ty
::Tuple(fields
) => fields
.len() == subpats
.len(),
1194 if missing_parentheses
{
1195 let (left
, right
) = match subpats
{
1196 // This is the zero case; we aim to get the "hi" part of the `QPath`'s
1197 // span as the "lo" and then the "hi" part of the pattern's span as the "hi".
1200 // help: missing parentheses
1202 // L | let A(()) = A(());
1204 [] => (qpath
.span().shrink_to_hi(), pat_span
),
1205 // Easy case. Just take the "lo" of the first sub-pattern and the "hi" of the
1206 // last sub-pattern. In the case of `A(x)` the first and last may coincide.
1209 // help: missing parentheses
1211 // L | let A((x, y)) = A((1, 2));
1213 [first
, ..] => (first
.span
.shrink_to_lo(), subpats
.last().unwrap().span
),
1215 err
.multipart_suggestion(
1216 "missing parentheses",
1217 vec
![(left
, "(".to_string()), (right
.shrink_to_hi(), ")".to_string())],
1218 Applicability
::MachineApplicable
,
1220 } else if fields
.len() > subpats
.len() && pat_span
!= DUMMY_SP
{
1221 let after_fields_span
= pat_span
.with_hi(pat_span
.hi() - BytePos(1)).shrink_to_hi();
1222 let all_fields_span
= match subpats
{
1223 [] => after_fields_span
,
1224 [field
] => field
.span
,
1225 [first
, .., last
] => first
.span
.to(last
.span
),
1228 // Check if all the fields in the pattern are wildcards.
1229 let all_wildcards
= subpats
.iter().all(|pat
| matches
!(pat
.kind
, PatKind
::Wild
));
1230 let first_tail_wildcard
=
1231 subpats
.iter().enumerate().fold(None
, |acc
, (pos
, pat
)| match (acc
, &pat
.kind
) {
1232 (None
, PatKind
::Wild
) => Some(pos
),
1233 (Some(_
), PatKind
::Wild
) => acc
,
1236 let tail_span
= match first_tail_wildcard
{
1237 None
=> after_fields_span
,
1238 Some(0) => subpats
[0].span
.to(after_fields_span
),
1239 Some(pos
) => subpats
[pos
- 1].span
.shrink_to_hi().to(after_fields_span
),
1242 // FIXME: heuristic-based suggestion to check current types for where to add `_`.
1243 let mut wildcard_sugg
= vec
!["_"; fields
.len() - subpats
.len()].join(", ");
1244 if !subpats
.is_empty() {
1245 wildcard_sugg
= String
::from(", ") + &wildcard_sugg
;
1248 err
.span_suggestion_verbose(
1250 "use `_` to explicitly ignore each field",
1252 Applicability
::MaybeIncorrect
,
1255 // Only suggest `..` if more than one field is missing
1256 // or the pattern consists of all wildcards.
1257 if fields
.len() - subpats
.len() > 1 || all_wildcards
{
1258 if subpats
.is_empty() || all_wildcards
{
1259 err
.span_suggestion_verbose(
1261 "use `..` to ignore all fields",
1263 Applicability
::MaybeIncorrect
,
1266 err
.span_suggestion_verbose(
1268 "use `..` to ignore the rest of the fields",
1270 Applicability
::MaybeIncorrect
,
1282 elements
: &'tcx
[Pat
<'tcx
>],
1283 ddpos
: hir
::DotDotPos
,
1285 def_bm
: BindingMode
,
1289 let mut expected_len
= elements
.len();
1290 if ddpos
.as_opt_usize().is_some() {
1291 // Require known type only when `..` is present.
1292 if let ty
::Tuple(tys
) = self.structurally_resolved_type(span
, expected
).kind() {
1293 expected_len
= tys
.len();
1296 let max_len
= cmp
::max(expected_len
, elements
.len());
1298 let element_tys_iter
= (0..max_len
).map(|_
| {
1300 // FIXME: `MiscVariable` for now -- obtaining the span and name information
1301 // from all tuple elements isn't trivial.
1302 TypeVariableOrigin { kind: TypeVariableOriginKind::TypeInference, span }
,
1305 let element_tys
= tcx
.mk_type_list_from_iter(element_tys_iter
);
1306 let pat_ty
= tcx
.mk_tup(element_tys
);
1307 if let Some(mut err
) = self.demand_eqtype_pat_diag(span
, expected
, pat_ty
, ti
) {
1308 let reported
= err
.emit();
1309 // Walk subpatterns with an expected type of `err` in this case to silence
1310 // further errors being emitted when using the bindings. #50333
1311 let element_tys_iter
= (0..max_len
).map(|_
| tcx
.ty_error(reported
));
1312 for (_
, elem
) in elements
.iter().enumerate_and_adjust(max_len
, ddpos
) {
1313 self.check_pat(elem
, tcx
.ty_error(reported
), def_bm
, ti
);
1315 tcx
.mk_tup_from_iter(element_tys_iter
)
1317 for (i
, elem
) in elements
.iter().enumerate_and_adjust(max_len
, ddpos
) {
1318 self.check_pat(elem
, element_tys
[i
], def_bm
, ti
);
1324 fn check_struct_pat_fields(
1327 pat
: &'tcx Pat
<'tcx
>,
1328 variant
: &'tcx ty
::VariantDef
,
1329 fields
: &'tcx
[hir
::PatField
<'tcx
>],
1331 def_bm
: BindingMode
,
1336 let ty
::Adt(adt
, substs
) = adt_ty
.kind() else {
1337 span_bug
!(pat
.span
, "struct pattern is not an ADT");
1340 // Index the struct fields' types.
1341 let field_map
= variant
1345 .map(|(i
, field
)| (field
.ident(self.tcx
).normalize_to_macros_2_0(), (i
, field
)))
1346 .collect
::<FxHashMap
<_
, _
>>();
1348 // Keep track of which fields have already appeared in the pattern.
1349 let mut used_fields
= FxHashMap
::default();
1350 let mut no_field_errors
= true;
1352 let mut inexistent_fields
= vec
![];
1353 // Typecheck each field.
1354 for field
in fields
{
1355 let span
= field
.span
;
1356 let ident
= tcx
.adjust_ident(field
.ident
, variant
.def_id
);
1357 let field_ty
= match used_fields
.entry(ident
) {
1358 Occupied(occupied
) => {
1359 no_field_errors
= false;
1360 let guar
= self.error_field_already_bound(span
, field
.ident
, *occupied
.get());
1364 vacant
.insert(span
);
1368 self.write_field_index(field
.hir_id
, *i
);
1369 self.tcx
.check_stability(f
.did
, Some(pat
.hir_id
), span
, None
);
1370 self.field_ty(span
, f
, substs
)
1372 .unwrap_or_else(|| {
1373 inexistent_fields
.push(field
);
1374 no_field_errors
= false;
1380 self.check_pat(field
.pat
, field_ty
, def_bm
, ti
);
1383 let mut unmentioned_fields
= variant
1386 .map(|field
| (field
, field
.ident(self.tcx
).normalize_to_macros_2_0()))
1387 .filter(|(_
, ident
)| !used_fields
.contains_key(ident
))
1388 .collect
::<Vec
<_
>>();
1390 let inexistent_fields_err
= if !(inexistent_fields
.is_empty() || variant
.is_recovered())
1391 && !inexistent_fields
.iter().any(|field
| field
.ident
.name
== kw
::Underscore
)
1393 Some(self.error_inexistent_fields(
1394 adt
.variant_descr(),
1396 &mut unmentioned_fields
,
1404 // Require `..` if struct has non_exhaustive attribute.
1405 let non_exhaustive
= variant
.is_field_list_non_exhaustive() && !adt
.did().is_local();
1406 if non_exhaustive
&& !has_rest_pat
{
1407 self.error_foreign_non_exhaustive_spat(pat
, adt
.variant_descr(), fields
.is_empty());
1410 let mut unmentioned_err
= None
;
1411 // Report an error if an incorrect number of fields was specified.
1413 if fields
.len() != 1 {
1415 .struct_span_err(pat
.span
, "union patterns should have exactly one field")
1419 tcx
.sess
.struct_span_err(pat
.span
, "`..` cannot be used in union patterns").emit();
1421 } else if !unmentioned_fields
.is_empty() {
1422 let accessible_unmentioned_fields
: Vec
<_
> = unmentioned_fields
1425 .filter(|(field
, _
)| {
1426 field
.vis
.is_accessible_from(tcx
.parent_module(pat
.hir_id
), tcx
)
1428 tcx
.eval_stability(field
.did
, None
, DUMMY_SP
, None
),
1429 EvalResult
::Deny { .. }
1431 // We only want to report the error if it is hidden and not local
1432 && !(tcx
.is_doc_hidden(field
.did
) && !field
.did
.is_local())
1437 if accessible_unmentioned_fields
.is_empty() {
1438 unmentioned_err
= Some(self.error_no_accessible_fields(pat
, fields
));
1440 unmentioned_err
= Some(self.error_unmentioned_fields(
1442 &accessible_unmentioned_fields
,
1443 accessible_unmentioned_fields
.len() != unmentioned_fields
.len(),
1447 } else if non_exhaustive
&& !accessible_unmentioned_fields
.is_empty() {
1448 self.lint_non_exhaustive_omitted_patterns(
1450 &accessible_unmentioned_fields
,
1455 match (inexistent_fields_err
, unmentioned_err
) {
1456 (Some(mut i
), Some(mut u
)) => {
1457 if let Some(mut e
) = self.error_tuple_variant_as_struct_pat(pat
, fields
, variant
) {
1458 // We don't want to show the nonexistent fields error when this was
1459 // `Foo { a, b }` when it should have been `Foo(a, b)`.
1468 (None
, Some(mut u
)) => {
1469 if let Some(mut e
) = self.error_tuple_variant_as_struct_pat(pat
, fields
, variant
) {
1476 (Some(mut err
), None
) => {
1479 (None
, None
) if let Some(mut err
) =
1480 self.error_tuple_variant_index_shorthand(variant
, pat
, fields
) =>
1489 fn error_tuple_variant_index_shorthand(
1491 variant
: &VariantDef
,
1493 fields
: &[hir
::PatField
<'_
>],
1494 ) -> Option
<DiagnosticBuilder
<'_
, ErrorGuaranteed
>> {
1495 // if this is a tuple struct, then all field names will be numbers
1496 // so if any fields in a struct pattern use shorthand syntax, they will
1497 // be invalid identifiers (for example, Foo { 0, 1 }).
1498 if let (Some(CtorKind
::Fn
), PatKind
::Struct(qpath
, field_patterns
, ..)) =
1499 (variant
.ctor_kind(), &pat
.kind
)
1501 let has_shorthand_field_name
= field_patterns
.iter().any(|field
| field
.is_shorthand
);
1502 if has_shorthand_field_name
{
1503 let path
= rustc_hir_pretty
::to_string(rustc_hir_pretty
::NO_ANN
, |s
| {
1504 s
.print_qpath(qpath
, false)
1506 let mut err
= struct_span_err
!(
1510 "tuple variant `{path}` written as struct variant",
1512 err
.span_suggestion_verbose(
1513 qpath
.span().shrink_to_hi().to(pat
.span
.shrink_to_hi()),
1514 "use the tuple variant pattern syntax instead",
1515 format
!("({})", self.get_suggested_tuple_struct_pattern(fields
, variant
)),
1516 Applicability
::MaybeIncorrect
,
1524 fn error_foreign_non_exhaustive_spat(&self, pat
: &Pat
<'_
>, descr
: &str, no_fields
: bool
) {
1525 let sess
= self.tcx
.sess
;
1526 let sm
= sess
.source_map();
1527 let sp_brace
= sm
.end_point(pat
.span
);
1528 let sp_comma
= sm
.end_point(pat
.span
.with_hi(sp_brace
.hi()));
1529 let sugg
= if no_fields
|| sp_brace
!= sp_comma { ".. }
" } else { ", .. }" };
1531 let mut err
= struct_span_err
!(
1535 "`..` required with {descr} marked as non-exhaustive",
1537 err
.span_suggestion_verbose(
1539 "add `..` at the end of the field list to ignore all other fields",
1541 Applicability
::MachineApplicable
,
1546 fn error_field_already_bound(
1551 ) -> ErrorGuaranteed
{
1556 "field `{}` bound multiple times in the pattern",
1559 .span_label(span
, format
!("multiple uses of `{ident}` in pattern"))
1560 .span_label(other_field
, format
!("first use of `{ident}`"))
1564 fn error_inexistent_fields(
1567 inexistent_fields
: &[&hir
::PatField
<'tcx
>],
1568 unmentioned_fields
: &mut Vec
<(&'tcx ty
::FieldDef
, Ident
)>,
1569 variant
: &ty
::VariantDef
,
1570 substs
: &'tcx ty
::List
<ty
::subst
::GenericArg
<'tcx
>>,
1571 ) -> DiagnosticBuilder
<'tcx
, ErrorGuaranteed
> {
1573 let (field_names
, t
, plural
) = if inexistent_fields
.len() == 1 {
1574 (format
!("a field named `{}`", inexistent_fields
[0].ident
), "this", "")
1581 .map(|field
| format
!("`{}`", field
.ident
))
1582 .collect
::<Vec
<String
>>()
1589 let spans
= inexistent_fields
.iter().map(|field
| field
.ident
.span
).collect
::<Vec
<_
>>();
1590 let mut err
= struct_span_err
!(
1594 "{} `{}` does not have {}",
1596 tcx
.def_path_str(variant
.def_id
),
1599 if let Some(pat_field
) = inexistent_fields
.last() {
1601 pat_field
.ident
.span
,
1603 "{} `{}` does not have {} field{}",
1605 tcx
.def_path_str(variant
.def_id
),
1611 if unmentioned_fields
.len() == 1 {
1613 unmentioned_fields
.iter().map(|(_
, field
)| field
.name
).collect
::<Vec
<_
>>();
1614 let suggested_name
= find_best_match_for_name(&input
, pat_field
.ident
.name
, None
);
1615 if let Some(suggested_name
) = suggested_name
{
1616 err
.span_suggestion(
1617 pat_field
.ident
.span
,
1618 "a field with a similar name exists",
1620 Applicability
::MaybeIncorrect
,
1623 // When we have a tuple struct used with struct we don't want to suggest using
1624 // the (valid) struct syntax with numeric field names. Instead we want to
1625 // suggest the expected syntax. We infer that this is the case by parsing the
1626 // `Ident` into an unsized integer. The suggestion will be emitted elsewhere in
1627 // `smart_resolve_context_dependent_help`.
1628 if suggested_name
.to_ident_string().parse
::<usize>().is_err() {
1629 // We don't want to throw `E0027` in case we have thrown `E0026` for them.
1630 unmentioned_fields
.retain(|&(_
, x
)| x
.name
!= suggested_name
);
1632 } else if inexistent_fields
.len() == 1 {
1633 match pat_field
.pat
.kind
{
1635 if !self.can_coerce(
1636 self.typeck_results
.borrow().expr_ty(expr
),
1638 unmentioned_fields
[0].1.span
,
1639 unmentioned_fields
[0].0,
1644 let unmentioned_field
= unmentioned_fields
[0].1.name
;
1645 err
.span_suggestion_short(
1646 pat_field
.ident
.span
,
1648 "`{}` has a field named `{}`",
1649 tcx
.def_path_str(variant
.def_id
),
1652 unmentioned_field
.to_string(),
1653 Applicability
::MaybeIncorrect
,
1660 if tcx
.sess
.teach(&err
.get_code().unwrap()) {
1662 "This error indicates that a struct pattern attempted to \
1663 extract a non-existent field from a struct. Struct fields \
1664 are identified by the name used before the colon : so struct \
1665 patterns should resemble the declaration of the struct type \
1667 If you are using shorthand field patterns but want to refer \
1668 to the struct field by a different name, you should rename \
1675 fn error_tuple_variant_as_struct_pat(
1678 fields
: &'tcx
[hir
::PatField
<'tcx
>],
1679 variant
: &ty
::VariantDef
,
1680 ) -> Option
<DiagnosticBuilder
<'tcx
, ErrorGuaranteed
>> {
1681 if let (Some(CtorKind
::Fn
), PatKind
::Struct(qpath
, ..)) = (variant
.ctor_kind(), &pat
.kind
) {
1682 let path
= rustc_hir_pretty
::to_string(rustc_hir_pretty
::NO_ANN
, |s
| {
1683 s
.print_qpath(qpath
, false)
1685 let mut err
= struct_span_err
!(
1689 "tuple variant `{}` written as struct variant",
1692 let (sugg
, appl
) = if fields
.len() == variant
.fields
.len() {
1694 self.get_suggested_tuple_struct_pattern(fields
, variant
),
1695 Applicability
::MachineApplicable
,
1699 variant
.fields
.iter().map(|_
| "_").collect
::<Vec
<&str>>().join(", "),
1700 Applicability
::MaybeIncorrect
,
1703 err
.span_suggestion_verbose(
1704 qpath
.span().shrink_to_hi().to(pat
.span
.shrink_to_hi()),
1705 "use the tuple variant pattern syntax instead",
1706 format
!("({})", sugg
),
1714 fn get_suggested_tuple_struct_pattern(
1716 fields
: &[hir
::PatField
<'_
>],
1717 variant
: &VariantDef
,
1719 let variant_field_idents
=
1720 variant
.fields
.iter().map(|f
| f
.ident(self.tcx
)).collect
::<Vec
<Ident
>>();
1724 match self.tcx
.sess
.source_map().span_to_snippet(field
.pat
.span
) {
1726 // Field names are numbers, but numbers
1727 // are not valid identifiers
1728 if variant_field_idents
.contains(&field
.ident
) {
1734 Err(_
) => rustc_hir_pretty
::to_string(rustc_hir_pretty
::NO_ANN
, |s
| {
1735 s
.print_pat(field
.pat
)
1739 .collect
::<Vec
<String
>>()
1743 /// Returns a diagnostic reporting a struct pattern which is missing an `..` due to
1744 /// inaccessible fields.
1747 /// error: pattern requires `..` due to inaccessible fields
1748 /// --> src/main.rs:10:9
1750 /// LL | let foo::Foo {} = foo::Foo::default();
1753 /// help: add a `..`
1755 /// LL | let foo::Foo { .. } = foo::Foo::default();
1758 fn error_no_accessible_fields(
1761 fields
: &'tcx
[hir
::PatField
<'tcx
>],
1762 ) -> DiagnosticBuilder
<'tcx
, ErrorGuaranteed
> {
1766 .struct_span_err(pat
.span
, "pattern requires `..` due to inaccessible fields");
1768 if let Some(field
) = fields
.last() {
1769 err
.span_suggestion_verbose(
1770 field
.span
.shrink_to_hi(),
1771 "ignore the inaccessible and unused fields",
1773 Applicability
::MachineApplicable
,
1776 let qpath_span
= if let PatKind
::Struct(qpath
, ..) = &pat
.kind
{
1779 bug
!("`error_no_accessible_fields` called on non-struct pattern");
1782 // Shrink the span to exclude the `foo:Foo` in `foo::Foo { }`.
1783 let span
= pat
.span
.with_lo(qpath_span
.shrink_to_hi().hi());
1784 err
.span_suggestion_verbose(
1786 "ignore the inaccessible and unused fields",
1788 Applicability
::MachineApplicable
,
1794 /// Report that a pattern for a `#[non_exhaustive]` struct marked with `non_exhaustive_omitted_patterns`
1795 /// is not exhaustive enough.
1797 /// Nb: the partner lint for enums lives in `compiler/rustc_mir_build/src/thir/pattern/usefulness.rs`.
1798 fn lint_non_exhaustive_omitted_patterns(
1801 unmentioned_fields
: &[(&ty
::FieldDef
, Ident
)],
1804 fn joined_uncovered_patterns(witnesses
: &[&Ident
]) -> String
{
1805 const LIMIT
: usize = 3;
1808 [witness
] => format
!("`{}`", witness
),
1809 [head @
.., tail
] if head
.len() < LIMIT
=> {
1810 let head
: Vec
<_
> = head
.iter().map(<_
>::to_string
).collect();
1811 format
!("`{}` and `{}`", head
.join("`, `"), tail
)
1814 let (head
, tail
) = witnesses
.split_at(LIMIT
);
1815 let head
: Vec
<_
> = head
.iter().map(<_
>::to_string
).collect();
1816 format
!("`{}` and {} more", head
.join("`, `"), tail
.len())
1820 let joined_patterns
= joined_uncovered_patterns(
1821 &unmentioned_fields
.iter().map(|(_
, i
)| i
).collect
::<Vec
<_
>>(),
1824 self.tcx
.struct_span_lint_hir(NON_EXHAUSTIVE_OMITTED_PATTERNS
, pat
.hir_id
, pat
.span
, "some fields are not explicitly listed", |lint
| {
1825 lint
.span_label(pat
.span
, format
!("field{} {} not listed", rustc_errors
::pluralize
!(unmentioned_fields
.len()), joined_patterns
));
1827 "ensure that all fields are mentioned explicitly by adding the suggested fields",
1830 "the pattern is of type `{}` and the `non_exhaustive_omitted_patterns` attribute was found",
1838 /// Returns a diagnostic reporting a struct pattern which does not mention some fields.
1841 /// error[E0027]: pattern does not mention field `bar`
1842 /// --> src/main.rs:15:9
1844 /// LL | let foo::Foo {} = foo::Foo::new();
1845 /// | ^^^^^^^^^^^ missing field `bar`
1847 fn error_unmentioned_fields(
1850 unmentioned_fields
: &[(&ty
::FieldDef
, Ident
)],
1851 have_inaccessible_fields
: bool
,
1852 fields
: &'tcx
[hir
::PatField
<'tcx
>],
1853 ) -> DiagnosticBuilder
<'tcx
, ErrorGuaranteed
> {
1854 let inaccessible
= if have_inaccessible_fields { " and inaccessible fields" }
else { "" }
;
1855 let field_names
= if unmentioned_fields
.len() == 1 {
1856 format
!("field `{}`{}", unmentioned_fields
[0].1, inaccessible
)
1858 let fields
= unmentioned_fields
1860 .map(|(_
, name
)| format
!("`{}`", name
))
1861 .collect
::<Vec
<String
>>()
1863 format
!("fields {}{}", fields
, inaccessible
)
1865 let mut err
= struct_span_err
!(
1869 "pattern does not mention {}",
1872 err
.span_label(pat
.span
, format
!("missing {}", field_names
));
1873 let len
= unmentioned_fields
.len();
1874 let (prefix
, postfix
, sp
) = match fields
{
1875 [] => match &pat
.kind
{
1876 PatKind
::Struct(path
, [], false) => {
1877 (" { ", " }", path
.span().shrink_to_hi().until(pat
.span
.shrink_to_hi()))
1882 // Account for last field having a trailing comma or parse recovery at the tail of
1883 // the pattern to avoid invalid suggestion (#78511).
1884 let tail
= field
.span
.shrink_to_hi().with_hi(pat
.span
.hi());
1886 PatKind
::Struct(..) => (", ", " }", tail
),
1891 err
.span_suggestion(
1894 "include the missing field{} in the pattern{}",
1896 if have_inaccessible_fields { " and ignore the inaccessible fields" }
else { "" }
1903 .map(|(_
, name
)| name
.to_string())
1904 .collect
::<Vec
<_
>>()
1906 if have_inaccessible_fields { ", .." }
else { "" }
,
1909 Applicability
::MachineApplicable
,
1911 err
.span_suggestion(
1914 "if you don't care about {these} missing field{s}, you can explicitly ignore {them}",
1915 these
= pluralize
!("this", len
),
1916 s
= pluralize
!(len
),
1917 them
= if len
== 1 { "it" }
else { "them" }
,
1919 format
!("{}..{}", prefix
, postfix
),
1920 Applicability
::MachineApplicable
,
1928 inner
: &'tcx Pat
<'tcx
>,
1930 def_bm
: BindingMode
,
1934 let (box_ty
, inner_ty
) = match self.check_dereferenceable(span
, expected
, inner
) {
1936 // Here, `demand::subtype` is good enough, but I don't
1937 // think any errors can be introduced by using `demand::eqtype`.
1938 let inner_ty
= self.next_ty_var(TypeVariableOrigin
{
1939 kind
: TypeVariableOriginKind
::TypeInference
,
1942 let box_ty
= tcx
.mk_box(inner_ty
);
1943 self.demand_eqtype_pat(span
, expected
, box_ty
, ti
);
1947 let err
= tcx
.ty_error(guar
);
1951 self.check_pat(inner
, inner_ty
, def_bm
, ti
);
1955 // Precondition: Pat is Ref(inner)
1958 pat
: &'tcx Pat
<'tcx
>,
1959 inner
: &'tcx Pat
<'tcx
>,
1960 mutbl
: hir
::Mutability
,
1962 def_bm
: BindingMode
,
1966 let expected
= self.shallow_resolve(expected
);
1967 let (ref_ty
, inner_ty
) = match self.check_dereferenceable(pat
.span
, expected
, inner
) {
1969 // `demand::subtype` would be good enough, but using `eqtype` turns
1970 // out to be equally general. See (note_1) for details.
1972 // Take region, inner-type from expected type if we can,
1973 // to avoid creating needless variables. This also helps with
1974 // the bad interactions of the given hack detailed in (note_1).
1975 debug
!("check_pat_ref: expected={:?}", expected
);
1976 match *expected
.kind() {
1977 ty
::Ref(_
, r_ty
, r_mutbl
) if r_mutbl
== mutbl
=> (expected
, r_ty
),
1979 let inner_ty
= self.next_ty_var(TypeVariableOrigin
{
1980 kind
: TypeVariableOriginKind
::TypeInference
,
1983 let ref_ty
= self.new_ref_ty(pat
.span
, mutbl
, inner_ty
);
1984 debug
!("check_pat_ref: demanding {:?} = {:?}", expected
, ref_ty
);
1985 let err
= self.demand_eqtype_pat_diag(pat
.span
, expected
, ref_ty
, ti
);
1987 // Look for a case like `fn foo(&foo: u32)` and suggest
1988 // `fn foo(foo: &u32)`
1989 if let Some(mut err
) = err
{
1990 self.borrow_pat_suggestion(&mut err
, pat
);
1998 let err
= tcx
.ty_error(guar
);
2002 self.check_pat(inner
, inner_ty
, def_bm
, ti
);
2006 /// Create a reference type with a fresh region variable.
2007 fn new_ref_ty(&self, span
: Span
, mutbl
: hir
::Mutability
, ty
: Ty
<'tcx
>) -> Ty
<'tcx
> {
2008 let region
= self.next_region_var(infer
::PatternRegion(span
));
2009 let mt
= ty
::TypeAndMut { ty, mutbl }
;
2010 self.tcx
.mk_ref(region
, mt
)
2013 /// Type check a slice pattern.
2015 /// Syntactically, these look like `[pat_0, ..., pat_n]`.
2016 /// Semantically, we are type checking a pattern with structure:
2017 /// ```ignore (not-rust)
2018 /// [before_0, ..., before_n, (slice, after_0, ... after_n)?]
2020 /// The type of `slice`, if it is present, depends on the `expected` type.
2021 /// If `slice` is missing, then so is `after_i`.
2022 /// If `slice` is present, it can still represent 0 elements.
2026 before
: &'tcx
[Pat
<'tcx
>],
2027 slice
: Option
<&'tcx Pat
<'tcx
>>,
2028 after
: &'tcx
[Pat
<'tcx
>],
2030 def_bm
: BindingMode
,
2033 let expected
= self.structurally_resolved_type(span
, expected
);
2034 let (element_ty
, opt_slice_ty
, inferred
) = match *expected
.kind() {
2035 // An array, so we might have something like `let [a, b, c] = [0, 1, 2];`.
2036 ty
::Array(element_ty
, len
) => {
2037 let min
= before
.len() as u64 + after
.len() as u64;
2038 let (opt_slice_ty
, expected
) =
2039 self.check_array_pat_len(span
, element_ty
, expected
, slice
, len
, min
);
2040 // `opt_slice_ty.is_none()` => `slice.is_none()`.
2041 // Note, though, that opt_slice_ty could be `Some(error_ty)`.
2042 assert
!(opt_slice_ty
.is_some() || slice
.is_none());
2043 (element_ty
, opt_slice_ty
, expected
)
2045 ty
::Slice(element_ty
) => (element_ty
, Some(expected
), expected
),
2046 // The expected type must be an array or slice, but was neither, so error.
2051 .unwrap_or_else(|| self.error_expected_array_or_slice(span
, expected
, ti
));
2052 let err
= self.tcx
.ty_error(guar
);
2053 (err
, Some(err
), err
)
2057 // Type check all the patterns before `slice`.
2059 self.check_pat(elt
, element_ty
, def_bm
, ti
);
2061 // Type check the `slice`, if present, against its expected type.
2062 if let Some(slice
) = slice
{
2063 self.check_pat(slice
, opt_slice_ty
.unwrap(), def_bm
, ti
);
2065 // Type check the elements after `slice`, if present.
2067 self.check_pat(elt
, element_ty
, def_bm
, ti
);
2072 /// Type check the length of an array pattern.
2074 /// Returns both the type of the variable length pattern (or `None`), and the potentially
2075 /// inferred array type. We only return `None` for the slice type if `slice.is_none()`.
2076 fn check_array_pat_len(
2079 element_ty
: Ty
<'tcx
>,
2081 slice
: Option
<&'tcx Pat
<'tcx
>>,
2082 len
: ty
::Const
<'tcx
>,
2084 ) -> (Option
<Ty
<'tcx
>>, Ty
<'tcx
>) {
2085 let guar
= if let Some(len
) = len
.try_eval_target_usize(self.tcx
, self.param_env
) {
2086 // Now we know the length...
2087 if slice
.is_none() {
2088 // ...and since there is no variable-length pattern,
2089 // we require an exact match between the number of elements
2090 // in the array pattern and as provided by the matched type.
2092 return (None
, arr_ty
);
2095 self.error_scrutinee_inconsistent_length(span
, min_len
, len
)
2096 } else if let Some(pat_len
) = len
.checked_sub(min_len
) {
2097 // The variable-length pattern was there,
2098 // so it has an array type with the remaining elements left as its size...
2099 return (Some(self.tcx
.mk_array(element_ty
, pat_len
)), arr_ty
);
2101 // ...however, in this case, there were no remaining elements.
2102 // That is, the slice pattern requires more than the array type offers.
2103 self.error_scrutinee_with_rest_inconsistent_length(span
, min_len
, len
)
2105 } else if slice
.is_none() {
2106 // We have a pattern with a fixed length,
2107 // which we can use to infer the length of the array.
2108 let updated_arr_ty
= self.tcx
.mk_array(element_ty
, min_len
);
2109 self.demand_eqtype(span
, updated_arr_ty
, arr_ty
);
2110 return (None
, updated_arr_ty
);
2112 // We have a variable-length pattern and don't know the array length.
2113 // This happens if we have e.g.,
2114 // `let [a, b, ..] = arr` where `arr: [T; N]` where `const N: usize`.
2115 self.error_scrutinee_unfixed_length(span
)
2118 // If we get here, we must have emitted an error.
2119 (Some(self.tcx
.ty_error(guar
)), arr_ty
)
2122 fn error_scrutinee_inconsistent_length(
2127 ) -> ErrorGuaranteed
{
2132 "pattern requires {} element{} but array has {}",
2134 pluralize
!(min_len
),
2137 .span_label(span
, format
!("expected {} element{}", size
, pluralize
!(size
)))
2141 fn error_scrutinee_with_rest_inconsistent_length(
2146 ) -> ErrorGuaranteed
{
2151 "pattern requires at least {} element{} but array has {}",
2153 pluralize
!(min_len
),
2158 format
!("pattern cannot match array of {} element{}", size
, pluralize
!(size
),),
2163 fn error_scrutinee_unfixed_length(&self, span
: Span
) -> ErrorGuaranteed
{
2168 "cannot pattern-match on an array without a fixed length",
2173 fn error_expected_array_or_slice(
2176 expected_ty
: Ty
<'tcx
>,
2178 ) -> ErrorGuaranteed
{
2179 let mut err
= struct_span_err
!(
2183 "expected an array or slice, found `{expected_ty}`"
2185 if let ty
::Ref(_
, ty
, _
) = expected_ty
.kind()
2186 && let ty
::Array(..) | ty
::Slice(..) = ty
.kind()
2188 err
.help("the semantics of slice patterns changed recently; see issue #62254");
2189 } else if self.autoderef(span
, expected_ty
)
2190 .any(|(ty
, _
)| matches
!(ty
.kind(), ty
::Slice(..) | ty
::Array(..)))
2191 && let Some(span
) = ti
.span
2192 && let Some(_
) = ti
.origin_expr
2193 && let Ok(snippet
) = self.tcx
.sess
.source_map().span_to_snippet(span
)
2195 let ty
= self.resolve_vars_if_possible(ti
.expected
);
2196 let is_slice_or_array_or_vector
= self.is_slice_or_array_or_vector(ty
);
2197 match is_slice_or_array_or_vector
.1.kind() {
2199 if self.tcx
.is_diagnostic_item(sym
::Option
, adt_def
.did())
2200 || self.tcx
.is_diagnostic_item(sym
::Result
, adt_def
.did()) =>
2202 // Slicing won't work here, but `.as_deref()` might (issue #91328).
2203 err
.span_suggestion(
2205 "consider using `as_deref` here",
2206 format
!("{snippet}.as_deref()"),
2207 Applicability
::MaybeIncorrect
,
2212 if is_slice_or_array_or_vector
.0 {
2213 err
.span_suggestion(
2215 "consider slicing here",
2216 format
!("{snippet}[..]"),
2217 Applicability
::MachineApplicable
,
2221 err
.span_label(span
, format
!("pattern cannot match with input type `{expected_ty}`"));
2225 fn is_slice_or_array_or_vector(&self, ty
: Ty
<'tcx
>) -> (bool
, Ty
<'tcx
>) {
2227 ty
::Adt(adt_def
, _
) if self.tcx
.is_diagnostic_item(sym
::Vec
, adt_def
.did()) => {
2230 ty
::Ref(_
, ty
, _
) => self.is_slice_or_array_or_vector(*ty
),
2231 ty
::Slice(..) | ty
::Array(..) => (true, ty
),