Expand description
A bitmask where each bit refers to the byte with the same index. If the bit is true, the byte
is initialized. If it is false the byte is uninitialized.
Fields
blocks: Vec<u64>len: SizeImplementations
sourceimpl InitMask
impl InitMask
pub const BLOCK_SIZE: u64 = 64u64
fn bit_index(bits: Size) -> (usize, usize)
fn size_from_bit_index(block: impl TryInto<u64>, bit: impl TryInto<u64>) -> Size
pub fn new(size: Size, state: bool) -> Self
pub fn set_range(&mut self, start: Size, end: Size, new_state: bool)
pub fn set_range_inbounds(&mut self, start: Size, end: Size, new_state: bool)
pub fn get(&self, i: Size) -> bool
pub fn set(&mut self, i: Size, new_state: bool)
fn set_bit(&mut self, block: usize, bit: usize, new_state: bool)
pub fn grow(&mut self, amount: Size, new_state: bool)
sourceimpl InitMask
impl InitMask
sourcepub fn is_range_initialized(
&self,
start: Size,
end: Size
) -> Result<(), AllocRange>
pub fn is_range_initialized(
&self,
start: Size,
end: Size
) -> Result<(), AllocRange>
Checks whether the range start..end (end-exclusive) is entirely initialized.
Returns Ok(()) if it’s initialized. Otherwise returns a range of byte
indexes for the first contiguous span of the uninitialized access.
sourcepub fn range_as_init_chunks(&self, start: Size, end: Size) -> InitChunkIter<'_>ⓘNotable traits for InitChunkIter<'a>impl<'a> Iterator for InitChunkIter<'a> type Item = InitChunk;
pub fn range_as_init_chunks(&self, start: Size, end: Size) -> InitChunkIter<'_>ⓘNotable traits for InitChunkIter<'a>impl<'a> Iterator for InitChunkIter<'a> type Item = InitChunk;
Returns an iterator, yielding a range of byte indexes for each contiguous region
of initialized or uninitialized bytes inside the range start..end (end-exclusive).
The iterator guarantees the following:
- Chunks are nonempty.
- Chunks are adjacent (each range’s start is equal to the previous range’s end).
- Chunks span exactly
start..end(the first starts atstart, the last ends atend). - Chunks alternate between
InitChunk::InitandInitChunk::Uninit.
Trait Implementations
sourceimpl<'__ctx> HashStable<StableHashingContext<'__ctx>> for InitMask
impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for InitMask
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
sourceimpl Ord for InitMask
impl Ord for InitMask
sourceimpl PartialOrd<InitMask> for InitMask
impl PartialOrd<InitMask> for InitMask
sourcefn partial_cmp(&self, other: &InitMask) -> Option<Ordering>
fn partial_cmp(&self, other: &InitMask) -> Option<Ordering>
This method returns an ordering between self and other values if one exists. Read more
1.0.0 · sourcefn lt(&self, other: &Rhs) -> bool
fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · sourcefn 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 more
impl Eq for InitMask
impl StructuralEq for InitMask
impl StructuralPartialEq for InitMask
Auto Trait Implementations
impl RefUnwindSafe for InitMask
impl Send for InitMask
impl Sync for InitMask
impl Unpin for InitMask
impl UnwindSafe for InitMask
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<Ctxt, T> DepNodeParams<Ctxt> for T where
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Ctxt, T> DepNodeParams<Ctxt> for T where
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
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, Ctxt) -> String
sourcedefault fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
default fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
This method tries to recover the query key from the given DepNode,
something which is needed when forcing DepNodes 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 more
sourceimpl<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>>::Output where
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
impl<'a, T> Captures<'a> for T where
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: 32 bytes