struct Candidates {
c: FxIndexMap<Local, Vec<Local>>,
reverse: FxIndexMap<Local, Vec<Local>>,
}
Fields§
§c: FxIndexMap<Local, Vec<Local>>
The set of candidates we are considering in this optimization.
We will always merge the key into at most one of its values.
Whether a place ends up in the key or the value does not correspond to whether it appears as the lhs or rhs of any assignment. As a matter of fact, the places in here might never appear in an assignment at all. This happens because if we see an assignment like this:
_1.0 = _2.0
We will still report that we would like to merge _1
and _2
in an attempt to allow us to
remove that assignment.
reverse: FxIndexMap<Local, Vec<Local>>
A reverse index of the c
set; if the c
set contains a => Place { local: b, proj }
,
then this contains b => a
.
Implementations§
source§impl Candidates
impl Candidates
sourcefn reset_and_find<'tcx>(&mut self, body: &Body<'tcx>, borrowed: &BitSet<Local>)
fn reset_and_find<'tcx>(&mut self, body: &Body<'tcx>, borrowed: &BitSet<Local>)
Collects the candidates for merging.
This is responsible for enforcing the first and third bullet point.
sourcefn vec_filter_candidates(
src: Local,
v: &mut Vec<Local>,
f: impl FnMut(Local) -> CandidateFilter,
at: Location,
)
fn vec_filter_candidates( src: Local, v: &mut Vec<Local>, f: impl FnMut(Local) -> CandidateFilter, at: Location, )
Just Vec::retain
, but the condition is inverted and we add debugging output
sourcefn entry_filter_candidates(
entry: IndexOccupiedEntry<'_, Local, Vec<Local>>,
p: Local,
f: impl FnMut(Local) -> CandidateFilter,
at: Location,
)
fn entry_filter_candidates( entry: IndexOccupiedEntry<'_, Local, Vec<Local>>, p: Local, f: impl FnMut(Local) -> CandidateFilter, at: Location, )
vec_filter_candidates
but for an Entry
sourcefn filter_candidates_by(
&mut self,
p: Local,
f: impl FnMut(Local) -> CandidateFilter,
at: Location,
)
fn filter_candidates_by( &mut self, p: Local, f: impl FnMut(Local) -> CandidateFilter, at: Location, )
For all candidates (p, q)
or (q, p)
removes the candidate if f(q)
says to do so
Trait Implementations§
source§impl Debug for Candidates
impl Debug for Candidates
source§impl Default for Candidates
impl Default for Candidates
source§fn default() -> Candidates
fn default() -> Candidates
Auto Trait Implementations§
impl Freeze for Candidates
impl RefUnwindSafe for Candidates
impl Send for Candidates
impl Sync for Candidates
impl Unpin for Candidates
impl UnwindSafe for Candidates
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<T> Filterable for T
impl<T> Filterable for T
source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
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_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
impl<T> MaybeSendSync for 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: 112 bytes