pub struct Body<'tcx> {Show 19 fields
pub basic_blocks: BasicBlocks<'tcx>,
pub phase: MirPhase,
pub pass_count: usize,
pub source: MirSource<'tcx>,
pub source_scopes: IndexVec<SourceScope, SourceScopeData<'tcx>>,
pub coroutine: Option<Box<CoroutineInfo<'tcx>>>,
pub local_decls: IndexVec<Local, LocalDecl<'tcx>>,
pub user_type_annotations: CanonicalUserTypeAnnotations<'tcx>,
pub arg_count: usize,
pub spread_arg: Option<Local>,
pub var_debug_info: Vec<VarDebugInfo<'tcx>>,
pub span: Span,
pub required_consts: Option<Vec<ConstOperand<'tcx>>>,
pub mentioned_items: Option<Vec<Spanned<MentionedItem<'tcx>>>>,
pub is_polymorphic: bool,
pub injection_phase: Option<MirPhase>,
pub tainted_by_errors: Option<ErrorGuaranteed>,
pub coverage_info_hi: Option<Box<CoverageInfoHi>>,
pub function_coverage_info: Option<Box<FunctionCoverageInfo>>,
}
Expand description
The lowered representation of a single function.
Fields§
§basic_blocks: BasicBlocks<'tcx>
A list of basic blocks. References to basic block use a newtyped index type BasicBlock
that indexes into this vector.
phase: MirPhase
Records how far through the “desugaring and optimization” process this particular MIR has traversed. This is particularly useful when inlining, since in that context we instantiate the promoted constants and add them to our promoted vector – but those promoted items have already been optimized, whereas ours have not. This field allows us to see the difference and forego optimization on the inlined promoted items.
pass_count: usize
How many passses we have executed since starting the current phase. Used for debug output.
source: MirSource<'tcx>
§source_scopes: IndexVec<SourceScope, SourceScopeData<'tcx>>
A list of source scopes; these are referenced by statements
and used for debuginfo. Indexed by a SourceScope
.
coroutine: Option<Box<CoroutineInfo<'tcx>>>
Additional information carried by a MIR body when it is lowered from a coroutine.
Note that the coroutine drop shim, any promoted consts, and other synthetic MIR
bodies that come from processing a coroutine body are not typically coroutines
themselves, and should probably set this to None
to avoid carrying redundant
information.
local_decls: IndexVec<Local, LocalDecl<'tcx>>
Declarations of locals.
The first local is the return value pointer, followed by arg_count
locals for the function arguments, followed by any user-declared
variables and temporaries.
user_type_annotations: CanonicalUserTypeAnnotations<'tcx>
User type annotations.
arg_count: usize
The number of arguments this function takes.
Starting at local 1, arg_count
locals will be provided by the caller
and can be assumed to be initialized.
If this MIR was built for a constant, this will be 0.
spread_arg: Option<Local>
Mark an argument local (which must be a tuple) as getting passed as its individual components at the LLVM level.
This is used for the “rust-call” ABI.
var_debug_info: Vec<VarDebugInfo<'tcx>>
Debug information pertaining to user variables, including captures.
span: Span
A span representing this MIR, for error reporting.
required_consts: Option<Vec<ConstOperand<'tcx>>>
Constants that are required to evaluate successfully for this MIR to be well-formed.
We hold in this field all the constants we are not able to evaluate yet.
None
indicates that the list has not been computed yet.
This is soundness-critical, we make a guarantee that all consts syntactically mentioned in a function have successfully evaluated if the function ever gets executed at runtime.
mentioned_items: Option<Vec<Spanned<MentionedItem<'tcx>>>>
Further items that were mentioned in this function and hence may become monomorphized,
depending on optimizations. We use this to avoid optimization-dependent compile errors: the
collector recursively traverses all “mentioned” items and evaluates all their
required_consts
.
None
indicates that the list has not been computed yet.
This is not soundness-critical and the contents of this list are not a stable guarantee.
All that’s relevant is that this set is optimization-level-independent, and that it includes
everything that the collector would consider “used”. (For example, we currently compute this
set after drop elaboration, so some drop calls that can never be reached are not considered
“mentioned”.) See the documentation of CollectionMode
in
compiler/rustc_monomorphize/src/collector.rs
for more context.
is_polymorphic: bool
Does this body use generic parameters. This is used for the ConstEvaluatable
check.
Note that this does not actually mean that this body is not computable right now.
The repeat count in the following example is polymorphic, but can still be evaluated
without knowing anything about the type parameter T
.
fn test<T>() {
let _ = [0; std::mem::size_of::<*mut T>()];
}
WARNING: Do not change this flags after the MIR was originally created, even if an optimization
removed the last mention of all generic params. We do not want to rely on optimizations and
potentially allow things like [u8; std::mem::size_of::<T>() * 0]
due to this.
injection_phase: Option<MirPhase>
The phase at which this MIR should be “injected” into the compilation process.
Everything that comes before this MirPhase
should be skipped.
This is only Some
if the function that this body comes from was annotated with rustc_custom_mir
.
tainted_by_errors: Option<ErrorGuaranteed>
§coverage_info_hi: Option<Box<CoverageInfoHi>>
Coverage information collected from THIR/MIR during MIR building,
to be used by the InstrumentCoverage
pass.
Only present if coverage is enabled and this function is eligible. Boxed to limit space overhead in non-coverage builds.
function_coverage_info: Option<Box<FunctionCoverageInfo>>
Per-function coverage information added by the InstrumentCoverage
pass, to be used in conjunction with the coverage statements injected
into this body’s blocks.
If -Cinstrument-coverage
is not active, or if an individual function
is not eligible for coverage, then this should always be None
.
Implementations§
Source§impl<'tcx> Body<'tcx>
impl<'tcx> Body<'tcx>
pub fn new( source: MirSource<'tcx>, basic_blocks: IndexVec<BasicBlock, BasicBlockData<'tcx>>, source_scopes: IndexVec<SourceScope, SourceScopeData<'tcx>>, local_decls: IndexVec<Local, LocalDecl<'tcx>>, user_type_annotations: CanonicalUserTypeAnnotations<'tcx>, arg_count: usize, var_debug_info: Vec<VarDebugInfo<'tcx>>, span: Span, coroutine: Option<Box<CoroutineInfo<'tcx>>>, tainted_by_errors: Option<ErrorGuaranteed>, ) -> Self
Sourcepub fn new_cfg_only(
basic_blocks: IndexVec<BasicBlock, BasicBlockData<'tcx>>,
) -> Self
pub fn new_cfg_only( basic_blocks: IndexVec<BasicBlock, BasicBlockData<'tcx>>, ) -> Self
Returns a partially initialized MIR body containing only a list of basic blocks.
The returned MIR contains no LocalDecl
s (even for the return place) or source scopes. It
is only useful for testing but cannot be #[cfg(test)]
because it is used in a different
crate.
pub fn basic_blocks_mut( &mut self, ) -> &mut IndexVec<BasicBlock, BasicBlockData<'tcx>>
pub fn typing_mode(&self, _tcx: TyCtxt<'tcx>) -> TypingMode<'tcx>
pub fn local_kind(&self, local: Local) -> LocalKind
Sourcepub fn mut_vars_iter<'a>(
&'a self,
) -> impl Iterator<Item = Local> + Captures<'tcx> + 'a
pub fn mut_vars_iter<'a>( &'a self, ) -> impl Iterator<Item = Local> + Captures<'tcx> + 'a
Returns an iterator over all user-declared mutable locals.
Sourcepub fn mut_vars_and_args_iter<'a>(
&'a self,
) -> impl Iterator<Item = Local> + Captures<'tcx> + 'a
pub fn mut_vars_and_args_iter<'a>( &'a self, ) -> impl Iterator<Item = Local> + Captures<'tcx> + 'a
Returns an iterator over all user-declared mutable arguments and locals.
Sourcepub fn args_iter(&self) -> impl Iterator<Item = Local> + ExactSizeIterator
pub fn args_iter(&self) -> impl Iterator<Item = Local> + ExactSizeIterator
Returns an iterator over all function arguments.
Sourcepub fn vars_and_temps_iter(
&self,
) -> impl DoubleEndedIterator<Item = Local> + ExactSizeIterator
pub fn vars_and_temps_iter( &self, ) -> impl DoubleEndedIterator<Item = Local> + ExactSizeIterator
Returns an iterator over all user-defined variables and compiler-generated temporaries (all locals that are neither arguments nor the return place).
pub fn drain_vars_and_temps<'a>( &'a mut self, ) -> impl Iterator<Item = LocalDecl<'tcx>> + 'a
Sourcepub fn source_info(&self, location: Location) -> &SourceInfo
pub fn source_info(&self, location: Location) -> &SourceInfo
Returns the source info associated with location
.
pub fn span_for_ty_context(&self, ty_context: TyContext) -> Span
Sourcepub fn return_ty(&self) -> Ty<'tcx>
pub fn return_ty(&self) -> Ty<'tcx>
Returns the return type; it always return first element from local_decls
array.
Sourcepub fn bound_return_ty(&self) -> EarlyBinder<'tcx, Ty<'tcx>>
pub fn bound_return_ty(&self) -> EarlyBinder<'tcx, Ty<'tcx>>
Returns the return type; it always return first element from local_decls
array.
Sourcepub fn terminator_loc(&self, bb: BasicBlock) -> Location
pub fn terminator_loc(&self, bb: BasicBlock) -> Location
Gets the location of the terminator for the given block.
pub fn stmt_at( &self, location: Location, ) -> Either<&Statement<'tcx>, &Terminator<'tcx>>
pub fn yield_ty(&self) -> Option<Ty<'tcx>>
pub fn resume_ty(&self) -> Option<Ty<'tcx>>
Sourcepub fn coroutine_layout_raw(&self) -> Option<&CoroutineLayout<'tcx>>
pub fn coroutine_layout_raw(&self) -> Option<&CoroutineLayout<'tcx>>
Prefer going through TyCtxt::coroutine_layout
rather than using this directly.
pub fn coroutine_drop(&self) -> Option<&Body<'tcx>>
pub fn coroutine_kind(&self) -> Option<CoroutineKind>
pub fn should_skip(&self) -> bool
pub fn is_custom_mir(&self) -> bool
Sourcefn try_const_mono_switchint<'a>(
tcx: TyCtxt<'tcx>,
instance: Instance<'tcx>,
block: &'a BasicBlockData<'tcx>,
) -> Option<(u128, &'a SwitchTargets)>
fn try_const_mono_switchint<'a>( tcx: TyCtxt<'tcx>, instance: Instance<'tcx>, block: &'a BasicBlockData<'tcx>, ) -> Option<(u128, &'a SwitchTargets)>
If this basic block ends with a TerminatorKind::SwitchInt
for which we can evaluate the
dimscriminant in monomorphization, we return the discriminant bits and the
SwitchTargets
, just so the caller doesn’t also have to match on the terminator.
Sourcepub fn caller_location_span<T>(
&self,
source_info: SourceInfo,
caller_location: Option<T>,
tcx: TyCtxt<'tcx>,
from_span: impl FnOnce(Span) -> T,
) -> T
pub fn caller_location_span<T>( &self, source_info: SourceInfo, caller_location: Option<T>, tcx: TyCtxt<'tcx>, from_span: impl FnOnce(Span) -> T, ) -> T
For a Location
in this scope, determine what the “caller location” at that point is. This
is interesting because of inlining: the #[track_caller]
attribute of inlined functions
must be honored. Falls back to the tracked_caller
value for #[track_caller]
functions,
or the function’s scope.
pub fn set_required_consts(&mut self, required_consts: Vec<ConstOperand<'tcx>>)
pub fn required_consts(&self) -> &[ConstOperand<'tcx>]
pub fn set_mentioned_items( &mut self, mentioned_items: Vec<Spanned<MentionedItem<'tcx>>>, )
pub fn mentioned_items(&self) -> &[Spanned<MentionedItem<'tcx>>]
Trait Implementations§
Source§impl<'tcx> ArenaAllocatable<'tcx> for Body<'tcx>
impl<'tcx> ArenaAllocatable<'tcx> for Body<'tcx>
fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut Self
fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = Self>, ) -> &'tcx mut [Self]
Source§impl<'tcx> HasLocalDecls<'tcx> for Body<'tcx>
impl<'tcx> HasLocalDecls<'tcx> for Body<'tcx>
fn local_decls(&self) -> &LocalDecls<'tcx>
Source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for Body<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for Body<'tcx>
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher, )
Source§impl<'tcx> Index<BasicBlock> for Body<'tcx>
impl<'tcx> Index<BasicBlock> for Body<'tcx>
Source§type Output = BasicBlockData<'tcx>
type Output = BasicBlockData<'tcx>
Source§fn index(&self, index: BasicBlock) -> &BasicBlockData<'tcx>
fn index(&self, index: BasicBlock) -> &BasicBlockData<'tcx>
container[index]
) operation. Read moreSource§impl<'tcx> IndexMut<BasicBlock> for Body<'tcx>
impl<'tcx> IndexMut<BasicBlock> for Body<'tcx>
Source§fn index_mut(&mut self, index: BasicBlock) -> &mut BasicBlockData<'tcx>
fn index_mut(&mut self, index: BasicBlock) -> &mut BasicBlockData<'tcx>
container[index]
) operation. Read moreSource§impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Body<'tcx>
impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Body<'tcx>
Source§fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>(
self,
__folder: &mut __F,
) -> Result<Self, __F::Error>
fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>
Source§fn fold_with<F>(self, folder: &mut F) -> Selfwhere
F: TypeFolder<I>,
fn fold_with<F>(self, folder: &mut F) -> Selfwhere
F: TypeFolder<I>,
try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
.Source§impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Body<'tcx>
impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Body<'tcx>
Source§fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>(
&self,
__visitor: &mut __V,
) -> __V::Result
fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result
Auto Trait Implementations§
impl<'tcx> DynSend for Body<'tcx>
impl<'tcx> DynSync for Body<'tcx>
impl<'tcx> !Freeze for Body<'tcx>
impl<'tcx> !RefUnwindSafe for Body<'tcx>
impl<'tcx> Send for Body<'tcx>
impl<'tcx> Sync for Body<'tcx>
impl<'tcx> Unpin for Body<'tcx>
impl<'tcx> !UnwindSafe for Body<'tcx>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)Source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
Source§impl<Tcx, T> DepNodeParams<Tcx> for T
impl<Tcx, T> DepNodeParams<Tcx> for T
default fn fingerprint_style() -> FingerprintStyle
Source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_debug_str(&self, _: Tcx) -> String
Source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
DepNode
,
something which is needed when forcing DepNode
s during red-green
evaluation. The query system will only call this method if
fingerprint_style()
is not FingerprintStyle::Opaque
.
It is always valid to return None
here, in which case incremental
compilation will treat the query as having changed instead of forcing it.Source§impl<T> Filterable for T
impl<T> Filterable for T
Source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
Source§impl<'tcx, T> IsSuggestable<'tcx> for T
impl<'tcx, T> IsSuggestable<'tcx> for T
Source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
impl<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
fn has_type_flags(&self, flags: TypeFlags) -> bool
Source§fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
true
if self
has any late-bound regions that are either
bound by binder
or bound by some binder outside of binder
.
If binder
is ty::INNERMOST
, this indicates whether
there are any late-bound regions that appear free.fn error_reported(&self) -> Result<(), <I as Interner>::ErrorGuaranteed>
Source§fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
true
if this type has any regions that escape binder
(and
hence are not bound by it).Source§fn has_escaping_bound_vars(&self) -> bool
fn has_escaping_bound_vars(&self) -> bool
true
if this type has regions that are not a part of the type.
For example, for<'a> fn(&'a i32)
return false
, while fn(&'a i32)
would return true
. The latter can occur when traversing through the
former. Read morefn has_aliases(&self) -> bool
fn has_opaque_types(&self) -> bool
fn has_coroutines(&self) -> bool
fn references_error(&self) -> bool
fn has_non_region_param(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_non_region_infer(&self) -> bool
fn has_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn has_non_region_placeholders(&self) -> bool
fn has_param(&self) -> bool
Source§fn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
fn has_erased_regions(&self) -> bool
Source§fn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
Source§fn is_global(&self) -> bool
fn is_global(&self) -> bool
Source§fn has_bound_regions(&self) -> bool
fn has_bound_regions(&self) -> bool
Source§fn has_non_region_bound_vars(&self) -> bool
fn has_non_region_bound_vars(&self) -> bool
Source§fn has_bound_vars(&self) -> bool
fn has_bound_vars(&self) -> bool
Source§fn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization.Source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
Source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
Source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
Source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
Source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
Source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
impl<T> MaybeSendSync for T
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...)
attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 424 bytes