1 // Copyright 2012-2015 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 pub use self::Variance::*;
12 pub use self::AssociatedItemContainer::*;
13 pub use self::BorrowKind::*;
14 pub use self::IntVarValue::*;
15 pub use self::fold::TypeFoldable;
17 use hir::{map as hir_map, FreevarMap, TraitMap};
19 use hir::def::{Def, CtorKind, ExportMap};
20 use hir::def_id::{CrateNum, DefId, LocalDefId, CRATE_DEF_INDEX, LOCAL_CRATE};
21 use hir::map::DefPathData;
22 use rustc_data_structures::svh::Svh;
24 use ich::StableHashingContext;
25 use infer::canonical::Canonical;
26 use middle::lang_items::{FnTraitLangItem, FnMutTraitLangItem, FnOnceTraitLangItem};
27 use middle::privacy::AccessLevels;
28 use middle::resolve_lifetime::ObjectLifetimeDefault;
30 use mir::interpret::GlobalId;
31 use mir::GeneratorLayout;
32 use session::CrateDisambiguator;
33 use traits::{self, Reveal};
35 use ty::subst::{Subst, Substs};
36 use ty::util::{IntTypeExt, Discr};
37 use ty::walk::TypeWalker;
38 use util::captures::Captures;
39 use util::nodemap::{NodeSet, DefIdMap, FxHashMap};
40 use arena::SyncDroplessArena;
41 use session::DataTypeKind;
43 use serialize::{self, Encodable, Encoder};
44 use std::cell::RefCell;
45 use std::cmp::{self, Ordering};
47 use std::hash::{Hash, Hasher};
49 use rustc_data_structures::sync::{self, Lrc, ParallelIterator, par_iter};
51 use std::vec::IntoIter;
53 use syntax::ast::{self, DUMMY_NODE_ID, Name, Ident, NodeId};
55 use syntax::ext::hygiene::Mark;
56 use syntax::symbol::{keywords, Symbol, LocalInternedString, InternedString};
57 use syntax_pos::{DUMMY_SP, Span};
60 use rustc_data_structures::stable_hasher::{StableHasher, StableHasherResult,
65 pub use self::sty::{Binder, CanonicalVar, DebruijnIndex, INNERMOST};
66 pub use self::sty::{FnSig, GenSig, PolyFnSig, PolyGenSig};
67 pub use self::sty::{InferTy, ParamTy, ProjectionTy, ExistentialPredicate};
68 pub use self::sty::{ClosureSubsts, GeneratorSubsts, UpvarSubsts, TypeAndMut};
69 pub use self::sty::{TraitRef, TyKind, PolyTraitRef};
70 pub use self::sty::{ExistentialTraitRef, PolyExistentialTraitRef};
71 pub use self::sty::{ExistentialProjection, PolyExistentialProjection, Const};
72 pub use self::sty::{BoundRegion, EarlyBoundRegion, FreeRegion, Region};
73 pub use self::sty::RegionKind;
74 pub use self::sty::{TyVid, IntVid, FloatVid, RegionVid};
75 pub use self::sty::BoundRegion::*;
76 pub use self::sty::InferTy::*;
77 pub use self::sty::RegionKind::*;
78 pub use self::sty::TyKind::*;
80 pub use self::binding::BindingMode;
81 pub use self::binding::BindingMode::*;
83 pub use self::context::{TyCtxt, FreeRegionInfo, GlobalArenas, AllArenas, tls, keep_local};
84 pub use self::context::{Lift, TypeckTables};
86 pub use self::instance::{Instance, InstanceDef};
88 pub use self::trait_def::TraitDef;
90 pub use self::query::queries;
101 pub mod inhabitedness;
118 mod structural_impls;
123 /// The complete set of all analyses described in this module. This is
124 /// produced by the driver and fed to codegen and later passes.
126 /// NB: These contents are being migrated into queries using the
127 /// *on-demand* infrastructure.
129 pub struct CrateAnalysis {
130 pub access_levels: Lrc<AccessLevels>,
132 pub glob_map: Option<hir::GlobMap>,
136 pub struct Resolutions {
137 pub freevars: FreevarMap,
138 pub trait_map: TraitMap,
139 pub maybe_unused_trait_imports: NodeSet,
140 pub maybe_unused_extern_crates: Vec<(NodeId, Span)>,
141 pub export_map: ExportMap,
144 #[derive(Clone, Copy, PartialEq, Eq, Debug)]
145 pub enum AssociatedItemContainer {
146 TraitContainer(DefId),
147 ImplContainer(DefId),
150 impl AssociatedItemContainer {
151 /// Asserts that this is the def-id of an associated item declared
152 /// in a trait, and returns the trait def-id.
153 pub fn assert_trait(&self) -> DefId {
155 TraitContainer(id) => id,
156 _ => bug!("associated item has wrong container type: {:?}", self)
160 pub fn id(&self) -> DefId {
162 TraitContainer(id) => id,
163 ImplContainer(id) => id,
168 /// The "header" of an impl is everything outside the body: a Self type, a trait
169 /// ref (in the case of a trait impl), and a set of predicates (from the
170 /// bounds/where clauses).
171 #[derive(Clone, PartialEq, Eq, Hash, Debug)]
172 pub struct ImplHeader<'tcx> {
173 pub impl_def_id: DefId,
174 pub self_ty: Ty<'tcx>,
175 pub trait_ref: Option<TraitRef<'tcx>>,
176 pub predicates: Vec<Predicate<'tcx>>,
179 #[derive(Copy, Clone, Debug, PartialEq)]
180 pub struct AssociatedItem {
183 pub kind: AssociatedKind,
185 pub defaultness: hir::Defaultness,
186 pub container: AssociatedItemContainer,
188 /// Whether this is a method with an explicit self
189 /// as its first argument, allowing method calls.
190 pub method_has_self_argument: bool,
193 #[derive(Copy, Clone, PartialEq, Eq, Debug, Hash, RustcEncodable, RustcDecodable)]
194 pub enum AssociatedKind {
201 impl AssociatedItem {
202 pub fn def(&self) -> Def {
204 AssociatedKind::Const => Def::AssociatedConst(self.def_id),
205 AssociatedKind::Method => Def::Method(self.def_id),
206 AssociatedKind::Type => Def::AssociatedTy(self.def_id),
207 AssociatedKind::Existential => Def::AssociatedExistential(self.def_id),
211 /// Tests whether the associated item admits a non-trivial implementation
213 pub fn relevant_for_never<'tcx>(&self) -> bool {
215 AssociatedKind::Existential |
216 AssociatedKind::Const |
217 AssociatedKind::Type => true,
218 // FIXME(canndrew): Be more thorough here, check if any argument is uninhabited.
219 AssociatedKind::Method => !self.method_has_self_argument,
223 pub fn signature<'a, 'tcx>(&self, tcx: &TyCtxt<'a, 'tcx, 'tcx>) -> String {
225 ty::AssociatedKind::Method => {
226 // We skip the binder here because the binder would deanonymize all
227 // late-bound regions, and we don't want method signatures to show up
228 // `as for<'r> fn(&'r MyType)`. Pretty-printing handles late-bound
229 // regions just fine, showing `fn(&MyType)`.
230 tcx.fn_sig(self.def_id).skip_binder().to_string()
232 ty::AssociatedKind::Type => format!("type {};", self.ident),
233 ty::AssociatedKind::Existential => format!("existential type {};", self.ident),
234 ty::AssociatedKind::Const => {
235 format!("const {}: {:?};", self.ident, tcx.type_of(self.def_id))
241 #[derive(Clone, Debug, PartialEq, Eq, Copy, RustcEncodable, RustcDecodable)]
242 pub enum Visibility {
243 /// Visible everywhere (including in other crates).
245 /// Visible only in the given crate-local module.
247 /// Not visible anywhere in the local crate. This is the visibility of private external items.
251 pub trait DefIdTree: Copy {
252 fn parent(self, id: DefId) -> Option<DefId>;
254 fn is_descendant_of(self, mut descendant: DefId, ancestor: DefId) -> bool {
255 if descendant.krate != ancestor.krate {
259 while descendant != ancestor {
260 match self.parent(descendant) {
261 Some(parent) => descendant = parent,
262 None => return false,
269 impl<'a, 'gcx, 'tcx> DefIdTree for TyCtxt<'a, 'gcx, 'tcx> {
270 fn parent(self, id: DefId) -> Option<DefId> {
271 self.def_key(id).parent.map(|index| DefId { index: index, ..id })
276 pub fn from_hir(visibility: &hir::Visibility, id: NodeId, tcx: TyCtxt<'_, '_, '_>) -> Self {
277 match visibility.node {
278 hir::VisibilityKind::Public => Visibility::Public,
279 hir::VisibilityKind::Crate(_) => Visibility::Restricted(DefId::local(CRATE_DEF_INDEX)),
280 hir::VisibilityKind::Restricted { ref path, .. } => match path.def {
281 // If there is no resolution, `resolve` will have already reported an error, so
282 // assume that the visibility is public to avoid reporting more privacy errors.
283 Def::Err => Visibility::Public,
284 def => Visibility::Restricted(def.def_id()),
286 hir::VisibilityKind::Inherited => {
287 Visibility::Restricted(tcx.hir.get_module_parent(id))
292 /// Returns true if an item with this visibility is accessible from the given block.
293 pub fn is_accessible_from<T: DefIdTree>(self, module: DefId, tree: T) -> bool {
294 let restriction = match self {
295 // Public items are visible everywhere.
296 Visibility::Public => return true,
297 // Private items from other crates are visible nowhere.
298 Visibility::Invisible => return false,
299 // Restricted items are visible in an arbitrary local module.
300 Visibility::Restricted(other) if other.krate != module.krate => return false,
301 Visibility::Restricted(module) => module,
304 tree.is_descendant_of(module, restriction)
307 /// Returns true if this visibility is at least as accessible as the given visibility
308 pub fn is_at_least<T: DefIdTree>(self, vis: Visibility, tree: T) -> bool {
309 let vis_restriction = match vis {
310 Visibility::Public => return self == Visibility::Public,
311 Visibility::Invisible => return true,
312 Visibility::Restricted(module) => module,
315 self.is_accessible_from(vis_restriction, tree)
318 // Returns true if this item is visible anywhere in the local crate.
319 pub fn is_visible_locally(self) -> bool {
321 Visibility::Public => true,
322 Visibility::Restricted(def_id) => def_id.is_local(),
323 Visibility::Invisible => false,
328 #[derive(Clone, PartialEq, RustcDecodable, RustcEncodable, Copy)]
330 Covariant, // T<A> <: T<B> iff A <: B -- e.g., function return type
331 Invariant, // T<A> <: T<B> iff B == A -- e.g., type of mutable cell
332 Contravariant, // T<A> <: T<B> iff B <: A -- e.g., function param type
333 Bivariant, // T<A> <: T<B> -- e.g., unused type parameter
336 /// The crate variances map is computed during typeck and contains the
337 /// variance of every item in the local crate. You should not use it
338 /// directly, because to do so will make your pass dependent on the
339 /// HIR of every item in the local crate. Instead, use
340 /// `tcx.variances_of()` to get the variance for a *particular*
342 pub struct CrateVariancesMap {
343 /// For each item with generics, maps to a vector of the variance
344 /// of its generics. If an item has no generics, it will have no
346 pub variances: FxHashMap<DefId, Lrc<Vec<ty::Variance>>>,
348 /// An empty vector, useful for cloning.
349 pub empty_variance: Lrc<Vec<ty::Variance>>,
353 /// `a.xform(b)` combines the variance of a context with the
354 /// variance of a type with the following meaning. If we are in a
355 /// context with variance `a`, and we encounter a type argument in
356 /// a position with variance `b`, then `a.xform(b)` is the new
357 /// variance with which the argument appears.
363 /// Here, the "ambient" variance starts as covariant. `*mut T` is
364 /// invariant with respect to `T`, so the variance in which the
365 /// `Vec<i32>` appears is `Covariant.xform(Invariant)`, which
366 /// yields `Invariant`. Now, the type `Vec<T>` is covariant with
367 /// respect to its type argument `T`, and hence the variance of
368 /// the `i32` here is `Invariant.xform(Covariant)`, which results
369 /// (again) in `Invariant`.
373 /// fn(*const Vec<i32>, *mut Vec<i32)
375 /// The ambient variance is covariant. A `fn` type is
376 /// contravariant with respect to its parameters, so the variance
377 /// within which both pointer types appear is
378 /// `Covariant.xform(Contravariant)`, or `Contravariant`. `*const
379 /// T` is covariant with respect to `T`, so the variance within
380 /// which the first `Vec<i32>` appears is
381 /// `Contravariant.xform(Covariant)` or `Contravariant`. The same
382 /// is true for its `i32` argument. In the `*mut T` case, the
383 /// variance of `Vec<i32>` is `Contravariant.xform(Invariant)`,
384 /// and hence the outermost type is `Invariant` with respect to
385 /// `Vec<i32>` (and its `i32` argument).
387 /// Source: Figure 1 of "Taming the Wildcards:
388 /// Combining Definition- and Use-Site Variance" published in PLDI'11.
389 pub fn xform(self, v: ty::Variance) -> ty::Variance {
391 // Figure 1, column 1.
392 (ty::Covariant, ty::Covariant) => ty::Covariant,
393 (ty::Covariant, ty::Contravariant) => ty::Contravariant,
394 (ty::Covariant, ty::Invariant) => ty::Invariant,
395 (ty::Covariant, ty::Bivariant) => ty::Bivariant,
397 // Figure 1, column 2.
398 (ty::Contravariant, ty::Covariant) => ty::Contravariant,
399 (ty::Contravariant, ty::Contravariant) => ty::Covariant,
400 (ty::Contravariant, ty::Invariant) => ty::Invariant,
401 (ty::Contravariant, ty::Bivariant) => ty::Bivariant,
403 // Figure 1, column 3.
404 (ty::Invariant, _) => ty::Invariant,
406 // Figure 1, column 4.
407 (ty::Bivariant, _) => ty::Bivariant,
412 // Contains information needed to resolve types and (in the future) look up
413 // the types of AST nodes.
414 #[derive(Copy, Clone, PartialEq, Eq, Hash)]
415 pub struct CReaderCacheKey {
420 // Flags that we track on types. These flags are propagated upwards
421 // through the type during type construction, so that we can quickly
422 // check whether the type has various kinds of types in it without
423 // recursing over the type itself.
425 pub struct TypeFlags: u32 {
426 const HAS_PARAMS = 1 << 0;
427 const HAS_SELF = 1 << 1;
428 const HAS_TY_INFER = 1 << 2;
429 const HAS_RE_INFER = 1 << 3;
430 const HAS_RE_SKOL = 1 << 4;
432 /// Does this have any `ReEarlyBound` regions? Used to
433 /// determine whether substitition is required, since those
434 /// represent regions that are bound in a `ty::Generics` and
435 /// hence may be substituted.
436 const HAS_RE_EARLY_BOUND = 1 << 5;
438 /// Does this have any region that "appears free" in the type?
439 /// Basically anything but `ReLateBound` and `ReErased`.
440 const HAS_FREE_REGIONS = 1 << 6;
442 /// Is an error type reachable?
443 const HAS_TY_ERR = 1 << 7;
444 const HAS_PROJECTION = 1 << 8;
446 // FIXME: Rename this to the actual property since it's used for generators too
447 const HAS_TY_CLOSURE = 1 << 9;
449 // true if there are "names" of types and regions and so forth
450 // that are local to a particular fn
451 const HAS_FREE_LOCAL_NAMES = 1 << 10;
453 // Present if the type belongs in a local type context.
454 // Only set for Infer other than Fresh.
455 const KEEP_IN_LOCAL_TCX = 1 << 11;
457 // Is there a projection that does not involve a bound region?
458 // Currently we can't normalize projections w/ bound regions.
459 const HAS_NORMALIZABLE_PROJECTION = 1 << 12;
461 // Set if this includes a "canonical" type or region var --
462 // ought to be true only for the results of canonicalization.
463 const HAS_CANONICAL_VARS = 1 << 13;
465 /// Does this have any `ReLateBound` regions? Used to check
466 /// if a global bound is safe to evaluate.
467 const HAS_RE_LATE_BOUND = 1 << 14;
469 const NEEDS_SUBST = TypeFlags::HAS_PARAMS.bits |
470 TypeFlags::HAS_SELF.bits |
471 TypeFlags::HAS_RE_EARLY_BOUND.bits;
473 // Flags representing the nominal content of a type,
474 // computed by FlagsComputation. If you add a new nominal
475 // flag, it should be added here too.
476 const NOMINAL_FLAGS = TypeFlags::HAS_PARAMS.bits |
477 TypeFlags::HAS_SELF.bits |
478 TypeFlags::HAS_TY_INFER.bits |
479 TypeFlags::HAS_RE_INFER.bits |
480 TypeFlags::HAS_RE_SKOL.bits |
481 TypeFlags::HAS_RE_EARLY_BOUND.bits |
482 TypeFlags::HAS_FREE_REGIONS.bits |
483 TypeFlags::HAS_TY_ERR.bits |
484 TypeFlags::HAS_PROJECTION.bits |
485 TypeFlags::HAS_TY_CLOSURE.bits |
486 TypeFlags::HAS_FREE_LOCAL_NAMES.bits |
487 TypeFlags::KEEP_IN_LOCAL_TCX.bits |
488 TypeFlags::HAS_CANONICAL_VARS.bits |
489 TypeFlags::HAS_RE_LATE_BOUND.bits;
493 pub struct TyS<'tcx> {
494 pub sty: TyKind<'tcx>,
495 pub flags: TypeFlags,
497 /// This is a kind of confusing thing: it stores the smallest
500 /// (a) the binder itself captures nothing but
501 /// (b) all the late-bound things within the type are captured
502 /// by some sub-binder.
504 /// So, for a type without any late-bound things, like `u32`, this
505 /// will be INNERMOST, because that is the innermost binder that
506 /// captures nothing. But for a type `&'D u32`, where `'D` is a
507 /// late-bound region with debruijn index D, this would be D+1 --
508 /// the binder itself does not capture D, but D is captured by an
511 /// We call this concept an "exclusive" binder D (because all
512 /// debruijn indices within the type are contained within `0..D`
514 outer_exclusive_binder: ty::DebruijnIndex,
517 impl<'tcx> Ord for TyS<'tcx> {
518 fn cmp(&self, other: &TyS<'tcx>) -> Ordering {
519 self.sty.cmp(&other.sty)
523 impl<'tcx> PartialOrd for TyS<'tcx> {
524 fn partial_cmp(&self, other: &TyS<'tcx>) -> Option<Ordering> {
525 Some(self.sty.cmp(&other.sty))
529 impl<'tcx> PartialEq for TyS<'tcx> {
531 fn eq(&self, other: &TyS<'tcx>) -> bool {
535 impl<'tcx> Eq for TyS<'tcx> {}
537 impl<'tcx> Hash for TyS<'tcx> {
538 fn hash<H: Hasher>(&self, s: &mut H) {
539 (self as *const TyS<'_>).hash(s)
543 impl<'tcx> TyS<'tcx> {
544 pub fn is_primitive_ty(&self) -> bool {
551 TyKind::Infer(InferTy::IntVar(_)) |
552 TyKind::Infer(InferTy::FloatVar(_)) |
553 TyKind::Infer(InferTy::FreshIntTy(_)) |
554 TyKind::Infer(InferTy::FreshFloatTy(_)) => true,
555 TyKind::Ref(_, x, _) => x.is_primitive_ty(),
560 pub fn is_suggestable(&self) -> bool {
565 TyKind::Dynamic(..) |
566 TyKind::Closure(..) |
568 TyKind::Projection(..) => false,
574 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for ty::TyS<'gcx> {
575 fn hash_stable<W: StableHasherResult>(&self,
576 hcx: &mut StableHashingContext<'a>,
577 hasher: &mut StableHasher<W>) {
581 // The other fields just provide fast access to information that is
582 // also contained in `sty`, so no need to hash them.
585 outer_exclusive_binder: _,
588 sty.hash_stable(hcx, hasher);
592 pub type Ty<'tcx> = &'tcx TyS<'tcx>;
594 impl<'tcx> serialize::UseSpecializedEncodable for Ty<'tcx> {}
595 impl<'tcx> serialize::UseSpecializedDecodable for Ty<'tcx> {}
597 pub type CanonicalTy<'gcx> = Canonical<'gcx, Ty<'gcx>>;
600 /// A dummy type used to force List to by unsized without requiring fat pointers
601 type OpaqueListContents;
604 /// A wrapper for slices with the additional invariant
605 /// that the slice is interned and no other slice with
606 /// the same contents can exist in the same context.
607 /// This means we can use pointer for both
608 /// equality comparisons and hashing.
609 /// Note: `Slice` was already taken by the `Ty`.
614 opaque: OpaqueListContents,
617 unsafe impl<T: Sync> Sync for List<T> {}
619 impl<T: Copy> List<T> {
621 fn from_arena<'tcx>(arena: &'tcx SyncDroplessArena, slice: &[T]) -> &'tcx List<T> {
622 assert!(!mem::needs_drop::<T>());
623 assert!(mem::size_of::<T>() != 0);
624 assert!(slice.len() != 0);
626 // Align up the size of the len (usize) field
627 let align = mem::align_of::<T>();
628 let align_mask = align - 1;
629 let offset = mem::size_of::<usize>();
630 let offset = (offset + align_mask) & !align_mask;
632 let size = offset + slice.len() * mem::size_of::<T>();
634 let mem = arena.alloc_raw(
636 cmp::max(mem::align_of::<T>(), mem::align_of::<usize>()));
638 let result = &mut *(mem.as_mut_ptr() as *mut List<T>);
640 result.len = slice.len();
642 // Write the elements
643 let arena_slice = slice::from_raw_parts_mut(result.data.as_mut_ptr(), result.len);
644 arena_slice.copy_from_slice(slice);
651 impl<T: fmt::Debug> fmt::Debug for List<T> {
652 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
657 impl<T: Encodable> Encodable for List<T> {
659 fn encode<S: Encoder>(&self, s: &mut S) -> Result<(), S::Error> {
664 impl<T> Ord for List<T> where T: Ord {
665 fn cmp(&self, other: &List<T>) -> Ordering {
666 if self == other { Ordering::Equal } else {
667 <[T] as Ord>::cmp(&**self, &**other)
672 impl<T> PartialOrd for List<T> where T: PartialOrd {
673 fn partial_cmp(&self, other: &List<T>) -> Option<Ordering> {
674 if self == other { Some(Ordering::Equal) } else {
675 <[T] as PartialOrd>::partial_cmp(&**self, &**other)
680 impl<T: PartialEq> PartialEq for List<T> {
682 fn eq(&self, other: &List<T>) -> bool {
686 impl<T: Eq> Eq for List<T> {}
688 impl<T> Hash for List<T> {
690 fn hash<H: Hasher>(&self, s: &mut H) {
691 (self as *const List<T>).hash(s)
695 impl<T> Deref for List<T> {
698 fn deref(&self) -> &[T] {
700 slice::from_raw_parts(self.data.as_ptr(), self.len)
705 impl<'a, T> IntoIterator for &'a List<T> {
707 type IntoIter = <&'a [T] as IntoIterator>::IntoIter;
709 fn into_iter(self) -> Self::IntoIter {
714 impl<'tcx> serialize::UseSpecializedDecodable for &'tcx List<Ty<'tcx>> {}
718 pub fn empty<'a>() -> &'a List<T> {
719 #[repr(align(64), C)]
720 struct EmptySlice([u8; 64]);
721 static EMPTY_SLICE: EmptySlice = EmptySlice([0; 64]);
722 assert!(mem::align_of::<T>() <= 64);
724 &*(&EMPTY_SLICE as *const _ as *const List<T>)
729 /// Upvars do not get their own node-id. 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)]
734 pub var_id: hir::HirId,
735 pub closure_expr_id: LocalDefId,
738 #[derive(Clone, PartialEq, Eq, Hash, Debug, RustcEncodable, RustcDecodable, Copy)]
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)]
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)]
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 UpvarCaptureMap<'tcx> = FxHashMap<UpvarId, UpvarCapture<'tcx>>;
810 #[derive(Copy, Clone)]
811 pub struct ClosureUpvar<'tcx> {
817 #[derive(Clone, Copy, PartialEq, Eq)]
818 pub enum IntVarValue {
820 UintType(ast::UintTy),
823 #[derive(Clone, Copy, PartialEq, Eq)]
824 pub struct FloatVarValue(pub ast::FloatTy);
826 impl ty::EarlyBoundRegion {
827 pub fn to_bound_region(&self) -> ty::BoundRegion {
828 ty::BoundRegion::BrNamed(self.def_id, self.name)
831 /// Does this early bound region have a name? Early bound regions normally
832 /// always have names except when using anonymous lifetimes (`'_`).
833 pub fn has_name(&self) -> bool {
834 self.name != keywords::UnderscoreLifetime.name().as_interned_str()
838 #[derive(Clone, Debug, RustcEncodable, RustcDecodable)]
839 pub enum GenericParamDefKind {
843 object_lifetime_default: ObjectLifetimeDefault,
844 synthetic: Option<hir::SyntheticTyParamKind>,
848 #[derive(Clone, RustcEncodable, RustcDecodable)]
849 pub struct GenericParamDef {
850 pub name: InternedString,
854 /// `pure_wrt_drop`, set by the (unsafe) `#[may_dangle]` attribute
855 /// on generic parameter `'a`/`T`, asserts data behind the parameter
856 /// `'a`/`T` won't be accessed during the parent type's `Drop` impl.
857 pub pure_wrt_drop: bool,
859 pub kind: GenericParamDefKind,
862 impl GenericParamDef {
863 pub fn to_early_bound_region_data(&self) -> ty::EarlyBoundRegion {
865 GenericParamDefKind::Lifetime => {
866 ty::EarlyBoundRegion {
872 _ => bug!("cannot convert a non-lifetime parameter def to an early bound region")
876 pub fn to_bound_region(&self) -> ty::BoundRegion {
878 GenericParamDefKind::Lifetime => {
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,
892 /// Information about the formal type/lifetime parameters associated
893 /// with an item or method. Analogous to hir::Generics.
895 /// The ordering of parameters is the same as in Subst (excluding child generics):
896 /// Self (optionally), Lifetime params..., Type params...
897 #[derive(Clone, Debug, RustcEncodable, RustcDecodable)]
898 pub struct Generics {
899 pub parent: Option<DefId>,
900 pub parent_count: usize,
901 pub params: Vec<GenericParamDef>,
903 /// Reverse map to the `index` field of each `GenericParamDef`
904 pub param_def_id_to_index: FxHashMap<DefId, u32>,
907 pub has_late_bound_regions: Option<Span>,
910 impl<'a, 'gcx, 'tcx> Generics {
911 pub fn count(&self) -> usize {
912 self.parent_count + self.params.len()
915 pub fn own_counts(&self) -> GenericParamCount {
916 // We could cache this as a property of `GenericParamCount`, but
917 // the aim is to refactor this away entirely eventually and the
918 // presence of this method will be a constant reminder.
919 let mut own_counts: GenericParamCount = Default::default();
921 for param in &self.params {
923 GenericParamDefKind::Lifetime => own_counts.lifetimes += 1,
924 GenericParamDefKind::Type { .. } => own_counts.types += 1,
931 pub fn requires_monomorphization(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> bool {
932 for param in &self.params {
934 GenericParamDefKind::Type { .. } => return true,
935 GenericParamDefKind::Lifetime => {}
938 if let Some(parent_def_id) = self.parent {
939 let parent = tcx.generics_of(parent_def_id);
940 parent.requires_monomorphization(tcx)
946 pub fn region_param(&'tcx self,
947 param: &EarlyBoundRegion,
948 tcx: TyCtxt<'a, 'gcx, 'tcx>)
949 -> &'tcx GenericParamDef
951 if let Some(index) = param.index.checked_sub(self.parent_count as u32) {
952 let param = &self.params[index as usize];
954 ty::GenericParamDefKind::Lifetime => param,
955 _ => bug!("expected lifetime parameter, but found another generic parameter")
958 tcx.generics_of(self.parent.expect("parent_count>0 but no parent?"))
959 .region_param(param, tcx)
963 /// Returns the `GenericParamDef` associated with this `ParamTy`.
964 pub fn type_param(&'tcx self,
966 tcx: TyCtxt<'a, 'gcx, 'tcx>)
967 -> &'tcx GenericParamDef {
968 if let Some(index) = param.idx.checked_sub(self.parent_count as u32) {
969 let param = &self.params[index as usize];
971 ty::GenericParamDefKind::Type {..} => param,
972 _ => bug!("expected type parameter, but found another generic parameter")
975 tcx.generics_of(self.parent.expect("parent_count>0 but no parent?"))
976 .type_param(param, tcx)
981 /// Bounds on generics.
982 #[derive(Clone, Default)]
983 pub struct GenericPredicates<'tcx> {
984 pub parent: Option<DefId>,
985 pub predicates: Vec<(Predicate<'tcx>, Span)>,
988 impl<'tcx> serialize::UseSpecializedEncodable for GenericPredicates<'tcx> {}
989 impl<'tcx> serialize::UseSpecializedDecodable for GenericPredicates<'tcx> {}
991 impl<'a, 'gcx, 'tcx> GenericPredicates<'tcx> {
992 pub fn instantiate(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>, substs: &Substs<'tcx>)
993 -> InstantiatedPredicates<'tcx> {
994 let mut instantiated = InstantiatedPredicates::empty();
995 self.instantiate_into(tcx, &mut instantiated, substs);
998 pub fn instantiate_own(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>, substs: &Substs<'tcx>)
999 -> InstantiatedPredicates<'tcx> {
1000 InstantiatedPredicates {
1001 predicates: self.predicates.iter().map(|(p, _)| p.subst(tcx, substs)).collect(),
1005 fn instantiate_into(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>,
1006 instantiated: &mut InstantiatedPredicates<'tcx>,
1007 substs: &Substs<'tcx>) {
1008 if let Some(def_id) = self.parent {
1009 tcx.predicates_of(def_id).instantiate_into(tcx, instantiated, substs);
1011 instantiated.predicates.extend(
1012 self.predicates.iter().map(|(p, _)| p.subst(tcx, substs)),
1016 pub fn instantiate_identity(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>)
1017 -> InstantiatedPredicates<'tcx> {
1018 let mut instantiated = InstantiatedPredicates::empty();
1019 self.instantiate_identity_into(tcx, &mut instantiated);
1023 fn instantiate_identity_into(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>,
1024 instantiated: &mut InstantiatedPredicates<'tcx>) {
1025 if let Some(def_id) = self.parent {
1026 tcx.predicates_of(def_id).instantiate_identity_into(tcx, instantiated);
1028 instantiated.predicates.extend(self.predicates.iter().map(|&(p, _)| p))
1031 pub fn instantiate_supertrait(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>,
1032 poly_trait_ref: &ty::PolyTraitRef<'tcx>)
1033 -> InstantiatedPredicates<'tcx>
1035 assert_eq!(self.parent, None);
1036 InstantiatedPredicates {
1037 predicates: self.predicates.iter().map(|(pred, _)| {
1038 pred.subst_supertrait(tcx, poly_trait_ref)
1044 #[derive(Clone, Copy, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable)]
1045 pub enum Predicate<'tcx> {
1046 /// Corresponds to `where Foo : Bar<A,B,C>`. `Foo` here would be
1047 /// the `Self` type of the trait reference and `A`, `B`, and `C`
1048 /// would be the type parameters.
1049 Trait(PolyTraitPredicate<'tcx>),
1052 RegionOutlives(PolyRegionOutlivesPredicate<'tcx>),
1055 TypeOutlives(PolyTypeOutlivesPredicate<'tcx>),
1057 /// where <T as TraitRef>::Name == X, approximately.
1058 /// See `ProjectionPredicate` struct for details.
1059 Projection(PolyProjectionPredicate<'tcx>),
1062 WellFormed(Ty<'tcx>),
1064 /// trait must be object-safe
1067 /// No direct syntax. May be thought of as `where T : FnFoo<...>`
1068 /// for some substitutions `...` and T being a closure type.
1069 /// Satisfied (or refuted) once we know the closure's kind.
1070 ClosureKind(DefId, ClosureSubsts<'tcx>, ClosureKind),
1073 Subtype(PolySubtypePredicate<'tcx>),
1075 /// Constant initializer must evaluate successfully.
1076 ConstEvaluatable(DefId, &'tcx Substs<'tcx>),
1079 /// The crate outlives map is computed during typeck and contains the
1080 /// outlives of every item in the local crate. You should not use it
1081 /// directly, because to do so will make your pass dependent on the
1082 /// HIR of every item in the local crate. Instead, use
1083 /// `tcx.inferred_outlives_of()` to get the outlives for a *particular*
1085 pub struct CratePredicatesMap<'tcx> {
1086 /// For each struct with outlive bounds, maps to a vector of the
1087 /// predicate of its outlive bounds. If an item has no outlives
1088 /// bounds, it will have no entry.
1089 pub predicates: FxHashMap<DefId, Lrc<Vec<ty::Predicate<'tcx>>>>,
1091 /// An empty vector, useful for cloning.
1092 pub empty_predicate: Lrc<Vec<ty::Predicate<'tcx>>>,
1095 impl<'tcx> AsRef<Predicate<'tcx>> for Predicate<'tcx> {
1096 fn as_ref(&self) -> &Predicate<'tcx> {
1101 impl<'a, 'gcx, 'tcx> Predicate<'tcx> {
1102 /// Performs a substitution suitable for going from a
1103 /// poly-trait-ref to supertraits that must hold if that
1104 /// poly-trait-ref holds. This is slightly different from a normal
1105 /// substitution in terms of what happens with bound regions. See
1106 /// lengthy comment below for details.
1107 pub fn subst_supertrait(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>,
1108 trait_ref: &ty::PolyTraitRef<'tcx>)
1109 -> ty::Predicate<'tcx>
1111 // The interaction between HRTB and supertraits is not entirely
1112 // obvious. Let me walk you (and myself) through an example.
1114 // Let's start with an easy case. Consider two traits:
1116 // trait Foo<'a> : Bar<'a,'a> { }
1117 // trait Bar<'b,'c> { }
1119 // Now, if we have a trait reference `for<'x> T : Foo<'x>`, then
1120 // we can deduce that `for<'x> T : Bar<'x,'x>`. Basically, if we
1121 // knew that `Foo<'x>` (for any 'x) then we also know that
1122 // `Bar<'x,'x>` (for any 'x). This more-or-less falls out from
1123 // normal substitution.
1125 // In terms of why this is sound, the idea is that whenever there
1126 // is an impl of `T:Foo<'a>`, it must show that `T:Bar<'a,'a>`
1127 // holds. So if there is an impl of `T:Foo<'a>` that applies to
1128 // all `'a`, then we must know that `T:Bar<'a,'a>` holds for all
1131 // Another example to be careful of is this:
1133 // trait Foo1<'a> : for<'b> Bar1<'a,'b> { }
1134 // trait Bar1<'b,'c> { }
1136 // Here, if we have `for<'x> T : Foo1<'x>`, then what do we know?
1137 // The answer is that we know `for<'x,'b> T : Bar1<'x,'b>`. The
1138 // reason is similar to the previous example: any impl of
1139 // `T:Foo1<'x>` must show that `for<'b> T : Bar1<'x, 'b>`. So
1140 // basically we would want to collapse the bound lifetimes from
1141 // the input (`trait_ref`) and the supertraits.
1143 // To achieve this in practice is fairly straightforward. Let's
1144 // consider the more complicated scenario:
1146 // - We start out with `for<'x> T : Foo1<'x>`. In this case, `'x`
1147 // has a De Bruijn index of 1. We want to produce `for<'x,'b> T : Bar1<'x,'b>`,
1148 // where both `'x` and `'b` would have a DB index of 1.
1149 // The substitution from the input trait-ref is therefore going to be
1150 // `'a => 'x` (where `'x` has a DB index of 1).
1151 // - The super-trait-ref is `for<'b> Bar1<'a,'b>`, where `'a` is an
1152 // early-bound parameter and `'b' is a late-bound parameter with a
1154 // - If we replace `'a` with `'x` from the input, it too will have
1155 // a DB index of 1, and thus we'll have `for<'x,'b> Bar1<'x,'b>`
1156 // just as we wanted.
1158 // There is only one catch. If we just apply the substitution `'a
1159 // => 'x` to `for<'b> Bar1<'a,'b>`, the substitution code will
1160 // adjust the DB index because we substituting into a binder (it
1161 // tries to be so smart...) resulting in `for<'x> for<'b>
1162 // Bar1<'x,'b>` (we have no syntax for this, so use your
1163 // imagination). Basically the 'x will have DB index of 2 and 'b
1164 // will have DB index of 1. Not quite what we want. So we apply
1165 // the substitution to the *contents* of the trait reference,
1166 // rather than the trait reference itself (put another way, the
1167 // substitution code expects equal binding levels in the values
1168 // from the substitution and the value being substituted into, and
1169 // this trick achieves that).
1171 let substs = &trait_ref.skip_binder().substs;
1173 Predicate::Trait(ref binder) =>
1174 Predicate::Trait(binder.map_bound(|data| data.subst(tcx, substs))),
1175 Predicate::Subtype(ref binder) =>
1176 Predicate::Subtype(binder.map_bound(|data| data.subst(tcx, substs))),
1177 Predicate::RegionOutlives(ref binder) =>
1178 Predicate::RegionOutlives(binder.map_bound(|data| data.subst(tcx, substs))),
1179 Predicate::TypeOutlives(ref binder) =>
1180 Predicate::TypeOutlives(binder.map_bound(|data| data.subst(tcx, substs))),
1181 Predicate::Projection(ref binder) =>
1182 Predicate::Projection(binder.map_bound(|data| data.subst(tcx, substs))),
1183 Predicate::WellFormed(data) =>
1184 Predicate::WellFormed(data.subst(tcx, substs)),
1185 Predicate::ObjectSafe(trait_def_id) =>
1186 Predicate::ObjectSafe(trait_def_id),
1187 Predicate::ClosureKind(closure_def_id, closure_substs, kind) =>
1188 Predicate::ClosureKind(closure_def_id, closure_substs.subst(tcx, substs), kind),
1189 Predicate::ConstEvaluatable(def_id, const_substs) =>
1190 Predicate::ConstEvaluatable(def_id, const_substs.subst(tcx, substs)),
1195 #[derive(Clone, Copy, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable)]
1196 pub struct TraitPredicate<'tcx> {
1197 pub trait_ref: TraitRef<'tcx>
1199 pub type PolyTraitPredicate<'tcx> = ty::Binder<TraitPredicate<'tcx>>;
1201 impl<'tcx> TraitPredicate<'tcx> {
1202 pub fn def_id(&self) -> DefId {
1203 self.trait_ref.def_id
1206 pub fn input_types<'a>(&'a self) -> impl DoubleEndedIterator<Item=Ty<'tcx>> + 'a {
1207 self.trait_ref.input_types()
1210 pub fn self_ty(&self) -> Ty<'tcx> {
1211 self.trait_ref.self_ty()
1215 impl<'tcx> PolyTraitPredicate<'tcx> {
1216 pub fn def_id(&self) -> DefId {
1217 // ok to skip binder since trait def-id does not care about regions
1218 self.skip_binder().def_id()
1222 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, RustcEncodable, RustcDecodable)]
1223 pub struct OutlivesPredicate<A,B>(pub A, pub B); // `A : B`
1224 pub type PolyOutlivesPredicate<A,B> = ty::Binder<OutlivesPredicate<A,B>>;
1225 pub type RegionOutlivesPredicate<'tcx> = OutlivesPredicate<ty::Region<'tcx>,
1227 pub type TypeOutlivesPredicate<'tcx> = OutlivesPredicate<Ty<'tcx>,
1229 pub type PolyRegionOutlivesPredicate<'tcx> = ty::Binder<RegionOutlivesPredicate<'tcx>>;
1230 pub type PolyTypeOutlivesPredicate<'tcx> = ty::Binder<TypeOutlivesPredicate<'tcx>>;
1232 #[derive(Clone, Copy, PartialEq, Eq, Hash, Debug, RustcEncodable, RustcDecodable)]
1233 pub struct SubtypePredicate<'tcx> {
1234 pub a_is_expected: bool,
1238 pub type PolySubtypePredicate<'tcx> = ty::Binder<SubtypePredicate<'tcx>>;
1240 /// This kind of predicate has no *direct* correspondent in the
1241 /// syntax, but it roughly corresponds to the syntactic forms:
1243 /// 1. `T : TraitRef<..., Item=Type>`
1244 /// 2. `<T as TraitRef<...>>::Item == Type` (NYI)
1246 /// In particular, form #1 is "desugared" to the combination of a
1247 /// normal trait predicate (`T : TraitRef<...>`) and one of these
1248 /// predicates. Form #2 is a broader form in that it also permits
1249 /// equality between arbitrary types. Processing an instance of
1250 /// Form #2 eventually yields one of these `ProjectionPredicate`
1251 /// instances to normalize the LHS.
1252 #[derive(Copy, Clone, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable)]
1253 pub struct ProjectionPredicate<'tcx> {
1254 pub projection_ty: ProjectionTy<'tcx>,
1258 pub type PolyProjectionPredicate<'tcx> = Binder<ProjectionPredicate<'tcx>>;
1260 impl<'tcx> PolyProjectionPredicate<'tcx> {
1261 /// Returns the def-id of the associated item being projected.
1262 pub fn item_def_id(&self) -> DefId {
1263 self.skip_binder().projection_ty.item_def_id
1266 pub fn to_poly_trait_ref(&self, tcx: TyCtxt<'_, '_, '_>) -> PolyTraitRef<'tcx> {
1267 // Note: unlike with TraitRef::to_poly_trait_ref(),
1268 // self.0.trait_ref is permitted to have escaping regions.
1269 // This is because here `self` has a `Binder` and so does our
1270 // return value, so we are preserving the number of binding
1272 self.map_bound(|predicate| predicate.projection_ty.trait_ref(tcx))
1275 pub fn ty(&self) -> Binder<Ty<'tcx>> {
1276 self.map_bound(|predicate| predicate.ty)
1279 /// The DefId of the TraitItem for the associated type.
1281 /// Note that this is not the DefId of the TraitRef containing this
1282 /// associated type, which is in tcx.associated_item(projection_def_id()).container.
1283 pub fn projection_def_id(&self) -> DefId {
1284 // ok to skip binder since trait def-id does not care about regions
1285 self.skip_binder().projection_ty.item_def_id
1289 pub trait ToPolyTraitRef<'tcx> {
1290 fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx>;
1293 impl<'tcx> ToPolyTraitRef<'tcx> for TraitRef<'tcx> {
1294 fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx> {
1295 ty::Binder::dummy(self.clone())
1299 impl<'tcx> ToPolyTraitRef<'tcx> for PolyTraitPredicate<'tcx> {
1300 fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx> {
1301 self.map_bound_ref(|trait_pred| trait_pred.trait_ref)
1305 pub trait ToPredicate<'tcx> {
1306 fn to_predicate(&self) -> Predicate<'tcx>;
1309 impl<'tcx> ToPredicate<'tcx> for TraitRef<'tcx> {
1310 fn to_predicate(&self) -> Predicate<'tcx> {
1311 ty::Predicate::Trait(ty::Binder::dummy(ty::TraitPredicate {
1312 trait_ref: self.clone()
1317 impl<'tcx> ToPredicate<'tcx> for PolyTraitRef<'tcx> {
1318 fn to_predicate(&self) -> Predicate<'tcx> {
1319 ty::Predicate::Trait(self.to_poly_trait_predicate())
1323 impl<'tcx> ToPredicate<'tcx> for PolyRegionOutlivesPredicate<'tcx> {
1324 fn to_predicate(&self) -> Predicate<'tcx> {
1325 Predicate::RegionOutlives(self.clone())
1329 impl<'tcx> ToPredicate<'tcx> for PolyTypeOutlivesPredicate<'tcx> {
1330 fn to_predicate(&self) -> Predicate<'tcx> {
1331 Predicate::TypeOutlives(self.clone())
1335 impl<'tcx> ToPredicate<'tcx> for PolyProjectionPredicate<'tcx> {
1336 fn to_predicate(&self) -> Predicate<'tcx> {
1337 Predicate::Projection(self.clone())
1341 impl<'tcx> Predicate<'tcx> {
1342 /// Iterates over the types in this predicate. Note that in all
1343 /// cases this is skipping over a binder, so late-bound regions
1344 /// with depth 0 are bound by the predicate.
1345 pub fn walk_tys(&self) -> IntoIter<Ty<'tcx>> {
1346 let vec: Vec<_> = match *self {
1347 ty::Predicate::Trait(ref data) => {
1348 data.skip_binder().input_types().collect()
1350 ty::Predicate::Subtype(binder) => {
1351 let SubtypePredicate { a, b, a_is_expected: _ } = binder.skip_binder();
1354 ty::Predicate::TypeOutlives(binder) => {
1355 vec![binder.skip_binder().0]
1357 ty::Predicate::RegionOutlives(..) => {
1360 ty::Predicate::Projection(ref data) => {
1361 let inner = data.skip_binder();
1362 inner.projection_ty.substs.types().chain(Some(inner.ty)).collect()
1364 ty::Predicate::WellFormed(data) => {
1367 ty::Predicate::ObjectSafe(_trait_def_id) => {
1370 ty::Predicate::ClosureKind(_closure_def_id, closure_substs, _kind) => {
1371 closure_substs.substs.types().collect()
1373 ty::Predicate::ConstEvaluatable(_, substs) => {
1374 substs.types().collect()
1378 // The only reason to collect into a vector here is that I was
1379 // too lazy to make the full (somewhat complicated) iterator
1380 // type that would be needed here. But I wanted this fn to
1381 // return an iterator conceptually, rather than a `Vec`, so as
1382 // to be closer to `Ty::walk`.
1386 pub fn to_opt_poly_trait_ref(&self) -> Option<PolyTraitRef<'tcx>> {
1388 Predicate::Trait(ref t) => {
1389 Some(t.to_poly_trait_ref())
1391 Predicate::Projection(..) |
1392 Predicate::Subtype(..) |
1393 Predicate::RegionOutlives(..) |
1394 Predicate::WellFormed(..) |
1395 Predicate::ObjectSafe(..) |
1396 Predicate::ClosureKind(..) |
1397 Predicate::TypeOutlives(..) |
1398 Predicate::ConstEvaluatable(..) => {
1404 pub fn to_opt_type_outlives(&self) -> Option<PolyTypeOutlivesPredicate<'tcx>> {
1406 Predicate::TypeOutlives(data) => {
1409 Predicate::Trait(..) |
1410 Predicate::Projection(..) |
1411 Predicate::Subtype(..) |
1412 Predicate::RegionOutlives(..) |
1413 Predicate::WellFormed(..) |
1414 Predicate::ObjectSafe(..) |
1415 Predicate::ClosureKind(..) |
1416 Predicate::ConstEvaluatable(..) => {
1423 /// Represents the bounds declared on a particular set of type
1424 /// parameters. Should eventually be generalized into a flag list of
1425 /// where clauses. You can obtain a `InstantiatedPredicates` list from a
1426 /// `GenericPredicates` by using the `instantiate` method. Note that this method
1427 /// reflects an important semantic invariant of `InstantiatedPredicates`: while
1428 /// the `GenericPredicates` are expressed in terms of the bound type
1429 /// parameters of the impl/trait/whatever, an `InstantiatedPredicates` instance
1430 /// represented a set of bounds for some particular instantiation,
1431 /// meaning that the generic parameters have been substituted with
1436 /// struct Foo<T,U:Bar<T>> { ... }
1438 /// Here, the `GenericPredicates` for `Foo` would contain a list of bounds like
1439 /// `[[], [U:Bar<T>]]`. Now if there were some particular reference
1440 /// like `Foo<isize,usize>`, then the `InstantiatedPredicates` would be `[[],
1441 /// [usize:Bar<isize>]]`.
1443 pub struct InstantiatedPredicates<'tcx> {
1444 pub predicates: Vec<Predicate<'tcx>>,
1447 impl<'tcx> InstantiatedPredicates<'tcx> {
1448 pub fn empty() -> InstantiatedPredicates<'tcx> {
1449 InstantiatedPredicates { predicates: vec![] }
1452 pub fn is_empty(&self) -> bool {
1453 self.predicates.is_empty()
1457 /// "Universes" are used during type- and trait-checking in the
1458 /// presence of `for<..>` binders to control what sets of names are
1459 /// visible. Universes are arranged into a tree: the root universe
1460 /// contains names that are always visible. But when you enter into
1461 /// some subuniverse, then it may add names that are only visible
1462 /// within that subtree (but it can still name the names of its
1463 /// ancestor universes).
1465 /// To make this more concrete, consider this program:
1469 /// fn bar<T>(x: T) {
1470 /// let y: for<'a> fn(&'a u8, Foo) = ...;
1474 /// The struct name `Foo` is in the root universe U0. But the type
1475 /// parameter `T`, introduced on `bar`, is in a subuniverse U1 --
1476 /// i.e., within `bar`, we can name both `T` and `Foo`, but outside of
1477 /// `bar`, we cannot name `T`. Then, within the type of `y`, the
1478 /// region `'a` is in a subuniverse U2 of U1, because we can name it
1479 /// inside the fn type but not outside.
1481 /// Universes are related to **skolemization** -- which is a way of
1482 /// doing type- and trait-checking around these "forall" binders (also
1483 /// called **universal quantification**). The idea is that when, in
1484 /// the body of `bar`, we refer to `T` as a type, we aren't referring
1485 /// to any type in particular, but rather a kind of "fresh" type that
1486 /// is distinct from all other types we have actually declared. This
1487 /// is called a **skolemized** type, and we use universes to talk
1488 /// about this. In other words, a type name in universe 0 always
1489 /// corresponds to some "ground" type that the user declared, but a
1490 /// type name in a non-zero universe is a skolemized type -- an
1491 /// idealized representative of "types in general" that we use for
1492 /// checking generic functions.
1493 #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, RustcEncodable, RustcDecodable)]
1494 pub struct UniverseIndex(u32);
1496 impl UniverseIndex {
1497 /// The root universe, where things that the user defined are
1499 pub const ROOT: Self = UniverseIndex(0);
1501 /// The "max universe" -- this isn't really a valid universe, but
1502 /// it's useful sometimes as a "starting value" when you are
1503 /// taking the minimum of a (non-empty!) set of universes.
1504 pub const MAX: Self = UniverseIndex(::std::u32::MAX);
1506 /// Creates a universe index from the given integer. Not to be
1507 /// used lightly lest you pick a bad value. But sometimes we
1508 /// convert universe indices into integers and back for various
1510 pub fn from_u32(index: u32) -> Self {
1511 UniverseIndex(index)
1514 /// A "subuniverse" corresponds to being inside a `forall` quantifier.
1515 /// So, for example, suppose we have this type in universe `U`:
1518 /// for<'a> fn(&'a u32)
1521 /// Once we "enter" into this `for<'a>` quantifier, we are in a
1522 /// subuniverse of `U` -- in this new universe, we can name the
1523 /// region `'a`, but that region was not nameable from `U` because
1524 /// it was not in scope there.
1525 pub fn subuniverse(self) -> UniverseIndex {
1526 UniverseIndex(self.0.checked_add(1).unwrap())
1529 /// True if the names in this universe are a subset of the names in `other`.
1530 pub fn is_subset_of(self, other: UniverseIndex) -> bool {
1534 pub fn as_u32(&self) -> u32 {
1538 pub fn as_usize(&self) -> usize {
1543 impl fmt::Debug for UniverseIndex {
1544 fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
1545 write!(fmt, "U{}", self.as_u32())
1549 impl From<u32> for UniverseIndex {
1550 fn from(index: u32) -> Self {
1551 UniverseIndex(index)
1555 /// When type checking, we use the `ParamEnv` to track
1556 /// details about the set of where-clauses that are in scope at this
1557 /// particular point.
1558 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash)]
1559 pub struct ParamEnv<'tcx> {
1560 /// Obligations that the caller must satisfy. This is basically
1561 /// the set of bounds on the in-scope type parameters, translated
1562 /// into Obligations, and elaborated and normalized.
1563 pub caller_bounds: &'tcx List<ty::Predicate<'tcx>>,
1565 /// Typically, this is `Reveal::UserFacing`, but during codegen we
1566 /// want `Reveal::All` -- note that this is always paired with an
1567 /// empty environment. To get that, use `ParamEnv::reveal()`.
1568 pub reveal: traits::Reveal,
1571 impl<'tcx> ParamEnv<'tcx> {
1572 /// Construct a trait environment suitable for contexts where
1573 /// there are no where clauses in scope. Hidden types (like `impl
1574 /// Trait`) are left hidden, so this is suitable for ordinary
1576 pub fn empty() -> Self {
1577 Self::new(List::empty(), Reveal::UserFacing)
1580 /// Construct a trait environment with no where clauses in scope
1581 /// where the values of all `impl Trait` and other hidden types
1582 /// are revealed. This is suitable for monomorphized, post-typeck
1583 /// environments like codegen or doing optimizations.
1585 /// NB. If you want to have predicates in scope, use `ParamEnv::new`,
1586 /// or invoke `param_env.with_reveal_all()`.
1587 pub fn reveal_all() -> Self {
1588 Self::new(List::empty(), Reveal::All)
1591 /// Construct a trait environment with the given set of predicates.
1592 pub fn new(caller_bounds: &'tcx List<ty::Predicate<'tcx>>,
1595 ty::ParamEnv { caller_bounds, reveal }
1598 /// Returns a new parameter environment with the same clauses, but
1599 /// which "reveals" the true results of projections in all cases
1600 /// (even for associated types that are specializable). This is
1601 /// the desired behavior during codegen and certain other special
1602 /// contexts; normally though we want to use `Reveal::UserFacing`,
1603 /// which is the default.
1604 pub fn with_reveal_all(self) -> Self {
1605 ty::ParamEnv { reveal: Reveal::All, ..self }
1608 /// Returns this same environment but with no caller bounds.
1609 pub fn without_caller_bounds(self) -> Self {
1610 ty::ParamEnv { caller_bounds: List::empty(), ..self }
1613 /// Creates a suitable environment in which to perform trait
1614 /// queries on the given value. When type-checking, this is simply
1615 /// the pair of the environment plus value. But when reveal is set to
1616 /// All, then if `value` does not reference any type parameters, we will
1617 /// pair it with the empty environment. This improves caching and is generally
1620 /// NB: We preserve the environment when type-checking because it
1621 /// is possible for the user to have wacky where-clauses like
1622 /// `where Box<u32>: Copy`, which are clearly never
1623 /// satisfiable. We generally want to behave as if they were true,
1624 /// although the surrounding function is never reachable.
1625 pub fn and<T: TypeFoldable<'tcx>>(self, value: T) -> ParamEnvAnd<'tcx, T> {
1627 Reveal::UserFacing => {
1636 || value.needs_infer()
1637 || value.has_param_types()
1638 || value.has_self_ty()
1646 param_env: self.without_caller_bounds(),
1655 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash)]
1656 pub struct ParamEnvAnd<'tcx, T> {
1657 pub param_env: ParamEnv<'tcx>,
1661 impl<'tcx, T> ParamEnvAnd<'tcx, T> {
1662 pub fn into_parts(self) -> (ParamEnv<'tcx>, T) {
1663 (self.param_env, self.value)
1667 impl<'a, 'gcx, T> HashStable<StableHashingContext<'a>> for ParamEnvAnd<'gcx, T>
1668 where T: HashStable<StableHashingContext<'a>>
1670 fn hash_stable<W: StableHasherResult>(&self,
1671 hcx: &mut StableHashingContext<'a>,
1672 hasher: &mut StableHasher<W>) {
1678 param_env.hash_stable(hcx, hasher);
1679 value.hash_stable(hcx, hasher);
1683 #[derive(Copy, Clone, Debug)]
1684 pub struct Destructor {
1685 /// The def-id of the destructor method
1690 pub struct AdtFlags: u32 {
1691 const NO_ADT_FLAGS = 0;
1692 const IS_ENUM = 1 << 0;
1693 const IS_PHANTOM_DATA = 1 << 1;
1694 const IS_FUNDAMENTAL = 1 << 2;
1695 const IS_UNION = 1 << 3;
1696 const IS_BOX = 1 << 4;
1697 /// Indicates whether the variant list of this ADT is `#[non_exhaustive]`.
1698 /// (i.e., this flag is never set unless this ADT is an enum).
1699 const IS_VARIANT_LIST_NON_EXHAUSTIVE = 1 << 5;
1704 pub struct VariantFlags: u32 {
1705 const NO_VARIANT_FLAGS = 0;
1706 /// Indicates whether the field list of this variant is `#[non_exhaustive]`.
1707 const IS_FIELD_LIST_NON_EXHAUSTIVE = 1 << 0;
1712 pub struct VariantDef {
1713 /// The variant's DefId. If this is a tuple-like struct,
1714 /// this is the DefId of the struct's ctor.
1716 pub name: Name, // struct's name if this is a struct
1717 pub discr: VariantDiscr,
1718 pub fields: Vec<FieldDef>,
1719 pub ctor_kind: CtorKind,
1720 flags: VariantFlags,
1723 impl<'a, 'gcx, 'tcx> VariantDef {
1724 /// Create a new `VariantDef`.
1726 /// - `did` is the DefId used for the variant - for tuple-structs, it is the constructor DefId,
1727 /// and for everything else, it is the variant DefId.
1728 /// - `attribute_def_id` is the DefId that has the variant's attributes.
1729 /// this is the struct DefId for structs, and the variant DefId for variants.
1731 /// Note that we *could* use the constructor DefId, because the constructor attributes
1732 /// redirect to the base attributes, but compiling a small crate requires
1733 /// loading the AdtDefs for all the structs in the universe (e.g. coherence for any
1734 /// built-in trait), and we do not want to load attributes twice.
1736 /// If someone speeds up attribute loading to not be a performance concern, they can
1737 /// remove this hack and use the constructor DefId everywhere.
1738 pub fn new(tcx: TyCtxt<'a, 'gcx, 'tcx>,
1741 discr: VariantDiscr,
1742 fields: Vec<FieldDef>,
1744 ctor_kind: CtorKind,
1745 attribute_def_id: DefId)
1748 debug!("VariantDef::new({:?}, {:?}, {:?}, {:?}, {:?}, {:?}, {:?})", did, name, discr,
1749 fields, adt_kind, ctor_kind, attribute_def_id);
1750 let mut flags = VariantFlags::NO_VARIANT_FLAGS;
1751 if adt_kind == AdtKind::Struct && tcx.has_attr(attribute_def_id, "non_exhaustive") {
1752 debug!("found non-exhaustive field list for {:?}", did);
1753 flags = flags | VariantFlags::IS_FIELD_LIST_NON_EXHAUSTIVE;
1766 pub fn is_field_list_non_exhaustive(&self) -> bool {
1767 self.flags.intersects(VariantFlags::IS_FIELD_LIST_NON_EXHAUSTIVE)
1771 impl_stable_hash_for!(struct VariantDef {
1780 #[derive(Copy, Clone, Debug, PartialEq, Eq, RustcEncodable, RustcDecodable)]
1781 pub enum VariantDiscr {
1782 /// Explicit value for this variant, i.e. `X = 123`.
1783 /// The `DefId` corresponds to the embedded constant.
1786 /// The previous variant's discriminant plus one.
1787 /// For efficiency reasons, the distance from the
1788 /// last `Explicit` discriminant is being stored,
1789 /// or `0` for the first variant, if it has none.
1794 pub struct FieldDef {
1797 pub vis: Visibility,
1800 /// The definition of an abstract data type - a struct or enum.
1802 /// These are all interned (by intern_adt_def) into the adt_defs
1806 pub variants: Vec<VariantDef>,
1808 pub repr: ReprOptions,
1811 impl PartialOrd for AdtDef {
1812 fn partial_cmp(&self, other: &AdtDef) -> Option<Ordering> {
1813 Some(self.cmp(&other))
1817 /// There should be only one AdtDef for each `did`, therefore
1818 /// it is fine to implement `Ord` only based on `did`.
1819 impl Ord for AdtDef {
1820 fn cmp(&self, other: &AdtDef) -> Ordering {
1821 self.did.cmp(&other.did)
1825 impl PartialEq for AdtDef {
1826 // AdtDef are always interned and this is part of TyS equality
1828 fn eq(&self, other: &Self) -> bool { ptr::eq(self, other) }
1831 impl Eq for AdtDef {}
1833 impl Hash for AdtDef {
1835 fn hash<H: Hasher>(&self, s: &mut H) {
1836 (self as *const AdtDef).hash(s)
1840 impl<'tcx> serialize::UseSpecializedEncodable for &'tcx AdtDef {
1841 fn default_encode<S: Encoder>(&self, s: &mut S) -> Result<(), S::Error> {
1846 impl<'tcx> serialize::UseSpecializedDecodable for &'tcx AdtDef {}
1849 impl<'a> HashStable<StableHashingContext<'a>> for AdtDef {
1850 fn hash_stable<W: StableHasherResult>(&self,
1851 hcx: &mut StableHashingContext<'a>,
1852 hasher: &mut StableHasher<W>) {
1854 static CACHE: RefCell<FxHashMap<usize, Fingerprint>> =
1855 RefCell::new(FxHashMap());
1858 let hash: Fingerprint = CACHE.with(|cache| {
1859 let addr = self as *const AdtDef as usize;
1860 *cache.borrow_mut().entry(addr).or_insert_with(|| {
1868 let mut hasher = StableHasher::new();
1869 did.hash_stable(hcx, &mut hasher);
1870 variants.hash_stable(hcx, &mut hasher);
1871 flags.hash_stable(hcx, &mut hasher);
1872 repr.hash_stable(hcx, &mut hasher);
1878 hash.hash_stable(hcx, hasher);
1882 #[derive(Copy, Clone, Debug, Eq, PartialEq, Hash)]
1883 pub enum AdtKind { Struct, Union, Enum }
1885 impl Into<DataTypeKind> for AdtKind {
1886 fn into(self) -> DataTypeKind {
1888 AdtKind::Struct => DataTypeKind::Struct,
1889 AdtKind::Union => DataTypeKind::Union,
1890 AdtKind::Enum => DataTypeKind::Enum,
1896 #[derive(RustcEncodable, RustcDecodable, Default)]
1897 pub struct ReprFlags: u8 {
1898 const IS_C = 1 << 0;
1899 const IS_SIMD = 1 << 1;
1900 const IS_TRANSPARENT = 1 << 2;
1901 // Internal only for now. If true, don't reorder fields.
1902 const IS_LINEAR = 1 << 3;
1904 // Any of these flags being set prevent field reordering optimisation.
1905 const IS_UNOPTIMISABLE = ReprFlags::IS_C.bits |
1906 ReprFlags::IS_SIMD.bits |
1907 ReprFlags::IS_LINEAR.bits;
1911 impl_stable_hash_for!(struct ReprFlags {
1917 /// Represents the repr options provided by the user,
1918 #[derive(Copy, Clone, Debug, Eq, PartialEq, RustcEncodable, RustcDecodable, Default)]
1919 pub struct ReprOptions {
1920 pub int: Option<attr::IntType>,
1923 pub flags: ReprFlags,
1926 impl_stable_hash_for!(struct ReprOptions {
1934 pub fn new(tcx: TyCtxt<'_, '_, '_>, did: DefId) -> ReprOptions {
1935 let mut flags = ReprFlags::empty();
1936 let mut size = None;
1937 let mut max_align = 0;
1938 let mut min_pack = 0;
1939 for attr in tcx.get_attrs(did).iter() {
1940 for r in attr::find_repr_attrs(tcx.sess.diagnostic(), attr) {
1941 flags.insert(match r {
1942 attr::ReprC => ReprFlags::IS_C,
1943 attr::ReprPacked(pack) => {
1944 min_pack = if min_pack > 0 {
1945 cmp::min(pack, min_pack)
1951 attr::ReprTransparent => ReprFlags::IS_TRANSPARENT,
1952 attr::ReprSimd => ReprFlags::IS_SIMD,
1953 attr::ReprInt(i) => {
1957 attr::ReprAlign(align) => {
1958 max_align = cmp::max(align, max_align);
1965 // This is here instead of layout because the choice must make it into metadata.
1966 if !tcx.consider_optimizing(|| format!("Reorder fields of {:?}", tcx.item_path_str(did))) {
1967 flags.insert(ReprFlags::IS_LINEAR);
1969 ReprOptions { int: size, align: max_align, pack: min_pack, flags: flags }
1973 pub fn simd(&self) -> bool { self.flags.contains(ReprFlags::IS_SIMD) }
1975 pub fn c(&self) -> bool { self.flags.contains(ReprFlags::IS_C) }
1977 pub fn packed(&self) -> bool { self.pack > 0 }
1979 pub fn transparent(&self) -> bool { self.flags.contains(ReprFlags::IS_TRANSPARENT) }
1981 pub fn linear(&self) -> bool { self.flags.contains(ReprFlags::IS_LINEAR) }
1983 pub fn discr_type(&self) -> attr::IntType {
1984 self.int.unwrap_or(attr::SignedInt(ast::IntTy::Isize))
1987 /// Returns true if this `#[repr()]` should inhabit "smart enum
1988 /// layout" optimizations, such as representing `Foo<&T>` as a
1990 pub fn inhibit_enum_layout_opt(&self) -> bool {
1991 self.c() || self.int.is_some()
1994 /// Returns true if this `#[repr()]` should inhibit struct field reordering
1995 /// optimizations, such as with repr(C) or repr(packed(1)).
1996 pub fn inhibit_struct_field_reordering_opt(&self) -> bool {
1997 !(self.flags & ReprFlags::IS_UNOPTIMISABLE).is_empty() || (self.pack == 1)
2001 impl<'a, 'gcx, 'tcx> AdtDef {
2002 fn new(tcx: TyCtxt<'_, '_, '_>,
2005 variants: Vec<VariantDef>,
2006 repr: ReprOptions) -> Self {
2007 debug!("AdtDef::new({:?}, {:?}, {:?}, {:?})", did, kind, variants, repr);
2008 let mut flags = AdtFlags::NO_ADT_FLAGS;
2009 let attrs = tcx.get_attrs(did);
2010 if attr::contains_name(&attrs, "fundamental") {
2011 flags = flags | AdtFlags::IS_FUNDAMENTAL;
2013 if Some(did) == tcx.lang_items().phantom_data() {
2014 flags = flags | AdtFlags::IS_PHANTOM_DATA;
2016 if Some(did) == tcx.lang_items().owned_box() {
2017 flags = flags | AdtFlags::IS_BOX;
2019 if kind == AdtKind::Enum && tcx.has_attr(did, "non_exhaustive") {
2020 debug!("found non-exhaustive variant list for {:?}", did);
2021 flags = flags | AdtFlags::IS_VARIANT_LIST_NON_EXHAUSTIVE;
2024 AdtKind::Enum => flags = flags | AdtFlags::IS_ENUM,
2025 AdtKind::Union => flags = flags | AdtFlags::IS_UNION,
2026 AdtKind::Struct => {}
2037 pub fn is_struct(&self) -> bool {
2038 !self.is_union() && !self.is_enum()
2042 pub fn is_union(&self) -> bool {
2043 self.flags.intersects(AdtFlags::IS_UNION)
2047 pub fn is_enum(&self) -> bool {
2048 self.flags.intersects(AdtFlags::IS_ENUM)
2052 pub fn is_variant_list_non_exhaustive(&self) -> bool {
2053 self.flags.intersects(AdtFlags::IS_VARIANT_LIST_NON_EXHAUSTIVE)
2056 /// Returns the kind of the ADT - Struct or Enum.
2058 pub fn adt_kind(&self) -> AdtKind {
2061 } else if self.is_union() {
2068 pub fn descr(&self) -> &'static str {
2069 match self.adt_kind() {
2070 AdtKind::Struct => "struct",
2071 AdtKind::Union => "union",
2072 AdtKind::Enum => "enum",
2076 pub fn variant_descr(&self) -> &'static str {
2077 match self.adt_kind() {
2078 AdtKind::Struct => "struct",
2079 AdtKind::Union => "union",
2080 AdtKind::Enum => "variant",
2084 /// Returns whether this type is #[fundamental] for the purposes
2085 /// of coherence checking.
2087 pub fn is_fundamental(&self) -> bool {
2088 self.flags.intersects(AdtFlags::IS_FUNDAMENTAL)
2091 /// Returns true if this is PhantomData<T>.
2093 pub fn is_phantom_data(&self) -> bool {
2094 self.flags.intersects(AdtFlags::IS_PHANTOM_DATA)
2097 /// Returns true if this is Box<T>.
2099 pub fn is_box(&self) -> bool {
2100 self.flags.intersects(AdtFlags::IS_BOX)
2103 /// Returns whether this type has a destructor.
2104 pub fn has_dtor(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> bool {
2105 self.destructor(tcx).is_some()
2108 /// Asserts this is a struct or union and returns its unique variant.
2109 pub fn non_enum_variant(&self) -> &VariantDef {
2110 assert!(self.is_struct() || self.is_union());
2115 pub fn predicates(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> GenericPredicates<'gcx> {
2116 tcx.predicates_of(self.did)
2119 /// Returns an iterator over all fields contained
2122 pub fn all_fields<'s>(&'s self) -> impl Iterator<Item = &'s FieldDef> {
2123 self.variants.iter().flat_map(|v| v.fields.iter())
2126 pub fn is_payloadfree(&self) -> bool {
2127 !self.variants.is_empty() &&
2128 self.variants.iter().all(|v| v.fields.is_empty())
2131 pub fn variant_with_id(&self, vid: DefId) -> &VariantDef {
2134 .find(|v| v.did == vid)
2135 .expect("variant_with_id: unknown variant")
2138 pub fn variant_index_with_id(&self, vid: DefId) -> usize {
2141 .position(|v| v.did == vid)
2142 .expect("variant_index_with_id: unknown variant")
2145 pub fn variant_of_def(&self, def: Def) -> &VariantDef {
2147 Def::Variant(vid) | Def::VariantCtor(vid, ..) => self.variant_with_id(vid),
2148 Def::Struct(..) | Def::StructCtor(..) | Def::Union(..) |
2149 Def::TyAlias(..) | Def::AssociatedTy(..) | Def::SelfTy(..) |
2150 Def::SelfCtor(..) => self.non_enum_variant(),
2151 _ => bug!("unexpected def {:?} in variant_of_def", def)
2156 pub fn eval_explicit_discr(
2158 tcx: TyCtxt<'a, 'gcx, 'tcx>,
2160 ) -> Option<Discr<'tcx>> {
2161 let param_env = ParamEnv::empty();
2162 let repr_type = self.repr.discr_type();
2163 let substs = Substs::identity_for_item(tcx.global_tcx(), expr_did);
2164 let instance = ty::Instance::new(expr_did, substs);
2165 let cid = GlobalId {
2169 match tcx.const_eval(param_env.and(cid)) {
2171 // FIXME: Find the right type and use it instead of `val.ty` here
2172 if let Some(b) = val.assert_bits(tcx.global_tcx(), param_env.and(val.ty)) {
2173 trace!("discriminants: {} ({:?})", b, repr_type);
2179 info!("invalid enum discriminant: {:#?}", val);
2180 ::mir::interpret::struct_error(
2181 tcx.at(tcx.def_span(expr_did)),
2182 "constant evaluation of enum discriminant resulted in non-integer",
2188 err.report_as_error(
2189 tcx.at(tcx.def_span(expr_did)),
2190 "could not evaluate enum discriminant",
2192 if !expr_did.is_local() {
2193 span_bug!(tcx.def_span(expr_did),
2194 "variant discriminant evaluation succeeded \
2195 in its crate but failed locally");
2203 pub fn discriminants(
2205 tcx: TyCtxt<'a, 'gcx, 'tcx>,
2206 ) -> impl Iterator<Item=Discr<'tcx>> + Captures<'gcx> + 'a {
2207 let repr_type = self.repr.discr_type();
2208 let initial = repr_type.initial_discriminant(tcx.global_tcx());
2209 let mut prev_discr = None::<Discr<'tcx>>;
2210 self.variants.iter().map(move |v| {
2211 let mut discr = prev_discr.map_or(initial, |d| d.wrap_incr(tcx));
2212 if let VariantDiscr::Explicit(expr_did) = v.discr {
2213 if let Some(new_discr) = self.eval_explicit_discr(tcx, expr_did) {
2217 prev_discr = Some(discr);
2223 /// Compute the discriminant value used by a specific variant.
2224 /// Unlike `discriminants`, this is (amortized) constant-time,
2225 /// only doing at most one query for evaluating an explicit
2226 /// discriminant (the last one before the requested variant),
2227 /// assuming there are no constant-evaluation errors there.
2228 pub fn discriminant_for_variant(&self,
2229 tcx: TyCtxt<'a, 'gcx, 'tcx>,
2230 variant_index: usize)
2232 let (val, offset) = self.discriminant_def_for_variant(variant_index);
2233 let explicit_value = val
2234 .and_then(|expr_did| self.eval_explicit_discr(tcx, expr_did))
2235 .unwrap_or_else(|| self.repr.discr_type().initial_discriminant(tcx.global_tcx()));
2236 explicit_value.checked_add(tcx, offset as u128).0
2239 /// Yields a DefId for the discriminant and an offset to add to it
2240 /// Alternatively, if there is no explicit discriminant, returns the
2241 /// inferred discriminant directly
2242 pub fn discriminant_def_for_variant(
2244 variant_index: usize,
2245 ) -> (Option<DefId>, usize) {
2246 let mut explicit_index = variant_index;
2249 match self.variants[explicit_index].discr {
2250 ty::VariantDiscr::Relative(0) => {
2254 ty::VariantDiscr::Relative(distance) => {
2255 explicit_index -= distance;
2257 ty::VariantDiscr::Explicit(did) => {
2258 expr_did = Some(did);
2263 (expr_did, variant_index - explicit_index)
2266 pub fn destructor(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Destructor> {
2267 tcx.adt_destructor(self.did)
2270 /// Returns a list of types such that `Self: Sized` if and only
2271 /// if that type is Sized, or `TyErr` if this type is recursive.
2273 /// Oddly enough, checking that the sized-constraint is Sized is
2274 /// actually more expressive than checking all members:
2275 /// the Sized trait is inductive, so an associated type that references
2276 /// Self would prevent its containing ADT from being Sized.
2278 /// Due to normalization being eager, this applies even if
2279 /// the associated type is behind a pointer, e.g. issue #31299.
2280 pub fn sized_constraint(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> &'tcx [Ty<'tcx>] {
2281 match tcx.try_adt_sized_constraint(DUMMY_SP, self.did) {
2284 debug!("adt_sized_constraint: {:?} is recursive", self);
2285 // This should be reported as an error by `check_representable`.
2287 // Consider the type as Sized in the meanwhile to avoid
2288 // further errors. Delay our `bug` diagnostic here to get
2289 // emitted later as well in case we accidentally otherwise don't
2292 tcx.intern_type_list(&[tcx.types.err])
2297 fn sized_constraint_for_ty(&self,
2298 tcx: TyCtxt<'a, 'tcx, 'tcx>,
2301 let result = match ty.sty {
2302 Bool | Char | Int(..) | Uint(..) | Float(..) |
2303 RawPtr(..) | Ref(..) | FnDef(..) | FnPtr(_) |
2304 Array(..) | Closure(..) | Generator(..) | Never => {
2313 GeneratorWitness(..) => {
2314 // these are never sized - return the target type
2321 Some(ty) => self.sized_constraint_for_ty(tcx, ty)
2325 Adt(adt, substs) => {
2327 let adt_tys = adt.sized_constraint(tcx);
2328 debug!("sized_constraint_for_ty({:?}) intermediate = {:?}",
2331 .map(|ty| ty.subst(tcx, substs))
2332 .flat_map(|ty| self.sized_constraint_for_ty(tcx, ty))
2336 Projection(..) | Opaque(..) => {
2337 // must calculate explicitly.
2338 // FIXME: consider special-casing always-Sized projections
2343 // perf hack: if there is a `T: Sized` bound, then
2344 // we know that `T` is Sized and do not need to check
2347 let sized_trait = match tcx.lang_items().sized_trait() {
2349 _ => return vec![ty]
2351 let sized_predicate = Binder::dummy(TraitRef {
2352 def_id: sized_trait,
2353 substs: tcx.mk_substs_trait(ty, &[])
2355 let predicates = tcx.predicates_of(self.did).predicates;
2356 if predicates.into_iter().any(|(p, _)| p == sized_predicate) {
2364 bug!("unexpected type `{:?}` in sized_constraint_for_ty",
2368 debug!("sized_constraint_for_ty({:?}) = {:?}", ty, result);
2373 impl<'a, 'gcx, 'tcx> FieldDef {
2374 pub fn ty(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>, subst: &Substs<'tcx>) -> Ty<'tcx> {
2375 tcx.type_of(self.did).subst(tcx, subst)
2379 /// Represents the various closure traits in the Rust language. This
2380 /// will determine the type of the environment (`self`, in the
2381 /// desuaring) argument that the closure expects.
2383 /// You can get the environment type of a closure using
2384 /// `tcx.closure_env_ty()`.
2385 #[derive(Clone, Copy, PartialOrd, Ord, PartialEq, Eq, Hash, Debug, RustcEncodable, RustcDecodable)]
2386 pub enum ClosureKind {
2387 // Warning: Ordering is significant here! The ordering is chosen
2388 // because the trait Fn is a subtrait of FnMut and so in turn, and
2389 // hence we order it so that Fn < FnMut < FnOnce.
2395 impl<'a, 'tcx> ClosureKind {
2396 // This is the initial value used when doing upvar inference.
2397 pub const LATTICE_BOTTOM: ClosureKind = ClosureKind::Fn;
2399 pub fn trait_did(&self, tcx: TyCtxt<'a, 'tcx, 'tcx>) -> DefId {
2401 ClosureKind::Fn => tcx.require_lang_item(FnTraitLangItem),
2402 ClosureKind::FnMut => {
2403 tcx.require_lang_item(FnMutTraitLangItem)
2405 ClosureKind::FnOnce => {
2406 tcx.require_lang_item(FnOnceTraitLangItem)
2411 /// True if this a type that impls this closure kind
2412 /// must also implement `other`.
2413 pub fn extends(self, other: ty::ClosureKind) -> bool {
2414 match (self, other) {
2415 (ClosureKind::Fn, ClosureKind::Fn) => true,
2416 (ClosureKind::Fn, ClosureKind::FnMut) => true,
2417 (ClosureKind::Fn, ClosureKind::FnOnce) => true,
2418 (ClosureKind::FnMut, ClosureKind::FnMut) => true,
2419 (ClosureKind::FnMut, ClosureKind::FnOnce) => true,
2420 (ClosureKind::FnOnce, ClosureKind::FnOnce) => true,
2425 /// Returns the representative scalar type for this closure kind.
2426 /// See `TyS::to_opt_closure_kind` for more details.
2427 pub fn to_ty(self, tcx: TyCtxt<'_, '_, 'tcx>) -> Ty<'tcx> {
2429 ty::ClosureKind::Fn => tcx.types.i8,
2430 ty::ClosureKind::FnMut => tcx.types.i16,
2431 ty::ClosureKind::FnOnce => tcx.types.i32,
2436 impl<'tcx> TyS<'tcx> {
2437 /// Iterator that walks `self` and any types reachable from
2438 /// `self`, in depth-first order. Note that just walks the types
2439 /// that appear in `self`, it does not descend into the fields of
2440 /// structs or variants. For example:
2443 /// isize => { isize }
2444 /// Foo<Bar<isize>> => { Foo<Bar<isize>>, Bar<isize>, isize }
2445 /// [isize] => { [isize], isize }
2447 pub fn walk(&'tcx self) -> TypeWalker<'tcx> {
2448 TypeWalker::new(self)
2451 /// Iterator that walks the immediate children of `self`. Hence
2452 /// `Foo<Bar<i32>, u32>` yields the sequence `[Bar<i32>, u32]`
2453 /// (but not `i32`, like `walk`).
2454 pub fn walk_shallow(&'tcx self) -> smallvec::IntoIter<walk::TypeWalkerArray<'tcx>> {
2455 walk::walk_shallow(self)
2458 /// Walks `ty` and any types appearing within `ty`, invoking the
2459 /// callback `f` on each type. If the callback returns false, then the
2460 /// children of the current type are ignored.
2462 /// Note: prefer `ty.walk()` where possible.
2463 pub fn maybe_walk<F>(&'tcx self, mut f: F)
2464 where F : FnMut(Ty<'tcx>) -> bool
2466 let mut walker = self.walk();
2467 while let Some(ty) = walker.next() {
2469 walker.skip_current_subtree();
2476 pub fn from_mutbl(m: hir::Mutability) -> BorrowKind {
2478 hir::MutMutable => MutBorrow,
2479 hir::MutImmutable => ImmBorrow,
2483 /// Returns a mutability `m` such that an `&m T` pointer could be used to obtain this borrow
2484 /// kind. Because borrow kinds are richer than mutabilities, we sometimes have to pick a
2485 /// mutability that is stronger than necessary so that it at least *would permit* the borrow in
2487 pub fn to_mutbl_lossy(self) -> hir::Mutability {
2489 MutBorrow => hir::MutMutable,
2490 ImmBorrow => hir::MutImmutable,
2492 // We have no type corresponding to a unique imm borrow, so
2493 // use `&mut`. It gives all the capabilities of an `&uniq`
2494 // and hence is a safe "over approximation".
2495 UniqueImmBorrow => hir::MutMutable,
2499 pub fn to_user_str(&self) -> &'static str {
2501 MutBorrow => "mutable",
2502 ImmBorrow => "immutable",
2503 UniqueImmBorrow => "uniquely immutable",
2508 #[derive(Debug, Clone)]
2509 pub enum Attributes<'gcx> {
2510 Owned(Lrc<[ast::Attribute]>),
2511 Borrowed(&'gcx [ast::Attribute])
2514 impl<'gcx> ::std::ops::Deref for Attributes<'gcx> {
2515 type Target = [ast::Attribute];
2517 fn deref(&self) -> &[ast::Attribute] {
2519 &Attributes::Owned(ref data) => &data,
2520 &Attributes::Borrowed(data) => data
2525 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2526 pub fn body_tables(self, body: hir::BodyId) -> &'gcx TypeckTables<'gcx> {
2527 self.typeck_tables_of(self.hir.body_owner_def_id(body))
2530 /// Returns an iterator of the def-ids for all body-owners in this
2531 /// crate. If you would prefer to iterate over the bodies
2532 /// themselves, you can do `self.hir.krate().body_ids.iter()`.
2535 ) -> impl Iterator<Item = DefId> + Captures<'tcx> + Captures<'gcx> + 'a {
2539 .map(move |&body_id| self.hir.body_owner_def_id(body_id))
2542 pub fn par_body_owners<F: Fn(DefId) + sync::Sync + sync::Send>(self, f: F) {
2543 par_iter(&self.hir.krate().body_ids).for_each(|&body_id| {
2544 f(self.hir.body_owner_def_id(body_id))
2548 pub fn expr_span(self, id: NodeId) -> Span {
2549 match self.hir.find(id) {
2550 Some(Node::Expr(e)) => {
2554 bug!("Node id {} is not an expr: {:?}", id, f);
2557 bug!("Node id {} is not present in the node map", id);
2562 pub fn provided_trait_methods(self, id: DefId) -> Vec<AssociatedItem> {
2563 self.associated_items(id)
2564 .filter(|item| item.kind == AssociatedKind::Method && item.defaultness.has_value())
2568 pub fn trait_relevant_for_never(self, did: DefId) -> bool {
2569 self.associated_items(did).any(|item| {
2570 item.relevant_for_never()
2574 pub fn opt_associated_item(self, def_id: DefId) -> Option<AssociatedItem> {
2575 let is_associated_item = if let Some(node_id) = self.hir.as_local_node_id(def_id) {
2576 match self.hir.get(node_id) {
2577 Node::TraitItem(_) | Node::ImplItem(_) => true,
2581 match self.describe_def(def_id).expect("no def for def-id") {
2582 Def::AssociatedConst(_) | Def::Method(_) | Def::AssociatedTy(_) => true,
2587 if is_associated_item {
2588 Some(self.associated_item(def_id))
2594 fn associated_item_from_trait_item_ref(self,
2595 parent_def_id: DefId,
2596 parent_vis: &hir::Visibility,
2597 trait_item_ref: &hir::TraitItemRef)
2599 let def_id = self.hir.local_def_id(trait_item_ref.id.node_id);
2600 let (kind, has_self) = match trait_item_ref.kind {
2601 hir::AssociatedItemKind::Const => (ty::AssociatedKind::Const, false),
2602 hir::AssociatedItemKind::Method { has_self } => {
2603 (ty::AssociatedKind::Method, has_self)
2605 hir::AssociatedItemKind::Type => (ty::AssociatedKind::Type, false),
2606 hir::AssociatedItemKind::Existential => bug!("only impls can have existentials"),
2610 ident: trait_item_ref.ident,
2612 // Visibility of trait items is inherited from their traits.
2613 vis: Visibility::from_hir(parent_vis, trait_item_ref.id.node_id, self),
2614 defaultness: trait_item_ref.defaultness,
2616 container: TraitContainer(parent_def_id),
2617 method_has_self_argument: has_self
2621 fn associated_item_from_impl_item_ref(self,
2622 parent_def_id: DefId,
2623 impl_item_ref: &hir::ImplItemRef)
2625 let def_id = self.hir.local_def_id(impl_item_ref.id.node_id);
2626 let (kind, has_self) = match impl_item_ref.kind {
2627 hir::AssociatedItemKind::Const => (ty::AssociatedKind::Const, false),
2628 hir::AssociatedItemKind::Method { has_self } => {
2629 (ty::AssociatedKind::Method, has_self)
2631 hir::AssociatedItemKind::Type => (ty::AssociatedKind::Type, false),
2632 hir::AssociatedItemKind::Existential => (ty::AssociatedKind::Existential, false),
2636 ident: impl_item_ref.ident,
2638 // Visibility of trait impl items doesn't matter.
2639 vis: ty::Visibility::from_hir(&impl_item_ref.vis, impl_item_ref.id.node_id, self),
2640 defaultness: impl_item_ref.defaultness,
2642 container: ImplContainer(parent_def_id),
2643 method_has_self_argument: has_self
2647 pub fn field_index(self, node_id: NodeId, tables: &TypeckTables<'_>) -> usize {
2648 let hir_id = self.hir.node_to_hir_id(node_id);
2649 tables.field_indices().get(hir_id).cloned().expect("no index for a field")
2652 pub fn find_field_index(self, ident: Ident, variant: &VariantDef) -> Option<usize> {
2653 variant.fields.iter().position(|field| {
2654 self.adjust_ident(ident, variant.did, DUMMY_NODE_ID).0 == field.ident.modern()
2658 pub fn associated_items(
2661 ) -> impl Iterator<Item = AssociatedItem> + 'a {
2662 let def_ids = self.associated_item_def_ids(def_id);
2663 Box::new((0..def_ids.len()).map(move |i| self.associated_item(def_ids[i])))
2664 as Box<dyn Iterator<Item = AssociatedItem> + 'a>
2667 /// Returns true if the impls are the same polarity and the trait either
2668 /// has no items or is annotated #[marker] and prevents item overrides.
2669 pub fn impls_are_allowed_to_overlap(self, def_id1: DefId, def_id2: DefId) -> bool {
2670 if self.features().overlapping_marker_traits {
2671 let trait1_is_empty = self.impl_trait_ref(def_id1)
2672 .map_or(false, |trait_ref| {
2673 self.associated_item_def_ids(trait_ref.def_id).is_empty()
2675 let trait2_is_empty = self.impl_trait_ref(def_id2)
2676 .map_or(false, |trait_ref| {
2677 self.associated_item_def_ids(trait_ref.def_id).is_empty()
2679 self.impl_polarity(def_id1) == self.impl_polarity(def_id2)
2682 } else if self.features().marker_trait_attr {
2683 let is_marker_impl = |def_id: DefId| -> bool {
2684 let trait_ref = self.impl_trait_ref(def_id);
2685 trait_ref.map_or(false, |tr| self.trait_def(tr.def_id).is_marker)
2687 self.impl_polarity(def_id1) == self.impl_polarity(def_id2)
2688 && is_marker_impl(def_id1)
2689 && is_marker_impl(def_id2)
2695 // Returns `ty::VariantDef` if `def` refers to a struct,
2696 // or variant or their constructors, panics otherwise.
2697 pub fn expect_variant_def(self, def: Def) -> &'tcx VariantDef {
2699 Def::Variant(did) | Def::VariantCtor(did, ..) => {
2700 let enum_did = self.parent_def_id(did).unwrap();
2701 self.adt_def(enum_did).variant_with_id(did)
2703 Def::Struct(did) | Def::Union(did) => {
2704 self.adt_def(did).non_enum_variant()
2706 Def::StructCtor(ctor_did, ..) => {
2707 let did = self.parent_def_id(ctor_did).expect("struct ctor has no parent");
2708 self.adt_def(did).non_enum_variant()
2710 _ => bug!("expect_variant_def used with unexpected def {:?}", def)
2714 /// Given a `VariantDef`, returns the def-id of the `AdtDef` of which it is a part.
2715 pub fn adt_def_id_of_variant(self, variant_def: &'tcx VariantDef) -> DefId {
2716 let def_key = self.def_key(variant_def.did);
2717 match def_key.disambiguated_data.data {
2718 // for enum variants and tuple structs, the def-id of the ADT itself
2719 // is the *parent* of the variant
2720 DefPathData::EnumVariant(..) | DefPathData::StructCtor =>
2721 DefId { krate: variant_def.did.krate, index: def_key.parent.unwrap() },
2723 // otherwise, for structs and unions, they share a def-id
2724 _ => variant_def.did,
2728 pub fn item_name(self, id: DefId) -> InternedString {
2729 if id.index == CRATE_DEF_INDEX {
2730 self.original_crate_name(id.krate).as_interned_str()
2732 let def_key = self.def_key(id);
2733 // The name of a StructCtor is that of its struct parent.
2734 if let hir_map::DefPathData::StructCtor = def_key.disambiguated_data.data {
2735 self.item_name(DefId {
2737 index: def_key.parent.unwrap()
2740 def_key.disambiguated_data.data.get_opt_name().unwrap_or_else(|| {
2741 bug!("item_name: no name for {:?}", self.def_path(id));
2747 /// Return the possibly-auto-generated MIR of a (DefId, Subst) pair.
2748 pub fn instance_mir(self, instance: ty::InstanceDef<'gcx>)
2752 ty::InstanceDef::Item(did) => {
2753 self.optimized_mir(did)
2755 ty::InstanceDef::Intrinsic(..) |
2756 ty::InstanceDef::FnPtrShim(..) |
2757 ty::InstanceDef::Virtual(..) |
2758 ty::InstanceDef::ClosureOnceShim { .. } |
2759 ty::InstanceDef::DropGlue(..) |
2760 ty::InstanceDef::CloneShim(..) => {
2761 self.mir_shims(instance)
2766 /// Given the DefId of an item, returns its MIR, borrowed immutably.
2767 /// Returns None if there is no MIR for the DefId
2768 pub fn maybe_optimized_mir(self, did: DefId) -> Option<&'gcx Mir<'gcx>> {
2769 if self.is_mir_available(did) {
2770 Some(self.optimized_mir(did))
2776 /// Get the attributes of a definition.
2777 pub fn get_attrs(self, did: DefId) -> Attributes<'gcx> {
2778 if let Some(id) = self.hir.as_local_node_id(did) {
2779 Attributes::Borrowed(self.hir.attrs(id))
2781 Attributes::Owned(self.item_attrs(did))
2785 /// Determine whether an item is annotated with an attribute
2786 pub fn has_attr(self, did: DefId, attr: &str) -> bool {
2787 attr::contains_name(&self.get_attrs(did), attr)
2790 /// Returns true if this is an `auto trait`.
2791 pub fn trait_is_auto(self, trait_def_id: DefId) -> bool {
2792 self.trait_def(trait_def_id).has_auto_impl
2795 pub fn generator_layout(self, def_id: DefId) -> &'tcx GeneratorLayout<'tcx> {
2796 self.optimized_mir(def_id).generator_layout.as_ref().unwrap()
2799 /// Given the def_id of an impl, return the def_id of the trait it implements.
2800 /// If it implements no trait, return `None`.
2801 pub fn trait_id_of_impl(self, def_id: DefId) -> Option<DefId> {
2802 self.impl_trait_ref(def_id).map(|tr| tr.def_id)
2805 /// If the given def ID describes a method belonging to an impl, return the
2806 /// ID of the impl that the method belongs to. Otherwise, return `None`.
2807 pub fn impl_of_method(self, def_id: DefId) -> Option<DefId> {
2808 let item = if def_id.krate != LOCAL_CRATE {
2809 if let Some(Def::Method(_)) = self.describe_def(def_id) {
2810 Some(self.associated_item(def_id))
2815 self.opt_associated_item(def_id)
2818 item.and_then(|trait_item|
2819 match trait_item.container {
2820 TraitContainer(_) => None,
2821 ImplContainer(def_id) => Some(def_id),
2826 /// Looks up the span of `impl_did` if the impl is local; otherwise returns `Err`
2827 /// with the name of the crate containing the impl.
2828 pub fn span_of_impl(self, impl_did: DefId) -> Result<Span, Symbol> {
2829 if impl_did.is_local() {
2830 let node_id = self.hir.as_local_node_id(impl_did).unwrap();
2831 Ok(self.hir.span(node_id))
2833 Err(self.crate_name(impl_did.krate))
2837 // Hygienically compare a use-site name (`use_name`) for a field or an associated item with its
2838 // supposed definition name (`def_name`). The method also needs `DefId` of the supposed
2839 // definition's parent/scope to perform comparison.
2840 pub fn hygienic_eq(self, use_name: Ident, def_name: Ident, def_parent_def_id: DefId) -> bool {
2841 self.adjust_ident(use_name, def_parent_def_id, DUMMY_NODE_ID).0 == def_name.modern()
2844 pub fn adjust_ident(self, mut ident: Ident, scope: DefId, block: NodeId) -> (Ident, DefId) {
2845 ident = ident.modern();
2846 let target_expansion = match scope.krate {
2847 LOCAL_CRATE => self.hir.definitions().expansion_that_defined(scope.index),
2850 let scope = match ident.span.adjust(target_expansion) {
2851 Some(actual_expansion) =>
2852 self.hir.definitions().parent_module_of_macro_def(actual_expansion),
2853 None if block == DUMMY_NODE_ID => DefId::local(CRATE_DEF_INDEX), // Dummy DefId
2854 None => self.hir.get_module_parent(block),
2860 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2861 pub fn with_freevars<T, F>(self, fid: NodeId, f: F) -> T where
2862 F: FnOnce(&[hir::Freevar]) -> T,
2864 let def_id = self.hir.local_def_id(fid);
2865 match self.freevars(def_id) {
2872 fn associated_item<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, def_id: DefId)
2875 let id = tcx.hir.as_local_node_id(def_id).unwrap();
2876 let parent_id = tcx.hir.get_parent(id);
2877 let parent_def_id = tcx.hir.local_def_id(parent_id);
2878 let parent_item = tcx.hir.expect_item(parent_id);
2879 match parent_item.node {
2880 hir::ItemKind::Impl(.., ref impl_item_refs) => {
2881 if let Some(impl_item_ref) = impl_item_refs.iter().find(|i| i.id.node_id == id) {
2882 let assoc_item = tcx.associated_item_from_impl_item_ref(parent_def_id,
2884 debug_assert_eq!(assoc_item.def_id, def_id);
2889 hir::ItemKind::Trait(.., ref trait_item_refs) => {
2890 if let Some(trait_item_ref) = trait_item_refs.iter().find(|i| i.id.node_id == id) {
2891 let assoc_item = tcx.associated_item_from_trait_item_ref(parent_def_id,
2894 debug_assert_eq!(assoc_item.def_id, def_id);
2902 span_bug!(parent_item.span,
2903 "unexpected parent of trait or impl item or item not found: {:?}",
2907 /// Calculates the Sized-constraint.
2909 /// In fact, there are only a few options for the types in the constraint:
2910 /// - an obviously-unsized type
2911 /// - a type parameter or projection whose Sizedness can't be known
2912 /// - a tuple of type parameters or projections, if there are multiple
2914 /// - a Error, if a type contained itself. The representability
2915 /// check should catch this case.
2916 fn adt_sized_constraint<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
2918 -> &'tcx [Ty<'tcx>] {
2919 let def = tcx.adt_def(def_id);
2921 let result = tcx.mk_type_list(def.variants.iter().flat_map(|v| {
2924 def.sized_constraint_for_ty(tcx, tcx.type_of(f.did))
2927 debug!("adt_sized_constraint: {:?} => {:?}", def, result);
2932 fn associated_item_def_ids<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
2934 -> Lrc<Vec<DefId>> {
2935 let id = tcx.hir.as_local_node_id(def_id).unwrap();
2936 let item = tcx.hir.expect_item(id);
2937 let vec: Vec<_> = match item.node {
2938 hir::ItemKind::Trait(.., ref trait_item_refs) => {
2939 trait_item_refs.iter()
2940 .map(|trait_item_ref| trait_item_ref.id)
2941 .map(|id| tcx.hir.local_def_id(id.node_id))
2944 hir::ItemKind::Impl(.., ref impl_item_refs) => {
2945 impl_item_refs.iter()
2946 .map(|impl_item_ref| impl_item_ref.id)
2947 .map(|id| tcx.hir.local_def_id(id.node_id))
2950 hir::ItemKind::TraitAlias(..) => vec![],
2951 _ => span_bug!(item.span, "associated_item_def_ids: not impl or trait")
2956 fn def_span<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, def_id: DefId) -> Span {
2957 tcx.hir.span_if_local(def_id).unwrap()
2960 /// If the given def ID describes an item belonging to a trait,
2961 /// return the ID of the trait that the trait item belongs to.
2962 /// Otherwise, return `None`.
2963 fn trait_of_item<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, def_id: DefId) -> Option<DefId> {
2964 tcx.opt_associated_item(def_id)
2965 .and_then(|associated_item| {
2966 match associated_item.container {
2967 TraitContainer(def_id) => Some(def_id),
2968 ImplContainer(_) => None
2973 /// Yields the parent function's `DefId` if `def_id` is an `impl Trait` definition
2974 pub fn is_impl_trait_defn(tcx: TyCtxt<'_, '_, '_>, def_id: DefId) -> Option<DefId> {
2975 if let Some(node_id) = tcx.hir.as_local_node_id(def_id) {
2976 if let Node::Item(item) = tcx.hir.get(node_id) {
2977 if let hir::ItemKind::Existential(ref exist_ty) = item.node {
2978 return exist_ty.impl_trait_fn;
2985 /// See `ParamEnv` struct def'n for details.
2986 fn param_env<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
2990 // The param_env of an impl Trait type is its defining function's param_env
2991 if let Some(parent) = is_impl_trait_defn(tcx, def_id) {
2992 return param_env(tcx, parent);
2994 // Compute the bounds on Self and the type parameters.
2996 let InstantiatedPredicates { predicates } =
2997 tcx.predicates_of(def_id).instantiate_identity(tcx);
2999 // Finally, we have to normalize the bounds in the environment, in
3000 // case they contain any associated type projections. This process
3001 // can yield errors if the put in illegal associated types, like
3002 // `<i32 as Foo>::Bar` where `i32` does not implement `Foo`. We
3003 // report these errors right here; this doesn't actually feel
3004 // right to me, because constructing the environment feels like a
3005 // kind of a "idempotent" action, but I'm not sure where would be
3006 // a better place. In practice, we construct environments for
3007 // every fn once during type checking, and we'll abort if there
3008 // are any errors at that point, so after type checking you can be
3009 // sure that this will succeed without errors anyway.
3011 let unnormalized_env = ty::ParamEnv::new(tcx.intern_predicates(&predicates),
3012 traits::Reveal::UserFacing);
3014 let body_id = tcx.hir.as_local_node_id(def_id).map_or(DUMMY_NODE_ID, |id| {
3015 tcx.hir.maybe_body_owned_by(id).map_or(id, |body| body.node_id)
3017 let cause = traits::ObligationCause::misc(tcx.def_span(def_id), body_id);
3018 traits::normalize_param_env_or_error(tcx, def_id, unnormalized_env, cause)
3021 fn crate_disambiguator<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3022 crate_num: CrateNum) -> CrateDisambiguator {
3023 assert_eq!(crate_num, LOCAL_CRATE);
3024 tcx.sess.local_crate_disambiguator()
3027 fn original_crate_name<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3028 crate_num: CrateNum) -> Symbol {
3029 assert_eq!(crate_num, LOCAL_CRATE);
3030 tcx.crate_name.clone()
3033 fn crate_hash<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3034 crate_num: CrateNum)
3036 assert_eq!(crate_num, LOCAL_CRATE);
3040 fn instance_def_size_estimate<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3041 instance_def: InstanceDef<'tcx>)
3043 match instance_def {
3044 InstanceDef::Item(..) |
3045 InstanceDef::DropGlue(..) => {
3046 let mir = tcx.instance_mir(instance_def);
3047 mir.basic_blocks().iter().map(|bb| bb.statements.len()).sum()
3049 // Estimate the size of other compiler-generated shims to be 1.
3054 pub fn provide(providers: &mut ty::query::Providers<'_>) {
3055 context::provide(providers);
3056 erase_regions::provide(providers);
3057 layout::provide(providers);
3058 util::provide(providers);
3059 *providers = ty::query::Providers {
3061 associated_item_def_ids,
3062 adt_sized_constraint,
3066 crate_disambiguator,
3067 original_crate_name,
3069 trait_impls_of: trait_def::trait_impls_of_provider,
3070 instance_def_size_estimate,
3075 /// A map for the local crate mapping each type to a vector of its
3076 /// inherent impls. This is not meant to be used outside of coherence;
3077 /// rather, you should request the vector for a specific type via
3078 /// `tcx.inherent_impls(def_id)` so as to minimize your dependencies
3079 /// (constructing this map requires touching the entire crate).
3080 #[derive(Clone, Debug)]
3081 pub struct CrateInherentImpls {
3082 pub inherent_impls: DefIdMap<Lrc<Vec<DefId>>>,
3085 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, RustcEncodable, RustcDecodable)]
3086 pub struct SymbolName {
3087 // FIXME: we don't rely on interning or equality here - better have
3088 // this be a `&'tcx str`.
3089 pub name: InternedString
3092 impl_stable_hash_for!(struct self::SymbolName {
3097 pub fn new(name: &str) -> SymbolName {
3099 name: Symbol::intern(name).as_interned_str()
3103 pub fn as_str(&self) -> LocalInternedString {
3108 impl fmt::Display for SymbolName {
3109 fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
3110 fmt::Display::fmt(&self.name, fmt)
3114 impl fmt::Debug for SymbolName {
3115 fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
3116 fmt::Display::fmt(&self.name, fmt)