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, CtorOf, CtorKind, ExportMap};
10 use crate::hir::def_id::{CrateNum, DefId, LocalDefId, CRATE_DEF_INDEX, LOCAL_CRATE};
11 use rustc_data_structures::svh::Svh;
12 use rustc_macros::HashStable;
13 use crate::ich::Fingerprint;
14 use crate::ich::StableHashingContext;
15 use crate::infer::canonical::Canonical;
16 use crate::middle::lang_items::{FnTraitLangItem, FnMutTraitLangItem, FnOnceTraitLangItem};
17 use crate::middle::resolve_lifetime::ObjectLifetimeDefault;
19 use crate::mir::interpret::{GlobalId, ErrorHandled};
20 use crate::mir::GeneratorLayout;
21 use crate::session::CrateDisambiguator;
22 use crate::traits::{self, Reveal};
24 use crate::ty::layout::VariantIdx;
25 use crate::ty::subst::{Subst, InternalSubsts, SubstsRef};
26 use crate::ty::util::{IntTypeExt, Discr};
27 use crate::ty::walk::TypeWalker;
28 use crate::util::captures::Captures;
29 use crate::util::nodemap::{NodeSet, DefIdMap, FxHashMap};
30 use arena::SyncDroplessArena;
31 use crate::session::DataTypeKind;
33 use serialize::{self, Encodable, Encoder};
34 use std::cell::RefCell;
35 use std::cmp::{self, Ordering};
37 use std::hash::{Hash, Hasher};
39 use rustc_data_structures::sync::{self, Lrc, ParallelIterator, par_iter};
42 use syntax::ast::{self, Name, Ident, NodeId};
44 use syntax::ext::hygiene::Mark;
45 use syntax::symbol::{keywords, Symbol, LocalInternedString, InternedString};
49 use rustc_data_structures::indexed_vec::{Idx, IndexVec};
50 use rustc_data_structures::stable_hasher::{StableHasher, StableHasherResult,
55 pub use self::sty::{Binder, BoundTy, BoundTyKind, BoundVar, DebruijnIndex, INNERMOST};
56 pub use self::sty::{FnSig, GenSig, CanonicalPolyFnSig, PolyFnSig, PolyGenSig};
57 pub use self::sty::{InferTy, ParamTy, ParamConst, InferConst, ProjectionTy, ExistentialPredicate};
58 pub use self::sty::{ClosureSubsts, GeneratorSubsts, UpvarSubsts, TypeAndMut};
59 pub use self::sty::{TraitRef, TyKind, PolyTraitRef};
60 pub use self::sty::{ExistentialTraitRef, PolyExistentialTraitRef};
61 pub use self::sty::{ExistentialProjection, PolyExistentialProjection, Const};
62 pub use self::sty::{BoundRegion, EarlyBoundRegion, FreeRegion, Region};
63 pub use self::sty::RegionKind;
64 pub use self::sty::{TyVid, IntVid, FloatVid, ConstVid, RegionVid};
65 pub use self::sty::BoundRegion::*;
66 pub use self::sty::InferTy::*;
67 pub use self::sty::RegionKind::*;
68 pub use self::sty::TyKind::*;
70 pub use self::binding::BindingMode;
71 pub use self::binding::BindingMode::*;
73 pub use self::context::{TyCtxt, FreeRegionInfo, GlobalArenas, AllArenas, tls, keep_local};
74 pub use self::context::{Lift, TypeckTables, CtxtInterners, GlobalCtxt};
75 pub use self::context::{
76 UserTypeAnnotationIndex, UserType, CanonicalUserType,
77 CanonicalUserTypeAnnotation, CanonicalUserTypeAnnotations, ResolvedOpaqueTy,
80 pub use self::instance::{Instance, InstanceDef};
82 pub use self::trait_def::TraitDef;
84 pub use self::query::queries;
96 pub mod inhabitedness;
113 mod structural_impls;
119 pub struct Resolutions {
120 pub freevars: FreevarMap,
121 pub trait_map: TraitMap,
122 pub maybe_unused_trait_imports: NodeSet,
123 pub maybe_unused_extern_crates: Vec<(NodeId, Span)>,
124 pub export_map: ExportMap,
125 pub glob_map: GlobMap,
126 /// Extern prelude entries. The value is `true` if the entry was introduced
127 /// via `extern crate` item and not `--extern` option or compiler built-in.
128 pub extern_prelude: FxHashMap<Name, bool>,
131 #[derive(Clone, Copy, PartialEq, Eq, Debug, HashStable)]
132 pub enum AssociatedItemContainer {
133 TraitContainer(DefId),
134 ImplContainer(DefId),
137 impl AssociatedItemContainer {
138 /// Asserts that this is the `DefId` of an associated item declared
139 /// in a trait, and returns the trait `DefId`.
140 pub fn assert_trait(&self) -> DefId {
142 TraitContainer(id) => id,
143 _ => bug!("associated item has wrong container type: {:?}", self)
147 pub fn id(&self) -> DefId {
149 TraitContainer(id) => id,
150 ImplContainer(id) => id,
155 /// The "header" of an impl is everything outside the body: a Self type, a trait
156 /// ref (in the case of a trait impl), and a set of predicates (from the
157 /// bounds / where-clauses).
158 #[derive(Clone, PartialEq, Eq, Hash, Debug)]
159 pub struct ImplHeader<'tcx> {
160 pub impl_def_id: DefId,
161 pub self_ty: Ty<'tcx>,
162 pub trait_ref: Option<TraitRef<'tcx>>,
163 pub predicates: Vec<Predicate<'tcx>>,
166 #[derive(Copy, Clone, Debug, PartialEq, HashStable)]
167 pub struct AssociatedItem {
169 #[stable_hasher(project(name))]
171 pub kind: AssociatedKind,
173 pub defaultness: hir::Defaultness,
174 pub container: AssociatedItemContainer,
176 /// Whether this is a method with an explicit self
177 /// as its first argument, allowing method calls.
178 pub method_has_self_argument: bool,
181 #[derive(Copy, Clone, PartialEq, Eq, Debug, Hash, RustcEncodable, RustcDecodable, HashStable)]
182 pub enum AssociatedKind {
189 impl AssociatedItem {
190 pub fn def(&self) -> Def {
192 AssociatedKind::Const => Def::AssociatedConst(self.def_id),
193 AssociatedKind::Method => Def::Method(self.def_id),
194 AssociatedKind::Type => Def::AssociatedTy(self.def_id),
195 AssociatedKind::Existential => Def::AssociatedExistential(self.def_id),
199 /// Tests whether the associated item admits a non-trivial implementation
201 pub fn relevant_for_never<'tcx>(&self) -> bool {
203 AssociatedKind::Existential |
204 AssociatedKind::Const |
205 AssociatedKind::Type => true,
206 // FIXME(canndrew): Be more thorough here, check if any argument is uninhabited.
207 AssociatedKind::Method => !self.method_has_self_argument,
211 pub fn signature<'a, 'tcx>(&self, tcx: &TyCtxt<'a, 'tcx, 'tcx>) -> String {
213 ty::AssociatedKind::Method => {
214 // We skip the binder here because the binder would deanonymize all
215 // late-bound regions, and we don't want method signatures to show up
216 // `as for<'r> fn(&'r MyType)`. Pretty-printing handles late-bound
217 // regions just fine, showing `fn(&MyType)`.
218 tcx.fn_sig(self.def_id).skip_binder().to_string()
220 ty::AssociatedKind::Type => format!("type {};", self.ident),
221 ty::AssociatedKind::Existential => format!("existential type {};", self.ident),
222 ty::AssociatedKind::Const => {
223 format!("const {}: {:?};", self.ident, tcx.type_of(self.def_id))
229 #[derive(Clone, Debug, PartialEq, Eq, Copy, RustcEncodable, RustcDecodable, HashStable)]
230 pub enum Visibility {
231 /// Visible everywhere (including in other crates).
233 /// Visible only in the given crate-local module.
235 /// Not visible anywhere in the local crate. This is the visibility of private external items.
239 pub trait DefIdTree: Copy {
240 fn parent(self, id: DefId) -> Option<DefId>;
242 fn is_descendant_of(self, mut descendant: DefId, ancestor: DefId) -> bool {
243 if descendant.krate != ancestor.krate {
247 while descendant != ancestor {
248 match self.parent(descendant) {
249 Some(parent) => descendant = parent,
250 None => return false,
257 impl<'a, 'gcx, 'tcx> DefIdTree for TyCtxt<'a, 'gcx, 'tcx> {
258 fn parent(self, id: DefId) -> Option<DefId> {
259 self.def_key(id).parent.map(|index| DefId { index: index, ..id })
264 pub fn from_hir(visibility: &hir::Visibility, id: hir::HirId, tcx: TyCtxt<'_, '_, '_>) -> Self {
265 match visibility.node {
266 hir::VisibilityKind::Public => Visibility::Public,
267 hir::VisibilityKind::Crate(_) => Visibility::Restricted(DefId::local(CRATE_DEF_INDEX)),
268 hir::VisibilityKind::Restricted { ref path, .. } => match path.def {
269 // If there is no resolution, `resolve` will have already reported an error, so
270 // assume that the visibility is public to avoid reporting more privacy errors.
271 Def::Err => Visibility::Public,
272 def => Visibility::Restricted(def.def_id()),
274 hir::VisibilityKind::Inherited => {
275 Visibility::Restricted(tcx.hir().get_module_parent_by_hir_id(id))
280 /// Returns `true` if an item with this visibility is accessible from the given block.
281 pub fn is_accessible_from<T: DefIdTree>(self, module: DefId, tree: T) -> bool {
282 let restriction = match self {
283 // Public items are visible everywhere.
284 Visibility::Public => return true,
285 // Private items from other crates are visible nowhere.
286 Visibility::Invisible => return false,
287 // Restricted items are visible in an arbitrary local module.
288 Visibility::Restricted(other) if other.krate != module.krate => return false,
289 Visibility::Restricted(module) => module,
292 tree.is_descendant_of(module, restriction)
295 /// Returns `true` if this visibility is at least as accessible as the given visibility
296 pub fn is_at_least<T: DefIdTree>(self, vis: Visibility, tree: T) -> bool {
297 let vis_restriction = match vis {
298 Visibility::Public => return self == Visibility::Public,
299 Visibility::Invisible => return true,
300 Visibility::Restricted(module) => module,
303 self.is_accessible_from(vis_restriction, tree)
306 // Returns `true` if this item is visible anywhere in the local crate.
307 pub fn is_visible_locally(self) -> bool {
309 Visibility::Public => true,
310 Visibility::Restricted(def_id) => def_id.is_local(),
311 Visibility::Invisible => false,
316 #[derive(Copy, Clone, PartialEq, Eq, RustcDecodable, RustcEncodable, Hash, HashStable)]
318 Covariant, // T<A> <: T<B> iff A <: B -- e.g., function return type
319 Invariant, // T<A> <: T<B> iff B == A -- e.g., type of mutable cell
320 Contravariant, // T<A> <: T<B> iff B <: A -- e.g., function param type
321 Bivariant, // T<A> <: T<B> -- e.g., unused type parameter
324 /// The crate variances map is computed during typeck and contains the
325 /// variance of every item in the local crate. You should not use it
326 /// directly, because to do so will make your pass dependent on the
327 /// HIR of every item in the local crate. Instead, use
328 /// `tcx.variances_of()` to get the variance for a *particular*
330 #[derive(HashStable)]
331 pub struct CrateVariancesMap {
332 /// For each item with generics, maps to a vector of the variance
333 /// of its generics. If an item has no generics, it will have no
335 pub variances: FxHashMap<DefId, Lrc<Vec<ty::Variance>>>,
337 /// An empty vector, useful for cloning.
338 #[stable_hasher(ignore)]
339 pub empty_variance: Lrc<Vec<ty::Variance>>,
343 /// `a.xform(b)` combines the variance of a context with the
344 /// variance of a type with the following meaning. If we are in a
345 /// context with variance `a`, and we encounter a type argument in
346 /// a position with variance `b`, then `a.xform(b)` is the new
347 /// variance with which the argument appears.
353 /// Here, the "ambient" variance starts as covariant. `*mut T` is
354 /// invariant with respect to `T`, so the variance in which the
355 /// `Vec<i32>` appears is `Covariant.xform(Invariant)`, which
356 /// yields `Invariant`. Now, the type `Vec<T>` is covariant with
357 /// respect to its type argument `T`, and hence the variance of
358 /// the `i32` here is `Invariant.xform(Covariant)`, which results
359 /// (again) in `Invariant`.
363 /// fn(*const Vec<i32>, *mut Vec<i32)
365 /// The ambient variance is covariant. A `fn` type is
366 /// contravariant with respect to its parameters, so the variance
367 /// within which both pointer types appear is
368 /// `Covariant.xform(Contravariant)`, or `Contravariant`. `*const
369 /// T` is covariant with respect to `T`, so the variance within
370 /// which the first `Vec<i32>` appears is
371 /// `Contravariant.xform(Covariant)` or `Contravariant`. The same
372 /// is true for its `i32` argument. In the `*mut T` case, the
373 /// variance of `Vec<i32>` is `Contravariant.xform(Invariant)`,
374 /// and hence the outermost type is `Invariant` with respect to
375 /// `Vec<i32>` (and its `i32` argument).
377 /// Source: Figure 1 of "Taming the Wildcards:
378 /// Combining Definition- and Use-Site Variance" published in PLDI'11.
379 pub fn xform(self, v: ty::Variance) -> ty::Variance {
381 // Figure 1, column 1.
382 (ty::Covariant, ty::Covariant) => ty::Covariant,
383 (ty::Covariant, ty::Contravariant) => ty::Contravariant,
384 (ty::Covariant, ty::Invariant) => ty::Invariant,
385 (ty::Covariant, ty::Bivariant) => ty::Bivariant,
387 // Figure 1, column 2.
388 (ty::Contravariant, ty::Covariant) => ty::Contravariant,
389 (ty::Contravariant, ty::Contravariant) => ty::Covariant,
390 (ty::Contravariant, ty::Invariant) => ty::Invariant,
391 (ty::Contravariant, ty::Bivariant) => ty::Bivariant,
393 // Figure 1, column 3.
394 (ty::Invariant, _) => ty::Invariant,
396 // Figure 1, column 4.
397 (ty::Bivariant, _) => ty::Bivariant,
402 // Contains information needed to resolve types and (in the future) look up
403 // the types of AST nodes.
404 #[derive(Copy, Clone, PartialEq, Eq, Hash)]
405 pub struct CReaderCacheKey {
410 // Flags that we track on types. These flags are propagated upwards
411 // through the type during type construction, so that we can quickly
412 // check whether the type has various kinds of types in it without
413 // recursing over the type itself.
415 pub struct TypeFlags: u32 {
416 const HAS_PARAMS = 1 << 0;
417 const HAS_SELF = 1 << 1;
418 const HAS_TY_INFER = 1 << 2;
419 const HAS_RE_INFER = 1 << 3;
420 const HAS_RE_PLACEHOLDER = 1 << 4;
422 /// Does this have any `ReEarlyBound` regions? Used to
423 /// determine whether substitition is required, since those
424 /// represent regions that are bound in a `ty::Generics` and
425 /// hence may be substituted.
426 const HAS_RE_EARLY_BOUND = 1 << 5;
428 /// Does this have any region that "appears free" in the type?
429 /// Basically anything but `ReLateBound` and `ReErased`.
430 const HAS_FREE_REGIONS = 1 << 6;
432 /// Is an error type reachable?
433 const HAS_TY_ERR = 1 << 7;
434 const HAS_PROJECTION = 1 << 8;
436 // FIXME: Rename this to the actual property since it's used for generators too
437 const HAS_TY_CLOSURE = 1 << 9;
439 // `true` if there are "names" of types and regions and so forth
440 // that are local to a particular fn
441 const HAS_FREE_LOCAL_NAMES = 1 << 10;
443 // Present if the type belongs in a local type context.
444 // Only set for Infer other than Fresh.
445 const KEEP_IN_LOCAL_TCX = 1 << 11;
447 // Is there a projection that does not involve a bound region?
448 // Currently we can't normalize projections w/ bound regions.
449 const HAS_NORMALIZABLE_PROJECTION = 1 << 12;
451 /// Does this have any `ReLateBound` regions? Used to check
452 /// if a global bound is safe to evaluate.
453 const HAS_RE_LATE_BOUND = 1 << 13;
455 const HAS_TY_PLACEHOLDER = 1 << 14;
457 const HAS_CT_INFER = 1 << 15;
459 const NEEDS_SUBST = TypeFlags::HAS_PARAMS.bits |
460 TypeFlags::HAS_SELF.bits |
461 TypeFlags::HAS_RE_EARLY_BOUND.bits;
463 // Flags representing the nominal content of a type,
464 // computed by FlagsComputation. If you add a new nominal
465 // flag, it should be added here too.
466 const NOMINAL_FLAGS = TypeFlags::HAS_PARAMS.bits |
467 TypeFlags::HAS_SELF.bits |
468 TypeFlags::HAS_TY_INFER.bits |
469 TypeFlags::HAS_RE_INFER.bits |
470 TypeFlags::HAS_CT_INFER.bits |
471 TypeFlags::HAS_RE_PLACEHOLDER.bits |
472 TypeFlags::HAS_RE_EARLY_BOUND.bits |
473 TypeFlags::HAS_FREE_REGIONS.bits |
474 TypeFlags::HAS_TY_ERR.bits |
475 TypeFlags::HAS_PROJECTION.bits |
476 TypeFlags::HAS_TY_CLOSURE.bits |
477 TypeFlags::HAS_FREE_LOCAL_NAMES.bits |
478 TypeFlags::KEEP_IN_LOCAL_TCX.bits |
479 TypeFlags::HAS_RE_LATE_BOUND.bits |
480 TypeFlags::HAS_TY_PLACEHOLDER.bits;
484 pub struct TyS<'tcx> {
485 pub sty: TyKind<'tcx>,
486 pub flags: TypeFlags,
488 /// This is a kind of confusing thing: it stores the smallest
491 /// (a) the binder itself captures nothing but
492 /// (b) all the late-bound things within the type are captured
493 /// by some sub-binder.
495 /// So, for a type without any late-bound things, like `u32`, this
496 /// will be *innermost*, because that is the innermost binder that
497 /// captures nothing. But for a type `&'D u32`, where `'D` is a
498 /// late-bound region with De Bruijn index `D`, this would be `D + 1`
499 /// -- the binder itself does not capture `D`, but `D` is captured
500 /// by an inner binder.
502 /// We call this concept an "exclusive" binder `D` because all
503 /// De Bruijn indices within the type are contained within `0..D`
505 outer_exclusive_binder: ty::DebruijnIndex,
508 // `TyS` is used a lot. Make sure it doesn't unintentionally get bigger.
509 #[cfg(target_arch = "x86_64")]
510 static_assert!(MEM_SIZE_OF_TY_S: ::std::mem::size_of::<TyS<'_>>() == 32);
512 impl<'tcx> Ord for TyS<'tcx> {
513 fn cmp(&self, other: &TyS<'tcx>) -> Ordering {
514 self.sty.cmp(&other.sty)
518 impl<'tcx> PartialOrd for TyS<'tcx> {
519 fn partial_cmp(&self, other: &TyS<'tcx>) -> Option<Ordering> {
520 Some(self.sty.cmp(&other.sty))
524 impl<'tcx> PartialEq for TyS<'tcx> {
526 fn eq(&self, other: &TyS<'tcx>) -> bool {
530 impl<'tcx> Eq for TyS<'tcx> {}
532 impl<'tcx> Hash for TyS<'tcx> {
533 fn hash<H: Hasher>(&self, s: &mut H) {
534 (self as *const TyS<'_>).hash(s)
538 impl<'tcx> TyS<'tcx> {
539 pub fn is_primitive_ty(&self) -> bool {
546 TyKind::Infer(InferTy::IntVar(_)) |
547 TyKind::Infer(InferTy::FloatVar(_)) |
548 TyKind::Infer(InferTy::FreshIntTy(_)) |
549 TyKind::Infer(InferTy::FreshFloatTy(_)) => true,
550 TyKind::Ref(_, x, _) => x.is_primitive_ty(),
555 pub fn is_suggestable(&self) -> bool {
560 TyKind::Dynamic(..) |
561 TyKind::Closure(..) |
563 TyKind::Projection(..) => false,
569 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for ty::TyS<'gcx> {
570 fn hash_stable<W: StableHasherResult>(&self,
571 hcx: &mut StableHashingContext<'a>,
572 hasher: &mut StableHasher<W>) {
576 // The other fields just provide fast access to information that is
577 // also contained in `sty`, so no need to hash them.
580 outer_exclusive_binder: _,
583 sty.hash_stable(hcx, hasher);
587 pub type Ty<'tcx> = &'tcx TyS<'tcx>;
589 impl<'tcx> serialize::UseSpecializedEncodable for Ty<'tcx> {}
590 impl<'tcx> serialize::UseSpecializedDecodable for Ty<'tcx> {}
592 pub type CanonicalTy<'gcx> = Canonical<'gcx, Ty<'gcx>>;
595 /// A dummy type used to force List to by unsized without requiring fat pointers
596 type OpaqueListContents;
599 /// A wrapper for slices with the additional invariant
600 /// that the slice is interned and no other slice with
601 /// the same contents can exist in the same context.
602 /// This means we can use pointer for both
603 /// equality comparisons and hashing.
604 /// Note: `Slice` was already taken by the `Ty`.
609 opaque: OpaqueListContents,
612 unsafe impl<T: Sync> Sync for List<T> {}
614 impl<T: Copy> List<T> {
616 fn from_arena<'tcx>(arena: &'tcx SyncDroplessArena, slice: &[T]) -> &'tcx List<T> {
617 assert!(!mem::needs_drop::<T>());
618 assert!(mem::size_of::<T>() != 0);
619 assert!(slice.len() != 0);
621 // Align up the size of the len (usize) field
622 let align = mem::align_of::<T>();
623 let align_mask = align - 1;
624 let offset = mem::size_of::<usize>();
625 let offset = (offset + align_mask) & !align_mask;
627 let size = offset + slice.len() * mem::size_of::<T>();
629 let mem = arena.alloc_raw(
631 cmp::max(mem::align_of::<T>(), mem::align_of::<usize>()));
633 let result = &mut *(mem.as_mut_ptr() as *mut List<T>);
635 result.len = slice.len();
637 // Write the elements
638 let arena_slice = slice::from_raw_parts_mut(result.data.as_mut_ptr(), result.len);
639 arena_slice.copy_from_slice(slice);
646 impl<T: fmt::Debug> fmt::Debug for List<T> {
647 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
652 impl<T: Encodable> Encodable for List<T> {
654 fn encode<S: Encoder>(&self, s: &mut S) -> Result<(), S::Error> {
659 impl<T> Ord for List<T> where T: Ord {
660 fn cmp(&self, other: &List<T>) -> Ordering {
661 if self == other { Ordering::Equal } else {
662 <[T] as Ord>::cmp(&**self, &**other)
667 impl<T> PartialOrd for List<T> where T: PartialOrd {
668 fn partial_cmp(&self, other: &List<T>) -> Option<Ordering> {
669 if self == other { Some(Ordering::Equal) } else {
670 <[T] as PartialOrd>::partial_cmp(&**self, &**other)
675 impl<T: PartialEq> PartialEq for List<T> {
677 fn eq(&self, other: &List<T>) -> bool {
681 impl<T: Eq> Eq for List<T> {}
683 impl<T> Hash for List<T> {
685 fn hash<H: Hasher>(&self, s: &mut H) {
686 (self as *const List<T>).hash(s)
690 impl<T> Deref for List<T> {
693 fn deref(&self) -> &[T] {
695 slice::from_raw_parts(self.data.as_ptr(), self.len)
700 impl<'a, T> IntoIterator for &'a List<T> {
702 type IntoIter = <&'a [T] as IntoIterator>::IntoIter;
704 fn into_iter(self) -> Self::IntoIter {
709 impl<'tcx> serialize::UseSpecializedDecodable for &'tcx List<Ty<'tcx>> {}
713 pub fn empty<'a>() -> &'a List<T> {
714 #[repr(align(64), C)]
715 struct EmptySlice([u8; 64]);
716 static EMPTY_SLICE: EmptySlice = EmptySlice([0; 64]);
717 assert!(mem::align_of::<T>() <= 64);
719 &*(&EMPTY_SLICE as *const _ as *const List<T>)
724 #[derive(Clone, Copy, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
725 pub struct UpvarPath {
726 pub hir_id: hir::HirId,
729 /// Upvars do not get their own `NodeId`. Instead, we use the pair of
730 /// the original var ID (that is, the root variable that is referenced
731 /// by the upvar) and the ID of the closure expression.
732 #[derive(Clone, Copy, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
734 pub var_path: UpvarPath,
735 pub closure_expr_id: LocalDefId,
738 #[derive(Clone, PartialEq, Eq, Hash, Debug, RustcEncodable, RustcDecodable, Copy, HashStable)]
739 pub enum BorrowKind {
740 /// Data must be immutable and is aliasable.
743 /// Data must be immutable but not aliasable. This kind of borrow
744 /// cannot currently be expressed by the user and is used only in
745 /// implicit closure bindings. It is needed when the closure
746 /// is borrowing or mutating a mutable referent, e.g.:
748 /// let x: &mut isize = ...;
749 /// let y = || *x += 5;
751 /// If we were to try to translate this closure into a more explicit
752 /// form, we'd encounter an error with the code as written:
754 /// struct Env { x: & &mut isize }
755 /// let x: &mut isize = ...;
756 /// let y = (&mut Env { &x }, fn_ptr); // Closure is pair of env and fn
757 /// fn fn_ptr(env: &mut Env) { **env.x += 5; }
759 /// This is then illegal because you cannot mutate a `&mut` found
760 /// in an aliasable location. To solve, you'd have to translate with
761 /// an `&mut` borrow:
763 /// struct Env { x: & &mut isize }
764 /// let x: &mut isize = ...;
765 /// let y = (&mut Env { &mut x }, fn_ptr); // changed from &x to &mut x
766 /// fn fn_ptr(env: &mut Env) { **env.x += 5; }
768 /// Now the assignment to `**env.x` is legal, but creating a
769 /// mutable pointer to `x` is not because `x` is not mutable. We
770 /// could fix this by declaring `x` as `let mut x`. This is ok in
771 /// user code, if awkward, but extra weird for closures, since the
772 /// borrow is hidden.
774 /// So we introduce a "unique imm" borrow -- the referent is
775 /// immutable, but not aliasable. This solves the problem. For
776 /// simplicity, we don't give users the way to express this
777 /// borrow, it's just used when translating closures.
780 /// Data is mutable and not aliasable.
784 /// Information describing the capture of an upvar. This is computed
785 /// during `typeck`, specifically by `regionck`.
786 #[derive(PartialEq, Clone, Debug, Copy, RustcEncodable, RustcDecodable, HashStable)]
787 pub enum UpvarCapture<'tcx> {
788 /// Upvar is captured by value. This is always true when the
789 /// closure is labeled `move`, but can also be true in other cases
790 /// depending on inference.
793 /// Upvar is captured by reference.
794 ByRef(UpvarBorrow<'tcx>),
797 #[derive(PartialEq, Clone, Copy, RustcEncodable, RustcDecodable, HashStable)]
798 pub struct UpvarBorrow<'tcx> {
799 /// The kind of borrow: by-ref upvars have access to shared
800 /// immutable borrows, which are not part of the normal language
802 pub kind: BorrowKind,
804 /// Region of the resulting reference.
805 pub region: ty::Region<'tcx>,
808 pub type UpvarListMap = FxHashMap<DefId, Vec<UpvarId>>;
809 pub type UpvarCaptureMap<'tcx> = FxHashMap<UpvarId, UpvarCapture<'tcx>>;
811 #[derive(Copy, Clone)]
812 pub struct ClosureUpvar<'tcx> {
818 #[derive(Clone, Copy, PartialEq, Eq)]
819 pub enum IntVarValue {
821 UintType(ast::UintTy),
824 #[derive(Clone, Copy, PartialEq, Eq)]
825 pub struct FloatVarValue(pub ast::FloatTy);
827 impl ty::EarlyBoundRegion {
828 pub fn to_bound_region(&self) -> ty::BoundRegion {
829 ty::BoundRegion::BrNamed(self.def_id, self.name)
832 /// Does this early bound region have a name? Early bound regions normally
833 /// always have names except when using anonymous lifetimes (`'_`).
834 pub fn has_name(&self) -> bool {
835 self.name != keywords::UnderscoreLifetime.name().as_interned_str()
839 #[derive(Clone, Debug, RustcEncodable, RustcDecodable, HashStable)]
840 pub enum GenericParamDefKind {
844 object_lifetime_default: ObjectLifetimeDefault,
845 synthetic: Option<hir::SyntheticTyParamKind>,
850 #[derive(Clone, RustcEncodable, RustcDecodable, HashStable)]
851 pub struct GenericParamDef {
852 pub name: InternedString,
856 /// `pure_wrt_drop`, set by the (unsafe) `#[may_dangle]` attribute
857 /// on generic parameter `'a`/`T`, asserts data behind the parameter
858 /// `'a`/`T` won't be accessed during the parent type's `Drop` impl.
859 pub pure_wrt_drop: bool,
861 pub kind: GenericParamDefKind,
864 impl GenericParamDef {
865 pub fn to_early_bound_region_data(&self) -> ty::EarlyBoundRegion {
866 if let GenericParamDefKind::Lifetime = self.kind {
867 ty::EarlyBoundRegion {
873 bug!("cannot convert a non-lifetime parameter def to an early bound region")
877 pub fn to_bound_region(&self) -> ty::BoundRegion {
878 if let GenericParamDefKind::Lifetime = self.kind {
879 self.to_early_bound_region_data().to_bound_region()
881 bug!("cannot convert a non-lifetime parameter def to an early bound region")
887 pub struct GenericParamCount {
888 pub lifetimes: usize,
893 /// Information about the formal type/lifetime parameters associated
894 /// with an item or method. Analogous to `hir::Generics`.
896 /// The ordering of parameters is the same as in `Subst` (excluding child generics):
897 /// `Self` (optionally), `Lifetime` params..., `Type` params...
898 #[derive(Clone, Debug, RustcEncodable, RustcDecodable, HashStable)]
899 pub struct Generics {
900 pub parent: Option<DefId>,
901 pub parent_count: usize,
902 pub params: Vec<GenericParamDef>,
904 /// Reverse map to the `index` field of each `GenericParamDef`
905 #[stable_hasher(ignore)]
906 pub param_def_id_to_index: FxHashMap<DefId, u32>,
909 pub has_late_bound_regions: Option<Span>,
912 impl<'a, 'gcx, 'tcx> Generics {
913 pub fn count(&self) -> usize {
914 self.parent_count + self.params.len()
917 pub fn own_counts(&self) -> GenericParamCount {
918 // We could cache this as a property of `GenericParamCount`, but
919 // the aim is to refactor this away entirely eventually and the
920 // presence of this method will be a constant reminder.
921 let mut own_counts: GenericParamCount = Default::default();
923 for param in &self.params {
925 GenericParamDefKind::Lifetime => own_counts.lifetimes += 1,
926 GenericParamDefKind::Type { .. } => own_counts.types += 1,
927 GenericParamDefKind::Const => own_counts.consts += 1,
934 pub fn requires_monomorphization(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> bool {
935 for param in &self.params {
937 GenericParamDefKind::Type { .. } | GenericParamDefKind::Const => return true,
938 GenericParamDefKind::Lifetime => {}
941 if let Some(parent_def_id) = self.parent {
942 let parent = tcx.generics_of(parent_def_id);
943 parent.requires_monomorphization(tcx)
949 pub fn region_param(&'tcx self,
950 param: &EarlyBoundRegion,
951 tcx: TyCtxt<'a, 'gcx, 'tcx>)
952 -> &'tcx GenericParamDef
954 if let Some(index) = param.index.checked_sub(self.parent_count as u32) {
955 let param = &self.params[index as usize];
957 GenericParamDefKind::Lifetime => param,
958 _ => bug!("expected lifetime parameter, but found another generic parameter")
961 tcx.generics_of(self.parent.expect("parent_count > 0 but no parent?"))
962 .region_param(param, tcx)
966 /// Returns the `GenericParamDef` associated with this `ParamTy`.
967 pub fn type_param(&'tcx self,
969 tcx: TyCtxt<'a, 'gcx, 'tcx>)
970 -> &'tcx GenericParamDef {
971 if let Some(index) = param.idx.checked_sub(self.parent_count as u32) {
972 let param = &self.params[index as usize];
974 GenericParamDefKind::Type { .. } => param,
975 _ => bug!("expected type parameter, but found another generic parameter")
978 tcx.generics_of(self.parent.expect("parent_count > 0 but no parent?"))
979 .type_param(param, tcx)
983 /// Returns the `ConstParameterDef` associated with this `ParamConst`.
984 pub fn const_param(&'tcx self,
986 tcx: TyCtxt<'a, 'gcx, 'tcx>)
987 -> &GenericParamDef {
988 if let Some(index) = param.index.checked_sub(self.parent_count as u32) {
989 let param = &self.params[index as usize];
991 GenericParamDefKind::Const => param,
992 _ => bug!("expected const parameter, but found another generic parameter")
995 tcx.generics_of(self.parent.expect("parent_count>0 but no parent?"))
996 .const_param(param, tcx)
1001 /// Bounds on generics.
1002 #[derive(Clone, Default, Debug, HashStable)]
1003 pub struct GenericPredicates<'tcx> {
1004 pub parent: Option<DefId>,
1005 pub predicates: Vec<(Predicate<'tcx>, Span)>,
1008 impl<'tcx> serialize::UseSpecializedEncodable for GenericPredicates<'tcx> {}
1009 impl<'tcx> serialize::UseSpecializedDecodable for GenericPredicates<'tcx> {}
1011 impl<'a, 'gcx, 'tcx> GenericPredicates<'tcx> {
1012 pub fn instantiate(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>, substs: SubstsRef<'tcx>)
1013 -> InstantiatedPredicates<'tcx> {
1014 let mut instantiated = InstantiatedPredicates::empty();
1015 self.instantiate_into(tcx, &mut instantiated, substs);
1019 pub fn instantiate_own(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>, substs: SubstsRef<'tcx>)
1020 -> InstantiatedPredicates<'tcx> {
1021 InstantiatedPredicates {
1022 predicates: self.predicates.iter().map(|(p, _)| p.subst(tcx, substs)).collect(),
1026 fn instantiate_into(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>,
1027 instantiated: &mut InstantiatedPredicates<'tcx>,
1028 substs: SubstsRef<'tcx>) {
1029 if let Some(def_id) = self.parent {
1030 tcx.predicates_of(def_id).instantiate_into(tcx, instantiated, substs);
1032 instantiated.predicates.extend(
1033 self.predicates.iter().map(|(p, _)| p.subst(tcx, substs)),
1037 pub fn instantiate_identity(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>)
1038 -> InstantiatedPredicates<'tcx> {
1039 let mut instantiated = InstantiatedPredicates::empty();
1040 self.instantiate_identity_into(tcx, &mut instantiated);
1044 fn instantiate_identity_into(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>,
1045 instantiated: &mut InstantiatedPredicates<'tcx>) {
1046 if let Some(def_id) = self.parent {
1047 tcx.predicates_of(def_id).instantiate_identity_into(tcx, instantiated);
1049 instantiated.predicates.extend(self.predicates.iter().map(|&(p, _)| p))
1052 pub fn instantiate_supertrait(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>,
1053 poly_trait_ref: &ty::PolyTraitRef<'tcx>)
1054 -> InstantiatedPredicates<'tcx>
1056 assert_eq!(self.parent, None);
1057 InstantiatedPredicates {
1058 predicates: self.predicates.iter().map(|(pred, _)| {
1059 pred.subst_supertrait(tcx, poly_trait_ref)
1065 #[derive(Clone, Copy, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
1066 pub enum Predicate<'tcx> {
1067 /// Corresponds to `where Foo: Bar<A,B,C>`. `Foo` here would be
1068 /// the `Self` type of the trait reference and `A`, `B`, and `C`
1069 /// would be the type parameters.
1070 Trait(PolyTraitPredicate<'tcx>),
1073 RegionOutlives(PolyRegionOutlivesPredicate<'tcx>),
1076 TypeOutlives(PolyTypeOutlivesPredicate<'tcx>),
1078 /// where `<T as TraitRef>::Name == X`, approximately.
1079 /// See the `ProjectionPredicate` struct for details.
1080 Projection(PolyProjectionPredicate<'tcx>),
1082 /// no syntax: `T` well-formed
1083 WellFormed(Ty<'tcx>),
1085 /// trait must be object-safe
1088 /// No direct syntax. May be thought of as `where T: FnFoo<...>`
1089 /// for some substitutions `...` and `T` being a closure type.
1090 /// Satisfied (or refuted) once we know the closure's kind.
1091 ClosureKind(DefId, ClosureSubsts<'tcx>, ClosureKind),
1094 Subtype(PolySubtypePredicate<'tcx>),
1096 /// Constant initializer must evaluate successfully.
1097 ConstEvaluatable(DefId, SubstsRef<'tcx>),
1100 /// The crate outlives map is computed during typeck and contains the
1101 /// outlives of every item in the local crate. You should not use it
1102 /// directly, because to do so will make your pass dependent on the
1103 /// HIR of every item in the local crate. Instead, use
1104 /// `tcx.inferred_outlives_of()` to get the outlives for a *particular*
1106 #[derive(HashStable)]
1107 pub struct CratePredicatesMap<'tcx> {
1108 /// For each struct with outlive bounds, maps to a vector of the
1109 /// predicate of its outlive bounds. If an item has no outlives
1110 /// bounds, it will have no entry.
1111 pub predicates: FxHashMap<DefId, Lrc<Vec<ty::Predicate<'tcx>>>>,
1113 /// An empty vector, useful for cloning.
1114 #[stable_hasher(ignore)]
1115 pub empty_predicate: Lrc<Vec<ty::Predicate<'tcx>>>,
1118 impl<'tcx> AsRef<Predicate<'tcx>> for Predicate<'tcx> {
1119 fn as_ref(&self) -> &Predicate<'tcx> {
1124 impl<'a, 'gcx, 'tcx> Predicate<'tcx> {
1125 /// Performs a substitution suitable for going from a
1126 /// poly-trait-ref to supertraits that must hold if that
1127 /// poly-trait-ref holds. This is slightly different from a normal
1128 /// substitution in terms of what happens with bound regions. See
1129 /// lengthy comment below for details.
1130 pub fn subst_supertrait(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>,
1131 trait_ref: &ty::PolyTraitRef<'tcx>)
1132 -> ty::Predicate<'tcx>
1134 // The interaction between HRTB and supertraits is not entirely
1135 // obvious. Let me walk you (and myself) through an example.
1137 // Let's start with an easy case. Consider two traits:
1139 // trait Foo<'a>: Bar<'a,'a> { }
1140 // trait Bar<'b,'c> { }
1142 // Now, if we have a trait reference `for<'x> T: Foo<'x>`, then
1143 // we can deduce that `for<'x> T: Bar<'x,'x>`. Basically, if we
1144 // knew that `Foo<'x>` (for any 'x) then we also know that
1145 // `Bar<'x,'x>` (for any 'x). This more-or-less falls out from
1146 // normal substitution.
1148 // In terms of why this is sound, the idea is that whenever there
1149 // is an impl of `T:Foo<'a>`, it must show that `T:Bar<'a,'a>`
1150 // holds. So if there is an impl of `T:Foo<'a>` that applies to
1151 // all `'a`, then we must know that `T:Bar<'a,'a>` holds for all
1154 // Another example to be careful of is this:
1156 // trait Foo1<'a>: for<'b> Bar1<'a,'b> { }
1157 // trait Bar1<'b,'c> { }
1159 // Here, if we have `for<'x> T: Foo1<'x>`, then what do we know?
1160 // The answer is that we know `for<'x,'b> T: Bar1<'x,'b>`. The
1161 // reason is similar to the previous example: any impl of
1162 // `T:Foo1<'x>` must show that `for<'b> T: Bar1<'x, 'b>`. So
1163 // basically we would want to collapse the bound lifetimes from
1164 // the input (`trait_ref`) and the supertraits.
1166 // To achieve this in practice is fairly straightforward. Let's
1167 // consider the more complicated scenario:
1169 // - We start out with `for<'x> T: Foo1<'x>`. In this case, `'x`
1170 // has a De Bruijn index of 1. We want to produce `for<'x,'b> T: Bar1<'x,'b>`,
1171 // where both `'x` and `'b` would have a DB index of 1.
1172 // The substitution from the input trait-ref is therefore going to be
1173 // `'a => 'x` (where `'x` has a DB index of 1).
1174 // - The super-trait-ref is `for<'b> Bar1<'a,'b>`, where `'a` is an
1175 // early-bound parameter and `'b' is a late-bound parameter with a
1177 // - If we replace `'a` with `'x` from the input, it too will have
1178 // a DB index of 1, and thus we'll have `for<'x,'b> Bar1<'x,'b>`
1179 // just as we wanted.
1181 // There is only one catch. If we just apply the substitution `'a
1182 // => 'x` to `for<'b> Bar1<'a,'b>`, the substitution code will
1183 // adjust the DB index because we substituting into a binder (it
1184 // tries to be so smart...) resulting in `for<'x> for<'b>
1185 // Bar1<'x,'b>` (we have no syntax for this, so use your
1186 // imagination). Basically the 'x will have DB index of 2 and 'b
1187 // will have DB index of 1. Not quite what we want. So we apply
1188 // the substitution to the *contents* of the trait reference,
1189 // rather than the trait reference itself (put another way, the
1190 // substitution code expects equal binding levels in the values
1191 // from the substitution and the value being substituted into, and
1192 // this trick achieves that).
1194 let substs = &trait_ref.skip_binder().substs;
1196 Predicate::Trait(ref binder) =>
1197 Predicate::Trait(binder.map_bound(|data| data.subst(tcx, substs))),
1198 Predicate::Subtype(ref binder) =>
1199 Predicate::Subtype(binder.map_bound(|data| data.subst(tcx, substs))),
1200 Predicate::RegionOutlives(ref binder) =>
1201 Predicate::RegionOutlives(binder.map_bound(|data| data.subst(tcx, substs))),
1202 Predicate::TypeOutlives(ref binder) =>
1203 Predicate::TypeOutlives(binder.map_bound(|data| data.subst(tcx, substs))),
1204 Predicate::Projection(ref binder) =>
1205 Predicate::Projection(binder.map_bound(|data| data.subst(tcx, substs))),
1206 Predicate::WellFormed(data) =>
1207 Predicate::WellFormed(data.subst(tcx, substs)),
1208 Predicate::ObjectSafe(trait_def_id) =>
1209 Predicate::ObjectSafe(trait_def_id),
1210 Predicate::ClosureKind(closure_def_id, closure_substs, kind) =>
1211 Predicate::ClosureKind(closure_def_id, closure_substs.subst(tcx, substs), kind),
1212 Predicate::ConstEvaluatable(def_id, const_substs) =>
1213 Predicate::ConstEvaluatable(def_id, const_substs.subst(tcx, substs)),
1218 #[derive(Clone, Copy, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
1219 pub struct TraitPredicate<'tcx> {
1220 pub trait_ref: TraitRef<'tcx>
1223 pub type PolyTraitPredicate<'tcx> = ty::Binder<TraitPredicate<'tcx>>;
1225 impl<'tcx> TraitPredicate<'tcx> {
1226 pub fn def_id(&self) -> DefId {
1227 self.trait_ref.def_id
1230 pub fn input_types<'a>(&'a self) -> impl DoubleEndedIterator<Item=Ty<'tcx>> + 'a {
1231 self.trait_ref.input_types()
1234 pub fn self_ty(&self) -> Ty<'tcx> {
1235 self.trait_ref.self_ty()
1239 impl<'tcx> PolyTraitPredicate<'tcx> {
1240 pub fn def_id(&self) -> DefId {
1241 // ok to skip binder since trait def-id does not care about regions
1242 self.skip_binder().def_id()
1246 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord,
1247 Hash, Debug, RustcEncodable, RustcDecodable, HashStable)]
1248 pub struct OutlivesPredicate<A,B>(pub A, pub B); // `A: B`
1249 pub type PolyOutlivesPredicate<A,B> = ty::Binder<OutlivesPredicate<A,B>>;
1250 pub type RegionOutlivesPredicate<'tcx> = OutlivesPredicate<ty::Region<'tcx>,
1252 pub type TypeOutlivesPredicate<'tcx> = OutlivesPredicate<Ty<'tcx>,
1254 pub type PolyRegionOutlivesPredicate<'tcx> = ty::Binder<RegionOutlivesPredicate<'tcx>>;
1255 pub type PolyTypeOutlivesPredicate<'tcx> = ty::Binder<TypeOutlivesPredicate<'tcx>>;
1257 #[derive(Clone, Copy, PartialEq, Eq, Hash, Debug, RustcEncodable, RustcDecodable, HashStable)]
1258 pub struct SubtypePredicate<'tcx> {
1259 pub a_is_expected: bool,
1263 pub type PolySubtypePredicate<'tcx> = ty::Binder<SubtypePredicate<'tcx>>;
1265 /// This kind of predicate has no *direct* correspondent in the
1266 /// syntax, but it roughly corresponds to the syntactic forms:
1268 /// 1. `T: TraitRef<..., Item = Type>`
1269 /// 2. `<T as TraitRef<...>>::Item == Type` (NYI)
1271 /// In particular, form #1 is "desugared" to the combination of a
1272 /// normal trait predicate (`T: TraitRef<...>`) and one of these
1273 /// predicates. Form #2 is a broader form in that it also permits
1274 /// equality between arbitrary types. Processing an instance of
1275 /// Form #2 eventually yields one of these `ProjectionPredicate`
1276 /// instances to normalize the LHS.
1277 #[derive(Copy, Clone, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
1278 pub struct ProjectionPredicate<'tcx> {
1279 pub projection_ty: ProjectionTy<'tcx>,
1283 pub type PolyProjectionPredicate<'tcx> = Binder<ProjectionPredicate<'tcx>>;
1285 impl<'tcx> PolyProjectionPredicate<'tcx> {
1286 /// Returns the `DefId` of the associated item being projected.
1287 pub fn item_def_id(&self) -> DefId {
1288 self.skip_binder().projection_ty.item_def_id
1292 pub fn to_poly_trait_ref(&self, tcx: TyCtxt<'_, '_, '_>) -> PolyTraitRef<'tcx> {
1293 // Note: unlike with `TraitRef::to_poly_trait_ref()`,
1294 // `self.0.trait_ref` is permitted to have escaping regions.
1295 // This is because here `self` has a `Binder` and so does our
1296 // return value, so we are preserving the number of binding
1298 self.map_bound(|predicate| predicate.projection_ty.trait_ref(tcx))
1301 pub fn ty(&self) -> Binder<Ty<'tcx>> {
1302 self.map_bound(|predicate| predicate.ty)
1305 /// The `DefId` of the `TraitItem` for the associated type.
1307 /// Note that this is not the `DefId` of the `TraitRef` containing this
1308 /// associated type, which is in `tcx.associated_item(projection_def_id()).container`.
1309 pub fn projection_def_id(&self) -> DefId {
1310 // okay to skip binder since trait def-id does not care about regions
1311 self.skip_binder().projection_ty.item_def_id
1315 pub trait ToPolyTraitRef<'tcx> {
1316 fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx>;
1319 impl<'tcx> ToPolyTraitRef<'tcx> for TraitRef<'tcx> {
1320 fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx> {
1321 ty::Binder::dummy(self.clone())
1325 impl<'tcx> ToPolyTraitRef<'tcx> for PolyTraitPredicate<'tcx> {
1326 fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx> {
1327 self.map_bound_ref(|trait_pred| trait_pred.trait_ref)
1331 pub trait ToPredicate<'tcx> {
1332 fn to_predicate(&self) -> Predicate<'tcx>;
1335 impl<'tcx> ToPredicate<'tcx> for TraitRef<'tcx> {
1336 fn to_predicate(&self) -> Predicate<'tcx> {
1337 ty::Predicate::Trait(ty::Binder::dummy(ty::TraitPredicate {
1338 trait_ref: self.clone()
1343 impl<'tcx> ToPredicate<'tcx> for PolyTraitRef<'tcx> {
1344 fn to_predicate(&self) -> Predicate<'tcx> {
1345 ty::Predicate::Trait(self.to_poly_trait_predicate())
1349 impl<'tcx> ToPredicate<'tcx> for PolyRegionOutlivesPredicate<'tcx> {
1350 fn to_predicate(&self) -> Predicate<'tcx> {
1351 Predicate::RegionOutlives(self.clone())
1355 impl<'tcx> ToPredicate<'tcx> for PolyTypeOutlivesPredicate<'tcx> {
1356 fn to_predicate(&self) -> Predicate<'tcx> {
1357 Predicate::TypeOutlives(self.clone())
1361 impl<'tcx> ToPredicate<'tcx> for PolyProjectionPredicate<'tcx> {
1362 fn to_predicate(&self) -> Predicate<'tcx> {
1363 Predicate::Projection(self.clone())
1367 // A custom iterator used by Predicate::walk_tys.
1368 enum WalkTysIter<'tcx, I, J, K>
1369 where I: Iterator<Item = Ty<'tcx>>,
1370 J: Iterator<Item = Ty<'tcx>>,
1371 K: Iterator<Item = Ty<'tcx>>
1375 Two(Ty<'tcx>, Ty<'tcx>),
1381 impl<'tcx, I, J, K> Iterator for WalkTysIter<'tcx, I, J, K>
1382 where I: Iterator<Item = Ty<'tcx>>,
1383 J: Iterator<Item = Ty<'tcx>>,
1384 K: Iterator<Item = Ty<'tcx>>
1386 type Item = Ty<'tcx>;
1388 fn next(&mut self) -> Option<Ty<'tcx>> {
1390 WalkTysIter::None => None,
1391 WalkTysIter::One(item) => {
1392 *self = WalkTysIter::None;
1395 WalkTysIter::Two(item1, item2) => {
1396 *self = WalkTysIter::One(item2);
1399 WalkTysIter::Types(ref mut iter) => {
1402 WalkTysIter::InputTypes(ref mut iter) => {
1405 WalkTysIter::ProjectionTypes(ref mut iter) => {
1412 impl<'tcx> Predicate<'tcx> {
1413 /// Iterates over the types in this predicate. Note that in all
1414 /// cases this is skipping over a binder, so late-bound regions
1415 /// with depth 0 are bound by the predicate.
1416 pub fn walk_tys(&'a self) -> impl Iterator<Item = Ty<'tcx>> + 'a {
1418 ty::Predicate::Trait(ref data) => {
1419 WalkTysIter::InputTypes(data.skip_binder().input_types())
1421 ty::Predicate::Subtype(binder) => {
1422 let SubtypePredicate { a, b, a_is_expected: _ } = binder.skip_binder();
1423 WalkTysIter::Two(a, b)
1425 ty::Predicate::TypeOutlives(binder) => {
1426 WalkTysIter::One(binder.skip_binder().0)
1428 ty::Predicate::RegionOutlives(..) => {
1431 ty::Predicate::Projection(ref data) => {
1432 let inner = data.skip_binder();
1433 WalkTysIter::ProjectionTypes(
1434 inner.projection_ty.substs.types().chain(Some(inner.ty)))
1436 ty::Predicate::WellFormed(data) => {
1437 WalkTysIter::One(data)
1439 ty::Predicate::ObjectSafe(_trait_def_id) => {
1442 ty::Predicate::ClosureKind(_closure_def_id, closure_substs, _kind) => {
1443 WalkTysIter::Types(closure_substs.substs.types())
1445 ty::Predicate::ConstEvaluatable(_, substs) => {
1446 WalkTysIter::Types(substs.types())
1451 pub fn to_opt_poly_trait_ref(&self) -> Option<PolyTraitRef<'tcx>> {
1453 Predicate::Trait(ref t) => {
1454 Some(t.to_poly_trait_ref())
1456 Predicate::Projection(..) |
1457 Predicate::Subtype(..) |
1458 Predicate::RegionOutlives(..) |
1459 Predicate::WellFormed(..) |
1460 Predicate::ObjectSafe(..) |
1461 Predicate::ClosureKind(..) |
1462 Predicate::TypeOutlives(..) |
1463 Predicate::ConstEvaluatable(..) => {
1469 pub fn to_opt_type_outlives(&self) -> Option<PolyTypeOutlivesPredicate<'tcx>> {
1471 Predicate::TypeOutlives(data) => {
1474 Predicate::Trait(..) |
1475 Predicate::Projection(..) |
1476 Predicate::Subtype(..) |
1477 Predicate::RegionOutlives(..) |
1478 Predicate::WellFormed(..) |
1479 Predicate::ObjectSafe(..) |
1480 Predicate::ClosureKind(..) |
1481 Predicate::ConstEvaluatable(..) => {
1488 /// Represents the bounds declared on a particular set of type
1489 /// parameters. Should eventually be generalized into a flag list of
1490 /// where-clauses. You can obtain a `InstantiatedPredicates` list from a
1491 /// `GenericPredicates` by using the `instantiate` method. Note that this method
1492 /// reflects an important semantic invariant of `InstantiatedPredicates`: while
1493 /// the `GenericPredicates` are expressed in terms of the bound type
1494 /// parameters of the impl/trait/whatever, an `InstantiatedPredicates` instance
1495 /// represented a set of bounds for some particular instantiation,
1496 /// meaning that the generic parameters have been substituted with
1501 /// struct Foo<T,U:Bar<T>> { ... }
1503 /// Here, the `GenericPredicates` for `Foo` would contain a list of bounds like
1504 /// `[[], [U:Bar<T>]]`. Now if there were some particular reference
1505 /// like `Foo<isize,usize>`, then the `InstantiatedPredicates` would be `[[],
1506 /// [usize:Bar<isize>]]`.
1507 #[derive(Clone, Debug)]
1508 pub struct InstantiatedPredicates<'tcx> {
1509 pub predicates: Vec<Predicate<'tcx>>,
1512 impl<'tcx> InstantiatedPredicates<'tcx> {
1513 pub fn empty() -> InstantiatedPredicates<'tcx> {
1514 InstantiatedPredicates { predicates: vec![] }
1517 pub fn is_empty(&self) -> bool {
1518 self.predicates.is_empty()
1523 /// "Universes" are used during type- and trait-checking in the
1524 /// presence of `for<..>` binders to control what sets of names are
1525 /// visible. Universes are arranged into a tree: the root universe
1526 /// contains names that are always visible. Each child then adds a new
1527 /// set of names that are visible, in addition to those of its parent.
1528 /// We say that the child universe "extends" the parent universe with
1531 /// To make this more concrete, consider this program:
1535 /// fn bar<T>(x: T) {
1536 /// let y: for<'a> fn(&'a u8, Foo) = ...;
1540 /// The struct name `Foo` is in the root universe U0. But the type
1541 /// parameter `T`, introduced on `bar`, is in an extended universe U1
1542 /// -- i.e., within `bar`, we can name both `T` and `Foo`, but outside
1543 /// of `bar`, we cannot name `T`. Then, within the type of `y`, the
1544 /// region `'a` is in a universe U2 that extends U1, because we can
1545 /// name it inside the fn type but not outside.
1547 /// Universes are used to do type- and trait-checking around these
1548 /// "forall" binders (also called **universal quantification**). The
1549 /// idea is that when, in the body of `bar`, we refer to `T` as a
1550 /// type, we aren't referring to any type in particular, but rather a
1551 /// kind of "fresh" type that is distinct from all other types we have
1552 /// actually declared. This is called a **placeholder** type, and we
1553 /// use universes to talk about this. In other words, a type name in
1554 /// universe 0 always corresponds to some "ground" type that the user
1555 /// declared, but a type name in a non-zero universe is a placeholder
1556 /// type -- an idealized representative of "types in general" that we
1557 /// use for checking generic functions.
1558 pub struct UniverseIndex {
1559 DEBUG_FORMAT = "U{}",
1563 impl_stable_hash_for!(struct UniverseIndex { private });
1565 impl UniverseIndex {
1566 pub const ROOT: UniverseIndex = UniverseIndex::from_u32_const(0);
1568 /// Returns the "next" universe index in order -- this new index
1569 /// is considered to extend all previous universes. This
1570 /// corresponds to entering a `forall` quantifier. So, for
1571 /// example, suppose we have this type in universe `U`:
1574 /// for<'a> fn(&'a u32)
1577 /// Once we "enter" into this `for<'a>` quantifier, we are in a
1578 /// new universe that extends `U` -- in this new universe, we can
1579 /// name the region `'a`, but that region was not nameable from
1580 /// `U` because it was not in scope there.
1581 pub fn next_universe(self) -> UniverseIndex {
1582 UniverseIndex::from_u32(self.private.checked_add(1).unwrap())
1585 /// Returns `true` if `self` can name a name from `other` -- in other words,
1586 /// if the set of names in `self` is a superset of those in
1587 /// `other` (`self >= other`).
1588 pub fn can_name(self, other: UniverseIndex) -> bool {
1589 self.private >= other.private
1592 /// Returns `true` if `self` cannot name some names from `other` -- in other
1593 /// words, if the set of names in `self` is a strict subset of
1594 /// those in `other` (`self < other`).
1595 pub fn cannot_name(self, other: UniverseIndex) -> bool {
1596 self.private < other.private
1600 /// The "placeholder index" fully defines a placeholder region.
1601 /// Placeholder regions are identified by both a **universe** as well
1602 /// as a "bound-region" within that universe. The `bound_region` is
1603 /// basically a name -- distinct bound regions within the same
1604 /// universe are just two regions with an unknown relationship to one
1606 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, PartialOrd, Ord)]
1607 pub struct Placeholder<T> {
1608 pub universe: UniverseIndex,
1612 impl<'a, 'gcx, T> HashStable<StableHashingContext<'a>> for Placeholder<T>
1613 where T: HashStable<StableHashingContext<'a>>
1615 fn hash_stable<W: StableHasherResult>(
1617 hcx: &mut StableHashingContext<'a>,
1618 hasher: &mut StableHasher<W>
1620 self.universe.hash_stable(hcx, hasher);
1621 self.name.hash_stable(hcx, hasher);
1625 pub type PlaceholderRegion = Placeholder<BoundRegion>;
1627 pub type PlaceholderType = Placeholder<BoundVar>;
1629 /// When type checking, we use the `ParamEnv` to track
1630 /// details about the set of where-clauses that are in scope at this
1631 /// particular point.
1632 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, HashStable)]
1633 pub struct ParamEnv<'tcx> {
1634 /// Obligations that the caller must satisfy. This is basically
1635 /// the set of bounds on the in-scope type parameters, translated
1636 /// into Obligations, and elaborated and normalized.
1637 pub caller_bounds: &'tcx List<ty::Predicate<'tcx>>,
1639 /// Typically, this is `Reveal::UserFacing`, but during codegen we
1640 /// want `Reveal::All` -- note that this is always paired with an
1641 /// empty environment. To get that, use `ParamEnv::reveal()`.
1642 pub reveal: traits::Reveal,
1644 /// If this `ParamEnv` comes from a call to `tcx.param_env(def_id)`,
1645 /// register that `def_id` (useful for transitioning to the chalk trait
1647 pub def_id: Option<DefId>,
1650 impl<'tcx> ParamEnv<'tcx> {
1651 /// Construct a trait environment suitable for contexts where
1652 /// there are no where-clauses in scope. Hidden types (like `impl
1653 /// Trait`) are left hidden, so this is suitable for ordinary
1656 pub fn empty() -> Self {
1657 Self::new(List::empty(), Reveal::UserFacing, None)
1660 /// Construct a trait environment with no where-clauses in scope
1661 /// where the values of all `impl Trait` and other hidden types
1662 /// are revealed. This is suitable for monomorphized, post-typeck
1663 /// environments like codegen or doing optimizations.
1665 /// N.B., if you want to have predicates in scope, use `ParamEnv::new`,
1666 /// or invoke `param_env.with_reveal_all()`.
1668 pub fn reveal_all() -> Self {
1669 Self::new(List::empty(), Reveal::All, None)
1672 /// Construct a trait environment with the given set of predicates.
1675 caller_bounds: &'tcx List<ty::Predicate<'tcx>>,
1677 def_id: Option<DefId>
1679 ty::ParamEnv { caller_bounds, reveal, def_id }
1682 /// Returns a new parameter environment with the same clauses, but
1683 /// which "reveals" the true results of projections in all cases
1684 /// (even for associated types that are specializable). This is
1685 /// the desired behavior during codegen and certain other special
1686 /// contexts; normally though we want to use `Reveal::UserFacing`,
1687 /// which is the default.
1688 pub fn with_reveal_all(self) -> Self {
1689 ty::ParamEnv { reveal: Reveal::All, ..self }
1692 /// Returns this same environment but with no caller bounds.
1693 pub fn without_caller_bounds(self) -> Self {
1694 ty::ParamEnv { caller_bounds: List::empty(), ..self }
1697 /// Creates a suitable environment in which to perform trait
1698 /// queries on the given value. When type-checking, this is simply
1699 /// the pair of the environment plus value. But when reveal is set to
1700 /// All, then if `value` does not reference any type parameters, we will
1701 /// pair it with the empty environment. This improves caching and is generally
1704 /// N.B., we preserve the environment when type-checking because it
1705 /// is possible for the user to have wacky where-clauses like
1706 /// `where Box<u32>: Copy`, which are clearly never
1707 /// satisfiable. We generally want to behave as if they were true,
1708 /// although the surrounding function is never reachable.
1709 pub fn and<T: TypeFoldable<'tcx>>(self, value: T) -> ParamEnvAnd<'tcx, T> {
1711 Reveal::UserFacing => {
1719 if value.has_placeholders()
1720 || value.needs_infer()
1721 || value.has_param_types()
1722 || value.has_self_ty()
1730 param_env: self.without_caller_bounds(),
1739 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash)]
1740 pub struct ParamEnvAnd<'tcx, T> {
1741 pub param_env: ParamEnv<'tcx>,
1745 impl<'tcx, T> ParamEnvAnd<'tcx, T> {
1746 pub fn into_parts(self) -> (ParamEnv<'tcx>, T) {
1747 (self.param_env, self.value)
1751 impl<'a, 'gcx, T> HashStable<StableHashingContext<'a>> for ParamEnvAnd<'gcx, T>
1752 where T: HashStable<StableHashingContext<'a>>
1754 fn hash_stable<W: StableHasherResult>(&self,
1755 hcx: &mut StableHashingContext<'a>,
1756 hasher: &mut StableHasher<W>) {
1762 param_env.hash_stable(hcx, hasher);
1763 value.hash_stable(hcx, hasher);
1767 #[derive(Copy, Clone, Debug, HashStable)]
1768 pub struct Destructor {
1769 /// The `DefId` of the destructor method
1774 #[derive(HashStable)]
1775 pub struct AdtFlags: u32 {
1776 const NO_ADT_FLAGS = 0;
1777 /// Indicates whether the ADT is an enum.
1778 const IS_ENUM = 1 << 0;
1779 /// Indicates whether the ADT is a union.
1780 const IS_UNION = 1 << 1;
1781 /// Indicates whether the ADT is a struct.
1782 const IS_STRUCT = 1 << 2;
1783 /// Indicates whether the ADT is a struct and has a constructor.
1784 const HAS_CTOR = 1 << 3;
1785 /// Indicates whether the type is a `PhantomData`.
1786 const IS_PHANTOM_DATA = 1 << 4;
1787 /// Indicates whether the type has a `#[fundamental]` attribute.
1788 const IS_FUNDAMENTAL = 1 << 5;
1789 /// Indicates whether the type is a `Box`.
1790 const IS_BOX = 1 << 6;
1791 /// Indicates whether the type is an `Arc`.
1792 const IS_ARC = 1 << 7;
1793 /// Indicates whether the type is an `Rc`.
1794 const IS_RC = 1 << 8;
1795 /// Indicates whether the variant list of this ADT is `#[non_exhaustive]`.
1796 /// (i.e., this flag is never set unless this ADT is an enum).
1797 const IS_VARIANT_LIST_NON_EXHAUSTIVE = 1 << 9;
1802 #[derive(HashStable)]
1803 pub struct VariantFlags: u32 {
1804 const NO_VARIANT_FLAGS = 0;
1805 /// Indicates whether the field list of this variant is `#[non_exhaustive]`.
1806 const IS_FIELD_LIST_NON_EXHAUSTIVE = 1 << 0;
1810 /// Definition of a variant -- a struct's fields or a enum variant.
1812 pub struct VariantDef {
1813 /// `DefId` that identifies the variant itself.
1814 /// If this variant belongs to a struct or union, then this is a copy of its `DefId`.
1816 /// `DefId` that identifies the variant's constructor.
1817 /// If this variant is a struct variant, then this is `None`.
1818 pub ctor_def_id: Option<DefId>,
1819 /// Variant or struct name.
1821 /// Discriminant of this variant.
1822 pub discr: VariantDiscr,
1823 /// Fields of this variant.
1824 pub fields: Vec<FieldDef>,
1825 /// Type of constructor of variant.
1826 pub ctor_kind: CtorKind,
1827 /// Flags of the variant (e.g. is field list non-exhaustive)?
1828 flags: VariantFlags,
1830 pub recovered: bool,
1833 impl<'a, 'gcx, 'tcx> VariantDef {
1834 /// Creates a new `VariantDef`.
1836 /// `variant_did` is the `DefId` that identifies the enum variant (if this `VariantDef`
1837 /// represents an enum variant).
1839 /// `ctor_did` is the `DefId` that identifies the constructor of unit or
1840 /// tuple-variants/structs. If this is a `struct`-variant then this should be `None`.
1842 /// `parent_did` is the `DefId` of the `AdtDef` representing the enum or struct that
1843 /// owns this variant. It is used for checking if a struct has `#[non_exhaustive]` w/out having
1844 /// to go through the redirect of checking the ctor's attributes - but compiling a small crate
1845 /// requires loading the `AdtDef`s for all the structs in the universe (e.g., coherence for any
1846 /// built-in trait), and we do not want to load attributes twice.
1848 /// If someone speeds up attribute loading to not be a performance concern, they can
1849 /// remove this hack and use the constructor `DefId` everywhere.
1851 tcx: TyCtxt<'a, 'gcx, 'tcx>,
1853 variant_did: Option<DefId>,
1854 ctor_def_id: Option<DefId>,
1855 discr: VariantDiscr,
1856 fields: Vec<FieldDef>,
1857 ctor_kind: CtorKind,
1863 "VariantDef::new(ident = {:?}, variant_did = {:?}, ctor_def_id = {:?}, discr = {:?},
1864 fields = {:?}, ctor_kind = {:?}, adt_kind = {:?}, parent_did = {:?})",
1865 ident, variant_did, ctor_def_id, discr, fields, ctor_kind, adt_kind, parent_did,
1868 let mut flags = VariantFlags::NO_VARIANT_FLAGS;
1869 if adt_kind == AdtKind::Struct && tcx.has_attr(parent_did, "non_exhaustive") {
1870 debug!("found non-exhaustive field list for {:?}", parent_did);
1871 flags = flags | VariantFlags::IS_FIELD_LIST_NON_EXHAUSTIVE;
1875 def_id: variant_did.unwrap_or(parent_did),
1886 /// Is this field list non-exhaustive?
1888 pub fn is_field_list_non_exhaustive(&self) -> bool {
1889 self.flags.intersects(VariantFlags::IS_FIELD_LIST_NON_EXHAUSTIVE)
1893 impl_stable_hash_for!(struct VariantDef {
1896 ident -> (ident.name),
1904 #[derive(Copy, Clone, Debug, PartialEq, Eq, RustcEncodable, RustcDecodable, HashStable)]
1905 pub enum VariantDiscr {
1906 /// Explicit value for this variant, i.e., `X = 123`.
1907 /// The `DefId` corresponds to the embedded constant.
1910 /// The previous variant's discriminant plus one.
1911 /// For efficiency reasons, the distance from the
1912 /// last `Explicit` discriminant is being stored,
1913 /// or `0` for the first variant, if it has none.
1917 #[derive(Debug, HashStable)]
1918 pub struct FieldDef {
1920 #[stable_hasher(project(name))]
1922 pub vis: Visibility,
1925 /// The definition of an abstract data type -- a struct or enum.
1927 /// These are all interned (by `intern_adt_def`) into the `adt_defs` table.
1929 /// `DefId` of the struct, enum or union item.
1931 /// Variants of the ADT. If this is a struct or enum, then there will be a single variant.
1932 pub variants: IndexVec<self::layout::VariantIdx, VariantDef>,
1933 /// Flags of the ADT (e.g. is this a struct? is this non-exhaustive?)
1935 /// Repr options provided by the user.
1936 pub repr: ReprOptions,
1939 impl PartialOrd for AdtDef {
1940 fn partial_cmp(&self, other: &AdtDef) -> Option<Ordering> {
1941 Some(self.cmp(&other))
1945 /// There should be only one AdtDef for each `did`, therefore
1946 /// it is fine to implement `Ord` only based on `did`.
1947 impl Ord for AdtDef {
1948 fn cmp(&self, other: &AdtDef) -> Ordering {
1949 self.did.cmp(&other.did)
1953 impl PartialEq for AdtDef {
1954 // AdtDef are always interned and this is part of TyS equality
1956 fn eq(&self, other: &Self) -> bool { ptr::eq(self, other) }
1959 impl Eq for AdtDef {}
1961 impl Hash for AdtDef {
1963 fn hash<H: Hasher>(&self, s: &mut H) {
1964 (self as *const AdtDef).hash(s)
1968 impl<'tcx> serialize::UseSpecializedEncodable for &'tcx AdtDef {
1969 fn default_encode<S: Encoder>(&self, s: &mut S) -> Result<(), S::Error> {
1974 impl<'tcx> serialize::UseSpecializedDecodable for &'tcx AdtDef {}
1977 impl<'a> HashStable<StableHashingContext<'a>> for AdtDef {
1978 fn hash_stable<W: StableHasherResult>(&self,
1979 hcx: &mut StableHashingContext<'a>,
1980 hasher: &mut StableHasher<W>) {
1982 static CACHE: RefCell<FxHashMap<usize, Fingerprint>> = Default::default();
1985 let hash: Fingerprint = CACHE.with(|cache| {
1986 let addr = self as *const AdtDef as usize;
1987 *cache.borrow_mut().entry(addr).or_insert_with(|| {
1995 let mut hasher = StableHasher::new();
1996 did.hash_stable(hcx, &mut hasher);
1997 variants.hash_stable(hcx, &mut hasher);
1998 flags.hash_stable(hcx, &mut hasher);
1999 repr.hash_stable(hcx, &mut hasher);
2005 hash.hash_stable(hcx, hasher);
2009 #[derive(Copy, Clone, Debug, Eq, PartialEq, Hash)]
2010 pub enum AdtKind { Struct, Union, Enum }
2012 impl Into<DataTypeKind> for AdtKind {
2013 fn into(self) -> DataTypeKind {
2015 AdtKind::Struct => DataTypeKind::Struct,
2016 AdtKind::Union => DataTypeKind::Union,
2017 AdtKind::Enum => DataTypeKind::Enum,
2023 #[derive(RustcEncodable, RustcDecodable, Default)]
2024 pub struct ReprFlags: u8 {
2025 const IS_C = 1 << 0;
2026 const IS_SIMD = 1 << 1;
2027 const IS_TRANSPARENT = 1 << 2;
2028 // Internal only for now. If true, don't reorder fields.
2029 const IS_LINEAR = 1 << 3;
2031 // Any of these flags being set prevent field reordering optimisation.
2032 const IS_UNOPTIMISABLE = ReprFlags::IS_C.bits |
2033 ReprFlags::IS_SIMD.bits |
2034 ReprFlags::IS_LINEAR.bits;
2038 impl_stable_hash_for!(struct ReprFlags {
2042 /// Represents the repr options provided by the user,
2043 #[derive(Copy, Clone, Debug, Eq, PartialEq, RustcEncodable, RustcDecodable, Default)]
2044 pub struct ReprOptions {
2045 pub int: Option<attr::IntType>,
2048 pub flags: ReprFlags,
2051 impl_stable_hash_for!(struct ReprOptions {
2059 pub fn new(tcx: TyCtxt<'_, '_, '_>, did: DefId) -> ReprOptions {
2060 let mut flags = ReprFlags::empty();
2061 let mut size = None;
2062 let mut max_align = 0;
2063 let mut min_pack = 0;
2064 for attr in tcx.get_attrs(did).iter() {
2065 for r in attr::find_repr_attrs(&tcx.sess.parse_sess, attr) {
2066 flags.insert(match r {
2067 attr::ReprC => ReprFlags::IS_C,
2068 attr::ReprPacked(pack) => {
2069 min_pack = if min_pack > 0 {
2070 cmp::min(pack, min_pack)
2076 attr::ReprTransparent => ReprFlags::IS_TRANSPARENT,
2077 attr::ReprSimd => ReprFlags::IS_SIMD,
2078 attr::ReprInt(i) => {
2082 attr::ReprAlign(align) => {
2083 max_align = cmp::max(align, max_align);
2090 // This is here instead of layout because the choice must make it into metadata.
2091 if !tcx.consider_optimizing(|| format!("Reorder fields of {:?}", tcx.def_path_str(did))) {
2092 flags.insert(ReprFlags::IS_LINEAR);
2094 ReprOptions { int: size, align: max_align, pack: min_pack, flags: flags }
2098 pub fn simd(&self) -> bool { self.flags.contains(ReprFlags::IS_SIMD) }
2100 pub fn c(&self) -> bool { self.flags.contains(ReprFlags::IS_C) }
2102 pub fn packed(&self) -> bool { self.pack > 0 }
2104 pub fn transparent(&self) -> bool { self.flags.contains(ReprFlags::IS_TRANSPARENT) }
2106 pub fn linear(&self) -> bool { self.flags.contains(ReprFlags::IS_LINEAR) }
2108 pub fn discr_type(&self) -> attr::IntType {
2109 self.int.unwrap_or(attr::SignedInt(ast::IntTy::Isize))
2112 /// Returns `true` if this `#[repr()]` should inhabit "smart enum
2113 /// layout" optimizations, such as representing `Foo<&T>` as a
2115 pub fn inhibit_enum_layout_opt(&self) -> bool {
2116 self.c() || self.int.is_some()
2119 /// Returns `true` if this `#[repr()]` should inhibit struct field reordering
2120 /// optimizations, such as with `repr(C)`, `repr(packed(1))`, or `repr(<int>)`.
2121 pub fn inhibit_struct_field_reordering_opt(&self) -> bool {
2122 self.flags.intersects(ReprFlags::IS_UNOPTIMISABLE) || self.pack == 1 ||
2126 /// Returns `true` if this `#[repr()]` should inhibit union ABI optimisations.
2127 pub fn inhibit_union_abi_opt(&self) -> bool {
2133 impl<'a, 'gcx, 'tcx> AdtDef {
2134 /// Creates a new `AdtDef`.
2136 tcx: TyCtxt<'_, '_, '_>,
2139 variants: IndexVec<VariantIdx, VariantDef>,
2142 debug!("AdtDef::new({:?}, {:?}, {:?}, {:?})", did, kind, variants, repr);
2143 let mut flags = AdtFlags::NO_ADT_FLAGS;
2145 if kind == AdtKind::Enum && tcx.has_attr(did, "non_exhaustive") {
2146 debug!("found non-exhaustive variant list for {:?}", did);
2147 flags = flags | AdtFlags::IS_VARIANT_LIST_NON_EXHAUSTIVE;
2149 flags |= match kind {
2150 AdtKind::Enum => AdtFlags::IS_ENUM,
2151 AdtKind::Union => AdtFlags::IS_UNION,
2152 AdtKind::Struct => AdtFlags::IS_STRUCT,
2155 if kind == AdtKind::Struct && variants[VariantIdx::new(0)].ctor_def_id.is_some() {
2156 flags |= AdtFlags::HAS_CTOR;
2159 let attrs = tcx.get_attrs(did);
2160 if attr::contains_name(&attrs, "fundamental") {
2161 flags |= AdtFlags::IS_FUNDAMENTAL;
2163 if Some(did) == tcx.lang_items().phantom_data() {
2164 flags |= AdtFlags::IS_PHANTOM_DATA;
2166 if Some(did) == tcx.lang_items().owned_box() {
2167 flags |= AdtFlags::IS_BOX;
2169 if Some(did) == tcx.lang_items().arc() {
2170 flags |= AdtFlags::IS_ARC;
2172 if Some(did) == tcx.lang_items().rc() {
2173 flags |= AdtFlags::IS_RC;
2184 /// Returns `true` if this is a struct.
2186 pub fn is_struct(&self) -> bool {
2187 self.flags.contains(AdtFlags::IS_STRUCT)
2190 /// Returns `true` if this is a union.
2192 pub fn is_union(&self) -> bool {
2193 self.flags.contains(AdtFlags::IS_UNION)
2196 /// Returns `true` if this is a enum.
2198 pub fn is_enum(&self) -> bool {
2199 self.flags.contains(AdtFlags::IS_ENUM)
2202 /// Returns `true` if the variant list of this ADT is `#[non_exhaustive]`.
2204 pub fn is_variant_list_non_exhaustive(&self) -> bool {
2205 self.flags.contains(AdtFlags::IS_VARIANT_LIST_NON_EXHAUSTIVE)
2208 /// Returns the kind of the ADT.
2210 pub fn adt_kind(&self) -> AdtKind {
2213 } else if self.is_union() {
2220 /// Returns a description of this abstract data type.
2221 pub fn descr(&self) -> &'static str {
2222 match self.adt_kind() {
2223 AdtKind::Struct => "struct",
2224 AdtKind::Union => "union",
2225 AdtKind::Enum => "enum",
2229 /// Returns a description of a variant of this abstract data type.
2231 pub fn variant_descr(&self) -> &'static str {
2232 match self.adt_kind() {
2233 AdtKind::Struct => "struct",
2234 AdtKind::Union => "union",
2235 AdtKind::Enum => "variant",
2239 /// If this function returns `true`, it implies that `is_struct` must return `true`.
2241 pub fn has_ctor(&self) -> bool {
2242 self.flags.contains(AdtFlags::HAS_CTOR)
2245 /// Returns `true` if this type is `#[fundamental]` for the purposes
2246 /// of coherence checking.
2248 pub fn is_fundamental(&self) -> bool {
2249 self.flags.contains(AdtFlags::IS_FUNDAMENTAL)
2252 /// Returns `true` if this is `PhantomData<T>`.
2254 pub fn is_phantom_data(&self) -> bool {
2255 self.flags.contains(AdtFlags::IS_PHANTOM_DATA)
2258 /// Returns `true` if this is `Arc<T>`.
2259 pub fn is_arc(&self) -> bool {
2260 self.flags.contains(AdtFlags::IS_ARC)
2263 /// Returns `true` if this is `Rc<T>`.
2264 pub fn is_rc(&self) -> bool {
2265 self.flags.contains(AdtFlags::IS_RC)
2268 /// Returns `true` if this is Box<T>.
2270 pub fn is_box(&self) -> bool {
2271 self.flags.contains(AdtFlags::IS_BOX)
2274 /// Returns `true` if this type has a destructor.
2275 pub fn has_dtor(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> bool {
2276 self.destructor(tcx).is_some()
2279 /// Asserts this is a struct or union and returns its unique variant.
2280 pub fn non_enum_variant(&self) -> &VariantDef {
2281 assert!(self.is_struct() || self.is_union());
2282 &self.variants[VariantIdx::new(0)]
2286 pub fn predicates(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Lrc<GenericPredicates<'gcx>> {
2287 tcx.predicates_of(self.did)
2290 /// Returns an iterator over all fields contained
2293 pub fn all_fields<'s>(&'s self) -> impl Iterator<Item = &'s FieldDef> {
2294 self.variants.iter().flat_map(|v| v.fields.iter())
2297 pub fn is_payloadfree(&self) -> bool {
2298 !self.variants.is_empty() &&
2299 self.variants.iter().all(|v| v.fields.is_empty())
2302 pub fn variant_with_id(&self, vid: DefId) -> &VariantDef {
2303 self.variants.iter().find(|v| v.def_id == vid)
2304 .expect("variant_with_id: unknown variant")
2307 pub fn variant_with_ctor_id(&self, cid: DefId) -> &VariantDef {
2308 self.variants.iter().find(|v| v.ctor_def_id == Some(cid))
2309 .expect("variant_with_ctor_id: unknown variant")
2312 pub fn variant_index_with_id(&self, vid: DefId) -> VariantIdx {
2313 self.variants.iter_enumerated().find(|(_, v)| v.def_id == vid)
2314 .expect("variant_index_with_id: unknown variant").0
2317 pub fn variant_index_with_ctor_id(&self, cid: DefId) -> VariantIdx {
2318 self.variants.iter_enumerated().find(|(_, v)| v.ctor_def_id == Some(cid))
2319 .expect("variant_index_with_ctor_id: unknown variant").0
2322 pub fn variant_of_def(&self, def: Def) -> &VariantDef {
2324 Def::Variant(vid) => self.variant_with_id(vid),
2325 Def::Ctor(cid, ..) => self.variant_with_ctor_id(cid),
2326 Def::Struct(..) | Def::Union(..) |
2327 Def::TyAlias(..) | Def::AssociatedTy(..) | Def::SelfTy(..) |
2328 Def::SelfCtor(..) => self.non_enum_variant(),
2329 _ => bug!("unexpected def {:?} in variant_of_def", def)
2334 pub fn eval_explicit_discr(
2336 tcx: TyCtxt<'a, 'gcx, 'tcx>,
2338 ) -> Option<Discr<'tcx>> {
2339 let param_env = ParamEnv::empty();
2340 let repr_type = self.repr.discr_type();
2341 let substs = InternalSubsts::identity_for_item(tcx.global_tcx(), expr_did);
2342 let instance = ty::Instance::new(expr_did, substs);
2343 let cid = GlobalId {
2347 match tcx.const_eval(param_env.and(cid)) {
2349 // FIXME: Find the right type and use it instead of `val.ty` here
2350 if let Some(b) = val.assert_bits(tcx.global_tcx(), param_env.and(val.ty)) {
2351 trace!("discriminants: {} ({:?})", b, repr_type);
2357 info!("invalid enum discriminant: {:#?}", val);
2358 crate::mir::interpret::struct_error(
2359 tcx.at(tcx.def_span(expr_did)),
2360 "constant evaluation of enum discriminant resulted in non-integer",
2365 Err(ErrorHandled::Reported) => {
2366 if !expr_did.is_local() {
2367 span_bug!(tcx.def_span(expr_did),
2368 "variant discriminant evaluation succeeded \
2369 in its crate but failed locally");
2373 Err(ErrorHandled::TooGeneric) => span_bug!(
2374 tcx.def_span(expr_did),
2375 "enum discriminant depends on generic arguments",
2381 pub fn discriminants(
2383 tcx: TyCtxt<'a, 'gcx, 'tcx>,
2384 ) -> impl Iterator<Item=(VariantIdx, Discr<'tcx>)> + Captures<'gcx> + 'a {
2385 let repr_type = self.repr.discr_type();
2386 let initial = repr_type.initial_discriminant(tcx.global_tcx());
2387 let mut prev_discr = None::<Discr<'tcx>>;
2388 self.variants.iter_enumerated().map(move |(i, v)| {
2389 let mut discr = prev_discr.map_or(initial, |d| d.wrap_incr(tcx));
2390 if let VariantDiscr::Explicit(expr_did) = v.discr {
2391 if let Some(new_discr) = self.eval_explicit_discr(tcx, expr_did) {
2395 prev_discr = Some(discr);
2401 /// Computes the discriminant value used by a specific variant.
2402 /// Unlike `discriminants`, this is (amortized) constant-time,
2403 /// only doing at most one query for evaluating an explicit
2404 /// discriminant (the last one before the requested variant),
2405 /// assuming there are no constant-evaluation errors there.
2406 pub fn discriminant_for_variant(&self,
2407 tcx: TyCtxt<'a, 'gcx, 'tcx>,
2408 variant_index: VariantIdx)
2410 let (val, offset) = self.discriminant_def_for_variant(variant_index);
2411 let explicit_value = val
2412 .and_then(|expr_did| self.eval_explicit_discr(tcx, expr_did))
2413 .unwrap_or_else(|| self.repr.discr_type().initial_discriminant(tcx.global_tcx()));
2414 explicit_value.checked_add(tcx, offset as u128).0
2417 /// Yields a `DefId` for the discriminant and an offset to add to it
2418 /// Alternatively, if there is no explicit discriminant, returns the
2419 /// inferred discriminant directly.
2420 pub fn discriminant_def_for_variant(
2422 variant_index: VariantIdx,
2423 ) -> (Option<DefId>, u32) {
2424 let mut explicit_index = variant_index.as_u32();
2427 match self.variants[VariantIdx::from_u32(explicit_index)].discr {
2428 ty::VariantDiscr::Relative(0) => {
2432 ty::VariantDiscr::Relative(distance) => {
2433 explicit_index -= distance;
2435 ty::VariantDiscr::Explicit(did) => {
2436 expr_did = Some(did);
2441 (expr_did, variant_index.as_u32() - explicit_index)
2444 pub fn destructor(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Destructor> {
2445 tcx.adt_destructor(self.did)
2448 /// Returns a list of types such that `Self: Sized` if and only
2449 /// if that type is `Sized`, or `TyErr` if this type is recursive.
2451 /// Oddly enough, checking that the sized-constraint is `Sized` is
2452 /// actually more expressive than checking all members:
2453 /// the `Sized` trait is inductive, so an associated type that references
2454 /// `Self` would prevent its containing ADT from being `Sized`.
2456 /// Due to normalization being eager, this applies even if
2457 /// the associated type is behind a pointer (e.g., issue #31299).
2458 pub fn sized_constraint(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> &'tcx [Ty<'tcx>] {
2459 tcx.adt_sized_constraint(self.did).0
2462 fn sized_constraint_for_ty(&self,
2463 tcx: TyCtxt<'a, 'tcx, 'tcx>,
2466 let result = match ty.sty {
2467 Bool | Char | Int(..) | Uint(..) | Float(..) |
2468 RawPtr(..) | Ref(..) | FnDef(..) | FnPtr(_) |
2469 Array(..) | Closure(..) | Generator(..) | Never => {
2478 GeneratorWitness(..) => {
2479 // these are never sized - return the target type
2486 Some(ty) => self.sized_constraint_for_ty(tcx, ty)
2490 Adt(adt, substs) => {
2492 let adt_tys = adt.sized_constraint(tcx);
2493 debug!("sized_constraint_for_ty({:?}) intermediate = {:?}",
2496 .map(|ty| ty.subst(tcx, substs))
2497 .flat_map(|ty| self.sized_constraint_for_ty(tcx, ty))
2501 Projection(..) | Opaque(..) => {
2502 // must calculate explicitly.
2503 // FIXME: consider special-casing always-Sized projections
2507 UnnormalizedProjection(..) => bug!("only used with chalk-engine"),
2510 // perf hack: if there is a `T: Sized` bound, then
2511 // we know that `T` is Sized and do not need to check
2514 let sized_trait = match tcx.lang_items().sized_trait() {
2516 _ => return vec![ty]
2518 let sized_predicate = Binder::dummy(TraitRef {
2519 def_id: sized_trait,
2520 substs: tcx.mk_substs_trait(ty, &[])
2522 let predicates = &tcx.predicates_of(self.did).predicates;
2523 if predicates.iter().any(|(p, _)| *p == sized_predicate) {
2533 bug!("unexpected type `{:?}` in sized_constraint_for_ty",
2537 debug!("sized_constraint_for_ty({:?}) = {:?}", ty, result);
2542 impl<'a, 'gcx, 'tcx> FieldDef {
2543 pub fn ty(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>, subst: SubstsRef<'tcx>) -> Ty<'tcx> {
2544 tcx.type_of(self.did).subst(tcx, subst)
2548 /// Represents the various closure traits in the language. This
2549 /// will determine the type of the environment (`self`, in the
2550 /// desugaring) argument that the closure expects.
2552 /// You can get the environment type of a closure using
2553 /// `tcx.closure_env_ty()`.
2554 #[derive(Clone, Copy, PartialOrd, Ord, PartialEq, Eq, Hash, Debug,
2555 RustcEncodable, RustcDecodable, HashStable)]
2556 pub enum ClosureKind {
2557 // Warning: Ordering is significant here! The ordering is chosen
2558 // because the trait Fn is a subtrait of FnMut and so in turn, and
2559 // hence we order it so that Fn < FnMut < FnOnce.
2565 impl<'a, 'tcx> ClosureKind {
2566 // This is the initial value used when doing upvar inference.
2567 pub const LATTICE_BOTTOM: ClosureKind = ClosureKind::Fn;
2569 pub fn trait_did(&self, tcx: TyCtxt<'a, 'tcx, 'tcx>) -> DefId {
2571 ClosureKind::Fn => tcx.require_lang_item(FnTraitLangItem),
2572 ClosureKind::FnMut => {
2573 tcx.require_lang_item(FnMutTraitLangItem)
2575 ClosureKind::FnOnce => {
2576 tcx.require_lang_item(FnOnceTraitLangItem)
2581 /// Returns `true` if this a type that impls this closure kind
2582 /// must also implement `other`.
2583 pub fn extends(self, other: ty::ClosureKind) -> bool {
2584 match (self, other) {
2585 (ClosureKind::Fn, ClosureKind::Fn) => true,
2586 (ClosureKind::Fn, ClosureKind::FnMut) => true,
2587 (ClosureKind::Fn, ClosureKind::FnOnce) => true,
2588 (ClosureKind::FnMut, ClosureKind::FnMut) => true,
2589 (ClosureKind::FnMut, ClosureKind::FnOnce) => true,
2590 (ClosureKind::FnOnce, ClosureKind::FnOnce) => true,
2595 /// Returns the representative scalar type for this closure kind.
2596 /// See `TyS::to_opt_closure_kind` for more details.
2597 pub fn to_ty(self, tcx: TyCtxt<'_, '_, 'tcx>) -> Ty<'tcx> {
2599 ty::ClosureKind::Fn => tcx.types.i8,
2600 ty::ClosureKind::FnMut => tcx.types.i16,
2601 ty::ClosureKind::FnOnce => tcx.types.i32,
2606 impl<'tcx> TyS<'tcx> {
2607 /// Iterator that walks `self` and any types reachable from
2608 /// `self`, in depth-first order. Note that just walks the types
2609 /// that appear in `self`, it does not descend into the fields of
2610 /// structs or variants. For example:
2613 /// isize => { isize }
2614 /// Foo<Bar<isize>> => { Foo<Bar<isize>>, Bar<isize>, isize }
2615 /// [isize] => { [isize], isize }
2617 pub fn walk(&'tcx self) -> TypeWalker<'tcx> {
2618 TypeWalker::new(self)
2621 /// Iterator that walks the immediate children of `self`. Hence
2622 /// `Foo<Bar<i32>, u32>` yields the sequence `[Bar<i32>, u32]`
2623 /// (but not `i32`, like `walk`).
2624 pub fn walk_shallow(&'tcx self) -> smallvec::IntoIter<walk::TypeWalkerArray<'tcx>> {
2625 walk::walk_shallow(self)
2628 /// Walks `ty` and any types appearing within `ty`, invoking the
2629 /// callback `f` on each type. If the callback returns `false`, then the
2630 /// children of the current type are ignored.
2632 /// Note: prefer `ty.walk()` where possible.
2633 pub fn maybe_walk<F>(&'tcx self, mut f: F)
2634 where F: FnMut(Ty<'tcx>) -> bool
2636 let mut walker = self.walk();
2637 while let Some(ty) = walker.next() {
2639 walker.skip_current_subtree();
2646 pub fn from_mutbl(m: hir::Mutability) -> BorrowKind {
2648 hir::MutMutable => MutBorrow,
2649 hir::MutImmutable => ImmBorrow,
2653 /// Returns a mutability `m` such that an `&m T` pointer could be used to obtain this borrow
2654 /// kind. Because borrow kinds are richer than mutabilities, we sometimes have to pick a
2655 /// mutability that is stronger than necessary so that it at least *would permit* the borrow in
2657 pub fn to_mutbl_lossy(self) -> hir::Mutability {
2659 MutBorrow => hir::MutMutable,
2660 ImmBorrow => hir::MutImmutable,
2662 // We have no type corresponding to a unique imm borrow, so
2663 // use `&mut`. It gives all the capabilities of an `&uniq`
2664 // and hence is a safe "over approximation".
2665 UniqueImmBorrow => hir::MutMutable,
2669 pub fn to_user_str(&self) -> &'static str {
2671 MutBorrow => "mutable",
2672 ImmBorrow => "immutable",
2673 UniqueImmBorrow => "uniquely immutable",
2678 #[derive(Debug, Clone)]
2679 pub enum Attributes<'gcx> {
2680 Owned(Lrc<[ast::Attribute]>),
2681 Borrowed(&'gcx [ast::Attribute])
2684 impl<'gcx> ::std::ops::Deref for Attributes<'gcx> {
2685 type Target = [ast::Attribute];
2687 fn deref(&self) -> &[ast::Attribute] {
2689 &Attributes::Owned(ref data) => &data,
2690 &Attributes::Borrowed(data) => data
2695 #[derive(Debug, PartialEq, Eq)]
2696 pub enum ImplOverlapKind {
2697 /// These impls are always allowed to overlap.
2699 /// These impls are allowed to overlap, but that raises
2700 /// an issue #33140 future-compatibility warning.
2702 /// Some background: in Rust 1.0, the trait-object types `Send + Sync` (today's
2703 /// `dyn Send + Sync`) and `Sync + Send` (now `dyn Sync + Send`) were different.
2705 /// The widely-used version 0.1.0 of the crate `traitobject` had accidentally relied
2706 /// that difference, making what reduces to the following set of impls:
2710 /// impl Trait for dyn Send + Sync {}
2711 /// impl Trait for dyn Sync + Send {}
2714 /// Obviously, once we made these types be identical, that code causes a coherence
2715 /// error and a fairly big headache for us. However, luckily for us, the trait
2716 /// `Trait` used in this case is basically a marker trait, and therefore having
2717 /// overlapping impls for it is sound.
2719 /// To handle this, we basically regard the trait as a marker trait, with an additional
2720 /// future-compatibility warning. To avoid accidentally "stabilizing" this feature,
2721 /// it has the following restrictions:
2723 /// 1. The trait must indeed be a marker-like trait (i.e., no items), and must be
2725 /// 2. The trait-ref of both impls must be equal.
2726 /// 3. The trait-ref of both impls must be a trait object type consisting only of
2728 /// 4. Neither of the impls can have any where-clauses.
2730 /// Once `traitobject` 0.1.0 is no longer an active concern, this hack can be removed.
2734 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2735 pub fn body_tables(self, body: hir::BodyId) -> &'gcx TypeckTables<'gcx> {
2736 self.typeck_tables_of(self.hir().body_owner_def_id(body))
2739 /// Returns an iterator of the `DefId`s for all body-owners in this
2740 /// crate. If you would prefer to iterate over the bodies
2741 /// themselves, you can do `self.hir().krate().body_ids.iter()`.
2744 ) -> impl Iterator<Item = DefId> + Captures<'tcx> + Captures<'gcx> + 'a {
2748 .map(move |&body_id| self.hir().body_owner_def_id(body_id))
2751 pub fn par_body_owners<F: Fn(DefId) + sync::Sync + sync::Send>(self, f: F) {
2752 par_iter(&self.hir().krate().body_ids).for_each(|&body_id| {
2753 f(self.hir().body_owner_def_id(body_id))
2757 pub fn expr_span(self, id: NodeId) -> Span {
2758 match self.hir().find(id) {
2759 Some(Node::Expr(e)) => {
2763 bug!("Node id {} is not an expr: {:?}", id, f);
2766 bug!("Node id {} is not present in the node map", id);
2771 pub fn provided_trait_methods(self, id: DefId) -> Vec<AssociatedItem> {
2772 self.associated_items(id)
2773 .filter(|item| item.kind == AssociatedKind::Method && item.defaultness.has_value())
2777 pub fn trait_relevant_for_never(self, did: DefId) -> bool {
2778 self.associated_items(did).any(|item| {
2779 item.relevant_for_never()
2783 pub fn opt_associated_item(self, def_id: DefId) -> Option<AssociatedItem> {
2784 let is_associated_item = if let Some(hir_id) = self.hir().as_local_hir_id(def_id) {
2785 match self.hir().get_by_hir_id(hir_id) {
2786 Node::TraitItem(_) | Node::ImplItem(_) => true,
2790 match self.describe_def(def_id).expect("no def for def-id") {
2791 Def::AssociatedConst(_) | Def::Method(_) | Def::AssociatedTy(_) => true,
2796 if is_associated_item {
2797 Some(self.associated_item(def_id))
2803 fn associated_item_from_trait_item_ref(self,
2804 parent_def_id: DefId,
2805 parent_vis: &hir::Visibility,
2806 trait_item_ref: &hir::TraitItemRef)
2808 let def_id = self.hir().local_def_id_from_hir_id(trait_item_ref.id.hir_id);
2809 let (kind, has_self) = match trait_item_ref.kind {
2810 hir::AssociatedItemKind::Const => (ty::AssociatedKind::Const, false),
2811 hir::AssociatedItemKind::Method { has_self } => {
2812 (ty::AssociatedKind::Method, has_self)
2814 hir::AssociatedItemKind::Type => (ty::AssociatedKind::Type, false),
2815 hir::AssociatedItemKind::Existential => bug!("only impls can have existentials"),
2819 ident: trait_item_ref.ident,
2821 // Visibility of trait items is inherited from their traits.
2822 vis: Visibility::from_hir(parent_vis, trait_item_ref.id.hir_id, self),
2823 defaultness: trait_item_ref.defaultness,
2825 container: TraitContainer(parent_def_id),
2826 method_has_self_argument: has_self
2830 fn associated_item_from_impl_item_ref(self,
2831 parent_def_id: DefId,
2832 impl_item_ref: &hir::ImplItemRef)
2834 let def_id = self.hir().local_def_id_from_hir_id(impl_item_ref.id.hir_id);
2835 let (kind, has_self) = match impl_item_ref.kind {
2836 hir::AssociatedItemKind::Const => (ty::AssociatedKind::Const, false),
2837 hir::AssociatedItemKind::Method { has_self } => {
2838 (ty::AssociatedKind::Method, has_self)
2840 hir::AssociatedItemKind::Type => (ty::AssociatedKind::Type, false),
2841 hir::AssociatedItemKind::Existential => (ty::AssociatedKind::Existential, false),
2845 ident: impl_item_ref.ident,
2847 // Visibility of trait impl items doesn't matter.
2848 vis: ty::Visibility::from_hir(&impl_item_ref.vis, impl_item_ref.id.hir_id, self),
2849 defaultness: impl_item_ref.defaultness,
2851 container: ImplContainer(parent_def_id),
2852 method_has_self_argument: has_self
2856 pub fn field_index(self, hir_id: hir::HirId, tables: &TypeckTables<'_>) -> usize {
2857 tables.field_indices().get(hir_id).cloned().expect("no index for a field")
2860 pub fn find_field_index(self, ident: Ident, variant: &VariantDef) -> Option<usize> {
2861 variant.fields.iter().position(|field| {
2862 self.adjust_ident(ident, variant.def_id, hir::DUMMY_HIR_ID).0 == field.ident.modern()
2866 pub fn associated_items(
2869 ) -> AssociatedItemsIterator<'a, 'gcx, 'tcx> {
2870 // Ideally, we would use `-> impl Iterator` here, but it falls
2871 // afoul of the conservative "capture [restrictions]" we put
2872 // in place, so we use a hand-written iterator.
2874 // [restrictions]: https://github.com/rust-lang/rust/issues/34511#issuecomment-373423999
2875 AssociatedItemsIterator {
2877 def_ids: self.associated_item_def_ids(def_id),
2882 /// Returns `true` if the impls are the same polarity and the trait either
2883 /// has no items or is annotated #[marker] and prevents item overrides.
2884 pub fn impls_are_allowed_to_overlap(self, def_id1: DefId, def_id2: DefId)
2885 -> Option<ImplOverlapKind>
2887 let is_legit = if self.features().overlapping_marker_traits {
2888 let trait1_is_empty = self.impl_trait_ref(def_id1)
2889 .map_or(false, |trait_ref| {
2890 self.associated_item_def_ids(trait_ref.def_id).is_empty()
2892 let trait2_is_empty = self.impl_trait_ref(def_id2)
2893 .map_or(false, |trait_ref| {
2894 self.associated_item_def_ids(trait_ref.def_id).is_empty()
2896 self.impl_polarity(def_id1) == self.impl_polarity(def_id2)
2900 let is_marker_impl = |def_id: DefId| -> bool {
2901 let trait_ref = self.impl_trait_ref(def_id);
2902 trait_ref.map_or(false, |tr| self.trait_def(tr.def_id).is_marker)
2904 self.impl_polarity(def_id1) == self.impl_polarity(def_id2)
2905 && is_marker_impl(def_id1)
2906 && is_marker_impl(def_id2)
2910 debug!("impls_are_allowed_to_overlap({:?}, {:?}) = Some(Permitted)",
2912 Some(ImplOverlapKind::Permitted)
2914 if let Some(self_ty1) = self.issue33140_self_ty(def_id1) {
2915 if let Some(self_ty2) = self.issue33140_self_ty(def_id2) {
2916 if self_ty1 == self_ty2 {
2917 debug!("impls_are_allowed_to_overlap({:?}, {:?}) - issue #33140 HACK",
2919 return Some(ImplOverlapKind::Issue33140);
2921 debug!("impls_are_allowed_to_overlap({:?}, {:?}) - found {:?} != {:?}",
2922 def_id1, def_id2, self_ty1, self_ty2);
2927 debug!("impls_are_allowed_to_overlap({:?}, {:?}) = None",
2933 // Returns `ty::VariantDef` if `def` refers to a struct,
2934 // or variant or their constructors, panics otherwise.
2935 pub fn expect_variant_def(self, def: Def) -> &'tcx VariantDef {
2937 Def::Variant(did) => {
2938 let enum_did = self.parent(did).unwrap();
2939 self.adt_def(enum_did).variant_with_id(did)
2941 Def::Struct(did) | Def::Union(did) => {
2942 self.adt_def(did).non_enum_variant()
2944 Def::Ctor(variant_ctor_did, CtorOf::Variant, ..) => {
2945 let variant_did = self.parent(variant_ctor_did).unwrap();
2946 let enum_did = self.parent(variant_did).unwrap();
2947 self.adt_def(enum_did).variant_with_ctor_id(variant_ctor_did)
2949 Def::Ctor(ctor_did, CtorOf::Struct, ..) => {
2950 let struct_did = self.parent(ctor_did).expect("struct ctor has no parent");
2951 self.adt_def(struct_did).non_enum_variant()
2953 _ => bug!("expect_variant_def used with unexpected def {:?}", def)
2957 pub fn item_name(self, id: DefId) -> InternedString {
2958 if id.index == CRATE_DEF_INDEX {
2959 self.original_crate_name(id.krate).as_interned_str()
2961 let def_key = self.def_key(id);
2962 match def_key.disambiguated_data.data {
2963 // The name of a constructor is that of its parent.
2964 hir_map::DefPathData::Ctor =>
2965 self.item_name(DefId {
2967 index: def_key.parent.unwrap()
2969 _ => def_key.disambiguated_data.data.get_opt_name().unwrap_or_else(|| {
2970 bug!("item_name: no name for {:?}", self.def_path(id));
2976 /// Returns the possibly-auto-generated MIR of a `(DefId, Subst)` pair.
2977 pub fn instance_mir(self, instance: ty::InstanceDef<'gcx>)
2981 ty::InstanceDef::Item(did) => {
2982 self.optimized_mir(did)
2984 ty::InstanceDef::VtableShim(..) |
2985 ty::InstanceDef::Intrinsic(..) |
2986 ty::InstanceDef::FnPtrShim(..) |
2987 ty::InstanceDef::Virtual(..) |
2988 ty::InstanceDef::ClosureOnceShim { .. } |
2989 ty::InstanceDef::DropGlue(..) |
2990 ty::InstanceDef::CloneShim(..) => {
2991 self.mir_shims(instance)
2996 /// Gets the attributes of a definition.
2997 pub fn get_attrs(self, did: DefId) -> Attributes<'gcx> {
2998 if let Some(id) = self.hir().as_local_hir_id(did) {
2999 Attributes::Borrowed(self.hir().attrs_by_hir_id(id))
3001 Attributes::Owned(self.item_attrs(did))
3005 /// Determines whether an item is annotated with an attribute.
3006 pub fn has_attr(self, did: DefId, attr: &str) -> bool {
3007 attr::contains_name(&self.get_attrs(did), attr)
3010 /// Returns `true` if this is an `auto trait`.
3011 pub fn trait_is_auto(self, trait_def_id: DefId) -> bool {
3012 self.trait_def(trait_def_id).has_auto_impl
3015 pub fn generator_layout(self, def_id: DefId) -> &'tcx GeneratorLayout<'tcx> {
3016 self.optimized_mir(def_id).generator_layout.as_ref().unwrap()
3019 /// Given the `DefId` of an impl, returns the `DefId` of the trait it implements.
3020 /// If it implements no trait, returns `None`.
3021 pub fn trait_id_of_impl(self, def_id: DefId) -> Option<DefId> {
3022 self.impl_trait_ref(def_id).map(|tr| tr.def_id)
3025 /// If the given defid describes a method belonging to an impl, returns the
3026 /// `DefId` of the impl that the method belongs to; otherwise, returns `None`.
3027 pub fn impl_of_method(self, def_id: DefId) -> Option<DefId> {
3028 let item = if def_id.krate != LOCAL_CRATE {
3029 if let Some(Def::Method(_)) = self.describe_def(def_id) {
3030 Some(self.associated_item(def_id))
3035 self.opt_associated_item(def_id)
3038 item.and_then(|trait_item|
3039 match trait_item.container {
3040 TraitContainer(_) => None,
3041 ImplContainer(def_id) => Some(def_id),
3046 /// Looks up the span of `impl_did` if the impl is local; otherwise returns `Err`
3047 /// with the name of the crate containing the impl.
3048 pub fn span_of_impl(self, impl_did: DefId) -> Result<Span, Symbol> {
3049 if impl_did.is_local() {
3050 let hir_id = self.hir().as_local_hir_id(impl_did).unwrap();
3051 Ok(self.hir().span_by_hir_id(hir_id))
3053 Err(self.crate_name(impl_did.krate))
3057 /// Hygienically compares a use-site name (`use_name`) for a field or an associated item with
3058 /// its supposed definition name (`def_name`). The method also needs `DefId` of the supposed
3059 /// definition's parent/scope to perform comparison.
3060 pub fn hygienic_eq(self, use_name: Ident, def_name: Ident, def_parent_def_id: DefId) -> bool {
3061 self.adjust_ident(use_name, def_parent_def_id, hir::DUMMY_HIR_ID).0 == def_name.modern()
3064 pub fn adjust_ident(self, mut ident: Ident, scope: DefId, block: hir::HirId) -> (Ident, DefId) {
3065 ident = ident.modern();
3066 let target_expansion = match scope.krate {
3067 LOCAL_CRATE => self.hir().definitions().expansion_that_defined(scope.index),
3070 let scope = match ident.span.adjust(target_expansion) {
3071 Some(actual_expansion) =>
3072 self.hir().definitions().parent_module_of_macro_def(actual_expansion),
3073 None if block == hir::DUMMY_HIR_ID => DefId::local(CRATE_DEF_INDEX), // Dummy DefId
3074 None => self.hir().get_module_parent_by_hir_id(block),
3080 pub struct AssociatedItemsIterator<'a, 'gcx: 'tcx, 'tcx: 'a> {
3081 tcx: TyCtxt<'a, 'gcx, 'tcx>,
3082 def_ids: Lrc<Vec<DefId>>,
3086 impl Iterator for AssociatedItemsIterator<'_, '_, '_> {
3087 type Item = AssociatedItem;
3089 fn next(&mut self) -> Option<AssociatedItem> {
3090 let def_id = self.def_ids.get(self.next_index)?;
3091 self.next_index += 1;
3092 Some(self.tcx.associated_item(*def_id))
3096 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
3097 pub fn with_freevars<T, F>(self, fid: HirId, f: F) -> T where
3098 F: FnOnce(&[hir::Freevar]) -> T,
3100 let def_id = self.hir().local_def_id_from_hir_id(fid);
3101 match self.freevars(def_id) {
3108 fn associated_item<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, def_id: DefId) -> AssociatedItem {
3109 let id = tcx.hir().as_local_hir_id(def_id).unwrap();
3110 let parent_id = tcx.hir().get_parent_item(id);
3111 let parent_def_id = tcx.hir().local_def_id_from_hir_id(parent_id);
3112 let parent_item = tcx.hir().expect_item_by_hir_id(parent_id);
3113 match parent_item.node {
3114 hir::ItemKind::Impl(.., ref impl_item_refs) => {
3115 if let Some(impl_item_ref) = impl_item_refs.iter().find(|i| i.id.hir_id == id) {
3116 let assoc_item = tcx.associated_item_from_impl_item_ref(parent_def_id,
3118 debug_assert_eq!(assoc_item.def_id, def_id);
3123 hir::ItemKind::Trait(.., ref trait_item_refs) => {
3124 if let Some(trait_item_ref) = trait_item_refs.iter().find(|i| i.id.hir_id == id) {
3125 let assoc_item = tcx.associated_item_from_trait_item_ref(parent_def_id,
3128 debug_assert_eq!(assoc_item.def_id, def_id);
3136 span_bug!(parent_item.span,
3137 "unexpected parent of trait or impl item or item not found: {:?}",
3141 #[derive(Clone, HashStable)]
3142 pub struct AdtSizedConstraint<'tcx>(pub &'tcx [Ty<'tcx>]);
3144 /// Calculates the `Sized` constraint.
3146 /// In fact, there are only a few options for the types in the constraint:
3147 /// - an obviously-unsized type
3148 /// - a type parameter or projection whose Sizedness can't be known
3149 /// - a tuple of type parameters or projections, if there are multiple
3151 /// - a Error, if a type contained itself. The representability
3152 /// check should catch this case.
3153 fn adt_sized_constraint<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3155 -> AdtSizedConstraint<'tcx> {
3156 let def = tcx.adt_def(def_id);
3158 let result = tcx.mk_type_list(def.variants.iter().flat_map(|v| {
3161 def.sized_constraint_for_ty(tcx, tcx.type_of(f.did))
3164 debug!("adt_sized_constraint: {:?} => {:?}", def, result);
3166 AdtSizedConstraint(result)
3169 fn associated_item_def_ids<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3171 -> Lrc<Vec<DefId>> {
3172 let id = tcx.hir().as_local_hir_id(def_id).unwrap();
3173 let item = tcx.hir().expect_item_by_hir_id(id);
3174 let vec: Vec<_> = match item.node {
3175 hir::ItemKind::Trait(.., ref trait_item_refs) => {
3176 trait_item_refs.iter()
3177 .map(|trait_item_ref| trait_item_ref.id)
3178 .map(|id| tcx.hir().local_def_id_from_hir_id(id.hir_id))
3181 hir::ItemKind::Impl(.., ref impl_item_refs) => {
3182 impl_item_refs.iter()
3183 .map(|impl_item_ref| impl_item_ref.id)
3184 .map(|id| tcx.hir().local_def_id_from_hir_id(id.hir_id))
3187 hir::ItemKind::TraitAlias(..) => vec![],
3188 _ => span_bug!(item.span, "associated_item_def_ids: not impl or trait")
3193 fn def_span<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, def_id: DefId) -> Span {
3194 tcx.hir().span_if_local(def_id).unwrap()
3197 /// If the given `DefId` describes an item belonging to a trait,
3198 /// returns the `DefId` of the trait that the trait item belongs to;
3199 /// otherwise, returns `None`.
3200 fn trait_of_item<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, def_id: DefId) -> Option<DefId> {
3201 tcx.opt_associated_item(def_id)
3202 .and_then(|associated_item| {
3203 match associated_item.container {
3204 TraitContainer(def_id) => Some(def_id),
3205 ImplContainer(_) => None
3210 /// Yields the parent function's `DefId` if `def_id` is an `impl Trait` definition.
3211 pub fn is_impl_trait_defn(tcx: TyCtxt<'_, '_, '_>, def_id: DefId) -> Option<DefId> {
3212 if let Some(hir_id) = tcx.hir().as_local_hir_id(def_id) {
3213 if let Node::Item(item) = tcx.hir().get_by_hir_id(hir_id) {
3214 if let hir::ItemKind::Existential(ref exist_ty) = item.node {
3215 return exist_ty.impl_trait_fn;
3222 /// See `ParamEnv` struct definition for details.
3223 fn param_env<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3227 // The param_env of an impl Trait type is its defining function's param_env
3228 if let Some(parent) = is_impl_trait_defn(tcx, def_id) {
3229 return param_env(tcx, parent);
3231 // Compute the bounds on Self and the type parameters.
3233 let InstantiatedPredicates { predicates } =
3234 tcx.predicates_of(def_id).instantiate_identity(tcx);
3236 // Finally, we have to normalize the bounds in the environment, in
3237 // case they contain any associated type projections. This process
3238 // can yield errors if the put in illegal associated types, like
3239 // `<i32 as Foo>::Bar` where `i32` does not implement `Foo`. We
3240 // report these errors right here; this doesn't actually feel
3241 // right to me, because constructing the environment feels like a
3242 // kind of a "idempotent" action, but I'm not sure where would be
3243 // a better place. In practice, we construct environments for
3244 // every fn once during type checking, and we'll abort if there
3245 // are any errors at that point, so after type checking you can be
3246 // sure that this will succeed without errors anyway.
3248 let unnormalized_env = ty::ParamEnv::new(
3249 tcx.intern_predicates(&predicates),
3250 traits::Reveal::UserFacing,
3251 if tcx.sess.opts.debugging_opts.chalk { Some(def_id) } else { None }
3254 let body_id = tcx.hir().as_local_hir_id(def_id).map_or(hir::DUMMY_HIR_ID, |id| {
3255 tcx.hir().maybe_body_owned_by_by_hir_id(id).map_or(id, |body| body.hir_id)
3257 let cause = traits::ObligationCause::misc(tcx.def_span(def_id), body_id);
3258 traits::normalize_param_env_or_error(tcx, def_id, unnormalized_env, cause)
3261 fn crate_disambiguator<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3262 crate_num: CrateNum) -> CrateDisambiguator {
3263 assert_eq!(crate_num, LOCAL_CRATE);
3264 tcx.sess.local_crate_disambiguator()
3267 fn original_crate_name<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3268 crate_num: CrateNum) -> Symbol {
3269 assert_eq!(crate_num, LOCAL_CRATE);
3270 tcx.crate_name.clone()
3273 fn crate_hash<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3274 crate_num: CrateNum)
3276 assert_eq!(crate_num, LOCAL_CRATE);
3277 tcx.hir().crate_hash
3280 fn instance_def_size_estimate<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3281 instance_def: InstanceDef<'tcx>)
3283 match instance_def {
3284 InstanceDef::Item(..) |
3285 InstanceDef::DropGlue(..) => {
3286 let mir = tcx.instance_mir(instance_def);
3287 mir.basic_blocks().iter().map(|bb| bb.statements.len()).sum()
3289 // Estimate the size of other compiler-generated shims to be 1.
3294 /// If `def_id` is an issue 33140 hack impl, returns its self type; otherwise, returns `None`.
3296 /// See [`ImplOverlapKind::Issue33140`] for more details.
3297 fn issue33140_self_ty<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3301 debug!("issue33140_self_ty({:?})", def_id);
3303 let trait_ref = tcx.impl_trait_ref(def_id).unwrap_or_else(|| {
3304 bug!("issue33140_self_ty called on inherent impl {:?}", def_id)
3307 debug!("issue33140_self_ty({:?}), trait-ref={:?}", def_id, trait_ref);
3309 let is_marker_like =
3310 tcx.impl_polarity(def_id) == hir::ImplPolarity::Positive &&
3311 tcx.associated_item_def_ids(trait_ref.def_id).is_empty();
3313 // Check whether these impls would be ok for a marker trait.
3314 if !is_marker_like {
3315 debug!("issue33140_self_ty - not marker-like!");
3319 // impl must be `impl Trait for dyn Marker1 + Marker2 + ...`
3320 if trait_ref.substs.len() != 1 {
3321 debug!("issue33140_self_ty - impl has substs!");
3325 let predicates = tcx.predicates_of(def_id);
3326 if predicates.parent.is_some() || !predicates.predicates.is_empty() {
3327 debug!("issue33140_self_ty - impl has predicates {:?}!", predicates);
3331 let self_ty = trait_ref.self_ty();
3332 let self_ty_matches = match self_ty.sty {
3333 ty::Dynamic(ref data, ty::ReStatic) => data.principal().is_none(),
3337 if self_ty_matches {
3338 debug!("issue33140_self_ty - MATCHES!");
3341 debug!("issue33140_self_ty - non-matching self type");
3346 pub fn provide(providers: &mut ty::query::Providers<'_>) {
3347 context::provide(providers);
3348 erase_regions::provide(providers);
3349 layout::provide(providers);
3350 util::provide(providers);
3351 constness::provide(providers);
3352 *providers = ty::query::Providers {
3354 associated_item_def_ids,
3355 adt_sized_constraint,
3359 crate_disambiguator,
3360 original_crate_name,
3362 trait_impls_of: trait_def::trait_impls_of_provider,
3363 instance_def_size_estimate,
3369 /// A map for the local crate mapping each type to a vector of its
3370 /// inherent impls. This is not meant to be used outside of coherence;
3371 /// rather, you should request the vector for a specific type via
3372 /// `tcx.inherent_impls(def_id)` so as to minimize your dependencies
3373 /// (constructing this map requires touching the entire crate).
3374 #[derive(Clone, Debug, Default, HashStable)]
3375 pub struct CrateInherentImpls {
3376 pub inherent_impls: DefIdMap<Lrc<Vec<DefId>>>,
3379 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, RustcEncodable, RustcDecodable)]
3380 pub struct SymbolName {
3381 // FIXME: we don't rely on interning or equality here - better have
3382 // this be a `&'tcx str`.
3383 pub name: InternedString
3386 impl_stable_hash_for!(struct self::SymbolName {
3391 pub fn new(name: &str) -> SymbolName {
3393 name: Symbol::intern(name).as_interned_str()
3397 pub fn as_str(&self) -> LocalInternedString {
3402 impl fmt::Display for SymbolName {
3403 fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
3404 fmt::Display::fmt(&self.name, fmt)
3408 impl fmt::Debug for SymbolName {
3409 fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
3410 fmt::Display::fmt(&self.name, fmt)