1 //! Defines how the compiler represents types internally.
3 //! Two important entities in this module are:
5 //! - [`rustc_middle::ty::Ty`], used to represent the semantics of a type.
6 //! - [`rustc_middle::ty::TyCtxt`], the central data structure in the compiler.
8 //! For more information, see ["The `ty` module: representing types"] in the ructc-dev-guide.
10 //! ["The `ty` module: representing types"]: https://rustc-dev-guide.rust-lang.org/ty.html
12 pub use self::fold::{FallibleTypeFolder, TypeFoldable, TypeFolder, TypeVisitor};
13 pub use self::AssocItemContainer::*;
14 pub use self::BorrowKind::*;
15 pub use self::IntVarValue::*;
16 pub use self::Variance::*;
22 use crate::metadata::ModChild;
23 use crate::middle::privacy::AccessLevels;
24 use crate::mir::{Body, GeneratorLayout};
25 use crate::traits::{self, Reveal};
27 use crate::ty::subst::{GenericArg, InternalSubsts, Subst, SubstsRef};
28 use crate::ty::util::Discr;
30 use rustc_attr as attr;
31 use rustc_data_structures::fx::{FxHashMap, FxHashSet};
32 use rustc_data_structures::stable_hasher::{HashStable, StableHasher};
33 use rustc_data_structures::tagged_ptr::CopyTaggedPtr;
35 use rustc_hir::def::{CtorKind, CtorOf, DefKind, Res};
36 use rustc_hir::def_id::{CrateNum, DefId, LocalDefId, LocalDefIdMap, CRATE_DEF_INDEX};
38 use rustc_macros::HashStable;
39 use rustc_query_system::ich::StableHashingContext;
40 use rustc_session::cstore::CrateStoreDyn;
41 use rustc_span::symbol::{kw, Ident, Symbol};
42 use rustc_span::{sym, Span};
43 use rustc_target::abi::Align;
45 use std::cmp::Ordering;
46 use std::collections::BTreeMap;
47 use std::hash::{Hash, Hasher};
48 use std::ops::ControlFlow;
49 use std::{fmt, ptr, str};
51 pub use crate::ty::diagnostics::*;
52 pub use rustc_type_ir::InferTy::*;
53 pub use rustc_type_ir::*;
55 pub use self::binding::BindingMode;
56 pub use self::binding::BindingMode::*;
57 pub use self::closure::{
58 is_ancestor_or_same_capture, place_to_string_for_capture, BorrowKind, CaptureInfo,
59 CapturedPlace, ClosureKind, MinCaptureInformationMap, MinCaptureList,
60 RootVariableMinCaptureList, UpvarCapture, UpvarCaptureMap, UpvarId, UpvarListMap, UpvarPath,
63 pub use self::consts::{Const, ConstInt, ConstKind, InferConst, ScalarInt, Unevaluated, ValTree};
64 pub use self::context::{
65 tls, CanonicalUserType, CanonicalUserTypeAnnotation, CanonicalUserTypeAnnotations,
66 CtxtInterners, DelaySpanBugEmitted, FreeRegionInfo, GeneratorInteriorTypeCause, GlobalCtxt,
67 Lift, OnDiskCache, TyCtxt, TypeckResults, UserType, UserTypeAnnotationIndex,
69 pub use self::instance::{Instance, InstanceDef};
70 pub use self::list::List;
71 pub use self::sty::BoundRegionKind::*;
72 pub use self::sty::RegionKind::*;
73 pub use self::sty::TyKind::*;
75 Binder, BoundRegion, BoundRegionKind, BoundTy, BoundTyKind, BoundVar, BoundVariableKind,
76 CanonicalPolyFnSig, ClosureSubsts, ClosureSubstsParts, ConstVid, EarlyBoundRegion,
77 ExistentialPredicate, ExistentialProjection, ExistentialTraitRef, FnSig, FreeRegion, GenSig,
78 GeneratorSubsts, GeneratorSubstsParts, InlineConstSubsts, InlineConstSubstsParts, ParamConst,
79 ParamTy, PolyExistentialProjection, PolyExistentialTraitRef, PolyFnSig, PolyGenSig,
80 PolyTraitRef, ProjectionTy, Region, RegionKind, RegionVid, TraitRef, TyKind, TypeAndMut,
81 UpvarSubsts, VarianceDiagInfo,
83 pub use self::trait_def::TraitDef;
94 pub mod inhabitedness;
96 pub mod normalize_erasing_regions;
117 mod structural_impls;
123 pub struct ResolverOutputs {
124 pub definitions: rustc_hir::definitions::Definitions,
125 pub cstore: Box<CrateStoreDyn>,
126 pub visibilities: FxHashMap<LocalDefId, Visibility>,
127 pub access_levels: AccessLevels,
128 pub extern_crate_map: FxHashMap<LocalDefId, CrateNum>,
129 pub maybe_unused_trait_imports: FxHashSet<LocalDefId>,
130 pub maybe_unused_extern_crates: Vec<(LocalDefId, Span)>,
131 pub reexport_map: FxHashMap<LocalDefId, Vec<ModChild>>,
132 pub glob_map: FxHashMap<LocalDefId, FxHashSet<Symbol>>,
133 /// Extern prelude entries. The value is `true` if the entry was introduced
134 /// via `extern crate` item and not `--extern` option or compiler built-in.
135 pub extern_prelude: FxHashMap<Symbol, bool>,
136 pub main_def: Option<MainDefinition>,
137 pub trait_impls: BTreeMap<DefId, Vec<LocalDefId>>,
138 /// A list of proc macro LocalDefIds, written out in the order in which
139 /// they are declared in the static array generated by proc_macro_harness.
140 pub proc_macros: Vec<LocalDefId>,
141 /// Mapping from ident span to path span for paths that don't exist as written, but that
142 /// exist under `std`. For example, wrote `str::from_utf8` instead of `std::str::from_utf8`.
143 pub confused_type_with_std_module: FxHashMap<Span, Span>,
146 #[derive(Clone, Copy, Debug)]
147 pub struct MainDefinition {
148 pub res: Res<ast::NodeId>,
153 impl MainDefinition {
154 pub fn opt_fn_def_id(self) -> Option<DefId> {
155 if let Res::Def(DefKind::Fn, def_id) = self.res { Some(def_id) } else { None }
159 /// The "header" of an impl is everything outside the body: a Self type, a trait
160 /// ref (in the case of a trait impl), and a set of predicates (from the
161 /// bounds / where-clauses).
162 #[derive(Clone, Debug, TypeFoldable)]
163 pub struct ImplHeader<'tcx> {
164 pub impl_def_id: DefId,
165 pub self_ty: Ty<'tcx>,
166 pub trait_ref: Option<TraitRef<'tcx>>,
167 pub predicates: Vec<Predicate<'tcx>>,
182 pub enum ImplPolarity {
183 /// `impl Trait for Type`
185 /// `impl !Trait for Type`
187 /// `#[rustc_reservation_impl] impl Trait for Type`
189 /// This is a "stability hack", not a real Rust feature.
190 /// See #64631 for details.
195 /// Flips polarity by turning `Positive` into `Negative` and `Negative` into `Positive`.
196 pub fn flip(&self) -> Option<ImplPolarity> {
198 ImplPolarity::Positive => Some(ImplPolarity::Negative),
199 ImplPolarity::Negative => Some(ImplPolarity::Positive),
200 ImplPolarity::Reservation => None,
205 impl fmt::Display for ImplPolarity {
206 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
208 Self::Positive => f.write_str("positive"),
209 Self::Negative => f.write_str("negative"),
210 Self::Reservation => f.write_str("reservation"),
215 #[derive(Clone, Debug, PartialEq, Eq, Copy, Hash, TyEncodable, TyDecodable, HashStable)]
216 pub enum Visibility {
217 /// Visible everywhere (including in other crates).
219 /// Visible only in the given crate-local module.
221 /// Not visible anywhere in the local crate. This is the visibility of private external items.
225 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, HashStable, TyEncodable, TyDecodable)]
226 pub enum BoundConstness {
229 /// `T: ~const Trait`
231 /// Requires resolving to const only when we are in a const context.
235 impl BoundConstness {
236 /// Reduce `self` and `constness` to two possible combined states instead of four.
237 pub fn and(&mut self, constness: hir::Constness) -> hir::Constness {
238 match (constness, self) {
239 (hir::Constness::Const, BoundConstness::ConstIfConst) => hir::Constness::Const,
241 *this = BoundConstness::NotConst;
242 hir::Constness::NotConst
248 impl fmt::Display for BoundConstness {
249 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
251 Self::NotConst => f.write_str("normal"),
252 Self::ConstIfConst => f.write_str("`~const`"),
269 pub struct ClosureSizeProfileData<'tcx> {
270 /// Tuple containing the types of closure captures before the feature `capture_disjoint_fields`
271 pub before_feature_tys: Ty<'tcx>,
272 /// Tuple containing the types of closure captures after the feature `capture_disjoint_fields`
273 pub after_feature_tys: Ty<'tcx>,
276 pub trait DefIdTree: Copy {
277 fn parent(self, id: DefId) -> Option<DefId>;
279 fn is_descendant_of(self, mut descendant: DefId, ancestor: DefId) -> bool {
280 if descendant.krate != ancestor.krate {
284 while descendant != ancestor {
285 match self.parent(descendant) {
286 Some(parent) => descendant = parent,
287 None => return false,
294 impl<'tcx> DefIdTree for TyCtxt<'tcx> {
295 fn parent(self, id: DefId) -> Option<DefId> {
296 self.def_key(id).parent.map(|index| DefId { index, ..id })
301 pub fn from_hir(visibility: &hir::Visibility<'_>, id: hir::HirId, tcx: TyCtxt<'_>) -> Self {
302 match visibility.node {
303 hir::VisibilityKind::Public => Visibility::Public,
304 hir::VisibilityKind::Crate(_) => Visibility::Restricted(DefId::local(CRATE_DEF_INDEX)),
305 hir::VisibilityKind::Restricted { ref path, .. } => match path.res {
306 // If there is no resolution, `resolve` will have already reported an error, so
307 // assume that the visibility is public to avoid reporting more privacy errors.
308 Res::Err => Visibility::Public,
309 def => Visibility::Restricted(def.def_id()),
311 hir::VisibilityKind::Inherited => {
312 Visibility::Restricted(tcx.parent_module(id).to_def_id())
317 /// Returns `true` if an item with this visibility is accessible from the given block.
318 pub fn is_accessible_from<T: DefIdTree>(self, module: DefId, tree: T) -> bool {
319 let restriction = match self {
320 // Public items are visible everywhere.
321 Visibility::Public => return true,
322 // Private items from other crates are visible nowhere.
323 Visibility::Invisible => return false,
324 // Restricted items are visible in an arbitrary local module.
325 Visibility::Restricted(other) if other.krate != module.krate => return false,
326 Visibility::Restricted(module) => module,
329 tree.is_descendant_of(module, restriction)
332 /// Returns `true` if this visibility is at least as accessible as the given visibility
333 pub fn is_at_least<T: DefIdTree>(self, vis: Visibility, tree: T) -> bool {
334 let vis_restriction = match vis {
335 Visibility::Public => return self == Visibility::Public,
336 Visibility::Invisible => return true,
337 Visibility::Restricted(module) => module,
340 self.is_accessible_from(vis_restriction, tree)
343 // Returns `true` if this item is visible anywhere in the local crate.
344 pub fn is_visible_locally(self) -> bool {
346 Visibility::Public => true,
347 Visibility::Restricted(def_id) => def_id.is_local(),
348 Visibility::Invisible => false,
352 pub fn is_public(self) -> bool {
353 matches!(self, Visibility::Public)
357 /// The crate variances map is computed during typeck and contains the
358 /// variance of every item in the local crate. You should not use it
359 /// directly, because to do so will make your pass dependent on the
360 /// HIR of every item in the local crate. Instead, use
361 /// `tcx.variances_of()` to get the variance for a *particular*
363 #[derive(HashStable, Debug)]
364 pub struct CrateVariancesMap<'tcx> {
365 /// For each item with generics, maps to a vector of the variance
366 /// of its generics. If an item has no generics, it will have no
368 pub variances: FxHashMap<DefId, &'tcx [ty::Variance]>,
371 // Contains information needed to resolve types and (in the future) look up
372 // the types of AST nodes.
373 #[derive(Copy, Clone, PartialEq, Eq, Hash)]
374 pub struct CReaderCacheKey {
375 pub cnum: Option<CrateNum>,
379 #[allow(rustc::usage_of_ty_tykind)]
380 pub struct TyS<'tcx> {
381 /// This field shouldn't be used directly and may be removed in the future.
382 /// Use `TyS::kind()` instead.
384 /// This field shouldn't be used directly and may be removed in the future.
385 /// Use `TyS::flags()` instead.
388 /// This is a kind of confusing thing: it stores the smallest
391 /// (a) the binder itself captures nothing but
392 /// (b) all the late-bound things within the type are captured
393 /// by some sub-binder.
395 /// So, for a type without any late-bound things, like `u32`, this
396 /// will be *innermost*, because that is the innermost binder that
397 /// captures nothing. But for a type `&'D u32`, where `'D` is a
398 /// late-bound region with De Bruijn index `D`, this would be `D + 1`
399 /// -- the binder itself does not capture `D`, but `D` is captured
400 /// by an inner binder.
402 /// We call this concept an "exclusive" binder `D` because all
403 /// De Bruijn indices within the type are contained within `0..D`
405 outer_exclusive_binder: ty::DebruijnIndex,
408 impl<'tcx> TyS<'tcx> {
409 /// A constructor used only for internal testing.
410 #[allow(rustc::usage_of_ty_tykind)]
411 pub fn make_for_test(
414 outer_exclusive_binder: ty::DebruijnIndex,
416 TyS { kind, flags, outer_exclusive_binder }
420 // `TyS` is used a lot. Make sure it doesn't unintentionally get bigger.
421 #[cfg(all(target_arch = "x86_64", target_pointer_width = "64"))]
422 static_assert_size!(TyS<'_>, 40);
424 impl<'tcx> Ord for TyS<'tcx> {
425 fn cmp(&self, other: &TyS<'tcx>) -> Ordering {
426 self.kind().cmp(other.kind())
430 impl<'tcx> PartialOrd for TyS<'tcx> {
431 fn partial_cmp(&self, other: &TyS<'tcx>) -> Option<Ordering> {
432 Some(self.kind().cmp(other.kind()))
436 impl<'tcx> PartialEq for TyS<'tcx> {
438 fn eq(&self, other: &TyS<'tcx>) -> bool {
442 impl<'tcx> Eq for TyS<'tcx> {}
444 impl<'tcx> Hash for TyS<'tcx> {
445 fn hash<H: Hasher>(&self, s: &mut H) {
446 (self as *const TyS<'_>).hash(s)
450 impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for TyS<'tcx> {
451 fn hash_stable(&self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher) {
455 // The other fields just provide fast access to information that is
456 // also contained in `kind`, so no need to hash them.
459 outer_exclusive_binder: _,
462 kind.hash_stable(hcx, hasher);
466 #[rustc_diagnostic_item = "Ty"]
467 pub type Ty<'tcx> = &'tcx TyS<'tcx>;
469 impl ty::EarlyBoundRegion {
470 /// Does this early bound region have a name? Early bound regions normally
471 /// always have names except when using anonymous lifetimes (`'_`).
472 pub fn has_name(&self) -> bool {
473 self.name != kw::UnderscoreLifetime
478 crate struct PredicateInner<'tcx> {
479 kind: Binder<'tcx, PredicateKind<'tcx>>,
481 /// See the comment for the corresponding field of [TyS].
482 outer_exclusive_binder: ty::DebruijnIndex,
485 #[cfg(all(target_arch = "x86_64", target_pointer_width = "64"))]
486 static_assert_size!(PredicateInner<'_>, 48);
488 #[derive(Clone, Copy, Lift)]
489 pub struct Predicate<'tcx> {
490 inner: &'tcx PredicateInner<'tcx>,
493 impl<'tcx> PartialEq for Predicate<'tcx> {
494 fn eq(&self, other: &Self) -> bool {
495 // `self.kind` is always interned.
496 ptr::eq(self.inner, other.inner)
500 impl Hash for Predicate<'_> {
501 fn hash<H: Hasher>(&self, s: &mut H) {
502 (self.inner as *const PredicateInner<'_>).hash(s)
506 impl<'tcx> Eq for Predicate<'tcx> {}
508 impl<'tcx> Predicate<'tcx> {
509 /// Gets the inner `Binder<'tcx, PredicateKind<'tcx>>`.
511 pub fn kind(self) -> Binder<'tcx, PredicateKind<'tcx>> {
515 /// Flips the polarity of a Predicate.
517 /// Given `T: Trait` predicate it returns `T: !Trait` and given `T: !Trait` returns `T: Trait`.
518 pub fn flip_polarity(&self, tcx: TyCtxt<'tcx>) -> Option<Predicate<'tcx>> {
522 .map_bound(|kind| match kind {
523 PredicateKind::Trait(TraitPredicate { trait_ref, constness, polarity }) => {
524 Some(PredicateKind::Trait(TraitPredicate {
527 polarity: polarity.flip()?,
535 Some(tcx.mk_predicate(kind))
539 impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for Predicate<'tcx> {
540 fn hash_stable(&self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher) {
544 // The other fields just provide fast access to information that is
545 // also contained in `kind`, so no need to hash them.
547 outer_exclusive_binder: _,
550 kind.hash_stable(hcx, hasher);
554 #[derive(Clone, Copy, PartialEq, Eq, Hash, TyEncodable, TyDecodable)]
555 #[derive(HashStable, TypeFoldable)]
556 pub enum PredicateKind<'tcx> {
557 /// Corresponds to `where Foo: Bar<A, B, C>`. `Foo` here would be
558 /// the `Self` type of the trait reference and `A`, `B`, and `C`
559 /// would be the type parameters.
560 Trait(TraitPredicate<'tcx>),
563 RegionOutlives(RegionOutlivesPredicate<'tcx>),
566 TypeOutlives(TypeOutlivesPredicate<'tcx>),
568 /// `where <T as TraitRef>::Name == X`, approximately.
569 /// See the `ProjectionPredicate` struct for details.
570 Projection(ProjectionPredicate<'tcx>),
572 /// No syntax: `T` well-formed.
573 WellFormed(GenericArg<'tcx>),
575 /// Trait must be object-safe.
578 /// No direct syntax. May be thought of as `where T: FnFoo<...>`
579 /// for some substitutions `...` and `T` being a closure type.
580 /// Satisfied (or refuted) once we know the closure's kind.
581 ClosureKind(DefId, SubstsRef<'tcx>, ClosureKind),
585 /// This obligation is created most often when we have two
586 /// unresolved type variables and hence don't have enough
587 /// information to process the subtyping obligation yet.
588 Subtype(SubtypePredicate<'tcx>),
590 /// `T1` coerced to `T2`
592 /// Like a subtyping obligation, this is created most often
593 /// when we have two unresolved type variables and hence
594 /// don't have enough information to process the coercion
595 /// obligation yet. At the moment, we actually process coercions
596 /// very much like subtyping and don't handle the full coercion
598 Coerce(CoercePredicate<'tcx>),
600 /// Constant initializer must evaluate successfully.
601 ConstEvaluatable(ty::Unevaluated<'tcx, ()>),
603 /// Constants must be equal. The first component is the const that is expected.
604 ConstEquate(&'tcx Const<'tcx>, &'tcx Const<'tcx>),
606 /// Represents a type found in the environment that we can use for implied bounds.
608 /// Only used for Chalk.
609 TypeWellFormedFromEnv(Ty<'tcx>),
612 /// The crate outlives map is computed during typeck and contains the
613 /// outlives of every item in the local crate. You should not use it
614 /// directly, because to do so will make your pass dependent on the
615 /// HIR of every item in the local crate. Instead, use
616 /// `tcx.inferred_outlives_of()` to get the outlives for a *particular*
618 #[derive(HashStable, Debug)]
619 pub struct CratePredicatesMap<'tcx> {
620 /// For each struct with outlive bounds, maps to a vector of the
621 /// predicate of its outlive bounds. If an item has no outlives
622 /// bounds, it will have no entry.
623 pub predicates: FxHashMap<DefId, &'tcx [(Predicate<'tcx>, Span)]>,
626 impl<'tcx> Predicate<'tcx> {
627 /// Performs a substitution suitable for going from a
628 /// poly-trait-ref to supertraits that must hold if that
629 /// poly-trait-ref holds. This is slightly different from a normal
630 /// substitution in terms of what happens with bound regions. See
631 /// lengthy comment below for details.
632 pub fn subst_supertrait(
635 trait_ref: &ty::PolyTraitRef<'tcx>,
636 ) -> Predicate<'tcx> {
637 // The interaction between HRTB and supertraits is not entirely
638 // obvious. Let me walk you (and myself) through an example.
640 // Let's start with an easy case. Consider two traits:
642 // trait Foo<'a>: Bar<'a,'a> { }
643 // trait Bar<'b,'c> { }
645 // Now, if we have a trait reference `for<'x> T: Foo<'x>`, then
646 // we can deduce that `for<'x> T: Bar<'x,'x>`. Basically, if we
647 // knew that `Foo<'x>` (for any 'x) then we also know that
648 // `Bar<'x,'x>` (for any 'x). This more-or-less falls out from
649 // normal substitution.
651 // In terms of why this is sound, the idea is that whenever there
652 // is an impl of `T:Foo<'a>`, it must show that `T:Bar<'a,'a>`
653 // holds. So if there is an impl of `T:Foo<'a>` that applies to
654 // all `'a`, then we must know that `T:Bar<'a,'a>` holds for all
657 // Another example to be careful of is this:
659 // trait Foo1<'a>: for<'b> Bar1<'a,'b> { }
660 // trait Bar1<'b,'c> { }
662 // Here, if we have `for<'x> T: Foo1<'x>`, then what do we know?
663 // The answer is that we know `for<'x,'b> T: Bar1<'x,'b>`. The
664 // reason is similar to the previous example: any impl of
665 // `T:Foo1<'x>` must show that `for<'b> T: Bar1<'x, 'b>`. So
666 // basically we would want to collapse the bound lifetimes from
667 // the input (`trait_ref`) and the supertraits.
669 // To achieve this in practice is fairly straightforward. Let's
670 // consider the more complicated scenario:
672 // - We start out with `for<'x> T: Foo1<'x>`. In this case, `'x`
673 // has a De Bruijn index of 1. We want to produce `for<'x,'b> T: Bar1<'x,'b>`,
674 // where both `'x` and `'b` would have a DB index of 1.
675 // The substitution from the input trait-ref is therefore going to be
676 // `'a => 'x` (where `'x` has a DB index of 1).
677 // - The supertrait-ref is `for<'b> Bar1<'a,'b>`, where `'a` is an
678 // early-bound parameter and `'b' is a late-bound parameter with a
680 // - If we replace `'a` with `'x` from the input, it too will have
681 // a DB index of 1, and thus we'll have `for<'x,'b> Bar1<'x,'b>`
682 // just as we wanted.
684 // There is only one catch. If we just apply the substitution `'a
685 // => 'x` to `for<'b> Bar1<'a,'b>`, the substitution code will
686 // adjust the DB index because we substituting into a binder (it
687 // tries to be so smart...) resulting in `for<'x> for<'b>
688 // Bar1<'x,'b>` (we have no syntax for this, so use your
689 // imagination). Basically the 'x will have DB index of 2 and 'b
690 // will have DB index of 1. Not quite what we want. So we apply
691 // the substitution to the *contents* of the trait reference,
692 // rather than the trait reference itself (put another way, the
693 // substitution code expects equal binding levels in the values
694 // from the substitution and the value being substituted into, and
695 // this trick achieves that).
697 // Working through the second example:
698 // trait_ref: for<'x> T: Foo1<'^0.0>; substs: [T, '^0.0]
699 // predicate: for<'b> Self: Bar1<'a, '^0.0>; substs: [Self, 'a, '^0.0]
700 // We want to end up with:
701 // for<'x, 'b> T: Bar1<'^0.0, '^0.1>
703 // 1) We must shift all bound vars in predicate by the length
704 // of trait ref's bound vars. So, we would end up with predicate like
705 // Self: Bar1<'a, '^0.1>
706 // 2) We can then apply the trait substs to this, ending up with
707 // T: Bar1<'^0.0, '^0.1>
708 // 3) Finally, to create the final bound vars, we concatenate the bound
709 // vars of the trait ref with those of the predicate:
711 let bound_pred = self.kind();
712 let pred_bound_vars = bound_pred.bound_vars();
713 let trait_bound_vars = trait_ref.bound_vars();
714 // 1) Self: Bar1<'a, '^0.0> -> Self: Bar1<'a, '^0.1>
716 tcx.shift_bound_var_indices(trait_bound_vars.len(), bound_pred.skip_binder());
717 // 2) Self: Bar1<'a, '^0.1> -> T: Bar1<'^0.0, '^0.1>
718 let new = shifted_pred.subst(tcx, trait_ref.skip_binder().substs);
719 // 3) ['x] + ['b] -> ['x, 'b]
721 tcx.mk_bound_variable_kinds(trait_bound_vars.iter().chain(pred_bound_vars));
722 tcx.reuse_or_mk_predicate(self, ty::Binder::bind_with_vars(new, bound_vars))
726 #[derive(Clone, Copy, PartialEq, Eq, Hash, TyEncodable, TyDecodable)]
727 #[derive(HashStable, TypeFoldable)]
728 pub struct TraitPredicate<'tcx> {
729 pub trait_ref: TraitRef<'tcx>,
731 pub constness: BoundConstness,
733 pub polarity: ImplPolarity,
736 pub type PolyTraitPredicate<'tcx> = ty::Binder<'tcx, TraitPredicate<'tcx>>;
738 impl<'tcx> TraitPredicate<'tcx> {
739 pub fn remap_constness(&mut self, tcx: TyCtxt<'tcx>, param_env: &mut ParamEnv<'tcx>) {
740 if unlikely!(Some(self.trait_ref.def_id) == tcx.lang_items().drop_trait()) {
741 // remap without changing constness of this predicate.
742 // this is because `T: ~const Drop` has a different meaning to `T: Drop`
743 param_env.remap_constness_with(self.constness)
745 *param_env = param_env.with_constness(self.constness.and(param_env.constness()))
748 pub fn def_id(self) -> DefId {
749 self.trait_ref.def_id
752 pub fn self_ty(self) -> Ty<'tcx> {
753 self.trait_ref.self_ty()
757 impl<'tcx> PolyTraitPredicate<'tcx> {
758 pub fn def_id(self) -> DefId {
759 // Ok to skip binder since trait `DefId` does not care about regions.
760 self.skip_binder().def_id()
763 pub fn self_ty(self) -> ty::Binder<'tcx, Ty<'tcx>> {
764 self.map_bound(|trait_ref| trait_ref.self_ty())
768 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)]
769 #[derive(HashStable, TypeFoldable)]
770 pub struct OutlivesPredicate<A, B>(pub A, pub B); // `A: B`
771 pub type RegionOutlivesPredicate<'tcx> = OutlivesPredicate<ty::Region<'tcx>, ty::Region<'tcx>>;
772 pub type TypeOutlivesPredicate<'tcx> = OutlivesPredicate<Ty<'tcx>, ty::Region<'tcx>>;
773 pub type PolyRegionOutlivesPredicate<'tcx> = ty::Binder<'tcx, RegionOutlivesPredicate<'tcx>>;
774 pub type PolyTypeOutlivesPredicate<'tcx> = ty::Binder<'tcx, TypeOutlivesPredicate<'tcx>>;
776 /// Encodes that `a` must be a subtype of `b`. The `a_is_expected` flag indicates
777 /// whether the `a` type is the type that we should label as "expected" when
778 /// presenting user diagnostics.
779 #[derive(Clone, Copy, PartialEq, Eq, Hash, Debug, TyEncodable, TyDecodable)]
780 #[derive(HashStable, TypeFoldable)]
781 pub struct SubtypePredicate<'tcx> {
782 pub a_is_expected: bool,
786 pub type PolySubtypePredicate<'tcx> = ty::Binder<'tcx, SubtypePredicate<'tcx>>;
788 /// Encodes that we have to coerce *from* the `a` type to the `b` type.
789 #[derive(Clone, Copy, PartialEq, Eq, Hash, Debug, TyEncodable, TyDecodable)]
790 #[derive(HashStable, TypeFoldable)]
791 pub struct CoercePredicate<'tcx> {
795 pub type PolyCoercePredicate<'tcx> = ty::Binder<'tcx, CoercePredicate<'tcx>>;
797 /// This kind of predicate has no *direct* correspondent in the
798 /// syntax, but it roughly corresponds to the syntactic forms:
800 /// 1. `T: TraitRef<..., Item = Type>`
801 /// 2. `<T as TraitRef<...>>::Item == Type` (NYI)
803 /// In particular, form #1 is "desugared" to the combination of a
804 /// normal trait predicate (`T: TraitRef<...>`) and one of these
805 /// predicates. Form #2 is a broader form in that it also permits
806 /// equality between arbitrary types. Processing an instance of
807 /// Form #2 eventually yields one of these `ProjectionPredicate`
808 /// instances to normalize the LHS.
809 #[derive(Copy, Clone, PartialEq, Eq, Hash, TyEncodable, TyDecodable)]
810 #[derive(HashStable, TypeFoldable)]
811 pub struct ProjectionPredicate<'tcx> {
812 pub projection_ty: ProjectionTy<'tcx>,
816 pub type PolyProjectionPredicate<'tcx> = Binder<'tcx, ProjectionPredicate<'tcx>>;
818 impl<'tcx> PolyProjectionPredicate<'tcx> {
819 /// Returns the `DefId` of the trait of the associated item being projected.
821 pub fn trait_def_id(&self, tcx: TyCtxt<'tcx>) -> DefId {
822 self.skip_binder().projection_ty.trait_def_id(tcx)
825 /// Get the [PolyTraitRef] required for this projection to be well formed.
826 /// Note that for generic associated types the predicates of the associated
827 /// type also need to be checked.
829 pub fn required_poly_trait_ref(&self, tcx: TyCtxt<'tcx>) -> PolyTraitRef<'tcx> {
830 // Note: unlike with `TraitRef::to_poly_trait_ref()`,
831 // `self.0.trait_ref` is permitted to have escaping regions.
832 // This is because here `self` has a `Binder` and so does our
833 // return value, so we are preserving the number of binding
835 self.map_bound(|predicate| predicate.projection_ty.trait_ref(tcx))
838 pub fn ty(&self) -> Binder<'tcx, Ty<'tcx>> {
839 self.map_bound(|predicate| predicate.ty)
842 /// The `DefId` of the `TraitItem` for the associated type.
844 /// Note that this is not the `DefId` of the `TraitRef` containing this
845 /// associated type, which is in `tcx.associated_item(projection_def_id()).container`.
846 pub fn projection_def_id(&self) -> DefId {
847 // Ok to skip binder since trait `DefId` does not care about regions.
848 self.skip_binder().projection_ty.item_def_id
852 pub trait ToPolyTraitRef<'tcx> {
853 fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx>;
856 impl<'tcx> ToPolyTraitRef<'tcx> for PolyTraitPredicate<'tcx> {
857 fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx> {
858 self.map_bound_ref(|trait_pred| trait_pred.trait_ref)
862 pub trait ToPredicate<'tcx> {
863 fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>;
866 impl<'tcx> ToPredicate<'tcx> for Binder<'tcx, PredicateKind<'tcx>> {
868 fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> {
869 tcx.mk_predicate(self)
873 impl<'tcx> ToPredicate<'tcx> for PolyTraitPredicate<'tcx> {
874 fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> {
875 self.map_bound(PredicateKind::Trait).to_predicate(tcx)
879 impl<'tcx> ToPredicate<'tcx> for PolyRegionOutlivesPredicate<'tcx> {
880 fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> {
881 self.map_bound(PredicateKind::RegionOutlives).to_predicate(tcx)
885 impl<'tcx> ToPredicate<'tcx> for PolyTypeOutlivesPredicate<'tcx> {
886 fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> {
887 self.map_bound(PredicateKind::TypeOutlives).to_predicate(tcx)
891 impl<'tcx> ToPredicate<'tcx> for PolyProjectionPredicate<'tcx> {
892 fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> {
893 self.map_bound(PredicateKind::Projection).to_predicate(tcx)
897 impl<'tcx> Predicate<'tcx> {
898 pub fn to_opt_poly_trait_pred(self) -> Option<PolyTraitPredicate<'tcx>> {
899 let predicate = self.kind();
900 match predicate.skip_binder() {
901 PredicateKind::Trait(t) => Some(predicate.rebind(t)),
902 PredicateKind::Projection(..)
903 | PredicateKind::Subtype(..)
904 | PredicateKind::Coerce(..)
905 | PredicateKind::RegionOutlives(..)
906 | PredicateKind::WellFormed(..)
907 | PredicateKind::ObjectSafe(..)
908 | PredicateKind::ClosureKind(..)
909 | PredicateKind::TypeOutlives(..)
910 | PredicateKind::ConstEvaluatable(..)
911 | PredicateKind::ConstEquate(..)
912 | PredicateKind::TypeWellFormedFromEnv(..) => None,
916 pub fn to_opt_type_outlives(self) -> Option<PolyTypeOutlivesPredicate<'tcx>> {
917 let predicate = self.kind();
918 match predicate.skip_binder() {
919 PredicateKind::TypeOutlives(data) => Some(predicate.rebind(data)),
920 PredicateKind::Trait(..)
921 | PredicateKind::Projection(..)
922 | PredicateKind::Subtype(..)
923 | PredicateKind::Coerce(..)
924 | PredicateKind::RegionOutlives(..)
925 | PredicateKind::WellFormed(..)
926 | PredicateKind::ObjectSafe(..)
927 | PredicateKind::ClosureKind(..)
928 | PredicateKind::ConstEvaluatable(..)
929 | PredicateKind::ConstEquate(..)
930 | PredicateKind::TypeWellFormedFromEnv(..) => None,
935 /// Represents the bounds declared on a particular set of type
936 /// parameters. Should eventually be generalized into a flag list of
937 /// where-clauses. You can obtain an `InstantiatedPredicates` list from a
938 /// `GenericPredicates` by using the `instantiate` method. Note that this method
939 /// reflects an important semantic invariant of `InstantiatedPredicates`: while
940 /// the `GenericPredicates` are expressed in terms of the bound type
941 /// parameters of the impl/trait/whatever, an `InstantiatedPredicates` instance
942 /// represented a set of bounds for some particular instantiation,
943 /// meaning that the generic parameters have been substituted with
948 /// struct Foo<T, U: Bar<T>> { ... }
950 /// Here, the `GenericPredicates` for `Foo` would contain a list of bounds like
951 /// `[[], [U:Bar<T>]]`. Now if there were some particular reference
952 /// like `Foo<isize,usize>`, then the `InstantiatedPredicates` would be `[[],
953 /// [usize:Bar<isize>]]`.
954 #[derive(Clone, Debug, TypeFoldable)]
955 pub struct InstantiatedPredicates<'tcx> {
956 pub predicates: Vec<Predicate<'tcx>>,
957 pub spans: Vec<Span>,
960 impl<'tcx> InstantiatedPredicates<'tcx> {
961 pub fn empty() -> InstantiatedPredicates<'tcx> {
962 InstantiatedPredicates { predicates: vec![], spans: vec![] }
965 pub fn is_empty(&self) -> bool {
966 self.predicates.is_empty()
970 #[derive(Copy, Clone, Debug, PartialEq, Eq, HashStable, TyEncodable, TyDecodable, TypeFoldable)]
971 pub struct OpaqueTypeKey<'tcx> {
973 pub substs: SubstsRef<'tcx>,
976 rustc_index::newtype_index! {
977 /// "Universes" are used during type- and trait-checking in the
978 /// presence of `for<..>` binders to control what sets of names are
979 /// visible. Universes are arranged into a tree: the root universe
980 /// contains names that are always visible. Each child then adds a new
981 /// set of names that are visible, in addition to those of its parent.
982 /// We say that the child universe "extends" the parent universe with
985 /// To make this more concrete, consider this program:
989 /// fn bar<T>(x: T) {
990 /// let y: for<'a> fn(&'a u8, Foo) = ...;
994 /// The struct name `Foo` is in the root universe U0. But the type
995 /// parameter `T`, introduced on `bar`, is in an extended universe U1
996 /// -- i.e., within `bar`, we can name both `T` and `Foo`, but outside
997 /// of `bar`, we cannot name `T`. Then, within the type of `y`, the
998 /// region `'a` is in a universe U2 that extends U1, because we can
999 /// name it inside the fn type but not outside.
1001 /// Universes are used to do type- and trait-checking around these
1002 /// "forall" binders (also called **universal quantification**). The
1003 /// idea is that when, in the body of `bar`, we refer to `T` as a
1004 /// type, we aren't referring to any type in particular, but rather a
1005 /// kind of "fresh" type that is distinct from all other types we have
1006 /// actually declared. This is called a **placeholder** type, and we
1007 /// use universes to talk about this. In other words, a type name in
1008 /// universe 0 always corresponds to some "ground" type that the user
1009 /// declared, but a type name in a non-zero universe is a placeholder
1010 /// type -- an idealized representative of "types in general" that we
1011 /// use for checking generic functions.
1012 pub struct UniverseIndex {
1014 DEBUG_FORMAT = "U{}",
1018 impl UniverseIndex {
1019 pub const ROOT: UniverseIndex = UniverseIndex::from_u32(0);
1021 /// Returns the "next" universe index in order -- this new index
1022 /// is considered to extend all previous universes. This
1023 /// corresponds to entering a `forall` quantifier. So, for
1024 /// example, suppose we have this type in universe `U`:
1027 /// for<'a> fn(&'a u32)
1030 /// Once we "enter" into this `for<'a>` quantifier, we are in a
1031 /// new universe that extends `U` -- in this new universe, we can
1032 /// name the region `'a`, but that region was not nameable from
1033 /// `U` because it was not in scope there.
1034 pub fn next_universe(self) -> UniverseIndex {
1035 UniverseIndex::from_u32(self.private.checked_add(1).unwrap())
1038 /// Returns `true` if `self` can name a name from `other` -- in other words,
1039 /// if the set of names in `self` is a superset of those in
1040 /// `other` (`self >= other`).
1041 pub fn can_name(self, other: UniverseIndex) -> bool {
1042 self.private >= other.private
1045 /// Returns `true` if `self` cannot name some names from `other` -- in other
1046 /// words, if the set of names in `self` is a strict subset of
1047 /// those in `other` (`self < other`).
1048 pub fn cannot_name(self, other: UniverseIndex) -> bool {
1049 self.private < other.private
1053 /// The "placeholder index" fully defines a placeholder region, type, or const. Placeholders are
1054 /// identified by both a universe, as well as a name residing within that universe. Distinct bound
1055 /// regions/types/consts within the same universe simply have an unknown relationship to one
1057 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, TyEncodable, TyDecodable, PartialOrd, Ord)]
1058 pub struct Placeholder<T> {
1059 pub universe: UniverseIndex,
1063 impl<'a, T> HashStable<StableHashingContext<'a>> for Placeholder<T>
1065 T: HashStable<StableHashingContext<'a>>,
1067 fn hash_stable(&self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher) {
1068 self.universe.hash_stable(hcx, hasher);
1069 self.name.hash_stable(hcx, hasher);
1073 pub type PlaceholderRegion = Placeholder<BoundRegionKind>;
1075 pub type PlaceholderType = Placeholder<BoundVar>;
1077 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, HashStable)]
1078 #[derive(TyEncodable, TyDecodable, PartialOrd, Ord)]
1079 pub struct BoundConst<'tcx> {
1084 pub type PlaceholderConst<'tcx> = Placeholder<BoundConst<'tcx>>;
1086 /// A `DefId` which, in case it is a const argument, is potentially bundled with
1087 /// the `DefId` of the generic parameter it instantiates.
1089 /// This is used to avoid calls to `type_of` for const arguments during typeck
1090 /// which cause cycle errors.
1095 /// fn foo<const N: usize>(&self) -> [u8; N] { [0; N] }
1096 /// // ^ const parameter
1100 /// fn foo<const M: u8>(&self) -> usize { 42 }
1101 /// // ^ const parameter
1106 /// let _b = a.foo::<{ 3 + 7 }>();
1107 /// // ^^^^^^^^^ const argument
1111 /// Let's look at the call `a.foo::<{ 3 + 7 }>()` here. We do not know
1112 /// which `foo` is used until we know the type of `a`.
1114 /// We only know the type of `a` once we are inside of `typeck(main)`.
1115 /// We also end up normalizing the type of `_b` during `typeck(main)` which
1116 /// requires us to evaluate the const argument.
1118 /// To evaluate that const argument we need to know its type,
1119 /// which we would get using `type_of(const_arg)`. This requires us to
1120 /// resolve `foo` as it can be either `usize` or `u8` in this example.
1121 /// However, resolving `foo` once again requires `typeck(main)` to get the type of `a`,
1122 /// which results in a cycle.
1124 /// In short we must not call `type_of(const_arg)` during `typeck(main)`.
1126 /// When first creating the `ty::Const` of the const argument inside of `typeck` we have
1127 /// already resolved `foo` so we know which const parameter this argument instantiates.
1128 /// This means that we also know the expected result of `type_of(const_arg)` even if we
1129 /// aren't allowed to call that query: it is equal to `type_of(const_param)` which is
1130 /// trivial to compute.
1132 /// If we now want to use that constant in a place which potentionally needs its type
1133 /// we also pass the type of its `const_param`. This is the point of `WithOptConstParam`,
1134 /// except that instead of a `Ty` we bundle the `DefId` of the const parameter.
1135 /// Meaning that we need to use `type_of(const_param_did)` if `const_param_did` is `Some`
1136 /// to get the type of `did`.
1137 #[derive(Copy, Clone, Debug, TypeFoldable, Lift, TyEncodable, TyDecodable)]
1138 #[derive(PartialEq, Eq, PartialOrd, Ord)]
1139 #[derive(Hash, HashStable)]
1140 pub struct WithOptConstParam<T> {
1142 /// The `DefId` of the corresponding generic parameter in case `did` is
1143 /// a const argument.
1145 /// Note that even if `did` is a const argument, this may still be `None`.
1146 /// All queries taking `WithOptConstParam` start by calling `tcx.opt_const_param_of(def.did)`
1147 /// to potentially update `param_did` in the case it is `None`.
1148 pub const_param_did: Option<DefId>,
1151 impl<T> WithOptConstParam<T> {
1152 /// Creates a new `WithOptConstParam` setting `const_param_did` to `None`.
1154 pub fn unknown(did: T) -> WithOptConstParam<T> {
1155 WithOptConstParam { did, const_param_did: None }
1159 impl WithOptConstParam<LocalDefId> {
1160 /// Returns `Some((did, param_did))` if `def_id` is a const argument,
1161 /// `None` otherwise.
1163 pub fn try_lookup(did: LocalDefId, tcx: TyCtxt<'_>) -> Option<(LocalDefId, DefId)> {
1164 tcx.opt_const_param_of(did).map(|param_did| (did, param_did))
1167 /// In case `self` is unknown but `self.did` is a const argument, this returns
1168 /// a `WithOptConstParam` with the correct `const_param_did`.
1170 pub fn try_upgrade(self, tcx: TyCtxt<'_>) -> Option<WithOptConstParam<LocalDefId>> {
1171 if self.const_param_did.is_none() {
1172 if let const_param_did @ Some(_) = tcx.opt_const_param_of(self.did) {
1173 return Some(WithOptConstParam { did: self.did, const_param_did });
1180 pub fn to_global(self) -> WithOptConstParam<DefId> {
1181 WithOptConstParam { did: self.did.to_def_id(), const_param_did: self.const_param_did }
1184 pub fn def_id_for_type_of(self) -> DefId {
1185 if let Some(did) = self.const_param_did { did } else { self.did.to_def_id() }
1189 impl WithOptConstParam<DefId> {
1190 pub fn as_local(self) -> Option<WithOptConstParam<LocalDefId>> {
1193 .map(|did| WithOptConstParam { did, const_param_did: self.const_param_did })
1196 pub fn as_const_arg(self) -> Option<(LocalDefId, DefId)> {
1197 if let Some(param_did) = self.const_param_did {
1198 if let Some(did) = self.did.as_local() {
1199 return Some((did, param_did));
1206 pub fn is_local(self) -> bool {
1210 pub fn def_id_for_type_of(self) -> DefId {
1211 self.const_param_did.unwrap_or(self.did)
1215 /// When type checking, we use the `ParamEnv` to track
1216 /// details about the set of where-clauses that are in scope at this
1217 /// particular point.
1218 #[derive(Copy, Clone, Hash, PartialEq, Eq)]
1219 pub struct ParamEnv<'tcx> {
1220 /// This packs both caller bounds and the reveal enum into one pointer.
1222 /// Caller bounds are `Obligation`s that the caller must satisfy. This is
1223 /// basically the set of bounds on the in-scope type parameters, translated
1224 /// into `Obligation`s, and elaborated and normalized.
1226 /// Use the `caller_bounds()` method to access.
1228 /// Typically, this is `Reveal::UserFacing`, but during codegen we
1229 /// want `Reveal::All`.
1231 /// Note: This is packed, use the reveal() method to access it.
1232 packed: CopyTaggedPtr<&'tcx List<Predicate<'tcx>>, ParamTag, true>,
1235 #[derive(Copy, Clone)]
1237 reveal: traits::Reveal,
1238 constness: hir::Constness,
1241 unsafe impl rustc_data_structures::tagged_ptr::Tag for ParamTag {
1242 const BITS: usize = 2;
1244 fn into_usize(self) -> usize {
1246 Self { reveal: traits::Reveal::UserFacing, constness: hir::Constness::NotConst } => 0,
1247 Self { reveal: traits::Reveal::All, constness: hir::Constness::NotConst } => 1,
1248 Self { reveal: traits::Reveal::UserFacing, constness: hir::Constness::Const } => 2,
1249 Self { reveal: traits::Reveal::All, constness: hir::Constness::Const } => 3,
1253 unsafe fn from_usize(ptr: usize) -> Self {
1255 0 => Self { reveal: traits::Reveal::UserFacing, constness: hir::Constness::NotConst },
1256 1 => Self { reveal: traits::Reveal::All, constness: hir::Constness::NotConst },
1257 2 => Self { reveal: traits::Reveal::UserFacing, constness: hir::Constness::Const },
1258 3 => Self { reveal: traits::Reveal::All, constness: hir::Constness::Const },
1259 _ => std::hint::unreachable_unchecked(),
1264 impl<'tcx> fmt::Debug for ParamEnv<'tcx> {
1265 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1266 f.debug_struct("ParamEnv")
1267 .field("caller_bounds", &self.caller_bounds())
1268 .field("reveal", &self.reveal())
1269 .field("constness", &self.constness())
1274 impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for ParamEnv<'tcx> {
1275 fn hash_stable(&self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher) {
1276 self.caller_bounds().hash_stable(hcx, hasher);
1277 self.reveal().hash_stable(hcx, hasher);
1278 self.constness().hash_stable(hcx, hasher);
1282 impl<'tcx> TypeFoldable<'tcx> for ParamEnv<'tcx> {
1283 fn try_super_fold_with<F: ty::fold::FallibleTypeFolder<'tcx>>(
1286 ) -> Result<Self, F::Error> {
1288 self.caller_bounds().try_fold_with(folder)?,
1289 self.reveal().try_fold_with(folder)?,
1290 self.constness().try_fold_with(folder)?,
1294 fn super_visit_with<V: TypeVisitor<'tcx>>(&self, visitor: &mut V) -> ControlFlow<V::BreakTy> {
1295 self.caller_bounds().visit_with(visitor)?;
1296 self.reveal().visit_with(visitor)?;
1297 self.constness().visit_with(visitor)
1301 impl<'tcx> ParamEnv<'tcx> {
1302 /// Construct a trait environment suitable for contexts where
1303 /// there are no where-clauses in scope. Hidden types (like `impl
1304 /// Trait`) are left hidden, so this is suitable for ordinary
1307 pub fn empty() -> Self {
1308 Self::new(List::empty(), Reveal::UserFacing, hir::Constness::NotConst)
1312 pub fn caller_bounds(self) -> &'tcx List<Predicate<'tcx>> {
1313 self.packed.pointer()
1317 pub fn reveal(self) -> traits::Reveal {
1318 self.packed.tag().reveal
1322 pub fn constness(self) -> hir::Constness {
1323 self.packed.tag().constness
1326 /// Construct a trait environment with no where-clauses in scope
1327 /// where the values of all `impl Trait` and other hidden types
1328 /// are revealed. This is suitable for monomorphized, post-typeck
1329 /// environments like codegen or doing optimizations.
1331 /// N.B., if you want to have predicates in scope, use `ParamEnv::new`,
1332 /// or invoke `param_env.with_reveal_all()`.
1334 pub fn reveal_all() -> Self {
1335 Self::new(List::empty(), Reveal::All, hir::Constness::NotConst)
1338 /// Construct a trait environment with the given set of predicates.
1341 caller_bounds: &'tcx List<Predicate<'tcx>>,
1343 constness: hir::Constness,
1345 ty::ParamEnv { packed: CopyTaggedPtr::new(caller_bounds, ParamTag { reveal, constness }) }
1348 pub fn with_user_facing(mut self) -> Self {
1349 self.packed.set_tag(ParamTag { reveal: Reveal::UserFacing, ..self.packed.tag() });
1354 pub fn with_constness(mut self, constness: hir::Constness) -> Self {
1355 self.packed.set_tag(ParamTag { constness, ..self.packed.tag() });
1360 pub fn with_const(mut self) -> Self {
1361 self.packed.set_tag(ParamTag { constness: hir::Constness::Const, ..self.packed.tag() });
1366 pub fn without_const(mut self) -> Self {
1367 self.packed.set_tag(ParamTag { constness: hir::Constness::NotConst, ..self.packed.tag() });
1372 pub fn remap_constness_with(&mut self, mut constness: ty::BoundConstness) {
1373 *self = self.with_constness(constness.and(self.constness()))
1376 /// Returns a new parameter environment with the same clauses, but
1377 /// which "reveals" the true results of projections in all cases
1378 /// (even for associated types that are specializable). This is
1379 /// the desired behavior during codegen and certain other special
1380 /// contexts; normally though we want to use `Reveal::UserFacing`,
1381 /// which is the default.
1382 /// All opaque types in the caller_bounds of the `ParamEnv`
1383 /// will be normalized to their underlying types.
1384 /// See PR #65989 and issue #65918 for more details
1385 pub fn with_reveal_all_normalized(self, tcx: TyCtxt<'tcx>) -> Self {
1386 if self.packed.tag().reveal == traits::Reveal::All {
1391 tcx.normalize_opaque_types(self.caller_bounds()),
1397 /// Returns this same environment but with no caller bounds.
1399 pub fn without_caller_bounds(self) -> Self {
1400 Self::new(List::empty(), self.reveal(), self.constness())
1403 /// Creates a suitable environment in which to perform trait
1404 /// queries on the given value. When type-checking, this is simply
1405 /// the pair of the environment plus value. But when reveal is set to
1406 /// All, then if `value` does not reference any type parameters, we will
1407 /// pair it with the empty environment. This improves caching and is generally
1410 /// N.B., we preserve the environment when type-checking because it
1411 /// is possible for the user to have wacky where-clauses like
1412 /// `where Box<u32>: Copy`, which are clearly never
1413 /// satisfiable. We generally want to behave as if they were true,
1414 /// although the surrounding function is never reachable.
1415 pub fn and<T: TypeFoldable<'tcx>>(self, value: T) -> ParamEnvAnd<'tcx, T> {
1416 match self.reveal() {
1417 Reveal::UserFacing => ParamEnvAnd { param_env: self, value },
1420 if value.is_global() {
1421 ParamEnvAnd { param_env: self.without_caller_bounds(), value }
1423 ParamEnvAnd { param_env: self, value }
1430 // FIXME(ecstaticmorse): Audit all occurrences of `without_const().to_predicate(tcx)` to ensure that
1431 // the constness of trait bounds is being propagated correctly.
1432 impl<'tcx> PolyTraitRef<'tcx> {
1434 pub fn with_constness(self, constness: BoundConstness) -> PolyTraitPredicate<'tcx> {
1435 self.map_bound(|trait_ref| ty::TraitPredicate {
1438 polarity: ty::ImplPolarity::Positive,
1442 pub fn without_const(self) -> PolyTraitPredicate<'tcx> {
1443 self.with_constness(BoundConstness::NotConst)
1447 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, TypeFoldable)]
1448 pub struct ParamEnvAnd<'tcx, T> {
1449 pub param_env: ParamEnv<'tcx>,
1453 impl<'tcx, T> ParamEnvAnd<'tcx, T> {
1454 pub fn into_parts(self) -> (ParamEnv<'tcx>, T) {
1455 (self.param_env, self.value)
1459 pub fn without_const(mut self) -> Self {
1460 self.param_env = self.param_env.without_const();
1465 impl<'a, 'tcx, T> HashStable<StableHashingContext<'a>> for ParamEnvAnd<'tcx, T>
1467 T: HashStable<StableHashingContext<'a>>,
1469 fn hash_stable(&self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher) {
1470 let ParamEnvAnd { ref param_env, ref value } = *self;
1472 param_env.hash_stable(hcx, hasher);
1473 value.hash_stable(hcx, hasher);
1477 #[derive(Copy, Clone, Debug, HashStable)]
1478 pub struct Destructor {
1479 /// The `DefId` of the destructor method
1481 /// The constness of the destructor method
1482 pub constness: hir::Constness,
1486 #[derive(HashStable, TyEncodable, TyDecodable)]
1487 pub struct VariantFlags: u32 {
1488 const NO_VARIANT_FLAGS = 0;
1489 /// Indicates whether the field list of this variant is `#[non_exhaustive]`.
1490 const IS_FIELD_LIST_NON_EXHAUSTIVE = 1 << 0;
1491 /// Indicates whether this variant was obtained as part of recovering from
1492 /// a syntactic error. May be incomplete or bogus.
1493 const IS_RECOVERED = 1 << 1;
1497 /// Definition of a variant -- a struct's fields or an enum variant.
1498 #[derive(Debug, HashStable, TyEncodable, TyDecodable)]
1499 pub struct VariantDef {
1500 /// `DefId` that identifies the variant itself.
1501 /// If this variant belongs to a struct or union, then this is a copy of its `DefId`.
1503 /// `DefId` that identifies the variant's constructor.
1504 /// If this variant is a struct variant, then this is `None`.
1505 pub ctor_def_id: Option<DefId>,
1506 /// Variant or struct name.
1508 /// Discriminant of this variant.
1509 pub discr: VariantDiscr,
1510 /// Fields of this variant.
1511 pub fields: Vec<FieldDef>,
1512 /// Type of constructor of variant.
1513 pub ctor_kind: CtorKind,
1514 /// Flags of the variant (e.g. is field list non-exhaustive)?
1515 flags: VariantFlags,
1519 /// Creates a new `VariantDef`.
1521 /// `variant_did` is the `DefId` that identifies the enum variant (if this `VariantDef`
1522 /// represents an enum variant).
1524 /// `ctor_did` is the `DefId` that identifies the constructor of unit or
1525 /// tuple-variants/structs. If this is a `struct`-variant then this should be `None`.
1527 /// `parent_did` is the `DefId` of the `AdtDef` representing the enum or struct that
1528 /// owns this variant. It is used for checking if a struct has `#[non_exhaustive]` w/out having
1529 /// to go through the redirect of checking the ctor's attributes - but compiling a small crate
1530 /// requires loading the `AdtDef`s for all the structs in the universe (e.g., coherence for any
1531 /// built-in trait), and we do not want to load attributes twice.
1533 /// If someone speeds up attribute loading to not be a performance concern, they can
1534 /// remove this hack and use the constructor `DefId` everywhere.
1537 variant_did: Option<DefId>,
1538 ctor_def_id: Option<DefId>,
1539 discr: VariantDiscr,
1540 fields: Vec<FieldDef>,
1541 ctor_kind: CtorKind,
1545 is_field_list_non_exhaustive: bool,
1548 "VariantDef::new(name = {:?}, variant_did = {:?}, ctor_def_id = {:?}, discr = {:?},
1549 fields = {:?}, ctor_kind = {:?}, adt_kind = {:?}, parent_did = {:?})",
1550 name, variant_did, ctor_def_id, discr, fields, ctor_kind, adt_kind, parent_did,
1553 let mut flags = VariantFlags::NO_VARIANT_FLAGS;
1554 if is_field_list_non_exhaustive {
1555 flags |= VariantFlags::IS_FIELD_LIST_NON_EXHAUSTIVE;
1559 flags |= VariantFlags::IS_RECOVERED;
1563 def_id: variant_did.unwrap_or(parent_did),
1573 /// Is this field list non-exhaustive?
1575 pub fn is_field_list_non_exhaustive(&self) -> bool {
1576 self.flags.intersects(VariantFlags::IS_FIELD_LIST_NON_EXHAUSTIVE)
1579 /// Was this variant obtained as part of recovering from a syntactic error?
1581 pub fn is_recovered(&self) -> bool {
1582 self.flags.intersects(VariantFlags::IS_RECOVERED)
1585 /// Computes the `Ident` of this variant by looking up the `Span`
1586 pub fn ident(&self, tcx: TyCtxt<'_>) -> Ident {
1587 Ident::new(self.name, tcx.def_ident_span(self.def_id).unwrap())
1591 #[derive(Copy, Clone, Debug, PartialEq, Eq, TyEncodable, TyDecodable, HashStable)]
1592 pub enum VariantDiscr {
1593 /// Explicit value for this variant, i.e., `X = 123`.
1594 /// The `DefId` corresponds to the embedded constant.
1597 /// The previous variant's discriminant plus one.
1598 /// For efficiency reasons, the distance from the
1599 /// last `Explicit` discriminant is being stored,
1600 /// or `0` for the first variant, if it has none.
1604 #[derive(Debug, HashStable, TyEncodable, TyDecodable)]
1605 pub struct FieldDef {
1608 pub vis: Visibility,
1612 #[derive(TyEncodable, TyDecodable, Default, HashStable)]
1613 pub struct ReprFlags: u8 {
1614 const IS_C = 1 << 0;
1615 const IS_SIMD = 1 << 1;
1616 const IS_TRANSPARENT = 1 << 2;
1617 // Internal only for now. If true, don't reorder fields.
1618 const IS_LINEAR = 1 << 3;
1619 // If true, don't expose any niche to type's context.
1620 const HIDE_NICHE = 1 << 4;
1621 // If true, the type's layout can be randomized using
1622 // the seed stored in `ReprOptions.layout_seed`
1623 const RANDOMIZE_LAYOUT = 1 << 5;
1624 // Any of these flags being set prevent field reordering optimisation.
1625 const IS_UNOPTIMISABLE = ReprFlags::IS_C.bits
1626 | ReprFlags::IS_SIMD.bits
1627 | ReprFlags::IS_LINEAR.bits;
1631 /// Represents the repr options provided by the user,
1632 #[derive(Copy, Clone, Debug, Eq, PartialEq, TyEncodable, TyDecodable, Default, HashStable)]
1633 pub struct ReprOptions {
1634 pub int: Option<attr::IntType>,
1635 pub align: Option<Align>,
1636 pub pack: Option<Align>,
1637 pub flags: ReprFlags,
1638 /// The seed to be used for randomizing a type's layout
1640 /// Note: This could technically be a `[u8; 16]` (a `u128`) which would
1641 /// be the "most accurate" hash as it'd encompass the item and crate
1642 /// hash without loss, but it does pay the price of being larger.
1643 /// Everything's a tradeoff, a `u64` seed should be sufficient for our
1644 /// purposes (primarily `-Z randomize-layout`)
1645 pub field_shuffle_seed: u64,
1649 pub fn new(tcx: TyCtxt<'_>, did: DefId) -> ReprOptions {
1650 let mut flags = ReprFlags::empty();
1651 let mut size = None;
1652 let mut max_align: Option<Align> = None;
1653 let mut min_pack: Option<Align> = None;
1655 // Generate a deterministically-derived seed from the item's path hash
1656 // to allow for cross-crate compilation to actually work
1657 let mut field_shuffle_seed = tcx.def_path_hash(did).0.to_smaller_hash();
1659 // If the user defined a custom seed for layout randomization, xor the item's
1660 // path hash with the user defined seed, this will allowing determinism while
1661 // still allowing users to further randomize layout generation for e.g. fuzzing
1662 if let Some(user_seed) = tcx.sess.opts.debugging_opts.layout_seed {
1663 field_shuffle_seed ^= user_seed;
1666 for attr in tcx.get_attrs(did).iter() {
1667 for r in attr::find_repr_attrs(&tcx.sess, attr) {
1668 flags.insert(match r {
1669 attr::ReprC => ReprFlags::IS_C,
1670 attr::ReprPacked(pack) => {
1671 let pack = Align::from_bytes(pack as u64).unwrap();
1672 min_pack = Some(if let Some(min_pack) = min_pack {
1679 attr::ReprTransparent => ReprFlags::IS_TRANSPARENT,
1680 attr::ReprNoNiche => ReprFlags::HIDE_NICHE,
1681 attr::ReprSimd => ReprFlags::IS_SIMD,
1682 attr::ReprInt(i) => {
1686 attr::ReprAlign(align) => {
1687 max_align = max_align.max(Some(Align::from_bytes(align as u64).unwrap()));
1694 // If `-Z randomize-layout` was enabled for the type definition then we can
1695 // consider performing layout randomization
1696 if tcx.sess.opts.debugging_opts.randomize_layout {
1697 flags.insert(ReprFlags::RANDOMIZE_LAYOUT);
1700 // This is here instead of layout because the choice must make it into metadata.
1701 if !tcx.consider_optimizing(|| format!("Reorder fields of {:?}", tcx.def_path_str(did))) {
1702 flags.insert(ReprFlags::IS_LINEAR);
1705 Self { int: size, align: max_align, pack: min_pack, flags, field_shuffle_seed }
1709 pub fn simd(&self) -> bool {
1710 self.flags.contains(ReprFlags::IS_SIMD)
1714 pub fn c(&self) -> bool {
1715 self.flags.contains(ReprFlags::IS_C)
1719 pub fn packed(&self) -> bool {
1724 pub fn transparent(&self) -> bool {
1725 self.flags.contains(ReprFlags::IS_TRANSPARENT)
1729 pub fn linear(&self) -> bool {
1730 self.flags.contains(ReprFlags::IS_LINEAR)
1734 pub fn hide_niche(&self) -> bool {
1735 self.flags.contains(ReprFlags::HIDE_NICHE)
1738 /// Returns the discriminant type, given these `repr` options.
1739 /// This must only be called on enums!
1740 pub fn discr_type(&self) -> attr::IntType {
1741 self.int.unwrap_or(attr::SignedInt(ast::IntTy::Isize))
1744 /// Returns `true` if this `#[repr()]` should inhabit "smart enum
1745 /// layout" optimizations, such as representing `Foo<&T>` as a
1747 pub fn inhibit_enum_layout_opt(&self) -> bool {
1748 self.c() || self.int.is_some()
1751 /// Returns `true` if this `#[repr()]` should inhibit struct field reordering
1752 /// optimizations, such as with `repr(C)`, `repr(packed(1))`, or `repr(<int>)`.
1753 pub fn inhibit_struct_field_reordering_opt(&self) -> bool {
1754 if let Some(pack) = self.pack {
1755 if pack.bytes() == 1 {
1760 self.flags.intersects(ReprFlags::IS_UNOPTIMISABLE) || self.int.is_some()
1763 /// Returns `true` if this type is valid for reordering and `-Z randomize-layout`
1764 /// was enabled for its declaration crate
1765 pub fn can_randomize_type_layout(&self) -> bool {
1766 !self.inhibit_struct_field_reordering_opt()
1767 && self.flags.contains(ReprFlags::RANDOMIZE_LAYOUT)
1770 /// Returns `true` if this `#[repr()]` should inhibit union ABI optimisations.
1771 pub fn inhibit_union_abi_opt(&self) -> bool {
1776 impl<'tcx> FieldDef {
1777 /// Returns the type of this field. The resulting type is not normalized. The `subst` is
1778 /// typically obtained via the second field of [`TyKind::Adt`].
1779 pub fn ty(&self, tcx: TyCtxt<'tcx>, subst: SubstsRef<'tcx>) -> Ty<'tcx> {
1780 tcx.type_of(self.did).subst(tcx, subst)
1783 /// Computes the `Ident` of this variant by looking up the `Span`
1784 pub fn ident(&self, tcx: TyCtxt<'_>) -> Ident {
1785 Ident::new(self.name, tcx.def_ident_span(self.did).unwrap())
1789 pub type Attributes<'tcx> = &'tcx [ast::Attribute];
1791 #[derive(Debug, PartialEq, Eq)]
1792 pub enum ImplOverlapKind {
1793 /// These impls are always allowed to overlap.
1795 /// Whether or not the impl is permitted due to the trait being a `#[marker]` trait
1798 /// These impls are allowed to overlap, but that raises
1799 /// an issue #33140 future-compatibility warning.
1801 /// Some background: in Rust 1.0, the trait-object types `Send + Sync` (today's
1802 /// `dyn Send + Sync`) and `Sync + Send` (now `dyn Sync + Send`) were different.
1804 /// The widely-used version 0.1.0 of the crate `traitobject` had accidentally relied
1805 /// that difference, making what reduces to the following set of impls:
1809 /// impl Trait for dyn Send + Sync {}
1810 /// impl Trait for dyn Sync + Send {}
1813 /// Obviously, once we made these types be identical, that code causes a coherence
1814 /// error and a fairly big headache for us. However, luckily for us, the trait
1815 /// `Trait` used in this case is basically a marker trait, and therefore having
1816 /// overlapping impls for it is sound.
1818 /// To handle this, we basically regard the trait as a marker trait, with an additional
1819 /// future-compatibility warning. To avoid accidentally "stabilizing" this feature,
1820 /// it has the following restrictions:
1822 /// 1. The trait must indeed be a marker-like trait (i.e., no items), and must be
1824 /// 2. The trait-ref of both impls must be equal.
1825 /// 3. The trait-ref of both impls must be a trait object type consisting only of
1827 /// 4. Neither of the impls can have any where-clauses.
1829 /// Once `traitobject` 0.1.0 is no longer an active concern, this hack can be removed.
1833 impl<'tcx> TyCtxt<'tcx> {
1834 pub fn typeck_body(self, body: hir::BodyId) -> &'tcx TypeckResults<'tcx> {
1835 self.typeck(self.hir().body_owner_def_id(body))
1838 pub fn provided_trait_methods(self, id: DefId) -> impl 'tcx + Iterator<Item = &'tcx AssocItem> {
1839 self.associated_items(id)
1840 .in_definition_order()
1841 .filter(|item| item.kind == AssocKind::Fn && item.defaultness.has_value())
1844 fn item_name_from_hir(self, def_id: DefId) -> Option<Ident> {
1845 self.hir().get_if_local(def_id).and_then(|node| node.ident())
1848 fn item_name_from_def_id(self, def_id: DefId) -> Option<Symbol> {
1849 if def_id.index == CRATE_DEF_INDEX {
1850 Some(self.crate_name(def_id.krate))
1852 let def_key = self.def_key(def_id);
1853 match def_key.disambiguated_data.data {
1854 // The name of a constructor is that of its parent.
1855 rustc_hir::definitions::DefPathData::Ctor => self.item_name_from_def_id(DefId {
1856 krate: def_id.krate,
1857 index: def_key.parent.unwrap(),
1859 _ => def_key.disambiguated_data.data.get_opt_name(),
1864 /// Look up the name of an item across crates. This does not look at HIR.
1866 /// When possible, this function should be used for cross-crate lookups over
1867 /// [`opt_item_name`] to avoid invalidating the incremental cache. If you
1868 /// need to handle items without a name, or HIR items that will not be
1869 /// serialized cross-crate, or if you need the span of the item, use
1870 /// [`opt_item_name`] instead.
1872 /// [`opt_item_name`]: Self::opt_item_name
1873 pub fn item_name(self, id: DefId) -> Symbol {
1874 // Look at cross-crate items first to avoid invalidating the incremental cache
1875 // unless we have to.
1876 self.item_name_from_def_id(id).unwrap_or_else(|| {
1877 bug!("item_name: no name for {:?}", self.def_path(id));
1881 /// Look up the name and span of an item or [`Node`].
1883 /// See [`item_name`][Self::item_name] for more information.
1884 pub fn opt_item_name(self, def_id: DefId) -> Option<Ident> {
1885 // Look at the HIR first so the span will be correct if this is a local item.
1886 self.item_name_from_hir(def_id)
1887 .or_else(|| self.item_name_from_def_id(def_id).map(Ident::with_dummy_span))
1890 pub fn opt_associated_item(self, def_id: DefId) -> Option<&'tcx AssocItem> {
1891 if let DefKind::AssocConst | DefKind::AssocFn | DefKind::AssocTy = self.def_kind(def_id) {
1892 Some(self.associated_item(def_id))
1898 pub fn field_index(self, hir_id: hir::HirId, typeck_results: &TypeckResults<'_>) -> usize {
1899 typeck_results.field_indices().get(hir_id).cloned().expect("no index for a field")
1902 pub fn find_field_index(self, ident: Ident, variant: &VariantDef) -> Option<usize> {
1906 .position(|field| self.hygienic_eq(ident, field.ident(self), variant.def_id))
1909 /// Returns `true` if the impls are the same polarity and the trait either
1910 /// has no items or is annotated `#[marker]` and prevents item overrides.
1911 pub fn impls_are_allowed_to_overlap(
1915 ) -> Option<ImplOverlapKind> {
1916 // If either trait impl references an error, they're allowed to overlap,
1917 // as one of them essentially doesn't exist.
1918 if self.impl_trait_ref(def_id1).map_or(false, |tr| tr.references_error())
1919 || self.impl_trait_ref(def_id2).map_or(false, |tr| tr.references_error())
1921 return Some(ImplOverlapKind::Permitted { marker: false });
1924 match (self.impl_polarity(def_id1), self.impl_polarity(def_id2)) {
1925 (ImplPolarity::Reservation, _) | (_, ImplPolarity::Reservation) => {
1926 // `#[rustc_reservation_impl]` impls don't overlap with anything
1928 "impls_are_allowed_to_overlap({:?}, {:?}) = Some(Permitted) (reservations)",
1931 return Some(ImplOverlapKind::Permitted { marker: false });
1933 (ImplPolarity::Positive, ImplPolarity::Negative)
1934 | (ImplPolarity::Negative, ImplPolarity::Positive) => {
1935 // `impl AutoTrait for Type` + `impl !AutoTrait for Type`
1937 "impls_are_allowed_to_overlap({:?}, {:?}) - None (differing polarities)",
1942 (ImplPolarity::Positive, ImplPolarity::Positive)
1943 | (ImplPolarity::Negative, ImplPolarity::Negative) => {}
1946 let is_marker_overlap = {
1947 let is_marker_impl = |def_id: DefId| -> bool {
1948 let trait_ref = self.impl_trait_ref(def_id);
1949 trait_ref.map_or(false, |tr| self.trait_def(tr.def_id).is_marker)
1951 is_marker_impl(def_id1) && is_marker_impl(def_id2)
1954 if is_marker_overlap {
1956 "impls_are_allowed_to_overlap({:?}, {:?}) = Some(Permitted) (marker overlap)",
1959 Some(ImplOverlapKind::Permitted { marker: true })
1961 if let Some(self_ty1) = self.issue33140_self_ty(def_id1) {
1962 if let Some(self_ty2) = self.issue33140_self_ty(def_id2) {
1963 if self_ty1 == self_ty2 {
1965 "impls_are_allowed_to_overlap({:?}, {:?}) - issue #33140 HACK",
1968 return Some(ImplOverlapKind::Issue33140);
1971 "impls_are_allowed_to_overlap({:?}, {:?}) - found {:?} != {:?}",
1972 def_id1, def_id2, self_ty1, self_ty2
1978 debug!("impls_are_allowed_to_overlap({:?}, {:?}) = None", def_id1, def_id2);
1983 /// Returns `ty::VariantDef` if `res` refers to a struct,
1984 /// or variant or their constructors, panics otherwise.
1985 pub fn expect_variant_res(self, res: Res) -> &'tcx VariantDef {
1987 Res::Def(DefKind::Variant, did) => {
1988 let enum_did = self.parent(did).unwrap();
1989 self.adt_def(enum_did).variant_with_id(did)
1991 Res::Def(DefKind::Struct | DefKind::Union, did) => self.adt_def(did).non_enum_variant(),
1992 Res::Def(DefKind::Ctor(CtorOf::Variant, ..), variant_ctor_did) => {
1993 let variant_did = self.parent(variant_ctor_did).unwrap();
1994 let enum_did = self.parent(variant_did).unwrap();
1995 self.adt_def(enum_did).variant_with_ctor_id(variant_ctor_did)
1997 Res::Def(DefKind::Ctor(CtorOf::Struct, ..), ctor_did) => {
1998 let struct_did = self.parent(ctor_did).expect("struct ctor has no parent");
1999 self.adt_def(struct_did).non_enum_variant()
2001 _ => bug!("expect_variant_res used with unexpected res {:?}", res),
2005 /// Returns the possibly-auto-generated MIR of a `(DefId, Subst)` pair.
2006 pub fn instance_mir(self, instance: ty::InstanceDef<'tcx>) -> &'tcx Body<'tcx> {
2008 ty::InstanceDef::Item(def) => match self.def_kind(def.did) {
2011 | DefKind::AssocConst
2013 | DefKind::AnonConst
2014 | DefKind::InlineConst => self.mir_for_ctfe_opt_const_arg(def),
2015 // If the caller wants `mir_for_ctfe` of a function they should not be using
2016 // `instance_mir`, so we'll assume const fn also wants the optimized version.
2018 assert_eq!(def.const_param_did, None);
2019 self.optimized_mir(def.did)
2022 ty::InstanceDef::VtableShim(..)
2023 | ty::InstanceDef::ReifyShim(..)
2024 | ty::InstanceDef::Intrinsic(..)
2025 | ty::InstanceDef::FnPtrShim(..)
2026 | ty::InstanceDef::Virtual(..)
2027 | ty::InstanceDef::ClosureOnceShim { .. }
2028 | ty::InstanceDef::DropGlue(..)
2029 | ty::InstanceDef::CloneShim(..) => self.mir_shims(instance),
2033 /// Gets the attributes of a definition.
2034 pub fn get_attrs(self, did: DefId) -> Attributes<'tcx> {
2035 if let Some(did) = did.as_local() {
2036 self.hir().attrs(self.hir().local_def_id_to_hir_id(did))
2038 self.item_attrs(did)
2042 /// Determines whether an item is annotated with an attribute.
2043 pub fn has_attr(self, did: DefId, attr: Symbol) -> bool {
2044 self.sess.contains_name(&self.get_attrs(did), attr)
2047 /// Determines whether an item is annotated with `doc(hidden)`.
2048 pub fn is_doc_hidden(self, did: DefId) -> bool {
2051 .filter_map(|attr| if attr.has_name(sym::doc) { attr.meta_item_list() } else { None })
2052 .any(|items| items.iter().any(|item| item.has_name(sym::hidden)))
2055 /// Returns `true` if this is an `auto trait`.
2056 pub fn trait_is_auto(self, trait_def_id: DefId) -> bool {
2057 self.trait_def(trait_def_id).has_auto_impl
2060 /// Returns layout of a generator. Layout might be unavailable if the
2061 /// generator is tainted by errors.
2062 pub fn generator_layout(self, def_id: DefId) -> Option<&'tcx GeneratorLayout<'tcx>> {
2063 self.optimized_mir(def_id).generator_layout()
2066 /// Given the `DefId` of an impl, returns the `DefId` of the trait it implements.
2067 /// If it implements no trait, returns `None`.
2068 pub fn trait_id_of_impl(self, def_id: DefId) -> Option<DefId> {
2069 self.impl_trait_ref(def_id).map(|tr| tr.def_id)
2072 /// If the given defid describes a method belonging to an impl, returns the
2073 /// `DefId` of the impl that the method belongs to; otherwise, returns `None`.
2074 pub fn impl_of_method(self, def_id: DefId) -> Option<DefId> {
2075 self.opt_associated_item(def_id).and_then(|trait_item| match trait_item.container {
2076 TraitContainer(_) => None,
2077 ImplContainer(def_id) => Some(def_id),
2081 /// Looks up the span of `impl_did` if the impl is local; otherwise returns `Err`
2082 /// with the name of the crate containing the impl.
2083 pub fn span_of_impl(self, impl_did: DefId) -> Result<Span, Symbol> {
2084 if let Some(impl_did) = impl_did.as_local() {
2085 Ok(self.def_span(impl_did))
2087 Err(self.crate_name(impl_did.krate))
2091 /// Hygienically compares a use-site name (`use_name`) for a field or an associated item with
2092 /// its supposed definition name (`def_name`). The method also needs `DefId` of the supposed
2093 /// definition's parent/scope to perform comparison.
2094 pub fn hygienic_eq(self, use_name: Ident, def_name: Ident, def_parent_def_id: DefId) -> bool {
2095 // We could use `Ident::eq` here, but we deliberately don't. The name
2096 // comparison fails frequently, and we want to avoid the expensive
2097 // `normalize_to_macros_2_0()` calls required for the span comparison whenever possible.
2098 use_name.name == def_name.name
2102 .hygienic_eq(def_name.span.ctxt(), self.expn_that_defined(def_parent_def_id))
2105 pub fn adjust_ident(self, mut ident: Ident, scope: DefId) -> Ident {
2106 ident.span.normalize_to_macros_2_0_and_adjust(self.expn_that_defined(scope));
2110 pub fn adjust_ident_and_get_scope(
2115 ) -> (Ident, DefId) {
2118 .normalize_to_macros_2_0_and_adjust(self.expn_that_defined(scope))
2119 .and_then(|actual_expansion| actual_expansion.expn_data().parent_module)
2120 .unwrap_or_else(|| self.parent_module(block).to_def_id());
2124 pub fn is_object_safe(self, key: DefId) -> bool {
2125 self.object_safety_violations(key).is_empty()
2129 /// Yields the parent function's `LocalDefId` if `def_id` is an `impl Trait` definition.
2130 pub fn is_impl_trait_defn(tcx: TyCtxt<'_>, def_id: DefId) -> Option<LocalDefId> {
2131 let def_id = def_id.as_local()?;
2132 if let Node::Item(item) = tcx.hir().get_by_def_id(def_id) {
2133 if let hir::ItemKind::OpaqueTy(ref opaque_ty) = item.kind {
2134 return match opaque_ty.origin {
2135 hir::OpaqueTyOrigin::FnReturn(parent) | hir::OpaqueTyOrigin::AsyncFn(parent) => {
2138 hir::OpaqueTyOrigin::TyAlias => None,
2145 pub fn int_ty(ity: ast::IntTy) -> IntTy {
2147 ast::IntTy::Isize => IntTy::Isize,
2148 ast::IntTy::I8 => IntTy::I8,
2149 ast::IntTy::I16 => IntTy::I16,
2150 ast::IntTy::I32 => IntTy::I32,
2151 ast::IntTy::I64 => IntTy::I64,
2152 ast::IntTy::I128 => IntTy::I128,
2156 pub fn uint_ty(uty: ast::UintTy) -> UintTy {
2158 ast::UintTy::Usize => UintTy::Usize,
2159 ast::UintTy::U8 => UintTy::U8,
2160 ast::UintTy::U16 => UintTy::U16,
2161 ast::UintTy::U32 => UintTy::U32,
2162 ast::UintTy::U64 => UintTy::U64,
2163 ast::UintTy::U128 => UintTy::U128,
2167 pub fn float_ty(fty: ast::FloatTy) -> FloatTy {
2169 ast::FloatTy::F32 => FloatTy::F32,
2170 ast::FloatTy::F64 => FloatTy::F64,
2174 pub fn ast_int_ty(ity: IntTy) -> ast::IntTy {
2176 IntTy::Isize => ast::IntTy::Isize,
2177 IntTy::I8 => ast::IntTy::I8,
2178 IntTy::I16 => ast::IntTy::I16,
2179 IntTy::I32 => ast::IntTy::I32,
2180 IntTy::I64 => ast::IntTy::I64,
2181 IntTy::I128 => ast::IntTy::I128,
2185 pub fn ast_uint_ty(uty: UintTy) -> ast::UintTy {
2187 UintTy::Usize => ast::UintTy::Usize,
2188 UintTy::U8 => ast::UintTy::U8,
2189 UintTy::U16 => ast::UintTy::U16,
2190 UintTy::U32 => ast::UintTy::U32,
2191 UintTy::U64 => ast::UintTy::U64,
2192 UintTy::U128 => ast::UintTy::U128,
2196 pub fn provide(providers: &mut ty::query::Providers) {
2197 closure::provide(providers);
2198 context::provide(providers);
2199 erase_regions::provide(providers);
2200 layout::provide(providers);
2201 util::provide(providers);
2202 print::provide(providers);
2203 super::util::bug::provide(providers);
2204 super::middle::provide(providers);
2205 *providers = ty::query::Providers {
2206 trait_impls_of: trait_def::trait_impls_of_provider,
2207 type_uninhabited_from: inhabitedness::type_uninhabited_from,
2208 const_param_default: consts::const_param_default,
2209 vtable_allocation: vtable::vtable_allocation_provider,
2214 /// A map for the local crate mapping each type to a vector of its
2215 /// inherent impls. This is not meant to be used outside of coherence;
2216 /// rather, you should request the vector for a specific type via
2217 /// `tcx.inherent_impls(def_id)` so as to minimize your dependencies
2218 /// (constructing this map requires touching the entire crate).
2219 #[derive(Clone, Debug, Default, HashStable)]
2220 pub struct CrateInherentImpls {
2221 pub inherent_impls: LocalDefIdMap<Vec<DefId>>,
2224 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, HashStable)]
2225 pub struct SymbolName<'tcx> {
2226 /// `&str` gives a consistent ordering, which ensures reproducible builds.
2227 pub name: &'tcx str,
2230 impl<'tcx> SymbolName<'tcx> {
2231 pub fn new(tcx: TyCtxt<'tcx>, name: &str) -> SymbolName<'tcx> {
2233 name: unsafe { str::from_utf8_unchecked(tcx.arena.alloc_slice(name.as_bytes())) },
2238 impl<'tcx> fmt::Display for SymbolName<'tcx> {
2239 fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
2240 fmt::Display::fmt(&self.name, fmt)
2244 impl<'tcx> fmt::Debug for SymbolName<'tcx> {
2245 fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
2246 fmt::Display::fmt(&self.name, fmt)
2250 #[derive(Debug, Default, Copy, Clone)]
2251 pub struct FoundRelationships {
2252 /// This is true if we identified that this Ty (`?T`) is found in a `?T: Foo`
2253 /// obligation, where:
2255 /// * `Foo` is not `Sized`
2256 /// * `(): Foo` may be satisfied
2257 pub self_in_trait: bool,
2258 /// This is true if we identified that this Ty (`?T`) is found in a `<_ as
2259 /// _>::AssocType = ?T`