Enum rustc_const_eval::interpret::memory::MemoryKind
source · pub enum MemoryKind<T> {
Stack,
CallerLocation,
Machine(T),
}
Variants§
Stack
Stack memory. Error if deallocated except during a stack pop.
CallerLocation
Memory allocated by caller_location
intrinsic. Error if ever deallocated.
Machine(T)
Additional memory kinds a machine wishes to distinguish from the builtin ones.
Trait Implementations§
source§impl<T: Clone> Clone for MemoryKind<T>
impl<T: Clone> Clone for MemoryKind<T>
source§fn clone(&self) -> MemoryKind<T>
fn clone(&self) -> MemoryKind<T>
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<T: Debug> Debug for MemoryKind<T>
impl<T: Debug> Debug for MemoryKind<T>
source§impl<T: Display> Display for MemoryKind<T>
impl<T: Display> Display for MemoryKind<T>
source§impl<T: PartialEq> PartialEq for MemoryKind<T>
impl<T: PartialEq> PartialEq for MemoryKind<T>
source§fn eq(&self, other: &MemoryKind<T>) -> bool
fn eq(&self, other: &MemoryKind<T>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.impl<T: Copy> Copy for MemoryKind<T>
impl<T> StructuralPartialEq for MemoryKind<T>
Auto Trait Implementations§
impl<T> DynSend for MemoryKind<T>where
T: DynSend,
impl<T> DynSync for MemoryKind<T>where
T: DynSync,
impl<T> Freeze for MemoryKind<T>where
T: Freeze,
impl<T> RefUnwindSafe for MemoryKind<T>where
T: RefUnwindSafe,
impl<T> Send for MemoryKind<T>where
T: Send,
impl<T> Sync for MemoryKind<T>where
T: Sync,
impl<T> Unpin for MemoryKind<T>where
T: Unpin,
impl<T> UnwindSafe for MemoryKind<T>where
T: UnwindSafe,
Blanket Implementations§
§impl<T> AnyEq for T
impl<T> AnyEq for 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<'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<'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
§impl<T> Filterable for T
impl<T> Filterable for T
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<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
§impl<T> Pointable for T
impl<T> Pointable 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_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: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.