Struct rustc_middle::mir::basic_blocks::BasicBlocks
source · pub struct BasicBlocks<'tcx> {
basic_blocks: IndexVec<BasicBlock, BasicBlockData<'tcx>>,
predecessor_cache: PredecessorCache,
switch_source_cache: SwitchSourceCache,
is_cyclic: GraphIsCyclicCache,
postorder_cache: PostorderCache,
}
Fields
basic_blocks: IndexVec<BasicBlock, BasicBlockData<'tcx>>
predecessor_cache: PredecessorCache
switch_source_cache: SwitchSourceCache
is_cyclic: GraphIsCyclicCache
postorder_cache: PostorderCache
Implementations
sourceimpl<'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 postorder(&self) -> &[BasicBlock]
pub fn postorder(&self) -> &[BasicBlock]
Returns basic blocks in a postorder.
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
sourceimpl<'tcx> Clone for BasicBlocks<'tcx>
impl<'tcx> Clone for BasicBlocks<'tcx>
sourcefn clone(&self) -> BasicBlocks<'tcx>
fn clone(&self) -> BasicBlocks<'tcx>
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresourceimpl<'tcx> Debug for BasicBlocks<'tcx>
impl<'tcx> Debug for BasicBlocks<'tcx>
sourceimpl<'tcx, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for BasicBlocks<'tcx>
impl<'tcx, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for BasicBlocks<'tcx>
sourceimpl<'tcx> Deref for BasicBlocks<'tcx>
impl<'tcx> Deref for BasicBlocks<'tcx>
type Target = IndexVec<BasicBlock, BasicBlockData<'tcx>>
type Target = IndexVec<BasicBlock, BasicBlockData<'tcx>>
sourcefn deref(&self) -> &IndexVec<BasicBlock, BasicBlockData<'tcx>>
fn deref(&self) -> &IndexVec<BasicBlock, BasicBlockData<'tcx>>
sourceimpl<'tcx> DirectedGraph for BasicBlocks<'tcx>
impl<'tcx> DirectedGraph for BasicBlocks<'tcx>
type Node = BasicBlock
sourceimpl<'tcx, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for BasicBlocks<'tcx>
impl<'tcx, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for BasicBlocks<'tcx>
sourceimpl<'tcx, 'graph> GraphPredecessors<'graph> for BasicBlocks<'tcx>
impl<'tcx, 'graph> GraphPredecessors<'graph> for BasicBlocks<'tcx>
type Item = BasicBlock
type Iter = Copied<Iter<'graph, BasicBlock>>
sourceimpl<'a, 'b> GraphSuccessors<'b> for BasicBlocks<'a>
impl<'a, 'b> GraphSuccessors<'b> for BasicBlocks<'a>
type Item = BasicBlock
type Iter = impl Iterator<Item = BasicBlock> + 'b
sourceimpl<'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
)
sourceimpl<'tcx> TypeFoldable<'tcx> for BasicBlocks<'tcx>
impl<'tcx> TypeFoldable<'tcx> for BasicBlocks<'tcx>
sourcefn try_fold_with<__F: FallibleTypeFolder<'tcx>>(
self,
__folder: &mut __F
) -> Result<Self, __F::Error>
fn try_fold_with<__F: FallibleTypeFolder<'tcx>>(
self,
__folder: &mut __F
) -> Result<Self, __F::Error>
sourcefn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
fn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
. Read moresourceimpl<'tcx> TypeVisitable<'tcx> for BasicBlocks<'tcx>
impl<'tcx> TypeVisitable<'tcx> for BasicBlocks<'tcx>
sourcefn visit_with<__V: TypeVisitor<'tcx>>(
&self,
__visitor: &mut __V
) -> ControlFlow<__V::BreakTy>
fn visit_with<__V: TypeVisitor<'tcx>>(
&self,
__visitor: &mut __V
) -> ControlFlow<__V::BreakTy>
sourcefn 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. Read moresourcefn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
true
if this self
has any regions that escape binder
(and
hence are not bound by it). Read morefn has_escaping_bound_vars(&self) -> 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 error_reported(&self) -> Option<ErrorGuaranteed>
fn has_param_types_or_consts(&self) -> 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 needs_subst(&self) -> bool
sourcefn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
fn has_erased_regions(&self) -> bool
sourcefn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
sourcefn is_global(&self) -> bool
fn is_global(&self) -> bool
sourcefn has_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
sourcefn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization. Read moresourceimpl<'tcx> WithNumNodes for BasicBlocks<'tcx>
impl<'tcx> WithNumNodes for BasicBlocks<'tcx>
sourceimpl<'tcx> WithPredecessors for BasicBlocks<'tcx>
impl<'tcx> WithPredecessors for BasicBlocks<'tcx>
fn predecessors(&self, node: Self::Node) -> Copied<Iter<'_, BasicBlock>>
sourceimpl<'tcx> WithStartNode for BasicBlocks<'tcx>
impl<'tcx> WithStartNode for BasicBlocks<'tcx>
fn start_node(&self) -> Self::Node
sourceimpl<'tcx> WithSuccessors for BasicBlocks<'tcx>
impl<'tcx> WithSuccessors for BasicBlocks<'tcx>
fn successors(&self, node: Self::Node) -> impl Iterator<Item = BasicBlock>
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
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
sourceimpl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
sourcedefault fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_debug_str(&self, Ctxt) -> String
sourcedefault fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
default fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> 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. Read moresourceimpl<T, R> InternIteratorElement<T, R> for T
impl<T, R> InternIteratorElement<T, R> for T
type Output = R
fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
sourceimpl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
impl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
default fn from_cycle_error(tcx: CTX) -> T
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
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: 112 bytes