Struct rustc_middle::mir::interpret::allocation::init_mask::InitMask
source · 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: Size
Implementations§
source§impl InitMask
impl InitMask
pub const BLOCK_SIZE: u64 = 64u64
pub fn new(size: Size, state: bool) -> Self
fn bit_index(bits: Size) -> (usize, usize)
fn size_from_bit_index(block: impl TryInto<u64>, bit: impl TryInto<u64>) -> Size
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.
pub fn set_range(&mut self, range: AllocRange, new_state: bool)
fn set_range_inbounds(&mut self, start: Size, end: Size, new_state: bool)
pub fn get(&self, i: Size) -> bool
fn grow(&mut self, amount: Size, new_state: bool)
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 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§
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
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>
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: 32 bytes