1 //! This is the implementation of the pass which transforms generators into state machines.
3 //! MIR generation for generators creates a function which has a self argument which
4 //! passes by value. This argument is effectively a generator type which only contains upvars and
5 //! is only used for this argument inside the MIR for the generator.
6 //! It is passed by value to enable upvars to be moved out of it. Drop elaboration runs on that
7 //! MIR before this pass and creates drop flags for MIR locals.
8 //! It will also drop the generator argument (which only consists of upvars) if any of the upvars
9 //! are moved out of. This pass elaborates the drops of upvars / generator argument in the case
10 //! that none of the upvars were moved out of. This is because we cannot have any drops of this
11 //! generator in the MIR, since it is used to create the drop glue for the generator. We'd get
12 //! infinite recursion otherwise.
14 //! This pass creates the implementation for the Generator::resume function and the drop shim
15 //! for the generator based on the MIR input. It converts the generator argument from Self to
16 //! &mut Self adding derefs in the MIR as needed. It computes the final layout of the generator
17 //! struct which looks like this:
18 //! First upvars are stored
19 //! It is followed by the generator state field.
20 //! Then finally the MIR locals which are live across a suspension point are stored.
22 //! struct Generator {
28 //! This pass computes the meaning of the state field and the MIR locals which are live
29 //! across a suspension point. There are however three hardcoded generator states:
30 //! 0 - Generator have not been resumed yet
31 //! 1 - Generator has returned / is completed
32 //! 2 - Generator has been poisoned
34 //! It also rewrites `return x` and `yield y` as setting a new generator state and returning
35 //! GeneratorState::Complete(x) and GeneratorState::Yielded(y) respectively.
36 //! MIR locals which are live across a suspension point are moved to the generator struct
37 //! with references to them being updated with references to the generator struct.
39 //! The pass creates two functions which have a switch on the generator state giving
40 //! the action to take.
42 //! One of them is the implementation of Generator::resume.
43 //! For generators with state 0 (unresumed) it starts the execution of the generator.
44 //! For generators with state 1 (returned) and state 2 (poisoned) it panics.
45 //! Otherwise it continues the execution from the last suspension point.
47 //! The other function is the drop glue for the generator.
48 //! For generators with state 0 (unresumed) it drops the upvars of the generator.
49 //! For generators with state 1 (returned) and state 2 (poisoned) it does nothing.
50 //! Otherwise it drops all the values in scope at the last suspension point.
53 use crate::util::expand_aggregate;
55 use rustc_data_structures::fx::FxHashMap;
57 use rustc_hir::lang_items::LangItem;
58 use rustc_index::bit_set::{BitMatrix, BitSet};
59 use rustc_index::vec::{Idx, IndexVec};
60 use rustc_middle::mir::dump_mir;
61 use rustc_middle::mir::visit::{MutVisitor, PlaceContext, Visitor};
62 use rustc_middle::mir::*;
63 use rustc_middle::ty::subst::{Subst, SubstsRef};
64 use rustc_middle::ty::GeneratorSubsts;
65 use rustc_middle::ty::{self, AdtDef, Ty, TyCtxt};
66 use rustc_mir_dataflow::impls::{
67 MaybeBorrowedLocals, MaybeLiveLocals, MaybeRequiresStorage, MaybeStorageLive,
69 use rustc_mir_dataflow::storage;
70 use rustc_mir_dataflow::{self, Analysis};
71 use rustc_target::abi::VariantIdx;
72 use rustc_target::spec::PanicStrategy;
75 pub struct StateTransform;
77 struct RenameLocalVisitor<'tcx> {
83 impl<'tcx> MutVisitor<'tcx> for RenameLocalVisitor<'tcx> {
84 fn tcx(&self) -> TyCtxt<'tcx> {
88 fn visit_local(&mut self, local: &mut Local, _: PlaceContext, _: Location) {
89 if *local == self.from {
94 fn visit_terminator(&mut self, terminator: &mut Terminator<'tcx>, location: Location) {
95 match terminator.kind {
96 TerminatorKind::Return => {
97 // Do not replace the implicit `_0` access here, as that's not possible. The
98 // transform already handles `return` correctly.
100 _ => self.super_terminator(terminator, location),
105 struct DerefArgVisitor<'tcx> {
109 impl<'tcx> MutVisitor<'tcx> for DerefArgVisitor<'tcx> {
110 fn tcx(&self) -> TyCtxt<'tcx> {
114 fn visit_local(&mut self, local: &mut Local, _: PlaceContext, _: Location) {
115 assert_ne!(*local, SELF_ARG);
118 fn visit_place(&mut self, place: &mut Place<'tcx>, context: PlaceContext, location: Location) {
119 if place.local == SELF_ARG {
124 projection: self.tcx().intern_place_elems(&[ProjectionElem::Deref]),
129 self.visit_local(&mut place.local, context, location);
131 for elem in place.projection.iter() {
132 if let PlaceElem::Index(local) = elem {
133 assert_ne!(local, SELF_ARG);
140 struct PinArgVisitor<'tcx> {
141 ref_gen_ty: Ty<'tcx>,
145 impl<'tcx> MutVisitor<'tcx> for PinArgVisitor<'tcx> {
146 fn tcx(&self) -> TyCtxt<'tcx> {
150 fn visit_local(&mut self, local: &mut Local, _: PlaceContext, _: Location) {
151 assert_ne!(*local, SELF_ARG);
154 fn visit_place(&mut self, place: &mut Place<'tcx>, context: PlaceContext, location: Location) {
155 if place.local == SELF_ARG {
160 projection: self.tcx().intern_place_elems(&[ProjectionElem::Field(
168 self.visit_local(&mut place.local, context, location);
170 for elem in place.projection.iter() {
171 if let PlaceElem::Index(local) = elem {
172 assert_ne!(local, SELF_ARG);
179 fn replace_base<'tcx>(place: &mut Place<'tcx>, new_base: Place<'tcx>, tcx: TyCtxt<'tcx>) {
180 place.local = new_base.local;
182 let mut new_projection = new_base.projection.to_vec();
183 new_projection.append(&mut place.projection.to_vec());
185 place.projection = tcx.intern_place_elems(&new_projection);
188 const SELF_ARG: Local = Local::from_u32(1);
190 /// Generator has not been resumed yet.
191 const UNRESUMED: usize = GeneratorSubsts::UNRESUMED;
192 /// Generator has returned / is completed.
193 const RETURNED: usize = GeneratorSubsts::RETURNED;
194 /// Generator has panicked and is poisoned.
195 const POISONED: usize = GeneratorSubsts::POISONED;
197 /// A `yield` point in the generator.
198 struct SuspensionPoint<'tcx> {
199 /// State discriminant used when suspending or resuming at this point.
201 /// The block to jump to after resumption.
203 /// Where to move the resume argument after resumption.
204 resume_arg: Place<'tcx>,
205 /// Which block to jump to if the generator is dropped in this state.
206 drop: Option<BasicBlock>,
207 /// Set of locals that have live storage while at this suspension point.
208 storage_liveness: BitSet<Local>,
211 struct TransformVisitor<'tcx> {
213 state_adt_ref: &'tcx AdtDef,
214 state_substs: SubstsRef<'tcx>,
216 // The type of the discriminant in the generator struct
219 // Mapping from Local to (type of local, generator struct index)
220 // FIXME(eddyb) This should use `IndexVec<Local, Option<_>>`.
221 remap: FxHashMap<Local, (Ty<'tcx>, VariantIdx, usize)>,
223 // A map from a suspension point in a block to the locals which have live storage at that point
224 storage_liveness: IndexVec<BasicBlock, Option<BitSet<Local>>>,
226 // A list of suspension points, generated during the transform
227 suspension_points: Vec<SuspensionPoint<'tcx>>,
229 // The set of locals that have no `StorageLive`/`StorageDead` annotations.
230 always_live_locals: storage::AlwaysLiveLocals,
232 // The original RETURN_PLACE local
233 new_ret_local: Local,
236 impl<'tcx> TransformVisitor<'tcx> {
237 // Make a GeneratorState variant assignment. `core::ops::GeneratorState` only has single
238 // element tuple variants, so we can just write to the downcasted first field and then set the
239 // discriminant to the appropriate variant.
244 source_info: SourceInfo,
245 ) -> impl Iterator<Item = Statement<'tcx>> {
246 let kind = AggregateKind::Adt(self.state_adt_ref, idx, self.state_substs, None, None);
247 assert_eq!(self.state_adt_ref.variants[idx].fields.len(), 1);
250 .type_of(self.state_adt_ref.variants[idx].fields[0].did)
251 .subst(self.tcx, self.state_substs);
253 Place::return_place(),
254 std::iter::once((val, ty)),
261 // Create a Place referencing a generator struct field
262 fn make_field(&self, variant_index: VariantIdx, idx: usize, ty: Ty<'tcx>) -> Place<'tcx> {
263 let self_place = Place::from(SELF_ARG);
264 let base = self.tcx.mk_place_downcast_unnamed(self_place, variant_index);
265 let mut projection = base.projection.to_vec();
266 projection.push(ProjectionElem::Field(Field::new(idx), ty));
268 Place { local: base.local, projection: self.tcx.intern_place_elems(&projection) }
271 // Create a statement which changes the discriminant
272 fn set_discr(&self, state_disc: VariantIdx, source_info: SourceInfo) -> Statement<'tcx> {
273 let self_place = Place::from(SELF_ARG);
276 kind: StatementKind::SetDiscriminant {
277 place: Box::new(self_place),
278 variant_index: state_disc,
283 // Create a statement which reads the discriminant into a temporary
284 fn get_discr(&self, body: &mut Body<'tcx>) -> (Statement<'tcx>, Place<'tcx>) {
285 let temp_decl = LocalDecl::new(self.discr_ty, body.span).internal();
286 let local_decls_len = body.local_decls.push(temp_decl);
287 let temp = Place::from(local_decls_len);
289 let self_place = Place::from(SELF_ARG);
290 let assign = Statement {
291 source_info: SourceInfo::outermost(body.span),
292 kind: StatementKind::Assign(Box::new((temp, Rvalue::Discriminant(self_place)))),
298 impl<'tcx> MutVisitor<'tcx> for TransformVisitor<'tcx> {
299 fn tcx(&self) -> TyCtxt<'tcx> {
303 fn visit_local(&mut self, local: &mut Local, _: PlaceContext, _: Location) {
304 assert_eq!(self.remap.get(local), None);
309 place: &mut Place<'tcx>,
310 _context: PlaceContext,
313 // Replace an Local in the remap with a generator struct access
314 if let Some(&(ty, variant_index, idx)) = self.remap.get(&place.local) {
315 replace_base(place, self.make_field(variant_index, idx, ty), self.tcx);
319 fn visit_basic_block_data(&mut self, block: BasicBlock, data: &mut BasicBlockData<'tcx>) {
320 // Remove StorageLive and StorageDead statements for remapped locals
321 data.retain_statements(|s| match s.kind {
322 StatementKind::StorageLive(l) | StatementKind::StorageDead(l) => {
323 !self.remap.contains_key(&l)
328 let ret_val = match data.terminator().kind {
329 TerminatorKind::Return => Some((
332 Operand::Move(Place::from(self.new_ret_local)),
335 TerminatorKind::Yield { ref value, resume, resume_arg, drop } => {
336 Some((VariantIdx::new(0), Some((resume, resume_arg)), value.clone(), drop))
341 if let Some((state_idx, resume, v, drop)) = ret_val {
342 let source_info = data.terminator().source_info;
343 // We must assign the value first in case it gets declared dead below
344 data.statements.extend(self.make_state(state_idx, v, source_info));
345 let state = if let Some((resume, mut resume_arg)) = resume {
347 let state = 3 + self.suspension_points.len();
349 // The resume arg target location might itself be remapped if its base local is
350 // live across a yield.
352 if let Some(&(ty, variant, idx)) = self.remap.get(&resume_arg.local) {
353 replace_base(&mut resume_arg, self.make_field(variant, idx, ty), self.tcx);
359 self.suspension_points.push(SuspensionPoint {
364 storage_liveness: self.storage_liveness[block].clone().unwrap(),
367 VariantIdx::new(state)
370 VariantIdx::new(RETURNED) // state for returned
372 data.statements.push(self.set_discr(state, source_info));
373 data.terminator_mut().kind = TerminatorKind::Return;
376 self.super_basic_block_data(block, data);
380 fn make_generator_state_argument_indirect<'tcx>(tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
381 let gen_ty = body.local_decls.raw[1].ty;
384 tcx.mk_ref(tcx.lifetimes.re_erased, ty::TypeAndMut { ty: gen_ty, mutbl: Mutability::Mut });
386 // Replace the by value generator argument
387 body.local_decls.raw[1].ty = ref_gen_ty;
389 // Add a deref to accesses of the generator state
390 DerefArgVisitor { tcx }.visit_body(body);
393 fn make_generator_state_argument_pinned<'tcx>(tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
394 let ref_gen_ty = body.local_decls.raw[1].ty;
396 let pin_did = tcx.require_lang_item(LangItem::Pin, Some(body.span));
397 let pin_adt_ref = tcx.adt_def(pin_did);
398 let substs = tcx.intern_substs(&[ref_gen_ty.into()]);
399 let pin_ref_gen_ty = tcx.mk_adt(pin_adt_ref, substs);
401 // Replace the by ref generator argument
402 body.local_decls.raw[1].ty = pin_ref_gen_ty;
404 // Add the Pin field access to accesses of the generator state
405 PinArgVisitor { ref_gen_ty, tcx }.visit_body(body);
408 /// Allocates a new local and replaces all references of `local` with it. Returns the new local.
410 /// `local` will be changed to a new local decl with type `ty`.
412 /// Note that the new local will be uninitialized. It is the caller's responsibility to assign some
413 /// valid value to it before its first use.
414 fn replace_local<'tcx>(
417 body: &mut Body<'tcx>,
420 let new_decl = LocalDecl::new(ty, body.span);
421 let new_local = body.local_decls.push(new_decl);
422 body.local_decls.swap(local, new_local);
424 RenameLocalVisitor { from: local, to: new_local, tcx }.visit_body(body);
429 struct LivenessInfo {
430 /// Which locals are live across any suspension point.
431 saved_locals: GeneratorSavedLocals,
433 /// The set of saved locals live at each suspension point.
434 live_locals_at_suspension_points: Vec<BitSet<GeneratorSavedLocal>>,
436 /// Parallel vec to the above with SourceInfo for each yield terminator.
437 source_info_at_suspension_points: Vec<SourceInfo>,
439 /// For every saved local, the set of other saved locals that are
440 /// storage-live at the same time as this local. We cannot overlap locals in
441 /// the layout which have conflicting storage.
442 storage_conflicts: BitMatrix<GeneratorSavedLocal, GeneratorSavedLocal>,
444 /// For every suspending block, the locals which are storage-live across
445 /// that suspension point.
446 storage_liveness: IndexVec<BasicBlock, Option<BitSet<Local>>>,
449 fn locals_live_across_suspend_points<'tcx>(
452 always_live_locals: &storage::AlwaysLiveLocals,
455 let body_ref: &Body<'_> = &body;
457 // Calculate when MIR locals have live storage. This gives us an upper bound of their
459 let mut storage_live = MaybeStorageLive::new(always_live_locals.clone())
460 .into_engine(tcx, body_ref)
461 .iterate_to_fixpoint()
462 .into_results_cursor(body_ref);
464 // Calculate the MIR locals which have been previously
465 // borrowed (even if they are still active).
466 let borrowed_locals_results = MaybeBorrowedLocals::all_borrows()
467 .into_engine(tcx, body_ref)
468 .pass_name("generator")
469 .iterate_to_fixpoint();
471 let mut borrowed_locals_cursor =
472 rustc_mir_dataflow::ResultsCursor::new(body_ref, &borrowed_locals_results);
474 // Calculate the MIR locals that we actually need to keep storage around
476 let requires_storage_results = MaybeRequiresStorage::new(body, &borrowed_locals_results)
477 .into_engine(tcx, body_ref)
478 .iterate_to_fixpoint();
479 let mut requires_storage_cursor =
480 rustc_mir_dataflow::ResultsCursor::new(body_ref, &requires_storage_results);
482 // Calculate the liveness of MIR locals ignoring borrows.
483 let mut liveness = MaybeLiveLocals
484 .into_engine(tcx, body_ref)
485 .pass_name("generator")
486 .iterate_to_fixpoint()
487 .into_results_cursor(body_ref);
489 let mut storage_liveness_map = IndexVec::from_elem(None, body.basic_blocks());
490 let mut live_locals_at_suspension_points = Vec::new();
491 let mut source_info_at_suspension_points = Vec::new();
492 let mut live_locals_at_any_suspension_point = BitSet::new_empty(body.local_decls.len());
494 for (block, data) in body.basic_blocks().iter_enumerated() {
495 if let TerminatorKind::Yield { .. } = data.terminator().kind {
496 let loc = Location { block, statement_index: data.statements.len() };
498 liveness.seek_to_block_end(block);
499 let mut live_locals = liveness.get().clone();
502 // The `liveness` variable contains the liveness of MIR locals ignoring borrows.
503 // This is correct for movable generators since borrows cannot live across
504 // suspension points. However for immovable generators we need to account for
505 // borrows, so we conseratively assume that all borrowed locals are live until
506 // we find a StorageDead statement referencing the locals.
507 // To do this we just union our `liveness` result with `borrowed_locals`, which
508 // contains all the locals which has been borrowed before this suspension point.
509 // If a borrow is converted to a raw reference, we must also assume that it lives
510 // forever. Note that the final liveness is still bounded by the storage liveness
511 // of the local, which happens using the `intersect` operation below.
512 borrowed_locals_cursor.seek_before_primary_effect(loc);
513 live_locals.union(borrowed_locals_cursor.get());
516 // Store the storage liveness for later use so we can restore the state
517 // after a suspension point
518 storage_live.seek_before_primary_effect(loc);
519 storage_liveness_map[block] = Some(storage_live.get().clone());
521 // Locals live are live at this point only if they are used across
522 // suspension points (the `liveness` variable)
523 // and their storage is required (the `storage_required` variable)
524 requires_storage_cursor.seek_before_primary_effect(loc);
525 live_locals.intersect(requires_storage_cursor.get());
527 // The generator argument is ignored.
528 live_locals.remove(SELF_ARG);
530 debug!("loc = {:?}, live_locals = {:?}", loc, live_locals);
532 // Add the locals live at this suspension point to the set of locals which live across
533 // any suspension points
534 live_locals_at_any_suspension_point.union(&live_locals);
536 live_locals_at_suspension_points.push(live_locals);
537 source_info_at_suspension_points.push(data.terminator().source_info);
541 debug!("live_locals_anywhere = {:?}", live_locals_at_any_suspension_point);
542 let saved_locals = GeneratorSavedLocals(live_locals_at_any_suspension_point);
544 // Renumber our liveness_map bitsets to include only the locals we are
546 let live_locals_at_suspension_points = live_locals_at_suspension_points
548 .map(|live_here| saved_locals.renumber_bitset(&live_here))
551 let storage_conflicts = compute_storage_conflicts(
554 always_live_locals.clone(),
555 requires_storage_results,
560 live_locals_at_suspension_points,
561 source_info_at_suspension_points,
563 storage_liveness: storage_liveness_map,
567 /// The set of `Local`s that must be saved across yield points.
569 /// `GeneratorSavedLocal` is indexed in terms of the elements in this set;
570 /// i.e. `GeneratorSavedLocal::new(1)` corresponds to the second local
571 /// included in this set.
572 struct GeneratorSavedLocals(BitSet<Local>);
574 impl GeneratorSavedLocals {
575 /// Returns an iterator over each `GeneratorSavedLocal` along with the `Local` it corresponds
577 fn iter_enumerated(&self) -> impl '_ + Iterator<Item = (GeneratorSavedLocal, Local)> {
578 self.iter().enumerate().map(|(i, l)| (GeneratorSavedLocal::from(i), l))
581 /// Transforms a `BitSet<Local>` that contains only locals saved across yield points to the
582 /// equivalent `BitSet<GeneratorSavedLocal>`.
583 fn renumber_bitset(&self, input: &BitSet<Local>) -> BitSet<GeneratorSavedLocal> {
584 assert!(self.superset(&input), "{:?} not a superset of {:?}", self.0, input);
585 let mut out = BitSet::new_empty(self.count());
586 for (saved_local, local) in self.iter_enumerated() {
587 if input.contains(local) {
588 out.insert(saved_local);
594 fn get(&self, local: Local) -> Option<GeneratorSavedLocal> {
595 if !self.contains(local) {
599 let idx = self.iter().take_while(|&l| l < local).count();
600 Some(GeneratorSavedLocal::new(idx))
604 impl ops::Deref for GeneratorSavedLocals {
605 type Target = BitSet<Local>;
607 fn deref(&self) -> &Self::Target {
612 /// For every saved local, looks for which locals are StorageLive at the same
613 /// time. Generates a bitset for every local of all the other locals that may be
614 /// StorageLive simultaneously with that local. This is used in the layout
615 /// computation; see `GeneratorLayout` for more.
616 fn compute_storage_conflicts<'mir, 'tcx>(
617 body: &'mir Body<'tcx>,
618 saved_locals: &GeneratorSavedLocals,
619 always_live_locals: storage::AlwaysLiveLocals,
620 requires_storage: rustc_mir_dataflow::Results<'tcx, MaybeRequiresStorage<'mir, 'tcx>>,
621 ) -> BitMatrix<GeneratorSavedLocal, GeneratorSavedLocal> {
622 assert_eq!(body.local_decls.len(), saved_locals.domain_size());
624 debug!("compute_storage_conflicts({:?})", body.span);
625 debug!("always_live = {:?}", always_live_locals);
627 // Locals that are always live or ones that need to be stored across
628 // suspension points are not eligible for overlap.
629 let mut ineligible_locals = always_live_locals.into_inner();
630 ineligible_locals.intersect(&**saved_locals);
632 // Compute the storage conflicts for all eligible locals.
633 let mut visitor = StorageConflictVisitor {
635 saved_locals: &saved_locals,
636 local_conflicts: BitMatrix::from_row_n(&ineligible_locals, body.local_decls.len()),
639 requires_storage.visit_reachable_with(body, &mut visitor);
641 let local_conflicts = visitor.local_conflicts;
643 // Compress the matrix using only stored locals (Local -> GeneratorSavedLocal).
645 // NOTE: Today we store a full conflict bitset for every local. Technically
646 // this is twice as many bits as we need, since the relation is symmetric.
647 // However, in practice these bitsets are not usually large. The layout code
648 // also needs to keep track of how many conflicts each local has, so it's
649 // simpler to keep it this way for now.
650 let mut storage_conflicts = BitMatrix::new(saved_locals.count(), saved_locals.count());
651 for (saved_local_a, local_a) in saved_locals.iter_enumerated() {
652 if ineligible_locals.contains(local_a) {
653 // Conflicts with everything.
654 storage_conflicts.insert_all_into_row(saved_local_a);
656 // Keep overlap information only for stored locals.
657 for (saved_local_b, local_b) in saved_locals.iter_enumerated() {
658 if local_conflicts.contains(local_a, local_b) {
659 storage_conflicts.insert(saved_local_a, saved_local_b);
667 struct StorageConflictVisitor<'mir, 'tcx, 's> {
668 body: &'mir Body<'tcx>,
669 saved_locals: &'s GeneratorSavedLocals,
670 // FIXME(tmandry): Consider using sparse bitsets here once we have good
671 // benchmarks for generators.
672 local_conflicts: BitMatrix<Local, Local>,
675 impl<'mir, 'tcx> rustc_mir_dataflow::ResultsVisitor<'mir, 'tcx>
676 for StorageConflictVisitor<'mir, 'tcx, '_>
678 type FlowState = BitSet<Local>;
680 fn visit_statement_before_primary_effect(
682 state: &Self::FlowState,
683 _statement: &'mir Statement<'tcx>,
686 self.apply_state(state, loc);
689 fn visit_terminator_before_primary_effect(
691 state: &Self::FlowState,
692 _terminator: &'mir Terminator<'tcx>,
695 self.apply_state(state, loc);
699 impl StorageConflictVisitor<'_, '_, '_> {
700 fn apply_state(&mut self, flow_state: &BitSet<Local>, loc: Location) {
701 // Ignore unreachable blocks.
702 if self.body.basic_blocks()[loc.block].terminator().kind == TerminatorKind::Unreachable {
706 let mut eligible_storage_live = flow_state.clone();
707 eligible_storage_live.intersect(&**self.saved_locals);
709 for local in eligible_storage_live.iter() {
710 self.local_conflicts.union_row_with(&eligible_storage_live, local);
713 if eligible_storage_live.count() > 1 {
714 trace!("at {:?}, eligible_storage_live={:?}", loc, eligible_storage_live);
719 /// Validates the typeck view of the generator against the actual set of types saved between
721 fn sanitize_witness<'tcx>(
725 upvars: Vec<Ty<'tcx>>,
726 saved_locals: &GeneratorSavedLocals,
728 let did = body.source.def_id();
729 let allowed_upvars = tcx.erase_regions(upvars);
730 let allowed = match witness.kind() {
731 &ty::GeneratorWitness(s) => tcx.erase_late_bound_regions(s),
733 tcx.sess.delay_span_bug(
735 &format!("unexpected generator witness type {:?}", witness.kind()),
741 let param_env = tcx.param_env(did);
743 for (local, decl) in body.local_decls.iter_enumerated() {
744 // Ignore locals which are internal or not saved between yields.
745 if !saved_locals.contains(local) || decl.internal {
748 let decl_ty = tcx.normalize_erasing_regions(param_env, decl.ty);
750 // Sanity check that typeck knows about the type of locals which are
751 // live across a suspension point
752 if !allowed.contains(&decl_ty) && !allowed_upvars.contains(&decl_ty) {
755 "Broken MIR: generator contains type {} in MIR, \
756 but typeck only knows about {} and {:?}",
765 fn compute_layout<'tcx>(
766 liveness: LivenessInfo,
767 body: &mut Body<'tcx>,
769 FxHashMap<Local, (Ty<'tcx>, VariantIdx, usize)>,
770 GeneratorLayout<'tcx>,
771 IndexVec<BasicBlock, Option<BitSet<Local>>>,
775 live_locals_at_suspension_points,
776 source_info_at_suspension_points,
781 // Gather live local types and their indices.
782 let mut locals = IndexVec::<GeneratorSavedLocal, _>::new();
783 let mut tys = IndexVec::<GeneratorSavedLocal, _>::new();
784 for (saved_local, local) in saved_locals.iter_enumerated() {
786 tys.push(body.local_decls[local].ty);
787 debug!("generator saved local {:?} => {:?}", saved_local, local);
790 // Leave empty variants for the UNRESUMED, RETURNED, and POISONED states.
791 // In debuginfo, these will correspond to the beginning (UNRESUMED) or end
792 // (RETURNED, POISONED) of the function.
793 const RESERVED_VARIANTS: usize = 3;
794 let body_span = body.source_scopes[OUTERMOST_SOURCE_SCOPE].span;
795 let mut variant_source_info: IndexVec<VariantIdx, SourceInfo> = [
796 SourceInfo::outermost(body_span.shrink_to_lo()),
797 SourceInfo::outermost(body_span.shrink_to_hi()),
798 SourceInfo::outermost(body_span.shrink_to_hi()),
804 // Build the generator variant field list.
805 // Create a map from local indices to generator struct indices.
806 let mut variant_fields: IndexVec<VariantIdx, IndexVec<Field, GeneratorSavedLocal>> =
807 iter::repeat(IndexVec::new()).take(RESERVED_VARIANTS).collect();
808 let mut remap = FxHashMap::default();
809 for (suspension_point_idx, live_locals) in live_locals_at_suspension_points.iter().enumerate() {
810 let variant_index = VariantIdx::from(RESERVED_VARIANTS + suspension_point_idx);
811 let mut fields = IndexVec::new();
812 for (idx, saved_local) in live_locals.iter().enumerate() {
813 fields.push(saved_local);
814 // Note that if a field is included in multiple variants, we will
815 // just use the first one here. That's fine; fields do not move
816 // around inside generators, so it doesn't matter which variant
817 // index we access them by.
818 remap.entry(locals[saved_local]).or_insert((tys[saved_local], variant_index, idx));
820 variant_fields.push(fields);
821 variant_source_info.push(source_info_at_suspension_points[suspension_point_idx]);
823 debug!("generator variant_fields = {:?}", variant_fields);
824 debug!("generator storage_conflicts = {:#?}", storage_conflicts);
827 GeneratorLayout { field_tys: tys, variant_fields, variant_source_info, storage_conflicts };
829 (remap, layout, storage_liveness)
832 /// Replaces the entry point of `body` with a block that switches on the generator discriminant and
833 /// dispatches to blocks according to `cases`.
835 /// After this function, the former entry point of the function will be bb1.
836 fn insert_switch<'tcx>(
837 body: &mut Body<'tcx>,
838 cases: Vec<(usize, BasicBlock)>,
839 transform: &TransformVisitor<'tcx>,
840 default: TerminatorKind<'tcx>,
842 let default_block = insert_term_block(body, default);
843 let (assign, discr) = transform.get_discr(body);
845 SwitchTargets::new(cases.iter().map(|(i, bb)| ((*i) as u128, *bb)), default_block);
846 let switch = TerminatorKind::SwitchInt {
847 discr: Operand::Move(discr),
848 switch_ty: transform.discr_ty,
849 targets: switch_targets,
852 let source_info = SourceInfo::outermost(body.span);
853 body.basic_blocks_mut().raw.insert(
856 statements: vec![assign],
857 terminator: Some(Terminator { source_info, kind: switch }),
862 let blocks = body.basic_blocks_mut().iter_mut();
864 for target in blocks.flat_map(|b| b.terminator_mut().successors_mut()) {
865 *target = BasicBlock::new(target.index() + 1);
869 fn elaborate_generator_drops<'tcx>(tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
870 use crate::shim::DropShimElaborator;
871 use rustc_middle::mir::patch::MirPatch;
872 use rustc_mir_dataflow::elaborate_drops::{elaborate_drop, Unwind};
874 // Note that `elaborate_drops` only drops the upvars of a generator, and
875 // this is ok because `open_drop` can only be reached within that own
876 // generator's resume function.
878 let def_id = body.source.def_id();
879 let param_env = tcx.param_env(def_id);
881 let mut elaborator = DropShimElaborator { body, patch: MirPatch::new(body), tcx, param_env };
883 for (block, block_data) in body.basic_blocks().iter_enumerated() {
884 let (target, unwind, source_info) = match block_data.terminator() {
885 Terminator { source_info, kind: TerminatorKind::Drop { place, target, unwind } } => {
886 if let Some(local) = place.as_local() {
887 if local == SELF_ARG {
888 (target, unwind, source_info)
898 let unwind = if block_data.is_cleanup {
901 Unwind::To(unwind.unwrap_or_else(|| elaborator.patch.resume_block()))
906 Place::from(SELF_ARG),
913 elaborator.patch.apply(body);
916 fn create_generator_drop_shim<'tcx>(
918 transform: &TransformVisitor<'tcx>,
920 body: &mut Body<'tcx>,
921 drop_clean: BasicBlock,
923 let mut body = body.clone();
924 body.arg_count = 1; // make sure the resume argument is not included here
926 let source_info = SourceInfo::outermost(body.span);
928 let mut cases = create_cases(&mut body, transform, Operation::Drop);
930 cases.insert(0, (UNRESUMED, drop_clean));
932 // The returned state and the poisoned state fall through to the default
933 // case which is just to return
935 insert_switch(&mut body, cases, &transform, TerminatorKind::Return);
937 for block in body.basic_blocks_mut() {
938 let kind = &mut block.terminator_mut().kind;
939 if let TerminatorKind::GeneratorDrop = *kind {
940 *kind = TerminatorKind::Return;
944 // Replace the return variable
945 body.local_decls[RETURN_PLACE] = LocalDecl::with_source_info(tcx.mk_unit(), source_info);
947 make_generator_state_argument_indirect(tcx, &mut body);
949 // Change the generator argument from &mut to *mut
950 body.local_decls[SELF_ARG] = LocalDecl::with_source_info(
951 tcx.mk_ptr(ty::TypeAndMut { ty: gen_ty, mutbl: hir::Mutability::Mut }),
954 if tcx.sess.opts.debugging_opts.mir_emit_retag {
955 // Alias tracking must know we changed the type
956 body.basic_blocks_mut()[START_BLOCK].statements.insert(
960 kind: StatementKind::Retag(RetagKind::Raw, Box::new(Place::from(SELF_ARG))),
965 // Make sure we remove dead blocks to remove
966 // unrelated code from the resume part of the function
967 simplify::remove_dead_blocks(tcx, &mut body);
969 dump_mir(tcx, None, "generator_drop", &0, &body, |_, _| Ok(()));
974 fn insert_term_block<'tcx>(body: &mut Body<'tcx>, kind: TerminatorKind<'tcx>) -> BasicBlock {
975 let source_info = SourceInfo::outermost(body.span);
976 body.basic_blocks_mut().push(BasicBlockData {
977 statements: Vec::new(),
978 terminator: Some(Terminator { source_info, kind }),
983 fn insert_panic_block<'tcx>(
985 body: &mut Body<'tcx>,
986 message: AssertMessage<'tcx>,
988 let assert_block = BasicBlock::new(body.basic_blocks().len());
989 let term = TerminatorKind::Assert {
990 cond: Operand::Constant(Box::new(Constant {
993 literal: ty::Const::from_bool(tcx, false).into(),
997 target: assert_block,
1001 let source_info = SourceInfo::outermost(body.span);
1002 body.basic_blocks_mut().push(BasicBlockData {
1003 statements: Vec::new(),
1004 terminator: Some(Terminator { source_info, kind: term }),
1011 fn can_return<'tcx>(tcx: TyCtxt<'tcx>, body: &Body<'tcx>, param_env: ty::ParamEnv<'tcx>) -> bool {
1012 // Returning from a function with an uninhabited return type is undefined behavior.
1013 if tcx.conservative_is_privately_uninhabited(param_env.and(body.return_ty())) {
1017 // If there's a return terminator the function may return.
1018 for block in body.basic_blocks() {
1019 if let TerminatorKind::Return = block.terminator().kind {
1024 // Otherwise the function can't return.
1028 fn can_unwind<'tcx>(tcx: TyCtxt<'tcx>, body: &Body<'tcx>) -> bool {
1029 // Nothing can unwind when landing pads are off.
1030 if tcx.sess.panic_strategy() == PanicStrategy::Abort {
1034 // Unwinds can only start at certain terminators.
1035 for block in body.basic_blocks() {
1036 match block.terminator().kind {
1037 // These never unwind.
1038 TerminatorKind::Goto { .. }
1039 | TerminatorKind::SwitchInt { .. }
1040 | TerminatorKind::Abort
1041 | TerminatorKind::Return
1042 | TerminatorKind::Unreachable
1043 | TerminatorKind::GeneratorDrop
1044 | TerminatorKind::FalseEdge { .. }
1045 | TerminatorKind::FalseUnwind { .. }
1046 | TerminatorKind::InlineAsm { .. } => {}
1048 // Resume will *continue* unwinding, but if there's no other unwinding terminator it
1049 // will never be reached.
1050 TerminatorKind::Resume => {}
1052 TerminatorKind::Yield { .. } => {
1053 unreachable!("`can_unwind` called before generator transform")
1056 // These may unwind.
1057 TerminatorKind::Drop { .. }
1058 | TerminatorKind::DropAndReplace { .. }
1059 | TerminatorKind::Call { .. }
1060 | TerminatorKind::Assert { .. } => return true,
1064 // If we didn't find an unwinding terminator, the function cannot unwind.
1068 fn create_generator_resume_function<'tcx>(
1070 transform: TransformVisitor<'tcx>,
1071 body: &mut Body<'tcx>,
1074 let can_unwind = can_unwind(tcx, body);
1076 // Poison the generator when it unwinds
1078 let source_info = SourceInfo::outermost(body.span);
1079 let poison_block = body.basic_blocks_mut().push(BasicBlockData {
1080 statements: vec![transform.set_discr(VariantIdx::new(POISONED), source_info)],
1081 terminator: Some(Terminator { source_info, kind: TerminatorKind::Resume }),
1085 for (idx, block) in body.basic_blocks_mut().iter_enumerated_mut() {
1086 let source_info = block.terminator().source_info;
1088 if let TerminatorKind::Resume = block.terminator().kind {
1089 // An existing `Resume` terminator is redirected to jump to our dedicated
1090 // "poisoning block" above.
1091 if idx != poison_block {
1092 *block.terminator_mut() = Terminator {
1094 kind: TerminatorKind::Goto { target: poison_block },
1097 } else if !block.is_cleanup {
1098 // Any terminators that *can* unwind but don't have an unwind target set are also
1099 // pointed at our poisoning block (unless they're part of the cleanup path).
1100 if let Some(unwind @ None) = block.terminator_mut().unwind_mut() {
1101 *unwind = Some(poison_block);
1107 let mut cases = create_cases(body, &transform, Operation::Resume);
1109 use rustc_middle::mir::AssertKind::{ResumedAfterPanic, ResumedAfterReturn};
1111 // Jump to the entry point on the unresumed
1112 cases.insert(0, (UNRESUMED, BasicBlock::new(0)));
1114 // Panic when resumed on the returned or poisoned state
1115 let generator_kind = body.generator_kind().unwrap();
1120 (POISONED, insert_panic_block(tcx, body, ResumedAfterPanic(generator_kind))),
1127 (RETURNED, insert_panic_block(tcx, body, ResumedAfterReturn(generator_kind))),
1131 insert_switch(body, cases, &transform, TerminatorKind::Unreachable);
1133 make_generator_state_argument_indirect(tcx, body);
1134 make_generator_state_argument_pinned(tcx, body);
1136 // Make sure we remove dead blocks to remove
1137 // unrelated code from the drop part of the function
1138 simplify::remove_dead_blocks(tcx, body);
1140 dump_mir(tcx, None, "generator_resume", &0, body, |_, _| Ok(()));
1143 fn insert_clean_drop(body: &mut Body<'_>) -> BasicBlock {
1144 let return_block = insert_term_block(body, TerminatorKind::Return);
1147 TerminatorKind::Drop { place: Place::from(SELF_ARG), target: return_block, unwind: None };
1148 let source_info = SourceInfo::outermost(body.span);
1150 // Create a block to destroy an unresumed generators. This can only destroy upvars.
1151 body.basic_blocks_mut().push(BasicBlockData {
1152 statements: Vec::new(),
1153 terminator: Some(Terminator { source_info, kind: term }),
1158 /// An operation that can be performed on a generator.
1159 #[derive(PartialEq, Copy, Clone)]
1166 fn target_block(self, point: &SuspensionPoint<'_>) -> Option<BasicBlock> {
1168 Operation::Resume => Some(point.resume),
1169 Operation::Drop => point.drop,
1174 fn create_cases<'tcx>(
1175 body: &mut Body<'tcx>,
1176 transform: &TransformVisitor<'tcx>,
1177 operation: Operation,
1178 ) -> Vec<(usize, BasicBlock)> {
1179 let source_info = SourceInfo::outermost(body.span);
1184 .filter_map(|point| {
1185 // Find the target for this suspension point, if applicable
1186 operation.target_block(point).map(|target| {
1187 let mut statements = Vec::new();
1189 // Create StorageLive instructions for locals with live storage
1190 for i in 0..(body.local_decls.len()) {
1192 // The resume argument is live on function entry. Don't insert a
1193 // `StorageLive`, or the following `Assign` will read from uninitialized
1198 let l = Local::new(i);
1199 let needs_storage_live = point.storage_liveness.contains(l)
1200 && !transform.remap.contains_key(&l)
1201 && !transform.always_live_locals.contains(l);
1202 if needs_storage_live {
1204 .push(Statement { source_info, kind: StatementKind::StorageLive(l) });
1208 if operation == Operation::Resume {
1209 // Move the resume argument to the destination place of the `Yield` terminator
1210 let resume_arg = Local::new(2); // 0 = return, 1 = self
1211 statements.push(Statement {
1213 kind: StatementKind::Assign(Box::new((
1215 Rvalue::Use(Operand::Move(resume_arg.into())),
1220 // Then jump to the real target
1221 let block = body.basic_blocks_mut().push(BasicBlockData {
1223 terminator: Some(Terminator {
1225 kind: TerminatorKind::Goto { target },
1230 (point.state, block)
1236 impl<'tcx> MirPass<'tcx> for StateTransform {
1237 fn phase_change(&self) -> Option<MirPhase> {
1238 Some(MirPhase::GeneratorLowering)
1241 fn run_pass(&self, tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
1242 let yield_ty = if let Some(yield_ty) = body.yield_ty() {
1245 // This only applies to generators
1249 assert!(body.generator_drop().is_none());
1251 // The first argument is the generator type passed by value
1252 let gen_ty = body.local_decls.raw[1].ty;
1254 // Get the interior types and substs which typeck computed
1255 let (upvars, interior, discr_ty, movable) = match *gen_ty.kind() {
1256 ty::Generator(_, substs, movability) => {
1257 let substs = substs.as_generator();
1259 substs.upvar_tys().collect(),
1261 substs.discr_ty(tcx),
1262 movability == hir::Movability::Movable,
1267 .delay_span_bug(body.span, &format!("unexpected generator type {}", gen_ty));
1272 // Compute GeneratorState<yield_ty, return_ty>
1273 let state_did = tcx.require_lang_item(LangItem::GeneratorState, None);
1274 let state_adt_ref = tcx.adt_def(state_did);
1275 let state_substs = tcx.intern_substs(&[yield_ty.into(), body.return_ty().into()]);
1276 let ret_ty = tcx.mk_adt(state_adt_ref, state_substs);
1278 // We rename RETURN_PLACE which has type mir.return_ty to new_ret_local
1279 // RETURN_PLACE then is a fresh unused local with type ret_ty.
1280 let new_ret_local = replace_local(RETURN_PLACE, ret_ty, body, tcx);
1282 // We also replace the resume argument and insert an `Assign`.
1283 // This is needed because the resume argument `_2` might be live across a `yield`, in which
1284 // case there is no `Assign` to it that the transform can turn into a store to the generator
1285 // state. After the yield the slot in the generator state would then be uninitialized.
1286 let resume_local = Local::new(2);
1287 let new_resume_local =
1288 replace_local(resume_local, body.local_decls[resume_local].ty, body, tcx);
1290 // When first entering the generator, move the resume argument into its new local.
1291 let source_info = SourceInfo::outermost(body.span);
1292 let stmts = &mut body.basic_blocks_mut()[BasicBlock::new(0)].statements;
1297 kind: StatementKind::Assign(Box::new((
1298 new_resume_local.into(),
1299 Rvalue::Use(Operand::Move(resume_local.into())),
1304 let always_live_locals = storage::AlwaysLiveLocals::new(&body);
1307 locals_live_across_suspend_points(tcx, body, &always_live_locals, movable);
1309 sanitize_witness(tcx, body, interior, upvars, &liveness_info.saved_locals);
1311 if tcx.sess.opts.debugging_opts.validate_mir {
1312 let mut vis = EnsureGeneratorFieldAssignmentsNeverAlias {
1313 assigned_local: None,
1314 saved_locals: &liveness_info.saved_locals,
1315 storage_conflicts: &liveness_info.storage_conflicts,
1318 vis.visit_body(body);
1321 // Extract locals which are live across suspension point into `layout`
1322 // `remap` gives a mapping from local indices onto generator struct indices
1323 // `storage_liveness` tells us which locals have live storage at suspension points
1324 let (remap, layout, storage_liveness) = compute_layout(liveness_info, body);
1326 let can_return = can_return(tcx, body, tcx.param_env(body.source.def_id()));
1328 // Run the transformation which converts Places from Local to generator struct
1329 // accesses for locals in `remap`.
1330 // It also rewrites `return x` and `yield y` as writing a new generator state and returning
1331 // GeneratorState::Complete(x) and GeneratorState::Yielded(y) respectively.
1332 let mut transform = TransformVisitor {
1339 suspension_points: Vec::new(),
1343 transform.visit_body(body);
1345 // Update our MIR struct to reflect the changes we've made
1346 body.arg_count = 2; // self, resume arg
1347 body.spread_arg = None;
1349 body.generator.as_mut().unwrap().yield_ty = None;
1350 body.generator.as_mut().unwrap().generator_layout = Some(layout);
1352 // Insert `drop(generator_struct)` which is used to drop upvars for generators in
1353 // the unresumed state.
1354 // This is expanded to a drop ladder in `elaborate_generator_drops`.
1355 let drop_clean = insert_clean_drop(body);
1357 dump_mir(tcx, None, "generator_pre-elab", &0, body, |_, _| Ok(()));
1359 // Expand `drop(generator_struct)` to a drop ladder which destroys upvars.
1360 // If any upvars are moved out of, drop elaboration will handle upvar destruction.
1361 // However we need to also elaborate the code generated by `insert_clean_drop`.
1362 elaborate_generator_drops(tcx, body);
1364 dump_mir(tcx, None, "generator_post-transform", &0, body, |_, _| Ok(()));
1366 // Create a copy of our MIR and use it to create the drop shim for the generator
1367 let drop_shim = create_generator_drop_shim(tcx, &transform, gen_ty, body, drop_clean);
1369 body.generator.as_mut().unwrap().generator_drop = Some(drop_shim);
1371 // Create the Generator::resume function
1372 create_generator_resume_function(tcx, transform, body, can_return);
1376 /// Looks for any assignments between locals (e.g., `_4 = _5`) that will both be converted to fields
1377 /// in the generator state machine but whose storage is not marked as conflicting
1379 /// Validation needs to happen immediately *before* `TransformVisitor` is invoked, not after.
1381 /// This condition would arise when the assignment is the last use of `_5` but the initial
1382 /// definition of `_4` if we weren't extra careful to mark all locals used inside a statement as
1383 /// conflicting. Non-conflicting generator saved locals may be stored at the same location within
1384 /// the generator state machine, which would result in ill-formed MIR: the left-hand and right-hand
1385 /// sides of an assignment may not alias. This caused a miscompilation in [#73137].
1387 /// [#73137]: https://github.com/rust-lang/rust/issues/73137
1388 struct EnsureGeneratorFieldAssignmentsNeverAlias<'a> {
1389 saved_locals: &'a GeneratorSavedLocals,
1390 storage_conflicts: &'a BitMatrix<GeneratorSavedLocal, GeneratorSavedLocal>,
1391 assigned_local: Option<GeneratorSavedLocal>,
1394 impl EnsureGeneratorFieldAssignmentsNeverAlias<'_> {
1395 fn saved_local_for_direct_place(&self, place: Place<'_>) -> Option<GeneratorSavedLocal> {
1396 if place.is_indirect() {
1400 self.saved_locals.get(place.local)
1403 fn check_assigned_place(&mut self, place: Place<'_>, f: impl FnOnce(&mut Self)) {
1404 if let Some(assigned_local) = self.saved_local_for_direct_place(place) {
1405 assert!(self.assigned_local.is_none(), "`check_assigned_place` must not recurse");
1407 self.assigned_local = Some(assigned_local);
1409 self.assigned_local = None;
1414 impl<'tcx> Visitor<'tcx> for EnsureGeneratorFieldAssignmentsNeverAlias<'_> {
1415 fn visit_place(&mut self, place: &Place<'tcx>, context: PlaceContext, location: Location) {
1416 let lhs = match self.assigned_local {
1419 // This visitor only invokes `visit_place` for the right-hand side of an assignment
1420 // and only after setting `self.assigned_local`. However, the default impl of
1421 // `Visitor::super_body` may call `visit_place` with a `NonUseContext` for places
1422 // with debuginfo. Ignore them here.
1423 assert!(!context.is_use());
1428 let rhs = match self.saved_local_for_direct_place(*place) {
1433 if !self.storage_conflicts.contains(lhs, rhs) {
1435 "Assignment between generator saved locals whose storage is not \
1436 marked as conflicting: {:?}: {:?} = {:?}",
1444 fn visit_statement(&mut self, statement: &Statement<'tcx>, location: Location) {
1445 match &statement.kind {
1446 StatementKind::Assign(box (lhs, rhs)) => {
1447 self.check_assigned_place(*lhs, |this| this.visit_rvalue(rhs, location));
1450 // FIXME: Does `llvm_asm!` have any aliasing requirements?
1451 StatementKind::LlvmInlineAsm(_) => {}
1453 StatementKind::FakeRead(..)
1454 | StatementKind::SetDiscriminant { .. }
1455 | StatementKind::StorageLive(_)
1456 | StatementKind::StorageDead(_)
1457 | StatementKind::Retag(..)
1458 | StatementKind::AscribeUserType(..)
1459 | StatementKind::Coverage(..)
1460 | StatementKind::CopyNonOverlapping(..)
1461 | StatementKind::Nop => {}
1465 fn visit_terminator(&mut self, terminator: &Terminator<'tcx>, location: Location) {
1466 // Checking for aliasing in terminators is probably overkill, but until we have actual
1467 // semantics, we should be conservative here.
1468 match &terminator.kind {
1469 TerminatorKind::Call {
1472 destination: Some((dest, _)),
1477 self.check_assigned_place(*dest, |this| {
1478 this.visit_operand(func, location);
1480 this.visit_operand(arg, location);
1485 TerminatorKind::Yield { value, resume: _, resume_arg, drop: _ } => {
1486 self.check_assigned_place(*resume_arg, |this| this.visit_operand(value, location));
1489 // FIXME: Does `asm!` have any aliasing requirements?
1490 TerminatorKind::InlineAsm { .. } => {}
1492 TerminatorKind::Call { .. }
1493 | TerminatorKind::Goto { .. }
1494 | TerminatorKind::SwitchInt { .. }
1495 | TerminatorKind::Resume
1496 | TerminatorKind::Abort
1497 | TerminatorKind::Return
1498 | TerminatorKind::Unreachable
1499 | TerminatorKind::Drop { .. }
1500 | TerminatorKind::DropAndReplace { .. }
1501 | TerminatorKind::Assert { .. }
1502 | TerminatorKind::GeneratorDrop
1503 | TerminatorKind::FalseEdge { .. }
1504 | TerminatorKind::FalseUnwind { .. } => {}