1 //! Code related to match expressions. These are sufficiently complex to
2 //! warrant their own module and submodules. :) This main module includes the
3 //! high-level algorithm, the submodules contain the details.
5 //! This also includes code for pattern bindings in `let` statements and
6 //! function parameters.
8 use crate::build::scope::DropKind;
9 use crate::build::ForGuard::{self, OutsideGuard, RefWithinGuard};
10 use crate::build::{BlockAnd, BlockAndExtension, Builder};
11 use crate::build::{GuardFrame, GuardFrameLocal, LocalsForNode};
12 use crate::hair::{self, *};
13 use rustc::hir::HirId;
15 use rustc::middle::region;
16 use rustc::ty::{self, CanonicalUserTypeAnnotation, Ty};
17 use rustc::ty::layout::VariantIdx;
18 use rustc_data_structures::bit_set::BitSet;
19 use rustc_data_structures::fx::{FxHashMap, FxHashSet};
20 use syntax::ast::Name;
23 // helper functions, broken out by category:
28 use std::convert::TryFrom;
30 impl<'a, 'tcx> Builder<'a, 'tcx> {
31 /// Generates MIR for a `match` expression.
33 /// The MIR that we generate for a match looks like this.
38 /// [ 1. Evaluate Scrutinee (expression being matched on) ]
39 /// [ (fake read of scrutinee) ]
41 /// [ 2. Decision tree -- check discriminants ] <--------+
43 /// | (once a specific arm is chosen) |
45 /// [pre_binding_block] [otherwise_block]
47 /// [ 3. Create "guard bindings" for arm ] |
48 /// [ (create fake borrows) ] |
50 /// [ 4. Execute guard code ] |
51 /// [ (read fake borrows) ] --(guard is false)-----------+
53 /// | (guard results in true)
55 /// [ 5. Create real bindings and execute arm ]
60 /// All of the different arms have been stacked on top of each other to
61 /// simplify the diagram. For an arm with no guard the blocks marked 3 and
62 /// 4 and the fake borrows are omitted.
64 /// We generate MIR in the following steps:
66 /// 1. Evaluate the scrutinee and add the fake read of it.
67 /// 2. Create the prebinding and otherwise blocks.
68 /// 3. Create the decision tree and record the places that we bind or test.
69 /// 4. Determine the fake borrows that are needed from the above places.
70 /// Create the required temporaries for them.
71 /// 5. Create everything else: Create everything else: the guards and the
74 /// ## Fake Reads and borrows
76 /// Match exhaustiveness checking is not able to handle the case where the
77 /// place being matched on is mutated in the guards. There is an AST check
78 /// that tries to stop this but it is buggy and overly restrictive. Instead
79 /// we add "fake borrows" to the guards that prevent any mutation of the
80 /// place being matched. There are a some subtleties:
82 /// 1. Borrowing `*x` doesn't prevent assigning to `x`. If `x` is a shared
83 /// refence, the borrow isn't even tracked. As such we have to add fake
84 /// borrows of any prefixes of a place
85 /// 2. We don't want `match x { _ => (), }` to conflict with mutable
86 /// borrows of `x`, so we only add fake borrows for places which are
87 /// bound or tested by the match.
88 /// 3. We don't want the fake borrows to conflict with `ref mut` bindings,
89 /// so we use a special BorrowKind for them.
90 /// 4. The fake borrows may be of places in inactive variants, so it would
91 /// be UB to generate code for them. They therefore have to be removed
92 /// by a MIR pass run after borrow checking.
96 /// We don't want to have the exact structure of the decision tree be
97 /// visible through borrow checking. False edges ensure that the CFG as
98 /// seen by borrow checking doesn't encode this. False edges are added:
100 /// * From each prebinding block to the next prebinding block.
101 /// * From each otherwise block to the next prebinding block.
104 destination: &Place<'tcx>,
106 mut block: BasicBlock,
107 scrutinee: ExprRef<'tcx>,
108 arms: Vec<Arm<'tcx>>,
110 let tcx = self.hir.tcx();
112 // Step 1. Evaluate the scrutinee and add the fake read of it.
114 let scrutinee_span = scrutinee.span();
115 let scrutinee_place = unpack!(block = self.as_place(block, scrutinee));
117 // Matching on a `scrutinee_place` with an uninhabited type doesn't
118 // generate any memory reads by itself, and so if the place "expression"
119 // contains unsafe operations like raw pointer dereferences or union
120 // field projections, we wouldn't know to require an `unsafe` block
121 // around a `match` equivalent to `std::intrinsics::unreachable()`.
122 // See issue #47412 for this hole being discovered in the wild.
124 // HACK(eddyb) Work around the above issue by adding a dummy inspection
125 // of `scrutinee_place`, specifically by applying `ReadForMatch`.
127 // NOTE: ReadForMatch also checks that the scrutinee is initialized.
128 // This is currently needed to not allow matching on an uninitialized,
129 // uninhabited value. If we get never patterns, those will check that
130 // the place is initialized, and so this read would only be used to
133 let source_info = self.source_info(scrutinee_span);
134 self.cfg.push(block, Statement {
136 kind: StatementKind::FakeRead(
137 FakeReadCause::ForMatchedPlace,
138 scrutinee_place.clone(),
142 // Step 2. Create the otherwise and prebinding blocks.
144 // create binding start block for link them by false edges
145 let candidate_count = arms.iter().map(|c| c.patterns.len()).sum::<usize>();
146 let pre_binding_blocks: Vec<_> = (0..candidate_count)
147 .map(|_| self.cfg.start_new_block())
150 let mut match_has_guard = false;
152 let mut candidate_pre_binding_blocks = pre_binding_blocks.iter();
153 let mut next_candidate_pre_binding_blocks = pre_binding_blocks.iter().skip(1);
155 // Assemble a list of candidates: there is one candidate per pattern,
156 // which means there may be more than one candidate *per arm*.
157 let mut arm_candidates: Vec<_> = arms
160 let arm_has_guard = arm.guard.is_some();
161 match_has_guard |= arm_has_guard;
162 let arm_candidates: Vec<_> = arm.patterns
164 .zip(candidate_pre_binding_blocks.by_ref())
166 |(pattern, pre_binding_block)| {
170 MatchPair::new(scrutinee_place.clone(), pattern),
174 otherwise_block: if arm_has_guard {
175 Some(self.cfg.start_new_block())
179 pre_binding_block: *pre_binding_block,
180 next_candidate_pre_binding_block:
181 next_candidate_pre_binding_blocks.next().copied(),
186 (arm, arm_candidates)
190 // Step 3. Create the decision tree and record the places that we bind or test.
192 // The set of places that we are creating fake borrows of. If there are
193 // no match guards then we don't need any fake borrows, so don't track
195 let mut fake_borrows = if match_has_guard && tcx.generate_borrow_of_any_match_input() {
196 Some(FxHashSet::default())
201 // These candidates are kept sorted such that the highest priority
202 // candidate comes first in the list. (i.e., same order as in source)
203 // As we gnerate the decision tree,
204 let candidates = &mut arm_candidates
206 .flat_map(|(_, candidates)| candidates)
207 .collect::<Vec<_>>();
209 let outer_source_info = self.source_info(span);
211 // this will generate code to test scrutinee_place and
212 // branch to the appropriate arm block
213 self.match_candidates(
221 // Step 4. Determine the fake borrows that are needed from the above
222 // places. Create the required temporaries for them.
224 let fake_borrow_temps = if let Some(ref borrows) = fake_borrows {
225 self.calculate_fake_borrows(borrows, scrutinee_span)
230 // Step 5. Create everything else: the guards and the arms.
231 let match_scope = self.scopes.topmost();
233 let arm_end_blocks: Vec<_> = arm_candidates.into_iter().map(|(arm, mut candidates)| {
234 let arm_source_info = self.source_info(arm.span);
235 let arm_scope = (arm.scope, arm_source_info);
236 self.in_scope(arm_scope, arm.lint_level, |this| {
237 let body = this.hir.mirror(arm.body.clone());
238 let scope = this.declare_bindings(
242 ArmHasGuard(arm.guard.is_some()),
243 Some((Some(&scrutinee_place), scrutinee_span)),
247 if candidates.len() == 1 {
248 arm_block = this.bind_and_guard_matched_candidate(
249 candidates.pop().unwrap(),
256 arm_block = this.cfg.start_new_block();
257 for candidate in candidates {
258 this.clear_top_scope(arm.scope);
259 let binding_end = this.bind_and_guard_matched_candidate(
269 TerminatorKind::Goto { target: arm_block },
274 if let Some(source_scope) = scope {
275 this.source_scope = source_scope;
278 this.into(destination, arm_block, body)
282 // all the arm blocks will rejoin here
283 let end_block = self.cfg.start_new_block();
285 for arm_block in arm_end_blocks {
289 TerminatorKind::Goto { target: end_block },
293 self.source_scope = outer_source_info.scope;
298 pub(super) fn expr_into_pattern(
300 mut block: BasicBlock,
301 irrefutable_pat: Pattern<'tcx>,
302 initializer: ExprRef<'tcx>,
304 match *irrefutable_pat.kind {
305 // Optimize the case of `let x = ...` to write directly into `x`
306 PatternKind::Binding {
307 mode: BindingMode::ByValue,
313 self.storage_live_binding(block, var, irrefutable_pat.span, OutsideGuard);
314 unpack!(block = self.into(&place, block, initializer));
317 // Inject a fake read, see comments on `FakeReadCause::ForLet`.
318 let source_info = self.source_info(irrefutable_pat.span);
323 kind: StatementKind::FakeRead(FakeReadCause::ForLet, place),
327 self.schedule_drop_for_binding(var, irrefutable_pat.span, OutsideGuard);
331 // Optimize the case of `let x: T = ...` to write directly
332 // into `x` and then require that `T == typeof(x)`.
334 // Weirdly, this is needed to prevent the
335 // `intrinsic-move-val.rs` test case from crashing. That
336 // test works with uninitialized values in a rather
337 // dubious way, so it may be that the test is kind of
339 PatternKind::AscribeUserType {
340 subpattern: Pattern {
341 kind: box PatternKind::Binding {
342 mode: BindingMode::ByValue,
349 ascription: hair::pattern::Ascription {
350 user_ty: pat_ascription_ty,
356 self.storage_live_binding(block, var, irrefutable_pat.span, OutsideGuard);
357 unpack!(block = self.into(&place, block, initializer));
359 // Inject a fake read, see comments on `FakeReadCause::ForLet`.
360 let pattern_source_info = self.source_info(irrefutable_pat.span);
364 source_info: pattern_source_info,
365 kind: StatementKind::FakeRead(FakeReadCause::ForLet, place.clone()),
369 let ty_source_info = self.source_info(user_ty_span);
370 let user_ty = box pat_ascription_ty.user_ty(
371 &mut self.canonical_user_type_annotations,
372 place.ty(&self.local_decls, self.hir.tcx()).ty,
378 source_info: ty_source_info,
379 kind: StatementKind::AscribeUserType(
381 // We always use invariant as the variance here. This is because the
382 // variance field from the ascription refers to the variance to use
383 // when applying the type to the value being matched, but this
384 // ascription applies rather to the type of the binding. e.g., in this
391 // We are creating an ascription that defines the type of `x` to be
392 // exactly `T` (i.e., with invariance). The variance field, in
393 // contrast, is intended to be used to relate `T` to the type of
395 ty::Variance::Invariant,
401 self.schedule_drop_for_binding(var, irrefutable_pat.span, OutsideGuard);
406 let place = unpack!(block = self.as_place(block, initializer));
407 self.place_into_pattern(block, irrefutable_pat, &place, true)
412 pub fn place_into_pattern(
415 irrefutable_pat: Pattern<'tcx>,
416 initializer: &Place<'tcx>,
417 set_match_place: bool,
419 // create a dummy candidate
420 let mut candidate = Candidate {
421 span: irrefutable_pat.span,
422 match_pairs: vec![MatchPair::new(initializer.clone(), &irrefutable_pat)],
426 // since we don't call `match_candidates`, next fields are unused
427 otherwise_block: None,
428 pre_binding_block: block,
429 next_candidate_pre_binding_block: None,
432 // Simplify the candidate. Since the pattern is irrefutable, this should
433 // always convert all match-pairs into bindings.
434 self.simplify_candidate(&mut candidate);
436 if !candidate.match_pairs.is_empty() {
437 // ICE if no other errors have been emitted. This used to be a hard error that wouldn't
438 // be reached because `hair::pattern::check_match::check_match` wouldn't have let the
439 // compiler continue. In our tests this is only ever hit by
440 // `ui/consts/const-match-check.rs` with `--cfg eval1`, and that file already generates
441 // a different error before hand.
442 self.hir.tcx().sess.delay_span_bug(
443 candidate.match_pairs[0].pattern.span,
445 "match pairs {:?} remaining after simplifying irrefutable pattern",
446 candidate.match_pairs,
451 // for matches and function arguments, the place that is being matched
452 // can be set when creating the variables. But the place for
453 // let PATTERN = ... might not even exist until we do the assignment.
454 // so we set it here instead
456 for binding in &candidate.bindings {
457 let local = self.var_local_id(binding.var_id, OutsideGuard);
459 if let Some(ClearCrossCrate::Set(BindingForm::Var(VarBindingForm {
460 opt_match_place: Some((ref mut match_place, _)),
462 }))) = self.local_decls[local].is_user_variable
464 *match_place = Some(initializer.clone());
466 bug!("Let binding to non-user variable.")
471 self.ascribe_types(block, &candidate.ascriptions);
473 // now apply the bindings, which will also declare the variables
474 self.bind_matched_candidate_for_arm_body(block, &candidate.bindings);
479 /// Declares the bindings of the given patterns and returns the visibility
480 /// scope for the bindings in these patterns, if such a scope had to be
481 /// created. NOTE: Declaring the bindings should always be done in their
483 pub fn declare_bindings(
485 mut visibility_scope: Option<SourceScope>,
487 pattern: &Pattern<'tcx>,
488 has_guard: ArmHasGuard,
489 opt_match_place: Option<(Option<&Place<'tcx>>, Span)>,
490 ) -> Option<SourceScope> {
491 debug!("declare_bindings: pattern={:?}", pattern);
494 UserTypeProjections::none(),
495 &mut |this, mutability, name, mode, var, span, ty, user_ty| {
496 if visibility_scope.is_none() {
498 Some(this.new_source_scope(scope_span, LintLevel::Inherited, None));
500 let source_info = SourceInfo { span, scope: this.source_scope };
501 let visibility_scope = visibility_scope.unwrap();
502 this.declare_binding(
512 opt_match_place.map(|(x, y)| (x.cloned(), y)),
520 pub fn storage_live_binding(
527 let local_id = self.var_local_id(var, for_guard);
528 let source_info = self.source_info(span);
533 kind: StatementKind::StorageLive(local_id),
536 let var_ty = self.local_decls[local_id].ty;
537 let region_scope = self.hir.region_scope_tree.var_scope(var.local_id);
538 self.schedule_drop(span, region_scope, local_id, var_ty, DropKind::Storage);
539 Place::from(local_id)
542 pub fn schedule_drop_for_binding(&mut self, var: HirId, span: Span, for_guard: ForGuard) {
543 let local_id = self.var_local_id(var, for_guard);
544 let var_ty = self.local_decls[local_id].ty;
545 let region_scope = self.hir.region_scope_tree.var_scope(var.local_id);
555 pub(super) fn visit_bindings(
557 pattern: &Pattern<'tcx>,
558 pattern_user_ty: UserTypeProjections,
570 debug!("visit_bindings: pattern={:?} pattern_user_ty={:?}", pattern, pattern_user_ty);
571 match *pattern.kind {
572 PatternKind::Binding {
581 f(self, mutability, name, mode, var, pattern.span, ty, pattern_user_ty.clone());
582 if let Some(subpattern) = subpattern.as_ref() {
583 self.visit_bindings(subpattern, pattern_user_ty, f);
592 | PatternKind::Slice {
597 let from = u32::try_from(prefix.len()).unwrap();
598 let to = u32::try_from(suffix.len()).unwrap();
599 for subpattern in prefix {
600 self.visit_bindings(subpattern, pattern_user_ty.clone().index(), f);
602 for subpattern in slice {
603 self.visit_bindings(subpattern, pattern_user_ty.clone().subslice(from, to), f);
605 for subpattern in suffix {
606 self.visit_bindings(subpattern, pattern_user_ty.clone().index(), f);
610 PatternKind::Constant { .. } | PatternKind::Range { .. } | PatternKind::Wild => {}
612 PatternKind::Deref { ref subpattern } => {
613 self.visit_bindings(subpattern, pattern_user_ty.deref(), f);
616 PatternKind::AscribeUserType {
618 ascription: hair::pattern::Ascription {
624 // This corresponds to something like
627 // let A::<'a>(_): A<'static> = ...;
630 // Note that the variance doesn't apply here, as we are tracking the effect
631 // of `user_ty` on any bindings contained with subpattern.
632 let annotation = CanonicalUserTypeAnnotation {
634 user_ty: user_ty.user_ty,
635 inferred_ty: subpattern.ty,
637 let projection = UserTypeProjection {
638 base: self.canonical_user_type_annotations.push(annotation),
641 let subpattern_user_ty = pattern_user_ty.push_projection(&projection, user_ty_span);
642 self.visit_bindings(subpattern, subpattern_user_ty, f)
645 PatternKind::Leaf { ref subpatterns } => {
646 for subpattern in subpatterns {
647 let subpattern_user_ty = pattern_user_ty.clone().leaf(subpattern.field);
648 debug!("visit_bindings: subpattern_user_ty={:?}", subpattern_user_ty);
649 self.visit_bindings(&subpattern.pattern, subpattern_user_ty, f);
653 PatternKind::Variant { adt_def, substs: _, variant_index, ref subpatterns } => {
654 for subpattern in subpatterns {
655 let subpattern_user_ty = pattern_user_ty.clone().variant(
656 adt_def, variant_index, subpattern.field);
657 self.visit_bindings(&subpattern.pattern, subpattern_user_ty, f);
665 pub struct Candidate<'pat, 'tcx> {
666 // span of the original pattern that gave rise to this candidate
669 // all of these must be satisfied...
670 match_pairs: Vec<MatchPair<'pat, 'tcx>>,
672 // ...these bindings established...
673 bindings: Vec<Binding<'tcx>>,
675 // ...and these types asserted...
676 ascriptions: Vec<Ascription<'tcx>>,
678 // ...and the guard must be evaluated, if false branch to Block...
679 otherwise_block: Option<BasicBlock>,
681 // ...and the blocks for add false edges between candidates
682 pre_binding_block: BasicBlock,
683 next_candidate_pre_binding_block: Option<BasicBlock>,
686 #[derive(Clone, Debug)]
687 struct Binding<'tcx> {
693 mutability: Mutability,
694 binding_mode: BindingMode,
697 /// Indicates that the type of `source` must be a subtype of the
698 /// user-given type `user_ty`; this is basically a no-op but can
699 /// influence region inference.
700 #[derive(Clone, Debug)]
701 struct Ascription<'tcx> {
704 user_ty: PatternTypeProjection<'tcx>,
705 variance: ty::Variance,
708 #[derive(Clone, Debug)]
709 pub struct MatchPair<'pat, 'tcx> {
713 // ... must match this pattern.
714 pattern: &'pat Pattern<'tcx>,
717 #[derive(Clone, Debug, PartialEq)]
718 enum TestKind<'tcx> {
719 /// Test the branches of enum.
721 /// The enum being tested
722 adt_def: &'tcx ty::AdtDef,
723 /// The set of variants that we should create a branch for. We also
724 /// create an additional "otherwise" case.
725 variants: BitSet<VariantIdx>,
728 /// Test what value an `integer`, `bool` or `char` has.
730 /// The type of the value that we're testing.
732 /// The (ordered) set of values that we test for.
734 /// For integers and `char`s we create a branch to each of the values in
735 /// `options`, as well as an "otherwise" branch for all other values, even
736 /// in the (rare) case that options is exhaustive.
738 /// For `bool` we always generate two edges, one for `true` and one for
741 /// Reverse map used to ensure that the values in `options` are unique.
742 indices: FxHashMap<&'tcx ty::Const<'tcx>, usize>,
745 /// Test for equality with value, possibly after an unsizing coercion to
748 value: &'tcx ty::Const<'tcx>,
749 // Integer types are handled by `SwitchInt`, and constants with ADT
750 // types are converted back into patterns, so this can only be `&str`,
751 // `&[T]`, `f32` or `f64`.
755 /// Test whether the value falls within an inclusive or exclusive range
756 Range(PatternRange<'tcx>),
758 /// Test length of the slice is equal to len
766 pub struct Test<'tcx> {
768 kind: TestKind<'tcx>,
771 /// ArmHasGuard is isomorphic to a boolean flag. It indicates whether
772 /// a match arm has a guard expression attached to it.
773 #[derive(Copy, Clone, Debug)]
774 pub(crate) struct ArmHasGuard(pub bool);
776 ///////////////////////////////////////////////////////////////////////////
777 // Main matching algorithm
779 impl<'a, 'tcx> Builder<'a, 'tcx> {
780 /// The main match algorithm. It begins with a set of candidates
781 /// `candidates` and has the job of generating code to determine
782 /// which of these candidates, if any, is the correct one. The
783 /// candidates are sorted such that the first item in the list
784 /// has the highest priority. When a candidate is found to match
785 /// the value, we will generate a branch to the appropriate
786 /// prebinding block.
788 /// If we find that *NONE* of the candidates apply, we branch to the
789 /// `otherwise_block`. In principle, this means that the input list was not
790 /// exhaustive, though at present we sometimes are not smart enough to
791 /// recognize all exhaustive inputs.
793 /// It might be surprising that the input can be inexhaustive.
794 /// Indeed, initially, it is not, because all matches are
795 /// exhaustive in Rust. But during processing we sometimes divide
796 /// up the list of candidates and recurse with a non-exhaustive
797 /// list. This is important to keep the size of the generated code
798 /// under control. See `test_candidates` for more details.
800 /// If `fake_borrows` is Some, then places which need fake borrows
801 /// will be added to it.
802 fn match_candidates<'pat>(
805 start_block: &mut Option<BasicBlock>,
806 otherwise_block: Option<BasicBlock>,
807 candidates: &mut [&mut Candidate<'pat, 'tcx>],
808 fake_borrows: &mut Option<FxHashSet<Place<'tcx>>>,
811 "matched_candidate(span={:?}, candidates={:?}, start_block={:?}, otherwise_block={:?})",
818 // Start by simplifying candidates. Once this process is complete, all
819 // the match pairs which remain require some form of test, whether it
820 // be a switch or pattern comparison.
821 for candidate in &mut *candidates {
822 self.simplify_candidate(candidate);
825 // The candidates are sorted by priority. Check to see whether the
826 // higher priority candidates (and hence at the front of the slice)
827 // have satisfied all their match pairs.
828 let fully_matched = candidates
830 .take_while(|c| c.match_pairs.is_empty())
833 "match_candidates: {:?} candidates fully matched",
836 let (matched_candidates, unmatched_candidates) = candidates.split_at_mut(fully_matched);
838 let block: BasicBlock;
840 if !matched_candidates.is_empty() {
841 let otherwise_block = self.select_matched_candidates(
847 if let Some(last_otherwise_block) = otherwise_block {
848 block = last_otherwise_block
850 // Any remaining candidates are unreachable.
851 if unmatched_candidates.is_empty() {
854 block = self.cfg.start_new_block();
857 block = *start_block.get_or_insert_with(|| self.cfg.start_new_block());
860 // If there are no candidates that still need testing, we're
861 // done. Since all matches are exhaustive, execution should
862 // never reach this point.
863 if unmatched_candidates.is_empty() {
864 let source_info = self.source_info(span);
865 if let Some(otherwise) = otherwise_block {
869 TerminatorKind::Goto { target: otherwise },
875 TerminatorKind::Unreachable,
881 // Test for the remaining candidates.
882 self.test_candidates(
884 unmatched_candidates,
891 /// Link up matched candidates. For example, if we have something like
895 /// Some(x) if cond => ...
897 /// Some(x) if cond => ...
900 /// We generate real edges from:
901 /// * `block` to the prebinding_block of the first pattern,
902 /// * the otherwise block of the first pattern to the second pattern,
903 /// * the otherwise block of the third pattern to the a block with an
904 /// Unreachable terminator.
906 /// As well as that we add fake edges from the otherwise blocks to the
907 /// prebinding block of the next candidate in the original set of
909 fn select_matched_candidates(
911 matched_candidates: &mut [&mut Candidate<'_, 'tcx>],
912 start_block: &mut Option<BasicBlock>,
913 fake_borrows: &mut Option<FxHashSet<Place<'tcx>>>,
914 ) -> Option<BasicBlock> {
916 !matched_candidates.is_empty(),
917 "select_matched_candidates called with no candidates",
920 // Insert a borrows of prefixes of places that are bound and are
921 // behind a dereference projection.
923 // These borrows are taken to avoid situations like the following:
926 // _ if { x = &[0]; false } => (),
927 // y => (), // Out of bounds array access!
931 // // y is bound by reference in the guard and then by copy in the
932 // // arm, so y is 2 in the arm!
933 // y if { y == 1 && (x = &2) == () } => y,
936 if let Some(fake_borrows) = fake_borrows {
937 for Binding { source, .. }
938 in matched_candidates.iter().flat_map(|candidate| &candidate.bindings)
940 let mut cursor = &source.projection;
941 while let Some(box Projection { base, elem }) = cursor {
943 if let ProjectionElem::Deref = elem {
944 fake_borrows.insert(Place {
945 base: source.base.clone(),
946 projection: cursor.clone(),
954 let fully_matched_with_guard = matched_candidates
956 .position(|c| c.otherwise_block.is_none())
957 .unwrap_or(matched_candidates.len() - 1);
959 let (reachable_candidates, unreachable_candidates)
960 = matched_candidates.split_at_mut(fully_matched_with_guard + 1);
962 let first_candidate = &reachable_candidates[0];
963 let first_prebinding_block = first_candidate.pre_binding_block;
965 if let Some(start_block) = *start_block {
966 let source_info = self.source_info(first_candidate.span);
970 TerminatorKind::Goto { target: first_prebinding_block },
973 *start_block = Some(first_prebinding_block);
976 for window in reachable_candidates.windows(2) {
977 if let [first_candidate, second_candidate] = window {
978 let source_info = self.source_info(first_candidate.span);
979 if let Some(otherwise_block) = first_candidate.otherwise_block {
982 second_candidate.pre_binding_block,
983 first_candidate.next_candidate_pre_binding_block,
987 bug!("candidate other than the last has no guard");
990 bug!("<[_]>::windows returned incorrectly sized window");
994 debug!("match_candidates: add false edges for unreachable {:?}", unreachable_candidates);
995 for candidate in unreachable_candidates {
996 if let Some(otherwise) = candidate.otherwise_block {
997 let source_info = self.source_info(candidate.span);
998 let unreachable = self.cfg.start_new_block();
1002 candidate.next_candidate_pre_binding_block,
1005 self.cfg.terminate(unreachable, source_info, TerminatorKind::Unreachable);
1009 let last_candidate = reachable_candidates.last().unwrap();
1011 if let Some(otherwise) = last_candidate.otherwise_block {
1012 let source_info = self.source_info(last_candidate.span);
1013 let block = self.cfg.start_new_block();
1017 last_candidate.next_candidate_pre_binding_block,
1026 /// This is the most subtle part of the matching algorithm. At
1027 /// this point, the input candidates have been fully simplified,
1028 /// and so we know that all remaining match-pairs require some
1029 /// sort of test. To decide what test to do, we take the highest
1030 /// priority candidate (last one in the list) and extract the
1031 /// first match-pair from the list. From this we decide what kind
1032 /// of test is needed using `test`, defined in the `test` module.
1034 /// *Note:* taking the first match pair is somewhat arbitrary, and
1035 /// we might do better here by choosing more carefully what to
1038 /// For example, consider the following possible match-pairs:
1040 /// 1. `x @ Some(P)` -- we will do a `Switch` to decide what variant `x` has
1041 /// 2. `x @ 22` -- we will do a `SwitchInt`
1042 /// 3. `x @ 3..5` -- we will do a range test
1045 /// Once we know what sort of test we are going to perform, this
1046 /// Tests may also help us with other candidates. So we walk over
1047 /// the candidates (from high to low priority) and check. This
1048 /// gives us, for each outcome of the test, a transformed list of
1049 /// candidates. For example, if we are testing the current
1050 /// variant of `x.0`, and we have a candidate `{x.0 @ Some(v), x.1
1051 /// @ 22}`, then we would have a resulting candidate of `{(x.0 as
1052 /// Some).0 @ v, x.1 @ 22}`. Note that the first match-pair is now
1053 /// simpler (and, in fact, irrefutable).
1055 /// But there may also be candidates that the test just doesn't
1056 /// apply to. The classical example involves wildcards:
1059 /// # let (x, y, z) = (true, true, true);
1060 /// match (x, y, z) {
1061 /// (true, _, true) => true, // (0)
1062 /// (_, true, _) => true, // (1)
1063 /// (false, false, _) => false, // (2)
1064 /// (true, _, false) => false, // (3)
1068 /// In that case, after we test on `x`, there are 2 overlapping candidate
1071 /// - If the outcome is that `x` is true, candidates 0, 1, and 3
1072 /// - If the outcome is that `x` is false, candidates 1 and 2
1074 /// Here, the traditional "decision tree" method would generate 2
1075 /// separate code-paths for the 2 separate cases.
1077 /// In some cases, this duplication can create an exponential amount of
1078 /// code. This is most easily seen by noticing that this method terminates
1079 /// with precisely the reachable arms being reachable - but that problem
1080 /// is trivially NP-complete:
1083 /// match (var0, var1, var2, var3, ..) {
1084 /// (true, _, _, false, true, ...) => false,
1085 /// (_, true, true, false, _, ...) => false,
1086 /// (false, _, false, false, _, ...) => false,
1092 /// Here the last arm is reachable only if there is an assignment to
1093 /// the variables that does not match any of the literals. Therefore,
1094 /// compilation would take an exponential amount of time in some cases.
1096 /// That kind of exponential worst-case might not occur in practice, but
1097 /// our simplistic treatment of constants and guards would make it occur
1098 /// in very common situations - for example #29740:
1102 /// "foo" if foo_guard => ...,
1103 /// "bar" if bar_guard => ...,
1104 /// "baz" if baz_guard => ...,
1109 /// Here we first test the match-pair `x @ "foo"`, which is an `Eq` test.
1111 /// It might seem that we would end up with 2 disjoint candidate
1112 /// sets, consisting of the first candidate or the other 3, but our
1113 /// algorithm doesn't reason about "foo" being distinct from the other
1114 /// constants; it considers the latter arms to potentially match after
1115 /// both outcomes, which obviously leads to an exponential amount
1118 /// To avoid these kinds of problems, our algorithm tries to ensure
1119 /// the amount of generated tests is linear. When we do a k-way test,
1120 /// we return an additional "unmatched" set alongside the obvious `k`
1121 /// sets. When we encounter a candidate that would be present in more
1122 /// than one of the sets, we put it and all candidates below it into the
1123 /// "unmatched" set. This ensures these `k+1` sets are disjoint.
1125 /// After we perform our test, we branch into the appropriate candidate
1126 /// set and recurse with `match_candidates`. These sub-matches are
1127 /// obviously inexhaustive - as we discarded our otherwise set - so
1128 /// we set their continuation to do `match_candidates` on the
1129 /// "unmatched" set (which is again inexhaustive).
1131 /// If you apply this to the above test, you basically wind up
1132 /// with an if-else-if chain, testing each candidate in turn,
1133 /// which is precisely what we want.
1135 /// In addition to avoiding exponential-time blowups, this algorithm
1136 /// also has nice property that each guard and arm is only generated
1138 fn test_candidates<'pat, 'b, 'c>(
1141 mut candidates: &'b mut [&'c mut Candidate<'pat, 'tcx>],
1143 mut otherwise_block: Option<BasicBlock>,
1144 fake_borrows: &mut Option<FxHashSet<Place<'tcx>>>,
1146 // extract the match-pair from the highest priority candidate
1147 let match_pair = &candidates.first().unwrap().match_pairs[0];
1148 let mut test = self.test(match_pair);
1149 let match_place = match_pair.place.clone();
1151 // most of the time, the test to perform is simply a function
1152 // of the main candidate; but for a test like SwitchInt, we
1153 // may want to add cases based on the candidates that are
1156 TestKind::SwitchInt {
1161 for candidate in candidates.iter() {
1162 if !self.add_cases_to_switch(
1177 for candidate in candidates.iter() {
1178 if !self.add_variants_to_switch(&match_place, candidate, variants) {
1186 // Insert a Shallow borrow of any places that is switched on.
1187 fake_borrows.as_mut().map(|fb| {
1188 fb.insert(match_place.clone())
1191 // perform the test, branching to one of N blocks. For each of
1192 // those N possible outcomes, create a (initially empty)
1193 // vector of candidates. Those are the candidates that still
1194 // apply if the test has that particular outcome.
1196 "match_candidates: test={:?} match_pair={:?}",
1199 let mut target_candidates: Vec<Vec<&mut Candidate<'pat, 'tcx>>> = vec![];
1200 target_candidates.resize_with(test.targets(), Default::default);
1202 let total_candidate_count = candidates.len();
1204 // Sort the candidates into the appropriate vector in
1205 // `target_candidates`. Note that at some point we may
1206 // encounter a candidate where the test is not relevant; at
1207 // that point, we stop sorting.
1208 while let Some(candidate) = candidates.first_mut() {
1209 if let Some(idx) = self.sort_candidate(&match_place, &test, candidate) {
1210 let (candidate, rest) = candidates.split_first_mut().unwrap();
1211 target_candidates[idx].push(candidate);
1217 // at least the first candidate ought to be tested
1218 assert!(total_candidate_count > candidates.len());
1219 debug!("tested_candidates: {}", total_candidate_count - candidates.len());
1220 debug!("untested_candidates: {}", candidates.len());
1222 // HACK(matthewjasper) This is a closure so that we can let the test
1223 // create its blocks before the rest of the match. This currently
1224 // improves the speed of llvm when optimizing long string literal
1226 let make_target_blocks = move |this: &mut Self| -> Vec<BasicBlock> {
1227 // For each outcome of test, process the candidates that still
1228 // apply. Collect a list of blocks where control flow will
1229 // branch if one of the `target_candidate` sets is not
1231 if !candidates.is_empty() {
1232 let remainder_start = &mut None;
1233 this.match_candidates(
1240 otherwise_block = Some(remainder_start.unwrap());
1243 target_candidates.into_iter().map(|mut candidates| {
1244 if candidates.len() != 0 {
1245 let candidate_start = &mut None;
1246 this.match_candidates(
1253 candidate_start.unwrap()
1255 *otherwise_block.get_or_insert_with(|| {
1256 let unreachable = this.cfg.start_new_block();
1257 let source_info = this.source_info(span);
1261 TerminatorKind::Unreachable,
1277 // Determine the fake borrows that are needed to ensure that the place
1278 // will evaluate to the same thing until an arm has been chosen.
1279 fn calculate_fake_borrows<'b>(
1281 fake_borrows: &'b FxHashSet<Place<'tcx>>,
1283 ) -> Vec<(PlaceRef<'b, 'tcx>, Local)> {
1284 let tcx = self.hir.tcx();
1286 debug!("add_fake_borrows fake_borrows = {:?}", fake_borrows);
1288 let mut all_fake_borrows = Vec::with_capacity(fake_borrows.len());
1290 // Insert a Shallow borrow of the prefixes of any fake borrows.
1291 for place in fake_borrows
1293 let mut prefix_cursor = &place.projection;
1294 while let Some(box Projection { base, elem }) = prefix_cursor {
1295 if let ProjectionElem::Deref = elem {
1296 // Insert a shallow borrow after a deref. For other
1297 // projections the borrow of prefix_cursor will
1298 // conflict with any mutation of base.
1299 all_fake_borrows.push(PlaceRef {
1304 prefix_cursor = base;
1307 all_fake_borrows.push(place.as_place_ref());
1310 // Deduplicate and ensure a deterministic order.
1311 all_fake_borrows.sort();
1312 all_fake_borrows.dedup();
1314 debug!("add_fake_borrows all_fake_borrows = {:?}", all_fake_borrows);
1316 all_fake_borrows.into_iter().map(|matched_place| {
1317 let fake_borrow_deref_ty = Place::ty_from(
1319 matched_place.projection,
1324 let fake_borrow_ty = tcx.mk_imm_ref(tcx.lifetimes.re_erased, fake_borrow_deref_ty);
1325 let fake_borrow_temp = self.local_decls.push(
1326 LocalDecl::new_temp(fake_borrow_ty, temp_span)
1329 (matched_place, fake_borrow_temp)
1334 ///////////////////////////////////////////////////////////////////////////
1335 // Pattern binding - used for `let` and function parameters as well.
1337 impl<'a, 'tcx> Builder<'a, 'tcx> {
1338 /// Initializes each of the bindings from the candidate by
1339 /// moving/copying/ref'ing the source as appropriate. Tests the guard, if
1340 /// any, and then branches to the arm. Returns the block for the case where
1341 /// the guard fails.
1343 /// Note: we check earlier that if there is a guard, there cannot be move
1344 /// bindings (unless feature(bind_by_move_pattern_guards) is used). This
1345 /// isn't really important for the self-consistency of this fn, but the
1346 /// reason for it should be clear: after we've done the assignments, if
1347 /// there were move bindings, further tests would be a use-after-move.
1348 /// bind_by_move_pattern_guards avoids this by only moving the binding once
1349 /// the guard has evaluated to true (see below).
1350 fn bind_and_guard_matched_candidate<'pat>(
1352 candidate: Candidate<'pat, 'tcx>,
1353 guard: Option<Guard<'tcx>>,
1354 fake_borrows: &Vec<(PlaceRef<'_, 'tcx>, Local)>,
1355 scrutinee_span: Span,
1356 region_scope: region::Scope,
1358 debug!("bind_and_guard_matched_candidate(candidate={:?})", candidate);
1360 debug_assert!(candidate.match_pairs.is_empty());
1362 let candidate_source_info = self.source_info(candidate.span);
1364 let mut block = candidate.pre_binding_block;
1366 // If we are adding our own statements, then we need a fresh block.
1367 let create_fresh_block = candidate.next_candidate_pre_binding_block.is_some()
1368 || !candidate.bindings.is_empty()
1369 || !candidate.ascriptions.is_empty()
1372 if create_fresh_block {
1373 let fresh_block = self.cfg.start_new_block();
1377 candidate.next_candidate_pre_binding_block,
1378 candidate_source_info,
1380 block = fresh_block;
1381 self.ascribe_types(block, &candidate.ascriptions);
1386 // rust-lang/rust#27282: The `autoref` business deserves some
1387 // explanation here.
1389 // The intent of the `autoref` flag is that when it is true,
1390 // then any pattern bindings of type T will map to a `&T`
1391 // within the context of the guard expression, but will
1392 // continue to map to a `T` in the context of the arm body. To
1393 // avoid surfacing this distinction in the user source code
1394 // (which would be a severe change to the language and require
1395 // far more revision to the compiler), when `autoref` is true,
1396 // then any occurrence of the identifier in the guard
1397 // expression will automatically get a deref op applied to it.
1399 // So an input like:
1402 // let place = Foo::new();
1403 // match place { foo if inspect(foo)
1404 // => feed(foo), ... }
1407 // will be treated as if it were really something like:
1410 // let place = Foo::new();
1411 // match place { Foo { .. } if { let tmp1 = &place; inspect(*tmp1) }
1412 // => { let tmp2 = place; feed(tmp2) }, ... }
1414 // And an input like:
1417 // let place = Foo::new();
1418 // match place { ref mut foo if inspect(foo)
1419 // => feed(foo), ... }
1422 // will be treated as if it were really something like:
1425 // let place = Foo::new();
1426 // match place { Foo { .. } if { let tmp1 = & &mut place; inspect(*tmp1) }
1427 // => { let tmp2 = &mut place; feed(tmp2) }, ... }
1430 // In short, any pattern binding will always look like *some*
1431 // kind of `&T` within the guard at least in terms of how the
1432 // MIR-borrowck views it, and this will ensure that guard
1433 // expressions cannot mutate their the match inputs via such
1434 // bindings. (It also ensures that guard expressions can at
1435 // most *copy* values from such bindings; non-Copy things
1436 // cannot be moved via pattern bindings in guard expressions.)
1440 // Implementation notes (under assumption `autoref` is true).
1442 // To encode the distinction above, we must inject the
1443 // temporaries `tmp1` and `tmp2`.
1445 // There are two cases of interest: binding by-value, and binding by-ref.
1447 // 1. Binding by-value: Things are simple.
1449 // * Establishing `tmp1` creates a reference into the
1450 // matched place. This code is emitted by
1451 // bind_matched_candidate_for_guard.
1453 // * `tmp2` is only initialized "lazily", after we have
1454 // checked the guard. Thus, the code that can trigger
1455 // moves out of the candidate can only fire after the
1456 // guard evaluated to true. This initialization code is
1457 // emitted by bind_matched_candidate_for_arm.
1459 // 2. Binding by-reference: Things are tricky.
1461 // * Here, the guard expression wants a `&&` or `&&mut`
1462 // into the original input. This means we need to borrow
1463 // the reference that we create for the arm.
1464 // * So we eagerly create the reference for the arm and then take a
1465 // reference to that.
1466 if let Some(guard) = guard {
1467 let tcx = self.hir.tcx();
1469 self.bind_matched_candidate_for_guard(
1471 &candidate.bindings,
1473 let guard_frame = GuardFrame {
1477 .map(|b| GuardFrameLocal::new(b.var_id, b.binding_mode))
1480 debug!("entering guard building context: {:?}", guard_frame);
1481 self.guard_context.push(guard_frame);
1483 let re_erased = tcx.lifetimes.re_erased;
1484 let scrutinee_source_info = self.source_info(scrutinee_span);
1485 for (place, temp) in fake_borrows {
1486 let borrow = Rvalue::Ref(
1488 BorrowKind::Shallow,
1490 base: place.base.clone(),
1491 projection: place.projection.clone(),
1494 self.cfg.push_assign(
1496 scrutinee_source_info,
1497 &Place::from(*temp),
1502 // the block to branch to if the guard fails; if there is no
1503 // guard, this block is simply unreachable
1504 let guard = match guard {
1505 Guard::If(e) => self.hir.mirror(e),
1507 let source_info = self.source_info(guard.span);
1508 let guard_end = self.source_info(tcx.sess.source_map().end_point(guard.span));
1509 let (post_guard_block, otherwise_post_guard_block)
1510 = self.test_bool(block, guard, source_info);
1511 let guard_frame = self.guard_context.pop().unwrap();
1513 "Exiting guard building context with locals: {:?}",
1517 for &(_, temp) in fake_borrows {
1518 self.cfg.push(post_guard_block, Statement {
1519 source_info: guard_end,
1520 kind: StatementKind::FakeRead(
1521 FakeReadCause::ForMatchGuard,
1530 otherwise_post_guard_block,
1531 candidate.otherwise_block.unwrap(),
1534 // We want to ensure that the matched candidates are bound
1535 // after we have confirmed this candidate *and* any
1536 // associated guard; Binding them on `block` is too soon,
1537 // because that would be before we've checked the result
1540 // But binding them on the arm is *too late*, because
1541 // then all of the candidates for a single arm would be
1542 // bound in the same place, that would cause a case like:
1546 // (mut x, 1) | (2, mut x) if { true } => { ... }
1547 // ... // ^^^^^^^ (this is `arm_block`)
1551 // would yield a `arm_block` something like:
1554 // StorageLive(_4); // _4 is `x`
1555 // _4 = &mut (_1.0: i32); // this is handling `(mut x, 1)` case
1556 // _4 = &mut (_1.1: i32); // this is handling `(2, mut x)` case
1559 // and that is clearly not correct.
1560 let by_value_bindings = candidate.bindings.iter().filter(|binding| {
1561 if let BindingMode::ByValue = binding.binding_mode { true } else { false }
1563 // Read all of the by reference bindings to ensure that the
1564 // place they refer to can't be modified by the guard.
1565 for binding in by_value_bindings.clone() {
1566 let local_id = self.var_local_id(binding.var_id, RefWithinGuard);
1567 let place = Place::from(local_id);
1571 source_info: guard_end,
1572 kind: StatementKind::FakeRead(FakeReadCause::ForGuardBinding, place),
1576 self.bind_matched_candidate_for_arm_body(
1583 assert!(candidate.otherwise_block.is_none());
1584 // (Here, it is not too early to bind the matched
1585 // candidate on `block`, because there is no guard result
1586 // that we have to inspect before we bind them.)
1587 self.bind_matched_candidate_for_arm_body(block, &candidate.bindings);
1592 /// Append `AscribeUserType` statements onto the end of `block`
1593 /// for each ascription
1594 fn ascribe_types(&mut self, block: BasicBlock, ascriptions: &[Ascription<'tcx>]) {
1595 for ascription in ascriptions {
1596 let source_info = self.source_info(ascription.span);
1599 "adding user ascription at span {:?} of place {:?} and {:?}",
1605 let user_ty = box ascription.user_ty.clone().user_ty(
1606 &mut self.canonical_user_type_annotations,
1607 ascription.source.ty(&self.local_decls, self.hir.tcx()).ty,
1614 kind: StatementKind::AscribeUserType(
1615 ascription.source.clone(),
1616 ascription.variance,
1624 fn bind_matched_candidate_for_guard(
1627 bindings: &[Binding<'tcx>],
1629 debug!("bind_matched_candidate_for_guard(block={:?}, bindings={:?})", block, bindings);
1631 // Assign each of the bindings. Since we are binding for a
1632 // guard expression, this will never trigger moves out of the
1634 let re_erased = self.hir.tcx().lifetimes.re_erased;
1635 for binding in bindings {
1636 let source_info = self.source_info(binding.span);
1638 // For each pattern ident P of type T, `ref_for_guard` is
1639 // a reference R: &T pointing to the location matched by
1640 // the pattern, and every occurrence of P within a guard
1643 self.storage_live_binding(block, binding.var_id, binding.span, RefWithinGuard);
1644 match binding.binding_mode {
1645 BindingMode::ByValue => {
1646 let rvalue = Rvalue::Ref(re_erased, BorrowKind::Shared, binding.source.clone());
1648 .push_assign(block, source_info, &ref_for_guard, rvalue);
1650 BindingMode::ByRef(borrow_kind) => {
1651 let value_for_arm = self.storage_live_binding(
1658 let rvalue = Rvalue::Ref(re_erased, borrow_kind, binding.source.clone());
1660 .push_assign(block, source_info, &value_for_arm, rvalue);
1661 let rvalue = Rvalue::Ref(re_erased, BorrowKind::Shared, value_for_arm);
1663 .push_assign(block, source_info, &ref_for_guard, rvalue);
1669 fn bind_matched_candidate_for_arm_body<'b>(
1672 bindings: impl IntoIterator<Item = &'b Binding<'tcx>>,
1674 debug!("bind_matched_candidate_for_arm_body(block={:?})", block);
1676 let re_erased = self.hir.tcx().lifetimes.re_erased;
1677 // Assign each of the bindings. This may trigger moves out of the candidate.
1678 for binding in bindings {
1679 let source_info = self.source_info(binding.span);
1681 self.storage_live_binding(block, binding.var_id, binding.span, OutsideGuard);
1682 self.schedule_drop_for_binding(binding.var_id, binding.span, OutsideGuard);
1683 let rvalue = match binding.binding_mode {
1684 BindingMode::ByValue => {
1685 Rvalue::Use(self.consume_by_copy_or_move(binding.source.clone()))
1687 BindingMode::ByRef(borrow_kind) => {
1688 Rvalue::Ref(re_erased, borrow_kind, binding.source.clone())
1691 self.cfg.push_assign(block, source_info, &local, rvalue);
1695 /// Each binding (`ref mut var`/`ref var`/`mut var`/`var`, where the bound
1696 /// `var` has type `T` in the arm body) in a pattern maps to 2 locals. The
1697 /// first local is a binding for occurrences of `var` in the guard, which
1698 /// will have type `&T`. The second local is a binding for occurrences of
1699 /// `var` in the arm body, which will have type `T`.
1702 source_info: SourceInfo,
1703 visibility_scope: SourceScope,
1704 mutability: Mutability,
1709 user_ty: UserTypeProjections,
1710 has_guard: ArmHasGuard,
1711 opt_match_place: Option<(Option<Place<'tcx>>, Span)>,
1715 "declare_binding(var_id={:?}, name={:?}, mode={:?}, var_ty={:?}, \
1716 visibility_scope={:?}, source_info={:?})",
1717 var_id, name, mode, var_ty, visibility_scope, source_info
1720 let tcx = self.hir.tcx();
1721 let binding_mode = match mode {
1722 BindingMode::ByValue => ty::BindingMode::BindByValue(mutability.into()),
1723 BindingMode::ByRef(_) => ty::BindingMode::BindByReference(mutability.into()),
1725 debug!("declare_binding: user_ty={:?}", user_ty);
1726 let local = LocalDecl::<'tcx> {
1734 is_block_tail: None,
1735 is_user_variable: Some(ClearCrossCrate::Set(BindingForm::Var(VarBindingForm {
1737 // hypothetically, `visit_bindings` could try to unzip
1738 // an outermost hir::Ty as we descend, matching up
1739 // idents in pat; but complex w/ unclear UI payoff.
1740 // Instead, just abandon providing diagnostic info.
1746 let for_arm_body = self.local_decls.push(local);
1747 let locals = if has_guard.0 {
1748 let ref_for_guard = self.local_decls.push(LocalDecl::<'tcx> {
1749 // This variable isn't mutated but has a name, so has to be
1750 // immutable to avoid the unused mut lint.
1751 mutability: Mutability::Not,
1752 ty: tcx.mk_imm_ref(tcx.lifetimes.re_erased, var_ty),
1753 user_ty: UserTypeProjections::none(),
1758 is_block_tail: None,
1759 is_user_variable: Some(ClearCrossCrate::Set(BindingForm::RefForGuard)),
1761 LocalsForNode::ForGuard {
1766 LocalsForNode::One(for_arm_body)
1768 debug!("declare_binding: vars={:?}", locals);
1769 self.var_indices.insert(var_id, locals);