Struct rustc_middle::mir::basic_blocks::BasicBlocks
source · pub struct BasicBlocks<'tcx> {
basic_blocks: IndexVec<BasicBlock, BasicBlockData<'tcx>>,
cache: Cache,
}
Fields§
§basic_blocks: IndexVec<BasicBlock, BasicBlockData<'tcx>>
§cache: Cache
Implementations§
source§impl<'tcx> BasicBlocks<'tcx>
impl<'tcx> BasicBlocks<'tcx>
pub fn new(basic_blocks: IndexVec<BasicBlock, BasicBlockData<'tcx>>) -> Self
sourcepub fn is_cfg_cyclic(&self) -> bool
pub fn is_cfg_cyclic(&self) -> bool
Returns true if control-flow graph contains a cycle reachable from the START_BLOCK
.
pub fn dominators(&self) -> &Dominators<BasicBlock>
sourcepub fn predecessors(&self) -> &IndexVec<BasicBlock, SmallVec<[BasicBlock; 4]>>
pub fn predecessors(&self) -> &IndexVec<BasicBlock, SmallVec<[BasicBlock; 4]>>
Returns predecessors for each basic block.
sourcepub fn reverse_postorder(&self) -> &[BasicBlock]
pub fn reverse_postorder(&self) -> &[BasicBlock]
Returns basic blocks in a reverse postorder.
See traversal::reverse_postorder
’s docs to learn what is preorder traversal.
sourcepub fn switch_sources(
&self
) -> &FxHashMap<(BasicBlock, BasicBlock), SmallVec<[Option<u128>; 1]>>
pub fn switch_sources( &self ) -> &FxHashMap<(BasicBlock, BasicBlock), SmallVec<[Option<u128>; 1]>>
switch_sources()[&(target, switch)]
returns a list of switch
values that lead to a target
block from a switch
block.
sourcepub fn as_mut(&mut self) -> &mut IndexVec<BasicBlock, BasicBlockData<'tcx>>
pub fn as_mut(&mut self) -> &mut IndexVec<BasicBlock, BasicBlockData<'tcx>>
Returns mutable reference to basic blocks. Invalidates CFG cache.
sourcepub fn as_mut_preserves_cfg(
&mut self
) -> &mut IndexVec<BasicBlock, BasicBlockData<'tcx>>
pub fn as_mut_preserves_cfg( &mut self ) -> &mut IndexVec<BasicBlock, BasicBlockData<'tcx>>
Get mutable access to basic blocks without invalidating the CFG cache.
By calling this method instead of e.g. BasicBlocks::as_mut
you promise not to change
the CFG. This means that
- The number of basic blocks remains unchanged
- The set of successors of each terminator remains unchanged.
- For each
TerminatorKind::SwitchInt
, thetargets
remains the same and the terminator kind is not changed.
If any of these conditions cannot be upheld, you should call BasicBlocks::invalidate_cfg_cache
.
sourcepub fn invalidate_cfg_cache(&mut self)
pub fn invalidate_cfg_cache(&mut self)
Invalidates cached information about the CFG.
You will only ever need this if you have also called BasicBlocks::as_mut_preserves_cfg
.
All other methods that allow you to mutate the basic blocks also call this method
themselves, thereby avoiding any risk of accidentally cache invalidation.
Trait Implementations§
source§impl<'tcx> Clone for BasicBlocks<'tcx>
impl<'tcx> Clone for BasicBlocks<'tcx>
source§fn clone(&self) -> BasicBlocks<'tcx>
fn clone(&self) -> BasicBlocks<'tcx>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl<'tcx> Debug for BasicBlocks<'tcx>
impl<'tcx> Debug for BasicBlocks<'tcx>
source§impl<'tcx> Deref for BasicBlocks<'tcx>
impl<'tcx> Deref for BasicBlocks<'tcx>
§type Target = IndexSlice<BasicBlock, BasicBlockData<'tcx>>
type Target = IndexSlice<BasicBlock, BasicBlockData<'tcx>>
source§fn deref(&self) -> &IndexSlice<BasicBlock, BasicBlockData<'tcx>>
fn deref(&self) -> &IndexSlice<BasicBlock, BasicBlockData<'tcx>>
source§impl<'tcx> DirectedGraph for BasicBlocks<'tcx>
impl<'tcx> DirectedGraph for BasicBlocks<'tcx>
type Node = BasicBlock
source§impl<'tcx, 'graph> GraphPredecessors<'graph> for BasicBlocks<'tcx>
impl<'tcx, 'graph> GraphPredecessors<'graph> for BasicBlocks<'tcx>
type Item = BasicBlock
type Iter = Copied<Iter<'graph, BasicBlock>>
source§impl<'a, 'b> GraphSuccessors<'b> for BasicBlocks<'a>
impl<'a, 'b> GraphSuccessors<'b> for BasicBlocks<'a>
type Item = BasicBlock
type Iter = impl DoubleEndedIterator + 'b
source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for BasicBlocks<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for BasicBlocks<'tcx>
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )
source§impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for BasicBlocks<'tcx>
impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for BasicBlocks<'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 BasicBlocks<'tcx>
impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for BasicBlocks<'tcx>
source§fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>(
&self,
__visitor: &mut __V
) -> ControlFlow<__V::BreakTy>
fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V ) -> ControlFlow<__V::BreakTy>
source§impl<'tcx> WithNumNodes for BasicBlocks<'tcx>
impl<'tcx> WithNumNodes for BasicBlocks<'tcx>
source§impl<'tcx> WithPredecessors for BasicBlocks<'tcx>
impl<'tcx> WithPredecessors for BasicBlocks<'tcx>
fn predecessors( &self, node: Self::Node ) -> <Self as GraphPredecessors<'_>>::Iter
source§impl<'tcx> WithStartNode for BasicBlocks<'tcx>
impl<'tcx> WithStartNode for BasicBlocks<'tcx>
fn start_node(&self) -> Self::Node
source§impl<'tcx> WithSuccessors for BasicBlocks<'tcx>
impl<'tcx> WithSuccessors for BasicBlocks<'tcx>
fn successors(&self, node: Self::Node) -> <Self as GraphSuccessors<'_>>::Iter
fn depth_first_search(&self, from: Self::Node) -> DepthFirstSearch<'_, Self>where Self: WithNumNodes,
Auto Trait Implementations§
impl<'tcx> !RefUnwindSafe for BasicBlocks<'tcx>
impl<'tcx> !Send for BasicBlocks<'tcx>
impl<'tcx> !Sync for BasicBlocks<'tcx>
impl<'tcx> Unpin for BasicBlocks<'tcx>
impl<'tcx> !UnwindSafe for BasicBlocks<'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, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Tcx, T> DepNodeParams<Tcx> for Twhere Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
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<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<'tcx, T> IsSuggestable<'tcx> for Twhere
T: TypeVisitable<TyCtxt<'tcx>> + TypeFoldable<TyCtxt<'tcx>>,
impl<'tcx, T> IsSuggestable<'tcx> for Twhere T: TypeVisitable<TyCtxt<'tcx>> + TypeFoldable<TyCtxt<'tcx>>,
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T
source§impl<'tcx, T> TypeVisitableExt<'tcx> for Twhere
T: TypeVisitable<TyCtxt<'tcx>>,
impl<'tcx, T> TypeVisitableExt<'tcx> for Twhere T: TypeVisitable<TyCtxt<'tcx>>,
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.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_type_flags(&self, flags: TypeFlags) -> bool
fn has_projections(&self) -> bool
fn has_inherent_projections(&self) -> bool
fn has_opaque_types(&self) -> bool
fn has_generators(&self) -> bool
fn references_error(&self) -> bool
fn error_reported(&self) -> Result<(), ErrorGuaranteed>
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_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
source§fn has_non_region_late_bound(&self) -> bool
fn has_non_region_late_bound(&self) -> bool
source§fn has_late_bound_vars(&self) -> bool
fn has_late_bound_vars(&self) -> bool
source§fn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization.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: &[QueryInfo], _guar: ErrorGuaranteed ) -> 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: 192 bytes