1 pub use self::Variance::*;
2 pub use self::AssociatedItemContainer::*;
3 pub use self::BorrowKind::*;
4 pub use self::IntVarValue::*;
5 pub use self::fold::TypeFoldable;
7 use crate::hir::{map as hir_map, FreevarMap, GlobMap, TraitMap};
8 use crate::hir::{HirId, Node};
9 use crate::hir::def::{Def, CtorKind, ExportMap};
10 use crate::hir::def_id::{CrateNum, DefId, LocalDefId, CRATE_DEF_INDEX, LOCAL_CRATE};
11 use crate::hir::map::DefPathData;
12 use rustc_data_structures::svh::Svh;
13 use rustc_macros::HashStable;
14 use crate::ich::Fingerprint;
15 use crate::ich::StableHashingContext;
16 use crate::infer::canonical::Canonical;
17 use crate::middle::lang_items::{FnTraitLangItem, FnMutTraitLangItem, FnOnceTraitLangItem};
18 use crate::middle::resolve_lifetime::ObjectLifetimeDefault;
20 use crate::mir::interpret::{GlobalId, ErrorHandled};
21 use crate::mir::GeneratorLayout;
22 use crate::session::CrateDisambiguator;
23 use crate::traits::{self, Reveal};
25 use crate::ty::layout::VariantIdx;
26 use crate::ty::subst::{Subst, InternalSubsts, SubstsRef};
27 use crate::ty::util::{IntTypeExt, Discr};
28 use crate::ty::walk::TypeWalker;
29 use crate::util::captures::Captures;
30 use crate::util::nodemap::{NodeSet, DefIdMap, FxHashMap};
31 use arena::SyncDroplessArena;
32 use crate::session::DataTypeKind;
34 use serialize::{self, Encodable, Encoder};
35 use std::cell::RefCell;
36 use std::cmp::{self, Ordering};
38 use std::hash::{Hash, Hasher};
40 use rustc_data_structures::sync::{self, Lrc, ParallelIterator, par_iter};
43 use syntax::ast::{self, Name, Ident, NodeId};
45 use syntax::ext::hygiene::Mark;
46 use syntax::symbol::{keywords, Symbol, LocalInternedString, InternedString};
50 use rustc_data_structures::indexed_vec::{Idx, IndexVec};
51 use rustc_data_structures::stable_hasher::{StableHasher, StableHasherResult,
56 pub use self::sty::{Binder, BoundTy, BoundTyKind, BoundVar, DebruijnIndex, INNERMOST};
57 pub use self::sty::{FnSig, GenSig, CanonicalPolyFnSig, PolyFnSig, PolyGenSig};
58 pub use self::sty::{InferTy, ParamTy, ParamConst, InferConst, ProjectionTy, ExistentialPredicate};
59 pub use self::sty::{ClosureSubsts, GeneratorSubsts, UpvarSubsts, TypeAndMut};
60 pub use self::sty::{TraitRef, TyKind, PolyTraitRef};
61 pub use self::sty::{ExistentialTraitRef, PolyExistentialTraitRef};
62 pub use self::sty::{ExistentialProjection, PolyExistentialProjection, Const, LazyConst};
63 pub use self::sty::{BoundRegion, EarlyBoundRegion, FreeRegion, Region};
64 pub use self::sty::RegionKind;
65 pub use self::sty::{TyVid, IntVid, FloatVid, ConstVid, RegionVid};
66 pub use self::sty::BoundRegion::*;
67 pub use self::sty::InferTy::*;
68 pub use self::sty::RegionKind::*;
69 pub use self::sty::TyKind::*;
71 pub use self::binding::BindingMode;
72 pub use self::binding::BindingMode::*;
74 pub use self::context::{TyCtxt, FreeRegionInfo, GlobalArenas, AllArenas, tls, keep_local};
75 pub use self::context::{Lift, TypeckTables, CtxtInterners, GlobalCtxt};
76 pub use self::context::{
77 UserTypeAnnotationIndex, UserType, CanonicalUserType,
78 CanonicalUserTypeAnnotation, CanonicalUserTypeAnnotations, ResolvedOpaqueTy,
81 pub use self::instance::{Instance, InstanceDef};
83 pub use self::trait_def::TraitDef;
85 pub use self::query::queries;
97 pub mod inhabitedness;
115 mod structural_impls;
121 pub struct Resolutions {
122 pub freevars: FreevarMap,
123 pub trait_map: TraitMap,
124 pub maybe_unused_trait_imports: NodeSet,
125 pub maybe_unused_extern_crates: Vec<(NodeId, Span)>,
126 pub export_map: ExportMap,
127 pub glob_map: GlobMap,
128 /// Extern prelude entries. The value is `true` if the entry was introduced
129 /// via `extern crate` item and not `--extern` option or compiler built-in.
130 pub extern_prelude: FxHashMap<Name, bool>,
133 #[derive(Clone, Copy, PartialEq, Eq, Debug, HashStable)]
134 pub enum AssociatedItemContainer {
135 TraitContainer(DefId),
136 ImplContainer(DefId),
139 impl AssociatedItemContainer {
140 /// Asserts that this is the `DefId` of an associated item declared
141 /// in a trait, and returns the trait `DefId`.
142 pub fn assert_trait(&self) -> DefId {
144 TraitContainer(id) => id,
145 _ => bug!("associated item has wrong container type: {:?}", self)
149 pub fn id(&self) -> DefId {
151 TraitContainer(id) => id,
152 ImplContainer(id) => id,
157 /// The "header" of an impl is everything outside the body: a Self type, a trait
158 /// ref (in the case of a trait impl), and a set of predicates (from the
159 /// bounds / where-clauses).
160 #[derive(Clone, PartialEq, Eq, Hash, Debug)]
161 pub struct ImplHeader<'tcx> {
162 pub impl_def_id: DefId,
163 pub self_ty: Ty<'tcx>,
164 pub trait_ref: Option<TraitRef<'tcx>>,
165 pub predicates: Vec<Predicate<'tcx>>,
168 #[derive(Copy, Clone, Debug, PartialEq, HashStable)]
169 pub struct AssociatedItem {
171 #[stable_hasher(project(name))]
173 pub kind: AssociatedKind,
175 pub defaultness: hir::Defaultness,
176 pub container: AssociatedItemContainer,
178 /// Whether this is a method with an explicit self
179 /// as its first argument, allowing method calls.
180 pub method_has_self_argument: bool,
183 #[derive(Copy, Clone, PartialEq, Eq, Debug, Hash, RustcEncodable, RustcDecodable, HashStable)]
184 pub enum AssociatedKind {
191 impl AssociatedItem {
192 pub fn def(&self) -> Def {
194 AssociatedKind::Const => Def::AssociatedConst(self.def_id),
195 AssociatedKind::Method => Def::Method(self.def_id),
196 AssociatedKind::Type => Def::AssociatedTy(self.def_id),
197 AssociatedKind::Existential => Def::AssociatedExistential(self.def_id),
201 /// Tests whether the associated item admits a non-trivial implementation
203 pub fn relevant_for_never<'tcx>(&self) -> bool {
205 AssociatedKind::Existential |
206 AssociatedKind::Const |
207 AssociatedKind::Type => true,
208 // FIXME(canndrew): Be more thorough here, check if any argument is uninhabited.
209 AssociatedKind::Method => !self.method_has_self_argument,
213 pub fn signature<'a, 'tcx>(&self, tcx: &TyCtxt<'a, 'tcx, 'tcx>) -> String {
215 ty::AssociatedKind::Method => {
216 // We skip the binder here because the binder would deanonymize all
217 // late-bound regions, and we don't want method signatures to show up
218 // `as for<'r> fn(&'r MyType)`. Pretty-printing handles late-bound
219 // regions just fine, showing `fn(&MyType)`.
220 tcx.fn_sig(self.def_id).skip_binder().to_string()
222 ty::AssociatedKind::Type => format!("type {};", self.ident),
223 ty::AssociatedKind::Existential => format!("existential type {};", self.ident),
224 ty::AssociatedKind::Const => {
225 format!("const {}: {:?};", self.ident, tcx.type_of(self.def_id))
231 #[derive(Clone, Debug, PartialEq, Eq, Copy, RustcEncodable, RustcDecodable, HashStable)]
232 pub enum Visibility {
233 /// Visible everywhere (including in other crates).
235 /// Visible only in the given crate-local module.
237 /// Not visible anywhere in the local crate. This is the visibility of private external items.
241 pub trait DefIdTree: Copy {
242 fn parent(self, id: DefId) -> Option<DefId>;
244 fn is_descendant_of(self, mut descendant: DefId, ancestor: DefId) -> bool {
245 if descendant.krate != ancestor.krate {
249 while descendant != ancestor {
250 match self.parent(descendant) {
251 Some(parent) => descendant = parent,
252 None => return false,
259 impl<'a, 'gcx, 'tcx> DefIdTree for TyCtxt<'a, 'gcx, 'tcx> {
260 fn parent(self, id: DefId) -> Option<DefId> {
261 self.def_key(id).parent.map(|index| DefId { index: index, ..id })
266 pub fn from_hir(visibility: &hir::Visibility, id: hir::HirId, tcx: TyCtxt<'_, '_, '_>) -> Self {
267 match visibility.node {
268 hir::VisibilityKind::Public => Visibility::Public,
269 hir::VisibilityKind::Crate(_) => Visibility::Restricted(DefId::local(CRATE_DEF_INDEX)),
270 hir::VisibilityKind::Restricted { ref path, .. } => match path.def {
271 // If there is no resolution, `resolve` will have already reported an error, so
272 // assume that the visibility is public to avoid reporting more privacy errors.
273 Def::Err => Visibility::Public,
274 def => Visibility::Restricted(def.def_id()),
276 hir::VisibilityKind::Inherited => {
277 Visibility::Restricted(tcx.hir().get_module_parent_by_hir_id(id))
282 /// Returns `true` if an item with this visibility is accessible from the given block.
283 pub fn is_accessible_from<T: DefIdTree>(self, module: DefId, tree: T) -> bool {
284 let restriction = match self {
285 // Public items are visible everywhere.
286 Visibility::Public => return true,
287 // Private items from other crates are visible nowhere.
288 Visibility::Invisible => return false,
289 // Restricted items are visible in an arbitrary local module.
290 Visibility::Restricted(other) if other.krate != module.krate => return false,
291 Visibility::Restricted(module) => module,
294 tree.is_descendant_of(module, restriction)
297 /// Returns `true` if this visibility is at least as accessible as the given visibility
298 pub fn is_at_least<T: DefIdTree>(self, vis: Visibility, tree: T) -> bool {
299 let vis_restriction = match vis {
300 Visibility::Public => return self == Visibility::Public,
301 Visibility::Invisible => return true,
302 Visibility::Restricted(module) => module,
305 self.is_accessible_from(vis_restriction, tree)
308 // Returns `true` if this item is visible anywhere in the local crate.
309 pub fn is_visible_locally(self) -> bool {
311 Visibility::Public => true,
312 Visibility::Restricted(def_id) => def_id.is_local(),
313 Visibility::Invisible => false,
318 #[derive(Copy, Clone, PartialEq, Eq, RustcDecodable, RustcEncodable, Hash, HashStable)]
320 Covariant, // T<A> <: T<B> iff A <: B -- e.g., function return type
321 Invariant, // T<A> <: T<B> iff B == A -- e.g., type of mutable cell
322 Contravariant, // T<A> <: T<B> iff B <: A -- e.g., function param type
323 Bivariant, // T<A> <: T<B> -- e.g., unused type parameter
326 /// The crate variances map is computed during typeck and contains the
327 /// variance of every item in the local crate. You should not use it
328 /// directly, because to do so will make your pass dependent on the
329 /// HIR of every item in the local crate. Instead, use
330 /// `tcx.variances_of()` to get the variance for a *particular*
332 #[derive(HashStable)]
333 pub struct CrateVariancesMap {
334 /// For each item with generics, maps to a vector of the variance
335 /// of its generics. If an item has no generics, it will have no
337 pub variances: FxHashMap<DefId, Lrc<Vec<ty::Variance>>>,
339 /// An empty vector, useful for cloning.
340 #[stable_hasher(ignore)]
341 pub empty_variance: Lrc<Vec<ty::Variance>>,
345 /// `a.xform(b)` combines the variance of a context with the
346 /// variance of a type with the following meaning. If we are in a
347 /// context with variance `a`, and we encounter a type argument in
348 /// a position with variance `b`, then `a.xform(b)` is the new
349 /// variance with which the argument appears.
355 /// Here, the "ambient" variance starts as covariant. `*mut T` is
356 /// invariant with respect to `T`, so the variance in which the
357 /// `Vec<i32>` appears is `Covariant.xform(Invariant)`, which
358 /// yields `Invariant`. Now, the type `Vec<T>` is covariant with
359 /// respect to its type argument `T`, and hence the variance of
360 /// the `i32` here is `Invariant.xform(Covariant)`, which results
361 /// (again) in `Invariant`.
365 /// fn(*const Vec<i32>, *mut Vec<i32)
367 /// The ambient variance is covariant. A `fn` type is
368 /// contravariant with respect to its parameters, so the variance
369 /// within which both pointer types appear is
370 /// `Covariant.xform(Contravariant)`, or `Contravariant`. `*const
371 /// T` is covariant with respect to `T`, so the variance within
372 /// which the first `Vec<i32>` appears is
373 /// `Contravariant.xform(Covariant)` or `Contravariant`. The same
374 /// is true for its `i32` argument. In the `*mut T` case, the
375 /// variance of `Vec<i32>` is `Contravariant.xform(Invariant)`,
376 /// and hence the outermost type is `Invariant` with respect to
377 /// `Vec<i32>` (and its `i32` argument).
379 /// Source: Figure 1 of "Taming the Wildcards:
380 /// Combining Definition- and Use-Site Variance" published in PLDI'11.
381 pub fn xform(self, v: ty::Variance) -> ty::Variance {
383 // Figure 1, column 1.
384 (ty::Covariant, ty::Covariant) => ty::Covariant,
385 (ty::Covariant, ty::Contravariant) => ty::Contravariant,
386 (ty::Covariant, ty::Invariant) => ty::Invariant,
387 (ty::Covariant, ty::Bivariant) => ty::Bivariant,
389 // Figure 1, column 2.
390 (ty::Contravariant, ty::Covariant) => ty::Contravariant,
391 (ty::Contravariant, ty::Contravariant) => ty::Covariant,
392 (ty::Contravariant, ty::Invariant) => ty::Invariant,
393 (ty::Contravariant, ty::Bivariant) => ty::Bivariant,
395 // Figure 1, column 3.
396 (ty::Invariant, _) => ty::Invariant,
398 // Figure 1, column 4.
399 (ty::Bivariant, _) => ty::Bivariant,
404 // Contains information needed to resolve types and (in the future) look up
405 // the types of AST nodes.
406 #[derive(Copy, Clone, PartialEq, Eq, Hash)]
407 pub struct CReaderCacheKey {
412 // Flags that we track on types. These flags are propagated upwards
413 // through the type during type construction, so that we can quickly
414 // check whether the type has various kinds of types in it without
415 // recursing over the type itself.
417 pub struct TypeFlags: u32 {
418 const HAS_PARAMS = 1 << 0;
419 const HAS_SELF = 1 << 1;
420 const HAS_TY_INFER = 1 << 2;
421 const HAS_RE_INFER = 1 << 3;
422 const HAS_RE_PLACEHOLDER = 1 << 4;
424 /// Does this have any `ReEarlyBound` regions? Used to
425 /// determine whether substitition is required, since those
426 /// represent regions that are bound in a `ty::Generics` and
427 /// hence may be substituted.
428 const HAS_RE_EARLY_BOUND = 1 << 5;
430 /// Does this have any region that "appears free" in the type?
431 /// Basically anything but `ReLateBound` and `ReErased`.
432 const HAS_FREE_REGIONS = 1 << 6;
434 /// Is an error type reachable?
435 const HAS_TY_ERR = 1 << 7;
436 const HAS_PROJECTION = 1 << 8;
438 // FIXME: Rename this to the actual property since it's used for generators too
439 const HAS_TY_CLOSURE = 1 << 9;
441 // `true` if there are "names" of types and regions and so forth
442 // that are local to a particular fn
443 const HAS_FREE_LOCAL_NAMES = 1 << 10;
445 // Present if the type belongs in a local type context.
446 // Only set for Infer other than Fresh.
447 const KEEP_IN_LOCAL_TCX = 1 << 11;
449 // Is there a projection that does not involve a bound region?
450 // Currently we can't normalize projections w/ bound regions.
451 const HAS_NORMALIZABLE_PROJECTION = 1 << 12;
453 /// Does this have any `ReLateBound` regions? Used to check
454 /// if a global bound is safe to evaluate.
455 const HAS_RE_LATE_BOUND = 1 << 13;
457 const HAS_TY_PLACEHOLDER = 1 << 14;
459 const HAS_CT_INFER = 1 << 15;
461 const NEEDS_SUBST = TypeFlags::HAS_PARAMS.bits |
462 TypeFlags::HAS_SELF.bits |
463 TypeFlags::HAS_RE_EARLY_BOUND.bits;
465 // Flags representing the nominal content of a type,
466 // computed by FlagsComputation. If you add a new nominal
467 // flag, it should be added here too.
468 const NOMINAL_FLAGS = TypeFlags::HAS_PARAMS.bits |
469 TypeFlags::HAS_SELF.bits |
470 TypeFlags::HAS_TY_INFER.bits |
471 TypeFlags::HAS_RE_INFER.bits |
472 TypeFlags::HAS_CT_INFER.bits |
473 TypeFlags::HAS_RE_PLACEHOLDER.bits |
474 TypeFlags::HAS_RE_EARLY_BOUND.bits |
475 TypeFlags::HAS_FREE_REGIONS.bits |
476 TypeFlags::HAS_TY_ERR.bits |
477 TypeFlags::HAS_PROJECTION.bits |
478 TypeFlags::HAS_TY_CLOSURE.bits |
479 TypeFlags::HAS_FREE_LOCAL_NAMES.bits |
480 TypeFlags::KEEP_IN_LOCAL_TCX.bits |
481 TypeFlags::HAS_RE_LATE_BOUND.bits |
482 TypeFlags::HAS_TY_PLACEHOLDER.bits;
486 pub struct TyS<'tcx> {
487 pub sty: TyKind<'tcx>,
488 pub flags: TypeFlags,
490 /// This is a kind of confusing thing: it stores the smallest
493 /// (a) the binder itself captures nothing but
494 /// (b) all the late-bound things within the type are captured
495 /// by some sub-binder.
497 /// So, for a type without any late-bound things, like `u32`, this
498 /// will be *innermost*, because that is the innermost binder that
499 /// captures nothing. But for a type `&'D u32`, where `'D` is a
500 /// late-bound region with De Bruijn index `D`, this would be `D + 1`
501 /// -- the binder itself does not capture `D`, but `D` is captured
502 /// by an inner binder.
504 /// We call this concept an "exclusive" binder `D` because all
505 /// De Bruijn indices within the type are contained within `0..D`
507 outer_exclusive_binder: ty::DebruijnIndex,
510 // `TyS` is used a lot. Make sure it doesn't unintentionally get bigger.
511 #[cfg(target_arch = "x86_64")]
512 static_assert!(MEM_SIZE_OF_TY_S: ::std::mem::size_of::<TyS<'_>>() == 32);
514 impl<'tcx> Ord for TyS<'tcx> {
515 fn cmp(&self, other: &TyS<'tcx>) -> Ordering {
516 self.sty.cmp(&other.sty)
520 impl<'tcx> PartialOrd for TyS<'tcx> {
521 fn partial_cmp(&self, other: &TyS<'tcx>) -> Option<Ordering> {
522 Some(self.sty.cmp(&other.sty))
526 impl<'tcx> PartialEq for TyS<'tcx> {
528 fn eq(&self, other: &TyS<'tcx>) -> bool {
532 impl<'tcx> Eq for TyS<'tcx> {}
534 impl<'tcx> Hash for TyS<'tcx> {
535 fn hash<H: Hasher>(&self, s: &mut H) {
536 (self as *const TyS<'_>).hash(s)
540 impl<'tcx> TyS<'tcx> {
541 pub fn is_primitive_ty(&self) -> bool {
548 TyKind::Infer(InferTy::IntVar(_)) |
549 TyKind::Infer(InferTy::FloatVar(_)) |
550 TyKind::Infer(InferTy::FreshIntTy(_)) |
551 TyKind::Infer(InferTy::FreshFloatTy(_)) => true,
552 TyKind::Ref(_, x, _) => x.is_primitive_ty(),
557 pub fn is_suggestable(&self) -> bool {
562 TyKind::Dynamic(..) |
563 TyKind::Closure(..) |
565 TyKind::Projection(..) => false,
571 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for ty::TyS<'gcx> {
572 fn hash_stable<W: StableHasherResult>(&self,
573 hcx: &mut StableHashingContext<'a>,
574 hasher: &mut StableHasher<W>) {
578 // The other fields just provide fast access to information that is
579 // also contained in `sty`, so no need to hash them.
582 outer_exclusive_binder: _,
585 sty.hash_stable(hcx, hasher);
589 pub type Ty<'tcx> = &'tcx TyS<'tcx>;
591 impl<'tcx> serialize::UseSpecializedEncodable for Ty<'tcx> {}
592 impl<'tcx> serialize::UseSpecializedDecodable for Ty<'tcx> {}
594 pub type CanonicalTy<'gcx> = Canonical<'gcx, Ty<'gcx>>;
597 /// A dummy type used to force List to by unsized without requiring fat pointers
598 type OpaqueListContents;
601 /// A wrapper for slices with the additional invariant
602 /// that the slice is interned and no other slice with
603 /// the same contents can exist in the same context.
604 /// This means we can use pointer for both
605 /// equality comparisons and hashing.
606 /// Note: `Slice` was already taken by the `Ty`.
611 opaque: OpaqueListContents,
614 unsafe impl<T: Sync> Sync for List<T> {}
616 impl<T: Copy> List<T> {
618 fn from_arena<'tcx>(arena: &'tcx SyncDroplessArena, slice: &[T]) -> &'tcx List<T> {
619 assert!(!mem::needs_drop::<T>());
620 assert!(mem::size_of::<T>() != 0);
621 assert!(slice.len() != 0);
623 // Align up the size of the len (usize) field
624 let align = mem::align_of::<T>();
625 let align_mask = align - 1;
626 let offset = mem::size_of::<usize>();
627 let offset = (offset + align_mask) & !align_mask;
629 let size = offset + slice.len() * mem::size_of::<T>();
631 let mem = arena.alloc_raw(
633 cmp::max(mem::align_of::<T>(), mem::align_of::<usize>()));
635 let result = &mut *(mem.as_mut_ptr() as *mut List<T>);
637 result.len = slice.len();
639 // Write the elements
640 let arena_slice = slice::from_raw_parts_mut(result.data.as_mut_ptr(), result.len);
641 arena_slice.copy_from_slice(slice);
648 impl<T: fmt::Debug> fmt::Debug for List<T> {
649 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
654 impl<T: Encodable> Encodable for List<T> {
656 fn encode<S: Encoder>(&self, s: &mut S) -> Result<(), S::Error> {
661 impl<T> Ord for List<T> where T: Ord {
662 fn cmp(&self, other: &List<T>) -> Ordering {
663 if self == other { Ordering::Equal } else {
664 <[T] as Ord>::cmp(&**self, &**other)
669 impl<T> PartialOrd for List<T> where T: PartialOrd {
670 fn partial_cmp(&self, other: &List<T>) -> Option<Ordering> {
671 if self == other { Some(Ordering::Equal) } else {
672 <[T] as PartialOrd>::partial_cmp(&**self, &**other)
677 impl<T: PartialEq> PartialEq for List<T> {
679 fn eq(&self, other: &List<T>) -> bool {
683 impl<T: Eq> Eq for List<T> {}
685 impl<T> Hash for List<T> {
687 fn hash<H: Hasher>(&self, s: &mut H) {
688 (self as *const List<T>).hash(s)
692 impl<T> Deref for List<T> {
695 fn deref(&self) -> &[T] {
697 slice::from_raw_parts(self.data.as_ptr(), self.len)
702 impl<'a, T> IntoIterator for &'a List<T> {
704 type IntoIter = <&'a [T] as IntoIterator>::IntoIter;
706 fn into_iter(self) -> Self::IntoIter {
711 impl<'tcx> serialize::UseSpecializedDecodable for &'tcx List<Ty<'tcx>> {}
715 pub fn empty<'a>() -> &'a List<T> {
716 #[repr(align(64), C)]
717 struct EmptySlice([u8; 64]);
718 static EMPTY_SLICE: EmptySlice = EmptySlice([0; 64]);
719 assert!(mem::align_of::<T>() <= 64);
721 &*(&EMPTY_SLICE as *const _ as *const List<T>)
726 #[derive(Clone, Copy, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
727 pub struct UpvarPath {
728 pub hir_id: hir::HirId,
731 /// Upvars do not get their own `NodeId`. Instead, we use the pair of
732 /// the original var ID (that is, the root variable that is referenced
733 /// by the upvar) and the ID of the closure expression.
734 #[derive(Clone, Copy, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
736 pub var_path: UpvarPath,
737 pub closure_expr_id: LocalDefId,
740 #[derive(Clone, PartialEq, Eq, Hash, Debug, RustcEncodable, RustcDecodable, Copy, HashStable)]
741 pub enum BorrowKind {
742 /// Data must be immutable and is aliasable.
745 /// Data must be immutable but not aliasable. This kind of borrow
746 /// cannot currently be expressed by the user and is used only in
747 /// implicit closure bindings. It is needed when the closure
748 /// is borrowing or mutating a mutable referent, e.g.:
750 /// let x: &mut isize = ...;
751 /// let y = || *x += 5;
753 /// If we were to try to translate this closure into a more explicit
754 /// form, we'd encounter an error with the code as written:
756 /// struct Env { x: & &mut isize }
757 /// let x: &mut isize = ...;
758 /// let y = (&mut Env { &x }, fn_ptr); // Closure is pair of env and fn
759 /// fn fn_ptr(env: &mut Env) { **env.x += 5; }
761 /// This is then illegal because you cannot mutate a `&mut` found
762 /// in an aliasable location. To solve, you'd have to translate with
763 /// an `&mut` borrow:
765 /// struct Env { x: & &mut isize }
766 /// let x: &mut isize = ...;
767 /// let y = (&mut Env { &mut x }, fn_ptr); // changed from &x to &mut x
768 /// fn fn_ptr(env: &mut Env) { **env.x += 5; }
770 /// Now the assignment to `**env.x` is legal, but creating a
771 /// mutable pointer to `x` is not because `x` is not mutable. We
772 /// could fix this by declaring `x` as `let mut x`. This is ok in
773 /// user code, if awkward, but extra weird for closures, since the
774 /// borrow is hidden.
776 /// So we introduce a "unique imm" borrow -- the referent is
777 /// immutable, but not aliasable. This solves the problem. For
778 /// simplicity, we don't give users the way to express this
779 /// borrow, it's just used when translating closures.
782 /// Data is mutable and not aliasable.
786 /// Information describing the capture of an upvar. This is computed
787 /// during `typeck`, specifically by `regionck`.
788 #[derive(PartialEq, Clone, Debug, Copy, RustcEncodable, RustcDecodable, HashStable)]
789 pub enum UpvarCapture<'tcx> {
790 /// Upvar is captured by value. This is always true when the
791 /// closure is labeled `move`, but can also be true in other cases
792 /// depending on inference.
795 /// Upvar is captured by reference.
796 ByRef(UpvarBorrow<'tcx>),
799 #[derive(PartialEq, Clone, Copy, RustcEncodable, RustcDecodable, HashStable)]
800 pub struct UpvarBorrow<'tcx> {
801 /// The kind of borrow: by-ref upvars have access to shared
802 /// immutable borrows, which are not part of the normal language
804 pub kind: BorrowKind,
806 /// Region of the resulting reference.
807 pub region: ty::Region<'tcx>,
810 pub type UpvarListMap = FxHashMap<DefId, Vec<UpvarId>>;
811 pub type UpvarCaptureMap<'tcx> = FxHashMap<UpvarId, UpvarCapture<'tcx>>;
813 #[derive(Copy, Clone)]
814 pub struct ClosureUpvar<'tcx> {
820 #[derive(Clone, Copy, PartialEq, Eq)]
821 pub enum IntVarValue {
823 UintType(ast::UintTy),
826 #[derive(Clone, Copy, PartialEq, Eq)]
827 pub struct FloatVarValue(pub ast::FloatTy);
829 impl ty::EarlyBoundRegion {
830 pub fn to_bound_region(&self) -> ty::BoundRegion {
831 ty::BoundRegion::BrNamed(self.def_id, self.name)
834 /// Does this early bound region have a name? Early bound regions normally
835 /// always have names except when using anonymous lifetimes (`'_`).
836 pub fn has_name(&self) -> bool {
837 self.name != keywords::UnderscoreLifetime.name().as_interned_str()
841 #[derive(Clone, Debug, RustcEncodable, RustcDecodable, HashStable)]
842 pub enum GenericParamDefKind {
846 object_lifetime_default: ObjectLifetimeDefault,
847 synthetic: Option<hir::SyntheticTyParamKind>,
852 #[derive(Clone, RustcEncodable, RustcDecodable, HashStable)]
853 pub struct GenericParamDef {
854 pub name: InternedString,
858 /// `pure_wrt_drop`, set by the (unsafe) `#[may_dangle]` attribute
859 /// on generic parameter `'a`/`T`, asserts data behind the parameter
860 /// `'a`/`T` won't be accessed during the parent type's `Drop` impl.
861 pub pure_wrt_drop: bool,
863 pub kind: GenericParamDefKind,
866 impl GenericParamDef {
867 pub fn to_early_bound_region_data(&self) -> ty::EarlyBoundRegion {
868 if let GenericParamDefKind::Lifetime = self.kind {
869 ty::EarlyBoundRegion {
875 bug!("cannot convert a non-lifetime parameter def to an early bound region")
879 pub fn to_bound_region(&self) -> ty::BoundRegion {
880 if let GenericParamDefKind::Lifetime = self.kind {
881 self.to_early_bound_region_data().to_bound_region()
883 bug!("cannot convert a non-lifetime parameter def to an early bound region")
889 pub struct GenericParamCount {
890 pub lifetimes: usize,
895 /// Information about the formal type/lifetime parameters associated
896 /// with an item or method. Analogous to `hir::Generics`.
898 /// The ordering of parameters is the same as in `Subst` (excluding child generics):
899 /// `Self` (optionally), `Lifetime` params..., `Type` params...
900 #[derive(Clone, Debug, RustcEncodable, RustcDecodable, HashStable)]
901 pub struct Generics {
902 pub parent: Option<DefId>,
903 pub parent_count: usize,
904 pub params: Vec<GenericParamDef>,
906 /// Reverse map to the `index` field of each `GenericParamDef`
907 #[stable_hasher(ignore)]
908 pub param_def_id_to_index: FxHashMap<DefId, u32>,
911 pub has_late_bound_regions: Option<Span>,
914 impl<'a, 'gcx, 'tcx> Generics {
915 pub fn count(&self) -> usize {
916 self.parent_count + self.params.len()
919 pub fn own_counts(&self) -> GenericParamCount {
920 // We could cache this as a property of `GenericParamCount`, but
921 // the aim is to refactor this away entirely eventually and the
922 // presence of this method will be a constant reminder.
923 let mut own_counts: GenericParamCount = Default::default();
925 for param in &self.params {
927 GenericParamDefKind::Lifetime => own_counts.lifetimes += 1,
928 GenericParamDefKind::Type { .. } => own_counts.types += 1,
929 GenericParamDefKind::Const => own_counts.consts += 1,
936 pub fn requires_monomorphization(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> bool {
937 for param in &self.params {
939 GenericParamDefKind::Type { .. } | GenericParamDefKind::Const => return true,
940 GenericParamDefKind::Lifetime => {}
943 if let Some(parent_def_id) = self.parent {
944 let parent = tcx.generics_of(parent_def_id);
945 parent.requires_monomorphization(tcx)
951 pub fn region_param(&'tcx self,
952 param: &EarlyBoundRegion,
953 tcx: TyCtxt<'a, 'gcx, 'tcx>)
954 -> &'tcx GenericParamDef
956 if let Some(index) = param.index.checked_sub(self.parent_count as u32) {
957 let param = &self.params[index as usize];
959 GenericParamDefKind::Lifetime => param,
960 _ => bug!("expected lifetime parameter, but found another generic parameter")
963 tcx.generics_of(self.parent.expect("parent_count > 0 but no parent?"))
964 .region_param(param, tcx)
968 /// Returns the `GenericParamDef` associated with this `ParamTy`.
969 pub fn type_param(&'tcx self,
971 tcx: TyCtxt<'a, 'gcx, 'tcx>)
972 -> &'tcx GenericParamDef {
973 if let Some(index) = param.idx.checked_sub(self.parent_count as u32) {
974 let param = &self.params[index as usize];
976 GenericParamDefKind::Type { .. } => param,
977 _ => bug!("expected type parameter, but found another generic parameter")
980 tcx.generics_of(self.parent.expect("parent_count > 0 but no parent?"))
981 .type_param(param, tcx)
985 /// Returns the `ConstParameterDef` associated with this `ParamConst`.
986 pub fn const_param(&'tcx self,
988 tcx: TyCtxt<'a, 'gcx, 'tcx>)
989 -> &GenericParamDef {
990 if let Some(index) = param.index.checked_sub(self.parent_count as u32) {
991 let param = &self.params[index as usize];
993 GenericParamDefKind::Const => param,
994 _ => bug!("expected const parameter, but found another generic parameter")
997 tcx.generics_of(self.parent.expect("parent_count>0 but no parent?"))
998 .const_param(param, tcx)
1003 /// Bounds on generics.
1004 #[derive(Clone, Default, Debug, HashStable)]
1005 pub struct GenericPredicates<'tcx> {
1006 pub parent: Option<DefId>,
1007 pub predicates: Vec<(Predicate<'tcx>, Span)>,
1010 impl<'tcx> serialize::UseSpecializedEncodable for GenericPredicates<'tcx> {}
1011 impl<'tcx> serialize::UseSpecializedDecodable for GenericPredicates<'tcx> {}
1013 impl<'a, 'gcx, 'tcx> GenericPredicates<'tcx> {
1014 pub fn instantiate(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>, substs: SubstsRef<'tcx>)
1015 -> InstantiatedPredicates<'tcx> {
1016 let mut instantiated = InstantiatedPredicates::empty();
1017 self.instantiate_into(tcx, &mut instantiated, substs);
1021 pub fn instantiate_own(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>, substs: SubstsRef<'tcx>)
1022 -> InstantiatedPredicates<'tcx> {
1023 InstantiatedPredicates {
1024 predicates: self.predicates.iter().map(|(p, _)| p.subst(tcx, substs)).collect(),
1028 fn instantiate_into(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>,
1029 instantiated: &mut InstantiatedPredicates<'tcx>,
1030 substs: SubstsRef<'tcx>) {
1031 if let Some(def_id) = self.parent {
1032 tcx.predicates_of(def_id).instantiate_into(tcx, instantiated, substs);
1034 instantiated.predicates.extend(
1035 self.predicates.iter().map(|(p, _)| p.subst(tcx, substs)),
1039 pub fn instantiate_identity(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>)
1040 -> InstantiatedPredicates<'tcx> {
1041 let mut instantiated = InstantiatedPredicates::empty();
1042 self.instantiate_identity_into(tcx, &mut instantiated);
1046 fn instantiate_identity_into(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>,
1047 instantiated: &mut InstantiatedPredicates<'tcx>) {
1048 if let Some(def_id) = self.parent {
1049 tcx.predicates_of(def_id).instantiate_identity_into(tcx, instantiated);
1051 instantiated.predicates.extend(self.predicates.iter().map(|&(p, _)| p))
1054 pub fn instantiate_supertrait(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>,
1055 poly_trait_ref: &ty::PolyTraitRef<'tcx>)
1056 -> InstantiatedPredicates<'tcx>
1058 assert_eq!(self.parent, None);
1059 InstantiatedPredicates {
1060 predicates: self.predicates.iter().map(|(pred, _)| {
1061 pred.subst_supertrait(tcx, poly_trait_ref)
1067 #[derive(Clone, Copy, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
1068 pub enum Predicate<'tcx> {
1069 /// Corresponds to `where Foo: Bar<A,B,C>`. `Foo` here would be
1070 /// the `Self` type of the trait reference and `A`, `B`, and `C`
1071 /// would be the type parameters.
1072 Trait(PolyTraitPredicate<'tcx>),
1075 RegionOutlives(PolyRegionOutlivesPredicate<'tcx>),
1078 TypeOutlives(PolyTypeOutlivesPredicate<'tcx>),
1080 /// where `<T as TraitRef>::Name == X`, approximately.
1081 /// See the `ProjectionPredicate` struct for details.
1082 Projection(PolyProjectionPredicate<'tcx>),
1084 /// no syntax: `T` well-formed
1085 WellFormed(Ty<'tcx>),
1087 /// trait must be object-safe
1090 /// No direct syntax. May be thought of as `where T: FnFoo<...>`
1091 /// for some substitutions `...` and `T` being a closure type.
1092 /// Satisfied (or refuted) once we know the closure's kind.
1093 ClosureKind(DefId, ClosureSubsts<'tcx>, ClosureKind),
1096 Subtype(PolySubtypePredicate<'tcx>),
1098 /// Constant initializer must evaluate successfully.
1099 ConstEvaluatable(DefId, SubstsRef<'tcx>),
1102 /// The crate outlives map is computed during typeck and contains the
1103 /// outlives of every item in the local crate. You should not use it
1104 /// directly, because to do so will make your pass dependent on the
1105 /// HIR of every item in the local crate. Instead, use
1106 /// `tcx.inferred_outlives_of()` to get the outlives for a *particular*
1108 #[derive(HashStable)]
1109 pub struct CratePredicatesMap<'tcx> {
1110 /// For each struct with outlive bounds, maps to a vector of the
1111 /// predicate of its outlive bounds. If an item has no outlives
1112 /// bounds, it will have no entry.
1113 pub predicates: FxHashMap<DefId, Lrc<Vec<ty::Predicate<'tcx>>>>,
1115 /// An empty vector, useful for cloning.
1116 #[stable_hasher(ignore)]
1117 pub empty_predicate: Lrc<Vec<ty::Predicate<'tcx>>>,
1120 impl<'tcx> AsRef<Predicate<'tcx>> for Predicate<'tcx> {
1121 fn as_ref(&self) -> &Predicate<'tcx> {
1126 impl<'a, 'gcx, 'tcx> Predicate<'tcx> {
1127 /// Performs a substitution suitable for going from a
1128 /// poly-trait-ref to supertraits that must hold if that
1129 /// poly-trait-ref holds. This is slightly different from a normal
1130 /// substitution in terms of what happens with bound regions. See
1131 /// lengthy comment below for details.
1132 pub fn subst_supertrait(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>,
1133 trait_ref: &ty::PolyTraitRef<'tcx>)
1134 -> ty::Predicate<'tcx>
1136 // The interaction between HRTB and supertraits is not entirely
1137 // obvious. Let me walk you (and myself) through an example.
1139 // Let's start with an easy case. Consider two traits:
1141 // trait Foo<'a>: Bar<'a,'a> { }
1142 // trait Bar<'b,'c> { }
1144 // Now, if we have a trait reference `for<'x> T: Foo<'x>`, then
1145 // we can deduce that `for<'x> T: Bar<'x,'x>`. Basically, if we
1146 // knew that `Foo<'x>` (for any 'x) then we also know that
1147 // `Bar<'x,'x>` (for any 'x). This more-or-less falls out from
1148 // normal substitution.
1150 // In terms of why this is sound, the idea is that whenever there
1151 // is an impl of `T:Foo<'a>`, it must show that `T:Bar<'a,'a>`
1152 // holds. So if there is an impl of `T:Foo<'a>` that applies to
1153 // all `'a`, then we must know that `T:Bar<'a,'a>` holds for all
1156 // Another example to be careful of is this:
1158 // trait Foo1<'a>: for<'b> Bar1<'a,'b> { }
1159 // trait Bar1<'b,'c> { }
1161 // Here, if we have `for<'x> T: Foo1<'x>`, then what do we know?
1162 // The answer is that we know `for<'x,'b> T: Bar1<'x,'b>`. The
1163 // reason is similar to the previous example: any impl of
1164 // `T:Foo1<'x>` must show that `for<'b> T: Bar1<'x, 'b>`. So
1165 // basically we would want to collapse the bound lifetimes from
1166 // the input (`trait_ref`) and the supertraits.
1168 // To achieve this in practice is fairly straightforward. Let's
1169 // consider the more complicated scenario:
1171 // - We start out with `for<'x> T: Foo1<'x>`. In this case, `'x`
1172 // has a De Bruijn index of 1. We want to produce `for<'x,'b> T: Bar1<'x,'b>`,
1173 // where both `'x` and `'b` would have a DB index of 1.
1174 // The substitution from the input trait-ref is therefore going to be
1175 // `'a => 'x` (where `'x` has a DB index of 1).
1176 // - The super-trait-ref is `for<'b> Bar1<'a,'b>`, where `'a` is an
1177 // early-bound parameter and `'b' is a late-bound parameter with a
1179 // - If we replace `'a` with `'x` from the input, it too will have
1180 // a DB index of 1, and thus we'll have `for<'x,'b> Bar1<'x,'b>`
1181 // just as we wanted.
1183 // There is only one catch. If we just apply the substitution `'a
1184 // => 'x` to `for<'b> Bar1<'a,'b>`, the substitution code will
1185 // adjust the DB index because we substituting into a binder (it
1186 // tries to be so smart...) resulting in `for<'x> for<'b>
1187 // Bar1<'x,'b>` (we have no syntax for this, so use your
1188 // imagination). Basically the 'x will have DB index of 2 and 'b
1189 // will have DB index of 1. Not quite what we want. So we apply
1190 // the substitution to the *contents* of the trait reference,
1191 // rather than the trait reference itself (put another way, the
1192 // substitution code expects equal binding levels in the values
1193 // from the substitution and the value being substituted into, and
1194 // this trick achieves that).
1196 let substs = &trait_ref.skip_binder().substs;
1198 Predicate::Trait(ref binder) =>
1199 Predicate::Trait(binder.map_bound(|data| data.subst(tcx, substs))),
1200 Predicate::Subtype(ref binder) =>
1201 Predicate::Subtype(binder.map_bound(|data| data.subst(tcx, substs))),
1202 Predicate::RegionOutlives(ref binder) =>
1203 Predicate::RegionOutlives(binder.map_bound(|data| data.subst(tcx, substs))),
1204 Predicate::TypeOutlives(ref binder) =>
1205 Predicate::TypeOutlives(binder.map_bound(|data| data.subst(tcx, substs))),
1206 Predicate::Projection(ref binder) =>
1207 Predicate::Projection(binder.map_bound(|data| data.subst(tcx, substs))),
1208 Predicate::WellFormed(data) =>
1209 Predicate::WellFormed(data.subst(tcx, substs)),
1210 Predicate::ObjectSafe(trait_def_id) =>
1211 Predicate::ObjectSafe(trait_def_id),
1212 Predicate::ClosureKind(closure_def_id, closure_substs, kind) =>
1213 Predicate::ClosureKind(closure_def_id, closure_substs.subst(tcx, substs), kind),
1214 Predicate::ConstEvaluatable(def_id, const_substs) =>
1215 Predicate::ConstEvaluatable(def_id, const_substs.subst(tcx, substs)),
1220 #[derive(Clone, Copy, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
1221 pub struct TraitPredicate<'tcx> {
1222 pub trait_ref: TraitRef<'tcx>
1225 pub type PolyTraitPredicate<'tcx> = ty::Binder<TraitPredicate<'tcx>>;
1227 impl<'tcx> TraitPredicate<'tcx> {
1228 pub fn def_id(&self) -> DefId {
1229 self.trait_ref.def_id
1232 pub fn input_types<'a>(&'a self) -> impl DoubleEndedIterator<Item=Ty<'tcx>> + 'a {
1233 self.trait_ref.input_types()
1236 pub fn self_ty(&self) -> Ty<'tcx> {
1237 self.trait_ref.self_ty()
1241 impl<'tcx> PolyTraitPredicate<'tcx> {
1242 pub fn def_id(&self) -> DefId {
1243 // ok to skip binder since trait def-id does not care about regions
1244 self.skip_binder().def_id()
1248 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord,
1249 Hash, Debug, RustcEncodable, RustcDecodable, HashStable)]
1250 pub struct OutlivesPredicate<A,B>(pub A, pub B); // `A: B`
1251 pub type PolyOutlivesPredicate<A,B> = ty::Binder<OutlivesPredicate<A,B>>;
1252 pub type RegionOutlivesPredicate<'tcx> = OutlivesPredicate<ty::Region<'tcx>,
1254 pub type TypeOutlivesPredicate<'tcx> = OutlivesPredicate<Ty<'tcx>,
1256 pub type PolyRegionOutlivesPredicate<'tcx> = ty::Binder<RegionOutlivesPredicate<'tcx>>;
1257 pub type PolyTypeOutlivesPredicate<'tcx> = ty::Binder<TypeOutlivesPredicate<'tcx>>;
1259 #[derive(Clone, Copy, PartialEq, Eq, Hash, Debug, RustcEncodable, RustcDecodable, HashStable)]
1260 pub struct SubtypePredicate<'tcx> {
1261 pub a_is_expected: bool,
1265 pub type PolySubtypePredicate<'tcx> = ty::Binder<SubtypePredicate<'tcx>>;
1267 /// This kind of predicate has no *direct* correspondent in the
1268 /// syntax, but it roughly corresponds to the syntactic forms:
1270 /// 1. `T: TraitRef<..., Item = Type>`
1271 /// 2. `<T as TraitRef<...>>::Item == Type` (NYI)
1273 /// In particular, form #1 is "desugared" to the combination of a
1274 /// normal trait predicate (`T: TraitRef<...>`) and one of these
1275 /// predicates. Form #2 is a broader form in that it also permits
1276 /// equality between arbitrary types. Processing an instance of
1277 /// Form #2 eventually yields one of these `ProjectionPredicate`
1278 /// instances to normalize the LHS.
1279 #[derive(Copy, Clone, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
1280 pub struct ProjectionPredicate<'tcx> {
1281 pub projection_ty: ProjectionTy<'tcx>,
1285 pub type PolyProjectionPredicate<'tcx> = Binder<ProjectionPredicate<'tcx>>;
1287 impl<'tcx> PolyProjectionPredicate<'tcx> {
1288 /// Returns the `DefId` of the associated item being projected.
1289 pub fn item_def_id(&self) -> DefId {
1290 self.skip_binder().projection_ty.item_def_id
1294 pub fn to_poly_trait_ref(&self, tcx: TyCtxt<'_, '_, '_>) -> PolyTraitRef<'tcx> {
1295 // Note: unlike with `TraitRef::to_poly_trait_ref()`,
1296 // `self.0.trait_ref` is permitted to have escaping regions.
1297 // This is because here `self` has a `Binder` and so does our
1298 // return value, so we are preserving the number of binding
1300 self.map_bound(|predicate| predicate.projection_ty.trait_ref(tcx))
1303 pub fn ty(&self) -> Binder<Ty<'tcx>> {
1304 self.map_bound(|predicate| predicate.ty)
1307 /// The `DefId` of the `TraitItem` for the associated type.
1309 /// Note that this is not the `DefId` of the `TraitRef` containing this
1310 /// associated type, which is in `tcx.associated_item(projection_def_id()).container`.
1311 pub fn projection_def_id(&self) -> DefId {
1312 // okay to skip binder since trait def-id does not care about regions
1313 self.skip_binder().projection_ty.item_def_id
1317 pub trait ToPolyTraitRef<'tcx> {
1318 fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx>;
1321 impl<'tcx> ToPolyTraitRef<'tcx> for TraitRef<'tcx> {
1322 fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx> {
1323 ty::Binder::dummy(self.clone())
1327 impl<'tcx> ToPolyTraitRef<'tcx> for PolyTraitPredicate<'tcx> {
1328 fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx> {
1329 self.map_bound_ref(|trait_pred| trait_pred.trait_ref)
1333 pub trait ToPredicate<'tcx> {
1334 fn to_predicate(&self) -> Predicate<'tcx>;
1337 impl<'tcx> ToPredicate<'tcx> for TraitRef<'tcx> {
1338 fn to_predicate(&self) -> Predicate<'tcx> {
1339 ty::Predicate::Trait(ty::Binder::dummy(ty::TraitPredicate {
1340 trait_ref: self.clone()
1345 impl<'tcx> ToPredicate<'tcx> for PolyTraitRef<'tcx> {
1346 fn to_predicate(&self) -> Predicate<'tcx> {
1347 ty::Predicate::Trait(self.to_poly_trait_predicate())
1351 impl<'tcx> ToPredicate<'tcx> for PolyRegionOutlivesPredicate<'tcx> {
1352 fn to_predicate(&self) -> Predicate<'tcx> {
1353 Predicate::RegionOutlives(self.clone())
1357 impl<'tcx> ToPredicate<'tcx> for PolyTypeOutlivesPredicate<'tcx> {
1358 fn to_predicate(&self) -> Predicate<'tcx> {
1359 Predicate::TypeOutlives(self.clone())
1363 impl<'tcx> ToPredicate<'tcx> for PolyProjectionPredicate<'tcx> {
1364 fn to_predicate(&self) -> Predicate<'tcx> {
1365 Predicate::Projection(self.clone())
1369 // A custom iterator used by Predicate::walk_tys.
1370 enum WalkTysIter<'tcx, I, J, K>
1371 where I: Iterator<Item = Ty<'tcx>>,
1372 J: Iterator<Item = Ty<'tcx>>,
1373 K: Iterator<Item = Ty<'tcx>>
1377 Two(Ty<'tcx>, Ty<'tcx>),
1383 impl<'tcx, I, J, K> Iterator for WalkTysIter<'tcx, I, J, K>
1384 where I: Iterator<Item = Ty<'tcx>>,
1385 J: Iterator<Item = Ty<'tcx>>,
1386 K: Iterator<Item = Ty<'tcx>>
1388 type Item = Ty<'tcx>;
1390 fn next(&mut self) -> Option<Ty<'tcx>> {
1392 WalkTysIter::None => None,
1393 WalkTysIter::One(item) => {
1394 *self = WalkTysIter::None;
1397 WalkTysIter::Two(item1, item2) => {
1398 *self = WalkTysIter::One(item2);
1401 WalkTysIter::Types(ref mut iter) => {
1404 WalkTysIter::InputTypes(ref mut iter) => {
1407 WalkTysIter::ProjectionTypes(ref mut iter) => {
1414 impl<'tcx> Predicate<'tcx> {
1415 /// Iterates over the types in this predicate. Note that in all
1416 /// cases this is skipping over a binder, so late-bound regions
1417 /// with depth 0 are bound by the predicate.
1418 pub fn walk_tys(&'a self) -> impl Iterator<Item = Ty<'tcx>> + 'a {
1420 ty::Predicate::Trait(ref data) => {
1421 WalkTysIter::InputTypes(data.skip_binder().input_types())
1423 ty::Predicate::Subtype(binder) => {
1424 let SubtypePredicate { a, b, a_is_expected: _ } = binder.skip_binder();
1425 WalkTysIter::Two(a, b)
1427 ty::Predicate::TypeOutlives(binder) => {
1428 WalkTysIter::One(binder.skip_binder().0)
1430 ty::Predicate::RegionOutlives(..) => {
1433 ty::Predicate::Projection(ref data) => {
1434 let inner = data.skip_binder();
1435 WalkTysIter::ProjectionTypes(
1436 inner.projection_ty.substs.types().chain(Some(inner.ty)))
1438 ty::Predicate::WellFormed(data) => {
1439 WalkTysIter::One(data)
1441 ty::Predicate::ObjectSafe(_trait_def_id) => {
1444 ty::Predicate::ClosureKind(_closure_def_id, closure_substs, _kind) => {
1445 WalkTysIter::Types(closure_substs.substs.types())
1447 ty::Predicate::ConstEvaluatable(_, substs) => {
1448 WalkTysIter::Types(substs.types())
1453 pub fn to_opt_poly_trait_ref(&self) -> Option<PolyTraitRef<'tcx>> {
1455 Predicate::Trait(ref t) => {
1456 Some(t.to_poly_trait_ref())
1458 Predicate::Projection(..) |
1459 Predicate::Subtype(..) |
1460 Predicate::RegionOutlives(..) |
1461 Predicate::WellFormed(..) |
1462 Predicate::ObjectSafe(..) |
1463 Predicate::ClosureKind(..) |
1464 Predicate::TypeOutlives(..) |
1465 Predicate::ConstEvaluatable(..) => {
1471 pub fn to_opt_type_outlives(&self) -> Option<PolyTypeOutlivesPredicate<'tcx>> {
1473 Predicate::TypeOutlives(data) => {
1476 Predicate::Trait(..) |
1477 Predicate::Projection(..) |
1478 Predicate::Subtype(..) |
1479 Predicate::RegionOutlives(..) |
1480 Predicate::WellFormed(..) |
1481 Predicate::ObjectSafe(..) |
1482 Predicate::ClosureKind(..) |
1483 Predicate::ConstEvaluatable(..) => {
1490 /// Represents the bounds declared on a particular set of type
1491 /// parameters. Should eventually be generalized into a flag list of
1492 /// where-clauses. You can obtain a `InstantiatedPredicates` list from a
1493 /// `GenericPredicates` by using the `instantiate` method. Note that this method
1494 /// reflects an important semantic invariant of `InstantiatedPredicates`: while
1495 /// the `GenericPredicates` are expressed in terms of the bound type
1496 /// parameters of the impl/trait/whatever, an `InstantiatedPredicates` instance
1497 /// represented a set of bounds for some particular instantiation,
1498 /// meaning that the generic parameters have been substituted with
1503 /// struct Foo<T,U:Bar<T>> { ... }
1505 /// Here, the `GenericPredicates` for `Foo` would contain a list of bounds like
1506 /// `[[], [U:Bar<T>]]`. Now if there were some particular reference
1507 /// like `Foo<isize,usize>`, then the `InstantiatedPredicates` would be `[[],
1508 /// [usize:Bar<isize>]]`.
1509 #[derive(Clone, Debug)]
1510 pub struct InstantiatedPredicates<'tcx> {
1511 pub predicates: Vec<Predicate<'tcx>>,
1514 impl<'tcx> InstantiatedPredicates<'tcx> {
1515 pub fn empty() -> InstantiatedPredicates<'tcx> {
1516 InstantiatedPredicates { predicates: vec![] }
1519 pub fn is_empty(&self) -> bool {
1520 self.predicates.is_empty()
1525 /// "Universes" are used during type- and trait-checking in the
1526 /// presence of `for<..>` binders to control what sets of names are
1527 /// visible. Universes are arranged into a tree: the root universe
1528 /// contains names that are always visible. Each child then adds a new
1529 /// set of names that are visible, in addition to those of its parent.
1530 /// We say that the child universe "extends" the parent universe with
1533 /// To make this more concrete, consider this program:
1537 /// fn bar<T>(x: T) {
1538 /// let y: for<'a> fn(&'a u8, Foo) = ...;
1542 /// The struct name `Foo` is in the root universe U0. But the type
1543 /// parameter `T`, introduced on `bar`, is in an extended universe U1
1544 /// -- i.e., within `bar`, we can name both `T` and `Foo`, but outside
1545 /// of `bar`, we cannot name `T`. Then, within the type of `y`, the
1546 /// region `'a` is in a universe U2 that extends U1, because we can
1547 /// name it inside the fn type but not outside.
1549 /// Universes are used to do type- and trait-checking around these
1550 /// "forall" binders (also called **universal quantification**). The
1551 /// idea is that when, in the body of `bar`, we refer to `T` as a
1552 /// type, we aren't referring to any type in particular, but rather a
1553 /// kind of "fresh" type that is distinct from all other types we have
1554 /// actually declared. This is called a **placeholder** type, and we
1555 /// use universes to talk about this. In other words, a type name in
1556 /// universe 0 always corresponds to some "ground" type that the user
1557 /// declared, but a type name in a non-zero universe is a placeholder
1558 /// type -- an idealized representative of "types in general" that we
1559 /// use for checking generic functions.
1560 pub struct UniverseIndex {
1561 DEBUG_FORMAT = "U{}",
1565 impl_stable_hash_for!(struct UniverseIndex { private });
1567 impl UniverseIndex {
1568 pub const ROOT: UniverseIndex = UniverseIndex::from_u32_const(0);
1570 /// Returns the "next" universe index in order -- this new index
1571 /// is considered to extend all previous universes. This
1572 /// corresponds to entering a `forall` quantifier. So, for
1573 /// example, suppose we have this type in universe `U`:
1576 /// for<'a> fn(&'a u32)
1579 /// Once we "enter" into this `for<'a>` quantifier, we are in a
1580 /// new universe that extends `U` -- in this new universe, we can
1581 /// name the region `'a`, but that region was not nameable from
1582 /// `U` because it was not in scope there.
1583 pub fn next_universe(self) -> UniverseIndex {
1584 UniverseIndex::from_u32(self.private.checked_add(1).unwrap())
1587 /// Returns `true` if `self` can name a name from `other` -- in other words,
1588 /// if the set of names in `self` is a superset of those in
1589 /// `other` (`self >= other`).
1590 pub fn can_name(self, other: UniverseIndex) -> bool {
1591 self.private >= other.private
1594 /// Returns `true` if `self` cannot name some names from `other` -- in other
1595 /// words, if the set of names in `self` is a strict subset of
1596 /// those in `other` (`self < other`).
1597 pub fn cannot_name(self, other: UniverseIndex) -> bool {
1598 self.private < other.private
1602 /// The "placeholder index" fully defines a placeholder region.
1603 /// Placeholder regions are identified by both a **universe** as well
1604 /// as a "bound-region" within that universe. The `bound_region` is
1605 /// basically a name -- distinct bound regions within the same
1606 /// universe are just two regions with an unknown relationship to one
1608 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, PartialOrd, Ord)]
1609 pub struct Placeholder<T> {
1610 pub universe: UniverseIndex,
1614 impl<'a, 'gcx, T> HashStable<StableHashingContext<'a>> for Placeholder<T>
1615 where T: HashStable<StableHashingContext<'a>>
1617 fn hash_stable<W: StableHasherResult>(
1619 hcx: &mut StableHashingContext<'a>,
1620 hasher: &mut StableHasher<W>
1622 self.universe.hash_stable(hcx, hasher);
1623 self.name.hash_stable(hcx, hasher);
1627 pub type PlaceholderRegion = Placeholder<BoundRegion>;
1629 pub type PlaceholderType = Placeholder<BoundVar>;
1631 /// When type checking, we use the `ParamEnv` to track
1632 /// details about the set of where-clauses that are in scope at this
1633 /// particular point.
1634 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, HashStable)]
1635 pub struct ParamEnv<'tcx> {
1636 /// Obligations that the caller must satisfy. This is basically
1637 /// the set of bounds on the in-scope type parameters, translated
1638 /// into Obligations, and elaborated and normalized.
1639 pub caller_bounds: &'tcx List<ty::Predicate<'tcx>>,
1641 /// Typically, this is `Reveal::UserFacing`, but during codegen we
1642 /// want `Reveal::All` -- note that this is always paired with an
1643 /// empty environment. To get that, use `ParamEnv::reveal()`.
1644 pub reveal: traits::Reveal,
1646 /// If this `ParamEnv` comes from a call to `tcx.param_env(def_id)`,
1647 /// register that `def_id` (useful for transitioning to the chalk trait
1649 pub def_id: Option<DefId>,
1652 impl<'tcx> ParamEnv<'tcx> {
1653 /// Construct a trait environment suitable for contexts where
1654 /// there are no where-clauses in scope. Hidden types (like `impl
1655 /// Trait`) are left hidden, so this is suitable for ordinary
1658 pub fn empty() -> Self {
1659 Self::new(List::empty(), Reveal::UserFacing, None)
1662 /// Construct a trait environment with no where-clauses in scope
1663 /// where the values of all `impl Trait` and other hidden types
1664 /// are revealed. This is suitable for monomorphized, post-typeck
1665 /// environments like codegen or doing optimizations.
1667 /// N.B., if you want to have predicates in scope, use `ParamEnv::new`,
1668 /// or invoke `param_env.with_reveal_all()`.
1670 pub fn reveal_all() -> Self {
1671 Self::new(List::empty(), Reveal::All, None)
1674 /// Construct a trait environment with the given set of predicates.
1677 caller_bounds: &'tcx List<ty::Predicate<'tcx>>,
1679 def_id: Option<DefId>
1681 ty::ParamEnv { caller_bounds, reveal, def_id }
1684 /// Returns a new parameter environment with the same clauses, but
1685 /// which "reveals" the true results of projections in all cases
1686 /// (even for associated types that are specializable). This is
1687 /// the desired behavior during codegen and certain other special
1688 /// contexts; normally though we want to use `Reveal::UserFacing`,
1689 /// which is the default.
1690 pub fn with_reveal_all(self) -> Self {
1691 ty::ParamEnv { reveal: Reveal::All, ..self }
1694 /// Returns this same environment but with no caller bounds.
1695 pub fn without_caller_bounds(self) -> Self {
1696 ty::ParamEnv { caller_bounds: List::empty(), ..self }
1699 /// Creates a suitable environment in which to perform trait
1700 /// queries on the given value. When type-checking, this is simply
1701 /// the pair of the environment plus value. But when reveal is set to
1702 /// All, then if `value` does not reference any type parameters, we will
1703 /// pair it with the empty environment. This improves caching and is generally
1706 /// N.B., we preserve the environment when type-checking because it
1707 /// is possible for the user to have wacky where-clauses like
1708 /// `where Box<u32>: Copy`, which are clearly never
1709 /// satisfiable. We generally want to behave as if they were true,
1710 /// although the surrounding function is never reachable.
1711 pub fn and<T: TypeFoldable<'tcx>>(self, value: T) -> ParamEnvAnd<'tcx, T> {
1713 Reveal::UserFacing => {
1721 if value.has_placeholders()
1722 || value.needs_infer()
1723 || value.has_param_types()
1724 || value.has_self_ty()
1732 param_env: self.without_caller_bounds(),
1741 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash)]
1742 pub struct ParamEnvAnd<'tcx, T> {
1743 pub param_env: ParamEnv<'tcx>,
1747 impl<'tcx, T> ParamEnvAnd<'tcx, T> {
1748 pub fn into_parts(self) -> (ParamEnv<'tcx>, T) {
1749 (self.param_env, self.value)
1753 impl<'a, 'gcx, T> HashStable<StableHashingContext<'a>> for ParamEnvAnd<'gcx, T>
1754 where T: HashStable<StableHashingContext<'a>>
1756 fn hash_stable<W: StableHasherResult>(&self,
1757 hcx: &mut StableHashingContext<'a>,
1758 hasher: &mut StableHasher<W>) {
1764 param_env.hash_stable(hcx, hasher);
1765 value.hash_stable(hcx, hasher);
1769 #[derive(Copy, Clone, Debug, HashStable)]
1770 pub struct Destructor {
1771 /// The `DefId` of the destructor method
1776 #[derive(HashStable)]
1777 pub struct AdtFlags: u32 {
1778 const NO_ADT_FLAGS = 0;
1779 const IS_ENUM = 1 << 0;
1780 const IS_UNION = 1 << 1;
1781 const IS_STRUCT = 1 << 2;
1782 const HAS_CTOR = 1 << 3;
1783 const IS_PHANTOM_DATA = 1 << 4;
1784 const IS_FUNDAMENTAL = 1 << 5;
1785 const IS_BOX = 1 << 6;
1786 /// Indicates whether the type is an `Arc`.
1787 const IS_ARC = 1 << 7;
1788 /// Indicates whether the type is an `Rc`.
1789 const IS_RC = 1 << 8;
1790 /// Indicates whether the variant list of this ADT is `#[non_exhaustive]`.
1791 /// (i.e., this flag is never set unless this ADT is an enum).
1792 const IS_VARIANT_LIST_NON_EXHAUSTIVE = 1 << 9;
1797 #[derive(HashStable)]
1798 pub struct VariantFlags: u32 {
1799 const NO_VARIANT_FLAGS = 0;
1800 /// Indicates whether the field list of this variant is `#[non_exhaustive]`.
1801 const IS_FIELD_LIST_NON_EXHAUSTIVE = 1 << 0;
1806 pub struct VariantDef {
1807 /// The variant's `DefId`. If this is a tuple-like struct,
1808 /// this is the `DefId` of the struct's ctor.
1810 pub ident: Ident, // struct's name if this is a struct
1811 pub discr: VariantDiscr,
1812 pub fields: Vec<FieldDef>,
1813 pub ctor_kind: CtorKind,
1814 flags: VariantFlags,
1817 impl<'a, 'gcx, 'tcx> VariantDef {
1818 /// Creates a new `VariantDef`.
1820 /// - `did` is the `DefId` used for the variant.
1821 /// This is the constructor `DefId` for tuple stucts, and the variant `DefId` for everything
1823 /// - `attribute_def_id` is the DefId that has the variant's attributes.
1824 /// This is the struct `DefId` for structs, and the variant `DefId` for variants.
1826 /// Note that we *could* use the constructor `DefId`, because the constructor attributes
1827 /// redirect to the base attributes, but compiling a small crate requires
1828 /// loading the `AdtDef`s for all the structs in the universe (e.g., coherence for any
1829 /// built-in trait), and we do not want to load attributes twice.
1831 /// If someone speeds up attribute loading to not be a performance concern, they can
1832 /// remove this hack and use the constructor `DefId` everywhere.
1833 pub fn new(tcx: TyCtxt<'a, 'gcx, 'tcx>,
1836 discr: VariantDiscr,
1837 fields: Vec<FieldDef>,
1839 ctor_kind: CtorKind,
1840 attribute_def_id: DefId)
1843 debug!("VariantDef::new({:?}, {:?}, {:?}, {:?}, {:?}, {:?}, {:?})", did, ident, discr,
1844 fields, adt_kind, ctor_kind, attribute_def_id);
1845 let mut flags = VariantFlags::NO_VARIANT_FLAGS;
1846 if adt_kind == AdtKind::Struct && tcx.has_attr(attribute_def_id, "non_exhaustive") {
1847 debug!("found non-exhaustive field list for {:?}", did);
1848 flags = flags | VariantFlags::IS_FIELD_LIST_NON_EXHAUSTIVE;
1861 pub fn is_field_list_non_exhaustive(&self) -> bool {
1862 self.flags.intersects(VariantFlags::IS_FIELD_LIST_NON_EXHAUSTIVE)
1866 impl_stable_hash_for!(struct VariantDef {
1868 ident -> (ident.name),
1875 #[derive(Copy, Clone, Debug, PartialEq, Eq, RustcEncodable, RustcDecodable, HashStable)]
1876 pub enum VariantDiscr {
1877 /// Explicit value for this variant, i.e., `X = 123`.
1878 /// The `DefId` corresponds to the embedded constant.
1881 /// The previous variant's discriminant plus one.
1882 /// For efficiency reasons, the distance from the
1883 /// last `Explicit` discriminant is being stored,
1884 /// or `0` for the first variant, if it has none.
1888 #[derive(Debug, HashStable)]
1889 pub struct FieldDef {
1891 #[stable_hasher(project(name))]
1893 pub vis: Visibility,
1896 /// The definition of an abstract data type -- a struct or enum.
1898 /// These are all interned (by `intern_adt_def`) into the `adt_defs`
1902 pub variants: IndexVec<self::layout::VariantIdx, VariantDef>,
1904 pub repr: ReprOptions,
1907 impl PartialOrd for AdtDef {
1908 fn partial_cmp(&self, other: &AdtDef) -> Option<Ordering> {
1909 Some(self.cmp(&other))
1913 /// There should be only one AdtDef for each `did`, therefore
1914 /// it is fine to implement `Ord` only based on `did`.
1915 impl Ord for AdtDef {
1916 fn cmp(&self, other: &AdtDef) -> Ordering {
1917 self.did.cmp(&other.did)
1921 impl PartialEq for AdtDef {
1922 // AdtDef are always interned and this is part of TyS equality
1924 fn eq(&self, other: &Self) -> bool { ptr::eq(self, other) }
1927 impl Eq for AdtDef {}
1929 impl Hash for AdtDef {
1931 fn hash<H: Hasher>(&self, s: &mut H) {
1932 (self as *const AdtDef).hash(s)
1936 impl<'tcx> serialize::UseSpecializedEncodable for &'tcx AdtDef {
1937 fn default_encode<S: Encoder>(&self, s: &mut S) -> Result<(), S::Error> {
1942 impl<'tcx> serialize::UseSpecializedDecodable for &'tcx AdtDef {}
1945 impl<'a> HashStable<StableHashingContext<'a>> for AdtDef {
1946 fn hash_stable<W: StableHasherResult>(&self,
1947 hcx: &mut StableHashingContext<'a>,
1948 hasher: &mut StableHasher<W>) {
1950 static CACHE: RefCell<FxHashMap<usize, Fingerprint>> = Default::default();
1953 let hash: Fingerprint = CACHE.with(|cache| {
1954 let addr = self as *const AdtDef as usize;
1955 *cache.borrow_mut().entry(addr).or_insert_with(|| {
1963 let mut hasher = StableHasher::new();
1964 did.hash_stable(hcx, &mut hasher);
1965 variants.hash_stable(hcx, &mut hasher);
1966 flags.hash_stable(hcx, &mut hasher);
1967 repr.hash_stable(hcx, &mut hasher);
1973 hash.hash_stable(hcx, hasher);
1977 #[derive(Copy, Clone, Debug, Eq, PartialEq, Hash)]
1978 pub enum AdtKind { Struct, Union, Enum }
1980 impl Into<DataTypeKind> for AdtKind {
1981 fn into(self) -> DataTypeKind {
1983 AdtKind::Struct => DataTypeKind::Struct,
1984 AdtKind::Union => DataTypeKind::Union,
1985 AdtKind::Enum => DataTypeKind::Enum,
1991 #[derive(RustcEncodable, RustcDecodable, Default)]
1992 pub struct ReprFlags: u8 {
1993 const IS_C = 1 << 0;
1994 const IS_SIMD = 1 << 1;
1995 const IS_TRANSPARENT = 1 << 2;
1996 // Internal only for now. If true, don't reorder fields.
1997 const IS_LINEAR = 1 << 3;
1999 // Any of these flags being set prevent field reordering optimisation.
2000 const IS_UNOPTIMISABLE = ReprFlags::IS_C.bits |
2001 ReprFlags::IS_SIMD.bits |
2002 ReprFlags::IS_LINEAR.bits;
2006 impl_stable_hash_for!(struct ReprFlags {
2010 /// Represents the repr options provided by the user,
2011 #[derive(Copy, Clone, Debug, Eq, PartialEq, RustcEncodable, RustcDecodable, Default)]
2012 pub struct ReprOptions {
2013 pub int: Option<attr::IntType>,
2016 pub flags: ReprFlags,
2019 impl_stable_hash_for!(struct ReprOptions {
2027 pub fn new(tcx: TyCtxt<'_, '_, '_>, did: DefId) -> ReprOptions {
2028 let mut flags = ReprFlags::empty();
2029 let mut size = None;
2030 let mut max_align = 0;
2031 let mut min_pack = 0;
2032 for attr in tcx.get_attrs(did).iter() {
2033 for r in attr::find_repr_attrs(&tcx.sess.parse_sess, attr) {
2034 flags.insert(match r {
2035 attr::ReprC => ReprFlags::IS_C,
2036 attr::ReprPacked(pack) => {
2037 min_pack = if min_pack > 0 {
2038 cmp::min(pack, min_pack)
2044 attr::ReprTransparent => ReprFlags::IS_TRANSPARENT,
2045 attr::ReprSimd => ReprFlags::IS_SIMD,
2046 attr::ReprInt(i) => {
2050 attr::ReprAlign(align) => {
2051 max_align = cmp::max(align, max_align);
2058 // This is here instead of layout because the choice must make it into metadata.
2059 if !tcx.consider_optimizing(|| format!("Reorder fields of {:?}", tcx.item_path_str(did))) {
2060 flags.insert(ReprFlags::IS_LINEAR);
2062 ReprOptions { int: size, align: max_align, pack: min_pack, flags: flags }
2066 pub fn simd(&self) -> bool { self.flags.contains(ReprFlags::IS_SIMD) }
2068 pub fn c(&self) -> bool { self.flags.contains(ReprFlags::IS_C) }
2070 pub fn packed(&self) -> bool { self.pack > 0 }
2072 pub fn transparent(&self) -> bool { self.flags.contains(ReprFlags::IS_TRANSPARENT) }
2074 pub fn linear(&self) -> bool { self.flags.contains(ReprFlags::IS_LINEAR) }
2076 pub fn discr_type(&self) -> attr::IntType {
2077 self.int.unwrap_or(attr::SignedInt(ast::IntTy::Isize))
2080 /// Returns `true` if this `#[repr()]` should inhabit "smart enum
2081 /// layout" optimizations, such as representing `Foo<&T>` as a
2083 pub fn inhibit_enum_layout_opt(&self) -> bool {
2084 self.c() || self.int.is_some()
2087 /// Returns `true` if this `#[repr()]` should inhibit struct field reordering
2088 /// optimizations, such as with `repr(C)`, `repr(packed(1))`, or `repr(<int>)`.
2089 pub fn inhibit_struct_field_reordering_opt(&self) -> bool {
2090 self.flags.intersects(ReprFlags::IS_UNOPTIMISABLE) || self.pack == 1 ||
2094 /// Returns `true` if this `#[repr()]` should inhibit union ABI optimisations.
2095 pub fn inhibit_union_abi_opt(&self) -> bool {
2101 impl<'a, 'gcx, 'tcx> AdtDef {
2102 fn new(tcx: TyCtxt<'_, '_, '_>,
2105 variants: IndexVec<VariantIdx, VariantDef>,
2106 repr: ReprOptions) -> Self {
2107 debug!("AdtDef::new({:?}, {:?}, {:?}, {:?})", did, kind, variants, repr);
2108 let mut flags = AdtFlags::NO_ADT_FLAGS;
2110 if kind == AdtKind::Enum && tcx.has_attr(did, "non_exhaustive") {
2111 debug!("found non-exhaustive variant list for {:?}", did);
2112 flags = flags | AdtFlags::IS_VARIANT_LIST_NON_EXHAUSTIVE;
2114 flags |= match kind {
2115 AdtKind::Enum => AdtFlags::IS_ENUM,
2116 AdtKind::Union => AdtFlags::IS_UNION,
2117 AdtKind::Struct => AdtFlags::IS_STRUCT,
2120 if let AdtKind::Struct = kind {
2121 let variant_def = &variants[VariantIdx::new(0)];
2122 let def_key = tcx.def_key(variant_def.did);
2123 match def_key.disambiguated_data.data {
2124 DefPathData::StructCtor => flags |= AdtFlags::HAS_CTOR,
2129 let attrs = tcx.get_attrs(did);
2130 if attr::contains_name(&attrs, "fundamental") {
2131 flags |= AdtFlags::IS_FUNDAMENTAL;
2133 if Some(did) == tcx.lang_items().phantom_data() {
2134 flags |= AdtFlags::IS_PHANTOM_DATA;
2136 if Some(did) == tcx.lang_items().owned_box() {
2137 flags |= AdtFlags::IS_BOX;
2139 if Some(did) == tcx.lang_items().arc() {
2140 flags |= AdtFlags::IS_ARC;
2142 if Some(did) == tcx.lang_items().rc() {
2143 flags |= AdtFlags::IS_RC;
2155 pub fn is_struct(&self) -> bool {
2156 self.flags.contains(AdtFlags::IS_STRUCT)
2160 pub fn is_union(&self) -> bool {
2161 self.flags.contains(AdtFlags::IS_UNION)
2165 pub fn is_enum(&self) -> bool {
2166 self.flags.contains(AdtFlags::IS_ENUM)
2170 pub fn is_variant_list_non_exhaustive(&self) -> bool {
2171 self.flags.contains(AdtFlags::IS_VARIANT_LIST_NON_EXHAUSTIVE)
2174 /// Returns the kind of the ADT.
2176 pub fn adt_kind(&self) -> AdtKind {
2179 } else if self.is_union() {
2186 pub fn descr(&self) -> &'static str {
2187 match self.adt_kind() {
2188 AdtKind::Struct => "struct",
2189 AdtKind::Union => "union",
2190 AdtKind::Enum => "enum",
2195 pub fn variant_descr(&self) -> &'static str {
2196 match self.adt_kind() {
2197 AdtKind::Struct => "struct",
2198 AdtKind::Union => "union",
2199 AdtKind::Enum => "variant",
2203 /// If this function returns `true`, it implies that `is_struct` must return `true`.
2205 pub fn has_ctor(&self) -> bool {
2206 self.flags.contains(AdtFlags::HAS_CTOR)
2209 /// Returns `true` if this type is `#[fundamental]` for the purposes
2210 /// of coherence checking.
2212 pub fn is_fundamental(&self) -> bool {
2213 self.flags.contains(AdtFlags::IS_FUNDAMENTAL)
2216 /// Returns `true` if this is `PhantomData<T>`.
2218 pub fn is_phantom_data(&self) -> bool {
2219 self.flags.contains(AdtFlags::IS_PHANTOM_DATA)
2222 /// Returns `true` if this is `Arc<T>`.
2223 pub fn is_arc(&self) -> bool {
2224 self.flags.contains(AdtFlags::IS_ARC)
2227 /// Returns `true` if this is `Rc<T>`.
2228 pub fn is_rc(&self) -> bool {
2229 self.flags.contains(AdtFlags::IS_RC)
2232 /// Returns `true` if this is Box<T>.
2234 pub fn is_box(&self) -> bool {
2235 self.flags.contains(AdtFlags::IS_BOX)
2238 /// Returns `true` if this type has a destructor.
2239 pub fn has_dtor(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> bool {
2240 self.destructor(tcx).is_some()
2243 /// Asserts this is a struct or union and returns its unique variant.
2244 pub fn non_enum_variant(&self) -> &VariantDef {
2245 assert!(self.is_struct() || self.is_union());
2246 &self.variants[VariantIdx::new(0)]
2250 pub fn predicates(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Lrc<GenericPredicates<'gcx>> {
2251 tcx.predicates_of(self.did)
2254 /// Returns an iterator over all fields contained
2257 pub fn all_fields<'s>(&'s self) -> impl Iterator<Item = &'s FieldDef> {
2258 self.variants.iter().flat_map(|v| v.fields.iter())
2261 pub fn is_payloadfree(&self) -> bool {
2262 !self.variants.is_empty() &&
2263 self.variants.iter().all(|v| v.fields.is_empty())
2266 pub fn variant_with_id(&self, vid: DefId) -> &VariantDef {
2269 .find(|v| v.did == vid)
2270 .expect("variant_with_id: unknown variant")
2273 pub fn variant_index_with_id(&self, vid: DefId) -> VariantIdx {
2276 .find(|(_, v)| v.did == vid)
2277 .expect("variant_index_with_id: unknown variant")
2281 pub fn variant_of_def(&self, def: Def) -> &VariantDef {
2283 Def::Variant(vid) | Def::VariantCtor(vid, ..) => self.variant_with_id(vid),
2284 Def::Struct(..) | Def::StructCtor(..) | Def::Union(..) |
2285 Def::TyAlias(..) | Def::AssociatedTy(..) | Def::SelfTy(..) |
2286 Def::SelfCtor(..) => self.non_enum_variant(),
2287 _ => bug!("unexpected def {:?} in variant_of_def", def)
2292 pub fn eval_explicit_discr(
2294 tcx: TyCtxt<'a, 'gcx, 'tcx>,
2296 ) -> Option<Discr<'tcx>> {
2297 let param_env = ParamEnv::empty();
2298 let repr_type = self.repr.discr_type();
2299 let substs = InternalSubsts::identity_for_item(tcx.global_tcx(), expr_did);
2300 let instance = ty::Instance::new(expr_did, substs);
2301 let cid = GlobalId {
2305 match tcx.const_eval(param_env.and(cid)) {
2307 // FIXME: Find the right type and use it instead of `val.ty` here
2308 if let Some(b) = val.assert_bits(tcx.global_tcx(), param_env.and(val.ty)) {
2309 trace!("discriminants: {} ({:?})", b, repr_type);
2315 info!("invalid enum discriminant: {:#?}", val);
2316 crate::mir::interpret::struct_error(
2317 tcx.at(tcx.def_span(expr_did)),
2318 "constant evaluation of enum discriminant resulted in non-integer",
2323 Err(ErrorHandled::Reported) => {
2324 if !expr_did.is_local() {
2325 span_bug!(tcx.def_span(expr_did),
2326 "variant discriminant evaluation succeeded \
2327 in its crate but failed locally");
2331 Err(ErrorHandled::TooGeneric) => span_bug!(
2332 tcx.def_span(expr_did),
2333 "enum discriminant depends on generic arguments",
2339 pub fn discriminants(
2341 tcx: TyCtxt<'a, 'gcx, 'tcx>,
2342 ) -> impl Iterator<Item=(VariantIdx, Discr<'tcx>)> + Captures<'gcx> + 'a {
2343 let repr_type = self.repr.discr_type();
2344 let initial = repr_type.initial_discriminant(tcx.global_tcx());
2345 let mut prev_discr = None::<Discr<'tcx>>;
2346 self.variants.iter_enumerated().map(move |(i, v)| {
2347 let mut discr = prev_discr.map_or(initial, |d| d.wrap_incr(tcx));
2348 if let VariantDiscr::Explicit(expr_did) = v.discr {
2349 if let Some(new_discr) = self.eval_explicit_discr(tcx, expr_did) {
2353 prev_discr = Some(discr);
2359 /// Computes the discriminant value used by a specific variant.
2360 /// Unlike `discriminants`, this is (amortized) constant-time,
2361 /// only doing at most one query for evaluating an explicit
2362 /// discriminant (the last one before the requested variant),
2363 /// assuming there are no constant-evaluation errors there.
2364 pub fn discriminant_for_variant(&self,
2365 tcx: TyCtxt<'a, 'gcx, 'tcx>,
2366 variant_index: VariantIdx)
2368 let (val, offset) = self.discriminant_def_for_variant(variant_index);
2369 let explicit_value = val
2370 .and_then(|expr_did| self.eval_explicit_discr(tcx, expr_did))
2371 .unwrap_or_else(|| self.repr.discr_type().initial_discriminant(tcx.global_tcx()));
2372 explicit_value.checked_add(tcx, offset as u128).0
2375 /// Yields a `DefId` for the discriminant and an offset to add to it
2376 /// Alternatively, if there is no explicit discriminant, returns the
2377 /// inferred discriminant directly.
2378 pub fn discriminant_def_for_variant(
2380 variant_index: VariantIdx,
2381 ) -> (Option<DefId>, u32) {
2382 let mut explicit_index = variant_index.as_u32();
2385 match self.variants[VariantIdx::from_u32(explicit_index)].discr {
2386 ty::VariantDiscr::Relative(0) => {
2390 ty::VariantDiscr::Relative(distance) => {
2391 explicit_index -= distance;
2393 ty::VariantDiscr::Explicit(did) => {
2394 expr_did = Some(did);
2399 (expr_did, variant_index.as_u32() - explicit_index)
2402 pub fn destructor(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Destructor> {
2403 tcx.adt_destructor(self.did)
2406 /// Returns a list of types such that `Self: Sized` if and only
2407 /// if that type is `Sized`, or `TyErr` if this type is recursive.
2409 /// Oddly enough, checking that the sized-constraint is `Sized` is
2410 /// actually more expressive than checking all members:
2411 /// the `Sized` trait is inductive, so an associated type that references
2412 /// `Self` would prevent its containing ADT from being `Sized`.
2414 /// Due to normalization being eager, this applies even if
2415 /// the associated type is behind a pointer (e.g., issue #31299).
2416 pub fn sized_constraint(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> &'tcx [Ty<'tcx>] {
2417 tcx.adt_sized_constraint(self.did).0
2420 fn sized_constraint_for_ty(&self,
2421 tcx: TyCtxt<'a, 'tcx, 'tcx>,
2424 let result = match ty.sty {
2425 Bool | Char | Int(..) | Uint(..) | Float(..) |
2426 RawPtr(..) | Ref(..) | FnDef(..) | FnPtr(_) |
2427 Array(..) | Closure(..) | Generator(..) | Never => {
2436 GeneratorWitness(..) => {
2437 // these are never sized - return the target type
2444 Some(ty) => self.sized_constraint_for_ty(tcx, ty)
2448 Adt(adt, substs) => {
2450 let adt_tys = adt.sized_constraint(tcx);
2451 debug!("sized_constraint_for_ty({:?}) intermediate = {:?}",
2454 .map(|ty| ty.subst(tcx, substs))
2455 .flat_map(|ty| self.sized_constraint_for_ty(tcx, ty))
2459 Projection(..) | Opaque(..) => {
2460 // must calculate explicitly.
2461 // FIXME: consider special-casing always-Sized projections
2465 UnnormalizedProjection(..) => bug!("only used with chalk-engine"),
2468 // perf hack: if there is a `T: Sized` bound, then
2469 // we know that `T` is Sized and do not need to check
2472 let sized_trait = match tcx.lang_items().sized_trait() {
2474 _ => return vec![ty]
2476 let sized_predicate = Binder::dummy(TraitRef {
2477 def_id: sized_trait,
2478 substs: tcx.mk_substs_trait(ty, &[])
2480 let predicates = &tcx.predicates_of(self.did).predicates;
2481 if predicates.iter().any(|(p, _)| *p == sized_predicate) {
2491 bug!("unexpected type `{:?}` in sized_constraint_for_ty",
2495 debug!("sized_constraint_for_ty({:?}) = {:?}", ty, result);
2500 impl<'a, 'gcx, 'tcx> FieldDef {
2501 pub fn ty(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>, subst: SubstsRef<'tcx>) -> Ty<'tcx> {
2502 tcx.type_of(self.did).subst(tcx, subst)
2506 /// Represents the various closure traits in the language. This
2507 /// will determine the type of the environment (`self`, in the
2508 /// desugaring) argument that the closure expects.
2510 /// You can get the environment type of a closure using
2511 /// `tcx.closure_env_ty()`.
2512 #[derive(Clone, Copy, PartialOrd, Ord, PartialEq, Eq, Hash, Debug,
2513 RustcEncodable, RustcDecodable, HashStable)]
2514 pub enum ClosureKind {
2515 // Warning: Ordering is significant here! The ordering is chosen
2516 // because the trait Fn is a subtrait of FnMut and so in turn, and
2517 // hence we order it so that Fn < FnMut < FnOnce.
2523 impl<'a, 'tcx> ClosureKind {
2524 // This is the initial value used when doing upvar inference.
2525 pub const LATTICE_BOTTOM: ClosureKind = ClosureKind::Fn;
2527 pub fn trait_did(&self, tcx: TyCtxt<'a, 'tcx, 'tcx>) -> DefId {
2529 ClosureKind::Fn => tcx.require_lang_item(FnTraitLangItem),
2530 ClosureKind::FnMut => {
2531 tcx.require_lang_item(FnMutTraitLangItem)
2533 ClosureKind::FnOnce => {
2534 tcx.require_lang_item(FnOnceTraitLangItem)
2539 /// Returns `true` if this a type that impls this closure kind
2540 /// must also implement `other`.
2541 pub fn extends(self, other: ty::ClosureKind) -> bool {
2542 match (self, other) {
2543 (ClosureKind::Fn, ClosureKind::Fn) => true,
2544 (ClosureKind::Fn, ClosureKind::FnMut) => true,
2545 (ClosureKind::Fn, ClosureKind::FnOnce) => true,
2546 (ClosureKind::FnMut, ClosureKind::FnMut) => true,
2547 (ClosureKind::FnMut, ClosureKind::FnOnce) => true,
2548 (ClosureKind::FnOnce, ClosureKind::FnOnce) => true,
2553 /// Returns the representative scalar type for this closure kind.
2554 /// See `TyS::to_opt_closure_kind` for more details.
2555 pub fn to_ty(self, tcx: TyCtxt<'_, '_, 'tcx>) -> Ty<'tcx> {
2557 ty::ClosureKind::Fn => tcx.types.i8,
2558 ty::ClosureKind::FnMut => tcx.types.i16,
2559 ty::ClosureKind::FnOnce => tcx.types.i32,
2564 impl<'tcx> TyS<'tcx> {
2565 /// Iterator that walks `self` and any types reachable from
2566 /// `self`, in depth-first order. Note that just walks the types
2567 /// that appear in `self`, it does not descend into the fields of
2568 /// structs or variants. For example:
2571 /// isize => { isize }
2572 /// Foo<Bar<isize>> => { Foo<Bar<isize>>, Bar<isize>, isize }
2573 /// [isize] => { [isize], isize }
2575 pub fn walk(&'tcx self) -> TypeWalker<'tcx> {
2576 TypeWalker::new(self)
2579 /// Iterator that walks the immediate children of `self`. Hence
2580 /// `Foo<Bar<i32>, u32>` yields the sequence `[Bar<i32>, u32]`
2581 /// (but not `i32`, like `walk`).
2582 pub fn walk_shallow(&'tcx self) -> smallvec::IntoIter<walk::TypeWalkerArray<'tcx>> {
2583 walk::walk_shallow(self)
2586 /// Walks `ty` and any types appearing within `ty`, invoking the
2587 /// callback `f` on each type. If the callback returns `false`, then the
2588 /// children of the current type are ignored.
2590 /// Note: prefer `ty.walk()` where possible.
2591 pub fn maybe_walk<F>(&'tcx self, mut f: F)
2592 where F: FnMut(Ty<'tcx>) -> bool
2594 let mut walker = self.walk();
2595 while let Some(ty) = walker.next() {
2597 walker.skip_current_subtree();
2604 pub fn from_mutbl(m: hir::Mutability) -> BorrowKind {
2606 hir::MutMutable => MutBorrow,
2607 hir::MutImmutable => ImmBorrow,
2611 /// Returns a mutability `m` such that an `&m T` pointer could be used to obtain this borrow
2612 /// kind. Because borrow kinds are richer than mutabilities, we sometimes have to pick a
2613 /// mutability that is stronger than necessary so that it at least *would permit* the borrow in
2615 pub fn to_mutbl_lossy(self) -> hir::Mutability {
2617 MutBorrow => hir::MutMutable,
2618 ImmBorrow => hir::MutImmutable,
2620 // We have no type corresponding to a unique imm borrow, so
2621 // use `&mut`. It gives all the capabilities of an `&uniq`
2622 // and hence is a safe "over approximation".
2623 UniqueImmBorrow => hir::MutMutable,
2627 pub fn to_user_str(&self) -> &'static str {
2629 MutBorrow => "mutable",
2630 ImmBorrow => "immutable",
2631 UniqueImmBorrow => "uniquely immutable",
2636 #[derive(Debug, Clone)]
2637 pub enum Attributes<'gcx> {
2638 Owned(Lrc<[ast::Attribute]>),
2639 Borrowed(&'gcx [ast::Attribute])
2642 impl<'gcx> ::std::ops::Deref for Attributes<'gcx> {
2643 type Target = [ast::Attribute];
2645 fn deref(&self) -> &[ast::Attribute] {
2647 &Attributes::Owned(ref data) => &data,
2648 &Attributes::Borrowed(data) => data
2653 #[derive(Debug, PartialEq, Eq)]
2654 pub enum ImplOverlapKind {
2655 /// These impls are always allowed to overlap.
2657 /// These impls are allowed to overlap, but that raises
2658 /// an issue #33140 future-compatibility warning.
2660 /// Some background: in Rust 1.0, the trait-object types `Send + Sync` (today's
2661 /// `dyn Send + Sync`) and `Sync + Send` (now `dyn Sync + Send`) were different.
2663 /// The widely-used version 0.1.0 of the crate `traitobject` had accidentally relied
2664 /// that difference, making what reduces to the following set of impls:
2668 /// impl Trait for dyn Send + Sync {}
2669 /// impl Trait for dyn Sync + Send {}
2672 /// Obviously, once we made these types be identical, that code causes a coherence
2673 /// error and a fairly big headache for us. However, luckily for us, the trait
2674 /// `Trait` used in this case is basically a marker trait, and therefore having
2675 /// overlapping impls for it is sound.
2677 /// To handle this, we basically regard the trait as a marker trait, with an additional
2678 /// future-compatibility warning. To avoid accidentally "stabilizing" this feature,
2679 /// it has the following restrictions:
2681 /// 1. The trait must indeed be a marker-like trait (i.e., no items), and must be
2683 /// 2. The trait-ref of both impls must be equal.
2684 /// 3. The trait-ref of both impls must be a trait object type consisting only of
2686 /// 4. Neither of the impls can have any where-clauses.
2688 /// Once `traitobject` 0.1.0 is no longer an active concern, this hack can be removed.
2692 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2693 pub fn body_tables(self, body: hir::BodyId) -> &'gcx TypeckTables<'gcx> {
2694 self.typeck_tables_of(self.hir().body_owner_def_id(body))
2697 /// Returns an iterator of the `DefId`s for all body-owners in this
2698 /// crate. If you would prefer to iterate over the bodies
2699 /// themselves, you can do `self.hir().krate().body_ids.iter()`.
2702 ) -> impl Iterator<Item = DefId> + Captures<'tcx> + Captures<'gcx> + 'a {
2706 .map(move |&body_id| self.hir().body_owner_def_id(body_id))
2709 pub fn par_body_owners<F: Fn(DefId) + sync::Sync + sync::Send>(self, f: F) {
2710 par_iter(&self.hir().krate().body_ids).for_each(|&body_id| {
2711 f(self.hir().body_owner_def_id(body_id))
2715 pub fn expr_span(self, id: NodeId) -> Span {
2716 match self.hir().find(id) {
2717 Some(Node::Expr(e)) => {
2721 bug!("Node id {} is not an expr: {:?}", id, f);
2724 bug!("Node id {} is not present in the node map", id);
2729 pub fn provided_trait_methods(self, id: DefId) -> Vec<AssociatedItem> {
2730 self.associated_items(id)
2731 .filter(|item| item.kind == AssociatedKind::Method && item.defaultness.has_value())
2735 pub fn trait_relevant_for_never(self, did: DefId) -> bool {
2736 self.associated_items(did).any(|item| {
2737 item.relevant_for_never()
2741 pub fn opt_associated_item(self, def_id: DefId) -> Option<AssociatedItem> {
2742 let is_associated_item = if let Some(hir_id) = self.hir().as_local_hir_id(def_id) {
2743 match self.hir().get_by_hir_id(hir_id) {
2744 Node::TraitItem(_) | Node::ImplItem(_) => true,
2748 match self.describe_def(def_id).expect("no def for def-id") {
2749 Def::AssociatedConst(_) | Def::Method(_) | Def::AssociatedTy(_) => true,
2754 if is_associated_item {
2755 Some(self.associated_item(def_id))
2761 fn associated_item_from_trait_item_ref(self,
2762 parent_def_id: DefId,
2763 parent_vis: &hir::Visibility,
2764 trait_item_ref: &hir::TraitItemRef)
2766 let def_id = self.hir().local_def_id_from_hir_id(trait_item_ref.id.hir_id);
2767 let (kind, has_self) = match trait_item_ref.kind {
2768 hir::AssociatedItemKind::Const => (ty::AssociatedKind::Const, false),
2769 hir::AssociatedItemKind::Method { has_self } => {
2770 (ty::AssociatedKind::Method, has_self)
2772 hir::AssociatedItemKind::Type => (ty::AssociatedKind::Type, false),
2773 hir::AssociatedItemKind::Existential => bug!("only impls can have existentials"),
2777 ident: trait_item_ref.ident,
2779 // Visibility of trait items is inherited from their traits.
2780 vis: Visibility::from_hir(parent_vis, trait_item_ref.id.hir_id, self),
2781 defaultness: trait_item_ref.defaultness,
2783 container: TraitContainer(parent_def_id),
2784 method_has_self_argument: has_self
2788 fn associated_item_from_impl_item_ref(self,
2789 parent_def_id: DefId,
2790 impl_item_ref: &hir::ImplItemRef)
2792 let def_id = self.hir().local_def_id_from_hir_id(impl_item_ref.id.hir_id);
2793 let (kind, has_self) = match impl_item_ref.kind {
2794 hir::AssociatedItemKind::Const => (ty::AssociatedKind::Const, false),
2795 hir::AssociatedItemKind::Method { has_self } => {
2796 (ty::AssociatedKind::Method, has_self)
2798 hir::AssociatedItemKind::Type => (ty::AssociatedKind::Type, false),
2799 hir::AssociatedItemKind::Existential => (ty::AssociatedKind::Existential, false),
2803 ident: impl_item_ref.ident,
2805 // Visibility of trait impl items doesn't matter.
2806 vis: ty::Visibility::from_hir(&impl_item_ref.vis, impl_item_ref.id.hir_id, self),
2807 defaultness: impl_item_ref.defaultness,
2809 container: ImplContainer(parent_def_id),
2810 method_has_self_argument: has_self
2814 pub fn field_index(self, hir_id: hir::HirId, tables: &TypeckTables<'_>) -> usize {
2815 tables.field_indices().get(hir_id).cloned().expect("no index for a field")
2818 pub fn find_field_index(self, ident: Ident, variant: &VariantDef) -> Option<usize> {
2819 variant.fields.iter().position(|field| {
2820 self.adjust_ident(ident, variant.did, hir::DUMMY_HIR_ID).0 == field.ident.modern()
2824 pub fn associated_items(
2827 ) -> AssociatedItemsIterator<'a, 'gcx, 'tcx> {
2828 // Ideally, we would use `-> impl Iterator` here, but it falls
2829 // afoul of the conservative "capture [restrictions]" we put
2830 // in place, so we use a hand-written iterator.
2832 // [restrictions]: https://github.com/rust-lang/rust/issues/34511#issuecomment-373423999
2833 AssociatedItemsIterator {
2835 def_ids: self.associated_item_def_ids(def_id),
2840 /// Returns `true` if the impls are the same polarity and the trait either
2841 /// has no items or is annotated #[marker] and prevents item overrides.
2842 pub fn impls_are_allowed_to_overlap(self, def_id1: DefId, def_id2: DefId)
2843 -> Option<ImplOverlapKind>
2845 let is_legit = if self.features().overlapping_marker_traits {
2846 let trait1_is_empty = self.impl_trait_ref(def_id1)
2847 .map_or(false, |trait_ref| {
2848 self.associated_item_def_ids(trait_ref.def_id).is_empty()
2850 let trait2_is_empty = self.impl_trait_ref(def_id2)
2851 .map_or(false, |trait_ref| {
2852 self.associated_item_def_ids(trait_ref.def_id).is_empty()
2854 self.impl_polarity(def_id1) == self.impl_polarity(def_id2)
2858 let is_marker_impl = |def_id: DefId| -> bool {
2859 let trait_ref = self.impl_trait_ref(def_id);
2860 trait_ref.map_or(false, |tr| self.trait_def(tr.def_id).is_marker)
2862 self.impl_polarity(def_id1) == self.impl_polarity(def_id2)
2863 && is_marker_impl(def_id1)
2864 && is_marker_impl(def_id2)
2868 debug!("impls_are_allowed_to_overlap({:?}, {:?}) = Some(Permitted)",
2870 Some(ImplOverlapKind::Permitted)
2872 if let Some(self_ty1) = self.issue33140_self_ty(def_id1) {
2873 if let Some(self_ty2) = self.issue33140_self_ty(def_id2) {
2874 if self_ty1 == self_ty2 {
2875 debug!("impls_are_allowed_to_overlap({:?}, {:?}) - issue #33140 HACK",
2877 return Some(ImplOverlapKind::Issue33140);
2879 debug!("impls_are_allowed_to_overlap({:?}, {:?}) - found {:?} != {:?}",
2880 def_id1, def_id2, self_ty1, self_ty2);
2885 debug!("impls_are_allowed_to_overlap({:?}, {:?}) = None",
2891 // Returns `ty::VariantDef` if `def` refers to a struct,
2892 // or variant or their constructors, panics otherwise.
2893 pub fn expect_variant_def(self, def: Def) -> &'tcx VariantDef {
2895 Def::Variant(did) | Def::VariantCtor(did, ..) => {
2896 let enum_did = self.parent_def_id(did).unwrap();
2897 self.adt_def(enum_did).variant_with_id(did)
2899 Def::Struct(did) | Def::Union(did) => {
2900 self.adt_def(did).non_enum_variant()
2902 Def::StructCtor(ctor_did, ..) => {
2903 let did = self.parent_def_id(ctor_did).expect("struct ctor has no parent");
2904 self.adt_def(did).non_enum_variant()
2906 _ => bug!("expect_variant_def used with unexpected def {:?}", def)
2910 /// Given a `VariantDef`, returns the def-id of the `AdtDef` of which it is a part.
2911 pub fn adt_def_id_of_variant(self, variant_def: &'tcx VariantDef) -> DefId {
2912 let def_key = self.def_key(variant_def.did);
2913 match def_key.disambiguated_data.data {
2914 // for enum variants and tuple structs, the def-id of the ADT itself
2915 // is the *parent* of the variant
2916 DefPathData::EnumVariant(..) | DefPathData::StructCtor =>
2917 DefId { krate: variant_def.did.krate, index: def_key.parent.unwrap() },
2919 // otherwise, for structs and unions, they share a def-id
2920 _ => variant_def.did,
2924 pub fn item_name(self, id: DefId) -> InternedString {
2925 if id.index == CRATE_DEF_INDEX {
2926 self.original_crate_name(id.krate).as_interned_str()
2928 let def_key = self.def_key(id);
2929 // The name of a StructCtor is that of its struct parent.
2930 if let hir_map::DefPathData::StructCtor = def_key.disambiguated_data.data {
2931 self.item_name(DefId {
2933 index: def_key.parent.unwrap()
2936 def_key.disambiguated_data.data.get_opt_name().unwrap_or_else(|| {
2937 bug!("item_name: no name for {:?}", self.def_path(id));
2943 /// Returns the possibly-auto-generated MIR of a `(DefId, Subst)` pair.
2944 pub fn instance_mir(self, instance: ty::InstanceDef<'gcx>)
2948 ty::InstanceDef::Item(did) => {
2949 self.optimized_mir(did)
2951 ty::InstanceDef::VtableShim(..) |
2952 ty::InstanceDef::Intrinsic(..) |
2953 ty::InstanceDef::FnPtrShim(..) |
2954 ty::InstanceDef::Virtual(..) |
2955 ty::InstanceDef::ClosureOnceShim { .. } |
2956 ty::InstanceDef::DropGlue(..) |
2957 ty::InstanceDef::CloneShim(..) => {
2958 self.mir_shims(instance)
2963 /// Gets the attributes of a definition.
2964 pub fn get_attrs(self, did: DefId) -> Attributes<'gcx> {
2965 if let Some(id) = self.hir().as_local_hir_id(did) {
2966 Attributes::Borrowed(self.hir().attrs_by_hir_id(id))
2968 Attributes::Owned(self.item_attrs(did))
2972 /// Determines whether an item is annotated with an attribute.
2973 pub fn has_attr(self, did: DefId, attr: &str) -> bool {
2974 attr::contains_name(&self.get_attrs(did), attr)
2977 /// Returns `true` if this is an `auto trait`.
2978 pub fn trait_is_auto(self, trait_def_id: DefId) -> bool {
2979 self.trait_def(trait_def_id).has_auto_impl
2982 pub fn generator_layout(self, def_id: DefId) -> &'tcx GeneratorLayout<'tcx> {
2983 self.optimized_mir(def_id).generator_layout.as_ref().unwrap()
2986 /// Given the `DefId` of an impl, returns the `DefId` of the trait it implements.
2987 /// If it implements no trait, returns `None`.
2988 pub fn trait_id_of_impl(self, def_id: DefId) -> Option<DefId> {
2989 self.impl_trait_ref(def_id).map(|tr| tr.def_id)
2992 /// If the given defid describes a method belonging to an impl, returns the
2993 /// `DefId` of the impl that the method belongs to; otherwise, returns `None`.
2994 pub fn impl_of_method(self, def_id: DefId) -> Option<DefId> {
2995 let item = if def_id.krate != LOCAL_CRATE {
2996 if let Some(Def::Method(_)) = self.describe_def(def_id) {
2997 Some(self.associated_item(def_id))
3002 self.opt_associated_item(def_id)
3005 item.and_then(|trait_item|
3006 match trait_item.container {
3007 TraitContainer(_) => None,
3008 ImplContainer(def_id) => Some(def_id),
3013 /// Looks up the span of `impl_did` if the impl is local; otherwise returns `Err`
3014 /// with the name of the crate containing the impl.
3015 pub fn span_of_impl(self, impl_did: DefId) -> Result<Span, Symbol> {
3016 if impl_did.is_local() {
3017 let hir_id = self.hir().as_local_hir_id(impl_did).unwrap();
3018 Ok(self.hir().span_by_hir_id(hir_id))
3020 Err(self.crate_name(impl_did.krate))
3024 /// Hygienically compares a use-site name (`use_name`) for a field or an associated item with
3025 /// its supposed definition name (`def_name`). The method also needs `DefId` of the supposed
3026 /// definition's parent/scope to perform comparison.
3027 pub fn hygienic_eq(self, use_name: Ident, def_name: Ident, def_parent_def_id: DefId) -> bool {
3028 self.adjust_ident(use_name, def_parent_def_id, hir::DUMMY_HIR_ID).0 == def_name.modern()
3031 pub fn adjust_ident(self, mut ident: Ident, scope: DefId, block: hir::HirId) -> (Ident, DefId) {
3032 ident = ident.modern();
3033 let target_expansion = match scope.krate {
3034 LOCAL_CRATE => self.hir().definitions().expansion_that_defined(scope.index),
3037 let scope = match ident.span.adjust(target_expansion) {
3038 Some(actual_expansion) =>
3039 self.hir().definitions().parent_module_of_macro_def(actual_expansion),
3040 None if block == hir::DUMMY_HIR_ID => DefId::local(CRATE_DEF_INDEX), // Dummy DefId
3041 None => self.hir().get_module_parent_by_hir_id(block),
3047 pub struct AssociatedItemsIterator<'a, 'gcx: 'tcx, 'tcx: 'a> {
3048 tcx: TyCtxt<'a, 'gcx, 'tcx>,
3049 def_ids: Lrc<Vec<DefId>>,
3053 impl Iterator for AssociatedItemsIterator<'_, '_, '_> {
3054 type Item = AssociatedItem;
3056 fn next(&mut self) -> Option<AssociatedItem> {
3057 let def_id = self.def_ids.get(self.next_index)?;
3058 self.next_index += 1;
3059 Some(self.tcx.associated_item(*def_id))
3063 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
3064 pub fn with_freevars<T, F>(self, fid: HirId, f: F) -> T where
3065 F: FnOnce(&[hir::Freevar]) -> T,
3067 let def_id = self.hir().local_def_id_from_hir_id(fid);
3068 match self.freevars(def_id) {
3075 fn associated_item<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, def_id: DefId) -> AssociatedItem {
3076 let id = tcx.hir().as_local_hir_id(def_id).unwrap();
3077 let parent_id = tcx.hir().get_parent_item(id);
3078 let parent_def_id = tcx.hir().local_def_id_from_hir_id(parent_id);
3079 let parent_item = tcx.hir().expect_item_by_hir_id(parent_id);
3080 match parent_item.node {
3081 hir::ItemKind::Impl(.., ref impl_item_refs) => {
3082 if let Some(impl_item_ref) = impl_item_refs.iter().find(|i| i.id.hir_id == id) {
3083 let assoc_item = tcx.associated_item_from_impl_item_ref(parent_def_id,
3085 debug_assert_eq!(assoc_item.def_id, def_id);
3090 hir::ItemKind::Trait(.., ref trait_item_refs) => {
3091 if let Some(trait_item_ref) = trait_item_refs.iter().find(|i| i.id.hir_id == id) {
3092 let assoc_item = tcx.associated_item_from_trait_item_ref(parent_def_id,
3095 debug_assert_eq!(assoc_item.def_id, def_id);
3103 span_bug!(parent_item.span,
3104 "unexpected parent of trait or impl item or item not found: {:?}",
3108 #[derive(Clone, HashStable)]
3109 pub struct AdtSizedConstraint<'tcx>(pub &'tcx [Ty<'tcx>]);
3111 /// Calculates the `Sized` constraint.
3113 /// In fact, there are only a few options for the types in the constraint:
3114 /// - an obviously-unsized type
3115 /// - a type parameter or projection whose Sizedness can't be known
3116 /// - a tuple of type parameters or projections, if there are multiple
3118 /// - a Error, if a type contained itself. The representability
3119 /// check should catch this case.
3120 fn adt_sized_constraint<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3122 -> AdtSizedConstraint<'tcx> {
3123 let def = tcx.adt_def(def_id);
3125 let result = tcx.mk_type_list(def.variants.iter().flat_map(|v| {
3128 def.sized_constraint_for_ty(tcx, tcx.type_of(f.did))
3131 debug!("adt_sized_constraint: {:?} => {:?}", def, result);
3133 AdtSizedConstraint(result)
3136 fn associated_item_def_ids<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3138 -> Lrc<Vec<DefId>> {
3139 let id = tcx.hir().as_local_hir_id(def_id).unwrap();
3140 let item = tcx.hir().expect_item_by_hir_id(id);
3141 let vec: Vec<_> = match item.node {
3142 hir::ItemKind::Trait(.., ref trait_item_refs) => {
3143 trait_item_refs.iter()
3144 .map(|trait_item_ref| trait_item_ref.id)
3145 .map(|id| tcx.hir().local_def_id_from_hir_id(id.hir_id))
3148 hir::ItemKind::Impl(.., ref impl_item_refs) => {
3149 impl_item_refs.iter()
3150 .map(|impl_item_ref| impl_item_ref.id)
3151 .map(|id| tcx.hir().local_def_id_from_hir_id(id.hir_id))
3154 hir::ItemKind::TraitAlias(..) => vec![],
3155 _ => span_bug!(item.span, "associated_item_def_ids: not impl or trait")
3160 fn def_span<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, def_id: DefId) -> Span {
3161 tcx.hir().span_if_local(def_id).unwrap()
3164 /// If the given `DefId` describes an item belonging to a trait,
3165 /// returns the `DefId` of the trait that the trait item belongs to;
3166 /// otherwise, returns `None`.
3167 fn trait_of_item<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, def_id: DefId) -> Option<DefId> {
3168 tcx.opt_associated_item(def_id)
3169 .and_then(|associated_item| {
3170 match associated_item.container {
3171 TraitContainer(def_id) => Some(def_id),
3172 ImplContainer(_) => None
3177 /// Yields the parent function's `DefId` if `def_id` is an `impl Trait` definition.
3178 pub fn is_impl_trait_defn(tcx: TyCtxt<'_, '_, '_>, def_id: DefId) -> Option<DefId> {
3179 if let Some(hir_id) = tcx.hir().as_local_hir_id(def_id) {
3180 if let Node::Item(item) = tcx.hir().get_by_hir_id(hir_id) {
3181 if let hir::ItemKind::Existential(ref exist_ty) = item.node {
3182 return exist_ty.impl_trait_fn;
3189 /// See `ParamEnv` struct definition for details.
3190 fn param_env<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3194 // The param_env of an impl Trait type is its defining function's param_env
3195 if let Some(parent) = is_impl_trait_defn(tcx, def_id) {
3196 return param_env(tcx, parent);
3198 // Compute the bounds on Self and the type parameters.
3200 let InstantiatedPredicates { predicates } =
3201 tcx.predicates_of(def_id).instantiate_identity(tcx);
3203 // Finally, we have to normalize the bounds in the environment, in
3204 // case they contain any associated type projections. This process
3205 // can yield errors if the put in illegal associated types, like
3206 // `<i32 as Foo>::Bar` where `i32` does not implement `Foo`. We
3207 // report these errors right here; this doesn't actually feel
3208 // right to me, because constructing the environment feels like a
3209 // kind of a "idempotent" action, but I'm not sure where would be
3210 // a better place. In practice, we construct environments for
3211 // every fn once during type checking, and we'll abort if there
3212 // are any errors at that point, so after type checking you can be
3213 // sure that this will succeed without errors anyway.
3215 let unnormalized_env = ty::ParamEnv::new(
3216 tcx.intern_predicates(&predicates),
3217 traits::Reveal::UserFacing,
3218 if tcx.sess.opts.debugging_opts.chalk { Some(def_id) } else { None }
3221 let body_id = tcx.hir().as_local_hir_id(def_id).map_or(hir::DUMMY_HIR_ID, |id| {
3222 tcx.hir().maybe_body_owned_by_by_hir_id(id).map_or(id, |body| body.hir_id)
3224 let cause = traits::ObligationCause::misc(tcx.def_span(def_id), body_id);
3225 traits::normalize_param_env_or_error(tcx, def_id, unnormalized_env, cause)
3228 fn crate_disambiguator<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3229 crate_num: CrateNum) -> CrateDisambiguator {
3230 assert_eq!(crate_num, LOCAL_CRATE);
3231 tcx.sess.local_crate_disambiguator()
3234 fn original_crate_name<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3235 crate_num: CrateNum) -> Symbol {
3236 assert_eq!(crate_num, LOCAL_CRATE);
3237 tcx.crate_name.clone()
3240 fn crate_hash<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3241 crate_num: CrateNum)
3243 assert_eq!(crate_num, LOCAL_CRATE);
3244 tcx.hir().crate_hash
3247 fn instance_def_size_estimate<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3248 instance_def: InstanceDef<'tcx>)
3250 match instance_def {
3251 InstanceDef::Item(..) |
3252 InstanceDef::DropGlue(..) => {
3253 let mir = tcx.instance_mir(instance_def);
3254 mir.basic_blocks().iter().map(|bb| bb.statements.len()).sum()
3256 // Estimate the size of other compiler-generated shims to be 1.
3261 /// If `def_id` is an issue 33140 hack impl, returns its self type; otherwise, returns `None`.
3263 /// See [`ImplOverlapKind::Issue33140`] for more details.
3264 fn issue33140_self_ty<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3268 debug!("issue33140_self_ty({:?})", def_id);
3270 let trait_ref = tcx.impl_trait_ref(def_id).unwrap_or_else(|| {
3271 bug!("issue33140_self_ty called on inherent impl {:?}", def_id)
3274 debug!("issue33140_self_ty({:?}), trait-ref={:?}", def_id, trait_ref);
3276 let is_marker_like =
3277 tcx.impl_polarity(def_id) == hir::ImplPolarity::Positive &&
3278 tcx.associated_item_def_ids(trait_ref.def_id).is_empty();
3280 // Check whether these impls would be ok for a marker trait.
3281 if !is_marker_like {
3282 debug!("issue33140_self_ty - not marker-like!");
3286 // impl must be `impl Trait for dyn Marker1 + Marker2 + ...`
3287 if trait_ref.substs.len() != 1 {
3288 debug!("issue33140_self_ty - impl has substs!");
3292 let predicates = tcx.predicates_of(def_id);
3293 if predicates.parent.is_some() || !predicates.predicates.is_empty() {
3294 debug!("issue33140_self_ty - impl has predicates {:?}!", predicates);
3298 let self_ty = trait_ref.self_ty();
3299 let self_ty_matches = match self_ty.sty {
3300 ty::Dynamic(ref data, ty::ReStatic) => data.principal().is_none(),
3304 if self_ty_matches {
3305 debug!("issue33140_self_ty - MATCHES!");
3308 debug!("issue33140_self_ty - non-matching self type");
3313 pub fn provide(providers: &mut ty::query::Providers<'_>) {
3314 context::provide(providers);
3315 erase_regions::provide(providers);
3316 layout::provide(providers);
3317 util::provide(providers);
3318 constness::provide(providers);
3319 *providers = ty::query::Providers {
3321 associated_item_def_ids,
3322 adt_sized_constraint,
3326 crate_disambiguator,
3327 original_crate_name,
3329 trait_impls_of: trait_def::trait_impls_of_provider,
3330 instance_def_size_estimate,
3336 /// A map for the local crate mapping each type to a vector of its
3337 /// inherent impls. This is not meant to be used outside of coherence;
3338 /// rather, you should request the vector for a specific type via
3339 /// `tcx.inherent_impls(def_id)` so as to minimize your dependencies
3340 /// (constructing this map requires touching the entire crate).
3341 #[derive(Clone, Debug, Default, HashStable)]
3342 pub struct CrateInherentImpls {
3343 pub inherent_impls: DefIdMap<Lrc<Vec<DefId>>>,
3346 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, RustcEncodable, RustcDecodable)]
3347 pub struct SymbolName {
3348 // FIXME: we don't rely on interning or equality here - better have
3349 // this be a `&'tcx str`.
3350 pub name: InternedString
3353 impl_stable_hash_for!(struct self::SymbolName {
3358 pub fn new(name: &str) -> SymbolName {
3360 name: Symbol::intern(name).as_interned_str()
3364 pub fn as_str(&self) -> LocalInternedString {
3369 impl fmt::Display for SymbolName {
3370 fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
3371 fmt::Display::fmt(&self.name, fmt)
3375 impl fmt::Debug for SymbolName {
3376 fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
3377 fmt::Display::fmt(&self.name, fmt)