1 //! This module contains `TyKind` and its major components.
3 #![allow(rustc::usage_of_ty_tykind)]
7 use crate::infer::canonical::Canonical;
8 use crate::ty::fold::ValidateBoundVars;
9 use crate::ty::subst::{GenericArg, InternalSubsts, Subst, SubstsRef};
10 use crate::ty::InferTy::{self, *};
11 use crate::ty::{self, AdtDef, DefIdTree, Discr, Term, Ty, TyCtxt, TypeFlags, TypeFoldable};
12 use crate::ty::{DelaySpanBugEmitted, List, ParamEnv, TyS};
13 use polonius_engine::Atom;
14 use rustc_data_structures::captures::Captures;
16 use rustc_hir::def_id::DefId;
17 use rustc_index::vec::Idx;
18 use rustc_macros::HashStable;
19 use rustc_span::symbol::{kw, Symbol};
20 use rustc_target::abi::VariantIdx;
21 use rustc_target::spec::abi;
23 use std::cmp::Ordering;
24 use std::marker::PhantomData;
26 use ty::util::IntTypeExt;
28 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)]
29 #[derive(HashStable, TypeFoldable, Lift)]
30 pub struct TypeAndMut<'tcx> {
32 pub mutbl: hir::Mutability,
35 #[derive(Clone, PartialEq, PartialOrd, Eq, Ord, Hash, TyEncodable, TyDecodable, Copy)]
37 /// A "free" region `fr` can be interpreted as "some region
38 /// at least as big as the scope `fr.scope`".
39 pub struct FreeRegion {
41 pub bound_region: BoundRegionKind,
44 #[derive(Clone, PartialEq, PartialOrd, Eq, Ord, Hash, TyEncodable, TyDecodable, Copy)]
46 pub enum BoundRegionKind {
47 /// An anonymous region parameter for a given fn (&T)
50 /// Named region parameters for functions (a in &'a T)
52 /// The `DefId` is needed to distinguish free regions in
53 /// the event of shadowing.
54 BrNamed(DefId, Symbol),
56 /// Anonymous region for the implicit env pointer parameter
61 #[derive(Copy, Clone, PartialEq, Eq, Hash, TyEncodable, TyDecodable, Debug, PartialOrd, Ord)]
63 pub struct BoundRegion {
65 pub kind: BoundRegionKind,
68 impl BoundRegionKind {
69 pub fn is_named(&self) -> bool {
71 BoundRegionKind::BrNamed(_, name) => name != kw::UnderscoreLifetime,
77 /// Defines the kinds of types.
79 /// N.B., if you change this, you'll probably want to change the corresponding
80 /// AST structure in `rustc_ast/src/ast.rs` as well.
81 #[derive(Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable, Debug)]
83 #[rustc_diagnostic_item = "TyKind"]
84 pub enum TyKind<'tcx> {
85 /// The primitive boolean type. Written as `bool`.
88 /// The primitive character type; holds a Unicode scalar value
89 /// (a non-surrogate code point). Written as `char`.
92 /// A primitive signed integer type. For example, `i32`.
95 /// A primitive unsigned integer type. For example, `u32`.
98 /// A primitive floating-point type. For example, `f64`.
101 /// Algebraic data types (ADT). For example: structures, enumerations and unions.
103 /// InternalSubsts here, possibly against intuition, *may* contain `Param`s.
104 /// That is, even after substitution it is possible that there are type
105 /// variables. This happens when the `Adt` corresponds to an ADT
106 /// definition and not a concrete use of it.
107 Adt(&'tcx AdtDef, SubstsRef<'tcx>),
109 /// An unsized FFI type that is opaque to Rust. Written as `extern type T`.
112 /// The pointee of a string slice. Written as `str`.
115 /// An array with the given length. Written as `[T; n]`.
116 Array(Ty<'tcx>, &'tcx ty::Const<'tcx>),
118 /// The pointee of an array slice. Written as `[T]`.
121 /// A raw pointer. Written as `*mut T` or `*const T`
122 RawPtr(TypeAndMut<'tcx>),
124 /// A reference; a pointer with an associated lifetime. Written as
125 /// `&'a mut T` or `&'a T`.
126 Ref(Region<'tcx>, Ty<'tcx>, hir::Mutability),
128 /// The anonymous type of a function declaration/definition. Each
129 /// function has a unique type, which is output (for a function
130 /// named `foo` returning an `i32`) as `fn() -> i32 {foo}`.
132 /// For example the type of `bar` here:
135 /// fn foo() -> i32 { 1 }
136 /// let bar = foo; // bar: fn() -> i32 {foo}
138 FnDef(DefId, SubstsRef<'tcx>),
140 /// A pointer to a function. Written as `fn() -> i32`.
142 /// For example the type of `bar` here:
145 /// fn foo() -> i32 { 1 }
146 /// let bar: fn() -> i32 = foo;
148 FnPtr(PolyFnSig<'tcx>),
150 /// A trait object. Written as `dyn for<'b> Trait<'b, Assoc = u32> + Send + 'a`.
151 Dynamic(&'tcx List<Binder<'tcx, ExistentialPredicate<'tcx>>>, ty::Region<'tcx>),
153 /// The anonymous type of a closure. Used to represent the type of
155 /// For the order of the substs see the `ClosureSubsts` type's documentation.
156 Closure(DefId, SubstsRef<'tcx>),
158 /// The anonymous type of a generator. Used to represent the type of
160 Generator(DefId, SubstsRef<'tcx>, hir::Movability),
162 /// A type representing the types stored inside a generator.
163 /// This should only appear in GeneratorInteriors.
164 GeneratorWitness(Binder<'tcx, &'tcx List<Ty<'tcx>>>),
166 /// The never type `!`.
169 /// A tuple type. For example, `(i32, bool)`.
170 /// Use `TyS::tuple_fields` to iterate over the field types.
171 Tuple(SubstsRef<'tcx>),
173 /// The projection of an associated type. For example,
174 /// `<T as Trait<..>>::N`.
175 Projection(ProjectionTy<'tcx>),
177 /// Opaque (`impl Trait`) type found in a return type.
178 /// The `DefId` comes either from
179 /// * the `impl Trait` ast::Ty node,
180 /// * or the `type Foo = impl Trait` declaration
181 /// The substitutions are for the generics of the function in question.
182 /// After typeck, the concrete type can be found in the `types` map.
183 Opaque(DefId, SubstsRef<'tcx>),
185 /// A type parameter; for example, `T` in `fn f<T>(x: T) {}`.
188 /// Bound type variable, used only when preparing a trait query.
189 Bound(ty::DebruijnIndex, BoundTy),
191 /// A placeholder type - universally quantified higher-ranked type.
192 Placeholder(ty::PlaceholderType),
194 /// A type variable used during type checking.
197 /// A placeholder for a type which could not be computed; this is
198 /// propagated to avoid useless error messages.
199 Error(DelaySpanBugEmitted),
202 impl<'tcx> TyKind<'tcx> {
204 pub fn is_primitive(&self) -> bool {
205 matches!(self, Bool | Char | Int(_) | Uint(_) | Float(_))
208 /// Get the article ("a" or "an") to use with this type.
209 pub fn article(&self) -> &'static str {
211 Int(_) | Float(_) | Array(_, _) => "an",
212 Adt(def, _) if def.is_enum() => "an",
213 // This should never happen, but ICEing and causing the user's code
214 // to not compile felt too harsh.
221 // `TyKind` is used a lot. Make sure it doesn't unintentionally get bigger.
222 #[cfg(all(target_arch = "x86_64", target_pointer_width = "64"))]
223 static_assert_size!(TyKind<'_>, 32);
225 /// A closure can be modeled as a struct that looks like:
227 /// struct Closure<'l0...'li, T0...Tj, CK, CS, U>(...U);
231 /// - 'l0...'li and T0...Tj are the generic parameters
232 /// in scope on the function that defined the closure,
233 /// - CK represents the *closure kind* (Fn vs FnMut vs FnOnce). This
234 /// is rather hackily encoded via a scalar type. See
235 /// `TyS::to_opt_closure_kind` for details.
236 /// - CS represents the *closure signature*, representing as a `fn()`
237 /// type. For example, `fn(u32, u32) -> u32` would mean that the closure
238 /// implements `CK<(u32, u32), Output = u32>`, where `CK` is the trait
240 /// - U is a type parameter representing the types of its upvars, tupled up
241 /// (borrowed, if appropriate; that is, if a U field represents a by-ref upvar,
242 /// and the up-var has the type `Foo`, then that field of U will be `&Foo`).
244 /// So, for example, given this function:
246 /// fn foo<'a, T>(data: &'a mut T) {
247 /// do(|| data.count += 1)
250 /// the type of the closure would be something like:
252 /// struct Closure<'a, T, U>(...U);
254 /// Note that the type of the upvar is not specified in the struct.
255 /// You may wonder how the impl would then be able to use the upvar,
256 /// if it doesn't know it's type? The answer is that the impl is
257 /// (conceptually) not fully generic over Closure but rather tied to
258 /// instances with the expected upvar types:
260 /// impl<'b, 'a, T> FnMut() for Closure<'a, T, (&'b mut &'a mut T,)> {
264 /// You can see that the *impl* fully specified the type of the upvar
265 /// and thus knows full well that `data` has type `&'b mut &'a mut T`.
266 /// (Here, I am assuming that `data` is mut-borrowed.)
268 /// Now, the last question you may ask is: Why include the upvar types
269 /// in an extra type parameter? The reason for this design is that the
270 /// upvar types can reference lifetimes that are internal to the
271 /// creating function. In my example above, for example, the lifetime
272 /// `'b` represents the scope of the closure itself; this is some
273 /// subset of `foo`, probably just the scope of the call to the to
274 /// `do()`. If we just had the lifetime/type parameters from the
275 /// enclosing function, we couldn't name this lifetime `'b`. Note that
276 /// there can also be lifetimes in the types of the upvars themselves,
277 /// if one of them happens to be a reference to something that the
278 /// creating fn owns.
280 /// OK, you say, so why not create a more minimal set of parameters
281 /// that just includes the extra lifetime parameters? The answer is
282 /// primarily that it would be hard --- we don't know at the time when
283 /// we create the closure type what the full types of the upvars are,
284 /// nor do we know which are borrowed and which are not. In this
285 /// design, we can just supply a fresh type parameter and figure that
288 /// All right, you say, but why include the type parameters from the
289 /// original function then? The answer is that codegen may need them
290 /// when monomorphizing, and they may not appear in the upvars. A
291 /// closure could capture no variables but still make use of some
292 /// in-scope type parameter with a bound (e.g., if our example above
293 /// had an extra `U: Default`, and the closure called `U::default()`).
295 /// There is another reason. This design (implicitly) prohibits
296 /// closures from capturing themselves (except via a trait
297 /// object). This simplifies closure inference considerably, since it
298 /// means that when we infer the kind of a closure or its upvars, we
299 /// don't have to handle cycles where the decisions we make for
300 /// closure C wind up influencing the decisions we ought to make for
301 /// closure C (which would then require fixed point iteration to
302 /// handle). Plus it fixes an ICE. :P
306 /// Generators are handled similarly in `GeneratorSubsts`. The set of
307 /// type parameters is similar, but `CK` and `CS` are replaced by the
308 /// following type parameters:
310 /// * `GS`: The generator's "resume type", which is the type of the
311 /// argument passed to `resume`, and the type of `yield` expressions
312 /// inside the generator.
313 /// * `GY`: The "yield type", which is the type of values passed to
314 /// `yield` inside the generator.
315 /// * `GR`: The "return type", which is the type of value returned upon
316 /// completion of the generator.
317 /// * `GW`: The "generator witness".
318 #[derive(Copy, Clone, Debug, TypeFoldable)]
319 pub struct ClosureSubsts<'tcx> {
320 /// Lifetime and type parameters from the enclosing function,
321 /// concatenated with a tuple containing the types of the upvars.
323 /// These are separated out because codegen wants to pass them around
324 /// when monomorphizing.
325 pub substs: SubstsRef<'tcx>,
328 /// Struct returned by `split()`.
329 pub struct ClosureSubstsParts<'tcx, T> {
330 pub parent_substs: &'tcx [GenericArg<'tcx>],
331 pub closure_kind_ty: T,
332 pub closure_sig_as_fn_ptr_ty: T,
333 pub tupled_upvars_ty: T,
336 impl<'tcx> ClosureSubsts<'tcx> {
337 /// Construct `ClosureSubsts` from `ClosureSubstsParts`, containing `Substs`
338 /// for the closure parent, alongside additional closure-specific components.
341 parts: ClosureSubstsParts<'tcx, Ty<'tcx>>,
342 ) -> ClosureSubsts<'tcx> {
344 substs: tcx.mk_substs(
345 parts.parent_substs.iter().copied().chain(
346 [parts.closure_kind_ty, parts.closure_sig_as_fn_ptr_ty, parts.tupled_upvars_ty]
348 .map(|&ty| ty.into()),
354 /// Divides the closure substs into their respective components.
355 /// The ordering assumed here must match that used by `ClosureSubsts::new` above.
356 fn split(self) -> ClosureSubstsParts<'tcx, GenericArg<'tcx>> {
357 match self.substs[..] {
359 ref parent_substs @ ..,
361 closure_sig_as_fn_ptr_ty,
363 ] => ClosureSubstsParts {
366 closure_sig_as_fn_ptr_ty,
369 _ => bug!("closure substs missing synthetics"),
373 /// Returns `true` only if enough of the synthetic types are known to
374 /// allow using all of the methods on `ClosureSubsts` without panicking.
376 /// Used primarily by `ty::print::pretty` to be able to handle closure
377 /// types that haven't had their synthetic types substituted in.
378 pub fn is_valid(self) -> bool {
379 self.substs.len() >= 3
380 && matches!(self.split().tupled_upvars_ty.expect_ty().kind(), Tuple(_))
383 /// Returns the substitutions of the closure's parent.
384 pub fn parent_substs(self) -> &'tcx [GenericArg<'tcx>] {
385 self.split().parent_substs
388 /// Returns an iterator over the list of types of captured paths by the closure.
389 /// In case there was a type error in figuring out the types of the captured path, an
390 /// empty iterator is returned.
392 pub fn upvar_tys(self) -> impl Iterator<Item = Ty<'tcx>> + 'tcx {
393 match self.tupled_upvars_ty().kind() {
394 TyKind::Error(_) => None,
395 TyKind::Tuple(..) => Some(self.tupled_upvars_ty().tuple_fields()),
396 TyKind::Infer(_) => bug!("upvar_tys called before capture types are inferred"),
397 ty => bug!("Unexpected representation of upvar types tuple {:?}", ty),
403 /// Returns the tuple type representing the upvars for this closure.
405 pub fn tupled_upvars_ty(self) -> Ty<'tcx> {
406 self.split().tupled_upvars_ty.expect_ty()
409 /// Returns the closure kind for this closure; may return a type
410 /// variable during inference. To get the closure kind during
411 /// inference, use `infcx.closure_kind(substs)`.
412 pub fn kind_ty(self) -> Ty<'tcx> {
413 self.split().closure_kind_ty.expect_ty()
416 /// Returns the `fn` pointer type representing the closure signature for this
418 // FIXME(eddyb) this should be unnecessary, as the shallowly resolved
419 // type is known at the time of the creation of `ClosureSubsts`,
420 // see `rustc_typeck::check::closure`.
421 pub fn sig_as_fn_ptr_ty(self) -> Ty<'tcx> {
422 self.split().closure_sig_as_fn_ptr_ty.expect_ty()
425 /// Returns the closure kind for this closure; only usable outside
426 /// of an inference context, because in that context we know that
427 /// there are no type variables.
429 /// If you have an inference context, use `infcx.closure_kind()`.
430 pub fn kind(self) -> ty::ClosureKind {
431 self.kind_ty().to_opt_closure_kind().unwrap()
434 /// Extracts the signature from the closure.
435 pub fn sig(self) -> ty::PolyFnSig<'tcx> {
436 let ty = self.sig_as_fn_ptr_ty();
438 ty::FnPtr(sig) => *sig,
439 _ => bug!("closure_sig_as_fn_ptr_ty is not a fn-ptr: {:?}", ty.kind()),
444 /// Similar to `ClosureSubsts`; see the above documentation for more.
445 #[derive(Copy, Clone, Debug, TypeFoldable)]
446 pub struct GeneratorSubsts<'tcx> {
447 pub substs: SubstsRef<'tcx>,
450 pub struct GeneratorSubstsParts<'tcx, T> {
451 pub parent_substs: &'tcx [GenericArg<'tcx>],
456 pub tupled_upvars_ty: T,
459 impl<'tcx> GeneratorSubsts<'tcx> {
460 /// Construct `GeneratorSubsts` from `GeneratorSubstsParts`, containing `Substs`
461 /// for the generator parent, alongside additional generator-specific components.
464 parts: GeneratorSubstsParts<'tcx, Ty<'tcx>>,
465 ) -> GeneratorSubsts<'tcx> {
467 substs: tcx.mk_substs(
468 parts.parent_substs.iter().copied().chain(
474 parts.tupled_upvars_ty,
477 .map(|&ty| ty.into()),
483 /// Divides the generator substs into their respective components.
484 /// The ordering assumed here must match that used by `GeneratorSubsts::new` above.
485 fn split(self) -> GeneratorSubstsParts<'tcx, GenericArg<'tcx>> {
486 match self.substs[..] {
487 [ref parent_substs @ .., resume_ty, yield_ty, return_ty, witness, tupled_upvars_ty] => {
488 GeneratorSubstsParts {
497 _ => bug!("generator substs missing synthetics"),
501 /// Returns `true` only if enough of the synthetic types are known to
502 /// allow using all of the methods on `GeneratorSubsts` without panicking.
504 /// Used primarily by `ty::print::pretty` to be able to handle generator
505 /// types that haven't had their synthetic types substituted in.
506 pub fn is_valid(self) -> bool {
507 self.substs.len() >= 5
508 && matches!(self.split().tupled_upvars_ty.expect_ty().kind(), Tuple(_))
511 /// Returns the substitutions of the generator's parent.
512 pub fn parent_substs(self) -> &'tcx [GenericArg<'tcx>] {
513 self.split().parent_substs
516 /// This describes the types that can be contained in a generator.
517 /// It will be a type variable initially and unified in the last stages of typeck of a body.
518 /// It contains a tuple of all the types that could end up on a generator frame.
519 /// The state transformation MIR pass may only produce layouts which mention types
520 /// in this tuple. Upvars are not counted here.
521 pub fn witness(self) -> Ty<'tcx> {
522 self.split().witness.expect_ty()
525 /// Returns an iterator over the list of types of captured paths by the generator.
526 /// In case there was a type error in figuring out the types of the captured path, an
527 /// empty iterator is returned.
529 pub fn upvar_tys(self) -> impl Iterator<Item = Ty<'tcx>> + 'tcx {
530 match self.tupled_upvars_ty().kind() {
531 TyKind::Error(_) => None,
532 TyKind::Tuple(..) => Some(self.tupled_upvars_ty().tuple_fields()),
533 TyKind::Infer(_) => bug!("upvar_tys called before capture types are inferred"),
534 ty => bug!("Unexpected representation of upvar types tuple {:?}", ty),
540 /// Returns the tuple type representing the upvars for this generator.
542 pub fn tupled_upvars_ty(self) -> Ty<'tcx> {
543 self.split().tupled_upvars_ty.expect_ty()
546 /// Returns the type representing the resume type of the generator.
547 pub fn resume_ty(self) -> Ty<'tcx> {
548 self.split().resume_ty.expect_ty()
551 /// Returns the type representing the yield type of the generator.
552 pub fn yield_ty(self) -> Ty<'tcx> {
553 self.split().yield_ty.expect_ty()
556 /// Returns the type representing the return type of the generator.
557 pub fn return_ty(self) -> Ty<'tcx> {
558 self.split().return_ty.expect_ty()
561 /// Returns the "generator signature", which consists of its yield
562 /// and return types.
564 /// N.B., some bits of the code prefers to see this wrapped in a
565 /// binder, but it never contains bound regions. Probably this
566 /// function should be removed.
567 pub fn poly_sig(self) -> PolyGenSig<'tcx> {
568 ty::Binder::dummy(self.sig())
571 /// Returns the "generator signature", which consists of its resume, yield
572 /// and return types.
573 pub fn sig(self) -> GenSig<'tcx> {
575 resume_ty: self.resume_ty(),
576 yield_ty: self.yield_ty(),
577 return_ty: self.return_ty(),
582 impl<'tcx> GeneratorSubsts<'tcx> {
583 /// Generator has not been resumed yet.
584 pub const UNRESUMED: usize = 0;
585 /// Generator has returned or is completed.
586 pub const RETURNED: usize = 1;
587 /// Generator has been poisoned.
588 pub const POISONED: usize = 2;
590 const UNRESUMED_NAME: &'static str = "Unresumed";
591 const RETURNED_NAME: &'static str = "Returned";
592 const POISONED_NAME: &'static str = "Panicked";
594 /// The valid variant indices of this generator.
596 pub fn variant_range(&self, def_id: DefId, tcx: TyCtxt<'tcx>) -> Range<VariantIdx> {
597 // FIXME requires optimized MIR
598 let num_variants = tcx.generator_layout(def_id).unwrap().variant_fields.len();
599 VariantIdx::new(0)..VariantIdx::new(num_variants)
602 /// The discriminant for the given variant. Panics if the `variant_index` is
605 pub fn discriminant_for_variant(
609 variant_index: VariantIdx,
611 // Generators don't support explicit discriminant values, so they are
612 // the same as the variant index.
613 assert!(self.variant_range(def_id, tcx).contains(&variant_index));
614 Discr { val: variant_index.as_usize() as u128, ty: self.discr_ty(tcx) }
617 /// The set of all discriminants for the generator, enumerated with their
620 pub fn discriminants(
624 ) -> impl Iterator<Item = (VariantIdx, Discr<'tcx>)> + Captures<'tcx> {
625 self.variant_range(def_id, tcx).map(move |index| {
626 (index, Discr { val: index.as_usize() as u128, ty: self.discr_ty(tcx) })
630 /// Calls `f` with a reference to the name of the enumerator for the given
632 pub fn variant_name(v: VariantIdx) -> Cow<'static, str> {
634 Self::UNRESUMED => Cow::from(Self::UNRESUMED_NAME),
635 Self::RETURNED => Cow::from(Self::RETURNED_NAME),
636 Self::POISONED => Cow::from(Self::POISONED_NAME),
637 _ => Cow::from(format!("Suspend{}", v.as_usize() - 3)),
641 /// The type of the state discriminant used in the generator type.
643 pub fn discr_ty(&self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> {
647 /// This returns the types of the MIR locals which had to be stored across suspension points.
648 /// It is calculated in rustc_const_eval::transform::generator::StateTransform.
649 /// All the types here must be in the tuple in GeneratorInterior.
651 /// The locals are grouped by their variant number. Note that some locals may
652 /// be repeated in multiple variants.
658 ) -> impl Iterator<Item = impl Iterator<Item = Ty<'tcx>> + Captures<'tcx>> {
659 let layout = tcx.generator_layout(def_id).unwrap();
660 layout.variant_fields.iter().map(move |variant| {
661 variant.iter().map(move |field| layout.field_tys[*field].subst(tcx, self.substs))
665 /// This is the types of the fields of a generator which are not stored in a
668 pub fn prefix_tys(self) -> impl Iterator<Item = Ty<'tcx>> {
673 #[derive(Debug, Copy, Clone, HashStable)]
674 pub enum UpvarSubsts<'tcx> {
675 Closure(SubstsRef<'tcx>),
676 Generator(SubstsRef<'tcx>),
679 impl<'tcx> UpvarSubsts<'tcx> {
680 /// Returns an iterator over the list of types of captured paths by the closure/generator.
681 /// In case there was a type error in figuring out the types of the captured path, an
682 /// empty iterator is returned.
684 pub fn upvar_tys(self) -> impl Iterator<Item = Ty<'tcx>> + 'tcx {
685 let tupled_tys = match self {
686 UpvarSubsts::Closure(substs) => substs.as_closure().tupled_upvars_ty(),
687 UpvarSubsts::Generator(substs) => substs.as_generator().tupled_upvars_ty(),
690 match tupled_tys.kind() {
691 TyKind::Error(_) => None,
692 TyKind::Tuple(..) => Some(self.tupled_upvars_ty().tuple_fields()),
693 TyKind::Infer(_) => bug!("upvar_tys called before capture types are inferred"),
694 ty => bug!("Unexpected representation of upvar types tuple {:?}", ty),
701 pub fn tupled_upvars_ty(self) -> Ty<'tcx> {
703 UpvarSubsts::Closure(substs) => substs.as_closure().tupled_upvars_ty(),
704 UpvarSubsts::Generator(substs) => substs.as_generator().tupled_upvars_ty(),
709 /// An inline const is modeled like
711 /// const InlineConst<'l0...'li, T0...Tj, R>: R;
715 /// - 'l0...'li and T0...Tj are the generic parameters
716 /// inherited from the item that defined the inline const,
717 /// - R represents the type of the constant.
719 /// When the inline const is instantiated, `R` is substituted as the actual inferred
720 /// type of the constant. The reason that `R` is represented as an extra type parameter
721 /// is the same reason that [`ClosureSubsts`] have `CS` and `U` as type parameters:
722 /// inline const can reference lifetimes that are internal to the creating function.
723 #[derive(Copy, Clone, Debug, TypeFoldable)]
724 pub struct InlineConstSubsts<'tcx> {
725 /// Generic parameters from the enclosing item,
726 /// concatenated with the inferred type of the constant.
727 pub substs: SubstsRef<'tcx>,
730 /// Struct returned by `split()`.
731 pub struct InlineConstSubstsParts<'tcx, T> {
732 pub parent_substs: &'tcx [GenericArg<'tcx>],
736 impl<'tcx> InlineConstSubsts<'tcx> {
737 /// Construct `InlineConstSubsts` from `InlineConstSubstsParts`.
740 parts: InlineConstSubstsParts<'tcx, Ty<'tcx>>,
741 ) -> InlineConstSubsts<'tcx> {
743 substs: tcx.mk_substs(
744 parts.parent_substs.iter().copied().chain(std::iter::once(parts.ty.into())),
749 /// Divides the inline const substs into their respective components.
750 /// The ordering assumed here must match that used by `InlineConstSubsts::new` above.
751 fn split(self) -> InlineConstSubstsParts<'tcx, GenericArg<'tcx>> {
752 match self.substs[..] {
753 [ref parent_substs @ .., ty] => InlineConstSubstsParts { parent_substs, ty },
754 _ => bug!("inline const substs missing synthetics"),
758 /// Returns the substitutions of the inline const's parent.
759 pub fn parent_substs(self) -> &'tcx [GenericArg<'tcx>] {
760 self.split().parent_substs
763 /// Returns the type of this inline const.
764 pub fn ty(self) -> Ty<'tcx> {
765 self.split().ty.expect_ty()
769 #[derive(Debug, Copy, Clone, PartialEq, PartialOrd, Ord, Eq, Hash, TyEncodable, TyDecodable)]
770 #[derive(HashStable, TypeFoldable)]
771 pub enum ExistentialPredicate<'tcx> {
772 /// E.g., `Iterator`.
773 Trait(ExistentialTraitRef<'tcx>),
774 /// E.g., `Iterator::Item = T`.
775 Projection(ExistentialProjection<'tcx>),
780 impl<'tcx> ExistentialPredicate<'tcx> {
781 /// Compares via an ordering that will not change if modules are reordered or other changes are
782 /// made to the tree. In particular, this ordering is preserved across incremental compilations.
783 pub fn stable_cmp(&self, tcx: TyCtxt<'tcx>, other: &Self) -> Ordering {
784 use self::ExistentialPredicate::*;
785 match (*self, *other) {
786 (Trait(_), Trait(_)) => Ordering::Equal,
787 (Projection(ref a), Projection(ref b)) => {
788 tcx.def_path_hash(a.item_def_id).cmp(&tcx.def_path_hash(b.item_def_id))
790 (AutoTrait(ref a), AutoTrait(ref b)) => {
791 tcx.def_path_hash(*a).cmp(&tcx.def_path_hash(*b))
793 (Trait(_), _) => Ordering::Less,
794 (Projection(_), Trait(_)) => Ordering::Greater,
795 (Projection(_), _) => Ordering::Less,
796 (AutoTrait(_), _) => Ordering::Greater,
801 impl<'tcx> Binder<'tcx, ExistentialPredicate<'tcx>> {
802 pub fn with_self_ty(&self, tcx: TyCtxt<'tcx>, self_ty: Ty<'tcx>) -> ty::Predicate<'tcx> {
803 use crate::ty::ToPredicate;
804 match self.skip_binder() {
805 ExistentialPredicate::Trait(tr) => {
806 self.rebind(tr).with_self_ty(tcx, self_ty).without_const().to_predicate(tcx)
808 ExistentialPredicate::Projection(p) => {
809 self.rebind(p.with_self_ty(tcx, self_ty)).to_predicate(tcx)
811 ExistentialPredicate::AutoTrait(did) => {
812 let trait_ref = self.rebind(ty::TraitRef {
814 substs: tcx.mk_substs_trait(self_ty, &[]),
816 trait_ref.without_const().to_predicate(tcx)
822 impl<'tcx> List<ty::Binder<'tcx, ExistentialPredicate<'tcx>>> {
823 /// Returns the "principal `DefId`" of this set of existential predicates.
825 /// A Rust trait object type consists (in addition to a lifetime bound)
826 /// of a set of trait bounds, which are separated into any number
827 /// of auto-trait bounds, and at most one non-auto-trait bound. The
828 /// non-auto-trait bound is called the "principal" of the trait
831 /// Only the principal can have methods or type parameters (because
832 /// auto traits can have neither of them). This is important, because
833 /// it means the auto traits can be treated as an unordered set (methods
834 /// would force an order for the vtable, while relating traits with
835 /// type parameters without knowing the order to relate them in is
836 /// a rather non-trivial task).
838 /// For example, in the trait object `dyn fmt::Debug + Sync`, the
839 /// principal bound is `Some(fmt::Debug)`, while the auto-trait bounds
840 /// are the set `{Sync}`.
842 /// It is also possible to have a "trivial" trait object that
843 /// consists only of auto traits, with no principal - for example,
844 /// `dyn Send + Sync`. In that case, the set of auto-trait bounds
845 /// is `{Send, Sync}`, while there is no principal. These trait objects
846 /// have a "trivial" vtable consisting of just the size, alignment,
848 pub fn principal(&self) -> Option<ty::Binder<'tcx, ExistentialTraitRef<'tcx>>> {
850 .map_bound(|this| match this {
851 ExistentialPredicate::Trait(tr) => Some(tr),
857 pub fn principal_def_id(&self) -> Option<DefId> {
858 self.principal().map(|trait_ref| trait_ref.skip_binder().def_id)
862 pub fn projection_bounds<'a>(
864 ) -> impl Iterator<Item = ty::Binder<'tcx, ExistentialProjection<'tcx>>> + 'a {
865 self.iter().filter_map(|predicate| {
867 .map_bound(|pred| match pred {
868 ExistentialPredicate::Projection(projection) => Some(projection),
876 pub fn auto_traits<'a>(&'a self) -> impl Iterator<Item = DefId> + 'a {
877 self.iter().filter_map(|predicate| match predicate.skip_binder() {
878 ExistentialPredicate::AutoTrait(did) => Some(did),
884 /// A complete reference to a trait. These take numerous guises in syntax,
885 /// but perhaps the most recognizable form is in a where-clause:
889 /// This would be represented by a trait-reference where the `DefId` is the
890 /// `DefId` for the trait `Foo` and the substs define `T` as parameter 0,
891 /// and `U` as parameter 1.
893 /// Trait references also appear in object types like `Foo<U>`, but in
894 /// that case the `Self` parameter is absent from the substitutions.
895 #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)]
896 #[derive(HashStable, TypeFoldable)]
897 pub struct TraitRef<'tcx> {
899 pub substs: SubstsRef<'tcx>,
902 impl<'tcx> TraitRef<'tcx> {
903 pub fn new(def_id: DefId, substs: SubstsRef<'tcx>) -> TraitRef<'tcx> {
904 TraitRef { def_id, substs }
907 /// Returns a `TraitRef` of the form `P0: Foo<P1..Pn>` where `Pi`
908 /// are the parameters defined on trait.
909 pub fn identity(tcx: TyCtxt<'tcx>, def_id: DefId) -> Binder<'tcx, TraitRef<'tcx>> {
910 ty::Binder::dummy(TraitRef {
912 substs: InternalSubsts::identity_for_item(tcx, def_id),
917 pub fn self_ty(&self) -> Ty<'tcx> {
918 self.substs.type_at(0)
924 substs: SubstsRef<'tcx>,
925 ) -> ty::TraitRef<'tcx> {
926 let defs = tcx.generics_of(trait_id);
928 ty::TraitRef { def_id: trait_id, substs: tcx.intern_substs(&substs[..defs.params.len()]) }
932 pub type PolyTraitRef<'tcx> = Binder<'tcx, TraitRef<'tcx>>;
934 impl<'tcx> PolyTraitRef<'tcx> {
935 pub fn self_ty(&self) -> Binder<'tcx, Ty<'tcx>> {
936 self.map_bound_ref(|tr| tr.self_ty())
939 pub fn def_id(&self) -> DefId {
940 self.skip_binder().def_id
943 pub fn to_poly_trait_predicate(&self) -> ty::PolyTraitPredicate<'tcx> {
944 self.map_bound(|trait_ref| ty::TraitPredicate {
946 constness: ty::BoundConstness::NotConst,
947 polarity: ty::ImplPolarity::Positive,
952 /// An existential reference to a trait, where `Self` is erased.
953 /// For example, the trait object `Trait<'a, 'b, X, Y>` is:
955 /// exists T. T: Trait<'a, 'b, X, Y>
957 /// The substitutions don't include the erased `Self`, only trait
958 /// type and lifetime parameters (`[X, Y]` and `['a, 'b]` above).
959 #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)]
960 #[derive(HashStable, TypeFoldable)]
961 pub struct ExistentialTraitRef<'tcx> {
963 pub substs: SubstsRef<'tcx>,
966 impl<'tcx> ExistentialTraitRef<'tcx> {
967 pub fn erase_self_ty(
969 trait_ref: ty::TraitRef<'tcx>,
970 ) -> ty::ExistentialTraitRef<'tcx> {
971 // Assert there is a Self.
972 trait_ref.substs.type_at(0);
974 ty::ExistentialTraitRef {
975 def_id: trait_ref.def_id,
976 substs: tcx.intern_substs(&trait_ref.substs[1..]),
980 /// Object types don't have a self type specified. Therefore, when
981 /// we convert the principal trait-ref into a normal trait-ref,
982 /// you must give *some* self type. A common choice is `mk_err()`
983 /// or some placeholder type.
984 pub fn with_self_ty(&self, tcx: TyCtxt<'tcx>, self_ty: Ty<'tcx>) -> ty::TraitRef<'tcx> {
985 // otherwise the escaping vars would be captured by the binder
986 // debug_assert!(!self_ty.has_escaping_bound_vars());
988 ty::TraitRef { def_id: self.def_id, substs: tcx.mk_substs_trait(self_ty, self.substs) }
992 pub type PolyExistentialTraitRef<'tcx> = Binder<'tcx, ExistentialTraitRef<'tcx>>;
994 impl<'tcx> PolyExistentialTraitRef<'tcx> {
995 pub fn def_id(&self) -> DefId {
996 self.skip_binder().def_id
999 /// Object types don't have a self type specified. Therefore, when
1000 /// we convert the principal trait-ref into a normal trait-ref,
1001 /// you must give *some* self type. A common choice is `mk_err()`
1002 /// or some placeholder type.
1003 pub fn with_self_ty(&self, tcx: TyCtxt<'tcx>, self_ty: Ty<'tcx>) -> ty::PolyTraitRef<'tcx> {
1004 self.map_bound(|trait_ref| trait_ref.with_self_ty(tcx, self_ty))
1008 #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)]
1009 #[derive(HashStable)]
1010 pub enum BoundVariableKind {
1012 Region(BoundRegionKind),
1016 /// Binder is a binder for higher-ranked lifetimes or types. It is part of the
1017 /// compiler's representation for things like `for<'a> Fn(&'a isize)`
1018 /// (which would be represented by the type `PolyTraitRef ==
1019 /// Binder<'tcx, TraitRef>`). Note that when we instantiate,
1020 /// erase, or otherwise "discharge" these bound vars, we change the
1021 /// type from `Binder<'tcx, T>` to just `T` (see
1022 /// e.g., `liberate_late_bound_regions`).
1024 /// `Decodable` and `Encodable` are implemented for `Binder<T>` using the `impl_binder_encode_decode!` macro.
1025 #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]
1026 pub struct Binder<'tcx, T>(T, &'tcx List<BoundVariableKind>);
1028 impl<'tcx, T> Binder<'tcx, T>
1030 T: TypeFoldable<'tcx>,
1032 /// Wraps `value` in a binder, asserting that `value` does not
1033 /// contain any bound vars that would be bound by the
1034 /// binder. This is commonly used to 'inject' a value T into a
1035 /// different binding level.
1036 pub fn dummy(value: T) -> Binder<'tcx, T> {
1037 assert!(!value.has_escaping_bound_vars());
1038 Binder(value, ty::List::empty())
1041 pub fn bind_with_vars(value: T, vars: &'tcx List<BoundVariableKind>) -> Binder<'tcx, T> {
1042 if cfg!(debug_assertions) {
1043 let mut validator = ValidateBoundVars::new(vars);
1044 value.visit_with(&mut validator);
1050 impl<'tcx, T> Binder<'tcx, T> {
1051 /// Skips the binder and returns the "bound" value. This is a
1052 /// risky thing to do because it's easy to get confused about
1053 /// De Bruijn indices and the like. It is usually better to
1054 /// discharge the binder using `no_bound_vars` or
1055 /// `replace_late_bound_regions` or something like
1056 /// that. `skip_binder` is only valid when you are either
1057 /// extracting data that has nothing to do with bound vars, you
1058 /// are doing some sort of test that does not involve bound
1059 /// regions, or you are being very careful about your depth
1062 /// Some examples where `skip_binder` is reasonable:
1064 /// - extracting the `DefId` from a PolyTraitRef;
1065 /// - comparing the self type of a PolyTraitRef to see if it is equal to
1066 /// a type parameter `X`, since the type `X` does not reference any regions
1067 pub fn skip_binder(self) -> T {
1071 pub fn bound_vars(&self) -> &'tcx List<BoundVariableKind> {
1075 pub fn as_ref(&self) -> Binder<'tcx, &T> {
1076 Binder(&self.0, self.1)
1079 pub fn map_bound_ref_unchecked<F, U>(&self, f: F) -> Binder<'tcx, U>
1083 let value = f(&self.0);
1084 Binder(value, self.1)
1087 pub fn map_bound_ref<F, U: TypeFoldable<'tcx>>(&self, f: F) -> Binder<'tcx, U>
1091 self.as_ref().map_bound(f)
1094 pub fn map_bound<F, U: TypeFoldable<'tcx>>(self, f: F) -> Binder<'tcx, U>
1098 let value = f(self.0);
1099 if cfg!(debug_assertions) {
1100 let mut validator = ValidateBoundVars::new(self.1);
1101 value.visit_with(&mut validator);
1103 Binder(value, self.1)
1106 pub fn try_map_bound<F, U: TypeFoldable<'tcx>, E>(self, f: F) -> Result<Binder<'tcx, U>, E>
1108 F: FnOnce(T) -> Result<U, E>,
1110 let value = f(self.0)?;
1111 if cfg!(debug_assertions) {
1112 let mut validator = ValidateBoundVars::new(self.1);
1113 value.visit_with(&mut validator);
1115 Ok(Binder(value, self.1))
1118 /// Wraps a `value` in a binder, using the same bound variables as the
1119 /// current `Binder`. This should not be used if the new value *changes*
1120 /// the bound variables. Note: the (old or new) value itself does not
1121 /// necessarily need to *name* all the bound variables.
1123 /// This currently doesn't do anything different than `bind`, because we
1124 /// don't actually track bound vars. However, semantically, it is different
1125 /// because bound vars aren't allowed to change here, whereas they are
1126 /// in `bind`. This may be (debug) asserted in the future.
1127 pub fn rebind<U>(&self, value: U) -> Binder<'tcx, U>
1129 U: TypeFoldable<'tcx>,
1131 if cfg!(debug_assertions) {
1132 let mut validator = ValidateBoundVars::new(self.bound_vars());
1133 value.visit_with(&mut validator);
1135 Binder(value, self.1)
1138 /// Unwraps and returns the value within, but only if it contains
1139 /// no bound vars at all. (In other words, if this binder --
1140 /// and indeed any enclosing binder -- doesn't bind anything at
1141 /// all.) Otherwise, returns `None`.
1143 /// (One could imagine having a method that just unwraps a single
1144 /// binder, but permits late-bound vars bound by enclosing
1145 /// binders, but that would require adjusting the debruijn
1146 /// indices, and given the shallow binding structure we often use,
1147 /// would not be that useful.)
1148 pub fn no_bound_vars(self) -> Option<T>
1150 T: TypeFoldable<'tcx>,
1152 if self.0.has_escaping_bound_vars() { None } else { Some(self.skip_binder()) }
1155 /// Splits the contents into two things that share the same binder
1156 /// level as the original, returning two distinct binders.
1158 /// `f` should consider bound regions at depth 1 to be free, and
1159 /// anything it produces with bound regions at depth 1 will be
1160 /// bound in the resulting return values.
1161 pub fn split<U, V, F>(self, f: F) -> (Binder<'tcx, U>, Binder<'tcx, V>)
1163 F: FnOnce(T) -> (U, V),
1165 let (u, v) = f(self.0);
1166 (Binder(u, self.1), Binder(v, self.1))
1170 impl<'tcx, T> Binder<'tcx, Option<T>> {
1171 pub fn transpose(self) -> Option<Binder<'tcx, T>> {
1172 let bound_vars = self.1;
1173 self.0.map(|v| Binder(v, bound_vars))
1177 /// Represents the projection of an associated type. In explicit UFCS
1178 /// form this would be written `<T as Trait<..>>::N`.
1179 #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)]
1180 #[derive(HashStable, TypeFoldable)]
1181 pub struct ProjectionTy<'tcx> {
1182 /// The parameters of the associated item.
1183 pub substs: SubstsRef<'tcx>,
1185 /// The `DefId` of the `TraitItem` for the associated type `N`.
1187 /// Note that this is not the `DefId` of the `TraitRef` containing this
1188 /// associated type, which is in `tcx.associated_item(item_def_id).container`.
1189 pub item_def_id: DefId,
1192 impl<'tcx> ProjectionTy<'tcx> {
1193 pub fn trait_def_id(&self, tcx: TyCtxt<'tcx>) -> DefId {
1194 tcx.associated_item(self.item_def_id).container.id()
1197 /// Extracts the underlying trait reference and own substs from this projection.
1198 /// For example, if this is a projection of `<T as StreamingIterator>::Item<'a>`,
1199 /// then this function would return a `T: Iterator` trait reference and `['a]` as the own substs
1200 pub fn trait_ref_and_own_substs(
1203 ) -> (ty::TraitRef<'tcx>, &'tcx [ty::GenericArg<'tcx>]) {
1204 let def_id = tcx.associated_item(self.item_def_id).container.id();
1205 let trait_generics = tcx.generics_of(def_id);
1207 ty::TraitRef { def_id, substs: self.substs.truncate_to(tcx, trait_generics) },
1208 &self.substs[trait_generics.count()..],
1212 /// Extracts the underlying trait reference from this projection.
1213 /// For example, if this is a projection of `<T as Iterator>::Item`,
1214 /// then this function would return a `T: Iterator` trait reference.
1216 /// WARNING: This will drop the substs for generic associated types
1217 /// consider calling [Self::trait_ref_and_own_substs] to get those
1219 pub fn trait_ref(&self, tcx: TyCtxt<'tcx>) -> ty::TraitRef<'tcx> {
1220 let def_id = self.trait_def_id(tcx);
1221 ty::TraitRef { def_id, substs: self.substs.truncate_to(tcx, tcx.generics_of(def_id)) }
1224 pub fn self_ty(&self) -> Ty<'tcx> {
1225 self.substs.type_at(0)
1229 #[derive(Copy, Clone, Debug, TypeFoldable)]
1230 pub struct GenSig<'tcx> {
1231 pub resume_ty: Ty<'tcx>,
1232 pub yield_ty: Ty<'tcx>,
1233 pub return_ty: Ty<'tcx>,
1236 pub type PolyGenSig<'tcx> = Binder<'tcx, GenSig<'tcx>>;
1238 /// Signature of a function type, which we have arbitrarily
1239 /// decided to use to refer to the input/output types.
1241 /// - `inputs`: is the list of arguments and their modes.
1242 /// - `output`: is the return type.
1243 /// - `c_variadic`: indicates whether this is a C-variadic function.
1244 #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)]
1245 #[derive(HashStable, TypeFoldable)]
1246 pub struct FnSig<'tcx> {
1247 pub inputs_and_output: &'tcx List<Ty<'tcx>>,
1248 pub c_variadic: bool,
1249 pub unsafety: hir::Unsafety,
1253 impl<'tcx> FnSig<'tcx> {
1254 pub fn inputs(&self) -> &'tcx [Ty<'tcx>] {
1255 &self.inputs_and_output[..self.inputs_and_output.len() - 1]
1258 pub fn output(&self) -> Ty<'tcx> {
1259 self.inputs_and_output[self.inputs_and_output.len() - 1]
1262 // Creates a minimal `FnSig` to be used when encountering a `TyKind::Error` in a fallible
1264 fn fake() -> FnSig<'tcx> {
1266 inputs_and_output: List::empty(),
1268 unsafety: hir::Unsafety::Normal,
1269 abi: abi::Abi::Rust,
1274 pub type PolyFnSig<'tcx> = Binder<'tcx, FnSig<'tcx>>;
1276 impl<'tcx> PolyFnSig<'tcx> {
1278 pub fn inputs(&self) -> Binder<'tcx, &'tcx [Ty<'tcx>]> {
1279 self.map_bound_ref_unchecked(|fn_sig| fn_sig.inputs())
1282 pub fn input(&self, index: usize) -> ty::Binder<'tcx, Ty<'tcx>> {
1283 self.map_bound_ref(|fn_sig| fn_sig.inputs()[index])
1285 pub fn inputs_and_output(&self) -> ty::Binder<'tcx, &'tcx List<Ty<'tcx>>> {
1286 self.map_bound_ref(|fn_sig| fn_sig.inputs_and_output)
1289 pub fn output(&self) -> ty::Binder<'tcx, Ty<'tcx>> {
1290 self.map_bound_ref(|fn_sig| fn_sig.output())
1292 pub fn c_variadic(&self) -> bool {
1293 self.skip_binder().c_variadic
1295 pub fn unsafety(&self) -> hir::Unsafety {
1296 self.skip_binder().unsafety
1298 pub fn abi(&self) -> abi::Abi {
1299 self.skip_binder().abi
1303 pub type CanonicalPolyFnSig<'tcx> = Canonical<'tcx, Binder<'tcx, FnSig<'tcx>>>;
1305 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)]
1306 #[derive(HashStable)]
1307 pub struct ParamTy {
1312 impl<'tcx> ParamTy {
1313 pub fn new(index: u32, name: Symbol) -> ParamTy {
1314 ParamTy { index, name }
1317 pub fn for_def(def: &ty::GenericParamDef) -> ParamTy {
1318 ParamTy::new(def.index, def.name)
1322 pub fn to_ty(self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> {
1323 tcx.mk_ty_param(self.index, self.name)
1327 #[derive(Copy, Clone, Hash, TyEncodable, TyDecodable, Eq, PartialEq, Ord, PartialOrd)]
1328 #[derive(HashStable)]
1329 pub struct ParamConst {
1335 pub fn new(index: u32, name: Symbol) -> ParamConst {
1336 ParamConst { index, name }
1339 pub fn for_def(def: &ty::GenericParamDef) -> ParamConst {
1340 ParamConst::new(def.index, def.name)
1344 pub type Region<'tcx> = &'tcx RegionKind;
1346 /// Representation of regions. Note that the NLL checker uses a distinct
1347 /// representation of regions. For this reason, it internally replaces all the
1348 /// regions with inference variables -- the index of the variable is then used
1349 /// to index into internal NLL data structures. See `rustc_const_eval::borrow_check`
1350 /// module for more information.
1352 /// ## The Region lattice within a given function
1354 /// In general, the region lattice looks like
1357 /// static ----------+-----...------+ (greatest)
1359 /// early-bound and | |
1360 /// free regions | |
1363 /// empty(root) placeholder(U1) |
1365 /// | / placeholder(Un)
1370 /// empty(Un) -------- (smallest)
1373 /// Early-bound/free regions are the named lifetimes in scope from the
1374 /// function declaration. They have relationships to one another
1375 /// determined based on the declared relationships from the
1378 /// Note that inference variables and bound regions are not included
1379 /// in this diagram. In the case of inference variables, they should
1380 /// be inferred to some other region from the diagram. In the case of
1381 /// bound regions, they are excluded because they don't make sense to
1382 /// include -- the diagram indicates the relationship between free
1385 /// ## Inference variables
1387 /// During region inference, we sometimes create inference variables,
1388 /// represented as `ReVar`. These will be inferred by the code in
1389 /// `infer::lexical_region_resolve` to some free region from the
1390 /// lattice above (the minimal region that meets the
1393 /// During NLL checking, where regions are defined differently, we
1394 /// also use `ReVar` -- in that case, the index is used to index into
1395 /// the NLL region checker's data structures. The variable may in fact
1396 /// represent either a free region or an inference variable, in that
1399 /// ## Bound Regions
1401 /// These are regions that are stored behind a binder and must be substituted
1402 /// with some concrete region before being used. There are two kind of
1403 /// bound regions: early-bound, which are bound in an item's `Generics`,
1404 /// and are substituted by an `InternalSubsts`, and late-bound, which are part of
1405 /// higher-ranked types (e.g., `for<'a> fn(&'a ())`), and are substituted by
1406 /// the likes of `liberate_late_bound_regions`. The distinction exists
1407 /// because higher-ranked lifetimes aren't supported in all places. See [1][2].
1409 /// Unlike `Param`s, bound regions are not supposed to exist "in the wild"
1410 /// outside their binder, e.g., in types passed to type inference, and
1411 /// should first be substituted (by placeholder regions, free regions,
1412 /// or region variables).
1414 /// ## Placeholder and Free Regions
1416 /// One often wants to work with bound regions without knowing their precise
1417 /// identity. For example, when checking a function, the lifetime of a borrow
1418 /// can end up being assigned to some region parameter. In these cases,
1419 /// it must be ensured that bounds on the region can't be accidentally
1420 /// assumed without being checked.
1422 /// To do this, we replace the bound regions with placeholder markers,
1423 /// which don't satisfy any relation not explicitly provided.
1425 /// There are two kinds of placeholder regions in rustc: `ReFree` and
1426 /// `RePlaceholder`. When checking an item's body, `ReFree` is supposed
1427 /// to be used. These also support explicit bounds: both the internally-stored
1428 /// *scope*, which the region is assumed to outlive, as well as other
1429 /// relations stored in the `FreeRegionMap`. Note that these relations
1430 /// aren't checked when you `make_subregion` (or `eq_types`), only by
1431 /// `resolve_regions_and_report_errors`.
1433 /// When working with higher-ranked types, some region relations aren't
1434 /// yet known, so you can't just call `resolve_regions_and_report_errors`.
1435 /// `RePlaceholder` is designed for this purpose. In these contexts,
1436 /// there's also the risk that some inference variable laying around will
1437 /// get unified with your placeholder region: if you want to check whether
1438 /// `for<'a> Foo<'_>: 'a`, and you substitute your bound region `'a`
1439 /// with a placeholder region `'%a`, the variable `'_` would just be
1440 /// instantiated to the placeholder region `'%a`, which is wrong because
1441 /// the inference variable is supposed to satisfy the relation
1442 /// *for every value of the placeholder region*. To ensure that doesn't
1443 /// happen, you can use `leak_check`. This is more clearly explained
1444 /// by the [rustc dev guide].
1446 /// [1]: https://smallcultfollowing.com/babysteps/blog/2013/10/29/intermingled-parameter-lists/
1447 /// [2]: https://smallcultfollowing.com/babysteps/blog/2013/11/04/intermingled-parameter-lists/
1448 /// [rustc dev guide]: https://rustc-dev-guide.rust-lang.org/traits/hrtb.html
1449 #[derive(Clone, PartialEq, Eq, Hash, Copy, TyEncodable, TyDecodable, PartialOrd, Ord)]
1450 pub enum RegionKind {
1451 /// Region bound in a type or fn declaration which will be
1452 /// substituted 'early' -- that is, at the same time when type
1453 /// parameters are substituted.
1454 ReEarlyBound(EarlyBoundRegion),
1456 /// Region bound in a function scope, which will be substituted when the
1457 /// function is called.
1458 ReLateBound(ty::DebruijnIndex, BoundRegion),
1460 /// When checking a function body, the types of all arguments and so forth
1461 /// that refer to bound region parameters are modified to refer to free
1462 /// region parameters.
1465 /// Static data that has an "infinite" lifetime. Top in the region lattice.
1468 /// A region variable. Should not exist outside of type inference.
1471 /// A placeholder region -- basically, the higher-ranked version of `ReFree`.
1472 /// Should not exist outside of type inference.
1473 RePlaceholder(ty::PlaceholderRegion),
1475 /// Empty lifetime is for data that is never accessed. We tag the
1476 /// empty lifetime with a universe -- the idea is that we don't
1477 /// want `exists<'a> { forall<'b> { 'b: 'a } }` to be satisfiable.
1478 /// Therefore, the `'empty` in a universe `U` is less than all
1479 /// regions visible from `U`, but not less than regions not visible
1481 ReEmpty(ty::UniverseIndex),
1483 /// Erased region, used by trait selection, in MIR and during codegen.
1487 #[derive(Copy, Clone, PartialEq, Eq, Hash, TyEncodable, TyDecodable, Debug, PartialOrd, Ord)]
1488 pub struct EarlyBoundRegion {
1494 /// A **`const`** **v**ariable **ID**.
1495 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, TyEncodable, TyDecodable)]
1496 pub struct ConstVid<'tcx> {
1498 pub phantom: PhantomData<&'tcx ()>,
1501 rustc_index::newtype_index! {
1502 /// A **region** (lifetime) **v**ariable **ID**.
1503 pub struct RegionVid {
1504 DEBUG_FORMAT = custom,
1508 impl Atom for RegionVid {
1509 fn index(self) -> usize {
1514 rustc_index::newtype_index! {
1515 pub struct BoundVar { .. }
1518 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)]
1519 #[derive(HashStable)]
1520 pub struct BoundTy {
1522 pub kind: BoundTyKind,
1525 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)]
1526 #[derive(HashStable)]
1527 pub enum BoundTyKind {
1532 impl From<BoundVar> for BoundTy {
1533 fn from(var: BoundVar) -> Self {
1534 BoundTy { var, kind: BoundTyKind::Anon }
1538 /// A `ProjectionPredicate` for an `ExistentialTraitRef`.
1539 #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug, TyEncodable, TyDecodable)]
1540 #[derive(HashStable, TypeFoldable)]
1541 pub struct ExistentialProjection<'tcx> {
1542 pub item_def_id: DefId,
1543 pub substs: SubstsRef<'tcx>,
1544 pub term: Term<'tcx>,
1547 pub type PolyExistentialProjection<'tcx> = Binder<'tcx, ExistentialProjection<'tcx>>;
1549 impl<'tcx> ExistentialProjection<'tcx> {
1550 /// Extracts the underlying existential trait reference from this projection.
1551 /// For example, if this is a projection of `exists T. <T as Iterator>::Item == X`,
1552 /// then this function would return an `exists T. T: Iterator` existential trait
1554 pub fn trait_ref(&self, tcx: TyCtxt<'tcx>) -> ty::ExistentialTraitRef<'tcx> {
1555 let def_id = tcx.associated_item(self.item_def_id).container.id();
1556 let subst_count = tcx.generics_of(def_id).count() - 1;
1557 let substs = tcx.intern_substs(&self.substs[..subst_count]);
1558 ty::ExistentialTraitRef { def_id, substs }
1561 pub fn with_self_ty(
1565 ) -> ty::ProjectionPredicate<'tcx> {
1566 // otherwise the escaping regions would be captured by the binders
1567 debug_assert!(!self_ty.has_escaping_bound_vars());
1569 ty::ProjectionPredicate {
1570 projection_ty: ty::ProjectionTy {
1571 item_def_id: self.item_def_id,
1572 substs: tcx.mk_substs_trait(self_ty, self.substs),
1578 pub fn erase_self_ty(
1580 projection_predicate: ty::ProjectionPredicate<'tcx>,
1582 // Assert there is a Self.
1583 projection_predicate.projection_ty.substs.type_at(0);
1586 item_def_id: projection_predicate.projection_ty.item_def_id,
1587 substs: tcx.intern_substs(&projection_predicate.projection_ty.substs[1..]),
1588 term: projection_predicate.term,
1593 impl<'tcx> PolyExistentialProjection<'tcx> {
1594 pub fn with_self_ty(
1598 ) -> ty::PolyProjectionPredicate<'tcx> {
1599 self.map_bound(|p| p.with_self_ty(tcx, self_ty))
1602 pub fn item_def_id(&self) -> DefId {
1603 self.skip_binder().item_def_id
1607 /// Region utilities
1609 /// Is this region named by the user?
1610 pub fn has_name(&self) -> bool {
1612 RegionKind::ReEarlyBound(ebr) => ebr.has_name(),
1613 RegionKind::ReLateBound(_, br) => br.kind.is_named(),
1614 RegionKind::ReFree(fr) => fr.bound_region.is_named(),
1615 RegionKind::ReStatic => true,
1616 RegionKind::ReVar(..) => false,
1617 RegionKind::RePlaceholder(placeholder) => placeholder.name.is_named(),
1618 RegionKind::ReEmpty(_) => false,
1619 RegionKind::ReErased => false,
1624 pub fn is_late_bound(&self) -> bool {
1625 matches!(*self, ty::ReLateBound(..))
1629 pub fn is_placeholder(&self) -> bool {
1630 matches!(*self, ty::RePlaceholder(..))
1634 pub fn bound_at_or_above_binder(&self, index: ty::DebruijnIndex) -> bool {
1636 ty::ReLateBound(debruijn, _) => debruijn >= index,
1641 pub fn type_flags(&self) -> TypeFlags {
1642 let mut flags = TypeFlags::empty();
1646 flags = flags | TypeFlags::HAS_FREE_REGIONS;
1647 flags = flags | TypeFlags::HAS_FREE_LOCAL_REGIONS;
1648 flags = flags | TypeFlags::HAS_RE_INFER;
1650 ty::RePlaceholder(..) => {
1651 flags = flags | TypeFlags::HAS_FREE_REGIONS;
1652 flags = flags | TypeFlags::HAS_FREE_LOCAL_REGIONS;
1653 flags = flags | TypeFlags::HAS_RE_PLACEHOLDER;
1655 ty::ReEarlyBound(..) => {
1656 flags = flags | TypeFlags::HAS_FREE_REGIONS;
1657 flags = flags | TypeFlags::HAS_FREE_LOCAL_REGIONS;
1658 flags = flags | TypeFlags::HAS_RE_PARAM;
1660 ty::ReFree { .. } => {
1661 flags = flags | TypeFlags::HAS_FREE_REGIONS;
1662 flags = flags | TypeFlags::HAS_FREE_LOCAL_REGIONS;
1664 ty::ReEmpty(_) | ty::ReStatic => {
1665 flags = flags | TypeFlags::HAS_FREE_REGIONS;
1667 ty::ReLateBound(..) => {
1668 flags = flags | TypeFlags::HAS_RE_LATE_BOUND;
1671 flags = flags | TypeFlags::HAS_RE_ERASED;
1675 debug!("type_flags({:?}) = {:?}", self, flags);
1680 /// Given an early-bound or free region, returns the `DefId` where it was bound.
1681 /// For example, consider the regions in this snippet of code:
1685 /// ^^ -- early bound, declared on an impl
1687 /// fn bar<'b, 'c>(x: &self, y: &'b u32, z: &'c u64) where 'static: 'c
1688 /// ^^ ^^ ^ anonymous, late-bound
1689 /// | early-bound, appears in where-clauses
1690 /// late-bound, appears only in fn args
1695 /// Here, `free_region_binding_scope('a)` would return the `DefId`
1696 /// of the impl, and for all the other highlighted regions, it
1697 /// would return the `DefId` of the function. In other cases (not shown), this
1698 /// function might return the `DefId` of a closure.
1699 pub fn free_region_binding_scope(&self, tcx: TyCtxt<'_>) -> DefId {
1701 ty::ReEarlyBound(br) => tcx.parent(br.def_id).unwrap(),
1702 ty::ReFree(fr) => fr.scope,
1703 _ => bug!("free_region_binding_scope invoked on inappropriate region: {:?}", self),
1709 impl<'tcx> TyS<'tcx> {
1711 pub fn kind(&self) -> &TyKind<'tcx> {
1716 pub fn flags(&self) -> TypeFlags {
1721 pub fn is_unit(&self) -> bool {
1723 Tuple(ref tys) => tys.is_empty(),
1729 pub fn is_never(&self) -> bool {
1730 matches!(self.kind(), Never)
1734 pub fn is_primitive(&self) -> bool {
1735 self.kind().is_primitive()
1739 pub fn is_adt(&self) -> bool {
1740 matches!(self.kind(), Adt(..))
1744 pub fn is_ref(&self) -> bool {
1745 matches!(self.kind(), Ref(..))
1749 pub fn is_ty_var(&self) -> bool {
1750 matches!(self.kind(), Infer(TyVar(_)))
1754 pub fn ty_vid(&self) -> Option<ty::TyVid> {
1756 &Infer(TyVar(vid)) => Some(vid),
1762 pub fn is_ty_infer(&self) -> bool {
1763 matches!(self.kind(), Infer(_))
1767 pub fn is_phantom_data(&self) -> bool {
1768 if let Adt(def, _) = self.kind() { def.is_phantom_data() } else { false }
1772 pub fn is_bool(&self) -> bool {
1773 *self.kind() == Bool
1776 /// Returns `true` if this type is a `str`.
1778 pub fn is_str(&self) -> bool {
1783 pub fn is_param(&self, index: u32) -> bool {
1785 ty::Param(ref data) => data.index == index,
1791 pub fn is_slice(&self) -> bool {
1793 RawPtr(TypeAndMut { ty, .. }) | Ref(_, ty, _) => matches!(ty.kind(), Slice(_) | Str),
1799 pub fn is_array(&self) -> bool {
1800 matches!(self.kind(), Array(..))
1804 pub fn is_simd(&self) -> bool {
1806 Adt(def, _) => def.repr.simd(),
1811 pub fn sequence_element_type(&self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> {
1813 Array(ty, _) | Slice(ty) => ty,
1814 Str => tcx.types.u8,
1815 _ => bug!("`sequence_element_type` called on non-sequence value: {}", self),
1819 pub fn expect_opaque_type(&self) -> ty::OpaqueTypeKey<'tcx> {
1820 match *self.kind() {
1821 Opaque(def_id, substs) => ty::OpaqueTypeKey { def_id, substs },
1822 _ => bug!("`expect_opaque_type` called on non-opaque type: {}", self),
1826 pub fn simd_size_and_type(&self, tcx: TyCtxt<'tcx>) -> (u64, Ty<'tcx>) {
1828 Adt(def, substs) => {
1829 assert!(def.repr.simd(), "`simd_size_and_type` called on non-SIMD type");
1830 let variant = def.non_enum_variant();
1831 let f0_ty = variant.fields[0].ty(tcx, substs);
1833 match f0_ty.kind() {
1834 // If the first field is an array, we assume it is the only field and its
1835 // elements are the SIMD components.
1836 Array(f0_elem_ty, f0_len) => {
1837 // FIXME(repr_simd): https://github.com/rust-lang/rust/pull/78863#discussion_r522784112
1838 // The way we evaluate the `N` in `[T; N]` here only works since we use
1839 // `simd_size_and_type` post-monomorphization. It will probably start to ICE
1840 // if we use it in generic code. See the `simd-array-trait` ui test.
1841 (f0_len.eval_usize(tcx, ParamEnv::empty()) as u64, f0_elem_ty)
1843 // Otherwise, the fields of this Adt are the SIMD components (and we assume they
1844 // all have the same type).
1845 _ => (variant.fields.len() as u64, f0_ty),
1848 _ => bug!("`simd_size_and_type` called on invalid type"),
1853 pub fn is_region_ptr(&self) -> bool {
1854 matches!(self.kind(), Ref(..))
1858 pub fn is_mutable_ptr(&self) -> bool {
1861 RawPtr(TypeAndMut { mutbl: hir::Mutability::Mut, .. })
1862 | Ref(_, _, hir::Mutability::Mut)
1866 /// Get the mutability of the reference or `None` when not a reference
1868 pub fn ref_mutability(&self) -> Option<hir::Mutability> {
1870 Ref(_, _, mutability) => Some(*mutability),
1876 pub fn is_unsafe_ptr(&self) -> bool {
1877 matches!(self.kind(), RawPtr(_))
1880 /// Tests if this is any kind of primitive pointer type (reference, raw pointer, fn pointer).
1882 pub fn is_any_ptr(&self) -> bool {
1883 self.is_region_ptr() || self.is_unsafe_ptr() || self.is_fn_ptr()
1887 pub fn is_box(&self) -> bool {
1889 Adt(def, _) => def.is_box(),
1894 /// Panics if called on any type other than `Box<T>`.
1895 pub fn boxed_ty(&self) -> Ty<'tcx> {
1897 Adt(def, substs) if def.is_box() => substs.type_at(0),
1898 _ => bug!("`boxed_ty` is called on non-box type {:?}", self),
1902 /// A scalar type is one that denotes an atomic datum, with no sub-components.
1903 /// (A RawPtr is scalar because it represents a non-managed pointer, so its
1904 /// contents are abstract to rustc.)
1906 pub fn is_scalar(&self) -> bool {
1916 | Infer(IntVar(_) | FloatVar(_))
1920 /// Returns `true` if this type is a floating point type.
1922 pub fn is_floating_point(&self) -> bool {
1923 matches!(self.kind(), Float(_) | Infer(FloatVar(_)))
1927 pub fn is_trait(&self) -> bool {
1928 matches!(self.kind(), Dynamic(..))
1932 pub fn is_enum(&self) -> bool {
1933 matches!(self.kind(), Adt(adt_def, _) if adt_def.is_enum())
1937 pub fn is_union(&self) -> bool {
1938 matches!(self.kind(), Adt(adt_def, _) if adt_def.is_union())
1942 pub fn is_closure(&self) -> bool {
1943 matches!(self.kind(), Closure(..))
1947 pub fn is_generator(&self) -> bool {
1948 matches!(self.kind(), Generator(..))
1952 pub fn is_integral(&self) -> bool {
1953 matches!(self.kind(), Infer(IntVar(_)) | Int(_) | Uint(_))
1957 pub fn is_fresh_ty(&self) -> bool {
1958 matches!(self.kind(), Infer(FreshTy(_)))
1962 pub fn is_fresh(&self) -> bool {
1963 matches!(self.kind(), Infer(FreshTy(_) | FreshIntTy(_) | FreshFloatTy(_)))
1967 pub fn is_char(&self) -> bool {
1968 matches!(self.kind(), Char)
1972 pub fn is_numeric(&self) -> bool {
1973 self.is_integral() || self.is_floating_point()
1977 pub fn is_signed(&self) -> bool {
1978 matches!(self.kind(), Int(_))
1982 pub fn is_ptr_sized_integral(&self) -> bool {
1983 matches!(self.kind(), Int(ty::IntTy::Isize) | Uint(ty::UintTy::Usize))
1987 pub fn has_concrete_skeleton(&self) -> bool {
1988 !matches!(self.kind(), Param(_) | Infer(_) | Error(_))
1991 /// Returns the type and mutability of `*ty`.
1993 /// The parameter `explicit` indicates if this is an *explicit* dereference.
1994 /// Some types -- notably unsafe ptrs -- can only be dereferenced explicitly.
1995 pub fn builtin_deref(&self, explicit: bool) -> Option<TypeAndMut<'tcx>> {
1997 Adt(def, _) if def.is_box() => {
1998 Some(TypeAndMut { ty: self.boxed_ty(), mutbl: hir::Mutability::Not })
2000 Ref(_, ty, mutbl) => Some(TypeAndMut { ty, mutbl: *mutbl }),
2001 RawPtr(mt) if explicit => Some(*mt),
2006 /// Returns the type of `ty[i]`.
2007 pub fn builtin_index(&self) -> Option<Ty<'tcx>> {
2009 Array(ty, _) | Slice(ty) => Some(ty),
2014 pub fn fn_sig(&self, tcx: TyCtxt<'tcx>) -> PolyFnSig<'tcx> {
2016 FnDef(def_id, substs) => tcx.fn_sig(*def_id).subst(tcx, substs),
2019 // ignore errors (#54954)
2020 ty::Binder::dummy(FnSig::fake())
2022 Closure(..) => bug!(
2023 "to get the signature of a closure, use `substs.as_closure().sig()` not `fn_sig()`",
2025 _ => bug!("Ty::fn_sig() called on non-fn type: {:?}", self),
2030 pub fn is_fn(&self) -> bool {
2031 matches!(self.kind(), FnDef(..) | FnPtr(_))
2035 pub fn is_fn_ptr(&self) -> bool {
2036 matches!(self.kind(), FnPtr(_))
2040 pub fn is_impl_trait(&self) -> bool {
2041 matches!(self.kind(), Opaque(..))
2045 pub fn ty_adt_def(&self) -> Option<&'tcx AdtDef> {
2047 Adt(adt, _) => Some(adt),
2052 /// Iterates over tuple fields.
2053 /// Panics when called on anything but a tuple.
2054 pub fn tuple_fields(&self) -> impl DoubleEndedIterator<Item = Ty<'tcx>> {
2056 Tuple(substs) => substs.iter().map(|field| field.expect_ty()),
2057 _ => bug!("tuple_fields called on non-tuple"),
2061 /// Get the `i`-th element of a tuple.
2062 /// Panics when called on anything but a tuple.
2063 pub fn tuple_element_ty(&self, i: usize) -> Option<Ty<'tcx>> {
2065 Tuple(substs) => substs.iter().nth(i).map(|field| field.expect_ty()),
2066 _ => bug!("tuple_fields called on non-tuple"),
2070 /// If the type contains variants, returns the valid range of variant indices.
2072 // FIXME: This requires the optimized MIR in the case of generators.
2074 pub fn variant_range(&self, tcx: TyCtxt<'tcx>) -> Option<Range<VariantIdx>> {
2076 TyKind::Adt(adt, _) => Some(adt.variant_range()),
2077 TyKind::Generator(def_id, substs, _) => {
2078 Some(substs.as_generator().variant_range(*def_id, tcx))
2084 /// If the type contains variants, returns the variant for `variant_index`.
2085 /// Panics if `variant_index` is out of range.
2087 // FIXME: This requires the optimized MIR in the case of generators.
2089 pub fn discriminant_for_variant(
2092 variant_index: VariantIdx,
2093 ) -> Option<Discr<'tcx>> {
2095 TyKind::Adt(adt, _) if adt.variants.is_empty() => {
2096 // This can actually happen during CTFE, see
2097 // https://github.com/rust-lang/rust/issues/89765.
2100 TyKind::Adt(adt, _) if adt.is_enum() => {
2101 Some(adt.discriminant_for_variant(tcx, variant_index))
2103 TyKind::Generator(def_id, substs, _) => {
2104 Some(substs.as_generator().discriminant_for_variant(*def_id, tcx, variant_index))
2110 /// Returns the type of the discriminant of this type.
2111 pub fn discriminant_ty(&'tcx self, tcx: TyCtxt<'tcx>) -> Ty<'tcx> {
2113 ty::Adt(adt, _) if adt.is_enum() => adt.repr.discr_type().to_ty(tcx),
2114 ty::Generator(_, substs, _) => substs.as_generator().discr_ty(tcx),
2116 ty::Param(_) | ty::Projection(_) | ty::Opaque(..) | ty::Infer(ty::TyVar(_)) => {
2117 let assoc_items = tcx.associated_item_def_ids(
2118 tcx.require_lang_item(hir::LangItem::DiscriminantKind, None),
2120 tcx.mk_projection(assoc_items[0], tcx.intern_substs(&[self.into()]))
2139 | ty::GeneratorWitness(..)
2143 | ty::Infer(IntVar(_) | FloatVar(_)) => tcx.types.u8,
2146 | ty::Placeholder(_)
2147 | ty::Infer(FreshTy(_) | ty::FreshIntTy(_) | ty::FreshFloatTy(_)) => {
2148 bug!("`discriminant_ty` applied to unexpected type: {:?}", self)
2153 /// Returns the type of metadata for (potentially fat) pointers to this type.
2154 pub fn ptr_metadata_ty(
2157 normalize: impl FnMut(Ty<'tcx>) -> Ty<'tcx>,
2159 let tail = tcx.struct_tail_with_normalize(self, normalize);
2162 ty::Infer(ty::IntVar(_) | ty::FloatVar(_))
2173 | ty::GeneratorWitness(..)
2179 // If returned by `struct_tail_without_normalization` this is a unit struct
2180 // without any fields, or not a struct, and therefore is Sized.
2182 // If returned by `struct_tail_without_normalization` this is the empty tuple,
2183 // a.k.a. unit type, which is Sized
2184 | ty::Tuple(..) => tcx.types.unit,
2186 ty::Str | ty::Slice(_) => tcx.types.usize,
2187 ty::Dynamic(..) => {
2188 let dyn_metadata = tcx.lang_items().dyn_metadata().unwrap();
2189 tcx.type_of(dyn_metadata).subst(tcx, &[tail.into()])
2195 | ty::Infer(ty::TyVar(_))
2197 | ty::Placeholder(..)
2198 | ty::Infer(ty::FreshTy(_) | ty::FreshIntTy(_) | ty::FreshFloatTy(_)) => {
2199 bug!("`ptr_metadata_ty` applied to unexpected type: {:?}", tail)
2204 /// When we create a closure, we record its kind (i.e., what trait
2205 /// it implements) into its `ClosureSubsts` using a type
2206 /// parameter. This is kind of a phantom type, except that the
2207 /// most convenient thing for us to are the integral types. This
2208 /// function converts such a special type into the closure
2209 /// kind. To go the other way, use
2210 /// `tcx.closure_kind_ty(closure_kind)`.
2212 /// Note that during type checking, we use an inference variable
2213 /// to represent the closure kind, because it has not yet been
2214 /// inferred. Once upvar inference (in `rustc_typeck/src/check/upvar.rs`)
2215 /// is complete, that type variable will be unified.
2216 pub fn to_opt_closure_kind(&self) -> Option<ty::ClosureKind> {
2218 Int(int_ty) => match int_ty {
2219 ty::IntTy::I8 => Some(ty::ClosureKind::Fn),
2220 ty::IntTy::I16 => Some(ty::ClosureKind::FnMut),
2221 ty::IntTy::I32 => Some(ty::ClosureKind::FnOnce),
2222 _ => bug!("cannot convert type `{:?}` to a closure kind", self),
2225 // "Bound" types appear in canonical queries when the
2226 // closure type is not yet known
2227 Bound(..) | Infer(_) => None,
2229 Error(_) => Some(ty::ClosureKind::Fn),
2231 _ => bug!("cannot convert type `{:?}` to a closure kind", self),
2235 /// Fast path helper for testing if a type is `Sized`.
2237 /// Returning true means the type is known to be sized. Returning
2238 /// `false` means nothing -- could be sized, might not be.
2240 /// Note that we could never rely on the fact that a type such as `[_]` is
2241 /// trivially `!Sized` because we could be in a type environment with a
2242 /// bound such as `[_]: Copy`. A function with such a bound obviously never
2243 /// can be called, but that doesn't mean it shouldn't typecheck. This is why
2244 /// this method doesn't return `Option<bool>`.
2245 pub fn is_trivially_sized(&self, tcx: TyCtxt<'tcx>) -> bool {
2247 ty::Infer(ty::IntVar(_) | ty::FloatVar(_))
2258 | ty::GeneratorWitness(..)
2262 | ty::Error(_) => true,
2264 ty::Str | ty::Slice(_) | ty::Dynamic(..) | ty::Foreign(..) => false,
2266 ty::Tuple(tys) => tys.iter().all(|ty| ty.expect_ty().is_trivially_sized(tcx)),
2268 ty::Adt(def, _substs) => def.sized_constraint(tcx).is_empty(),
2270 ty::Projection(_) | ty::Param(_) | ty::Opaque(..) => false,
2272 ty::Infer(ty::TyVar(_)) => false,
2275 | ty::Placeholder(..)
2276 | ty::Infer(ty::FreshTy(_) | ty::FreshIntTy(_) | ty::FreshFloatTy(_)) => {
2277 bug!("`is_trivially_sized` applied to unexpected type: {:?}", self)
2283 /// Extra information about why we ended up with a particular variance.
2284 /// This is only used to add more information to error messages, and
2285 /// has no effect on soundness. While choosing the 'wrong' `VarianceDiagInfo`
2286 /// may lead to confusing notes in error messages, it will never cause
2287 /// a miscompilation or unsoundness.
2289 /// When in doubt, use `VarianceDiagInfo::default()`
2290 #[derive(Copy, Clone, Debug, Default, PartialEq, Eq, PartialOrd, Ord)]
2291 pub enum VarianceDiagInfo<'tcx> {
2292 /// No additional information - this is the default.
2293 /// We will not add any additional information to error messages.
2296 /// We switched our variance because a generic argument occurs inside
2297 /// the invariant generic argument of another type.
2299 /// The generic type containing the generic parameter
2300 /// that changes the variance (e.g. `*mut T`, `MyStruct<T>`)
2302 /// The index of the generic parameter being used
2303 /// (e.g. `0` for `*mut T`, `1` for `MyStruct<'CovariantParam, 'InvariantParam>`)
2308 impl<'tcx> VarianceDiagInfo<'tcx> {
2309 /// Mirrors `Variance::xform` - used to 'combine' the existing
2310 /// and new `VarianceDiagInfo`s when our variance changes.
2311 pub fn xform(self, other: VarianceDiagInfo<'tcx>) -> VarianceDiagInfo<'tcx> {
2312 // For now, just use the first `VarianceDiagInfo::Invariant` that we see
2314 VarianceDiagInfo::None => other,
2315 VarianceDiagInfo::Invariant { .. } => self,