pub struct InitMask {
blocks: InitMaskBlocks,
len: Size,
}
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.
The actual bits are only materialized when needed, and we try to keep this data lazy as long as
possible. Currently, if all the blocks have the same value, then the mask represents either a
fully initialized or fully uninitialized const allocation, so we can only store that single
value.
Fields§
§blocks: InitMaskBlocks
§len: Size
Implementations§
source§impl InitMask
impl InitMask
pub fn new(size: Size, state: bool) -> Self
sourcepub fn is_range_initialized(&self, range: AllocRange) -> Result<(), AllocRange>
pub fn is_range_initialized(&self, range: AllocRange) -> Result<(), AllocRange>
Checks whether the range
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 set_range(&mut self, range: AllocRange, new_state: bool)
pub fn set_range(&mut self, range: AllocRange, new_state: bool)
Sets a specified range to a value. If the range is out-of-bounds, the mask will grow to accommodate it entirely.
sourcefn materialize_blocks(&mut self) -> &mut InitMaskMaterialized
fn materialize_blocks(&mut self) -> &mut InitMaskMaterialized
Materializes this mask’s blocks when the mask is lazy.
source§impl InitMask
impl InitMask
sourcepub fn range_as_init_chunks(&self, range: AllocRange) -> InitChunkIter<'_> ⓘ
pub fn range_as_init_chunks(&self, range: AllocRange) -> InitChunkIter<'_> ⓘ
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::Init
andInitChunk::Uninit
.
source§impl InitMask
impl InitMask
Transferring the initialization mask to other allocations.
sourcepub fn prepare_copy(&self, range: AllocRange) -> InitCopy
pub fn prepare_copy(&self, range: AllocRange) -> InitCopy
Creates a run-length encoding of the initialization mask; panics if range is empty.
This is essentially a more space-efficient version of
InitMask::range_as_init_chunks(...).collect::<Vec<_>>()
.
sourcepub fn apply_copy(&mut self, defined: InitCopy, range: AllocRange, repeat: u64)
pub fn apply_copy(&mut self, defined: InitCopy, range: AllocRange, repeat: u64)
Applies multiple instances of the run-length encoding to the initialization mask.
Trait Implementations§
source§impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for InitMask
impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for InitMask
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher, )
impl Eq for InitMask
impl StructuralPartialEq for InitMask
Auto Trait Implementations§
impl Freeze for InitMask
impl RefUnwindSafe for InitMask
impl Send for InitMask
impl Sync for InitMask
impl Unpin for InitMask
impl UnwindSafe for InitMask
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§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)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<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.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<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: 32 bytes