Enum rustc_abi::FieldsShape
source · pub enum FieldsShape<FieldIdx: Idx> {
Primitive,
Union(NonZeroUsize),
Array {
stride: Size,
count: u64,
},
Arbitrary {
offsets: IndexVec<FieldIdx, Size>,
memory_index: IndexVec<FieldIdx, u32>,
},
}
Expand description
Describes how the fields of a type are located in memory.
Variants§
Primitive
Scalar primitives and !
, which never have fields.
Union(NonZeroUsize)
All fields start at no offset. The usize
is the field count.
Array
Array/vector-like placement, with all fields of identical types.
Arbitrary
Struct-like placement, with precomputed offsets.
Fields are guaranteed to not overlap, but note that gaps before, between and after all the fields are NOT always padding, and as such their contents may not be discarded. For example, enum variants leave a gap at the start, where the discriminant field in the enum layout goes.
Fields
offsets: IndexVec<FieldIdx, Size>
Offsets for the first byte of each field, ordered to match the source definition order. This vector does not go in increasing order.
memory_index: IndexVec<FieldIdx, u32>
Maps source order field indices to memory order indices, depending on how the fields were reordered (if at all). This is a permutation, with both the source order and the memory order using the same (0..n) index ranges.
Note that during computation of memory_index
, sometimes
it is easier to operate on the inverse mapping (that is,
from memory order to source order), and that is usually
named inverse_memory_index
.
Implementations§
source§impl<FieldIdx: Idx> FieldsShape<FieldIdx>
impl<FieldIdx: Idx> FieldsShape<FieldIdx>
pub fn count(&self) -> usize
pub fn offset(&self, i: usize) -> Size
pub fn memory_index(&self, i: usize) -> usize
sourcepub fn index_by_increasing_offset(
&self,
) -> impl ExactSizeIterator<Item = usize> + '_
pub fn index_by_increasing_offset( &self, ) -> impl ExactSizeIterator<Item = usize> + '_
Gets source indices of the fields by increasing offsets.
Trait Implementations§
source§impl<FieldIdx: Clone + Idx> Clone for FieldsShape<FieldIdx>
impl<FieldIdx: Clone + Idx> Clone for FieldsShape<FieldIdx>
source§fn clone(&self) -> FieldsShape<FieldIdx>
fn clone(&self) -> FieldsShape<FieldIdx>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl<FieldIdx, __CTX> HashStable<__CTX> for FieldsShape<FieldIdx>
impl<FieldIdx, __CTX> HashStable<__CTX> for FieldsShape<FieldIdx>
fn hash_stable(&self, __hcx: &mut __CTX, __hasher: &mut StableHasher)
impl<FieldIdx: Eq + Idx> Eq for FieldsShape<FieldIdx>
impl<FieldIdx: Idx> StructuralPartialEq for FieldsShape<FieldIdx>
Auto Trait Implementations§
impl<FieldIdx> Freeze for FieldsShape<FieldIdx>
impl<FieldIdx> RefUnwindSafe for FieldsShape<FieldIdx>
impl<FieldIdx> Send for FieldsShape<FieldIdx>
impl<FieldIdx> Sync for FieldsShape<FieldIdx>
impl<FieldIdx> Unpin for FieldsShape<FieldIdx>
impl<FieldIdx> UnwindSafe for FieldsShape<FieldIdx>
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<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> 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<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,
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: 48 bytes
Size for each variant:
Primitive
: 0 bytesUnion
: 8 bytesArray
: 16 bytesArbitrary
: 48 bytes