Struct rustc_middle::mir::Body

pub struct Body<'tcx> {

    basic_blocks: IndexVec<BasicBlock, BasicBlockData<'tcx>>,
    pub phase: MirPhase,
    pub source: MirSource<'tcx>,
    pub source_scopes: IndexVec<SourceScope, SourceScopeData<'tcx>>,
    pub generator: Option<Box<GeneratorInfo<'tcx>>>,
    pub local_decls: LocalDecls<'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: Vec<Constant<'tcx>>,
    pub is_polymorphic: bool,
    predecessor_cache: PredecessorCache,
    is_cyclic: GraphIsCyclicCache,
}

The lowered representation of a single function.

Fields

basic_blocks: IndexVec<BasicBlock, BasicBlockData<'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.

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.

generator: Option<Box<GeneratorInfo<'tcx>>>

local_decls: LocalDecls<'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: Vec<Constant<'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.

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.

predecessor_cache: PredecessorCache

is_cyclic: GraphIsCyclicCache

Implementations

impl<'tcx> Body<'tcx>

pub fn new(
    tcx: TyCtxt<'tcx>,
    source: MirSource<'tcx>,
    basic_blocks: IndexVec<BasicBlock, BasicBlockData<'tcx>>,
    source_scopes: IndexVec<SourceScope, SourceScopeData<'tcx>>,
    local_decls: LocalDecls<'tcx>,
    user_type_annotations: CanonicalUserTypeAnnotations<'tcx>,
    arg_count: usize,
    var_debug_info: Vec<VarDebugInfo<'tcx>>,
    span: Span,
    generator_kind: Option<GeneratorKind>
) -> 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 LocalDecls (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(&self) -> &IndexVec<BasicBlock, BasicBlockData<'tcx>>

pub fn basic_blocks_mut(
    &mut self
) -> &mut IndexVec<BasicBlock, BasicBlockData<'tcx>>

pub fn basic_blocks_and_local_decls_mut(
    &mut self
) -> (&mut IndexVec<BasicBlock, BasicBlockData<'tcx>>, &mut LocalDecls<'tcx>)

pub fn basic_blocks_local_decls_mut_and_var_debug_info(
    &mut self
) -> (&mut IndexVec<BasicBlock, BasicBlockData<'tcx>>, &mut LocalDecls<'tcx>, &mut Vec<VarDebugInfo<'tcx>>)

pub fn is_cfg_cyclic(&self) -> bool

Returns true if a cycle exists in the control-flow graph that is reachable from the START_BLOCK.

pub fn local_kind(&self, local: Local) -> LocalKind

pub fn mut_vars_iter<'a>(&'a self) -> impl Iterator<Item = Local> + 'a

Returns an iterator over all user-declared mutable locals.

pub fn mut_vars_and_args_iter<'a>(&'a self) -> impl Iterator<Item = Local> + 'a

Returns an iterator over all user-declared mutable arguments and locals.

pub fn args_iter(&self) -> impl Iterator<Item = Local> + ExactSizeIterator

Returns an iterator over all function arguments.

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

pub fn make_statement_nop(&mut self, location: Location)

Changes a statement to a nop. This is both faster than deleting instructions and avoids invalidating statement indices in Locations.

pub fn source_info(&self, location: Location) -> &SourceInfo

Returns the source info associated with location.

pub fn return_ty(&self) -> Ty<'tcx>

Returns the return type; it always return first element from local_decls array.

pub fn terminator_loc(&self, bb: BasicBlock) -> Location

Gets the location of the terminator for the given block.

pub fn predecessors(&self) -> &IndexVec<BasicBlock, SmallVec<[BasicBlock; 4]>>

pub fn dominators(&self) -> Dominators<BasicBlock>

pub fn yield_ty(&self) -> Option<Ty<'tcx>>

pub fn generator_layout(&self) -> Option<&GeneratorLayout<'tcx>>

pub fn generator_drop(&self) -> Option<&Body<'tcx>>

pub fn generator_kind(&self) -> Option<GeneratorKind>

Trait Implementations

impl<'tcx> ArenaAllocatable<'tcx, Body<'tcx>> for Body<'tcx>

fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self

fn allocate_from_iter<'a>(
    arena: &'a Arena<'tcx>,
    iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self]

impl<'tcx> Clone for Body<'tcx>

fn clone(&self) -> Body<'tcx>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'tcx> Debug for Body<'tcx>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'tcx, D: TyDecoder<'tcx>> Decodable<D> for &'tcx Body<'tcx>

fn decode(decoder: &mut D) -> Result<Self, D::Error>

impl<'tcx, __D: TyDecoder<'tcx>> Decodable<__D> for Body<'tcx>

fn decode(__decoder: &mut __D) -> Result<Self, <__D as Decoder>::Error>

impl<'tcx> DirectedGraph for Body<'tcx>

type Node = BasicBlock

impl<'tcx, E: TyEncoder<'tcx>> Encodable<E> for &'tcx Body<'tcx>

