pub struct ReprOptions {
pub int: Option<IntegerType>,
pub align: Option<Align>,
pub pack: Option<Align>,
pub flags: ReprFlags,
pub field_shuffle_seed: u64,
}
Expand description
Represents the repr options provided by the user.
Fields§
§int: Option<IntegerType>
§align: Option<Align>
§pack: Option<Align>
§flags: ReprFlags
§field_shuffle_seed: u64
The seed to be used for randomizing a type’s layout
Note: This could technically be a u128
which would
be the “most accurate” hash as it’d encompass the item and crate
hash without loss, but it does pay the price of being larger.
Everything’s a tradeoff, a 64-bit seed should be sufficient for our
purposes (primarily -Z randomize-layout
)
Implementations§
source§impl ReprOptions
impl ReprOptions
pub fn simd(&self) -> bool
pub fn c(&self) -> bool
pub fn packed(&self) -> bool
pub fn transparent(&self) -> bool
pub fn linear(&self) -> bool
sourcepub fn discr_type(&self) -> IntegerType
pub fn discr_type(&self) -> IntegerType
Returns the discriminant type, given these repr
options.
This must only be called on enums!
sourcepub fn inhibit_enum_layout_opt(&self) -> bool
pub fn inhibit_enum_layout_opt(&self) -> bool
Returns true
if this #[repr()]
should inhabit “smart enum
layout” optimizations, such as representing Foo<&T>
as a
single pointer.
pub fn inhibit_newtype_abi_optimization(&self) -> bool
sourcepub fn inhibit_struct_field_reordering(&self) -> bool
pub fn inhibit_struct_field_reordering(&self) -> bool
Returns true
if this #[repr()]
guarantees a fixed field order,
e.g. repr(C)
or repr(<int>)
.
sourcepub fn can_randomize_type_layout(&self) -> bool
pub fn can_randomize_type_layout(&self) -> bool
Returns true
if this type is valid for reordering and -Z randomize-layout
was enabled for its declaration crate.
sourcepub fn inhibits_union_abi_opt(&self) -> bool
pub fn inhibits_union_abi_opt(&self) -> bool
Returns true
if this #[repr()]
should inhibit union ABI optimisations.
Trait Implementations§
source§impl Clone for ReprOptions
impl Clone for ReprOptions
source§fn clone(&self) -> ReprOptions
fn clone(&self) -> ReprOptions
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl Debug for ReprOptions
impl Debug for ReprOptions
source§impl<__D> Decodable<__D> for ReprOptionswhere
__D: Decoder,
impl<__D> Decodable<__D> for ReprOptionswhere
__D: Decoder,
fn decode(__decoder: &mut __D) -> ReprOptions
source§impl Default for ReprOptions
impl Default for ReprOptions
source§fn default() -> ReprOptions
fn default() -> ReprOptions
source§impl<__E> Encodable<__E> for ReprOptionswhere
__E: Encoder,
impl<__E> Encodable<__E> for ReprOptionswhere
__E: Encoder,
source§impl<__CTX> HashStable<__CTX> for ReprOptionswhere
__CTX: HashStableContext,
impl<__CTX> HashStable<__CTX> for ReprOptionswhere
__CTX: HashStableContext,
fn hash_stable( &self, __hcx: &mut __CTX, __hasher: &mut StableHasher<SipHasher128>, )
source§impl ParameterizedOverTcx for ReprOptions
impl ParameterizedOverTcx for ReprOptions
type Value<'tcx> = ReprOptions
source§impl PartialEq for ReprOptions
impl PartialEq for ReprOptions
impl Copy for ReprOptions
impl Eq for ReprOptions
impl StructuralPartialEq for ReprOptions
Auto Trait Implementations§
impl Freeze for ReprOptions
impl RefUnwindSafe for ReprOptions
impl Send for ReprOptions
impl Sync for ReprOptions
impl Unpin for ReprOptions
impl UnwindSafe for ReprOptions
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(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T
fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx mut [T]
source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T
fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx mut [T]
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: 16 bytes