pub struct CoverageIdsInfo {
pub counters_seen: BitSet<CounterId>,
pub zero_expressions: BitSet<ExpressionId>,
}
Expand description
Summarizes coverage IDs inserted by the InstrumentCoverage
MIR pass
(for compiler option -Cinstrument-coverage
), after MIR optimizations
have had a chance to potentially remove some of them.
Used by the coverage_ids_info
query.
Fields§
§counters_seen: BitSet<CounterId>
§zero_expressions: BitSet<ExpressionId>
Implementations§
Source§impl CoverageIdsInfo
impl CoverageIdsInfo
Sourcepub fn num_counters_after_mir_opts(&self) -> u32
pub fn num_counters_after_mir_opts(&self) -> u32
Coverage codegen needs to know how many coverage counters are ever
incremented within a function, so that it can set the num-counters
argument of the llvm.instrprof.increment
intrinsic.
This may be less than the highest counter ID emitted by the InstrumentCoverage MIR pass, if the highest-numbered counter increments were removed by MIR optimizations.
Sourcepub fn is_zero_term(&self, term: CovTerm) -> bool
pub fn is_zero_term(&self, term: CovTerm) -> bool
Returns true
if the given term is known to have a value of zero, taking
into account knowledge of which counters are unused and which expressions
are always zero.
Trait Implementations§
Source§impl Clone for CoverageIdsInfo
impl Clone for CoverageIdsInfo
Source§fn clone(&self) -> CoverageIdsInfo
fn clone(&self) -> CoverageIdsInfo
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl Debug for CoverageIdsInfo
impl Debug for CoverageIdsInfo
Source§impl<__D: TyDecoder> Decodable<__D> for CoverageIdsInfo
impl<__D: TyDecoder> Decodable<__D> for CoverageIdsInfo
Source§impl<__E: TyEncoder> Encodable<__E> for CoverageIdsInfo
impl<__E: TyEncoder> Encodable<__E> for CoverageIdsInfo
Source§impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for CoverageIdsInfo
impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for CoverageIdsInfo
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher, )
Auto Trait Implementations§
impl DynSend for CoverageIdsInfo
impl DynSync for CoverageIdsInfo
impl Freeze for CoverageIdsInfo
impl RefUnwindSafe for CoverageIdsInfo
impl Send for CoverageIdsInfo
impl Sync for CoverageIdsInfo
impl Unpin for CoverageIdsInfo
impl UnwindSafe for CoverageIdsInfo
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
Source§impl<Tcx, T> DepNodeParams<Tcx> for T
impl<Tcx, T> DepNodeParams<Tcx> for T
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<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<T> Pointable for T
impl<T> Pointable 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<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: 64 bytes