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.
52 use crate::dataflow
::impls
::{
53 MaybeBorrowedLocals
, MaybeLiveLocals
, MaybeRequiresStorage
, MaybeStorageLive
,
55 use crate::dataflow
::{self, Analysis}
;
56 use crate::transform
::no_landing_pads
::no_landing_pads
;
57 use crate::transform
::simplify
;
58 use crate::transform
::{MirPass, MirSource}
;
59 use crate::util
::dump_mir
;
60 use crate::util
::expand_aggregate
;
61 use crate::util
::storage
;
62 use rustc_data_structures
::fx
::FxHashMap
;
64 use rustc_hir
::def_id
::DefId
;
65 use rustc_hir
::lang_items
::LangItem
;
66 use rustc_index
::bit_set
::{BitMatrix, BitSet}
;
67 use rustc_index
::vec
::{Idx, IndexVec}
;
68 use rustc_middle
::mir
::visit
::{MutVisitor, PlaceContext, Visitor}
;
69 use rustc_middle
::mir
::*;
70 use rustc_middle
::ty
::subst
::{Subst, SubstsRef}
;
71 use rustc_middle
::ty
::GeneratorSubsts
;
72 use rustc_middle
::ty
::{self, AdtDef, Ty, TyCtxt}
;
73 use rustc_target
::abi
::VariantIdx
;
74 use rustc_target
::spec
::PanicStrategy
;
78 pub struct StateTransform
;
80 struct RenameLocalVisitor
<'tcx
> {
86 impl<'tcx
> MutVisitor
<'tcx
> for RenameLocalVisitor
<'tcx
> {
87 fn tcx(&self) -> TyCtxt
<'tcx
> {
91 fn visit_local(&mut self, local
: &mut Local
, _
: PlaceContext
, _
: Location
) {
92 if *local
== self.from
{
97 fn visit_terminator(&mut self, terminator
: &mut Terminator
<'tcx
>, location
: Location
) {
98 match terminator
.kind
{
99 TerminatorKind
::Return
=> {
100 // Do not replace the implicit `_0` access here, as that's not possible. The
101 // transform already handles `return` correctly.
103 _
=> self.super_terminator(terminator
, location
),
108 struct DerefArgVisitor
<'tcx
> {
112 impl<'tcx
> MutVisitor
<'tcx
> for DerefArgVisitor
<'tcx
> {
113 fn tcx(&self) -> TyCtxt
<'tcx
> {
117 fn visit_local(&mut self, local
: &mut Local
, _
: PlaceContext
, _
: Location
) {
118 assert_ne
!(*local
, SELF_ARG
);
121 fn visit_place(&mut self, place
: &mut Place
<'tcx
>, context
: PlaceContext
, location
: Location
) {
122 if place
.local
== SELF_ARG
{
127 projection
: self.tcx().intern_place_elems(&[ProjectionElem
::Deref
]),
132 self.visit_local(&mut place
.local
, context
, location
);
134 for elem
in place
.projection
.iter() {
135 if let PlaceElem
::Index(local
) = elem
{
136 assert_ne
!(local
, SELF_ARG
);
143 struct PinArgVisitor
<'tcx
> {
144 ref_gen_ty
: Ty
<'tcx
>,
148 impl<'tcx
> MutVisitor
<'tcx
> for PinArgVisitor
<'tcx
> {
149 fn tcx(&self) -> TyCtxt
<'tcx
> {
153 fn visit_local(&mut self, local
: &mut Local
, _
: PlaceContext
, _
: Location
) {
154 assert_ne
!(*local
, SELF_ARG
);
157 fn visit_place(&mut self, place
: &mut Place
<'tcx
>, context
: PlaceContext
, location
: Location
) {
158 if place
.local
== SELF_ARG
{
163 projection
: self.tcx().intern_place_elems(&[ProjectionElem
::Field(
171 self.visit_local(&mut place
.local
, context
, location
);
173 for elem
in place
.projection
.iter() {
174 if let PlaceElem
::Index(local
) = elem
{
175 assert_ne
!(local
, SELF_ARG
);
182 fn replace_base
<'tcx
>(place
: &mut Place
<'tcx
>, new_base
: Place
<'tcx
>, tcx
: TyCtxt
<'tcx
>) {
183 place
.local
= new_base
.local
;
185 let mut new_projection
= new_base
.projection
.to_vec();
186 new_projection
.append(&mut place
.projection
.to_vec());
188 place
.projection
= tcx
.intern_place_elems(&new_projection
);
191 const SELF_ARG
: Local
= Local
::from_u32(1);
193 /// Generator has not been resumed yet.
194 const UNRESUMED
: usize = GeneratorSubsts
::UNRESUMED
;
195 /// Generator has returned / is completed.
196 const RETURNED
: usize = GeneratorSubsts
::RETURNED
;
197 /// Generator has panicked and is poisoned.
198 const POISONED
: usize = GeneratorSubsts
::POISONED
;
200 /// A `yield` point in the generator.
201 struct SuspensionPoint
<'tcx
> {
202 /// State discriminant used when suspending or resuming at this point.
204 /// The block to jump to after resumption.
206 /// Where to move the resume argument after resumption.
207 resume_arg
: Place
<'tcx
>,
208 /// Which block to jump to if the generator is dropped in this state.
209 drop
: Option
<BasicBlock
>,
210 /// Set of locals that have live storage while at this suspension point.
211 storage_liveness
: BitSet
<Local
>,
214 struct TransformVisitor
<'tcx
> {
216 state_adt_ref
: &'tcx AdtDef
,
217 state_substs
: SubstsRef
<'tcx
>,
219 // The type of the discriminant in the generator struct
222 // Mapping from Local to (type of local, generator struct index)
223 // FIXME(eddyb) This should use `IndexVec<Local, Option<_>>`.
224 remap
: FxHashMap
<Local
, (Ty
<'tcx
>, VariantIdx
, usize)>,
226 // A map from a suspension point in a block to the locals which have live storage at that point
227 storage_liveness
: IndexVec
<BasicBlock
, Option
<BitSet
<Local
>>>,
229 // A list of suspension points, generated during the transform
230 suspension_points
: Vec
<SuspensionPoint
<'tcx
>>,
232 // The set of locals that have no `StorageLive`/`StorageDead` annotations.
233 always_live_locals
: storage
::AlwaysLiveLocals
,
235 // The original RETURN_PLACE local
236 new_ret_local
: Local
,
239 impl TransformVisitor
<'tcx
> {
240 // Make a GeneratorState variant assignment. `core::ops::GeneratorState` only has single
241 // element tuple variants, so we can just write to the downcasted first field and then set the
242 // discriminant to the appropriate variant.
247 source_info
: SourceInfo
,
248 ) -> impl Iterator
<Item
= Statement
<'tcx
>> {
249 let kind
= AggregateKind
::Adt(self.state_adt_ref
, idx
, self.state_substs
, None
, None
);
250 assert_eq
!(self.state_adt_ref
.variants
[idx
].fields
.len(), 1);
253 .type_of(self.state_adt_ref
.variants
[idx
].fields
[0].did
)
254 .subst(self.tcx
, self.state_substs
);
256 Place
::return_place(),
257 std
::iter
::once((val
, ty
)),
264 // Create a Place referencing a generator struct field
265 fn make_field(&self, variant_index
: VariantIdx
, idx
: usize, ty
: Ty
<'tcx
>) -> Place
<'tcx
> {
266 let self_place
= Place
::from(SELF_ARG
);
267 let base
= self.tcx
.mk_place_downcast_unnamed(self_place
, variant_index
);
268 let mut projection
= base
.projection
.to_vec();
269 projection
.push(ProjectionElem
::Field(Field
::new(idx
), ty
));
271 Place { local: base.local, projection: self.tcx.intern_place_elems(&projection) }
274 // Create a statement which changes the discriminant
275 fn set_discr(&self, state_disc
: VariantIdx
, source_info
: SourceInfo
) -> Statement
<'tcx
> {
276 let self_place
= Place
::from(SELF_ARG
);
279 kind
: StatementKind
::SetDiscriminant
{
280 place
: box self_place
,
281 variant_index
: state_disc
,
286 // Create a statement which reads the discriminant into a temporary
287 fn get_discr(&self, body
: &mut Body
<'tcx
>) -> (Statement
<'tcx
>, Place
<'tcx
>) {
288 let temp_decl
= LocalDecl
::new(self.discr_ty
, body
.span
).internal();
289 let local_decls_len
= body
.local_decls
.push(temp_decl
);
290 let temp
= Place
::from(local_decls_len
);
292 let self_place
= Place
::from(SELF_ARG
);
293 let assign
= Statement
{
294 source_info
: SourceInfo
::outermost(body
.span
),
295 kind
: StatementKind
::Assign(box (temp
, Rvalue
::Discriminant(self_place
))),
301 impl MutVisitor
<'tcx
> for TransformVisitor
<'tcx
> {
302 fn tcx(&self) -> TyCtxt
<'tcx
> {
306 fn visit_local(&mut self, local
: &mut Local
, _
: PlaceContext
, _
: Location
) {
307 assert_eq
!(self.remap
.get(local
), None
);
312 place
: &mut Place
<'tcx
>,
313 _context
: PlaceContext
,
316 // Replace an Local in the remap with a generator struct access
317 if let Some(&(ty
, variant_index
, idx
)) = self.remap
.get(&place
.local
) {
318 replace_base(place
, self.make_field(variant_index
, idx
, ty
), self.tcx
);
322 fn visit_basic_block_data(&mut self, block
: BasicBlock
, data
: &mut BasicBlockData
<'tcx
>) {
323 // Remove StorageLive and StorageDead statements for remapped locals
324 data
.retain_statements(|s
| match s
.kind
{
325 StatementKind
::StorageLive(l
) | StatementKind
::StorageDead(l
) => {
326 !self.remap
.contains_key(&l
)
331 let ret_val
= match data
.terminator().kind
{
332 TerminatorKind
::Return
=> Some((
335 Operand
::Move(Place
::from(self.new_ret_local
)),
338 TerminatorKind
::Yield { ref value, resume, resume_arg, drop }
=> {
339 Some((VariantIdx
::new(0), Some((resume
, resume_arg
)), value
.clone(), drop
))
344 if let Some((state_idx
, resume
, v
, drop
)) = ret_val
{
345 let source_info
= data
.terminator().source_info
;
346 // We must assign the value first in case it gets declared dead below
347 data
.statements
.extend(self.make_state(state_idx
, v
, source_info
));
348 let state
= if let Some((resume
, resume_arg
)) = resume
{
350 let state
= 3 + self.suspension_points
.len();
352 // The resume arg target location might itself be remapped if its base local is
353 // live across a yield.
355 if let Some(&(ty
, variant
, idx
)) = self.remap
.get(&resume_arg
.local
) {
356 self.make_field(variant
, idx
, ty
)
361 self.suspension_points
.push(SuspensionPoint
{
366 storage_liveness
: self.storage_liveness
[block
].clone().unwrap(),
369 VariantIdx
::new(state
)
372 VariantIdx
::new(RETURNED
) // state for returned
374 data
.statements
.push(self.set_discr(state
, source_info
));
375 data
.terminator_mut().kind
= TerminatorKind
::Return
;
378 self.super_basic_block_data(block
, data
);
382 fn make_generator_state_argument_indirect
<'tcx
>(tcx
: TyCtxt
<'tcx
>, body
: &mut Body
<'tcx
>) {
383 let gen_ty
= body
.local_decls
.raw
[1].ty
;
386 tcx
.mk_ref(tcx
.lifetimes
.re_erased
, ty
::TypeAndMut { ty: gen_ty, mutbl: Mutability::Mut }
);
388 // Replace the by value generator argument
389 body
.local_decls
.raw
[1].ty
= ref_gen_ty
;
391 // Add a deref to accesses of the generator state
392 DerefArgVisitor { tcx }
.visit_body(body
);
395 fn make_generator_state_argument_pinned
<'tcx
>(tcx
: TyCtxt
<'tcx
>, body
: &mut Body
<'tcx
>) {
396 let ref_gen_ty
= body
.local_decls
.raw
[1].ty
;
398 let pin_did
= tcx
.require_lang_item(LangItem
::Pin
, Some(body
.span
));
399 let pin_adt_ref
= tcx
.adt_def(pin_did
);
400 let substs
= tcx
.intern_substs(&[ref_gen_ty
.into()]);
401 let pin_ref_gen_ty
= tcx
.mk_adt(pin_adt_ref
, substs
);
403 // Replace the by ref generator argument
404 body
.local_decls
.raw
[1].ty
= pin_ref_gen_ty
;
406 // Add the Pin field access to accesses of the generator state
407 PinArgVisitor { ref_gen_ty, tcx }
.visit_body(body
);
410 /// Allocates a new local and replaces all references of `local` with it. Returns the new local.
412 /// `local` will be changed to a new local decl with type `ty`.
414 /// Note that the new local will be uninitialized. It is the caller's responsibility to assign some
415 /// valid value to it before its first use.
416 fn replace_local
<'tcx
>(
419 body
: &mut Body
<'tcx
>,
422 let new_decl
= LocalDecl
::new(ty
, body
.span
);
423 let new_local
= body
.local_decls
.push(new_decl
);
424 body
.local_decls
.swap(local
, new_local
);
426 RenameLocalVisitor { from: local, to: new_local, tcx }
.visit_body(body
);
431 struct LivenessInfo
{
432 /// Which locals are live across any suspension point.
433 saved_locals
: GeneratorSavedLocals
,
435 /// The set of saved locals live at each suspension point.
436 live_locals_at_suspension_points
: Vec
<BitSet
<GeneratorSavedLocal
>>,
438 /// Parallel vec to the above with SourceInfo for each yield terminator.
439 source_info_at_suspension_points
: Vec
<SourceInfo
>,
441 /// For every saved local, the set of other saved locals that are
442 /// storage-live at the same time as this local. We cannot overlap locals in
443 /// the layout which have conflicting storage.
444 storage_conflicts
: BitMatrix
<GeneratorSavedLocal
, GeneratorSavedLocal
>,
446 /// For every suspending block, the locals which are storage-live across
447 /// that suspension point.
448 storage_liveness
: IndexVec
<BasicBlock
, Option
<BitSet
<Local
>>>,
451 fn locals_live_across_suspend_points(
454 source
: MirSource
<'tcx
>,
455 always_live_locals
: &storage
::AlwaysLiveLocals
,
458 let def_id
= source
.def_id();
459 let body_ref
: &Body
<'_
> = &body
;
461 // Calculate when MIR locals have live storage. This gives us an upper bound of their
463 let mut storage_live
= MaybeStorageLive
::new(always_live_locals
.clone())
464 .into_engine(tcx
, body_ref
, def_id
)
465 .iterate_to_fixpoint()
466 .into_results_cursor(body_ref
);
468 // Calculate the MIR locals which have been previously
469 // borrowed (even if they are still active).
470 let borrowed_locals_results
= MaybeBorrowedLocals
::all_borrows()
471 .into_engine(tcx
, body_ref
, def_id
)
472 .pass_name("generator")
473 .iterate_to_fixpoint();
475 let mut borrowed_locals_cursor
=
476 dataflow
::ResultsCursor
::new(body_ref
, &borrowed_locals_results
);
478 // Calculate the MIR locals that we actually need to keep storage around
480 let requires_storage_results
= MaybeRequiresStorage
::new(body
, &borrowed_locals_results
)
481 .into_engine(tcx
, body_ref
, def_id
)
482 .iterate_to_fixpoint();
483 let mut requires_storage_cursor
=
484 dataflow
::ResultsCursor
::new(body_ref
, &requires_storage_results
);
486 // Calculate the liveness of MIR locals ignoring borrows.
487 let mut liveness
= MaybeLiveLocals
488 .into_engine(tcx
, body_ref
, def_id
)
489 .pass_name("generator")
490 .iterate_to_fixpoint()
491 .into_results_cursor(body_ref
);
493 let mut storage_liveness_map
= IndexVec
::from_elem(None
, body
.basic_blocks());
494 let mut live_locals_at_suspension_points
= Vec
::new();
495 let mut source_info_at_suspension_points
= Vec
::new();
496 let mut live_locals_at_any_suspension_point
= BitSet
::new_empty(body
.local_decls
.len());
498 for (block
, data
) in body
.basic_blocks().iter_enumerated() {
499 if let TerminatorKind
::Yield { .. }
= data
.terminator().kind
{
500 let loc
= Location { block, statement_index: data.statements.len() }
;
502 liveness
.seek_to_block_end(block
);
503 let mut live_locals
= liveness
.get().clone();
506 // The `liveness` variable contains the liveness of MIR locals ignoring borrows.
507 // This is correct for movable generators since borrows cannot live across
508 // suspension points. However for immovable generators we need to account for
509 // borrows, so we conseratively assume that all borrowed locals are live until
510 // we find a StorageDead statement referencing the locals.
511 // To do this we just union our `liveness` result with `borrowed_locals`, which
512 // contains all the locals which has been borrowed before this suspension point.
513 // If a borrow is converted to a raw reference, we must also assume that it lives
514 // forever. Note that the final liveness is still bounded by the storage liveness
515 // of the local, which happens using the `intersect` operation below.
516 borrowed_locals_cursor
.seek_before_primary_effect(loc
);
517 live_locals
.union(borrowed_locals_cursor
.get());
520 // Store the storage liveness for later use so we can restore the state
521 // after a suspension point
522 storage_live
.seek_before_primary_effect(loc
);
523 storage_liveness_map
[block
] = Some(storage_live
.get().clone());
525 // Locals live are live at this point only if they are used across
526 // suspension points (the `liveness` variable)
527 // and their storage is required (the `storage_required` variable)
528 requires_storage_cursor
.seek_before_primary_effect(loc
);
529 live_locals
.intersect(requires_storage_cursor
.get());
531 // The generator argument is ignored.
532 live_locals
.remove(SELF_ARG
);
534 debug
!("loc = {:?}, live_locals = {:?}", loc
, live_locals
);
536 // Add the locals live at this suspension point to the set of locals which live across
537 // any suspension points
538 live_locals_at_any_suspension_point
.union(&live_locals
);
540 live_locals_at_suspension_points
.push(live_locals
);
541 source_info_at_suspension_points
.push(data
.terminator().source_info
);
545 debug
!("live_locals_anywhere = {:?}", live_locals_at_any_suspension_point
);
546 let saved_locals
= GeneratorSavedLocals(live_locals_at_any_suspension_point
);
548 // Renumber our liveness_map bitsets to include only the locals we are
550 let live_locals_at_suspension_points
= live_locals_at_suspension_points
552 .map(|live_here
| saved_locals
.renumber_bitset(&live_here
))
555 let storage_conflicts
= compute_storage_conflicts(
558 always_live_locals
.clone(),
559 requires_storage_results
,
564 live_locals_at_suspension_points
,
565 source_info_at_suspension_points
,
567 storage_liveness
: storage_liveness_map
,
571 /// The set of `Local`s that must be saved across yield points.
573 /// `GeneratorSavedLocal` is indexed in terms of the elements in this set;
574 /// i.e. `GeneratorSavedLocal::new(1)` corresponds to the second local
575 /// included in this set.
576 struct GeneratorSavedLocals(BitSet
<Local
>);
578 impl GeneratorSavedLocals
{
579 /// Returns an iterator over each `GeneratorSavedLocal` along with the `Local` it corresponds
581 fn iter_enumerated(&self) -> impl '_
+ Iterator
<Item
= (GeneratorSavedLocal
, Local
)> {
582 self.iter().enumerate().map(|(i
, l
)| (GeneratorSavedLocal
::from(i
), l
))
585 /// Transforms a `BitSet<Local>` that contains only locals saved across yield points to the
586 /// equivalent `BitSet<GeneratorSavedLocal>`.
587 fn renumber_bitset(&self, input
: &BitSet
<Local
>) -> BitSet
<GeneratorSavedLocal
> {
588 assert
!(self.superset(&input
), "{:?} not a superset of {:?}", self.0, input
);
589 let mut out
= BitSet
::new_empty(self.count());
590 for (saved_local
, local
) in self.iter_enumerated() {
591 if input
.contains(local
) {
592 out
.insert(saved_local
);
598 fn get(&self, local
: Local
) -> Option
<GeneratorSavedLocal
> {
599 if !self.contains(local
) {
603 let idx
= self.iter().take_while(|&l
| l
< local
).count();
604 Some(GeneratorSavedLocal
::new(idx
))
608 impl ops
::Deref
for GeneratorSavedLocals
{
609 type Target
= BitSet
<Local
>;
611 fn deref(&self) -> &Self::Target
{
616 /// For every saved local, looks for which locals are StorageLive at the same
617 /// time. Generates a bitset for every local of all the other locals that may be
618 /// StorageLive simultaneously with that local. This is used in the layout
619 /// computation; see `GeneratorLayout` for more.
620 fn compute_storage_conflicts(
621 body
: &'mir Body
<'tcx
>,
622 saved_locals
: &GeneratorSavedLocals
,
623 always_live_locals
: storage
::AlwaysLiveLocals
,
624 requires_storage
: dataflow
::Results
<'tcx
, MaybeRequiresStorage
<'mir
, 'tcx
>>,
625 ) -> BitMatrix
<GeneratorSavedLocal
, GeneratorSavedLocal
> {
626 assert_eq
!(body
.local_decls
.len(), saved_locals
.domain_size());
628 debug
!("compute_storage_conflicts({:?})", body
.span
);
629 debug
!("always_live = {:?}", always_live_locals
);
631 // Locals that are always live or ones that need to be stored across
632 // suspension points are not eligible for overlap.
633 let mut ineligible_locals
= always_live_locals
.into_inner();
634 ineligible_locals
.intersect(saved_locals
);
636 // Compute the storage conflicts for all eligible locals.
637 let mut visitor
= StorageConflictVisitor
{
639 saved_locals
: &saved_locals
,
640 local_conflicts
: BitMatrix
::from_row_n(&ineligible_locals
, body
.local_decls
.len()),
643 requires_storage
.visit_reachable_with(body
, &mut visitor
);
645 let local_conflicts
= visitor
.local_conflicts
;
647 // Compress the matrix using only stored locals (Local -> GeneratorSavedLocal).
649 // NOTE: Today we store a full conflict bitset for every local. Technically
650 // this is twice as many bits as we need, since the relation is symmetric.
651 // However, in practice these bitsets are not usually large. The layout code
652 // also needs to keep track of how many conflicts each local has, so it's
653 // simpler to keep it this way for now.
654 let mut storage_conflicts
= BitMatrix
::new(saved_locals
.count(), saved_locals
.count());
655 for (saved_local_a
, local_a
) in saved_locals
.iter_enumerated() {
656 if ineligible_locals
.contains(local_a
) {
657 // Conflicts with everything.
658 storage_conflicts
.insert_all_into_row(saved_local_a
);
660 // Keep overlap information only for stored locals.
661 for (saved_local_b
, local_b
) in saved_locals
.iter_enumerated() {
662 if local_conflicts
.contains(local_a
, local_b
) {
663 storage_conflicts
.insert(saved_local_a
, saved_local_b
);
671 struct StorageConflictVisitor
<'mir
, 'tcx
, 's
> {
672 body
: &'mir Body
<'tcx
>,
673 saved_locals
: &'s GeneratorSavedLocals
,
674 // FIXME(tmandry): Consider using sparse bitsets here once we have good
675 // benchmarks for generators.
676 local_conflicts
: BitMatrix
<Local
, Local
>,
679 impl dataflow
::ResultsVisitor
<'mir
, 'tcx
> for StorageConflictVisitor
<'mir
, 'tcx
, '_
> {
680 type FlowState
= BitSet
<Local
>;
682 fn visit_statement_before_primary_effect(
684 state
: &Self::FlowState
,
685 _statement
: &'mir Statement
<'tcx
>,
688 self.apply_state(state
, loc
);
691 fn visit_terminator_before_primary_effect(
693 state
: &Self::FlowState
,
694 _terminator
: &'mir Terminator
<'tcx
>,
697 self.apply_state(state
, loc
);
701 impl<'body
, 'tcx
, 's
> StorageConflictVisitor
<'body
, 'tcx
, 's
> {
702 fn apply_state(&mut self, flow_state
: &BitSet
<Local
>, loc
: Location
) {
703 // Ignore unreachable blocks.
704 if self.body
.basic_blocks()[loc
.block
].terminator().kind
== TerminatorKind
::Unreachable
{
708 let mut eligible_storage_live
= flow_state
.clone();
709 eligible_storage_live
.intersect(&self.saved_locals
);
711 for local
in eligible_storage_live
.iter() {
712 self.local_conflicts
.union_row_with(&eligible_storage_live
, local
);
715 if eligible_storage_live
.count() > 1 {
716 trace
!("at {:?}, eligible_storage_live={:?}", loc
, eligible_storage_live
);
721 /// Validates the typeck view of the generator against the actual set of types saved between
723 fn sanitize_witness
<'tcx
>(
728 upvars
: &Vec
<Ty
<'tcx
>>,
729 saved_locals
: &GeneratorSavedLocals
,
731 let allowed_upvars
= tcx
.erase_regions(upvars
);
732 let allowed
= match witness
.kind() {
733 ty
::GeneratorWitness(s
) => tcx
.erase_late_bound_regions(&s
),
735 tcx
.sess
.delay_span_bug(
737 &format
!("unexpected generator witness type {:?}", witness
.kind()),
743 let param_env
= tcx
.param_env(did
);
745 for (local
, decl
) in body
.local_decls
.iter_enumerated() {
746 // Ignore locals which are internal or not saved between yields.
747 if !saved_locals
.contains(local
) || decl
.internal
{
750 let decl_ty
= tcx
.normalize_erasing_regions(param_env
, decl
.ty
);
752 // Sanity check that typeck knows about the type of locals which are
753 // live across a suspension point
754 if !allowed
.contains(&decl_ty
) && !allowed_upvars
.contains(&decl_ty
) {
757 "Broken MIR: generator contains type {} in MIR, \
758 but typeck only knows about {}",
766 fn compute_layout
<'tcx
>(
767 liveness
: LivenessInfo
,
768 body
: &mut Body
<'tcx
>,
770 FxHashMap
<Local
, (Ty
<'tcx
>, VariantIdx
, usize)>,
771 GeneratorLayout
<'tcx
>,
772 IndexVec
<BasicBlock
, Option
<BitSet
<Local
>>>,
776 live_locals_at_suspension_points
,
777 source_info_at_suspension_points
,
782 // Gather live local types and their indices.
783 let mut locals
= IndexVec
::<GeneratorSavedLocal
, _
>::new();
784 let mut tys
= IndexVec
::<GeneratorSavedLocal
, _
>::new();
785 for (saved_local
, local
) in saved_locals
.iter_enumerated() {
787 tys
.push(body
.local_decls
[local
].ty
);
788 debug
!("generator saved local {:?} => {:?}", saved_local
, local
);
791 // Leave empty variants for the UNRESUMED, RETURNED, and POISONED states.
792 // In debuginfo, these will correspond to the beginning (UNRESUMED) or end
793 // (RETURNED, POISONED) of the function.
794 const RESERVED_VARIANTS
: usize = 3;
795 let body_span
= body
.source_scopes
[OUTERMOST_SOURCE_SCOPE
].span
;
796 let mut variant_source_info
: IndexVec
<VariantIdx
, SourceInfo
> = [
797 SourceInfo
::outermost(body_span
.shrink_to_lo()),
798 SourceInfo
::outermost(body_span
.shrink_to_hi()),
799 SourceInfo
::outermost(body_span
.shrink_to_hi()),
805 // Build the generator variant field list.
806 // Create a map from local indices to generator struct indices.
807 let mut variant_fields
: IndexVec
<VariantIdx
, IndexVec
<Field
, GeneratorSavedLocal
>> =
808 iter
::repeat(IndexVec
::new()).take(RESERVED_VARIANTS
).collect();
809 let mut remap
= FxHashMap
::default();
810 for (suspension_point_idx
, live_locals
) in live_locals_at_suspension_points
.iter().enumerate() {
811 let variant_index
= VariantIdx
::from(RESERVED_VARIANTS
+ suspension_point_idx
);
812 let mut fields
= IndexVec
::new();
813 for (idx
, saved_local
) in live_locals
.iter().enumerate() {
814 fields
.push(saved_local
);
815 // Note that if a field is included in multiple variants, we will
816 // just use the first one here. That's fine; fields do not move
817 // around inside generators, so it doesn't matter which variant
818 // index we access them by.
819 remap
.entry(locals
[saved_local
]).or_insert((tys
[saved_local
], variant_index
, idx
));
821 variant_fields
.push(fields
);
822 variant_source_info
.push(source_info_at_suspension_points
[suspension_point_idx
]);
824 debug
!("generator variant_fields = {:?}", variant_fields
);
825 debug
!("generator storage_conflicts = {:#?}", storage_conflicts
);
828 GeneratorLayout { field_tys: tys, variant_fields, variant_source_info, storage_conflicts }
;
830 (remap
, layout
, storage_liveness
)
833 /// Replaces the entry point of `body` with a block that switches on the generator discriminant and
834 /// dispatches to blocks according to `cases`.
836 /// After this function, the former entry point of the function will be bb1.
837 fn insert_switch
<'tcx
>(
838 body
: &mut Body
<'tcx
>,
839 cases
: Vec
<(usize, BasicBlock
)>,
840 transform
: &TransformVisitor
<'tcx
>,
841 default: TerminatorKind
<'tcx
>,
843 let default_block
= insert_term_block(body
, default);
844 let (assign
, discr
) = transform
.get_discr(body
);
845 let switch
= TerminatorKind
::SwitchInt
{
846 discr
: Operand
::Move(discr
),
847 switch_ty
: transform
.discr_ty
,
848 values
: Cow
::from(cases
.iter().map(|&(i
, _
)| i
as u128
).collect
::<Vec
<_
>>()),
849 targets
: cases
.iter().map(|&(_
, d
)| d
).chain(iter
::once(default_block
)).collect(),
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
>, def_id
: DefId
, body
: &mut Body
<'tcx
>) {
870 use crate::shim
::DropShimElaborator
;
871 use crate::util
::elaborate_drops
::{elaborate_drop, Unwind}
;
872 use crate::util
::patch
::MirPatch
;
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 param_env
= tcx
.param_env(def_id
);
880 let mut elaborator
= DropShimElaborator { body, patch: MirPatch::new(body), tcx, param_env }
;
882 for (block
, block_data
) in body
.basic_blocks().iter_enumerated() {
883 let (target
, unwind
, source_info
) = match block_data
.terminator() {
884 Terminator { source_info, kind: TerminatorKind::Drop { place, target, unwind }
} => {
885 if let Some(local
) = place
.as_local() {
886 if local
== SELF_ARG
{
887 (target
, unwind
, source_info
)
897 let unwind
= if block_data
.is_cleanup
{
900 Unwind
::To(unwind
.unwrap_or_else(|| elaborator
.patch
.resume_block()))
905 Place
::from(SELF_ARG
),
912 elaborator
.patch
.apply(body
);
915 fn create_generator_drop_shim
<'tcx
>(
917 transform
: &TransformVisitor
<'tcx
>,
918 source
: MirSource
<'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 Place
::from(SELF_ARG
)),
965 no_landing_pads(tcx
, &mut body
);
967 // Make sure we remove dead blocks to remove
968 // unrelated code from the resume part of the function
969 simplify
::remove_dead_blocks(&mut body
);
971 dump_mir(tcx
, None
, "generator_drop", &0, source
, &body
, |_
, _
| Ok(()));
976 fn insert_term_block
<'tcx
>(body
: &mut Body
<'tcx
>, kind
: TerminatorKind
<'tcx
>) -> BasicBlock
{
977 let source_info
= SourceInfo
::outermost(body
.span
);
978 body
.basic_blocks_mut().push(BasicBlockData
{
979 statements
: Vec
::new(),
980 terminator
: Some(Terminator { source_info, kind }
),
985 fn insert_panic_block
<'tcx
>(
987 body
: &mut Body
<'tcx
>,
988 message
: AssertMessage
<'tcx
>,
990 let assert_block
= BasicBlock
::new(body
.basic_blocks().len());
991 let term
= TerminatorKind
::Assert
{
992 cond
: Operand
::Constant(box Constant
{
995 literal
: ty
::Const
::from_bool(tcx
, false),
999 target
: assert_block
,
1003 let source_info
= SourceInfo
::outermost(body
.span
);
1004 body
.basic_blocks_mut().push(BasicBlockData
{
1005 statements
: Vec
::new(),
1006 terminator
: Some(Terminator { source_info, kind: term }
),
1013 fn can_return
<'tcx
>(tcx
: TyCtxt
<'tcx
>, body
: &Body
<'tcx
>) -> bool
{
1014 // Returning from a function with an uninhabited return type is undefined behavior.
1015 if body
.return_ty().conservative_is_privately_uninhabited(tcx
) {
1019 // If there's a return terminator the function may return.
1020 for block
in body
.basic_blocks() {
1021 if let TerminatorKind
::Return
= block
.terminator().kind
{
1026 // Otherwise the function can't return.
1030 fn can_unwind
<'tcx
>(tcx
: TyCtxt
<'tcx
>, body
: &Body
<'tcx
>) -> bool
{
1031 // Nothing can unwind when landing pads are off.
1032 if tcx
.sess
.panic_strategy() == PanicStrategy
::Abort
{
1036 // Unwinds can only start at certain terminators.
1037 for block
in body
.basic_blocks() {
1038 match block
.terminator().kind
{
1039 // These never unwind.
1040 TerminatorKind
::Goto { .. }
1041 | TerminatorKind
::SwitchInt { .. }
1042 | TerminatorKind
::Abort
1043 | TerminatorKind
::Return
1044 | TerminatorKind
::Unreachable
1045 | TerminatorKind
::GeneratorDrop
1046 | TerminatorKind
::FalseEdge { .. }
1047 | TerminatorKind
::FalseUnwind { .. }
1048 | TerminatorKind
::InlineAsm { .. }
=> {}
1050 // Resume will *continue* unwinding, but if there's no other unwinding terminator it
1051 // will never be reached.
1052 TerminatorKind
::Resume
=> {}
1054 TerminatorKind
::Yield { .. }
=> {
1055 unreachable
!("`can_unwind` called before generator transform")
1058 // These may unwind.
1059 TerminatorKind
::Drop { .. }
1060 | TerminatorKind
::DropAndReplace { .. }
1061 | TerminatorKind
::Call { .. }
1062 | TerminatorKind
::Assert { .. }
=> return true,
1066 // If we didn't find an unwinding terminator, the function cannot unwind.
1070 fn create_generator_resume_function
<'tcx
>(
1072 transform
: TransformVisitor
<'tcx
>,
1073 source
: MirSource
<'tcx
>,
1074 body
: &mut Body
<'tcx
>,
1077 let can_unwind
= can_unwind(tcx
, body
);
1079 // Poison the generator when it unwinds
1081 let source_info
= SourceInfo
::outermost(body
.span
);
1082 let poison_block
= body
.basic_blocks_mut().push(BasicBlockData
{
1083 statements
: vec
![transform
.set_discr(VariantIdx
::new(POISONED
), source_info
)],
1084 terminator
: Some(Terminator { source_info, kind: TerminatorKind::Resume }
),
1088 for (idx
, block
) in body
.basic_blocks_mut().iter_enumerated_mut() {
1089 let source_info
= block
.terminator().source_info
;
1091 if let TerminatorKind
::Resume
= block
.terminator().kind
{
1092 // An existing `Resume` terminator is redirected to jump to our dedicated
1093 // "poisoning block" above.
1094 if idx
!= poison_block
{
1095 *block
.terminator_mut() = Terminator
{
1097 kind
: TerminatorKind
::Goto { target: poison_block }
,
1100 } else if !block
.is_cleanup
{
1101 // Any terminators that *can* unwind but don't have an unwind target set are also
1102 // pointed at our poisoning block (unless they're part of the cleanup path).
1103 if let Some(unwind @ None
) = block
.terminator_mut().unwind_mut() {
1104 *unwind
= Some(poison_block
);
1110 let mut cases
= create_cases(body
, &transform
, Operation
::Resume
);
1112 use rustc_middle
::mir
::AssertKind
::{ResumedAfterPanic, ResumedAfterReturn}
;
1114 // Jump to the entry point on the unresumed
1115 cases
.insert(0, (UNRESUMED
, BasicBlock
::new(0)));
1117 // Panic when resumed on the returned or poisoned state
1118 let generator_kind
= body
.generator_kind
.unwrap();
1123 (POISONED
, insert_panic_block(tcx
, body
, ResumedAfterPanic(generator_kind
))),
1130 (RETURNED
, insert_panic_block(tcx
, body
, ResumedAfterReturn(generator_kind
))),
1134 insert_switch(body
, cases
, &transform
, TerminatorKind
::Unreachable
);
1136 make_generator_state_argument_indirect(tcx
, body
);
1137 make_generator_state_argument_pinned(tcx
, body
);
1139 no_landing_pads(tcx
, body
);
1141 // Make sure we remove dead blocks to remove
1142 // unrelated code from the drop part of the function
1143 simplify
::remove_dead_blocks(body
);
1145 dump_mir(tcx
, None
, "generator_resume", &0, source
, body
, |_
, _
| Ok(()));
1148 fn insert_clean_drop(body
: &mut Body
<'_
>) -> BasicBlock
{
1149 let return_block
= insert_term_block(body
, TerminatorKind
::Return
);
1152 TerminatorKind
::Drop { place: Place::from(SELF_ARG), target: return_block, unwind: None }
;
1153 let source_info
= SourceInfo
::outermost(body
.span
);
1155 // Create a block to destroy an unresumed generators. This can only destroy upvars.
1156 body
.basic_blocks_mut().push(BasicBlockData
{
1157 statements
: Vec
::new(),
1158 terminator
: Some(Terminator { source_info, kind: term }
),
1163 /// An operation that can be performed on a generator.
1164 #[derive(PartialEq, Copy, Clone)]
1171 fn target_block(self, point
: &SuspensionPoint
<'_
>) -> Option
<BasicBlock
> {
1173 Operation
::Resume
=> Some(point
.resume
),
1174 Operation
::Drop
=> point
.drop
,
1179 fn create_cases
<'tcx
>(
1180 body
: &mut Body
<'tcx
>,
1181 transform
: &TransformVisitor
<'tcx
>,
1182 operation
: Operation
,
1183 ) -> Vec
<(usize, BasicBlock
)> {
1184 let source_info
= SourceInfo
::outermost(body
.span
);
1189 .filter_map(|point
| {
1190 // Find the target for this suspension point, if applicable
1191 operation
.target_block(point
).map(|target
| {
1192 let mut statements
= Vec
::new();
1194 // Create StorageLive instructions for locals with live storage
1195 for i
in 0..(body
.local_decls
.len()) {
1197 // The resume argument is live on function entry. Don't insert a
1198 // `StorageLive`, or the following `Assign` will read from uninitialized
1203 let l
= Local
::new(i
);
1204 let needs_storage_live
= point
.storage_liveness
.contains(l
)
1205 && !transform
.remap
.contains_key(&l
)
1206 && !transform
.always_live_locals
.contains(l
);
1207 if needs_storage_live
{
1209 .push(Statement { source_info, kind: StatementKind::StorageLive(l) }
);
1213 if operation
== Operation
::Resume
{
1214 // Move the resume argument to the destination place of the `Yield` terminator
1215 let resume_arg
= Local
::new(2); // 0 = return, 1 = self
1216 statements
.push(Statement
{
1218 kind
: StatementKind
::Assign(box (
1220 Rvalue
::Use(Operand
::Move(resume_arg
.into())),
1225 // Then jump to the real target
1226 let block
= body
.basic_blocks_mut().push(BasicBlockData
{
1228 terminator
: Some(Terminator
{
1230 kind
: TerminatorKind
::Goto { target }
,
1235 (point
.state
, block
)
1241 impl<'tcx
> MirPass
<'tcx
> for StateTransform
{
1242 fn run_pass(&self, tcx
: TyCtxt
<'tcx
>, source
: MirSource
<'tcx
>, body
: &mut Body
<'tcx
>) {
1243 let yield_ty
= if let Some(yield_ty
) = body
.yield_ty
{
1246 // This only applies to generators
1250 assert
!(body
.generator_drop
.is_none());
1252 let def_id
= source
.def_id();
1254 // The first argument is the generator type passed by value
1255 let gen_ty
= body
.local_decls
.raw
[1].ty
;
1257 // Get the interior types and substs which typeck computed
1258 let (upvars
, interior
, discr_ty
, movable
) = match *gen_ty
.kind() {
1259 ty
::Generator(_
, substs
, movability
) => {
1260 let substs
= substs
.as_generator();
1262 substs
.upvar_tys().collect(),
1264 substs
.discr_ty(tcx
),
1265 movability
== hir
::Movability
::Movable
,
1270 .delay_span_bug(body
.span
, &format
!("unexpected generator type {}", gen_ty
));
1275 // Compute GeneratorState<yield_ty, return_ty>
1276 let state_did
= tcx
.require_lang_item(LangItem
::GeneratorState
, None
);
1277 let state_adt_ref
= tcx
.adt_def(state_did
);
1278 let state_substs
= tcx
.intern_substs(&[yield_ty
.into(), body
.return_ty().into()]);
1279 let ret_ty
= tcx
.mk_adt(state_adt_ref
, state_substs
);
1281 // We rename RETURN_PLACE which has type mir.return_ty to new_ret_local
1282 // RETURN_PLACE then is a fresh unused local with type ret_ty.
1283 let new_ret_local
= replace_local(RETURN_PLACE
, ret_ty
, body
, tcx
);
1285 // We also replace the resume argument and insert an `Assign`.
1286 // This is needed because the resume argument `_2` might be live across a `yield`, in which
1287 // case there is no `Assign` to it that the transform can turn into a store to the generator
1288 // state. After the yield the slot in the generator state would then be uninitialized.
1289 let resume_local
= Local
::new(2);
1290 let new_resume_local
=
1291 replace_local(resume_local
, body
.local_decls
[resume_local
].ty
, body
, tcx
);
1293 // When first entering the generator, move the resume argument into its new local.
1294 let source_info
= SourceInfo
::outermost(body
.span
);
1295 let stmts
= &mut body
.basic_blocks_mut()[BasicBlock
::new(0)].statements
;
1300 kind
: StatementKind
::Assign(box (
1301 new_resume_local
.into(),
1302 Rvalue
::Use(Operand
::Move(resume_local
.into())),
1307 let always_live_locals
= storage
::AlwaysLiveLocals
::new(&body
);
1310 locals_live_across_suspend_points(tcx
, body
, source
, &always_live_locals
, movable
);
1312 sanitize_witness(tcx
, body
, def_id
, interior
, &upvars
, &liveness_info
.saved_locals
);
1314 if tcx
.sess
.opts
.debugging_opts
.validate_mir
{
1315 let mut vis
= EnsureGeneratorFieldAssignmentsNeverAlias
{
1316 assigned_local
: None
,
1317 saved_locals
: &liveness_info
.saved_locals
,
1318 storage_conflicts
: &liveness_info
.storage_conflicts
,
1321 vis
.visit_body(body
);
1324 // Extract locals which are live across suspension point into `layout`
1325 // `remap` gives a mapping from local indices onto generator struct indices
1326 // `storage_liveness` tells us which locals have live storage at suspension points
1327 let (remap
, layout
, storage_liveness
) = compute_layout(liveness_info
, body
);
1329 let can_return
= can_return(tcx
, body
);
1331 // Run the transformation which converts Places from Local to generator struct
1332 // accesses for locals in `remap`.
1333 // It also rewrites `return x` and `yield y` as writing a new generator state and returning
1334 // GeneratorState::Complete(x) and GeneratorState::Yielded(y) respectively.
1335 let mut transform
= TransformVisitor
{
1342 suspension_points
: Vec
::new(),
1346 transform
.visit_body(body
);
1348 // Update our MIR struct to reflect the changes we've made
1349 body
.yield_ty
= None
;
1350 body
.arg_count
= 2; // self, resume arg
1351 body
.spread_arg
= None
;
1352 body
.generator_layout
= Some(layout
);
1354 // Insert `drop(generator_struct)` which is used to drop upvars for generators in
1355 // the unresumed state.
1356 // This is expanded to a drop ladder in `elaborate_generator_drops`.
1357 let drop_clean
= insert_clean_drop(body
);
1359 dump_mir(tcx
, None
, "generator_pre-elab", &0, source
, body
, |_
, _
| Ok(()));
1361 // Expand `drop(generator_struct)` to a drop ladder which destroys upvars.
1362 // If any upvars are moved out of, drop elaboration will handle upvar destruction.
1363 // However we need to also elaborate the code generated by `insert_clean_drop`.
1364 elaborate_generator_drops(tcx
, def_id
, body
);
1366 dump_mir(tcx
, None
, "generator_post-transform", &0, source
, body
, |_
, _
| Ok(()));
1368 // Create a copy of our MIR and use it to create the drop shim for the generator
1370 create_generator_drop_shim(tcx
, &transform
, source
, gen_ty
, body
, drop_clean
);
1372 body
.generator_drop
= Some(box drop_shim
);
1374 // Create the Generator::resume function
1375 create_generator_resume_function(tcx
, transform
, source
, body
, can_return
);
1379 /// Looks for any assignments between locals (e.g., `_4 = _5`) that will both be converted to fields
1380 /// in the generator state machine but whose storage is not marked as conflicting
1382 /// Validation needs to happen immediately *before* `TransformVisitor` is invoked, not after.
1384 /// This condition would arise when the assignment is the last use of `_5` but the initial
1385 /// definition of `_4` if we weren't extra careful to mark all locals used inside a statement as
1386 /// conflicting. Non-conflicting generator saved locals may be stored at the same location within
1387 /// the generator state machine, which would result in ill-formed MIR: the left-hand and right-hand
1388 /// sides of an assignment may not alias. This caused a miscompilation in [#73137].
1390 /// [#73137]: https://github.com/rust-lang/rust/issues/73137
1391 struct EnsureGeneratorFieldAssignmentsNeverAlias
<'a
> {
1392 saved_locals
: &'a GeneratorSavedLocals
,
1393 storage_conflicts
: &'a BitMatrix
<GeneratorSavedLocal
, GeneratorSavedLocal
>,
1394 assigned_local
: Option
<GeneratorSavedLocal
>,
1397 impl EnsureGeneratorFieldAssignmentsNeverAlias
<'_
> {
1398 fn saved_local_for_direct_place(&self, place
: Place
<'_
>) -> Option
<GeneratorSavedLocal
> {
1399 if place
.is_indirect() {
1403 self.saved_locals
.get(place
.local
)
1406 fn check_assigned_place(&mut self, place
: Place
<'tcx
>, f
: impl FnOnce(&mut Self)) {
1407 if let Some(assigned_local
) = self.saved_local_for_direct_place(place
) {
1408 assert
!(self.assigned_local
.is_none(), "`check_assigned_place` must not recurse");
1410 self.assigned_local
= Some(assigned_local
);
1412 self.assigned_local
= None
;
1417 impl Visitor
<'tcx
> for EnsureGeneratorFieldAssignmentsNeverAlias
<'_
> {
1418 fn visit_place(&mut self, place
: &Place
<'tcx
>, context
: PlaceContext
, location
: Location
) {
1419 let lhs
= match self.assigned_local
{
1422 // This visitor only invokes `visit_place` for the right-hand side of an assignment
1423 // and only after setting `self.assigned_local`. However, the default impl of
1424 // `Visitor::super_body` may call `visit_place` with a `NonUseContext` for places
1425 // with debuginfo. Ignore them here.
1426 assert
!(!context
.is_use());
1431 let rhs
= match self.saved_local_for_direct_place(*place
) {
1436 if !self.storage_conflicts
.contains(lhs
, rhs
) {
1438 "Assignment between generator saved locals whose storage is not \
1439 marked as conflicting: {:?}: {:?} = {:?}",
1447 fn visit_statement(&mut self, statement
: &Statement
<'tcx
>, location
: Location
) {
1448 match &statement
.kind
{
1449 StatementKind
::Assign(box (lhs
, rhs
)) => {
1450 self.check_assigned_place(*lhs
, |this
| this
.visit_rvalue(rhs
, location
));
1453 // FIXME: Does `llvm_asm!` have any aliasing requirements?
1454 StatementKind
::LlvmInlineAsm(_
) => {}
1456 StatementKind
::FakeRead(..)
1457 | StatementKind
::SetDiscriminant { .. }
1458 | StatementKind
::StorageLive(_
)
1459 | StatementKind
::StorageDead(_
)
1460 | StatementKind
::Retag(..)
1461 | StatementKind
::AscribeUserType(..)
1462 | StatementKind
::Coverage(..)
1463 | StatementKind
::Nop
=> {}
1467 fn visit_terminator(&mut self, terminator
: &Terminator
<'tcx
>, location
: Location
) {
1468 // Checking for aliasing in terminators is probably overkill, but until we have actual
1469 // semantics, we should be conservative here.
1470 match &terminator
.kind
{
1471 TerminatorKind
::Call
{
1474 destination
: Some((dest
, _
)),
1479 self.check_assigned_place(*dest
, |this
| {
1480 this
.visit_operand(func
, location
);
1482 this
.visit_operand(arg
, location
);
1487 TerminatorKind
::Yield { value, resume: _, resume_arg, drop: _ }
=> {
1488 self.check_assigned_place(*resume_arg
, |this
| this
.visit_operand(value
, location
));
1491 // FIXME: Does `asm!` have any aliasing requirements?
1492 TerminatorKind
::InlineAsm { .. }
=> {}
1494 TerminatorKind
::Call { .. }
1495 | TerminatorKind
::Goto { .. }
1496 | TerminatorKind
::SwitchInt { .. }
1497 | TerminatorKind
::Resume
1498 | TerminatorKind
::Abort
1499 | TerminatorKind
::Return
1500 | TerminatorKind
::Unreachable
1501 | TerminatorKind
::Drop { .. }
1502 | TerminatorKind
::DropAndReplace { .. }
1503 | TerminatorKind
::Assert { .. }
1504 | TerminatorKind
::GeneratorDrop
1505 | TerminatorKind
::FalseEdge { .. }
1506 | TerminatorKind
::FalseUnwind { .. }
=> {}