rustc_ast_lowering/
pat.rs

1use std::sync::Arc;
2
3use rustc_ast::*;
4use rustc_data_structures::stack::ensure_sufficient_stack;
5use rustc_hir::def::{DefKind, Res};
6use rustc_hir::definitions::DefPathData;
7use rustc_hir::{self as hir, LangItem, Target};
8use rustc_middle::span_bug;
9use rustc_span::source_map::{Spanned, respan};
10use rustc_span::{DesugaringKind, Ident, Span};
11
12use super::errors::{
13    ArbitraryExpressionInPattern, ExtraDoubleDot, MisplacedDoubleDot, SubTupleBinding,
14};
15use super::{ImplTraitContext, LoweringContext, ParamMode, ResolverAstLoweringExt};
16use crate::{AllowReturnTypeNotation, ImplTraitPosition};
17
18impl<'a, 'hir> LoweringContext<'a, 'hir> {
19    pub(crate) fn lower_pat(&mut self, pattern: &Pat) -> &'hir hir::Pat<'hir> {
20        self.arena.alloc(self.lower_pat_mut(pattern))
21    }
22
23    fn lower_pat_mut(&mut self, mut pattern: &Pat) -> hir::Pat<'hir> {
24        ensure_sufficient_stack(|| {
25            // loop here to avoid recursion
26            let pat_hir_id = self.lower_node_id(pattern.id);
27            let node = loop {
28                match &pattern.kind {
29                    PatKind::Missing => break hir::PatKind::Missing,
30                    PatKind::Wild => break hir::PatKind::Wild,
31                    PatKind::Never => break hir::PatKind::Never,
32                    PatKind::Ident(binding_mode, ident, sub) => {
33                        let lower_sub = |this: &mut Self| sub.as_ref().map(|s| this.lower_pat(s));
34                        break self.lower_pat_ident(
35                            pattern,
36                            *binding_mode,
37                            *ident,
38                            pat_hir_id,
39                            lower_sub,
40                        );
41                    }
42                    PatKind::Expr(e) => {
43                        break hir::PatKind::Expr(self.lower_expr_within_pat(e, false));
44                    }
45                    PatKind::TupleStruct(qself, path, pats) => {
46                        let qpath = self.lower_qpath(
47                            pattern.id,
48                            qself,
49                            path,
50                            ParamMode::Optional,
51                            AllowReturnTypeNotation::No,
52                            ImplTraitContext::Disallowed(ImplTraitPosition::Path),
53                            None,
54                        );
55                        let (pats, ddpos) = self.lower_pat_tuple(pats, "tuple struct");
56                        break hir::PatKind::TupleStruct(qpath, pats, ddpos);
57                    }
58                    PatKind::Or(pats) => {
59                        break hir::PatKind::Or(
60                            self.arena.alloc_from_iter(pats.iter().map(|x| self.lower_pat_mut(x))),
61                        );
62                    }
63                    PatKind::Path(qself, path) => {
64                        let qpath = self.lower_qpath(
65                            pattern.id,
66                            qself,
67                            path,
68                            ParamMode::Optional,
69                            AllowReturnTypeNotation::No,
70                            ImplTraitContext::Disallowed(ImplTraitPosition::Path),
71                            None,
72                        );
73                        let kind = hir::PatExprKind::Path(qpath);
74                        let span = self.lower_span(pattern.span);
75                        let expr = hir::PatExpr { hir_id: pat_hir_id, span, kind };
76                        let expr = self.arena.alloc(expr);
77                        return hir::Pat {
78                            hir_id: self.next_id(),
79                            kind: hir::PatKind::Expr(expr),
80                            span,
81                            default_binding_modes: true,
82                        };
83                    }
84                    PatKind::Struct(qself, path, fields, etc) => {
85                        let qpath = self.lower_qpath(
86                            pattern.id,
87                            qself,
88                            path,
89                            ParamMode::Optional,
90                            AllowReturnTypeNotation::No,
91                            ImplTraitContext::Disallowed(ImplTraitPosition::Path),
92                            None,
93                        );
94
95                        let fs = self.arena.alloc_from_iter(fields.iter().map(|f| {
96                            let hir_id = self.lower_node_id(f.id);
97                            self.lower_attrs(hir_id, &f.attrs, f.span, Target::PatField);
98
99                            hir::PatField {
100                                hir_id,
101                                ident: self.lower_ident(f.ident),
102                                pat: self.lower_pat(&f.pat),
103                                is_shorthand: f.is_shorthand,
104                                span: self.lower_span(f.span),
105                            }
106                        }));
107                        break hir::PatKind::Struct(
108                            qpath,
109                            fs,
110                            match etc {
111                                ast::PatFieldsRest::Rest(sp) => Some(self.lower_span(*sp)),
112                                ast::PatFieldsRest::Recovered(_) => Some(Span::default()),
113                                _ => None,
114                            },
115                        );
116                    }
117                    PatKind::Tuple(pats) => {
118                        let (pats, ddpos) = self.lower_pat_tuple(pats, "tuple");
119                        break hir::PatKind::Tuple(pats, ddpos);
120                    }
121                    PatKind::Box(inner) => {
122                        break hir::PatKind::Box(self.lower_pat(inner));
123                    }
124                    PatKind::Deref(inner) => {
125                        break hir::PatKind::Deref(self.lower_pat(inner));
126                    }
127                    PatKind::Ref(inner, mutbl) => {
128                        break hir::PatKind::Ref(self.lower_pat(inner), *mutbl);
129                    }
130                    PatKind::Range(e1, e2, Spanned { node: end, .. }) => {
131                        break hir::PatKind::Range(
132                            e1.as_deref().map(|e| self.lower_expr_within_pat(e, true)),
133                            e2.as_deref().map(|e| self.lower_expr_within_pat(e, true)),
134                            self.lower_range_end(end, e2.is_some()),
135                        );
136                    }
137                    PatKind::Guard(inner, cond) => {
138                        break hir::PatKind::Guard(self.lower_pat(inner), self.lower_expr(cond));
139                    }
140                    PatKind::Slice(pats) => break self.lower_pat_slice(pats),
141                    PatKind::Rest => {
142                        // If we reach here the `..` pattern is not semantically allowed.
143                        break self.ban_illegal_rest_pat(pattern.span);
144                    }
145                    // return inner to be processed in next loop
146                    PatKind::Paren(inner) => pattern = inner,
147                    PatKind::MacCall(_) => {
148                        panic!("{pattern:#?} shouldn't exist here")
149                    }
150                    PatKind::Err(guar) => break hir::PatKind::Err(*guar),
151                }
152            };
153
154            self.pat_with_node_id_of(pattern, node, pat_hir_id)
155        })
156    }
157
158    fn lower_pat_tuple(
159        &mut self,
160        pats: &[Pat],
161        ctx: &str,
162    ) -> (&'hir [hir::Pat<'hir>], hir::DotDotPos) {
163        let mut elems = Vec::with_capacity(pats.len());
164        let mut rest = None;
165
166        let mut iter = pats.iter().enumerate();
167        for (idx, pat) in iter.by_ref() {
168            // Interpret the first `..` pattern as a sub-tuple pattern.
169            // Note that unlike for slice patterns,
170            // where `xs @ ..` is a legal sub-slice pattern,
171            // it is not a legal sub-tuple pattern.
172            match &pat.kind {
173                // Found a sub-tuple rest pattern
174                PatKind::Rest => {
175                    rest = Some((idx, pat.span));
176                    break;
177                }
178                // Found a sub-tuple pattern `$binding_mode $ident @ ..`.
179                // This is not allowed as a sub-tuple pattern
180                PatKind::Ident(_, ident, Some(sub)) if sub.is_rest() => {
181                    let sp = pat.span;
182                    self.dcx().emit_err(SubTupleBinding {
183                        span: sp,
184                        ident_name: ident.name,
185                        ident: *ident,
186                        ctx,
187                    });
188                }
189                _ => {}
190            }
191
192            // It was not a sub-tuple pattern so lower it normally.
193            elems.push(self.lower_pat_mut(pat));
194        }
195
196        for (_, pat) in iter {
197            // There was a previous sub-tuple pattern; make sure we don't allow more...
198            if pat.is_rest() {
199                // ...but there was one again, so error.
200                self.ban_extra_rest_pat(pat.span, rest.unwrap().1, ctx);
201            } else {
202                elems.push(self.lower_pat_mut(pat));
203            }
204        }
205
206        (self.arena.alloc_from_iter(elems), hir::DotDotPos::new(rest.map(|(ddpos, _)| ddpos)))
207    }
208
209    /// Lower a slice pattern of form `[pat_0, ..., pat_n]` into
210    /// `hir::PatKind::Slice(before, slice, after)`.
211    ///
212    /// When encountering `($binding_mode $ident @)? ..` (`slice`),
213    /// this is interpreted as a sub-slice pattern semantically.
214    /// Patterns that follow, which are not like `slice` -- or an error occurs, are in `after`.
215    fn lower_pat_slice(&mut self, pats: &[Pat]) -> hir::PatKind<'hir> {
216        let mut before = Vec::new();
217        let mut after = Vec::new();
218        let mut slice = None;
219        let mut prev_rest_span = None;
220
221        // Lowers `$bm $ident @ ..` to `$bm $ident @ _`.
222        let lower_rest_sub = |this: &mut Self, pat: &Pat, &ann, &ident, sub: &Pat| {
223            let sub_hir_id = this.lower_node_id(sub.id);
224            let lower_sub = |this: &mut Self| Some(this.pat_wild_with_node_id_of(sub, sub_hir_id));
225            let pat_hir_id = this.lower_node_id(pat.id);
226            let node = this.lower_pat_ident(pat, ann, ident, pat_hir_id, lower_sub);
227            this.pat_with_node_id_of(pat, node, pat_hir_id)
228        };
229
230        let mut iter = pats.iter();
231        // Lower all the patterns until the first occurrence of a sub-slice pattern.
232        for pat in iter.by_ref() {
233            match &pat.kind {
234                // Found a sub-slice pattern `..`. Record, lower it to `_`, and stop here.
235                PatKind::Rest => {
236                    prev_rest_span = Some(pat.span);
237                    let hir_id = self.lower_node_id(pat.id);
238                    slice = Some(self.pat_wild_with_node_id_of(pat, hir_id));
239                    break;
240                }
241                // Found a sub-slice pattern `$binding_mode $ident @ ..`.
242                // Record, lower it to `$binding_mode $ident @ _`, and stop here.
243                PatKind::Ident(ann, ident, Some(sub)) if sub.is_rest() => {
244                    prev_rest_span = Some(sub.span);
245                    slice = Some(self.arena.alloc(lower_rest_sub(self, pat, ann, ident, sub)));
246                    break;
247                }
248                // It was not a subslice pattern so lower it normally.
249                _ => before.push(self.lower_pat_mut(pat)),
250            }
251        }
252
253        // Lower all the patterns after the first sub-slice pattern.
254        for pat in iter {
255            // There was a previous subslice pattern; make sure we don't allow more.
256            let rest_span = match &pat.kind {
257                PatKind::Rest => Some(pat.span),
258                PatKind::Ident(ann, ident, Some(sub)) if sub.is_rest() => {
259                    // #69103: Lower into `binding @ _` as above to avoid ICEs.
260                    after.push(lower_rest_sub(self, pat, ann, ident, sub));
261                    Some(sub.span)
262                }
263                _ => None,
264            };
265            if let Some(rest_span) = rest_span {
266                // We have e.g., `[a, .., b, ..]`. That's no good, error!
267                self.ban_extra_rest_pat(rest_span, prev_rest_span.unwrap(), "slice");
268            } else {
269                // Lower the pattern normally.
270                after.push(self.lower_pat_mut(pat));
271            }
272        }
273
274        hir::PatKind::Slice(
275            self.arena.alloc_from_iter(before),
276            slice,
277            self.arena.alloc_from_iter(after),
278        )
279    }
280
281    fn lower_pat_ident(
282        &mut self,
283        p: &Pat,
284        annotation: BindingMode,
285        ident: Ident,
286        hir_id: hir::HirId,
287        lower_sub: impl FnOnce(&mut Self) -> Option<&'hir hir::Pat<'hir>>,
288    ) -> hir::PatKind<'hir> {
289        match self.resolver.get_partial_res(p.id).map(|d| d.expect_full_res()) {
290            // `None` can occur in body-less function signatures
291            res @ (None | Some(Res::Local(_))) => {
292                let binding_id = match res {
293                    Some(Res::Local(id)) => {
294                        // In `Or` patterns like `VariantA(s) | VariantB(s, _)`, multiple identifier patterns
295                        // will be resolved to the same `Res::Local`. Thus they just share a single
296                        // `HirId`.
297                        if id == p.id {
298                            self.ident_and_label_to_local_id.insert(id, hir_id.local_id);
299                            hir_id
300                        } else {
301                            hir::HirId {
302                                owner: self.current_hir_id_owner,
303                                local_id: self.ident_and_label_to_local_id[&id],
304                            }
305                        }
306                    }
307                    _ => {
308                        self.ident_and_label_to_local_id.insert(p.id, hir_id.local_id);
309                        hir_id
310                    }
311                };
312                hir::PatKind::Binding(
313                    annotation,
314                    binding_id,
315                    self.lower_ident(ident),
316                    lower_sub(self),
317                )
318            }
319            Some(res) => {
320                let res = self.lower_res(res);
321                let span = self.lower_span(ident.span);
322                hir::PatKind::Expr(self.arena.alloc(hir::PatExpr {
323                    kind: hir::PatExprKind::Path(hir::QPath::Resolved(
324                        None,
325                        self.arena.alloc(hir::Path {
326                            span,
327                            res,
328                            segments: arena_vec![self; hir::PathSegment::new(self.lower_ident(ident), self.next_id(), res)],
329                        }),
330                    )),
331                    hir_id: self.next_id(),
332                    span,
333                }))
334            }
335        }
336    }
337
338    fn pat_wild_with_node_id_of(&mut self, p: &Pat, hir_id: hir::HirId) -> &'hir hir::Pat<'hir> {
339        self.arena.alloc(self.pat_with_node_id_of(p, hir::PatKind::Wild, hir_id))
340    }
341
342    /// Construct a `Pat` with the `HirId` of `p.id` already lowered.
343    fn pat_with_node_id_of(
344        &mut self,
345        p: &Pat,
346        kind: hir::PatKind<'hir>,
347        hir_id: hir::HirId,
348    ) -> hir::Pat<'hir> {
349        hir::Pat { hir_id, kind, span: self.lower_span(p.span), default_binding_modes: true }
350    }
351
352    /// Emit a friendly error for extra `..` patterns in a tuple/tuple struct/slice pattern.
353    pub(crate) fn ban_extra_rest_pat(&self, sp: Span, prev_sp: Span, ctx: &str) {
354        self.dcx().emit_err(ExtraDoubleDot { span: sp, prev_span: prev_sp, ctx });
355    }
356
357    /// Used to ban the `..` pattern in places it shouldn't be semantically.
358    fn ban_illegal_rest_pat(&self, sp: Span) -> hir::PatKind<'hir> {
359        self.dcx().emit_err(MisplacedDoubleDot { span: sp });
360
361        // We're not in a list context so `..` can be reasonably treated
362        // as `_` because it should always be valid and roughly matches the
363        // intent of `..` (notice that the rest of a single slot is that slot).
364        hir::PatKind::Wild
365    }
366
367    fn lower_range_end(&mut self, e: &RangeEnd, has_end: bool) -> hir::RangeEnd {
368        match *e {
369            RangeEnd::Excluded if has_end => hir::RangeEnd::Excluded,
370            // No end; so `X..` behaves like `RangeFrom`.
371            RangeEnd::Excluded | RangeEnd::Included(_) => hir::RangeEnd::Included,
372        }
373    }
374
375    /// Matches `'-' lit | lit (cf. parser::Parser::parse_literal_maybe_minus)`,
376    /// or paths for ranges.
377    //
378    // FIXME: do we want to allow `expr -> pattern` conversion to create path expressions?
379    // That means making this work:
380    //
381    // ```rust,ignore (FIXME)
382    // struct S;
383    // macro_rules! m {
384    //     ($a:expr) => {
385    //         let $a = S;
386    //     }
387    // }
388    // m!(S);
389    // ```
390    fn lower_expr_within_pat(
391        &mut self,
392        expr: &Expr,
393        allow_paths: bool,
394    ) -> &'hir hir::PatExpr<'hir> {
395        let span = self.lower_span(expr.span);
396        let err =
397            |guar| hir::PatExprKind::Lit { lit: respan(span, LitKind::Err(guar)), negated: false };
398        let kind = match &expr.kind {
399            ExprKind::Lit(lit) => {
400                hir::PatExprKind::Lit { lit: self.lower_lit(lit, span), negated: false }
401            }
402            ExprKind::ConstBlock(c) => hir::PatExprKind::ConstBlock(self.lower_const_block(c)),
403            ExprKind::IncludedBytes(byte_sym) => hir::PatExprKind::Lit {
404                lit: respan(span, LitKind::ByteStr(*byte_sym, StrStyle::Cooked)),
405                negated: false,
406            },
407            ExprKind::Err(guar) => err(*guar),
408            ExprKind::Dummy => span_bug!(span, "lowered ExprKind::Dummy"),
409            ExprKind::Path(qself, path) if allow_paths => hir::PatExprKind::Path(self.lower_qpath(
410                expr.id,
411                qself,
412                path,
413                ParamMode::Optional,
414                AllowReturnTypeNotation::No,
415                ImplTraitContext::Disallowed(ImplTraitPosition::Path),
416                None,
417            )),
418            ExprKind::Unary(UnOp::Neg, inner) if let ExprKind::Lit(lit) = &inner.kind => {
419                hir::PatExprKind::Lit { lit: self.lower_lit(lit, span), negated: true }
420            }
421            _ => {
422                let pattern_from_macro = expr.is_approximately_pattern();
423                let guar = self.dcx().emit_err(ArbitraryExpressionInPattern {
424                    span,
425                    pattern_from_macro_note: pattern_from_macro,
426                });
427                err(guar)
428            }
429        };
430        self.arena.alloc(hir::PatExpr { hir_id: self.lower_node_id(expr.id), span, kind })
431    }
432
433    pub(crate) fn lower_ty_pat(
434        &mut self,
435        pattern: &TyPat,
436        base_type: Span,
437    ) -> &'hir hir::TyPat<'hir> {
438        self.arena.alloc(self.lower_ty_pat_mut(pattern, base_type))
439    }
440
441    fn lower_ty_pat_mut(&mut self, pattern: &TyPat, base_type: Span) -> hir::TyPat<'hir> {
442        // loop here to avoid recursion
443        let pat_hir_id = self.lower_node_id(pattern.id);
444        let node = match &pattern.kind {
445            TyPatKind::Range(e1, e2, Spanned { node: end, span }) => hir::TyPatKind::Range(
446                e1.as_deref().map(|e| self.lower_anon_const_to_const_arg(e)).unwrap_or_else(|| {
447                    self.lower_ty_pat_range_end(
448                        hir::LangItem::RangeMin,
449                        span.shrink_to_lo(),
450                        base_type,
451                    )
452                }),
453                e2.as_deref()
454                    .map(|e| match end {
455                        RangeEnd::Included(..) => self.lower_anon_const_to_const_arg(e),
456                        RangeEnd::Excluded => self.lower_excluded_range_end(e),
457                    })
458                    .unwrap_or_else(|| {
459                        self.lower_ty_pat_range_end(
460                            hir::LangItem::RangeMax,
461                            span.shrink_to_hi(),
462                            base_type,
463                        )
464                    }),
465            ),
466            TyPatKind::NotNull => hir::TyPatKind::NotNull,
467            TyPatKind::Or(variants) => {
468                hir::TyPatKind::Or(self.arena.alloc_from_iter(
469                    variants.iter().map(|pat| self.lower_ty_pat_mut(pat, base_type)),
470                ))
471            }
472            TyPatKind::Err(guar) => hir::TyPatKind::Err(*guar),
473        };
474
475        hir::TyPat { hir_id: pat_hir_id, kind: node, span: self.lower_span(pattern.span) }
476    }
477
478    /// Lowers the range end of an exclusive range (`2..5`) to an inclusive range 2..=(5 - 1).
479    /// This way the type system doesn't have to handle the distinction between inclusive/exclusive ranges.
480    fn lower_excluded_range_end(&mut self, e: &AnonConst) -> &'hir hir::ConstArg<'hir> {
481        let span = self.lower_span(e.value.span);
482        let unstable_span = self.mark_span_with_reason(
483            DesugaringKind::PatTyRange,
484            span,
485            Some(Arc::clone(&self.allow_pattern_type)),
486        );
487        let anon_const = self.with_new_scopes(span, |this| {
488            let def_id = this.local_def_id(e.id);
489            let hir_id = this.lower_node_id(e.id);
490            let body = this.lower_body(|this| {
491                // Need to use a custom function as we can't just subtract `1` from a `char`.
492                let kind = hir::ExprKind::Path(this.make_lang_item_qpath(
493                    hir::LangItem::RangeSub,
494                    unstable_span,
495                    None,
496                ));
497                let fn_def = this.arena.alloc(hir::Expr { hir_id: this.next_id(), kind, span });
498                let args = this.arena.alloc([this.lower_expr_mut(&e.value)]);
499                (
500                    &[],
501                    hir::Expr {
502                        hir_id: this.next_id(),
503                        kind: hir::ExprKind::Call(fn_def, args),
504                        span,
505                    },
506                )
507            });
508            hir::AnonConst { def_id, hir_id, body, span }
509        });
510        self.arena.alloc(hir::ConstArg {
511            hir_id: self.next_id(),
512            kind: hir::ConstArgKind::Anon(self.arena.alloc(anon_const)),
513        })
514    }
515
516    /// When a range has no end specified (`1..` or `1..=`) or no start specified (`..5` or `..=5`),
517    /// we instead use a constant of the MAX/MIN of the type.
518    /// This way the type system does not have to handle the lack of a start/end.
519    fn lower_ty_pat_range_end(
520        &mut self,
521        lang_item: LangItem,
522        span: Span,
523        base_type: Span,
524    ) -> &'hir hir::ConstArg<'hir> {
525        let node_id = self.next_node_id();
526
527        // Add a definition for the in-band const def.
528        // We're generating a range end that didn't exist in the AST,
529        // so the def collector didn't create the def ahead of time. That's why we have to do
530        // it here.
531        let def_id =
532            self.create_def(node_id, None, DefKind::AnonConst, DefPathData::LateAnonConst, span);
533        let hir_id = self.lower_node_id(node_id);
534
535        let unstable_span = self.mark_span_with_reason(
536            DesugaringKind::PatTyRange,
537            self.lower_span(span),
538            Some(Arc::clone(&self.allow_pattern_type)),
539        );
540        let span = self.lower_span(base_type);
541
542        let path_expr = hir::Expr {
543            hir_id: self.next_id(),
544            kind: hir::ExprKind::Path(self.make_lang_item_qpath(lang_item, unstable_span, None)),
545            span,
546        };
547
548        let ct = self.with_new_scopes(span, |this| {
549            self.arena.alloc(hir::AnonConst {
550                def_id,
551                hir_id,
552                body: this.lower_body(|_this| (&[], path_expr)),
553                span,
554            })
555        });
556        let hir_id = self.next_id();
557        self.arena.alloc(hir::ConstArg { kind: hir::ConstArgKind::Anon(ct), hir_id })
558    }
559}
rustc_ast_lowering/pat.rs

rustc_ast_lowering/
pat.rs
