rustc_middle/ty/inhabitedness/
mod.rs

1//! This module contains logic for determining whether a type is inhabited or
2//! uninhabited. The [`InhabitedPredicate`] type captures the minimum
3//! information needed to determine whether a type is inhabited given a
4//! `ParamEnv` and module ID.
5//!
6//! # Example
7//! ```rust
8//! #![feature(never_type)]
9//! mod a {
10//!     pub mod b {
11//!         pub struct SecretlyUninhabited {
12//!             _priv: !,
13//!         }
14//!     }
15//! }
16//!
17//! mod c {
18//!     enum Void {}
19//!     pub struct AlsoSecretlyUninhabited {
20//!         _priv: Void,
21//!     }
22//!     mod d {
23//!     }
24//! }
25//!
26//! struct Foo {
27//!     x: a::b::SecretlyUninhabited,
28//!     y: c::AlsoSecretlyUninhabited,
29//! }
30//! ```
31//! In this code, the type `Foo` will only be visibly uninhabited inside the
32//! modules `b`, `c` and `d`. Calling `inhabited_predicate` on `Foo` will
33//! return `NotInModule(b) AND NotInModule(c)`.
34//!
35//! We need this information for pattern-matching on `Foo` or types that contain
36//! `Foo`.
37//!
38//! # Example
39//! ```ignore(illustrative)
40//! let foo_result: Result<T, Foo> = ... ;
41//! let Ok(t) = foo_result;
42//! ```
43//! This code should only compile in modules where the uninhabitedness of `Foo`
44//! is visible.
45
46use rustc_span::sym;
47use rustc_type_ir::TyKind::*;
48use tracing::instrument;
49
50use crate::query::Providers;
51use crate::ty::context::TyCtxt;
52use crate::ty::{self, DefId, Ty, TypeVisitableExt, VariantDef, Visibility};
53
54pub mod inhabited_predicate;
55
56pub use inhabited_predicate::InhabitedPredicate;
57
58pub(crate) fn provide(providers: &mut Providers) {
59    *providers = Providers { inhabited_predicate_adt, inhabited_predicate_type, ..*providers };
60}
61
62/// Returns an `InhabitedPredicate` that is generic over type parameters and
63/// requires calling [`InhabitedPredicate::instantiate`]
64fn inhabited_predicate_adt(tcx: TyCtxt<'_>, def_id: DefId) -> InhabitedPredicate<'_> {
65    if let Some(def_id) = def_id.as_local() {
66        if matches!(tcx.representability(def_id), ty::Representability::Infinite(_)) {
67            return InhabitedPredicate::True;
68        }
69    }
70    let adt = tcx.adt_def(def_id);
71    InhabitedPredicate::any(
72        tcx,
73        adt.variants().iter().map(|variant| variant.inhabited_predicate(tcx, adt)),
74    )
75}
76
77impl<'tcx> VariantDef {
78    /// Calculates the forest of `DefId`s from which this variant is visibly uninhabited.
79    pub fn inhabited_predicate(
80        &self,
81        tcx: TyCtxt<'tcx>,
82        adt: ty::AdtDef<'_>,
83    ) -> InhabitedPredicate<'tcx> {
84        debug_assert!(!adt.is_union());
85        InhabitedPredicate::all(
86            tcx,
87            self.fields.iter().map(|field| {
88                // Unstable fields are always considered to be inhabited. In the future,
89                // this could be extended to be conditional on the field being unstable
90                // only within the module that's querying the inhabitedness, like:
91                //     `let pred = pred.or(InhabitedPredicate::IsUnstable(field.did));`
92                // but this is unnecessary for now, since it would only affect nightly-only
93                // code or code within the standard library itself.
94                // HACK: We filter out `rustc_private` fields since with the flag
95                // `-Zforce-unstable-if-unmarked` we consider all unmarked fields to be
96                // unstable when building the compiler.
97                if tcx
98                    .lookup_stability(field.did)
99                    .is_some_and(|stab| stab.is_unstable() && stab.feature != sym::rustc_private)
100                {
101                    return InhabitedPredicate::True;
102                }
103                let pred = tcx.type_of(field.did).instantiate_identity().inhabited_predicate(tcx);
104                if adt.is_enum() {
105                    return pred;
106                }
107                match field.vis {
108                    Visibility::Public => pred,
109                    Visibility::Restricted(from) => {
110                        pred.or(tcx, InhabitedPredicate::NotInModule(from))
111                    }
112                }
113            }),
114        )
115    }
116}
117
118impl<'tcx> Ty<'tcx> {
119    #[instrument(level = "debug", skip(tcx), ret)]
120    pub fn inhabited_predicate(self, tcx: TyCtxt<'tcx>) -> InhabitedPredicate<'tcx> {
121        debug_assert!(!self.has_infer());
122        match self.kind() {
123            // For now, unions are always considered inhabited
124            Adt(adt, _) if adt.is_union() => InhabitedPredicate::True,
125            // Non-exhaustive ADTs from other crates are always considered inhabited
126            Adt(adt, _) if adt.variant_list_has_applicable_non_exhaustive() => {
127                InhabitedPredicate::True
128            }
129            Never => InhabitedPredicate::False,
130            Param(_) | Alias(ty::Inherent | ty::Projection | ty::Free, _) => {
131                InhabitedPredicate::GenericType(self)
132            }
133            Alias(ty::Opaque, alias_ty) => {
134                match alias_ty.def_id.as_local() {
135                    // Foreign opaque is considered inhabited.
136                    None => InhabitedPredicate::True,
137                    // Local opaque type may possibly be revealed.
138                    Some(local_def_id) => {
139                        let key = ty::OpaqueTypeKey { def_id: local_def_id, args: alias_ty.args };
140                        InhabitedPredicate::OpaqueType(key)
141                    }
142                }
143            }
144            Tuple(tys) if tys.is_empty() => InhabitedPredicate::True,
145            // use a query for more complex cases
146            Adt(..) | Array(..) | Tuple(_) => tcx.inhabited_predicate_type(self),
147            // references and other types are inhabited
148            _ => InhabitedPredicate::True,
149        }
150    }
151
152    /// Checks whether a type is visibly uninhabited from a particular module.
153    ///
154    /// # Example
155    /// ```
156    /// #![feature(never_type)]
157    /// # fn main() {}
158    /// enum Void {}
159    /// mod a {
160    ///     pub mod b {
161    ///         pub struct SecretlyUninhabited {
162    ///             _priv: !,
163    ///         }
164    ///     }
165    /// }
166    ///
167    /// mod c {
168    ///     use super::Void;
169    ///     pub struct AlsoSecretlyUninhabited {
170    ///         _priv: Void,
171    ///     }
172    ///     mod d {
173    ///     }
174    /// }
175    ///
176    /// struct Foo {
177    ///     x: a::b::SecretlyUninhabited,
178    ///     y: c::AlsoSecretlyUninhabited,
179    /// }
180    /// ```
181    /// In this code, the type `Foo` will only be visibly uninhabited inside the
182    /// modules b, c and d. This effects pattern-matching on `Foo` or types that
183    /// contain `Foo`.
184    ///
185    /// # Example
186    /// ```ignore (illustrative)
187    /// let foo_result: Result<T, Foo> = ... ;
188    /// let Ok(t) = foo_result;
189    /// ```
190    /// This code should only compile in modules where the uninhabitedness of Foo is
191    /// visible.
192    pub fn is_inhabited_from(
193        self,
194        tcx: TyCtxt<'tcx>,
195        module: DefId,
196        typing_env: ty::TypingEnv<'tcx>,
197    ) -> bool {
198        self.inhabited_predicate(tcx).apply(tcx, typing_env, module)
199    }
200
201    /// Returns true if the type is uninhabited without regard to visibility
202    pub fn is_privately_uninhabited(
203        self,
204        tcx: TyCtxt<'tcx>,
205        typing_env: ty::TypingEnv<'tcx>,
206    ) -> bool {
207        !self.inhabited_predicate(tcx).apply_ignore_module(tcx, typing_env)
208    }
209}
210
211/// N.B. this query should only be called through `Ty::inhabited_predicate`
212fn inhabited_predicate_type<'tcx>(tcx: TyCtxt<'tcx>, ty: Ty<'tcx>) -> InhabitedPredicate<'tcx> {
213    match *ty.kind() {
214        Adt(adt, args) => tcx.inhabited_predicate_adt(adt.did()).instantiate(tcx, args),
215
216        Tuple(tys) => {
217            InhabitedPredicate::all(tcx, tys.iter().map(|ty| ty.inhabited_predicate(tcx)))
218        }
219
220        // If we can evaluate the array length before having a `ParamEnv`, then
221        // we can simplify the predicate. This is an optimization.
222        Array(ty, len) => match len.try_to_target_usize(tcx) {
223            Some(0) => InhabitedPredicate::True,
224            Some(1..) => ty.inhabited_predicate(tcx),
225            None => ty.inhabited_predicate(tcx).or(tcx, InhabitedPredicate::ConstIsZero(len)),
226        },
227
228        _ => bug!("unexpected TyKind, use `Ty::inhabited_predicate`"),
229    }
230}