Struct rustc_middle::mir::predecessors::PredecessorCache

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

Fields

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

Implementations

impl PredecessorCache

pub(in mir) fn new(
) -> Self

pub(in mir) fn invalidate(
    &mut self
)

Invalidates the predecessor cache.

pub(in mir) 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

pub fn clone(&self) -> PredecessorCache

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for PredecessorCache

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

Formats the value using the given formatter.

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

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

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

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

impl<CTX> HashStable<CTX> for PredecessorCache

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

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

type Lifted = Self

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

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

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

pub fn super_visit_with<F: TypeVisitor<'tcx>>(
    &self,
    _: &mut F
) -> ControlFlow<F::BreakTy>

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

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

pub 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.

pub 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).

pub fn has_escaping_bound_vars(&self) -> bool

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

pub fn has_projections(&self) -> bool

pub fn has_opaque_types(&self) -> bool

pub fn references_error(&self) -> bool

pub fn has_param_types_or_consts(&self) -> bool

pub fn has_infer_regions(&self) -> bool

pub fn has_infer_types(&self) -> bool

pub fn has_infer_types_or_consts(&self) -> bool

pub fn needs_infer(&self) -> bool

pub fn has_placeholders(&self) -> bool

pub fn needs_subst(&self) -> bool

pub fn has_free_regions(&self) -> bool

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

pub fn has_erased_regions(&self) -> bool

pub fn has_erasable_regions(&self) -> bool

True if there are any un-erased free regions.

pub fn is_global(&self) -> 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.

pub fn has_late_bound_regions(&self) -> bool

True if there are any late-bound regions

pub 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.