fn encode(&self, e: &mut E) -> Result<(), E::Error>

impl<'tcx, __E: TyEncoder<'tcx>> Encodable<__E> for Body<'tcx>

fn encode(&self, __encoder: &mut __E) -> Result<(), <__E as Encoder>::Error>

impl<'graph, 'tcx> GraphPredecessors<'graph> for Body<'tcx>

type Item = BasicBlock

type Iter = Copied<Iter<'graph, BasicBlock>>

impl<'a, 'b> GraphSuccessors<'b> for Body<'a>

type Item = BasicBlock

type Iter = Cloned<Successors<'b>>

impl<'tcx> HasLocalDecls<'tcx> for Body<'tcx>

fn local_decls(&self) -> &LocalDecls<'tcx>

impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for Body<'tcx>

fn hash_stable(
    &self,
    __hcx: &mut StableHashingContext<'__ctx>,
    __hasher: &mut StableHasher
)

impl<'tcx> Index<BasicBlock> for Body<'tcx>

type Output = BasicBlockData<'tcx>

The returned type after indexing.

fn index(&self, index: BasicBlock) -> &BasicBlockData<'tcx>

Performs the indexing (container[index]) operation.

impl<'tcx> IndexMut<BasicBlock> for Body<'tcx>

fn index_mut(&mut self, index: BasicBlock) -> &mut BasicBlockData<'tcx>

Performs the mutable indexing (container[index]) operation.

impl<'tcx, D: TyDecoder<'tcx>> RefDecodable<'tcx, D> for Body<'tcx>

fn decode(decoder: &mut D) -> Result<&'tcx Self, D::Error>

impl<'tcx> TypeFoldable<'tcx> for Body<'tcx>

fn super_fold_with<__F: TypeFolder<'tcx>>(self, __folder: &mut __F) -> Self

fn super_visit_with<__F: TypeVisitor<'tcx>>(
    &self,
    __folder: &mut __F
) -> ControlFlow<__F::BreakTy>

fn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self

fn visit_with<V: TypeVisitor<'tcx>>(
    &self,
    visitor: &mut V
) -> ControlFlow<V::BreakTy>

fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool

Returns 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 has_vars_bound_above(&self, binder: DebruijnIndex) -> bool

Returns true if this self has any regions that escape binder (and hence are not bound by it).

fn has_escaping_bound_vars(&self) -> bool

fn definitely_has_type_flags(&self, tcx: TyCtxt<'tcx>, flags: TypeFlags) -> bool

fn has_type_flags(&self, flags: TypeFlags) -> bool

fn has_projections(&self) -> bool

fn has_opaque_types(&self) -> bool

fn references_error(&self) -> bool

fn potentially_has_param_types_or_consts(&self) -> bool

fn definitely_has_param_types_or_consts(&self, tcx: TyCtxt<'tcx>) -> bool

fn has_infer_regions(&self) -> bool

fn has_infer_types(&self) -> bool

fn has_infer_types_or_consts(&self) -> bool

fn needs_infer(&self) -> bool

fn has_placeholders(&self) -> bool

fn potentially_needs_subst(&self) -> bool

fn definitely_needs_subst(&self, tcx: TyCtxt<'tcx>) -> bool

fn has_free_regions(&self, tcx: TyCtxt<'tcx>) -> bool

“Free” regions in this context means that it has any region that is not (a) erased or (b) late-bound.

fn has_erased_regions(&self) -> bool

fn has_erasable_regions(&self, tcx: TyCtxt<'tcx>) -> bool

True if there are any un-erased free regions.

fn is_known_global(&self) -> bool

Indicates whether this value definitely references only ‘global’ generic parameters that are the same regardless of what fn we are in. This is used for caching.

fn is_global(&self, tcx: TyCtxt<'tcx>) -> bool

Indicates whether this value references only ‘global’ generic parameters that are the same regardless of what fn we are in. This is used for caching.

fn has_late_bound_regions(&self) -> bool

True if there are any late-bound regions

fn still_further_specializable(&self) -> bool

Indicates whether this value still has parameters/placeholders/inference variables which could be replaced later, in a way that would change the results of impl specialization.

impl<'tcx> WithNumNodes for Body<'tcx>

fn num_nodes(&self) -> usize

impl<'tcx> WithPredecessors for Body<'tcx>

fn predecessors(&self, node: Self::Node) -> Copied<Iter<'_, BasicBlock>>

impl<'tcx> WithStartNode for Body<'tcx>

fn start_node(&self) -> Self::Node

impl<'tcx> WithSuccessors for Body<'tcx>

fn successors(
    &self,
    node: Self::Node
) -> Cloned<Chain<IntoIter<&BasicBlock>, Iter<'_, BasicBlock>>>

fn depth_first_search(&self, from: Self::Node) -> DepthFirstSearch<'_, Self> where
    Self: WithNumNodes, 

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: 232 bytes