Struct rustc_middle::mir::predecessors::PredecessorCache

pub(super) struct PredecessorCache {
    cache: OnceCell<IndexVec<BasicBlock, SmallVec<[BasicBlock; 4]>>>,
}

Fields

cache: OnceCell<IndexVec<BasicBlock, SmallVec<[BasicBlock; 4]>>>

Implementations

impl PredecessorCache

pub(super) fn new() -> Self

pub(super) fn invalidate(&mut self)

Invalidates the predecessor cache.

pub(super) fn compute(
    &self,
    basic_blocks: &IndexVec<BasicBlock, BasicBlockData<'_>>
) -> &IndexVec<BasicBlock, SmallVec<[BasicBlock; 4]>>

Returns the predecessor graph for this MIR.

Trait Implementations

impl Clone for PredecessorCache

fn clone(&self) -> PredecessorCache

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for PredecessorCache

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

Formats the value using the given formatter.

impl<D: Decoder> Decodable<D> for PredecessorCache

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

impl<S: Encoder> Encodable<S> for PredecessorCache

fn encode(&self, s: &mut S) -> Result<(), S::Error>

impl<CTX> HashStable<CTX> for PredecessorCache

fn hash_stable(&self, _: &mut CTX, _: &mut StableHasher)

impl<'tcx> Lift<'tcx> for PredecessorCache

type Lifted = Self

fn lift_to_tcx(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'tcx> TypeFoldable<'tcx> for PredecessorCache

fn super_fold_with<F: TypeFolder<'tcx>>(self, _: &mut F) -> PredecessorCache

fn super_visit_with<F: TypeVisitor<'tcx>>(
    &self,
    _: &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.

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