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, FxHashSet};
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::indexed_vec::Idx;
61 use rustc_data_structures::stable_hasher::{StableHasher, StableHasherResult,
66 pub use self::sty::{Binder, BoundTy, BoundTyIndex, DebruijnIndex, INNERMOST};
67 pub use self::sty::{FnSig, GenSig, PolyFnSig, PolyGenSig};
68 pub use self::sty::{InferTy, ParamTy, ProjectionTy, ExistentialPredicate};
69 pub use self::sty::{ClosureSubsts, GeneratorSubsts, UpvarSubsts, TypeAndMut};
70 pub use self::sty::{TraitRef, TyKind, PolyTraitRef};
71 pub use self::sty::{ExistentialTraitRef, PolyExistentialTraitRef};
72 pub use self::sty::{ExistentialProjection, PolyExistentialProjection, Const};
73 pub use self::sty::{BoundRegion, EarlyBoundRegion, FreeRegion, Region};
74 pub use self::sty::RegionKind;
75 pub use self::sty::{TyVid, IntVid, FloatVid, RegionVid};
76 pub use self::sty::BoundRegion::*;
77 pub use self::sty::InferTy::*;
78 pub use self::sty::RegionKind::*;
79 pub use self::sty::TyKind::*;
81 pub use self::binding::BindingMode;
82 pub use self::binding::BindingMode::*;
84 pub use self::context::{TyCtxt, FreeRegionInfo, GlobalArenas, AllArenas, tls, keep_local};
85 pub use self::context::{Lift, TypeckTables};
87 pub use self::instance::{Instance, InstanceDef};
89 pub use self::trait_def::TraitDef;
91 pub use self::query::queries;
103 pub mod inhabitedness;
120 mod structural_impls;
125 /// The complete set of all analyses described in this module. This is
126 /// produced by the driver and fed to codegen and later passes.
128 /// NB: These contents are being migrated into queries using the
129 /// *on-demand* infrastructure.
131 pub struct CrateAnalysis {
132 pub access_levels: Lrc<AccessLevels>,
134 pub glob_map: Option<hir::GlobMap>,
138 pub struct Resolutions {
139 pub freevars: FreevarMap,
140 pub trait_map: TraitMap,
141 pub maybe_unused_trait_imports: NodeSet,
142 pub maybe_unused_extern_crates: Vec<(NodeId, Span)>,
143 pub export_map: ExportMap,
144 pub extern_prelude: FxHashSet<Name>,
147 #[derive(Clone, Copy, PartialEq, Eq, Debug)]
148 pub enum AssociatedItemContainer {
149 TraitContainer(DefId),
150 ImplContainer(DefId),
153 impl AssociatedItemContainer {
154 /// Asserts that this is the def-id of an associated item declared
155 /// in a trait, and returns the trait def-id.
156 pub fn assert_trait(&self) -> DefId {
158 TraitContainer(id) => id,
159 _ => bug!("associated item has wrong container type: {:?}", self)
163 pub fn id(&self) -> DefId {
165 TraitContainer(id) => id,
166 ImplContainer(id) => id,
171 /// The "header" of an impl is everything outside the body: a Self type, a trait
172 /// ref (in the case of a trait impl), and a set of predicates (from the
173 /// bounds/where clauses).
174 #[derive(Clone, PartialEq, Eq, Hash, Debug)]
175 pub struct ImplHeader<'tcx> {
176 pub impl_def_id: DefId,
177 pub self_ty: Ty<'tcx>,
178 pub trait_ref: Option<TraitRef<'tcx>>,
179 pub predicates: Vec<Predicate<'tcx>>,
182 #[derive(Copy, Clone, Debug, PartialEq)]
183 pub struct AssociatedItem {
186 pub kind: AssociatedKind,
188 pub defaultness: hir::Defaultness,
189 pub container: AssociatedItemContainer,
191 /// Whether this is a method with an explicit self
192 /// as its first argument, allowing method calls.
193 pub method_has_self_argument: bool,
196 #[derive(Copy, Clone, PartialEq, Eq, Debug, Hash, RustcEncodable, RustcDecodable)]
197 pub enum AssociatedKind {
204 impl AssociatedItem {
205 pub fn def(&self) -> Def {
207 AssociatedKind::Const => Def::AssociatedConst(self.def_id),
208 AssociatedKind::Method => Def::Method(self.def_id),
209 AssociatedKind::Type => Def::AssociatedTy(self.def_id),
210 AssociatedKind::Existential => Def::AssociatedExistential(self.def_id),
214 /// Tests whether the associated item admits a non-trivial implementation
216 pub fn relevant_for_never<'tcx>(&self) -> bool {
218 AssociatedKind::Existential |
219 AssociatedKind::Const |
220 AssociatedKind::Type => true,
221 // FIXME(canndrew): Be more thorough here, check if any argument is uninhabited.
222 AssociatedKind::Method => !self.method_has_self_argument,
226 pub fn signature<'a, 'tcx>(&self, tcx: &TyCtxt<'a, 'tcx, 'tcx>) -> String {
228 ty::AssociatedKind::Method => {
229 // We skip the binder here because the binder would deanonymize all
230 // late-bound regions, and we don't want method signatures to show up
231 // `as for<'r> fn(&'r MyType)`. Pretty-printing handles late-bound
232 // regions just fine, showing `fn(&MyType)`.
233 tcx.fn_sig(self.def_id).skip_binder().to_string()
235 ty::AssociatedKind::Type => format!("type {};", self.ident),
236 ty::AssociatedKind::Existential => format!("existential type {};", self.ident),
237 ty::AssociatedKind::Const => {
238 format!("const {}: {:?};", self.ident, tcx.type_of(self.def_id))
244 #[derive(Clone, Debug, PartialEq, Eq, Copy, RustcEncodable, RustcDecodable)]
245 pub enum Visibility {
246 /// Visible everywhere (including in other crates).
248 /// Visible only in the given crate-local module.
250 /// Not visible anywhere in the local crate. This is the visibility of private external items.
254 pub trait DefIdTree: Copy {
255 fn parent(self, id: DefId) -> Option<DefId>;
257 fn is_descendant_of(self, mut descendant: DefId, ancestor: DefId) -> bool {
258 if descendant.krate != ancestor.krate {
262 while descendant != ancestor {
263 match self.parent(descendant) {
264 Some(parent) => descendant = parent,
265 None => return false,
272 impl<'a, 'gcx, 'tcx> DefIdTree for TyCtxt<'a, 'gcx, 'tcx> {
273 fn parent(self, id: DefId) -> Option<DefId> {
274 self.def_key(id).parent.map(|index| DefId { index: index, ..id })
279 pub fn from_hir(visibility: &hir::Visibility, id: NodeId, tcx: TyCtxt<'_, '_, '_>) -> Self {
280 match visibility.node {
281 hir::VisibilityKind::Public => Visibility::Public,
282 hir::VisibilityKind::Crate(_) => Visibility::Restricted(DefId::local(CRATE_DEF_INDEX)),
283 hir::VisibilityKind::Restricted { ref path, .. } => match path.def {
284 // If there is no resolution, `resolve` will have already reported an error, so
285 // assume that the visibility is public to avoid reporting more privacy errors.
286 Def::Err => Visibility::Public,
287 def => Visibility::Restricted(def.def_id()),
289 hir::VisibilityKind::Inherited => {
290 Visibility::Restricted(tcx.hir.get_module_parent(id))
295 /// Returns true if an item with this visibility is accessible from the given block.
296 pub fn is_accessible_from<T: DefIdTree>(self, module: DefId, tree: T) -> bool {
297 let restriction = match self {
298 // Public items are visible everywhere.
299 Visibility::Public => return true,
300 // Private items from other crates are visible nowhere.
301 Visibility::Invisible => return false,
302 // Restricted items are visible in an arbitrary local module.
303 Visibility::Restricted(other) if other.krate != module.krate => return false,
304 Visibility::Restricted(module) => module,
307 tree.is_descendant_of(module, restriction)
310 /// Returns true if this visibility is at least as accessible as the given visibility
311 pub fn is_at_least<T: DefIdTree>(self, vis: Visibility, tree: T) -> bool {
312 let vis_restriction = match vis {
313 Visibility::Public => return self == Visibility::Public,
314 Visibility::Invisible => return true,
315 Visibility::Restricted(module) => module,
318 self.is_accessible_from(vis_restriction, tree)
321 // Returns true if this item is visible anywhere in the local crate.
322 pub fn is_visible_locally(self) -> bool {
324 Visibility::Public => true,
325 Visibility::Restricted(def_id) => def_id.is_local(),
326 Visibility::Invisible => false,
331 #[derive(Clone, PartialEq, RustcDecodable, RustcEncodable, Copy)]
333 Covariant, // T<A> <: T<B> iff A <: B -- e.g., function return type
334 Invariant, // T<A> <: T<B> iff B == A -- e.g., type of mutable cell
335 Contravariant, // T<A> <: T<B> iff B <: A -- e.g., function param type
336 Bivariant, // T<A> <: T<B> -- e.g., unused type parameter
339 /// The crate variances map is computed during typeck and contains the
340 /// variance of every item in the local crate. You should not use it
341 /// directly, because to do so will make your pass dependent on the
342 /// HIR of every item in the local crate. Instead, use
343 /// `tcx.variances_of()` to get the variance for a *particular*
345 pub struct CrateVariancesMap {
346 /// For each item with generics, maps to a vector of the variance
347 /// of its generics. If an item has no generics, it will have no
349 pub variances: FxHashMap<DefId, Lrc<Vec<ty::Variance>>>,
351 /// An empty vector, useful for cloning.
352 pub empty_variance: Lrc<Vec<ty::Variance>>,
356 /// `a.xform(b)` combines the variance of a context with the
357 /// variance of a type with the following meaning. If we are in a
358 /// context with variance `a`, and we encounter a type argument in
359 /// a position with variance `b`, then `a.xform(b)` is the new
360 /// variance with which the argument appears.
366 /// Here, the "ambient" variance starts as covariant. `*mut T` is
367 /// invariant with respect to `T`, so the variance in which the
368 /// `Vec<i32>` appears is `Covariant.xform(Invariant)`, which
369 /// yields `Invariant`. Now, the type `Vec<T>` is covariant with
370 /// respect to its type argument `T`, and hence the variance of
371 /// the `i32` here is `Invariant.xform(Covariant)`, which results
372 /// (again) in `Invariant`.
376 /// fn(*const Vec<i32>, *mut Vec<i32)
378 /// The ambient variance is covariant. A `fn` type is
379 /// contravariant with respect to its parameters, so the variance
380 /// within which both pointer types appear is
381 /// `Covariant.xform(Contravariant)`, or `Contravariant`. `*const
382 /// T` is covariant with respect to `T`, so the variance within
383 /// which the first `Vec<i32>` appears is
384 /// `Contravariant.xform(Covariant)` or `Contravariant`. The same
385 /// is true for its `i32` argument. In the `*mut T` case, the
386 /// variance of `Vec<i32>` is `Contravariant.xform(Invariant)`,
387 /// and hence the outermost type is `Invariant` with respect to
388 /// `Vec<i32>` (and its `i32` argument).
390 /// Source: Figure 1 of "Taming the Wildcards:
391 /// Combining Definition- and Use-Site Variance" published in PLDI'11.
392 pub fn xform(self, v: ty::Variance) -> ty::Variance {
394 // Figure 1, column 1.
395 (ty::Covariant, ty::Covariant) => ty::Covariant,
396 (ty::Covariant, ty::Contravariant) => ty::Contravariant,
397 (ty::Covariant, ty::Invariant) => ty::Invariant,
398 (ty::Covariant, ty::Bivariant) => ty::Bivariant,
400 // Figure 1, column 2.
401 (ty::Contravariant, ty::Covariant) => ty::Contravariant,
402 (ty::Contravariant, ty::Contravariant) => ty::Covariant,
403 (ty::Contravariant, ty::Invariant) => ty::Invariant,
404 (ty::Contravariant, ty::Bivariant) => ty::Bivariant,
406 // Figure 1, column 3.
407 (ty::Invariant, _) => ty::Invariant,
409 // Figure 1, column 4.
410 (ty::Bivariant, _) => ty::Bivariant,
415 // Contains information needed to resolve types and (in the future) look up
416 // the types of AST nodes.
417 #[derive(Copy, Clone, PartialEq, Eq, Hash)]
418 pub struct CReaderCacheKey {
423 // Flags that we track on types. These flags are propagated upwards
424 // through the type during type construction, so that we can quickly
425 // check whether the type has various kinds of types in it without
426 // recursing over the type itself.
428 pub struct TypeFlags: u32 {
429 const HAS_PARAMS = 1 << 0;
430 const HAS_SELF = 1 << 1;
431 const HAS_TY_INFER = 1 << 2;
432 const HAS_RE_INFER = 1 << 3;
433 const HAS_RE_SKOL = 1 << 4;
435 /// Does this have any `ReEarlyBound` regions? Used to
436 /// determine whether substitition is required, since those
437 /// represent regions that are bound in a `ty::Generics` and
438 /// hence may be substituted.
439 const HAS_RE_EARLY_BOUND = 1 << 5;
441 /// Does this have any region that "appears free" in the type?
442 /// Basically anything but `ReLateBound` and `ReErased`.
443 const HAS_FREE_REGIONS = 1 << 6;
445 /// Is an error type reachable?
446 const HAS_TY_ERR = 1 << 7;
447 const HAS_PROJECTION = 1 << 8;
449 // FIXME: Rename this to the actual property since it's used for generators too
450 const HAS_TY_CLOSURE = 1 << 9;
452 // true if there are "names" of types and regions and so forth
453 // that are local to a particular fn
454 const HAS_FREE_LOCAL_NAMES = 1 << 10;
456 // Present if the type belongs in a local type context.
457 // Only set for Infer other than Fresh.
458 const KEEP_IN_LOCAL_TCX = 1 << 11;
460 // Is there a projection that does not involve a bound region?
461 // Currently we can't normalize projections w/ bound regions.
462 const HAS_NORMALIZABLE_PROJECTION = 1 << 12;
464 // Set if this includes a "canonical" type or region var --
465 // ought to be true only for the results of canonicalization.
466 const HAS_CANONICAL_VARS = 1 << 13;
468 /// Does this have any `ReLateBound` regions? Used to check
469 /// if a global bound is safe to evaluate.
470 const HAS_RE_LATE_BOUND = 1 << 14;
472 const NEEDS_SUBST = TypeFlags::HAS_PARAMS.bits |
473 TypeFlags::HAS_SELF.bits |
474 TypeFlags::HAS_RE_EARLY_BOUND.bits;
476 // Flags representing the nominal content of a type,
477 // computed by FlagsComputation. If you add a new nominal
478 // flag, it should be added here too.
479 const NOMINAL_FLAGS = TypeFlags::HAS_PARAMS.bits |
480 TypeFlags::HAS_SELF.bits |
481 TypeFlags::HAS_TY_INFER.bits |
482 TypeFlags::HAS_RE_INFER.bits |
483 TypeFlags::HAS_RE_SKOL.bits |
484 TypeFlags::HAS_RE_EARLY_BOUND.bits |
485 TypeFlags::HAS_FREE_REGIONS.bits |
486 TypeFlags::HAS_TY_ERR.bits |
487 TypeFlags::HAS_PROJECTION.bits |
488 TypeFlags::HAS_TY_CLOSURE.bits |
489 TypeFlags::HAS_FREE_LOCAL_NAMES.bits |
490 TypeFlags::KEEP_IN_LOCAL_TCX.bits |
491 TypeFlags::HAS_CANONICAL_VARS.bits |
492 TypeFlags::HAS_RE_LATE_BOUND.bits;
496 pub struct TyS<'tcx> {
497 pub sty: TyKind<'tcx>,
498 pub flags: TypeFlags,
500 /// This is a kind of confusing thing: it stores the smallest
503 /// (a) the binder itself captures nothing but
504 /// (b) all the late-bound things within the type are captured
505 /// by some sub-binder.
507 /// So, for a type without any late-bound things, like `u32`, this
508 /// will be INNERMOST, because that is the innermost binder that
509 /// captures nothing. But for a type `&'D u32`, where `'D` is a
510 /// late-bound region with debruijn index D, this would be D+1 --
511 /// the binder itself does not capture D, but D is captured by an
514 /// We call this concept an "exclusive" binder D (because all
515 /// debruijn indices within the type are contained within `0..D`
517 outer_exclusive_binder: ty::DebruijnIndex,
520 impl<'tcx> Ord for TyS<'tcx> {
521 fn cmp(&self, other: &TyS<'tcx>) -> Ordering {
522 self.sty.cmp(&other.sty)
526 impl<'tcx> PartialOrd for TyS<'tcx> {
527 fn partial_cmp(&self, other: &TyS<'tcx>) -> Option<Ordering> {
528 Some(self.sty.cmp(&other.sty))
532 impl<'tcx> PartialEq for TyS<'tcx> {
534 fn eq(&self, other: &TyS<'tcx>) -> bool {
538 impl<'tcx> Eq for TyS<'tcx> {}
540 impl<'tcx> Hash for TyS<'tcx> {
541 fn hash<H: Hasher>(&self, s: &mut H) {
542 (self as *const TyS<'_>).hash(s)
546 impl<'tcx> TyS<'tcx> {
547 pub fn is_primitive_ty(&self) -> bool {
554 TyKind::Infer(InferTy::IntVar(_)) |
555 TyKind::Infer(InferTy::FloatVar(_)) |
556 TyKind::Infer(InferTy::FreshIntTy(_)) |
557 TyKind::Infer(InferTy::FreshFloatTy(_)) => true,
558 TyKind::Ref(_, x, _) => x.is_primitive_ty(),
563 pub fn is_suggestable(&self) -> bool {
568 TyKind::Dynamic(..) |
569 TyKind::Closure(..) |
571 TyKind::Projection(..) => false,
577 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for ty::TyS<'gcx> {
578 fn hash_stable<W: StableHasherResult>(&self,
579 hcx: &mut StableHashingContext<'a>,
580 hasher: &mut StableHasher<W>) {
584 // The other fields just provide fast access to information that is
585 // also contained in `sty`, so no need to hash them.
588 outer_exclusive_binder: _,
591 sty.hash_stable(hcx, hasher);
595 pub type Ty<'tcx> = &'tcx TyS<'tcx>;
597 impl<'tcx> serialize::UseSpecializedEncodable for Ty<'tcx> {}
598 impl<'tcx> serialize::UseSpecializedDecodable for Ty<'tcx> {}
600 pub type CanonicalTy<'gcx> = Canonical<'gcx, Ty<'gcx>>;
603 /// A dummy type used to force List to by unsized without requiring fat pointers
604 type OpaqueListContents;
607 /// A wrapper for slices with the additional invariant
608 /// that the slice is interned and no other slice with
609 /// the same contents can exist in the same context.
610 /// This means we can use pointer for both
611 /// equality comparisons and hashing.
612 /// Note: `Slice` was already taken by the `Ty`.
617 opaque: OpaqueListContents,
620 unsafe impl<T: Sync> Sync for List<T> {}
622 impl<T: Copy> List<T> {
624 fn from_arena<'tcx>(arena: &'tcx SyncDroplessArena, slice: &[T]) -> &'tcx List<T> {
625 assert!(!mem::needs_drop::<T>());
626 assert!(mem::size_of::<T>() != 0);
627 assert!(slice.len() != 0);
629 // Align up the size of the len (usize) field
630 let align = mem::align_of::<T>();
631 let align_mask = align - 1;
632 let offset = mem::size_of::<usize>();
633 let offset = (offset + align_mask) & !align_mask;
635 let size = offset + slice.len() * mem::size_of::<T>();
637 let mem = arena.alloc_raw(
639 cmp::max(mem::align_of::<T>(), mem::align_of::<usize>()));
641 let result = &mut *(mem.as_mut_ptr() as *mut List<T>);
643 result.len = slice.len();
645 // Write the elements
646 let arena_slice = slice::from_raw_parts_mut(result.data.as_mut_ptr(), result.len);
647 arena_slice.copy_from_slice(slice);
654 impl<T: fmt::Debug> fmt::Debug for List<T> {
655 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
660 impl<T: Encodable> Encodable for List<T> {
662 fn encode<S: Encoder>(&self, s: &mut S) -> Result<(), S::Error> {
667 impl<T> Ord for List<T> where T: Ord {
668 fn cmp(&self, other: &List<T>) -> Ordering {
669 if self == other { Ordering::Equal } else {
670 <[T] as Ord>::cmp(&**self, &**other)
675 impl<T> PartialOrd for List<T> where T: PartialOrd {
676 fn partial_cmp(&self, other: &List<T>) -> Option<Ordering> {
677 if self == other { Some(Ordering::Equal) } else {
678 <[T] as PartialOrd>::partial_cmp(&**self, &**other)
683 impl<T: PartialEq> PartialEq for List<T> {
685 fn eq(&self, other: &List<T>) -> bool {
689 impl<T: Eq> Eq for List<T> {}
691 impl<T> Hash for List<T> {
693 fn hash<H: Hasher>(&self, s: &mut H) {
694 (self as *const List<T>).hash(s)
698 impl<T> Deref for List<T> {
701 fn deref(&self) -> &[T] {
703 slice::from_raw_parts(self.data.as_ptr(), self.len)
708 impl<'a, T> IntoIterator for &'a List<T> {
710 type IntoIter = <&'a [T] as IntoIterator>::IntoIter;
712 fn into_iter(self) -> Self::IntoIter {
717 impl<'tcx> serialize::UseSpecializedDecodable for &'tcx List<Ty<'tcx>> {}
721 pub fn empty<'a>() -> &'a List<T> {
722 #[repr(align(64), C)]
723 struct EmptySlice([u8; 64]);
724 static EMPTY_SLICE: EmptySlice = EmptySlice([0; 64]);
725 assert!(mem::align_of::<T>() <= 64);
727 &*(&EMPTY_SLICE as *const _ as *const List<T>)
732 /// Upvars do not get their own node-id. Instead, we use the pair of
733 /// the original var id (that is, the root variable that is referenced
734 /// by the upvar) and the id of the closure expression.
735 #[derive(Clone, Copy, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable)]
737 pub var_id: hir::HirId,
738 pub closure_expr_id: LocalDefId,
741 #[derive(Clone, PartialEq, Eq, Hash, Debug, RustcEncodable, RustcDecodable, Copy)]
742 pub enum BorrowKind {
743 /// Data must be immutable and is aliasable.
746 /// Data must be immutable but not aliasable. This kind of borrow
747 /// cannot currently be expressed by the user and is used only in
748 /// implicit closure bindings. It is needed when the closure
749 /// is borrowing or mutating a mutable referent, e.g.:
751 /// let x: &mut isize = ...;
752 /// let y = || *x += 5;
754 /// If we were to try to translate this closure into a more explicit
755 /// form, we'd encounter an error with the code as written:
757 /// struct Env { x: & &mut isize }
758 /// let x: &mut isize = ...;
759 /// let y = (&mut Env { &x }, fn_ptr); // Closure is pair of env and fn
760 /// fn fn_ptr(env: &mut Env) { **env.x += 5; }
762 /// This is then illegal because you cannot mutate a `&mut` found
763 /// in an aliasable location. To solve, you'd have to translate with
764 /// an `&mut` borrow:
766 /// struct Env { x: & &mut isize }
767 /// let x: &mut isize = ...;
768 /// let y = (&mut Env { &mut x }, fn_ptr); // changed from &x to &mut x
769 /// fn fn_ptr(env: &mut Env) { **env.x += 5; }
771 /// Now the assignment to `**env.x` is legal, but creating a
772 /// mutable pointer to `x` is not because `x` is not mutable. We
773 /// could fix this by declaring `x` as `let mut x`. This is ok in
774 /// user code, if awkward, but extra weird for closures, since the
775 /// borrow is hidden.
777 /// So we introduce a "unique imm" borrow -- the referent is
778 /// immutable, but not aliasable. This solves the problem. For
779 /// simplicity, we don't give users the way to express this
780 /// borrow, it's just used when translating closures.
783 /// Data is mutable and not aliasable.
787 /// Information describing the capture of an upvar. This is computed
788 /// during `typeck`, specifically by `regionck`.
789 #[derive(PartialEq, Clone, Debug, Copy, RustcEncodable, RustcDecodable)]
790 pub enum UpvarCapture<'tcx> {
791 /// Upvar is captured by value. This is always true when the
792 /// closure is labeled `move`, but can also be true in other cases
793 /// depending on inference.
796 /// Upvar is captured by reference.
797 ByRef(UpvarBorrow<'tcx>),
800 #[derive(PartialEq, Clone, Copy, RustcEncodable, RustcDecodable)]
801 pub struct UpvarBorrow<'tcx> {
802 /// The kind of borrow: by-ref upvars have access to shared
803 /// immutable borrows, which are not part of the normal language
805 pub kind: BorrowKind,
807 /// Region of the resulting reference.
808 pub region: ty::Region<'tcx>,
811 pub type UpvarCaptureMap<'tcx> = FxHashMap<UpvarId, UpvarCapture<'tcx>>;
813 #[derive(Copy, Clone)]
814 pub struct ClosureUpvar<'tcx> {
820 #[derive(Clone, Copy, PartialEq, Eq)]
821 pub enum IntVarValue {
823 UintType(ast::UintTy),
826 #[derive(Clone, Copy, PartialEq, Eq)]
827 pub struct FloatVarValue(pub ast::FloatTy);
829 impl ty::EarlyBoundRegion {
830 pub fn to_bound_region(&self) -> ty::BoundRegion {
831 ty::BoundRegion::BrNamed(self.def_id, self.name)
834 /// Does this early bound region have a name? Early bound regions normally
835 /// always have names except when using anonymous lifetimes (`'_`).
836 pub fn has_name(&self) -> bool {
837 self.name != keywords::UnderscoreLifetime.name().as_interned_str()
841 #[derive(Clone, Debug, RustcEncodable, RustcDecodable)]
842 pub enum GenericParamDefKind {
846 object_lifetime_default: ObjectLifetimeDefault,
847 synthetic: Option<hir::SyntheticTyParamKind>,
851 #[derive(Clone, RustcEncodable, RustcDecodable)]
852 pub struct GenericParamDef {
853 pub name: InternedString,
857 /// `pure_wrt_drop`, set by the (unsafe) `#[may_dangle]` attribute
858 /// on generic parameter `'a`/`T`, asserts data behind the parameter
859 /// `'a`/`T` won't be accessed during the parent type's `Drop` impl.
860 pub pure_wrt_drop: bool,
862 pub kind: GenericParamDefKind,
865 impl GenericParamDef {
866 pub fn to_early_bound_region_data(&self) -> ty::EarlyBoundRegion {
867 if let GenericParamDefKind::Lifetime = self.kind {
868 ty::EarlyBoundRegion {
874 bug!("cannot convert a non-lifetime parameter def to an early bound region")
878 pub fn to_bound_region(&self) -> ty::BoundRegion {
879 if let GenericParamDefKind::Lifetime = self.kind {
880 self.to_early_bound_region_data().to_bound_region()
882 bug!("cannot convert a non-lifetime parameter def to an early bound region")
888 pub struct GenericParamCount {
889 pub lifetimes: usize,
893 /// Information about the formal type/lifetime parameters associated
894 /// with an item or method. Analogous to hir::Generics.
896 /// The ordering of parameters is the same as in Subst (excluding child generics):
897 /// Self (optionally), Lifetime params..., Type params...
898 #[derive(Clone, Debug, RustcEncodable, RustcDecodable)]
899 pub struct Generics {
900 pub parent: Option<DefId>,
901 pub parent_count: usize,
902 pub params: Vec<GenericParamDef>,
904 /// Reverse map to the `index` field of each `GenericParamDef`
905 pub param_def_id_to_index: FxHashMap<DefId, u32>,
908 pub has_late_bound_regions: Option<Span>,
911 impl<'a, 'gcx, 'tcx> Generics {
912 pub fn count(&self) -> usize {
913 self.parent_count + self.params.len()
916 pub fn own_counts(&self) -> GenericParamCount {
917 // We could cache this as a property of `GenericParamCount`, but
918 // the aim is to refactor this away entirely eventually and the
919 // presence of this method will be a constant reminder.
920 let mut own_counts: GenericParamCount = Default::default();
922 for param in &self.params {
924 GenericParamDefKind::Lifetime => own_counts.lifetimes += 1,
925 GenericParamDefKind::Type { .. } => own_counts.types += 1,
932 pub fn requires_monomorphization(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> bool {
933 for param in &self.params {
935 GenericParamDefKind::Type { .. } => return true,
936 GenericParamDefKind::Lifetime => {}
939 if let Some(parent_def_id) = self.parent {
940 let parent = tcx.generics_of(parent_def_id);
941 parent.requires_monomorphization(tcx)
947 pub fn region_param(&'tcx self,
948 param: &EarlyBoundRegion,
949 tcx: TyCtxt<'a, 'gcx, 'tcx>)
950 -> &'tcx GenericParamDef
952 if let Some(index) = param.index.checked_sub(self.parent_count as u32) {
953 let param = &self.params[index as usize];
955 ty::GenericParamDefKind::Lifetime => param,
956 _ => bug!("expected lifetime parameter, but found another generic parameter")
959 tcx.generics_of(self.parent.expect("parent_count>0 but no parent?"))
960 .region_param(param, tcx)
964 /// Returns the `GenericParamDef` associated with this `ParamTy`.
965 pub fn type_param(&'tcx self,
967 tcx: TyCtxt<'a, 'gcx, 'tcx>)
968 -> &'tcx GenericParamDef {
969 if let Some(index) = param.idx.checked_sub(self.parent_count as u32) {
970 let param = &self.params[index as usize];
972 ty::GenericParamDefKind::Type {..} => param,
973 _ => bug!("expected type parameter, but found another generic parameter")
976 tcx.generics_of(self.parent.expect("parent_count>0 but no parent?"))
977 .type_param(param, tcx)
982 /// Bounds on generics.
983 #[derive(Clone, Default)]
984 pub struct GenericPredicates<'tcx> {
985 pub parent: Option<DefId>,
986 pub predicates: Vec<(Predicate<'tcx>, Span)>,
989 impl<'tcx> serialize::UseSpecializedEncodable for GenericPredicates<'tcx> {}
990 impl<'tcx> serialize::UseSpecializedDecodable for GenericPredicates<'tcx> {}
992 impl<'a, 'gcx, 'tcx> GenericPredicates<'tcx> {
993 pub fn instantiate(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>, substs: &Substs<'tcx>)
994 -> InstantiatedPredicates<'tcx> {
995 let mut instantiated = InstantiatedPredicates::empty();
996 self.instantiate_into(tcx, &mut instantiated, substs);
999 pub fn instantiate_own(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>, substs: &Substs<'tcx>)
1000 -> InstantiatedPredicates<'tcx> {
1001 InstantiatedPredicates {
1002 predicates: self.predicates.iter().map(|(p, _)| p.subst(tcx, substs)).collect(),
1006 fn instantiate_into(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>,
1007 instantiated: &mut InstantiatedPredicates<'tcx>,
1008 substs: &Substs<'tcx>) {
1009 if let Some(def_id) = self.parent {
1010 tcx.predicates_of(def_id).instantiate_into(tcx, instantiated, substs);
1012 instantiated.predicates.extend(
1013 self.predicates.iter().map(|(p, _)| p.subst(tcx, substs)),
1017 pub fn instantiate_identity(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>)
1018 -> InstantiatedPredicates<'tcx> {
1019 let mut instantiated = InstantiatedPredicates::empty();
1020 self.instantiate_identity_into(tcx, &mut instantiated);
1024 fn instantiate_identity_into(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>,
1025 instantiated: &mut InstantiatedPredicates<'tcx>) {
1026 if let Some(def_id) = self.parent {
1027 tcx.predicates_of(def_id).instantiate_identity_into(tcx, instantiated);
1029 instantiated.predicates.extend(self.predicates.iter().map(|&(p, _)| p))
1032 pub fn instantiate_supertrait(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>,
1033 poly_trait_ref: &ty::PolyTraitRef<'tcx>)
1034 -> InstantiatedPredicates<'tcx>
1036 assert_eq!(self.parent, None);
1037 InstantiatedPredicates {
1038 predicates: self.predicates.iter().map(|(pred, _)| {
1039 pred.subst_supertrait(tcx, poly_trait_ref)
1045 #[derive(Clone, Copy, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable)]
1046 pub enum Predicate<'tcx> {
1047 /// Corresponds to `where Foo : Bar<A,B,C>`. `Foo` here would be
1048 /// the `Self` type of the trait reference and `A`, `B`, and `C`
1049 /// would be the type parameters.
1050 Trait(PolyTraitPredicate<'tcx>),
1053 RegionOutlives(PolyRegionOutlivesPredicate<'tcx>),
1056 TypeOutlives(PolyTypeOutlivesPredicate<'tcx>),
1058 /// where <T as TraitRef>::Name == X, approximately.
1059 /// See `ProjectionPredicate` struct for details.
1060 Projection(PolyProjectionPredicate<'tcx>),
1063 WellFormed(Ty<'tcx>),
1065 /// trait must be object-safe
1068 /// No direct syntax. May be thought of as `where T : FnFoo<...>`
1069 /// for some substitutions `...` and T being a closure type.
1070 /// Satisfied (or refuted) once we know the closure's kind.
1071 ClosureKind(DefId, ClosureSubsts<'tcx>, ClosureKind),
1074 Subtype(PolySubtypePredicate<'tcx>),
1076 /// Constant initializer must evaluate successfully.
1077 ConstEvaluatable(DefId, &'tcx Substs<'tcx>),
1080 /// The crate outlives map is computed during typeck and contains the
1081 /// outlives of every item in the local crate. You should not use it
1082 /// directly, because to do so will make your pass dependent on the
1083 /// HIR of every item in the local crate. Instead, use
1084 /// `tcx.inferred_outlives_of()` to get the outlives for a *particular*
1086 pub struct CratePredicatesMap<'tcx> {
1087 /// For each struct with outlive bounds, maps to a vector of the
1088 /// predicate of its outlive bounds. If an item has no outlives
1089 /// bounds, it will have no entry.
1090 pub predicates: FxHashMap<DefId, Lrc<Vec<ty::Predicate<'tcx>>>>,
1092 /// An empty vector, useful for cloning.
1093 pub empty_predicate: Lrc<Vec<ty::Predicate<'tcx>>>,
1096 impl<'tcx> AsRef<Predicate<'tcx>> for Predicate<'tcx> {
1097 fn as_ref(&self) -> &Predicate<'tcx> {
1102 impl<'a, 'gcx, 'tcx> Predicate<'tcx> {
1103 /// Performs a substitution suitable for going from a
1104 /// poly-trait-ref to supertraits that must hold if that
1105 /// poly-trait-ref holds. This is slightly different from a normal
1106 /// substitution in terms of what happens with bound regions. See
1107 /// lengthy comment below for details.
1108 pub fn subst_supertrait(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>,
1109 trait_ref: &ty::PolyTraitRef<'tcx>)
1110 -> ty::Predicate<'tcx>
1112 // The interaction between HRTB and supertraits is not entirely
1113 // obvious. Let me walk you (and myself) through an example.
1115 // Let's start with an easy case. Consider two traits:
1117 // trait Foo<'a> : Bar<'a,'a> { }
1118 // trait Bar<'b,'c> { }
1120 // Now, if we have a trait reference `for<'x> T : Foo<'x>`, then
1121 // we can deduce that `for<'x> T : Bar<'x,'x>`. Basically, if we
1122 // knew that `Foo<'x>` (for any 'x) then we also know that
1123 // `Bar<'x,'x>` (for any 'x). This more-or-less falls out from
1124 // normal substitution.
1126 // In terms of why this is sound, the idea is that whenever there
1127 // is an impl of `T:Foo<'a>`, it must show that `T:Bar<'a,'a>`
1128 // holds. So if there is an impl of `T:Foo<'a>` that applies to
1129 // all `'a`, then we must know that `T:Bar<'a,'a>` holds for all
1132 // Another example to be careful of is this:
1134 // trait Foo1<'a> : for<'b> Bar1<'a,'b> { }
1135 // trait Bar1<'b,'c> { }
1137 // Here, if we have `for<'x> T : Foo1<'x>`, then what do we know?
1138 // The answer is that we know `for<'x,'b> T : Bar1<'x,'b>`. The
1139 // reason is similar to the previous example: any impl of
1140 // `T:Foo1<'x>` must show that `for<'b> T : Bar1<'x, 'b>`. So
1141 // basically we would want to collapse the bound lifetimes from
1142 // the input (`trait_ref`) and the supertraits.
1144 // To achieve this in practice is fairly straightforward. Let's
1145 // consider the more complicated scenario:
1147 // - We start out with `for<'x> T : Foo1<'x>`. In this case, `'x`
1148 // has a De Bruijn index of 1. We want to produce `for<'x,'b> T : Bar1<'x,'b>`,
1149 // where both `'x` and `'b` would have a DB index of 1.
1150 // The substitution from the input trait-ref is therefore going to be
1151 // `'a => 'x` (where `'x` has a DB index of 1).
1152 // - The super-trait-ref is `for<'b> Bar1<'a,'b>`, where `'a` is an
1153 // early-bound parameter and `'b' is a late-bound parameter with a
1155 // - If we replace `'a` with `'x` from the input, it too will have
1156 // a DB index of 1, and thus we'll have `for<'x,'b> Bar1<'x,'b>`
1157 // just as we wanted.
1159 // There is only one catch. If we just apply the substitution `'a
1160 // => 'x` to `for<'b> Bar1<'a,'b>`, the substitution code will
1161 // adjust the DB index because we substituting into a binder (it
1162 // tries to be so smart...) resulting in `for<'x> for<'b>
1163 // Bar1<'x,'b>` (we have no syntax for this, so use your
1164 // imagination). Basically the 'x will have DB index of 2 and 'b
1165 // will have DB index of 1. Not quite what we want. So we apply
1166 // the substitution to the *contents* of the trait reference,
1167 // rather than the trait reference itself (put another way, the
1168 // substitution code expects equal binding levels in the values
1169 // from the substitution and the value being substituted into, and
1170 // this trick achieves that).
1172 let substs = &trait_ref.skip_binder().substs;
1174 Predicate::Trait(ref binder) =>
1175 Predicate::Trait(binder.map_bound(|data| data.subst(tcx, substs))),
1176 Predicate::Subtype(ref binder) =>
1177 Predicate::Subtype(binder.map_bound(|data| data.subst(tcx, substs))),
1178 Predicate::RegionOutlives(ref binder) =>
1179 Predicate::RegionOutlives(binder.map_bound(|data| data.subst(tcx, substs))),
1180 Predicate::TypeOutlives(ref binder) =>
1181 Predicate::TypeOutlives(binder.map_bound(|data| data.subst(tcx, substs))),
1182 Predicate::Projection(ref binder) =>
1183 Predicate::Projection(binder.map_bound(|data| data.subst(tcx, substs))),
1184 Predicate::WellFormed(data) =>
1185 Predicate::WellFormed(data.subst(tcx, substs)),
1186 Predicate::ObjectSafe(trait_def_id) =>
1187 Predicate::ObjectSafe(trait_def_id),
1188 Predicate::ClosureKind(closure_def_id, closure_substs, kind) =>
1189 Predicate::ClosureKind(closure_def_id, closure_substs.subst(tcx, substs), kind),
1190 Predicate::ConstEvaluatable(def_id, const_substs) =>
1191 Predicate::ConstEvaluatable(def_id, const_substs.subst(tcx, substs)),
1196 #[derive(Clone, Copy, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable)]
1197 pub struct TraitPredicate<'tcx> {
1198 pub trait_ref: TraitRef<'tcx>
1200 pub type PolyTraitPredicate<'tcx> = ty::Binder<TraitPredicate<'tcx>>;
1202 impl<'tcx> TraitPredicate<'tcx> {
1203 pub fn def_id(&self) -> DefId {
1204 self.trait_ref.def_id
1207 pub fn input_types<'a>(&'a self) -> impl DoubleEndedIterator<Item=Ty<'tcx>> + 'a {
1208 self.trait_ref.input_types()
1211 pub fn self_ty(&self) -> Ty<'tcx> {
1212 self.trait_ref.self_ty()
1216 impl<'tcx> PolyTraitPredicate<'tcx> {
1217 pub fn def_id(&self) -> DefId {
1218 // ok to skip binder since trait def-id does not care about regions
1219 self.skip_binder().def_id()
1223 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, RustcEncodable, RustcDecodable)]
1224 pub struct OutlivesPredicate<A,B>(pub A, pub B); // `A : B`
1225 pub type PolyOutlivesPredicate<A,B> = ty::Binder<OutlivesPredicate<A,B>>;
1226 pub type RegionOutlivesPredicate<'tcx> = OutlivesPredicate<ty::Region<'tcx>,
1228 pub type TypeOutlivesPredicate<'tcx> = OutlivesPredicate<Ty<'tcx>,
1230 pub type PolyRegionOutlivesPredicate<'tcx> = ty::Binder<RegionOutlivesPredicate<'tcx>>;
1231 pub type PolyTypeOutlivesPredicate<'tcx> = ty::Binder<TypeOutlivesPredicate<'tcx>>;
1233 #[derive(Clone, Copy, PartialEq, Eq, Hash, Debug, RustcEncodable, RustcDecodable)]
1234 pub struct SubtypePredicate<'tcx> {
1235 pub a_is_expected: bool,
1239 pub type PolySubtypePredicate<'tcx> = ty::Binder<SubtypePredicate<'tcx>>;
1241 /// This kind of predicate has no *direct* correspondent in the
1242 /// syntax, but it roughly corresponds to the syntactic forms:
1244 /// 1. `T : TraitRef<..., Item=Type>`
1245 /// 2. `<T as TraitRef<...>>::Item == Type` (NYI)
1247 /// In particular, form #1 is "desugared" to the combination of a
1248 /// normal trait predicate (`T : TraitRef<...>`) and one of these
1249 /// predicates. Form #2 is a broader form in that it also permits
1250 /// equality between arbitrary types. Processing an instance of
1251 /// Form #2 eventually yields one of these `ProjectionPredicate`
1252 /// instances to normalize the LHS.
1253 #[derive(Copy, Clone, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable)]
1254 pub struct ProjectionPredicate<'tcx> {
1255 pub projection_ty: ProjectionTy<'tcx>,
1259 pub type PolyProjectionPredicate<'tcx> = Binder<ProjectionPredicate<'tcx>>;
1261 impl<'tcx> PolyProjectionPredicate<'tcx> {
1262 /// Returns the def-id of the associated item being projected.
1263 pub fn item_def_id(&self) -> DefId {
1264 self.skip_binder().projection_ty.item_def_id
1267 pub fn to_poly_trait_ref(&self, tcx: TyCtxt<'_, '_, '_>) -> PolyTraitRef<'tcx> {
1268 // Note: unlike with TraitRef::to_poly_trait_ref(),
1269 // self.0.trait_ref is permitted to have escaping regions.
1270 // This is because here `self` has a `Binder` and so does our
1271 // return value, so we are preserving the number of binding
1273 self.map_bound(|predicate| predicate.projection_ty.trait_ref(tcx))
1276 pub fn ty(&self) -> Binder<Ty<'tcx>> {
1277 self.map_bound(|predicate| predicate.ty)
1280 /// The DefId of the TraitItem for the associated type.
1282 /// Note that this is not the DefId of the TraitRef containing this
1283 /// associated type, which is in tcx.associated_item(projection_def_id()).container.
1284 pub fn projection_def_id(&self) -> DefId {
1285 // ok to skip binder since trait def-id does not care about regions
1286 self.skip_binder().projection_ty.item_def_id
1290 pub trait ToPolyTraitRef<'tcx> {
1291 fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx>;
1294 impl<'tcx> ToPolyTraitRef<'tcx> for TraitRef<'tcx> {
1295 fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx> {
1296 ty::Binder::dummy(self.clone())
1300 impl<'tcx> ToPolyTraitRef<'tcx> for PolyTraitPredicate<'tcx> {
1301 fn to_poly_trait_ref(&self) -> PolyTraitRef<'tcx> {
1302 self.map_bound_ref(|trait_pred| trait_pred.trait_ref)
1306 pub trait ToPredicate<'tcx> {
1307 fn to_predicate(&self) -> Predicate<'tcx>;
1310 impl<'tcx> ToPredicate<'tcx> for TraitRef<'tcx> {
1311 fn to_predicate(&self) -> Predicate<'tcx> {
1312 ty::Predicate::Trait(ty::Binder::dummy(ty::TraitPredicate {
1313 trait_ref: self.clone()
1318 impl<'tcx> ToPredicate<'tcx> for PolyTraitRef<'tcx> {
1319 fn to_predicate(&self) -> Predicate<'tcx> {
1320 ty::Predicate::Trait(self.to_poly_trait_predicate())
1324 impl<'tcx> ToPredicate<'tcx> for PolyRegionOutlivesPredicate<'tcx> {
1325 fn to_predicate(&self) -> Predicate<'tcx> {
1326 Predicate::RegionOutlives(self.clone())
1330 impl<'tcx> ToPredicate<'tcx> for PolyTypeOutlivesPredicate<'tcx> {
1331 fn to_predicate(&self) -> Predicate<'tcx> {
1332 Predicate::TypeOutlives(self.clone())
1336 impl<'tcx> ToPredicate<'tcx> for PolyProjectionPredicate<'tcx> {
1337 fn to_predicate(&self) -> Predicate<'tcx> {
1338 Predicate::Projection(self.clone())
1342 impl<'tcx> Predicate<'tcx> {
1343 /// Iterates over the types in this predicate. Note that in all
1344 /// cases this is skipping over a binder, so late-bound regions
1345 /// with depth 0 are bound by the predicate.
1346 pub fn walk_tys(&self) -> IntoIter<Ty<'tcx>> {
1347 let vec: Vec<_> = match *self {
1348 ty::Predicate::Trait(ref data) => {
1349 data.skip_binder().input_types().collect()
1351 ty::Predicate::Subtype(binder) => {
1352 let SubtypePredicate { a, b, a_is_expected: _ } = binder.skip_binder();
1355 ty::Predicate::TypeOutlives(binder) => {
1356 vec![binder.skip_binder().0]
1358 ty::Predicate::RegionOutlives(..) => {
1361 ty::Predicate::Projection(ref data) => {
1362 let inner = data.skip_binder();
1363 inner.projection_ty.substs.types().chain(Some(inner.ty)).collect()
1365 ty::Predicate::WellFormed(data) => {
1368 ty::Predicate::ObjectSafe(_trait_def_id) => {
1371 ty::Predicate::ClosureKind(_closure_def_id, closure_substs, _kind) => {
1372 closure_substs.substs.types().collect()
1374 ty::Predicate::ConstEvaluatable(_, substs) => {
1375 substs.types().collect()
1379 // FIXME: The only reason to collect into a vector here is that I was
1380 // too lazy to make the full (somewhat complicated) iterator
1381 // type that would be needed here. But I wanted this fn to
1382 // return an iterator conceptually, rather than a `Vec`, so as
1383 // to be closer to `Ty::walk`.
1387 pub fn to_opt_poly_trait_ref(&self) -> Option<PolyTraitRef<'tcx>> {
1389 Predicate::Trait(ref t) => {
1390 Some(t.to_poly_trait_ref())
1392 Predicate::Projection(..) |
1393 Predicate::Subtype(..) |
1394 Predicate::RegionOutlives(..) |
1395 Predicate::WellFormed(..) |
1396 Predicate::ObjectSafe(..) |
1397 Predicate::ClosureKind(..) |
1398 Predicate::TypeOutlives(..) |
1399 Predicate::ConstEvaluatable(..) => {
1405 pub fn to_opt_type_outlives(&self) -> Option<PolyTypeOutlivesPredicate<'tcx>> {
1407 Predicate::TypeOutlives(data) => {
1410 Predicate::Trait(..) |
1411 Predicate::Projection(..) |
1412 Predicate::Subtype(..) |
1413 Predicate::RegionOutlives(..) |
1414 Predicate::WellFormed(..) |
1415 Predicate::ObjectSafe(..) |
1416 Predicate::ClosureKind(..) |
1417 Predicate::ConstEvaluatable(..) => {
1424 /// Represents the bounds declared on a particular set of type
1425 /// parameters. Should eventually be generalized into a flag list of
1426 /// where clauses. You can obtain a `InstantiatedPredicates` list from a
1427 /// `GenericPredicates` by using the `instantiate` method. Note that this method
1428 /// reflects an important semantic invariant of `InstantiatedPredicates`: while
1429 /// the `GenericPredicates` are expressed in terms of the bound type
1430 /// parameters of the impl/trait/whatever, an `InstantiatedPredicates` instance
1431 /// represented a set of bounds for some particular instantiation,
1432 /// meaning that the generic parameters have been substituted with
1437 /// struct Foo<T,U:Bar<T>> { ... }
1439 /// Here, the `GenericPredicates` for `Foo` would contain a list of bounds like
1440 /// `[[], [U:Bar<T>]]`. Now if there were some particular reference
1441 /// like `Foo<isize,usize>`, then the `InstantiatedPredicates` would be `[[],
1442 /// [usize:Bar<isize>]]`.
1444 pub struct InstantiatedPredicates<'tcx> {
1445 pub predicates: Vec<Predicate<'tcx>>,
1448 impl<'tcx> InstantiatedPredicates<'tcx> {
1449 pub fn empty() -> InstantiatedPredicates<'tcx> {
1450 InstantiatedPredicates { predicates: vec![] }
1453 pub fn is_empty(&self) -> bool {
1454 self.predicates.is_empty()
1458 /// "Universes" are used during type- and trait-checking in the
1459 /// presence of `for<..>` binders to control what sets of names are
1460 /// visible. Universes are arranged into a tree: the root universe
1461 /// contains names that are always visible. Each child then adds a new
1462 /// set of names that are visible, in addition to those of its parent.
1463 /// We say that the child universe "extends" the parent universe with
1466 /// To make this more concrete, consider this program:
1470 /// fn bar<T>(x: T) {
1471 /// let y: for<'a> fn(&'a u8, Foo) = ...;
1475 /// The struct name `Foo` is in the root universe U0. But the type
1476 /// parameter `T`, introduced on `bar`, is in an extended universe U1
1477 /// -- i.e., within `bar`, we can name both `T` and `Foo`, but outside
1478 /// of `bar`, we cannot name `T`. Then, within the type of `y`, the
1479 /// region `'a` is in a universe U2 that extends U1, because we can
1480 /// name it inside the fn type but not outside.
1482 /// Universes are used to do type- and trait-checking around these
1483 /// "forall" binders (also called **universal quantification**). The
1484 /// idea is that when, in the body of `bar`, we refer to `T` as a
1485 /// type, we aren't referring to any type in particular, but rather a
1486 /// kind of "fresh" type that is distinct from all other types we have
1487 /// actually declared. This is called a **placeholder** type, and we
1488 /// use universes to talk about this. In other words, a type name in
1489 /// universe 0 always corresponds to some "ground" type that the user
1490 /// declared, but a type name in a non-zero universe is a placeholder
1491 /// type -- an idealized representative of "types in general" that we
1492 /// use for checking generic functions.
1494 pub struct UniverseIndex {
1495 DEBUG_FORMAT = "U{}",
1499 impl_stable_hash_for!(struct UniverseIndex { private });
1501 impl UniverseIndex {
1502 pub const ROOT: UniverseIndex = UniverseIndex::from_u32_const(0);
1504 /// Returns the "next" universe index in order -- this new index
1505 /// is considered to extend all previous universes. This
1506 /// corresponds to entering a `forall` quantifier. So, for
1507 /// example, suppose we have this type in universe `U`:
1510 /// for<'a> fn(&'a u32)
1513 /// Once we "enter" into this `for<'a>` quantifier, we are in a
1514 /// new universe that extends `U` -- in this new universe, we can
1515 /// name the region `'a`, but that region was not nameable from
1516 /// `U` because it was not in scope there.
1517 pub fn next_universe(self) -> UniverseIndex {
1518 UniverseIndex::from_u32(self.private.checked_add(1).unwrap())
1521 /// True if `self` can name a name from `other` -- in other words,
1522 /// if the set of names in `self` is a superset of those in
1524 pub fn can_name(self, other: UniverseIndex) -> bool {
1525 self.private >= other.private
1529 /// The "placeholder index" fully defines a placeholder region.
1530 /// Placeholder regions are identified by both a **universe** as well
1531 /// as a "bound-region" within that universe. The `bound_region` is
1532 /// basically a name -- distinct bound regions within the same
1533 /// universe are just two regions with an unknown relationship to one
1535 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, PartialOrd, Ord)]
1536 pub struct Placeholder {
1537 pub universe: UniverseIndex,
1538 pub name: BoundRegion,
1541 /// When type checking, we use the `ParamEnv` to track
1542 /// details about the set of where-clauses that are in scope at this
1543 /// particular point.
1544 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash)]
1545 pub struct ParamEnv<'tcx> {
1546 /// Obligations that the caller must satisfy. This is basically
1547 /// the set of bounds on the in-scope type parameters, translated
1548 /// into Obligations, and elaborated and normalized.
1549 pub caller_bounds: &'tcx List<ty::Predicate<'tcx>>,
1551 /// Typically, this is `Reveal::UserFacing`, but during codegen we
1552 /// want `Reveal::All` -- note that this is always paired with an
1553 /// empty environment. To get that, use `ParamEnv::reveal()`.
1554 pub reveal: traits::Reveal,
1557 impl<'tcx> ParamEnv<'tcx> {
1558 /// Construct a trait environment suitable for contexts where
1559 /// there are no where clauses in scope. Hidden types (like `impl
1560 /// Trait`) are left hidden, so this is suitable for ordinary
1562 pub fn empty() -> Self {
1563 Self::new(List::empty(), Reveal::UserFacing)
1566 /// Construct a trait environment with no where clauses in scope
1567 /// where the values of all `impl Trait` and other hidden types
1568 /// are revealed. This is suitable for monomorphized, post-typeck
1569 /// environments like codegen or doing optimizations.
1571 /// NB. If you want to have predicates in scope, use `ParamEnv::new`,
1572 /// or invoke `param_env.with_reveal_all()`.
1573 pub fn reveal_all() -> Self {
1574 Self::new(List::empty(), Reveal::All)
1577 /// Construct a trait environment with the given set of predicates.
1578 pub fn new(caller_bounds: &'tcx List<ty::Predicate<'tcx>>,
1581 ty::ParamEnv { caller_bounds, reveal }
1584 /// Returns a new parameter environment with the same clauses, but
1585 /// which "reveals" the true results of projections in all cases
1586 /// (even for associated types that are specializable). This is
1587 /// the desired behavior during codegen and certain other special
1588 /// contexts; normally though we want to use `Reveal::UserFacing`,
1589 /// which is the default.
1590 pub fn with_reveal_all(self) -> Self {
1591 ty::ParamEnv { reveal: Reveal::All, ..self }
1594 /// Returns this same environment but with no caller bounds.
1595 pub fn without_caller_bounds(self) -> Self {
1596 ty::ParamEnv { caller_bounds: List::empty(), ..self }
1599 /// Creates a suitable environment in which to perform trait
1600 /// queries on the given value. When type-checking, this is simply
1601 /// the pair of the environment plus value. But when reveal is set to
1602 /// All, then if `value` does not reference any type parameters, we will
1603 /// pair it with the empty environment. This improves caching and is generally
1606 /// NB: We preserve the environment when type-checking because it
1607 /// is possible for the user to have wacky where-clauses like
1608 /// `where Box<u32>: Copy`, which are clearly never
1609 /// satisfiable. We generally want to behave as if they were true,
1610 /// although the surrounding function is never reachable.
1611 pub fn and<T: TypeFoldable<'tcx>>(self, value: T) -> ParamEnvAnd<'tcx, T> {
1613 Reveal::UserFacing => {
1622 || value.needs_infer()
1623 || value.has_param_types()
1624 || value.has_self_ty()
1632 param_env: self.without_caller_bounds(),
1641 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash)]
1642 pub struct ParamEnvAnd<'tcx, T> {
1643 pub param_env: ParamEnv<'tcx>,
1647 impl<'tcx, T> ParamEnvAnd<'tcx, T> {
1648 pub fn into_parts(self) -> (ParamEnv<'tcx>, T) {
1649 (self.param_env, self.value)
1653 impl<'a, 'gcx, T> HashStable<StableHashingContext<'a>> for ParamEnvAnd<'gcx, T>
1654 where T: HashStable<StableHashingContext<'a>>
1656 fn hash_stable<W: StableHasherResult>(&self,
1657 hcx: &mut StableHashingContext<'a>,
1658 hasher: &mut StableHasher<W>) {
1664 param_env.hash_stable(hcx, hasher);
1665 value.hash_stable(hcx, hasher);
1669 #[derive(Copy, Clone, Debug)]
1670 pub struct Destructor {
1671 /// The def-id of the destructor method
1676 pub struct AdtFlags: u32 {
1677 const NO_ADT_FLAGS = 0;
1678 const IS_ENUM = 1 << 0;
1679 const IS_PHANTOM_DATA = 1 << 1;
1680 const IS_FUNDAMENTAL = 1 << 2;
1681 const IS_UNION = 1 << 3;
1682 const IS_BOX = 1 << 4;
1683 /// Indicates whether the type is an `Arc`.
1684 const IS_ARC = 1 << 5;
1685 /// Indicates whether the type is an `Rc`.
1686 const IS_RC = 1 << 6;
1687 /// Indicates whether the variant list of this ADT is `#[non_exhaustive]`.
1688 /// (i.e., this flag is never set unless this ADT is an enum).
1689 const IS_VARIANT_LIST_NON_EXHAUSTIVE = 1 << 7;
1694 pub struct VariantFlags: u32 {
1695 const NO_VARIANT_FLAGS = 0;
1696 /// Indicates whether the field list of this variant is `#[non_exhaustive]`.
1697 const IS_FIELD_LIST_NON_EXHAUSTIVE = 1 << 0;
1702 pub struct VariantDef {
1703 /// The variant's DefId. If this is a tuple-like struct,
1704 /// this is the DefId of the struct's ctor.
1706 pub name: Name, // struct's name if this is a struct
1707 pub discr: VariantDiscr,
1708 pub fields: Vec<FieldDef>,
1709 pub ctor_kind: CtorKind,
1710 flags: VariantFlags,
1713 impl<'a, 'gcx, 'tcx> VariantDef {
1714 /// Create a new `VariantDef`.
1716 /// - `did` is the DefId used for the variant - for tuple-structs, it is the constructor DefId,
1717 /// and for everything else, it is the variant DefId.
1718 /// - `attribute_def_id` is the DefId that has the variant's attributes.
1719 /// this is the struct DefId for structs, and the variant DefId for variants.
1721 /// Note that we *could* use the constructor DefId, because the constructor attributes
1722 /// redirect to the base attributes, but compiling a small crate requires
1723 /// loading the AdtDefs for all the structs in the universe (e.g. coherence for any
1724 /// built-in trait), and we do not want to load attributes twice.
1726 /// If someone speeds up attribute loading to not be a performance concern, they can
1727 /// remove this hack and use the constructor DefId everywhere.
1728 pub fn new(tcx: TyCtxt<'a, 'gcx, 'tcx>,
1731 discr: VariantDiscr,
1732 fields: Vec<FieldDef>,
1734 ctor_kind: CtorKind,
1735 attribute_def_id: DefId)
1738 debug!("VariantDef::new({:?}, {:?}, {:?}, {:?}, {:?}, {:?}, {:?})", did, name, discr,
1739 fields, adt_kind, ctor_kind, attribute_def_id);
1740 let mut flags = VariantFlags::NO_VARIANT_FLAGS;
1741 if adt_kind == AdtKind::Struct && tcx.has_attr(attribute_def_id, "non_exhaustive") {
1742 debug!("found non-exhaustive field list for {:?}", did);
1743 flags = flags | VariantFlags::IS_FIELD_LIST_NON_EXHAUSTIVE;
1756 pub fn is_field_list_non_exhaustive(&self) -> bool {
1757 self.flags.intersects(VariantFlags::IS_FIELD_LIST_NON_EXHAUSTIVE)
1761 impl_stable_hash_for!(struct VariantDef {
1770 #[derive(Copy, Clone, Debug, PartialEq, Eq, RustcEncodable, RustcDecodable)]
1771 pub enum VariantDiscr {
1772 /// Explicit value for this variant, i.e. `X = 123`.
1773 /// The `DefId` corresponds to the embedded constant.
1776 /// The previous variant's discriminant plus one.
1777 /// For efficiency reasons, the distance from the
1778 /// last `Explicit` discriminant is being stored,
1779 /// or `0` for the first variant, if it has none.
1784 pub struct FieldDef {
1787 pub vis: Visibility,
1790 /// The definition of an abstract data type - a struct or enum.
1792 /// These are all interned (by intern_adt_def) into the adt_defs
1796 pub variants: Vec<VariantDef>,
1798 pub repr: ReprOptions,
1801 impl PartialOrd for AdtDef {
1802 fn partial_cmp(&self, other: &AdtDef) -> Option<Ordering> {
1803 Some(self.cmp(&other))
1807 /// There should be only one AdtDef for each `did`, therefore
1808 /// it is fine to implement `Ord` only based on `did`.
1809 impl Ord for AdtDef {
1810 fn cmp(&self, other: &AdtDef) -> Ordering {
1811 self.did.cmp(&other.did)
1815 impl PartialEq for AdtDef {
1816 // AdtDef are always interned and this is part of TyS equality
1818 fn eq(&self, other: &Self) -> bool { ptr::eq(self, other) }
1821 impl Eq for AdtDef {}
1823 impl Hash for AdtDef {
1825 fn hash<H: Hasher>(&self, s: &mut H) {
1826 (self as *const AdtDef).hash(s)
1830 impl<'tcx> serialize::UseSpecializedEncodable for &'tcx AdtDef {
1831 fn default_encode<S: Encoder>(&self, s: &mut S) -> Result<(), S::Error> {
1836 impl<'tcx> serialize::UseSpecializedDecodable for &'tcx AdtDef {}
1839 impl<'a> HashStable<StableHashingContext<'a>> for AdtDef {
1840 fn hash_stable<W: StableHasherResult>(&self,
1841 hcx: &mut StableHashingContext<'a>,
1842 hasher: &mut StableHasher<W>) {
1844 static CACHE: RefCell<FxHashMap<usize, Fingerprint>> = Default::default();
1847 let hash: Fingerprint = CACHE.with(|cache| {
1848 let addr = self as *const AdtDef as usize;
1849 *cache.borrow_mut().entry(addr).or_insert_with(|| {
1857 let mut hasher = StableHasher::new();
1858 did.hash_stable(hcx, &mut hasher);
1859 variants.hash_stable(hcx, &mut hasher);
1860 flags.hash_stable(hcx, &mut hasher);
1861 repr.hash_stable(hcx, &mut hasher);
1867 hash.hash_stable(hcx, hasher);
1871 #[derive(Copy, Clone, Debug, Eq, PartialEq, Hash)]
1872 pub enum AdtKind { Struct, Union, Enum }
1874 impl Into<DataTypeKind> for AdtKind {
1875 fn into(self) -> DataTypeKind {
1877 AdtKind::Struct => DataTypeKind::Struct,
1878 AdtKind::Union => DataTypeKind::Union,
1879 AdtKind::Enum => DataTypeKind::Enum,
1885 #[derive(RustcEncodable, RustcDecodable, Default)]
1886 pub struct ReprFlags: u8 {
1887 const IS_C = 1 << 0;
1888 const IS_SIMD = 1 << 1;
1889 const IS_TRANSPARENT = 1 << 2;
1890 // Internal only for now. If true, don't reorder fields.
1891 const IS_LINEAR = 1 << 3;
1893 // Any of these flags being set prevent field reordering optimisation.
1894 const IS_UNOPTIMISABLE = ReprFlags::IS_C.bits |
1895 ReprFlags::IS_SIMD.bits |
1896 ReprFlags::IS_LINEAR.bits;
1900 impl_stable_hash_for!(struct ReprFlags {
1906 /// Represents the repr options provided by the user,
1907 #[derive(Copy, Clone, Debug, Eq, PartialEq, RustcEncodable, RustcDecodable, Default)]
1908 pub struct ReprOptions {
1909 pub int: Option<attr::IntType>,
1912 pub flags: ReprFlags,
1915 impl_stable_hash_for!(struct ReprOptions {
1923 pub fn new(tcx: TyCtxt<'_, '_, '_>, did: DefId) -> ReprOptions {
1924 let mut flags = ReprFlags::empty();
1925 let mut size = None;
1926 let mut max_align = 0;
1927 let mut min_pack = 0;
1928 for attr in tcx.get_attrs(did).iter() {
1929 for r in attr::find_repr_attrs(tcx.sess.diagnostic(), attr) {
1930 flags.insert(match r {
1931 attr::ReprC => ReprFlags::IS_C,
1932 attr::ReprPacked(pack) => {
1933 min_pack = if min_pack > 0 {
1934 cmp::min(pack, min_pack)
1940 attr::ReprTransparent => ReprFlags::IS_TRANSPARENT,
1941 attr::ReprSimd => ReprFlags::IS_SIMD,
1942 attr::ReprInt(i) => {
1946 attr::ReprAlign(align) => {
1947 max_align = cmp::max(align, max_align);
1954 // This is here instead of layout because the choice must make it into metadata.
1955 if !tcx.consider_optimizing(|| format!("Reorder fields of {:?}", tcx.item_path_str(did))) {
1956 flags.insert(ReprFlags::IS_LINEAR);
1958 ReprOptions { int: size, align: max_align, pack: min_pack, flags: flags }
1962 pub fn simd(&self) -> bool { self.flags.contains(ReprFlags::IS_SIMD) }
1964 pub fn c(&self) -> bool { self.flags.contains(ReprFlags::IS_C) }
1966 pub fn packed(&self) -> bool { self.pack > 0 }
1968 pub fn transparent(&self) -> bool { self.flags.contains(ReprFlags::IS_TRANSPARENT) }
1970 pub fn linear(&self) -> bool { self.flags.contains(ReprFlags::IS_LINEAR) }
1972 pub fn discr_type(&self) -> attr::IntType {
1973 self.int.unwrap_or(attr::SignedInt(ast::IntTy::Isize))
1976 /// Returns true if this `#[repr()]` should inhabit "smart enum
1977 /// layout" optimizations, such as representing `Foo<&T>` as a
1979 pub fn inhibit_enum_layout_opt(&self) -> bool {
1980 self.c() || self.int.is_some()
1983 /// Returns true if this `#[repr()]` should inhibit struct field reordering
1984 /// optimizations, such as with repr(C) or repr(packed(1)).
1985 pub fn inhibit_struct_field_reordering_opt(&self) -> bool {
1986 !(self.flags & ReprFlags::IS_UNOPTIMISABLE).is_empty() || (self.pack == 1)
1990 impl<'a, 'gcx, 'tcx> AdtDef {
1991 fn new(tcx: TyCtxt<'_, '_, '_>,
1994 variants: Vec<VariantDef>,
1995 repr: ReprOptions) -> Self {
1996 debug!("AdtDef::new({:?}, {:?}, {:?}, {:?})", did, kind, variants, repr);
1997 let mut flags = AdtFlags::NO_ADT_FLAGS;
1998 let attrs = tcx.get_attrs(did);
1999 if attr::contains_name(&attrs, "fundamental") {
2000 flags = flags | AdtFlags::IS_FUNDAMENTAL;
2002 if Some(did) == tcx.lang_items().phantom_data() {
2003 flags = flags | AdtFlags::IS_PHANTOM_DATA;
2005 if Some(did) == tcx.lang_items().owned_box() {
2006 flags = flags | AdtFlags::IS_BOX;
2008 if Some(did) == tcx.lang_items().arc() {
2009 flags = flags | AdtFlags::IS_ARC;
2011 if Some(did) == tcx.lang_items().rc() {
2012 flags = flags | AdtFlags::IS_RC;
2014 if kind == AdtKind::Enum && tcx.has_attr(did, "non_exhaustive") {
2015 debug!("found non-exhaustive variant list for {:?}", did);
2016 flags = flags | AdtFlags::IS_VARIANT_LIST_NON_EXHAUSTIVE;
2019 AdtKind::Enum => flags = flags | AdtFlags::IS_ENUM,
2020 AdtKind::Union => flags = flags | AdtFlags::IS_UNION,
2021 AdtKind::Struct => {}
2032 pub fn is_struct(&self) -> bool {
2033 !self.is_union() && !self.is_enum()
2037 pub fn is_union(&self) -> bool {
2038 self.flags.intersects(AdtFlags::IS_UNION)
2042 pub fn is_enum(&self) -> bool {
2043 self.flags.intersects(AdtFlags::IS_ENUM)
2047 pub fn is_variant_list_non_exhaustive(&self) -> bool {
2048 self.flags.intersects(AdtFlags::IS_VARIANT_LIST_NON_EXHAUSTIVE)
2051 /// Returns the kind of the ADT - Struct or Enum.
2053 pub fn adt_kind(&self) -> AdtKind {
2056 } else if self.is_union() {
2063 pub fn descr(&self) -> &'static str {
2064 match self.adt_kind() {
2065 AdtKind::Struct => "struct",
2066 AdtKind::Union => "union",
2067 AdtKind::Enum => "enum",
2071 pub fn variant_descr(&self) -> &'static str {
2072 match self.adt_kind() {
2073 AdtKind::Struct => "struct",
2074 AdtKind::Union => "union",
2075 AdtKind::Enum => "variant",
2079 /// Returns whether this type is #[fundamental] for the purposes
2080 /// of coherence checking.
2082 pub fn is_fundamental(&self) -> bool {
2083 self.flags.intersects(AdtFlags::IS_FUNDAMENTAL)
2086 /// Returns true if this is PhantomData<T>.
2088 pub fn is_phantom_data(&self) -> bool {
2089 self.flags.intersects(AdtFlags::IS_PHANTOM_DATA)
2092 /// Returns `true` if this is `Arc<T>`.
2093 pub fn is_arc(&self) -> bool {
2094 self.flags.intersects(AdtFlags::IS_ARC)
2097 /// Returns `true` if this is `Rc<T>`.
2098 pub fn is_rc(&self) -> bool {
2099 self.flags.intersects(AdtFlags::IS_RC)
2102 /// Returns true if this is Box<T>.
2104 pub fn is_box(&self) -> bool {
2105 self.flags.intersects(AdtFlags::IS_BOX)
2108 /// Returns whether this type has a destructor.
2109 pub fn has_dtor(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> bool {
2110 self.destructor(tcx).is_some()
2113 /// Asserts this is a struct or union and returns its unique variant.
2114 pub fn non_enum_variant(&self) -> &VariantDef {
2115 assert!(self.is_struct() || self.is_union());
2120 pub fn predicates(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> GenericPredicates<'gcx> {
2121 tcx.predicates_of(self.did)
2124 /// Returns an iterator over all fields contained
2127 pub fn all_fields<'s>(&'s self) -> impl Iterator<Item = &'s FieldDef> {
2128 self.variants.iter().flat_map(|v| v.fields.iter())
2131 pub fn is_payloadfree(&self) -> bool {
2132 !self.variants.is_empty() &&
2133 self.variants.iter().all(|v| v.fields.is_empty())
2136 pub fn variant_with_id(&self, vid: DefId) -> &VariantDef {
2139 .find(|v| v.did == vid)
2140 .expect("variant_with_id: unknown variant")
2143 pub fn variant_index_with_id(&self, vid: DefId) -> usize {
2146 .position(|v| v.did == vid)
2147 .expect("variant_index_with_id: unknown variant")
2150 pub fn variant_of_def(&self, def: Def) -> &VariantDef {
2152 Def::Variant(vid) | Def::VariantCtor(vid, ..) => self.variant_with_id(vid),
2153 Def::Struct(..) | Def::StructCtor(..) | Def::Union(..) |
2154 Def::TyAlias(..) | Def::AssociatedTy(..) | Def::SelfTy(..) |
2155 Def::SelfCtor(..) => self.non_enum_variant(),
2156 _ => bug!("unexpected def {:?} in variant_of_def", def)
2161 pub fn eval_explicit_discr(
2163 tcx: TyCtxt<'a, 'gcx, 'tcx>,
2165 ) -> Option<Discr<'tcx>> {
2166 let param_env = ParamEnv::empty();
2167 let repr_type = self.repr.discr_type();
2168 let substs = Substs::identity_for_item(tcx.global_tcx(), expr_did);
2169 let instance = ty::Instance::new(expr_did, substs);
2170 let cid = GlobalId {
2174 match tcx.const_eval(param_env.and(cid)) {
2176 // FIXME: Find the right type and use it instead of `val.ty` here
2177 if let Some(b) = val.assert_bits(tcx.global_tcx(), param_env.and(val.ty)) {
2178 trace!("discriminants: {} ({:?})", b, repr_type);
2184 info!("invalid enum discriminant: {:#?}", val);
2185 ::mir::interpret::struct_error(
2186 tcx.at(tcx.def_span(expr_did)),
2187 "constant evaluation of enum discriminant resulted in non-integer",
2193 err.report_as_error(
2194 tcx.at(tcx.def_span(expr_did)),
2195 "could not evaluate enum discriminant",
2197 if !expr_did.is_local() {
2198 span_bug!(tcx.def_span(expr_did),
2199 "variant discriminant evaluation succeeded \
2200 in its crate but failed locally");
2208 pub fn discriminants(
2210 tcx: TyCtxt<'a, 'gcx, 'tcx>,
2211 ) -> impl Iterator<Item=Discr<'tcx>> + Captures<'gcx> + 'a {
2212 let repr_type = self.repr.discr_type();
2213 let initial = repr_type.initial_discriminant(tcx.global_tcx());
2214 let mut prev_discr = None::<Discr<'tcx>>;
2215 self.variants.iter().map(move |v| {
2216 let mut discr = prev_discr.map_or(initial, |d| d.wrap_incr(tcx));
2217 if let VariantDiscr::Explicit(expr_did) = v.discr {
2218 if let Some(new_discr) = self.eval_explicit_discr(tcx, expr_did) {
2222 prev_discr = Some(discr);
2228 /// Compute the discriminant value used by a specific variant.
2229 /// Unlike `discriminants`, this is (amortized) constant-time,
2230 /// only doing at most one query for evaluating an explicit
2231 /// discriminant (the last one before the requested variant),
2232 /// assuming there are no constant-evaluation errors there.
2233 pub fn discriminant_for_variant(&self,
2234 tcx: TyCtxt<'a, 'gcx, 'tcx>,
2235 variant_index: usize)
2237 let (val, offset) = self.discriminant_def_for_variant(variant_index);
2238 let explicit_value = val
2239 .and_then(|expr_did| self.eval_explicit_discr(tcx, expr_did))
2240 .unwrap_or_else(|| self.repr.discr_type().initial_discriminant(tcx.global_tcx()));
2241 explicit_value.checked_add(tcx, offset as u128).0
2244 /// Yields a DefId for the discriminant and an offset to add to it
2245 /// Alternatively, if there is no explicit discriminant, returns the
2246 /// inferred discriminant directly
2247 pub fn discriminant_def_for_variant(
2249 variant_index: usize,
2250 ) -> (Option<DefId>, usize) {
2251 let mut explicit_index = variant_index;
2254 match self.variants[explicit_index].discr {
2255 ty::VariantDiscr::Relative(0) => {
2259 ty::VariantDiscr::Relative(distance) => {
2260 explicit_index -= distance;
2262 ty::VariantDiscr::Explicit(did) => {
2263 expr_did = Some(did);
2268 (expr_did, variant_index - explicit_index)
2271 pub fn destructor(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Destructor> {
2272 tcx.adt_destructor(self.did)
2275 /// Returns a list of types such that `Self: Sized` if and only
2276 /// if that type is Sized, or `TyErr` if this type is recursive.
2278 /// Oddly enough, checking that the sized-constraint is Sized is
2279 /// actually more expressive than checking all members:
2280 /// the Sized trait is inductive, so an associated type that references
2281 /// Self would prevent its containing ADT from being Sized.
2283 /// Due to normalization being eager, this applies even if
2284 /// the associated type is behind a pointer, e.g. issue #31299.
2285 pub fn sized_constraint(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> &'tcx [Ty<'tcx>] {
2286 match tcx.try_adt_sized_constraint(DUMMY_SP, self.did) {
2289 debug!("adt_sized_constraint: {:?} is recursive", self);
2290 // This should be reported as an error by `check_representable`.
2292 // Consider the type as Sized in the meanwhile to avoid
2293 // further errors. Delay our `bug` diagnostic here to get
2294 // emitted later as well in case we accidentally otherwise don't
2297 tcx.intern_type_list(&[tcx.types.err])
2302 fn sized_constraint_for_ty(&self,
2303 tcx: TyCtxt<'a, 'tcx, 'tcx>,
2306 let result = match ty.sty {
2307 Bool | Char | Int(..) | Uint(..) | Float(..) |
2308 RawPtr(..) | Ref(..) | FnDef(..) | FnPtr(_) |
2309 Array(..) | Closure(..) | Generator(..) | Never => {
2318 GeneratorWitness(..) => {
2319 // these are never sized - return the target type
2326 Some(ty) => self.sized_constraint_for_ty(tcx, ty)
2330 Adt(adt, substs) => {
2332 let adt_tys = adt.sized_constraint(tcx);
2333 debug!("sized_constraint_for_ty({:?}) intermediate = {:?}",
2336 .map(|ty| ty.subst(tcx, substs))
2337 .flat_map(|ty| self.sized_constraint_for_ty(tcx, ty))
2341 Projection(..) | Opaque(..) => {
2342 // must calculate explicitly.
2343 // FIXME: consider special-casing always-Sized projections
2347 UnnormalizedProjection(..) => bug!("only used with chalk-engine"),
2350 // perf hack: if there is a `T: Sized` bound, then
2351 // we know that `T` is Sized and do not need to check
2354 let sized_trait = match tcx.lang_items().sized_trait() {
2356 _ => return vec![ty]
2358 let sized_predicate = Binder::dummy(TraitRef {
2359 def_id: sized_trait,
2360 substs: tcx.mk_substs_trait(ty, &[])
2362 let predicates = tcx.predicates_of(self.did).predicates;
2363 if predicates.into_iter().any(|(p, _)| p == sized_predicate) {
2371 bug!("unexpected type `{:?}` in sized_constraint_for_ty",
2375 debug!("sized_constraint_for_ty({:?}) = {:?}", ty, result);
2380 impl<'a, 'gcx, 'tcx> FieldDef {
2381 pub fn ty(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>, subst: &Substs<'tcx>) -> Ty<'tcx> {
2382 tcx.type_of(self.did).subst(tcx, subst)
2386 /// Represents the various closure traits in the Rust language. This
2387 /// will determine the type of the environment (`self`, in the
2388 /// desuaring) argument that the closure expects.
2390 /// You can get the environment type of a closure using
2391 /// `tcx.closure_env_ty()`.
2392 #[derive(Clone, Copy, PartialOrd, Ord, PartialEq, Eq, Hash, Debug, RustcEncodable, RustcDecodable)]
2393 pub enum ClosureKind {
2394 // Warning: Ordering is significant here! The ordering is chosen
2395 // because the trait Fn is a subtrait of FnMut and so in turn, and
2396 // hence we order it so that Fn < FnMut < FnOnce.
2402 impl<'a, 'tcx> ClosureKind {
2403 // This is the initial value used when doing upvar inference.
2404 pub const LATTICE_BOTTOM: ClosureKind = ClosureKind::Fn;
2406 pub fn trait_did(&self, tcx: TyCtxt<'a, 'tcx, 'tcx>) -> DefId {
2408 ClosureKind::Fn => tcx.require_lang_item(FnTraitLangItem),
2409 ClosureKind::FnMut => {
2410 tcx.require_lang_item(FnMutTraitLangItem)
2412 ClosureKind::FnOnce => {
2413 tcx.require_lang_item(FnOnceTraitLangItem)
2418 /// True if this a type that impls this closure kind
2419 /// must also implement `other`.
2420 pub fn extends(self, other: ty::ClosureKind) -> bool {
2421 match (self, other) {
2422 (ClosureKind::Fn, ClosureKind::Fn) => true,
2423 (ClosureKind::Fn, ClosureKind::FnMut) => true,
2424 (ClosureKind::Fn, ClosureKind::FnOnce) => true,
2425 (ClosureKind::FnMut, ClosureKind::FnMut) => true,
2426 (ClosureKind::FnMut, ClosureKind::FnOnce) => true,
2427 (ClosureKind::FnOnce, ClosureKind::FnOnce) => true,
2432 /// Returns the representative scalar type for this closure kind.
2433 /// See `TyS::to_opt_closure_kind` for more details.
2434 pub fn to_ty(self, tcx: TyCtxt<'_, '_, 'tcx>) -> Ty<'tcx> {
2436 ty::ClosureKind::Fn => tcx.types.i8,
2437 ty::ClosureKind::FnMut => tcx.types.i16,
2438 ty::ClosureKind::FnOnce => tcx.types.i32,
2443 impl<'tcx> TyS<'tcx> {
2444 /// Iterator that walks `self` and any types reachable from
2445 /// `self`, in depth-first order. Note that just walks the types
2446 /// that appear in `self`, it does not descend into the fields of
2447 /// structs or variants. For example:
2450 /// isize => { isize }
2451 /// Foo<Bar<isize>> => { Foo<Bar<isize>>, Bar<isize>, isize }
2452 /// [isize] => { [isize], isize }
2454 pub fn walk(&'tcx self) -> TypeWalker<'tcx> {
2455 TypeWalker::new(self)
2458 /// Iterator that walks the immediate children of `self`. Hence
2459 /// `Foo<Bar<i32>, u32>` yields the sequence `[Bar<i32>, u32]`
2460 /// (but not `i32`, like `walk`).
2461 pub fn walk_shallow(&'tcx self) -> smallvec::IntoIter<walk::TypeWalkerArray<'tcx>> {
2462 walk::walk_shallow(self)
2465 /// Walks `ty` and any types appearing within `ty`, invoking the
2466 /// callback `f` on each type. If the callback returns false, then the
2467 /// children of the current type are ignored.
2469 /// Note: prefer `ty.walk()` where possible.
2470 pub fn maybe_walk<F>(&'tcx self, mut f: F)
2471 where F : FnMut(Ty<'tcx>) -> bool
2473 let mut walker = self.walk();
2474 while let Some(ty) = walker.next() {
2476 walker.skip_current_subtree();
2483 pub fn from_mutbl(m: hir::Mutability) -> BorrowKind {
2485 hir::MutMutable => MutBorrow,
2486 hir::MutImmutable => ImmBorrow,
2490 /// Returns a mutability `m` such that an `&m T` pointer could be used to obtain this borrow
2491 /// kind. Because borrow kinds are richer than mutabilities, we sometimes have to pick a
2492 /// mutability that is stronger than necessary so that it at least *would permit* the borrow in
2494 pub fn to_mutbl_lossy(self) -> hir::Mutability {
2496 MutBorrow => hir::MutMutable,
2497 ImmBorrow => hir::MutImmutable,
2499 // We have no type corresponding to a unique imm borrow, so
2500 // use `&mut`. It gives all the capabilities of an `&uniq`
2501 // and hence is a safe "over approximation".
2502 UniqueImmBorrow => hir::MutMutable,
2506 pub fn to_user_str(&self) -> &'static str {
2508 MutBorrow => "mutable",
2509 ImmBorrow => "immutable",
2510 UniqueImmBorrow => "uniquely immutable",
2515 #[derive(Debug, Clone)]
2516 pub enum Attributes<'gcx> {
2517 Owned(Lrc<[ast::Attribute]>),
2518 Borrowed(&'gcx [ast::Attribute])
2521 impl<'gcx> ::std::ops::Deref for Attributes<'gcx> {
2522 type Target = [ast::Attribute];
2524 fn deref(&self) -> &[ast::Attribute] {
2526 &Attributes::Owned(ref data) => &data,
2527 &Attributes::Borrowed(data) => data
2532 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2533 pub fn body_tables(self, body: hir::BodyId) -> &'gcx TypeckTables<'gcx> {
2534 self.typeck_tables_of(self.hir.body_owner_def_id(body))
2537 /// Returns an iterator of the def-ids for all body-owners in this
2538 /// crate. If you would prefer to iterate over the bodies
2539 /// themselves, you can do `self.hir.krate().body_ids.iter()`.
2542 ) -> impl Iterator<Item = DefId> + Captures<'tcx> + Captures<'gcx> + 'a {
2546 .map(move |&body_id| self.hir.body_owner_def_id(body_id))
2549 pub fn par_body_owners<F: Fn(DefId) + sync::Sync + sync::Send>(self, f: F) {
2550 par_iter(&self.hir.krate().body_ids).for_each(|&body_id| {
2551 f(self.hir.body_owner_def_id(body_id))
2555 pub fn expr_span(self, id: NodeId) -> Span {
2556 match self.hir.find(id) {
2557 Some(Node::Expr(e)) => {
2561 bug!("Node id {} is not an expr: {:?}", id, f);
2564 bug!("Node id {} is not present in the node map", id);
2569 pub fn provided_trait_methods(self, id: DefId) -> Vec<AssociatedItem> {
2570 self.associated_items(id)
2571 .filter(|item| item.kind == AssociatedKind::Method && item.defaultness.has_value())
2575 pub fn trait_relevant_for_never(self, did: DefId) -> bool {
2576 self.associated_items(did).any(|item| {
2577 item.relevant_for_never()
2581 pub fn opt_associated_item(self, def_id: DefId) -> Option<AssociatedItem> {
2582 let is_associated_item = if let Some(node_id) = self.hir.as_local_node_id(def_id) {
2583 match self.hir.get(node_id) {
2584 Node::TraitItem(_) | Node::ImplItem(_) => true,
2588 match self.describe_def(def_id).expect("no def for def-id") {
2589 Def::AssociatedConst(_) | Def::Method(_) | Def::AssociatedTy(_) => true,
2594 if is_associated_item {
2595 Some(self.associated_item(def_id))
2601 fn associated_item_from_trait_item_ref(self,
2602 parent_def_id: DefId,
2603 parent_vis: &hir::Visibility,
2604 trait_item_ref: &hir::TraitItemRef)
2606 let def_id = self.hir.local_def_id(trait_item_ref.id.node_id);
2607 let (kind, has_self) = match trait_item_ref.kind {
2608 hir::AssociatedItemKind::Const => (ty::AssociatedKind::Const, false),
2609 hir::AssociatedItemKind::Method { has_self } => {
2610 (ty::AssociatedKind::Method, has_self)
2612 hir::AssociatedItemKind::Type => (ty::AssociatedKind::Type, false),
2613 hir::AssociatedItemKind::Existential => bug!("only impls can have existentials"),
2617 ident: trait_item_ref.ident,
2619 // Visibility of trait items is inherited from their traits.
2620 vis: Visibility::from_hir(parent_vis, trait_item_ref.id.node_id, self),
2621 defaultness: trait_item_ref.defaultness,
2623 container: TraitContainer(parent_def_id),
2624 method_has_self_argument: has_self
2628 fn associated_item_from_impl_item_ref(self,
2629 parent_def_id: DefId,
2630 impl_item_ref: &hir::ImplItemRef)
2632 let def_id = self.hir.local_def_id(impl_item_ref.id.node_id);
2633 let (kind, has_self) = match impl_item_ref.kind {
2634 hir::AssociatedItemKind::Const => (ty::AssociatedKind::Const, false),
2635 hir::AssociatedItemKind::Method { has_self } => {
2636 (ty::AssociatedKind::Method, has_self)
2638 hir::AssociatedItemKind::Type => (ty::AssociatedKind::Type, false),
2639 hir::AssociatedItemKind::Existential => (ty::AssociatedKind::Existential, false),
2643 ident: impl_item_ref.ident,
2645 // Visibility of trait impl items doesn't matter.
2646 vis: ty::Visibility::from_hir(&impl_item_ref.vis, impl_item_ref.id.node_id, self),
2647 defaultness: impl_item_ref.defaultness,
2649 container: ImplContainer(parent_def_id),
2650 method_has_self_argument: has_self
2654 pub fn field_index(self, node_id: NodeId, tables: &TypeckTables<'_>) -> usize {
2655 let hir_id = self.hir.node_to_hir_id(node_id);
2656 tables.field_indices().get(hir_id).cloned().expect("no index for a field")
2659 pub fn find_field_index(self, ident: Ident, variant: &VariantDef) -> Option<usize> {
2660 variant.fields.iter().position(|field| {
2661 self.adjust_ident(ident, variant.did, DUMMY_NODE_ID).0 == field.ident.modern()
2665 pub fn associated_items(
2668 ) -> impl Iterator<Item = AssociatedItem> + 'a {
2669 let def_ids = self.associated_item_def_ids(def_id);
2670 Box::new((0..def_ids.len()).map(move |i| self.associated_item(def_ids[i])))
2671 as Box<dyn Iterator<Item = AssociatedItem> + 'a>
2674 /// Returns true if the impls are the same polarity and the trait either
2675 /// has no items or is annotated #[marker] and prevents item overrides.
2676 pub fn impls_are_allowed_to_overlap(self, def_id1: DefId, def_id2: DefId) -> bool {
2677 if self.features().overlapping_marker_traits {
2678 let trait1_is_empty = self.impl_trait_ref(def_id1)
2679 .map_or(false, |trait_ref| {
2680 self.associated_item_def_ids(trait_ref.def_id).is_empty()
2682 let trait2_is_empty = self.impl_trait_ref(def_id2)
2683 .map_or(false, |trait_ref| {
2684 self.associated_item_def_ids(trait_ref.def_id).is_empty()
2686 self.impl_polarity(def_id1) == self.impl_polarity(def_id2)
2689 } else if self.features().marker_trait_attr {
2690 let is_marker_impl = |def_id: DefId| -> bool {
2691 let trait_ref = self.impl_trait_ref(def_id);
2692 trait_ref.map_or(false, |tr| self.trait_def(tr.def_id).is_marker)
2694 self.impl_polarity(def_id1) == self.impl_polarity(def_id2)
2695 && is_marker_impl(def_id1)
2696 && is_marker_impl(def_id2)
2702 // Returns `ty::VariantDef` if `def` refers to a struct,
2703 // or variant or their constructors, panics otherwise.
2704 pub fn expect_variant_def(self, def: Def) -> &'tcx VariantDef {
2706 Def::Variant(did) | Def::VariantCtor(did, ..) => {
2707 let enum_did = self.parent_def_id(did).unwrap();
2708 self.adt_def(enum_did).variant_with_id(did)
2710 Def::Struct(did) | Def::Union(did) => {
2711 self.adt_def(did).non_enum_variant()
2713 Def::StructCtor(ctor_did, ..) => {
2714 let did = self.parent_def_id(ctor_did).expect("struct ctor has no parent");
2715 self.adt_def(did).non_enum_variant()
2717 _ => bug!("expect_variant_def used with unexpected def {:?}", def)
2721 /// Given a `VariantDef`, returns the def-id of the `AdtDef` of which it is a part.
2722 pub fn adt_def_id_of_variant(self, variant_def: &'tcx VariantDef) -> DefId {
2723 let def_key = self.def_key(variant_def.did);
2724 match def_key.disambiguated_data.data {
2725 // for enum variants and tuple structs, the def-id of the ADT itself
2726 // is the *parent* of the variant
2727 DefPathData::EnumVariant(..) | DefPathData::StructCtor =>
2728 DefId { krate: variant_def.did.krate, index: def_key.parent.unwrap() },
2730 // otherwise, for structs and unions, they share a def-id
2731 _ => variant_def.did,
2735 pub fn item_name(self, id: DefId) -> InternedString {
2736 if id.index == CRATE_DEF_INDEX {
2737 self.original_crate_name(id.krate).as_interned_str()
2739 let def_key = self.def_key(id);
2740 // The name of a StructCtor is that of its struct parent.
2741 if let hir_map::DefPathData::StructCtor = def_key.disambiguated_data.data {
2742 self.item_name(DefId {
2744 index: def_key.parent.unwrap()
2747 def_key.disambiguated_data.data.get_opt_name().unwrap_or_else(|| {
2748 bug!("item_name: no name for {:?}", self.def_path(id));
2754 /// Return the possibly-auto-generated MIR of a (DefId, Subst) pair.
2755 pub fn instance_mir(self, instance: ty::InstanceDef<'gcx>)
2759 ty::InstanceDef::Item(did) => {
2760 self.optimized_mir(did)
2762 ty::InstanceDef::Intrinsic(..) |
2763 ty::InstanceDef::FnPtrShim(..) |
2764 ty::InstanceDef::Virtual(..) |
2765 ty::InstanceDef::ClosureOnceShim { .. } |
2766 ty::InstanceDef::DropGlue(..) |
2767 ty::InstanceDef::CloneShim(..) => {
2768 self.mir_shims(instance)
2773 /// Given the DefId of an item, returns its MIR, borrowed immutably.
2774 /// Returns None if there is no MIR for the DefId
2775 pub fn maybe_optimized_mir(self, did: DefId) -> Option<&'gcx Mir<'gcx>> {
2776 if self.is_mir_available(did) {
2777 Some(self.optimized_mir(did))
2783 /// Get the attributes of a definition.
2784 pub fn get_attrs(self, did: DefId) -> Attributes<'gcx> {
2785 if let Some(id) = self.hir.as_local_node_id(did) {
2786 Attributes::Borrowed(self.hir.attrs(id))
2788 Attributes::Owned(self.item_attrs(did))
2792 /// Determine whether an item is annotated with an attribute
2793 pub fn has_attr(self, did: DefId, attr: &str) -> bool {
2794 attr::contains_name(&self.get_attrs(did), attr)
2797 /// Returns true if this is an `auto trait`.
2798 pub fn trait_is_auto(self, trait_def_id: DefId) -> bool {
2799 self.trait_def(trait_def_id).has_auto_impl
2802 pub fn generator_layout(self, def_id: DefId) -> &'tcx GeneratorLayout<'tcx> {
2803 self.optimized_mir(def_id).generator_layout.as_ref().unwrap()
2806 /// Given the def_id of an impl, return the def_id of the trait it implements.
2807 /// If it implements no trait, return `None`.
2808 pub fn trait_id_of_impl(self, def_id: DefId) -> Option<DefId> {
2809 self.impl_trait_ref(def_id).map(|tr| tr.def_id)
2812 /// If the given def ID describes a method belonging to an impl, return the
2813 /// ID of the impl that the method belongs to. Otherwise, return `None`.
2814 pub fn impl_of_method(self, def_id: DefId) -> Option<DefId> {
2815 let item = if def_id.krate != LOCAL_CRATE {
2816 if let Some(Def::Method(_)) = self.describe_def(def_id) {
2817 Some(self.associated_item(def_id))
2822 self.opt_associated_item(def_id)
2825 item.and_then(|trait_item|
2826 match trait_item.container {
2827 TraitContainer(_) => None,
2828 ImplContainer(def_id) => Some(def_id),
2833 /// Looks up the span of `impl_did` if the impl is local; otherwise returns `Err`
2834 /// with the name of the crate containing the impl.
2835 pub fn span_of_impl(self, impl_did: DefId) -> Result<Span, Symbol> {
2836 if impl_did.is_local() {
2837 let node_id = self.hir.as_local_node_id(impl_did).unwrap();
2838 Ok(self.hir.span(node_id))
2840 Err(self.crate_name(impl_did.krate))
2844 // Hygienically compare a use-site name (`use_name`) for a field or an associated item with its
2845 // supposed definition name (`def_name`). The method also needs `DefId` of the supposed
2846 // definition's parent/scope to perform comparison.
2847 pub fn hygienic_eq(self, use_name: Ident, def_name: Ident, def_parent_def_id: DefId) -> bool {
2848 self.adjust_ident(use_name, def_parent_def_id, DUMMY_NODE_ID).0 == def_name.modern()
2851 pub fn adjust_ident(self, mut ident: Ident, scope: DefId, block: NodeId) -> (Ident, DefId) {
2852 ident = ident.modern();
2853 let target_expansion = match scope.krate {
2854 LOCAL_CRATE => self.hir.definitions().expansion_that_defined(scope.index),
2857 let scope = match ident.span.adjust(target_expansion) {
2858 Some(actual_expansion) =>
2859 self.hir.definitions().parent_module_of_macro_def(actual_expansion),
2860 None if block == DUMMY_NODE_ID => DefId::local(CRATE_DEF_INDEX), // Dummy DefId
2861 None => self.hir.get_module_parent(block),
2867 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2868 pub fn with_freevars<T, F>(self, fid: NodeId, f: F) -> T where
2869 F: FnOnce(&[hir::Freevar]) -> T,
2871 let def_id = self.hir.local_def_id(fid);
2872 match self.freevars(def_id) {
2879 fn associated_item<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, def_id: DefId) -> AssociatedItem {
2880 let id = tcx.hir.as_local_node_id(def_id).unwrap();
2881 let parent_id = tcx.hir.get_parent(id);
2882 let parent_def_id = tcx.hir.local_def_id(parent_id);
2883 let parent_item = tcx.hir.expect_item(parent_id);
2884 match parent_item.node {
2885 hir::ItemKind::Impl(.., ref impl_item_refs) => {
2886 if let Some(impl_item_ref) = impl_item_refs.iter().find(|i| i.id.node_id == id) {
2887 let assoc_item = tcx.associated_item_from_impl_item_ref(parent_def_id,
2889 debug_assert_eq!(assoc_item.def_id, def_id);
2894 hir::ItemKind::Trait(.., ref trait_item_refs) => {
2895 if let Some(trait_item_ref) = trait_item_refs.iter().find(|i| i.id.node_id == id) {
2896 let assoc_item = tcx.associated_item_from_trait_item_ref(parent_def_id,
2899 debug_assert_eq!(assoc_item.def_id, def_id);
2907 span_bug!(parent_item.span,
2908 "unexpected parent of trait or impl item or item not found: {:?}",
2912 /// Calculates the Sized-constraint.
2914 /// In fact, there are only a few options for the types in the constraint:
2915 /// - an obviously-unsized type
2916 /// - a type parameter or projection whose Sizedness can't be known
2917 /// - a tuple of type parameters or projections, if there are multiple
2919 /// - a Error, if a type contained itself. The representability
2920 /// check should catch this case.
2921 fn adt_sized_constraint<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
2923 -> &'tcx [Ty<'tcx>] {
2924 let def = tcx.adt_def(def_id);
2926 let result = tcx.mk_type_list(def.variants.iter().flat_map(|v| {
2929 def.sized_constraint_for_ty(tcx, tcx.type_of(f.did))
2932 debug!("adt_sized_constraint: {:?} => {:?}", def, result);
2937 fn associated_item_def_ids<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
2939 -> Lrc<Vec<DefId>> {
2940 let id = tcx.hir.as_local_node_id(def_id).unwrap();
2941 let item = tcx.hir.expect_item(id);
2942 let vec: Vec<_> = match item.node {
2943 hir::ItemKind::Trait(.., ref trait_item_refs) => {
2944 trait_item_refs.iter()
2945 .map(|trait_item_ref| trait_item_ref.id)
2946 .map(|id| tcx.hir.local_def_id(id.node_id))
2949 hir::ItemKind::Impl(.., ref impl_item_refs) => {
2950 impl_item_refs.iter()
2951 .map(|impl_item_ref| impl_item_ref.id)
2952 .map(|id| tcx.hir.local_def_id(id.node_id))
2955 hir::ItemKind::TraitAlias(..) => vec![],
2956 _ => span_bug!(item.span, "associated_item_def_ids: not impl or trait")
2961 fn def_span<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, def_id: DefId) -> Span {
2962 tcx.hir.span_if_local(def_id).unwrap()
2965 /// If the given def ID describes an item belonging to a trait,
2966 /// return the ID of the trait that the trait item belongs to.
2967 /// Otherwise, return `None`.
2968 fn trait_of_item<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, def_id: DefId) -> Option<DefId> {
2969 tcx.opt_associated_item(def_id)
2970 .and_then(|associated_item| {
2971 match associated_item.container {
2972 TraitContainer(def_id) => Some(def_id),
2973 ImplContainer(_) => None
2978 /// Yields the parent function's `DefId` if `def_id` is an `impl Trait` definition
2979 pub fn is_impl_trait_defn(tcx: TyCtxt<'_, '_, '_>, def_id: DefId) -> Option<DefId> {
2980 if let Some(node_id) = tcx.hir.as_local_node_id(def_id) {
2981 if let Node::Item(item) = tcx.hir.get(node_id) {
2982 if let hir::ItemKind::Existential(ref exist_ty) = item.node {
2983 return exist_ty.impl_trait_fn;
2990 /// See `ParamEnv` struct def'n for details.
2991 fn param_env<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
2995 // The param_env of an impl Trait type is its defining function's param_env
2996 if let Some(parent) = is_impl_trait_defn(tcx, def_id) {
2997 return param_env(tcx, parent);
2999 // Compute the bounds on Self and the type parameters.
3001 let InstantiatedPredicates { predicates } =
3002 tcx.predicates_of(def_id).instantiate_identity(tcx);
3004 // Finally, we have to normalize the bounds in the environment, in
3005 // case they contain any associated type projections. This process
3006 // can yield errors if the put in illegal associated types, like
3007 // `<i32 as Foo>::Bar` where `i32` does not implement `Foo`. We
3008 // report these errors right here; this doesn't actually feel
3009 // right to me, because constructing the environment feels like a
3010 // kind of a "idempotent" action, but I'm not sure where would be
3011 // a better place. In practice, we construct environments for
3012 // every fn once during type checking, and we'll abort if there
3013 // are any errors at that point, so after type checking you can be
3014 // sure that this will succeed without errors anyway.
3016 let unnormalized_env = ty::ParamEnv::new(tcx.intern_predicates(&predicates),
3017 traits::Reveal::UserFacing);
3019 let body_id = tcx.hir.as_local_node_id(def_id).map_or(DUMMY_NODE_ID, |id| {
3020 tcx.hir.maybe_body_owned_by(id).map_or(id, |body| body.node_id)
3022 let cause = traits::ObligationCause::misc(tcx.def_span(def_id), body_id);
3023 traits::normalize_param_env_or_error(tcx, def_id, unnormalized_env, cause)
3026 fn crate_disambiguator<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3027 crate_num: CrateNum) -> CrateDisambiguator {
3028 assert_eq!(crate_num, LOCAL_CRATE);
3029 tcx.sess.local_crate_disambiguator()
3032 fn original_crate_name<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3033 crate_num: CrateNum) -> Symbol {
3034 assert_eq!(crate_num, LOCAL_CRATE);
3035 tcx.crate_name.clone()
3038 fn crate_hash<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3039 crate_num: CrateNum)
3041 assert_eq!(crate_num, LOCAL_CRATE);
3045 fn instance_def_size_estimate<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
3046 instance_def: InstanceDef<'tcx>)
3048 match instance_def {
3049 InstanceDef::Item(..) |
3050 InstanceDef::DropGlue(..) => {
3051 let mir = tcx.instance_mir(instance_def);
3052 mir.basic_blocks().iter().map(|bb| bb.statements.len()).sum()
3054 // Estimate the size of other compiler-generated shims to be 1.
3059 pub fn provide(providers: &mut ty::query::Providers<'_>) {
3060 context::provide(providers);
3061 erase_regions::provide(providers);
3062 layout::provide(providers);
3063 util::provide(providers);
3064 constness::provide(providers);
3065 *providers = ty::query::Providers {
3067 associated_item_def_ids,
3068 adt_sized_constraint,
3072 crate_disambiguator,
3073 original_crate_name,
3075 trait_impls_of: trait_def::trait_impls_of_provider,
3076 instance_def_size_estimate,
3081 /// A map for the local crate mapping each type to a vector of its
3082 /// inherent impls. This is not meant to be used outside of coherence;
3083 /// rather, you should request the vector for a specific type via
3084 /// `tcx.inherent_impls(def_id)` so as to minimize your dependencies
3085 /// (constructing this map requires touching the entire crate).
3086 #[derive(Clone, Debug)]
3087 pub struct CrateInherentImpls {
3088 pub inherent_impls: DefIdMap<Lrc<Vec<DefId>>>,
3091 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, RustcEncodable, RustcDecodable)]
3092 pub struct SymbolName {
3093 // FIXME: we don't rely on interning or equality here - better have
3094 // this be a `&'tcx str`.
3095 pub name: InternedString
3098 impl_stable_hash_for!(struct self::SymbolName {
3103 pub fn new(name: &str) -> SymbolName {
3105 name: Symbol::intern(name).as_interned_str()
3109 pub fn as_str(&self) -> LocalInternedString {
3114 impl fmt::Display for SymbolName {
3115 fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
3116 fmt::Display::fmt(&self.name, fmt)
3120 impl fmt::Debug for SymbolName {
3121 fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
3122 fmt::Display::fmt(&self.name, fmt)