Struct rustc_middle::mir::coverage::CounterValueReference
source · pub struct CounterValueReference {
private: u32,
}
Fields§
§private: u32
Implementations§
source§impl CounterValueReference
impl CounterValueReference
sourcepub const MAX_AS_U32: u32 = 4_294_967_295u32
pub const MAX_AS_U32: u32 = 4_294_967_295u32
Maximum value the index can take, as a u32
.
sourcepub const fn from_usize(value: usize) -> Self
pub const fn from_usize(value: usize) -> Self
sourcepub const unsafe fn from_u32_unchecked(value: u32) -> Self
pub const unsafe fn from_u32_unchecked(value: u32) -> Self
Creates a new index from a given u32
.
Safety
The provided value must be less than or equal to the maximum value for the newtype. Providing a value outside this range is undefined due to layout restrictions.
Prefer using from_u32
.
source§impl CounterValueReference
impl CounterValueReference
sourcepub fn zero_based_index(self) -> u32
pub fn zero_based_index(self) -> u32
Returns explicitly-requested zero-based version of the counter id, used during codegen. LLVM expects zero-based indexes.
Trait Implementations§
source§impl Add<usize> for CounterValueReference
impl Add<usize> for CounterValueReference
source§impl Clone for CounterValueReference
impl Clone for CounterValueReference
source§fn clone(&self) -> CounterValueReference
fn clone(&self) -> CounterValueReference
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl Debug for CounterValueReference
impl Debug for CounterValueReference
source§impl From<CounterValueReference> for ExpressionOperandId
impl From<CounterValueReference> for ExpressionOperandId
source§fn from(v: CounterValueReference) -> ExpressionOperandId
fn from(v: CounterValueReference) -> ExpressionOperandId
Converts to this type from the input type.
source§impl From<CounterValueReference> for u32
impl From<CounterValueReference> for u32
source§fn from(v: CounterValueReference) -> u32
fn from(v: CounterValueReference) -> u32
Converts to this type from the input type.
source§impl From<CounterValueReference> for usize
impl From<CounterValueReference> for usize
source§fn from(v: CounterValueReference) -> usize
fn from(v: CounterValueReference) -> usize
Converts to this type from the input type.
source§impl From<u32> for CounterValueReference
impl From<u32> for CounterValueReference
source§impl From<usize> for CounterValueReference
impl From<usize> for CounterValueReference
source§impl Hash for CounterValueReference
impl Hash for CounterValueReference
source§impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for CounterValueReference
impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for CounterValueReference
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
source§impl Idx for CounterValueReference
impl Idx for CounterValueReference
source§impl<'tcx> Lift<'tcx> for CounterValueReference
impl<'tcx> Lift<'tcx> for CounterValueReference
type Lifted = CounterValueReference
fn lift_to_tcx(self, _: TyCtxt<'tcx>) -> Option<Self>
source§impl Ord for CounterValueReference
impl Ord for CounterValueReference
source§fn cmp(&self, other: &CounterValueReference) -> Ordering
fn cmp(&self, other: &CounterValueReference) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
source§impl PartialEq<CounterValueReference> for CounterValueReference
impl PartialEq<CounterValueReference> for CounterValueReference
source§fn eq(&self, other: &CounterValueReference) -> bool
fn eq(&self, other: &CounterValueReference) -> bool
source§impl PartialOrd<CounterValueReference> for CounterValueReference
impl PartialOrd<CounterValueReference> for CounterValueReference
source§fn partial_cmp(&self, other: &CounterValueReference) -> Option<Ordering>
fn partial_cmp(&self, other: &CounterValueReference) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moresource§impl Step for CounterValueReference
impl Step for CounterValueReference
source§fn steps_between(start: &Self, end: &Self) -> Option<usize>
fn steps_between(start: &Self, end: &Self) -> Option<usize>
🔬This is a nightly-only experimental API. (
step_trait
)source§fn forward_checked(start: Self, u: usize) -> Option<Self>
fn forward_checked(start: Self, u: usize) -> Option<Self>
🔬This is a nightly-only experimental API. (
step_trait
)source§fn backward_checked(start: Self, u: usize) -> Option<Self>
fn backward_checked(start: Self, u: usize) -> Option<Self>
🔬This is a nightly-only experimental API. (
step_trait
)source§fn forward(start: Self, count: usize) -> Self
fn forward(start: Self, count: usize) -> Self
🔬This is a nightly-only experimental API. (
step_trait
)source§unsafe fn forward_unchecked(start: Self, count: usize) -> Self
unsafe fn forward_unchecked(start: Self, count: usize) -> Self
🔬This is a nightly-only experimental API. (
step_trait
)source§fn backward(start: Self, count: usize) -> Self
fn backward(start: Self, count: usize) -> Self
🔬This is a nightly-only experimental API. (
step_trait
)source§unsafe fn backward_unchecked(start: Self, count: usize) -> Self
unsafe fn backward_unchecked(start: Self, count: usize) -> Self
🔬This is a nightly-only experimental API. (
step_trait
)source§impl<'tcx> TypeFoldable<'tcx> for CounterValueReference
impl<'tcx> TypeFoldable<'tcx> for CounterValueReference
source§fn try_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
_: &mut F
) -> Result<Self, F::Error>
fn try_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
_: &mut F
) -> Result<Self, F::Error>
source§impl<'tcx> TypeVisitable<'tcx> for CounterValueReference
impl<'tcx> TypeVisitable<'tcx> for CounterValueReference
source§fn visit_with<F: TypeVisitor<'tcx>>(&self, _: &mut F) -> ControlFlow<F::BreakTy>
fn visit_with<F: TypeVisitor<'tcx>>(&self, _: &mut F) -> ControlFlow<F::BreakTy>
source§fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
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. Read moresource§fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
Returns
true
if this type has any regions that escape binder
(and
hence are not bound by it). Read moresource§fn has_escaping_bound_vars(&self) -> bool
fn has_escaping_bound_vars(&self) -> bool
Return
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_opaque_types(&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 needs_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn needs_subst(&self) -> bool
source§fn has_free_regions(&self) -> bool
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. Read more
fn has_erased_regions(&self) -> bool
source§fn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
True if there are any un-erased free regions.
source§fn is_global(&self) -> bool
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. Read more
source§fn has_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
True if there are any late-bound regions
source§fn still_further_specializable(&self) -> bool
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. Read moreimpl Copy for CounterValueReference
impl Eq for CounterValueReference
impl StructuralEq for CounterValueReference
impl StructuralPartialEq for CounterValueReference
impl TrustedStep for CounterValueReference
Auto Trait Implementations§
impl RefUnwindSafe for CounterValueReference
impl Send for CounterValueReference
impl Sync for CounterValueReference
impl Unpin for CounterValueReference
impl UnwindSafe for CounterValueReference
Blanket Implementations§
source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = T>
) -> &'a mut [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
This method turns the parameters of a DepNodeConstructor into an opaque
Fingerprint to be used in DepNode.
Not all DepNodeParams support being turned into a Fingerprint (they
don’t need to if the corresponding DepNode is anonymous). Read more
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> Option<T>
default fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> Option<T>
This method tries to recover the query key from the given
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 moresource§impl<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,
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> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error(tcx: Tcx, _: &[QueryInfo]) -> 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: 4 bytes