pub enum GlobalAlloc<'tcx> {
Function {
instance: Instance<'tcx>,
},
VTable(Ty<'tcx>, &'tcx List<PolyExistentialPredicate<'tcx>>),
Static(DefId),
Memory(ConstAllocation<'tcx>),
}
Expand description
An allocation in the global (tcx-managed) memory can be either a function pointer, a static, or a “real” allocation with some data in it.
Variants§
Function
The alloc ID is used as a function pointer.
VTable(Ty<'tcx>, &'tcx List<PolyExistentialPredicate<'tcx>>)
This alloc ID points to a symbolic (not-reified) vtable.
We remember the full dyn type, not just the principal trait, so that
const-eval and Miri can detect UB due to invalid transmutes of
dyn Trait
types.
Static(DefId)
The alloc ID points to a “lazy” static variable that did not get computed (yet). This is also used to break the cycle in recursive statics.
Memory(ConstAllocation<'tcx>)
The alloc ID points to memory.
Implementations§
Source§impl<'tcx> GlobalAlloc<'tcx>
impl<'tcx> GlobalAlloc<'tcx>
Sourcepub fn unwrap_memory(&self) -> ConstAllocation<'tcx>
pub fn unwrap_memory(&self) -> ConstAllocation<'tcx>
Panics if the GlobalAlloc
does not refer to an GlobalAlloc::Memory
Sourcepub fn unwrap_fn(&self) -> Instance<'tcx>
pub fn unwrap_fn(&self) -> Instance<'tcx>
Panics if the GlobalAlloc
is not GlobalAlloc::Function
Sourcepub fn unwrap_vtable(&self) -> (Ty<'tcx>, Option<PolyExistentialTraitRef<'tcx>>)
pub fn unwrap_vtable(&self) -> (Ty<'tcx>, Option<PolyExistentialTraitRef<'tcx>>)
Panics if the GlobalAlloc
is not GlobalAlloc::VTable
Sourcepub fn address_space(&self, cx: &impl HasDataLayout) -> AddressSpace
pub fn address_space(&self, cx: &impl HasDataLayout) -> AddressSpace
The address space that this GlobalAlloc
should be placed in.
Trait Implementations§
Source§impl<'tcx> Clone for GlobalAlloc<'tcx>
impl<'tcx> Clone for GlobalAlloc<'tcx>
Source§fn clone(&self) -> GlobalAlloc<'tcx>
fn clone(&self) -> GlobalAlloc<'tcx>
Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl<'tcx> Debug for GlobalAlloc<'tcx>
impl<'tcx> Debug for GlobalAlloc<'tcx>
Source§impl<'tcx> Hash for GlobalAlloc<'tcx>
impl<'tcx> Hash for GlobalAlloc<'tcx>
Source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for GlobalAlloc<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for GlobalAlloc<'tcx>
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher, )
Source§impl<'tcx> PartialEq for GlobalAlloc<'tcx>
impl<'tcx> PartialEq for GlobalAlloc<'tcx>
impl<'tcx> Eq for GlobalAlloc<'tcx>
impl<'tcx> StructuralPartialEq for GlobalAlloc<'tcx>
Auto Trait Implementations§
impl<'tcx> DynSend for GlobalAlloc<'tcx>
impl<'tcx> DynSync for GlobalAlloc<'tcx>
impl<'tcx> Freeze for GlobalAlloc<'tcx>
impl<'tcx> !RefUnwindSafe for GlobalAlloc<'tcx>
impl<'tcx> Send for GlobalAlloc<'tcx>
impl<'tcx> Sync for GlobalAlloc<'tcx>
impl<'tcx> Unpin for GlobalAlloc<'tcx>
impl<'tcx> !UnwindSafe for GlobalAlloc<'tcx>
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
)§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
§impl<Tcx, T> DepNodeParams<Tcx> for T
impl<Tcx, T> DepNodeParams<Tcx> for T
default fn fingerprint_style() -> FingerprintStyle
§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_debug_str(&self, _: Tcx) -> String
§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<T> Pointable for T
impl<T> Pointable for T
§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>,
§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
§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: 32 bytes
Size for each variant:
Function
: 32 bytesVTable
: 24 bytesStatic
: 12 bytesMemory
: 16 bytes