1 //! Type context book-keeping.
3 use crate::arena::Arena;
4 use crate::dep_graph::{self, DepConstructor, DepGraph};
5 use crate::hir::exports::ExportMap;
6 use crate::ich::{NodeIdHashingMode, StableHashingContext};
7 use crate::infer::canonical::{Canonical, CanonicalVarInfo, CanonicalVarInfos};
8 use crate::lint::{struct_lint_level, LintDiagnosticBuilder, LintSource};
10 use crate::middle::cstore::{CrateStoreDyn, EncodedMetadata};
11 use crate::middle::resolve_lifetime::{self, ObjectLifetimeDefault};
12 use crate::middle::stability;
13 use crate::mir::interpret::{self, Allocation, ConstValue, Scalar};
14 use crate::mir::{Body, Field, Local, Place, PlaceElem, ProjectionKind, Promoted};
16 use crate::ty::query::{self, TyCtxtAt};
17 use crate::ty::steal::Steal;
18 use crate::ty::subst::{GenericArg, GenericArgKind, InternalSubsts, Subst, SubstsRef, UserSubsts};
19 use crate::ty::TyKind::*;
21 self, AdtDef, AdtKind, BindingMode, BoundVar, CanonicalPolyFnSig, Const, ConstVid, DefIdTree,
22 ExistentialPredicate, FloatVar, FloatVid, GenericParamDefKind, InferConst, InferTy, IntVar,
23 IntVid, List, ParamConst, ParamTy, PolyFnSig, Predicate, PredicateInner, PredicateKind,
24 ProjectionTy, Region, RegionKind, ReprOptions, TraitObjectVisitor, Ty, TyKind, TyS, TyVar,
25 TyVid, TypeAndMut, Visibility,
28 use rustc_ast::expand::allocator::AllocatorKind;
29 use rustc_attr as attr;
30 use rustc_data_structures::fx::{FxHashMap, FxHashSet};
31 use rustc_data_structures::profiling::SelfProfilerRef;
32 use rustc_data_structures::sharded::{IntoPointer, ShardedHashMap};
33 use rustc_data_structures::stable_hasher::{
34 hash_stable_hashmap, HashStable, StableHasher, StableVec,
36 use rustc_data_structures::sync::{self, Lock, Lrc, WorkerLocal};
37 use rustc_data_structures::unhash::UnhashMap;
38 use rustc_errors::ErrorReported;
40 use rustc_hir::def::{DefKind, Res};
41 use rustc_hir::def_id::{CrateNum, DefId, DefIdMap, LocalDefId, LOCAL_CRATE};
42 use rustc_hir::definitions::{DefPathHash, Definitions};
43 use rustc_hir::intravisit::Visitor;
44 use rustc_hir::lang_items::LangItem;
45 use rustc_hir::{HirId, ItemKind, ItemLocalId, ItemLocalMap, ItemLocalSet, Node, TraitCandidate};
46 use rustc_index::vec::{Idx, IndexVec};
47 use rustc_macros::HashStable;
48 use rustc_session::config::{BorrowckMode, CrateType, OutputFilenames};
49 use rustc_session::lint::{Level, Lint};
50 use rustc_session::Session;
51 use rustc_span::source_map::MultiSpan;
52 use rustc_span::symbol::{kw, sym, Symbol};
53 use rustc_span::{Span, DUMMY_SP};
54 use rustc_target::abi::{Layout, TargetDataLayout, VariantIdx};
55 use rustc_target::spec::abi;
57 use smallvec::SmallVec;
59 use std::borrow::Borrow;
60 use std::cmp::Ordering;
61 use std::collections::hash_map::{self, Entry};
63 use std::hash::{Hash, Hasher};
66 use std::ops::{Bound, Deref};
69 /// A type that is not publicly constructable. This prevents people from making [`TyKind::Error`]s
70 /// except through the error-reporting functions on a [`tcx`][TyCtxt].
71 #[derive(Copy, Clone, Debug, Eq, Hash, PartialEq, PartialOrd, Ord)]
72 #[derive(TyEncodable, TyDecodable, HashStable)]
73 pub struct DelaySpanBugEmitted(());
75 type InternedSet<'tcx, T> = ShardedHashMap<Interned<'tcx, T>, ()>;
77 pub struct CtxtInterners<'tcx> {
78 /// The arena that types, regions, etc. are allocated from.
79 arena: &'tcx WorkerLocal<Arena<'tcx>>,
81 /// Specifically use a speedy hash algorithm for these hash sets, since
82 /// they're accessed quite often.
83 type_: InternedSet<'tcx, TyS<'tcx>>,
84 type_list: InternedSet<'tcx, List<Ty<'tcx>>>,
85 substs: InternedSet<'tcx, InternalSubsts<'tcx>>,
86 canonical_var_infos: InternedSet<'tcx, List<CanonicalVarInfo>>,
87 region: InternedSet<'tcx, RegionKind>,
88 existential_predicates: InternedSet<'tcx, List<ExistentialPredicate<'tcx>>>,
89 predicate: InternedSet<'tcx, PredicateInner<'tcx>>,
90 predicates: InternedSet<'tcx, List<Predicate<'tcx>>>,
91 projs: InternedSet<'tcx, List<ProjectionKind>>,
92 place_elems: InternedSet<'tcx, List<PlaceElem<'tcx>>>,
93 const_: InternedSet<'tcx, Const<'tcx>>,
96 impl<'tcx> CtxtInterners<'tcx> {
97 fn new(arena: &'tcx WorkerLocal<Arena<'tcx>>) -> CtxtInterners<'tcx> {
100 type_: Default::default(),
101 type_list: Default::default(),
102 substs: Default::default(),
103 region: Default::default(),
104 existential_predicates: Default::default(),
105 canonical_var_infos: Default::default(),
106 predicate: Default::default(),
107 predicates: Default::default(),
108 projs: Default::default(),
109 place_elems: Default::default(),
110 const_: Default::default(),
115 #[allow(rustc::usage_of_ty_tykind)]
117 fn intern_ty(&self, kind: TyKind<'tcx>) -> Ty<'tcx> {
119 .intern(kind, |kind| {
120 let flags = super::flags::FlagComputation::for_kind(&kind);
122 let ty_struct = TyS {
125 outer_exclusive_binder: flags.outer_exclusive_binder,
128 Interned(self.arena.alloc(ty_struct))
134 fn intern_predicate(&self, kind: PredicateKind<'tcx>) -> &'tcx PredicateInner<'tcx> {
136 .intern(kind, |kind| {
137 let flags = super::flags::FlagComputation::for_predicate(kind);
139 let predicate_struct = PredicateInner {
142 outer_exclusive_binder: flags.outer_exclusive_binder,
145 Interned(self.arena.alloc(predicate_struct))
151 pub struct CommonTypes<'tcx> {
171 pub self_param: Ty<'tcx>,
173 /// Dummy type used for the `Self` of a `TraitRef` created for converting
174 /// a trait object, and which gets removed in `ExistentialTraitRef`.
175 /// This type must not appear anywhere in other converted types.
176 pub trait_object_dummy_self: Ty<'tcx>,
179 pub struct CommonLifetimes<'tcx> {
180 /// `ReEmpty` in the root universe.
181 pub re_root_empty: Region<'tcx>,
184 pub re_static: Region<'tcx>,
186 /// Erased region, used after type-checking
187 pub re_erased: Region<'tcx>,
190 pub struct CommonConsts<'tcx> {
191 pub unit: &'tcx Const<'tcx>,
194 pub struct LocalTableInContext<'a, V> {
195 hir_owner: LocalDefId,
196 data: &'a ItemLocalMap<V>,
199 /// Validate that the given HirId (respectively its `local_id` part) can be
200 /// safely used as a key in the maps of a TypeckResults. For that to be
201 /// the case, the HirId must have the same `owner` as all the other IDs in
202 /// this table (signified by `hir_owner`). Otherwise the HirId
203 /// would be in a different frame of reference and using its `local_id`
204 /// would result in lookup errors, or worse, in silently wrong data being
206 fn validate_hir_id_for_typeck_results(hir_owner: LocalDefId, hir_id: hir::HirId) {
207 if hir_id.owner != hir_owner {
208 ty::tls::with(|tcx| {
210 "node {} with HirId::owner {:?} cannot be placed in TypeckResults with hir_owner {:?}",
211 tcx.hir().node_to_string(hir_id),
219 impl<'a, V> LocalTableInContext<'a, V> {
220 pub fn contains_key(&self, id: hir::HirId) -> bool {
221 validate_hir_id_for_typeck_results(self.hir_owner, id);
222 self.data.contains_key(&id.local_id)
225 pub fn get(&self, id: hir::HirId) -> Option<&V> {
226 validate_hir_id_for_typeck_results(self.hir_owner, id);
227 self.data.get(&id.local_id)
230 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
235 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
238 fn index(&self, key: hir::HirId) -> &V {
239 self.get(key).expect("LocalTableInContext: key not found")
243 pub struct LocalTableInContextMut<'a, V> {
244 hir_owner: LocalDefId,
245 data: &'a mut ItemLocalMap<V>,
248 impl<'a, V> LocalTableInContextMut<'a, V> {
249 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
250 validate_hir_id_for_typeck_results(self.hir_owner, id);
251 self.data.get_mut(&id.local_id)
254 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
255 validate_hir_id_for_typeck_results(self.hir_owner, id);
256 self.data.entry(id.local_id)
259 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
260 validate_hir_id_for_typeck_results(self.hir_owner, id);
261 self.data.insert(id.local_id, val)
264 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
265 validate_hir_id_for_typeck_results(self.hir_owner, id);
266 self.data.remove(&id.local_id)
270 /// All information necessary to validate and reveal an `impl Trait`.
271 #[derive(TyEncodable, TyDecodable, Debug, HashStable)]
272 pub struct ResolvedOpaqueTy<'tcx> {
273 /// The revealed type as seen by this function.
274 pub concrete_type: Ty<'tcx>,
275 /// Generic parameters on the opaque type as passed by this function.
276 /// For `type Foo<A, B> = impl Bar<A, B>; fn foo<T, U>() -> Foo<T, U> { .. }`
277 /// this is `[T, U]`, not `[A, B]`.
278 pub substs: SubstsRef<'tcx>,
281 /// Whenever a value may be live across a generator yield, the type of that value winds up in the
282 /// `GeneratorInteriorTypeCause` struct. This struct adds additional information about such
283 /// captured types that can be useful for diagnostics. In particular, it stores the span that
284 /// caused a given type to be recorded, along with the scope that enclosed the value (which can
285 /// be used to find the await that the value is live across).
289 /// ```ignore (pseudo-Rust)
297 /// Here, we would store the type `T`, the span of the value `x`, the "scope-span" for
298 /// the scope that contains `x`, the expr `T` evaluated from, and the span of `foo.await`.
299 #[derive(TyEncodable, TyDecodable, Clone, Debug, Eq, Hash, PartialEq, HashStable)]
300 pub struct GeneratorInteriorTypeCause<'tcx> {
301 /// Type of the captured binding.
303 /// Span of the binding that was captured.
305 /// Span of the scope of the captured binding.
306 pub scope_span: Option<Span>,
307 /// Span of `.await` or `yield` expression.
308 pub yield_span: Span,
309 /// Expr which the type evaluated from.
310 pub expr: Option<hir::HirId>,
313 #[derive(TyEncodable, TyDecodable, Debug)]
314 pub struct TypeckResults<'tcx> {
315 /// The `HirId::owner` all `ItemLocalId`s in this table are relative to.
316 pub hir_owner: LocalDefId,
318 /// Resolved definitions for `<T>::X` associated paths and
319 /// method calls, including those of overloaded operators.
320 type_dependent_defs: ItemLocalMap<Result<(DefKind, DefId), ErrorReported>>,
322 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
323 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
324 /// about the field you also need definition of the variant to which the field
325 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
326 field_indices: ItemLocalMap<usize>,
328 /// Stores the types for various nodes in the AST. Note that this table
329 /// is not guaranteed to be populated until after typeck. See
330 /// typeck::check::fn_ctxt for details.
331 node_types: ItemLocalMap<Ty<'tcx>>,
333 /// Stores the type parameters which were substituted to obtain the type
334 /// of this node. This only applies to nodes that refer to entities
335 /// parameterized by type parameters, such as generic fns, types, or
337 node_substs: ItemLocalMap<SubstsRef<'tcx>>,
339 /// This will either store the canonicalized types provided by the user
340 /// or the substitutions that the user explicitly gave (if any) attached
341 /// to `id`. These will not include any inferred values. The canonical form
342 /// is used to capture things like `_` or other unspecified values.
344 /// For example, if the user wrote `foo.collect::<Vec<_>>()`, then the
345 /// canonical substitutions would include only `for<X> { Vec<X> }`.
347 /// See also `AscribeUserType` statement in MIR.
348 user_provided_types: ItemLocalMap<CanonicalUserType<'tcx>>,
350 /// Stores the canonicalized types provided by the user. See also
351 /// `AscribeUserType` statement in MIR.
352 pub user_provided_sigs: DefIdMap<CanonicalPolyFnSig<'tcx>>,
354 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
356 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
357 pat_binding_modes: ItemLocalMap<BindingMode>,
359 /// Stores the types which were implicitly dereferenced in pattern binding modes
360 /// for later usage in THIR lowering. For example,
363 /// match &&Some(5i32) {
368 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
371 /// <https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions>
372 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
375 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
377 /// Records the reasons that we picked the kind of each closure;
378 /// not all closures are present in the map.
379 closure_kind_origins: ItemLocalMap<(Span, Symbol)>,
381 /// For each fn, records the "liberated" types of its arguments
382 /// and return type. Liberated means that all bound regions
383 /// (including late-bound regions) are replaced with free
384 /// equivalents. This table is not used in codegen (since regions
385 /// are erased there) and hence is not serialized to metadata.
386 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
388 /// For each FRU expression, record the normalized types of the fields
389 /// of the struct - this is needed because it is non-trivial to
390 /// normalize while preserving regions. This table is used only in
391 /// MIR construction and hence is not serialized to metadata.
392 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
394 /// For every coercion cast we add the HIR node ID of the cast
395 /// expression to this set.
396 coercion_casts: ItemLocalSet,
398 /// Set of trait imports actually used in the method resolution.
399 /// This is used for warning unused imports. During type
400 /// checking, this `Lrc` should not be cloned: it must have a ref-count
401 /// of 1 so that we can insert things into the set mutably.
402 pub used_trait_imports: Lrc<FxHashSet<LocalDefId>>,
404 /// If any errors occurred while type-checking this body,
405 /// this field will be set to `Some(ErrorReported)`.
406 pub tainted_by_errors: Option<ErrorReported>,
408 /// All the opaque types that are restricted to concrete types
409 /// by this function.
410 pub concrete_opaque_types: FxHashMap<DefId, ResolvedOpaqueTy<'tcx>>,
412 /// Given the closure ID this map provides the list of UpvarIDs used by it.
413 /// The upvarID contains the HIR node ID and it also contains the full path
414 /// leading to the member of the struct or tuple that is used instead of the
416 pub closure_captures: ty::UpvarListMap,
418 /// Given the closure ID this map provides the list of
419 /// `Place`s and how/why are they captured by the closure.
420 pub closure_capture_information: ty::CaptureInformationMap<'tcx>,
422 /// Stores the type, expression, span and optional scope span of all types
423 /// that are live across the yield of this generator (if a generator).
424 pub generator_interior_types: Vec<GeneratorInteriorTypeCause<'tcx>>,
427 impl<'tcx> TypeckResults<'tcx> {
428 pub fn new(hir_owner: LocalDefId) -> TypeckResults<'tcx> {
431 type_dependent_defs: Default::default(),
432 field_indices: Default::default(),
433 user_provided_types: Default::default(),
434 user_provided_sigs: Default::default(),
435 node_types: Default::default(),
436 node_substs: Default::default(),
437 adjustments: Default::default(),
438 pat_binding_modes: Default::default(),
439 pat_adjustments: Default::default(),
440 upvar_capture_map: Default::default(),
441 closure_kind_origins: Default::default(),
442 liberated_fn_sigs: Default::default(),
443 fru_field_types: Default::default(),
444 coercion_casts: Default::default(),
445 used_trait_imports: Lrc::new(Default::default()),
446 tainted_by_errors: None,
447 concrete_opaque_types: Default::default(),
448 closure_captures: Default::default(),
449 closure_capture_information: Default::default(),
450 generator_interior_types: Default::default(),
454 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
455 pub fn qpath_res(&self, qpath: &hir::QPath<'_>, id: hir::HirId) -> Res {
457 hir::QPath::Resolved(_, ref path) => path.res,
458 hir::QPath::TypeRelative(..) | hir::QPath::LangItem(..) => self
459 .type_dependent_def(id)
460 .map_or(Res::Err, |(kind, def_id)| Res::Def(kind, def_id)),
464 pub fn type_dependent_defs(
466 ) -> LocalTableInContext<'_, Result<(DefKind, DefId), ErrorReported>> {
467 LocalTableInContext { hir_owner: self.hir_owner, data: &self.type_dependent_defs }
470 pub fn type_dependent_def(&self, id: HirId) -> Option<(DefKind, DefId)> {
471 validate_hir_id_for_typeck_results(self.hir_owner, id);
472 self.type_dependent_defs.get(&id.local_id).cloned().and_then(|r| r.ok())
475 pub fn type_dependent_def_id(&self, id: HirId) -> Option<DefId> {
476 self.type_dependent_def(id).map(|(_, def_id)| def_id)
479 pub fn type_dependent_defs_mut(
481 ) -> LocalTableInContextMut<'_, Result<(DefKind, DefId), ErrorReported>> {
482 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.type_dependent_defs }
485 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
486 LocalTableInContext { hir_owner: self.hir_owner, data: &self.field_indices }
489 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
490 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.field_indices }
493 pub fn user_provided_types(&self) -> LocalTableInContext<'_, CanonicalUserType<'tcx>> {
494 LocalTableInContext { hir_owner: self.hir_owner, data: &self.user_provided_types }
497 pub fn user_provided_types_mut(
499 ) -> LocalTableInContextMut<'_, CanonicalUserType<'tcx>> {
500 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.user_provided_types }
503 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
504 LocalTableInContext { hir_owner: self.hir_owner, data: &self.node_types }
507 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
508 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.node_types }
511 pub fn node_type(&self, id: hir::HirId) -> Ty<'tcx> {
512 self.node_type_opt(id).unwrap_or_else(|| {
513 bug!("node_type: no type for node `{}`", tls::with(|tcx| tcx.hir().node_to_string(id)))
517 pub fn node_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
518 validate_hir_id_for_typeck_results(self.hir_owner, id);
519 self.node_types.get(&id.local_id).cloned()
522 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, SubstsRef<'tcx>> {
523 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.node_substs }
526 pub fn node_substs(&self, id: hir::HirId) -> SubstsRef<'tcx> {
527 validate_hir_id_for_typeck_results(self.hir_owner, id);
528 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| InternalSubsts::empty())
531 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<SubstsRef<'tcx>> {
532 validate_hir_id_for_typeck_results(self.hir_owner, id);
533 self.node_substs.get(&id.local_id).cloned()
536 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
537 // doesn't provide type parameter substitutions.
538 pub fn pat_ty(&self, pat: &hir::Pat<'_>) -> Ty<'tcx> {
539 self.node_type(pat.hir_id)
542 // Returns the type of an expression as a monotype.
544 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
545 // some cases, we insert `Adjustment` annotations such as auto-deref or
546 // auto-ref. The type returned by this function does not consider such
547 // adjustments. See `expr_ty_adjusted()` instead.
549 // NB (2): This type doesn't provide type parameter substitutions; e.g., if you
550 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
551 // instead of "fn(ty) -> T with T = isize".
552 pub fn expr_ty(&self, expr: &hir::Expr<'_>) -> Ty<'tcx> {
553 self.node_type(expr.hir_id)
556 pub fn expr_ty_opt(&self, expr: &hir::Expr<'_>) -> Option<Ty<'tcx>> {
557 self.node_type_opt(expr.hir_id)
560 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
561 LocalTableInContext { hir_owner: self.hir_owner, data: &self.adjustments }
564 pub fn adjustments_mut(
566 ) -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
567 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.adjustments }
570 pub fn expr_adjustments(&self, expr: &hir::Expr<'_>) -> &[ty::adjustment::Adjustment<'tcx>] {
571 validate_hir_id_for_typeck_results(self.hir_owner, expr.hir_id);
572 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
575 /// Returns the type of `expr`, considering any `Adjustment`
576 /// entry recorded for that expression.
577 pub fn expr_ty_adjusted(&self, expr: &hir::Expr<'_>) -> Ty<'tcx> {
578 self.expr_adjustments(expr).last().map_or_else(|| self.expr_ty(expr), |adj| adj.target)
581 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr<'_>) -> Option<Ty<'tcx>> {
582 self.expr_adjustments(expr).last().map(|adj| adj.target).or_else(|| self.expr_ty_opt(expr))
585 pub fn is_method_call(&self, expr: &hir::Expr<'_>) -> bool {
586 // Only paths and method calls/overloaded operators have
587 // entries in type_dependent_defs, ignore the former here.
588 if let hir::ExprKind::Path(_) = expr.kind {
592 matches!(self.type_dependent_defs().get(expr.hir_id), Some(Ok((DefKind::AssocFn, _))))
595 pub fn extract_binding_mode(&self, s: &Session, id: HirId, sp: Span) -> Option<BindingMode> {
596 self.pat_binding_modes().get(id).copied().or_else(|| {
597 s.delay_span_bug(sp, "missing binding mode");
602 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
603 LocalTableInContext { hir_owner: self.hir_owner, data: &self.pat_binding_modes }
606 pub fn pat_binding_modes_mut(&mut self) -> LocalTableInContextMut<'_, BindingMode> {
607 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.pat_binding_modes }
610 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
611 LocalTableInContext { hir_owner: self.hir_owner, data: &self.pat_adjustments }
614 pub fn pat_adjustments_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
615 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.pat_adjustments }
618 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
619 self.upvar_capture_map[&upvar_id]
622 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, Symbol)> {
623 LocalTableInContext { hir_owner: self.hir_owner, data: &self.closure_kind_origins }
626 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, Symbol)> {
627 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.closure_kind_origins }
630 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
631 LocalTableInContext { hir_owner: self.hir_owner, data: &self.liberated_fn_sigs }
634 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
635 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.liberated_fn_sigs }
638 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
639 LocalTableInContext { hir_owner: self.hir_owner, data: &self.fru_field_types }
642 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
643 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.fru_field_types }
646 pub fn is_coercion_cast(&self, hir_id: hir::HirId) -> bool {
647 validate_hir_id_for_typeck_results(self.hir_owner, hir_id);
648 self.coercion_casts.contains(&hir_id.local_id)
651 pub fn set_coercion_cast(&mut self, id: ItemLocalId) {
652 self.coercion_casts.insert(id);
655 pub fn coercion_casts(&self) -> &ItemLocalSet {
660 impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for TypeckResults<'tcx> {
661 fn hash_stable(&self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher) {
662 let ty::TypeckResults {
664 ref type_dependent_defs,
666 ref user_provided_types,
667 ref user_provided_sigs,
671 ref pat_binding_modes,
673 ref upvar_capture_map,
674 ref closure_kind_origins,
675 ref liberated_fn_sigs,
680 ref used_trait_imports,
682 ref concrete_opaque_types,
683 ref closure_captures,
684 ref closure_capture_information,
685 ref generator_interior_types,
688 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
689 type_dependent_defs.hash_stable(hcx, hasher);
690 field_indices.hash_stable(hcx, hasher);
691 user_provided_types.hash_stable(hcx, hasher);
692 user_provided_sigs.hash_stable(hcx, hasher);
693 node_types.hash_stable(hcx, hasher);
694 node_substs.hash_stable(hcx, hasher);
695 adjustments.hash_stable(hcx, hasher);
696 pat_binding_modes.hash_stable(hcx, hasher);
697 pat_adjustments.hash_stable(hcx, hasher);
698 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
699 let ty::UpvarId { var_path, closure_expr_id } = *up_var_id;
701 assert_eq!(var_path.hir_id.owner, hir_owner);
704 hcx.local_def_path_hash(var_path.hir_id.owner),
705 var_path.hir_id.local_id,
706 hcx.local_def_path_hash(closure_expr_id),
710 closure_kind_origins.hash_stable(hcx, hasher);
711 liberated_fn_sigs.hash_stable(hcx, hasher);
712 fru_field_types.hash_stable(hcx, hasher);
713 coercion_casts.hash_stable(hcx, hasher);
714 used_trait_imports.hash_stable(hcx, hasher);
715 tainted_by_errors.hash_stable(hcx, hasher);
716 concrete_opaque_types.hash_stable(hcx, hasher);
717 closure_captures.hash_stable(hcx, hasher);
718 closure_capture_information.hash_stable(hcx, hasher);
719 generator_interior_types.hash_stable(hcx, hasher);
724 rustc_index::newtype_index! {
725 pub struct UserTypeAnnotationIndex {
727 DEBUG_FORMAT = "UserType({})",
728 const START_INDEX = 0,
732 /// Mapping of type annotation indices to canonical user type annotations.
733 pub type CanonicalUserTypeAnnotations<'tcx> =
734 IndexVec<UserTypeAnnotationIndex, CanonicalUserTypeAnnotation<'tcx>>;
736 #[derive(Clone, Debug, TyEncodable, TyDecodable, HashStable, TypeFoldable, Lift)]
737 pub struct CanonicalUserTypeAnnotation<'tcx> {
738 pub user_ty: CanonicalUserType<'tcx>,
740 pub inferred_ty: Ty<'tcx>,
743 /// Canonicalized user type annotation.
744 pub type CanonicalUserType<'tcx> = Canonical<'tcx, UserType<'tcx>>;
746 impl CanonicalUserType<'tcx> {
747 /// Returns `true` if this represents a substitution of the form `[?0, ?1, ?2]`,
748 /// i.e., each thing is mapped to a canonical variable with the same index.
749 pub fn is_identity(&self) -> bool {
751 UserType::Ty(_) => false,
752 UserType::TypeOf(_, user_substs) => {
753 if user_substs.user_self_ty.is_some() {
757 user_substs.substs.iter().zip(BoundVar::new(0)..).all(|(kind, cvar)| {
758 match kind.unpack() {
759 GenericArgKind::Type(ty) => match ty.kind() {
760 ty::Bound(debruijn, b) => {
761 // We only allow a `ty::INNERMOST` index in substitutions.
762 assert_eq!(*debruijn, ty::INNERMOST);
768 GenericArgKind::Lifetime(r) => match r {
769 ty::ReLateBound(debruijn, br) => {
770 // We only allow a `ty::INNERMOST` index in substitutions.
771 assert_eq!(*debruijn, ty::INNERMOST);
772 cvar == br.assert_bound_var()
777 GenericArgKind::Const(ct) => match ct.val {
778 ty::ConstKind::Bound(debruijn, b) => {
779 // We only allow a `ty::INNERMOST` index in substitutions.
780 assert_eq!(debruijn, ty::INNERMOST);
792 /// A user-given type annotation attached to a constant. These arise
793 /// from constants that are named via paths, like `Foo::<A>::new` and
795 #[derive(Copy, Clone, Debug, PartialEq, TyEncodable, TyDecodable)]
796 #[derive(HashStable, TypeFoldable, Lift)]
797 pub enum UserType<'tcx> {
800 /// The canonical type is the result of `type_of(def_id)` with the
801 /// given substitutions applied.
802 TypeOf(DefId, UserSubsts<'tcx>),
805 impl<'tcx> CommonTypes<'tcx> {
806 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
807 let mk = |ty| interners.intern_ty(ty);
810 unit: mk(Tuple(List::empty())),
814 isize: mk(Int(ast::IntTy::Isize)),
815 i8: mk(Int(ast::IntTy::I8)),
816 i16: mk(Int(ast::IntTy::I16)),
817 i32: mk(Int(ast::IntTy::I32)),
818 i64: mk(Int(ast::IntTy::I64)),
819 i128: mk(Int(ast::IntTy::I128)),
820 usize: mk(Uint(ast::UintTy::Usize)),
821 u8: mk(Uint(ast::UintTy::U8)),
822 u16: mk(Uint(ast::UintTy::U16)),
823 u32: mk(Uint(ast::UintTy::U32)),
824 u64: mk(Uint(ast::UintTy::U64)),
825 u128: mk(Uint(ast::UintTy::U128)),
826 f32: mk(Float(ast::FloatTy::F32)),
827 f64: mk(Float(ast::FloatTy::F64)),
829 self_param: mk(ty::Param(ty::ParamTy { index: 0, name: kw::SelfUpper })),
831 trait_object_dummy_self: mk(Infer(ty::FreshTy(0))),
836 impl<'tcx> CommonLifetimes<'tcx> {
837 fn new(interners: &CtxtInterners<'tcx>) -> CommonLifetimes<'tcx> {
838 let mk = |r| interners.region.intern(r, |r| Interned(interners.arena.alloc(r))).0;
841 re_root_empty: mk(RegionKind::ReEmpty(ty::UniverseIndex::ROOT)),
842 re_static: mk(RegionKind::ReStatic),
843 re_erased: mk(RegionKind::ReErased),
848 impl<'tcx> CommonConsts<'tcx> {
849 fn new(interners: &CtxtInterners<'tcx>, types: &CommonTypes<'tcx>) -> CommonConsts<'tcx> {
850 let mk_const = |c| interners.const_.intern(c, |c| Interned(interners.arena.alloc(c))).0;
853 unit: mk_const(ty::Const {
854 val: ty::ConstKind::Value(ConstValue::Scalar(Scalar::ZST)),
861 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
864 pub struct FreeRegionInfo {
865 // `LocalDefId` corresponding to FreeRegion
866 pub def_id: LocalDefId,
867 // the bound region corresponding to FreeRegion
868 pub boundregion: ty::BoundRegion,
869 // checks if bound region is in Impl Item
870 pub is_impl_item: bool,
873 /// The central data structure of the compiler. It stores references
874 /// to the various **arenas** and also houses the results of the
875 /// various **compiler queries** that have been performed. See the
876 /// [rustc dev guide] for more details.
878 /// [rustc dev guide]: https://rustc-dev-guide.rust-lang.org/ty.html
879 #[derive(Copy, Clone)]
880 #[rustc_diagnostic_item = "TyCtxt"]
881 pub struct TyCtxt<'tcx> {
882 gcx: &'tcx GlobalCtxt<'tcx>,
885 impl<'tcx> Deref for TyCtxt<'tcx> {
886 type Target = &'tcx GlobalCtxt<'tcx>;
888 fn deref(&self) -> &Self::Target {
893 pub struct GlobalCtxt<'tcx> {
894 pub arena: &'tcx WorkerLocal<Arena<'tcx>>,
896 interners: CtxtInterners<'tcx>,
898 pub(crate) cstore: Box<CrateStoreDyn>,
900 pub sess: &'tcx Session,
902 /// This only ever stores a `LintStore` but we don't want a dependency on that type here.
904 /// FIXME(Centril): consider `dyn LintStoreMarker` once
905 /// we can upcast to `Any` for some additional type safety.
906 pub lint_store: Lrc<dyn Any + sync::Sync + sync::Send>,
908 pub dep_graph: DepGraph,
910 pub prof: SelfProfilerRef,
912 /// Common types, pre-interned for your convenience.
913 pub types: CommonTypes<'tcx>,
915 /// Common lifetimes, pre-interned for your convenience.
916 pub lifetimes: CommonLifetimes<'tcx>,
918 /// Common consts, pre-interned for your convenience.
919 pub consts: CommonConsts<'tcx>,
921 /// Visibilities produced by resolver.
922 pub visibilities: FxHashMap<LocalDefId, Visibility>,
924 /// Resolutions of `extern crate` items produced by resolver.
925 extern_crate_map: FxHashMap<LocalDefId, CrateNum>,
927 /// Map indicating what traits are in scope for places where this
928 /// is relevant; generated by resolve.
929 trait_map: FxHashMap<LocalDefId, FxHashMap<ItemLocalId, StableVec<TraitCandidate>>>,
931 /// Export map produced by name resolution.
932 export_map: ExportMap<LocalDefId>,
934 pub(crate) untracked_crate: &'tcx hir::Crate<'tcx>,
935 pub(crate) definitions: &'tcx Definitions,
937 /// A map from `DefPathHash` -> `DefId`. Includes `DefId`s from the local crate
938 /// as well as all upstream crates. Only populated in incremental mode.
939 pub def_path_hash_to_def_id: Option<UnhashMap<DefPathHash, DefId>>,
941 pub queries: query::Queries<'tcx>,
943 maybe_unused_trait_imports: FxHashSet<LocalDefId>,
944 maybe_unused_extern_crates: Vec<(LocalDefId, Span)>,
945 /// A map of glob use to a set of names it actually imports. Currently only
946 /// used in save-analysis.
947 pub(crate) glob_map: FxHashMap<LocalDefId, FxHashSet<Symbol>>,
948 /// Extern prelude entries. The value is `true` if the entry was introduced
949 /// via `extern crate` item and not `--extern` option or compiler built-in.
950 pub extern_prelude: FxHashMap<Symbol, bool>,
952 // Internal caches for metadata decoding. No need to track deps on this.
953 pub ty_rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
954 pub pred_rcache: Lock<FxHashMap<ty::CReaderCacheKey, Predicate<'tcx>>>,
956 /// Caches the results of trait selection. This cache is used
957 /// for things that do not have to do with the parameters in scope.
958 pub selection_cache: traits::SelectionCache<'tcx>,
960 /// Caches the results of trait evaluation. This cache is used
961 /// for things that do not have to do with the parameters in scope.
962 /// Merge this with `selection_cache`?
963 pub evaluation_cache: traits::EvaluationCache<'tcx>,
965 /// The definite name of the current crate after taking into account
966 /// attributes, commandline parameters, etc.
967 pub crate_name: Symbol,
969 /// Data layout specification for the current target.
970 pub data_layout: TargetDataLayout,
972 /// `#[stable]` and `#[unstable]` attributes
973 stability_interner: ShardedHashMap<&'tcx attr::Stability, ()>,
975 /// `#[rustc_const_stable]` and `#[rustc_const_unstable]` attributes
976 const_stability_interner: ShardedHashMap<&'tcx attr::ConstStability, ()>,
978 /// Stores the value of constants (and deduplicates the actual memory)
979 allocation_interner: ShardedHashMap<&'tcx Allocation, ()>,
981 /// Stores memory for globals (statics/consts).
982 pub(crate) alloc_map: Lock<interpret::AllocMap<'tcx>>,
984 layout_interner: ShardedHashMap<&'tcx Layout, ()>,
986 output_filenames: Arc<OutputFilenames>,
989 impl<'tcx> TyCtxt<'tcx> {
990 pub fn typeck_opt_const_arg(
992 def: ty::WithOptConstParam<LocalDefId>,
993 ) -> &'tcx TypeckResults<'tcx> {
994 if let Some(param_did) = def.const_param_did {
995 self.typeck_const_arg((def.did, param_did))
1001 pub fn alloc_steal_mir(self, mir: Body<'tcx>) -> &'tcx Steal<Body<'tcx>> {
1002 self.arena.alloc(Steal::new(mir))
1005 pub fn alloc_steal_promoted(
1007 promoted: IndexVec<Promoted, Body<'tcx>>,
1008 ) -> &'tcx Steal<IndexVec<Promoted, Body<'tcx>>> {
1009 self.arena.alloc(Steal::new(promoted))
1012 pub fn alloc_adt_def(
1016 variants: IndexVec<VariantIdx, ty::VariantDef>,
1018 ) -> &'tcx ty::AdtDef {
1019 self.arena.alloc(ty::AdtDef::new(self, did, kind, variants, repr))
1022 pub fn intern_const_alloc(self, alloc: Allocation) -> &'tcx Allocation {
1023 self.allocation_interner.intern(alloc, |alloc| self.arena.alloc(alloc))
1026 /// Allocates a read-only byte or string literal for `mir::interpret`.
1027 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1028 // Create an allocation that just contains these bytes.
1029 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes);
1030 let alloc = self.intern_const_alloc(alloc);
1031 self.create_memory_alloc(alloc)
1034 pub fn intern_stability(self, stab: attr::Stability) -> &'tcx attr::Stability {
1035 self.stability_interner.intern(stab, |stab| self.arena.alloc(stab))
1038 pub fn intern_const_stability(self, stab: attr::ConstStability) -> &'tcx attr::ConstStability {
1039 self.const_stability_interner.intern(stab, |stab| self.arena.alloc(stab))
1042 pub fn intern_layout(self, layout: Layout) -> &'tcx Layout {
1043 self.layout_interner.intern(layout, |layout| self.arena.alloc(layout))
1046 /// Returns a range of the start/end indices specified with the
1047 /// `rustc_layout_scalar_valid_range` attribute.
1048 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1049 let attrs = self.get_attrs(def_id);
1051 let attr = match attrs.iter().find(|a| self.sess.check_name(a, name)) {
1053 None => return Bound::Unbounded,
1055 debug!("layout_scalar_valid_range: attr={:?}", attr);
1056 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1057 match meta.literal().expect("attribute takes lit").kind {
1058 ast::LitKind::Int(a, _) => return Bound::Included(a),
1059 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1062 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1065 get(sym::rustc_layout_scalar_valid_range_start),
1066 get(sym::rustc_layout_scalar_valid_range_end),
1070 pub fn lift<T: Lift<'tcx>>(self, value: T) -> Option<T::Lifted> {
1071 value.lift_to_tcx(self)
1074 /// Creates a type context and call the closure with a `TyCtxt` reference
1075 /// to the context. The closure enforces that the type context and any interned
1076 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1077 /// reference to the context, to allow formatting values that need it.
1078 pub fn create_global_ctxt(
1080 lint_store: Lrc<dyn Any + sync::Send + sync::Sync>,
1081 local_providers: ty::query::Providers,
1082 extern_providers: ty::query::Providers,
1083 arena: &'tcx WorkerLocal<Arena<'tcx>>,
1084 resolutions: ty::ResolverOutputs,
1085 krate: &'tcx hir::Crate<'tcx>,
1086 definitions: &'tcx Definitions,
1087 dep_graph: DepGraph,
1088 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1090 output_filenames: &OutputFilenames,
1091 ) -> GlobalCtxt<'tcx> {
1092 let data_layout = TargetDataLayout::parse(&s.target).unwrap_or_else(|err| {
1095 let interners = CtxtInterners::new(arena);
1096 let common_types = CommonTypes::new(&interners);
1097 let common_lifetimes = CommonLifetimes::new(&interners);
1098 let common_consts = CommonConsts::new(&interners, &common_types);
1099 let cstore = resolutions.cstore;
1100 let crates = cstore.crates_untracked();
1101 let max_cnum = crates.iter().map(|c| c.as_usize()).max().unwrap_or(0);
1102 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1103 providers[LOCAL_CRATE] = local_providers;
1105 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1106 let capacity = definitions.def_path_table().num_def_ids()
1107 + crates.iter().map(|cnum| cstore.num_def_ids(*cnum)).sum::<usize>();
1108 let mut map = UnhashMap::with_capacity_and_hasher(capacity, Default::default());
1110 map.extend(definitions.def_path_table().all_def_path_hashes_and_def_ids(LOCAL_CRATE));
1111 for cnum in &crates {
1112 map.extend(cstore.all_def_path_hashes_and_def_ids(*cnum).into_iter());
1120 let mut trait_map: FxHashMap<_, FxHashMap<_, _>> = FxHashMap::default();
1121 for (hir_id, v) in krate.trait_map.iter() {
1122 let map = trait_map.entry(hir_id.owner).or_default();
1123 map.insert(hir_id.local_id, StableVec::new(v.to_vec()));
1133 prof: s.prof.clone(),
1134 types: common_types,
1135 lifetimes: common_lifetimes,
1136 consts: common_consts,
1137 visibilities: resolutions.visibilities,
1138 extern_crate_map: resolutions.extern_crate_map,
1140 export_map: resolutions.export_map,
1141 maybe_unused_trait_imports: resolutions.maybe_unused_trait_imports,
1142 maybe_unused_extern_crates: resolutions.maybe_unused_extern_crates,
1143 glob_map: resolutions.glob_map,
1144 extern_prelude: resolutions.extern_prelude,
1145 untracked_crate: krate,
1147 def_path_hash_to_def_id,
1148 queries: query::Queries::new(providers, extern_providers, on_disk_query_result_cache),
1149 ty_rcache: Default::default(),
1150 pred_rcache: Default::default(),
1151 selection_cache: Default::default(),
1152 evaluation_cache: Default::default(),
1153 crate_name: Symbol::intern(crate_name),
1155 layout_interner: Default::default(),
1156 stability_interner: Default::default(),
1157 const_stability_interner: Default::default(),
1158 allocation_interner: Default::default(),
1159 alloc_map: Lock::new(interpret::AllocMap::new()),
1160 output_filenames: Arc::new(output_filenames.clone()),
1164 /// Constructs a `TyKind::Error` type and registers a `delay_span_bug` to ensure it gets used.
1166 pub fn ty_error(self) -> Ty<'tcx> {
1167 self.ty_error_with_message(DUMMY_SP, "TyKind::Error constructed but no error reported")
1170 /// Constructs a `TyKind::Error` type and registers a `delay_span_bug` with the given `msg` to
1171 /// ensure it gets used.
1173 pub fn ty_error_with_message<S: Into<MultiSpan>>(self, span: S, msg: &str) -> Ty<'tcx> {
1174 self.sess.delay_span_bug(span, msg);
1175 self.mk_ty(Error(DelaySpanBugEmitted(())))
1178 /// Like `err` but for constants.
1180 pub fn const_error(self, ty: Ty<'tcx>) -> &'tcx Const<'tcx> {
1182 .delay_span_bug(DUMMY_SP, "ty::ConstKind::Error constructed but no error reported.");
1183 self.mk_const(ty::Const { val: ty::ConstKind::Error(DelaySpanBugEmitted(())), ty })
1186 pub fn consider_optimizing<T: Fn() -> String>(self, msg: T) -> bool {
1187 let cname = self.crate_name(LOCAL_CRATE).as_str();
1188 self.sess.consider_optimizing(&cname, msg)
1191 pub fn lib_features(self) -> &'tcx middle::lib_features::LibFeatures {
1192 self.get_lib_features(LOCAL_CRATE)
1195 /// Obtain all lang items of this crate and all dependencies (recursively)
1196 pub fn lang_items(self) -> &'tcx rustc_hir::lang_items::LanguageItems {
1197 self.get_lang_items(LOCAL_CRATE)
1200 /// Obtain the given diagnostic item's `DefId`. Use `is_diagnostic_item` if you just want to
1201 /// compare against another `DefId`, since `is_diagnostic_item` is cheaper.
1202 pub fn get_diagnostic_item(self, name: Symbol) -> Option<DefId> {
1203 self.all_diagnostic_items(LOCAL_CRATE).get(&name).copied()
1206 /// Check whether the diagnostic item with the given `name` has the given `DefId`.
1207 pub fn is_diagnostic_item(self, name: Symbol, did: DefId) -> bool {
1208 self.diagnostic_items(did.krate).get(&name) == Some(&did)
1211 pub fn stability(self) -> &'tcx stability::Index<'tcx> {
1212 self.stability_index(LOCAL_CRATE)
1215 pub fn crates(self) -> &'tcx [CrateNum] {
1216 self.all_crate_nums(LOCAL_CRATE)
1219 pub fn allocator_kind(self) -> Option<AllocatorKind> {
1220 self.cstore.allocator_kind()
1223 pub fn features(self) -> &'tcx rustc_feature::Features {
1224 self.features_query(LOCAL_CRATE)
1227 pub fn def_key(self, id: DefId) -> rustc_hir::definitions::DefKey {
1228 if let Some(id) = id.as_local() { self.hir().def_key(id) } else { self.cstore.def_key(id) }
1231 /// Converts a `DefId` into its fully expanded `DefPath` (every
1232 /// `DefId` is really just an interned `DefPath`).
1234 /// Note that if `id` is not local to this crate, the result will
1235 /// be a non-local `DefPath`.
1236 pub fn def_path(self, id: DefId) -> rustc_hir::definitions::DefPath {
1237 if let Some(id) = id.as_local() {
1238 self.hir().def_path(id)
1240 self.cstore.def_path(id)
1244 /// Returns whether or not the crate with CrateNum 'cnum'
1245 /// is marked as a private dependency
1246 pub fn is_private_dep(self, cnum: CrateNum) -> bool {
1247 if cnum == LOCAL_CRATE { false } else { self.cstore.crate_is_private_dep_untracked(cnum) }
1251 pub fn def_path_hash(self, def_id: DefId) -> rustc_hir::definitions::DefPathHash {
1252 if let Some(def_id) = def_id.as_local() {
1253 self.definitions.def_path_hash(def_id)
1255 self.cstore.def_path_hash(def_id)
1259 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1260 // We are explicitly not going through queries here in order to get
1261 // crate name and disambiguator since this code is called from debug!()
1262 // statements within the query system and we'd run into endless
1263 // recursion otherwise.
1264 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1265 (self.crate_name, self.sess.local_crate_disambiguator())
1268 self.cstore.crate_name_untracked(def_id.krate),
1269 self.cstore.crate_disambiguator_untracked(def_id.krate),
1276 // Don't print the whole crate disambiguator. That's just
1277 // annoying in debug output.
1278 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1279 self.def_path(def_id).to_string_no_crate_verbose()
1283 pub fn metadata_encoding_version(self) -> Vec<u8> {
1284 self.cstore.metadata_encoding_version().to_vec()
1287 pub fn encode_metadata(self) -> EncodedMetadata {
1288 let _prof_timer = self.prof.verbose_generic_activity("generate_crate_metadata");
1289 self.cstore.encode_metadata(self)
1292 // Note that this is *untracked* and should only be used within the query
1293 // system if the result is otherwise tracked through queries
1294 pub fn cstore_as_any(self) -> &'tcx dyn Any {
1295 self.cstore.as_any()
1299 pub fn create_stable_hashing_context(self) -> StableHashingContext<'tcx> {
1300 let krate = self.gcx.untracked_crate;
1302 StableHashingContext::new(self.sess, krate, self.definitions, &*self.cstore)
1306 pub fn create_no_span_stable_hashing_context(self) -> StableHashingContext<'tcx> {
1307 let krate = self.gcx.untracked_crate;
1309 StableHashingContext::ignore_spans(self.sess, krate, self.definitions, &*self.cstore)
1312 // This method makes sure that we have a DepNode and a Fingerprint for
1313 // every upstream crate. It needs to be called once right after the tcx is
1315 // With full-fledged red/green, the method will probably become unnecessary
1316 // as this will be done on-demand.
1317 pub fn allocate_metadata_dep_nodes(self) {
1318 // We cannot use the query versions of crates() and crate_hash(), since
1319 // those would need the DepNodes that we are allocating here.
1320 for cnum in self.cstore.crates_untracked() {
1321 let dep_node = DepConstructor::CrateMetadata(self, cnum);
1322 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1323 self.dep_graph.with_task(
1327 |_, x| x, // No transformation needed
1328 dep_graph::hash_result,
1333 pub fn serialize_query_result_cache<E>(self, encoder: &mut E) -> Result<(), E::Error>
1335 E: ty::codec::OpaqueEncoder,
1337 self.queries.on_disk_cache.serialize(self, encoder)
1340 /// If `true`, we should use the MIR-based borrowck, but also
1341 /// fall back on the AST borrowck if the MIR-based one errors.
1342 pub fn migrate_borrowck(self) -> bool {
1343 self.borrowck_mode().migrate()
1346 /// What mode(s) of borrowck should we run? AST? MIR? both?
1347 /// (Also considers the `#![feature(nll)]` setting.)
1348 pub fn borrowck_mode(self) -> BorrowckMode {
1349 // Here are the main constraints we need to deal with:
1351 // 1. An opts.borrowck_mode of `BorrowckMode::Migrate` is
1352 // synonymous with no `-Z borrowck=...` flag at all.
1354 // 2. We want to allow developers on the Nightly channel
1355 // to opt back into the "hard error" mode for NLL,
1356 // (which they can do via specifying `#![feature(nll)]`
1357 // explicitly in their crate).
1359 // So, this precedence list is how pnkfelix chose to work with
1360 // the above constraints:
1362 // * `#![feature(nll)]` *always* means use NLL with hard
1363 // errors. (To simplify the code here, it now even overrides
1364 // a user's attempt to specify `-Z borrowck=compare`, which
1365 // we arguably do not need anymore and should remove.)
1367 // * Otherwise, if no `-Z borrowck=...` then use migrate mode
1369 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1371 if self.features().nll {
1372 return BorrowckMode::Mir;
1375 self.sess.opts.borrowck_mode
1378 /// If `true`, we should use lazy normalization for constants, otherwise
1379 /// we still evaluate them eagerly.
1381 pub fn lazy_normalization(self) -> bool {
1382 let features = self.features();
1383 // Note: We do not enable lazy normalization for `features.min_const_generics`.
1384 features.const_generics || features.lazy_normalization_consts
1388 pub fn local_crate_exports_generics(self) -> bool {
1389 debug_assert!(self.sess.opts.share_generics());
1391 self.sess.crate_types().iter().any(|crate_type| {
1393 CrateType::Executable
1394 | CrateType::Staticlib
1395 | CrateType::ProcMacro
1396 | CrateType::Cdylib => false,
1398 // FIXME rust-lang/rust#64319, rust-lang/rust#64872:
1399 // We want to block export of generics from dylibs,
1400 // but we must fix rust-lang/rust#65890 before we can
1401 // do that robustly.
1402 CrateType::Dylib => true,
1404 CrateType::Rlib => true,
1409 // Returns the `DefId` and the `BoundRegion` corresponding to the given region.
1410 pub fn is_suitable_region(self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1411 let (suitable_region_binding_scope, bound_region) = match *region {
1412 ty::ReFree(ref free_region) => {
1413 (free_region.scope.expect_local(), free_region.bound_region)
1415 ty::ReEarlyBound(ref ebr) => (
1416 self.parent(ebr.def_id).unwrap().expect_local(),
1417 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1419 _ => return None, // not a free region
1422 let hir_id = self.hir().local_def_id_to_hir_id(suitable_region_binding_scope);
1423 let is_impl_item = match self.hir().find(hir_id) {
1424 Some(Node::Item(..) | Node::TraitItem(..)) => false,
1425 Some(Node::ImplItem(..)) => {
1426 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1431 Some(FreeRegionInfo {
1432 def_id: suitable_region_binding_scope,
1433 boundregion: bound_region,
1438 /// Given a `DefId` for an `fn`, return all the `dyn` and `impl` traits in its return type.
1439 pub fn return_type_impl_or_dyn_traits(
1441 scope_def_id: LocalDefId,
1442 ) -> Vec<&'tcx hir::Ty<'tcx>> {
1443 let hir_id = self.hir().local_def_id_to_hir_id(scope_def_id);
1444 let hir_output = match self.hir().get(hir_id) {
1445 Node::Item(hir::Item {
1449 decl: hir::FnDecl { output: hir::FnRetTy::Return(ty), .. },
1456 | Node::ImplItem(hir::ImplItem {
1458 hir::ImplItemKind::Fn(
1460 decl: hir::FnDecl { output: hir::FnRetTy::Return(ty), .. },
1467 | Node::TraitItem(hir::TraitItem {
1469 hir::TraitItemKind::Fn(
1471 decl: hir::FnDecl { output: hir::FnRetTy::Return(ty), .. },
1481 let mut v = TraitObjectVisitor(vec![], self.hir());
1482 v.visit_ty(hir_output);
1486 pub fn return_type_impl_trait(self, scope_def_id: LocalDefId) -> Option<(Ty<'tcx>, Span)> {
1487 // HACK: `type_of_def_id()` will fail on these (#55796), so return `None`.
1488 let hir_id = self.hir().local_def_id_to_hir_id(scope_def_id);
1489 match self.hir().get(hir_id) {
1490 Node::Item(item) => {
1492 ItemKind::Fn(..) => { /* `type_of_def_id()` will work */ }
1498 _ => { /* `type_of_def_id()` will work or panic */ }
1501 let ret_ty = self.type_of(scope_def_id);
1502 match ret_ty.kind() {
1503 ty::FnDef(_, _) => {
1504 let sig = ret_ty.fn_sig(self);
1505 let output = self.erase_late_bound_regions(&sig.output());
1506 if output.is_impl_trait() {
1507 let fn_decl = self.hir().fn_decl_by_hir_id(hir_id).unwrap();
1508 Some((output, fn_decl.output.span()))
1517 // Checks if the bound region is in Impl Item.
1518 pub fn is_bound_region_in_impl_item(self, suitable_region_binding_scope: LocalDefId) -> bool {
1520 self.associated_item(suitable_region_binding_scope.to_def_id()).container.id();
1521 if self.impl_trait_ref(container_id).is_some() {
1522 // For now, we do not try to target impls of traits. This is
1523 // because this message is going to suggest that the user
1524 // change the fn signature, but they may not be free to do so,
1525 // since the signature must match the trait.
1527 // FIXME(#42706) -- in some cases, we could do better here.
1533 /// Determines whether identifiers in the assembly have strict naming rules.
1534 /// Currently, only NVPTX* targets need it.
1535 pub fn has_strict_asm_symbol_naming(self) -> bool {
1536 self.sess.target.arch.contains("nvptx")
1539 /// Returns `&'static core::panic::Location<'static>`.
1540 pub fn caller_location_ty(self) -> Ty<'tcx> {
1542 self.lifetimes.re_static,
1543 self.type_of(self.require_lang_item(LangItem::PanicLocation, None))
1544 .subst(self, self.mk_substs([self.lifetimes.re_static.into()].iter())),
1548 /// Returns a displayable description and article for the given `def_id` (e.g. `("a", "struct")`).
1549 pub fn article_and_description(self, def_id: DefId) -> (&'static str, &'static str) {
1550 match self.def_kind(def_id) {
1551 DefKind::Generator => match self.generator_kind(def_id).unwrap() {
1552 rustc_hir::GeneratorKind::Async(..) => ("an", "async closure"),
1553 rustc_hir::GeneratorKind::Gen => ("a", "generator"),
1555 def_kind => (def_kind.article(), def_kind.descr(def_id)),
1560 /// A trait implemented for all `X<'a>` types that can be safely and
1561 /// efficiently converted to `X<'tcx>` as long as they are part of the
1562 /// provided `TyCtxt<'tcx>`.
1563 /// This can be done, for example, for `Ty<'tcx>` or `SubstsRef<'tcx>`
1564 /// by looking them up in their respective interners.
1566 /// However, this is still not the best implementation as it does
1567 /// need to compare the components, even for interned values.
1568 /// It would be more efficient if `TypedArena` provided a way to
1569 /// determine whether the address is in the allocated range.
1571 /// `None` is returned if the value or one of the components is not part
1572 /// of the provided context.
1573 /// For `Ty`, `None` can be returned if either the type interner doesn't
1574 /// contain the `TyKind` key or if the address of the interned
1575 /// pointer differs. The latter case is possible if a primitive type,
1576 /// e.g., `()` or `u8`, was interned in a different context.
1577 pub trait Lift<'tcx>: fmt::Debug {
1578 type Lifted: fmt::Debug + 'tcx;
1579 fn lift_to_tcx(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>;
1582 macro_rules! nop_lift {
1583 ($set:ident; $ty:ty => $lifted:ty) => {
1584 impl<'a, 'tcx> Lift<'tcx> for $ty {
1585 type Lifted = $lifted;
1586 fn lift_to_tcx(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted> {
1587 if tcx.interners.$set.contains_pointer_to(&Interned(self)) {
1588 Some(unsafe { mem::transmute(self) })
1597 macro_rules! nop_list_lift {
1598 ($set:ident; $ty:ty => $lifted:ty) => {
1599 impl<'a, 'tcx> Lift<'tcx> for &'a List<$ty> {
1600 type Lifted = &'tcx List<$lifted>;
1601 fn lift_to_tcx(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted> {
1602 if self.is_empty() {
1603 return Some(List::empty());
1605 if tcx.interners.$set.contains_pointer_to(&Interned(self)) {
1606 Some(unsafe { mem::transmute(self) })
1615 nop_lift! {type_; Ty<'a> => Ty<'tcx>}
1616 nop_lift! {region; Region<'a> => Region<'tcx>}
1617 nop_lift! {const_; &'a Const<'a> => &'tcx Const<'tcx>}
1618 nop_lift! {predicate; &'a PredicateInner<'a> => &'tcx PredicateInner<'tcx>}
1620 nop_list_lift! {type_list; Ty<'a> => Ty<'tcx>}
1621 nop_list_lift! {existential_predicates; ExistentialPredicate<'a> => ExistentialPredicate<'tcx>}
1622 nop_list_lift! {predicates; Predicate<'a> => Predicate<'tcx>}
1623 nop_list_lift! {canonical_var_infos; CanonicalVarInfo => CanonicalVarInfo}
1624 nop_list_lift! {projs; ProjectionKind => ProjectionKind}
1626 // This is the impl for `&'a InternalSubsts<'a>`.
1627 nop_list_lift! {substs; GenericArg<'a> => GenericArg<'tcx>}
1630 use super::{ptr_eq, GlobalCtxt, TyCtxt};
1632 use crate::dep_graph::{DepKind, TaskDeps};
1633 use crate::ty::query;
1634 use rustc_data_structures::sync::{self, Lock};
1635 use rustc_data_structures::thin_vec::ThinVec;
1636 use rustc_errors::Diagnostic;
1639 #[cfg(not(parallel_compiler))]
1640 use std::cell::Cell;
1642 #[cfg(parallel_compiler)]
1643 use rustc_rayon_core as rayon_core;
1645 /// This is the implicit state of rustc. It contains the current
1646 /// `TyCtxt` and query. It is updated when creating a local interner or
1647 /// executing a new query. Whenever there's a `TyCtxt` value available
1648 /// you should also have access to an `ImplicitCtxt` through the functions
1651 pub struct ImplicitCtxt<'a, 'tcx> {
1652 /// The current `TyCtxt`.
1653 pub tcx: TyCtxt<'tcx>,
1655 /// The current query job, if any. This is updated by `JobOwner::start` in
1656 /// `ty::query::plumbing` when executing a query.
1657 pub query: Option<query::QueryJobId<DepKind>>,
1659 /// Where to store diagnostics for the current query job, if any.
1660 /// This is updated by `JobOwner::start` in `ty::query::plumbing` when executing a query.
1661 pub diagnostics: Option<&'a Lock<ThinVec<Diagnostic>>>,
1663 /// Used to prevent layout from recursing too deeply.
1664 pub layout_depth: usize,
1666 /// The current dep graph task. This is used to add dependencies to queries
1667 /// when executing them.
1668 pub task_deps: Option<&'a Lock<TaskDeps>>,
1671 impl<'a, 'tcx> ImplicitCtxt<'a, 'tcx> {
1672 pub fn new(gcx: &'tcx GlobalCtxt<'tcx>) -> Self {
1673 let tcx = TyCtxt { gcx };
1674 ImplicitCtxt { tcx, query: None, diagnostics: None, layout_depth: 0, task_deps: None }
1678 /// Sets Rayon's thread-local variable, which is preserved for Rayon jobs
1679 /// to `value` during the call to `f`. It is restored to its previous value after.
1680 /// This is used to set the pointer to the new `ImplicitCtxt`.
1681 #[cfg(parallel_compiler)]
1683 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1684 rayon_core::tlv::with(value, f)
1687 /// Gets Rayon's thread-local variable, which is preserved for Rayon jobs.
1688 /// This is used to get the pointer to the current `ImplicitCtxt`.
1689 #[cfg(parallel_compiler)]
1691 pub fn get_tlv() -> usize {
1692 rayon_core::tlv::get()
1695 #[cfg(not(parallel_compiler))]
1697 /// A thread local variable that stores a pointer to the current `ImplicitCtxt`.
1698 static TLV: Cell<usize> = Cell::new(0);
1701 /// Sets TLV to `value` during the call to `f`.
1702 /// It is restored to its previous value after.
1703 /// This is used to set the pointer to the new `ImplicitCtxt`.
1704 #[cfg(not(parallel_compiler))]
1706 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1707 let old = get_tlv();
1708 let _reset = rustc_data_structures::OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1709 TLV.with(|tlv| tlv.set(value));
1713 /// Gets the pointer to the current `ImplicitCtxt`.
1714 #[cfg(not(parallel_compiler))]
1716 fn get_tlv() -> usize {
1717 TLV.with(|tlv| tlv.get())
1720 /// Sets `context` as the new current `ImplicitCtxt` for the duration of the function `f`.
1722 pub fn enter_context<'a, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'tcx>, f: F) -> R
1724 F: FnOnce(&ImplicitCtxt<'a, 'tcx>) -> R,
1726 set_tlv(context as *const _ as usize, || f(&context))
1729 /// Allows access to the current `ImplicitCtxt` in a closure if one is available.
1731 pub fn with_context_opt<F, R>(f: F) -> R
1733 F: for<'a, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'tcx>>) -> R,
1735 let context = get_tlv();
1739 // We could get a `ImplicitCtxt` pointer from another thread.
1740 // Ensure that `ImplicitCtxt` is `Sync`.
1741 sync::assert_sync::<ImplicitCtxt<'_, '_>>();
1743 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_>))) }
1747 /// Allows access to the current `ImplicitCtxt`.
1748 /// Panics if there is no `ImplicitCtxt` available.
1750 pub fn with_context<F, R>(f: F) -> R
1752 F: for<'a, 'tcx> FnOnce(&ImplicitCtxt<'a, 'tcx>) -> R,
1754 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
1757 /// Allows access to the current `ImplicitCtxt` whose tcx field is the same as the tcx argument
1758 /// passed in. This means the closure is given an `ImplicitCtxt` with the same `'tcx` lifetime
1759 /// as the `TyCtxt` passed in.
1760 /// This will panic if you pass it a `TyCtxt` which is different from the current
1761 /// `ImplicitCtxt`'s `tcx` field.
1763 pub fn with_related_context<'tcx, F, R>(tcx: TyCtxt<'tcx>, f: F) -> R
1765 F: FnOnce(&ImplicitCtxt<'_, 'tcx>) -> R,
1767 with_context(|context| unsafe {
1768 assert!(ptr_eq(context.tcx.gcx, tcx.gcx));
1769 let context: &ImplicitCtxt<'_, '_> = mem::transmute(context);
1774 /// Allows access to the `TyCtxt` in the current `ImplicitCtxt`.
1775 /// Panics if there is no `ImplicitCtxt` available.
1777 pub fn with<F, R>(f: F) -> R
1779 F: for<'tcx> FnOnce(TyCtxt<'tcx>) -> R,
1781 with_context(|context| f(context.tcx))
1784 /// Allows access to the `TyCtxt` in the current `ImplicitCtxt`.
1785 /// The closure is passed None if there is no `ImplicitCtxt` available.
1787 pub fn with_opt<F, R>(f: F) -> R
1789 F: for<'tcx> FnOnce(Option<TyCtxt<'tcx>>) -> R,
1791 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
1795 macro_rules! sty_debug_print {
1796 ($fmt: expr, $ctxt: expr, $($variant: ident),*) => {{
1797 // Curious inner module to allow variant names to be used as
1799 #[allow(non_snake_case)]
1801 use crate::ty::{self, TyCtxt};
1802 use crate::ty::context::Interned;
1804 #[derive(Copy, Clone)]
1813 pub fn go(fmt: &mut std::fmt::Formatter<'_>, tcx: TyCtxt<'_>) -> std::fmt::Result {
1814 let mut total = DebugStat {
1821 $(let mut $variant = total;)*
1823 let shards = tcx.interners.type_.lock_shards();
1824 let types = shards.iter().flat_map(|shard| shard.keys());
1825 for &Interned(t) in types {
1826 let variant = match t.kind() {
1827 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
1828 ty::Float(..) | ty::Str | ty::Never => continue,
1829 ty::Error(_) => /* unimportant */ continue,
1830 $(ty::$variant(..) => &mut $variant,)*
1832 let lt = t.flags().intersects(ty::TypeFlags::HAS_RE_INFER);
1833 let ty = t.flags().intersects(ty::TypeFlags::HAS_TY_INFER);
1834 let ct = t.flags().intersects(ty::TypeFlags::HAS_CT_INFER);
1838 if lt { total.lt_infer += 1; variant.lt_infer += 1 }
1839 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
1840 if ct { total.ct_infer += 1; variant.ct_infer += 1 }
1841 if lt && ty && ct { total.all_infer += 1; variant.all_infer += 1 }
1843 writeln!(fmt, "Ty interner total ty lt ct all")?;
1844 $(writeln!(fmt, " {:18}: {uses:6} {usespc:4.1}%, \
1845 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
1846 stringify!($variant),
1847 uses = $variant.total,
1848 usespc = $variant.total as f64 * 100.0 / total.total as f64,
1849 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
1850 lt = $variant.lt_infer as f64 * 100.0 / total.total as f64,
1851 ct = $variant.ct_infer as f64 * 100.0 / total.total as f64,
1852 all = $variant.all_infer as f64 * 100.0 / total.total as f64)?;
1854 writeln!(fmt, " total {uses:6} \
1855 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
1857 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
1858 lt = total.lt_infer as f64 * 100.0 / total.total as f64,
1859 ct = total.ct_infer as f64 * 100.0 / total.total as f64,
1860 all = total.all_infer as f64 * 100.0 / total.total as f64)
1864 inner::go($fmt, $ctxt)
1868 impl<'tcx> TyCtxt<'tcx> {
1869 pub fn debug_stats(self) -> impl std::fmt::Debug + 'tcx {
1870 struct DebugStats<'tcx>(TyCtxt<'tcx>);
1872 impl std::fmt::Debug for DebugStats<'tcx> {
1873 fn fmt(&self, fmt: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
1898 writeln!(fmt, "InternalSubsts interner: #{}", self.0.interners.substs.len())?;
1899 writeln!(fmt, "Region interner: #{}", self.0.interners.region.len())?;
1900 writeln!(fmt, "Stability interner: #{}", self.0.stability_interner.len())?;
1903 "Const Stability interner: #{}",
1904 self.0.const_stability_interner.len()
1906 writeln!(fmt, "Allocation interner: #{}", self.0.allocation_interner.len())?;
1907 writeln!(fmt, "Layout interner: #{}", self.0.layout_interner.len())?;
1917 /// An entry in an interner.
1918 struct Interned<'tcx, T: ?Sized>(&'tcx T);
1920 impl<'tcx, T: 'tcx + ?Sized> Clone for Interned<'tcx, T> {
1921 fn clone(&self) -> Self {
1925 impl<'tcx, T: 'tcx + ?Sized> Copy for Interned<'tcx, T> {}
1927 impl<'tcx, T: 'tcx + ?Sized> IntoPointer for Interned<'tcx, T> {
1928 fn into_pointer(&self) -> *const () {
1929 self.0 as *const _ as *const ()
1932 // N.B., an `Interned<Ty>` compares and hashes as a `TyKind`.
1933 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
1934 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
1935 self.0.kind() == other.0.kind()
1939 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
1941 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
1942 fn hash<H: Hasher>(&self, s: &mut H) {
1943 self.0.kind().hash(s)
1947 #[allow(rustc::usage_of_ty_tykind)]
1948 impl<'tcx> Borrow<TyKind<'tcx>> for Interned<'tcx, TyS<'tcx>> {
1949 fn borrow<'a>(&'a self) -> &'a TyKind<'tcx> {
1953 // N.B., an `Interned<PredicateInner>` compares and hashes as a `PredicateKind`.
1954 impl<'tcx> PartialEq for Interned<'tcx, PredicateInner<'tcx>> {
1955 fn eq(&self, other: &Interned<'tcx, PredicateInner<'tcx>>) -> bool {
1956 self.0.kind == other.0.kind
1960 impl<'tcx> Eq for Interned<'tcx, PredicateInner<'tcx>> {}
1962 impl<'tcx> Hash for Interned<'tcx, PredicateInner<'tcx>> {
1963 fn hash<H: Hasher>(&self, s: &mut H) {
1968 impl<'tcx> Borrow<PredicateKind<'tcx>> for Interned<'tcx, PredicateInner<'tcx>> {
1969 fn borrow<'a>(&'a self) -> &'a PredicateKind<'tcx> {
1974 // N.B., an `Interned<List<T>>` compares and hashes as its elements.
1975 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
1976 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
1977 self.0[..] == other.0[..]
1981 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
1983 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
1984 fn hash<H: Hasher>(&self, s: &mut H) {
1989 impl<'tcx, T> Borrow<[T]> for Interned<'tcx, List<T>> {
1990 fn borrow<'a>(&'a self) -> &'a [T] {
1995 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
1996 fn borrow(&self) -> &RegionKind {
2001 impl<'tcx> Borrow<Const<'tcx>> for Interned<'tcx, Const<'tcx>> {
2002 fn borrow<'a>(&'a self) -> &'a Const<'tcx> {
2007 impl<'tcx> Borrow<PredicateKind<'tcx>> for Interned<'tcx, PredicateKind<'tcx>> {
2008 fn borrow<'a>(&'a self) -> &'a PredicateKind<'tcx> {
2013 macro_rules! direct_interners {
2014 ($($name:ident: $method:ident($ty:ty),)+) => {
2015 $(impl<'tcx> PartialEq for Interned<'tcx, $ty> {
2016 fn eq(&self, other: &Self) -> bool {
2021 impl<'tcx> Eq for Interned<'tcx, $ty> {}
2023 impl<'tcx> Hash for Interned<'tcx, $ty> {
2024 fn hash<H: Hasher>(&self, s: &mut H) {
2029 impl<'tcx> TyCtxt<'tcx> {
2030 pub fn $method(self, v: $ty) -> &'tcx $ty {
2031 self.interners.$name.intern_ref(&v, || {
2032 Interned(self.interners.arena.alloc(v))
2040 region: mk_region(RegionKind),
2041 const_: mk_const(Const<'tcx>),
2044 macro_rules! slice_interners {
2045 ($($field:ident: $method:ident($ty:ty)),+ $(,)?) => (
2046 impl<'tcx> TyCtxt<'tcx> {
2047 $(pub fn $method(self, v: &[$ty]) -> &'tcx List<$ty> {
2048 self.interners.$field.intern_ref(v, || {
2049 Interned(List::from_arena(&*self.arena, v))
2057 type_list: _intern_type_list(Ty<'tcx>),
2058 substs: _intern_substs(GenericArg<'tcx>),
2059 canonical_var_infos: _intern_canonical_var_infos(CanonicalVarInfo),
2060 existential_predicates: _intern_existential_predicates(ExistentialPredicate<'tcx>),
2061 predicates: _intern_predicates(Predicate<'tcx>),
2062 projs: _intern_projs(ProjectionKind),
2063 place_elems: _intern_place_elems(PlaceElem<'tcx>),
2066 impl<'tcx> TyCtxt<'tcx> {
2067 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2068 /// that is, a `fn` type that is equivalent in every way for being
2070 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2071 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2072 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig { unsafety: hir::Unsafety::Unsafe, ..sig }))
2075 /// Given a closure signature, returns an equivalent fn signature. Detuples
2076 /// and so forth -- so e.g., if we have a sig with `Fn<(u32, i32)>` then
2077 /// you would get a `fn(u32, i32)`.
2078 /// `unsafety` determines the unsafety of the fn signature. If you pass
2079 /// `hir::Unsafety::Unsafe` in the previous example, then you would get
2080 /// an `unsafe fn (u32, i32)`.
2081 /// It cannot convert a closure that requires unsafe.
2082 pub fn signature_unclosure(
2084 sig: PolyFnSig<'tcx>,
2085 unsafety: hir::Unsafety,
2086 ) -> PolyFnSig<'tcx> {
2088 let params_iter = match s.inputs()[0].kind() {
2089 ty::Tuple(params) => params.into_iter().map(|k| k.expect_ty()),
2092 self.mk_fn_sig(params_iter, s.output(), s.c_variadic, unsafety, abi::Abi::Rust)
2096 /// Same a `self.mk_region(kind)`, but avoids accessing the interners if
2099 pub fn reuse_or_mk_region(self, r: Region<'tcx>, kind: RegionKind) -> Region<'tcx> {
2100 if *r == kind { r } else { self.mk_region(kind) }
2103 #[allow(rustc::usage_of_ty_tykind)]
2105 pub fn mk_ty(self, st: TyKind<'tcx>) -> Ty<'tcx> {
2106 self.interners.intern_ty(st)
2110 pub fn mk_predicate(self, kind: PredicateKind<'tcx>) -> Predicate<'tcx> {
2111 let inner = self.interners.intern_predicate(kind);
2116 pub fn reuse_or_mk_predicate(
2118 pred: Predicate<'tcx>,
2119 kind: PredicateKind<'tcx>,
2120 ) -> Predicate<'tcx> {
2121 if *pred.kind() != kind { self.mk_predicate(kind) } else { pred }
2124 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2126 ast::IntTy::Isize => self.types.isize,
2127 ast::IntTy::I8 => self.types.i8,
2128 ast::IntTy::I16 => self.types.i16,
2129 ast::IntTy::I32 => self.types.i32,
2130 ast::IntTy::I64 => self.types.i64,
2131 ast::IntTy::I128 => self.types.i128,
2135 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2137 ast::UintTy::Usize => self.types.usize,
2138 ast::UintTy::U8 => self.types.u8,
2139 ast::UintTy::U16 => self.types.u16,
2140 ast::UintTy::U32 => self.types.u32,
2141 ast::UintTy::U64 => self.types.u64,
2142 ast::UintTy::U128 => self.types.u128,
2146 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2148 ast::FloatTy::F32 => self.types.f32,
2149 ast::FloatTy::F64 => self.types.f64,
2154 pub fn mk_static_str(self) -> Ty<'tcx> {
2155 self.mk_imm_ref(self.lifetimes.re_static, self.types.str_)
2159 pub fn mk_adt(self, def: &'tcx AdtDef, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2160 // Take a copy of substs so that we own the vectors inside.
2161 self.mk_ty(Adt(def, substs))
2165 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2166 self.mk_ty(Foreign(def_id))
2169 fn mk_generic_adt(self, wrapper_def_id: DefId, ty_param: Ty<'tcx>) -> Ty<'tcx> {
2170 let adt_def = self.adt_def(wrapper_def_id);
2172 InternalSubsts::for_item(self, wrapper_def_id, |param, substs| match param.kind {
2173 GenericParamDefKind::Lifetime | GenericParamDefKind::Const => bug!(),
2174 GenericParamDefKind::Type { has_default, .. } => {
2175 if param.index == 0 {
2178 assert!(has_default);
2179 self.type_of(param.def_id).subst(self, substs).into()
2183 self.mk_ty(Adt(adt_def, substs))
2187 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2188 let def_id = self.require_lang_item(LangItem::OwnedBox, None);
2189 self.mk_generic_adt(def_id, ty)
2193 pub fn mk_lang_item(self, ty: Ty<'tcx>, item: LangItem) -> Option<Ty<'tcx>> {
2194 let def_id = self.lang_items().require(item).ok()?;
2195 Some(self.mk_generic_adt(def_id, ty))
2199 pub fn mk_diagnostic_item(self, ty: Ty<'tcx>, name: Symbol) -> Option<Ty<'tcx>> {
2200 let def_id = self.get_diagnostic_item(name)?;
2201 Some(self.mk_generic_adt(def_id, ty))
2205 pub fn mk_maybe_uninit(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2206 let def_id = self.require_lang_item(LangItem::MaybeUninit, None);
2207 self.mk_generic_adt(def_id, ty)
2211 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2212 self.mk_ty(RawPtr(tm))
2216 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2217 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2221 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2222 self.mk_ref(r, TypeAndMut { ty, mutbl: hir::Mutability::Mut })
2226 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2227 self.mk_ref(r, TypeAndMut { ty, mutbl: hir::Mutability::Not })
2231 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2232 self.mk_ptr(TypeAndMut { ty, mutbl: hir::Mutability::Mut })
2236 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2237 self.mk_ptr(TypeAndMut { ty, mutbl: hir::Mutability::Not })
2241 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2242 self.mk_imm_ptr(self.mk_unit())
2246 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2247 self.mk_ty(Array(ty, ty::Const::from_usize(self, n)))
2251 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2252 self.mk_ty(Slice(ty))
2256 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2257 let kinds: Vec<_> = ts.iter().map(|&t| GenericArg::from(t)).collect();
2258 self.mk_ty(Tuple(self.intern_substs(&kinds)))
2261 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2262 iter.intern_with(|ts| {
2263 let kinds: Vec<_> = ts.iter().map(|&t| GenericArg::from(t)).collect();
2264 self.mk_ty(Tuple(self.intern_substs(&kinds)))
2269 pub fn mk_unit(self) -> Ty<'tcx> {
2274 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2275 if self.features().never_type_fallback { self.types.never } else { self.types.unit }
2279 pub fn mk_fn_def(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2280 self.mk_ty(FnDef(def_id, substs))
2284 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2285 self.mk_ty(FnPtr(fty))
2291 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2292 reg: ty::Region<'tcx>,
2294 self.mk_ty(Dynamic(obj, reg))
2298 pub fn mk_projection(self, item_def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2299 self.mk_ty(Projection(ProjectionTy { item_def_id, substs }))
2303 pub fn mk_closure(self, closure_id: DefId, closure_substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2304 self.mk_ty(Closure(closure_id, closure_substs))
2308 pub fn mk_generator(
2311 generator_substs: SubstsRef<'tcx>,
2312 movability: hir::Movability,
2314 self.mk_ty(Generator(id, generator_substs, movability))
2318 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2319 self.mk_ty(GeneratorWitness(types))
2323 pub fn mk_ty_var(self, v: TyVid) -> Ty<'tcx> {
2324 self.mk_ty_infer(TyVar(v))
2328 pub fn mk_const_var(self, v: ConstVid<'tcx>, ty: Ty<'tcx>) -> &'tcx Const<'tcx> {
2329 self.mk_const(ty::Const { val: ty::ConstKind::Infer(InferConst::Var(v)), ty })
2333 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2334 self.mk_ty_infer(IntVar(v))
2338 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2339 self.mk_ty_infer(FloatVar(v))
2343 pub fn mk_ty_infer(self, it: InferTy) -> Ty<'tcx> {
2344 self.mk_ty(Infer(it))
2348 pub fn mk_const_infer(self, ic: InferConst<'tcx>, ty: Ty<'tcx>) -> &'tcx ty::Const<'tcx> {
2349 self.mk_const(ty::Const { val: ty::ConstKind::Infer(ic), ty })
2353 pub fn mk_ty_param(self, index: u32, name: Symbol) -> Ty<'tcx> {
2354 self.mk_ty(Param(ParamTy { index, name }))
2358 pub fn mk_const_param(self, index: u32, name: Symbol, ty: Ty<'tcx>) -> &'tcx Const<'tcx> {
2359 self.mk_const(ty::Const { val: ty::ConstKind::Param(ParamConst { index, name }), ty })
2362 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> GenericArg<'tcx> {
2364 GenericParamDefKind::Lifetime => {
2365 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2367 GenericParamDefKind::Type { .. } => self.mk_ty_param(param.index, param.name).into(),
2368 GenericParamDefKind::Const => {
2369 self.mk_const_param(param.index, param.name, self.type_of(param.def_id)).into()
2375 pub fn mk_opaque(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2376 self.mk_ty(Opaque(def_id, substs))
2379 pub fn mk_place_field(self, place: Place<'tcx>, f: Field, ty: Ty<'tcx>) -> Place<'tcx> {
2380 self.mk_place_elem(place, PlaceElem::Field(f, ty))
2383 pub fn mk_place_deref(self, place: Place<'tcx>) -> Place<'tcx> {
2384 self.mk_place_elem(place, PlaceElem::Deref)
2387 pub fn mk_place_downcast(
2390 adt_def: &'tcx AdtDef,
2391 variant_index: VariantIdx,
2395 PlaceElem::Downcast(Some(adt_def.variants[variant_index].ident.name), variant_index),
2399 pub fn mk_place_downcast_unnamed(
2402 variant_index: VariantIdx,
2404 self.mk_place_elem(place, PlaceElem::Downcast(None, variant_index))
2407 pub fn mk_place_index(self, place: Place<'tcx>, index: Local) -> Place<'tcx> {
2408 self.mk_place_elem(place, PlaceElem::Index(index))
2411 /// This method copies `Place`'s projection, add an element and reintern it. Should not be used
2412 /// to build a full `Place` it's just a convenient way to grab a projection and modify it in
2414 pub fn mk_place_elem(self, place: Place<'tcx>, elem: PlaceElem<'tcx>) -> Place<'tcx> {
2415 let mut projection = place.projection.to_vec();
2416 projection.push(elem);
2418 Place { local: place.local, projection: self.intern_place_elems(&projection) }
2421 pub fn intern_existential_predicates(
2423 eps: &[ExistentialPredicate<'tcx>],
2424 ) -> &'tcx List<ExistentialPredicate<'tcx>> {
2425 assert!(!eps.is_empty());
2426 assert!(eps.array_windows().all(|[a, b]| a.stable_cmp(self, b) != Ordering::Greater));
2427 self._intern_existential_predicates(eps)
2430 pub fn intern_predicates(self, preds: &[Predicate<'tcx>]) -> &'tcx List<Predicate<'tcx>> {
2431 // FIXME consider asking the input slice to be sorted to avoid
2432 // re-interning permutations, in which case that would be asserted
2434 if preds.is_empty() {
2435 // The macro-generated method below asserts we don't intern an empty slice.
2438 self._intern_predicates(preds)
2442 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2443 if ts.is_empty() { List::empty() } else { self._intern_type_list(ts) }
2446 pub fn intern_substs(self, ts: &[GenericArg<'tcx>]) -> &'tcx List<GenericArg<'tcx>> {
2447 if ts.is_empty() { List::empty() } else { self._intern_substs(ts) }
2450 pub fn intern_projs(self, ps: &[ProjectionKind]) -> &'tcx List<ProjectionKind> {
2451 if ps.is_empty() { List::empty() } else { self._intern_projs(ps) }
2454 pub fn intern_place_elems(self, ts: &[PlaceElem<'tcx>]) -> &'tcx List<PlaceElem<'tcx>> {
2455 if ts.is_empty() { List::empty() } else { self._intern_place_elems(ts) }
2458 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'tcx> {
2459 if ts.is_empty() { List::empty() } else { self._intern_canonical_var_infos(ts) }
2462 pub fn mk_fn_sig<I>(
2467 unsafety: hir::Unsafety,
2469 ) -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2471 I: Iterator<Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>,
2473 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2474 inputs_and_output: self.intern_type_list(xs),
2481 pub fn mk_existential_predicates<
2482 I: InternAs<[ExistentialPredicate<'tcx>], &'tcx List<ExistentialPredicate<'tcx>>>,
2487 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2490 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>], &'tcx List<Predicate<'tcx>>>>(
2494 iter.intern_with(|xs| self.intern_predicates(xs))
2497 pub fn mk_type_list<I: InternAs<[Ty<'tcx>], &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2498 iter.intern_with(|xs| self.intern_type_list(xs))
2501 pub fn mk_substs<I: InternAs<[GenericArg<'tcx>], &'tcx List<GenericArg<'tcx>>>>(
2505 iter.intern_with(|xs| self.intern_substs(xs))
2508 pub fn mk_place_elems<I: InternAs<[PlaceElem<'tcx>], &'tcx List<PlaceElem<'tcx>>>>(
2512 iter.intern_with(|xs| self.intern_place_elems(xs))
2515 pub fn mk_substs_trait(self, self_ty: Ty<'tcx>, rest: &[GenericArg<'tcx>]) -> SubstsRef<'tcx> {
2516 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2519 /// Walks upwards from `id` to find a node which might change lint levels with attributes.
2520 /// It stops at `bound` and just returns it if reached.
2521 pub fn maybe_lint_level_root_bounded(self, mut id: HirId, bound: HirId) -> HirId {
2522 let hir = self.hir();
2528 if hir.attrs(id).iter().any(|attr| Level::from_symbol(attr.name_or_empty()).is_some()) {
2531 let next = hir.get_parent_node(id);
2533 bug!("lint traversal reached the root of the crate");
2539 pub fn lint_level_at_node(
2541 lint: &'static Lint,
2543 ) -> (Level, LintSource) {
2544 let sets = self.lint_levels(LOCAL_CRATE);
2546 if let Some(pair) = sets.level_and_source(lint, id, self.sess) {
2549 let next = self.hir().get_parent_node(id);
2551 bug!("lint traversal reached the root of the crate");
2557 pub fn struct_span_lint_hir(
2559 lint: &'static Lint,
2561 span: impl Into<MultiSpan>,
2562 decorate: impl for<'a> FnOnce(LintDiagnosticBuilder<'a>),
2564 let (level, src) = self.lint_level_at_node(lint, hir_id);
2565 struct_lint_level(self.sess, lint, level, src, Some(span.into()), decorate);
2568 pub fn struct_lint_node(
2570 lint: &'static Lint,
2572 decorate: impl for<'a> FnOnce(LintDiagnosticBuilder<'a>),
2574 let (level, src) = self.lint_level_at_node(lint, id);
2575 struct_lint_level(self.sess, lint, level, src, None, decorate);
2578 pub fn in_scope_traits(self, id: HirId) -> Option<&'tcx StableVec<TraitCandidate>> {
2579 self.in_scope_traits_map(id.owner).and_then(|map| map.get(&id.local_id))
2582 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2583 self.named_region_map(id.owner).and_then(|map| map.get(&id.local_id).cloned())
2586 pub fn is_late_bound(self, id: HirId) -> bool {
2587 self.is_late_bound_map(id.owner).map(|set| set.contains(&id.local_id)).unwrap_or(false)
2590 pub fn object_lifetime_defaults(self, id: HirId) -> Option<&'tcx [ObjectLifetimeDefault]> {
2591 self.object_lifetime_defaults_map(id.owner)
2592 .and_then(|map| map.get(&id.local_id).map(|v| &**v))
2596 impl TyCtxtAt<'tcx> {
2597 /// Constructs a `TyKind::Error` type and registers a `delay_span_bug` to ensure it gets used.
2599 pub fn ty_error(self) -> Ty<'tcx> {
2600 self.tcx.ty_error_with_message(self.span, "TyKind::Error constructed but no error reported")
2603 /// Constructs a `TyKind::Error` type and registers a `delay_span_bug` with the given `msg to
2604 /// ensure it gets used.
2606 pub fn ty_error_with_message(self, msg: &str) -> Ty<'tcx> {
2607 self.tcx.ty_error_with_message(self.span, msg)
2611 pub trait InternAs<T: ?Sized, R> {
2613 fn intern_with<F>(self, f: F) -> Self::Output
2618 impl<I, T, R, E> InternAs<[T], R> for I
2620 E: InternIteratorElement<T, R>,
2621 I: Iterator<Item = E>,
2623 type Output = E::Output;
2624 fn intern_with<F>(self, f: F) -> Self::Output
2626 F: FnOnce(&[T]) -> R,
2628 E::intern_with(self, f)
2632 pub trait InternIteratorElement<T, R>: Sized {
2634 fn intern_with<I: Iterator<Item = Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2637 impl<T, R> InternIteratorElement<T, R> for T {
2639 fn intern_with<I: Iterator<Item = Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2640 f(&iter.collect::<SmallVec<[_; 8]>>())
2644 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2649 fn intern_with<I: Iterator<Item = Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2650 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
2654 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2655 type Output = Result<R, E>;
2656 fn intern_with<I: Iterator<Item = Self>, F: FnOnce(&[T]) -> R>(
2660 // This code is hot enough that it's worth specializing for the most
2661 // common length lists, to avoid the overhead of `SmallVec` creation.
2662 // The match arms are in order of frequency. The 1, 2, and 0 cases are
2663 // typically hit in ~95% of cases. We assume that if the upper and
2664 // lower bounds from `size_hint` agree they are correct.
2665 Ok(match iter.size_hint() {
2667 let t0 = iter.next().unwrap()?;
2668 assert!(iter.next().is_none());
2672 let t0 = iter.next().unwrap()?;
2673 let t1 = iter.next().unwrap()?;
2674 assert!(iter.next().is_none());
2678 assert!(iter.next().is_none());
2681 _ => f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?),
2686 // We are comparing types with different invariant lifetimes, so `ptr::eq`
2687 // won't work for us.
2688 fn ptr_eq<T, U>(t: *const T, u: *const U) -> bool {
2689 t as *const () == u as *const ()
2692 pub fn provide(providers: &mut ty::query::Providers) {
2693 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id);
2694 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).map(|v| &v[..]);
2695 providers.crate_name = |tcx, id| {
2696 assert_eq!(id, LOCAL_CRATE);
2699 providers.maybe_unused_trait_import = |tcx, id| tcx.maybe_unused_trait_imports.contains(&id);
2700 providers.maybe_unused_extern_crates = |tcx, cnum| {
2701 assert_eq!(cnum, LOCAL_CRATE);
2702 &tcx.maybe_unused_extern_crates[..]
2704 providers.names_imported_by_glob_use =
2705 |tcx, id| tcx.arena.alloc(tcx.glob_map.get(&id).cloned().unwrap_or_default());
2707 providers.lookup_stability = |tcx, id| {
2708 let id = tcx.hir().local_def_id_to_hir_id(id.expect_local());
2709 tcx.stability().local_stability(id)
2711 providers.lookup_const_stability = |tcx, id| {
2712 let id = tcx.hir().local_def_id_to_hir_id(id.expect_local());
2713 tcx.stability().local_const_stability(id)
2715 providers.lookup_deprecation_entry = |tcx, id| {
2716 let id = tcx.hir().local_def_id_to_hir_id(id.expect_local());
2717 tcx.stability().local_deprecation_entry(id)
2719 providers.extern_mod_stmt_cnum = |tcx, id| tcx.extern_crate_map.get(&id).cloned();
2720 providers.all_crate_nums = |tcx, cnum| {
2721 assert_eq!(cnum, LOCAL_CRATE);
2722 tcx.arena.alloc_slice(&tcx.cstore.crates_untracked())
2724 providers.output_filenames = |tcx, cnum| {
2725 assert_eq!(cnum, LOCAL_CRATE);
2726 tcx.output_filenames.clone()
2728 providers.features_query = |tcx, cnum| {
2729 assert_eq!(cnum, LOCAL_CRATE);
2730 tcx.sess.features_untracked()
2732 providers.is_panic_runtime = |tcx, cnum| {
2733 assert_eq!(cnum, LOCAL_CRATE);
2734 tcx.sess.contains_name(tcx.hir().krate_attrs(), sym::panic_runtime)
2736 providers.is_compiler_builtins = |tcx, cnum| {
2737 assert_eq!(cnum, LOCAL_CRATE);
2738 tcx.sess.contains_name(tcx.hir().krate_attrs(), sym::compiler_builtins)
2740 providers.has_panic_handler = |tcx, cnum| {
2741 assert_eq!(cnum, LOCAL_CRATE);
2742 // We want to check if the panic handler was defined in this crate
2743 tcx.lang_items().panic_impl().map_or(false, |did| did.is_local())