Struct rustc_middle::ty::context::CtxtInterners
source · pub struct CtxtInterners<'tcx> {Show 20 fields
arena: &'tcx WorkerLocal<Arena<'tcx>>,
type_: ShardedHashMap<InternedInSet<'tcx, WithCachedTypeInfo<TyKind<'tcx>>>, ()>,
const_lists: ShardedHashMap<InternedInSet<'tcx, List<Const<'tcx>>>, ()>,
args: ShardedHashMap<InternedInSet<'tcx, GenericArgs<'tcx>>, ()>,
type_lists: ShardedHashMap<InternedInSet<'tcx, List<Ty<'tcx>>>, ()>,
canonical_var_infos: ShardedHashMap<InternedInSet<'tcx, List<CanonicalVarInfo<'tcx>>>, ()>,
region: ShardedHashMap<InternedInSet<'tcx, RegionKind<'tcx>>, ()>,
poly_existential_predicates: ShardedHashMap<InternedInSet<'tcx, List<PolyExistentialPredicate<'tcx>>>, ()>,
predicate: ShardedHashMap<InternedInSet<'tcx, WithCachedTypeInfo<Binder<'tcx, PredicateKind<'tcx>>>>, ()>,
clauses: ShardedHashMap<InternedInSet<'tcx, List<Clause<'tcx>>>, ()>,
projs: ShardedHashMap<InternedInSet<'tcx, List<ProjectionKind>>, ()>,
place_elems: ShardedHashMap<InternedInSet<'tcx, List<PlaceElem<'tcx>>>, ()>,
const_: ShardedHashMap<InternedInSet<'tcx, ConstData<'tcx>>, ()>,
const_allocation: ShardedHashMap<InternedInSet<'tcx, Allocation>, ()>,
bound_variable_kinds: ShardedHashMap<InternedInSet<'tcx, List<BoundVariableKind>>, ()>,
layout: ShardedHashMap<InternedInSet<'tcx, LayoutS<FieldIdx, VariantIdx>>, ()>,
adt_def: ShardedHashMap<InternedInSet<'tcx, AdtDefData>, ()>,
external_constraints: ShardedHashMap<InternedInSet<'tcx, ExternalConstraintsData<'tcx>>, ()>,
predefined_opaques_in_body: ShardedHashMap<InternedInSet<'tcx, PredefinedOpaquesData<'tcx>>, ()>,
fields: ShardedHashMap<InternedInSet<'tcx, List<FieldIdx>>, ()>,
}
Fields§
§arena: &'tcx WorkerLocal<Arena<'tcx>>
The arena that types, regions, etc. are allocated from.
type_: ShardedHashMap<InternedInSet<'tcx, WithCachedTypeInfo<TyKind<'tcx>>>, ()>
§const_lists: ShardedHashMap<InternedInSet<'tcx, List<Const<'tcx>>>, ()>
§args: ShardedHashMap<InternedInSet<'tcx, GenericArgs<'tcx>>, ()>
§type_lists: ShardedHashMap<InternedInSet<'tcx, List<Ty<'tcx>>>, ()>
§canonical_var_infos: ShardedHashMap<InternedInSet<'tcx, List<CanonicalVarInfo<'tcx>>>, ()>
§region: ShardedHashMap<InternedInSet<'tcx, RegionKind<'tcx>>, ()>
§poly_existential_predicates: ShardedHashMap<InternedInSet<'tcx, List<PolyExistentialPredicate<'tcx>>>, ()>
§predicate: ShardedHashMap<InternedInSet<'tcx, WithCachedTypeInfo<Binder<'tcx, PredicateKind<'tcx>>>>, ()>
§clauses: ShardedHashMap<InternedInSet<'tcx, List<Clause<'tcx>>>, ()>
§projs: ShardedHashMap<InternedInSet<'tcx, List<ProjectionKind>>, ()>
§place_elems: ShardedHashMap<InternedInSet<'tcx, List<PlaceElem<'tcx>>>, ()>
§const_: ShardedHashMap<InternedInSet<'tcx, ConstData<'tcx>>, ()>
§const_allocation: ShardedHashMap<InternedInSet<'tcx, Allocation>, ()>
§bound_variable_kinds: ShardedHashMap<InternedInSet<'tcx, List<BoundVariableKind>>, ()>
§layout: ShardedHashMap<InternedInSet<'tcx, LayoutS<FieldIdx, VariantIdx>>, ()>
§adt_def: ShardedHashMap<InternedInSet<'tcx, AdtDefData>, ()>
§external_constraints: ShardedHashMap<InternedInSet<'tcx, ExternalConstraintsData<'tcx>>, ()>
§predefined_opaques_in_body: ShardedHashMap<InternedInSet<'tcx, PredefinedOpaquesData<'tcx>>, ()>
§fields: ShardedHashMap<InternedInSet<'tcx, List<FieldIdx>>, ()>
Implementations§
source§impl<'tcx> CtxtInterners<'tcx>
impl<'tcx> CtxtInterners<'tcx>
fn new(arena: &'tcx WorkerLocal<Arena<'tcx>>) -> CtxtInterners<'tcx>
sourcefn intern_ty(
&self,
kind: TyKind<'tcx>,
sess: &Session,
untracked: &Untracked
) -> Ty<'tcx>
fn intern_ty( &self, kind: TyKind<'tcx>, sess: &Session, untracked: &Untracked ) -> Ty<'tcx>
Interns a type. (Use mk_*
functions instead, where possible.)
fn stable_hash<'a, T: HashStable<StableHashingContext<'a>>>( &self, flags: &FlagComputation, sess: &'a Session, untracked: &'a Untracked, val: &T ) -> Fingerprint
sourcefn intern_predicate(
&self,
kind: Binder<'tcx, PredicateKind<'tcx>>,
sess: &Session,
untracked: &Untracked
) -> Predicate<'tcx>
fn intern_predicate( &self, kind: Binder<'tcx, PredicateKind<'tcx>>, sess: &Session, untracked: &Untracked ) -> Predicate<'tcx>
Interns a predicate. (Use mk_predicate
instead, where possible.)
Auto Trait Implementations§
impl<'tcx> !RefUnwindSafe for CtxtInterners<'tcx>
impl<'tcx> !Send for CtxtInterners<'tcx>
impl<'tcx> !Sync for CtxtInterners<'tcx>
impl<'tcx> Unpin for CtxtInterners<'tcx>
impl<'tcx> !UnwindSafe for CtxtInterners<'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
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<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: 768 bytes