1 //! Type context book-keeping.
3 #![allow(rustc::usage_of_ty_tykind)]
7 use crate::arena::Arena;
8 use crate::dep_graph::{DepGraph, DepKindStruct};
9 use crate::infer::canonical::{CanonicalVarInfo, CanonicalVarInfos};
10 use crate::lint::struct_lint_level;
11 use crate::middle::codegen_fn_attrs::CodegenFnAttrs;
12 use crate::middle::resolve_lifetime;
13 use crate::middle::stability;
14 use crate::mir::interpret::{self, Allocation, ConstAllocation};
16 Body, BorrowCheckResult, Field, Local, Place, PlaceElem, ProjectionKind, Promoted,
18 use crate::thir::Thir;
20 use crate::ty::query::{self, TyCtxtAt};
22 self, AdtDef, AdtDefData, AdtKind, Binder, Const, ConstData, DefIdTree, FloatTy, FloatVar,
23 FloatVid, GenericParamDefKind, ImplPolarity, InferTy, IntTy, IntVar, IntVid, List, ParamConst,
24 ParamTy, PolyExistentialPredicate, PolyFnSig, Predicate, PredicateKind, Region, RegionKind,
25 ReprOptions, TraitObjectVisitor, Ty, TyKind, TyVar, TyVid, TypeAndMut, TypeckResults, UintTy,
28 use crate::ty::{GenericArg, InternalSubsts, SubstsRef};
30 use rustc_data_structures::fingerprint::Fingerprint;
31 use rustc_data_structures::fx::{FxHashMap, FxHashSet};
32 use rustc_data_structures::intern::Interned;
33 use rustc_data_structures::memmap::Mmap;
34 use rustc_data_structures::profiling::SelfProfilerRef;
35 use rustc_data_structures::sharded::{IntoPointer, ShardedHashMap};
36 use rustc_data_structures::stable_hasher::{HashStable, StableHasher};
37 use rustc_data_structures::steal::Steal;
38 use rustc_data_structures::sync::{self, Lock, Lrc, ReadGuard, WorkerLocal};
40 DecorateLint, DiagnosticBuilder, DiagnosticMessage, ErrorGuaranteed, MultiSpan,
43 use rustc_hir::def::DefKind;
44 use rustc_hir::def_id::{CrateNum, DefId, LocalDefId, LOCAL_CRATE};
45 use rustc_hir::definitions::Definitions;
46 use rustc_hir::intravisit::Visitor;
47 use rustc_hir::lang_items::LangItem;
49 Constness, ExprKind, HirId, ImplItemKind, ItemKind, Node, TraitCandidate, TraitItemKind,
51 use rustc_index::vec::IndexVec;
52 use rustc_macros::HashStable;
53 use rustc_query_system::dep_graph::DepNodeIndex;
54 use rustc_query_system::ich::StableHashingContext;
55 use rustc_serialize::opaque::{FileEncodeResult, FileEncoder};
56 use rustc_session::config::CrateType;
57 use rustc_session::cstore::{CrateStoreDyn, Untracked};
58 use rustc_session::lint::Lint;
59 use rustc_session::Limit;
60 use rustc_session::Session;
61 use rustc_span::def_id::{DefPathHash, StableCrateId};
62 use rustc_span::source_map::SourceMap;
63 use rustc_span::symbol::{kw, sym, Ident, Symbol};
64 use rustc_span::{Span, DUMMY_SP};
65 use rustc_target::abi::{Layout, LayoutS, TargetDataLayout, VariantIdx};
66 use rustc_target::spec::abi;
67 use rustc_type_ir::sty::TyKind::*;
68 use rustc_type_ir::WithCachedTypeInfo;
69 use rustc_type_ir::{DynKind, InternAs, InternIteratorElement, Interner, TypeFlags};
72 use std::borrow::Borrow;
73 use std::cmp::Ordering;
75 use std::hash::{Hash, Hasher};
78 use std::ops::{Bound, Deref};
80 const TINY_CONST_EVAL_LIMIT: Limit = Limit(20);
82 pub trait OnDiskCache<'tcx>: rustc_data_structures::sync::Sync {
83 /// Creates a new `OnDiskCache` instance from the serialized data in `data`.
84 fn new(sess: &'tcx Session, data: Mmap, start_pos: usize) -> Self
88 fn new_empty(source_map: &'tcx SourceMap) -> Self
92 fn drop_serialized_data(&self, tcx: TyCtxt<'tcx>);
94 fn serialize(&self, tcx: TyCtxt<'tcx>, encoder: FileEncoder) -> FileEncodeResult;
97 #[allow(rustc::usage_of_ty_tykind)]
98 impl<'tcx> Interner for TyCtxt<'tcx> {
99 type AdtDef = ty::AdtDef<'tcx>;
100 type SubstsRef = ty::SubstsRef<'tcx>;
103 type Const = ty::Const<'tcx>;
104 type Region = Region<'tcx>;
105 type TypeAndMut = TypeAndMut<'tcx>;
106 type Mutability = hir::Mutability;
107 type Movability = hir::Movability;
108 type PolyFnSig = PolyFnSig<'tcx>;
109 type ListBinderExistentialPredicate = &'tcx List<PolyExistentialPredicate<'tcx>>;
110 type BinderListTy = Binder<'tcx, &'tcx List<Ty<'tcx>>>;
111 type ListTy = &'tcx List<Ty<'tcx>>;
112 type AliasTy = ty::AliasTy<'tcx>;
113 type ParamTy = ParamTy;
114 type BoundTy = ty::BoundTy;
115 type PlaceholderType = ty::PlaceholderType;
116 type InferTy = InferTy;
117 type ErrorGuaranteed = ErrorGuaranteed;
118 type PredicateKind = ty::PredicateKind<'tcx>;
119 type AllocId = crate::mir::interpret::AllocId;
121 type EarlyBoundRegion = ty::EarlyBoundRegion;
122 type BoundRegion = ty::BoundRegion;
123 type FreeRegion = ty::FreeRegion;
124 type RegionVid = ty::RegionVid;
125 type PlaceholderRegion = ty::PlaceholderRegion;
128 type InternedSet<'tcx, T> = ShardedHashMap<InternedInSet<'tcx, T>, ()>;
130 pub struct CtxtInterners<'tcx> {
131 /// The arena that types, regions, etc. are allocated from.
132 arena: &'tcx WorkerLocal<Arena<'tcx>>,
134 // Specifically use a speedy hash algorithm for these hash sets, since
135 // they're accessed quite often.
136 type_: InternedSet<'tcx, WithCachedTypeInfo<TyKind<'tcx>>>,
137 const_lists: InternedSet<'tcx, List<ty::Const<'tcx>>>,
138 substs: InternedSet<'tcx, InternalSubsts<'tcx>>,
139 canonical_var_infos: InternedSet<'tcx, List<CanonicalVarInfo<'tcx>>>,
140 region: InternedSet<'tcx, RegionKind<'tcx>>,
141 poly_existential_predicates: InternedSet<'tcx, List<PolyExistentialPredicate<'tcx>>>,
142 predicate: InternedSet<'tcx, WithCachedTypeInfo<ty::Binder<'tcx, PredicateKind<'tcx>>>>,
143 predicates: InternedSet<'tcx, List<Predicate<'tcx>>>,
144 projs: InternedSet<'tcx, List<ProjectionKind>>,
145 place_elems: InternedSet<'tcx, List<PlaceElem<'tcx>>>,
146 const_: InternedSet<'tcx, ConstData<'tcx>>,
147 const_allocation: InternedSet<'tcx, Allocation>,
148 bound_variable_kinds: InternedSet<'tcx, List<ty::BoundVariableKind>>,
149 layout: InternedSet<'tcx, LayoutS<VariantIdx>>,
150 adt_def: InternedSet<'tcx, AdtDefData>,
153 impl<'tcx> CtxtInterners<'tcx> {
154 fn new(arena: &'tcx WorkerLocal<Arena<'tcx>>) -> CtxtInterners<'tcx> {
157 type_: Default::default(),
158 const_lists: Default::default(),
159 substs: Default::default(),
160 region: Default::default(),
161 poly_existential_predicates: Default::default(),
162 canonical_var_infos: Default::default(),
163 predicate: Default::default(),
164 predicates: Default::default(),
165 projs: Default::default(),
166 place_elems: Default::default(),
167 const_: Default::default(),
168 const_allocation: Default::default(),
169 bound_variable_kinds: Default::default(),
170 layout: Default::default(),
171 adt_def: Default::default(),
176 #[allow(rustc::usage_of_ty_tykind)]
178 fn intern_ty(&self, kind: TyKind<'tcx>, sess: &Session, untracked: &Untracked) -> Ty<'tcx> {
179 Ty(Interned::new_unchecked(
181 .intern(kind, |kind| {
182 let flags = super::flags::FlagComputation::for_kind(&kind);
183 let stable_hash = self.stable_hash(&flags, sess, untracked, &kind);
185 InternedInSet(self.arena.alloc(WithCachedTypeInfo {
189 outer_exclusive_binder: flags.outer_exclusive_binder,
196 fn stable_hash<'a, T: HashStable<StableHashingContext<'a>>>(
198 flags: &ty::flags::FlagComputation,
200 untracked: &'a Untracked,
203 // It's impossible to hash inference variables (and will ICE), so we don't need to try to cache them.
204 // Without incremental, we rarely stable-hash types, so let's not do it proactively.
205 if flags.flags.intersects(TypeFlags::NEEDS_INFER) || sess.opts.incremental.is_none() {
208 let mut hasher = StableHasher::new();
209 let mut hcx = StableHashingContext::new(sess, untracked);
210 val.hash_stable(&mut hcx, &mut hasher);
218 kind: Binder<'tcx, PredicateKind<'tcx>>,
220 untracked: &Untracked,
221 ) -> Predicate<'tcx> {
222 Predicate(Interned::new_unchecked(
224 .intern(kind, |kind| {
225 let flags = super::flags::FlagComputation::for_predicate(kind);
227 let stable_hash = self.stable_hash(&flags, sess, untracked, &kind);
229 InternedInSet(self.arena.alloc(WithCachedTypeInfo {
233 outer_exclusive_binder: flags.outer_exclusive_binder,
241 pub struct CommonTypes<'tcx> {
261 pub self_param: Ty<'tcx>,
263 /// Dummy type used for the `Self` of a `TraitRef` created for converting
264 /// a trait object, and which gets removed in `ExistentialTraitRef`.
265 /// This type must not appear anywhere in other converted types.
266 pub trait_object_dummy_self: Ty<'tcx>,
269 pub struct CommonLifetimes<'tcx> {
271 pub re_static: Region<'tcx>,
273 /// Erased region, used outside of type inference.
274 pub re_erased: Region<'tcx>,
277 pub struct CommonConsts<'tcx> {
278 pub unit: Const<'tcx>,
281 impl<'tcx> CommonTypes<'tcx> {
283 interners: &CtxtInterners<'tcx>,
285 untracked: &Untracked,
286 ) -> CommonTypes<'tcx> {
287 let mk = |ty| interners.intern_ty(ty, sess, untracked);
290 unit: mk(Tuple(List::empty())),
294 isize: mk(Int(ty::IntTy::Isize)),
295 i8: mk(Int(ty::IntTy::I8)),
296 i16: mk(Int(ty::IntTy::I16)),
297 i32: mk(Int(ty::IntTy::I32)),
298 i64: mk(Int(ty::IntTy::I64)),
299 i128: mk(Int(ty::IntTy::I128)),
300 usize: mk(Uint(ty::UintTy::Usize)),
301 u8: mk(Uint(ty::UintTy::U8)),
302 u16: mk(Uint(ty::UintTy::U16)),
303 u32: mk(Uint(ty::UintTy::U32)),
304 u64: mk(Uint(ty::UintTy::U64)),
305 u128: mk(Uint(ty::UintTy::U128)),
306 f32: mk(Float(ty::FloatTy::F32)),
307 f64: mk(Float(ty::FloatTy::F64)),
309 self_param: mk(ty::Param(ty::ParamTy { index: 0, name: kw::SelfUpper })),
311 trait_object_dummy_self: mk(Infer(ty::FreshTy(0))),
316 impl<'tcx> CommonLifetimes<'tcx> {
317 fn new(interners: &CtxtInterners<'tcx>) -> CommonLifetimes<'tcx> {
319 Region(Interned::new_unchecked(
320 interners.region.intern(r, |r| InternedInSet(interners.arena.alloc(r))).0,
324 CommonLifetimes { re_static: mk(ty::ReStatic), re_erased: mk(ty::ReErased) }
328 impl<'tcx> CommonConsts<'tcx> {
329 fn new(interners: &CtxtInterners<'tcx>, types: &CommonTypes<'tcx>) -> CommonConsts<'tcx> {
331 Const(Interned::new_unchecked(
332 interners.const_.intern(c, |c| InternedInSet(interners.arena.alloc(c))).0,
337 unit: mk_const(ty::ConstData {
338 kind: ty::ConstKind::Value(ty::ValTree::zst()),
345 /// This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
348 pub struct FreeRegionInfo {
349 /// `LocalDefId` corresponding to FreeRegion
350 pub def_id: LocalDefId,
351 /// the bound region corresponding to FreeRegion
352 pub boundregion: ty::BoundRegionKind,
353 /// checks if bound region is in Impl Item
354 pub is_impl_item: bool,
357 /// This struct should only be created by `create_def`.
358 #[derive(Copy, Clone)]
359 pub struct TyCtxtFeed<'tcx, KEY: Copy> {
360 pub tcx: TyCtxt<'tcx>,
361 // Do not allow direct access, as downstream code must not mutate this field.
365 impl<'tcx> TyCtxt<'tcx> {
366 pub fn feed_unit_query(self) -> TyCtxtFeed<'tcx, ()> {
367 TyCtxtFeed { tcx: self, key: () }
369 pub fn feed_local_crate(self) -> TyCtxtFeed<'tcx, CrateNum> {
370 TyCtxtFeed { tcx: self, key: LOCAL_CRATE }
374 impl<'tcx, KEY: Copy> TyCtxtFeed<'tcx, KEY> {
376 pub fn key(&self) -> KEY {
381 impl<'tcx> TyCtxtFeed<'tcx, LocalDefId> {
383 pub fn def_id(&self) -> LocalDefId {
388 /// The central data structure of the compiler. It stores references
389 /// to the various **arenas** and also houses the results of the
390 /// various **compiler queries** that have been performed. See the
391 /// [rustc dev guide] for more details.
393 /// [rustc dev guide]: https://rustc-dev-guide.rust-lang.org/ty.html
394 #[derive(Copy, Clone)]
395 #[rustc_diagnostic_item = "TyCtxt"]
396 #[rustc_pass_by_value]
397 pub struct TyCtxt<'tcx> {
398 gcx: &'tcx GlobalCtxt<'tcx>,
401 impl<'tcx> Deref for TyCtxt<'tcx> {
402 type Target = &'tcx GlobalCtxt<'tcx>;
404 fn deref(&self) -> &Self::Target {
409 pub struct GlobalCtxt<'tcx> {
410 pub arena: &'tcx WorkerLocal<Arena<'tcx>>,
411 pub hir_arena: &'tcx WorkerLocal<hir::Arena<'tcx>>,
413 interners: CtxtInterners<'tcx>,
415 pub sess: &'tcx Session,
417 /// This only ever stores a `LintStore` but we don't want a dependency on that type here.
419 /// FIXME(Centril): consider `dyn LintStoreMarker` once
420 /// we can upcast to `Any` for some additional type safety.
421 pub lint_store: Lrc<dyn Any + sync::Sync + sync::Send>,
423 pub dep_graph: DepGraph,
425 pub prof: SelfProfilerRef,
427 /// Common types, pre-interned for your convenience.
428 pub types: CommonTypes<'tcx>,
430 /// Common lifetimes, pre-interned for your convenience.
431 pub lifetimes: CommonLifetimes<'tcx>,
433 /// Common consts, pre-interned for your convenience.
434 pub consts: CommonConsts<'tcx>,
436 untracked: Untracked,
438 /// This provides access to the incremental compilation on-disk cache for query results.
439 /// Do not access this directly. It is only meant to be used by
440 /// `DepGraph::try_mark_green()` and the query infrastructure.
441 /// This is `None` if we are not incremental compilation mode
442 pub on_disk_cache: Option<&'tcx dyn OnDiskCache<'tcx>>,
444 pub queries: &'tcx dyn query::QueryEngine<'tcx>,
445 pub query_caches: query::QueryCaches<'tcx>,
446 pub(crate) query_kinds: &'tcx [DepKindStruct<'tcx>],
448 // Internal caches for metadata decoding. No need to track deps on this.
449 pub ty_rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
450 pub pred_rcache: Lock<FxHashMap<ty::CReaderCacheKey, Predicate<'tcx>>>,
452 /// Caches the results of trait selection. This cache is used
453 /// for things that do not have to do with the parameters in scope.
454 pub selection_cache: traits::SelectionCache<'tcx>,
456 /// Caches the results of trait evaluation. This cache is used
457 /// for things that do not have to do with the parameters in scope.
458 /// Merge this with `selection_cache`?
459 pub evaluation_cache: traits::EvaluationCache<'tcx>,
461 /// Data layout specification for the current target.
462 pub data_layout: TargetDataLayout,
464 /// Stores memory for globals (statics/consts).
465 pub(crate) alloc_map: Lock<interpret::AllocMap<'tcx>>,
468 impl<'tcx> TyCtxt<'tcx> {
469 /// Expects a body and returns its codegen attributes.
471 /// Unlike `codegen_fn_attrs`, this returns `CodegenFnAttrs::EMPTY` for
473 pub fn body_codegen_attrs(self, def_id: DefId) -> &'tcx CodegenFnAttrs {
474 let def_kind = self.def_kind(def_id);
475 if def_kind.has_codegen_attrs() {
476 self.codegen_fn_attrs(def_id)
479 DefKind::AnonConst | DefKind::AssocConst | DefKind::Const | DefKind::InlineConst
481 CodegenFnAttrs::EMPTY
484 "body_codegen_fn_attrs called on unexpected definition: {:?} {:?}",
491 pub fn typeck_opt_const_arg(
493 def: ty::WithOptConstParam<LocalDefId>,
494 ) -> &'tcx TypeckResults<'tcx> {
495 if let Some(param_did) = def.const_param_did {
496 self.typeck_const_arg((def.did, param_did))
502 pub fn mir_borrowck_opt_const_arg(
504 def: ty::WithOptConstParam<LocalDefId>,
505 ) -> &'tcx BorrowCheckResult<'tcx> {
506 if let Some(param_did) = def.const_param_did {
507 self.mir_borrowck_const_arg((def.did, param_did))
509 self.mir_borrowck(def.did)
513 pub fn alloc_steal_thir(self, thir: Thir<'tcx>) -> &'tcx Steal<Thir<'tcx>> {
514 self.arena.alloc(Steal::new(thir))
517 pub fn alloc_steal_mir(self, mir: Body<'tcx>) -> &'tcx Steal<Body<'tcx>> {
518 self.arena.alloc(Steal::new(mir))
521 pub fn alloc_steal_promoted(
523 promoted: IndexVec<Promoted, Body<'tcx>>,
524 ) -> &'tcx Steal<IndexVec<Promoted, Body<'tcx>>> {
525 self.arena.alloc(Steal::new(promoted))
528 pub fn alloc_adt_def(
532 variants: IndexVec<VariantIdx, ty::VariantDef>,
534 ) -> ty::AdtDef<'tcx> {
535 self.intern_adt_def(ty::AdtDefData::new(self, did, kind, variants, repr))
538 /// Allocates a read-only byte or string literal for `mir::interpret`.
539 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
540 // Create an allocation that just contains these bytes.
541 let alloc = interpret::Allocation::from_bytes_byte_aligned_immutable(bytes);
542 let alloc = self.intern_const_alloc(alloc);
543 self.create_memory_alloc(alloc)
546 /// Returns a range of the start/end indices specified with the
547 /// `rustc_layout_scalar_valid_range` attribute.
548 // FIXME(eddyb) this is an awkward spot for this method, maybe move it?
549 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
551 let Some(attr) = self.get_attr(def_id, name) else {
552 return Bound::Unbounded;
554 debug!("layout_scalar_valid_range: attr={:?}", attr);
557 ast::NestedMetaItem::Lit(ast::MetaItemLit {
558 kind: ast::LitKind::Int(a, _),
562 ) = attr.meta_item_list().as_deref()
567 .delay_span_bug(attr.span, "invalid rustc_layout_scalar_valid_range attribute");
572 get(sym::rustc_layout_scalar_valid_range_start),
573 get(sym::rustc_layout_scalar_valid_range_end),
577 pub fn lift<T: Lift<'tcx>>(self, value: T) -> Option<T::Lifted> {
578 value.lift_to_tcx(self)
581 /// Creates a type context and call the closure with a `TyCtxt` reference
582 /// to the context. The closure enforces that the type context and any interned
583 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
584 /// reference to the context, to allow formatting values that need it.
585 pub fn create_global_ctxt(
587 lint_store: Lrc<dyn Any + sync::Send + sync::Sync>,
588 arena: &'tcx WorkerLocal<Arena<'tcx>>,
589 hir_arena: &'tcx WorkerLocal<hir::Arena<'tcx>>,
590 untracked: Untracked,
592 on_disk_cache: Option<&'tcx dyn OnDiskCache<'tcx>>,
593 queries: &'tcx dyn query::QueryEngine<'tcx>,
594 query_kinds: &'tcx [DepKindStruct<'tcx>],
595 ) -> GlobalCtxt<'tcx> {
596 let data_layout = s.target.parse_data_layout().unwrap_or_else(|err| {
599 let interners = CtxtInterners::new(arena);
600 let common_types = CommonTypes::new(&interners, s, &untracked);
601 let common_lifetimes = CommonLifetimes::new(&interners);
602 let common_consts = CommonConsts::new(&interners, &common_types);
611 prof: s.prof.clone(),
613 lifetimes: common_lifetimes,
614 consts: common_consts,
618 query_caches: query::QueryCaches::default(),
620 ty_rcache: Default::default(),
621 pred_rcache: Default::default(),
622 selection_cache: Default::default(),
623 evaluation_cache: Default::default(),
625 alloc_map: Lock::new(interpret::AllocMap::new()),
629 /// Constructs a `TyKind::Error` type with current `ErrorGuaranteed`
631 pub fn ty_error_with_guaranteed(self, reported: ErrorGuaranteed) -> Ty<'tcx> {
632 self.mk_ty(Error(reported))
635 /// Constructs a `TyKind::Error` type and registers a `delay_span_bug` to ensure it gets used.
637 pub fn ty_error(self) -> Ty<'tcx> {
638 self.ty_error_with_message(DUMMY_SP, "TyKind::Error constructed but no error reported")
641 /// Constructs a `TyKind::Error` type and registers a `delay_span_bug` with the given `msg` to
642 /// ensure it gets used.
644 pub fn ty_error_with_message<S: Into<MultiSpan>>(self, span: S, msg: &str) -> Ty<'tcx> {
645 let reported = self.sess.delay_span_bug(span, msg);
646 self.mk_ty(Error(reported))
649 /// Like [TyCtxt::ty_error] but for constants, with current `ErrorGuaranteed`
651 pub fn const_error_with_guaranteed(
654 reported: ErrorGuaranteed,
656 self.mk_const(ty::ConstKind::Error(reported), ty)
659 /// Like [TyCtxt::ty_error] but for constants.
661 pub fn const_error(self, ty: Ty<'tcx>) -> Const<'tcx> {
662 self.const_error_with_message(
665 "ty::ConstKind::Error constructed but no error reported",
669 /// Like [TyCtxt::ty_error_with_message] but for constants.
671 pub fn const_error_with_message<S: Into<MultiSpan>>(
677 let reported = self.sess.delay_span_bug(span, msg);
678 self.mk_const(ty::ConstKind::Error(reported), ty)
681 pub fn consider_optimizing<T: Fn() -> String>(self, msg: T) -> bool {
682 let cname = self.crate_name(LOCAL_CRATE);
683 self.sess.consider_optimizing(cname.as_str(), msg)
686 /// Obtain all lang items of this crate and all dependencies (recursively)
687 pub fn lang_items(self) -> &'tcx rustc_hir::lang_items::LanguageItems {
688 self.get_lang_items(())
691 /// Obtain the given diagnostic item's `DefId`. Use `is_diagnostic_item` if you just want to
692 /// compare against another `DefId`, since `is_diagnostic_item` is cheaper.
693 pub fn get_diagnostic_item(self, name: Symbol) -> Option<DefId> {
694 self.all_diagnostic_items(()).name_to_id.get(&name).copied()
697 /// Obtain the diagnostic item's name
698 pub fn get_diagnostic_name(self, id: DefId) -> Option<Symbol> {
699 self.diagnostic_items(id.krate).id_to_name.get(&id).copied()
702 /// Check whether the diagnostic item with the given `name` has the given `DefId`.
703 pub fn is_diagnostic_item(self, name: Symbol, did: DefId) -> bool {
704 self.diagnostic_items(did.krate).name_to_id.get(&name) == Some(&did)
707 /// Returns `true` if the node pointed to by `def_id` is a generator for an async construct.
708 pub fn generator_is_async(self, def_id: DefId) -> bool {
709 matches!(self.generator_kind(def_id), Some(hir::GeneratorKind::Async(_)))
712 pub fn stability(self) -> &'tcx stability::Index {
713 self.stability_index(())
716 pub fn features(self) -> &'tcx rustc_feature::Features {
717 self.features_query(())
720 pub fn def_key(self, id: DefId) -> rustc_hir::definitions::DefKey {
721 // Accessing the DefKey is ok, since it is part of DefPathHash.
722 if let Some(id) = id.as_local() {
723 self.definitions_untracked().def_key(id)
725 self.untracked.cstore.def_key(id)
729 /// Converts a `DefId` into its fully expanded `DefPath` (every
730 /// `DefId` is really just an interned `DefPath`).
732 /// Note that if `id` is not local to this crate, the result will
733 /// be a non-local `DefPath`.
734 pub fn def_path(self, id: DefId) -> rustc_hir::definitions::DefPath {
735 // Accessing the DefPath is ok, since it is part of DefPathHash.
736 if let Some(id) = id.as_local() {
737 self.definitions_untracked().def_path(id)
739 self.untracked.cstore.def_path(id)
744 pub fn def_path_hash(self, def_id: DefId) -> rustc_hir::definitions::DefPathHash {
745 // Accessing the DefPathHash is ok, it is incr. comp. stable.
746 if let Some(def_id) = def_id.as_local() {
747 self.definitions_untracked().def_path_hash(def_id)
749 self.untracked.cstore.def_path_hash(def_id)
754 pub fn stable_crate_id(self, crate_num: CrateNum) -> StableCrateId {
755 if crate_num == LOCAL_CRATE {
756 self.sess.local_stable_crate_id()
758 self.untracked.cstore.stable_crate_id(crate_num)
762 /// Maps a StableCrateId to the corresponding CrateNum. This method assumes
763 /// that the crate in question has already been loaded by the CrateStore.
765 pub fn stable_crate_id_to_crate_num(self, stable_crate_id: StableCrateId) -> CrateNum {
766 if stable_crate_id == self.sess.local_stable_crate_id() {
769 self.untracked.cstore.stable_crate_id_to_crate_num(stable_crate_id)
773 /// Converts a `DefPathHash` to its corresponding `DefId` in the current compilation
774 /// session, if it still exists. This is used during incremental compilation to
775 /// turn a deserialized `DefPathHash` into its current `DefId`.
776 pub fn def_path_hash_to_def_id(self, hash: DefPathHash, err: &mut dyn FnMut() -> !) -> DefId {
777 debug!("def_path_hash_to_def_id({:?})", hash);
779 let stable_crate_id = hash.stable_crate_id();
781 // If this is a DefPathHash from the local crate, we can look up the
782 // DefId in the tcx's `Definitions`.
783 if stable_crate_id == self.sess.local_stable_crate_id() {
784 self.untracked.definitions.read().local_def_path_hash_to_def_id(hash, err).to_def_id()
786 // If this is a DefPathHash from an upstream crate, let the CrateStore map
788 let cstore = &*self.untracked.cstore;
789 let cnum = cstore.stable_crate_id_to_crate_num(stable_crate_id);
790 cstore.def_path_hash_to_def_id(cnum, hash)
794 pub fn def_path_debug_str(self, def_id: DefId) -> String {
795 // We are explicitly not going through queries here in order to get
796 // crate name and stable crate id since this code is called from debug!()
797 // statements within the query system and we'd run into endless
798 // recursion otherwise.
799 let (crate_name, stable_crate_id) = if def_id.is_local() {
800 (self.crate_name(LOCAL_CRATE), self.sess.local_stable_crate_id())
802 let cstore = &*self.untracked.cstore;
803 (cstore.crate_name(def_id.krate), cstore.stable_crate_id(def_id.krate))
809 // Don't print the whole stable crate id. That's just
810 // annoying in debug output.
811 stable_crate_id.to_u64() >> 8 * 6,
812 self.def_path(def_id).to_string_no_crate_verbose()
817 impl<'tcx> TyCtxtAt<'tcx> {
818 /// Create a new definition within the incr. comp. engine.
822 data: hir::definitions::DefPathData,
823 ) -> TyCtxtFeed<'tcx, LocalDefId> {
824 // This function modifies `self.definitions` using a side-effect.
825 // We need to ensure that these side effects are re-run by the incr. comp. engine.
826 // Depending on the forever-red node will tell the graph that the calling query
827 // needs to be re-evaluated.
828 self.dep_graph.read_index(DepNodeIndex::FOREVER_RED_NODE);
830 // The following call has the side effect of modifying the tables inside `definitions`.
831 // These very tables are relied on by the incr. comp. engine to decode DepNodes and to
832 // decode the on-disk cache.
834 // Any LocalDefId which is used within queries, either as key or result, either:
835 // - has been created before the construction of the TyCtxt;
836 // - has been created by this call to `create_def`.
837 // As a consequence, this LocalDefId is always re-created before it is needed by the incr.
838 // comp. engine itself.
840 // This call also writes to the value of `source_span` and `expn_that_defined` queries.
841 // This is fine because:
842 // - those queries are `eval_always` so we won't miss their result changing;
843 // - this write will have happened before these queries are called.
844 let key = self.untracked.definitions.write().create_def(parent, data);
846 let feed = TyCtxtFeed { tcx: self.tcx, key };
847 feed.def_span(self.span);
852 impl<'tcx> TyCtxt<'tcx> {
853 pub fn iter_local_def_id(self) -> impl Iterator<Item = LocalDefId> + 'tcx {
854 // Create a dependency to the red node to be sure we re-execute this when the amount of
855 // definitions change.
856 self.dep_graph.read_index(DepNodeIndex::FOREVER_RED_NODE);
858 let definitions = &self.untracked.definitions;
859 std::iter::from_generator(|| {
862 // Recompute the number of definitions each time, because our caller may be creating
864 while i < { definitions.read().num_definitions() } {
865 let local_def_index = rustc_span::def_id::DefIndex::from_usize(i);
866 yield LocalDefId { local_def_index };
870 // Leak a read lock once we finish iterating on definitions, to prevent adding new ones.
875 pub fn def_path_table(self) -> &'tcx rustc_hir::definitions::DefPathTable {
876 // Create a dependency to the crate to be sure we re-execute this when the amount of
877 // definitions change.
878 self.dep_graph.read_index(DepNodeIndex::FOREVER_RED_NODE);
880 // Leak a read lock once we start iterating on definitions, to prevent adding new ones
881 // while iterating. If some query needs to add definitions, it should be `ensure`d above.
882 let definitions = self.untracked.definitions.leak();
883 definitions.def_path_table()
886 pub fn def_path_hash_to_def_index_map(
888 ) -> &'tcx rustc_hir::def_path_hash_map::DefPathHashMap {
889 // Create a dependency to the crate to be sure we re-execute this when the amount of
890 // definitions change.
891 self.ensure().hir_crate(());
892 // Leak a read lock once we start iterating on definitions, to prevent adding new ones
893 // while iterating. If some query needs to add definitions, it should be `ensure`d above.
894 let definitions = self.untracked.definitions.leak();
895 definitions.def_path_hash_to_def_index_map()
898 /// Note that this is *untracked* and should only be used within the query
899 /// system if the result is otherwise tracked through queries
900 pub fn cstore_untracked(self) -> &'tcx CrateStoreDyn {
901 &*self.untracked.cstore
904 /// Note that this is *untracked* and should only be used within the query
905 /// system if the result is otherwise tracked through queries
907 pub fn definitions_untracked(self) -> ReadGuard<'tcx, Definitions> {
908 self.untracked.definitions.read()
911 /// Note that this is *untracked* and should only be used within the query
912 /// system if the result is otherwise tracked through queries
914 pub fn source_span_untracked(self, def_id: LocalDefId) -> Span {
915 self.untracked.source_span.get(def_id).copied().unwrap_or(DUMMY_SP)
919 pub fn with_stable_hashing_context<R>(
921 f: impl FnOnce(StableHashingContext<'_>) -> R,
923 f(StableHashingContext::new(self.sess, &self.untracked))
926 pub fn serialize_query_result_cache(self, encoder: FileEncoder) -> FileEncodeResult {
927 self.on_disk_cache.as_ref().map_or(Ok(0), |c| c.serialize(self, encoder))
930 /// If `true`, we should use lazy normalization for constants, otherwise
931 /// we still evaluate them eagerly.
933 pub fn lazy_normalization(self) -> bool {
934 let features = self.features();
935 // Note: We only use lazy normalization for generic const expressions.
936 features.generic_const_exprs
940 pub fn local_crate_exports_generics(self) -> bool {
941 debug_assert!(self.sess.opts.share_generics());
943 self.sess.crate_types().iter().any(|crate_type| {
945 CrateType::Executable
946 | CrateType::Staticlib
947 | CrateType::ProcMacro
948 | CrateType::Cdylib => false,
950 // FIXME rust-lang/rust#64319, rust-lang/rust#64872:
951 // We want to block export of generics from dylibs,
952 // but we must fix rust-lang/rust#65890 before we can
954 CrateType::Dylib => true,
956 CrateType::Rlib => true,
961 /// Returns the `DefId` and the `BoundRegionKind` corresponding to the given region.
962 pub fn is_suitable_region(self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
963 let (suitable_region_binding_scope, bound_region) = match *region {
964 ty::ReFree(ref free_region) => {
965 (free_region.scope.expect_local(), free_region.bound_region)
967 ty::ReEarlyBound(ref ebr) => (
968 self.local_parent(ebr.def_id.expect_local()),
969 ty::BoundRegionKind::BrNamed(ebr.def_id, ebr.name),
971 _ => return None, // not a free region
974 let is_impl_item = match self.hir().find_by_def_id(suitable_region_binding_scope) {
975 Some(Node::Item(..) | Node::TraitItem(..)) => false,
976 Some(Node::ImplItem(..)) => {
977 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
982 Some(FreeRegionInfo {
983 def_id: suitable_region_binding_scope,
984 boundregion: bound_region,
989 /// Given a `DefId` for an `fn`, return all the `dyn` and `impl` traits in its return type.
990 pub fn return_type_impl_or_dyn_traits(
992 scope_def_id: LocalDefId,
993 ) -> Vec<&'tcx hir::Ty<'tcx>> {
994 let hir_id = self.hir().local_def_id_to_hir_id(scope_def_id);
995 let Some(hir::FnDecl { output: hir::FnRetTy::Return(hir_output), .. }) = self.hir().fn_decl_by_hir_id(hir_id) else {
999 let mut v = TraitObjectVisitor(vec![], self.hir());
1000 v.visit_ty(hir_output);
1004 /// Given a `DefId` for an `fn`, return all the `dyn` and `impl` traits in its return type and associated alias span when type alias is used
1005 pub fn return_type_impl_or_dyn_traits_with_type_alias(
1007 scope_def_id: LocalDefId,
1008 ) -> Option<(Vec<&'tcx hir::Ty<'tcx>>, Span)> {
1009 let hir_id = self.hir().local_def_id_to_hir_id(scope_def_id);
1010 let mut v = TraitObjectVisitor(vec![], self.hir());
1011 // when the return type is a type alias
1012 if let Some(hir::FnDecl { output: hir::FnRetTy::Return(hir_output), .. }) = self.hir().fn_decl_by_hir_id(hir_id)
1013 && let hir::TyKind::Path(hir::QPath::Resolved(
1015 hir::Path { res: hir::def::Res::Def(DefKind::TyAlias, def_id), .. }, )) = hir_output.kind
1016 && let Some(local_id) = def_id.as_local()
1017 && let Some(alias_ty) = self.hir().get_by_def_id(local_id).alias_ty() // it is type alias
1018 && let Some(alias_generics) = self.hir().get_by_def_id(local_id).generics()
1020 v.visit_ty(alias_ty);
1021 if !v.0.is_empty() {
1022 return Some((v.0, alias_generics.span));
1028 pub fn return_type_impl_trait(self, scope_def_id: LocalDefId) -> Option<(Ty<'tcx>, Span)> {
1029 // `type_of()` will fail on these (#55796, #86483), so only allow `fn`s or closures.
1030 match self.hir().get_by_def_id(scope_def_id) {
1031 Node::Item(&hir::Item { kind: ItemKind::Fn(..), .. }) => {}
1032 Node::TraitItem(&hir::TraitItem { kind: TraitItemKind::Fn(..), .. }) => {}
1033 Node::ImplItem(&hir::ImplItem { kind: ImplItemKind::Fn(..), .. }) => {}
1034 Node::Expr(&hir::Expr { kind: ExprKind::Closure { .. }, .. }) => {}
1038 let ret_ty = self.type_of(scope_def_id);
1039 match ret_ty.kind() {
1040 ty::FnDef(_, _) => {
1041 let sig = ret_ty.fn_sig(self);
1042 let output = self.erase_late_bound_regions(sig.output());
1043 if output.is_impl_trait() {
1044 let hir_id = self.hir().local_def_id_to_hir_id(scope_def_id);
1045 let fn_decl = self.hir().fn_decl_by_hir_id(hir_id).unwrap();
1046 Some((output, fn_decl.output.span()))
1055 /// Checks if the bound region is in Impl Item.
1056 pub fn is_bound_region_in_impl_item(self, suitable_region_binding_scope: LocalDefId) -> bool {
1057 let container_id = self.parent(suitable_region_binding_scope.to_def_id());
1058 if self.impl_trait_ref(container_id).is_some() {
1059 // For now, we do not try to target impls of traits. This is
1060 // because this message is going to suggest that the user
1061 // change the fn signature, but they may not be free to do so,
1062 // since the signature must match the trait.
1064 // FIXME(#42706) -- in some cases, we could do better here.
1070 /// Determines whether identifiers in the assembly have strict naming rules.
1071 /// Currently, only NVPTX* targets need it.
1072 pub fn has_strict_asm_symbol_naming(self) -> bool {
1073 self.sess.target.arch.contains("nvptx")
1076 /// Returns `&'static core::panic::Location<'static>`.
1077 pub fn caller_location_ty(self) -> Ty<'tcx> {
1079 self.lifetimes.re_static,
1080 self.bound_type_of(self.require_lang_item(LangItem::PanicLocation, None))
1081 .subst(self, self.mk_substs([self.lifetimes.re_static.into()].iter())),
1085 /// Returns a displayable description and article for the given `def_id` (e.g. `("a", "struct")`).
1086 pub fn article_and_description(self, def_id: DefId) -> (&'static str, &'static str) {
1087 match self.def_kind(def_id) {
1088 DefKind::Generator => match self.generator_kind(def_id).unwrap() {
1089 rustc_hir::GeneratorKind::Async(..) => ("an", "async closure"),
1090 rustc_hir::GeneratorKind::Gen => ("a", "generator"),
1092 def_kind => (def_kind.article(), def_kind.descr(def_id)),
1096 pub fn type_length_limit(self) -> Limit {
1097 self.limits(()).type_length_limit
1100 pub fn recursion_limit(self) -> Limit {
1101 self.limits(()).recursion_limit
1104 pub fn move_size_limit(self) -> Limit {
1105 self.limits(()).move_size_limit
1108 pub fn const_eval_limit(self) -> Limit {
1109 if self.sess.opts.unstable_opts.tiny_const_eval_limit {
1110 TINY_CONST_EVAL_LIMIT
1112 self.limits(()).const_eval_limit
1116 pub fn all_traits(self) -> impl Iterator<Item = DefId> + 'tcx {
1117 iter::once(LOCAL_CRATE)
1118 .chain(self.crates(()).iter().copied())
1119 .flat_map(move |cnum| self.traits_in_crate(cnum).iter().copied())
1123 pub fn local_visibility(self, def_id: LocalDefId) -> Visibility {
1124 self.visibility(def_id).expect_local()
1128 /// A trait implemented for all `X<'a>` types that can be safely and
1129 /// efficiently converted to `X<'tcx>` as long as they are part of the
1130 /// provided `TyCtxt<'tcx>`.
1131 /// This can be done, for example, for `Ty<'tcx>` or `SubstsRef<'tcx>`
1132 /// by looking them up in their respective interners.
1134 /// However, this is still not the best implementation as it does
1135 /// need to compare the components, even for interned values.
1136 /// It would be more efficient if `TypedArena` provided a way to
1137 /// determine whether the address is in the allocated range.
1139 /// `None` is returned if the value or one of the components is not part
1140 /// of the provided context.
1141 /// For `Ty`, `None` can be returned if either the type interner doesn't
1142 /// contain the `TyKind` key or if the address of the interned
1143 /// pointer differs. The latter case is possible if a primitive type,
1144 /// e.g., `()` or `u8`, was interned in a different context.
1145 pub trait Lift<'tcx>: fmt::Debug {
1146 type Lifted: fmt::Debug + 'tcx;
1147 fn lift_to_tcx(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>;
1150 macro_rules! nop_lift {
1151 ($set:ident; $ty:ty => $lifted:ty) => {
1152 impl<'a, 'tcx> Lift<'tcx> for $ty {
1153 type Lifted = $lifted;
1154 fn lift_to_tcx(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted> {
1155 if tcx.interners.$set.contains_pointer_to(&InternedInSet(&*self.0.0)) {
1156 // SAFETY: `self` is interned and therefore valid
1157 // for the entire lifetime of the `TyCtxt`.
1158 Some(unsafe { mem::transmute(self) })
1167 // Can't use the macros as we have reuse the `substs` here.
1169 // See `intern_type_list` for more info.
1170 impl<'a, 'tcx> Lift<'tcx> for &'a List<Ty<'a>> {
1171 type Lifted = &'tcx List<Ty<'tcx>>;
1172 fn lift_to_tcx(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted> {
1173 if self.is_empty() {
1174 return Some(List::empty());
1176 if tcx.interners.substs.contains_pointer_to(&InternedInSet(self.as_substs())) {
1177 // SAFETY: `self` is interned and therefore valid
1178 // for the entire lifetime of the `TyCtxt`.
1179 Some(unsafe { mem::transmute::<&'a List<Ty<'a>>, &'tcx List<Ty<'tcx>>>(self) })
1186 macro_rules! nop_list_lift {
1187 ($set:ident; $ty:ty => $lifted:ty) => {
1188 impl<'a, 'tcx> Lift<'tcx> for &'a List<$ty> {
1189 type Lifted = &'tcx List<$lifted>;
1190 fn lift_to_tcx(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted> {
1191 if self.is_empty() {
1192 return Some(List::empty());
1194 if tcx.interners.$set.contains_pointer_to(&InternedInSet(self)) {
1195 Some(unsafe { mem::transmute(self) })
1204 nop_lift! {type_; Ty<'a> => Ty<'tcx>}
1205 nop_lift! {region; Region<'a> => Region<'tcx>}
1206 nop_lift! {const_; Const<'a> => Const<'tcx>}
1207 nop_lift! {const_allocation; ConstAllocation<'a> => ConstAllocation<'tcx>}
1208 nop_lift! {predicate; Predicate<'a> => Predicate<'tcx>}
1210 nop_list_lift! {poly_existential_predicates; PolyExistentialPredicate<'a> => PolyExistentialPredicate<'tcx>}
1211 nop_list_lift! {predicates; Predicate<'a> => Predicate<'tcx>}
1212 nop_list_lift! {canonical_var_infos; CanonicalVarInfo<'a> => CanonicalVarInfo<'tcx>}
1213 nop_list_lift! {projs; ProjectionKind => ProjectionKind}
1214 nop_list_lift! {bound_variable_kinds; ty::BoundVariableKind => ty::BoundVariableKind}
1216 // This is the impl for `&'a InternalSubsts<'a>`.
1217 nop_list_lift! {substs; GenericArg<'a> => GenericArg<'tcx>}
1219 CloneLiftImpls! { for<'tcx> {
1220 Constness, traits::WellFormedLoc, ImplPolarity, crate::mir::ReturnConstraint,
1223 macro_rules! sty_debug_print {
1224 ($fmt: expr, $ctxt: expr, $($variant: ident),*) => {{
1225 // Curious inner module to allow variant names to be used as
1227 #[allow(non_snake_case)]
1229 use crate::ty::{self, TyCtxt};
1230 use crate::ty::context::InternedInSet;
1232 #[derive(Copy, Clone)]
1241 pub fn go(fmt: &mut std::fmt::Formatter<'_>, tcx: TyCtxt<'_>) -> std::fmt::Result {
1242 let mut total = DebugStat {
1249 $(let mut $variant = total;)*
1251 let shards = tcx.interners.type_.lock_shards();
1252 let types = shards.iter().flat_map(|shard| shard.keys());
1253 for &InternedInSet(t) in types {
1254 let variant = match t.internee {
1255 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
1256 ty::Float(..) | ty::Str | ty::Never => continue,
1257 ty::Error(_) => /* unimportant */ continue,
1258 $(ty::$variant(..) => &mut $variant,)*
1260 let lt = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
1261 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
1262 let ct = t.flags.intersects(ty::TypeFlags::HAS_CT_INFER);
1266 if lt { total.lt_infer += 1; variant.lt_infer += 1 }
1267 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
1268 if ct { total.ct_infer += 1; variant.ct_infer += 1 }
1269 if lt && ty && ct { total.all_infer += 1; variant.all_infer += 1 }
1271 writeln!(fmt, "Ty interner total ty lt ct all")?;
1272 $(writeln!(fmt, " {:18}: {uses:6} {usespc:4.1}%, \
1273 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
1274 stringify!($variant),
1275 uses = $variant.total,
1276 usespc = $variant.total as f64 * 100.0 / total.total as f64,
1277 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
1278 lt = $variant.lt_infer as f64 * 100.0 / total.total as f64,
1279 ct = $variant.ct_infer as f64 * 100.0 / total.total as f64,
1280 all = $variant.all_infer as f64 * 100.0 / total.total as f64)?;
1282 writeln!(fmt, " total {uses:6} \
1283 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
1285 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
1286 lt = total.lt_infer as f64 * 100.0 / total.total as f64,
1287 ct = total.ct_infer as f64 * 100.0 / total.total as f64,
1288 all = total.all_infer as f64 * 100.0 / total.total as f64)
1292 inner::go($fmt, $ctxt)
1296 impl<'tcx> TyCtxt<'tcx> {
1297 pub fn debug_stats(self) -> impl std::fmt::Debug + 'tcx {
1298 struct DebugStats<'tcx>(TyCtxt<'tcx>);
1300 impl<'tcx> std::fmt::Debug for DebugStats<'tcx> {
1301 fn fmt(&self, fmt: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
1315 GeneratorWitnessMIR,
1326 writeln!(fmt, "InternalSubsts interner: #{}", self.0.interners.substs.len())?;
1327 writeln!(fmt, "Region interner: #{}", self.0.interners.region.len())?;
1330 "Const Allocation interner: #{}",
1331 self.0.interners.const_allocation.len()
1333 writeln!(fmt, "Layout interner: #{}", self.0.interners.layout.len())?;
1343 // This type holds a `T` in the interner. The `T` is stored in the arena and
1344 // this type just holds a pointer to it, but it still effectively owns it. It
1345 // impls `Borrow` so that it can be looked up using the original
1346 // (non-arena-memory-owning) types.
1347 struct InternedInSet<'tcx, T: ?Sized>(&'tcx T);
1349 impl<'tcx, T: 'tcx + ?Sized> Clone for InternedInSet<'tcx, T> {
1350 fn clone(&self) -> Self {
1351 InternedInSet(self.0)
1355 impl<'tcx, T: 'tcx + ?Sized> Copy for InternedInSet<'tcx, T> {}
1357 impl<'tcx, T: 'tcx + ?Sized> IntoPointer for InternedInSet<'tcx, T> {
1358 fn into_pointer(&self) -> *const () {
1359 self.0 as *const _ as *const ()
1363 #[allow(rustc::usage_of_ty_tykind)]
1364 impl<'tcx, T> Borrow<T> for InternedInSet<'tcx, WithCachedTypeInfo<T>> {
1365 fn borrow(&self) -> &T {
1370 impl<'tcx, T: PartialEq> PartialEq for InternedInSet<'tcx, WithCachedTypeInfo<T>> {
1371 fn eq(&self, other: &InternedInSet<'tcx, WithCachedTypeInfo<T>>) -> bool {
1372 // The `Borrow` trait requires that `x.borrow() == y.borrow()` equals
1374 self.0.internee == other.0.internee
1378 impl<'tcx, T: Eq> Eq for InternedInSet<'tcx, WithCachedTypeInfo<T>> {}
1380 impl<'tcx, T: Hash> Hash for InternedInSet<'tcx, WithCachedTypeInfo<T>> {
1381 fn hash<H: Hasher>(&self, s: &mut H) {
1382 // The `Borrow` trait requires that `x.borrow().hash(s) == x.hash(s)`.
1383 self.0.internee.hash(s)
1387 impl<'tcx, T> Borrow<[T]> for InternedInSet<'tcx, List<T>> {
1388 fn borrow(&self) -> &[T] {
1393 impl<'tcx, T: PartialEq> PartialEq for InternedInSet<'tcx, List<T>> {
1394 fn eq(&self, other: &InternedInSet<'tcx, List<T>>) -> bool {
1395 // The `Borrow` trait requires that `x.borrow() == y.borrow()` equals
1397 self.0[..] == other.0[..]
1401 impl<'tcx, T: Eq> Eq for InternedInSet<'tcx, List<T>> {}
1403 impl<'tcx, T: Hash> Hash for InternedInSet<'tcx, List<T>> {
1404 fn hash<H: Hasher>(&self, s: &mut H) {
1405 // The `Borrow` trait requires that `x.borrow().hash(s) == x.hash(s)`.
1410 macro_rules! direct_interners {
1411 ($($name:ident: $method:ident($ty:ty): $ret_ctor:ident -> $ret_ty:ty,)+) => {
1412 $(impl<'tcx> Borrow<$ty> for InternedInSet<'tcx, $ty> {
1413 fn borrow<'a>(&'a self) -> &'a $ty {
1418 impl<'tcx> PartialEq for InternedInSet<'tcx, $ty> {
1419 fn eq(&self, other: &Self) -> bool {
1420 // The `Borrow` trait requires that `x.borrow() == y.borrow()`
1426 impl<'tcx> Eq for InternedInSet<'tcx, $ty> {}
1428 impl<'tcx> Hash for InternedInSet<'tcx, $ty> {
1429 fn hash<H: Hasher>(&self, s: &mut H) {
1430 // The `Borrow` trait requires that `x.borrow().hash(s) ==
1436 impl<'tcx> TyCtxt<'tcx> {
1437 pub fn $method(self, v: $ty) -> $ret_ty {
1438 $ret_ctor(Interned::new_unchecked(self.interners.$name.intern(v, |v| {
1439 InternedInSet(self.interners.arena.alloc(v))
1447 region: mk_region(RegionKind<'tcx>): Region -> Region<'tcx>,
1448 const_: mk_const_internal(ConstData<'tcx>): Const -> Const<'tcx>,
1449 const_allocation: intern_const_alloc(Allocation): ConstAllocation -> ConstAllocation<'tcx>,
1450 layout: intern_layout(LayoutS<VariantIdx>): Layout -> Layout<'tcx>,
1451 adt_def: intern_adt_def(AdtDefData): AdtDef -> AdtDef<'tcx>,
1454 macro_rules! slice_interners {
1455 ($($field:ident: $method:ident($ty:ty)),+ $(,)?) => (
1456 impl<'tcx> TyCtxt<'tcx> {
1457 $(pub fn $method(self, v: &[$ty]) -> &'tcx List<$ty> {
1458 self.interners.$field.intern_ref(v, || {
1459 InternedInSet(List::from_arena(&*self.arena, v))
1467 const_lists: _intern_const_list(Const<'tcx>),
1468 substs: _intern_substs(GenericArg<'tcx>),
1469 canonical_var_infos: _intern_canonical_var_infos(CanonicalVarInfo<'tcx>),
1470 poly_existential_predicates:
1471 _intern_poly_existential_predicates(PolyExistentialPredicate<'tcx>),
1472 predicates: _intern_predicates(Predicate<'tcx>),
1473 projs: _intern_projs(ProjectionKind),
1474 place_elems: _intern_place_elems(PlaceElem<'tcx>),
1475 bound_variable_kinds: _intern_bound_variable_kinds(ty::BoundVariableKind),
1478 impl<'tcx> TyCtxt<'tcx> {
1479 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
1480 /// that is, a `fn` type that is equivalent in every way for being
1482 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
1483 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
1484 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig { unsafety: hir::Unsafety::Unsafe, ..sig }))
1487 /// Given the def_id of a Trait `trait_def_id` and the name of an associated item `assoc_name`
1488 /// returns true if the `trait_def_id` defines an associated item of name `assoc_name`.
1489 pub fn trait_may_define_assoc_type(self, trait_def_id: DefId, assoc_name: Ident) -> bool {
1490 self.super_traits_of(trait_def_id).any(|trait_did| {
1491 self.associated_items(trait_did)
1492 .find_by_name_and_kind(self, assoc_name, ty::AssocKind::Type, trait_did)
1497 /// Given a `ty`, return whether it's an `impl Future<...>`.
1498 pub fn ty_is_opaque_future(self, ty: Ty<'_>) -> bool {
1499 let ty::Alias(ty::Opaque, ty::AliasTy { def_id, .. }) = ty.kind() else { return false };
1500 let future_trait = self.require_lang_item(LangItem::Future, None);
1502 self.explicit_item_bounds(def_id).iter().any(|(predicate, _)| {
1503 let ty::PredicateKind::Clause(ty::Clause::Trait(trait_predicate)) = predicate.kind().skip_binder() else {
1506 trait_predicate.trait_ref.def_id == future_trait
1507 && trait_predicate.polarity == ImplPolarity::Positive
1511 /// Computes the def-ids of the transitive supertraits of `trait_def_id`. This (intentionally)
1512 /// does not compute the full elaborated super-predicates but just the set of def-ids. It is used
1513 /// to identify which traits may define a given associated type to help avoid cycle errors.
1514 /// Returns a `DefId` iterator.
1515 fn super_traits_of(self, trait_def_id: DefId) -> impl Iterator<Item = DefId> + 'tcx {
1516 let mut set = FxHashSet::default();
1517 let mut stack = vec![trait_def_id];
1519 set.insert(trait_def_id);
1521 iter::from_fn(move || -> Option<DefId> {
1522 let trait_did = stack.pop()?;
1523 let generic_predicates = self.super_predicates_of(trait_did);
1525 for (predicate, _) in generic_predicates.predicates {
1526 if let ty::PredicateKind::Clause(ty::Clause::Trait(data)) =
1527 predicate.kind().skip_binder()
1529 if set.insert(data.def_id()) {
1530 stack.push(data.def_id());
1539 /// Given a closure signature, returns an equivalent fn signature. Detuples
1540 /// and so forth -- so e.g., if we have a sig with `Fn<(u32, i32)>` then
1541 /// you would get a `fn(u32, i32)`.
1542 /// `unsafety` determines the unsafety of the fn signature. If you pass
1543 /// `hir::Unsafety::Unsafe` in the previous example, then you would get
1544 /// an `unsafe fn (u32, i32)`.
1545 /// It cannot convert a closure that requires unsafe.
1546 pub fn signature_unclosure(
1548 sig: PolyFnSig<'tcx>,
1549 unsafety: hir::Unsafety,
1550 ) -> PolyFnSig<'tcx> {
1552 let params_iter = match s.inputs()[0].kind() {
1553 ty::Tuple(params) => params.into_iter(),
1556 self.mk_fn_sig(params_iter, s.output(), s.c_variadic, unsafety, abi::Abi::Rust)
1560 /// Same a `self.mk_region(kind)`, but avoids accessing the interners if
1563 pub fn reuse_or_mk_region(self, r: Region<'tcx>, kind: RegionKind<'tcx>) -> Region<'tcx> {
1564 if *r == kind { r } else { self.mk_region(kind) }
1567 #[allow(rustc::usage_of_ty_tykind)]
1569 pub fn mk_ty(self, st: TyKind<'tcx>) -> Ty<'tcx> {
1570 self.interners.intern_ty(
1573 // This is only used to create a stable hashing context.
1579 pub fn mk_predicate(self, binder: Binder<'tcx, PredicateKind<'tcx>>) -> Predicate<'tcx> {
1580 self.interners.intern_predicate(
1583 // This is only used to create a stable hashing context.
1589 pub fn reuse_or_mk_predicate(
1591 pred: Predicate<'tcx>,
1592 binder: Binder<'tcx, PredicateKind<'tcx>>,
1593 ) -> Predicate<'tcx> {
1594 if pred.kind() != binder { self.mk_predicate(binder) } else { pred }
1597 pub fn mk_mach_int(self, tm: IntTy) -> Ty<'tcx> {
1599 IntTy::Isize => self.types.isize,
1600 IntTy::I8 => self.types.i8,
1601 IntTy::I16 => self.types.i16,
1602 IntTy::I32 => self.types.i32,
1603 IntTy::I64 => self.types.i64,
1604 IntTy::I128 => self.types.i128,
1608 pub fn mk_mach_uint(self, tm: UintTy) -> Ty<'tcx> {
1610 UintTy::Usize => self.types.usize,
1611 UintTy::U8 => self.types.u8,
1612 UintTy::U16 => self.types.u16,
1613 UintTy::U32 => self.types.u32,
1614 UintTy::U64 => self.types.u64,
1615 UintTy::U128 => self.types.u128,
1619 pub fn mk_mach_float(self, tm: FloatTy) -> Ty<'tcx> {
1621 FloatTy::F32 => self.types.f32,
1622 FloatTy::F64 => self.types.f64,
1627 pub fn mk_static_str(self) -> Ty<'tcx> {
1628 self.mk_imm_ref(self.lifetimes.re_static, self.types.str_)
1632 pub fn mk_adt(self, def: AdtDef<'tcx>, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
1633 // Take a copy of substs so that we own the vectors inside.
1634 self.mk_ty(Adt(def, substs))
1638 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
1639 self.mk_ty(Foreign(def_id))
1642 fn mk_generic_adt(self, wrapper_def_id: DefId, ty_param: Ty<'tcx>) -> Ty<'tcx> {
1643 let adt_def = self.adt_def(wrapper_def_id);
1645 InternalSubsts::for_item(self, wrapper_def_id, |param, substs| match param.kind {
1646 GenericParamDefKind::Lifetime | GenericParamDefKind::Const { .. } => bug!(),
1647 GenericParamDefKind::Type { has_default, .. } => {
1648 if param.index == 0 {
1651 assert!(has_default);
1652 self.bound_type_of(param.def_id).subst(self, substs).into()
1656 self.mk_ty(Adt(adt_def, substs))
1660 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
1661 let def_id = self.require_lang_item(LangItem::OwnedBox, None);
1662 self.mk_generic_adt(def_id, ty)
1666 pub fn mk_lang_item(self, ty: Ty<'tcx>, item: LangItem) -> Option<Ty<'tcx>> {
1667 let def_id = self.lang_items().get(item)?;
1668 Some(self.mk_generic_adt(def_id, ty))
1672 pub fn mk_diagnostic_item(self, ty: Ty<'tcx>, name: Symbol) -> Option<Ty<'tcx>> {
1673 let def_id = self.get_diagnostic_item(name)?;
1674 Some(self.mk_generic_adt(def_id, ty))
1678 pub fn mk_maybe_uninit(self, ty: Ty<'tcx>) -> Ty<'tcx> {
1679 let def_id = self.require_lang_item(LangItem::MaybeUninit, None);
1680 self.mk_generic_adt(def_id, ty)
1684 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
1685 self.mk_ty(RawPtr(tm))
1689 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
1690 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
1694 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
1695 self.mk_ref(r, TypeAndMut { ty, mutbl: hir::Mutability::Mut })
1699 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
1700 self.mk_ref(r, TypeAndMut { ty, mutbl: hir::Mutability::Not })
1704 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
1705 self.mk_ptr(TypeAndMut { ty, mutbl: hir::Mutability::Mut })
1709 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
1710 self.mk_ptr(TypeAndMut { ty, mutbl: hir::Mutability::Not })
1714 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
1715 self.mk_ty(Array(ty, ty::Const::from_usize(self, n)))
1719 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
1720 self.mk_ty(Slice(ty))
1724 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
1725 self.mk_ty(Tuple(self.intern_type_list(&ts)))
1728 pub fn mk_tup<I: InternAs<Ty<'tcx>, Ty<'tcx>>>(self, iter: I) -> I::Output {
1729 iter.intern_with(|ts| self.mk_ty(Tuple(self.intern_type_list(&ts))))
1733 pub fn mk_unit(self) -> Ty<'tcx> {
1738 pub fn mk_diverging_default(self) -> Ty<'tcx> {
1739 if self.features().never_type_fallback { self.types.never } else { self.types.unit }
1746 substs: impl IntoIterator<Item = impl Into<GenericArg<'tcx>>>,
1748 let substs = self.check_substs(def_id, substs);
1749 self.mk_ty(FnDef(def_id, substs))
1756 substs: impl IntoIterator<Item = impl Into<GenericArg<'tcx>>>,
1757 ) -> SubstsRef<'tcx> {
1758 let substs = substs.into_iter().map(Into::into);
1759 #[cfg(debug_assertions)]
1761 let n = self.generics_of(_def_id).count();
1765 "wrong number of generic parameters for {_def_id:?}: {:?}",
1766 substs.collect::<Vec<_>>(),
1769 self.mk_substs(substs)
1773 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
1774 self.mk_ty(FnPtr(fty))
1780 obj: &'tcx List<PolyExistentialPredicate<'tcx>>,
1781 reg: ty::Region<'tcx>,
1784 self.mk_ty(Dynamic(obj, reg, repr))
1788 pub fn mk_projection(
1791 substs: impl IntoIterator<Item = impl Into<GenericArg<'tcx>>>,
1793 self.mk_ty(Alias(ty::Projection, self.mk_alias_ty(item_def_id, substs)))
1797 pub fn mk_closure(self, closure_id: DefId, closure_substs: SubstsRef<'tcx>) -> Ty<'tcx> {
1798 self.mk_ty(Closure(closure_id, closure_substs))
1802 pub fn mk_generator(
1805 generator_substs: SubstsRef<'tcx>,
1806 movability: hir::Movability,
1808 self.mk_ty(Generator(id, generator_substs, movability))
1812 pub fn mk_generator_witness(self, types: ty::Binder<'tcx, &'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
1813 self.mk_ty(GeneratorWitness(types))
1816 /// Creates a `&mut Context<'_>` [`Ty`] with erased lifetimes.
1817 pub fn mk_task_context(self) -> Ty<'tcx> {
1818 let context_did = self.require_lang_item(LangItem::Context, None);
1819 let context_adt_ref = self.adt_def(context_did);
1820 let context_substs = self.intern_substs(&[self.lifetimes.re_erased.into()]);
1821 let context_ty = self.mk_adt(context_adt_ref, context_substs);
1822 self.mk_mut_ref(self.lifetimes.re_erased, context_ty)
1826 pub fn mk_generator_witness_mir(self, id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
1827 self.mk_ty(GeneratorWitnessMIR(id, substs))
1831 pub fn mk_ty_var(self, v: TyVid) -> Ty<'tcx> {
1832 self.mk_ty_infer(TyVar(v))
1836 pub fn mk_const(self, kind: impl Into<ty::ConstKind<'tcx>>, ty: Ty<'tcx>) -> Const<'tcx> {
1837 self.mk_const_internal(ty::ConstData { kind: kind.into(), ty })
1841 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
1842 self.mk_ty_infer(IntVar(v))
1846 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
1847 self.mk_ty_infer(FloatVar(v))
1851 pub fn mk_ty_infer(self, it: InferTy) -> Ty<'tcx> {
1852 self.mk_ty(Infer(it))
1856 pub fn mk_ty_param(self, index: u32, name: Symbol) -> Ty<'tcx> {
1857 self.mk_ty(Param(ParamTy { index, name }))
1860 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> GenericArg<'tcx> {
1862 GenericParamDefKind::Lifetime => {
1863 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
1865 GenericParamDefKind::Type { .. } => self.mk_ty_param(param.index, param.name).into(),
1866 GenericParamDefKind::Const { .. } => self
1868 ParamConst { index: param.index, name: param.name },
1869 self.type_of(param.def_id),
1876 pub fn mk_opaque(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
1877 self.mk_ty(Alias(ty::Opaque, self.mk_alias_ty(def_id, substs)))
1880 pub fn mk_place_field(self, place: Place<'tcx>, f: Field, ty: Ty<'tcx>) -> Place<'tcx> {
1881 self.mk_place_elem(place, PlaceElem::Field(f, ty))
1884 pub fn mk_place_deref(self, place: Place<'tcx>) -> Place<'tcx> {
1885 self.mk_place_elem(place, PlaceElem::Deref)
1888 pub fn mk_place_downcast(
1891 adt_def: AdtDef<'tcx>,
1892 variant_index: VariantIdx,
1896 PlaceElem::Downcast(Some(adt_def.variant(variant_index).name), variant_index),
1900 pub fn mk_place_downcast_unnamed(
1903 variant_index: VariantIdx,
1905 self.mk_place_elem(place, PlaceElem::Downcast(None, variant_index))
1908 pub fn mk_place_index(self, place: Place<'tcx>, index: Local) -> Place<'tcx> {
1909 self.mk_place_elem(place, PlaceElem::Index(index))
1912 /// This method copies `Place`'s projection, add an element and reintern it. Should not be used
1913 /// to build a full `Place` it's just a convenient way to grab a projection and modify it in
1915 pub fn mk_place_elem(self, place: Place<'tcx>, elem: PlaceElem<'tcx>) -> Place<'tcx> {
1916 let mut projection = place.projection.to_vec();
1917 projection.push(elem);
1919 Place { local: place.local, projection: self.intern_place_elems(&projection) }
1922 pub fn intern_poly_existential_predicates(
1924 eps: &[PolyExistentialPredicate<'tcx>],
1925 ) -> &'tcx List<PolyExistentialPredicate<'tcx>> {
1926 assert!(!eps.is_empty());
1929 .all(|[a, b]| a.skip_binder().stable_cmp(self, &b.skip_binder())
1930 != Ordering::Greater)
1932 self._intern_poly_existential_predicates(eps)
1935 pub fn intern_predicates(self, preds: &[Predicate<'tcx>]) -> &'tcx List<Predicate<'tcx>> {
1936 // FIXME consider asking the input slice to be sorted to avoid
1937 // re-interning permutations, in which case that would be asserted
1939 if preds.is_empty() {
1940 // The macro-generated method below asserts we don't intern an empty slice.
1943 self._intern_predicates(preds)
1947 pub fn mk_const_list<I: InternAs<ty::Const<'tcx>, &'tcx List<ty::Const<'tcx>>>>(
1951 iter.intern_with(|xs| self.intern_const_list(xs))
1954 pub fn intern_const_list(self, cs: &[ty::Const<'tcx>]) -> &'tcx List<ty::Const<'tcx>> {
1955 if cs.is_empty() { List::empty() } else { self._intern_const_list(cs) }
1958 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
1962 // Actually intern type lists as lists of `GenericArg`s.
1964 // Transmuting from `Ty<'tcx>` to `GenericArg<'tcx>` is sound
1965 // as explained in ty_slice_as_generic_arg`. With this,
1966 // we guarantee that even when transmuting between `List<Ty<'tcx>>`
1967 // and `List<GenericArg<'tcx>>`, the uniqueness requirement for
1969 let substs = self._intern_substs(ty::subst::ty_slice_as_generic_args(ts));
1970 substs.try_as_type_list().unwrap()
1974 pub fn intern_substs(self, ts: &[GenericArg<'tcx>]) -> &'tcx List<GenericArg<'tcx>> {
1975 if ts.is_empty() { List::empty() } else { self._intern_substs(ts) }
1978 pub fn intern_projs(self, ps: &[ProjectionKind]) -> &'tcx List<ProjectionKind> {
1979 if ps.is_empty() { List::empty() } else { self._intern_projs(ps) }
1982 pub fn intern_place_elems(self, ts: &[PlaceElem<'tcx>]) -> &'tcx List<PlaceElem<'tcx>> {
1983 if ts.is_empty() { List::empty() } else { self._intern_place_elems(ts) }
1986 pub fn intern_canonical_var_infos(
1988 ts: &[CanonicalVarInfo<'tcx>],
1989 ) -> CanonicalVarInfos<'tcx> {
1990 if ts.is_empty() { List::empty() } else { self._intern_canonical_var_infos(ts) }
1993 pub fn intern_bound_variable_kinds(
1995 ts: &[ty::BoundVariableKind],
1996 ) -> &'tcx List<ty::BoundVariableKind> {
1997 if ts.is_empty() { List::empty() } else { self._intern_bound_variable_kinds(ts) }
2000 pub fn mk_fn_sig<I>(
2005 unsafety: hir::Unsafety,
2007 ) -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2009 I: Iterator<Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>,
2011 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2012 inputs_and_output: self.intern_type_list(xs),
2019 pub fn mk_poly_existential_predicates<
2020 I: InternAs<PolyExistentialPredicate<'tcx>, &'tcx List<PolyExistentialPredicate<'tcx>>>,
2025 iter.intern_with(|xs| self.intern_poly_existential_predicates(xs))
2028 pub fn mk_predicates<I: InternAs<Predicate<'tcx>, &'tcx List<Predicate<'tcx>>>>(
2032 iter.intern_with(|xs| self.intern_predicates(xs))
2035 pub fn mk_type_list<I: InternAs<Ty<'tcx>, &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2036 iter.intern_with(|xs| self.intern_type_list(xs))
2039 pub fn mk_substs<I: InternAs<GenericArg<'tcx>, &'tcx List<GenericArg<'tcx>>>>(
2043 iter.intern_with(|xs| self.intern_substs(xs))
2046 pub fn mk_place_elems<I: InternAs<PlaceElem<'tcx>, &'tcx List<PlaceElem<'tcx>>>>(
2050 iter.intern_with(|xs| self.intern_place_elems(xs))
2053 pub fn mk_substs_trait(
2056 rest: impl IntoIterator<Item = GenericArg<'tcx>>,
2057 ) -> SubstsRef<'tcx> {
2058 self.mk_substs(iter::once(self_ty.into()).chain(rest))
2061 pub fn mk_trait_ref(
2063 trait_def_id: DefId,
2064 substs: impl IntoIterator<Item = impl Into<GenericArg<'tcx>>>,
2065 ) -> ty::TraitRef<'tcx> {
2066 let substs = self.check_substs(trait_def_id, substs);
2067 ty::TraitRef { def_id: trait_def_id, substs, _use_mk_trait_ref_instead: () }
2073 substs: impl IntoIterator<Item = impl Into<GenericArg<'tcx>>>,
2074 ) -> ty::AliasTy<'tcx> {
2075 let substs = self.check_substs(def_id, substs);
2076 ty::AliasTy { def_id, substs, _use_mk_alias_ty_instead: () }
2079 pub fn mk_bound_variable_kinds<
2080 I: InternAs<ty::BoundVariableKind, &'tcx List<ty::BoundVariableKind>>,
2085 iter.intern_with(|xs| self.intern_bound_variable_kinds(xs))
2088 /// Emit a lint at `span` from a lint struct (some type that implements `DecorateLint`,
2089 /// typically generated by `#[derive(LintDiagnostic)]`).
2090 pub fn emit_spanned_lint(
2092 lint: &'static Lint,
2094 span: impl Into<MultiSpan>,
2095 decorator: impl for<'a> DecorateLint<'a, ()>,
2097 let msg = decorator.msg();
2098 let (level, src) = self.lint_level_at_node(lint, hir_id);
2099 struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg, |diag| {
2100 decorator.decorate_lint(diag)
2104 /// Emit a lint at the appropriate level for a hir node, with an associated span.
2106 /// Return value of the `decorate` closure is ignored, see [`struct_lint_level`] for a detailed explanation.
2108 /// [`struct_lint_level`]: rustc_middle::lint::struct_lint_level#decorate-signature
2109 #[rustc_lint_diagnostics]
2110 pub fn struct_span_lint_hir(
2112 lint: &'static Lint,
2114 span: impl Into<MultiSpan>,
2115 msg: impl Into<DiagnosticMessage>,
2116 decorate: impl for<'a, 'b> FnOnce(
2117 &'b mut DiagnosticBuilder<'a, ()>,
2118 ) -> &'b mut DiagnosticBuilder<'a, ()>,
2120 let (level, src) = self.lint_level_at_node(lint, hir_id);
2121 struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg, decorate);
2124 /// Emit a lint from a lint struct (some type that implements `DecorateLint`, typically
2125 /// generated by `#[derive(LintDiagnostic)]`).
2128 lint: &'static Lint,
2130 decorator: impl for<'a> DecorateLint<'a, ()>,
2132 self.struct_lint_node(lint, id, decorator.msg(), |diag| decorator.decorate_lint(diag))
2135 /// Emit a lint at the appropriate level for a hir node.
2137 /// Return value of the `decorate` closure is ignored, see [`struct_lint_level`] for a detailed explanation.
2139 /// [`struct_lint_level`]: rustc_middle::lint::struct_lint_level#decorate-signature
2140 #[rustc_lint_diagnostics]
2141 pub fn struct_lint_node(
2143 lint: &'static Lint,
2145 msg: impl Into<DiagnosticMessage>,
2146 decorate: impl for<'a, 'b> FnOnce(
2147 &'b mut DiagnosticBuilder<'a, ()>,
2148 ) -> &'b mut DiagnosticBuilder<'a, ()>,
2150 let (level, src) = self.lint_level_at_node(lint, id);
2151 struct_lint_level(self.sess, lint, level, src, None, msg, decorate);
2154 pub fn in_scope_traits(self, id: HirId) -> Option<&'tcx [TraitCandidate]> {
2155 let map = self.in_scope_traits_map(id.owner)?;
2156 let candidates = map.get(&id.local_id)?;
2160 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2161 debug!(?id, "named_region");
2162 self.named_region_map(id.owner).and_then(|map| map.get(&id.local_id).cloned())
2165 pub fn is_late_bound(self, id: HirId) -> bool {
2166 self.is_late_bound_map(id.owner).map_or(false, |set| set.contains(&id.local_id))
2169 pub fn late_bound_vars(self, id: HirId) -> &'tcx List<ty::BoundVariableKind> {
2170 self.mk_bound_variable_kinds(
2171 self.late_bound_vars_map(id.owner)
2172 .and_then(|map| map.get(&id.local_id).cloned())
2173 .unwrap_or_else(|| {
2174 bug!("No bound vars found for {}", self.hir().node_to_string(id))
2180 /// Whether the `def_id` counts as const fn in the current crate, considering all active
2182 pub fn is_const_fn(self, def_id: DefId) -> bool {
2183 if self.is_const_fn_raw(def_id) {
2184 match self.lookup_const_stability(def_id) {
2185 Some(stability) if stability.is_const_unstable() => {
2186 // has a `rustc_const_unstable` attribute, check whether the user enabled the
2187 // corresponding feature gate.
2189 .declared_lib_features
2191 .any(|&(sym, _)| sym == stability.feature)
2193 // functions without const stability are either stable user written
2194 // const fn or the user is using feature gates and we thus don't
2195 // care what they do
2203 /// Whether the trait impl is marked const. This does not consider stability or feature gates.
2204 pub fn is_const_trait_impl_raw(self, def_id: DefId) -> bool {
2205 let Some(local_def_id) = def_id.as_local() else { return false };
2206 let hir_id = self.local_def_id_to_hir_id(local_def_id);
2207 let node = self.hir().get(hir_id);
2211 hir::Node::Item(hir::Item {
2212 kind: hir::ItemKind::Impl(hir::Impl { constness: hir::Constness::Const, .. }),
2219 impl<'tcx> TyCtxtAt<'tcx> {
2220 /// Constructs a `TyKind::Error` type and registers a `delay_span_bug` to ensure it gets used.
2222 pub fn ty_error(self) -> Ty<'tcx> {
2223 self.tcx.ty_error_with_message(self.span, "TyKind::Error constructed but no error reported")
2226 /// Constructs a `TyKind::Error` type and registers a `delay_span_bug` with the given `msg to
2227 /// ensure it gets used.
2229 pub fn ty_error_with_message(self, msg: &str) -> Ty<'tcx> {
2230 self.tcx.ty_error_with_message(self.span, msg)
2233 pub fn mk_trait_ref(
2235 trait_lang_item: LangItem,
2236 substs: impl IntoIterator<Item = impl Into<ty::GenericArg<'tcx>>>,
2237 ) -> ty::TraitRef<'tcx> {
2238 let trait_def_id = self.require_lang_item(trait_lang_item, Some(self.span));
2239 self.tcx.mk_trait_ref(trait_def_id, substs)
2243 /// Parameter attributes that can only be determined by examining the body of a function instead
2244 /// of just its signature.
2246 /// These can be useful for optimization purposes when a function is directly called. We compute
2247 /// them and store them into the crate metadata so that downstream crates can make use of them.
2249 /// Right now, we only have `read_only`, but `no_capture` and `no_alias` might be useful in the
2251 #[derive(Clone, Copy, PartialEq, Debug, Default, TyDecodable, TyEncodable, HashStable)]
2252 pub struct DeducedParamAttrs {
2253 /// The parameter is marked immutable in the function and contains no `UnsafeCell` (i.e. its
2254 /// type is freeze).
2255 pub read_only: bool,
2258 pub fn provide(providers: &mut ty::query::Providers) {
2259 providers.module_reexports =
2260 |tcx, id| tcx.resolutions(()).reexport_map.get(&id).map(|v| &v[..]);
2261 providers.maybe_unused_trait_imports =
2262 |tcx, ()| &tcx.resolutions(()).maybe_unused_trait_imports;
2263 providers.maybe_unused_extern_crates =
2264 |tcx, ()| &tcx.resolutions(()).maybe_unused_extern_crates[..];
2265 providers.names_imported_by_glob_use = |tcx, id| {
2266 tcx.arena.alloc(tcx.resolutions(()).glob_map.get(&id).cloned().unwrap_or_default())
2269 providers.extern_mod_stmt_cnum =
2270 |tcx, id| tcx.resolutions(()).extern_crate_map.get(&id).cloned();
2271 providers.is_panic_runtime = |tcx, cnum| {
2272 assert_eq!(cnum, LOCAL_CRATE);
2273 tcx.sess.contains_name(tcx.hir().krate_attrs(), sym::panic_runtime)
2275 providers.is_compiler_builtins = |tcx, cnum| {
2276 assert_eq!(cnum, LOCAL_CRATE);
2277 tcx.sess.contains_name(tcx.hir().krate_attrs(), sym::compiler_builtins)
2279 providers.has_panic_handler = |tcx, cnum| {
2280 assert_eq!(cnum, LOCAL_CRATE);
2281 // We want to check if the panic handler was defined in this crate
2282 tcx.lang_items().panic_impl().map_or(false, |did| did.is_local())
2284 providers.source_span =
2285 |tcx, def_id| tcx.untracked.source_span.get(def_id).copied().unwrap_or(DUMMY_SP);