1 #![allow(rustc::potential_query_instability)]
2 #![feature(box_patterns)]
3 #![feature(drain_filter)]
4 #![feature(let_chains)]
5 #![feature(map_try_insert)]
6 #![feature(min_specialization)]
7 #![feature(never_type)]
9 #![feature(option_get_or_insert_default)]
10 #![feature(trusted_step)]
11 #![feature(try_blocks)]
12 #![feature(yeet_expr)]
13 #![feature(if_let_guard)]
14 #![recursion_limit = "256"]
19 extern crate rustc_middle;
21 use required_consts::RequiredConstsVisitor;
22 use rustc_const_eval::util;
23 use rustc_data_structures::fx::FxIndexSet;
24 use rustc_data_structures::steal::Steal;
26 use rustc_hir::def_id::{DefId, LocalDefId};
27 use rustc_hir::intravisit::{self, Visitor};
28 use rustc_index::vec::IndexVec;
29 use rustc_middle::mir::visit::Visitor as _;
30 use rustc_middle::mir::{
31 traversal, AnalysisPhase, Body, ConstQualifs, Constant, LocalDecl, MirPass, MirPhase, Operand,
32 Place, ProjectionElem, Promoted, RuntimePhase, Rvalue, SourceInfo, Statement, StatementKind,
35 use rustc_middle::ty::query::Providers;
36 use rustc_middle::ty::{self, TyCtxt, TypeVisitable};
42 use pass_manager::{self as pm, Lint, MirLint, WithMinOptLevel};
44 mod abort_unwinding_calls;
46 mod add_moves_for_packed_drops;
48 mod check_const_item_mutation;
50 pub mod check_unsafety;
51 // This pass is public to allow external drivers to perform MIR cleanup
52 pub mod cleanup_post_borrowck;
59 mod dataflow_const_prop;
60 mod dead_store_elimination;
62 mod deduce_param_attrs;
63 mod deduplicate_blocks;
67 mod early_otherwise_branch;
68 mod elaborate_box_derefs;
71 mod function_item_references;
78 mod multiple_return_terminators;
79 mod normalize_array_len;
81 mod remove_noop_landing_pads;
82 mod remove_storage_markers;
83 mod remove_uninit_drops;
84 mod remove_unneeded_drops;
88 mod separate_const_switch;
90 // This pass is public to allow external drivers to perform MIR cleanup
92 mod simplify_branches;
93 mod simplify_comparison_integral;
96 mod uninhabited_enum_branching;
99 use rustc_const_eval::transform::check_consts::{self, ConstCx};
100 use rustc_const_eval::transform::promote_consts;
101 use rustc_const_eval::transform::validate;
102 use rustc_mir_dataflow::rustc_peek;
104 pub fn provide(providers: &mut Providers) {
105 check_unsafety::provide(providers);
106 check_packed_ref::provide(providers);
107 coverage::query::provide(providers);
108 ffi_unwind_calls::provide(providers);
109 shim::provide(providers);
110 *providers = Providers {
113 mir_const_qualif: |tcx, def_id| {
114 let def_id = def_id.expect_local();
115 if let Some(def) = ty::WithOptConstParam::try_lookup(def_id, tcx) {
116 tcx.mir_const_qualif_const_arg(def)
118 mir_const_qualif(tcx, ty::WithOptConstParam::unknown(def_id))
121 mir_const_qualif_const_arg: |tcx, (did, param_did)| {
122 mir_const_qualif(tcx, ty::WithOptConstParam { did, const_param_did: Some(param_did) })
125 mir_drops_elaborated_and_const_checked,
127 mir_for_ctfe_of_const_arg,
130 is_ctfe_mir_available: |tcx, did| is_mir_available(tcx, did),
131 mir_callgraph_reachable: inline::cycle::mir_callgraph_reachable,
132 mir_inliner_callees: inline::cycle::mir_inliner_callees,
133 promoted_mir: |tcx, def_id| {
134 let def_id = def_id.expect_local();
135 if let Some(def) = ty::WithOptConstParam::try_lookup(def_id, tcx) {
136 tcx.promoted_mir_of_const_arg(def)
138 promoted_mir(tcx, ty::WithOptConstParam::unknown(def_id))
141 promoted_mir_of_const_arg: |tcx, (did, param_did)| {
142 promoted_mir(tcx, ty::WithOptConstParam { did, const_param_did: Some(param_did) })
144 deduced_param_attrs: deduce_param_attrs::deduced_param_attrs,
149 fn remap_mir_for_const_eval_select<'tcx>(
151 mut body: Body<'tcx>,
152 context: hir::Constness,
154 for bb in body.basic_blocks.as_mut().iter_mut() {
155 let terminator = bb.terminator.as_mut().expect("invalid terminator");
156 match terminator.kind {
157 TerminatorKind::Call {
158 func: Operand::Constant(box Constant { ref literal, .. }),
165 } if let ty::FnDef(def_id, _) = *literal.ty().kind()
166 && tcx.item_name(def_id) == sym::const_eval_select
167 && tcx.is_intrinsic(def_id) =>
169 let [tupled_args, called_in_const, called_at_rt]: [_; 3] = std::mem::take(args).try_into().unwrap();
170 let ty = tupled_args.ty(&body.local_decls, tcx);
171 let fields = ty.tuple_fields();
172 let num_args = fields.len();
173 let func = if context == hir::Constness::Const { called_in_const } else { called_at_rt };
174 let (method, place): (fn(Place<'tcx>) -> Operand<'tcx>, Place<'tcx>) = match tupled_args {
175 Operand::Constant(_) => {
176 // there is no good way of extracting a tuple arg from a constant (const generic stuff)
177 // so we just create a temporary and deconstruct that.
178 let local = body.local_decls.push(LocalDecl::new(ty, fn_span));
179 bb.statements.push(Statement {
180 source_info: SourceInfo::outermost(fn_span),
181 kind: StatementKind::Assign(Box::new((local.into(), Rvalue::Use(tupled_args.clone())))),
183 (Operand::Move, local.into())
185 Operand::Move(place) => (Operand::Move, place),
186 Operand::Copy(place) => (Operand::Copy, place),
188 let place_elems = place.projection;
189 let arguments = (0..num_args).map(|x| {
190 let mut place_elems = place_elems.to_vec();
191 place_elems.push(ProjectionElem::Field(x.into(), fields[x]));
192 let projection = tcx.intern_place_elems(&place_elems);
199 terminator.kind = TerminatorKind::Call { func, args: arguments, destination, target, cleanup, from_hir_call: false, fn_span };
207 fn is_mir_available(tcx: TyCtxt<'_>, def_id: DefId) -> bool {
208 let def_id = def_id.expect_local();
209 tcx.mir_keys(()).contains(&def_id)
212 /// Finds the full set of `DefId`s within the current crate that have
213 /// MIR associated with them.
214 fn mir_keys(tcx: TyCtxt<'_>, (): ()) -> FxIndexSet<LocalDefId> {
215 let mut set = FxIndexSet::default();
217 // All body-owners have MIR associated with them.
218 set.extend(tcx.hir().body_owners());
220 // Additionally, tuple struct/variant constructors have MIR, but
221 // they don't have a BodyId, so we need to build them separately.
222 struct GatherCtors<'a> {
223 set: &'a mut FxIndexSet<LocalDefId>,
225 impl<'tcx> Visitor<'tcx> for GatherCtors<'_> {
226 fn visit_variant_data(&mut self, v: &'tcx hir::VariantData<'tcx>) {
227 if let hir::VariantData::Tuple(_, _, def_id) = *v {
228 self.set.insert(def_id);
230 intravisit::walk_struct_def(self, v)
233 tcx.hir().visit_all_item_likes_in_crate(&mut GatherCtors { set: &mut set });
238 fn mir_const_qualif(tcx: TyCtxt<'_>, def: ty::WithOptConstParam<LocalDefId>) -> ConstQualifs {
239 let const_kind = tcx.hir().body_const_context(def.did);
241 // No need to const-check a non-const `fn`.
242 if const_kind.is_none() {
243 return Default::default();
246 // N.B., this `borrow()` is guaranteed to be valid (i.e., the value
247 // cannot yet be stolen), because `mir_promoted()`, which steals
248 // from `mir_const(), forces this query to execute before
249 // performing the steal.
250 let body = &tcx.mir_const(def).borrow();
252 if body.return_ty().references_error() {
253 tcx.sess.delay_span_bug(body.span, "mir_const_qualif: MIR had errors");
254 return Default::default();
257 let ccx = check_consts::ConstCx { body, tcx, const_kind, param_env: tcx.param_env(def.did) };
259 let mut validator = check_consts::check::Checker::new(&ccx);
260 validator.check_body();
262 // We return the qualifs in the return place for every MIR body, even though it is only used
263 // when deciding to promote a reference to a `const` for now.
264 validator.qualifs_in_return_place()
267 /// Make MIR ready for const evaluation. This is run on all MIR, not just on consts!
268 /// FIXME(oli-obk): it's unclear whether we still need this phase (and its corresponding query).
269 /// We used to have this for pre-miri MIR based const eval.
270 fn mir_const(tcx: TyCtxt<'_>, def: ty::WithOptConstParam<LocalDefId>) -> &Steal<Body<'_>> {
271 if let Some(def) = def.try_upgrade(tcx) {
272 return tcx.mir_const(def);
275 // Unsafety check uses the raw mir, so make sure it is run.
276 if !tcx.sess.opts.unstable_opts.thir_unsafeck {
277 if let Some(param_did) = def.const_param_did {
278 tcx.ensure().unsafety_check_result_for_const_arg((def.did, param_did));
280 tcx.ensure().unsafety_check_result(def.did);
284 // has_ffi_unwind_calls query uses the raw mir, so make sure it is run.
285 tcx.ensure().has_ffi_unwind_calls(def.did);
287 let mut body = tcx.mir_built(def).steal();
289 pass_manager::dump_mir_for_phase_change(tcx, &body);
296 &Lint(check_packed_ref::CheckPackedRef),
297 &Lint(check_const_item_mutation::CheckConstItemMutation),
298 &Lint(function_item_references::FunctionItemReferences),
299 // What we need to do constant evaluation.
300 &simplify::SimplifyCfg::new("initial"),
301 &rustc_peek::SanityCheck, // Just a lint
302 &ctfe_limit::CtfeLimit,
306 tcx.alloc_steal_mir(body)
309 /// Compute the main MIR body and the list of MIR bodies of the promoteds.
312 def: ty::WithOptConstParam<LocalDefId>,
313 ) -> (&Steal<Body<'_>>, &Steal<IndexVec<Promoted, Body<'_>>>) {
314 if let Some(def) = def.try_upgrade(tcx) {
315 return tcx.mir_promoted(def);
318 // Ensure that we compute the `mir_const_qualif` for constants at
319 // this point, before we steal the mir-const result.
320 // Also this means promotion can rely on all const checks having been done.
321 let const_qualifs = tcx.mir_const_qualif_opt_const_arg(def);
322 let mut body = tcx.mir_const(def).steal();
323 if let Some(error_reported) = const_qualifs.tainted_by_errors {
324 body.tainted_by_errors = Some(error_reported);
327 let mut required_consts = Vec::new();
328 let mut required_consts_visitor = RequiredConstsVisitor::new(&mut required_consts);
329 for (bb, bb_data) in traversal::reverse_postorder(&body) {
330 required_consts_visitor.visit_basic_block_data(bb, bb_data);
332 body.required_consts = required_consts;
334 // What we need to run borrowck etc.
335 let promote_pass = promote_consts::PromoteTemps::default();
341 &simplify::SimplifyCfg::new("promote-consts"),
342 &coverage::InstrumentCoverage,
344 Some(MirPhase::Analysis(AnalysisPhase::Initial)),
347 let promoted = promote_pass.promoted_fragments.into_inner();
348 (tcx.alloc_steal_mir(body), tcx.alloc_steal_promoted(promoted))
351 /// Compute the MIR that is used during CTFE (and thus has no optimizations run on it)
352 fn mir_for_ctfe(tcx: TyCtxt<'_>, def_id: DefId) -> &Body<'_> {
353 let did = def_id.expect_local();
354 if let Some(def) = ty::WithOptConstParam::try_lookup(did, tcx) {
355 tcx.mir_for_ctfe_of_const_arg(def)
357 tcx.arena.alloc(inner_mir_for_ctfe(tcx, ty::WithOptConstParam::unknown(did)))
361 /// Same as `mir_for_ctfe`, but used to get the MIR of a const generic parameter.
362 /// The docs on `WithOptConstParam` explain this a bit more, but the TLDR is that
363 /// we'd get cycle errors with `mir_for_ctfe`, because typeck would need to typeck
364 /// the const parameter while type checking the main body, which in turn would try
365 /// to type check the main body again.
366 fn mir_for_ctfe_of_const_arg(tcx: TyCtxt<'_>, (did, param_did): (LocalDefId, DefId)) -> &Body<'_> {
367 tcx.arena.alloc(inner_mir_for_ctfe(
369 ty::WithOptConstParam { did, const_param_did: Some(param_did) },
373 fn inner_mir_for_ctfe(tcx: TyCtxt<'_>, def: ty::WithOptConstParam<LocalDefId>) -> Body<'_> {
374 // FIXME: don't duplicate this between the optimized_mir/mir_for_ctfe queries
375 if tcx.is_constructor(def.did.to_def_id()) {
376 // There's no reason to run all of the MIR passes on constructors when
377 // we can just output the MIR we want directly. This also saves const
378 // qualification and borrow checking the trouble of special casing
380 return shim::build_adt_ctor(tcx, def.did.to_def_id());
385 .body_const_context(def.did)
386 .expect("mir_for_ctfe should not be used for runtime functions");
388 let body = tcx.mir_drops_elaborated_and_const_checked(def).borrow().clone();
390 let mut body = remap_mir_for_const_eval_select(tcx, body, hir::Constness::Const);
393 // Do not const prop functions, either they get executed at runtime or exported to metadata,
394 // so we run const prop on them, or they don't, in which case we const evaluate some control
395 // flow paths of the function and any errors in those paths will get emitted as const eval
397 hir::ConstContext::ConstFn => {}
398 // Static items always get evaluated, so we can just let const eval see if any erroneous
399 // control flow paths get executed.
400 hir::ConstContext::Static(_) => {}
401 // Associated constants get const prop run so we detect common failure situations in the
402 // crate that defined the constant.
403 // Technically we want to not run on regular const items, but oli-obk doesn't know how to
404 // conveniently detect that at this point without looking at the HIR.
405 hir::ConstContext::Const => {
409 &[&const_prop::ConstProp],
410 Some(MirPhase::Runtime(RuntimePhase::Optimized)),
415 debug_assert!(!body.has_free_regions(), "Free regions in MIR for CTFE");
420 /// Obtain just the main MIR (no promoteds) and run some cleanups on it. This also runs
421 /// mir borrowck *before* doing so in order to ensure that borrowck can be run and doesn't
422 /// end up missing the source MIR due to stealing happening.
423 fn mir_drops_elaborated_and_const_checked(
425 def: ty::WithOptConstParam<LocalDefId>,
426 ) -> &Steal<Body<'_>> {
427 if let Some(def) = def.try_upgrade(tcx) {
428 return tcx.mir_drops_elaborated_and_const_checked(def);
431 let mir_borrowck = tcx.mir_borrowck_opt_const_arg(def);
433 let is_fn_like = tcx.def_kind(def.did).is_fn_like();
435 let did = def.did.to_def_id();
436 let def = ty::WithOptConstParam::unknown(did);
438 // Do not compute the mir call graph without said call graph actually being used.
439 if inline::Inline.is_enabled(&tcx.sess) {
440 let _ = tcx.mir_inliner_callees(ty::InstanceDef::Item(def));
444 let (body, _) = tcx.mir_promoted(def);
445 let mut body = body.steal();
446 if let Some(error_reported) = mir_borrowck.tainted_by_errors {
447 body.tainted_by_errors = Some(error_reported);
450 run_analysis_to_runtime_passes(tcx, &mut body);
452 tcx.alloc_steal_mir(body)
455 fn run_analysis_to_runtime_passes<'tcx>(tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
456 assert!(body.phase == MirPhase::Analysis(AnalysisPhase::Initial));
457 let did = body.source.def_id();
459 debug!("analysis_mir_cleanup({:?})", did);
460 run_analysis_cleanup_passes(tcx, body);
461 assert!(body.phase == MirPhase::Analysis(AnalysisPhase::PostCleanup));
463 // Do a little drop elaboration before const-checking if `const_precise_live_drops` is enabled.
464 if check_consts::post_drop_elaboration::checking_enabled(&ConstCx::new(tcx, &body)) {
469 &remove_uninit_drops::RemoveUninitDrops,
470 &simplify::SimplifyCfg::new("remove-false-edges"),
474 check_consts::post_drop_elaboration::check_live_drops(tcx, &body); // FIXME: make this a MIR lint
477 debug!("runtime_mir_lowering({:?})", did);
478 run_runtime_lowering_passes(tcx, body);
479 assert!(body.phase == MirPhase::Runtime(RuntimePhase::Initial));
481 debug!("runtime_mir_cleanup({:?})", did);
482 run_runtime_cleanup_passes(tcx, body);
483 assert!(body.phase == MirPhase::Runtime(RuntimePhase::PostCleanup));
486 // FIXME(JakobDegen): Can we make these lists of passes consts?
488 /// After this series of passes, no lifetime analysis based on borrowing can be done.
489 fn run_analysis_cleanup_passes<'tcx>(tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
490 let passes: &[&dyn MirPass<'tcx>] = &[
491 &cleanup_post_borrowck::CleanupPostBorrowck,
492 &remove_noop_landing_pads::RemoveNoopLandingPads,
493 &simplify::SimplifyCfg::new("early-opt"),
494 &deref_separator::Derefer,
497 pm::run_passes(tcx, body, passes, Some(MirPhase::Analysis(AnalysisPhase::PostCleanup)));
500 /// Returns the sequence of passes that lowers analysis to runtime MIR.
501 fn run_runtime_lowering_passes<'tcx>(tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
502 let passes: &[&dyn MirPass<'tcx>] = &[
503 // These next passes must be executed together
504 &add_call_guards::CriticalCallEdges,
505 &elaborate_drops::ElaborateDrops,
506 // This will remove extraneous landing pads which are no longer
507 // necessary as well as well as forcing any call in a non-unwinding
508 // function calling a possibly-unwinding function to abort the process.
509 &abort_unwinding_calls::AbortUnwindingCalls,
510 // AddMovesForPackedDrops needs to run after drop
512 &add_moves_for_packed_drops::AddMovesForPackedDrops,
513 // `AddRetag` needs to run after `ElaborateDrops`. Otherwise it should run fairly late,
514 // but before optimizations begin.
515 &elaborate_box_derefs::ElaborateBoxDerefs,
516 &generator::StateTransform,
517 &add_retag::AddRetag,
518 // Deaggregator is necessary for const prop. We may want to consider implementing
519 // CTFE support for aggregates.
520 &deaggregator::Deaggregator,
521 &Lint(const_prop_lint::ConstProp),
523 pm::run_passes_no_validate(tcx, body, passes, Some(MirPhase::Runtime(RuntimePhase::Initial)));
526 /// Returns the sequence of passes that do the initial cleanup of runtime MIR.
527 fn run_runtime_cleanup_passes<'tcx>(tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
528 let passes: &[&dyn MirPass<'tcx>] =
529 &[&lower_intrinsics::LowerIntrinsics, &simplify::SimplifyCfg::new("elaborate-drops")];
531 pm::run_passes(tcx, body, passes, Some(MirPhase::Runtime(RuntimePhase::PostCleanup)));
534 fn run_optimization_passes<'tcx>(tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
535 fn o1<T>(x: T) -> WithMinOptLevel<T> {
536 WithMinOptLevel(1, x)
539 // The main optimizations that we do on MIR.
544 &reveal_all::RevealAll, // has to be done before inlining, since inlined code is in RevealAll mode.
545 &lower_slice_len::LowerSliceLenCalls, // has to be done before inlining, otherwise actual call will be almost always inlined. Also simple, so can just do first
546 &normalize_array_len::NormalizeArrayLen, // has to run after `slice::len` lowering
547 &unreachable_prop::UnreachablePropagation,
548 &uninhabited_enum_branching::UninhabitedEnumBranching,
549 &o1(simplify::SimplifyCfg::new("after-uninhabited-enum-branching")),
551 &remove_storage_markers::RemoveStorageMarkers,
552 &remove_zsts::RemoveZsts,
553 &const_goto::ConstGoto,
554 &remove_unneeded_drops::RemoveUnneededDrops,
555 &sroa::ScalarReplacementOfAggregates,
556 &match_branches::MatchBranchSimplification,
557 // inst combine is after MatchBranchSimplification to clean up Ne(_1, false)
558 &multiple_return_terminators::MultipleReturnTerminators,
559 &instcombine::InstCombine,
560 &separate_const_switch::SeparateConstSwitch,
561 &simplify::SimplifyLocals::new("before-const-prop"),
563 // FIXME(#70073): This pass is responsible for both optimization as well as some lints.
564 &const_prop::ConstProp,
565 &dataflow_const_prop::DataflowConstProp,
567 // Const-prop runs unconditionally, but doesn't mutate the MIR at mir-opt-level=0.
568 &const_debuginfo::ConstDebugInfo,
569 &o1(simplify_branches::SimplifyConstCondition::new("after-const-prop")),
570 &early_otherwise_branch::EarlyOtherwiseBranch,
571 &simplify_comparison_integral::SimplifyComparisonIntegral,
572 &simplify_try::SimplifyArmIdentity,
573 &simplify_try::SimplifyBranchSame,
574 &dead_store_elimination::DeadStoreElimination,
575 &dest_prop::DestinationPropagation,
576 &o1(simplify_branches::SimplifyConstCondition::new("final")),
577 &o1(remove_noop_landing_pads::RemoveNoopLandingPads),
578 &o1(simplify::SimplifyCfg::new("final")),
579 &nrvo::RenameReturnPlace,
580 &simplify::SimplifyLocals::new("final"),
581 &multiple_return_terminators::MultipleReturnTerminators,
582 &deduplicate_blocks::DeduplicateBlocks,
583 // Some cleanup necessary at least for LLVM and potentially other codegen backends.
584 &add_call_guards::CriticalCallEdges,
585 // Dump the end result for testing and debugging purposes.
586 &dump_mir::Marker("PreCodegen"),
588 Some(MirPhase::Runtime(RuntimePhase::Optimized)),
592 /// Optimize the MIR and prepare it for codegen.
593 fn optimized_mir(tcx: TyCtxt<'_>, did: DefId) -> &Body<'_> {
594 let did = did.expect_local();
595 assert_eq!(ty::WithOptConstParam::try_lookup(did, tcx), None);
596 tcx.arena.alloc(inner_optimized_mir(tcx, did))
599 fn inner_optimized_mir(tcx: TyCtxt<'_>, did: LocalDefId) -> Body<'_> {
600 if tcx.is_constructor(did.to_def_id()) {
601 // There's no reason to run all of the MIR passes on constructors when
602 // we can just output the MIR we want directly. This also saves const
603 // qualification and borrow checking the trouble of special casing
605 return shim::build_adt_ctor(tcx, did.to_def_id());
608 match tcx.hir().body_const_context(did) {
609 // Run the `mir_for_ctfe` query, which depends on `mir_drops_elaborated_and_const_checked`
610 // which we are going to steal below. Thus we need to run `mir_for_ctfe` first, so it
611 // computes and caches its result.
612 Some(hir::ConstContext::ConstFn) => tcx.ensure().mir_for_ctfe(did),
614 Some(other) => panic!("do not use `optimized_mir` for constants: {:?}", other),
616 debug!("about to call mir_drops_elaborated...");
618 tcx.mir_drops_elaborated_and_const_checked(ty::WithOptConstParam::unknown(did)).steal();
619 let mut body = remap_mir_for_const_eval_select(tcx, body, hir::Constness::NotConst);
620 debug!("body: {:#?}", body);
621 run_optimization_passes(tcx, &mut body);
623 debug_assert!(!body.has_free_regions(), "Free regions in optimized MIR");
628 /// Fetch all the promoteds of an item and prepare their MIR bodies to be ready for
629 /// constant evaluation once all substitutions become known.
632 def: ty::WithOptConstParam<LocalDefId>,
633 ) -> &IndexVec<Promoted, Body<'_>> {
634 if tcx.is_constructor(def.did.to_def_id()) {
635 return tcx.arena.alloc(IndexVec::new());
638 let tainted_by_errors = tcx.mir_borrowck_opt_const_arg(def).tainted_by_errors;
639 let mut promoted = tcx.mir_promoted(def).1.steal();
641 for body in &mut promoted {
642 if let Some(error_reported) = tainted_by_errors {
643 body.tainted_by_errors = Some(error_reported);
645 run_analysis_to_runtime_passes(tcx, body);
648 debug_assert!(!promoted.has_free_regions(), "Free regions in promoted MIR");
650 tcx.arena.alloc(promoted)