Struct rustc_middle::mir::interpret::allocation::ConstAllocation
source · pub struct ConstAllocation<'tcx>(pub Interned<'tcx, Allocation>);
Expand description
Interned types generally have an Outer
type and an Inner
type, where
Outer
is a newtype around Interned<Inner>
, and all the operations are
done on Outer
, because all occurrences are interned. E.g. Ty
is an
outer type and TyKind
is its inner type.
Here things are different because only const allocations are interned. This
means that both the inner type (Allocation
) and the outer type
(ConstAllocation
) are used quite a bit.
Tuple Fields§
§0: Interned<'tcx, Allocation>
Implementations§
source§impl<'tcx> ConstAllocation<'tcx>
impl<'tcx> ConstAllocation<'tcx>
pub fn inner(self) -> &'tcx Allocation
Trait Implementations§
source§impl<'tcx> Clone for ConstAllocation<'tcx>
impl<'tcx> Clone for ConstAllocation<'tcx>
source§fn clone(&self) -> ConstAllocation<'tcx>
fn clone(&self) -> ConstAllocation<'tcx>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<'tcx> Debug for ConstAllocation<'tcx>
impl<'tcx> Debug for ConstAllocation<'tcx>
source§impl<'tcx> Hash for ConstAllocation<'tcx>
impl<'tcx> Hash for ConstAllocation<'tcx>
source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for ConstAllocation<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for ConstAllocation<'tcx>
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )
source§impl<'a, 'tcx> Lift<'tcx> for ConstAllocation<'a>
impl<'a, 'tcx> Lift<'tcx> for ConstAllocation<'a>
type Lifted = ConstAllocation<'tcx>
fn lift_to_tcx(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>
source§impl<'tcx> PartialEq<ConstAllocation<'tcx>> for ConstAllocation<'tcx>
impl<'tcx> PartialEq<ConstAllocation<'tcx>> for ConstAllocation<'tcx>
source§fn eq(&self, other: &ConstAllocation<'tcx>) -> bool
fn eq(&self, other: &ConstAllocation<'tcx>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.impl<'tcx> Copy for ConstAllocation<'tcx>
impl<'tcx> Eq for ConstAllocation<'tcx>
impl<'tcx> StructuralEq for ConstAllocation<'tcx>
impl<'tcx> StructuralPartialEq for ConstAllocation<'tcx>
Auto Trait Implementations§
impl<'tcx> RefUnwindSafe for ConstAllocation<'tcx>
impl<'tcx> Send for ConstAllocation<'tcx>
impl<'tcx> Sync for ConstAllocation<'tcx>
impl<'tcx> Unpin for ConstAllocation<'tcx>
impl<'tcx> UnwindSafe for ConstAllocation<'tcx>
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<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = T> ) -> &'a 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
Mutably borrows from an owned value. Read more
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
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
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).
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
This method tries to recover the query key from the given
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<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<'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, cycle: &[QueryInfo], _guar: ErrorGuaranteed ) -> 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: 8 bytes