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 rustc-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::*;
20 use rustc_data_structures::fingerprint::Fingerprint;
23 use crate::metadata::ModChild;
24 use crate::middle::privacy::AccessLevels;
25 use crate::mir::{Body, GeneratorLayout};
26 use crate::traits::{self, Reveal};
28 use crate::ty::fast_reject::SimplifiedType;
29 use crate::ty::subst::{GenericArg, InternalSubsts, Subst, SubstsRef};
30 use crate::ty::util::Discr;
32 use rustc_attr as attr;
33 use rustc_data_structures::fx::{FxHashMap, FxHashSet, FxIndexMap};
34 use rustc_data_structures::intern::{Interned, WithStableHash};
35 use rustc_data_structures::stable_hasher::{HashStable, StableHasher};
36 use rustc_data_structures::tagged_ptr::CopyTaggedPtr;
38 use rustc_hir::def::{CtorKind, CtorOf, DefKind, Res};
39 use rustc_hir::def_id::{CrateNum, DefId, LocalDefId, LocalDefIdMap, CRATE_DEF_INDEX};
41 use rustc_macros::HashStable;
42 use rustc_query_system::ich::StableHashingContext;
43 use rustc_session::cstore::CrateStoreDyn;
44 use rustc_span::symbol::{kw, sym, Ident, Symbol};
46 use rustc_target::abi::Align;
50 use std::ops::ControlFlow;
53 pub use crate::ty::diagnostics::*;
54 pub use rustc_type_ir::InferTy::*;
55 pub use rustc_type_ir::*;
57 pub use self::binding::BindingMode;
58 pub use self::binding::BindingMode::*;
59 pub use self::closure::{
60 is_ancestor_or_same_capture, place_to_string_for_capture, BorrowKind, CaptureInfo,
61 CapturedPlace, ClosureKind, MinCaptureInformationMap, MinCaptureList,
62 RootVariableMinCaptureList, UpvarCapture, UpvarCaptureMap, UpvarId, UpvarListMap, UpvarPath,
65 pub use self::consts::{
66 Const, ConstInt, ConstKind, ConstS, InferConst, ScalarInt, Unevaluated, ValTree,
68 pub use self::context::{
69 tls, CanonicalUserType, CanonicalUserTypeAnnotation, CanonicalUserTypeAnnotations,
70 CtxtInterners, DelaySpanBugEmitted, FreeRegionInfo, GeneratorDiagnosticData,
71 GeneratorInteriorTypeCause, GlobalCtxt, Lift, OnDiskCache, TyCtxt, TypeckResults, UserType,
72 UserTypeAnnotationIndex,
74 pub use self::instance::{Instance, InstanceDef};
75 pub use self::list::List;
76 pub use self::sty::BoundRegionKind::*;
77 pub use self::sty::RegionKind::*;
78 pub use self::sty::TyKind::*;
80 Binder, BoundRegion, BoundRegionKind, BoundTy, BoundTyKind, BoundVar, BoundVariableKind,
81 CanonicalPolyFnSig, ClosureSubsts, ClosureSubstsParts, ConstVid, EarlyBoundRegion,
82 ExistentialPredicate, ExistentialProjection, ExistentialTraitRef, FnSig, FreeRegion, GenSig,
83 GeneratorSubsts, GeneratorSubstsParts, InlineConstSubsts, InlineConstSubstsParts, ParamConst,
84 ParamTy, PolyExistentialProjection, PolyExistentialTraitRef, PolyFnSig, PolyGenSig,
85 PolyTraitRef, ProjectionTy, Region, RegionKind, RegionVid, TraitRef, TyKind, TypeAndMut,
86 UpvarSubsts, VarianceDiagInfo,
88 pub use self::trait_def::TraitDef;
99 pub mod inhabitedness;
101 pub mod normalize_erasing_regions;
122 mod structural_impls;
127 pub type RegisteredTools = FxHashSet<Ident>;
130 pub struct ResolverOutputs {
131 pub definitions: rustc_hir::definitions::Definitions,
132 pub cstore: Box<CrateStoreDyn>,
133 pub visibilities: FxHashMap<LocalDefId, Visibility>,
134 pub access_levels: AccessLevels,
135 pub extern_crate_map: FxHashMap<LocalDefId, CrateNum>,
136 pub maybe_unused_trait_imports: FxHashSet<LocalDefId>,
137 pub maybe_unused_extern_crates: Vec<(LocalDefId, Span)>,
138 pub reexport_map: FxHashMap<LocalDefId, Vec<ModChild>>,
139 pub glob_map: FxHashMap<LocalDefId, FxHashSet<Symbol>>,
140 /// Extern prelude entries. The value is `true` if the entry was introduced
141 /// via `extern crate` item and not `--extern` option or compiler built-in.
142 pub extern_prelude: FxHashMap<Symbol, bool>,
143 pub main_def: Option<MainDefinition>,
144 pub trait_impls: FxIndexMap<DefId, Vec<LocalDefId>>,
145 /// A list of proc macro LocalDefIds, written out in the order in which
146 /// they are declared in the static array generated by proc_macro_harness.
147 pub proc_macros: Vec<LocalDefId>,
148 /// Mapping from ident span to path span for paths that don't exist as written, but that
149 /// exist under `std`. For example, wrote `str::from_utf8` instead of `std::str::from_utf8`.
150 pub confused_type_with_std_module: FxHashMap<Span, Span>,
151 pub registered_tools: RegisteredTools,
154 #[derive(Clone, Copy, Debug)]
155 pub struct MainDefinition {
156 pub res: Res<ast::NodeId>,
161 impl MainDefinition {
162 pub fn opt_fn_def_id(self) -> Option<DefId> {
163 if let Res::Def(DefKind::Fn, def_id) = self.res { Some(def_id) } else { None }
167 /// The "header" of an impl is everything outside the body: a Self type, a trait
168 /// ref (in the case of a trait impl), and a set of predicates (from the
169 /// bounds / where-clauses).
170 #[derive(Clone, Debug, TypeFoldable)]
171 pub struct ImplHeader<'tcx> {
172 pub impl_def_id: DefId,
173 pub self_ty: Ty<'tcx>,
174 pub trait_ref: Option<TraitRef<'tcx>>,
175 pub predicates: Vec<Predicate<'tcx>>,
178 #[derive(Copy, Clone, Debug, TypeFoldable)]
179 pub enum ImplSubject<'tcx> {
180 Trait(TraitRef<'tcx>),
196 pub enum ImplPolarity {
197 /// `impl Trait for Type`
199 /// `impl !Trait for Type`
201 /// `#[rustc_reservation_impl] impl Trait for Type`
203 /// This is a "stability hack", not a real Rust feature.
204 /// See #64631 for details.
209 /// Flips polarity by turning `Positive` into `Negative` and `Negative` into `Positive`.
210 pub fn flip(&self) -> Option<ImplPolarity> {
212 ImplPolarity::Positive => Some(ImplPolarity::Negative),
213 ImplPolarity::Negative => Some(ImplPolarity::Positive),
214 ImplPolarity::Reservation => None,
219 impl fmt::Display for ImplPolarity {
220 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
222 Self::Positive => f.write_str("positive"),
223 Self::Negative => f.write_str("negative"),
224 Self::Reservation => f.write_str("reservation"),
229 #[derive(Clone, Debug, PartialEq, Eq, Copy, Hash, TyEncodable, TyDecodable, HashStable)]
230 pub enum Visibility {
231 /// Visible everywhere (including in other crates).
233 /// Visible only in the given crate-local module.
235 /// Not visible anywhere in the local crate. This is the visibility of private external items.
239 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, HashStable, TyEncodable, TyDecodable)]
240 pub enum BoundConstness {
243 /// `T: ~const Trait`
245 /// Requires resolving to const only when we are in a const context.
249 impl BoundConstness {
250 /// Reduce `self` and `constness` to two possible combined states instead of four.
251 pub fn and(&mut self, constness: hir::Constness) -> hir::Constness {
252 match (constness, self) {
253 (hir::Constness::Const, BoundConstness::ConstIfConst) => hir::Constness::Const,
255 *this = BoundConstness::NotConst;
256 hir::Constness::NotConst
262 impl fmt::Display for BoundConstness {
263 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
265 Self::NotConst => f.write_str("normal"),
266 Self::ConstIfConst => f.write_str("`~const`"),
283 pub struct ClosureSizeProfileData<'tcx> {
284 /// Tuple containing the types of closure captures before the feature `capture_disjoint_fields`
285 pub before_feature_tys: Ty<'tcx>,
286 /// Tuple containing the types of closure captures after the feature `capture_disjoint_fields`
287 pub after_feature_tys: Ty<'tcx>,
290 pub trait DefIdTree: Copy {
291 fn parent(self, id: DefId) -> Option<DefId>;
294 fn local_parent(self, id: LocalDefId) -> Option<LocalDefId> {
295 Some(self.parent(id.to_def_id())?.expect_local())
298 fn is_descendant_of(self, mut descendant: DefId, ancestor: DefId) -> bool {
299 if descendant.krate != ancestor.krate {
303 while descendant != ancestor {
304 match self.parent(descendant) {
305 Some(parent) => descendant = parent,
306 None => return false,
313 impl<'tcx> DefIdTree for TyCtxt<'tcx> {
314 fn parent(self, id: DefId) -> Option<DefId> {
315 self.def_key(id).parent.map(|index| DefId { index, ..id })
320 pub fn from_hir(visibility: &hir::Visibility<'_>, id: hir::HirId, tcx: TyCtxt<'_>) -> Self {
321 match visibility.node {
322 hir::VisibilityKind::Public => Visibility::Public,
323 hir::VisibilityKind::Crate(_) => Visibility::Restricted(DefId::local(CRATE_DEF_INDEX)),
324 hir::VisibilityKind::Restricted { ref path, .. } => match path.res {
325 // If there is no resolution, `resolve` will have already reported an error, so
326 // assume that the visibility is public to avoid reporting more privacy errors.
327 Res::Err => Visibility::Public,
328 def => Visibility::Restricted(def.def_id()),
330 hir::VisibilityKind::Inherited => {
331 Visibility::Restricted(tcx.parent_module(id).to_def_id())
336 /// Returns `true` if an item with this visibility is accessible from the given block.
337 pub fn is_accessible_from<T: DefIdTree>(self, module: DefId, tree: T) -> bool {
338 let restriction = match self {
339 // Public items are visible everywhere.
340 Visibility::Public => return true,
341 // Private items from other crates are visible nowhere.
342 Visibility::Invisible => return false,
343 // Restricted items are visible in an arbitrary local module.
344 Visibility::Restricted(other) if other.krate != module.krate => return false,
345 Visibility::Restricted(module) => module,
348 tree.is_descendant_of(module, restriction)
351 /// Returns `true` if this visibility is at least as accessible as the given visibility
352 pub fn is_at_least<T: DefIdTree>(self, vis: Visibility, tree: T) -> bool {
353 let vis_restriction = match vis {
354 Visibility::Public => return self == Visibility::Public,
355 Visibility::Invisible => return true,
356 Visibility::Restricted(module) => module,
359 self.is_accessible_from(vis_restriction, tree)
362 // Returns `true` if this item is visible anywhere in the local crate.
363 pub fn is_visible_locally(self) -> bool {
365 Visibility::Public => true,
366 Visibility::Restricted(def_id) => def_id.is_local(),
367 Visibility::Invisible => false,
371 pub fn is_public(self) -> bool {
372 matches!(self, Visibility::Public)
376 /// The crate variances map is computed during typeck and contains the
377 /// variance of every item in the local crate. You should not use it
378 /// directly, because to do so will make your pass dependent on the
379 /// HIR of every item in the local crate. Instead, use
380 /// `tcx.variances_of()` to get the variance for a *particular*
382 #[derive(HashStable, Debug)]
383 pub struct CrateVariancesMap<'tcx> {
384 /// For each item with generics, maps to a vector of the variance
385 /// of its generics. If an item has no generics, it will have no
387 pub variances: FxHashMap<DefId, &'tcx [ty::Variance]>,
390 // Contains information needed to resolve types and (in the future) look up
391 // the types of AST nodes.
392 #[derive(Copy, Clone, PartialEq, Eq, Hash)]
393 pub struct CReaderCacheKey {
394 pub cnum: Option<CrateNum>,
398 /// Represents a type.
401 /// - This is a very "dumb" struct (with no derives and no `impls`).
402 /// - Values of this type are always interned and thus unique, and are stored
403 /// as an `Interned<TyS>`.
404 /// - `Ty` (which contains a reference to a `Interned<TyS>`) or `Interned<TyS>`
405 /// should be used everywhere instead of `TyS`. In particular, `Ty` has most
406 /// of the relevant methods.
407 #[derive(PartialEq, Eq, PartialOrd, Ord)]
408 #[allow(rustc::usage_of_ty_tykind)]
409 crate struct TyS<'tcx> {
410 /// This field shouldn't be used directly and may be removed in the future.
411 /// Use `Ty::kind()` instead.
414 /// This field provides fast access to information that is also contained
417 /// This field shouldn't be used directly and may be removed in the future.
418 /// Use `Ty::flags()` instead.
421 /// This field provides fast access to information that is also contained
424 /// This is a kind of confusing thing: it stores the smallest
427 /// (a) the binder itself captures nothing but
428 /// (b) all the late-bound things within the type are captured
429 /// by some sub-binder.
431 /// So, for a type without any late-bound things, like `u32`, this
432 /// will be *innermost*, because that is the innermost binder that
433 /// captures nothing. But for a type `&'D u32`, where `'D` is a
434 /// late-bound region with De Bruijn index `D`, this would be `D + 1`
435 /// -- the binder itself does not capture `D`, but `D` is captured
436 /// by an inner binder.
438 /// We call this concept an "exclusive" binder `D` because all
439 /// De Bruijn indices within the type are contained within `0..D`
441 outer_exclusive_binder: ty::DebruijnIndex,
444 // `TyS` is used a lot. Make sure it doesn't unintentionally get bigger.
445 #[cfg(all(target_arch = "x86_64", target_pointer_width = "64"))]
446 static_assert_size!(TyS<'_>, 40);
448 // We are actually storing a stable hash cache next to the type, so let's
449 // also check the full size
450 #[cfg(all(target_arch = "x86_64", target_pointer_width = "64"))]
451 static_assert_size!(WithStableHash<TyS<'_>>, 56);
453 /// Use this rather than `TyS`, whenever possible.
454 #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, HashStable)]
455 #[rustc_diagnostic_item = "Ty"]
456 #[rustc_pass_by_value]
457 pub struct Ty<'tcx>(Interned<'tcx, WithStableHash<TyS<'tcx>>>);
459 // Statics only used for internal testing.
460 pub static BOOL_TY: Ty<'static> = Ty(Interned::new_unchecked(&WithStableHash {
462 stable_hash: Fingerprint::ZERO,
464 const BOOL_TYS: TyS<'static> = TyS {
466 flags: TypeFlags::empty(),
467 outer_exclusive_binder: DebruijnIndex::from_usize(0),
470 impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for TyS<'tcx> {
472 fn hash_stable(&self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher) {
476 // The other fields just provide fast access to information that is
477 // also contained in `kind`, so no need to hash them.
480 outer_exclusive_binder: _,
483 kind.hash_stable(hcx, hasher)
487 impl ty::EarlyBoundRegion {
488 /// Does this early bound region have a name? Early bound regions normally
489 /// always have names except when using anonymous lifetimes (`'_`).
490 pub fn has_name(&self) -> bool {
491 self.name != kw::UnderscoreLifetime
495 /// Represents a predicate.
497 /// See comments on `TyS`, which apply here too (albeit for
498 /// `PredicateS`/`Predicate` rather than `TyS`/`Ty`).
500 crate struct PredicateS<'tcx> {
501 kind: Binder<'tcx, PredicateKind<'tcx>>,
503 /// See the comment for the corresponding field of [TyS].
504 outer_exclusive_binder: ty::DebruijnIndex,
507 // This type is used a lot. Make sure it doesn't unintentionally get bigger.
508 #[cfg(all(target_arch = "x86_64", target_pointer_width = "64"))]
509 static_assert_size!(PredicateS<'_>, 56);
511 /// Use this rather than `PredicateS`, whenever possible.
512 #[derive(Clone, Copy, PartialEq, Eq, Hash)]
513 #[rustc_pass_by_value]
514 pub struct Predicate<'tcx>(Interned<'tcx, PredicateS<'tcx>>);
516 impl<'tcx> Predicate<'tcx> {
517 /// Gets the inner `Binder<'tcx, PredicateKind<'tcx>>`.
519 pub fn kind(self) -> Binder<'tcx, PredicateKind<'tcx>> {
524 pub fn flags(self) -> TypeFlags {
529 pub fn outer_exclusive_binder(self) -> DebruijnIndex {
530 self.0.outer_exclusive_binder
533 /// Flips the polarity of a Predicate.
535 /// Given `T: Trait` predicate it returns `T: !Trait` and given `T: !Trait` returns `T: Trait`.
536 pub fn flip_polarity(self, tcx: TyCtxt<'tcx>) -> Option<Predicate<'tcx>> {
539 .map_bound(|kind| match kind {
540 PredicateKind::Trait(TraitPredicate { trait_ref, constness, polarity }) => {
541 Some(PredicateKind::Trait(TraitPredicate {
544 polarity: polarity.flip()?,
552 Some(tcx.mk_predicate(kind))
556 impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for Predicate<'tcx> {
557 fn hash_stable(&self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher) {
561 // The other fields just provide fast access to information that is
562 // also contained in `kind`, so no need to hash them.
564 outer_exclusive_binder: _,
567 kind.hash_stable(hcx, hasher);
571 #[derive(Clone, Copy, PartialEq, Eq, Hash, TyEncodable, TyDecodable)]
572 #[derive(HashStable, TypeFoldable)]
573 pub enum PredicateKind<'tcx> {
574 /// Corresponds to `where Foo: Bar<A, B, C>`. `Foo` here would be
575 /// the `Self` type of the trait reference and `A`, `B`, and `C`
576 /// would be the type parameters.
577 Trait(TraitPredicate<'tcx>),
580 RegionOutlives(RegionOutlivesPredicate<'tcx>),
583 TypeOutlives(TypeOutlivesPredicate<'tcx>),
585 /// `where <T as TraitRef>::Name == X`, approximately.
586 /// See the `ProjectionPredicate` struct for details.
587 Projection(ProjectionPredicate<'tcx>),
589 /// No syntax: `T` well-formed.
590 WellFormed(GenericArg<'tcx>),
592 /// Trait must be object-safe.
595 /// No direct syntax. May be thought of as `where T: FnFoo<...>`
596 /// for some substitutions `...` and `T` being a closure type.
597 /// Satisfied (or refuted) once we know the closure's kind.
598 ClosureKind(DefId, SubstsRef<'tcx>, ClosureKind),
602 /// This obligation is created most often when we have two
603 /// unresolved type variables and hence don't have enough
604 /// information to process the subtyping obligation yet.
605 Subtype(SubtypePredicate<'tcx>),
607 /// `T1` coerced to `T2`
609 /// Like a subtyping obligation, this is created most often
610 /// when we have two unresolved type variables and hence
611 /// don't have enough information to process the coercion
612 /// obligation yet. At the moment, we actually process coercions
613 /// very much like subtyping and don't handle the full coercion
615 Coerce(CoercePredicate<'tcx>),
617 /// Constant initializer must evaluate successfully.
618 ConstEvaluatable(ty::Unevaluated<'tcx, ()>),
620 /// Constants must be equal. The first component is the const that is expected.
621 ConstEquate(Const<'tcx>, Const<'tcx>),
623 /// Represents a type found in the environment that we can use for implied bounds.
625 /// Only used for Chalk.
626 TypeWellFormedFromEnv(Ty<'tcx>),
629 /// The crate outlives map is computed during typeck and contains the
630 /// outlives of every item in the local crate. You should not use it
631 /// directly, because to do so will make your pass dependent on the
632 /// HIR of every item in the local crate. Instead, use
633 /// `tcx.inferred_outlives_of()` to get the outlives for a *particular*
635 #[derive(HashStable, Debug)]
636 pub struct CratePredicatesMap<'tcx> {
637 /// For each struct with outlive bounds, maps to a vector of the
638 /// predicate of its outlive bounds. If an item has no outlives
639 /// bounds, it will have no entry.
640 pub predicates: FxHashMap<DefId, &'tcx [(Predicate<'tcx>, Span)]>,
643 impl<'tcx> Predicate<'tcx> {
644 /// Performs a substitution suitable for going from a
645 /// poly-trait-ref to supertraits that must hold if that
646 /// poly-trait-ref holds. This is slightly different from a normal
647 /// substitution in terms of what happens with bound regions. See
648 /// lengthy comment below for details.
649 pub fn subst_supertrait(
652 trait_ref: &ty::PolyTraitRef<'tcx>,
653 ) -> Predicate<'tcx> {
654 // The interaction between HRTB and supertraits is not entirely
655 // obvious. Let me walk you (and myself) through an example.
657 // Let's start with an easy case. Consider two traits:
659 // trait Foo<'a>: Bar<'a,'a> { }
660 // trait Bar<'b,'c> { }
662 // Now, if we have a trait reference `for<'x> T: Foo<'x>`, then
663 // we can deduce that `for<'x> T: Bar<'x,'x>`. Basically, if we
664 // knew that `Foo<'x>` (for any 'x) then we also know that
665 // `Bar<'x,'x>` (for any 'x). This more-or-less falls out from
666 // normal substitution.
668 // In terms of why this is sound, the idea is that whenever there
669 // is an impl of `T:Foo<'a>`, it must show that `T:Bar<'a,'a>`
670 // holds. So if there is an impl of `T:Foo<'a>` that applies to
671 // all `'a`, then we must know that `T:Bar<'a,'a>` holds for all
674 // Another example to be careful of is this:
676 // trait Foo1<'a>: for<'b> Bar1<'a,'b> { }
677 // trait Bar1<'b,'c> { }
679 // Here, if we have `for<'x> T: Foo1<'x>`, then what do we know?
680 // The answer is that we know `for<'x,'b> T: Bar1<'x,'b>`. The
681 // reason is similar to the previous example: any impl of
682 // `T:Foo1<'x>` must show that `for<'b> T: Bar1<'x, 'b>`. So
683 // basically we would want to collapse the bound lifetimes from
684 // the input (`trait_ref`) and the supertraits.
686 // To achieve this in practice is fairly straightforward. Let's
687 // consider the more complicated scenario:
689 // - We start out with `for<'x> T: Foo1<'x>`. In this case, `'x`
690 // has a De Bruijn index of 1. We want to produce `for<'x,'b> T: Bar1<'x,'b>`,
691 // where both `'x` and `'b` would have a DB index of 1.
692 // The substitution from the input trait-ref is therefore going to be
693 // `'a => 'x` (where `'x` has a DB index of 1).
694 // - The supertrait-ref is `for<'b> Bar1<'a,'b>`, where `'a` is an
695 // early-bound parameter and `'b' is a late-bound parameter with a
697 // - If we replace `'a` with `'x` from the input, it too will have
698 // a DB index of 1, and thus we'll have `for<'x,'b> Bar1<'x,'b>`
699 // just as we wanted.
701 // There is only one catch. If we just apply the substitution `'a
702 // => 'x` to `for<'b> Bar1<'a,'b>`, the substitution code will
703 // adjust the DB index because we substituting into a binder (it
704 // tries to be so smart...) resulting in `for<'x> for<'b>
705 // Bar1<'x,'b>` (we have no syntax for this, so use your
706 // imagination). Basically the 'x will have DB index of 2 and 'b
707 // will have DB index of 1. Not quite what we want. So we apply
708 // the substitution to the *contents* of the trait reference,
709 // rather than the trait reference itself (put another way, the
710 // substitution code expects equal binding levels in the values
711 // from the substitution and the value being substituted into, and
712 // this trick achieves that).
714 // Working through the second example:
715 // trait_ref: for<'x> T: Foo1<'^0.0>; substs: [T, '^0.0]
716 // predicate: for<'b> Self: Bar1<'a, '^0.0>; substs: [Self, 'a, '^0.0]
717 // We want to end up with:
718 // for<'x, 'b> T: Bar1<'^0.0, '^0.1>
720 // 1) We must shift all bound vars in predicate by the length
721 // of trait ref's bound vars. So, we would end up with predicate like
722 // Self: Bar1<'a, '^0.1>
723 // 2) We can then apply the trait substs to this, ending up with
724 // T: Bar1<'^0.0, '^0.1>
725 // 3) Finally, to create the final bound vars, we concatenate the bound
726 // vars of the trait ref with those of the predicate:
728 let bound_pred = self.kind();
729 let pred_bound_vars = bound_pred.bound_vars();
730 let trait_bound_vars = trait_ref.bound_vars();
731 // 1) Self: Bar1<'a, '^0.0> -> Self: Bar1<'a, '^0.1>
733 tcx.shift_bound_var_indices(trait_bound_vars.len(), bound_pred.skip_binder());
734 // 2) Self: Bar1<'a, '^0.1> -> T: Bar1<'^0.0, '^0.1>
735 let new = shifted_pred.subst(tcx, trait_ref.skip_binder().substs);
736 // 3) ['x] + ['b] -> ['x, 'b]
738 tcx.mk_bound_variable_kinds(trait_bound_vars.iter().chain(pred_bound_vars));
739 tcx.reuse_or_mk_predicate(self, ty::Binder::bind_with_vars(new, bound_vars))
743 #[derive(Clone, Copy, PartialEq, Eq, Hash, TyEncodable, TyDecodable)]
744 #[derive(HashStable, TypeFoldable)]
745 pub struct TraitPredicate<'tcx> {
746 pub trait_ref: TraitRef<'tcx>,
748 pub constness: BoundConstness,
750 /// If polarity is Positive: we are proving that the trait is implemented.
752 /// If polarity is Negative: we are proving that a negative impl of this trait
753 /// exists. (Note that coherence also checks whether negative impls of supertraits
754 /// exist via a series of predicates.)
756 /// If polarity is Reserved: that's a bug.
757 pub polarity: ImplPolarity,
760 pub type PolyTraitPredicate<'tcx> = ty::Binder<'tcx, TraitPredicate<'tcx>>;
762 impl<'tcx> TraitPredicate<'tcx> {
763 pub fn remap_constness(&mut self, tcx: TyCtxt<'tcx>, param_env: &mut ParamEnv<'tcx>) {
764 if unlikely!(Some(self.trait_ref.def_id) == tcx.lang_items().drop_trait()) {
765 // remap without changing constness of this predicate.
766 // this is because `T: ~const Drop` has a different meaning to `T: Drop`
767 // FIXME(fee1-dead): remove this logic after beta bump
768 param_env.remap_constness_with(self.constness)
770 *param_env = param_env.with_constness(self.constness.and(param_env.constness()))
774 /// Remap the constness of this predicate before emitting it for diagnostics.
775 pub fn remap_constness_diag(&mut self, param_env: ParamEnv<'tcx>) {
776 // this is different to `remap_constness` that callees want to print this predicate
777 // in case of selection errors. `T: ~const Drop` bounds cannot end up here when the
778 // param_env is not const because we it is always satisfied in non-const contexts.
779 if let hir::Constness::NotConst = param_env.constness() {
780 self.constness = ty::BoundConstness::NotConst;
784 pub fn def_id(self) -> DefId {
785 self.trait_ref.def_id
788 pub fn self_ty(self) -> Ty<'tcx> {
789 self.trait_ref.self_ty()
793 pub fn is_const_if_const(self) -> bool {
794 self.constness == BoundConstness::ConstIfConst
798 impl<'tcx> PolyTraitPredicate<'tcx> {
799 pub fn def_id(self) -> DefId {
800 // Ok to skip binder since trait `DefId` does not care about regions.
801 self.skip_binder().def_id()
804 pub fn self_ty(self) -> ty::Binder<'tcx, Ty<'tcx>> {
805 self.map_bound(|trait_ref| trait_ref.self_ty())
808 /// Remap the constness of this predicate before emitting it for diagnostics.
809 pub fn remap_constness_diag(&mut self, param_env: ParamEnv<'tcx>) {
810 *self = self.map_bound(|mut p| {
811 p.remap_constness_diag(param_env);
817 pub fn is_const_if_const(self) -> bool {
818 self.skip_binder().is_const_if_const()
822 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)]
823 #[derive(HashStable, TypeFoldable)]
824 pub struct OutlivesPredicate<A, B>(pub A, pub B); // `A: B`
825 pub type RegionOutlivesPredicate<'tcx> = OutlivesPredicate<ty::Region<'tcx>, ty::Region<'tcx>>;
826 pub type TypeOutlivesPredicate<'tcx> = OutlivesPredicate<Ty<'tcx>, ty::Region<'tcx>>;
827 pub type PolyRegionOutlivesPredicate<'tcx> = ty::Binder<'tcx, RegionOutlivesPredicate<'tcx>>;
828 pub type PolyTypeOutlivesPredicate<'tcx> = ty::Binder<'tcx, TypeOutlivesPredicate<'tcx>>;
830 /// Encodes that `a` must be a subtype of `b`. The `a_is_expected` flag indicates
831 /// whether the `a` type is the type that we should label as "expected" when
832 /// presenting user diagnostics.
833 #[derive(Clone, Copy, PartialEq, Eq, Hash, Debug, TyEncodable, TyDecodable)]
834 #[derive(HashStable, TypeFoldable)]
835 pub struct SubtypePredicate<'tcx> {
836 pub a_is_expected: bool,
840 pub type PolySubtypePredicate<'tcx> = ty::Binder<'tcx, SubtypePredicate<'tcx>>;
842 /// Encodes that we have to coerce *from* the `a` type to the `b` type.
843 #[derive(Clone, Copy, PartialEq, Eq, Hash, Debug, TyEncodable, TyDecodable)]
844 #[derive(HashStable, TypeFoldable)]
845 pub struct CoercePredicate<'tcx> {
849 pub type PolyCoercePredicate<'tcx> = ty::Binder<'tcx, CoercePredicate<'tcx>>;
851 #[derive(Debug, Copy, Clone, PartialEq, Eq, Hash, PartialOrd, Ord, TyEncodable, TyDecodable)]
852 #[derive(HashStable, TypeFoldable)]
853 pub enum Term<'tcx> {
858 impl<'tcx> From<Ty<'tcx>> for Term<'tcx> {
859 fn from(ty: Ty<'tcx>) -> Self {
864 impl<'tcx> From<Const<'tcx>> for Term<'tcx> {
865 fn from(c: Const<'tcx>) -> Self {
870 impl<'tcx> Term<'tcx> {
871 pub fn ty(&self) -> Option<Ty<'tcx>> {
872 if let Term::Ty(ty) = self { Some(*ty) } else { None }
874 pub fn ct(&self) -> Option<Const<'tcx>> {
875 if let Term::Const(c) = self { Some(*c) } else { None }
879 /// This kind of predicate has no *direct* correspondent in the
880 /// syntax, but it roughly corresponds to the syntactic forms:
882 /// 1. `T: TraitRef<..., Item = Type>`
883 /// 2. `<T as TraitRef<...>>::Item == Type` (NYI)
885 /// In particular, form #1 is "desugared" to the combination of a
886 /// normal trait predicate (`T: TraitRef<...>`) and one of these
887 /// predicates. Form #2 is a broader form in that it also permits
888 /// equality between arbitrary types. Processing an instance of
889 /// Form #2 eventually yields one of these `ProjectionPredicate`
890 /// instances to normalize the LHS.
891 #[derive(Copy, Clone, PartialEq, Eq, Hash, TyEncodable, TyDecodable)]
892 #[derive(HashStable, TypeFoldable)]
893 pub struct ProjectionPredicate<'tcx> {
894 pub projection_ty: ProjectionTy<'tcx>,
895 pub term: Term<'tcx>,
898 pub type PolyProjectionPredicate<'tcx> = Binder<'tcx, ProjectionPredicate<'tcx>>;
900 impl<'tcx> PolyProjectionPredicate<'tcx> {
901 /// Returns the `DefId` of the trait of the associated item being projected.
903 pub fn trait_def_id(&self, tcx: TyCtxt<'tcx>) -> DefId {
904 self.skip_binder().projection_ty.trait_def_id(tcx)
907 /// Get the [PolyTraitRef] required for this projection to be well formed.
908 /// Note that for generic associated types the predicates of the associated
909 /// type also need to be checked.
911 pub fn required_poly_trait_ref(&self, tcx: TyCtxt<'tcx>) -> PolyTraitRef<'tcx> {
912 // Note: unlike with `TraitRef::to_poly_trait_ref()`,
913 // `self.0.trait_ref` is permitted to have escaping regions.
914 // This is because here `self` has a `Binder` and so does our
915 // return value, so we are preserving the number of binding
917 self.map_bound(|predicate| predicate.projection_ty.trait_ref(tcx))
920 pub fn term(&self) -> Binder<'tcx, Term<'tcx>> {
921 self.map_bound(|predicate| predicate.term)
924 /// The `DefId` of the `TraitItem` for the associated type.
926 /// Note that this is not the `DefId` of the `TraitRef` containing this
927 /// associated type, which is in `tcx.associated_item(projection_def_id()).container`.
928 pub fn projection_def_id(&self) -> DefId {
929 // Ok to skip binder since trait `DefId` does not care about regions.
930 self.skip_binder().projection_ty.item_def_id
934 pub trait ToPolyTraitRef<'tcx> {
935 fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx>;
938 impl<'tcx> ToPolyTraitRef<'tcx> for PolyTraitPredicate<'tcx> {
939 fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx> {
940 self.map_bound_ref(|trait_pred| trait_pred.trait_ref)
944 pub trait ToPredicate<'tcx> {
945 fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>;
948 impl<'tcx> ToPredicate<'tcx> for Binder<'tcx, PredicateKind<'tcx>> {
950 fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> {
951 tcx.mk_predicate(self)
955 impl<'tcx> ToPredicate<'tcx> for PolyTraitPredicate<'tcx> {
956 fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> {
957 self.map_bound(PredicateKind::Trait).to_predicate(tcx)
961 impl<'tcx> ToPredicate<'tcx> for PolyRegionOutlivesPredicate<'tcx> {
962 fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> {
963 self.map_bound(PredicateKind::RegionOutlives).to_predicate(tcx)
967 impl<'tcx> ToPredicate<'tcx> for PolyTypeOutlivesPredicate<'tcx> {
968 fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> {
969 self.map_bound(PredicateKind::TypeOutlives).to_predicate(tcx)
973 impl<'tcx> ToPredicate<'tcx> for PolyProjectionPredicate<'tcx> {
974 fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx> {
975 self.map_bound(PredicateKind::Projection).to_predicate(tcx)
979 impl<'tcx> Predicate<'tcx> {
980 pub fn to_opt_poly_trait_pred(self) -> Option<PolyTraitPredicate<'tcx>> {
981 let predicate = self.kind();
982 match predicate.skip_binder() {
983 PredicateKind::Trait(t) => Some(predicate.rebind(t)),
984 PredicateKind::Projection(..)
985 | PredicateKind::Subtype(..)
986 | PredicateKind::Coerce(..)
987 | PredicateKind::RegionOutlives(..)
988 | PredicateKind::WellFormed(..)
989 | PredicateKind::ObjectSafe(..)
990 | PredicateKind::ClosureKind(..)
991 | PredicateKind::TypeOutlives(..)
992 | PredicateKind::ConstEvaluatable(..)
993 | PredicateKind::ConstEquate(..)
994 | PredicateKind::TypeWellFormedFromEnv(..) => None,
998 pub fn to_opt_type_outlives(self) -> Option<PolyTypeOutlivesPredicate<'tcx>> {
999 let predicate = self.kind();
1000 match predicate.skip_binder() {
1001 PredicateKind::TypeOutlives(data) => Some(predicate.rebind(data)),
1002 PredicateKind::Trait(..)
1003 | PredicateKind::Projection(..)
1004 | PredicateKind::Subtype(..)
1005 | PredicateKind::Coerce(..)
1006 | PredicateKind::RegionOutlives(..)
1007 | PredicateKind::WellFormed(..)
1008 | PredicateKind::ObjectSafe(..)
1009 | PredicateKind::ClosureKind(..)
1010 | PredicateKind::ConstEvaluatable(..)
1011 | PredicateKind::ConstEquate(..)
1012 | PredicateKind::TypeWellFormedFromEnv(..) => None,
1017 /// Represents the bounds declared on a particular set of type
1018 /// parameters. Should eventually be generalized into a flag list of
1019 /// where-clauses. You can obtain an `InstantiatedPredicates` list from a
1020 /// `GenericPredicates` by using the `instantiate` method. Note that this method
1021 /// reflects an important semantic invariant of `InstantiatedPredicates`: while
1022 /// the `GenericPredicates` are expressed in terms of the bound type
1023 /// parameters of the impl/trait/whatever, an `InstantiatedPredicates` instance
1024 /// represented a set of bounds for some particular instantiation,
1025 /// meaning that the generic parameters have been substituted with
1030 /// struct Foo<T, U: Bar<T>> { ... }
1032 /// Here, the `GenericPredicates` for `Foo` would contain a list of bounds like
1033 /// `[[], [U:Bar<T>]]`. Now if there were some particular reference
1034 /// like `Foo<isize,usize>`, then the `InstantiatedPredicates` would be `[[],
1035 /// [usize:Bar<isize>]]`.
1036 #[derive(Clone, Debug, TypeFoldable)]
1037 pub struct InstantiatedPredicates<'tcx> {
1038 pub predicates: Vec<Predicate<'tcx>>,
1039 pub spans: Vec<Span>,
1042 impl<'tcx> InstantiatedPredicates<'tcx> {
1043 pub fn empty() -> InstantiatedPredicates<'tcx> {
1044 InstantiatedPredicates { predicates: vec![], spans: vec![] }
1047 pub fn is_empty(&self) -> bool {
1048 self.predicates.is_empty()
1064 pub struct OpaqueTypeKey<'tcx> {
1066 pub substs: SubstsRef<'tcx>,
1069 #[derive(Copy, Clone, Debug, TypeFoldable, HashStable, TyEncodable, TyDecodable)]
1070 pub struct OpaqueHiddenType<'tcx> {
1071 /// The span of this particular definition of the opaque type. So
1074 /// ```ignore (incomplete snippet)
1075 /// type Foo = impl Baz;
1076 /// fn bar() -> Foo {
1077 /// // ^^^ This is the span we are looking for!
1081 /// In cases where the fn returns `(impl Trait, impl Trait)` or
1082 /// other such combinations, the result is currently
1083 /// over-approximated, but better than nothing.
1086 /// The type variable that represents the value of the opaque type
1087 /// that we require. In other words, after we compile this function,
1088 /// we will be created a constraint like:
1092 /// where `?C` is the value of this type variable. =) It may
1093 /// naturally refer to the type and lifetime parameters in scope
1094 /// in this function, though ultimately it should only reference
1095 /// those that are arguments to `Foo` in the constraint above. (In
1096 /// other words, `?C` should not include `'b`, even though it's a
1097 /// lifetime parameter on `foo`.)
1101 impl<'tcx> OpaqueHiddenType<'tcx> {
1102 pub fn report_mismatch(&self, other: &Self, tcx: TyCtxt<'tcx>) {
1103 // Found different concrete types for the opaque type.
1104 let mut err = tcx.sess.struct_span_err(
1106 "concrete type differs from previous defining opaque type use",
1108 err.span_label(other.span, format!("expected `{}`, got `{}`", self.ty, other.ty));
1109 if self.span == other.span {
1112 "this expression supplies two conflicting concrete types for the same opaque type",
1115 err.span_note(self.span, "previous use here");
1121 rustc_index::newtype_index! {
1122 /// "Universes" are used during type- and trait-checking in the
1123 /// presence of `for<..>` binders to control what sets of names are
1124 /// visible. Universes are arranged into a tree: the root universe
1125 /// contains names that are always visible. Each child then adds a new
1126 /// set of names that are visible, in addition to those of its parent.
1127 /// We say that the child universe "extends" the parent universe with
1130 /// To make this more concrete, consider this program:
1134 /// fn bar<T>(x: T) {
1135 /// let y: for<'a> fn(&'a u8, Foo) = ...;
1139 /// The struct name `Foo` is in the root universe U0. But the type
1140 /// parameter `T`, introduced on `bar`, is in an extended universe U1
1141 /// -- i.e., within `bar`, we can name both `T` and `Foo`, but outside
1142 /// of `bar`, we cannot name `T`. Then, within the type of `y`, the
1143 /// region `'a` is in a universe U2 that extends U1, because we can
1144 /// name it inside the fn type but not outside.
1146 /// Universes are used to do type- and trait-checking around these
1147 /// "forall" binders (also called **universal quantification**). The
1148 /// idea is that when, in the body of `bar`, we refer to `T` as a
1149 /// type, we aren't referring to any type in particular, but rather a
1150 /// kind of "fresh" type that is distinct from all other types we have
1151 /// actually declared. This is called a **placeholder** type, and we
1152 /// use universes to talk about this. In other words, a type name in
1153 /// universe 0 always corresponds to some "ground" type that the user
1154 /// declared, but a type name in a non-zero universe is a placeholder
1155 /// type -- an idealized representative of "types in general" that we
1156 /// use for checking generic functions.
1157 pub struct UniverseIndex {
1159 DEBUG_FORMAT = "U{}",
1163 impl UniverseIndex {
1164 pub const ROOT: UniverseIndex = UniverseIndex::from_u32(0);
1166 /// Returns the "next" universe index in order -- this new index
1167 /// is considered to extend all previous universes. This
1168 /// corresponds to entering a `forall` quantifier. So, for
1169 /// example, suppose we have this type in universe `U`:
1172 /// for<'a> fn(&'a u32)
1175 /// Once we "enter" into this `for<'a>` quantifier, we are in a
1176 /// new universe that extends `U` -- in this new universe, we can
1177 /// name the region `'a`, but that region was not nameable from
1178 /// `U` because it was not in scope there.
1179 pub fn next_universe(self) -> UniverseIndex {
1180 UniverseIndex::from_u32(self.private.checked_add(1).unwrap())
1183 /// Returns `true` if `self` can name a name from `other` -- in other words,
1184 /// if the set of names in `self` is a superset of those in
1185 /// `other` (`self >= other`).
1186 pub fn can_name(self, other: UniverseIndex) -> bool {
1187 self.private >= other.private
1190 /// Returns `true` if `self` cannot name some names from `other` -- in other
1191 /// words, if the set of names in `self` is a strict subset of
1192 /// those in `other` (`self < other`).
1193 pub fn cannot_name(self, other: UniverseIndex) -> bool {
1194 self.private < other.private
1198 /// The "placeholder index" fully defines a placeholder region, type, or const. Placeholders are
1199 /// identified by both a universe, as well as a name residing within that universe. Distinct bound
1200 /// regions/types/consts within the same universe simply have an unknown relationship to one
1202 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, TyEncodable, TyDecodable, PartialOrd, Ord)]
1203 pub struct Placeholder<T> {
1204 pub universe: UniverseIndex,
1208 impl<'a, T> HashStable<StableHashingContext<'a>> for Placeholder<T>
1210 T: HashStable<StableHashingContext<'a>>,
1212 fn hash_stable(&self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher) {
1213 self.universe.hash_stable(hcx, hasher);
1214 self.name.hash_stable(hcx, hasher);
1218 pub type PlaceholderRegion = Placeholder<BoundRegionKind>;
1220 pub type PlaceholderType = Placeholder<BoundVar>;
1222 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, HashStable)]
1223 #[derive(TyEncodable, TyDecodable, PartialOrd, Ord)]
1224 pub struct BoundConst<'tcx> {
1229 pub type PlaceholderConst<'tcx> = Placeholder<BoundConst<'tcx>>;
1231 /// A `DefId` which, in case it is a const argument, is potentially bundled with
1232 /// the `DefId` of the generic parameter it instantiates.
1234 /// This is used to avoid calls to `type_of` for const arguments during typeck
1235 /// which cause cycle errors.
1240 /// fn foo<const N: usize>(&self) -> [u8; N] { [0; N] }
1241 /// // ^ const parameter
1245 /// fn foo<const M: u8>(&self) -> usize { 42 }
1246 /// // ^ const parameter
1251 /// let _b = a.foo::<{ 3 + 7 }>();
1252 /// // ^^^^^^^^^ const argument
1256 /// Let's look at the call `a.foo::<{ 3 + 7 }>()` here. We do not know
1257 /// which `foo` is used until we know the type of `a`.
1259 /// We only know the type of `a` once we are inside of `typeck(main)`.
1260 /// We also end up normalizing the type of `_b` during `typeck(main)` which
1261 /// requires us to evaluate the const argument.
1263 /// To evaluate that const argument we need to know its type,
1264 /// which we would get using `type_of(const_arg)`. This requires us to
1265 /// resolve `foo` as it can be either `usize` or `u8` in this example.
1266 /// However, resolving `foo` once again requires `typeck(main)` to get the type of `a`,
1267 /// which results in a cycle.
1269 /// In short we must not call `type_of(const_arg)` during `typeck(main)`.
1271 /// When first creating the `ty::Const` of the const argument inside of `typeck` we have
1272 /// already resolved `foo` so we know which const parameter this argument instantiates.
1273 /// This means that we also know the expected result of `type_of(const_arg)` even if we
1274 /// aren't allowed to call that query: it is equal to `type_of(const_param)` which is
1275 /// trivial to compute.
1277 /// If we now want to use that constant in a place which potentially needs its type
1278 /// we also pass the type of its `const_param`. This is the point of `WithOptConstParam`,
1279 /// except that instead of a `Ty` we bundle the `DefId` of the const parameter.
1280 /// Meaning that we need to use `type_of(const_param_did)` if `const_param_did` is `Some`
1281 /// to get the type of `did`.
1282 #[derive(Copy, Clone, Debug, TypeFoldable, Lift, TyEncodable, TyDecodable)]
1283 #[derive(PartialEq, Eq, PartialOrd, Ord)]
1284 #[derive(Hash, HashStable)]
1285 pub struct WithOptConstParam<T> {
1287 /// The `DefId` of the corresponding generic parameter in case `did` is
1288 /// a const argument.
1290 /// Note that even if `did` is a const argument, this may still be `None`.
1291 /// All queries taking `WithOptConstParam` start by calling `tcx.opt_const_param_of(def.did)`
1292 /// to potentially update `param_did` in the case it is `None`.
1293 pub const_param_did: Option<DefId>,
1296 impl<T> WithOptConstParam<T> {
1297 /// Creates a new `WithOptConstParam` setting `const_param_did` to `None`.
1299 pub fn unknown(did: T) -> WithOptConstParam<T> {
1300 WithOptConstParam { did, const_param_did: None }
1304 impl WithOptConstParam<LocalDefId> {
1305 /// Returns `Some((did, param_did))` if `def_id` is a const argument,
1306 /// `None` otherwise.
1308 pub fn try_lookup(did: LocalDefId, tcx: TyCtxt<'_>) -> Option<(LocalDefId, DefId)> {
1309 tcx.opt_const_param_of(did).map(|param_did| (did, param_did))
1312 /// In case `self` is unknown but `self.did` is a const argument, this returns
1313 /// a `WithOptConstParam` with the correct `const_param_did`.
1315 pub fn try_upgrade(self, tcx: TyCtxt<'_>) -> Option<WithOptConstParam<LocalDefId>> {
1316 if self.const_param_did.is_none() {
1317 if let const_param_did @ Some(_) = tcx.opt_const_param_of(self.did) {
1318 return Some(WithOptConstParam { did: self.did, const_param_did });
1325 pub fn to_global(self) -> WithOptConstParam<DefId> {
1326 WithOptConstParam { did: self.did.to_def_id(), const_param_did: self.const_param_did }
1329 pub fn def_id_for_type_of(self) -> DefId {
1330 if let Some(did) = self.const_param_did { did } else { self.did.to_def_id() }
1334 impl WithOptConstParam<DefId> {
1335 pub fn as_local(self) -> Option<WithOptConstParam<LocalDefId>> {
1338 .map(|did| WithOptConstParam { did, const_param_did: self.const_param_did })
1341 pub fn as_const_arg(self) -> Option<(LocalDefId, DefId)> {
1342 if let Some(param_did) = self.const_param_did {
1343 if let Some(did) = self.did.as_local() {
1344 return Some((did, param_did));
1351 pub fn is_local(self) -> bool {
1355 pub fn def_id_for_type_of(self) -> DefId {
1356 self.const_param_did.unwrap_or(self.did)
1360 /// When type checking, we use the `ParamEnv` to track
1361 /// details about the set of where-clauses that are in scope at this
1362 /// particular point.
1363 #[derive(Copy, Clone, Hash, PartialEq, Eq)]
1364 pub struct ParamEnv<'tcx> {
1365 /// This packs both caller bounds and the reveal enum into one pointer.
1367 /// Caller bounds are `Obligation`s that the caller must satisfy. This is
1368 /// basically the set of bounds on the in-scope type parameters, translated
1369 /// into `Obligation`s, and elaborated and normalized.
1371 /// Use the `caller_bounds()` method to access.
1373 /// Typically, this is `Reveal::UserFacing`, but during codegen we
1374 /// want `Reveal::All`.
1376 /// Note: This is packed, use the reveal() method to access it.
1377 packed: CopyTaggedPtr<&'tcx List<Predicate<'tcx>>, ParamTag, true>,
1380 #[derive(Copy, Clone)]
1382 reveal: traits::Reveal,
1383 constness: hir::Constness,
1386 unsafe impl rustc_data_structures::tagged_ptr::Tag for ParamTag {
1387 const BITS: usize = 2;
1389 fn into_usize(self) -> usize {
1391 Self { reveal: traits::Reveal::UserFacing, constness: hir::Constness::NotConst } => 0,
1392 Self { reveal: traits::Reveal::All, constness: hir::Constness::NotConst } => 1,
1393 Self { reveal: traits::Reveal::UserFacing, constness: hir::Constness::Const } => 2,
1394 Self { reveal: traits::Reveal::All, constness: hir::Constness::Const } => 3,
1398 unsafe fn from_usize(ptr: usize) -> Self {
1400 0 => Self { reveal: traits::Reveal::UserFacing, constness: hir::Constness::NotConst },
1401 1 => Self { reveal: traits::Reveal::All, constness: hir::Constness::NotConst },
1402 2 => Self { reveal: traits::Reveal::UserFacing, constness: hir::Constness::Const },
1403 3 => Self { reveal: traits::Reveal::All, constness: hir::Constness::Const },
1404 _ => std::hint::unreachable_unchecked(),
1409 impl<'tcx> fmt::Debug for ParamEnv<'tcx> {
1410 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1411 f.debug_struct("ParamEnv")
1412 .field("caller_bounds", &self.caller_bounds())
1413 .field("reveal", &self.reveal())
1414 .field("constness", &self.constness())
1419 impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for ParamEnv<'tcx> {
1420 fn hash_stable(&self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher) {
1421 self.caller_bounds().hash_stable(hcx, hasher);
1422 self.reveal().hash_stable(hcx, hasher);
1423 self.constness().hash_stable(hcx, hasher);
1427 impl<'tcx> TypeFoldable<'tcx> for ParamEnv<'tcx> {
1428 fn try_super_fold_with<F: ty::fold::FallibleTypeFolder<'tcx>>(
1431 ) -> Result<Self, F::Error> {
1433 self.caller_bounds().try_fold_with(folder)?,
1434 self.reveal().try_fold_with(folder)?,
1435 self.constness().try_fold_with(folder)?,
1439 fn super_visit_with<V: TypeVisitor<'tcx>>(&self, visitor: &mut V) -> ControlFlow<V::BreakTy> {
1440 self.caller_bounds().visit_with(visitor)?;
1441 self.reveal().visit_with(visitor)?;
1442 self.constness().visit_with(visitor)
1446 impl<'tcx> ParamEnv<'tcx> {
1447 /// Construct a trait environment suitable for contexts where
1448 /// there are no where-clauses in scope. Hidden types (like `impl
1449 /// Trait`) are left hidden, so this is suitable for ordinary
1452 pub fn empty() -> Self {
1453 Self::new(List::empty(), Reveal::UserFacing, hir::Constness::NotConst)
1457 pub fn caller_bounds(self) -> &'tcx List<Predicate<'tcx>> {
1458 self.packed.pointer()
1462 pub fn reveal(self) -> traits::Reveal {
1463 self.packed.tag().reveal
1467 pub fn constness(self) -> hir::Constness {
1468 self.packed.tag().constness
1472 pub fn is_const(self) -> bool {
1473 self.packed.tag().constness == hir::Constness::Const
1476 /// Construct a trait environment with no where-clauses in scope
1477 /// where the values of all `impl Trait` and other hidden types
1478 /// are revealed. This is suitable for monomorphized, post-typeck
1479 /// environments like codegen or doing optimizations.
1481 /// N.B., if you want to have predicates in scope, use `ParamEnv::new`,
1482 /// or invoke `param_env.with_reveal_all()`.
1484 pub fn reveal_all() -> Self {
1485 Self::new(List::empty(), Reveal::All, hir::Constness::NotConst)
1488 /// Construct a trait environment with the given set of predicates.
1491 caller_bounds: &'tcx List<Predicate<'tcx>>,
1493 constness: hir::Constness,
1495 ty::ParamEnv { packed: CopyTaggedPtr::new(caller_bounds, ParamTag { reveal, constness }) }
1498 pub fn with_user_facing(mut self) -> Self {
1499 self.packed.set_tag(ParamTag { reveal: Reveal::UserFacing, ..self.packed.tag() });
1504 pub fn with_constness(mut self, constness: hir::Constness) -> Self {
1505 self.packed.set_tag(ParamTag { constness, ..self.packed.tag() });
1510 pub fn with_const(mut self) -> Self {
1511 self.packed.set_tag(ParamTag { constness: hir::Constness::Const, ..self.packed.tag() });
1516 pub fn without_const(mut self) -> Self {
1517 self.packed.set_tag(ParamTag { constness: hir::Constness::NotConst, ..self.packed.tag() });
1522 pub fn remap_constness_with(&mut self, mut constness: ty::BoundConstness) {
1523 *self = self.with_constness(constness.and(self.constness()))
1526 /// Returns a new parameter environment with the same clauses, but
1527 /// which "reveals" the true results of projections in all cases
1528 /// (even for associated types that are specializable). This is
1529 /// the desired behavior during codegen and certain other special
1530 /// contexts; normally though we want to use `Reveal::UserFacing`,
1531 /// which is the default.
1532 /// All opaque types in the caller_bounds of the `ParamEnv`
1533 /// will be normalized to their underlying types.
1534 /// See PR #65989 and issue #65918 for more details
1535 pub fn with_reveal_all_normalized(self, tcx: TyCtxt<'tcx>) -> Self {
1536 if self.packed.tag().reveal == traits::Reveal::All {
1541 tcx.normalize_opaque_types(self.caller_bounds()),
1547 /// Returns this same environment but with no caller bounds.
1549 pub fn without_caller_bounds(self) -> Self {
1550 Self::new(List::empty(), self.reveal(), self.constness())
1553 /// Creates a suitable environment in which to perform trait
1554 /// queries on the given value. When type-checking, this is simply
1555 /// the pair of the environment plus value. But when reveal is set to
1556 /// All, then if `value` does not reference any type parameters, we will
1557 /// pair it with the empty environment. This improves caching and is generally
1560 /// N.B., we preserve the environment when type-checking because it
1561 /// is possible for the user to have wacky where-clauses like
1562 /// `where Box<u32>: Copy`, which are clearly never
1563 /// satisfiable. We generally want to behave as if they were true,
1564 /// although the surrounding function is never reachable.
1565 pub fn and<T: TypeFoldable<'tcx>>(self, value: T) -> ParamEnvAnd<'tcx, T> {
1566 match self.reveal() {
1567 Reveal::UserFacing => ParamEnvAnd { param_env: self, value },
1570 if value.is_global() {
1571 ParamEnvAnd { param_env: self.without_caller_bounds(), value }
1573 ParamEnvAnd { param_env: self, value }
1580 // FIXME(ecstaticmorse): Audit all occurrences of `without_const().to_predicate(tcx)` to ensure that
1581 // the constness of trait bounds is being propagated correctly.
1582 impl<'tcx> PolyTraitRef<'tcx> {
1584 pub fn with_constness(self, constness: BoundConstness) -> PolyTraitPredicate<'tcx> {
1585 self.map_bound(|trait_ref| ty::TraitPredicate {
1588 polarity: ty::ImplPolarity::Positive,
1593 pub fn without_const(self) -> PolyTraitPredicate<'tcx> {
1594 self.with_constness(BoundConstness::NotConst)
1598 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, TypeFoldable)]
1599 pub struct ParamEnvAnd<'tcx, T> {
1600 pub param_env: ParamEnv<'tcx>,
1604 impl<'tcx, T> ParamEnvAnd<'tcx, T> {
1605 pub fn into_parts(self) -> (ParamEnv<'tcx>, T) {
1606 (self.param_env, self.value)
1610 pub fn without_const(mut self) -> Self {
1611 self.param_env = self.param_env.without_const();
1616 impl<'a, 'tcx, T> HashStable<StableHashingContext<'a>> for ParamEnvAnd<'tcx, T>
1618 T: HashStable<StableHashingContext<'a>>,
1620 fn hash_stable(&self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher) {
1621 let ParamEnvAnd { ref param_env, ref value } = *self;
1623 param_env.hash_stable(hcx, hasher);
1624 value.hash_stable(hcx, hasher);
1628 #[derive(Copy, Clone, Debug, HashStable)]
1629 pub struct Destructor {
1630 /// The `DefId` of the destructor method
1632 /// The constness of the destructor method
1633 pub constness: hir::Constness,
1637 #[derive(HashStable, TyEncodable, TyDecodable)]
1638 pub struct VariantFlags: u32 {
1639 const NO_VARIANT_FLAGS = 0;
1640 /// Indicates whether the field list of this variant is `#[non_exhaustive]`.
1641 const IS_FIELD_LIST_NON_EXHAUSTIVE = 1 << 0;
1642 /// Indicates whether this variant was obtained as part of recovering from
1643 /// a syntactic error. May be incomplete or bogus.
1644 const IS_RECOVERED = 1 << 1;
1648 /// Definition of a variant -- a struct's fields or an enum variant.
1649 #[derive(Debug, HashStable, TyEncodable, TyDecodable)]
1650 pub struct VariantDef {
1651 /// `DefId` that identifies the variant itself.
1652 /// If this variant belongs to a struct or union, then this is a copy of its `DefId`.
1654 /// `DefId` that identifies the variant's constructor.
1655 /// If this variant is a struct variant, then this is `None`.
1656 pub ctor_def_id: Option<DefId>,
1657 /// Variant or struct name.
1659 /// Discriminant of this variant.
1660 pub discr: VariantDiscr,
1661 /// Fields of this variant.
1662 pub fields: Vec<FieldDef>,
1663 /// Type of constructor of variant.
1664 pub ctor_kind: CtorKind,
1665 /// Flags of the variant (e.g. is field list non-exhaustive)?
1666 flags: VariantFlags,
1670 /// Creates a new `VariantDef`.
1672 /// `variant_did` is the `DefId` that identifies the enum variant (if this `VariantDef`
1673 /// represents an enum variant).
1675 /// `ctor_did` is the `DefId` that identifies the constructor of unit or
1676 /// tuple-variants/structs. If this is a `struct`-variant then this should be `None`.
1678 /// `parent_did` is the `DefId` of the `AdtDef` representing the enum or struct that
1679 /// owns this variant. It is used for checking if a struct has `#[non_exhaustive]` w/out having
1680 /// to go through the redirect of checking the ctor's attributes - but compiling a small crate
1681 /// requires loading the `AdtDef`s for all the structs in the universe (e.g., coherence for any
1682 /// built-in trait), and we do not want to load attributes twice.
1684 /// If someone speeds up attribute loading to not be a performance concern, they can
1685 /// remove this hack and use the constructor `DefId` everywhere.
1688 variant_did: Option<DefId>,
1689 ctor_def_id: Option<DefId>,
1690 discr: VariantDiscr,
1691 fields: Vec<FieldDef>,
1692 ctor_kind: CtorKind,
1696 is_field_list_non_exhaustive: bool,
1699 "VariantDef::new(name = {:?}, variant_did = {:?}, ctor_def_id = {:?}, discr = {:?},
1700 fields = {:?}, ctor_kind = {:?}, adt_kind = {:?}, parent_did = {:?})",
1701 name, variant_did, ctor_def_id, discr, fields, ctor_kind, adt_kind, parent_did,
1704 let mut flags = VariantFlags::NO_VARIANT_FLAGS;
1705 if is_field_list_non_exhaustive {
1706 flags |= VariantFlags::IS_FIELD_LIST_NON_EXHAUSTIVE;
1710 flags |= VariantFlags::IS_RECOVERED;
1714 def_id: variant_did.unwrap_or(parent_did),
1724 /// Is this field list non-exhaustive?
1726 pub fn is_field_list_non_exhaustive(&self) -> bool {
1727 self.flags.intersects(VariantFlags::IS_FIELD_LIST_NON_EXHAUSTIVE)
1730 /// Was this variant obtained as part of recovering from a syntactic error?
1732 pub fn is_recovered(&self) -> bool {
1733 self.flags.intersects(VariantFlags::IS_RECOVERED)
1736 /// Computes the `Ident` of this variant by looking up the `Span`
1737 pub fn ident(&self, tcx: TyCtxt<'_>) -> Ident {
1738 Ident::new(self.name, tcx.def_ident_span(self.def_id).unwrap())
1742 #[derive(Copy, Clone, Debug, PartialEq, Eq, TyEncodable, TyDecodable, HashStable)]
1743 pub enum VariantDiscr {
1744 /// Explicit value for this variant, i.e., `X = 123`.
1745 /// The `DefId` corresponds to the embedded constant.
1748 /// The previous variant's discriminant plus one.
1749 /// For efficiency reasons, the distance from the
1750 /// last `Explicit` discriminant is being stored,
1751 /// or `0` for the first variant, if it has none.
1755 #[derive(Debug, HashStable, TyEncodable, TyDecodable)]
1756 pub struct FieldDef {
1759 pub vis: Visibility,
1763 #[derive(TyEncodable, TyDecodable, Default, HashStable)]
1764 pub struct ReprFlags: u8 {
1765 const IS_C = 1 << 0;
1766 const IS_SIMD = 1 << 1;
1767 const IS_TRANSPARENT = 1 << 2;
1768 // Internal only for now. If true, don't reorder fields.
1769 const IS_LINEAR = 1 << 3;
1770 // If true, don't expose any niche to type's context.
1771 const HIDE_NICHE = 1 << 4;
1772 // If true, the type's layout can be randomized using
1773 // the seed stored in `ReprOptions.layout_seed`
1774 const RANDOMIZE_LAYOUT = 1 << 5;
1775 // Any of these flags being set prevent field reordering optimisation.
1776 const IS_UNOPTIMISABLE = ReprFlags::IS_C.bits
1777 | ReprFlags::IS_SIMD.bits
1778 | ReprFlags::IS_LINEAR.bits;
1782 /// Represents the repr options provided by the user,
1783 #[derive(Copy, Clone, Debug, Eq, PartialEq, TyEncodable, TyDecodable, Default, HashStable)]
1784 pub struct ReprOptions {
1785 pub int: Option<attr::IntType>,
1786 pub align: Option<Align>,
1787 pub pack: Option<Align>,
1788 pub flags: ReprFlags,
1789 /// The seed to be used for randomizing a type's layout
1791 /// Note: This could technically be a `[u8; 16]` (a `u128`) which would
1792 /// be the "most accurate" hash as it'd encompass the item and crate
1793 /// hash without loss, but it does pay the price of being larger.
1794 /// Everything's a tradeoff, a `u64` seed should be sufficient for our
1795 /// purposes (primarily `-Z randomize-layout`)
1796 pub field_shuffle_seed: u64,
1800 pub fn new(tcx: TyCtxt<'_>, did: DefId) -> ReprOptions {
1801 let mut flags = ReprFlags::empty();
1802 let mut size = None;
1803 let mut max_align: Option<Align> = None;
1804 let mut min_pack: Option<Align> = None;
1806 // Generate a deterministically-derived seed from the item's path hash
1807 // to allow for cross-crate compilation to actually work
1808 let mut field_shuffle_seed = tcx.def_path_hash(did).0.to_smaller_hash();
1810 // If the user defined a custom seed for layout randomization, xor the item's
1811 // path hash with the user defined seed, this will allowing determinism while
1812 // still allowing users to further randomize layout generation for e.g. fuzzing
1813 if let Some(user_seed) = tcx.sess.opts.debugging_opts.layout_seed {
1814 field_shuffle_seed ^= user_seed;
1817 for attr in tcx.get_attrs(did).iter() {
1818 for r in attr::find_repr_attrs(&tcx.sess, attr) {
1819 flags.insert(match r {
1820 attr::ReprC => ReprFlags::IS_C,
1821 attr::ReprPacked(pack) => {
1822 let pack = Align::from_bytes(pack as u64).unwrap();
1823 min_pack = Some(if let Some(min_pack) = min_pack {
1830 attr::ReprTransparent => ReprFlags::IS_TRANSPARENT,
1831 attr::ReprNoNiche => ReprFlags::HIDE_NICHE,
1832 attr::ReprSimd => ReprFlags::IS_SIMD,
1833 attr::ReprInt(i) => {
1837 attr::ReprAlign(align) => {
1838 max_align = max_align.max(Some(Align::from_bytes(align as u64).unwrap()));
1845 // If `-Z randomize-layout` was enabled for the type definition then we can
1846 // consider performing layout randomization
1847 if tcx.sess.opts.debugging_opts.randomize_layout {
1848 flags.insert(ReprFlags::RANDOMIZE_LAYOUT);
1851 // This is here instead of layout because the choice must make it into metadata.
1852 if !tcx.consider_optimizing(|| format!("Reorder fields of {:?}", tcx.def_path_str(did))) {
1853 flags.insert(ReprFlags::IS_LINEAR);
1856 Self { int: size, align: max_align, pack: min_pack, flags, field_shuffle_seed }
1860 pub fn simd(&self) -> bool {
1861 self.flags.contains(ReprFlags::IS_SIMD)
1865 pub fn c(&self) -> bool {
1866 self.flags.contains(ReprFlags::IS_C)
1870 pub fn packed(&self) -> bool {
1875 pub fn transparent(&self) -> bool {
1876 self.flags.contains(ReprFlags::IS_TRANSPARENT)
1880 pub fn linear(&self) -> bool {
1881 self.flags.contains(ReprFlags::IS_LINEAR)
1885 pub fn hide_niche(&self) -> bool {
1886 self.flags.contains(ReprFlags::HIDE_NICHE)
1889 /// Returns the discriminant type, given these `repr` options.
1890 /// This must only be called on enums!
1891 pub fn discr_type(&self) -> attr::IntType {
1892 self.int.unwrap_or(attr::SignedInt(ast::IntTy::Isize))
1895 /// Returns `true` if this `#[repr()]` should inhabit "smart enum
1896 /// layout" optimizations, such as representing `Foo<&T>` as a
1898 pub fn inhibit_enum_layout_opt(&self) -> bool {
1899 self.c() || self.int.is_some()
1902 /// Returns `true` if this `#[repr()]` should inhibit struct field reordering
1903 /// optimizations, such as with `repr(C)`, `repr(packed(1))`, or `repr(<int>)`.
1904 pub fn inhibit_struct_field_reordering_opt(&self) -> bool {
1905 if let Some(pack) = self.pack {
1906 if pack.bytes() == 1 {
1911 self.flags.intersects(ReprFlags::IS_UNOPTIMISABLE) || self.int.is_some()
1914 /// Returns `true` if this type is valid for reordering and `-Z randomize-layout`
1915 /// was enabled for its declaration crate
1916 pub fn can_randomize_type_layout(&self) -> bool {
1917 !self.inhibit_struct_field_reordering_opt()
1918 && self.flags.contains(ReprFlags::RANDOMIZE_LAYOUT)
1921 /// Returns `true` if this `#[repr()]` should inhibit union ABI optimisations.
1922 pub fn inhibit_union_abi_opt(&self) -> bool {
1927 impl<'tcx> FieldDef {
1928 /// Returns the type of this field. The resulting type is not normalized. The `subst` is
1929 /// typically obtained via the second field of [`TyKind::Adt`].
1930 pub fn ty(&self, tcx: TyCtxt<'tcx>, subst: SubstsRef<'tcx>) -> Ty<'tcx> {
1931 tcx.type_of(self.did).subst(tcx, subst)
1934 /// Computes the `Ident` of this variant by looking up the `Span`
1935 pub fn ident(&self, tcx: TyCtxt<'_>) -> Ident {
1936 Ident::new(self.name, tcx.def_ident_span(self.did).unwrap())
1940 pub type Attributes<'tcx> = &'tcx [ast::Attribute];
1942 #[derive(Debug, PartialEq, Eq)]
1943 pub enum ImplOverlapKind {
1944 /// These impls are always allowed to overlap.
1946 /// Whether or not the impl is permitted due to the trait being a `#[marker]` trait
1949 /// These impls are allowed to overlap, but that raises
1950 /// an issue #33140 future-compatibility warning.
1952 /// Some background: in Rust 1.0, the trait-object types `Send + Sync` (today's
1953 /// `dyn Send + Sync`) and `Sync + Send` (now `dyn Sync + Send`) were different.
1955 /// The widely-used version 0.1.0 of the crate `traitobject` had accidentally relied
1956 /// that difference, making what reduces to the following set of impls:
1960 /// impl Trait for dyn Send + Sync {}
1961 /// impl Trait for dyn Sync + Send {}
1964 /// Obviously, once we made these types be identical, that code causes a coherence
1965 /// error and a fairly big headache for us. However, luckily for us, the trait
1966 /// `Trait` used in this case is basically a marker trait, and therefore having
1967 /// overlapping impls for it is sound.
1969 /// To handle this, we basically regard the trait as a marker trait, with an additional
1970 /// future-compatibility warning. To avoid accidentally "stabilizing" this feature,
1971 /// it has the following restrictions:
1973 /// 1. The trait must indeed be a marker-like trait (i.e., no items), and must be
1975 /// 2. The trait-ref of both impls must be equal.
1976 /// 3. The trait-ref of both impls must be a trait object type consisting only of
1978 /// 4. Neither of the impls can have any where-clauses.
1980 /// Once `traitobject` 0.1.0 is no longer an active concern, this hack can be removed.
1984 impl<'tcx> TyCtxt<'tcx> {
1985 pub fn typeck_body(self, body: hir::BodyId) -> &'tcx TypeckResults<'tcx> {
1986 self.typeck(self.hir().body_owner_def_id(body))
1989 pub fn provided_trait_methods(self, id: DefId) -> impl 'tcx + Iterator<Item = &'tcx AssocItem> {
1990 self.associated_items(id)
1991 .in_definition_order()
1992 .filter(|item| item.kind == AssocKind::Fn && item.defaultness.has_value())
1995 fn opt_item_name(self, def_id: DefId) -> Option<Symbol> {
1996 if def_id.index == CRATE_DEF_INDEX {
1997 Some(self.crate_name(def_id.krate))
1999 let def_key = self.def_key(def_id);
2000 match def_key.disambiguated_data.data {
2001 // The name of a constructor is that of its parent.
2002 rustc_hir::definitions::DefPathData::Ctor => self
2003 .opt_item_name(DefId { krate: def_id.krate, index: def_key.parent.unwrap() }),
2004 // The name of opaque types only exists in HIR.
2005 rustc_hir::definitions::DefPathData::ImplTrait
2006 if let Some(def_id) = def_id.as_local() =>
2007 self.hir().opt_name(self.hir().local_def_id_to_hir_id(def_id)),
2008 _ => def_key.get_opt_name(),
2013 /// Look up the name of a definition across crates. This does not look at HIR.
2015 /// When possible, this function should be used for cross-crate lookups over
2016 /// [`opt_item_name`] to avoid invalidating the incremental cache. If you
2017 /// need to handle items without a name, or HIR items that will not be
2018 /// serialized cross-crate, or if you need the span of the item, use
2019 /// [`opt_item_name`] instead.
2021 /// [`opt_item_name`]: Self::opt_item_name
2022 pub fn item_name(self, id: DefId) -> Symbol {
2023 // Look at cross-crate items first to avoid invalidating the incremental cache
2024 // unless we have to.
2025 self.opt_item_name(id).unwrap_or_else(|| {
2026 bug!("item_name: no name for {:?}", self.def_path(id));
2030 /// Look up the name and span of a definition.
2032 /// See [`item_name`][Self::item_name] for more information.
2033 pub fn opt_item_ident(self, def_id: DefId) -> Option<Ident> {
2034 let def = self.opt_item_name(def_id)?;
2037 .and_then(|id| self.def_ident_span(id))
2038 .unwrap_or(rustc_span::DUMMY_SP);
2039 Some(Ident::new(def, span))
2042 pub fn opt_associated_item(self, def_id: DefId) -> Option<&'tcx AssocItem> {
2043 if let DefKind::AssocConst | DefKind::AssocFn | DefKind::AssocTy = self.def_kind(def_id) {
2044 Some(self.associated_item(def_id))
2050 pub fn field_index(self, hir_id: hir::HirId, typeck_results: &TypeckResults<'_>) -> usize {
2051 typeck_results.field_indices().get(hir_id).cloned().expect("no index for a field")
2054 pub fn find_field_index(self, ident: Ident, variant: &VariantDef) -> Option<usize> {
2058 .position(|field| self.hygienic_eq(ident, field.ident(self), variant.def_id))
2061 /// Returns `true` if the impls are the same polarity and the trait either
2062 /// has no items or is annotated `#[marker]` and prevents item overrides.
2063 pub fn impls_are_allowed_to_overlap(
2067 ) -> Option<ImplOverlapKind> {
2068 // If either trait impl references an error, they're allowed to overlap,
2069 // as one of them essentially doesn't exist.
2070 if self.impl_trait_ref(def_id1).map_or(false, |tr| tr.references_error())
2071 || self.impl_trait_ref(def_id2).map_or(false, |tr| tr.references_error())
2073 return Some(ImplOverlapKind::Permitted { marker: false });
2076 match (self.impl_polarity(def_id1), self.impl_polarity(def_id2)) {
2077 (ImplPolarity::Reservation, _) | (_, ImplPolarity::Reservation) => {
2078 // `#[rustc_reservation_impl]` impls don't overlap with anything
2080 "impls_are_allowed_to_overlap({:?}, {:?}) = Some(Permitted) (reservations)",
2083 return Some(ImplOverlapKind::Permitted { marker: false });
2085 (ImplPolarity::Positive, ImplPolarity::Negative)
2086 | (ImplPolarity::Negative, ImplPolarity::Positive) => {
2087 // `impl AutoTrait for Type` + `impl !AutoTrait for Type`
2089 "impls_are_allowed_to_overlap({:?}, {:?}) - None (differing polarities)",
2094 (ImplPolarity::Positive, ImplPolarity::Positive)
2095 | (ImplPolarity::Negative, ImplPolarity::Negative) => {}
2098 let is_marker_overlap = {
2099 let is_marker_impl = |def_id: DefId| -> bool {
2100 let trait_ref = self.impl_trait_ref(def_id);
2101 trait_ref.map_or(false, |tr| self.trait_def(tr.def_id).is_marker)
2103 is_marker_impl(def_id1) && is_marker_impl(def_id2)
2106 if is_marker_overlap {
2108 "impls_are_allowed_to_overlap({:?}, {:?}) = Some(Permitted) (marker overlap)",
2111 Some(ImplOverlapKind::Permitted { marker: true })
2113 if let Some(self_ty1) = self.issue33140_self_ty(def_id1) {
2114 if let Some(self_ty2) = self.issue33140_self_ty(def_id2) {
2115 if self_ty1 == self_ty2 {
2117 "impls_are_allowed_to_overlap({:?}, {:?}) - issue #33140 HACK",
2120 return Some(ImplOverlapKind::Issue33140);
2123 "impls_are_allowed_to_overlap({:?}, {:?}) - found {:?} != {:?}",
2124 def_id1, def_id2, self_ty1, self_ty2
2130 debug!("impls_are_allowed_to_overlap({:?}, {:?}) = None", def_id1, def_id2);
2135 /// Returns `ty::VariantDef` if `res` refers to a struct,
2136 /// or variant or their constructors, panics otherwise.
2137 pub fn expect_variant_res(self, res: Res) -> &'tcx VariantDef {
2139 Res::Def(DefKind::Variant, did) => {
2140 let enum_did = self.parent(did).unwrap();
2141 self.adt_def(enum_did).variant_with_id(did)
2143 Res::Def(DefKind::Struct | DefKind::Union, did) => self.adt_def(did).non_enum_variant(),
2144 Res::Def(DefKind::Ctor(CtorOf::Variant, ..), variant_ctor_did) => {
2145 let variant_did = self.parent(variant_ctor_did).unwrap();
2146 let enum_did = self.parent(variant_did).unwrap();
2147 self.adt_def(enum_did).variant_with_ctor_id(variant_ctor_did)
2149 Res::Def(DefKind::Ctor(CtorOf::Struct, ..), ctor_did) => {
2150 let struct_did = self.parent(ctor_did).expect("struct ctor has no parent");
2151 self.adt_def(struct_did).non_enum_variant()
2153 _ => bug!("expect_variant_res used with unexpected res {:?}", res),
2157 /// Returns the possibly-auto-generated MIR of a `(DefId, Subst)` pair.
2158 pub fn instance_mir(self, instance: ty::InstanceDef<'tcx>) -> &'tcx Body<'tcx> {
2160 ty::InstanceDef::Item(def) => match self.def_kind(def.did) {
2162 | DefKind::Static(..)
2163 | DefKind::AssocConst
2165 | DefKind::AnonConst
2166 | DefKind::InlineConst => self.mir_for_ctfe_opt_const_arg(def),
2167 // If the caller wants `mir_for_ctfe` of a function they should not be using
2168 // `instance_mir`, so we'll assume const fn also wants the optimized version.
2170 assert_eq!(def.const_param_did, None);
2171 self.optimized_mir(def.did)
2174 ty::InstanceDef::VtableShim(..)
2175 | ty::InstanceDef::ReifyShim(..)
2176 | ty::InstanceDef::Intrinsic(..)
2177 | ty::InstanceDef::FnPtrShim(..)
2178 | ty::InstanceDef::Virtual(..)
2179 | ty::InstanceDef::ClosureOnceShim { .. }
2180 | ty::InstanceDef::DropGlue(..)
2181 | ty::InstanceDef::CloneShim(..) => self.mir_shims(instance),
2185 /// Gets the attributes of a definition.
2186 pub fn get_attrs(self, did: DefId) -> Attributes<'tcx> {
2187 if let Some(did) = did.as_local() {
2188 self.hir().attrs(self.hir().local_def_id_to_hir_id(did))
2190 self.item_attrs(did)
2194 /// Determines whether an item is annotated with an attribute.
2195 pub fn has_attr(self, did: DefId, attr: Symbol) -> bool {
2196 self.sess.contains_name(&self.get_attrs(did), attr)
2199 /// Returns `true` if this is an `auto trait`.
2200 pub fn trait_is_auto(self, trait_def_id: DefId) -> bool {
2201 self.trait_def(trait_def_id).has_auto_impl
2204 /// Returns layout of a generator. Layout might be unavailable if the
2205 /// generator is tainted by errors.
2206 pub fn generator_layout(self, def_id: DefId) -> Option<&'tcx GeneratorLayout<'tcx>> {
2207 self.optimized_mir(def_id).generator_layout()
2210 /// Given the `DefId` of an impl, returns the `DefId` of the trait it implements.
2211 /// If it implements no trait, returns `None`.
2212 pub fn trait_id_of_impl(self, def_id: DefId) -> Option<DefId> {
2213 self.impl_trait_ref(def_id).map(|tr| tr.def_id)
2216 /// If the given `DefId` describes a method belonging to an impl, returns the
2217 /// `DefId` of the impl that the method belongs to; otherwise, returns `None`.
2218 pub fn impl_of_method(self, def_id: DefId) -> Option<DefId> {
2219 self.opt_associated_item(def_id).and_then(|trait_item| match trait_item.container {
2220 TraitContainer(_) => None,
2221 ImplContainer(def_id) => Some(def_id),
2225 /// If the given `DefId` belongs to a trait that was automatically derived, returns `true`.
2226 pub fn is_builtin_derive(self, def_id: DefId) -> bool {
2227 self.has_attr(def_id, sym::automatically_derived)
2230 /// Looks up the span of `impl_did` if the impl is local; otherwise returns `Err`
2231 /// with the name of the crate containing the impl.
2232 pub fn span_of_impl(self, impl_did: DefId) -> Result<Span, Symbol> {
2233 if let Some(impl_did) = impl_did.as_local() {
2234 Ok(self.def_span(impl_did))
2236 Err(self.crate_name(impl_did.krate))
2240 /// Hygienically compares a use-site name (`use_name`) for a field or an associated item with
2241 /// its supposed definition name (`def_name`). The method also needs `DefId` of the supposed
2242 /// definition's parent/scope to perform comparison.
2243 pub fn hygienic_eq(self, use_name: Ident, def_name: Ident, def_parent_def_id: DefId) -> bool {
2244 // We could use `Ident::eq` here, but we deliberately don't. The name
2245 // comparison fails frequently, and we want to avoid the expensive
2246 // `normalize_to_macros_2_0()` calls required for the span comparison whenever possible.
2247 use_name.name == def_name.name
2251 .hygienic_eq(def_name.span.ctxt(), self.expn_that_defined(def_parent_def_id))
2254 pub fn adjust_ident(self, mut ident: Ident, scope: DefId) -> Ident {
2255 ident.span.normalize_to_macros_2_0_and_adjust(self.expn_that_defined(scope));
2259 pub fn adjust_ident_and_get_scope(
2264 ) -> (Ident, DefId) {
2267 .normalize_to_macros_2_0_and_adjust(self.expn_that_defined(scope))
2268 .and_then(|actual_expansion| actual_expansion.expn_data().parent_module)
2269 .unwrap_or_else(|| self.parent_module(block).to_def_id());
2273 pub fn is_object_safe(self, key: DefId) -> bool {
2274 self.object_safety_violations(key).is_empty()
2278 pub fn is_const_fn_raw(self, def_id: DefId) -> bool {
2279 matches!(self.def_kind(def_id), DefKind::Fn | DefKind::AssocFn | DefKind::Ctor(..))
2280 && self.impl_constness(def_id) == hir::Constness::Const
2284 /// Yields the parent function's `LocalDefId` if `def_id` is an `impl Trait` definition.
2285 pub fn is_impl_trait_defn(tcx: TyCtxt<'_>, def_id: DefId) -> Option<LocalDefId> {
2286 let def_id = def_id.as_local()?;
2287 if let Node::Item(item) = tcx.hir().get_by_def_id(def_id) {
2288 if let hir::ItemKind::OpaqueTy(ref opaque_ty) = item.kind {
2289 return match opaque_ty.origin {
2290 hir::OpaqueTyOrigin::FnReturn(parent) | hir::OpaqueTyOrigin::AsyncFn(parent) => {
2293 hir::OpaqueTyOrigin::TyAlias => None,
2300 pub fn int_ty(ity: ast::IntTy) -> IntTy {
2302 ast::IntTy::Isize => IntTy::Isize,
2303 ast::IntTy::I8 => IntTy::I8,
2304 ast::IntTy::I16 => IntTy::I16,
2305 ast::IntTy::I32 => IntTy::I32,
2306 ast::IntTy::I64 => IntTy::I64,
2307 ast::IntTy::I128 => IntTy::I128,
2311 pub fn uint_ty(uty: ast::UintTy) -> UintTy {
2313 ast::UintTy::Usize => UintTy::Usize,
2314 ast::UintTy::U8 => UintTy::U8,
2315 ast::UintTy::U16 => UintTy::U16,
2316 ast::UintTy::U32 => UintTy::U32,
2317 ast::UintTy::U64 => UintTy::U64,
2318 ast::UintTy::U128 => UintTy::U128,
2322 pub fn float_ty(fty: ast::FloatTy) -> FloatTy {
2324 ast::FloatTy::F32 => FloatTy::F32,
2325 ast::FloatTy::F64 => FloatTy::F64,
2329 pub fn ast_int_ty(ity: IntTy) -> ast::IntTy {
2331 IntTy::Isize => ast::IntTy::Isize,
2332 IntTy::I8 => ast::IntTy::I8,
2333 IntTy::I16 => ast::IntTy::I16,
2334 IntTy::I32 => ast::IntTy::I32,
2335 IntTy::I64 => ast::IntTy::I64,
2336 IntTy::I128 => ast::IntTy::I128,
2340 pub fn ast_uint_ty(uty: UintTy) -> ast::UintTy {
2342 UintTy::Usize => ast::UintTy::Usize,
2343 UintTy::U8 => ast::UintTy::U8,
2344 UintTy::U16 => ast::UintTy::U16,
2345 UintTy::U32 => ast::UintTy::U32,
2346 UintTy::U64 => ast::UintTy::U64,
2347 UintTy::U128 => ast::UintTy::U128,
2351 pub fn provide(providers: &mut ty::query::Providers) {
2352 closure::provide(providers);
2353 context::provide(providers);
2354 erase_regions::provide(providers);
2355 layout::provide(providers);
2356 util::provide(providers);
2357 print::provide(providers);
2358 super::util::bug::provide(providers);
2359 super::middle::provide(providers);
2360 *providers = ty::query::Providers {
2361 trait_impls_of: trait_def::trait_impls_of_provider,
2362 incoherent_impls: trait_def::incoherent_impls_provider,
2363 type_uninhabited_from: inhabitedness::type_uninhabited_from,
2364 const_param_default: consts::const_param_default,
2365 vtable_allocation: vtable::vtable_allocation_provider,
2370 /// A map for the local crate mapping each type to a vector of its
2371 /// inherent impls. This is not meant to be used outside of coherence;
2372 /// rather, you should request the vector for a specific type via
2373 /// `tcx.inherent_impls(def_id)` so as to minimize your dependencies
2374 /// (constructing this map requires touching the entire crate).
2375 #[derive(Clone, Debug, Default, HashStable)]
2376 pub struct CrateInherentImpls {
2377 pub inherent_impls: LocalDefIdMap<Vec<DefId>>,
2378 pub incoherent_impls: FxHashMap<SimplifiedType, Vec<LocalDefId>>,
2381 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, HashStable)]
2382 pub struct SymbolName<'tcx> {
2383 /// `&str` gives a consistent ordering, which ensures reproducible builds.
2384 pub name: &'tcx str,
2387 impl<'tcx> SymbolName<'tcx> {
2388 pub fn new(tcx: TyCtxt<'tcx>, name: &str) -> SymbolName<'tcx> {
2390 name: unsafe { str::from_utf8_unchecked(tcx.arena.alloc_slice(name.as_bytes())) },
2395 impl<'tcx> fmt::Display for SymbolName<'tcx> {
2396 fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
2397 fmt::Display::fmt(&self.name, fmt)
2401 impl<'tcx> fmt::Debug for SymbolName<'tcx> {
2402 fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
2403 fmt::Display::fmt(&self.name, fmt)
2407 #[derive(Debug, Default, Copy, Clone)]
2408 pub struct FoundRelationships {
2409 /// This is true if we identified that this Ty (`?T`) is found in a `?T: Foo`
2410 /// obligation, where:
2412 /// * `Foo` is not `Sized`
2413 /// * `(): Foo` may be satisfied
2414 pub self_in_trait: bool,
2415 /// This is true if we identified that this Ty (`?T`) is found in a `<_ as
2416 /// _>::AssocType = ?T`